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

WRI International Conference on Communications and Mobile Computing

作者： Meng, Limin Zhou, Kai Hua, Jingyu Xu, Zhijiang Luo, Jiabo ZheJiang Univ Technol Coll Informat Engn Hangzhou 310014 Zhejiang Peoples R China

ISBN: (纸本)9780769535012

With the increase in size and application are of the communication network, more attention has been paid to the invulnerability of mobile ad hoc network. Based on studying deeply in the characteristic of mobile ad hoc network, analyzing the shortages in invulnerability algorithm previously, this paper presents a mathematically tractable model of node motion to derive a precise relation between mobility and connection stability. We improve the first order energy consumption model with dynamic clustering firstly and then build a incidence matrix to depict the connectivity of the network nodes in a dynamic network model. Finally, we simulate the network invulnerability related to time. Its a result, it validates the high invulnerability of the dynamic clustering ad hoc networks.

关键词： Stability analysis algorithm design and analysis Clustering algorithms Heuristic algorithms Mobile ad hoc networks Communication networks Mathematical model Motion analysis Energy consumption Ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

Prediction of workflow execution time using provenance traces: practical applications in medical data processing 12

Prediction of workflow execution time using provenance trace...

引用

12th IEEE International Conference on e-Science (e-Science)

作者： Hiden, Hugo Woodman, Simon Watson, Paul Newcastle Univ Sch Comp Sci Newcastle Upon Tyne Tyne & Wear England

ISBN: (纸本)9781509042739

The use of cloud resources for processing and analysing medical data has the potential to revolutionise the treatment of a number of chronic conditions. For example, it has been shown that it is possible to manage conditions such as diabetes, obesity and cardiovascular disease by increasing the right forms of physical activity for the patient. Typically, movement data is collected for a patient over a period of several weeks using a wrist worn accelerometer. This data, however, is large and its analysis can require significant computational resources. Cloud computing offers a convenient solution as it can be paid for as needed and is capable of scaling to store and process large numbers of data sets simultaneously. However, because the charging model for the cloud represents, to some extent, an unknown cost and therefore risk to project managers, it is important to have an estimate of the likely data processing and storage costs that will be required to analyse a set of data. This could take the form of data collected from a patient in clinic or of entire cohorts of data collected from large studies. If, however, an accurate model was available that could predict the compute and storage requirements associated with a piece of analysis code, decisions could be made as to the scale of resources required in order to obtain results within a known timescale. This paper makes use of provenance and performance data collected as part of routine e-Science Central workflow executions to examine the feasibility of automatically generating predictive models for workflow execution times based solely on observed characteristics such as data volumes processed, algorithm settings and execution durations. The utility of this approach will be demonstrated via a set of benchmarking examples before being used to model workflow executions performed as part of two large medical movement analysis studies.

关键词： Predictive models Cloud computing Computational modeling algorithm design and analysis Data models Engines Context

来源：评论

学校读者我要写书评

暂无评论

Backtracking and Dynamic Bit-shield Anti-Collision algorithm in RFID System 2

Backtracking and Dynamic Bit-shield Anti-Collision Algorithm...

引用

2017 IEEE 第2届先进信息技术,电子与自动化控制国际会议(IAEAC 2017)

作者： Mo Lei Chen HuaLi Fang MengXu Ren Ju Chengdu Aeronautic Polytechnic The Innovation Base of School-Enterprise Cooperation Aviation Electronic Technology in Sichuan SiChuan TOP IT Vocational Institute

In a radio frequency identification system, The lower identification efficiency problem of system brought by multi tags collision has become the bottleneck problem of the application of RFID technolog

ISBN: (纸本)9781467389808

关键词： Heuristic algorithms Radiofrequency identification algorithm design and analysis Satellite broadcasting Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

CPlace: A Constructive Placer for Synchronous and Asynchronous Circuits

CPlace: A Constructive Placer for Synchronous and Asynchrono...

引用

17th IEEE International Symposium on Asynchronous Circuits and Systems (ASYNC)

作者： Kounalakis, Evriklis Sotiriou, Christos P. FORTH ICS Iraklion Crete Greece Univ Crete Iraklion Greece

ISBN: (纸本)9780769543833

