检索结果-内蒙古大学图书馆

TechRxiv 2022年

作者： Lin, Hao Wang, Chun-Dong Gao, Hao-Yu School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Intelligence Computing Novel Software Technology Ministry of Education Tianjin China Engineering Research Center of Learning-Based Intelligent System Ministry of Education Tianjin China College of Data Science and Application Inner Mongolia University of Technology Hohhot China

Cybersecurity researchers always ignore the "people" behind the issues when dealing with cyberspace security issues. The human and technological aspects of cyberspace security must be simultaneously addressed to enable a secure cyber environment. Social engineering is a discipline whose research object is people, and the combination of social engineering and cyberspace security can provide new solution ideas for lots of cyberspace security issues. This paper attempts to answer the question —— "How to solve cyberspace security issues via social engineering?" We briefly review existing frameworks for social engineering attacks and propose a novel, recursive, and iterative framework for social engineering attacks in cyberspace. The existing research achievements of combination of social engineering and cyberspace security were reviewed in the order of cyber personality, hacker psychology, human flesh search, and social engineering defense. To answer this question, we summarized four "guidelines" for using social engineering. Finally, we look ahead, give our thoughts, and discuss answers of the question and future research. It is aimed at getting more researchers of cyberspace security and social science to pay attention to this field. © 2022, CC BY.

关键词： Cybersecurity

来源：评论

学校读者我要写书评

暂无评论

Sample hardness based gradient loss for long-tailed cervical cell detection

arXiv

引用

arXiv 2022年

作者： Liu, Minmin Li, Xuechen Gao, Xiangbo Chen, Junliang Shen, Linlin Wu, Huisi Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University China Shenzhen Institute of Artificial Intelligence of Robotics of Society Shenzhen China Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen518060 China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen518060 China University of California Irvine United States

Due to the difficulty of cancer samples collection and annotation, cervical cancer datasets usually exhibit a long-tailed data distribution. When training a detector to detect the cancer cells in a WSI (Whole Slice Image) image captured from the TCT (Thinprep Cytology Test) specimen, head categories (e.g. normal cells and inflammatory cells) typically have a much larger number of samples than tail categories (e.g. cancer cells). Most existing state-of-the-art long-tailed learning methods in object detection focus on category distribution statistics to solve the problem in the long-tailed scenario, without considering the "hardness" of each sample. To address this problem, in this work we propose a Grad-Libra Loss that leverages the gradients to dynamically calibrate the degree of hardness of each sample for different categories, and re-balance the gradients of positive and negative samples. Our loss can thus help the detector to put more emphasis on those hard samples in both head and tail categories. Extensive experiments on a long-tailed TCT WSI image dataset show that the mainstream detectors, e.g. RepPoints, FCOS, ATSS, YOLOF, etc. trained using our proposed Gradient-Libra Loss, achieved much higher (7.8%) mAP than that trained using cross-entropy classification loss. Copyright © 2022, The Authors. All rights reserved.

关键词： Cytology

来源：评论

学校读者我要写书评

暂无评论

Active interaction strategy generation for human-robot collaboration based on trust

引用

Visual computing for industry, biomedicine, and art 2025年第1期8卷 16页

作者： Yujie Guo Pengfei Yi Xiaopeng Wei Dongsheng Zhou Key Laboratory of Advanced Design and Intelligent Computing (Ministry of Education) School of Software Engineering Dalian University Dalian 116622 China. School of Computer Science and Technology Dalian University of Technology Dalian 116024 China. Key Laboratory of Advanced Design and Intelligent Computing (Ministry of Education) School of Software Engineering Dalian University Dalian 116622 China. zhouds@***. School of Computer Science and Technology Dalian University of Technology Dalian 116024 China. zhouds@***.

In human-robot collaborative tasks, human trust in robots can reduce resistance to them, thereby increasing the success rate of task execution. However, most existing studies have focused on improving the success rate of human-robot collaboration (HRC) rather than on enhancing collaboration efficiency. To improve the overall collaboration efficiency while maintaining a high success rate, this study proposes an active interaction strategy generation for HRC based on trust. First, a trust-based optimal robot strategy generation method was proposed to generate the robot's optimal strategy in a HRC. This method employs a tree to model the HRC process under different robot strategies and calculates the optimal strategy based on the modeling results for the robot to execute. Second, the robot's performance was evaluated to calculate human's trust in a robot. A robot performance evaluation method based on a visual language model was also proposed. The evaluation results were input into the trust model to compute human's current trust. Finally, each time an object operation was completed, the robot's performance evaluation and optimal strategy generation methods worked together to automatically generate the optimal strategy of the robot for the next step until the entire collaborative task was completed. The experimental results demonstrates that this method significantly improve collaborative efficiency, achieving a high success rate in HRC.

关键词： Human-robot collaboration Human-robot trust Tree Visual language model

来源：评论

学校读者我要写书评

