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

partitioning algorithms FOR LAYOUT SYNTHESIS FROM REGISTER-TRANSFER NETLISTS

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1992年第4期11卷 453-463页

作者： WU, ACH GAJSKI, DD UNIV ARIZONA DEPT PHYSIOLTUCSONAZ 85721

Most IC's today are described and documented using hierarchical netlists. In addition to gates, latches, and flip-flops, these netlists include sliceable register-transfer components such as registers, counters, adders, ALU's shifters, register files, and multiplexers. Usually, these components are decomposed into basic gates, latches, and flip-flops for layout with standard cells. The standard cell algorithms do not exploit the bit-sliced nature of register-transfer components, however. In this paper, we present a partitioning methodology that exploits the regularity of register-transfer components. We also describe partitioning algorithms that are used to generate the floor plan. The partitioning algorithms not only select the layout style best suited for each component, but also consider critical paths, I/O pin locations, and connections between components. This approach improves the overall area utilization and minimizes the wire length on the critical paths.

关键词： partitioning algorithms Routing Flip-flops Counting circuits Registers Switches Multiplexing Wire Very large scale integration Microprocessors

来源：评论

学校读者我要写书评

暂无评论

partitioning algorithms for 1-D and 2-D discrete phase-retrieval problems with disconnected support

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 1997年第9期45卷 2220-2230页

作者： Yagle, AE Ahn, H Department of Electrical Engineering and Computer University of Michigan Ann Arbor MI USA

The discrete phase-retrieval problem with disconnected support is to reconstruct a discrete-time signal whose support is the union of disjoint intervals from the magnitude of its discrete Fourier transform, We use the Good-Thomas FFT mapping to transform the one-dimensional (1-D) version of this problem into a two-dimensional (2-D) discrete phase retrieval problem, We then solve the latter problem by partitioning it into a set of 1-D phase-retrieval problems, The discrete and modulated Radon transforms are used to formulate two coupled 1-D problems, the solution to which specifies solutions to the other 1-D problems, This effectively partitions the original disconnected support 1-D problem into smaller 1-D problems, which may be solved in parallel, Small amounts of noise in the data can be rejected by using more than two coupled 1-D problems, The 2-D phase retrieval problem with disconnected support is also considered, Numerical examples are provided, including comparison with the hybrid I/O algorithm.

关键词： partitioning algorithms Phased arrays Image reconstruction Fourier transforms Discrete Fourier transforms Discrete transforms Two dimensional displays Iterative algorithms History

来源：评论

学校读者我要写书评

暂无评论

partitioning algorithms for multi-agent systems based on finite-time proximity metrics

引用

AUTOMATICA 2015年 55卷 176-182页

作者： Bakolas, Efstathios Univ Texas Austin Dept Aerosp Engn & Engn Mech Austin TX 78712 USA

We address a generalized Voronoi partitioning problem for a team of mobile agents with nonlinear dynamics with respect to a state-dependent proximity metric. In particular, the proximity (pseudo-) metric corresponds to the reduction of a generalized energy metric that occurs during the transfer of an agent to an arbitrary destination with zero terminal velocity, in finite time. The realization of every finite-time state transition takes place by means of a class of continuous feedback control laws that render the closed loop dynamics of each mobile agent non-Lipschitzian. The arrival time also turns out to be a state-dependent quantity, whose functional description is not prescribed a priori. We show that the partitioning problem studied in this work can admit a decentralized solution, that is, each agent can compute its own cell independently from its teammates provided that is aware of the positions and velocities of its neighboring agents. Numerical simulations that illustrate the theoretical developments are also presented. (C) 2015 Elsevier Ltd. All rights reserved.

关键词： Autonomous agents Voronoi diagrams partitioning algorithms Finite-time control Computational methods

来源：评论

学校读者我要写书评

暂无评论

Distributed partitioning algorithms for Locational Optimization of Multiagent Networks in SE(2)

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2018年第1期63卷 101-116页

作者： Bakolas, Efstathios Univ Texas Austin Dept Aerosp Engn & Engn Mech Austin TX 78712 USA

This paper is concerned with the development of distributed spatial partitioning algorithms for locational optimization problems involving networks of agents with planar rigid body dynamics subject to communication constraints. The domain of the problems we consider is a three-dimensional (3-D) nonflat manifold embedded in the state space of the agents, which we refer to as the terminal manifold. The approach we propose allows us to associate the partition of the 3-D terminal manifold, which is induced by a nonquadratic proximity metric and comprised of nonconvex cells, with a one-parameter family of partitions of 2-D flat manifolds, which are induced by (parametric) quadratic proximity metrics and comprised of convex polygonal cells. By exploiting the special structure of the parametric partitions, we develop distributed partitioning algorithms that converge in a finite number of steps. Subsequently, we utilize the solutions to the latter problems to solve a class of locational optimization problems over the terminal manifold. Numerical simulations that illustrate the capabilities of the proposed algorithms are also presented.

