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

A NEURAL NETWORK DESIGN FOR CIRCUIT partitioning

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1990年第12期9卷 1265-1271页

作者： YIH, JS MAZUMDER, P Dept. of Electr. Eng. & Comput. Sci. Michigan Univ. Ann Arbor MI USA Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI USA

A neural network model is proposed for circuit bipartitioning. The massive parallelism of neural nets has been successfully exploited to balance the partitions of circuit and to reduce the external wiring between the partitions. The experimental results obtained by neural nets are found to be comparable with those achieved by the C.M. Fiduccia and R.M. Mattheyses (1982) algorithm. The proposed approach can be implemented in hardware to accelerate time-consuming partitioning procedures.< >

关键词： Neural networks partitioning algorithms Wires Artificial neural networks Wiring Parallel processing Hardware Acceleration Integrated circuit interconnections Minimization

来源：评论

学校读者我要写书评

暂无评论

Caching Encrypted Content Via Stochastic Cache partitioning

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2018年第1期26卷 548-561页

作者： Araldo, Andrea Dan, Gyorgy Rossi, Dario MIT Intelligent Transportat Syst Lab 77 Massachusetts Ave Cambridge MA 02139 USA KTH Royal Inst Technol Sch Elect Engn & Comp Sci S-10044 Stockholm Sweden Telecom ParisTech INFRES F-75013 Paris France

In-network caching is an appealing solution to cope with the increasing bandwidth demand of video, audio, and data transfer over the Internet. Nonetheless, in order to protect consumer privacy and their own business, content providers (CPs) increasingly deliver encrypted content, thereby preventing Internet service providers (ISPs) from employing traditional caching strategies, which require the knowledge of the objects being transmitted. To overcome this emerging tussle between security and efficiency, in this paper we propose an architecture in which the ISP partitions the cache space into slices, assigns each slice to a different CP, and lets the CPs remotely manage their slices. This architecture enables transparent caching of encrypted content and can be deployed in the very edge of the ISP's network (i.e., base stations and femtocells), while allowing CPs to maintain exclusive control over their content. We propose an algorithm, called SDCP, for partitioning the cache storage into slices so as to maximize the bandwidth savings provided by the cache. A distinctive feature of our algorithm is that ISPs only need to measure the aggregated miss rates of each CP, but they need not know the individual objects that are requested. We prove that the SDCP algorithm converges to a partitioning that is close to the optimal, and we bound its optimality gap. We use simulations to evaluate SDCP's convergence rate under stationary and nonstationary content popularity. Finally, we show that SDCP significantly outperforms traditional reactive caching techniques, considering both CPs with perfect and with imperfect knowledge of their content popularity.

关键词： Content distribution networks Internet cache storage partitioning algorithms stochastic processes

来源：评论

学校读者我要写书评

暂无评论

Image compression using binary space partitioning trees

引用

IEEE TRANSACTIONS ON IMAGE PROCESSING 1996年第12期5卷 1610-1624页

作者： Radha, H Vetterli, M Leonardi, R UNIV CALIF BERKELEY DEPT ELECT ENGN & COMP SCI BERKELEY CA 94720 USA UNIV BRESCIA DEPT ELECT AUTOMAT SIGNALS & COMMUN LAB BRESCIA ITALY

For low bit-rate compression applications, segmentation-based coding methods provide, in general, high compression ratios when compared with traditional (e.g., transform and subband) coding approaches. In this paper, we present a new segmentation-based image coding method that divides the desired image using binary space partitioning (BSP). The BSP approach partitions the desired image recursively by arbitrarily oriented lines in a hierarchical manner, This recursive partitioning generates a binary tree, which is referred to as the BSP-tree representation of the desired image. The most critical aspect of the BSP-tree method is the criterion used to select the partitioning lines of the BSP tree representation. In previous works, we developed novel methods for selecting the BSP-tree lines, and showed that the BSP approach provides efficient segmentation of images. In this paper, we describe a hierarchical approach for coding the partitioning lines of the BSP-tree representation. We also show that the image signal within the different regions (resulting from the recursive partitioning) can be represented using low-order polynomials. Furthermore, we employ an optimum pruning algorithm to minimize the bit rate of the BSP tree representation (for a given budget constraint) while minimizing distortion. Simulation results and comparisons with other compression methods are also presented.

