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

IEEE Conference on Information & Communication Technologies

作者： Sweta Sahu Harish M. Kittur School of Electronics Engineering VLSI Division VIT University

ISBN: (纸本)9781467357593

In System on Chip, buses and point to point links are used as a communication infrastructure between one IP to another, but these cannot provide efficient interconnect from performance point of view. So NoC architecture was proposed to provide communication in multiprocessor SoC and overcome the limitations. This paper has implemented a 5-port 32-bit and 64-bit router architecture using wormhole routing technique for 2D-mesh network by using simple deterministic algorithm, flow control and decoding mechanism. In this router, 2 types of crossbar are used named as multiplexer and tri-state buffer matrix for efficient design. Comparisons of area and power are done for these router designs using ASIC tool flow in Cadence using TSMC 90nm and 180nm process technologies. Simulation results are performed in Cadence NC simulator. It is demonstrated that multiplexer router design is more efficient than a matrix router design as area and power increases for matrix design while using same port-width.

关键词： deterministic algorithm Network on chip (NoC) Mesh network System on Chip (SoC) Wormhole routing

来源：评论

学校读者我要写书评

暂无评论

Decremental maintenance of strongly connected components 13

Decremental maintenance of strongly connected components

引用

Symposium on Discrete algorithms

作者： Liam Roditty Department of Computer Science Bar llan University Ramat Gan 52900Israel

ISBN: (纸本)9781627484855

We consider the problem of maintaining the strongly connected components (SCCs) of an n-nodes and medges directed graph that undergoes a sequence of edge deletions. Recently, in SODA 2011, ??cki presented a deterministic algorithm that preprocess the graph in O(mn) time and creates a data structure that maintains the SCCs of a graph under edge deletions with a total update time of O(mn). The data structure answers strong connectivity queries in O(l) time. The worst case update time after a single edge deletion might be as large as O(mn). In this paper we reduce the preprocessing time and the worst case update time of ??cki's data structure from O(mn) to O(m logn). The query time and the total update time remain unchanged.

关键词： Decremental maintenance strongly connected components deterministic algorithm deterministic algorithms connected component refresh time Data structures search time Pretreatment

来源：评论

学校读者我要写书评

暂无评论

deterministic Network Exploration by Anonymous Silent Agents with Local Traffic Reports

Deterministic Network Exploration by Anonymous Silent Agents...

引用

39th International Colloquium on Automata, Languages, and Programming (ICALP)

作者： Dieudonne, Yoann Pelc, Andrzej Univ Picardie Jules Verne MIS Amiens France Univ Quebec Outaouais Dept Informat Quebec City PQ Canada

ISBN: (纸本)9783642315855

A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, possibly at different times, have to explore the network: every node must be visited by at least one agent and all agents must eventually stop. Agents are anonymous (identical), execute the same deterministic algorithm and move in synchronous rounds along links of the network. They are silent: they cannot send any messages to other agents or mark visited nodes in any way. In the absence of any additional information, exploration with termination of an arbitrary network in this weak model is impossible. Our aim is to solve the exploration problem giving to agents very restricted local traffic reports. Specifically, an agent that is at a node v in a given round, is provided with three bits of information, answering the following questions: Am I alone at v? Did any agent enter v in this round? Did any agent exit v in this round? We show that this small information permits to solve the exploration problem in arbitrary networks. More precisely, we give a deterministic terminating exploration algorithm working in arbitrary networks for all initial configurations that are not perfectly symmetric, i.e., in which there are agents with different views of the network. The algorithm works in time polynomial in the (unknown) size of the network. A deterministic terminating exploration algorithm working for all initial configurations in arbitrary networks does not exist.

关键词： exploration deterministic algorithm anonymous mobile agent network graph

来源：评论

学校读者我要写书评

暂无评论

Global optimization algorithm for a generalized linear multiplicative programming

引用

JOURNAL OF APPLIED MATHEMATICS AND COMPUTING 2012年第1-2期40卷 551-568页

作者： Jiao, Hongwei Liu, Sanyang Chen, Yongqiang Xidian Univ Dept Math Sci Xian 710071 Peoples R China Henan Inst Sci & Technol Dept Math Xinxiang 453003 Peoples R China Henan Normal Univ Coll Math & Informat Xinxiang 453007 Peoples R China

