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

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

来源：评论

学校读者我要写书评

暂无评论

Changeability analysis for existing systems

引用

Australian Journal of Multi-Disciplinary Engineering 2020年第1期16卷 43-53页

ABSTRACTABSTRACTChangeability analysis is the practice of assessing a system’s ability to cope with future uncertainties in a broad sense. This paper reviews current changeability analysis methods and techniques and notes that they mostly apply to the design of new systems. Given the state of Australia’s Defence as buyers of off-the-shelf defence assets rather than designers, the state of current changeability analysis methods are assessed for their suitability to meet a set of predefined changeability analysis goals unique to existing systems. Novel extensions are proposed for observed shortfalls in current methods complimented by a theorised discussion of their aptness with application to existing systems. These extensions are intended to form part of future work on this topic.

关键词： Changeability existing systems multi-attribute tradespace exploration tradespace networks epoch era analysis shortest path algorithms

来源：评论

学校读者我要写书评

暂无评论

On Integration of Any Factor with Distance for Navigation : Walk Safely and Fast Enough 23

On Integration of Any Factor with Distance for Navigation : ...

引用

IEEE 23rd International Enterprise Distributed Object Computing Workshop (EDOCW)

作者： Zhao, Yizhou Xie, Yuetian Ahvar, Shohreh ISEP Paris France

ISBN: (纸本)9781728145983

