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

Conference on VLSI Circuits and Systems IV

作者： Matev, Vladimir de la Torre, Eduardo Riesgo, Teresa Univ Politecn Madrid CEI Dept Automat Ingn Elect & Informat Ind E-28006 Madrid Spain

ISBN: (纸本)9780819476371

In this paper we propose a method for run time profiling of applications on instruction level by analysis of loops. Instead of looking for coarse grain blocks we concentrate on fine grain but still costly blocks in terms of execution times. Most code profiling is done in software by introducing code into the application under profile witch has time overhead, while in this work data for the position of a loop, loop body, size and number of executions is stored and analysed using a small non intrusive hardware block. The paper describes the system mapping to runtime reconfigurable systems. The fine grain code detector block synthesis results and its functionality verification are also presented in the paper. To demonstrate the concept MediaBench multimedia benchmark running on the chosen development platform is used.

关键词： System on Chip algorithm acceleration FPGAs Profiling Reconfigurable Systems Partial reconfiguration

来源：评论

学校读者我要写书评

暂无评论

Parallel attribute reduction algorithm for unlabeled data based on fuzzy discernibility matrix and soft deletion behavior

引用

INFORMATION SCIENCES 2025年 689卷

作者： Wen, Haotong Xu, Yi Liang, Meishe Anhui Univ Sch Comp Sci & Technol Hefei 230601 Peoples R China Shijiazhuang Tiedao Univ Dept Math & Phys Shijiazhuang Peoples R China

In attribute reduction algorithms, discernibility matrix-based methods and heuristic-based methods are two highly effective approaches. While the prevailing view is that heuristic algorithms are faster than discernibility matrix-based methods, the rise of GPUs and other matrix-based parallel computing devices has enabled discernibility matrix reduction methods to achieve faster computation speeds by leveraging their matrix characteristics. However, few discernibility matrix- based methods can directly adapt to GPU devices, and for unlabeled data, existing discernibility matrix-based methods fail to fully utilize the fuzzy information, resulting in unsatisfactory outcomes. In this paper, we propose a parallel attribute reduction algorithm based on fuzzy discernibility matrices and soft deletion behavior. To achieve parallel computing, we transform the traditional 3-dimensional discernibility matrix into a 2-dimensional matrix. To maximize the use of fuzzy discernibility information, we introduce a fuzzy deletion function, which can effectively update the discernibility matrix by incorporating fuzzy discernibility information. Finally, we propose a stopping mechanism for the algorithm, enabling it to select fewer attributes under appropriate conditions. Experiments demonstrate that our algorithm significantly increases computation speed compared to traditional heuristic algorithms and reduces the number of attributes while maintaining and enhancing the effectiveness of downstream tasks.

关键词： Fuzzy rough set Unsupervised attribute reduction Discernibility matrices algorithm acceleration

来源：评论

学校读者我要写书评

暂无评论

Image restoration in astronomy -: A Bayesian perspective

引用

IEEE SIGNAL PROCESSING MAGAZINE 2001年第2期18卷 11-29页

作者： Molina, R Núñez, J Cortijo, FJ Mateos, J University of Granada Department of Computer Science and Artificial Intelligence University of Granada

When preparing an article on image restoration in astronomy, it is obvious that some topics have to be dropped to keep the work at reasonable length. We have decided to concentrate on image and noise models and on the algorithms to find the restoration. Topics like parameter estimation and stopping rules are also commented on. We start by describing the Bayesian paradigm and then proceed to study the noise and blur models used by the astronomical community. Then the prior models used to restore astronomical images are examined. We describe the algorithms used to find the restoration for the most common combinations of degradation and image models. Then we comment on important issues such as acceleration of algorithms, stopping rules, and parameter estimation. We also comment on the huge amount of information available to, and made available by, the astronomical community

关键词： Bayes methods astronomy computing image restoration noise reviews Bayesian paradigm algorithm acceleration astronomical images astronomy blur models image models noise models parameter estimation stopping rules ASTRONOMY image restoration technique Parameter estimation Graphical models Bayes methods Noise models

来源：评论

学校读者我要写书评

暂无评论

Fast Power System Cascading Failure Path Searching With High Wind Power Penetration

引用

IEEE TRANSACTIONS ON SUSTAINABLE ENERGY 2020年第4期11卷 2274-2283页

作者： Liu, Yuxiao Wang, Yi Yong, Pei Zhang, Ning Kang, Chongqing Lu, Dan Tsinghua Univ Dept Elect Engn Beijing 100084 Peoples R China Swiss Fed Inst Technol Power Syst Lab CH-8092 Zurich Switzerland State Grid Henan Econ Res Inst Zhengzhou 450052 Peoples R China