Despite the potential benefits of asynchronous circuits compared to synchronous circuits, only small advances have been made in the adaptation of asynchronous methodologies by the electronics industry. One of the most important reasons for that, is the lack of asynchronous Electronic design Automation (EDA) tools and the fact that existing EDA tools are not suitable for asynchronous implementations. Moreover, physical EDA tools, like placement algorithms, involve methodologies which are not applicable to asynchronous circuits, such as static timing analysis (STA) which cannot be performed in a cyclic circuit. In this work, we present CPlace, a constructive placement algorithm which can efficiently handle asynchronous circuits. We use timing separation of events for timing analysis and maintain the quasi-delay insensitive (QDI) properties by bounding the relative delays of wires in isochronic forks. We employ absolute timing constraints for performance and relative timing constraints for QDI which are handled by an ILP formulation. Experimental results show the effectiveness of CPlace in respecting QDI constraints against a synchronous, state-of-the-art industrial placer and a well-known academic placer.

关键词： algorithm design and analysis Asynchronous circuits CPlace Delay ILP formulation Integrated circuit modeling Logic gates QDI properties Wires asynchronous circuits asynchronous circuits circuit CAD constraint handling constraint handling constructive placement algorithm constructive placer delays electronic design automation inductive logic programming inductive logic programming isochronic forks logic CAD placement quasidelay insensitive properties synchronous circuits timing timing analysis timing constraints timing separation of events wire delay bounding

来源：评论

学校读者我要写书评

暂无评论

Segregated Targeting for Resource Allocation Networks with Dedicated Sources 6

Segregated Targeting for Resource Allocation Networks with D...

引用

6th International Symposium on Advanced Control of Industrial Processes (AdCONIP)

作者： Jain, Sheetal Bandyopadhyay, Santanu Indian Inst Technol Dept Energy Sci & Engn Bombay 400076 Maharashtra India

ISBN: (纸本)9781509043972

Segregated targeting problems consist of a set of sources called internal sources and multiple sets of demands called zones. Each zone consists of a set of demands and a unique resource. Internal sources are allocated to different zones such that the total resource requirement for the overall problem is minimized. In this paper, the problem definition is extended to include dedicated sources in each zone. These dedicated internal sources are specific to a zone in which they are present and are not shared with other zones. The primary objective of this paper is to develop an algorithm to determine the minimum resource requirement for the segregated problem with dedicated sources. Using rigorous mathematical arguments, a non-dimensional number is determined that dictates the allocation of an internal source to a zone for overall resource optimality. The applicability of the proposed algorithm is demonstrated through an illustrative example of carbon constrained energy sector planning.

关键词： Minimization Planning Industries Hydrogen algorithm design and analysis Resource management Carbon

来源：评论

学校读者我要写书评

暂无评论

Improved Selection of Auxiliary Objectives using Reinforcement Learning in Non-Stationary Environment 13

Improved Selection of Auxiliary Objectives using Reinforceme...

引用

13th International Conference on Machine Learning and Applications (ICMLA)

作者： Petrova, Irina Buzdalova, Arina Buzdalov, Maxim ITMO Univ 49 Kronverkskiy Prosp St Petersburg 197101 Russia

ISBN: (纸本)9781479974153

Efficiency of evolutionary algorithms can be increased by using auxiliary objectives. The method which is called EA+RL is considered. In this method a reinforcement learning (RL) algorithm is used to select objectives in evolutionary algorithms (EA) during optimization. In earlier studies, reinforcement learning algorithms for stationary environments were used in the EA+RL method. However, if behavior of auxiliary objectives change during the optimization process, it can be better to use reinforcement learning algorithms which are specially developed for non-stationary environments. In our previous work we proposed a new reinforcement learning algorithm to be used in the EA+RL method. In this work we propose an improved version of that algorithm. The new algorithm is applied to a non-stationary problem and compared with the methods which were used in other studies. It is shown that the proposed method achieves optimal value more often and obtains higher values of the target objective than the other algorithms.

关键词： evolutionary computation learning (artificial intelligence) optimisation auxiliary objective evolutionary algorithm nonstationary environment optimization process reinforcement learning algorithm design and analysis Benchmark testing Evolutionary computation Learning (artificial intelligence) Optimization Radiation detectors Switches auxiliary objectives ea+rl multiobjectivization non-stationary objective selection evolutionary algorithm learning (artificial intelligence) algorithm design and analysis Optimization Procedure Benchmark testing Radiation detectors Learning Switches Nonstationary environments Particle detectors

来源：评论

学校读者我要写书评

暂无评论

Novel Clique Enumeration Heuristic for Detecting Overlapping Clusters

Novel Clique Enumeration Heuristic for Detecting Overlapping...

引用

IEEE Congress on Evolutionary Computation (CEC)

作者： Schmitt, Rafael Ramos, Pedro Santiago, Rafael Lamb, Luis Univ Vale Itajai Lab Appl Intelligence Itajai Brazil Univ Fed Rio Grande do Sul Inst Informat Porto Alegre RS Brazil

