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

International IEEE Conference on Intelligent Transportation Systems

作者： Jan Hrncir Michal Jakob Agent Technology Center Dept. of Computer Science and Engineering Faculty of Electrical Engineering Czech Technical University in Prague

ISBN: (纸本)9781479929153

We solve the fully multimodal journey planning problem, in which journey plans can employ any combination of scheduled public transport (e.g., bus, tram and underground), individual (e.g., walk, bike, shared bike and car), and on-demand (e.g., taxi) transport modes. Our solution is based on a generalised time-dependent graph that allows representing the fully multimodal earliest arrival problem as a standard graph search problem and consequently using general shortest path algorithms to solve it. In addition, to allow users to express their journey planning preferences and to speed up the search process, flexible journey plan templates can be used in our approach to restrict the transport modes and mode combinations permitted in generated journey plans. We have evaluated our solution on a real-world transport network of the city of Helsinki and achieved practically usable search runtimes in the range of hundreds of milliseconds.

关键词： shortest path algorithms Search process MILLISECOND Solutions Cars bicycles city Planning travel

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Analysis and Design of An Optimized Constellation Inter-Satellite Links Computation Model

Analysis and Design of An Optimized Constellation Inter-Sate...

引用

2014中国制导、导航与控制学术会议

作者： Zhaoqiang Yang Rong Ji Zhongpei Lu Ying Shen Shuai Shao State Key Laboratory of Astronautic Dynamics Xi''an710043China Xi''an Satellite Control CenterXi''an710043 China

ISBN: (纸本)9781479946983

The visibility model for establishing inter-satellite links is presented by analyzing the conditions of the shadow of the Earth,inter-satellite antenna visibility and restriction of distance *** into account of the inter-satellite relationship and the connectivity criterion in the constellation,the judgment model for establishing constellation inter-satellite links is *** of static link and dynamic link are designed according to the process of establishing inter-satellite links for *** on the shortest path algorithm and K-short path algorithm,a novel optimized algorithm model is ***,the simulation results show the stability and efficiency of the optimized algorithm model.

关键词： Earth distance measurement optimisation satellite antennas satellite links K-short path algorithm computation model constellation inter-satellite links distance measurement restriction dynamic link model inter-satellite antenna visibility optimized algorithm model shortest path algorithm static link model visibility model Analytical models Computational modeling Delays Orbits Satellites Stability analysis Computational modeling topsoil Earth Satellite links shortest path algorithms satellite antennas inter-satellite distance measurement ANALYSIS MODELS satellites Eye Sockets Orbits CONSTELLATIONS Stability analysis

来源：评论

学校读者我要写书评

暂无评论

A Bi-objective Method of Traffic Assignment for Electric Vehicles

A Bi-objective Method of Traffic Assignment for Electric Veh...

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Marcelo de Souza Marcus Ritt Ana L. C. Bazzan Universidade do Estado de Santa Catarina Universidade Federal do Rio Grande do Sul

ISBN: (纸本)9781509018901

The impact of an increasing share of electric vehicles (EVs) is not fully known. Issues related to engine and battery point out that drivers of EVs may consider different route choices in order to take advantage of energy recovery by regenerative braking, for instance. Because not only travel time but also energy consumption may matter, this work proposes a bi-objective traffic assignment method that computes equilibrium flows in scenarios with a mixed population of vehicles, considering physical aspects and energy recovery. We present two methods of route choice for EVs and propose a bi-objective shortest path algorithm for them. Experiments show a small increase in travel time in congested scenarios, compensated by an expressive decrease in energy consumption in real-world networks. In uncongested scenarios, the travel time remains while the energy consumption decreases.

关键词： Electric vehicles energy consumption Traffic assignment Travel time energy recovery Route choice shortest path algorithms Regenerative braking link travel times average travel time Batteries

来源：评论

学校读者我要写书评

暂无评论

The Solution path Algorithm for Identity-Aware Multi-Object Tracking

The Solution Path Algorithm for Identity-Aware Multi-Object ...

引用

IEEE Conference on Computer Vision and Pattern Recognition

作者： Shoou-I Yu Deyu Meng Wangmeng Zuo Alexander Hauptmann Carnegie Mellon University Xi'an Jiaotong University Harbin Institute of Technology

ISBN: (纸本)9781467388528

We propose an identity-aware multi-object tracker based on the solution path algorithm. Our tracker not only produces identity-coherent trajectories based on cues such as face recognition, but also has the ability to pinpoint potential tracking errors. The tracker is formulated as a quadratic optimization problem with l_0 norm constraints, which we propose to solve with the solution path algorithm. The algorithm successively solves the same optimization problem but under different l_p norm constraints, where p gradually decreases from 1 to 0. Inspired by the success of the solution path algorithm in various machine learning tasks, this strategy is expected to converge to a better local minimum than directly minimizing the hardly solvable l_0 norm or the roughly approximated l_1 norm constraints. Furthermore, the acquired solution path complies with the "decision making process" of the tracker, which provides more insight to locating potential tracking errors. Experiments show that not only is our proposed tracker effective, but also the solution path enables automatic pinpointing of potential tracking failures, which can be readily utilized in an active learning framework to improve identity-aware multi-object tracking.

