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

Large scale Hartree-Fock calculations. compression of two-electron integrals and their indices

JOURNAL OF MOLECULAR STRUCTURE-THEOCHEM 2002年第1期592卷 115-121页

作者： Mitin, AV Univ Arkansas Dept Chem & Biochem Fayetteville AR 72701 USA

The new efficient algorithm for a compression of the two-electron repulsion integrals and their indices is proposed and employed in the conventional SCF algorithm of the Hartree-Fock method. Results of numerical investigations of this algorithm obtained in the molecular Hartree-Fock calculations including the largest known one's are presented and discussed. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： Hartree-Fock method compression of two-electron integrals and their indices compression algorithm

来源：评论

学校读者我要写书评

暂无评论

Image compression based on Walsh spectra 13

Image compression based on Walsh spectra

引用

13th International ELEKTRO Conference (ELEKTRO)

作者： Kostrov, Boris, V Babaev, Sergey, I Bastrychkin, Alexandr Baranchikov, Aleksey, I Kolesenkov, Aleksandr N. Ryazan State Radio Engn Univ Elect Comp Dept Ryazan Russia Ryazan State Radio Engn Univ Space Technol Dept Ryazan Russia

This paper deals with images compression to store and transmit using information systems. The algorithm proposed allows to eliminate the information redundancy of images depending on the purpose of the system as a who... 详细信息

ISBN: (纸本)9781728175423

关键词： image compression compression algorithm binary images Walsh function quasi-two-dimensional spectrum transmission protocols restored images quality

来源：评论

学校读者我要写书评

暂无评论

Image compression and Restoration in Embedded Computing Systems 6

Image Compression and Restoration in Embedded Computing Syst...

引用

6th Mediterranean Conference on Embedded Computing (MECO)

作者： Kostrov, Boris V. Svirina, Anastasiya G. Babaev, Sergey I. Bastrychkin, Alexander Ruchkin, Vladimir Ryazan State Radio Engn Univ Elect Comp Dept Ryazan Russia Ryazan State Univ Engn Chair Ryazan Russia

ISBN: (纸本)9781509067428

The present paper has mentioned theoretical and practical results of application of an instrument of orthogonal transformations based on basis Walsh functions for information compression under transmission of aerospace images through the communication channel into embedded cyber physical systems. Parseval equality has been shown for quasi -two-dimensional representation of two-dimensional signals. Quality of the image restoration has been evaluated depending on the compression ratio. Protocols for transmission of the formed signal have been suggested. Examples and evaluations of restored images have been indicated.

关键词： aerospace images embedded cyber physical systems compression algorithm Walsh function transmission protocols quality of restored images

来源：评论

学校读者我要写书评

暂无评论

FWC: FittingWeight compression Method for Reducing Communication Traffic for Federated Learning 41

FWC: FittingWeight Compression Method for Reducing Communica...

引用

41st International Symposium on Reliable Distributed Systems (SRDS)

作者： Jiang, Hao Yan, Kedong Huang, Chanying Li, Qianmu Xiao, Shan Nanjing Univ Sci & Technol Sch Comp Sci & Engn Nanjing Peoples R China Fiberhome Commun Technol Co Ltd Wuhan Peoples R China

ISBN: (纸本)9781665497534

Federated learning enables local nodes to train a global model together by uploading only training updates to the parameter server without exchanging private data. However, as the complexity of the federated learning task increases, the communication volume of the training process becomes extremely large, hence the huge communication traffic becomes a serious bottleneck in current federated learning application. Existing methods reduce communication overhead from two aspects, the number of communications and the traffic per communication. But these methods usually lead to more consumption of computing resources or a decrease in model accuracy. To handle these problems, this paper proposes a data fitting based weight compression algorithm, FWC, which includes four sequential stages: sparsification, polynomial fitting, encoding, reconstruction and two mechanism: warm-up and accumulation. In particular, the warm-up mechanism can well address the problem of slow convergence in early training period. Experimental results on models with different scales show that FWC is able to provide more than 600x traffic compression at the cost of only millisecond-level computational time cost and less than 1% accuracy loss.

关键词： machine learning federated learning communication compression algorithm federated average algorithm

来源：评论

学校读者我要写书评

暂无评论

Musical beauty and information compression: Complex to the ear but simple to the mind?

