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

21st Saudi-Computer-Society National Computer Conference (NCC)

作者： Alqahtani, Ebtesam J. Alshamrani, Fatimah H. Syed, Hajra F. Alhaidari, Fahd A. Imam AbdulRahman Bin Faisal Univ Coll Comp Sci & Informat Technol Dammam Saudi Arabia

ISBN: (纸本)9781538641101

Indoor navigation systems are increasingly needed for smart cities, robots, and visually impaired people. Although Global Positioning System (GPS) is widely used for navigation in numerous applications, it cannot be used for indoor navigation systems as the signals cannot be absorbed by the walls of buildings. As a result, other methods including Wi-Fi, Bluetooth and sensors must be used for navigation. This paper analyses the various algorithms used to find the location of objects and algorithms to navigate using the shortest path in an indoor environment. The first section introduces indoor navigation systems, the problem statement of this paper, and the background of such systems. Then, a comprehensive literature review is included that reviews previous research studies conducted in this area. After that, a discussion and analysis of the literature review has been done to classify and compare between the algorithms and techniques studied. Finally, the paper provides directions for future work in the field of indoor navigation.

关键词： Indoor Navigation Indoor Positioning Indoor Environment shortest path algorithm Dijkstra's algorithm Best path

来源：评论

学校读者我要写书评

暂无评论

An Improved Dijkstra algorithm Based on Pairing Heap

An Improved Dijkstra Algorithm Based on Pairing Heap

引用

5th International Symposium on Computational Intelligence and Design (ISCID)

作者： Zhang, Wei Jiang, Chong Ma, Yunxiang Beijing Inst Petrochem Technol Coll Informat Engn Beijing 102617 Peoples R China

In this paper, we presented a method for shortest path computation process using Dijkstra algorithm based on Pairing heap. We compared the methods by the Pairing heap method and Fibonacci heap method. With experiment,... 详细信息

ISBN: (纸本)9780769548111

关键词： shortest path algorithm Dijkstra algorithm GIS Network Analysis

来源：评论

学校读者我要写书评

暂无评论

Optimal Power Routing for End-to-end Outage Restricted Distributed MIMO Multi-hop Networks

Optimal Power Routing for End-to-end Outage Restricted Distr...

引用

IEEE International Conference on Communications (ICC)

作者： Lang, Yidong Wuebben, Dirk Dekorsy, Armin Univ Bremen Dept Commun Engn D-2800 Bremen 33 Germany

ISBN: (纸本)9781612842332

This paper investigates the optimal power routing problem in relay-based cooperative networks, where the relays are arbitrarily positioned. We generalize the standard shortest path routing algorithm (GSPRA) to find a minimum-power route omega(D) from a source to a destination while satisfying a given end-to-end (e2e) outage probability in distributed MIMO multi-hop networks. The task of the proposed approach includes how to group relays an virtual antenna arrays (VAAs) and discover the optimal multi-hop path. Instead of using per hop (or link) constraints, which is assumed by most of the existing routing algorithm, an e2e outage probability constraint is considered for more relevance and freedom in practical systems. By introducing the concept of virtual nodes and virtual links, an efficient power allocation solution for general distributed MIMO multi-hop networks is used to calculate link costs for the shortest path algorithm. The proposed routing approach fully exploits the merits of both cooperative communications and multi-hop transmissions. The significant power savings due to the proposed approach in comparison to existing algorithms is demonstrated by numerical results.

关键词： Optimal power routing asymmetric distributed MIMO shortest path algorithm outage probability relaying

来源：评论

学校读者我要写书评

暂无评论

Location Planning of Charging Stations Considering the Total Cost of Charging Stations and Users 35

Location Planning of Charging Stations Considering the Total...

引用

35th Youth Academic Annual Conference of Chinese-Association-of-Automation (YAC)

作者： Chen, Hongsheng Wang, Xiaoting Su, Yixin State Grid Hubei Elect Power Co Ltd Wuhan Elect Power Supply Co Wuhan Peoples R China Wuhan Univ Technol Sch Automat Wuhan Peoples R China

ISBN: (纸本)9781728176840

In order to solve the problems of environmental pollution and lack of fossil energy, electric vehicles have been vigorously developed and promoted in China. With the increase in electric vehicles, how to properly plan charging stations for electric vehicle has become a very important issue. Aiming at the location planning of electric vehicle charging stations, this paper proposes and establishes a charging station planning model that takes traffic flow information, the cost of building a charging station, operating costs, operating income, user time costs, road losses into consideration, and aims to minimize the difference between the charging station and user's total costs and benefits. Dijkstra shortest path algorithm is used to calculate the shortest actual distance from each demand point to the charging station, the Voronoi diagram is used to divide the service scope of each charging station, the adaptive weight particle swarm optimization algorithm is used to optimize the site location. The example analysis shows that the model can solve the problem of site selection of electric vehicle station.

