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

Maximizing the Network Life Time of Wireless Sensor Networks Using a Mobile Charger

WIRELESS PERSONAL COMMUNICATIONS 2018年第2期102卷 1029-1039页

作者： Magadevi, N. Kumar, V. Jawahar Senthil Suresh, A. Anna Univ Dept Elect & Elect Engn Madras Tamil Nadu India Anna Univ Dept Elect & Commun Engn Coll Engn Guindy Madras Tamil Nadu India SA Engn Coll Dept Elect & Elect Engn Chennai Tamil Nadu India

In Wireless Sensor Networks (WSN) the wireless nodes work untethered and have limited power resource. Wireless charging provides an alternative approach to recharge the batteries of the wireless nodes. Localization provides the position information. Previous works have considered either on recharging techniques or on the localization. This paper proposes a wireless recharging and also localization using a single mobile anchor. First the mobile anchor locates the static node later it receives the battery level. Finally if the battery of the static node is lesser than the threshold limit b, it recharges the static nodes wirelessly. Also the mobile anchor follows an energy efficient path V curve algorithm. The proposed method can handle the dynamic energy demand efficiently.

关键词： Wireless sensor network Mobile anchor Wireless energy transfer Path planning back tracking algorithm

来源：评论

学校读者我要写书评

暂无评论

A Multilogic Probabilistic Signed Directed Graph Fault Diagnosis Approach Based on Bayesian Inference

引用

INDUSTRIAL & ENGINEERING CHEMISTRY RESEARCH 2014年第23期53卷 9792-9804页

作者： Peng, Di Geng, Zhiqiang Zhu, Qunxiong Beijing Univ Chem Technol Coll Informat Sci & Technol Beijing 100029 Peoples R China

Signed directed graph (SDG), as a widely applied fault diagnosis approach, is unable to express complicated logic relations other than logic OR and usually results in spurious interpretations. To solve the problem, a semiquantitative fault diagnosis approach based on the model of multilogic probabilistic SDG (MPSDG) with Bayesian inference is proposed. The MPSDG model introduces the logic gates to describe multiple logic causalities between process variables, and the priori probabilistic parameters in MPSDG are decided by the historical malfunction frequencies and the deviation of variables. When a failure occurs, the backtracking algorithm using the consistent rule is conducted immediately, and the posterior probabilities of each searched fault are computed and sorted by a set of Bayesian inference mechanisms. Thus, the real reason is further distinguished. This MPSDG based fault diagnosis approach is applied to two examples: a continuous stirred tank heater (CSTH) process and a Tennessee Eastman (TE) process. The experimental results demonstrate that the proposed approach is superior to the conventional SDG approach and can diagnose the production faults more accurately.

关键词： back tracking algorithm Signed secoisolariciresinol diglucoside Bayesian inference Formal logic Process variables Fault diagnosis Logic gates

来源：评论

学校读者我要写书评

暂无评论

Phase Retrieval of Sparse L-ary Signals From Magnitudes of Their Fourier Transform

Phase Retrieval of Sparse L-ary Signals From Magnitudes of T...

引用

Iran Workshop on Communication and Information Theory (IWCIT)

作者： Borujeni, Mohsen Shabanian Parvaresh, Farzad Univ Isfahan Dept Elect Engn Esfahan Iran

ISBN: (纸本)9781479948772

The problem of recovering a sparse L-ary signal from magnitudes of its Fourier transform or equivalently its autocorrelation function is considered. Although, one can show that solving the phase retrieval problem for L-ary signals is possible in time that is polynomial in L and length of the signal, however, the current algorithms are still not practical. We introduce a backtracking algorithm on a tree which solves the phase retrieval problem. By simulations, we show that the average number of nodes visited on the tree by the backtracking algorithm grows polynomially in L and signal length, although the search tree has an exponential size.

关键词： back tracking algorithm Fourier Transform signals Tree searching retrieval Autocorrelation function Trees Phase Polynomial

来源：评论

学校读者我要写书评

暂无评论

Guaranteeing Stability and Delay in Dynamic Networks based on Infinite Games 11

Guaranteeing Stability and Delay in Dynamic Networks based o...

引用

11th IEEE International Conference on Mobile Ad Hoc and Sensor Systems

作者： Tenbusch, Simon Loeding, Christof Radmacher, Frank Gross, James Rhein Westfal TH Aachen Dept Comp Sci Aachen Germany KTH Royal Inst Technol Sch Elect Engn Stockholm Sweden

ISBN: (纸本)9781479960361

