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

IEEE International Conference on Cluster Computing (CLUSTER)

作者： Yang, Annie Mukka, Hari Hesaaraki, Farbod Burtscher, Martin Texas State Univ Dept Comp Sci San Marcos TX 78666 USA

ISBN: (纸本)9781467365987

Due to their high peak performance and energy efficiency, massively parallel accelerators such as GPUs are quickly spreading in high-performance computing, where large amounts of floating-point data are processed, transferred, and stored. Such environments can greatly benefit from data compression if done sufficiently quickly. Unfortunately, most conventional compression algorithms are unsuitable for highly parallel execution. In fact, it is generally unknown how to design good compression algorithms for massively parallel systems. To remedy this situation, we study 138,240 lossless compression algorithms for single- and double-precision floating-point values that are built exclusively from easily parallelizable components. We analyze the best of these algorithms, explain why they compress well, and derive the Massively Parallel Compression (MPC) algorithm from them. This novel algorithm requires almost no internal state, achieves heretofore unreached compression ratios on several data sets, and roughly matches the best CPU-based algorithms in compression ratio while outperforming them by one to two orders of magnitude in throughput.

关键词： Lossless data compression floating-point compression massively parallel architectures algorithm design GPUs

来源：评论

学校读者我要写书评

暂无评论

A New Colour Image Watermarking Technique Using Special Domain 5

A New Colour Image Watermarking Technique Using Special Doma...

引用

5th International Conference on IT Convergence and Security (ICITCS)

作者： Najih, Abdulmawla M. A. Al-Haddad, Syed Abdul Rahman Ramli, Abd Rahman Hashim, Shaiful Jahari Univ Putra Malaysia Fac Engn Dept Comp & Commun Syst Engn Upm Serdang Selangor Darule Malaysia

ISBN: (纸本)9781467365376

Safeguarding the due rights of multimedia property ownership has recently emerged as a significant challenge to players in this sphere. In response to this issue, a robust colour image watermarking algorithm utilizing a block probability in a spatial domain is recommended by this study. The protection of the watermark is fortified through the employment of the Arnold transform to scramble watermark pixels. Decomposition of the cover image into Red, Green, and Blue channels is executed and the green channel is favoured for the embedding procedure. The reorganization of the scrambled watermark is achieved with the utilization of sequence numbers generated by a secret key. Four embedding's of the encoded watermark are carried out at separate points in the green channel of the colour image. The embedding of all the bits of the binary encrypted watermark is realized by regulating the strengths of a non-overlapping 8X8 sized component of the cover image green channel. The watermark extraction procedure involves a comparison between the strengths of an 8X8 sized component of the initial and watermarked images as well as calculations to uncover the likelihood of recognizing (0 or 1). The algorithm design was deemed invulnerable and exhibited robustness when confronted with a substantial number of image processing onslaughts.

关键词： Watermarking color image algorithm design spatial domain Drill bits point of separation green

来源：评论

学校读者我要写书评

暂无评论

A problem reduction based approach to discrete optimization algorithm design

引用

COMPUTING 2010年第1-2期88卷 31-54页

作者： Zheng, Yujun Xue, Jinyun Jiangxi Normal Univ Prov Key Lab High Performance Comp Nanchang 330023 Peoples R China Chinese Acad Sci Inst Software Beijing 100080 Peoples R China

The paper presents a novel approach to formal algorithm design for a typical class of discrete optimization problems. Using a concise set of program calculation rules, our approach reduces a problem into subproblems with less complexity based on function decompositions, constructs the problem reduction graph that describes the recurrence relations between the problem and subproblems, from which a provably correct algorithm can be mechanically derived. Our approach covers a large variety of algorithms and bridges the relationship between conventional methods for designing efficient algorithms (including dynamic programming and greedy) and some effective methods for coping with intractability (including approximation and parameterization).

关键词： Discrete optimization Program calculation Problem reduction graph (PRG) algorithm design

来源：评论

学校读者我要写书评

暂无评论

Sum-of-Squares Lower Bounds for Planted Clique 15

Sum-of-Squares Lower Bounds for Planted Clique

引用

47th Annual ACM Symposium on Theory of Computing (STOC) held as part of the Federated Computing Research Conference

作者： Meka, Raghu Potechin, Aaron Wigderson, Avi Univ Calif Los Angeles Los Angeles CA 90024 USA MIT Cambridge MA 02139 USA Inst Adv Study Princeton NJ 08540 USA

ISBN: (纸本)9781450335362