关键词： Distributed algorithms locational optimization multi-agent networks partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Histogram partitioning algorithms for adaptive and autonomous threshold estimation in cognitive radio-based industrial wireless sensor networks

引用

TRANSACTIONS ON EMERGING TELECOMMUNICATIONS TECHNOLOGIES 2019年第10期30卷 n/a-n/a页

作者： Onumanyi, A. J. Abu-Mahfouz, A. M. Hancke, G. P. Univ Pretoria Dept Elect Elect & Comp Engn ZA-0028 Pretoria South Africa CSIR Pretoria South Africa City Univ Hong Kong Dept Comp Sci Kowloon Hong Kong Peoples R China

Modern energy detectors typically use adaptive threshold estimation algorithms to improve signal detection in cognitive radio-based industrial wireless sensor networks (CR-IWSNs). However, a number of adaptive threshold estimation algorithms often perform poorly under noise uncertainty conditions since they are typically unable to auto-adapt their parameter values per changing spectra conditions. Consequently, in this paper, we have developed two new algorithms to accurately and autonomously estimate threshold values in CR-IWSNs under dynamic spectra conditions. The first algorithm is a parametric-based technique termed the histogram partitioning algorithm, whereas the second algorithm is a fully autonomous variant termed the mean-based histogram partitioning algorithm. We have evaluated and compared both algorithms with some well-known methods under different CR sensing conditions. Our findings indicate that both algorithms maintained over 90% probability of detection in both narrow and wideband sensing conditions and less than 10% probability of false alarm under noise-only conditions. Both algorithms are quick and highly scalable with a time complexity of O(V), where V is the total number of input samples. The simplicity, effectiveness, and viability of both algorithms make them typically suited for use in CR-IWSN applications.

关键词： adaptive thresholding histograms energy detector signal acquisition algorithms probability of false alarm partitioning algorithms complexity classes Wireless sensor networks Self tuning

来源：评论

学校读者我要写书评

暂无评论

Performance evaluation of non-water absorption coefficient partitioning algorithms in optically complex coastal waters of Kochi and Goa, India

引用

OCEANOLOGIA 2021年第4期63卷 420-437页

作者： Kolluru, Srinivas Gedam, Shirishkumar S. Inamdar, Arun B. Indian Inst Technol Ctr Studies Resources Engn Bombay 400076 Maharashtra India

Absorption coefficient partitioning algorithms (APAs) were developed to partition Absorption;the total absorption coefficient (a(lambda)) or total non-water absorption coefficient (a(nw)(lambda)) into the absorption subcomponents, i.e., absorption due to phytoplankton a(ph)(lambda), colored dissolved organic matter (CDOM) a(g)(lambda) and non-algal particulate matter a(d)(lambda), lambda. is the wavelength. Absorption coefficients of CDOM and non-algal particulate matter are generally combined due to a similarity in exhibited spectral shape and represented as colored detrital matter (CDM) absorption coefficient, a(dg)(lambda). This study focuses on the applicability of five APAs Schofield's, Lin's, Zhang's, Stacked Constraints Model (SCM) and Generalized Stacked Constraints Model (GSCM), in deriving the absorption subcomponents from a(nw)(lambda) in optically complex coastal waters of Kochi and Goa, India. The average spectral Mean Absolute Percentage Errors (MAPE) obtained for all models in the retrieval of a(ph)(lambda), a(d)(lambda), a(g)(lambda) and a(dg)(lambda) lie in the ranges of 26-44%, 37-45%, 34-65% and 42-56%. Slopes of a(dg)(lambda), a(g)(lambda) and a(d)(lambda) as indicated by S-dg, S-g and S-d are derivable from GSCM, Schofield and Lin's models only. GSCM model exhibited good retrieval capability of S-d with MAPE values of 22% and a correlation coefficient of 0.74. In retrieval of S-g parameter, none of the models demonstrated satisfactory performance. Overall, the GSCM and Schofield's models demonstrated good performance in the retrieval of absorption subcomponents, a(ph)(lambda), a(dg)(lambda), a(d)(lambda) and S-d. Effect of applying baseline correction to a(d)(lambda) on model performance is studied. Tuning with in situ data can further improve the absorption subcomponent and slope parameter retrieval capability of the models. (C) 2021 Institute of Oceanology of the Polish Academy of Sciences. Production and hosting by Elsevier B.V.

关键词： Absorption Phytoptankton CDOM Non-algal particulate matter partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Adapting web pages using graph partitioning algorithms for user-centric multi-device web browsing

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2013年第1期62卷 209-231页

作者： Huber, Jochen Ding, Yun Tech Univ Darmstadt D-64289 Darmstadt Germany RIB Software AG Singapore 038989 Singapore