This article present a branch and bound algorithm for globally solving generalized linear multiplicative programming problems with coefficients. The main computation involve solving a sequence of linear relaxation programming problems, and the algorithm economizes the required computations by conducting the branch and bound search in R-p, rather than in R-n, where p is the number of rank and n is the dimension of decision variables. The proposed algorithm will be convergent to the global optimal solution by means of the subsequent solutions of the series of linear relaxation programming problems. Numerical results are given to show the feasibility and effectiveness of the proposed algorithm.

关键词： Multiplicative programming Global optimization Branch and bound algorithm deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

A deterministic algorithm for the synthesis of maximum energy recovery heat exchanger network

引用

COMPUTERS & CHEMICAL ENGINEERING 2007年第7期31卷 773-781页

作者： Errico, Massimiliano Maccioni, Sara Tola, Giuseppe Zuddas, Paola Dipartimento Ingn Chim & Mat I-09123 Cagliari Italy Dipartimento Ingn Territorio I-09123 Cagliari Italy

This paper presents a general mathematical optimization model and the related deterministic algorithm for synthesizing heat-exchanger networks (HEN). The methodologies commonly used to solve a HEN problem are based on heuristic methods. These algorithms reach a presumed best solution with respect to the investigated set of process streams, whereas our approach determines the optimal configuration. In this paper the proposed method is applied to the solution of a few simple HEN synthesis problems and the results are compared with those obtained utilizing heuristic or meta-heuristic methods. HEN's problem is represented by a general mathematical model that can be applied to small and medium sized problems and is solved by using a deterministic method with a reasonably brief computation time. Notably, this approach can represent a unique general model of a wide class of heat-exchanger networks, independently of their specific physical configuration. (C) 2006 Elsevier Ltd. All rights reserved.

关键词： heat-exchanger network energy recovery deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

A symmetry-driven BP algorithm for the Discretizable Molecular Distance Geometry Problem

A symmetry-driven BP algorithm for the Discretizable Molecul...

引用

IEEE International Conference on Bioinformatics and Biomedicine Workshops (BIBMW)

作者： Mucherino, A. Lavor, C. Liberti, L. Univ Rennes 1 IRISA Rennes France Univ Estadual Campinas IMECC Campinas SP Brazil Ecole Polytech LIX Palaiseau France

ISBN: (纸本)9781457716133

Branch & Prune (BP) is a deterministic algorithm for the solution of the Discretizable Molecular Distance Geometry Problem (DMDGP). This problem has important applications in the field of structural biology, in particular for the determination of the three-dimensional conformation of a molecule by using information obtained by NMR techniques. In recent works, we proved that the search domain of the DMDGP, which is represented by a binary tree, contains various symmetries which are related to the number of solutions to the problem. In the present work, we propose a variant of the BP algorithm which is able to exploit the information regarding the symmetries to speed up the search. Computational experiments show that the symmetry-driven BP (symBP) outperforms the original BP algorithm in particular when instances having several solutions are considered.

关键词： Atomic layer deposition Atomic measurements Binary trees Conferences Geometry NMR imaging NMR techniques Nuclear magnetic resonance Proteins binary tree biology computing branch & prune algorithm computational geometry deterministic algorithm discretizabl

来源：评论

学校读者我要写书评

暂无评论

Parameter-Free deterministic Global Search with Simplified Central Force Optimization

Parameter-Free Deterministic Global Search with Simplified C...

引用

6th International Conference on Intelligent Computing

作者： Formato, Richard A. POB 1714 Harwich MA 02645 USA

ISBN: (纸本)9783642149214

This note describes a simplified parameter free implementation of Central Force Optimization for use in deterministic multidimensional search and optimization The user supplies only the objective function to be maxi allied nothing mote The algorithm's performance is tested against a widely used suite of twenty three benchmark functions and compared to other state-of-the in algorithms CFO performs very well

关键词： Central Force Optimization CFO deterministic algorithm Multidimensional Search and Optimization Parameter-Free Optimization Gravitational Kinematics Metaphor Metaheuristic

