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

Efficient Routing Protection Algorithm Based on Optimized Network Topology

computers, Materials & Continua 2022年第9期72卷 4525-4540页

作者： Haijun Geng Zikun Jin Jiangyuan Yao Han Zhang Zhiguo Hu Bo Yang Yingije Guo Wei Wang Qidong Zhang Guoao Duan School of Computer and Information Technology Shanxi UniversityShanxi030006China School of Automation and Software Engineering Shanxi UniversityShanxi030006China School of Computer Science and Technology Hainan UniversityHaikou570228China Department of Computer Science&Technology Tsinghua UniversityBeijing100084China Department of Urban&Regional Planning San JoséState University San JoséCA95192USA Key Laboratory of Embedded System and Service Computing(Tongji University) Ministry of EducationShanghai201804China Institute of Fundamental and Frontier Sciences University of Electronic Science and Technology of ChinaChengdu610054China Beijinng University of Technology Beijing-Dublin International CollegeBeijing University of TechnologyBeijing100124China

Network failures are unavoidable and occur *** the network fails,intra-domain routing protocols deploying on the Internet need to undergo a long convergence *** this period,a large number of messages are discarded,which results in a decline in the user experience and severely affects the quality of service of Internet Service Providers(ISP).Therefore,improving the availability of intra-domain routing is a trending research question to be *** usually employs routing protection algorithms to improve intra-domain routing ***,existing routing protection schemes compute as many backup paths as possible to reduce message loss due to network failures,which increases the cost of the network and impedes the methods deployed in *** address the issues,this study proposes an efficient routing protection algorithm based on optimized network topology(ERPBONT).ERPBONT adopts the optimized network topology to calculate a backup path with the minimum path coincidence degree with the shortest path for all source ***,the backup path with the minimum path coincidence with the shortest path is described as an integer programming *** the simulated annealing algorithm ERPBONT is used to find the optimal ***,the algorithm is tested on the simulated topology and the real *** experimental results show that ERPBONT effectively reduces the path coincidence between the shortest path and the backup path,and significantly improves the routing availability.

关键词： Routing protection algorithm network availability network failure shortest path backup path

来源：评论

学校读者我要写书评

暂无评论

A Complex Brain Learning Skeleton Comprising Enriched Pattern Neural Network system for Next Era Internet of Things

引用

Journal of Healthcare engineering 2023年第1期2023卷

作者： Venkatesh, J. Shukla, Prashant Kumar Ahanger, Tariq Ahamed Maheshwari, Manish Pant, Bhasker Hemamalini, R. Rani Halifa, Awal Center for System Design Department of Computer Science and Engineering Chennai Institute of Technology Tamil Nadu Chennai India Department of Computer Science and Engineering Koneru Lakshmaiah Education Foundation Vaddeswaram Andhra Pradesh Guntur522502 India College of Computer Engineering and Sciences Prince Sattam Bin Abdulaziz University Al-Kharj Saudi Arabia Department of Computer Science & Applications Makhanlal Chaturvedi National University of Journalism and Communication Madhya Pradesh Bhopal India Computer Science & Engineering Graphic Era Deemed to Be University Uttarakhand Dehradun248002 India Department of Electrical and Electronics Engineering St. Peter's Institute of Higher Education and Research Tamil Nadu Chennai India Kwame Nkrumah University of Science and Technology Kumasi Ghana

The Internet of Things (IoT) is now growing dramatically on various levels and helps to digitize various vital industries quickly. The most difficult obstacle for BCIs to overcome is the fact that not everyone has the same brain. Every new session requires the BCI to learn from the user's brain, which is accomplished via the use of machine learning. However, this learning process is time-consuming. Calibration time refers to the amount of time it takes for the BCI to adapt to the user's brain in order to properly categorize their thoughts and determine their meaning. The patient has had to wait an arduous and tiresome length of time for the system to be completely functioning up until now because of this calibration, which may take up to 20-30 minutes. The aim of this paper was to find a way to decrease the amount of time required for calibration to the smallest amount feasible. In the first section of this paper, a first effort is made to determine the optimum number of features required for the BCI to operate reasonably, taking into consideration all of the calibration data provided. When the results were averaged across five participants, the percentage of properly identified thoughts was just 67.15 percent. Transfer learning was used in order to improve the performance of the BCI while simultaneously decreasing the calibration time. It is feasible to decrease the amount of calibration required for the categorization of thoughts coming from a new target subject by using knowledge collected from previously recorded subjects to the greatest extent possible in transfer learning. It was determined that existing methods were superior, and a new methodology was created that required just 24 seconds of calibration data while accurately identifying 86.8% of the thoughts. In order to alleviate mental stress and anger, the system suggested fits effectively with a deep learning network. This paper proposes a brain learning framework that uses a neural network model that is

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Hybrid Search for Efficient Planning with Completeness Guarantees

