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

A Hierarchical Vehicular-Based Architecture for Vehicular Networks: A Case Study on Computation Offloading

IEEE ACCESS 2020年 8卷 184273-184283页

作者： Liu, Tingting Wang, Junhua Kim, Baekgyu Xie, Jiang Han, Zhu Nanjing Inst Technol Nanjing 211167 Peoples R China Nanjing Univ Aeronaut & Astronaut Sch Comp Sci & Technol Nanjing 211106 Peoples R China Toyota Motor North Amer InfoTech Labs Mountain View CA 94043 USA Univ N Carolina Dept Elect & Comp Engn Charlotte NC 28223 USA Univ Houston Dept Elect & Comp Engn Houston TX 77004 USA Kyung Hee Univ Dept Comp Sci & Engn Seoul 446701 South Korea

In order to realize an intelligent transportation system (ITS) which will provide smooth urban traffic, autonomous driving, accurate route navigation, etc., enormous computations need to be migrated from cloud centers to edge nodes, especially for the services requiring stringent latency. In addition to base stations and road side units (RSUs), vehicles can be alteratively considered as a kind of computation resources. In this article, a hierarchical vehicular-based architecture which consists of cloud centers and vehicles is investigated. Computation offloading performance in the hierarchical architecture is also studied. In specific, the main components in vehicular networks and their characteristics on communication and computations are presented firstly. Several communication techniques that are essential in enabling computation offloading among these components are then discussed. Secondly, a hierarchical vehicular-based architecture, which integrates the main components, is constructed. Thirdly, a case study on computation offloading in the proposed architecture is conducted. In the concerned scenario, the computation offloading problem is modelled as a multi-dimensional multiple knapsack problem (MMKP). Two algorithms are investigated, among which, the first algorithm is a greedy heuristic method providing a sub-optimal solution with a low computational complexity. The second algorithm is a modified branch and bound (B&B) method, which can obtain the best solution with a high computational complexity. Numerical results are also presented to verify the performance of the two algorithms. It can be demonstrated that the proposed architecture can migrate more computations from cloud centers to vehicular nodes, when the computations require more communication resources.

关键词： Computer architecture Task analysis Edge computing Cloud computing Servers Electronic mail Computational modeling Hierarchical vehicular architecture intelligent transportation system computation offloading multi-dimensional multiple knapsack problem branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Accelerating datapath merging by task parallelisation on multicore systems

引用

INTERNATIONAL JOURNAL OF PARALLEL EMERGENT AND DISTRIBUTED SYSTEMS 2019年第5期34卷 615-628页

作者： Fazlali, Mahmood Fallah, Mohammad K. Hosseinpour, Naemeh Katanforoush, Ali Shahid Beheshti Univ Dept Comp Sci GC Tehran Iran Inst Res Fundamental Sci IPM Sch Comp Sci Tehran Iran

Datapath merging is an efficient approach to reduce hardware resources and configuration time in the synthesis of digital systems. In order to solve datapath merging, we have to find the maximum weighted clique, which is an NP-hard problem. So, datapath merging is a time-consuming process. In this article, we use OpenMP library to perform divide and conquer task parallelism to find the maximum weighted clique. Therefore, considerable reduction in the synthesis time and almost linear speedup has been achieved. The experimental results obtained from running this algorithm on different benchmarks represent speedup ranging from 1.2 times to 6.5 times for an 8-core system.

关键词： Datapath merging branch and bound algorithm task parallelisation shared memory paradigm

来源：评论

学校读者我要写书评

暂无评论

Dominance conditions determination based on machine idle times for the permutation flowshop scheduling problem

引用

COMPUTERS & OPERATIONS RESEARCH 2020年 122卷 104964-104964页

作者： Liou, Jin-Pin I Shou Univ Coll Management 1 Syuecheng Rd Kaohsiung 84001 Taiwan