来源：评论

学校读者我要写书评

暂无评论

Random, deterministic, and Hybrid algorithms for Distributed Beamforming

Random, Deterministic, and Hybrid Algorithms for Distributed...

引用

5th Advanced Satellite Multimedia Systems Conference / 11th Signal Processing for Space Communications Workshop (ASMS/SPSC)

作者： Thibault, Ilaria Corazza, Giovanni E. Deambrogio, Lina Univ Bologna ARCES DEIS Viale Risorgimento 2 I-40136 Bologna Italy

ISBN: (纸本)9781424468331

Distributed beamforming is a form of cooperation among nodes in a wireless network to efficiently deliver a common message to a distant receiver. The critical requirement to achieve electromagnetic coherence is to synchronize the initial phases of all local oscillators, introducing minimal overhead and complexity. In the paper we introduce random, deterministic and hybrid algorithms, all based on feedback from the common receiver as the driving force, but with different phase update strategies. Our numerical results show that these algorithms achieve faster convergence time than previously proposed approaches.

关键词： array signal processing deterministic algorithm distant receiver distributed beamforming electromagnetic coherence feedback hybrid algorithm local oscillator message delivery radio networks radio receivers random algorithm wireless network

来源：评论

学校读者我要写书评

暂无评论

Kinetic Facility Location

引用

algorithmICA 2010年第3期57卷 562-584页

作者： Degener, Bastian Gehweiler, Joachim Lammersen, Christiane Univ Bonn Comp Sci Dept 1 D-53117 Bonn Germany Univ Gesamthsch Paderborn Int Grad Sch Dynam Intelligent Syst D-33095 Paderborn Germany Univ Gesamthsch Paderborn Dept Comp Sci Heinz Nixdorf Inst D-33095 Paderborn Germany

We present a deterministic kinetic data structure for the facility location problem that maintains a subset of the moving points as facilities such that, at any point of time, the accumulated cost for the whole point set is at most a constant factor larger than the optimal cost. In our scenario, each point can change its status between client and facility and moves continuously along a known trajectory in a d-dimensional Euclidean space, where d is a constant. Our kinetic data structure requires O(n(log(d)(n)+ log(nR))) space in total, where R := max(pi is an element of P) f(i).max(pi is an element of P)d(i)/min(pi is an element of P) f(i).min(pi is an element of P) d(i), P = {p(1), p(2), ... , p(n)} is the set of given points, and f(i), d(i) are the maintenance cost and the demand of a point pi, respectively. In case that each trajectory can be described by a bounded degree polynomial, we process O(n(2) log(2)(nR)) events, each requiring O(log(d+1)(n).log(nR)) time and O(log(nR)) status changes.

关键词： Facility location Kinetic data structure Approximation algorithm deterministic algorithm

来源：评论

学校读者我要写书评

暂无评论

DetMCD in a Calibration Framework 1

引用

19th International Conference on Computational Statistics (COMPSTAT'2010)

作者： Verdonck, Tim Hubert, Mia Rousseeuw, Peter J. Univ Antwerp Dept Math & Comp Sci Middelheimlaan 1 Antwerp Belgium Katholieke Univ Leuven Dept Math Leuven Belgium

ISBN: (数字)9783790826043

ISBN: (纸本)9783790826036

The minimum covariance determinant (MCD) method is a robust estimator of multivariate location and scatter (Rousseeuw (1984)). Computing the exact MCD is very hard, so in practice one resorts to approximate algorithms. Most often the FASTMCD algorithm of Rousseeuw and Van Driessen (1999) is used. The FASTMCD algorithm is affine equivariant but not permutation invariant. Recently a deterministic algorithm, denoted as DetMCD, is developed which does not use random subsets and which is much faster (Hubert et al. (2010)). In this paper DetMCD is illustrated in a calibration framework. We focus on robust principal component regression and partial least squares regression, two very popular regression techniques for collinear data. We also apply DetMCD on data with missing elements after plugging it into the M-RPCR technique of Serneels and Verdonck (2009).

关键词： deterministic algorithm outliers robustness RPCR RSIMPLS

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：