ISBN: (纸本)9781509046010

There are several known methods for detecting overlapping communities in graphs, each one having their advantages and limitations. The Clique Percolation Method (CPM) is one such method. CPM works by joining highly connected subgraphs (cliques) and using it to find the graph communities. However, the clique enumeration problem is NP-Hard, taking exponential time to be solved. This makes its use impractical in large real-world networks and applications. The aim of this paper is to present an efficient heuristic to enumerate cliques. This enables the Clique Percolation Method to detect overlapping communities in networks containing thousands of nodes. The analyses showed that our novel heuristic is competitive with other known methods regarding solution quality and we also make the CPM more scalable.

关键词： Heuristic algorithms Clustering algorithms Binary trees Electronic mail Context Random access memory algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

A New algorithm for Solution of Resistive Networks Involving Diodes

引用

IEEE Transactions on Circuits and Systems 1976年第10期23卷 599-608页

作者： Bertsekas, Dimitri P. Department of Electrical Engineering and the Coordinated Science Laboratory University of Illinois Urbana IL 61801 United States

The solution of electric network problems by various algorithms such as for example Newton's method is often hampered by the presence of physical diodes with steeply rising exponential characteristics which cause overflow and slow convergence during numerical computation. In this paper we propose and analyze an algorithm which bypasses these difficulties by successively approximating the steep diode characteristics by smoother exponential functions. The algorithm may be modified to be used in the presence of ideal diodes and is related to penalty and multiplier methods for constrained minimization and Davidenko's method for solving certain ill-conditioned systems of nonlinear equations. © 1976 IEEE. All rights reserved.

关键词： Diodes Nonlinear equations Voltage Constraint optimization Convergence of numerical methods Computer networks Physics computing algorithm design and analysis Differential equations Circuits

来源：评论

学校读者我要写书评

暂无评论

The Swing Up Control Problem For The Acrobot

引用

IEEE Control Systems 1995年第1期15.0卷 49-55页

作者： Spong, Mark W. The Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana IL 61801 1308 W. Main St. United States

Underactuated mechanical systems are those possessing fewer actuators than degrees of freedom. Examples of such systems abound, including flexible joint and flexible link robots, space robots, mobile robots, and robot models that include actuator dynamics and rigid body dynamics together. Complex internal dynamics, nonholonomic behavior, and lack of feedback linearizability are often exhibited by such systems, making the class a rich one from a control standpoint. In this article the author studies a particular underactuated system known as the Acrobot: a two-degree-of-freedom planar robot with a single actuator. The author considers the so-called swing up control problem using the method of partial feedback linearization. The author gives conditions under which the response of either degree of freedom may be globally decoupled from the response of the other and linearized. This result can be used as a starting point to design swing up control algorithms. analysis of the resulting zero dynamics as well as analysis of the energy of the system provides an understanding of the swing up algorithms. Simulation results are presented showing the swing up motion resulting from partial feedback linearization designs.< >

关键词： Robot kinematics Actuators Mobile robots Orbital robotics Control systems Mechanical systems Linear feedback control systems algorithm design and analysis Robotics and automation Equations

来源：评论

学校读者我要写书评

暂无评论

Unbiased Sparse Subspace Clustering By Selective Pursuit 14

Unbiased Sparse Subspace Clustering By Selective Pursuit

引用

14th Conference on Computer and Robot Vision (CRV)

作者： Ackermann, Hanno Rosenhahn, Bodo Yang, Michael Ying Leibniz Univ Hannover Inst Informat Proc Hannover Germany Univ Twente Scene Understanding Grp Enschede Netherlands

ISBN: (纸本)9781538628188

Sparse subspace clustering (SSC) is an elegant approach for unsupervised segmentation if the data points of each cluster are located in linear subspaces. This model applies, for instance, in motion segmentation if some restrictions on the camera model hold. SSC requires that problems based on the l(1)-norm are solved to infer which points belong to the same subspace. If these unknown subspaces are well-separated this algorithm is guaranteed to succeed. The question how the distribution of points on the same subspace effects their clustering has received less attention. One case has been reported in which points of the same model are erroneously classified to belong to different subspaces. In this work, it will be theoretically shown when and why such spurious clusters occur. This claim is further substantiated by experimental evidence. Two algorithms based on the Dantzig selector and subspace selector are proposed to overcome this problem, and good results are reported.

关键词： Sparse matrices Clustering algorithms Motion segmentation Computer vision Data models algorithm design and analysis Distributed databases

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：