In this study, we investigate the lower bound and dominance conditions of the N-job and M-machine permutation flowshop scheduling problem to minimize the makespan based on machine idle times. We have developed and validated three dominance conditions and a lower bound based on a new approach that minimizes the machine idle times in a flowshop to facilitate the efficiency of the branch and bound approach. Most importantly, we have developed a dominance condition that is independent of the preceding and subsequent partial schedules, which has been considered critical but has not previously been developed in flowshop scheduling research. Finally, the efficiency of our developed branch and bound approach based on machine idle times is compared with the efficiencies of some previous branch and bound algorithms from the literature. We show that the dominance conditions that we developed can significantly improve the efficiency of the branch and bound approach. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Flowshop scheduling Permutation flowshop Machine idle time branch and bound algorithm Makespan dominance condition

来源：评论

学校读者我要写书评

暂无评论

Modeling Geographical Anycasting Routing in Vehicular Networks

引用

KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS 2020年第4期14卷 1624-1647页

作者： Amirshahi, Alireza Romoozi, Morteza Raayatpanah, Mohammad Ali Asghari, Seyyed Amir Islamic Azad Univ Dept Comp Engn Qom Branch Qom Iran Islamic Azad Univ Dept Comp Engn Kashan Branch Kashan Iran Kharazmi Univ Fac Math Sci & Comp Tehran Iran Kharazmi Univ Tehran Comp & Elect Engn Dept Tehran Iran

Vehicular network is one of the most important subjects for researchers in recent years. Anycast routing protocols have many applications in vehicular ad hoc networks. The aim of an anycast protocol is sending packets to at least one of the receivers among candidate receivers. Studies done on anycast protocols over vehicular networks, however, have capability of implementation on some applications;they are partial, and application specific. No need to say that the lack of a comprehensive study, having a strong analytical background, is felt. Mathematical modeling in vehicular networks is difficult because the topology of these networks is dynamic. In this paper, it has been demonstrated that vehicular networks can be modeled based on time-expanded networks. The focus of this article is on geographical anycast. Three different scenarios were proposed including sending geographic anycast packet to exactly-one-destination, to at-least-one-destination, and to K-anycast destination, which can cover important applications of geographical anycast routing protocols. As the proposed model is of MILP type, a decentralized heuristic algorithm was presented. The evaluation process of this study includes the production of numerical results by branch and bound algorithm in general algebraic modeling system (GAMS) software and simulation of the proposed protocol in OMNET++ simulator. The comprehension of the result of proposed protocol and model shows that the applicability of this proposed protocol and its reactive conformity with the presented models based on presented metrics.

关键词： Anycast routing Vehicular networks Time-expanded networks branch and bound algorithm Mixed integer programming

来源：评论

学校读者我要写书评

暂无评论

Scheduling a Wet Station Using a branch and bound algorithm

Scheduling a Wet Station Using a Branch and Bound Algorithm

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Kim, Hyun-Jung Lee, Jun-Ho Lee, Tae-Eog Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

ISBN: (纸本)9781467317146

We examine a scheduling problem of a wet station with multiple job flows. The wet station performs cleaning processes for removing residual contaminants after wafer fabrication processes. It consists of several chemical and rinse baths, and multiple transport robots. Most studies on scheduling robotized systems including a wet station assume identical jobs and deal with cyclic scheduling that repeats a predefined work cycle. However, jobs arrive dynamically and many different jobs are processed concurrently at a wet station. We therefore examine a non-cyclic scheduling problem of the wet station to minimize the makespan. We first develop a Petri net model and solve the problem using a branch and bound (B&B) algorithm. We also propose a dynamic branching method and evaluate a lower bound based on a bottleneck process. During searching the nodes, we analyze deadlocks and add places to the Petri net model for precedence relations among the robot tasks by applying the deadlock prevention conditions. We finally show that the proposed B&B algorithm is sufficient to solve practical problems.

关键词： branch and bound algorithm Petri net wet station

来源：评论

学校读者我要写书评

暂无评论

