检索结果-南通市图书馆

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

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Hierarchical Parking path Planning Based on Optimal Parking Positions

引用

Automotive Innovation 2023年第2期6卷 220-230页

作者： Yaogang Zhang Guoying Chen Hongyu Hu Zhenhai Gao State Key Laboratory of Automotive Simulation and Control Jilin UniversityChangchunJilinChina

Automated valet parking(AVP)has attracted the attention of industry and academia in recent ***,there are still many challenges to be solved,including shortest path search,optimal time efficiency,and applicability of algorithm in complex *** this paper,a hierarchical AVP path planner is proposed,which divides a complete AVP path planning into the guided layer and the planning layer from the perspective of global *** guided layer is mainly used to divide a complex AVP path planning into several simple path plannings,which makes the hybrid A*algorithm more applicable in a complex parking *** planning layer mainly adopts different optimization methods for driving and parking path *** proposed method is verified by a large number of simulations which include the verification of the optimal parking position,the performance of the planner for perpendicular parking,and the scalability of the planner for parallel parking and inclined *** simulation results reveal that the efficiency of the algorithm is increased by more than 20 times,and the average path length is also shortened by more than 20%.Furthermore,the planner overcomes the problem that the hybrid A*algorithm is not applicable in complex parking scenarios.

关键词： Automated valet parking path planning Hybrid A* Visibility graph shortest path

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Minimizing Maximum Risk for Fair Network Connection with Interval Data

引用

Acta Mathematicae Applicatae Sinica 2010年第1期26卷 33-40页

作者： Jie Hu State Key Laboratory of Rail Traffic Control and Safety Beijing Jiaotong University Beijing 100044 China

In this paper we introduce a minimax model for network connection problems with interval parameters. We consider how to connect given nodes in a network with a path or a spanning tree under a given budget, where each link is associated with an interval and can be established at a cost of any value in the interval. The quality of an individual link （or the risk of link failure, etc.） depends on its construction cost and associated interval. To achieve fairness of the network connection, our model aims at the minimization of the maximum risk over all links used. We propose two algorithms that find optimal paths and spanning trees in polynomial time, respectively. The polynomial solvability indicates salient difference between our minimax model and the model of robust deviation criterion for network connection with interval data, which gives rise to NP-hard optimization problems.

关键词： Network connection interval data shortest path spanning tree minimax approach

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Multi-path Service Function Chaining for Mobile Surveillance of Animal Husbandry

引用

Computers, Materials & Continua 2022年第4期71卷 1959-1971页

作者： Xi Chen Tao Wu Mehtab Afzal School of Computer Science and Engineering Southwest Minzu UniversityChengdu610041China School of Computer Science Chengdu University of Information TechnologyChengdu610225China School of Information and Communication Engineering University of Electronic Science and Technology of ChinaChengduChina Department of Computer Science and IT The University of LahoreLahore54000Pakistan

Animal husbandry is the pillar industry in some ethnic areas of ***,the communication/networking infrastructure in these areas is often underdeveloped,thus the difficulty in centralized management,and challenges for the effective *** the dynamics of the field monitoring environment,as well as the diversity and mobility of monitoring targets,traditional WSN(Wireless Sensor Networks)or IoT(Internet of Things)is difficult to meet the surveillance *** surveillance that features the collaboration of various functions(camera,sensing,image recognition,etc.)deployed on mobile devices is desirable in a volatile wireless *** paper proposes the service function chaining for mobile surveillance of animal husbandry,which orchestrates multi-path multifunction(MPMF)chains to help mobile devices to collaborate in complex surveillance tasks,provide backup chains in case the primary service function chain fails due to mobility,signal strength,obstacle,etc.,and make up for the defects of difficult deployment of monitoring facilities in ethnic *** algorithmmodels both mobile devices and various functions deployed on them as abstract graph nodes,so that chains that are required to traverse various functions and hosting mobile devices can be orchestrated in a single graphbased query through modified and adapted Dijkstra-like algorithms,with their cost ordered *** results show that the proposed MPMF algorithm finds multiple least-costly chains that traverse demanded functions in a timely fashion on Raspberry Pi-equipped mobile devices.

关键词： Service function chaining orchestration surveillance shortest path

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

A New Algorithm for All-pairs shortest paths of Given Source-destination Pair

A New Algorithm for All-pairs Shortest Paths of Given Source...

引用

2008年国际电子商务、工程及科学领域的分布式计算和应用学术研讨会

作者： Tianzhi Li Fengsheng Xu Department of Computer Science and Technology,Dezhou University,Dezhou,Shandong,253023,China

A new algorithm to find all the shortest paths from a specified source vertex to each other vertex is proposed in this paper through analyzing the most efficient algorithms-Dijkstra's *** data structure used in this a... 详细信息

关键词： shortest path Dijkstra's algorithm predecessors successors list contrazy predecessors list graph

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Small-worldness of brain networks after brachial plexus injury: a resting-state functional magnetic resonance imaging study

引用

Neural Regeneration Research 2018年第6期13卷 1061-1065页

作者： Wei-Wei Wang Ye-Chen Lu Wei-Jun Tang Jun-Hai Zhang Hua-Ping Sun Xiao-Yuan Feng Han-Qiu Liu Department of Radiology Huashan Hospital Fudan University Department of Hand Surgery Huashan Hospital Fudan University