Finding cliques in random graphs and the closely related "planted" clique variant, where a clique of size k is planted in a random G(n, 1/2) graph, have been the focus of substantial study in algorithm design. Despite much effort, the best known polynomial-time algorithms only solve the problem for k = Theta(root n). In this paper we study the complexity of the planted clique problem under algorithms from the Sum-Of-Squares hierarchy. We prove the first average case lower bound for this model: for almost all graphs in G(n, 1/2), r rounds of the SOS hierarchy cannot find a planted k-clique unless k >= (root n/log n)(1/r) /C-r. Thus, for any constant number of rounds planted cliques of size n(o(1)) cannot be found by this powerful class of algorithms. This is shown via an integrability gap for the natural formulation of maximum clique problem on random graphs for SOS and Lasserre hierarchies, which in turn follow from degree lower bounds for the Positivestellensatz proof system. We follow the usual recipe for such proofs. First, we introduce a natural "dual certificate" (also known as a "vector solution" or "pseudo-expectation") for the given system of polynomial equations representing the problem for every fixed input graph. Then we show that the matrix associated with this dual certificate is PSD (positive semi-definite) with high probability over the choice of the input *** requires the use of certain tools. One is the theory of association schemes, and in particular the eigenspaces and eigenvalues of the Johnson scheme. Another is a combinatorial method we develop to compute (via traces) norm bounds for certain random matrices whose entries are highly dependent;we hope this method will be useful elsewhere.

关键词： Lower bound algorithms Social Hierarchy Bound round number combinatorial method algorithm design Line graph Random Square root

来源：评论

学校读者我要写书评

暂无评论

Debunking the designs of Contemporary Nature-inspired Computing algorithms: From Moving Particles to Roaming Elephants 4

Debunking the Designs of Contemporary Nature-inspired Comput...

引用

4th International Conference on Future Generation Communication Technologies (FGCT)

作者： Fong, Simon Wong, Raymond Pichappan, Pit Univ Macau Dept Comp & Informat Sci Tapai Macau Sar Peoples R China Univ New S Wales Sch Comp Sci & Engn Sydney NSW 2052 Australia Digital Informat Res Labs Madras Tamil Nadu India

ISBN: (纸本)9781479982677

Nature-inspired computing algorithms (NICs in short) inherit a certain length of history tracing back to Genetic algorithm and Evolutionary Computing in the 50's. Since February 2008 by the birth of Firefly algorithm, NICs started to receive lots of attentions from researchers around the global. Variants and even new species of NIC algorithms boomed like sprouts after rain. While it may be disputable to question the necessity of creations of further new species of such algorithms, it is observed that these algorithms are fundamentally made up of several core components. By exposing these components, the underlying design of a collection of so-called modern NIC optimization algorithms is revealed. In this paper, these core components of constructs from some popular NIC algorithms are reviewed, thereby debunking the myths of novelty and perhaps the excitement of inventing something really "New" by simply branding a NIC search method by merely a name of another living creature. This work also serves as a general guideline and reference for any algorithm architect who wants to create a new NIC algorithm in the future.

关键词： nature-inspired algorithms metaheuristics search methods swarm intelligence algorithm design

来源：评论

学校读者我要写书评

暂无评论

Integrated circuit system design based on “PLC” programming technology and the development of the device which can monitor the concentration of pollutants continuously on-line

Integrated circuit system design based on “PLC” programmin...

引用

2015 5th International Conference on Computer Sciences and Automation Engineering(ICCSAE 2015)

作者： Yuchuan Huang School of North China Electric Power University

In China, the number of the power station increases quickly. According to the information from the Internet, From 2001 to August 2005, State Environmental Protection Administration has approved 472 thermal power projects, and the installed capacity is as much as 344382 *** which, 135 thermal power projects are approved in 2001, the installed capacity is as much as 107590 MW, 207% more than last year;213 thermal power projects are approved From January to August in 2005, the installed capacity is as much as 168546 MW, 420% more than last *** these power stations all come online, Chinese installed capacity will be as much as 5.82 billion KW, 145% more than 2000. In December 2006, the growth of the power stations keeps high *** same month, the whole country’s generating capacity was 2266 billion kilowatt-hour, 15.5% more than last *** the rise of the winter electricity consumption, the generating capacity of power projects increased *** genearating capacity of power projects in December was 10.9% more than last *** January to December in 2006 the whole country’s generating capacity was 23009 billion kilowatt-hour, 15.08% more than last *** January to October in 2007 the whole country’s generating capacity was 21756 billion kilowatt-hour, 16.04% more than last *** generating capacity in August had the largest number, which was 2390 billion kilowatt-hour, 10.19% more than last year.

关键词： Online data acquisition system power serial port communication algorithm design integrated circuit system PLC programming

来源：评论

学校读者我要写书评

暂无评论

Structural health monitoring feature design by genetic programming

引用

SMART MATERIALS AND STRUCTURES 2014年第9期23卷 95002-1-95002-15页

作者： Harvey, Dustin Y. Todd, Michael D. Univ Calif San Diego Dept Struct Engn La Jolla CA 92093 USA