arXiv

引用

arXiv 2023年

作者： Kujanpää, Kalle Pajarinen, Joni Ilin, Alexander Department of Computer Science Aalto University Finland Department of Electrical Engineering and Automation Aalto University Finland Finnish Center for Artificial Intelligence FCAI Finland System 2 AI

Solving complex planning problems has been a long-standing challenge in computer science. Learning-based subgoal search methods have shown promise in tackling these problems, but they often suffer from a lack of completeness guarantees, meaning that they may fail to find a solution even if one exists. In this paper, we propose an efficient approach to augment a subgoal search method to achieve completeness in discrete action spaces. Specifically, we augment the high-level search with low-level actions to execute a multi-level (hybrid) search, which we call complete subgoal search. This solution achieves the best of both worlds: the practical efficiency of high-level search and the completeness of low-level search. We apply the proposed search method to a recently proposed subgoal search algorithm and evaluate the algorithm trained on offline data on complex planning problems. We demonstrate that our complete subgoal search not only guarantees completeness but can even improve performance in terms of search expansions for instances that the high-level could solve without low-level augmentations. Our approach makes it possible to apply subgoal-level planning for systems where completeness is a critical requirement. Copyright © 2023, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analytical Survey on the Security Framework of Cyber-Physical systems for Smart Power system Networks

Analytical Survey on the Security Framework of Cyber-Physica...

引用

2022 International Conference on Cyber Resilience, ICCR 2022

作者： Ali Al-Jumaili, Ahmed Hadi Muniyandi, Ravie Chandren Hasan, Mohammad Kamrul Singh, Mandeep Jit Siaw Paw, Johnny Koh Universiti Kebangsaan Malaysia Faculty of Information Science and Technology Bangi43600 Malaysia University of Fallujah Computer Centre Department Anbar00964 Iraq Universiti Kebangsaan Malaysia Faculty of Engineering and Built Environment Department of Electrical Electronic and System Engineering Selango Bangi43600 Malaysia Universiti Tenaga Nasional Department of Electronic and Communication Engineering Selango Kajang Malaysia

ISBN: (纸本)9781665461221

Cyber-Physical Power system (CPPS) is one of the most critical infrastructure systems due to deep integration between power grids and communication networks. In the power system, cascading failure is spreading more readily in CPPS, even leading to blackouts as well as there are new difficulties with the power system security simulation and faults brought by physical harm or network intrusions. The current study summarized the cross- integration of several fields such as computer and cyberspace security in terms of the robustness of Cyber-Physical systems, viewed as Interconnected and secure network systems. Therefore, the security events that significantly influenced the power system were evaluated in this study, besides the challenges and future directions of power system security simulation technologies were investigated for posing both challenges and opportunities for simulation techniques of power system security like building a new power system to accelerate the transformation of the existing energy system to a clean, low-carbon, safe, and efficient energy system which is used to assure power system stability through fusion systems that combine the cyber-physical to integrate the battery power station, power generation and renewable energy resources through the internet with the cyber system that contains Smart energy system control and attacks. © 2022 IEEE.

关键词： Cyber Physical system

来源：评论

学校读者我要写书评

暂无评论

A Design and Implementation of MIPI A-PHY RTS Layer

A Design and Implementation of MIPI A-PHY RTS Layer

引用

International SoC Design Conference, ISOCC

作者： Sang-Ung Shin Jin-Ku Kang Yongwoo Kim Department of Electric and Computer science Engineering Inha University Incheon Korea Department of System Semiconductor Engineering Sangmyung University Cheonan Korea

ISBN: (纸本)9781665459723

This paper implements and verifies the A-PHY and RTS layers, which are the newly proposed SerDes standards. A-PHY and RTS layers were verified using Xilinx KC705 FPGA board and Loopback module. As a result of synthesis in FPGA, it was confirmed that 3,924 LUTs, 2,019 registers, and 132 block memories were used, and the maximum operating speed was 200 MHz.

