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

AIAA Aviation Forum and Exposition

作者： Zaninotto, Stefano Gauci, Jason Farrugia, Geoffrey Debattista, Johan Univ Malta Inst Aerosp Technol Msida 2080 Msd Malta HandsOn Syst Ltd Mosta 3000 Mst Malta Malta Air Traff Serv Ltd Luqa 4000 Lqa Malta

ISBN: (数字)9781624105890

ISBN: (纸本)9781624105890

One of the solutions proposed by the aerospace industry to reduce fuel consumption, air pollution and noise at an airport consists of using electric tow trucks to tow aircraft from the gate to the runway (or vice-versa). However, the introduction of tow trucks would result in an increase in vehicle traffic at the airport, potentially increasing the workload of Air Traffic Controllers (ATC). This paper proposes an algorithm - based on Dijkstra's algorithm - and a Human Machine Interface (HMI) concept to optimise airport taxi operations with autonomous tow trucks at a strategic level, while keeping ATC in the loop. Preliminary tests of the algorithm have been carried out using simulated traffic data for Malta International Airport (MIA) and the results show that the algorithm can be tuned to minimise the average vehicle taxi delay or the number of unresolved vehicle conflicts. It is also shown that, in certain cases, both the taxi delay and the number of conflicts can be reduced through a minor adjustment of the Off-Block Time (OBT) of departing aircraft.

关键词： Commercial Aircraft Human In The Loop Runway Holding Position shortest path algorithms Air Traffic Controller Aerospace Industry Fuel Consumption Aircraft Hangars Optimization Algorithm Aircraft Stand

来源：评论

学校读者我要写书评

暂无评论

A Reinforcement Learning Approach for Evaluation of Disaster Relief

A Reinforcement Learning Approach for Evaluation of Disaster...

引用

International Conference on Cutting-edge Technologies in Engineering (ICon-CuTE)

作者： Gajanan Walunjkar Anne Koteswara Rao Computer Science and Engineering Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology Chennai India

ISBN: (纸本)9781728100012

Ad hoc networks are considered more suitable for disaster scenarios due to infrastructure-less feature. Existing routing algorithms used on such mobile ad hoc networks are non-adaptive routing algorithms and based on shortest path algorithms. But shortest path may not give optimum path. If the network is heavy loaded with traffic, shortest path may not give better results. Various reinforcement algorithms are used to design such adaptive routing where the routing takes place based on the actual traffic present on a network. One of the reinforcement routing algorithms is Q routing and various variants of Q routing like CQ routing, CDRQ routing etc. In this paper, Q routing and CDRQ routing are implemented and compared using disaster area mobility model in disaster area scenario.

关键词： disasters learning (artificial intelligence) mobile ad hoc networks telecommunication computing telecommunication network routing telecommunication traffic Mobile ad hoc networks telecommunication computing telecommunication network routing telecommunication traffic Network routing Disaster relief Routing algorithms disaster area Disasters shortest path shortest path algorithms optimal path

来源：评论

学校读者我要写书评

暂无评论

Ontological Approach for Knowledge Extraction from Clinical Documents

Ontological Approach for Knowledge Extraction from Clinical ...

引用

IEEE International Conference on Bioinformatics and Biomedicine

作者： Raxit Goswami Vatsal Shah Nehal Shah Chetan Moradiya Research Lab ezDI Inc.

ISBN: (纸本)9781728118680

In clinical NLP (Natural Language Processing), Knowledge extraction is a very important task to develop a highly accurate information retrieval system. The various approaches used to develop such systems include rule-based approach, statistical approach, shortest path algorithm or hybrid of these approaches. Accuracy and coverage are the most important parameters while comparing different approaches. Some methodologies have good accuracy but low coverage and vice-versa. In this paper, our focus is to extract domain relationships, for example to extract the relationship between 'Disease' and 'Procedure' or 'Symptom' and 'Disease' etc. from the clinical documents using three different approaches. These three approaches are i) Statistical ii) shortest path iii) shortest path Using Body System. All three approaches use our in-house existing NLP system to extract entities from the un-structured documents. The Statistical approach applies a probabilistic algorithm on clinical documents, whereas the shortest path algorithm uses the Ontological knowledge base for the hierarchical relationship between entities. This Ontological knowledge base is built upon the curated Unified Medical Language System (UMLS). For the shortest path Using Body System approach, we have used the domain relationship as well as hierarchical relationship. The output of these approaches is further validated by a domain expert and this validated relationship is used to enrich our ontological knowledge base. We have presented the details of these approaches one-by-one along with the comparative results of these approaches. We finally go through the analysis of the result and conclude on further work.

