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

Auction-based resource allocation game under a hierarchical structure

INTERNATIONAL JOURNAL OF SYSTEMS SCIENCE 2016年第2期47卷 360-373页

作者： Cui, Yingying Zou, Suli Ma, Zhongjing Beijing Inst Technol Sch Automat Beijing 100081 Peoples R China

This paper studies a class of auction-based resource allocation games under a hierarchical structure, such that each supplier is assigned a certain amount of resource from a single provider and allocates it to its buyers with auction mechanisms. To implement the efficient allocations for the underlying hierarchical system, we first design an auction mechanism, for each local system composed of a supplier and its buyers, which inherits the advantages of the progressive second price mechanism. By employing a dynamic algorithm, each local system converges to its own efficient Nash equilibrium, at which the efficient resource allocation is achieved and the bidding prices of all the buyers in this local system are identical with each other. After the local systems reach their own equilibria respectively, the resources assigned to suppliers are readjusted via a dynamic hierarchical algorithm with respect to the bidding prices associated with the implemented equilibria of local systems. By applying the proposed hierarchical process, the formulated hierarchical system can converge to the efficient allocation under certain mild conditions. The developed results in this work are demonstrated with simulations.

关键词： Nash equilibrium dynamic algorithm efficiency auction hierarchical resource allocation convergence

来源：评论

学校读者我要写书评

暂无评论

NEW COMPLEXITY RESULTS ON SCHEDULING PROBLEM IN A ROBOTIC CELL

引用

RAIRO-OPERATIONS RESEARCH 2017年第3期51卷 749-762页

作者： Chikhi, Nacira Abbas, Moncef Benmansour, Rachid Hanafi, Said Univ Sci & Technol USTHB Lab AMCD&RO BP32 Bab Ezzouar 16111 Alger Algeria Univ Valenciennes & Hainaut Cambresis LAMIH UMR CNRS 8201 F-59313 Le Mt Houy 9 Valenciennes France

This paper explores the coordinated scheduling problem between production and transportation in a two stage flow shop with dedicated machines. There are two dedicated machines at the first stage and one common machine at the second stage. Each job has to be processed on a specified machine at the stage 1 depending on job type. A transporter with limited capacity is available to transport the semi-finished jobs from stage 1 to stage 2 for further processing. The objective is to minimize the makespan, i.e. the maximum completion time of all the jobs. The main focus is on the case where the transporter capacity is equal to two. New complexity results related to this case are established. Due to the NP-hardness of the general problem, we develop approximative approach to tackle the problem. Computational results indicate that the obtained solutions within moderate CPU time are of high quality.

关键词： Flowshop complexity makespan dynamic algorithm tranportation

来源：评论

学校读者我要写书评

暂无评论

Synthesis and time partitioning for reconfigurable systems

引用

DESIGN AUTOMATION FOR EMBEDDED SYSTEMS 2004年第3期9卷 177-191页

作者： Ouni, B Mtibaa, A Abid, M Fac Sci Monastir Lab Elect & Microelect Monastir 5000 Tunisia Natl Engn Sch Fax CES ENIS Sfax 3038 Tunisia

This paper aims to introduce a time partitioning algorithm which is an important step during the design process for fully reconfigurable systems. This algorithm is used to solve the time partitioning problem. It divides the input task graph model to an optimal number of partitions and puts each task in the appropriate partition so that the latency of the input task graph is optimal. Also a part of this paper is consecrated for implementation of some examples on a fully reconfigurable architecture following our approach.

关键词： time partitioning synthesis fully reconfigurable systems field programmable gate array design flow framework dynamic algorithm run time reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Shortest paths in digraphs of small treewidth. Part II: Optimal parallel algorithms

引用

THEORETICAL COMPUTER SCIENCE 1998年第2期203卷 205-223页

作者： Chaudhuri, S Zaroliagis, CD Max Planck Inst Informat D-66123 Saarbrucken Germany

We consider the problem of preprocessing an n-vertex digraph with real edge weights so that subsequent queries for the shortest path or distance between any two vertices can be efficiently answered. We give parallel algorithms for the EREW PRAM model of computation that depend on the treewidth of the input graph. When the treewidth is a constant, our algorithms can answer distance queries in O(alpha(n)) time using a single processor, after a preprocessing of O(log(2)n) time and O(n) work, where alpha(n) is the inverse of Ackermann's function. The class of constant treewidth graphs contains outerplanar graphs and series-parallel graphs, among others. To the best of our knowledge, these are the first parallel algorithms which achieve these bounds for any class of graphs except trees. We also give a dynamic algorithm which, after a change in an edge weight, updates our data structures in O(log n) time using O(n(beta)) work, for any constant 0algorithm of independent interest: computing a shortest path tree, or finding a negative cycle in O(log(2)n) time using O(n) work. (C) 1998-Elsevier Science B.V. All rights reserved.