关键词： Memory management Table lookup Registers Field programmable gate arrays Standards Automotive engineering

来源：评论

学校读者我要写书评

暂无评论

Constrained Regularization by Denoising with Automatic Parameter Selection

arXiv

引用

arXiv 2023年

作者： Cascarano, Pasquale Benfenati, Alessandro Kamilov, Ulugbek S. Xu, Xiaojian the Department of the Arts University of Bologna Bologna40123 Italy the Department of Environmental Science and Policy University of Milan Milan20133 Italy the Department of Computer Science & Engineering Department of Electrical & System Engineering Washington University in St. Louis St. LouisMO63130 United States the Department of Electrical Engineering and Computer Science University of Michigan Ann ArborMI48109 United States

Regularization by Denoising (RED) is a well-known method for solving image restoration problems by using learned image denoisers as priors. Since the regularization parameter in the traditional RED does not have any physical interpretation, it does not provide an approach for automatic parameter selection. This letter addresses this issue by introducing the Constrained Regularization by Denoising (CRED) method that reformulates RED as a constrained optimization problem where the regularization parameter corresponds directly to the amount of noise in the measurements. The solution to the constrained problem is solved by designing an efficient method based on alternating direction method of multipliers (ADMM). Our experiments show that CRED outperforms the competing methods in terms of stability and robustness, while also achieving competitive performances in terms of image quality. © 2023, CC BY.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Communication-efficient and Differentially-private Distributed Nash Equilibrium Seeking with Linear Convergence

arXiv

引用

arXiv 2024年

作者： Chen, Xiaomeng Huo, Wei Ding, Kemi Dey, Subhrakanti Shi, Ling The Department of Electronic and Computer Engineering Hong Kong University of Science and Technology Clear Water Bay Kowloon Hong Kong The School of System Design and Intelligent Manufacturing Southern University of Science and Technology Shenzhen518055 China The Department of Electrical Engineering Uppsala University Uppsala751 03 Sweden

The distributed computation of a Nash equilibrium (NE) for non-cooperative games is gaining increased attention recently. Due to the nature of distributed systems, privacy and communication efficiency are two critical concerns. Traditional approaches often address these critical concerns in isolation. This work introduces a unified framework, named CDP-NES, designed to improve communication efficiency in the privacy-preserving NE seeking algorithm for distributed non-cooperative games over directed graphs. Leveraging both general compression operators and the noise adding mechanism, CDP-NES perturbs local states with Laplacian noise and applies difference compression prior to their exchange among neighbors. We prove that CDP-NES not only achieves linear convergence to a neighborhood of the NE in games with restricted monotone mappings but also guarantees ϵdifferential privacy, addressing privacy and communication efficiency simultaneously. Finally, simulations are provided to illustrate the effectiveness of the proposed method. © 2024, CC BY.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Multiple Sclerosis Detection with Reinforcement Learning and Differential Evolution

Multiple Sclerosis Detection with Reinforcement Learning and...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Yang, Jing Yang, Jin Wu, Chenwei Jiang, Gaozhe Lv, Yaning Liu, Bingyan Xu, Feng Department of Computer System and Technology Universiti Malaya Kuala Lumpur Malaysia Mallinckrodt Institute of Radiology Washington University School of Medicine St. Louis United States Evident Battery Inc. Massachusetts United States Institute of Operations Research and Analytics National University of Singapore Singapore School of Mathematics and Statistics Xi'an University of Electronic Science and Technology Beijing China School of Computer Science Beijing University of Posts and Telecommunications Beijing China School of Engineering and Design Technical University of Munich Munich Germany

ISBN: (纸本)9798350368741

Multiple Sclerosis (MS) disrupts nerve communication, potentially leading to permanent damage. Convolutional Neural Networks (CNNs) are commonly recommended to accelerate magnetic resonance imaging (MRI) analysis for MS. Traditional CNN-based methods often face challenges with feature selection, imbalanced classification, and hyperparameter optimization, which can reduce their effectiveness. To address these challenges, this paper introduces a reinforcement learning (RL) strategy for tackling feature selection and class imbalance, complemented by an advanced Differential Evolution (DE) algorithm for hyperparameter tuning. The RL algorithm dynamically adapts, enhancing feature selection and class balance, and consistently outperforms traditional static methods by continually optimizing its response to the complex patterns in MS detection. Furthermore, the DE is enhanced with a novel mutation mechanism that utilizes k-means clustering to identify significant clusters. Tested on the SNAC-MS and ISBI datasets, our model demonstrates robust accuracy with average F-measures of 92.873% and 93.783%, respectively, highlighting its effectiveness and adaptability in diagnosing MS. © 2025 IEEE.