We study stability and delay in dynamic networks under adversarial conditions. Adversarial conditions are mandatory in establishing deterministic performance guarantees in networks. Under this framework, we concentrate on the general stability region for a network, i.e. without specifying the routing algorithm. This is in contrast to related work for adversarial network conditions, where usually the back-pressure routing algorithm is considered. Our work consists of four novel contributions: (1) We present a novel analysis model which is based on the theory of infinite two-player games;(2) Using this approach, we can characterize the stability region of networks under adversarial conditions for arbitrary routing schemes;(3) We determine conditions under which a delay bound for packet forwarding under adversarial conditions exists;(4) We provide a backtracking algorithm which determines in a model-checking fashion network stability. The backtracking algorithm is furthermore shown to reduce the computational effort significantly for practical scenarios.

关键词： backtracking computational complexity computer networks formal verification game theory telecommunication network routing backpressure routing algorithm backtracking algorithm computational effort reduction dynamic network stability infinite two-player game theory model-checking fashion network stability packet forwarding delay Circuit stability Delays Games Routing Stability criteria Throughput back tracking algorithm Game theory circuit stability dynamic network backtracking telecommunication network routing Stability criteria computer network Formal verification delay Network routing stability region Throughput complexity classes

来源：评论

学校读者我要写书评

暂无评论

Occlusion-Robust Pedestrian tracking in Crowded Scenes

Occlusion-Robust Pedestrian Tracking in Crowded Scenes

引用

International IEEE Conference on Intelligent Transportation Systems

作者： Jeroen S. van Gastel Matthijs H. Zwemer Rob G.J. Wijnhoven Peter H.N. de With Eindhoven University of Technology the Netherlands. ViNotion B.V. Eindhoven the Netherlands. Contact

ISBN: (纸本)9781467365970

This paper focuses on tracking in typical traffic monitoring scenarios with emphasis on handling occlusions caused by trees, lampposts and cables. We extend the existing tracking with Occlusion handling and Drift correction (TROD) algorithm with a novel occlusion detection algorithm, based on measuring the changes in the object motion pattern. The motion information is extracted via frame differencing and described a the HOG descriptor. Occlusions are handled by preventing the model update and predicting the object location based on prior observations. Our proposed system clearly outperforms state-of-the-art tracking algorithms for larger occlusions in the specific pedestrian surveillance scenario, that is, the percentage of successfully tracked objects grows with 10-15%. At the same time, for non-specific public datasets, the performance is similar to existing state-of-the-art tracking algorithms.

关键词： paper focuses object motion pattern HOG descriptor Object motion Occlusion tracking Pedestrians back tracking algorithm edge following algorithm star tracking algorithm cable Crowding Model updating

来源：评论

学校读者我要写书评

暂无评论

Vision-Based tracking and Estimation of Ground Moving Target Using Unmanned Aerial Vehicle

Vision-Based Tracking and Estimation of Ground Moving Target...

引用

American Control Conference

作者： Mingfeng Zhang Hugh H.T. Liu Institute for Aerospace Studies University of Toronto Toronto Canada

ISBN: (纸本)9781424474264

The problem of autonomous tracking a ground moving target using one single unmanned aerial vehicle is studied. An integrated tracking algorithm is proposed and it consists of a vision-based estimator and a Lyapunov vector field-based guidance law. The tracking trajectory converges to a circular orbit loitering around the target of arbitrary motion. Further, the proposed estimator ensures continuous tracking mission in presence of the loss-of-tracking events. The performance of the proposed tracking algorithm is demonstrated through computer simulations.

关键词： vehicle Unmanned Aerial Vehicle drone honey bees tracking Moving ground back tracking algorithm edge following algorithm star tracking algorithm

来源：评论

学校读者我要写书评

暂无评论

Routing Optimization algorithms Based on Node Compression in Big Data Environment

引用

SCIENTIFIC PROGRAMMING 2017年第Pt.2期2017卷 1-7页

作者： Yang, Lifeng Chen, Liangming Wang, Ningwei Liao, Zhifang Yunnan Open Univ Sch Continuing Educ Kunming Yunnan Peoples R China Cent South Univ Sch Software Changsha Hunan Peoples R China

Shortest path problem has been a classic issue. Even more so difficulties remain involving large data environment. Current research on shortest path problem mainly focuses on seeking the shortest path from a starting point to the destination, with both vertices already given;but the researches of shortest path on a limited time and limited nodes passing through are few, yet such problem could not be more common in real life. In this paper we propose several time-dependent optimization algorithms for this problem. In regard to traditional backtracking and different node compression methods, we first propose an improved backtracking algorithm for one condition in big data environment and three types of optimization algorithms based on node compression involving large data, in order to realize the path selection from the starting point through a given set of nodes to reach the end within a limited time. Consequently, problems involving different data volume and complexity of network structure can be solved with the appropriate algorithm adopted.

