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

Reconstruction and application of flooding routing algorithm for smart street light over wireless sensor networks

INTERNATIONAL JOURNAL OF INTERNET PROTOCOL TECHNOLOGY 2020年第1期13卷 9-17页

作者： Wang, Zhichao Tang, Liang Huang, Jun Steed Shi, Hongwei Bian, Li Suqian Coll Inst Elect & Informat Suqian 223800 Peoples R China Carleton Univ 1125 Colonel By Dr Ottawa ON K1S 5B6 Canada

For smart street light wireless sensor networks, there are huge number of redundant packets flooding in the route discovery process, resulting in information explosion and high energy consumption. This paper proposes an improved flooding routing protocol, during the route discovery process, each node could receive signals such as the serial number of packets copies, destination address, node types and so on, the algorithm will judge whether the received signals need to be continue forwarded in a certain forward probability or not. Thus, the total forward times will be reduced and accordingly the information explosion could be prevented and the energy consumption could be reduced without reducing the reliability. Simulation experiments are conducted on MATLAB, and results show that the improved algorithm has much more higher flooding efficiency than the traditional flooding routing algorithm, and a very broad application prospect to balance the efficiency versus the reliability of the whole networks.

关键词： smart lighting packets flooding algorithm efficiency network reliability

来源：评论

学校读者我要写书评

暂无评论

RECURSIVE-IDENTIFICATION METHOD FOR MISO WIENER-HAMMERSTEIN MODEL

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1995年第2期40卷 287-291页

作者： BOUTAYEB, M DAROUACH, M CRAN-EARAL CNRS UA 82 I Université de Nancy Cosnes-et-Romain France

A simple technique for recursive identification of the Wiener-Hammerstein model with extension to the multi-input single-output (MISO) case is presented. We use a new transformation of the input-output difference equation where parameters to be estimated are those of each subsystem of the initial and unique realization. After that, a weighted extended least squares (WELS) method is employed to estimate recursively and separately parameters of the linear subsystems and the static nonlinear element. Convergence analysis of the proposed procedure is also studied. Finally, a numerical example is provided to show the efficiency of the algorithm

关键词： algorithm efficiency SUB-SYSTEM multiple-input single-output Recursive Identification methods numerical example nonlinear device

来源：评论

学校读者我要写书评

暂无评论

Methodology of Effective Task Planning and algorithm for Multivariate Computation of the Characteristics of a Quantum Rotation Sensor on a Hybrid Supercomputer Cluster

引用

AUTOMATIC CONTROL AND COMPUTER SCIENCES 2018年第6期52卷 496-504页

作者： Ilyashenko, A. S. Voskoboynikov, S. P. Ustinov, S. M. Lukashin, A. A. Peter Great St Petersburg Polytech Univ St Petersburg 195251 Russia

The problem of planning supercomputer computations is considered using the example of computing the characteristics of a quantum rotation sensor model. A methodology for applying the task scheduling algorithm is proposed. For this purpose, time estimates were obtained for computations at cluster nodes. The possibility of dividing settlements by cluster nodes without additional synchronization costs is shown. A start-up algorithm for improving the efficiency of multivariate computations is presented, and the efficiency of the planning algorithm in its use is estimated.

关键词： task assignment numerical model hybrid supercomputers Polytechnic Supercomputer Center quantum rotation sensor algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

Lossy data compression reduces communication time in hybrid time-parallel integrators

引用

COMPUTING AND VISUALIZATION IN SCIENCE 2018年第1-2期19卷 19-30页

作者： Fischer, Lisa Goetschel, Sebastian Weiser, Martin Zuse Inst Berlin Takustr 7 D-14195 Berlin Germany

Parallel-in-time methods for solving initial value problems are a means to increase the parallelism of numerical simulations. Hybrid parareal schemes interleaving the parallel-in-time iteration with an iterative solution of the individual time steps are among the most efficient methods for general nonlinear problems. Despite the hiding of communication time behind computation, communication has in certain situations a significant impact on the total runtime. Here we present strict, yet not sharp, error bounds for hybrid parareal methods with inexact communication due to lossy data compression, and derive theoretical estimates of the impact of compression on parallel efficiency of the algorithms. These and some computational experiments suggest that compression is a viable method to make hybrid parareal schemes robust with respect to low bandwidth setups.

关键词： parallelism Scheme iterative solution Communication Research Parallel Lines Initial value problems compression lossy compression algorithm efficiency Runtime

来源：评论

学校读者我要写书评

暂无评论

Elimination of systematic measurement inaccuracy in voltage-capacitance spectroscopy of semiconductor/insulator interface

引用

INSTRUMENTS AND EXPERIMENTAL TECHNIQUES 2002年第2期45卷 256-261页

作者： Zhdan, AG Kukharskaya, NF Chucheva, GV Russian Acad Sci Inst Radio Engn & Elect Fryazino 141190 Russia

