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

International Conference on Computational Intelligence, Communication Systems and Networks

作者： Ahmedi, Basri Mitrevski, Pece State Univ Tetovo Fac Math & Nat Sci Tetovo North Macedonia Univ St Clement Ohridski Fac Tech Sci Bitola North Macedonia

ISBN: (纸本)9781479950768

The most important stages in designing a computer network in a wider geographical area include: definition of requirements, topological description, identification and calculation of relevant parameters (i.e. traffic matrix), determining the shortest paths between nodes, quantification of the effect of various levels of technical and technological development of urban areas involved, the cost of technology, and the cost of services. These parameters differ for WAN networks in different regions - their calculation depends directly on the data "on the ground": number of inhabitants, distance between populated areas, density of network traffic, as well as available bandwidth. However, behavioral interactions of individuals and groups play a significant role and have to be taken into consideration by employing either simple or composite indicators of socioeconomic status. In this paper, we propose the inclusion of a composite socioeconomic indicator in the cost-modeling of a WAN network, as a linear sum of products of weights and several measures of labor status and/or education.

关键词： Wide Area Network traffic matrix shortest path algorithm traffic density network bandwidth socioeconomic indicators

来源：评论

学校读者我要写书评

暂无评论

Assessment methods for the targeted reconfiguration in distribution networks

Assessment methods for the targeted reconfiguration in distr...

引用

IEEE Eindhoven PowerTech Conference

作者： S. Toure E. Vanet R. Caire Y. Besanger Univ. Grenoble Alpes CNRS G2Elab Grenoble France

In this paper, we propose methods for minimizing power losses through dynamic reconfiguration. Two methods for determining the best sequence of configurations, while minimizing the total network losses and reconfiguration cost have been developed. The first method is based on a shortest path algorithm, whereas the second one is based on mixed integer linear programming. The algorithms are tested on an IEEE network with and without distributed generation;the results are presented and compared for the two different methods.

关键词： Dynamic Distribution Reconfiguration Problem shortest path algorithm Mixed Integer Linear Problem Distributed Generation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

OPERATIONAL RATE-DISTORTION SHAPE CODING WITH DUAL ERROR REGULARIZATION

OPERATIONAL RATE-DISTORTION SHAPE CODING WITH DUAL ERROR REG...

引用

IEEE International Conference on Image Processing

作者： Zhongyuan Lai Fan Zhang Weisi Lin Institute for Interdisciplinary Research Jianghan University Image and Visual Computing Lab Lenovo Group Ltd. School of Computer Engineering Nanyang Technological University

ISBN: (纸本)9781479957521

Existing operational rate-distortion shape coding aims at finding a polygon which can be encoded with the lowest bit rate under a given upper bound on the edge error. However, this upper bound may cause noticeable errors. Therefore, we add an l_2-norm error regularization term to the objective function, and seek the globally optimal solution using a shortest path algorithm for a weighted directed acyclic graph. Experiments confirm the accuracy and robustness of our method.

关键词： Shape coding Operational rate-distortion theory Dual error regularization shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fast Train: A Computationally Efficient Train Routing and Scheduling Engine for General Rail Networks

Fast Train: A Computationally Efficient Train Routing and Sc...

引用

IEEE International Conference on Intelligent Transportation Systems

作者： Lingyun Meng Xuesong Zhou State Key Lab. of Rail Traffic Control & Safety Beijing Jiaotong Univ. Beijing China

ISBN: (纸本)9781479960798

A number of tactical and operational applications, such as train timetabling and dispatching, require sophisticated and computationally efficient software to optimize train schedules. An open-source train scheduling package, namely FastTrain has been designed and implemented to generate feasible schedules and optimality gap estimates for trains on a generic rail network with both single and double tracks. This paper describes its two major modelling components: (1) a network cumulative flow model to capture the complex safety rules of infrastructure resources, and (2) a Lagrangian relaxation solution framework which efficiently decomposes the original multi-trains complex model to a set of single train oriented subproblems. Two experimental cases based on the adapted datasets released by INFORMS RAS are conducted to demonstrate the effectiveness and efficiency of the developed algorithm under different network and data availability conditions.

关键词： public domain software rail traffic traffic engineering computing FastTrain open-source train scheduling package INFORMS RAS Lagrangian relaxation solution framework data availability condition general rail networks network availability condition network cumulative flow model train routing train scheduling Adaptation models Computational modeling Mathematical model Rails Safety Schedules Software Lagrangian Relaxation Resource Constraints shortest path algorithm Train Routing Train Scheduling

来源：评论

学校读者我要写书评

暂无评论

VLSI Architecture for Layered Decoding of QC-LDPC Codes With High Circulant Weight

引用

IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS 2013年第10期21卷 1960-1964页

作者： Sun, Yang Cavallaro, Joseph R. Rice Univ Dept Elect & Comp Engn Houston TX 77005 USA