关键词： Knowledge Extraction Clinical information retrieval Relationship Extraction Clinical Document Medical knowledge base Ontology Clinical NLP (Natural Language Processing) Information Extraction shortest path Body Systems Ontology Knowledge Bases hierarchical relationships Unified Medical Language System Natural Language Processing shortest path algorithms Information Retrieval Systems

来源：评论

学校读者我要写书评

暂无评论

Parallelization of shortest path Algorithm Using OpenMP and MPI

Parallelization of Shortest Path Algorithm Using OpenMP and ...

引用

International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)

作者： Awari, Rajashri Yeshwantrao Chavan Coll Engn Dept Info Tech Nagpur Maharashtra India

ISBN: (纸本)9781509032433

Graph problem solve by using the standard graph Algorithm. Example isLarge matrix problems, graphs solving problems, equations etc. There is a representation of two algorithms. The algorithm to find all pair shortest path is Floyd War shall algorithm, single source shortest path is Dijkstra'salgorithm. These two algorithm implement in serial formulation. Parallel algorithm is considerably effective for large graph size. By using these algorithm find the shortest distance, such as city to city, routing, networking, social media. Parallel algorithm used for calculating or finding shortest path of graph. With the help of graph algorithm these operations can be done in parallel and reduce the computation time and efficiency. All pair shortest path problem apply for directed and undirected graph whose finite nodes and edges in un-weighted and undirected graph.

关键词： shortest path algorithms OpenMP MPI

来源：评论

学校读者我要写书评

暂无评论

Deep Learning Models for Route Planning in Road Networks

Deep Learning Models for Route Planning in Road Networks

引用

作者： TIANYU ZHOU KTH ROYAL INSTITUTE OF TECHNOLOGY

学位级别：硕士

Traditional shortest path algorithms can efficiently find the optimal paths in graphs using simple heuristics. However, formulating a sim- ple heuristic is challenging under the road network setting since there are multiple factors to consider, such as road segment length, edge cen- trality, and speed limit. This study investigates how a neural network can learn to take these factors as inputs and yield a path given a pair of origin and destination. The research question is formulated as: Are neural networks applicable to real-time route planning tasks in a road network?. The proposed metric to evaluate the effectiveness of the neu- ral network is arrival rate. The quality of generated paths is evalu- ated by time efficiency. The real-time performance of the model is also compared between pathfinding in dynamic and static graphs, using the above metrics. A staggered approach is applied in progressing this investigation. The first step is to generate random graphs, which allows us to monitor the size and properties of the training graph without caring too many de- tails in a road network. The next step is to determine, as a proof of con- cept, if a neural network can learn to traverse simple graphs with mul- tiple strategies, given that road networks are in effect complex graphs. Finally, we scale up by including factors that might affect the pathfind- ing in real road networks. Overall, the training data is optimal paths in a graph generated by a shortest path algorithm. The model is then applied to new graphs to generate a path given a pair of origin and des- tination. The arrival rate and time efficiency are calculated and com- pared with that of the corresponding optimal path. Experimental results show that the effectiveness, i. e., arrival rate of the model is 90% and the path quality, i. e., time efficiency has a median of 0.88 and a large variance. The experiment shows that the model has better performance in dynamic graphs than in static graphs. Overall, the

关键词： Route Planning pathfinding shortest path algorithms Road Networks Deep Learning Neural Networks

来源：评论

学校读者我要写书评

暂无评论

Communication Systems Principles Using MATLAB 1

引用

丛书名： []

2018年

作者： John W. Leis

ISBN: (数字)9781119470687

ISBN: (纸本)9781119470670