关键词： Image coding Image segmentation Binary trees Polynomials Laboratories partitioning algorithms Bit rate Vector quantization Automation

来源：评论

学校读者我要写书评

暂无评论

MARKOV MODEL-BASED PHONEME CLASS partitioning FOR IMPROVED CONSTRAINED ITERATIVE SPEECH ENHANCEMENT

引用

IEEE TRANSACTIONS ON SPEECH AND AUDIO PROCESSING 1995年第1期3卷 98-104页

作者： HANSEN, JHL ARSLAN, LM Robust Speech Processing Laboratory Department of Electrical Engineering Duke University Durham NC USA

Research has shown that degrading acoustic background noise influences speech quality across phoneme classes in a nonuniform manner, This results in variable quality performance of many speech enhancement algorithms in noisy environments. A phoneme classification procedure is proposed which directs single-channel constrained speech enhancement. The procedure performs broad phoneme class partitioning of noisy speech frames using a continuous mixture hidden Markov model recognizer in conjunction with a perceptually motivated cost-based decision process. Once noisy speech frames are identified, iterative speech enhancement based on all-pole parameter estimation with inter- and intra-frame spectral constraints is employed. The phoneme class-directed enhancement algorithm is evaluated using TIMIT speech data and shown to result in substantial improvement in objective speech quality over a range of signal-to-noise ratios and individual phoneme classes.

关键词： Speech enhancement Working environment noise partitioning algorithms Iterative algorithms Acoustic noise Speech analysis Degradation Background noise Speech processing Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

partitioning of MPEG coded video bitstreams for wireless transmission

引用

IEEE SIGNAL PROCESSING LETTERS 1997年第6期4卷 153-155页

作者： Gharavi, H Richards, CI The Department of Electronic and Electrical Engineering Loughborough University Loughborough Leicestershire UK

This paper introduces an efficient technique for dividing a preceded Moving Pictures Expert Group-2 (MPEG-2) bitstream into an arbitrary number of partitions in decreasing order of visual importance, For a fixed partition size ratio, this has been achieved by variable-length code (VLC) interleaving within a macroblock or group of macroblocks. The algorithm is capable of recreating a syntactically correct bitstream, regardless of the error rate on secondary partitions, This renders it applicable to many efficient transmission schemes, particularly over wireless channels.

关键词： Quadrature amplitude modulation Interleaved codes Frequency synchronization Error correction Discrete cosine transforms Switches partitioning algorithms Error analysis Error probability Modulation coding

来源：评论

学校读者我要写书评

暂无评论

Maximum Utility-Aware Capacity partitioning in Cooperative Computing

引用

IEEE COMMUNICATIONS LETTERS 2021年第10期25卷 3360-3364页

作者： Singha, Nitin Kalamkar, Sanket S. Singh, Yatindra Nath Natl Inst Technol Delhi Dept Elect & Commun Engn New Delhi 110040 India INRIA F-75012 Paris France ENS F-75005 Paris France Qualcomm Inc San Diego CA 92121 USA IIT Kanpur Dept Elect Engn Kanpur 208016 Uttar Pradesh India

In many networks, a user has to allocate the link capacity between upload and download. When such networks are used for cooperative computing, the user needs to maintain the division of upload and download capacities at an optimal value to receive the maximum utility. To determine this optimal value, we model upload-download partitioning as a resource maximization game. We show that a Nash equilibrium (NE) obtained for this game is socially optimal. Thus this NE acts as an upper bound on capacity partitioning and serves as a benchmark to analyze the efficiency and performance of various capacity partitioning algorithms. Specifically, using this upper bound and simulations, we examine the performance of different partitioning algorithms while considering the dynamics of resource requests.

关键词： partitioning algorithms Games Wireless communication Heuristic algorithms Signal to noise ratio Upper bound Bandwidth Capacity partitioning cooperative computing distributed system game theory Nash equilibrium (NE)

来源：评论

学校读者我要写书评

暂无评论

Set partitioning in Hierarchical Trees for Point Cloud Attribute Compression

引用

IEEE SIGNAL PROCESSING LETTERS 2021年 28卷 1903-1907页

