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

6th International Conference on Electronics and Information Engineering (ICEIE)

作者： Zhang, Nan Wang, Hao Luo, Sida Fu, Min Ge, Yuechun Southeast Univ Jiangsu Key Lab Urban ITS Nanjing 210096 Jiangsu Peoples R China Jiangsu Prov Collaborat Innovat Ctr Modern Urban Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781510600294

Considering the travel time and transfer frequency, transit passengers will choose to walk between two bus stops within an acceptable distance, which was rarely discussed by previous research on transit shortest path problem. This paper proposes a practical shortest path algorithm taking walking behavior into consideration. The algorithm can describe passengers' behavior when they select travel routes. The feasibility and efficiency of this algorithm has also been preliminarily tested through an example by comparing with the existing shortest path algorithms.

关键词： shortest path algorithm transit network walking behavior global optimum

来源：评论

学校读者我要写书评

暂无评论

Numerical Method with High Real-time Property Based on shortest path algorithm for Optimal Control

引用

INTERNATIONAL JOURNAL OF CONTROL AUTOMATION AND SYSTEMS 2021年第6期19卷 2038-2046页

作者： Liao, Wei Wei, Xiaohui Lai, Jizhou Sun, Hao Nanjing Univ Aeronaut & Astronaut Key Lab Fundamental Sci Natl Defense Adv Design T Nanjing Jiangsu Peoples R China Nanjing Univ Aeronaut & Astronaut State Key Lab Mech & Control Mech Struct Nanjing Jiangsu Peoples R China Nanjing Univ Aeronaut & Astronaut Coll Automat Engn Nanjing 210001 Peoples R China

A numerical method consisting of an off-line part and an on-line part for optimal control problems is proposed in this paper. In the off-line part, the state space is discretized into a Cartesian grid structure and then define a graph over all grid points by connecting two points if the Euclidean norm between them is closer than a positive number called adjacent radius, the minimum cost between them is estimated using difference method and stored in a matrix. After that the matrix is updated by a shortest path algorithm and a matrix holding the information of the shortest paths between any two grid points is generated. In the on-line part, the optimal control vector at each time step can be generated by reading data from the matrix according to the current state and target state and doing some simple calculations. Since there is no need to do a lot of calculation in the on-line part, this method can satisfy the real-time requirements in some engineering control problems. We prove that the solution of the proposed method converge to the analytical solution when the adjacent radius and the grid size tend to zero and the grid size tend is a higher order infinitesimal of the adjacent radius. At the end of this paper, some numerical examples are taken to illustrate the effectiveness of the proposed method.

关键词： Dynamic system optimal control shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Application of the shortest path algorithm for the Discovery of Breast Cancer-Related Genes

引用

CURRENT BIOINFORMATICS 2016年第1期11卷 51-58页

作者： Chen, Lei Xing, ZhiHao Huang, Tao Shu, Yang Huang, GuoHua Li, Hai-Peng Shanghai Maritime Univ Coll Informat Engn Shanghai 201306 Peoples R China Shanghai Jiao Tong Univ Sch Med Inst Hlth Sci Key Lab Stem Cell Biol Shanghai 200025 Peoples R China Chinese Acad Sci Shanghai Inst Biol Sci Shanghai 200025 Peoples R China Icahn Sch Med Mt Sinai Dept Genet & Genom Sci New York NY 10029 USA Shanghai Jiao Tong Univ Sch Med Inst Hlth Sci State Key Lab Med Genom Shanghai 200025 Peoples R China Shanghai Univ Inst Syst Biol Shanghai 200444 Peoples R China Chinese Acad Sci Shanghai Inst Biol Sci CAS MPG Partner Inst Computat Biol Shanghai 200031 Peoples R China

Breast cancer, the most prevalent cancer in women, develops from breast tissue. Its incidence has increased in recent years due to environmental risk factors. Thus, it is urgent to uncover the mechanism underlying breast cancer to design effective treatments. Identification of all breast cancer-related genes is one way to help elucidate the underlying breast cancer mechanism. In this study, a computational method was built and applied to discover new candidate breast cancer-related genes. Based on the known breast cancer-related genes retrieved from public databases, the shortest path algorithm was applied to discover new candidate genes in the protein-protein interaction network. The analysis results of the selected genes suggest that some of them are deemed breast cancer-related genes according to the most recent published literature, while others have direct or indirect associations with the initiation and development of breast cancer.

关键词： Betweenness breast cancer disease gene protein-protein interaction shortest path algorithm weighted network

来源：评论

学校读者我要写书评

暂无评论

Object Co-Segmentation Based on shortest path algorithm and Saliency Model

引用

IEEE TRANSACTIONS ON MULTIMEDIA 2012年第5期14卷 1429-1441页

