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

arXiv 2024年

作者： Leahy, Kevin Asgari, Hamid Dennis, Louise A. Feather, Martin S. Fisher, Michael Ibanez-Guzman, Javier Logan, Brian Olszewska, Joanna I. Redfield, Signe Robotics Engineering Department Worcester Polytechnic Institute WorcesterMA United States Complex and Autonomous Systems Research Group Thales UK Research Reading United Kingdom Jet Propulsion Laboratory California Institute of Technology PasadenaCA United States Department of Computer Science University of Manchester Manchester United Kingdom Renault Guyancourt France Department of Computing Science University of Aberdeen Aberdeen United Kingdom Department of Information and Computing Sciences Utrecht University Utrecht Netherlands School of Computing and Engineering University of the West of Scotland Glasgow United Kingdom U.S. Naval Research Laboratory WashingtonDC United States

Autonomous systems use independent decisionmaking with only limited human intervention to accomplish goals in complex and unpredictable environments. As the autonomy technologies that underpin them continue to advance, these systems will find their way into an increasing number of applications in an ever wider range of settings. If we are to deploy them to perform safety-critical or mission-critical roles, it is imperative that we have justified confidence in their safe and correct operation. Verification is the process by which such confidence is established. However, autonomous systems pose challenges to existing verification practices. This paper highlights viewpoints of the Roadmap Working Group of the IEEE Robotics and Automation Society Technical Committee for Verification of Autonomous Systems, identifying these grand challenges, and providing a vision for future research efforts that will be needed to address them. © 2024, CC BY.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Graph Neural Networks for Joint Communication and Sensing Optimization in Vehicular Networks

arXiv

引用

arXiv 2023年

作者： Li, Xuefei Chen, Mingzhe Liu, Yuchen Zhang, Zhilong Liu, Danpu Mao, Shiwen The Beijing Laboratory of Advanced Information Network Beijing University of Posts and Telecommunications Beijing100876 China The Department of Electrical and Computer Engineering Institute for Data Science and Computing University of Miami Coral GablesFL33146 United States The Department of Computer Science North Carolina State University RaleighNC27695 United States The Department of Electrical and Computer Engineering Auburn University AuburnAL36849-5201 United States

In this paper, the problem of joint communication and sensing is studied in the context of terahertz (THz) vehicular networks. In the studied model, a set of service provider vehicles (SPVs) provide either communication service or sensing service to target vehicles, where it is essential to determine 1) the service mode (i.e., providing either communication or sensing service) for each SPV and 2) the subset of target vehicles that each SPV will serve. The problem is formulated as an optimization problem aiming to maximize the sum of the data rates of the communication target vehicles, while satisfying the sensing service requirements of the sensing target vehicles, by determining the service mode and the target vehicle association for each SPV. To solve this problem, a graph neural network (GNN) based algorithm with a heterogeneous graph representation is proposed. The proposed algorithm enables the central controller to extract each vehicle’s graph information related to its location, connection, and communication interference. Using this extracted graph information, a joint service mode selection and target vehicle association strategy is then determined to adapt to the dynamic vehicle topology with various vehicle types (e.g., target vehicles and service provider vehicles). Simulation results show that the proposed GNN-based scheme can achieve 93.66% of the sum rate achieved by the optimal solution, and yield up to 3.16% and 31.86% improvements in sum rate, respectively, over a homogeneous GNN-based algorithm and a conventional optimization algorithm without using GNNs. Copyright © 2023, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Analysis of Skin Cancer Classification with Convolutional Neural Networks for E-Health Applications

Data-Driven Analysis of Skin Cancer Classification with Conv...

引用

IEEE Conference on Global Communications (GLOBECOM)

作者： Imran Ahmed Misbah Ahmad Abdellah Chehri Gwanggil Jeon School of Computing and Information Science Anglia Ruskin University Cambridge UK Animal and Agriculture Department Hartpury University Gloucester UK Centre for Machine Vision Bristol Robotics Laboratory University of the West of England Bristol UK Department of Mathematics and Computer Science The Royal Military College of Canada (RMC) Canada Department of Embedded Systems Engineering Incheon National University Incheon Korea

ISBN: (数字)9798350351255

ISBN: (纸本)9798350351262

This study explores the effectiveness of Convolutional Neural Networks (CNNs) in automatically classifying skin cancer for e-health applications. The trained model showcases impressive performance by leveraging the HAM10000 dataset, which includes a wide range of skin lesion images from seven different classes. The parameters and architecture of the CNN model are presented in a systematic manner, providing valuable insights into the reasoning behind its design. The model is optimized using the Adam optimizer and annealing techniques to ensure efficient convergence. The model’s performance is assessed on validation and test datasets, showcasing an accuracy of 78.55% and 76.49%, respectively, for skin cancer classification. This study highlights the significant potential of CNN as a powerful tool for automating the diagnosis of skin cancer, which is in line with the growing trend of using deep learning for medical image analysis.

