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

Behavioral Device-Level Modeling of Modular Multilevel Converters in Real Time for Variable-Speed Drive Applications

引用

IEEE JOURNAL OF EMERGING AND SELECTED TOPICS IN POWER ELECTRONICS 2017年第3期5卷 1177-1191页

作者： Lin, Ning Dinavahi, Venkata Univ Alberta Dept Elect & Comp Engn Edmonton AB T6G 2V4 Canada

This paper presents the real-time hardware-in-the-loop (HIL) emulation of an induction machine (IM) driven by a modular multilevel converter (MMC) on the field-programmable gate array (FPGA). The insulated gate bipolar transistors and antiparallel diodes of the MMC are modeled with nonlinear static and dynamic characteristics to provide not only accurate system-level performance of the converter but also insight into the power losses under different operation conditions. Due to the large network size of the MMC, its solution in conjunction with the IM fifth-order model proved to be a significant computational challenge. Therefore, circuit partitioning based on the transmission line modeling is proposed, which introduced an interface to the electrical network for the IM as well as split the multiloop MMC into several smaller subcircuits in terms of matrix size, and consequently enabled a fully parallel implementation on the FPGA. Control strategies for the MMC and IM are also emulated in hardware, and due to the large latency difference between subcircuits and controllers, the overall system hardware design is divided into several layers, each having an independent time step ranging from 500 ns to 4 mu s so as to attain the goal of real-time execution. A comparison of transient and steady-state results from the HIL emulation and offline simulation tools shows high accuracy of the modeling approach as well as the efficacy of proposed multiple time steps in achieving real time.

关键词： Field-programmable gate array (FPGA) induction machine (IM) modular multilevel converter (MMC) parallel processing partitioning algorithms real-time systems

来源：评论

学校读者我要写书评

暂无评论

An Ensemble Learning Algorithm Based on Density Peaks Clustering and Fitness for Imbalanced Data

引用

IEEE ACCESS 2022年 10卷 116120-116128页

作者： Xu, Hui Liu, Qicheng Yantai Univ Sch Comp & Control Engn Yantai 264005 Peoples R China

In view of the low classification accuracy of the minority class in imbalanced data, an algorithm called DPF-EL (density peaks and fitness combined with ensemble learning) based on density peaks clustering and fitness is proposed. Firstly, this method uses the density peaks clustering algorithm to divide the majority class into different sub-clusters, the local density calculated in the clustering process is used to assign weights to each sub-cluster, and the number of under-sampling is determined by the weights. Secondly, the concept of fitness is introduced into the sub-clusters, the selection probability of the samples is calculated according to the size of their fitness, and the majority class is under-sampled based on the selection probability. Finally, combined with boosting algorithm, iterative training is performed on the balanced data set. Experimental tests were conducted with KEEL imbalanced data sets, and the experimental results show that the performance of DPF-EL algorithm is better than other algorithms, which indicates the feasibility of the proposed algorithm.

关键词： Classification algorithms Clustering algorithms Probability Ensemble learning partitioning algorithms Machine learning algorithms Decision trees Imbalanced data density peaks clustering fitness under-sampling classification

来源：评论

学校读者我要写书评

暂无评论

A General Methodology on Designing Acyclic Channel Dependency Graphs in Interconnection Networks

引用

IEEE MICRO 2018年第3期38卷 79-85页

作者： Ebrahimi, Masoumeh Daneshtalab, Masoud KTH Royal Inst Technol Stockholm Sweden Malardalen Univ Vasteras Sweden

For the past three decades, the interconnection network has been developed based on two major theories, one by Dally and the other by Duato. In this article, we introduce EbDa with a simplified theoretical basis, which directly allows for designing an acyclic channel dependency graph and verifying algorithms on their freedom from deadlock. EbDa is composed of three theorems that enable extracting all allowable turns without dealing with turn models.

关键词： Graph Theory Multiprocessor Interconnection Networks Network Routing Network Theory Graphs Simplified Theoretical Basis Acyclic Channel Dependency Graph Eb Da General Methodology Interconnection Network System Recovery Routing Protocols partitioning algorithms Multiprocessor Interconnection Network Topology Fault Tolerance Interconnection Networks Deadlock Avoidance Routing algorithms Channel Dependency Graph Hardware

来源：评论

学校读者我要写书评

暂无评论

Checking Phylogenetics Decisiveness in Theory and in Practice

引用

IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS 2022年第6期19卷 3307-3316页

作者： Parvini, Ghazaleh Braught, Katherine Fernandez-Baca, David Univ Massachusetts Coll Informat & Comp Sci Amherst MA 01003 USA Univ Illinois Dept Comp Sci Urbana IL 61801 USA Iowa State Univ Dept Comp Sci Ames IA 50011 USA