作者： Meng, Fanman Li, Hongliang Liu, Guanghui Ngan, King Ngi Univ Elect Sci & Technol China Sch Elect Engn Chengdu 610073 Peoples R China Chinese Univ Hong Kong Dept Elect Engn Shatin Hong Kong Peoples R China

Segmenting common objects that have variations in color, texture and shape is a challenging problem. In this paper, we propose a new model that efficiently segments common objects from multiple images. We first segment each original image into a number of local regions. Then, we construct a digraph based on local region similarities and saliency maps. Finally, we formulate the co-segmentation problem as the shortest path problem, and we use the dynamic programming method to solve the problem. The experimental results demonstrate that the proposed model can efficiently segment the common objects from a group of images with generally lower error rate than many existing and conventional co-segmentation methods.

关键词： Co-saliency co-segmentation shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Analysis for shortest path algorithm on convex polytope in E³

引用

ELECTRONICS LETTERS 2000年第22期36卷 1895-1897页

作者： Lee, YS Lee, ES Sungkyunkwan Univ Sch Elect & Comp Engn Suwon 440746 South Korea

Hershberger and Suri proposed an extremely simple approximation scheme for computing shortest paths on the surface of a convex polytope in three dimensions in 1998. Given a convex polytope P with n vertices and two points p, q on irs surface, let d(p)(p, q) denote the shortest path distance between p and q on the surface of P. Their algorithm, shortestpath, produces a path of length at most 2d(p)(p, q) in time O(n). This algorithm is revised, and achieves a ratio of 1.786.

关键词： approximation scheme shortest path algorithm computational geometry Computational geometry convex polytope Combinatorial mathematics shortestpath

来源：评论

学校读者我要写书评

暂无评论

Identification of Genes Associated with Breast Cancer Metastasis to Bone on a Protein-Protein Interaction Network with a shortest path algorithm

引用

JOURNAL OF PROTEOME RESEARCH 2017年第2期16卷 1027-1038页

作者： Cai, Yu-Dong Zhang, Qing Zhang, Yu-Hang Chen, Lei Huang, Tao Shanghai Univ Sch Life Sci Shanghai 200111 Peoples R China Chinese Acad Sci Shanghai Inst Biol Sci Inst Hlth Sci Shanghai 200031 Peoples R China Shanghai Maritime Univ Coll Informat Engn Shanghai 201306 Peoples R China

Tumor metastasis is defined as the spread of tumor cells from one organ or part to another that is not directly connected to it, which significantly contributes to the progression and aggravation of tumorigenesis. Because it always involves multiple organs, the metastatic process is difficult to study in its entirety. Complete identification of the genes related to this process is an alternative way to study metastasis. In this study, we developed a computational method to identify such genes. To test our method, we selected breast cancer bone metastasis. A large network was constructed using human protein-protein interactions. On the basis of the validated genes related to breast and bone cancer, a shortest path algorithm was applied to the network to search for novel genes that may mediate breast cancer metastasis to bone. In addition, further rules constructed using the permutation FDR, the betweenness ratio, and the maxmin interaction score were also employed in the method to make the inferred genes more reliable. Eighteen putative genes were identified by the method and were extensively analyzed. The confirmation results indicate that these genes participate in metastasis.

关键词： breast cancer metastasis to bone breast cancer bone cancer protein-protein interaction shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Investigation of the roles of trace elements during hepatitis C virus infection using protein-protein interactions and a shortest path algorithm

引用

BIOCHIMICA ET BIOPHYSICA ACTA-GENERAL SUBJECTS 2016年第11期1860卷 2756-2768页

作者： Zhu, LiuCun Chen, XiJia Kong, Xiangyin Cai, Yu-Dong Shanghai Univ Sch Life Sci Shanghai 200444 Peoples R China Chinese Acad Sci Shanghai Inst Biol Sci Inst Hlth Sci Key Lab Stem Cell Biol Shanghai 200025 Peoples R China

