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

STOCHASTIC-MODELS FOR WIREABILITY ANALYSIS OF GATE ARRAYS

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1986年第1期5卷 52-65页

作者： SASTRY, S PARKER, AC Department of Electrical Engineering-Systems University of Southern California Los Angeles CA USA

A stochastic model for estimating measures of placement and routing on gate arrays is presented. Three important problems are addressed: estimating the dimensions of the routing channels, estimating the routability of a channel given the number of tracks, and determining the distribution and moments of wire lengths. In the context of wiring space estimation, exact and asymptotic formulas for the dimensions of routing channels are presented. Next, an expression for the probability that a routing channel with a given number of tracks will be routable is derived, and its asymptotic properties are examined. Finally, a model that characterizes the relationship between wire length distributions and partitioning of logic is developed. The model provides a firm mathematical basis for Rent's rule from which the distribution of wire lengths can be determined. That is, Rent's rule, or in general any similar relation, contains all the information about wire lengths. Based on this, estimates for the average wire length are derived. Numerical results from both simulated and real chips are presented.

关键词： Stochastic processes Wire Routing Wiring partitioning algorithms Length measurement Very large scale integration Logic arrays Mathematical model Process design

来源：评论

学校读者我要写书评

暂无评论

Detection and Defense of Cache Pollution Attacks Using Clustering in Named Data Networks

引用

IEEE TRANSACTIONS ON DEPENDABLE AND SECURE COMPUTING 2020年第6期17卷 1310-1321页

作者： Yao, Lin Fan, Zhenzhen Deng, Jing Fan, Xin Wu, Guowei Key Lab Ubiquitous Network & Serv Software Liaoni Dalian 116600 Peoples R China Dalian Univ Technol DUT RU Int Sch Informat Sci & Engn Dalian 116600 Peoples R China Dalian Univ Technol Sch Software Dalian 116600 Peoples R China Univ North Carolina Greensboro UNCG Dept Comp Sci Greensboro NC 27412 USA

Named Data Network (NDN), as a promising information-centric networking architecture, is expected to support next-generation of large-scale content distribution with open in-network cachings. However, such open in-network caches are vulnerable against Cache Pollution Attacks (CPAs) with the goal of filling cache storage with non-popular contents. The detection and defense against such attacks are especially difficult because of CPA's similarities with normal fluctuations of content requests. In this work, we use a clustering technique to detect and defend against CPAs. By clustering the content interests, our scheme is able to distinguish whether they have followed the Zipf-like distribution or not for accurate detections. Once any attack is detected, an attack table will be updated to record the abnormal requests. While such requests are still forwarded, the corresponding content chunks are not cached. Extensive simulations in ndnSIM demonstrate that our scheme can resist CPA effectively with higher cache hit, higher detecting ratio, lower hop count, and lower algorithm complexity compared to other state-of-the-art schemes.

关键词： Pollution Fans Clustering algorithms Computer architecture partitioning algorithms Classification algorithms Resists Cache pollution attack clustering named data networks

来源：评论

学校读者我要写书评

暂无评论

Haery: A Hadoop Based Query System on Accumulative and High-Dimensional Data Model for Big Data

引用

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING 2020年第7期32卷 1362-1377页

作者： Song, Jie He, HongYan Thomas, Richard Bao, Yubin Yu, Ge Northeastern Univ Software Coll Shenyang 110819 Liaoning Peoples R China Univ Queensland Sch Informat Technol & Elect Engn Brisbane Qld Australia Northeastern Univ Sch Comp Sci & Engn Shenyang 110819 Liaoning Peoples R China