Suppose we aim to build a phylogeny for a set of taxa X using information from a collection of loci, where each locus offers information for only a fraction of the taxa. The question is whether, based solely on the pattern of data availability, called a taxon coverage pattern, one can determine if the data suffices to construct a reliable phylogeny. The problem can be expressed combinatorially as follows. Let us call a taxon coverage pattern decisive if, for any binary phylogenetic tree T for X, the collection of phylogenetic trees obtained by restricting T to the subset of X covered by each locus uniquely determines T. Here we relate the problem of checking whether a taxon coverage pattern is decisive to a hypergraph coloring problem. Using this connection, we (1) show that checking decisiveness is co-NP complete;(2) obtain lower bounds on the amount of coverage needed to achieve decisiveness;(3) devise an exact algorithm for decisiveness;(4) develop problem reduction rules, and use them to obtain efficient algorithms for inputs with few loci;and (5) devise Boolean satisfiability (SAT) and integer linear programming formulations (ILP) of decisiveness that allow us to analyze data sets that arise in practice. For data sets that are not decisive, we use our SATand ILP formulations to obtain decisive subsets of the data.

关键词： Phylogeny partitioning algorithms Color Terminology Steel Software Reliability Phylogenetic tree taxon coverage algorithms no-rainbow hypergraph coloring integer linear programming satisfiability

来源：评论

学校读者我要写书评

暂无评论

PARALLEL algorithms FOR PLANAR GRAPH ISOMORPHISM AND RELATED PROBLEMS

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS 1988年第3期35卷 304-311页

作者： JAJA, J KOSARAJU, SR JOHNS HOPKINS UNIV DEPT ELECT ENGN & COMP SCIBALTIMOREMD 21218

Parallel algorithms for planar graph isomorphism and several related problems are presented. Two models of parallel computation are considered: the CREW-PRAM model and the two-dimensional array of processors. The results include O( square root n)-time mesh algorithms for finding a good separating cycle and the triconnected components of a planar graph, and for solving the single-function coarsest partitioning problem.< >

关键词： Parallel algorithms Computational modeling partitioning algorithms Tree graphs Concurrent computing Testing Automata Context modeling Graph theory Phase change random access memory

来源：评论

学校读者我要写书评

暂无评论

Fuzzy Community Detection Based on Elite Symbiotic Organisms Search and Node Neighborhood Information

引用

IEEE TRANSACTIONS ON FUZZY SYSTEMS 2022年第7期30卷 2500-2514页

作者： Xiao, Jing Wang, Yan-Jiao Xu, Xiao-Ke Dalian Minzu Univ Coll Informat & Commun Engn Dalian 116600 Peoples R China Northeast Elect Power Univ Sch Elect Engn Jilin 132012 Jilin Peoples R China

In the last decade, fuzzy community detection has received increasing attention, since it cannot only uncover the community structure of a network, but also reflect the membership degrees of each node to multiple communities. Although some pioneers proposed a few algorithms for finding fuzzy communities, there is still room for further improvement in the quality of detected fuzzy communities. In this study, a metaheuristic-based modularity optimization algorithm, named symbiotic organisms search fuzzy community detection (SOSFCD) is proposed. On the one hand, an improved bioinspired metaheuristic algorithm, elite symbiotic organisms search, is designed as optimization strategy to improve the global convergence of fuzzy modularity optimization. On the other hand, a neighbor-based membership modification operation is proposed to intensify exploitation ability and speed up convergence, by efficiently utilizing local information (i.e., node neighborhood) of network topology. Experimental results on both of synthetic and real-life networks with different scales and characteristics show that SOSFCD can find max-modularity fuzzy partitions and coverings, and outperforms many state-of-the-art algorithms in terms of accuracy and stability.

关键词： partitioning algorithms Optimization Symbiosis Organisms Q measurement Convergence Tools Fuzzy community detection fuzzy covering fuzzy partition modularity optimization symbiotic organisms search (SOS)

来源：评论

学校读者我要写书评

暂无评论

Compositional Verification Using Geodesic Distance via Assume-Guarantee Reasoning

引用

IEEE ACCESS 2024年 12卷 92612-92621页

作者： Liu, Xiaoyan Henan Polytech Univ Sch Software Jiaozuo 454000 Peoples R China

Assume-guarantee reasoning is indeed an effective compositional verification technique that can help mitigate the state explosion problem in model checking. However, the biggest challenge of applying assume-guarantee reasoning is how to best decompose a system. This paper presents a novel compositional verification frame based on geodesic distance. The proposed algorithm introduces novel techniques to decompose system components into groups. The algorithm's effectiveness and efficiency are evaluated through a comparative analysis with four state-of-the-art methods commonly used in the field. The results of the comparison consistently demonstrate that the proposed algorithm outperforms the state-of-the-art methods. This implies that the new algorithm exhibits superior performance in terms of decomposition quality and verification efficiency.