Cascading failures have become a severe threat to interconnected modern power systems. The ultrahigh complexity of the interconnected networks is the main challenge toward the understanding and management of cascading failures. In addition, high penetration of wind power integration introduces large uncertainties and further complicates the problem into a massive scenario simulation problem. This article proposes a framework that enables a fast cascading path searching under high penetration of wind power. In addition, we ease the computational burden by formulating the cascading path searching problem into a Markov chain searching problem and further use a dictionary-based technique to accelerate the calculations. In detail, we first generate massive wind generation and load scenarios. Then, we utilize the Markov search strategy to decouple the problem into a large number of DC power flow (DCPF) and DC optimal power flow (DCOPF) problems. The major time-consuming part, the DCOPF and the DCPF problems, is accelerated by the dynamic construction of a line status dictionary (LSD). The information in the LSD can significantly ease the computation burden of the following DCPF and DCOPF problems. The proposed method is proven to be effective by a case study of the IEEE RTS-79 test system and an empirical study of China's Henan Province power system.

关键词： Power system faults Power system protection Wind power generation Markov processes Computational modeling acceleration Cascading failure power systems algorithm acceleration wind power optimal power flow Markov chain searching

来源：评论

学校读者我要写书评

暂无评论

Distributed Nash Equilibrium Learning for Average Aggregative Games: Harnessing Smoothness to Accelerate the algorithm

引用

IEEE SYSTEMS JOURNAL 2023年第3期17卷 4855-4865页

作者： Pan, Wei Xu, Xinli Lu, Yu Zhang, Weidong Shanghai Jiao Tong Univ Dept Automat Shanghai 200240 Peoples R China Univ Shanghai Sci & Technol Sch Mech Engn Shanghai 200093 Peoples R China Nanjing Univ Sci & Technol Sch Energy & Power Engn Nanjing 210094 Peoples R China

Convergence speed is one of the most important fea-tures of an equilibrium-seeking algorithm. In this article, we ad -dress the problem of algorithm acceleration for distributed Nash equilibrium (NE) learning in networked average aggregative games with partial decision information. Harnessing the smoothness of cost functions, we propose a novel accelerated NE learning algo-rithm by integrating a momentum term into a gradient descent step. We prove that the distributed algorithm converges to the exact Nash equilibrium with constant stepsize by bounding four key consensus error terms. When cost functions are strongly convex and interac-tion graph is undirected and connected, the proposed algorithm enjoys a linear convergence rate O (?(M (0))(k)), ?(M (0)) is the spectral radius of a parameterized matrix M (0) (0 is stepsize, k is iterations). Simulation results under two different communication graphs show the momentum term does accelerate the algorithm, the iteration numbers of convergence to specific relative error are significantly reduced, up to 80% when the stepsize is small and the graph connectivity is high.

关键词： Games Cost function Aggregates Convergence Costs Heuristic algorithms Graph theory algorithm acceleration average aggregative games multiagent system Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Accelerating DES and AES algorithms for a Heterogeneous Many-core Processor

引用

INTERNATIONAL JOURNAL OF PARALLEL PROGRAMMING 2021年第3期49卷 463-486页

作者： Xing, Biao Wang, DanDan Yang, Yongquan Wei, Zhiqiang Wu, Jiajing He, Cuihua Ocean Univ China Coll Informat Sci & Engn Qingdao 266100 Peoples R China Pilot Natl Lab Marine Sci & Technol Qingdao Qingdao 266200 Peoples R China

Data security is the focus of information security. As a primary method, file encryption is adopted for ensuring data security. Encryption algorithms created to meet the Data Encryption Standard (DES) and the Advanced Encryption Standard (AES) are widely used in a variety of systems. These algorithms are computationally highly complex, thus, the efficiency of encrypting or decrypting large files can be drastically reduced. To this end, we propose an optimized algorithm that efficiently encrypts and decrypts large files by parallelizing processing tasks on a single heterogeneous many-core processor in the Sunway TaihuLight computer system. Firstly, we convert the serial DES and AES programs to our experimental platform. Then we implement a task assignment strategy to test the converted algorithms. Finally, in order to optimize parallelized algorithms and improve data transmission performance, we apply the master-slave communication optimization, the three-stage parallel pipeline, and vectorization. Extensive experiments demonstrate that our optimized algorithm is faster than the state-of-the-art open-source implementations of DES and AES. Compared with the serial processing algorithms, our parallelized DES and AES perform nearly 40 times and 72 times faster, respectively. The work described in this paper leverages existing methods and provides a sound basis for the direction of future research in data encryption.

关键词： algorithm acceleration Parallelization and optimization DES and AES Three-stage pipeline and vectorization SW26010 processor

来源：评论

学校读者我要写书评

暂无评论

Fast Adaptive Minorization-Maximization Procedure for Beamforming Design of Downlink NOMA Systems

引用

IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY 2020年第7期69卷 8023-8027页

作者： Lyons, Oisin Hanif, Muhammad Fainan Juntti, Markku Le-Nam Tran Univ Coll Dublin Sch Elect & Elect Engn Dublin D04 V1W8 Ireland Univ Lahore Dept Elect Engn Lahore 55150 Pakistan Univ Oulu Ctr Wireless Commun Oulu 90014 Finland