In the era of ubiquitous computing, applications are emerging to benefit from using devices of different users and different capabilities together. This paper focuses on user-centric web browsing using multiple devices, where content of a web page is partitioned, adapted and allocated to devices in the vicinity. We contribute two novel web page partitioning algorithms. They differ from existing approaches by allowing for both, automatic and semi-automatic partitioning. On the one hand, this provides good automatic, web page independent results by utilizing sophisticated structural pre-and postprocessing of the web page. On the other hand, these results can be improved by considering additional semantic information provided through user-generated web page annotations. We further present a performance evaluation of our algorithms. Moreover, we contribute the results of a user study. These clearly show that (1) our algorithms provide good automatic results and (2) the application of user-centric, annotation-based semantic information leads to a significantly higher user satisfaction.

关键词： Multi-device web browsing Web page partitioning partitioning algorithms Web page annotation Mobile and ubiquitous multimedia

来源：评论

学校读者我要写书评

暂无评论

Two partitioning algorithms for generating of M Sets of the Frieze Group

Two partitioning algorithms for generating of M Sets of the ...

引用

2nd International Conference on Measurement, Instrumentation and Automation (ICMIA 2013)

作者： Wang, Fengying Du, Liming Han, Ziyang Shenyang Jianzhu Univ Fac Informat & Control Engn Shenyang Peoples R China

ISBN: (纸本)9783037857519

Symmetric features of the frieze group equivalent mappings were analysed, and two partitioning algorithms are given for constructing generalized Mandelbrot sets of frieze group equivalent mappings in order to study the characteristics of generalized Msets. Based on generating parameter space of dynamical system, lots of patterns of generalized Mandelbrot sets are produced.

关键词： partitioning algorithms chaos Frieze group Mandelbrot set

来源：评论

学校读者我要写书评

暂无评论

Process Variation-Aware Workload partitioning algorithms for GPUs Supporting Spatial-Multitasking

Process Variation-Aware Workload Partitioning Algorithms for...

引用

Design, Automation and Test in Europe Conference and Exhibition (DATE)

作者： Aguilera, Paula Lee, Jungseob Farmahini-Farahani, Amin Morrow, Katherine Schulte, Michael Kim, Nam Sung Univ Wisconsin Madison WI 53706 USA

ISBN: (纸本)9783981537024

High-level programming languages have transformed graphics processing units (GPUs) from domain-restricted devices into powerful compute platforms. Yet many "general-purpose GPU" (GPGPU) applications fail to fully utilize the GPU resources. Executing multiple applications simultaneously on different regions of the GPU (spatial multitasking) thus improves system performance. However, within-die process variations lead to significantly different maximum operating frequencies (F-max) of the streaming multiprocessors (SMs) within a GPU. As the chip size and number of SMs per chip increase, the frequency variation is also expected to increase, exacerbating the problem. The increased number of SMs also provides a unique opportunity: we can allocate resources to concurrently-executing applications based on how those applications are affected by the different available F-max values. In this paper, we study the effects of per-SM clocking on spatial multitasking-capable GPUs. We demonstrate two factors that affect the performance of simultaneously-running applications: (i) the SM partitioning algorithm that decides how many resources to assign to each application, and (ii) the assignment of SMs to applications based on the operating frequencies of those SMs and the applications characteristics. Our experimental results show that spatial multitasking that partitions SMs based on application characteristics, when combined with per-SM clocking, can greatly improve application performance by up to 46% on average compared to cooperative multitasking with global clocking.

关键词： graphics processing units high level languages multiprogramming GPU graphics processing units high level programming languages maximum operating frequencies process variation aware workload partitioning algorithms spatial multitasking streaming multiprocessors within die process variations Business process re-engineering Clocks Frequency control Graphics processing units Kernel Multitasking partitioning algorithms

来源：评论

学校读者我要写书评

暂无评论

Coupling-Aware Graph partitioning algorithms: Preliminary Study 21

Coupling-Aware Graph Partitioning Algorithms: Preliminary St...

引用

21st International Conference on High Performance Computing (HiPC)

作者： Predari, Maria Esnard, Aurelien Univ Bordeaux LaBRI UMR 5800 F-33400 Talence France CNRS LaBRI UMR 5800 F-33400 Talence France INRIA HiePACS Project F-33400 Talence France

ISBN: (纸本)9781479959754

In the field of scientific computing, load balancing is a major issue that determines the performance of parallel applications. Nowadays, simulations of real-life problems are becoming more and more complex, involving numerous coupled codes, representing different models. In this context, reaching high performance can be a great challenge. In this paper, we present graph partitioning techniques, called co-partitioning, that address the problem of load balancing for two coupled codes: the key idea is to perform a "coupling-aware" partitioning, instead of partitioning these codes independently, as it is usually done. Finally, we present a preliminary experimental study which compares our methods against the usual approach.

关键词： Load balancing partitioning algorithms Codes Line graph HIGH-PERFORMANCE partitions Scientific computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：