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

COMPUTING SIGNAL DELAY IN GENERAL RC-NETWORKS BY TREE LINK partitioning

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1990年第8期9卷 898-902页

作者： CHAN, PK KARPLUS, K Department of Computer Engineering University of California Santa Cruz CA USA

Most RC simulators handle only tree networks, not arbitrary networks. An algorithm is presented for computing signal delays in general RC networks using the RC-tree computation as the primary operation. The algorithm partitions a given network into a spanning tree and links. It computes the signal delay of the spanning tree, and updates the signal delay as it incrementally adds the links back to reconstruct the original network. If m is the number of links, this algorithm requires m(m+1)/2 updates and m+1 tree delay evaluations. All the tree delay evaluations involve computing signal delays with the same resistive spanning tree, but with different values for the capacitors.< >

关键词： Computer networks Intelligent networks Delay estimation Circuits Computational modeling partitioning algorithms Delay effects Adders MOS capacitors Propagation delay

来源：评论

学校读者我要写书评

暂无评论

BINARY IMAGE COMPRESSION USING EFFICIENT partitioning INTO RECTANGULAR REGIONS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1995年第5期43卷 1888-1893页

作者： MOHAMED, SA FAHMY, MM KING FAHD UNIV PETR & MINERALS DEPT ELECT ENGNDHAHRAN 31261SAUDI ARABIA

In this paper, a new binary image coding technique is presented, In the new technique, the black regions in the input image are first partitioned into a number of nonoverlapping rectangles. The partitioning can be achieved using one of two different algorithms. The first algorithm can partition the input image into the minimum number of nonoverlapping rectangles at the expense of complex implementation, The second algorithm gives a near optimal partitioning with very simple implementation, After the black regions of the input image are partitioned into rectangles, the coordinates of two opposite vertices of each rectangle are compressed using a simple procedure that allows the decoder to reconstruct the original image, Test images of different types, sizes, and complexities are used to demonstrate the improvement of the new technique over the other currently available binary image compression techniques.

关键词： Image coding partitioning algorithms Decoding Image reconstruction Testing Focusing Image communication Communications Society Petroleum

来源：评论

学校读者我要写书评

暂无评论

Receiver-Initiated Data Collection in Wake-Up Radio Enabled mIoT Networks: Achieving Collision-Free Transmissions by Hashing and partitioning

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING

引用

IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING 2021年第2期5卷 868-883页

作者： Hsu, Chia-An Tsai, Chung-Hsiang Li, Frank Y. Chen, Chiuyuan Tseng, Yu-Chee Natl Chiao Tung Univ Dept Appl Math Hsinchu 300 Taiwan Univ Agder Dept Informat & Commun Technol N-4898 Grimstad Norway Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan

To achieve ultra-low energy consumption and decade-long battery lifetime for Internet of Things (IoT) networks, wake-up radio (WuR) appears as an eminent solution. While keeping devices in deep sleep for most of the time, a WuR enabled IoT device can be woken up for data transmission at any time by a wake-up call (WuC). However, collisions happen among WuCs for transmitter-initiated data reporting and among data packets for receiver-initiated data collection. In this article, we propose three novel hashing-based schemes in order to achieve collision-free data transmissions for receiver-initiated data collection. We consider first a simple scenario where all devices in a region of interest are reachable by a WuC message and propose a scheme which facilitates a scheduled time instant for data uploading of each device through a hash function. In the second scenario where IoT devices are distributed across a large region that cannot be covered by a single WuC, we propose two partitioning algorithms to enable data collection across multiple partitions. Furthermore, we extend the scenario by considering device mobility and propose another scheme which improves the partitioning algorithm to deal with mobility. Both analysis and simulations are performed to demonstrate the effectiveness of the proposed schemes.

关键词： Data collection partitioning algorithms Internet of Things Energy consumption Data communication Protocols Performance evaluation Massive IoT wake-up radio receiver-initiated data collection collision-free hash and partition

来源：评论

学校读者我要写书评

暂无评论

Minimum replication min-cut partitioning

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1997年第10期16卷 1221-1227页

作者： Mak, WK Wong, DF Univ Texas Dept Comp Sci Austin TX 78712 USA