引用

BMC Research Notes 2011年第1期4卷 1-9页

作者： Hudson, Nicholas J. Computational and Systems Biology CSIRO Livestock Industries St. Lucia. Brisbane QLD 4067 306 Carmody Road Australia

Background: The biological origin of music, its universal appeal across human cultures and the cause of its beauty remain mysteries. For example, why is Ludwig Van Beethoven considered a musical genius but Kylie Minogue is not? Possible answers to these questions will be framed in the context of Information Theory. Presentation of the Hypothesis. The entire life-long sensory data stream of a human is enormous. The adaptive solution to this problem of scale is information compression, thought to have evolved to better handle, interpret and store sensory data. In modern humans highly sophisticated information compression is clearly manifest in philosophical, mathematical and scientific insights. For example, the Laws of Physics explain apparently complex observations with simple rules. Deep cognitive insights are reported as intrinsically satisfying, implying that at some point in evolution, the practice of successful information compression became linked to the physiological reward system. I hypothesise that the establishment of this "compression and pleasure" connection paved the way for musical appreciation, which subsequently became free (perhaps even inevitable) to emerge once audio compression had become intrinsically pleasurable in its own right. Testing the Hypothesis. For a range of compositions, empirically determine the relationship between the listener's pleasure and "lossless" audio compression. I hypothesise that enduring musical masterpieces will possess an interesting objective property: despite apparent complexity, they will also exhibit high compressibility. Implications of the Hypothesis. Artistic masterpieces and deep Scientific insights share the common process of data compression. Musical appreciation is a parasite on a much deeper information processing capacity. The coalescence of mathematical and musical talent in exceptional individuals has a parsimonious explanation. Musical geniuses are skilled in composing music that appears highly complex

关键词： Data compression Recurrent Neural Network compression algorithm Lossy compression Scientific Insight

来源：评论

学校读者我要写书评

暂无评论

Linearity-based Sensor Data Online compression Methods for Environmental Applications 6

Linearity-based Sensor Data Online Compression Methods for E...

引用

6th Conference on Cloud and Internet of Things (CIoT)

作者： Vaananen, Olli Hamalainen, Timo JAMK Univ Appl Sci Sch Technol Jyvaskyla Finland Univ Jyvaskyla Fac Informat Technol Jyvaskyla Finland

ISBN: (纸本)9798350396690

Environmental monitoring is a typical Internet of Things (IoT) application. Environmental monitoring plays a significant role, for example, in smart farming and smart city applications. Environmental magnitudes are usually measured using wireless sensor nodes, which are often battery-powered, and the number of sensing nodes can be large. One effective method for reducing the energy consumption of a sensor node is to use data compression to reduce the amount of data required for transmission via a wireless connection. Compressing the sensor data means fewer transmission periods, and thus, lower energy consumption. compression methods should be effective for compressing environmental magnitudes and be computationally light to be suitable for constrained sensor nodes. A compression algorithm should be able to compress an online data stream. In this paper, we review some compression algorithms suitable for environmental monitoring and present two new versions of those algorithms. The algorithms were evaluated, tested, and compared. The main parameters used for the comparisons were compression ratio, root mean square error, and inherent latency. The simulation results obtained using real datasets demonstrate that simple linearity-based compression algorithms are effective and suitable for compressing environmental data. Two new compression algorithm versions proved to be effective for compressing sensor data with reasonable compression quality and predictable inherent latency.

关键词： compression algorithm data compression edge computing Internet of Things sensor data

来源：评论

学校读者我要写书评

暂无评论

A compression Program for Chemical, Biological, and Nanotechnologies

A Compression Program for Chemical, Biological, and Nanotech...

引用

Conference on Reporters, Markers, Dyes, Nanoparticles, and Molecular Probes for Biomedical Applications III

作者： Tice, Bradley T. Adv Human Design Turlock CA 95381 USA

ISBN: (纸本)9780819484475

This paper will introduce a compression algorithm that will use based number systems beyond the fundamental standard of the traditional binary, or radix, based system in use today. A greater level of compression is notes in these radix based number systems when compared to the radix 2 base as applied to a sequential strings of various information. The application of this compression algorithm to both random and non-random sequences for compression will be reviewed in this paper. The natural sciences and engineering applications will be areas covered in this paper.