暂无评论

Algebraic analysis and control of networked opacity with bounded communication delays

Algebraic analysis and control of networked opacity with bou...

引用

第40届中国控制会议

作者： Qian Xu Zhipeng Zhang Chengyi Xia Zengqiang Chen Tianjin Key Laboratory of Intelligence Computing and Novel Software Technology Tianjin University of Technology Engineering Research Center of Learning-Based Intelligent System Ministry of Education College of Artificial Intelligence Nankai University

Networked finite state machine takes the delay factor into consideration, and its security has become an significant research topic. In this paper, we explore the impact of bounded communication delays on networked opacity of finite state machine from an algebraic point. Firstly, by making use of Boolean semi-tensor product（Boolean STP）, we propose an algebraic equation to characterize the current dynamics with bounded observation delays. Subsequently, we give the verification criterion for networked opacity, and calculate the delayed dynamics by introducing the state reachability matrix. Meanwhile, we investigate the effect of bound number on the opacity-enforcement problem, and compute the minimum bound of communication delay to ensure the state opacity property. Finally, a numerical example is provided to demonstrate the results.

关键词： Semi-tensor product（STP） of matrices finite state machine state opacity observation delays

来源：评论

学校读者我要写书评

暂无评论

Joint Deep Matching Model of OCT Retinal Layer Segmentation

引用

Computers, Materials & Continua 2020年第6期63卷 1485-1498页

作者： Mei Yang Yuanjie Zheng Weikuan Jia Yunlong He Tongtong Che Jinyu Cong School of Information Science and Engineering at Shandong Normal University Jinan250358China Key Lab of Intelligent Computing and Information Security in Universities of Shandong Shandong Provincial Key Laboratory for Novel Distributed Computer Software TechnologyInstitute of Biomedical SciencesShandong Normal UniversityJinan250358China INSA Lyon University of LyonCNRSInsermVilleurbanne69621 CedexFrance

Optical Coherence Tomography(OCT)is very important in medicine and provide useful diagnostic *** retinal layer thicknesses plays a vital role in pathophysiologic factors of many ocular *** the existing retinal layer segmentation approaches,learning or deep learning-based methods belong to the ***,most of these techniques rely on manual-marked layers and the performances are limited due to the image *** order to overcome this limitation,we build a framework based on gray value curve matching,which uses depth learning to match the curve for semi-automatic segmentation of retinal layers from *** depth convolution network learns the column correspondence in the OCT image *** whole OCT image participates in the depth convolution neural network operation,compares the gray value of each column,and matches the gray value sequence of the transformation column and the next *** this algorithm,when a boundary point is manually specified,we can accurately segment the boundary between retinal *** experimental results obtained from a 54-subjects database of both normal healthy eyes and affected eyes demonstrate the superior performances of our approach.

关键词： OCT retinal segmentation deep learning 1D convolution

来源：评论

学校读者我要写书评

暂无评论

A Stepwise Path Selection Scheme Based on Multiple QoS Parameters Evaluation in SDN 17th

A Stepwise Path Selection Scheme Based on Multiple QoS Param...

引用

17th EAI International Conference on Collaborative computing: Networking, Applications, and Worksharing, CollaborateCom 2021

作者： Liu, Lin Zhou, Jian-Tao Xing, Hai-Feng Guo, Xiao-Yong College of Computer Science Ecological Big Data Engineering Research Center of the Ministry of Education Cloud Computing and Service Software Engineering Laboratory of Inner Mongolia Autonomous Region National and Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Social Computing and Data Processing Key Laboratory of Inner Mongolia Autonomous Region Big Data Analysis Technology Engineering Research Center of Inner Mongolia Autonomous Region Inner Mongolia University Inner Mongolia Hohhot China College of Computer Science and Technology Inner Mongolia Normal University Inner Mongolia Hohhot China College of Computer Information and Management Inner Mongolia University of Finance and Economics Inner Mongolia Hohhot China

ISBN: (纸本)9783030926342

Nowadays, the best-effort service can not guarantee the quality of service (QoS) for all kinds of services. QoS routing is an important method to guarantee QoS requirements. It involves path selection for flows based on the current network status and the performance criteria of the service requirements. However, it is difficult for proposed solutions to obtain all the available paths owing to not fully considering all the QoS parameters of paths. In this paper, we propose SWQoS, a novel, universal, and stepwise QoS guarantee scheme based on multiple QoS parameter evaluation for selecting the available paths including preferred paths, satisfied paths and reluctant paths in SDN. The experiments show that SWQoS can select all the available paths that meet the performance criteria of the service requirements and have better QoS parameter performance compared with other path selection methods. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Bit-Wise Differential Coding (HBDC) of Point Cloud Attributes

Hierarchical Bit-Wise Differential Coding (HBDC) of Point Cl...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Yan Huang Bin Wang C.-C. Jay Kuo Hui Yuan Jingliang Peng School of Software Shandong Universtiy University of Southern California School of Control Science and Engineering Shandong Universtiy Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan School of Information Science and Engineering University of Jinan