关键词： Deep learning Systematics Image analysis Market research Skin Convolutional neural networks Lesions Global communication Medical diagnostic imaging Skin cancer

来源：评论

学校读者我要写书评

暂无评论

Lightweight Trust Model with Machine Learning scheme for secure privacy in VANET 18

Lightweight Trust Model with Machine Learning scheme for sec...

引用

18th International Learning and Technology Conference, L and T 2021

作者： Junejo, Muhammad Haleem Ab Rahman, Ab Al-Hadi Shaikh, Riaz Ahmed Yusof, Kamaludin Mohamad Kumar, Dileep Memon, Imran Faculty of Electrical Engineering Universiti Teknologi Malaysia Johor Skudai81310 Malaysia Department of Computer Science Faculty of Computing and Information Technology King Abdulaziz University Jeddah Saudi Arabia State Key Laboratory of Industrial Control Technology College of Control Science and Engineering Zhejiang University Hangzhou China Department of Computer Science Bahria University Karachi campus sindh Pakistan

A vehicular ad hoc network (VANETs) is transforming public transport into a safer wireless network, increasing its safety and efficiency. The VANET consists of several nodes which include RSU (Roadside Units), vehicles, traffic signals, and other wireless communication devices that are communicating sensitive information in a network. Nevertheless, security threats are increasing day by day because of dependency on network infrastructure, dynamic nature, and control technologies used in VANET. The security threats could be addressed widely by using machine learning and artificial intelligence on the road transport nodes. In this paper, a comparison of trust and cryptography was presented based on applications and security requirements of VANET. © 2021 The Authors. Published by Elsevier B.V.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Iris-Based Biometric Identification Using a Combination of the Right - Left Iris Statistical Features 12

Iris-Based Biometric Identification Using a Combination of t...

引用

12th International Conference on Mathematical Modeling in Physical sciences, IC-MSQUARE 2023

作者： Dincǎ Lǎzǎrescu, A.M. Moldovanu, S. Moraru, L. The Modelling & Simulation Laboratory Dunarea de Jos University of Galati 47 Domneasca Street Galati800008 Romania Mihail Kogǎlniceanu High School 161B Brǎilei St. Galati800320 Romania Department of Computer Science and Information Technology Faculty of Automation Computers Electrical Engineering and Electronics Dunarea de Jos University of Galati 47 Domneasca Street Galati800008 Romania Department of Chemistry Physics & Environment Faculty of Sciences and Environment Dunarea de Jos University of Galati 47 Domneasca Street Galati800008 Romania

A combination between the information extracted for both right iris and left iris could increase the efficacy of the biometric recognition systems. In this paper, we propose a biometric identification method based on density of image patterns extracted from human iris images and the combination and comparison of the right iris and the left iris characteristics. The density of the patters approach for processed images can be a new biometric feature used to implement a biometric recognition system with high performance when a small feature dimension is used. In this way, we can maximize the retention of the effective biometric information. The experiments were conducted on the MMU Iris Database containing 225 images of the left eye and 225 images of the right eye. Two morphological Top-hat and Hit or Miss transforms were implemented to find out the particular pattern of pixels. They allow for the enhancement of detail in images. Then, a statistical feature extraction technique is employed to derive the density of the patterns in morphological transformed images. To assess the density of the patterns differences between the right and left iris data groups, the Pearson's correlation coefficient (PCC) is computed. We reported very good results with a PCC of 0.6164 (strong and positive correlation) for Top-hat morphological operation whilst the Hit or Miss transform returns a PCC of 0.0127 so there is no relationship between the density of the patterns in the right and left irises. © 2024 Institute of Physics Publishing. All rights reserved.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

A Parallelizable Counterfactual Generation Method Based on Gradient Optimization

A Parallelizable Counterfactual Generation Method Based on G...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Haorun Ding Xuesong Jiang 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 Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Quan Cheng Laboratory Jinan China State Key Laboratory of High-end Server & Storage Technology Jinan China

Post-hoc explanations are important for people to understand the predictions of explanation models. One class of methods in post-hoc explanation is the generation of counterfactuals, where a hypothetical example is obtained by perturbing the inputs to show how one could obtain a different prediction from the decision model. Counter-factual explanations should satisfy several properties: One is that counterfactuals generated under specific scenarios and constraints should be feasible for users, i.e., they should accommodate different causal constraints. The other is that it is more desirable for users to have a wider variety of viable examples, i.e., counterfactual diversity. To this end, we propose a parallelizable method based on gradient optimization. We partition the input feasible domains, perform counterfactual generation independently for each feasible domain, and then parallelize the counterfactual generation process for each feasible domain. Experimental results show that our approach effectively improves the diversity, sparsity, and proximity of the generated counterfactual instances on the public datasets Adult-Income, Lending-Club, German-Credit, and COMPAS compared to other models.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Simple and high-Precision Hamiltonian Simulation by Compensating Trotter Error with Linear Combination of Unitary Operations

