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

2nd International Conference on Instrumentation and Measurement, Computer, Communication and Control (IMCCC)

作者： Zhao Jian-peng Guo Shi-ze Zheng Kang-feng Hu Yi-xun Dai Fang-fang Beijing Univ Posts & Telecommun Informat Secur Ctr Beijing 100876 Peoples R China Northern Elect Instrument Inst Beijing 100191 Peoples R China

ISBN: (纸本)9780769549354

A routing computation strategy based on improved clustering algorithm is proposed in this paper. It uses a clustering algorithm based on K-means and dijkstra (CAKD) in topology partitioning. The routing information of each node can be computed during the clustering process, and CAKD reduces the time cost in routing computation and the storage in storing routing information. Experiments showed that, compared with using dijkstra to cluster, CAKD cost less time. Meanwhile, compared with the strategy of global shortest path, the routing computation strategy based on improved clustering algorithm costs less storage in storing routing information.

关键词： routing computation strategy K-means algorithm dijkstra algorithm topology partitioning

来源：评论

学校读者我要写书评

暂无评论

An Optimize Particle Swarm Optimization Routing algorithm for Data Transmission in Cognitive Radio Networks

An Optimize Particle Swarm Optimization Routing Algorithm fo...

引用

10th International Symposium on Electronics and Telecommunications (ISETC)

作者： Simion, Daniel Graur, Adrian Alexandru, Lavric Stefan, Sfichi Mahdi, Ali Haider Stefan Cel Mare Univ Suceava Elect Engn & Telecommun Dept Suceava Romania Tech Univ Ilmenau Integrated Commun Syst Grp Ilmenau Germany

ISBN: (纸本)9781467311762

In this paper it is propose a routing algorithm using PSO (Particle Swarm Optimization). The PSO outperforms the classical dijkstra algorithm in that PSO could handle multi-objective routing problems while the dijkstra cannot. A simulation model was build where PSO is distributed implemented and the optimum route is calculated on each node until destination is reached. This distributed approach gives the proposed algorithm extra avails in that no centralized arbiter is needed. The optimization also considers supporting Quality-of-Service (QoS) to routing in CRNs. It has been shown that algorithm would adapt multi-hop routing according to different QoS requirements, which makes it achievable in future CRNs.

关键词： dijkstra algorithm optimization PSO routes

来源：评论

学校读者我要写书评

暂无评论

The Shortest Path algorithm Based on Petri Net

The Shortest Path Algorithm Based on Petri Net

引用

2012 IEEE 19th International Conference on Industrial Engineering and Engineering Management(IE&EM 2012)

作者： Yu-jie Zheng Kai-hu Hou Wei-zhen Liao Lin Yang Department of Industrial Engineering Kunming University of Science and Technology

The dijkstra algorithm is the classic algorithm to solve the shortest path problem, but the solving process is relatively complicated. As the visual graphics ability and good computer skills of Petri Net, it is used to solve the shortest path problem, and according to the thought of directed Petri Net and transition enabled rules, Petri Net algorithm of solving the shortest path problem is designed. Compared to the dijkstra algorithm, this algorithm which omits the P, T tabs and λ, S functions of the dijkstra algorithm, can make the solution of the shortest path simpler and more convenient, improve the solution efficiency, and at the same time provide convenience for achieving algorithm objectively using computer.

关键词： dijkstra algorithm Petri Net algorithm Petri Net of directed network the shortest path problem

来源：评论

学校读者我要写书评

暂无评论

Research of Shortest Path algorithm Based on the Data Structure

Research of Shortest Path Algorithm Based on the Data Struct...

引用

2012 IEEE 3rd International Conference on Software Engineering and Service Science（ICSESS 2012）

作者： Jinhao Lu Department of Computer Science Northeast Petroleum University at Qin Huangdao Qin Huangdao,ChinaChi Dong Petroleum Engineering Institute Northeast Petroleum University Da Qing,China

The shortest path problem based on the data structure has become one of the hot research topics in graph *** the basic theory of solving this problem,dijkstra algorithm has been widely used in engineering *** at the shortcomings of traditional dijkstra algorithm,this paper has proposed an optimization method which has mainly improved the nodes selection of the shortest path and data storage structure and *** comparison and analysis,the improved algorithm has been obtained,which has reduced the storage space,improved the operational efficiency and has a better applicability in the shortest path calculation.

关键词： data structure shortest path dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Signal quantization by variation

引用

INTERNATIONAL JOURNAL OF ADAPTIVE CONTROL AND SIGNAL PROCESSING 2011年第12期25卷 1061-1073页

作者： Kaempke, Thomas InMach Intelligente Maschinen GmbH D-89077 Ulm Germany

Real-valued data are quantized according to the magnitude of their fluctuations around regional mean values or around a given, real-valued signal. Quantization does not require any parameter or threshold value except the desired number of regions. By the introduction of suitable fluctuation measures and a so-called change point graph, the determination of a minimum quantization is transformed to the computation of the shortest path with a prescribed number of intermediate nodes. Such shortest paths are shown to be computable by dynamic programming and by a variation of the dijkstra algorithm. Evaluations and extensions of the approach are included. Copyright (C) 2011 John Wiley & Sons, Ltd.

