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

12th International Conference on computer engineering and Networks, CENet 2022

作者： Lei, Suqin Deng, Xing Shao, Haijian Xia, Wang Department of Computer Jiangsu University of Science and Technology Jiangsu Zhenjiang212003 China College of Automation Key Laboratory of Ministry of Education of Complex Engineering System Measurement and Control Southeast University Jiangsu Nanjing210009 China School of Information Science and Technology Nantong University Nantong Jiangsu226019 China Department of Electrical and Computer Engineering National University of Singapore Singapore117583 Singapore

ISBN: (纸本)9789811969003

Breast cancer is one of the most common cancers among female diseases. Since the classification accuracy of pathological images is crucial to the diagnosis of breast cancer, in order to reduce the error of manual diagnosis and improve the automatic classification accuracy of pathological images, this paper proposes a high-accuracy breast cancer classification method based on multi-scale attention mechanism enhanced Res2Net. By constructing a multi-channel residual connection in the residual block, and introducing a convolutional attention mechanism to enhance the feature extraction ability of Res2Net, and using group convolution to replace part of the ordinary convolution. In addition, since the channel information interaction across groups cannot be realized in the group convolution, which reduces the feature extraction ability. In this paper, the channel shuffling operation is used to reorganize the feature maps after the group convolution to achieve the information interaction between different groups. The evaluation results on the BreaKHis dataset show that, the accuracy and precision of the method in this paper have reached 98.5% and 98.9% respectively, in binary classification of histopathological images compared with the benchmark method, and the advantages of recall rate and F1 value are also more obvious. © 2022, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

Write-Optimized B^(+) Tree Index Technology for Persistent Memory

引用

Journal of computer science & Technology 2021年第5期36卷 1037-1050页

作者： Rui-Xiang Ma Fei Wu Bu-Rong Dong Meng Zhang Wei-Jun Li Chang-Sheng Xie Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430070China Key Laboratory of Information Storage System Ministry of Education of ChinaWuhan 430070China Engineering Research Center of Data Storage Systems and Technology Huazhong University of Science and Technology Wuhan 430070China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430070China Shenzhen DAPU Microelectronics Co. LtdShenzhen 518116China

Due to its low latency,byte-addressable,non-volatile,and high density,persistent memory(PM)is expected to be used to design a high-performance storage ***,PM also has disadvantages such as limited endurance,thereby proposing challenges to traditional index technologies such as B(+)tree.B(+)tree is originally designed for dynamic random access memory(DRAM)-based or disk-based systems and has a large write amplification *** high write amplification is detrimental to a PM-based *** paper proposes WO-tree,a write-optimized B(+)tree for ***-tree adopts an unordered write mechanism for the leaf nodes,and the unordered write mechanism can reduce a large number of write operations caused by maintaining the entry order in the leaf *** the leaf node is split,WO-tree performs the cache line flushing operation after all write operations are completed,which can reduce frequent data flushing ***-tree adopts a partial logging mechanism and it only writes the log for the leaf *** inner node recognizes the data inconsistency by the read operation and the data can be recovered using the leaf node information,thereby significantly reducing the logging ***,WO-tree adopts a lock-free search for inner nodes,which reduces the locking overhead for concurrency *** evaluate WO-tree using the Yahoo!Cloud Serving Benchmark(YCSB)*** with traditional B(+)tree,wB-tree,and Fast-Fair,the number of cache line flushes caused by WO-tree insertion operations is reduced by 84.7%,22.2%,and 30.8%,respectively,and the execution time is reduced by 84.3%,27.3%,and 44.7%,respectively.

关键词： persist memory B^(+)tree write amplication consistency YCSB(Yahoo!Cloud Serving Benchmark)

来源：评论

学校读者我要写书评

暂无评论

A Study of Data Augmentation for Imbalance Problem in Network Traffic

A Study of Data Augmentation for Imbalance Problem in Networ...

引用

Blockchain Technology and Information Security (ICBCTIS), International Conference on