关键词： feature selection hyperparameter optimization imbalanced classification Multiple sclerosis reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Ant Colony Optimization Based Algorithm for Test Path Generation Problem with Negative Constraints

Ant Colony Optimization Based Algorithm for Test Path Genera...

引用

IEEE International Conference on Software Quality, Reliability and Security (QRS)

作者： Matej Klima Miroslav Bures Martin Blaha Department of Computer Science Faculty of Electrical Engineering System Testing IntelLigent Lab (STILL) Czech Technical University in Prague Czech Republic Department of Fire Support Faculty of Military Leadership University of Defence Czech Republic

ISBN: (数字)9798350365634

ISBN: (纸本)9798350365641

Path-based testing is an established method for creating test cases comprising sequences of steps executed in a system Under Test (SUT). Several algorithms for generating the test sequences (paths) that satisfy various test coverage criteria determining their properties are published in the literature. However, existing path-based testing techniques have limited applicability in numerous practical cases, such as when executing a particular test step in the test further excludes the execution of another test step. More complex exclusion requirements (further denoted negative constraints) exist in real systems, depending on the number of executions of a particular test step. In the paper, we discuss two possible negative constraints, namely, (1) the complete exclusion of a step as a consequence of the execution of a particular previous step and (2) the requirement to include a particular step maximally once in one test path, when another step was executed previously. We present a novel ant-colony-optimization (ACO) principle-based algorithm, accepting a SUT model based and a set of negative constraints, and computing a set of test paths while maximizing edge coverage and satisfying the given set of negative constraints. We compare the results of the ACO-based algorithm with those returned by a baseline, an alternative algorithm that excludes specific test paths from a set of test paths satisfying edge coverage, and, for reference, with results returned by an algorithm that generates test paths that satisfy edge coverage. Evaluated on 152 problem instances, the presented ACO-based algorithm outperformed the baseline in the average length of test paths (representing the testing costs) lower by 32.62%. Also, the ratio of edge coverage satisfaction in the set of test paths computed by the ACO-based algorithm is better by 3.41% compared to the baseline.

关键词： Ant colony optimization Costs Computational modeling Software algorithms Software quality Minimization Software reliability

来源：评论

学校读者我要写书评

暂无评论

Dt2f-Tlnet: A Novel Text-Independent Writer Identification Model Using a Combination of Deep Type-2 Fuzzy Architecture and Transfer Learning Networks Based on Handwriting Data

SSRN

引用

SSRN 2023年

作者： Yang, Jing Shokouhifar, Mohammad Yee, Por Lip Khan, Abdullah Ayub Awais, Muhammad Department of Computer System and Technology Faculty of Computer Science and Information Technology Universiti Malaya Kuala Lumpur50603 Malaysia Department of Electrical & Computer Engineering Shahid Beheshti University Tehran*** Iran Department of Computer Science and Information Technology Benazir Bhutto Shaheed University Lyari Karachi75660 Pakistan COMSATS University Islamabad Pakistan

Identifying and verifying the identity of people based on scanned images of handwritten documents is an applicable biometric modality with applications in forensic and historic document investigation, and it is an important study area within the research field of behavioral biometrics. Despite this, there are few studies in this field. Furthermore, there are very few standard datasets for identifying and verify handwritten documents. Also, handwritten documents lose their character during time because of ink spread and drying. Therefore, it is necessary to provide a method that can identify and verify handwritten documents under various uncertainties. In this study, a text-independent writer identification and verification model in offline state under different experimental conditions is developed using a combination of Deep Type-2 Fuzzy architecture and Transfer Learning networks (DT2F-TLNet). So, a right-to-left dataset has been collected. The proposed DT2F-TLNet model is validated using both the designed dataset and other benchmark datasets. The proposed model is distinguished by the fact that it is developed to be independent of the textual content of the handwritten cases and can be used for various languages. The study's findings show that the developed DT2F-TLNet model can learn properties from heterogeneous handwriting data and results in higher accuracy than other comparable approaches. © 2023, The Authors. All rights reserved.

关键词： Biometrics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：