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

Pervasive Computational Technologies (ICPCT), International Conference on

作者： Deena Sivakumar Anamika Kumari Divya Dharshini K Samiksha S Hemachandran M Department of Computer Science and Engineering Sri Ramachandra Institute of Higher Education and Research Chennai Department of Computer Science (AI & Data Analytics) Sri Ramachandra Institute of Higher Education and Research Chennai

ISBN: (数字)9798331508685

ISBN: (纸本)9798331519476

Deep learning models, notably convolutional neural networks (CNNs), demonstrate great promise in medical image processing. Nonetheless, CNNs frequently encounter challenges in capture holistic context and long- range dependencies in high-resolution images, which are crucial for accurate medical diagnostics. A new state-of-the-art technique called Vision Transformers (ViTs) uses self-attention mechanisms for gathering global correlations between image patches, thereby addressing some of the inherent limitations of CNNs. This study investigates the application of ViTs for diagnosing breast cancer from ultrasound images of tumor. The findings suggest that ViTs not only achieve competitive accuracy in identifying breast cancer lesions but also offer superior interpretability through attention mechanism, which can aid clinicians in understanding model decisions. This paper highlights the potential of ViTs as a powerful tool in medical imaging, particularly for breast cancer diagnosis, and outlines future research directions for enhancing clinical applicability.

关键词： Deep learning computer vision Accuracy Attention mechanisms Ultrasonic imaging Transformers Breast cancer Convolutional neural networks Medical diagnosis Biomedical imaging

来源：评论

学校读者我要写书评

暂无评论

RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust Correspondence Pruning 24

RoSe: Rotation-Invariant Sequence-Aware Consensus for Robust...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Liu, Yizhang Zhou, Weiwei Li, Yanping Zhao, Shengjie School of Software Engineering Tongji University Shanghai China College of Computer and Data Science Fuzhou University Fuzhou China Department of Computer Science and Technology Tongji University Shanghai China Engineering Research Center of Key Software Technologies for Smart City Perception and Planning Ministry of Education Shanghai China

ISBN: (纸本)9798400706868

Correspondence pruning has recently drawn considerable attention as a crucial step in image matching. Existing methods typically achieve this by constructing neighborhoods for each feature point and imposing neighborhood consistency. However, the nearest-neighbor matching strategy often results in numerous many-to-one correspondences, thereby reducing the reliability of neighborhood information. Furthermore, the smoothness constraint fails in cases of large-scale rotations, leading to misjudgments. To address the above issues, this paper proposes a novel robust correspondence pruning method termed RoSe, which is based on rotation-invariant sequence-aware consensus. We formulate the correspondence pruning problem as a mathematical optimization problem and derive a closed-form solution. Specifically, we devise a rectified local neighborhood construction strategy that effectively enlarges the distribution between inliers and outliers. Meanwhile, to accommodate large-scale rotation, we propose a relative sequence-aware consistency as an alternative to existing smoothness constraints, which can better characterize the topological structure of inliers. Experimental results on image matching and registration tasks demonstrate the effectiveness of our method. Robustness analysis involving diverse feature descriptors and varying rotation degrees further showcases the efficacy of our method. © 2024 ACM.

关键词： correspondence pruning

来源：评论

学校读者我要写书评

暂无评论

LSGraph: A Locality-centric High-performance Streaming Graph Engine 24

LSGraph: A Locality-centric High-performance Streaming Graph...

引用

19th European Conference on computer Systems, EuroSys 2024

作者： Qi, Hao Wu, Yiyang He, Ligang Zhang, Yu Luo, Kang Cai, Minzhi Jin, Hai Zhang, Zhan Zhao, Jin 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 China Department of Computer Science University of Warwick United Kingdom Zhejiang Lab China

ISBN: (纸本)9798400704376