引用

PRX Quantum 2025年第1期6卷 010359-010359页

作者： Pei Zeng Jinzhao Sun Liang Jiang Qi Zhao Pritzker School of Molecular Engineering The University of Chicago Illinois 60637 USA Clarendon Laboratory University of Oxford Parks Road Oxford OX1 3PU United Kingdom Blackett Laboratory Imperial College London London SW7 2AZ United Kingdom QICI Quantum Information and Computation Initiative Department of Computer Science School of Computing and Data Science The University of Hong Kong Pokfulam Road Hong Kong

Trotter and linear combination of unitary (LCU) operations are two popular Hamiltonian simulation methods. The Trotter method is easy to implement and enjoys good system-size dependence endowed by commutator scaling, while the LCU method admits high-accuracy simulation with a smaller gate cost. We propose Hamiltonian simulation algorithms using LCU to compensate Trotter error, which enjoy both of their advantages. By adding few gates after the Kth-order Trotter formula, we realize a better time scaling than 2Kth-order Trotter. Our first algorithm exponentially improves the accuracy scaling of the Kth-order Trotter formula. For a generic Hamiltonian, the estimated gate counts of the first algorithm can be 2 orders of magnitude smaller than the best analytical bound of fourth-order Trotter formula. In the second algorithm, we consider the detailed structure of Hamiltonians and construct LCU for Trotter errors with commutator scaling. Consequently, for lattice Hamiltonians, the algorithm enjoys almost linear system-size dependence and quadratically improves the accuracy of the Kth-order Trotter. For the lattice system, the second algorithm can achieve 3 to 4 orders of magnitude higher accuracy with the same gate costs as the optimal Trotter algorithm. These algorithms provide an easy-to-implement approach to achieve a low-cost and high-precision Hamiltonian simulation.

关键词： Size distribution

来源：评论

学校读者我要写书评

暂无评论

A biosensing system using a multiparameter nonlinear dynamic analysis of cardiomyocyte beating for drug-induced arrhythmia recognition

引用

Microsystems & Nanoengineering 2022年第3期8卷 277-290页

作者： Hao Wang Yue Wu Quchao Zou Wenjian Yang Zhongyuan Xu Hao Dong Zhjing Zhu Depeng Wang Tanxing Wang Ning Hu Diming Zhang State Key Laboratory of Optoelectronic Materials and Technologies Guangdong Province Key Laboratory of Display Material and TechnologySchool of Electronics and Information TechnologySun Yat-sen UniversityGuangzhou 510006China Research Center for Itelligent Sensing Systems Zhejiang LabHangzhou 311121China ZJU-Hangzhou Global Scientific and Technological Innovation Center Department of ChemistryThe Second Affiliated Hospital Zhejiang University School of MedicineDepartment of Clinical Medical EngineeringZhejiang UniversityHangzhou 310058China Key Laboratory of Novel Target and Drug Study for Neural Repair of Zhejang Province School of MedicineSchool of Computer&Computing ScienceZhejiang University City CollegeHangzhou 310015China School of Brain Science and Brain Medicine Zhejiang UniversityHangzhou 310058China College of Energy and Power Engineering Nanjing University of Aeronautics and AstronauticsNanjing 210016China E-LinkCare Meditech Co LtdHangzhou 310011China State Key Laboratory of Transducer Technology Chinese Academy of SciencesShanghai 200050China

Cardiovascular disease is the number one cause of death in ***,cardiotoxicity is one of the most important adverse effects assessed by arrhythmia recognition in drug ***,cell-based techniques developed for arhythmia recognition primarily employ linear methods such as time-domain analysis that detect and compare individual waveforms and thus fall short in some applications that require automated and efficient arrhythmia recognition from large *** carried out the frst report to develop a biosensing system that integrated impedance measurement and multiparameter nonlinear dynamic algorithm(MNDA)analysis for druginduced arrhythmia recognition and *** biosensing system cultured cardiomyocytes as physiologically relevant models,used interdigitated electrodes to detect the mechanical beating of the cardiomyocytes,and employed MNDA analysis to recognize drug-induced arrhythmia from the cardiomyocyte beating *** best performing MNDA parameter,approximate entropy,enabled the system to recognize the appearance of sertindoleand norepinephrine-induced arrhythmia in the *** MNDA reconstruction in phase space enabled the system to classify the different arrhythmias and quantify the severity of *** new biosensing system utilizing MNDA provides a promising and alternative method for drug-induced arrhythmia recognition and classification in cardiological and pharmaceutical applications.