作者： Souto, Andre L. Figueiredo, Victor F. Chou, Philip A. de Queiroz, Ricardo L. Univ Brasilia Elect Engn Dept BR-70910900 Brasilia DF Brazil Google Seattle WA 98013 USA Univ Brasilia Comp Sci Dept BR-70910900 Brasilia DF Brazil

We propose an embedded attribute encoding method for point clouds based on set partitioning in hierarchical trees (SPIHT). The encoder is used with the region-adaptive hierarchical transform, which has been a popular transform for point cloud coding and is included in the standard geometry-based point cloud coder (G-PCC). The result is an encoder that is efficient, scalable, and embedded. That is, higher compression is achieved by trimming the full bit-stream. G-PCC's RAHT coefficient prediction prevents the straightforward incorporation of SPIHT into G-PCC. However, our results over other RAHT-based coders are promising, improving over the original, non-predictive RAHT encoder, while providing the key functionality of being embedded.

关键词： Encoding Three-dimensional displays partitioning algorithms Image coding Transforms Sorting Standards Bit-plane encoding point cloud RAHT SPIHT

来源：评论

学校读者我要写书评

暂无评论

partitioning - UNIFYING FRAMEWORK FOR ADAPTIVE SYSTEMS .1. ESTIMATION

引用

PROCEEDINGS OF THE IEEE 1976年第8期64卷 1126-1143页

作者： LAINIOTIS, DG SUNY BUFFALO SYST RES CTRAMHERSTNY SUNY BUFFALO DEPT ELECT ENGNAMHERSTNY 14260

In this paper, partitioning and the associated generalized partitioned estimation algorithms are shown to constitute a unifying and powerful framework for optimal adaptive estimation in linear as well as nonlinear problems. Using the partitioning framework, the adaptive estimation problem is treated from a global viewpoint that readily yields and unifies seemingly unrelated results and, most importantly, yields fundamentally new families of nonlinear and linear estimation algorithms in a decoupled parallel-realization form. The generalized partitioned estimation algorithms are shown to have several important properties from both a theoretical and a realization or computational standpoint.

关键词： Adaptive systems Adaptive estimation Uncertainty Mathematical model partitioning algorithms Constraint optimization Design optimization Noise measurement State estimation Cost function

来源：评论

学校读者我要写书评

暂无评论

REFINED VERTEX CODES AND VERTEX partitioning METHODOLOGY FOR GRAPH ISOMORPHISM TESTING

引用

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS 1980年第10期10卷 610-615页

作者： BHAT, KVS OHIO STATE UNIV DEPT COMP & INFORMAT SCI COLUMBUS OH 43210 USA

In this paper we have pursued the initial vertex partioning methodology for a graph (digraph) isomorphism testing problem using lexicographic ordering of vertex codes. The newly introduced vertex codes (which may be of fixed length or of variable length) incorporate order independent parameters of a graph in relation to a vertex and can be computed efficiently. The vertex partitioning obtaned by the lexicographic ordering of vertex codes is shown to yield the most refined initial vertex partioning known. Examples are presented for the illustration of our method. Specifically, we demonstrate that our approach of using refined vertex oodes for vertex partitioning indeed distinguishes the nonisomorphic cases of strongly regular gaphs of 28 vertices. Our results suggest that the methodology Is powerful in the context of isomorphism testing for large classes of graphs. Further research needed in this area is indicated.

关键词： Testing Polynomials partitioning algorithms Application software Design automation Network theory (graphs) Information retrieval Chemistry Terminology Tree graphs

来源：评论

学校读者我要写书评

暂无评论

AN IMPROVED MIN-CUT ALGORITHM FOR partitioning VLSI NETWORKS

引用

IEEE TRANSACTIONS ON COMPUTERS 1984年第5期33卷 438-446页

作者： KRISHNAMURTHY, B General Electric Research and Development Center Abstract Authors References Cited By Keywords Metrics Similar Download Citation Email Print Request Permissions

Recently, a fast (linear) heuristic for improving min-cut partitions of VLSI networks was suggested by Fiduccia and Mattheyses [6]. In this-paper we generalize their ideas and suggest a class of increasingly sophisticated heuristics. We then show, by exploiting the data structures originally suggested by them, that the computational complexity of any specific heuristic in the suggested class remains linear in the size of the network.

关键词： partitioning algorithms VLSI layout

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：