Structural health monitoring (SHM) systems provide real-time damage and performance information for civil, aerospace, and other high-capital or life-safety critical structures. Conventional data processing involves pre-processing and extraction of low-dimensional features from in situ time series measurements. The features are then input to a statistical pattern recognition algorithm to perform the relevant classification or regression task necessary to facilitate decisions by the SHM system. Traditional design of signal processing and feature extraction algorithms can be an expensive and time-consuming process requiring extensive system knowledge and domain expertise. Genetic programming, a heuristic program search method from evolutionary computation, was recently adapted by the authors to perform automated, data-driven design of signal processing and feature extraction algorithms for statistical pattern recognition applications. The proposed method, called Autofead, is particularly suitable to handle the challenges inherent in algorithm design for SHM problems where the manifestation of damage in structural response measurements is often unclear or unknown. Autofead mines a training database of response measurements to discover information-rich features specific to the problem at hand. This study provides experimental validation on three SHM applications including ultrasonic damage detection, bearing damage classification for rotating machinery, and vibration-based structural health monitoring. Performance comparisons with common feature choices for each problem area are provided demonstrating the versatility of Autofead to produce significant algorithm improvements on a wide range of problems.

关键词： feature design structural health monitoring genetic programming algorithm design signal processing pattern recognition

来源：评论

学校读者我要写书评

暂无评论

Towards hardware-driven design of low-energy algorithms for data analysis

引用

SIGMOD RECORD 2014年第4期43卷 15-20页

作者： Zliobaite, Indre Hollmen, Jaakko Koskinen, Lauri Teittinen, Jukka Aalto Univ Espoo Finland Aalto Univ Espoo Finland Univ Turku Technol Reserch Ctr Turku Finland

In the era of "big" data, data analysis algorithms need to be efficient. Traditionally researchers would tackle this problem by considering "small" data algorithms, and investigating how to make them computationally more efficient for big data applications. The main means to achieve computational efficiency would be to revise the necessity and order of subroutines, or to approximate calculations. This paper presents a viewpoint that in order to be able to cope with the new challenges of the growing digital universe, research needs to take a combined view towards data analysis algorithm design and hardware design, and discusses a potential research direction in taking an intreated approach in terms of algorithm design and hardware design. Analyzing how data mining algorithms operate at the elementary operations level can help do design more specialized and dedicated hardware, that, for instance, would be more energy efficient. In turn, understanding hardware design can help to develop more effective algorithms.

关键词： algorithm design subroutine Comment Computational efficiency algorithms Statistical analysis Computer hardware LOW ENERGY computer hardware design data mining Data analysis Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

LSTS: A New Time Synchronization Protocol for Networks with Random Communication Delays

LSTS: A New Time Synchronization Protocol for Networks with ...

引用

IEEE Annual Conference on Decision and Control

作者： Yu-Ping Tian School of Automation Southeast University Nanjing 210096 China

ISBN: (纸本)9781479978878

This paper studies algorithm design and analysis in time synchronization for wireless sensor networks (WSNs) with random bounded communication delays. A least square estimation based time synchronization (LSTS for short) algorithm is proposed. Mathematic modeling of the algorithm is presented. The LSTS algorithm ensures asymptotic convergence of drift estimations and boundedness of global time-synchronization errors under random bounded communication delays, and the global steady-state time synchronization error in the network is affine to the bound of communication delays.

关键词： clock recovery Communication Research Network synchronization error algorithm design and analysis algorithm design delay Random

来源：评论

学校读者我要写书评

暂无评论

design of a multi-hop dynamic consensus algorithm over wireless sensor networks

引用

CONTROL ENGINEERING PRACTICE 2013年第4期21卷 381-394页

作者： Manfredi, Sabato Univ Naples Federico II Dept Elect Engn & Informat Technol I-80125 Naples Italy

In the last few years great attention has been concentrated on the consensus algorithm in a network of agents. A consensus problem in which the agreement value is a distributed estimation of some non-constant quantity of interest is referred to as a dynamic consensus. In practical applications an effective network architecture to support sensing and communication between agents is based on a Wireless Sensor Network (WSN). This paper deals with the design of a fast dynamic consensus algorithm when it is implemented over the WSN. A sufficient stability condition of the dynamic consensus algorithm in the presence of heterogeneous time delays affecting communication through the multi hops of the WSN is introduced and used for consensus algorithm gain design. Moreover, the algorithm implementation by the standard AODV routing protocol is discussed and the best parameter setting to reduce the effect of packet collision phenomena on the performance of the consensus algorithm is indicated. Several trade-offs between network parameter setting, sensor node technology selection and application performance have to be taken into account by the designer in the implementation of the dynamic consensus algorithm. A representative simulation based design procedure is presented to validate through realistic simulation experiments the proposed design approach. (C) 2012 Elsevier Ltd. All rights reserved.

关键词： Dynamic consensus Wireless sensor networks Stability algorithm design AODV protocol Zig-Bee protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：