关键词： absolute distances change points dijkstra algorithm dynamic programming robustness shortest paths

来源：评论

学校读者我要写书评

暂无评论

Shortest path problem with uncertain arc lengths

引用

COMPUTERS & MATHEMATICS WITH APPLICATIONS 2011年第6期62卷 2591-2600页

作者： Gao, Yuan Tsinghua Univ Dept Math Sci Beijing 100084 Peoples R China

Uncertainty theory provides a new tool to deal with the shortest path problem with nondeterministic arc lengths. With help from the operational law of uncertainty theory, this paper gives the uncertainty distribution of the shortest path length. Also, it investigates solutions to the a-shortest path and the most shortest path in an uncertain network. It points out that there exists an equivalence relation between the alpha-shortest path in an uncertain network and the shortest path in a corresponding deterministic network, which leads to an effective algorithm to find the alpha-shortest path and the most shortest path. Roughly speaking, this algorithm can be broken down into two parts: constructing a deterministic network and then invoking the dijkstra algorithm. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Shortest path problem Uncertainty theory Uncertain programming dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Design of suitable permutations for irregular turbo codes

引用

ELECTRONICS LETTERS 2011年第13期47卷 748-U34页

作者： Ben Ismail, D. Kbaier Douillard, C. Kerouedan, S. CNRS UMR 3192 Lab STICC Inst TelecomTechnopole Brestiroise CS 83818 F-29238 Brest 3 France Univ Europeenne Bretagne Bretagne France

Proposed is a method based on the dijkstra's algorithm and an estimation of the distance to search for efficient interleavers, adapted to irregular turbo codes, in order to reduce the flattening effect. Simulation... 详细信息

关键词： dijkstra algorithm distance estimation error floor flattening effect graph theory interleaved codes irregular turbo code permutation design turbo codes

来源：评论

学校读者我要写书评

暂无评论

An Efficient algorithm to Create a Loop Free Backup Routing Table

引用

3rd International Conference on Wireless, Mobile Networks, and Applications/1st International Conference on Computer Science, Engineering and Applications

作者： Abujassar, Radwan S. Ghanbari, Mohammed Univ Essex Sch Comp Sci & Elect Engn Colchester CO4 3SQ Essex England

ISBN: (纸本)9783642211522

Traditional routing protocols schemes allow traffic to pass via the single shortest path. Pre-computing an alternative aims to route the traffic through it when the primary path goes down. A new algorithm schema has been proposed in this paper to find an alternative and disjoint path with primary one by creating a new backup routine table based on adjacent nodes for each node connected with the primary one. The results showing that loss packets, reroute and end to end delay times have been improved between source and destination with avoid loops on the network. The result obtained showed that new schema does not degrade from the network performance by sending an additional messages to create a new backup routing table. The Simulation results (using NS2 simulator) show a comparison between existing link state protocol and the proposed algorithm.

关键词： component Link state ART (Alternative Routing Table) dijkstra algorithm

来源：评论

学校读者我要写书评

暂无评论

Multi-Modal Transportation Advisor system

Multi-Modal Transportation Advisor system

引用

2011 IEEE Forum on Integrated and Sustainable Transportation Systems, FISTS 2011

作者： Ferreira, João C. Filipe, Porfirio Silva, Alberto ADEETC - ISEL Lisbon Portugal Inesc-ID Lisbon Portugal

ISBN: (纸本)9781457709906

The current work deals with the problem of growing population in the cities and the associated mobility problems. For this problem it is proposed a Multi-Modal Transportation Advisor system, based on the integration from different data sources such as public transportation systems, car and bike sharing or car pooling. Taking into account real time traffic information the system shows best option for a user goes from point A to a point B and calculates the associated trip cost. This is part of the European Project START, where we show the contribution of a public transportation ontology for different DB integration and a best path advisor based on an appropriate dijkstra's algorithm implementation. © 2011 IEEE.

关键词： Cities and towns dijkstra algorithm European Project START Mobile communication Ontologies Optimized production technology Roads Schedules associated mobility problem bike sharing car pooling multimodal transportation advisor system ontologies (artificial intelligence) path advisor public information systems public transportation ontology public transportation system real time traffic information traffic information systems

来源：评论

学校读者我要写书评

暂无评论

Ambulance response modeling using a modified speed-density exponential model

Ambulance response modeling using a modified speed-density e...

引用

14th International IEEE Conference on Intelligent Transportation Systems (ITSC)

作者： Haas, Olivier C. Coventry Univ Control Theory & Applicat Ctr Coventry W Midlands England

ISBN: (纸本)9781457721977

individual ambulance velocity and response time to a single incident. Existing lane based models have been modified by formulating mathematically emergency vehicle capability and behavior in the UK. The model is applied to calculate travel time. The velocity is simulated for different scenario of city environments. The response time of the ambulance is then calculated using a dijkstra algorithm. The model is shown to provide the means to differentiate ambulance travel time compared to non emergency road users.

关键词： dijkstra algorithm Green products Image color analysis Junctions Mathematical model Roads Routing Vehicles ambulance response modeling ambulance travel time ambulance velocity city environments emergency services emergency vehicle capability graph theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：