关键词： charging station location planning user cost charging station cost voronoi shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Earliest-Arrival path:A Global Optimized Transmission for Networked Control Systems 36

Earliest-Arrival Path:A Global Optimized Transmission for Ne...

引用

第36届中国控制会议

作者： WANG Zhan-yu Guo-ping Liu School of Astronautics Harbin Institute of Technology School of Engineering University of SouthWales

ISBN: (纸本)9781538629185

According to existed switched system theorem,packet-loss rate determines the stability of *** the core purpose to provide low packet-loss rate for distributed networked control systems（NCSs） under constraint communication environment,the transmission optimization problem is discussed from global communication ***,network induced delay is described as time-correlative function by auto-regressive-moving-average（ARMA） model,and the future delay is predicted by the obtained delay ***,the widely cited shortest-path-of-time-dependent-network（SPTDN） algorithm is discussed and improved through inserting waiting-time before packets are sent to next node in a path,in order to obtain earlier arrival time than *** the notion of earliest-arrival time（EAT） is proposed to measure the quality of communication path,the online EAT algorithm is designed to search for future EAT and the corresponding path from the global network *** from the dynamic EAT path,packets arrive at destination as early as possible,it decreases packet-loss rate,hence EAT path ensures the stability of distributed NCSs from the view of global ***,the experiment proves the validity and effectiveness of the proposed approach.

关键词： transmission optimization for networked control system predictive network-induced delay model shortest path algorithm networked control system

来源：评论

学校读者我要写书评

暂无评论

A Slice-Aware Network Embedding (SANE) Strategy for Network Service Requests in 6G

A Slice-Aware Network Embedding (SANE) Strategy for Network ...

引用

2023 Innovations in Power and Advanced Computing Technologies, i-PACT 2023

作者： Srinivasan, Thiruvenkadam Kowsalya, M. Kim, Hyung-Jin Ra, In-Ho School of Electrical Engineering Vellore Institute of Technology Vellore India Department of IT Applied System Engineering Chonbuk National University Jeonju Jeonju Korea Republic of School of Software Kunsan National University Gunsan Korea Republic of

ISBN: (纸本)9798350325188

6G networks are projected to provide more individualized end-to-end services and innovative cloud-edge applications than current 5G networks. Network slicing (NS) is required when embedding 6G mobile network resources and sharing them across devices with varying needs. Recent advancements in 6G NS have been propelled by Network Function Virtualization (NFV) and Software Defined Networking (SDN) technologies, which virtualize network functions. Allocating resources in 6G is a pressing issue that needs additional study. Virtual network embedding focuses primarily on node mapping and link mapping, the two most important network properties. Resource allocation in a 6G network is addressed here by using the Slice-Aware Network Embedding (SANE) technique. The slice-defined node ranking method is shown for node mapping, and the k-shortest route algorithm is presented for link mapping, both of which are contributed to by this work. The performance of the proposed strategy is measured by looking at metrics like average acceptance rates, cost-to-revenue, and bandwidth utilization. The results of this study are compared to those of other researches done in the same area to demonstrate their validity. © 2023 IEEE.

关键词： 6G network slicing node ranking resource allocation shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

MINIMUM FLOW VARIATION IN MAXIMUM FLOWS

引用

DISCRETE MATHEMATICS algorithmS AND APPLICATIONS 2010年第3期2卷 389-393页

作者： Masoumi, M. Mobasseri, A. M. Rezaei, A. R. Islamic Azad Univ Sci & Res Branch Dept Math Tehran Iran Shahid Beheshti Univ Dept Comp Sci GC Tehran Iran

Network flows are of growing interest in both applications and theory. Given a network flow with costs and arc capacities, the classical max flow-min cost problem is to send a given amount of flow from the source vertex to the sink vertex at least cost. Among the predominant issues in this field are problems that result when the flow is going through one arc to another arc in the same direction, such as the role of compressors in gas pipeline networks or the role of transformers in electricity wide networks. Hence, in order to minimize the cost of these elements in the network, we perform applications of line-digraphs in the form of an optimization algorithm. This paper proposes a new variant of the max flow-min cost problem. Our objective is to find the smoothest max flow over a given network.

关键词： Line digraph max flow-min cost problem shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