Logic replication has been shown to be very effective in reducing the number of cut nets in partitioned circuits, Liu et al. in [8] considered the circuit partitioning problem with logic replication for separating two given nodes and presented an algorithm to determine a partitioning of the minimum possible cut size. In general, there are many possible partitioning solutions with the minimum cut size and the difference in the required amount of replication by these solutions can be significant. Since there is a size constraint on each component of the partitioning in practice, it is desirable to also minimize the amount of replication. In this paper, we present a network-flow based algorithm to determine an optimum replication min-cut partitioning that requires minimum replication, And we show that the algorithm can be generalized to separate two given subsets of nodes giving an optimum partitioning of the minimum possible cut size using the least possible amount of replication, We also show that our algorithm can be used to improve the solutions produced by any existing size-constrained replication min-cut partitioning algorithm by reducing the cut size and shrinking the replication set.

关键词： partitioning algorithms Logic circuits Very large scale integration Costs

来源：评论

学校读者我要写书评

暂无评论

Distributed PSO Algorithm for Data Model partitioning in Power Distribution Systems

引用

JOURNAL OF APPLIED RESEARCH AND TECHNOLOGY 2014年第5期12卷 947-957页

作者： Erdeljan, A. Capko, D. Vukmirovic, S. Bojanic, D. Congradac, V. Univ Novi Sad Fac Tech Sci Novi Sad 21000 Serbia

This paper presents a method for data model partitioning of power distribution network. Modern Distribution Management Systems which utilize multiprocessor systems for efficient processing of large data model are considered. The data model partitioning is carried out for parallelization of analytical power calculations. The proposed algorithms (Particle Swarm Optimization (PSO) and distributed PSO algorithms) are applied on data model describing large power distribution network. The experimental results of PSO and distributed PSO algorithms are presented. Distributed PSO algorithm achieves significantly better results than the basic PSO algorithm.

关键词： Particle swarm optimization partitioning algorithms Power distribution networks Data models

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Network partitioning for Solution of Potential-Driven, Steady-State Nonlinear Network Flow Equations

引用

IEEE CONTROL SYSTEMS LETTERS 2024年 8卷 3368-3373页

作者： Srinivasan, Shriram Sundar, Kaarthik Los Alamos Natl Lab Appl Math Grp Los Alamos NM 87545 USA Los Alamos Natl Lab Informat Syst & Modeling Los Alamos NM 87545 USA

The solution of potential-driven steady-state flow in large networks is a task which manifests in various engineering applications, such as transport of natural gas or water through pipeline networks. The resultant system of nonlinear equations depends on the network topology, and in general, there is no numerical algorithm that offers guaranteed convergence to the solution (assuming a solution exists). Some methods offer guarantees in cases where the network topology satisfies certain assumptions, but these methods fail for larger networks. On the other hand, the Newton-Raphson algorithm offers a convergence guarantee if the starting point lies close to the (unknown) solution. It would be advantageous to compute the solution of the large nonlinear system through the solution of smaller nonlinear sub-systems wherein the solution algorithms (Newton-Raphson or otherwise) are more likely to succeed. This letter proposes and describes such a procedure, a hierarchical network partitioning algorithm that enables the solution of large nonlinear systems corresponding to potential-driven steady-state network flow equations.

关键词： Network topology partitioning algorithms Natural gas Steady-state Pipelines Convergence Nonlinear systems Nonlinear equations Noise measurement Newton method Networked control systems fluid flow systems network analysis and control

来源：评论

学校读者我要写书评

暂无评论

BIPARTITE FOLDING AND partitioning OF A PLA

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1984年第3期3卷 191-199页

作者： EGAN, JR LIU, CL UNIV ILLINOIS DEPT COMP SCIURBANAIL 61801

A more restricted definition of a PLA folding is introduced, which is called bipartite folding. The additional constraints of a bipartite folding force the resulting PLA to have a more uniform structure. This structure of a column bipartite folding is then exploited when subsequently folding the rows of the PLA. A column bipartite folding creates fewer constraints upon the ability to fold the rows of the resulting PLA; thus there is a greater probability of folding the rows. Obviously, the more columns and rows of the PLA that are folded, the less area that is needed to implement the PLA. An efficient branch and bound algorithm is presented which finds an optimal bipartite folding of a PLA. Our experimental results shows that the size of an optimal bipartite folding compares favorably to the size of a folding discovered by a heuristic algorithm. This algorithm can also be used to partition a large PLA into smaller PLA's.

关键词： Programmable logic arrays Very large scale integration partitioning algorithms Algorithm design and analysis Logic arrays Circuits Logic design Heuristic algorithms Complexity theory

来源：评论

学校读者我要写书评

暂无评论

partitioning - UNIFYING FRAMEWORK FOR ADAPTIVE SYSTEMS .2. CONTROL

引用

PROCEEDINGS OF THE IEEE 1976年第8期64卷 1182-1198页

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