An improved algorithm for measurements of quasi-static voltage-capacitance characteristics (VCC) of metal-insulator-semiconductor (MIS) structures is suggested. This algorithm includes the following stages: high-temperature depolarization of a MIS structure, its cooling at a constant depolarization voltage, measurement of the MIS current I(V-g) upon the linearly time-swept (increasing or decreasing) gate potential, and averaging of the dependences I(V-g) obtained in the modes of sweep rate beta(nu) > 0 and beta(nu) < 0 (beta(nu) = 0). The method allows the systematic error of the VCC C(V-g) measurement caused by the relaxation polarization of the insulator, leakage current, and shift of the electrometer zero to be eliminated. As a result, the accuracy and reliability of the determination of the interface state (IS) density N-ss(E) are increased, and the energy range of the IS spectra is extended. To test the efficiency of the algorithm developed, it was used for determining the function N-ss(E) in the system SiO2/(100)Si : P.

关键词： metal-oxide-semiconductor structures Chpher(0) Systematic errors ENERGY RANGE voltage measurement SCAN RATE Depolarization Shift interface states Spectra Gate potential algorithms algorithm efficiency averaging metal insulator semiconductors

来源：评论

学校读者我要写书评

暂无评论

PROBLEMS OF DISCRETE OPTIMIZATION: CHALLENGES AND MAIN APPROACHES TO SOLVE THEM

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2006年第4期42卷 465-482页

作者： Sergienko, I. V. Shylo, V. P. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine

This paper briefly reviews the current state of the art in the field of discrete optimization problems. Emphasis is on the generalization of the experience gained at the V. M. Glushkov Institute of Cybernetics of the National Academy of Sciences of Ukraine in research and development of solution methods and software for various classes of complicated discrete programming problems.

关键词： discrete optimization decrease-vector method method of global equilibrium search metaheuristics computational experiment algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

SOLVING WEIGHTED MAX-CUT PROBLEM BY GLOBAL EQUILIBRIUM SEARCH

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2012年第4期48卷 563-567页

作者： Shylo, V. P. Shylo, O. V. Roschyn, V. A. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Univ Pittsburgh Pittsburgh PA 15260 USA

A new algorithm based on the global equilibrium search (GES) is developed to solve the weighted max-cut problem and is compared with currently the best solution algorithms. The advantages of the GES algorithm both in ... 详细信息

关键词： maximum weighted cut of a graph global equilibrium search computing experiment algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

Closure to "Efficient algorithm for computing Einstein integrals" by Junke Guo and Pierre Y. Julien

引用

JOURNAL OF HYDRAULIC ENGINEERING 2006年第3期132卷 337-339页

作者： Guo, J Julien, PY Univ Nebraska Dept Civil Engn Omaha NE 68182 USA Colorado State Univ Dept Civil Engn Engn Res Ctr Ft Collins CO 80523 USA

We would like to thank all the discussers for their constructive comments and for providing alternative approximations of the Einstein integrals. It is commonly agreed that these two integrals remain elusive to exact solutions. However, a lot of progress has been made in developing fast and accurate approximations. Abad and Garcia emphasize the need for simpler algorithms and propose a polynomial approximation. Srivastava provides keen insight into the convergence of the series and offers improvements. Roland et al. present an error analysis as well as a valuable comparison of the computational time of various algorithms. Besides polynomial approximations and different series expansions, other e-mail communications by A. R. Kacimov pointed to the possible use of hypergeometric series as well as software packages like MatLab, Maple, and Mathematica. Four main issues are raised in the discussions and they are addressed in the following sequence: (1) convergence; (2) algorithm efficiency; (3) accuracy; and (4) computational time. This closure also includes a comparative analysis of the different algorithms and an application example on the Missouri River.

关键词： Series expansions Missouri River Error analysis computational time Polynomial approximation efficient algorithm Software packages Symbolic algebra hypergeometric series algorithms mathematics computing integration surgical closure Integral equations algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

SOLVING THE MAXCUT PROBLEM BY THE GLOBAL EQUILIBRIUM SEARCH

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2010年第5期46卷 744-754页

作者： Shylo, V. P. Shylo, O. V. Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Univ Pittsburgh Pittsburgh PA USA

The authors propose an approach to the solution of the maxcut problem. It is based on the global equilibrium search method, which is currently one of the most efficient discrete programming methods. The efficiency of ... 详细信息

关键词： cutset approximate methods global equilibrium search computational experiment algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

Solving the Quadratic Assignment Problem

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2020年第1期56卷 53-57页

作者： Sergienko, I., V Shylo, V. P. Chupov, S., V Shylo, P., V Natl Acad Sci Ukraine VM Glushkov Inst Cybernet Kiev Ukraine Uzhgorod Natl Univ Uzhgorod Ukraine

Two modifications of the repeated iterated tabu algorithm for solving the quadratic assignment problem (with and without kernel allocation technology) are proposed. These modifications are analyzed and compared with the best modern algorithms for solving this problem. The efficiency of the developed algorithms is shown, in particular, for large-scale problems for which new records were found with their help.

关键词： quadratic assignment problem repeated iterated tabu search solution kernel allocation technology random perturbation of solution components algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：