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

Efficient Weighted Semantic Score Based on the huffman Coding algorithm and Knowledge Bases for Word Sequences Embedding

引用

INTERNATIONAL JOURNAL ON SEMANTIC WEB AND INFORMATION SYSTEMS 2020年第2期16卷 126-142页

作者： Ben-Lhachemi, Nada Nfaoui, El Habib Sidi Mohamed Ben Abdellah Univ Fes Morocco Sidi Mohamed Ben Abdellah Univ LIIAN Lab Fes Morocco

Learning text representation is forming a core for numerous natural language processing applications. Word embedding is a type of text representation that allows words with similar meaning to have similar representation. Word embedding techniques categorize semantic similarities between linguistic items based on their distributional properties in large samples of text data. Although these techniques are very efficient, handling semantic and pragmatics ambiguity with high accuracy is still a challenging research task. In this article, we propose a new feature as a semantic score which handles ambiguities between words. We use external knowledge bases and the huffman Coding algorithm to compute this score that depicts the semantic relatedness between all fragments composing a given text. We combine this feature with word embedding methods to improve text representation. We evaluate our method on a hashtag recommendation system in Twitter where text is noisy and short. The experimental results demonstrate that, compared with state-of-the-art algorithms, our method achieves good results.

关键词： DBpedia huffman algorithm Knowledge Bases Semantic Representation Word Embedding

来源：评论

学校读者我要写书评

暂无评论

Comparison of huffman algorithm and Lempel-Ziv algorithm for Audio, Image and Text Compression 8

Comparison of Huffman Algorithm and Lempel-Ziv Algorithm for...

引用

2015 International Conference on Humanoid, Nanotechnology, Information Technology,Communication and Control, Environment and Management (HNICEM)

作者： Bedruz, Rhen Anjerome Quiros, Ana Riza F. De La Salle Univ Gokongwei Coll Engn Manila Philippines

ISBN: (纸本)9781509003600

In digital communications, it is necessary to compress the data for a faster and more reliable transmission. As such, the data should undergo source encoding, also known as data compression, which is the process by which data are compressed into a fewer number of bits, before transmission. Also, source encoding is essential to limit file sizes for data storage. Two of the most common and most widely used source encoding techniques are the huffman algorithm and Lempel-Ziv algorithm. The main objective of this research is to identify which technique is better in text, image and audio compression applications. The files for each data type were converted into bit streams using an analog-to-digital converter and pulse code modulation. The bit streams underwent compression through both compression algorithms and the efficiency of each algorithm is quantified by measuring their compression ratio for each data type.

关键词： data compression huffman algorithm Lempel-Ziv Coding text file image file audio file

来源：评论

学校读者我要写书评

暂无评论

A cryptographic method to have a secure communication of health care digital data into the cloud

引用

AUTOMATIKA 2024年第1期65卷 373-386页

作者： Selvakumar, K. Lokesh, S. Univ Coll Engn Nagercoil Tamil Nadu India PSG Inst Technol & Appl Res Dept Comp Sci & Engn Coimbatore India

Cloud computing is a technology that holds great promise and has potential to revolutionize the healthcare sector. Many security and privacy issues are brought up by the cloud's centralization of data for both patients and healthcare professionals. There is a need for maintaining secrecy in communication in exchanging medical data between the sender and the receiver, which can be done by cryptography. This article presents a cryptographic algorithm (encryption and decryption) to have a secure communication of digital health care confidential data using DNA cryptography and huffman coding. The interesting property is the cipher size obtained from our algorithm is equal to the size of the cipher obtained from the character set of given data. Security analysis is provided to show the security of data when stored and transmitted to the cloud. The cryptographic requirements, key space analysis, key and plain text sensitivity, sensitive score analysis, sensitivity and specificity, optimal threshold, randomness analysis, uniqueness of implementation, entropies of binary bits, DNA bases, DNA bases with huffman code, huffman encoded binary bits and cloud service provider's risk are analyzed. The method proposed is compared with other cryptographic methods and results that it is more secure and stronger than other methods.

关键词： Cryptography communication huffman algorithm security encryption decryption cryptosystem symmetric key asymmetric key

来源：评论

学校读者我要写书评

暂无评论

Microscan Imager Logging Data Compression Using improved huffman algorithm

Microscan Imager Logging Data Compression Using improved Huf...

引用

9th International Conference on Bio-Inspired Computing - Theories and Applications (BIC-TA)

作者： Zhang, Yanhui Zhang, He Shi, Jun Yin, Xiaozheng Nanjing Univ Sci & Technol Sch Mech Engn Nanjing 210094 Jiangsu Peoples R China Henan Inst Engn Sch Mech Engn Zhengzhou 451191 Peoples R China Zhengzhou Univ Light Ind Sch Elect Engn Zhengzhou 450002 Peoples R China

ISBN: (纸本)9783662450482