Targeting both computing and coding efficiencies, we propose in this work a novel hierarchical bit-wise differential coding scheme to compress point cloud attributes. The encoder firstly quantizes and organizes the points into an octree structure and, for each internal node, picks its attribute(s) from a child named source child. Next, the encoder conducts a top-down scanning of the hierarchy. For each node with more than one child, it computes the bit-wise attribute difference between the current node and each non-source child by exclusive-OR and encodes the difference with an arithmetic coder. Further, a table look-up approach is proposed to accelerate the online source child identification. The proposed scheme produces superior computing and coding efficiencies for lossless point cloud attribute compression, outperforming the MPEG benchmark coders by large margins in our experiments.

关键词： Three-dimensional displays Image color analysis Conferences Octrees Transform coding Benchmark testing Signal processing

来源：评论

学校读者我要写书评

暂无评论

A Two-phase Prototypical Network Model for Incremental Few-shot Relation Classification 28

A Two-phase Prototypical Network Model for Incremental Few-s...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Ren, Haopeng Cai, Yi Chen, Xiaofeng Wang, Guohua Li, Qing School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781952148279

Relation Classification (RC) plays an important role in natural language processing (NLP). Current conventional supervised and distantly supervised RC models always make a closed-world assumption which ignores the emergence of novel relations in an open environment. To incrementally recognize the novel relations, current two solutions (i.e, re-training and lifelong learning) are designed but suffer from the lack of large-scale labeled data for novel relations. Meanwhile, prototypical network enjoys better performance on both fields of deep supervised learning and few-shot learning. However, it still suffers from the incompatible feature embedding problem when the novel relations come in. Motivated by them, we propose a two-phase prototypical network with prototype attention alignment and triplet loss to dynamically recognize the novel relations with a few support instances meanwhile without catastrophic forgetting. Extensive experiments are conducted to evaluate the effectiveness of our proposed model. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Group-wise Inhibition based Feature Regularization for Robust Classification

Group-wise Inhibition based Feature Regularization for Robus...

引用

International Conference on Computer Vision (ICCV)

作者： Haozhe Liu Haoqian Wu Weicheng Xie Feng Liu Linlin Shen Computer Vision Institute College of Computer Science and Software Engineering SZU Branch Shenzhen Institute of Artificial Intelligence and Robotics for Society National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen University Shenzhen China

The convolutional neural network (CNN) is vulnerable to degraded images with even very small variations (e.g. corrupted and adversarial samples). One of the possible reasons is that CNN pays more attention to the most discriminative regions, but ignores the auxiliary features when learning, leading to the lack of feature diversity for final judgment. In our method, we propose to dynamically suppress significant activation values of CNN by group-wise inhibition, but not fixedly or randomly handle them when training. The feature maps with different activation distribution are then processed separately to take the feature independence into account. CNN is finally guided to learn richer discriminative features hierarchically for robust classification according to the proposed regularization. Our method is comprehensively evaluated under multiple settings, including classification against corruptions, adversarial attacks and low data regime. Extensive experimental results show that the proposed method can achieve significant improvements in terms of both robustness and generalization performances, when compared with the state-of-the-art methods. Code is available at https://***/LinusWu/TENET_Training.

关键词： Training Computer vision Codes Heuristic algorithms Robustness Classification algorithms Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

An intelligent Resource Scheduling Method with Edge Channel Deployment for BPM

An Intelligent Resource Scheduling Method with Edge Channel ...

引用

Symposia and Workshops on Ubiquitous, Autonomic and Trusted computing, UIC-ATC

作者： Bowen Liu Wanchun Dou Xiaokang Zhou Xuyun Zhang Lianyong Qi Fei Dai Chaochao Chen State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Faculty of Data Science Shiga University Hikone Japan Department of Computing Macquarie University Sydney Australia College of Computer and Software China University of Petroleum (East China) Qingdao China College of Big Data and Intelligent Engineering Southwest Forestry University Kunming China College of Computer Science and Technology Zhejiang University Hangzhou China

Edge computing is a novel computing paradigm that offers kinds of resources at the network edge. In edge computing, terminal users are connected to edge servers via the wireless network and there are various channels in each wireless link. These wireless channels are limited resource while different channel has different cost and service ability. The dynamic changes of users’ status make it harder to find an appropriate method to satisfy the BPM requirements of channel deployment. With this observation, it is a tricky challenge to make a trade-off between the system cost(rental price) and the service ability(number of users). In view of this challenge, an intelligent resource scheduling method, named EdgeIRS, is proposed in this paper. In the technical sense, the EdgeIRS method can accommodate most users at the edge with a minimum cost of deploying channel resources in an online way. Its performance is analyzed theoretically and the experiments verify the superiority of the method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：