Research on brain function after brachial plexus injury focuses on local cortical functional reorganization,and few studies have focused on brain networks after brachial plexus *** in brain networks may help understanding of brain plasticity at the global *** hypothesized that topology of the global cerebral resting-state functional network changes after unilateral brachial plexus ***,in this cross-sectional study,we recruited eight male patients with unilateral brachial plexus injury（right handedness,mean age of 27.9±5.4years old）and eight male healthy controls（right handedness,mean age of 28.6±3.2）.After acquiring and preprocessing resting-state magnetic resonance imaging data,the cerebrum was divided into 90 regions and Pearson’s correlation coefficient calculated between *** correlation matrices were then converted into a binary matrix with affixed sparsity values of 0.1–*** sparsity conditions,both groups satisfied this small-world *** clustering coefficient was markedly lower,while average shortest path remarkably higher in patients compared with healthy *** findings confirm that cerebral functional networks in patients still show smallworld characteristics,which are highly effective in information transmission in the brain,as well as normal ***,varied small-worldness suggests that capacity of information transmission and integration in different brain regions in brachial plexus injury patients is damaged.

关键词： nerve regeneration brachial plexus injury functional magnetic resonance imaging small-world network small-world property topology properties functional reorganization clustering coefficient shortest path peripheral nerve injury neural regeneration

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Evaluating user cognition of network diagrams

引用

Visual Informatics 2021年第4期5卷 26-33页

作者： Xiaojiao Chen Xiaoteng Tang Zijing Luo Jiayi Zhang School of Art and Archaeology Zhejiang UniversityHangzhouchina College of Computer Science and Technology Zhejiang UniversityHang zhouChina School of Mechanical Engineering Southeast UniversityNanjingChina

Edges crossing and nodes overlapping have a significant effect on the users’recognition and comprehension of network *** this study,we propose a visual evaluation method for users’cognition of network ***,this method carries out a set of cognitive experiments to collect the user’s cognitive performance that affects the variables,including accuracy and response *** user’s pupil diameter is measured through an eye tracker to reflect their cognitive ***,the significance test points out the visual features as independent variables and then establishes an evaluation regression *** experimental results show that the number of edges,edge length,node visual interference,and edge occlusion contribute to the evaluation models of response time,and edge occlusion and the number of node connections contribute to the accuracy ***,these evaluation models demonstrate good predictability when assessing users’cognition of network diagrams and provide practical recommendations for their use.

关键词： Network diagram shortest path Eye tracking Cognitive evaluation

来源：

维普期刊数据库评论

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Study on Applying Optimal path to Land Valuation

引用

Geo-Spatial Information Science 2006年第1期9卷 49-54页

作者： WANG Wei DONG Fei SHI Lite CAO Fang State Key Laboratory of Information Engeering in Surveying. Mapping and Remote Sensing. Wuhan University 129 Luoyu Road Wuhan 430079 China

As an important role in the urban land price system, the basic land price appraisal directs and refleets all kinds of land price in the real estate market. Using geographic information systems （GIS） with algo rithms and powerful analysis functions to valuate land will improve the rationality and convenience of land valu- ation. The objective of the study on basic land price using the optimal path algorithm is to decrease the man made error, enhance automatization, avoid make inconvenience by roadblock object.

关键词： GIS optimal path shortest path land price appraisal land valuation basic land price

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Prioritization of orphan disease-causing genes using topological feature and GO similarity between proteins in interaction networks

引用

Science China(Life Sciences) 2014年第11期57卷 1064-1071页

作者： LI Min LI Qi GANEGODA Gamage Upeksha WANG JianXin WU FangXiang PAN Yi School of Information Science and Engineering Central South University College of Engineering University of Saskatchewan Department of Computer Science Georgia State University

Identification of disease-causing genes among a large number of candidates is a fundamental challenge in human disease ***,it is still time-consuming and laborious to determine the real disease-causing genes by biological *** the advances of the high-throughput techniques,a large number of protein-protein interactions have been ***,to address this issue,several methods based on protein interaction network have been *** this paper,we propose a shortest path-based algorithm,named SPranker,to prioritize disease-causing genes in protein interaction *** the fact that diseases with similar phenotypes are generally caused by functionally related genes,we further propose an improved algorithm SPGOranker by integrating the semantic similarity of gene ontology(GO)*** not only considers the topological similarity between protein pairs in a protein interaction network but also takes their functional similarity into *** proposed algorithms SPranker and SPGOranker were applied to 1598 known orphan disease-causing genes from 172 orphan diseases and compared with three state-of-the-art approaches,ICN,VS and *** experimental results show that SPranker and SPGOranker outperform ICN,VS,and RWR for the prioritization of orphan disease-causing ***,for the case study of severe combined immunodeficiency,SPranker and SPGOranker predict several novel causal genes.

关键词： disease-causing genes prioritization gene ontology protein interaction network shortest path

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Improving Centralized path Calculation Based on Graph Compression

引用

China Communications 2018年第6期15卷 120-124页

作者： Zhenglian Li Lixin Ji Ruiyang Huang Shuxin Liu National Digital Switching System Engineering&Technological R&D Center ZhengzhouChina

shortest-path calculation on weighted graphs are an essential operation in computer networks. The performance of such algorithms has become a critical challenge in emerging software-defined networks(SDN),since SDN controllers need to centralizedly perform a shortest-path query for every flow,usually on large-scale network. Unfortunately,one of the challenges is that current algorithms will become incalculable as the network size increases. Therefore, inspired by the compression graph in the field of compute visualization,we propose an efficient shortest path algorithm by compressing the original big network graph into a small one, but the important graph properties used to calculate path is reserved. We implement a centralized version of our approach in SDN-enabled network,and the evaluations validate the improvement compared with the well-known algorithms.

关键词： graph representation path compression shortest path

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：