作者： Xu Wang Shimin Sun Li Han School of Computer Science and Engineering Tianjin University of Technology Tianjin China Tianjin Key Laboratory of Autonomous Intelligent Technology and System School of Software Tiangong University Tianjin China National Engineering Laboratory for Computer Virus Prevention and Control Technology Tianjin China

The complexity and diversity of smart grid systems increase the likelihood of anomalies in communications between devices in the system, and how these anomalies are detected is critical to the security of the grid system. However, the distribution of traffic types in the grid is often highly unbalanced, with the total amount of normal traffic data often far outweighing the anomalous data. This imbalance compromises the effectiveness of the detection model and poses a significant threat to the overall security of the grid. This paper improves on traditional conditional generation adversarial neural networks and designs a new approach to overcome this obstacle and enhance the security of smart grid systems. In the generator part, the spatial features of the data are captured by convolutional neural networks, and the temporal features of the data are captured by gated recurrent units. By integrating these two components into the generative network, we can generate synthetic data with both temporal and spatial features, thus enhancing the minority class samples. By incorporating the augmented minority data into the training process, the proposed approach enables the detection model to understand the distribution of features of the minority anomaly samples more accurately. This improved learning accuracy translates into improved model performance, resulting in higher detection rates for previously under-represented anomalies. In addition, our approach effectively addresses the inherent bias towards traffic types with higher flows typically observed in asymmetric datasets, thus providing a more equitable and comprehensive security solution for smart grid systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

DD-UNet: Densely Dilated U-Net for Curvilinear Structure Segmentation in Fundus Image

DD-UNet: Densely Dilated U-Net for Curvilinear Structure Seg...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Yindong Zhang Jie Chen Li Wang Miaohong Chen Guoming Zhang Jianqiang Li College of Computer Science and Software Engineering Shenzhen University China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China Shenzhen Eye Hospital China

Retinopathy of Prematurity (ROP) is a retina disorder that affects premature infants with lower weights. If the patient cannot get the treatment in time when the illness reaches the last stage, irreversible vision loss will be caused. Nevertheless, there has been relatively little consideration given to the segmentation of the ridge, the key clinical characteristic of the illness. Additionally, existing research has not adequately addressed several segmentation issues, such as fragmentary topology, class imbalance, and false positives. This paper proposes a Densely Dilated U-Net (DD-UNet) improved from U-Net to tackle these challenges. Furthermore, the post-processing techniques based on the spatial relationship between vessels and ridges, along with the relative pixel counts of ridges and false positive results is integrated to mitigate false positive results in the predicted ridge. To enhance the precision of thin vessel, a sliding window sampling method is introduced for refined training. Compared with the state-of-the-art models in medical image segmentation, DD-UNet performs well in curvilinear structure segmentation of fundus image. For instance, our DD-UNet outperforms the Attention U-Net by 6.26% in terms of sensitivity and exhibits a 1.85% higher dice score in ridge segmentation.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Robust Slot Filling Model based on LSTM and CRF for IoT Voice Interaction

A Robust Slot Filling Model based on LSTM and CRF for IoT Vo...

引用

2022 IEEE GLOBECOM Workshops, GC Wkshps 2022

作者： Jbene, Mourad Tigani, Smail Saadane, Rachid Chehri, Abdellah Laboratory Engineering system SIRC/LAGeS-EHTP Hassania School of Public Works Casablanca Morocco Euro-Med University Fes 51 Engineering Unit Euro-Med Research Center Morocco Royal Military College of Canada Department of Mathematics and Computer Science Kingston Canada

ISBN: (纸本)9781665459754

The Internet Of Things (IoT) is an emerging paradigm representing a network of infrastructure connecting different types of devices in different places. Recently, IoT-based Conversational systems gained more attention, providing users with a new human-computer interaction mode. These new systems allow users to interact with the IoT ecosystem through a virtual assistant. They also heavily rely on Natural Language Processing (NLP) techniques for intelligent and efficient communication. Understanding the user's needs is the first step toward a more humanized IoT interaction system. This can be achieved using Natural language understanding (NLU) modules. Slot Filling is one of the core sub-tasks in NLU. It is an active research area focusing on extracting attribute values from the user's utterance. In this study, we propose an LSTM-based model for slot filling. The model benefits from contextual embeddings extracted from the BERT transformer model, the attention mechanism, and the conditional random field (CRF) that is known to model strong dependence among adjacent tags in the output sequence. Experiments show that our model achieved competitive results on two widely used benchmark datasets. © 2022 IEEE.

