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

A Rapid Solving Method to Large Airline Disruption Problems Caused by Airports Closure

IEEE ACCESS 2017年 5卷 26545-26555页

作者： Wu, Zhengtian Gao, Qing Li, Bench Dang, Chuangyin Hui, Fuyuan Suzhou Univ Sci & Technol Sch Elect & Informat Engn Suzhou 215000 Peoples R China City Univ Hong Kong Dept Syst Engn & Engn Management Hong Kong Hong Kong Peoples R China Univ Duisburg Essen Fac Engn Inst Automat Control & Complex Syst AKS D-47057 Duisburg Germany Virtual Real Key Lab Intelligent Interact & Appl Suzhou 215000 Peoples R China

Airline disruption is universal phenomenon that block the originally scheduled flights, and the slow recovery scheduling causes a lot of losses to both the airline companies and the passengers. However, it is very difficult to generate a new recovery scheduling in a reasonable time by traditional methods, especially for large dimension airline disruption problem. To deal with this problem rapidly, the airline disruption problem will be reformulated as integer programmings and a distributed network, which is based on the fixed-point iterative method for integer programming, will be developed in this paper. In response to the airport closure, an airplane reschedule is constructed by these feasible flight lines. In the implementation of distributed network, a certain number of independent segments are obtained by dividing the solution space. As a feature of this fixed-point method, the number of partial feasible flight lines, which have to be calculated for finding an optimized airplane reschedule, is much fewer compared with the number needed by CPLEX CP Optimizer. This is the first distributed integer programming method to large airline disruption problems caused by airports closure. In the numerical results, the proposed distributed approach shows promising, especially for solving the large dimension airline disruption problem.

关键词： Airline disruption management irregular operation airports closure integer programming distributed computation

来源：评论

学校读者我要写书评

暂无评论

Analysis of Known Linear distributed Average Consensus Algorithms on Cycles and Paths

引用

SENSORS 2018年第4期18卷 968-968页

作者： Gutierrez-Gutierrez, Jesus Zarraga-Rodriguez, Marta Insausti, Xabier Univ Navarra Dept Biomed Engn & Sci Tecnun Manuel Lardizabal 13 San Sebastian 20018 Spain

In this paper, we compare six known linear distributed average consensus algorithms on a sensor network in terms of convergence time (and therefore, in terms of the number of transmissions required). The selected network topologies for the analysis (comparison) are the cycle and the path. Specifically, in the present paper, we compute closed-form expressions for the convergence time of four known deterministic algorithms and closed-form bounds for the convergence time of two known randomized algorithms on cycles and paths. Moreover, we also compute a closed-form expression for the convergence time of the fastest deterministic algorithm considered on grids.

关键词： average consensus algorithms distributed computation sensor networks convergence time number of transmissions

来源：评论

学校读者我要写书评

暂无评论

A Response-Function-Based Coordination Method for Transmission-Distribution-Coupled AC OPF

A Response-Function-Based Coordination Method for Transmissi...

引用

IEEE/PES Transmission and Distribution Conference and Exposition (T and D)

作者： Li, Zhengshuo Xu, Tong Guo, Qinglai Sun, Hongbin Wang, Jianhui Tsinghua Berkeley Shenzhen Inst TBSI Shenzhen 518055 Guangdong Peoples R China Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Southern Methodist Univ Lyle Sch Engn Dept Elect Engn Dallas TX 75275 USA

ISBN: (纸本)9781538655832

With distributed generation highly integrated into the grid, the transmission-distribution-coupled AC OPF (TDOPF) becomes increasingly important. This paper proposes a response-function-based coordination method to solve the TDOPF. Different from typical decomposition methods, this method employs approximate response functions of the power injections with respect to the bus voltage magnitude in the transmission-distribution (T-D) interface to reflect the "reaction" of the distribution to the transmission system control. By using the response functions, only one or two iterations between the transmission system operator (TSO) and the distribution system operator(s) (DSO(s)) are required to attain a nearly optimal TDOPF solution. Numerical tests confirm that, relative to a typical decomposition method, the proposed method does not only enjoy a cheaper computational cost but is workable even when the objectives of the TSO and the DSO(s) are in distinct scales.

关键词： AC optimal power flow distributed computation distribution transmission response function

来源：评论

学校读者我要写书评

暂无评论

A Fully distributed Power Flow Algorithm with Exponentially Fast Convergence

A Fully Distributed Power Flow Algorithm with Exponentially ...

引用

IEEE Conference on Energy Internet and Energy System Integration

