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

28th IEEE International Conference on Data Engineering (ICDE)

作者： Yu, Xiaohui Shi, Huxia Shandong Univ Sch Comp Sci & Technol Jinan 250101 Shandong Peoples R China York Univ Sch Informat Technol N York ON M3J 1P3 Canada

ISBN: (纸本)9781467300421

Keyword search over databases, popularized by keyword search in WWW, allows ordinary users to access database information without the knowledge of structured query languages and database schemas. Most of the previous studies in this area use IR-style ranking, which fail to consider the importance of the query answers. In this paper, we propose CI-RANK, a new approach for keyword search in databases, which considers the importance of individual nodes in a query answer and the cohesiveness of the result structure in a balanced way. CI-RANK is built upon a carefully designed model call Random Walk with Message Passing that helps capture the relationships between different nodes in the query answer. We develop a branch and bound algorithm to support the efficient generation of top-k query answers. Indexing methods are also introduced to further speed up the run-time processing of queries. Extensive experiments conducted on two real data sets with a real user query log confirm the effectiveness and efficiency of CI-RANK.

关键词： Key Search Database Random walk Cohesion branch and bound algorithms observational data index method

来源：评论

学校读者我要写书评

暂无评论

A branch-and-bound Algorithm for Energy-Efficient Control Allocation with Applications to Planar Motion Control of Electric Ground Vehicles

A Branch-and-Bound Algorithm for Energy-Efficient Control Al...

引用

American Control Conference

作者： Yan Chen Junmin Wang Department of Mechanical and Aerospace Engineering The Ohio State University Columbus OH 43210

ISBN: (纸本)9781457710957

A globally optimal energy-efficient control allocation (EECA) is developed for planar motion control of electric ground vehicles (EGVs) with four in-wheel motors. Different from the distribution processes in previous EECA designs [19][21], which obtained optimal torque distributions locally due to the nonlinear/nonconvex characteristics of EECA formulation, this EECA approach based a branch-and-bound (B&B) method that can make the distributed control actuation achieve the global energy-optimal operating points. Based on a sequence of equivalent problem transformations and a linear relaxation programming, the global optimal programming can be solved by the B&B method through rewriting the EECA formulation into a polynomial fractional optimization problem. Simulation results of different EGV maneuvers indicate that less energy are consumed when the EECA scheme based on the B&B method is applied, in comparison with the energy consumptions of the identical maneuvers with the active-set algorithm.

关键词： Motor Control Electric grounding energy consumption Energy efficiency branch and bound algorithms vehicle Planar

来源：评论

学校读者我要写书评

暂无评论

A Petri Net-based Modeling and Scheduling with a branch and bound Algorithm

A Petri Net-based Modeling and Scheduling with a Branch and ...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Hyun-Jung Kim Jun-Ho Lee Tae-Eog Lee Department of Industrial and Systems Engineering Korea Advanced Institute of Science and Technology (KAIST)

ISBN: (纸本)9781467317139

We examine a non-cyclic scheduling problem of a timed Petri net (TPN) with a branch and bound (B & B) algorithm. There have been many approaches and algorithms for conventional scheduling problems such as job shops, resource-constrained project scheduling problems (RCPSPs), and robotized system scheduling problems. Most of these methods have focused on their effectiveness or efficiency in solving their own problems. However, they tend to ignore the issue of compatibility with other scheduling problems and the solution methods are ad hoc and hard to be used for other scheduling problems with even small changes. Petri nets have been widely used for modeling and analyzing complex discrete event dynamic systems, such as robotized manufacturing cells or other automated manufacturing systems. There are studies on scheduling cyclic Petri net models and some non-cyclic Petri net models for specific applications. In this paper, we examine a scheduling problem for non-cyclic TPNs, where there is the starting and end transitions, and the transitions do not repeat an identical firing cycle. We also allow multiple arc weights in TPNs so as to model batch processing of tasks at a resource and multiple units of a resource required for a task. We briefly explain how various scheduling constraints and objectives can be modeled by TPNs. Then, we develop an efficient B & B procedure that utilizes a dynamic branching strategy and a resource-based lower bound. We finally present examples of the B & B algorithm for an RCPSP and a single-armed cluster tool scheduling problem.