A Petri Net-based Modeling and Scheduling with a branch and bound algorithm

A Petri Net-based Modeling and Scheduling with a Branch and ...

引用

IEEE International Conference on Systems, Man, and Cybernetics (SMC)

作者： Kim, Hyun-Jung Lee, Jun-Ho Lee, Tae-Eog Korea Adv Inst Sci & Technol Dept Ind & Syst Engn Taejon 305701 South Korea

ISBN: (纸本)9781467317146

We examine a non-cyclic scheduling problem of a timed Petri net (TPN) with a branch and bound (B&B) algorithm. There have been many approaches and algorithms for conventional scheduling problems such as job shops, resource-constrained project scheduling problems (RCPSPs), and robotized system scheduling problems. Most of these methods have focused on their effectiveness or efficiency in solving their own problems. However, they tend to ignore the issue of compatibility with other scheduling problems and the solution methods are ad hoc and hard to be used for other scheduling problems with even small changes. Petri nets have been widely used for modeling and analyzing complex discrete event dynamic systems, such as robotized manufacturing cells or other automated manufacturing systems. There are studies on scheduling cyclic Petri net models and some non-cyclic Petri net models for specific applications. In this paper, we examine a scheduling problem for non-cyclic TPNs, where there is the starting and end transitions, and the transitions do not repeat an identical firing cycle. We also allow multiple arc weights in TPNs so as to model batch processing of tasks at a resource and multiple units of a resource required for a task. We briefly explain how various scheduling constraints and objectives can be modeled by TPNs. Then, we develop an efficient B&B procedure that utilizes a dynamic branching strategy and a resource-based lower bound. We finally present examples of the B&B algorithm for an RCPSP and a single-armed cluser tool scheduling problem.

关键词： branch and bound algorithm non-cyclic scheduling timed Petri net

来源：评论

学校读者我要写书评

暂无评论

GEMS, a Generic Engine for MDO Scenarios: Key Features In Application

GEMS, a Generic Engine for MDO Scenarios: Key Features In Ap...

引用

AIAA Aviation Forum and Exposition

作者： Gallard, F. Barjhoux, P. J. Olivanti, R. Gazaix, A. Inst Technol IRT St Exupery Syst Engn & Modeling Dept Toulouse France Inst Technol IRT St Exupery Toulouse France Univ Toulouse ICA F-31400 Toulouse France Airbus Operat SAS F-31060 Toulouse France Univ Toulouse ISAE SUPAERO F-31400 Toulouse France

ISBN: (数字)9781624105890

ISBN: (纸本)9781624105890

This paper illustrates the capabilities of the GEMS (a Generic Engine for MDO Scenarios) Multidisciplinary Design Optimization software library, on three MDO use cases. A range of aircraft MDO applications are covered, showing the versatility of GEMS, both in terms of problems that can be addressed, and type of users, from academic to industrial ones. The focus is made on how the framework concepts allow to set up the MDO processes in an automatic and versatile way. The first use case is a series of trade-offs and MDO processes for high-fidelity aerodynamics-structure-OAD (Overall Aircraft Design) industrial engine pylon design, which is the main application of the IRT Saint Exupery MDA-MDO project. The second use case, consists in two multi-level MDO formulations that are developed to address mixed categorical and continuous structural optimization problems. In the third use case, an algorithmic framework is developed to perform multi-fidelity adjoint-based aerodynamic shape optimization, aiming at decreasing the restitution time compared to mono-fidelity approaches.

关键词： Multidisciplinary Design Optimization Aerodynamic Shape Optimization Structural Optimization Aircraft Design branch and bound algorithm Structural Simulation Derivative Free Optimization Finite Element Modeling Nastran Application Programming Interface

来源：评论

学校读者我要写书评

暂无评论

Optimal EV Charging Network Design: When Users Have Choices 11

Optimal EV Charging Network Design: When Users Have Choices

引用

11th IEEE International Conference on Wireless Communications and Signal Processing (WCSP)