作者： Zhuang Tian Jianwei Ma Qian Sun Jian Zhao Wenchuan Wu Department of Electrical Engineering Tsinghua University Beijing China Electric Power Research Institute State Grid Henan Electric Power Corporation Zhengzhou China

In this paper, a fully distributed power flow algorithm is proposed. The method is composed of outer iteration and inner iteration. The outer iteration is identical to newton's method, while the inner iteration solves the power flow correction equation using an exponentially fast converged distributed algorithm. The proposed algorithm does not need coordination infrastructure and each area in power systems only need to communicate less important information with neighbors. The numerical tests show that the method is able to converge with the same behavior as Newton's method.

关键词： distributed computation Power flow Power systems

来源：评论

学校读者我要写书评

暂无评论

Innovative Applications and Services Based on Privacy Enhanced distributed computations on IoT Devices 18

Innovative Applications and Services Based on Privacy Enhanc...

引用

18th IEEE International Conference on Business Informatics (CBI)

作者： Avgerou, Artemis D. Nastou, Panayotis E. Stamatiou, Yannis C. Imperial Coll Sch Business London SW7 2AZ England Univ Aegean Dept Math Samos 83200 Greece Univ Florida Ctr Appl Optimizat Gainesville FL USA Univ Patras Dept Business Adm Patras Greece Comp Technol Inst & Press Diophantus Patras 26504 Greece

ISBN: (纸本)9781509032310

computational Intelligence methods are widely used in a diverse range of scientific and industrial applications, including economic modeling, finance, networks and transportation, database design, design and control, scheduling and others. On the other hand, Collective Intelligence methods aim at harvesting the power of people's mobile devices for gathering and sending useful information about the values and the variations of environmental variables in a target area or the macroscopic behavior of a target population. In this paper we propose a computation paradigm, which combines computational, collective intelligence and privacy respecting techniques, towards the creation of a flexible, low-cost, secure, massively parallel virtual computing platform based on people's own devices. Examples of how such an infrastructure can be the platform of the deployment of innovative, computationally demanding, applications and services that demand peer-to-peer connections and users' device collaboration are presented. The privacy respecting techniques enhance people's trust in providing their data through their personal devices.

关键词： Collective Intelligence Crowd Sourcing distributed computation IoT Privacy

来源：评论

学校读者我要写书评

暂无评论

The MapReduce application of Matrix Multiplication implemented on Field Programmable Gate Arrays 4

The MapReduce application of Matrix Multiplication implement...

引用

4th Panhellenic Conference on Electronics and Telecommunications (PACET)

作者： Tsompanas, Michail-Antisthenis I. Sirakoulis, Georgios Ch. Univ West England Unconvent Comp Ctr Bristol BS16 1QY Avon England Democritus Univ Thrace Dept Elect & Comp Engn GR-67100 Xanthi Greece

ISBN: (纸本)9781538622889;9781538622872

Data intensive computations in data centers are performed by an increasingly popular programming framework named MapReduce. An advantage of this framework is that the algorithm is divided into simple tasks that enables the exploitation of its parallelism. A great variety of processing elements architectures, such as shared memory systems, clusters of computers and heterogeneous systems, have accommodated applications of the MapReduce framework in order to enhance its robustness and efficiency. Field Programmable Gate Arrays (FPGAs) are known for implementing algorithms while providing higher parallelism compared to their software counterparts. The mapping of a MapReduce framework on specialized hardware is proposed here. The proposed FPGA architecture is using a pipeline principle in order to alleviate the need of large memory resources. The proposed system was analyzed implementing a basic application, namely matrix multiplication.

关键词： MapReduce FPGAs matrix multiplication distributed computation pipelined computation VHDL

来源：评论

学校读者我要写书评

暂无评论

A Kind of Load Balance Multicast Routing Algorithm Based on distributed computation and Centralized Control

A Kind of Load Balance Multicast Routing Algorithm Based on ...

引用

International Conference on Recent Trends in Materials and Mechanical Engineering (ICRTMME 2011)

作者： Chen Xiang Tang Jun-yong Zhang Yong Xian Technol Univ Sch Civil Engn Xian Peoples R China Xian Technol Univ Dept Comp Sci & Engn Xian Peoples R China Wuhan Univ Sci & Technol Wuhan Peoples R China

ISBN: (纸本)9783037850992