关键词： partitioning algorithms Model checking Clustering algorithms Analytical models Cognition Logic WebRTC compositional verification assume-guarantee reasoning group technology combinatorial testing geodesic distance partition

来源：评论

学校读者我要写书评

暂无评论

Online Anomaly Detection With Bandwidth Optimized Hierarchical Kernel Density Estimators

引用

IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS 2021年第9期32卷 4253-4266页

作者： Kerpicci, Mine Ozkan, Huseyin Kozat, Suleyman Serdar Georgia Inst Technol Sch Elect & Comp Engn Atlanta GA 30332 USA Sabanci Univ Fac Engn & Nat Sci TR-34956 Istanbul Turkey Bilkent Univ Dept Elect & Elect Engn TR-06800 Ankara Turkey

We propose a novel unsupervised anomaly detection algorithm that can work for sequential data from any complex distribution in a truly online framework with mathematically proven strong performance guarantees. First, a partitioning tree is constructed to generate a doubly exponentially large hierarchical class of observation space partitions, and every partition region trains an online kernel density estimator (KDE) with its own unique dynamical bandwidth. At each time, the proposed algorithm optimally combines the class estimators to sequentially produce the final density estimation. We mathematically prove that the proposed algorithm learns the optimal partition with kernel bandwidths that are optimized in both region-specific and time-varying manner. The estimated density is then compared with a data-adaptive threshold to detect anomalies. Overall, the computational complexity is only linear in both the tree depth and data length. In our experiments, we observe significant improvements in anomaly detection accuracy compared with the state-of-the-art techniques.

关键词： Bandwidth Anomaly detection Kernel Estimation partitioning algorithms Data models Real-time systems Anomaly detection bandwidth selection kernel density estimation online regret analysis

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Representations for Testing Independence: Modeling, Analysis and Connection With Mutual Information Estimation

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 158-173页

作者： Gonzalez, Mauricio E. Silva, Jorge F. Videla, Miguel Orchard, Marcos E. Univ Chile Dept Elect Engn Informat & Decis Syst Grp Santiago 4123 Chile

This work addresses testing the independence of two continuous and finite-dimensional random variables from the design of a data-driven partition. The empirical log-likelihood statistic is adopted to approximate the sufficient statistics of an oracle test against independence (that knows the two hypotheses). It is shown that approximating the sufficient statistics of the oracle test offers a learning criterion for designing a data-driven partition that connects with the problem of mutual information estimation. Applying these ideas in the context of a data-dependent tree-structured partition (TSP), we derive conditions on the TSP's parameters to achieve a strongly consistent distribution-free test of independence over the family of probabilities equipped with a density. Complementing this result, we present finite-length results that show our TSP scheme's capacity to detect the scenario of independence structurally with the data-driven partition as well as new sampling complexity bounds for this detection. Finally, some experimental analyses provide evidence regarding our scheme's advantage for testing independence compared with some strategies that do not use data-driven representations.

关键词： Testing Mutual information Estimation Task analysis Complexity theory Random variables partitioning algorithms Independence testing non-parametric learning learning representations data-driven partitions tree-structure partitions mutual information consistency finite-length analysis

来源：评论

学校读者我要写书评

暂无评论

A HIERARCHICAL GLOBAL WIRING ALGORITHM FOR CUSTOM CHIP DESIGN

引用

IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS 1987年第4期6卷 518-533页

作者： LUK, WK SIPALA, P TAMMINEN, M TANG, D WOO, LS WONG, CK IBM Thomas J. Watson Research Center Yorktown Heights NY USA Dipartimento di Elettrotecnica Elettronica e Informatica Universita degli Studi di Trieste Trieste Italy Helsinki University of Technology Laboratory of information Processing Science Espoo Finland

We present a global wiring algorithm used in a top-down physical design environment, i.e., macros are laid out after global wiring is done, and wires are allowed to pass through macros (the wiring-through model). The floorplan of the chip is in the form of a slicing structure. The algorithm is based on a hierarchical scheme. The final result is obtained through a series of refinement as the problem is recursively decomposed into a set of small-sized problems and then solved efficiently. The worst-case run-time for an arbitrary slicing tree (totally skewed) is O(M /sup 2/ N). When the floorplan is represented by a balanced slicing tree, the run-time of the overall algorithm is O(MN), where M is the number of macros and N the number of nets. The algorithm has been implemented in the C language and is used for chip designs. Experiments on both real and randomly generated designs show that the hierarchical router performs equally well as a flat global router in terms of wire length and wireability handling, but much faster in run-time (at least 10 times for an example with 100 macros and 1000 nets, and the gap being even larger for bigger-size problems).

关键词： Wiring Chip scale packaging Runtime Logic design Algorithm design and analysis Wires partitioning algorithms Very large scale integration Large scale integration Circuits

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：