The conflict between ever-increasing volumes of microscan imager logging data and limited cable transmission bandwidth intensifying day by day. In this paper, an improved lossless data compression algorithm is proposed. Specifically, according to the characteristics of the micro resistivity imaging logging data, it is proved that Hex character encoding has better compressibility than decimal character encoding. Then, it analyzed that traditional quaternary huffman algorithm does not be fully applicable to microscan imager logging data. Lastly, it employed improved quaternary huffman algorithm for logging data compression so as to enhance the data compression ratio. The experiment comparsions show that, compared to the convention quaternary algorithm and the improved compressed huffman encoding, Both elapsed time and compression ratio are a great improvement.

关键词： Microscan imager logging Logging data Lossless data compression huffman algorithm

来源：评论

学校读者我要写书评

暂无评论

A Dynamic and Parallel Two-Stage Lossless Data Compression Method for Smart Grid

引用

IEEE ACCESS 2023年 11卷 143475-143485页

作者： Wu, Yanxia Xu, Song Xi, Caiping Nie, Pengqiang Jiang, Wei Hashimoto, Seiji Jiangsu Univ Sci & Technol Ocean Coll Zhenjiang 212000 Peoples R China Jiangsu Univ Sci & Technol Coll Automat Zhenjiang 212000 Peoples R China Yangzhou Univ Coll Elect Energy & Power Engn Yangzhou 215000 Peoples R China Gunma Univ Div Elect & Informat Kiryu Gunma 3768515 Japan

With the rapid development of smart grid (SG) technologies, massive system data has been generated for SG for grid operation status monitoring and fault warning, this massive integrated data has brought great challenges for data transmission and storage. Thus, the breakthrough of data compression technology has become more and more important for data processing, this proposal, a lossless data compression method is proposed. The proposed method improves the Lempel-Ziv-Welch (LZW) algorithm. Specifically, the proposed method employs a parallel search approach to search the index of the dictionary globally by dividing the dictionary into several small dictionaries of different sizes and bit widths. In addition, the dynamic variable-length coding method is used as the output code which can offer flexible bit widths instead of fixed values, and the optimal dictionary partition combination and size parameters are selected to construct dictionaries. At last, the improved algorithm is cascaded with huffman algorithm to form the proposed data compression algorithm. The data compression efficiency has been successfully verified by comparing with conventional huffman and LZW data compression algorithms through data simulation, and it is observed to offer a better compression ratio than those methods with only LZW algorithm or huffman algorithm, and save storage space effectively. More than this, the proposed method has realized lossless compression for power system data and guaranteed the integrity of the data, which will have better applicability for dealing with any similar information data.

关键词： Lossless data compression smart grid huffman algorithm LZW algorithm

来源：评论

学校读者我要写书评

暂无评论

High-Security Image Steganography Technique using XNOR Operation and Fibonacci algorithm

引用

INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS 2020年第10期11卷 511-522页

作者： Almayyahi, Ali Abdulzahra Sulaiman, Rossilawati Qamar, Faizan Hamzah, Abdulwahhab Essa Univ Kebangsaan Malaysia Fac Informat Sci & Technol Ukm Bangi 43600 Selangor Malaysia Univ Kebangsaan Malaysia Fac Engn & Built Environm Dept Elect Elect & Syst Engn Photon Technol Lab Ukm Bangi 43600 Selangor Malaysia

Since the number of internet users is increasing and sensitive information is exchanging continuously, data security has become a problem. Image steganography is one of the ways to exchange secret data securely using images. However, several issues need to be mitigated, especially in the imperceptibility (security) aspect, which is the process of embedding secret data in the images that can be vulnerable to attacks. This paper focuses on developing a secure method for hiding secret messages in an image, based on the standard Least Significant Bit (LSB). Before proceeding with the embedding stage, the secret message's size is reduced by compression using the huffman algorithm, followed by two operations, which are the Boolean operation Exclusive-NOR (XNOR) operation and the Fibonacci algorithm when selecting pixels to embed the secret message. As a result of these processes, a stego-image is created with two secret keys. We obtained promising results against standard images with higher Peak Signal-to-Noise Ratio (PSNR) values of 66.6170, 65.8928, and 65.9386 dB for ***, ***, and ***, respectively, as compared to other state-of-the-art schemes. The evaluation stage proves the increasing level of security as well as imperceptibility.

关键词： Image steganography huffman algorithm XNOR operation Fibonacci algorithm LSB PSNR

来源：评论

学校读者我要写书评

暂无评论

High-efficiency Synthesis and Processing Software Design of Large-capacity Data for Digital Device Testing 14

High-efficiency Synthesis and Processing Software Design of ...

引用

14th IEEE International Conference on Signal Processing (ICSP)

作者： Fu, Zaiming Cai, Zhongshun Liu, HangLin Liu, Ke Univ Elect Sci & Technol China Sch Automat Engn Chengdu Sichuan Peoples R China