关键词： compression algorithm Chemistry Biology Nanotechnology

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Road-Network-Constrained Trajectory compression Methods 22

A Comparison of Road-Network-Constrained Trajectory Compress...

引用

22nd IEEE International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ji, Yudian Liu, Hao Liu, Xiaoying Ding, Ye Luo, Wuman Hong Kong Univ Sci & Technol Hong Kong Hong Kong Peoples R China Univ Macau Zhuhai Peoples R China

ISBN: (纸本)9781509044573

The popularity of location-acquisition devices has led to a rapid increase in the amount of trajectory data collected. The large volume of trajectory data causes the difficulties of storing and processing the data. Various trajectory compression methods are therefore proposed to deal with these problems. In this paper, we overview the existing road-network-constrained trajectory compression methods and propose a novel classification based on the features leveraged by them. We also propose new methods that fill in the research blanks indicated by the classification. We conduct a thorough comparison among the existing and new road-network-constrained trajectory compression methods. The performances of the methods are studied via various metrics on real-world dataset. We make new discoveries regarding the performances and the scalability of existing methods, and provide guidelines of road-network-constrained trajectory compression for various scenarios.

关键词： Trajectory compression road network compression algorithm moving object database spatio-temporal data

来源：评论

学校读者我要写书评

暂无评论

Real-Time Data compression for Thermal-controlled Three-Dimensional DRAM Systems 4

Real-Time Data Compression for Thermal-controlled Three-Dime...

引用

IEEE 4th Global Conference on Consumer Electronics GCCE

作者： Lin, Shu-Yen Lin, Jin-Yi Chang, Kai-Wei Huang, Cheng-Hung Yuan Ze Univ Dept Elect Engn Jhongli 32003 Taiwan Yuan Ze Univ Innovat Ctr Big Data & Digital Convergence Jhongli 32003 Taiwan

ISBN: (纸本)9781479987511

In this work, we propose a half-size frequent pattern compression algorithm (HSFPC) for the 3D DRAM system. In the 3D DRAM system, the access data compressed by HSFPC can achieve better compression rate than by the traditional compression method, frequent pattern compression (FPC). In our experiments, the 3D DRAM system using HSFPC can reduce the peak temperature by 0.5 degrees C similar to 4.5 degrees C compared with the one using FPC.

关键词： 3D DRAM Architecture compression algorithm

来源：评论

学校读者我要写书评

暂无评论

Piecewise compression of large mesh

Piecewise compression of large mesh

引用

Conference on Vision Geometry XIV

作者： Qin, Aihong Xiong, Hua Shi, Jiaoying Liu, Zhen Zhejiang Univ CAD&CG State Key Lab Hangzhou 310027 Peoples R China Shanxi Univ Sch Comp & Informat Technol Taiyuan 030006 Peoples R China

ISBN: (纸本)0819461067

Large and detailed 3D polygon mesh with standard representation results in files of gigantic size. The need for more compact representations and a parallel implementation is clear. But the compressed gigantic mesh applied in parallel rendering to achieve high performance is still an unexplored area. In this work, we present a mesh compression scheme employed in parallel rendering system. It includes two parts: Mesh segmentation and segments compression. Firstly, the multilevel graph partitioning idea is adopted to separate the mesh into large patches with less curvature. Then the large patches are farther partitioned with MeTiS[1] to get small patches with a balanced vertex counts. As the multilevel mesh produced by the feature preserved mesh simplification procedure, our segmentation algorithm takes both the segment's flatness and balanced vertex counts into account. Secondly, each patch is compressed separately. The vertices in the patch are classified into two distinguish types, namely boundary vertex and inner vertex, different compression algorithm are applied to them. The boundary vertexes are compressed with a novel compression algorithm PMC proposed in this work. To avoid decoding the whole boundary during every frame rendering, the boundary vertexes are compressed piecewise. The successive boundary edges shared by the same patches can act as a piece element when it is compressed. During sorting only the encoded boundary in the view-frustum needs to be loaded and decompressed. Experiments show that the encoded mesh can be partitioned in compression-domain in parallel rendering system. It reduces the communication bandwidth requirement significantly.

关键词： mesh compression compression algorithm parallel rendering mesh segmentation large mesh coding sorting triangle mesh simplification feature preserved

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：