关键词： shortest path graph theory treewidth parallel computing PRAM dynamic algorithm

来源：评论

学校读者我要写书评

暂无评论

A novel algorithm for designing the layout of additional boreholes

引用

ORE GEOLOGY REVIEWS 2015年 67卷 34-42页

作者： Morshedy, Amin Hossein Memarian, Hossein Univ Tehran Coll Engn Sch Min Engn Tehran Iran

In an exploration project, the placement of additional boreholes is based on the available information and engineering judgment, which may result in a lack of information or redundant information in decision making. This paper presents the use of dynamic multistage sampling to design directional and vertical boreholes to scan the subsurface. For this purpose, the potential collars of boreholes are determined within the survey area, while the imaginary boreholes in the form of cone sides cover the area's lateral surface area, and the concentric cones around the collars change with azimuth and dip angles. The objective function is a criterion used to determine the optimal borehole(s) and update the input borehole database in each stage;this iterative process continues until a stopping condition is satisfied. The presented algorithm was executed and validated on both synthetic and field data from the Eastern Kahang region in Iran. In the synthetic case, five additional boreholes were designated based on high grade and estimation error objectives that intersect two parts of the ore body. Ten proposed additional boreholes in the northeast region of Kahang coincided with the high grade copper mineralization zone. (C) 2014 Elsevier B.V. All rights reserved.

关键词： Additional boreholes Multistage sampling dynamic algorithm Objective function Kahang deposit

来源：评论

学校读者我要写书评

暂无评论

Pseudorandom bit generator based on non-stationary logistic maps

引用

IET INFORMATION SECURITY 2016年第2期10卷 87-94页

作者： Liu, Lingfeng Miao, Suoxia Hu, Hanping Deng, Yashuang Nanchang Univ Sch Software Nanchang 330031 Peoples R China Nanchang Inst Technol Fac Sci Nanchang 330099 Peoples R China Huazhong Univ Sci & Technol Sch Automat Wuhan 430074 Peoples R China

Pseudorandom binary sequences play a significant role in many fields, such as error control coding, spread spectrum communications, and cryptography. In recent years, chaotic system is regarded as an important pseudorandom source in the design of pseudorandom bit generators (PRBGs). Among them, most are based on one or more fixed chaotic systems, and the generated binary sequences come to be stationary. However, these kinds of chaotic PRBGs can be attacked by reconstructing the phase space or using some statistical analysis methods. In this study, a scheme for chaotic PRBG based on non-stationary logistic map is proposed. The authors design a dynamic algorithm to change the driven parameter sequence (not random) into a random-like sequence. The variable parameters disrupt the phase space of the system, which can resist the phase space reconstruction attacks effectively. They prove that the non-stationary logistic map is still chaotic under Wiggins' chaos definition. The numerical analysis shows that the generated binary sequences have good cryptographic properties and can pass the well-known statistical tests. The authors' chaotic PRBG based on non-stationary logistic map is a novel scheme in the design of PRBG, and is more secure than the PRBGs based on fixed chaotic systems.

关键词： binary sequences chaos cryptography numerical analysis random number generation random sequences statistical analysis PRBGs design Wiggins chaos definition chaotic PRBG scheme cryptographic property dynamic algorithm fixed chaotic systems nonstationary logistic maps nonstationary sequence numerical analysis parameter sequence phase space reconstruction attacks pseudorandom binary sequences pseudorandom bit generators statistical analysis methods statistical tests

来源：评论

学校读者我要写书评

暂无评论

Biometric Palmprint Verification: A dynamical System Approach

引用

IEEE TRANSACTIONS ON SYSTEMS MAN CYBERNETICS-SYSTEMS 2019年第12期49卷 2676-2687页

作者： Palma, David Montessoro, Pier Luca Giordano, Giulia Blanchini, Franco Univ Udine Polytech Dept Engn & Architecture I-33100 Udine Italy Delft Univ Technol Delft Ctr Syst & Control NL-2628 Delft Netherlands Univ Udine Dept Math Comp Sci & Phys I-33100 Udine Italy