关键词： branch and bound algorithm Non-cyclic scheduling Timed Petri net Petri nets branches cluster tools branch and bound algorithms network model multiple unit Intravenous Hyperalimentation Boron Discrete event dynamic systems

来源：评论

学校读者我要写书评

暂无评论

Local Stability Analysis For Uncertain Nonlinear Systems Using A branch-and-bound Algorithm

Local Stability Analysis For Uncertain Nonlinear Systems Usi...

引用

2008 American Control Conference, Pages 3088-3529

作者： Ufuk Topcu Andrew Packard Peter Seiler Gary Balas Department of Mechanical Engineering The University of California Berkeley CA 94720-1740 USA

ISBN: (纸本)9781424420780

We propose a method to compute invariant subsets of the region-of-attraction for the asymptotically stable equilibrium points of polynomial dynamical systems with bounded parametric uncertainty. Parameter-independent Lyapunov functions are used to characterize invariant subsets of the robust region-of-attraction. A branch-and-bound type refinement procedure is implemented to reduce the conservatism. We demonstrate the method on a two-state example from the literature and five-state controlled short period aircraft dynamics with and without time delay in the input to the plant.

关键词： Uncertain nonlinear system Stability analysis asymptotically stable equilibrium branch and bound algorithms local stability Conservatism Liapunov function DYNAMICAL SYSTEMS Invariant

来源：评论

学校读者我要写书评

暂无评论

A Heuristic Method Based on the branch and Cut Algorithm to the Transmission System Expansion Planning Problem

A Heuristic Method Based on the Branch and Cut Algorithm to ...

引用

IEEE Power and Energy Society General Meeting

作者： Aldir S. Sousa Eduardo N. Asada Department of Electrical Engineering Sao Carlos School of Engineering University of Sao Paulo

ISBN: (纸本)9781457710001

In this paper we introduce a new heuristic algorithm to the centralized long-term transmission system expansion planning problem. The proposed method introduces cuts (new constraints) to the mathematical model to force generating feasible solutions to the DC model. The application of the strategy resulted in good solutions for the DC model. The computational results demonstrate the efficiency of the proposed method when applied to IEEE-24 bus system, Brazilian Southern System and Colombian system.

关键词： Transmission System Expansion Planning Heuristic Methods branch-and-bound Algorithm branch-and-Cut Algorithm heuristic methods branch and bound algorithms power system expansion planning expansion plan Transmission systems branch cut Heuristic algorithms branches

来源：评论

学校读者我要写书评

暂无评论

Basis Reduction and the Complexity of branch-and-bound 10

Basis Reduction and the Complexity of Branch-and-Bound

引用

Annual ACM-Society for Industrial and Applied Mathmatics Symposium on Discrete algorithms

作者： Gabor Pataki Mustafa Tural Erick B. Wong Department of Statistics and Operations Research University of North Carolina at Chapel Hill Institute for Mathematics and its Applications University of Minnesota Department of Mathematics University of British Columbia

ISBN: (纸本)9780898717013

The classical branch-and-bound algorithm for the integer feasibility problem Find x-bar∈ Q ∩ Z~n, with Q = {x | (l_1,1_2)≤ (A, I) x ≤ (w_1, w_2)} has exponential worst case complexity. We prove that it is surprisingly efficient on reformulations of (0.1), in which the columns of the constraint matrix are short and near orthogonal, i.e., a reduced basis of the generated lattice: when the entries of A are from {1,...,M} for a large enough M, branch-and-bound solves almost all reformulated instances at the root node. For all A matrices we prove an upper bound on the width of the reformulations along the last unit vector.