Streaming graph has been broadly employed across various application domains. It involves updating edges to the graph and then performing analytics on the updated graph. However, existing solutions either suffer from poor data locality and high computation complexity for streaming graph analytics, or need high overhead to search and move graph data to ensure ordered neighbors during streaming graph update. This paper presents a novel locality-centric streaming graph engine, called LSGraph, to enable efficient both graph analytics and graph update. The main novelty of this engine is a differentiated hierarchical indexed streaming graph representation approach to achieve efficient data search and movement for graph update and also maintain data locality and ordered neighbors for efficient graph analytics simultaneously. Besides, a locality-aware streaming graph data update mechanism is also proposed to efficiently regulate the distance of data movement, minimizing the overhead of memory access during graph update. We have implemented LSGraph and conducted a systematic evaluation on both real-world and synthetic datasets. Compared with three cutting-edge streaming graph engines, i.e., Terrace, Aspen, and PaC-tree, LSGraph achieves 2.98×-81.08×, 1.46×-12.56×, and 1.26×-10.31× speedups during graph update, while obtaining 1.02×-4.28×, 1.58×-3.55×, and 1.20×-2.72× speedups during graph analytics, respectively. © 2024 Owner/Author.

关键词： Engines

来源：评论

学校读者我要写书评

暂无评论

CNN-based Text-independent Automatic Speaker Identification Using Short Utterances 6

CNN-based Text-independent Automatic Speaker Identification ...

引用

6th International Conference on computer science and engineering, UBMK 2021

作者： Fasounaki, Mandana Yüce, Emirhan Burak Öncül, Serkan Ince, Gökhan Department of Computer Engineering Istanbul Technical University Istanbul Turkey Arçelik Research and Development Istanbul Turkey Department of Computer Engineering and AI and Data Science Application and Research Center Istanbul Technical University Istanbul Turkey

ISBN: (纸本)9781665429085

With the widespread use of voice-controlling services and devices, the research for developing robust and fast systems for automatic speaker identification had accelerated. In this paper, we present a Convolutional Neural Network (CNN) architecture for text-independent automatic speaker identification. The primary purpose is to identify a speaker, among many others, using a short speech segment. Most of the current researches focus on deep CNNs, which were initially designed for computer vision tasks. Besides, most of the existing speaker identification methods require audio samples longer than 3 seconds in the query phase for achieving a high accuracy. We created a CNN architecture appropriate for voice and speech-related classification tasks. We propose an optimum model that achieves 99.5% accuracy on LibriSpeech and 90% accuracy on VoxCeleb 1 dataset using only 1-second test utterances in our experiments. © 2021 IEEE

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

SC-GNN: A Communication-Efficient Semantic Compression for Distributed Training of GNNs 24

SC-GNN: A Communication-Efficient Semantic Compression for D...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Wang, Jihe Wu, Ying Wang, Danghui School of Computer Science Northwestern Polytechnical University Xi'an China Engineering Research Center of Embedded System Integration Ministry of Education Northwestern Polytechnical University Xi'an China National Engineering Laboratory for Integrated Aero-Space-Ground-Ocean Big Data Application Technology Northwestern Polytechnical University Xi'an China

ISBN: (纸本)9798400706011

Training big graph neural networks (GNNs) in distributed systems is quite time-consuming mainly because of the ubiquitous aggregate operations that involve a large amount of cross-partition communication for collecting embeddings/gradients during the forward and backward propagation. To reduce the volume of the communication, some recent approaches focused on decaying each of connections via sampling, quantifying, or delaying until satisfactory trade-off are obtained between volume and accuracy. However, when applied to popular GNNs, those approaches are found to be bounded by a common volume/accuracy Pareto frontier which shows that the decaying for individual connection cannot further accelerate the aggregate of training. In this work, SC-GNN, a semantic compression of the cross-partition communication, is proposed to concentrate a group of connections as a high-level semantics and transmit to a target partition. Since carrying the overall intent of a group, the semantics can keep transferring the interactions, i.e., embeddings/gradients, between a pair of remote partitions until GNN models converge. In addition, a connection-pattern based differential optimization is proposed to further prune those weak connections, while guaranteeing the training accuracy. The results show that, for multi-field datasets, the compression rate of SC-GNN is 40.8 × higher than SOTA methods and the epoch time is reduced to 31.8% on average. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Receding-Horizon Trajectory Planning for Under-Actuated Autonomous Vehicles Based on Collaborative Neurodynamic Optimization

引用