Column-oriented stores, known for their scalability and flexibility, are a common NoSQL database implementation and are increasingly used in big data management. In column-oriented stores, a "full-scan" query strategy is inefficient and the search space can be reduced if data is well partitioned or indexed;however, there is no pre-defined schema for building and maintaining partitions and indexes at lower cost. We leverage an accumulative and high-dimensional data model, a sophisticated linearization algorithm, and an efficient query algorithm, to solve the challenge of how a pre-defined and well-partitioned data model can be applied to flexible and time-varied key-value data. We adapt a high-dimensional array as the data model to partition the key-value data without additional storage and massive calculation;improve the Z-order linearization algorithm, which map multidimensional data to one dimension while preserving locality of the data points, for flexibility;efficiently build an expansion mechanism for the data model to support time-varied data. The result is Haery, a column-oriented store, based on a distributed file system and computing framework. In experiments, Haery is compared with Hive, HBase, Cassandra, MongoDB, PostgresXL, and HyperDex in terms of query performance. With results indicating Haery on average performs 4.57x, 4.23x, 3.55x, 1.79x, 1.82x, and 120.6x faster, respectively.

关键词： Data models Big Data partitioning algorithms NoSQL databases Indexing Key-value data column-oriented store multi-dimensional data model linearization accumulation

来源：评论

学校读者我要写书评

暂无评论

An Efficient Network Reduction Method for Transmission Expansion Planning Using Multicut Problem and Kron Reduction

引用

IEEE TRANSACTIONS ON POWER SYSTEMS 2018年第6期33卷 6120-6130页

作者： Ploussard, Quentin Olmos, Luis Ramos, Andres Inst Res Technol Madrid 28015 Spain Comillas Pontifical Univ Inst Res Technol Madrid 28015 Spain Univ Pontificia Comillas Inst Invest Tecnol Madrid 28015 Spain

This paper provides a new methodology to compute a reduced but accurate network representation in a transmission expansion planning (TEP) context. Considering this reduced network should lead to the same investment decisions as if the whole original network were considered. A set of relevant lines to be preserved is defined based on a proxy of the TEP solution. An optimal network partition, resulting from solving the multicut problem, is computed in such a way that the two ends of each of these relevant lines are allocated to two different areas. An iterative Kron reduction is then applied to each area to eliminate most of the buses that are not connected to any interarea line. This two-step process results in a compact but representative reduced network. Our algorithm has been implemented in General Algebraic Modelling Software and Matrix Laboratory and has been tested on the standard IEEE 118 bus system and a case study based on the European power system. The method produces very promising results and, in the considered case studies, leads to the same, or equally efficient, investment decisions and essentially the same total costs as when considering the whole original network.

关键词： Clustering dimension reduction integer linear programming network theory (graphs) partitioning algorithms transmission expansion planning relaxation methods

来源：评论

学校读者我要写书评

暂无评论

ON CLUSTER VALIDITY FOR THE FUZZY C-MEANS MODEL

引用

IEEE TRANSACTIONS ON FUZZY SYSTEMS 1995年第3期3卷 370-379页

作者： PAL, NR BEZDEK, JC Department of Computer Science University of West Florida Pensacola FL USA

Many functionals have been proposed for validation of partitions of object data produced by the fuzzy c-means (FCM) clustering algorithm. We examine the role a subtle but important parameter-the weighting exponent m of the FCM model-plays in determining the validity of FCM partitions, The functionals considered are the partition coefficient and entropy indexes of Bezdek, the Xie-Beni, and extended Xie-Beni indexes, and the Fukuyama-Sugeno index. Limit analysis indicates, and numerical experiments confirm, that the Fukuyama-Sugeno index is sensitive to both high and low values of m and may be unreliable because of this. Of the indexes tested, the Xie-Beni index provided the best response over a wide range of choices for the number of clusters, (2-10), and for m from 1.01-7, Finally, our calculations suggest that the best choice for rn is probably in the interval [1.5, 2.5], whose mean and midpoint, m = 2, have often been the preferred choice for many users of FCM.

关键词： Clustering algorithms Fuzzy sets partitioning algorithms Entropy Testing Unsupervised learning Prototypes Equations Computer science Fuzzy logic

来源：评论

学校读者我要写书评

暂无评论