A ride sharing system based on an expansive search-based algorithm

A ride sharing system based on an expansive search-based alg...

引用

2020 IEEE Region 10 Conference, TENCON 2020

作者： Angelo Escalona, Josh Manalo, Benjamin Limjoco, Wilbert Jethro R. DIzon Electrical, Carl C. University of the Philippines Electronics Engineering Institute Quezon City Philippines

ISBN: (纸本)9781728184555

Ride sharing is one of the several transportation alternatives used to ease and skip traffic problems worldwide. A platform of interest is GrabShare, where its ride sharing algorithm was empirically found to be simple. However, the algorithm has several limitations, such as it being not truly optimal due to catering to user experiences, and only able to handle up to two bookings. Hence, there is a need to develop a ride sharing system that is scalable, fast, and efficient especially in terms of finding matches and recommending routes. A Modified Search-based Ride Sharing algorithm, which uses an expansion-based method, was developed as a response to these requirements. Results showed that the Modified Search-based Ride Sharing algorithm generally outperforms the empirically-derived GrabShare algorithm in terms of route length, shared route percentage, and processing time. However, GrabShare performs better when there are few passengers in the area while the Modified Search-based Ride Sharing algorithm runs relatively slower when the sources and destinations are far from each other. © 2020 IEEE.

关键词： Ride matching Ride-sharing Route recommendation shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Gang injunctions and community participation

Gang injunctions and community participation

引用

作者： Miranda, Eduardo Mendoza University of Southern California

学位级别：D.P.D.S.

Civil Gang Injunctions have existed since 1987. The City of Oxnard recently implemented a spatially extensive one. The majority of the residents approved the injunction but regretted not being part of the process before the District Attorney's Office and the Oxnard Police Department obtained a court order against the La Colonia Chiques Gang. A small minority of the population completely opposed the injunction and its implementation. This project focuses on public safety, civil rights, perceptions, and opinions/perspectives. It shows how Oxnard gangs developed from car clubs, describes the history of the La Colonia neighborhood along with recent statistics, and presents the opinions of community members, gang members, and police officers about this injunction. A good example of a successful injunction in the Los Angeles area was the Redondo Beach Injunction against the North Side Redondo Gang. It showed how the community was involved in the process and the effectiveness of the SARA (Scan, Analyze, Respond, and Assess) model. The District Attorney and the Redondo Beach Police Department brought the community together to achieve a united goal to combat gang violence. The literature review attempts to establish a rationale based on the Spergel Model, Arnstein's citizen participation ladders, Nye's comment about soft power, Churchman's system approach, Saxton's article on citizen participation, and the works of many other authors. The core of the research presents the views of activists, elected officials, police officers, and citizens who have argued their positions on civil gang injunctions. The discussion of findings supports the conclusion that the injunction suffered from defects and could have been implemented differently. This researcher's perspective is unusual because he is a police officer who worked where the gang injunction was implemented. A major conclusion is that it is essential to consider the community involvement when implementing controversial social

关键词： shortest path algorithm A* algorithm Distributed Route Configuration Private Leased Circuit of Base Stations Mobile Cellular Network Optimal Route Assignment Radio Coverage Quality

来源：评论

学校读者我要写书评

暂无评论

Efficient, Oblivious Data Structures for MPC

Efficient, Oblivious Data Structures for MPC

引用

20th Annual International Conference on the Theory and Application of Cryptology and Information Security (Asiacrypt)

作者： Keller, Marcel Scholl, Peter Univ Bristol Dept Comp Sci Bristol BS8 1TH Avon England

ISBN: (纸本)9783662456088;9783662456071

We present oblivious implementations of several data structures for secure multiparty computation (MPC) such as arrays, dictionaries, and priority queues. The resulting oblivious data structures have only polylogarithmic overhead compared with their classical counterparts. To achieve this, we give secure multiparty protocols for the ORAM of Shi et al. (Asiacrypt '11) and the path ORAM scheme of Stefanov et al. (CCS '13), and we compare the resulting implementations. We subsequently use our oblivious priority queue for secure computation of Dijkstra's shortest path algorithm on general graphs, where the graph structure is secret. To the best of our knowledge, this is the first implementation of a non-trivial graph algorithm in multiparty computation with polylogarithmic overhead. We implemented and benchmarked most of our protocols using the SPDZ protocol of Damgard et al. (Crypto '12), which works in the preprocessing model and ensures active security against an adversary corrupting all but one players. For two parties, the online access time for an oblivious array of size one million is under 100 ms.

关键词： Multiparty computation data structures oblivious RAM shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：