With the popularization of personal navigation systems and mobile devices, multifarious location-based services and datasets are being advanced. In this paper, we propose a new method for navigating based on combination of any factor (e.g. safety, enjoyment, air quality, etc.) with distance. A data structure based on intensity of the factor is introduced. This data structure can be extended easily to cover different sources of data (e.g. government open data, users' feedback). Any kind of shortest path algorithm can be used in proposed method. We apply this method to a situation where travelers are seeking safer routes. The incoming traffic data of each station from Paris in 2017 is utilized to model a location-based safety status of the city. The shortest route is then modulated to a safer route to help pedestrians bypass unsafe zones in the city, thereby reducing the risk of encountering incidents. As a proof-of-concept, we produce a web application based on Google Maps API, which illustrates the performance of our method and application.

关键词： Location-Based Data Navigation Urban Safety Modeling shortest path algorithms

来源：评论

学校读者我要写书评

暂无评论

Structure and Query Optimization of Relay Protection Data Model Based on shortest path Algorithm

Structure and Query Optimization of Relay Protection Data Mo...

引用

International Conference on Electronic Engineering and Informatics (EEI)

作者： Wenhuan Wang Yanfei Li Lie Zhang Peng Guo Hanfang Zhang Guosheng Yang Zhoutian Yan Yiqun Kang China Electric Power Research Institute Beijing China

ISBN: (纸本)9781728140773

In recent years, the obtaining of relay protection information is getting more abundant, at the same time, the development of AC/DC hybrid bulk power grid puts forward higher requirements for operation of relay protection. It is necessary to integrate data of different professional systems of relay protection, and to carry out global applications. The optimization condition of the unified relay protection data model directly affect the analysis performance of each applications, and the big data characteristics of the relay protection professional data put forward more urgent requirements for optimizing the data model structure and query sequence. This paper establishes the oriented graph to reflect the data query sequence, mapping the data tables to nodes of graph, the data query sequence to path of graph, and the volume of data tables to length of path, optimizing the model structure and query sequence by the shortest path algorithm, which guarantees the query efficiency of professional applications to massive heterogeneous data. Finally, by taking the actual modeling and query sequence of relay protection data as an example, the effectiveness of the proposed method is verified.

关键词： Big Data data models power grids power system protection power system simulation query processing relay protection smart power grids Relay protection query analysis data models Smart grids big data Power grids shortest path algorithms Power system simulation Power system protection

来源：评论

学校读者我要写书评

暂无评论

Smart Garbage Collection Using GPS & shortest path Algorithm

Smart Garbage Collection Using GPS & Shortest Path Algorithm

引用

IEEE Punecon

作者： R.K.A.R. Kariapper P. Pirapuraj M.S. Suhail Razeeth A.C.M. Nafrees K.L.M. Rameez South Eastern University Oluvil Sri Lanka Ellipse Engineering Kalmunai Sri Lanka

ISBN: (数字)9781728119243

ISBN: (纸本)9781728119250

These days urbanization is happening around the globe in a rapid mode with civilization supported by very latest technology and the trends in technology despite of being adopted in various domains both in public and private sectors. On the other hand, the environmental pollution also at alarming level due to rapid growth of the world population and human activities which are highly supported by latest technology. In this way, every governments from various countries have been facing hardships to manage the wastes from both industry and residences. These days collection of wastes have become nightmare despite of human resource or physical resources. In this study the collection mechanism of kitchen wastes from urban or town council areas were focused. Combining GPS and shortest path to the moving garbage collecting trucks is novel. The advantage of this system is, a person need not to wait at the road side to drop his garbage bag to the truck since the end user can install the application in his smart device and observe or track the garbage collecting truck's drive path. Though if a person misses the truck then this application will guide the shortest path to drop the wastes to any other trucks among the group of trucks which are going around to collect garbage in a particular geographical area. In fact, public as end user to this app can be benefited with cheaper in cost and managing time in parallel.

关键词： GPS tracking wastes shortest path waste management Wastes shortest path Trucks Global Positioning Systems world population waste collection End users Waste Management latest technology tracking Persons shortest path algorithms Food waste

来源：评论

学校读者我要写书评

暂无评论

Multiple Aircraft Collision Avoidance Method Based on ADS-B System

Multiple Aircraft Collision Avoidance Method Based on ADS-B ...

引用

AIAA Aviation Forum and Exposition

作者： Zhaoi, Peng Wang, Weichang Ying, Lei Sridhar, Banavar Liu, Yongming Arizona State Univ Sch Engn Matter Transport & Energy Tempe AZ 85281 USA Arizona State Univ Comp & Energy Engn Tempe AZ 85281 USA NASA Ames Res Ctr Univ Space Res Assoc Moffett Field CA 94035 USA

ISBN: (数字)9781624105890

ISBN: (纸本)9781624105890

A new method for multiple aircraft collision avoidance using cost map construction is proposed. The objective of this work is to find a solution to the problem of conflict resolution for multiple ADS-B equipped aircraft. Development of satellite-based navigation technology enables air traffic controller (ATC) and pilot to monitor multiple aircraft in relative long range to the currently used TCAS II system which resolve in last minute. A new conflict resolution scheme is thus developed to avoid collision longer before it happens. In this scheme, a risk map is defined to describe the risk of collision. Based on this map, a cost-minimized trajectory can be found for a single aircraft, using the Dijkstra's algorithm. For the multiple aircraft trajectory planning, the index method is implemented to reduce the computational complexity. Finally, comparison with existing method and several major conclusions are drawn based on the proposed study.

关键词： Commercial Aircraft Air Traffic Controller shortest path algorithms Pilot Aircraft Trajectory Satellites path Planning Restricted Airspace Mid Air Collision Fuel Consumption

来源：评论

学校读者我要写书评

暂无评论

Flight Radius algorithms 8th

Flight Radius Algorithms

引用

8th International Conference on Operations Research and Enterprise Systems (ICORES)

作者： Idrissi, Assia Kamal Malapert, Arnaud Jolin, Remi Milanamos Sophia Antipolis France Univ Cote Azur CNRS I3S Nice France

ISBN: (纸本)9789897583520

In this article, we present the flight radius problem (FRP) on the condensed flight network (CFN). Then, giving a specific flight that is defined by an origin and destination (OD) pair, the problem consists in finding routes that connect the OD pair and satisfy a regret constraint on time, distance or cost. The found routes help airline manager to find business opportunities. This problem arises in the real world, for instance in some air transportation companies. The FRP is formulated as finding a maximal subgraph of nodes belonging to routes satisfying a regret constraint. Such routes can be found using shortest paths algorithms (SPA). The CFN is generated using a time-independent approach and stored in the graph database Neo4 j. Implementing SPA in Neo4 j is challenging since the graph database stores the weights of the graph in a separate data structure. In this paper, we propose four methods to solve the FRP: these methods combine parallel and sequential processing with more optimization to overcome time and memory costs. The experimental evaluation demonstrates that the best algorithm is the extended Dijkstra algorithm which meets the real-time constraints of the targeted industrial application.

关键词： Flight Radius Problem Time-independent Model Graph Database shortest path algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on Traffic Flow Time Series Model and shortest path Algorithm of Urban Traffic Based on Travel Plans

Research on Traffic Flow Time Series Model and Shortest Path...

引用

International Conference on Intelligent Computing, Automation and Systems (ICICAS)

作者： Weixiang Xu Jiamin Zhao School of Traffic and Transportation Beijing Jiaotong University Beijing China National Demonstration Center for Experimental Traffic and Transportation Education

ISBN: (数字)9781728161068

ISBN: (纸本)9781728161075

The Development and popularization of the vehicle navigation technology, automatic driving technology, GPS technology and big data technology, provide conditions for the transparency and sharing of traffic data in the future. Meanwhile, the innovation of the 5G technology and cloud computing also create conditions for the calculation of massive data. To effectively alleviate traffic congestion in modern cities, the authors proposed a traffic flow time series model and shortest path algorithm of urban traffic based on travel plans. Travel plans, namely, are the information about users' planning travel, including the starting point, destination, departure time, etc. Adopting lots of users' travel plans as the main source data, the authors constructed a traffic flow time series model with dynamic future traffic flow. Based on this model, the improved Floyd algorithm was used to calculate the shortest path. After the shortest path is adopted by users, update the traffic flow time series model to obtain more accurate future traffic flow data. Travel plans have the characteristics of real-time and reliability, the traffic flow data based on real-time travel plans is more realistic than the traditional traffic flow prediction methods which are based on historical data. Likewise, the optimal path algorithm based on the traffic flow time series model is also more scientific than the traditional optimal path algorithms theoretically.

关键词： 5G mobile communication Big Data cloud computing Global Positioning System navigation road traffic time series traffic engineering computing transportation travel Traffic flow shortest path algorithms big data traffic in cities Cloud Computing Global Positioning Systems Road traffic Time series navigation engineering computing transport shortest path Consumers

来源：评论

学校读者我要写书评

暂无评论

Efficiency Guarantees for Parallel Incremental algorithms under Relaxed Schedulers 19

Efficiency Guarantees for Parallel Incremental Algorithms un...

引用

31st ACM Symposium on Parallelism in algorithms and Architecturess (SPAA)

作者： Alistarh, Dan Nadiradze, Giorgi Koval, Nikita IST Austria Klosterneuburg Austria IST Austria JetBrains Klosterneuburg Austria

ISBN: (纸本)9781450361842

Several classic problems in graph processing and computational geometry are solved via incremental algorithms, which split computation into a series of small tasks acting on shared state, which gets updated progressively. While the sequential variant of such algorithms usually specifies a fixed (but sometimes random) order in which the tasks should be performed, a standard approach to parallelizing such algorithms is to relax this constraint to allow for out-of-order parallel execution. This is the case for parallel implementations of Dijkstra's single-source shortest-paths (SSSP) algorithm, and for parallel Delaunay mesh triangulation. While many software frameworks parallelize incremental computation in this way, it is still not well understood whether this relaxed ordering approach can still provide any complexity guarantees. In this paper, we address this problem, and analyze the efficiency guarantees provided by a range of incremental algorithms when parallelized via relaxed schedulers. We show that, for algorithms such as Delaunay mesh triangulation and sorting by insertion, schedulers with a maximum relaxation factor of k in terms of the maximum priority inversion allowed will introduce a maximum amount of wasted work of O(logn poly (k)), where n is the number of tasks to be executed. For SSSP, we show that the additional work is O( poly (k) d(max)/w(min)), where d(max) is the maximum distance between two nodes, and w(min) is the minimum such distance. In practical settings where n >> k, this suggests that the overheads of relaxation will be outweighed by the improved scalability of the relaxed scheduler. On the negative side, we provide lower bounds showing that certain algorithms will inherently incur a non-trivial amount of wasted work due to scheduler relaxation, even for relatively benign relaxed schedulers.

关键词： relaxed data structures shortest path algorithms incremental algorithms

来源：评论

学校读者我要写书评

暂无评论

Design of a Human-in-the-Loop Aircraft Taxi Optimisation System Using Autonomous Tow Trucks

Design of a Human-in-the-Loop Aircraft Taxi Optimisation Sys...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：