A NEW RELAXATION ALGORITHM AND PASSIVE SENSOR DATA ASSOCIATION

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1992年第2期37卷 198-213页

作者： PATTIPATI, KR DEB, S BARSHALOM, Y WASHBURN, RB ALPHATECH INC TECH STAFFBURLINGTONMA 01803

This paper is concerned with the static problem of associating measurements at a given time from three angle-only sensors in the presence of clutter, missed detections, and an unknown number of targets. The measurement-target association problem is formulated as one of maximizing the joint likelihood function of the measurement partition. Mathematically, this formulation of the data association problem leads to a generalization of the three-dimensional (3-D) assignment (matching) problem, which is known to be NP hard;that is, the complexity of an optimal algorithm increases exponentially with the size of the problem, since no known polynomial time algorithm exists. Suboptimal algorithms of quantifiable accuracy are therefore of considerable importance. The new solution to the optimization problem developed in this paper is a Lagrangian relaxation technique that successively solves a series of generalized two-dimensional (2-D) assignment problems, with the worst case complexity of O(3kn3), where k is the number of relaxation iterations and n is the number of reports from each sensor. The dual optimization problem is solved via an acclerated subgradient method. A useful feature of the relaxation approach is that the resulting dual optimal cost is a lower bound on the feasible cost and, hence, provides a measure of how close the feasible solution is to the (perhaps unknowable) optimal solution. For the passive sensor data association problem, the feasible solution costs are typically within 1% of their corresponding dual optimal costs. A comparison of our relaxation algorithm to the optimal branch-and-bound and suboptimal row-column algorithms demonstrates that our algorithm is superior to these alternative approaches in terms of computational complexity and/or measurement-target association accuracy. Finally, the algorithm is illustrated via several application examples.

关键词： Cost function Target tracking Radar tracking Noise measurement Current measurement State estimation Time measurement partitioning algorithms Polynomials Lagrangian functions

来源：评论

学校读者我要写书评

暂无评论

Robust Structural Balance in Signed Networks Using a Multiobjective Evolutionary Algorithm

引用

IEEE COMPUTATIONAL INTELLIGENCE MAGAZINE 2020年第2期15卷 24-35页

作者： Wang, Shuai Liu, Jing Jin, Yaochu Xidian Univ Sch Artificial Intelligence Xian Peoples R China Univ Surrey Dept Comp Sci Guildford Surrey England

The aim of network structural balance is to find proper partitions of nodes that guarantee equilibrium in the system, which has attracted considerable attention in recent decades. Most of existing studies focus on reducing imbalanced components in complex networks without considering the tolerance of these balanced networks against attacks and failures. However, as indicated by some recent studies, the robustness of structurally balanced networks is also important in real applications, which should be emphasized in balancing processes. Currently, it remains challenging to define suitable robustness measures for signed networks, and few performance enhancement strategies have been designed. In this paper, two measures are designed to numerically evaluate the robustness of structurally balanced networks. Furthermore, the simultaneous enhancement on these two measures is modeled as a multiobjective optimization problem, and a multiobjective evolutionary algorithm, MOEA/D-RSB, is developed to successfully solve this problem. Experiments on synthetic and real-world networks demonstrate the good performance of MOEA/D-RSB in finding robust balanced candidates. In addition, the features of partitions with different robustness performances are analyzed to show the impact of different balancing strategies on network robustness. The obtained results are valuable in dealing with some problems arising in social and natural dynamics.

关键词： Robustness Optimization partitioning algorithms Complex networks Social network services Sociology Measurement

来源：评论

学校读者我要写书评

暂无评论

A NONBACKTRACKING MATRIX DECOMPOSITION ALGORITHM FOR ROUTING ON CLOS NETWORKS

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 1993年第8期41卷 1245-1251页

作者： CARPINELLI, JD ORUC, AY UNIV MARYLAND DEPT ELECT ENGNCOLL PKMD 20740