Discover the basic telecommunications systems principles in an accessible learn-by-doing format Communication Systems Principles Using MATLAB covers a variety of systems principles in telecommunications in an accessible format without the need to master a large body of theory. The text puts the focus on topics such as radio and wireless modulation, reception and transmission, wired networks and fiber optic communications. The book also explores packet networks and TCP/IP as well as digital source and channel coding, and the fundamentals of data encryption. Since MATLAB® is widely used by telecommunications engineers, it was chosen as the vehicle to demonstrate many of the basic ideas, with code examples presented in every chapter. The text addresses digital communications with coverage of packet-switched networks. Many fundamental concepts such as routing via shortest-path are introduced with simple and concrete examples. The treatment of advanced telecommunications topics extends to OFDM for wireless modulation, and public-key exchange algorithms for data encryption. Throughout the book, the author puts the emphasis on understanding rather than memorization. The text also: Includes many useful take-home skills that can be honed while studying each aspect of telecommunications Offers a coding and experimentation approach with many real-world examples provided Gives information on the underlying theory in order to better understand conceptual developments Suggests a valuable learn-by-doing approach to the topic Written for students of telecommunications engineering, Communication Systems Principles Using MATLAB® is the hands-on resource for mastering the basic concepts of telecommunications in a learn-by-doing format.

关键词： telecommunications building blocks root mean square maximum power transfer decibel wired telecommunications wireless telecommunications optical telecommunications pulse shaping line codes transmission lines standing waves radio wave reflection radio wave diffraction intermodulation principles of optical fiber light sources for optical fiber light detectors for optical fiber amplitude modulation frequency modulation phase modulation orthogonal signals orthogonal frequency division multiplexing OFDM WiFi OFDM using FFT spread spectrum packet switching wired local area networks wireless local area networks LANs WLANs IP addressing subnetworks transmission control protocol TCP congestion control object data structures routing algorithms shortest path algorithms quantization vector quantization channel capacity entropy image coding discrete cosine transform DCT audio encoding modified DCT linear predictive coding LPC block error codes Hamming codes convolutional coding Viterbi trellis error checking cyclic redundancy check CRC checksum digital signatures hash functions encryption enciphering key exchange public key encryption

来源：评论

学校读者我要写书评

暂无评论

shortest path algorithm for optimal sectioning of hydrocarbon transport pipeline

引用

IFAC-PapersOnLine 2016年第12期49卷 532-537页

作者： Cano-Acosta, A. Fontecha, John Velasco, Nubia Muñoz-Giraldo, Felipe Departament of Chemical Engineering Universidad de los Andes Bogotá Colombia School of Management Universidad de los Andes Bogotá Colombia

Pipeline transportation mode is one of most used modes in oil industries. Transportation of hazardous substances by pipelines involves environmental, social and economic risks since a failure on a pipeline generates a subsequent release of a possible hazardous material. Limiting the amount of the spill volume reduces de losses and in consequence the associated risks; this mitigation is usually achieved by the installation of sectioning valves located along the pipeline. On practice a challenging problem is how much valves and where to locate them in function of the risks presented on each section. In this work, we tackle the valve location problem (VLP) for sectioning. This problem is modeled as a shortest path problem minimizing the maximum volume that could be spilled as well as environmental and social risks. To solve the problem we use the Bellman-Ford's algorithm, assessing the number and location of valves to minimize environmental and social consequences. The approach was tested on a case study for sectioning a pipeline in Colombia. The results show reductions around 75% of the maximum possible spilled volume and the resulting valve configurations effectively cover areas with high vulnerability, guarantying individual risks lower than the acceptable risk on all populated areas and protecting areas of environmental interest. © 2016

关键词： Problem solving Graph theory Hazards Materials handling Petroleum transportation Pipelines Risks Transportation Bellman Ford Hazardous substances Location problems Pipe line transportations Protecting areas shortest path algorithms shortest path problem Social consequences

来源：评论

学校读者我要写书评

暂无评论

Bounding Box Approach to Network Pruning for Efficient path Search through Large Networks

引用

JOURNAL OF COMPUTING IN CIVIL ENGINEERING 2017年第5期31卷 4017033.1-4017033.1页