关键词： arrhythmia cardio analysis

来源：评论

学校读者我要写书评

暂无评论

A Multilevel Approach for Solving Large-Scale QUBO Problems with Noisy Hybrid Quantum Approximate Optimization

A Multilevel Approach for Solving Large-Scale QUBO Problems ...

引用

IEEE Conference on high performance Extreme computing (HPEC)

作者： Filip B. Maciejewski Bao G. Bach Maxime Dupont P. Aaron Lott Bhuvanesh Sundar David E. Bernal Neira Ilya Safro Davide Venturelli Quantum Artificial Intelligence Laboratory (QuAIL) NASA Ames Research Center CA USA USRA Research Institute for Advanced Computer Science (RIACS) CA USA Department of Computer and Information Sciences University of Delaware Newark DE USA Rigetti Computing Berkeley CA Davidson School of Chemical Engineering Purdue University West Lafayette IN USA

ISBN: (数字)9798350387131

ISBN: (纸本)9798350387148

Quantum approximate optimization is one of the promising candidates for useful quantum computation, particularly in the context of finding approximate solutions to Quadratic Unconstrained Binary Optimization (QUBO) problems. However, the existing quantum processing units (QPUs) are of relatively small size, and canonical mappings of QUBO via the Ising model require one qubit per variable, rendering direct large-scale optimization infeasible. In classical optimization, a general strategy for addressing many large-scale problems is via multilevel/multigrid methods, where the large target problem is iteratively coarsened and the global solution is constructed from multiple small-scale optimization runs. In this work, we experimentally test how existing QPUs perform when used as a sub-solver within such a multilevel strategy. To this aim, we combine and extend (via additional classical processing steps) the recently proposed Noise-Directed Adaptive Remapping (NDAR) and Quantum Relax & Round (QRR) algorithms. We first demonstrate the effectiveness of our heuristic extensions on Rigetti's superconducting transmon device Ankaa-2. We find approximate solutions to 10 instances of fully connected 82-qubit Sherrington-Kirkpatrick graphs with random integer-valued coefficients obtaining normalized approximation ratios (ARs) in the range $\sim 0.98-1.0$ , and the same class with real-valued coefficients (ARs $\sim 0.94-1.0)$ . Then, we implement the extended NDAR and QRR algorithms as subsolvers in the multilevel algorithm for 6 large-scale graphs with at most $\sim 27,000$ variables. In practice, the QPU (with classical post-processing steps) is used to find approximate solutions to dozens of at most 82-qubit problems, which are iteratively used to construct the global solution. We observe that quantum optimization results are competitive in terms of the quality of solutions when compared to classical heuristics used as subsolvers within the multilevel approach. Reproducibility

关键词： Superconducting devices performance evaluation Quantum advantage Source coding Qubit Pipelines Approximation algorithms Rendering (computer graphics) Noise measurement Optimization

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Sparsification Method to Improve the performance of Neural Networks on Autism Spectrum Disorder Identification Tasks

A Heuristic Sparsification Method to Improve the Performance...

引用

International Conference on information science and Technology (ICIST)

作者： Fangyu Zhang Yi Pan Yanjie Wei Jin Liu Zhenli Lin Centre for High Performance Computing Chinese Academy of Sciences Shenzhen Institute of Advanced Technology Shenzhen China Shenzhen Key Laboratory of Intelligent Bioinformatics Chinese Academy of Sciences Shenzhen Institute of Advanced Technology Shenzhen China School of Computer Science and Engineering Central South University Changsha China Department of Ophthalmology Shenzhen University General Hospital Shenzhen China

Deep learning (DL) has been widely used in the detection of neurological diseases such as Autism spectrum disorder (ASD). Most studies in this field manually designed and adjusted the hyperparameters of DL models, but due to the huge search space, few studies have attempted to optimize the topology of neural networks which is another important factor related to the performance of DL models. This paper proposes a heuristic sparsification method named the Evolutionary Connection Sparsification Algorithm (ECSA) which is used to optimize the topology of fully connected neural networks (FC-NNs) and generate the corresponding sparsely connected neural networks (SC-NNs). The algorithm is based on the workflow of the genetic algorithm but with improved coding strategy, fitness evaluation approach, crossover and mutation operator, and including an effective convergence acceleration strategy. Experiments show that the SC-NNs generated by ECSA significantly outperform the original FC-NNs in terms of accuracy, F1-score, and AUC, and the model complexities are greatly reduced.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：