ISBN: (纸本)9781538646731

In the field of digital testing, the capacity of test data sets has grown rapidly. It is difficult for a single data generating device to take into account various test requirements. The large capacity data sets that are made up of multiple data source devices is becoming the development mainstream. In the integrated system, the key to improving test efficiency of the system is to efficiently and quickly generate the large-capacity data sets. Based on the huffman algorithm and command transmission, the author proposes a software processing method, which achieves the goal of collaborative editing and data synthesis of multiple data generators, and it successfully applies to the efficient synthesis and processing of 96-channel and 5Gbits ultra-large capacity data sets.

关键词： digital testing large capacity huffman algorithm Command transmission

来源：评论

学校读者我要写书评

暂无评论

无损数据压缩、算法比较和实现

无损数据压缩、算法比较和实现

引用

作者： John M. Hernandez Valerio 华中师范大学

学位级别：硕士

自从20世纪70年代以来,人们提出了多种数学算法用于压缩文件.随着互联网革命和数据量的指数级增长,人们对寻找更有效的压缩方案的需求与日俱增.数据压缩是利用较少的字节包含与原始信息一样多的信息量,它主要是通过消除数据中存在的冗... 详细信息

自从20世纪70年代以来,人们提出了多种数学算法用于压缩文件.随着互联网革命和数据量的指数级增长,人们对寻找更有效的压缩方案的需求与日俱增.数据压缩是利用较少的字节包含与原始信息一样多的信息量,它主要是通过消除数据中存在的冗余和在数据编码中引入更好的方案(有时增加数据安全性)来实现.这个过程降低了数据存储的要求,从而减少了通信耗费并能更有效的利用现有的带宽.进一步,文件压缩可以减少能量损耗,从而有效地降低了费用.在本文中,我们回顾了几类无损数据压缩方案,包括huffman LZ77,Deflate,Gzip和Barotli.我们对这几类方案在某些情形下进行了比较.总而言之,Brotli方案更适合作为网页,无线应用和离线压缩算法中的替代选择方案.考虑到缺乏对最新的压缩算法模型在公开文件中应用的研究,我们致力于研究Brotli算法在集成信息中的应用.同时我们提供了广泛且必要的知识去帮助读者更好的理解无损压缩算法是如何实现的.特别的,我们用R语言给出一个技术实现的实例.

关键词： Lossless data compression Botli huffman algorithm encoding

来源：评论

学校读者我要写书评

暂无评论

Improved huffman algorithm in Multi-channel Synchronous Data Acquisition and Compression System

Improved Huffman Algorithm in Multi-channel Synchronous Data...

引用

2012 International Conference on Affective Computing and Intelligent Interaction(ICACII 2012)

作者： Ma Xian-Min 1,a,Zhou Gui-Yu 2,b 1 Xi'an University of Science & Technology,Shanxi Xi'an 710054,China 2 Xi'an University of Science & Technology,Shanxi Xi'an 710054,China

An improved huffman algorithm is proposed in order to take up as litle as storage space during the process of transmiting data remotely and transmitting more useful information in the limited channel capacity in 120 emergency treatment ambulance terminal *** multi-channel simultaneous data acquisition and compression system based on DSP and FPGA technology are designed,which are composed of multi-channel data acquisition module,DSP data processing module,ambulance interface *** research result indicates that the presented huffman algorithm can reduce the requirement power and bandwidth in the compressing data technology and raise communication efficiency compared with LZW *** the multi-channel data acquisition and transmission rate are improved though the DSP embedded data compression algorithm,and the system performance is safety and reliable for 120 first aid dispatch and command system.

关键词： huffman algorithm Data acquisition Data compression LZW algorithm 120 emergency treatment ambulance command system

来源：评论

学校读者我要写书评

暂无评论

Lossless Data Compression Techniques and Their Performance

Lossless Data Compression Techniques and Their Performance

引用

IEEE International Conference on Computing, Communication and Automation (ICCCA)

作者： Sharma, Komal Gupta, Kunal Amity Univ Dept Comp Sci Noida Uttar Pradesh India

ISBN: (纸本)9781509064717

This paper provides the study of various lossless data compression techniques and compares their performance and efficiency using time and space complexity. Data compression is itself a huge field in a computer science and it is used in reducing the size of data by removing the redundant characters or encoding the bits in data. We have used only lossless data compression techniques for compressing various media format files like text, doc, bmp, png and way. huffman coding which generates variable length codes for each symbol. LZW is a dictionary based technique and Shannon-Fano coding is used to generate binary code based on the frequency of each symbol. So we calculated the mean compression ratio, compression factor and compression time for various media files and result analysis of above data compression techniques will help to select the most appropriate method of compressing of any given file format in real world.

关键词： Lossless data compression huffman algorithm Lempel-Ziv Coding Shannon-fano coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：