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

10th International Conference on Ubiquitous and Future Networks (ICUFN)

作者： Huang, Yi-Wei Cheng, Sheng-Tzong Natl Cheng Kung Univ Comp Sci & Informat Engn Tainan Taiwan

ISBN: (纸本)9781538646465

Recent advances in sensor technology has led to varieties of sensors. Problems facing now is how to exploit and compute these data efficiently. Map Reduce is a programming model to solve these problem. However, it may cause I/O bottleneck. In-memory computing (IMC) comes up to solve the problems. However, network bandwidth remains a bottleneck. It restricts the speed of receiving the information from the source and dispersing information to each node. To our observation, some data from sensor devices might be similar due to temporal or spatial dependency. Therefore, compression technology could be an effective solution. It replaces data with smaller sizes of streams for improving data utilization. This study presents an effective reduce transmission scheme on a distributed real-time IMC platform - Spark Streaming. We design and implement a system to provide a high compression ratio in a small batch data from the source. It is expected to reduce data transmission with little delay time in the soft real-time fashion.

关键词： Big data In-memory computing Spark Streaming data compression technique

来源：评论

学校读者我要写书评

暂无评论

Basic Arithmetic Coding Based Approach to Compress a Character String 1

引用

5th International Conference on Frontiers in Intelligent Computing - Theory and Applications (FICTA)

作者： Mondal, Ipsita Sarkar, Subhra J. Techno India Batanagar Dept CSE Kolkata India Techno India Batanagar Dept EE Kolkata India

ISBN: (数字)9789811031533

ISBN: (纸本)9789811031533;9789811031526

data compression plays an important role for storing and transmitting text or multimedia information. This paper refers to a lossless data algorithm is developed in C-platform to compress character string based on Basic Arithmetic Coding. At the preliminary stage, this algorithm was tested for the character array comprising of vowels only and the probability distribution is assumed arbitrarily. The result being obtained is encouraging with compression ratio far beyond unity. Though the algorithm was tested for vowels only but the work can be extended for any character array with probability of distribution as obtained from the survey of few randomly selected articles.

关键词： data compression technique Basic arithmetic coding Probability distribution Encoding-Decoding compression ratio

来源：评论

学校读者我要写书评

暂无评论

A Kind of Efficient data Archiving Method for Historical Sensor data 3

A Kind of Efficient Data Archiving Method for Historical Sen...

引用

3rd International Conference on Information Science and Control Engineering (ICISCE)

作者： Yan, Qi Wang, Yong-Yan Chinese Acad Sci Inst Software Beijing Peoples R China

ISBN: (纸本)9781509025350

Nowadays there are more than 10 billion sensors in the Internet of Things. These sensors will produce a mass of historical data as time goes on. And these data are useful in data mining and may create great value for human. However, historical sensor data are hard to archive because they have the characteristics of mass, complexity, isomerism and dynamic nature. Therefore, how to archive historical sensor data to storage efficiently is a meaningful issue deserved to study. In this paper, an efficient data archiving method is proposed. It mainly focuses on three aspects: memory allocation strategy, data compression technique and data storage structure. This method not only considers the efficiency of each aspect but also the combination of each aspect in order to ensure the high efficiency of whole data archiving method.

关键词： historical sensor data data archiving method memory allocation strategy data compression technique data storage structure

来源：评论

学校读者我要写书评

暂无评论

Modified chain-code-based object recognition

引用

ELECTRONICS LETTERS 2015年第24期51卷 1996-+页

作者： Lee, Daeha Kim, Soon-Ja ETRI Intelligent Cognit Technol Res Dept Taejon South Korea Kyungbook Natl Univ Dept Elect Engn Taegu South Korea

Chain code, a data compression technique, has been widely used to encode the contour information of an object or gesture. Although this chain code is effective for data compression, it is impossible to avoid the duplication of borders. That is, even though they represent different objects, the encoding results can be made similar. The vector chain code (VCC), which contains the direction and distance information to solve the problems of the existing chain code is proposed. Also, the integrated VCC is composed of internal and external class-based VCCs to support the encoding of objects that have multiple feature points. Experiments demonstrate that the proposed VCC achieves an improved recognition rate in comparison to that achieved by the existing chain code.

关键词： object recognition data compression modified chain-code-based object recognition data compression technique vector chain code VCC

来源：评论

学校读者我要写书评

暂无评论

A Novel data compression Approach to Reduce String Size for PLCC Based DAS 12

A Novel Data Compression Approach to Reduce String Size for ...

引用

12 IEEE Int C Elect Energy Env Communications Computer Control

作者： Sarkar, Subhra J. Mondal, Ipsita Kundu, Palash K. BIEMS Dept EE Kolkata India BIEMS Dept CSE Kolkata India Jadavpur Univ Dept EE Kolkata India

ISBN: (纸本)9781467365406

MATLAB based DCSK communication scheme developed for PLCC based DAS requires longer time of execution at receiving end particularly with longer strings. In order to avoid the problem, basic arithmetic coding based lossless data compression method is proposed which can reduce the string size of string and consequently improve the performance of the system significantly. As conventional DAS deals mostly with integer values only, the algorithm is developed for integer string only. But this proposed method can be modified suitably and can be implemented for character strings successfully.

关键词： Power Line Carrier Communication (PLCC) Differential Code Shift Keying (DCSK) data compression technique Basic Arithmetic Coding Chirp Superchirp

来源：评论

学校读者我要写书评

暂无评论

What is a pixel?

引用

IEEE COMPUTER GRAPHICS AND APPLICATIONS 2005年第5期25卷 82-87页

作者： Blinn, JF blinn@***

The total list of processing required to view a pixel includes antialiasing, offset sampling, color space projection, reconstruction filter compensation, compositing, gamma correction, and quantization and dithering. If we look at all these operations we can see a pattern: Almost all of them throw away information. When we filter out high frequencies, quantize intensities into bins, project a continuous color spectrum into three numbers, and represent geometric edges with a single transparency value we can see that an ordinary-hardware pixel, either refreshed on the screen or stored in a file, is simply a bad data compression technique. Any rendering algorithm or image processing operation that converts data to pixels generally loses information about the original data that it uses as input. A few polygons become thousands of pixels; a high-resolution image becomes a low-resolution image. Conversion to pixels for viewing purposes used to be a slow operation, but with faster processors we no longer need to do the image generation offline for speed purposes. We can recalculate the image whenever we need to look at it.

关键词： antialiasing cathode-ray tubes computational geometry data compression filtering theory image reconstruction image registration image resolution image sampling liquid crystal displays color space projection color spectrum data compression technique gamma

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：