In this paper, partitioning and the associated partitioned adaptive control algorithms are shown to constitute a unifying framework for adaptive control. Moreover, the partitioned adaptive controls (PAC's) are shown to have several interesting properties as well as a decoupled parallel-processing structure that is computationally attractive. Finally, using the partitioning framework and a related general class of PAC's the adaptive control problem is treated from a global viewpoint that unifies seemingly unrelated previously obtained suboptimal adaptive controls, and, most importantly, yields fundamentally new adaptive control algorithms. These new control algorithms are shown to have several important properties from both a theoretical and a realization or computational standpoint.

关键词： Adaptive systems Programmable control Adaptive control Control systems Optimal control Mathematical model Uncertainty partitioning algorithms Constraint optimization Design optimization

来源：评论

学校读者我要写书评

暂无评论

Hyper-Graph partitioning for a Multi-Agent Reformulation of Large-Scale MILPs

引用

IEEE CONTROL SYSTEMS LETTERS 2022年 6卷 1346-1351页

作者： Manieri, Lucrezia Falsone, Alessandro Prandini, Maria Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy

This letter addresses the challenge of solving large-scale Mixed Integer Linear Programs (MILPs). A resolution scheme is proposed for the class of MILPs with a hidden constraint-coupled multi-agent structure. In particular, we focus on the problem of disclosing such a structure to then apply a computationally efficient decentralized optimization algorithm recently proposed in the literature. The multi-agent reformulation problem consists in manipulating the matrix defining the linear constraints of the MILP so as to put it in a singly-bordered block-angular form, where the blocks define local constraints and decision variables of the agents, whereas the border defines the coupling constraints. We translate the matrix reformulation problem into a hyper-graph partitioning problem and introduce a novel algorithm which accounts for the specific requirements on the singly-bordered block-angular form to best take advantage of the decentralized optimization approach. Numerical results show the effectiveness of the proposed hyper-graph partitioning algorithm.

关键词： partitioning algorithms Couplings Pins Periodic structures Cost function Standards Sparse matrices Large-scale systems optimization computational methods

来源：评论

学校读者我要写书评

暂无评论

Fuzzy-Based Balanced partitioning Under Capacity and Size-Tolerance Constraints in Distributed Quantum Circuits

IEEE TRANSACTIONS ON QUANTUM ENGINEERING

引用

IEEE TRANSACTIONS ON QUANTUM ENGINEERING 2023年第1期4卷 1页

作者： Yan, Jin-Tai Tainan Natl Univ Arts Grad Inst Sound Technol Tainan 720 Taiwan

It is important for the design of a distributed quantum circuit (DQC) to minimize the communication cost in k-way balanced partitioning. In this article, given an original quantum circuit (QC), a partitioning number k, the maximum capacity delta inside each partition, and the maximum size tolerance gamma between two partitions, a new k-way (delta, gamma)-balanced partitioning problem can be formulated as a k-way partitioning problem under the capacity constraint delta and the size-tolerance constraint gamma, and a fuzzy-based partitioning algorithm can be proposed to minimize the communication cost in k-way (delta, gamma)-balanced partitioning for a DQC design. First, an edge-weighted connection graph can be constructed from the gates in a given QC. Furthermore, based on the estimation of the probabilistic connection strength between two vertices in the connection graph and the initial k-way partitioning result in the connection graph, the fuzzy memberships on k clusters can be generated in fuzzy k-means graph clustering. Finally, based on the fuzzy memberships on k clusters in the connection graph, the maximum capacity inside each partition, and the maximum size tolerance between two partitions, all the vertices in the connection graph can be assigned onto k partitions to minimize the communication cost in k-way (delta, gamma)-balanced partitioning. Compared with Daei's recursive Kernighan-Lin-based algorithm in four-way balanced partitioning, the experimental results show that the proposed fuzzy-based partitioning algorithm with three size-tolerance constraints gamma = 1, gamma = 2, and gamma = 3 can use 58.3%, 61.3%, and 64.5% of CPU time to reduce 16.1%, 21.2%, and 24.6% of the communication cost for the eight tested circuits on the average, respectively. Compared with the modified partitioning algorithm from Dadkhah's partitioning algorithm in three-way, four-way, or five-way balanced partitioning, the experimental results show that the proposed fuzzy-based par

关键词： Logic gates partitioning algorithms Costs Qubit Quantum circuit Teleportation Quantum entanglement Balanced partitioning communication cost distributed quantum circuit (DQC) fuzzy k-means graph clustering (FKGC)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：