关键词： Line of nodes Environments shortest path Ganglia destination back tracking algorithm Route optimization Optimization algorithms big data Shortest path problem

来源：评论

学校读者我要写书评

暂无评论

Optimum Location of Voltage Regulators in the Radial Distribution Systems

引用

INTERNATIONAL JOURNAL OF EMERGING ELECTRIC POWER SYSTEMS 2016年第3期17卷 351-361页

作者： Salkuti, Surender Reddy Lho, Young Hwan Woosong Univ Dept Railrd & Elect Engn Daejeon 300718 South Korea

In this paper, a new heuristic algorithm is proposed for the optimum voltage control, which is applicable for the large Radial Distribution Systems (RDSs). In the RDSs, voltage levels at different buses can be maintained within the specified limits using the conductor grading or placing the Voltage Regulators (VRs) and capacitors at suitable locations. The proposed back tracking algorithm (BTA) proposes the optimal location, number and tap positions of VRs to maintain the voltage profile within the desired limits and decreases losses in the system, which in turn maximizes the net savings in the operation of distribution system. In addition to BTA, an approach using the fuzzy logic called Fuzzy Expert System (FES) is also proposed, and the results of FES are compared with the results of BTA. This heuristic algorithm proposes the optimal location and tap setting of VRs, which contributes a smooth voltage profile along the network. It also used to access the minimum number of initially considered VRs, by moving them in such way as to control the network voltage at minimum possible cost. It is concluded that the FES also gives the optimal placement and the number along with the tap settings of VRs. The proposed FES contributes good voltage regulation, and decreases the power loss which in turn increases the net savings when compared to the BTA. The effectiveness of the proposed heuristic approaches are examined on practical 47 bus and 69 bus Radial Distribution Systems (RDSs).

关键词： back tracking algorithm distribution systems fuzzy logic optimal location tap positions voltage regulators

来源：评论

学校读者我要写书评

暂无评论

Start-up Sequence of Generators in Power System Restoration Avoiding The backtracking algorithm

Start-up Sequence of Generators in Power System Restoration ...

引用

IEEE Power and Energy Society General Meeting

作者： Chongru Liu Minhao Wu Yingsong Deng State Key Lab. for Alternate Electrical Power System with Renewable Energy Sources North China Electric Power iversity Beijing China the State Key Lab. for Alternate Electrical Power System with Renewable Energy Sources North China Electric Power University Beijing China

ISBN: (纸本)9781479913022

Generator start-up sequence is critical to power system restoration. A new algorithm to optimize the start-up sequence of generators based on Dijkstra method is proposed in this paper. First, a combined weight is proposed for the Dijkstra method to balance various optimization objects. Based on the modified weights, a priority index considering the branch weight, generator start-up requirement and ramping rate is proposed to optimize the generator start-up sequence. Second, we analyze the backtracking algorithm in detail and found its limitation and disadvantages, which leads a large amount of calculation and start-up failure. A new algorithm to calculate the start-up sequence is proposed. It can avoid the repetition calculation of Dijkstra and reduce the computation cost by avoiding backtracking. Finally, the IEEE 30-Bus system and Guangdong power grid system are used to validate the proposed algorithm. Simulation results show that the proposed method is efficiency and it can decrease the restoration time significantly.

关键词： power system restoration generator start-up sequencing dijkstra algorithm priority index avoid backtracking Power system restoration dynamos back tracking algorithm Dijkstra's algorithm Generator

来源：评论

学校读者我要写书评

暂无评论

A Study on Beam Resource Optimization algorithm for multifaceted Phased Arrays

A Study on Beam Resource Optimization Algorithm for multifac...

引用

UK, Europe, China Millimeter Waves and THz Technology Workshop (UCMMT)

作者： Ziyao Lu Zhen Cao Guoqing He Qian Zhang Jingtian Li Nanjing University of Posts and Telecommunications Nanjing Jiangsu China

ISBN: (数字)9781538674970

ISBN: (纸本)9781538674987

In order to meet the needs of multiple targets over the hemispherical space, and as far as possible to increase the antenna scanning angle range and reduce the side lobe level, a multifaceted Phased array consisting of 16 antenna arrays has been designed and related parameters are given. Different antenna array resources need to be allocated to different targets, and the backtracking algorithm is used to quickly calculate the optimal allocation scheme. Finally, an example is given and an allocation scheme is given to verify the correctness and efficiency of the resource allocation algorithm.

关键词： phased array Antenna arrays back tracking algorithm side lobe level Optimization algorithms Allocation algorithm antenna scanning accuracy class Beams and girders Targets

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：