作者： Zhou, Xi Venigalla, Mohan Zhu, Shanjiang CH2M HILL Inc 15010 Conf Ctr DrSuite 200 Chantilly VA 20151 USA George Mason Univ Fairfax VA 22030 USA

In this paper, the term network pruning is used to describe the process of extracting an appropriate subnetwork from a larger network for efficient and accurate path search. There is sparse literature on network pruning methods, potentially due to the rapid improvement of computing resources and the proprietary nature of such problems for service providers. However, this issue reemerges due to applications on small devices and travel behavior studies that require repeated running of route search routines. To ensure the soundness of travel behavior studies and route guidance applications that rely on such routines, different methods need to be evaluated based on real routes chosen by travelers, which represents a gap in literature. A bounding box method is proposed for efficient pruning of large networks and expediting search for the shortest path. The method is evaluated using real-world trips tracked by global positioning system (GPS). It is observed that an appropriate subnetwork can greatly improve the efficiency of path-finding algorithms without losing much accuracy. Through the investigations on real paths, the study found the orientation of the straight line connecting the origin and destination locations is relevant to the relationship of x and y deviations of the real path. Two types of buffers were investigated in this study: uniform and proportional. The results indicated that the proportional buffer is superior to the usually used uniform buffer, considering the balance between efficiency and accuracy. The proportional buffer methodology is expected to be useful in developing such innovative solutions as route guidance applications for drivers of connected vehicles where small devices perform the bulk of the computing task. The methodology simply uses popular path finding algorithms. (C) 2017 American Society of Civil Engineers.

关键词： Transportation networks Vehicular ad hoc networks (VANETs) Network pruning shortest path algorithms Connected vehicles Route guidance Subnetworks Network data structures Traveler information systems

来源：评论

学校读者我要写书评

暂无评论

Resource-Considerate Data Routing Through Satellite Networks

引用

JOURNAL OF AEROSPACE INFORMATION SYSTEMS 2017年第8期14卷 472-482页

作者： Lowe, Christopher J. Macdonald, Malcolm Univ Strathclyde Adv Space Concepts Lab 75 Montrose St Glasgow G1 1XJ Lanark Scotland

In many envisaged satellite-based networks, such as constellations or federations, there often exists a desire to reduce data latency, increase delivered data volume, or simply exploit unused resources. A strategy is presented that achieves efficient routing of data, in a store-carry-forward fashion, through satellite networks that exhibit delay- and disruption-tolerant network characteristics. This network-layer protocol, termed Spae, exploits information about the schedule of future contacts between network nodes, because satellite motion is deterministic, along with the capacity of these contacts to route data in such a way as to avoid significant overcommitment of data along a resource-limited journey. Results from simulations of a federated satellite system indicate consistent benefit in terms of network performance over other, less-sophisticated, conventional methods, and comparable performance to a packet-optimal, full-knowledge approach.

关键词： Satellite Networks Satellite Constellations Disruption Tolerant Networking Federated Satellite Systems Network Layer Protocols Constellations shortest path algorithms Buffer Storage Automatic Identification System Satellite Ground Station

来源：评论

学校读者我要写书评

暂无评论

An enhanced K-SP algorithm with pruning strategies to solve the constrained shortest path problem

引用

APPLIED MATHEMATICS AND COMPUTATION 2015年 265卷 602-618页

作者： Sedeno-Noda, Antonio Alonso-Rodriguez, Sergio Univ La Laguna Dept Matemat Estadist & Invest Operat San Cristobal de La Lagu Santa Cruz De T Spain

We propose an exact method to solve the constrained shortest path (CSP) problem. The new approach takes advantage of the binary partition strategy of a recent K shortest paths (K-SP) algorithm that allows posing numerous additional path constraints in the model without extra difficulty. We adapt and incorporate several pruning strategies from the literature on the CSP problem in this scheme and obtain a robust and scalable algorithm. The method is compared with the current best algorithm to solve the CSP problem and produces significant speedups in a wide range of network configurations. An example is given where the CSP problem is solved in road networks containing a million nodes and arcs. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Constrained shortest paths shortest path algorithms Ranking best solutions

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：