关键词： Unit vector Complexity Quality factor Basis branch and bound algorithms matrices

来源：评论

学校读者我要写书评

暂无评论

Optimizing Binary Trees Grown with a Sorting Algorithm

引用

1969年

作者： william a martin

来源：评论

学校读者我要写书评

暂无评论

Travelling Salesman Problem - Parallel algorithms

引用

IFAC Proceedings Volumes 1995年第10期28卷 657-662页

作者： Ewa Dudek-Dyducb Tadeusz Dyducb Academy of Mining and Metallurgy Institute of Automatics al.Mickiewicza 30 PL 30-059 Krakow Cracow Univ. of Technology Sect. of Descr. Geometry and Eng. Graphics ul. Warszawska 24 PL 31-155 Krakow

The paper presents parallelization of branch and bound (B & B) algorithm for Travelling Salesman Problem. The algorithm generates and examines a binary decision tree according to back track strategy, with use of recursive procedure. Two different parallel computing methods based on another constructions of decision trees at the first stages of searching are presented. The results of computer experiments carried out with use of Parallel Virtual Machine software are given.

关键词： parallel computation concurrent searches branch and bound algorithms travelling salesman problem manufacturing systems scheduling algorithms backtracking binary search trees decomposition methods optimal search techniques

来源：评论

学校读者我要写书评

暂无评论

Weighted Clustering Coefficient Maximization For Air Transportation Networks

Weighted Clustering Coefficient Maximization For Air Transpo...

引用

European Control Conference

作者： Julien Ponton Peng Wei Dengfeng Sun Department of Applied Mathematics Ecole Polytechnique School of Aeronautics and Astronautics Purdue University

ISBN: (纸本)9781479901890

In transportation networks the robustness of a network regarding nodes and links failures is a key factor for its design. At the same time, traveling passengers usually prefer the itinerary with fewer legs. The average clustering coefficient can be used to measure the robustness of a network. A high average clustering coefficient is often synonymous with a lower average travel distance and fewer number of legs. In this paper we present the average weighted clustering coefficient maximization problem, and give several solution methods based on branch and bound algorithm, dynamic programming and quadratically constrained programs.

关键词： Transport networks Itinerary Leg Air Transportation branch and bound algorithms Cluster Analysis

来源：评论

学校读者我要写书评

暂无评论

Improved Differential Characteristic Searching Methods

Improved Differential Characteristic Searching Methods

引用

IEEE International Conference on Cyber Security and Cloud Computing (CSCloud)

作者： Jiageng Chen Atsuko Miyaji Chunhua Su Jesen Teh Computer School Central China Normal University Wuhan China Hokuriku Sentan Kagaku Gijutsu Daigakuin Daigaku Nomi Ishikawa JP School of Information Science Japan Advanced Institute of Science and Technology Nomi Japan Information Security Lab Universiti Sains Malaysia Malaysia

ISBN: (纸本)9781467393010

The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For large number of rounds, it is not a trivial task to find such differential or linear paths. Matsui first investigated this problem and proposed a solution based on a branch and bound algorithm in 1994. Since then, the research on finding good concrete differential or linear path did not receive much attention. In this paper, we revisit the differential attack against several S-Box based block ciphers by carefully studying the differential characteristics. Inspired by Matsui's algorithm, we provide an improved solution with the aid of several searching strategies, which enable us to find by far the best differential characteristics for the two investigated ciphers (LBlock, TWINE) efficiently. Furthermore, we provide another way to evaluate the security of ciphers against differential attack by comparing the strength of the ciphers from differential characteristic's point of view, and we also investigate the accuracy when using the active S-Box to evaluate the security margin against differential attack, which is the common method adapted when new ciphers are designed.

关键词： Differential Path branch and bound algorithm Active S-box LBlock TWINE differential attack Passwords branch and bound algorithms S-box Search methods round number Differential linear cryptanalysis Block cipher

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：