IEEE/CAA Journal of Automatica Sinica 2022年第11期9卷 1909-1923页

作者： Jiasen Wang Jun Wang Qing-Long Han IEEE the Future Network Research Center Purple Mountain LaboratoriesNanjing 211111China the Department of Computer Science the School of Data ScienceCity University of Hong KongHong KongChina the School of Science Computing and Engineering TechnologiesSwinburne University of TechnologyMelbourne VIC 3122Australia

This paper addresses a major issue in planning the trajectories of under-actuated autonomous vehicles based on neurodynamic optimization.A receding-horizon vehicle trajectory planning task is formulated as a sequential global optimization problem with weighted quadratic navigation functions and obstacle avoidance constraints based on given vehicle goal *** feasibility of the formulated optimization problem is guaranteed under derived *** optimization problem is sequentially solved via collaborative neurodynamic optimization in a neurodynamics-driven trajectory planning method/*** results with under-actuated unmanned wheeled vehicles and autonomous surface vehicles are elaborated to substantiate the efficacy of the neurodynamics-driven trajectory planning method.

关键词： Collaborative neurodynamic optimization receding-horizon planning trajectory planning under-actuated vehicles

来源：评论

学校读者我要写书评

暂无评论

Chain of Condition: Construct, Verify and Solve Conditions for Conditional Question Answering

Chain of Condition: Construct, Verify and Solve Conditions f...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Lin, Jiuheng Lai, Yuxuan Feng, Yansong Wangxuan Institute of Computer Technology Peking University China State Key Laboratory of General Artificial Intelligence Peking University China Department of Computer Science The Open University of China China Engineering Research Center of Integration and Application of Digital Learning Technology Ministry of Education China

ISBN: (纸本)9798891761681

Conditional question answering (CQA) is an important task that aims to find probable answers and identify missing conditions. Existing approaches struggle with CQA due to two challenges: (1) precisely identifying necessary conditions and the logical relationship, and (2) verifying conditions to detect any that are missing. In this paper, we propose a novel prompting approach, Chain of condition, by first identifying all conditions and constructing their logical relationships explicitly according to the document, then verifying whether these conditions are satisfied, finally solving the logical expression to indicate any missing conditions and generating the answer accordingly. Experiments on two CQA benchmark datasets show our chain of condition outperforms existing prompting baselines, establishing a new state of the art. Furthermore, with only a few examples, our method can facilitate GPT-3.5-Turbo or GPT-4 to outperform all existing supervised models. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

A Security Enhanced Chaotic-Map-Based Authentication Protocol for Internet of Drones

引用

IEEE Internet of Things Journal 2024年第12期11卷 22301-22309页

作者： Mahmood, Khalid Ghaffar, Zahid Farooq, Muhammad Yahya, Khalid Das, Ashok Kumar Chaudhry, Shehzad Ashraf National Yunlin University Of Science And Technology Graduate School Of Intelligent Data Science Douliu64002 Taiwan National Yunlin University Of Science And Technology Graduate School Of Engineering Science And Technology Douliu64002 Taiwan Abu Dhabi University Department Of Mathematics And Statistics College Of Arts And Sciences Abu Dhabi United Arab Emirates Istanbul Gelisim University Department Of Electrical And Electronics Engineering Istanbul34310 Turkey Sabratah University Department Of Electrical Engineering Faculty Of Engineering Regdalen Libya Center For Security Theory And Algorithmic Research Hyderabad500 032 India Abu Dhabi University Department Of Computer Science And Information Technology College Of Engineering Abu Dhabi United Arab Emirates Nisantasi University Faculty Of Engineering And Architecture Department Of Software Engineering Istanbul34398 Turkey

The Internet of Drones (IoD) extends the capabilities of unmanned aerial vehicles, enabling them to participate in a connected network. In IoD infrastructure, drones communicate not only among themselves but also with users and a control center. This interconnected communication framework holds promise for various applications, from collaborative decision-making to real-time data exchange. However, the expansion of communication in IoD also introduces new challenges, particularly in terms of security, privacy and authentication. Unfortunately, the current authentication protocols are inadequate in offering robust security features against various attacks in the IoD environment. To address these security issues and limitations, we proposed a secure protocol for the IoD environment using chaotic maps and hash functions. In addition, we also employed a physically unclonable function in the development of the proposed protocol. We assess the security of the protocol through both informal and formal security analysis. The formal security analysis is conducted through a widely used random or real (RoR) model. The informal analysis shows the rigorous security features against various attacks, such as masquerading, anonymity violation, and physical cloning attacks. Moreover, we compare the performance of the devised protocol with similar existing protocols across important performance parameters, such as communication overhead, computation overhead, and security features. The devised protocol provides a 67.86% and 17.80% reduction in computation and communication overheads, respectively, as compared to related protocols. The analysis demonstrates the proposed protocol's capacity to support secure communication in the IoD environment and satisfy desirable security attributes. © 2014 IEEE.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

A Trace-Selection Preprocessing Approach of Discovering Structurally Complete ICN-Process Models from Process Logs 3rd

A Trace-Selection Preprocessing Approach of Discovering Str...

引用

3rd International Conference on Advances in Information and Communication Technology, ICTA 2024

作者： Pham, Dinh-Lam Batzaya, Tsagaantsooj Kim, Kyoung-Sook Chang, Jeong-Hyun Kim, Kwanghoon Pio CCSRI Kyonggi University Gyeonggi Suwon16227 Korea Republic of Department of Public Safety Bigdata Graduate School of Kyonggi University Gyeonggi Suwon16227 Korea Republic of Data Process Engineering Research Laboratory Faculty of AI Computer Science and Engineering Kyonggi University Gyeonggi Suwon16227 Korea Republic of

ISBN: (纸本)9783031809422

In business process life-cycle management and reengineering through process mining, it is crucial for the process mining system to discover structurally safe and complete business process models from process logs. However, most process mining systems typically suffer from discovering inaccurate and unstructured business process models due to various types of anomalous traces hidden in process logs. In this paper, we therefore propose a process log preprocessing approach that purifies a corresponding process log dataset by selecting a group of reasonable process log traces and applying to discover an essential business process model satisfying the structural completeness requirement of matched-pairing and proper-nesting properties. The theoretical basis of the proposed approach is the mathematical graph model of information control net model that is the typical representation of business process models. Finally, we practically demonstrate the conceptual excellence and functional correctness of the proposed preprocessing approach through experimental verifications using real business process enactment log datasets available in the 4TU center for research data. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Reengineering

来源：评论

学校读者我要写书评

暂无评论

Safe and Reliable Training of Learning-Based Aerospace Controllers 43

Safe and Reliable Training of Learning-Based Aerospace Contr...

引用

43rd aiAA DATC/IEEE Digital Avionics Systems Conference, DASC 2024

作者： Mandal, Udayan Amir, Guy Wu, Haoze Daukantas, Ieva Newell, Fletcher Lee Ravaioli, Umberto Meng, Baoluo Durling, Michael Hobbs, Kerianne Ganai, Milan Shim, Tobey Katz, Guy Barrett, Clark Stanford University Center for Ai Safety Stanford United States School of Cs & Engineering The Hebrew University of Jerusalem Jerusalem Israel It University of Copenhagen Department of Computer Science Copenhagen Denmark Google Mountain View United States Ge Aerospace Research Niskayuna United States Us Air Force Air Force Research Laboratory Dayton United States Stanford University Department of Computer Science Stanford United States Stanford University Department of Data Science Stanford United States

ISBN: (纸本)9798350349610

In recent years, deep reinforcement learning (DRL) approaches have generated highly successful controllers for a myriad of complex domains. However, the opaque nature of these models limits their applicability in aerospace systems and sasfety-critical domains, in which a single mistake can have dire consequences. In this paper, we present novel advancements in both the training and verification of DRL controllers, which can help ensure their safe behavior. We showcase a design-for-verification approach utilizing k-induction and demonstrate its use in verifying liveness properties. In addition, we also give a brief overview of neural Lyapunov Barrier certificates and summarize their capabilities on a case study. Finally, we describe several other novel reachability-based approaches which, despite failing to provide guarantees of interest, could be effective for verification of other DRL systems, and could be of further interest to the community. © 2024 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：