关键词： Internet of things

来源：评论

学校读者我要写书评

暂无评论

BLDTS: Blockchain-based Lightweight Data Trusted Sharing Scheme for Internet of Vehicles

BLDTS: Blockchain-based Lightweight Data Trusted Sharing Sch...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Haoran Lin Zhongyuan Yu Guijuan Wang Anming Dong Xiang Tian School of Computer Science Qufu Normal University Rizhao China School of Information Science and Engineering Lanzhou University Lanzhou China Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Jinan China

ISBN: (数字)9798331513054

ISBN: (纸本)9798331513061

Ensuring safe and reliable data sharing is crucial for the development of Internet of Vehicles (IoV) technology. To provide a trusted data environment for IoV and enable traditional consensus algorithms to meet the high dynamic requirements of the IoV. In this article, we propose a blockchain-based data sharing scheme for IoV (BLDTS) to achieve secure and trusted sharing. First, we design a false information identification strategy that utilizes a bayesian inference model to determine the authenticity of shared data with the assistance of reputation value. Second, the Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS) is used to construct a novel lightweight consensus mechanism based on vehicle reputation values and traffic environment factors, and the nodes with high scores were selected as participants in the consensus, which can reduce the computational overhead. Finally, experimental results show that our scheme has advantages in improving the accuracy of false message identification and consensus efficiency.

关键词： Data privacy Federated learning Heuristic algorithms Bayes methods Consensus protocol Reliability Vehicle dynamics Protection Fake news Internet of Vehicles

来源：评论

学校读者我要写书评

暂无评论

JSRevealer: A Robust Malicious JavaScript Detector against Obfuscation

JSRevealer: A Robust Malicious JavaScript Detector against O...

引用

International Conference on Dependable systems and Networks (DSN)

作者： Kunlun Ren Weizhong Qiang Yueming Wu Yi Zhou Deqing Zou Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China Jinyinhu Laboratory Wuhan China Nanyang Technological University Singapore National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Due to the convenience and popularity of Web applications, they have become a prime target for attackers. As the main programming language for Web applications, many methods have been proposed for detecting malicious JavaScript, among which static analysis-based methods play an important role because of their high effectiveness and efficiency. However, obfuscation techniques are commonly used in JavaScript, which makes the features extracted by static analysis contain many useless and disguised features, leading to many false positives and false negatives in detection results. In this paper, we propose a novel method to find out the essential features related to the semantics of JavaScript code. Specifically, we develop JS-Revealer, a robust, effective, scalable, and interpretable detector for malicious JavaScript. To test the capabilities of JSRevealer, we conduct comparative experiments with four other state-of-the-art malicious JavaScript detection tools. The experimental results show that JSRevealer has an average F1 of 84.8% on the data obfuscated by different obfuscators, which is 21.6%, 22.3%, 18.7%, and 22.9% higher than the tools CUJO, ZOZZLE, JAST, and JSTAP, respectively. Moreover, the detection results of JSRevealer can be interpreted, which can provide meaningful insights for further security research.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learning the continuous-time optimal decision law from discrete-time rewards

引用

National science Open 2024年第5期3卷 130-147页

作者： Ci Chen Lihua Xie Kan Xie Frank Leroy Lewis Yilu Liu Shengli Xie School of Automation Guangdong University of TechnologyGuangdong Key Laboratory of IoT Information TechnologyGuangzhou 510006China Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of EducationGuangzhou 510006China School of Electrical and Electronic Engineering Nanyang Technological UniversitySingapore 639798Singapore 111 Center for Intelligent Batch Manufacturing Based on IoT Technology Guangzhou 510006China UTA Research Institute the University of Texas at ArlingtonFort Worth 76118USA Department of Electrical Engineering and Computer Science University of TennesseeKnoxville 37996USA Oak Ridge National Laboratory Oak Ridge 37830USA Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou 510006China