In this brief, we propose a high-throughput layered decoder architecture to support a broader family of quasicyclic low-density parity-check (QC-LDPC) codes, whose parity-check matrices are constructed from arrays of circulant submatrices. Each nonzero circulant submatrix is a superposition of K cyclic-shifted identity matrices, where the circulant weight K >= 1. We propose a novel layered decoder architecture to support QC-LDPC codes with any circulant weight. We present a block-serial decoding architecture which processes a layer of a parity check matrix block by block, where each block is a Z x Z circulant matrix with a circulant weight of K. In the case study, we demonstrate an LDPC decoder design for the China Mobile Multimedia Broadcasting (CMMB) standard, which was synthesized for a TSMC 65-nm CMOS technology. With a core area of 3.9 mm(2), the CMMB LDPC decoder achieves a maximum throughput of 1.1 Gb/s with 15 iterations.

关键词： ASIC MIMO detection shortest path algorithm soft-output MIMO detector VLSI architecture

来源：评论

学校读者我要写书评

暂无评论

A Method of shortest path Raytracing with Dynamic Networks

引用

Chinese Journal of Geophysics 2013年第5期47卷 1013-1018页

作者： Jian-Zhong Zhang Shi-Jun Chen Chu-Wei Xu Department of Communications Engineering Xiamen University Xiamen 361005 China Geophysical Research Institute of Shengli Oilfield Dongying 257022 China

The shortest path raytracing algorithm in networks has been widely applied to calculate seismic ray paths and traveltimes, in which the beelines between network nodes are used to approximate the ray paths. When using a few nodes the ray usually follows a zigzag path that is longer than the real raypath, and the calculated traveltime at a receiver is also larger than the real one. To solve this problem, we develop a shortest path raytracing method with dynamic networks based on the shortest path algorithm. In the process of expanding wavefront away from a source throughout the entire model, the wavefront times are sampled at all nodes on the cell edges. In each cell the traveltime at any point on an edge is expressed with linear interpolation between calculated traveltimes at adjacent nodes on the same cell edge, and then Fermat's Principle is used to determine the first arrival times at the nodes on the other edges of this cell. After the first arrival times at all nodes are calculated, trace raypath from a receiver to a source in the same way as the forward sampling for all pairs of receivers and sources is performed. So the drawbacks of conventional shortest path raytracing methods are overcome, and the precision of calculated minimal traveltimes and the correspondent raypaths are improved greatly.

关键词： shortest path algorithm Dynamic network Wavefront Ray paths

来源：评论

学校读者我要写书评

暂无评论

Line Maze Robot Training Course for the Senior High School Students

引用

International Conference on Mechatronics and Control Engineering (ICMCE 2012)

作者： Lee, Chyi-Shyong Su, Juing-Huei Huang, Hsin-Hsiung Fu, Sin-Mao Lunghwa Univ Sci & Technol Dept Elect Engn Taoyuan Cty Taiwan

ISBN: (纸本)9783037855959

A line maze robot training course, which contains the hardware circuit implementation, firmware programming skills and the shortest path algorithm, is presented in this paper. The training course is used for vocation senior high school teachers and students. The major topic for students is to develop the proper firmware programming to achieve the better performance and students are encouraged to pass the small contest in the end of the workshop. The low-cost educational platform is easily by the economically disadvantaged students. Students, who join the workshop can learn the basic C language, the firmware programming skills for microcontrollers, the concept of the shortest path algorithm for line maze robot, just spend less $40 USD to buy the robots. The contributions of this training course are as follows: 1) studying the hardware implementation knowledge, 2) developing microcontroller-related firmware programming skills, 3) learning motion control skills of the line maze robot, and 4) learning line-maze solving algorithms. Few students, who join this training workshop and learn the related hardware, firmware and algorithm, can find the shortest path form source to target in the line map. The feedback of the most students shows that the training course gives them the motivation to actively learn the necessary practical skills to design the firmware programming to guide the line maze robot.

关键词： Line maze robot motion control firmware programming shortest path algorithm

来源：评论

学校读者我要写书评

暂无评论

Dealing with Loop-based Map by Line Maze Robot Training Kit

引用

International Conference on Mechatronics and Control Engineering (ICMCE 2012)

作者： Huang, Hsin-Hsiung Su, Juing-Huei Lee, Chyi-Shyong Chang, Yi-Wei Syu, Jheng-Yan Lunghwa Univ Sci & Technol Dept Elect Engn Tao Yuan Taiwan

ISBN: (纸本)9783037855959

A line maze robot training kit, which is able to deal with the loop-based cyclic map, is presented to teach the topics of the hardware circuit, firmware programming for motion control and the algorithm for the cyclic paths detection. The training course is used for the senior high school students. The objectives of this work are to train the practical skills, including the concept of the hardware circuit, the motion control with the corresponding firmware programming and the algorithm for the loop-based map. Students, who attended the training course, can learn the basic programming language, the controlling concept for microcontrollers. Moreover, students learn the rules of the line maze contest, including setting for source and target of the map. How to determine the target position according to the optical sensors in front of the line maze robot and how to control the two DC motors are also illustrated. In the workshop, a Matlab simulator is used to train students how to design a feasible map and perform the algorithm to find the shortest path from the source to target. The feedback from most students is that the training kit makes them be interested in robot game and increases the motivation to actively learn the firmware and the shortest path algorithm.

关键词： shortest path algorithm the loop-based map line maze robot encoder circuit speed control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：