关键词： multipath algorithms shortest path algorithms tracking objects Solution Solutions Byways follow error Local Minimum tracking Experiential Learning Facial Recognition

来源：评论

学校读者我要写书评

暂无评论

The Simplex Algorithm is NP-mighty 15

The Simplex Algorithm is NP-mighty

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Yann Disser Martin Skutella TU Berlin Inst. of Mathematics

ISBN: (纸本)9781510813311

We propose to classify the power of algorithms by the complexity of the problems that they can be used to solve. Instead of restricting to the problem a particular algorithm was designed to solve explicitly, however, we include problems that, with polynomial overhead, can be solved 'implicitly' during the algorithm's execution. For example, we allow to solve a decision problem by suitably transforming the input, executing the algorithm, and observing whether a specific bit in its internal configuration ever switches during the execution. We show that the Simplex Method, the Network Simplex Method (both with Dantzig's original pivot rule), and the Successive shortest path Algorithm are NP-mighty, that is, each of these algorithms can be used to solve any problem in NP. This result casts a more favorable light on these algorithms' exponential worstcase running times. Furthermore, as a consequence of our approach, we obtain several novel hardness results. For example, for a given input to the Simplex Algorithm, deciding whether a given variable ever enters the basis during the algorithm's execution and determining the number of iterations needed are both NP-hard problems. Finally, we close a long-standing open problem in the area of network flows over time by showing that earliest arrival flows are NP-hard to obtain.

关键词： algorithms Simplex method Nondeterministic polynomial-time hard Decision problem shortest path algorithms Legal Executions less-favoured region Simplex Solve iterative methods

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Fresh Look at Zones and Octagons

引用

ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS 2021年第3期43卷 11-11页

作者： Gange, Graeme Ma, Zequn Navas, Jorge A. Schachte, Peter Sondergaard, Harald Stuckey, Peter J. Monash Univ Fac IT Clayton Vic 3800 Australia Univ Melbourne Sch Comp & Informat Syst Parkville Vic 3010 Australia SRI Int Comp Sci Lab Menlo Pk CA 94025 USA

Zones and Octagons are popular abstract domains for static program analysis. They enable the automated discovery of simple numerical relations that hold between pairs of program variables. Both domains are well understood mathematically but the detailed implementation of static analyses based on these domains poses many interesting algorithmic challenges. In this article, we study the two abstract domains, their implementation and use. Utilizing improved data structures and algorithms for the manipulation of graphs that represent difference-bound constraints, we present fast implementations of both abstract domains, built around a common infrastructure. We compare the performance of these implementations against alternative approaches offering the same precision. We quantify the differences in performance by measuring their speed and precision on standard benchmarks. We also assess, in the context of software verification, the extent to which the improved precision translates to better verification outcomes. Experiments demonstrate that our new implementations improve the state of the art for both Zones and Octagons significantly.

关键词： Abstract interpretation shortest path algorithms difference-bounds matrix numerical abstract domains program analysis static analysis variable packing weakly relational domains

来源：评论

学校读者我要写书评

暂无评论

Geodesic motion planning on 3D-terrains satisfying the robot's kinodynamic constraints

Geodesic motion planning on 3D-terrains satisfying the robot...

引用

Annual Conference of the IEEE Industrial Electronics Society

作者： Ioannis Arvanitakis Anthony Tzes Michalis Thanou Department of Electrical and Computer Engineering University of Patras

ISBN: (纸本)9781479902255

In this article, a robot motion planning scheme for 3D-terrains is developed. Given the terrain profile and various obstacles on it, a navigation function is created. A geodesic based shortest path algorithm is developed to find the optimal lengthwise path towards the goal position. The path is then converted into a continuous smooth trajectory via an optimization scheme relying on a Bezier curve parametrization that satisfies the robot's kinodynamic constraints. The efficacy of the proposed method is tested in various simulation studies.

关键词： motion planning topographical profiles Geodesic shortest path algorithms Robot Robot kinematics Planning schemes

来源：评论

学校读者我要写书评

暂无评论

Sparse Matrix Computations on Manycore GPU's 08

Sparse Matrix Computations on Manycore GPU's

引用

45th ACM/IEEE Design Automation Conference, vol.1

作者： Michael Garland NVIDIA Corporation Santa Clara CA

ISBN: (纸本)9781605581156

Modern microprocessors are becoming increasingly parallel devices, and GPUs are at the leading edge of this trend. Designing parallel algorithms for manycore chips like the GPU can present interesting challenges, particularly for computations on sparse data structures. One particularly common example is the collection of sparse matrix solvers and combinatorial graph algorithms that form the core of many physical simulation techniques. Although seemingly irregular, these operations can often be implemented with data parallel operations that map very well to massively parallel processors.

关键词： algorithms Parallel programming Data-parallel algorithms GPU computing Sparse matrix-vector multiplication shortest path algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：