We develop a novel technique to accelerate minorization-maximization (MM) procedure for the non-orthogonal multiple access (NOMA) weighted sum rate maximization problem. Specifically, we exploit the Lipschitz continuity of the gradient of the objective function to adaptively update the MM algorithm. With fewer additional analysis variables and low complexity second-order cone program (SOCP) to solve in each iteration of the MM algorithm, the proposed approach converges quickly at a small computational cost. By numerical simulation results, our algorithm is shown to greatly outperform known solutions in terms of achieved sum rates and computational complexity.

关键词： NOMA Array signal processing Downlink 5G mobile communication Linear programming MISO communication acceleration 5G NOMA majorization-minimization algorithm acceleration

来源：评论

学校读者我要写书评

暂无评论

An efficient approach for solving the HP protein folding problem based on UEGO

引用

JOURNAL OF MATHEMATICAL CHEMISTRY 2015年第3期53卷 794-806页

作者： Garcia-Martinez, J. M. Garzon, E. M. Cecilia, J. M. Perez-Sanchez, H. Ortigosa, P. M. Univ Almeria Dept Informat CeiA3 Almeria Spain Univ Catolica San Antonio Murcia UCAM Dept Comp Sci Bioinformat & High Performance Comp Res Grp BIO H Murcia Spain

This work applies the methodology of the Universal Evolutionary Global Optimization, UEGO, to solve the protein structure optimization problem based on the HP model. The UEGO algorithm was initially designed to solve problems whose solutions were codified as real vectors. However, in this work the HP protein folding solutions have been defined as means of conformations encoded by relative coordinates. Consequently several main concepts in UEGO have been re-defined, i.e. the representation of a solution, the distance concept, the computation of a middle point, etc. In addition, a new efficient local optimizer has been designed based on the characteristics of the protein model. This work develops the adaptation and implementation of UEGO to the HP model and analyzes the UEGO solutions of HP protein folding for different 3D problems. Finally, obtained HP solutions are converted into all-atom models so that comparison with real proteins can be carried out, and a good agreement is obtained for small size proteins.

关键词： Protein folding Evolutionary algorithm HP model Multiscale modeling algorithm acceleration

来源：评论

学校读者我要写书评

暂无评论

Accelerated Variant of an EMD-Based-R Peaks Detection algorithm Involving FFT-Based Time-Domain Down-Sampling and Up-Sampling

引用

JOURNAL OF BIOMIMETICS BIOMATERIALS AND BIOMEDICAL ENGINEERING 2023年 61卷 131-141页

作者： Harkat, Amel Benzid, Redha Noureddine, Athamena Univ Batna 2 Elect Dept Lab Adv Automat & Anal Syst LAAAS Batna 05000 Algeria Univ Batna 2 Elect Dept Batna 05000 Algeria

As most of developed empirical mode decomposition (EMD) based R-peaks detection algorithms consume a considerable time of calculation caused by the large length of the input ECG signal, the design of a new technique that allows the acceleration of such methods becomes necessary. Accordingly, a new variant of an EMD-based strategy for R-peaks localization is presented. The new accelerated variant is constituted of three essential parts. The first step is the length reduction of the input signal by means of the truncation in the Fast Fourier Transform (FFT) domain followed by the application of the inverse FFT guaranteeing a suitable time-domain down-sampling. Consequently, the new input signal of a reduced length preserves all medical information contained initially in the original lengthy signal. The second part is dedicated to identify the QRS complex using EMD-based R-peaks detection. This latter comprises a low-pass filter, Empirical Mode Decomposition (EMD) and the Hilbert transform, Finally, the third phase is the time-domain up-sampling using the FFT, the zeropadding and the Inverse Fast Fourier Transform (IFFT) to obtain a resulting processed signal which has the same length as the original signal. Next, as a post-processing step, final R-peaks refined localization is achieved. It is noticeable that the new variant ensures same results, in term of accuracy, as the standard method, however, a significant speed-up ratio of 6.95:1 is reported. Additionally, to more prove the effectiveness of the suggested strategy, it has been applied to accelerate two other efficient algorithms and satisfactory speed up ratios of, 7.20:1 and 4.23:1, respectively have been reached.

关键词： algorithm acceleration ECG Signal Empirical Mode Decomposition Fast Fourier Transform FFT Based Time-Domain Down-Sampling FFT-Based Time-Domain Up-Sampling R-Peaks Detection

来源：评论

学校读者我要写书评

暂无评论

CONSTRUCTION OF OPTIMAL algorithmS FOR MASS COMPUTATIONS IN DIGITAL FILTERING PROBLEMS

引用

CYBERNETICS AND SYSTEMS ANALYSIS 2008年第4期44卷 465-476页

作者： Anisimov, A. V. Yadzhak, M. S. Natl Taras Shevchenko Univ Kiev Ukraine NAS Ukraine Inst Appl Problems Mech & Math Lvov Ukraine

Theoretical results are reviewed that are concerned with the construction of speed-optimal parallel-pipeline algorithms for mass calculations in solving filtering problems. The optimality is proved in the corresponding classes of algorithms equivalent in terms of information graphs. The effectiveness of using the developed algorithmic constructions rfiltering problems is investigated.

关键词： optimal parallel-conveyor algorithm,filtering problem multistage cascade digital filtering quasisystolic structure bounded parallelism algorithm acceleration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：