A number of matrix decomposition schemes were reported for routing on Clos switching networks. These schemes occasionally fail to find the right decomposition, unless backtracking is used. This paper shows that a partition may occur during the decomposition process, and that this is the underlying reason these algorithms fail for some decompositions. It then presents a parallel algorithm which can recognize when a partition exists and set up the Clos network without backtracking.

关键词： Matrix decomposition Routing Switches Communication switching partitioning algorithms Parallel algorithms Computer aided analysis Telephony Algorithm design and analysis Communications Society

来源：评论

学校读者我要写书评

暂无评论

Recovering Static and Time-Varying Communities Using Persistent Edges

引用

IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING 2024年第2期11卷 2087-2099页

作者： Avrachenkov, Konstantin Dreveton, Maximilien Leskela, Lasse Inria Sophia Antipolis F-06902 Valbonne France Ecole Polytech Fed Lausanne Sch Comp & Commun Sci CH-1015 Lausanne Switzerland Aalto Univ Dept Math & Syst Anal Espoo 02150 Finland

This article focuses on spectral methods for recovering communities in temporal networks. In the case of fixed communities, spectral clustering on the simple time-aggregated graph (i.e., the weighted graph formed by the sum of the interactions over all temporal snapshots) does not always produce satisfying results. To utilise information carried by temporal correlations, we propose to employ different weights on freshly appearing and persistent edges. We show that spectral clustering on such weighted graphs can be explained as a relaxation of the maximum likelihood estimator of an extension of the degree-corrected stochastic block model with Markov interactions. We also study the setting of evolving communities, for which we use the prediction at time t-1 as an oracle for inferring the community labels at time t. We demonstrate the accuracy of the proposed methods on synthetic and real data sets.

关键词： Markov processes Maximum likelihood estimation Clustering algorithms Biological system modeling Image edge detection partitioning algorithms Optimization Graph clustering temporal networks spectral methods stochastic block model

来源：评论

学校读者我要写书评

暂无评论

Three Representations for Set Partitions

引用

IEEE ACCESS 2021年 9卷 34604-34625页

作者： Torres-Jimenez, Jose Lara-Alvarez, Carlos Cardenas-Castillo, Alfredo Blanco-Rocha, Roberto Puga-Sanchez, Oscar CINVESTAV Tamaulipas Ciudad Victoria 87130 Tamaulipas Mexico

The Set partitioning Problem (SPP) aims to obtain non-empty disjoint subsets of objects such that their union equals the whole set of objects, and the partition meets some prespecified criteria. The ubiquity of SPP is impressive, given that it has a lot of theoretical and practical motivations. In the theoretical side, the study of the SPP is closely related to Bell numbers, Stirling numbers of the second kind, integer partitions, Eulerian numbers, Restricted Growth Strings (RGS), factoradic number system, power calculations, etc. In the practical side, SPP is intimately related to classification problems, clustering problems, reduction of dimensionality problems, and so on. In this work, three representations for instances of SPP are presented, these representations use: Restricted Growth Strings (RGS), factoradic number system, and a number system with a fixed base. Two cases for these representations will be presented: where the number of subsets is unbounded (i.e. the number of subsets can be the number of objects);and where the number of subsets is less than the number of objects. Bidirectional mappings between these three representations will be introduced, also the mapping among these three representations and the power of a base is defined. Given, that these three representations can be used to solve instances of SPP using exact, greedy, and metaheuristic algorithms, that require to do small changes to one possible solution and/or recombination of two possible solutions, definitions of mutation and recombination operators for the three representations will be shown. In order to motivate the use of the three representations for the solution of particular instances of SPP, it was decided to present their application to solve an instance of a set partition of integers problem (SPIP) using a simple genetic algorithm.

关键词： Licenses Redundancy partitioning algorithms Genetic algorithms Web mining Self-organizing feature maps Maintenance engineering Bell numbers factoradic number system restricted growth strings number system stirling numbers of the second kind Eulerian numbers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：