distributed routing can find multicast tree and adapt to dynamic changes of multicast members in case of acknowledge local network state. Majority of current distributed multicast routing algorithms based on the shortest delay, which can achieve load balance large additional overhead. The paper presented a kind of load balance multicast routing algorithm based on distributed computation and centralized control. It reside computation Agent in each node to compute forward probability and to maintain node routing table, node state table and forwarding probability table. In addition, it can detect delay of adjacent nodes and coordinate session establishment based on the copy, parameter transmission and notification of control Agent. On this basis, the algorithm achieved dynamically joins and leave session of multicast members. Algorithm analysis results show that the algorithm can improve the overall efficiency of network transmission.

关键词： multicast routing Agent distributed computation centralized control

来源：评论

学校读者我要写书评

暂无评论

Parallelization in Predicting Species Distribution 7

Parallelization in Predicting Species Distribution

引用

7th IEEE International Advance Computing Conference (IACC)

作者： da Luz, Cleber Silva F. Sato, Liria M. Acosta, Andre L. Saraiva, Antonio M. Midorikawa, Edson T. EPUSP Dept Comp Engn & Digital Syst Sao Paulo SP Brazil Univ Sao Paulo Res Ctr Biodivers & Computat BioComp NAP USP Sao Paulo Brazil

ISBN: (纸本)9781509015603

Species distribution models allow the development of strategies and policies for the species sustainability. However, the process of predicting species distribution analyzes and produces a considerable amount of data, which takes hours or days to compute. The predicting process, including modeling and projection stages, requires efficient computational tools and good strategies of parallelization allowing the decrease of execution time. This paper presents a parallel solution for predicting species distribution through the parallelization of the BIOMOD2 platform. The parallel application can be run on a computer with multiple cores or a cluster. Besides decreasing the execution time, it aims at reducing the idleness of the resources. It performs an optimization on the use of the processing resources. The experiments demonstrate that it is possible to reduce the predicting process from 106 minutes to 10 minutes by using 20 cores of a cluster composed by five nodes.

关键词： Species Distribution Modeling BIOMOD2 Parallel computation distributed computation

来源：评论

学校读者我要写书评

暂无评论

Application of High Performance Computing in California ISO's On-line DSA System

Application of High Performance Computing in California ISO'...

引用

2017 IEEE Power & Energy Society General Meeting

作者： Abdul-Rahman, Khaled Wu, Jun Haq, Enamul Howell, Frederic Lin, Xi Wang, Lei Calif ISO Power Syst & Smart Grid Technol Dev Folsom CA 95630 USA Calif ISO Power Syst Technol Dev Grp Folsom CA 95630 USA Powertech Labs Inc Software Technol 12388 88TH Ave Surrey BC V3W 7R7 Canada Powertech Labs Inc Applicat Delivery Software Technol 12388 88TH Ave Surrey BC V3W 7R7 Canada Calif ISO 250 Outcropping Way Folsom CA 95630 USA

ISBN: (纸本)9781538622124

This paper discusses the implementation of an on-line dynamic security assessment (DSA) system at California ISO (CAISO). On-line DSA is a technology known to include massive amount of computations. CAISO has high standards on system models, computational tasks, result accuracy, and speed performance for such a function. Thus no compromise is allowed on technical approaches to be used and high performance computing (HPC) is considered as the means to address this challenge. A technique, referred to as distributed computation, in which the on-line DSA function is split into smaller computation tasks which are then allocated in multiple computation engines running in multiple computer CPU (or CPU cores) was designed and implemented. The details of this approach is presented in the paper, and the performance as well as operation experience of the on-line DSA system is discussed.

关键词： Dynamic security assessment power system stability on-line DSA high performance computing distributed computation

来源：评论

学校读者我要写书评

暂无评论

Secure and Efficient k-NN Queries 32nd

Secure and Efficient k-NN Queries

引用

32nd IFIP TC 11 International Conference on ICT Systems Security and Privacy Protection (IFIP SEC)

作者： Asif, Hafiz Vaidya, Jaideep Shafiq, Basit Adam, Nabil Rutgers State Univ MSIS Dept New Brunswick NJ 08901 USA Lahore Univ Managment Sci CS Dept Lahore Pakistan

ISBN: (纸本)9783319584690;9783319584683

Given the morass of available data, ranking and best match queries are often used to find records of interest. As such, k-NN queries, which give the k closest matches to a query point, are of particular interest, and have many applications. We study this problem in the context of the financial sector, wherein an investment portfolio database is queried for matching portfolios. Given the sensitivity of the information involved, our key contribution is to develop a secure k-NN computation protocol that can enable the computation k-NN queries in a distributed multi-party environment while taking domain semantics into account. The experimental results show that the proposed protocols are extremely efficient.

关键词： k-NN queries k-NN classification Privacy distributed computation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：