The concept of reward is fundamental in reinforcement learning with a wide range of applications in natural and social *** an interpretable reward for decision-making that largely shapes the system's behavior has always been a challenge in reinforcement *** this work,we explore a discrete-time reward for reinforcement learning in continuous time and action spaces that represent many phenomena captured by applying physical *** find that the discrete-time reward leads to the extraction of the unique continuous-time decision law and improved computational efficiency by dropping the integrator operator that appears in classical results with integral *** apply this finding to solve output-feedback design problems in power *** results reveal that our approach removes an intermediate stage of identifying dynamical *** work suggests that the discrete-time reward is efficient in search of the desired decision law,which provides a computational tool to understand and modify the behavior of large-scale engineering systems using the optimal learned decision.

关键词： continuous-time state and action decision law learning discrete-time reward dynamical systems reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Virtual-Source and Virtual-Swarm-Based Particle Swarm Optimizer for Large-Scale Multi-Source Location via Robot Swarm

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Zhang, JunQi Lin, YuXuan Zhou, MengChu Department of Computer Science and Technology the Key Laboratory of Embedded System and Service Computing Ministry of Education Shanghai Electronic Transactions and Information Service Collaborative Innovation Center Tongji University Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Multi-source location is a significant application in the field of robot swarm and is required to find all sources whose number and distribution are unknown in advance. With few parameters and fast search, Particle Swarm Optimizer (PSO) variants that have certain grouping capability have been applied to address multi-source location problems by dividing a swarm such that every source has robots to locate. However, they are difficult to predetermine the exact number of groups, require a big number of robots, and are easily trapped in the no-signal areas when the proportion of no-signal areas is high. This work proposes a Virtual-source and Virtual-swarm-based PSO (VVPSO) to divide a search area into multiple cells equally, each of which has a virtual source in its center. Then, instead of robots grouping, only one group of robots is employed to traverse all virtual sources, and search their corresponding cells to locate real sources by a new PSO called Real-virtual mapping PSO (RMPSO). RMPSO asymmetrically maps a robot into a particle swarm with multiple virtual particles to perform PSO, which greatly reduces the requirements for the number of robots. Experimental results show that VVPSO has great search scalability and can solve large-scale multi-source location problems than two state-of-the-art grouping methods and three representative multimodal PSO variants, even with only one robot. Hence, this work greatly advances the field of multi-source location by using mobile robot swarm. IEEE

关键词： Robots

来源：评论

学校读者我要写书评

暂无评论

Statistical static timing analysis for circuit aging prediction

引用

The Journal of China Universities of Posts and Telecommunications 2021年第2期28卷 14-23页

作者： Duan Shengyu Zhai Dongyao Lu Yue Shanghai Engineering Research Center of Intelligent Computing System Shanghai UniversityShanghai 200444China State Key Laboratory of Computer Architecture Institute of Computing TechnologyChinese Academy of SciencesBeijing 100190China School of Electronics and Computer Science University of SouthamptonSouthamptonUK

Complementary metal oxide semiconductor(CMOS)aging mechanisms including bias temperature instability(BTI)pose growing concerns about circuit *** results in threshold voltage increases on CMOS transistors,causing delay shifts and timing violations on logic *** amount of degradation is dependent on the circuit workload,which increases the challenge for accurate BTI aging prediction at the design *** this paper,a BTI prediction method for logic circuits based on statistical static timing analysis(SSTA)is proposed,especially considering the correlation between circuit workload and BTI *** consists of a training phase,to discover the relationship between circuit scale and the required workload samples,and a prediction phase,to present the degradations under different workloads in Gaussian probability *** method can predict the distribution of degradations with negligible errors,and identify 50%more BTI-critical paths in an affordable time,compared with conventional methods.

关键词： bias temperature instability(BTI) reliability prediction statistical static timing analysis(SSTA)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：