作者： Chen, Yuchen Qin, Zhida Gan, Xiaoying Shanghai Jiao Tong Univ Dept Elect Engn Shanghai 200240 Peoples R China Southeast Univ Natl Mobile Commun Res Lab Nanjing 210096 Jiangsu Peoples R China

ISBN: (纸本)9781728135557

The penetration rate of Electric Vehicles is increasing as expected. To meet the charging needs, numerous charging stations are built, which are small because of space and grid limitation in city. Such a high density distribution of charging stations offers EV users more choices when seeking for charging service. In order to offer users better choices with global knowledge, recommendation systems are developed. However, the cost generated from recommendation system is not considered when designing the charging network, which result in an increase of overall system cost. Therefore, this paper mainly focuses on the charging network design problem under generalized recommendation systems to find a better co-working solution. We first formulate the EV charging network design as a cost minimization problem, considering construction cost, incentive cost for users' to transfer in the charging network, and cost for the loss of users leaving the system, which is a nonlinear mixed-integer optimization problem. In order to solve such problem, we propose a branch and bound algorithm. By combining local search heuristic and cutting plane process, the exact optimal solution can be obtained efficiently. To demonstrate the superiority of the scheme proposed by us, simulation are conducted.

关键词： Electric Vehicles Charging Network Nonlinear Mixed-Integer Programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

A Solution of a Mathematical Model Which Simulates Football Game as a Logistics Network 7

A Solution of a Mathematical Model Which Simulates Football ...

引用

7th International Conference on Sport Sciences Research and Technology Support (icSPORTS)

作者： Menguc, Kenan Beykent Univ Appl Sch Logist TR-34522 Istanbul Turkey

ISBN: (纸本)9789897583834

Routing is very important in team sports as well as in many parts of daily life. On 01.07.2018, in the World Cup tournament organized in Russia, Spain lost the match with a penalty shootout although it performed a higher number of passes. As a result of the elimination of Spain despite its very high ball possession, the nature of modern football doesn't necessarily require the multiplicity of passes. It is important to know where the passes are done, rather than high amounts of them. This study has simulated a mathematical model by bringing a different interpretation to the categorization of pass throws.

关键词： Transshipment Problem Optimization Spatio-temporal Data branch and bound algorithm Football Logistic

来源：评论

学校读者我要写书评

暂无评论

Parallelization of BiqMac solver 15

Parallelization of BiqMac solver

引用

15th International Symposium on Operations Research, SOR 2019

作者： Kalamar, Alen Vegi Bokal, Drago Povh, Janez Faculty of Natural Science and Mathematics University of Maribor Koroška cesta 160 Maribor Slovenia Faculty of Mechanical Engineering University of Ljubljana Aškerčeva cesta 6 Ljubljana Slovenia

ISBN: (纸本)9789616165556

The max-cut problem is known to be a NP-hard problem. However, there are still possibilities and needs to solve the problem to optimality for small instances. The max-cut problem has a property which allows it to be divided into smaller subproblems (problems one dimension smaller) and if we solve these subproblems to optimality, we can get the optimal solution for the original problem. This property enabled the development of branch and bound algorithms to solve the max-cut problem. Rendl, Rinaldi and Wiegele used semidefinite programming relaxations of the problem, and used efficient heuristics to bound the generated subproblems and efficient heuristics to generate good feasible solutions and developed an efficient branch and bound algorithm (BiqMac Solver), which can solve the max-cut problem to optimality (even for graphs with sizes up to 250). Because of their nature, branch and bound algorithms are suitable for parallelization. We implement a paralel version of the BiqMac Solver in C language using MPI library. The resulting solver was tested on the supercomputer of University of Ljubljana, Faculty of mechanical engineering. In the paper we, present details about this parallelization and numerical results obtained with the parallel BiqMac Solver. © International Symposium on Operations Research, SOR *** right reserved.

关键词： branch and bound algorithm Max-cut problem Parallel computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：