Most of the existing techniques for palmprint recognition rely on metrics, typically based on static functions, which evaluate the distance between a pair of features. In this paper, we propose a new technique for palmprint verification based on a dynamical system approach for principal palm lines matching. The proposed dynamic algorithm is recursive and involves a positive linear dynamical system, whose evolution depends on the matching level between the two input images. In a preprocessing phase, the procedure iteratively erodes both of the images to be compared, by eliminating points in each image that do not have enough close neighboring points both in the image itself and the comparison image. As a result of the iterations, only the points that have enough neighboring points in both the image itself and in the comparison image can survive. Thus, the output of the dynamical system converges either to zero, when a deep mismatch exists between the two images, or to a high value, when a good matching is observed. The results, in terms of verification, are in line with the state-of-the-art results in the current literature. The main advantage of the approach is its robustness when dealing with low-resolution and noisy images. The impact of noise (e.g., salt and pepper noise) is effectively reduced: images corrupted with such noise are easily recognized, while a randomly generated image is rejected even when compared with itself.

关键词： Biometrics dynamic algorithm dynamical system line matching palmprint principal lines

来源：评论

学校读者我要写书评

暂无评论

VELOCITY-FIELD COMPUTATION USING NEURAL NETWORKS

引用

ELECTRONICS LETTERS 1990年第21期26卷 1787-1790页

作者： HANBING, J Inst. of Image Process. & Pattern Recognition Shanghai Jiao Tong Univ. China

A new approach for optical flow (image velocity) fields computation is presented using computational neural networks. The computational procedure consists of three stages: estimation of the parameters of the neural network model, dynamic measurement of the perpendicular velocity components of the contours or region boundaries and computation of the image velocity fields. The parameters are estimated by comparing the energy function of the neural network with a constrained error function. The nonlinear velocity fields computation method is then carried out iteratively by using a dynamic algorithm to minimise the energy function simultaneously with the dynamic measurement of the perpendicular velocity components by a dynamic procedure. Experiments generate velocity fields that are meaningful and consistent with visual perception.

关键词： constrained error function dynamic algorithm dynamic measurement energy function image processing image velocity iterative method iterative methods neural nets neural network model nonlinear velocity fields computation method optical flow field computation parameters estimation perpendicular velocity components picture processing visual perception

来源：评论

学校读者我要写书评

暂无评论

Combine and conquer

引用

algorithmICA 1997年第3期18卷 324-362页

作者： Cohen, RF Tamassia, R BROWN UNIV DEPT COMP SCI PROVIDENCE RI 02912 USA

We present a general technique for dynamizing a class of problems whose underlying structure is a computation graph embedded in a tree. We introduce three fully dynamic data structures, called path attribute systems, tree attribute systems, and linear attribute grammars, which extend and generalize the dynamic trees of Sleator and Tarjan. More specifically, we associate values, called attributes, with the nodes and paths of a rooted tree. Path attributes form a path attribute system if they can be maintained in constant rime under path concatenation. Node attributes form a tree attribute system if the tree attributes of the tail of a path II can be determined in constant time from the path attributes of II. A linear attribute grammar is a tree-based linear expression such that the values of a node It art calculated from the values at the parent, siblings, and/or children of it. We provide a framework for maintaining path attribute systems, tree attribute systems, and linear attribute grammars in a fully dynamic environment using linear space and logarithmic time per operation. Also, we demonstrate the applicability of our techniques by showing examples of graph and geometric problems that can be efficiently dynamized, including biconnectivity and triconnectivity queries, planarity testing, drawing trees and series-parallel digraphs, slicing floorplan compaction, point location, and many optimization problems on bounded tree-width graphs.

关键词： dynamic algorithm data structure tree attribute grammar arithmetic expression point location graph algorithm

来源：评论

学校读者我要写书评

暂无评论

On-line maintenance of triconnected components with SPQR-trees

引用

algorithmICA 1996年第4期15卷 302-318页

作者： DiBattista, G Tamassia, R UNIV ROMA LA SAPIENZA DIPARTIMENTO INFORMAT & SISTEMIST I-00185 ROME ITALY BROWN UNIV DEPT COMP SCI PROVIDENCE RI 02912 USA

We consider the problem of maintaining on-line the triconnected components of a graph G. Let n be the current number of vertices of G. We present an O (rt)-space data structure that supports insertions of vertices and edges, and queries of the type ''Are there three vertex-disjoint paths between vertices v(1) and v(2)?'' A sequence of k operations takes time O(k . alpha(k,n)) if G is biconnected (alpha(k,n) denotes the well-known Ackermann's function inverse), and time O(n log n + k) if G is not biconnected. Note that the bounds do not depend on the number of edges of G. We use the SPQR-tree, a versatile data structure that represents the decomposition of a biconnected graph with respect to its triconnected components, and the BC-tree, which represents the decomposition of a connected graph with respect to its biconnected components.

关键词： vertex connectivity dynamic algorithm dynamic data structure graph decomposition triconnected components network reliability

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：