Background: Hepatitis is a type of infectious disease that induces inflammation of the liver without pinpointing a particular pathogen or pathogenesis. Type C hepatitis, as a type of hepatitis, has been reported to induce cirrhosis and hepatocellular carcinoma within a very short amount of time. It is a great threat to human health. Some studies have revealed that trace elements are associated with infection with and immune rejection against hepatitis C virus (HCV). However, the mechanism underlying this phenomenon is still unclear. Methods: In this study, we aimed to expand our knowledge of this phenomenon by designing a computational method to identify genes that may be related to both HCV and trace element metabolic processes. The searching procedure included three stages. First, a shortest path algorithm was applied to a large network, constructed by protein-protein interactions, to identify potential genes of interest. Second, a permutation test was executed to exclude false discoveries. Finally, some rules based on the betweenness and associations between candidate genes and HCV and trace elements were built to select core genes among the remaining genes. Results: 12 lists of genes, corresponding to 12 types of trace elements, were obtained. These genes are deemed to be associated with HCV infection and trace elements metabolism. Conclusions: The analyses indicate that some genes may be related to both HCV and trace element metabolic processes, further confirming the associations between HCV and trace elements. The method was further tested on another set of HCV genes, the results indicate that this method is quite robustness. General significance: The newly found genes may partially reveal unknown mechanisms between HCV infection and trace element metabolism. This article is part of a Special Issue entitled "System Genetics" (C) 2016 Elsevier B.V. All rights reserved.

关键词： HCV Trace element shortest path algorithm Protein-protein interaction Permutation test

来源：评论

学校读者我要写书评

暂无评论

Development and Implementation of Enhanced shortest path algorithm for Navigation of Mobile Robot for Warehouse Automation (MRWA) 7

Development and Implementation of Enhanced Shortest Path Alg...

引用

7th International Electrical Engineering Congress (iEECON)

作者： Habib, Hasan Waseem, Saad Ghafoor, Abdul Hannan Natl Univ Sci & Technol Dept Mechatron Engn Islamabad Pakistan Natl Univ Comp & Emerging Sci Islamabad Pakistan

ISBN: (纸本)9781728107295

This paper presents development and implementation of a unique shortest path algorithm for navigation of mobile robot in a dynamic environment. A grid of passive RFID (Radio Frequency Identification) tags is utilized for the localization of swarm robots in the warehouse. The RFID tags, the mobile robots and the remote Control unit are the key components for the MRWA algorithm. On the desire of the robots are able to move objects in parallel from one place of the warehouse to another in an efficient and effective manner. Control unit controls the movement of all robots and navigate the selected robot to the desired location using shortest path MRWA algorithm. The algorithm also takes consideration of obstacles placed in the path, avoiding the collision of The validity of the design was also tested and verified by practical implementation of a 5x5 gird in an experimental lab environment.

关键词： Mobile robot warehouse automation artificial intelligence shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

A shortest path algorithm based on limited search heuristics

A shortest path algorithm based on limited search heuristics

引用

International Computer Science Symposium in Russia (CSR 2006)

作者： Lu, Feng Lai, Poh-Chin Chinese Acad Sci Inst Geog Sci & Nat Resources Res State Key Lab Resources & Environm Informat Syst Beijing 100101 Peoples R China Univ Hong Kong Dept Geog Hong Kong Hong Kong Peoples R China

ISBN: (纸本)3540341668

Dijkstra's algorithm is arguably the most popular computational solution to finding single source shortest paths. Increasing complexity of road networks, however, has posed serious performance challenge. While heuristic procedures based on geometric constructs of the networks would appear to improve performance, the fallacy of depreciated accuracy has been an obstacle to the wider application of heuristics in the search for shortest paths. The authors presented a shortest path algorithm that employs limited search heuristics guided by spatial arrangement of networks. The algorithm was tested for its efficiency and accuracy in finding one-to-one and one-to-all shortest paths among systematically sampled nodes on a selection of real-world networks of various complexity and connectivity. Our algorithm was shown to outperform other theoretically optimal solutions to the shortest path problem and with only little accuracy lost. More importantly, the confidence and accuracy levels were both controllable and predictable.

关键词： shortest path algorithm road network heuristic

来源：评论

学校读者我要写书评

暂无评论

Parallel Bidirectional Dijkstra's shortest path algorithm

引用

9th International Baltic Conference on Databases and Information Systems (Baltic DBandIS)

作者： Vaira, Gintaras Kurasova, Olga Vilnius State Univ Inst Math & Informat LT-08663 Vilnius Lithuania

ISBN: (纸本)9781607506881;9781607506874

This paper deals with Dijkstra's shortest path algorithm and with the possibilities of speeding-up this algorithm. This algorithm is a breadth-first-search algorithm. The search spreads circularly around the source node in order to find the shortest path from the source node to other nodes. Each following iteration is based on the results of the previous iteration, therefore parallelization of such an algorithm is complicated. The parallel Dijkstra algorithm, proposed in this paper, is based on the bidirectional Dijkstra algorithm and popular multicore technology. Such a technology enables to create a parallel algorithm based on the shared memory and most of the time for data synchronization thereby is saved. The proposed algorithm has been tested using the real road network data. The proposed parallel algorithm is almost 3 times faster than the standard Dijkstra algorithm.

关键词： shortest path algorithm Dijkstra's algorithm parallel computing multithreading

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：