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

Hiding data in video file: An overview

Journal of Applied Sciences 2010年第15期10卷 1644-1649页

作者： Al-Frajat, A.K. Jalab, H.A. Kasirun, Z.M. Zaidan, A.A. Zaidan, B.B. Department of Software Engineering Faculty of Computer Science and Information Technology University Malaya 50603 Kuala Lumpur Malaysia Department of Computer System and Technology Faculty of Engineering Multimedia University Jalan Multimedia 63100 Cyberjaya Malaysia

The aim of this review is to study the methods of steganography using the video file as a cover carrier. The steganography is the art of protecting the information through embedding data in medium carrier, for instants this study illustrate historically this art, as well as the study describes methods as a review for this art in the video file. The video based steganography can be used as one video file, separated images in frames or images and audio files. Since that, the use of the video based steganography can be more eligible than other multimedia files. As a result of this study, the video based steganography has been discussed and the advantages of using the video file as a cover carrier for steganography have been proposed. © 2010 Asian Network for Scientific information.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

A fast multi-reference frame selection algorithm for multiview video coding

引用

Journal of Multimedia 2010年第4期5卷 369-376页

作者： Si, Yuehou Yu, Mei Peng, Zongju Jiang, Gangyi Faculty of Information Science and Technology Ningbo University Ningbo 315211 China National Key Lab of Software New Technology Nanjing University Nanjing 210093 China

Multiview video coding (MVC) plays an important role in three-dimensional video applications. Joint Video Team developed a joint multiview video model (JMVM) with multi-reference frame technology. Motion and disparity estimation are employed in multi-reference frame technology to provide better rate distortion performance. However, the process of searching blocks with variable sizes for motion and disparity estimation in multi-reference frames significantly increases the computational complexity. After analyzing the statistical features of multi-reference frames in MVC, this paper proposes a fast multi-reference frame selection algorithm based on a dynamic threshold technology correlated with the types of frames. All views of prediction structure in JMVM are categorized into three types, that is, the basic view without interview reference relation, the first layer views that only refer anchor frame from upper view, the second layer views that need to refer the basic view and the first layer views. Furthermore, all frames in MVC prediction structure are divided into three categories, the anchor frame without any reference, non-anchor frame in the base view and the first layer view, and the non-anchor frame in other views. Dynamic threshold technique is given to terminate the process of searching multi-reference frames early. The proposed algorithm also reduces the useless candidate reference frames by filtering out those reference frames that are less likely to contain the best matched results and achieves significant speed-up. Experimental results show that the proposed algorithm can achieve 50.13% ~ 72.19% reduction of encoding time in comparison with JMVM7.0, while the proposed algorithm hardly influences the rate distortion performance of MVC. © 2010 Academy Publisher.

关键词： Image coding

来源：评论

学校读者我要写书评

暂无评论

Estimating the runtime of evolutionary programming based on Uniform Mutation

Estimating the runtime of evolutionary programming based on ...

引用

International Conference on Natural Computation

作者： Yang, Zhongming Huang, Han Center of Information and Network Maoming University Maoming Guang dong 525000 China School of Software Engineering South China University of Technology Guangzhou 510006 China State Key Lab. for Novel Software Technology Nanjing University China Dept of Management Sciences College of Business City University of Hong Kong Hong Kong Hong Kong

ISBN: (纸本)9781424459612

Although several studies of running time for evolutionary algorithm (EA) of discrete optimization have been proposed, there are few homologous results for EA of continuous optimization like evolutionary programming. This paper presents a preliminary analysis result for the running time of an EP algorithms based on Uniform Mutation. Defined as the measurement of running time, first hitting time is the iteration time which EP spends in converging in the optimal. Hence, this paper proposes a first-hitting-time framework for estimating the running time of EP based on an absorbing Markov process model. Later, the framework is used to calculate an upper bound and a lower bound of the mean first hitting time of Uniform Mutation EP. It can be indicated that the upper bounds are influenced directly by population size, problem size, searching range and the Lebesgue measure of the optimal Ε neighborhood. © 2010 IEEE.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Prediction model of reservoir fluids properties using sensitivity based linear learning method

Prediction model of reservoir fluids properties using sensit...

引用

International Conference on Multimedia Computing and information technology, MCIT'2010

作者： Olatunji, Sunday Olusanya Selamat, Ali Raheem, Abdul Azeez Abdul Intelligent Software Engineering Laboratory Faculty of Computer Science and Information Systems University of Technology Malaysia 81310 UTM Skudai Johor Malaysia Centre for Petroleum and Minerals Research Institute King Fahd University of Petroleum and Mineral Dhahran 31261 Saudi Arabia

ISBN: (纸本)9781424470037

This paper presented a new prediction model for Pressure-Volume-Temperature (PVT) properties based on the recently introduced learning algorithm called Sensitivity Based Linear Learning Method (SBLLM) for two-layer feedforward neural networks. PVT properties are very important in the reservoir engineering computations. The accurate determination of these properties such as bubble-point pressure and oil formation volume factor is important in the primary and subsequent development of an oil field. In this work, we develop Sensitivity Based Linear Learning method prediction model for PVT properties using two distinct databases, while comparing forecasting performance, using several kinds of evaluation criteria and quality measures, with neural network and the three common empirical correlations. Empirical results from simulation show that the newly developed SBLLM based model produced promising results and outperforms others, particularly in terms of stability and consistency of prediction. ©2010 IEEE.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

CRAB—CombinatoRial Auction Body software System

引用

Journal of software engineering and Applications 2010年第7期3卷 718-722页

作者： Petr Fiala Jana Kalcevová Jan Vraný Department of Econometrics Faculty of Informatics and StatisticsUniversity of EconomicsPragueCzech Republic Software Engineering Group Faculty of Information TechnologyCzech Technical UniversityPragueCzech Republic

Auctions are important market mechanisms for the allocation of goods and services. Combinatorial auctions are those auctions in which buyers can place bids on combinations of items. Combinatorial auctions have many applications. The paper presents the CRAB software system. CRAB is a non-commercial software system for generating, solving, and testing of combinatorial auction problems. The system solves problems by Balas’ method or by the primal-dual algo-rithm. CRAB is implemented in Ruby and it is distributed as the file ***. The system is freely available on web pag-es for all interested

关键词： Combinatorial Auction Complexity software System Generating Solving Testing

来源：评论

学校读者我要写书评

暂无评论

Performance enhancement of localization in wireless sensor network by self-adaptive algorithm based on difference

Performance enhancement of localization in wireless sensor n...

引用

Global Mobile Congress

作者： Dong, Guo-Fang Chang, Liu Fei, Gao Wang, Wan-Sheng Niu, Xiaoling Gong, Peng Key Lab of Wireless Sensor Networks Yunnan Nationalities University Yunnan China School of Software and Information Management Beijing City University China National Key Laboratory of Mechatronic Engineering and Control Beijing Institute of Technology Beijing 100081 China

ISBN: (纸本)9781424490035

In this paper, we present a self-adaptive localization algorithm based on difference for the node localization in wireless sensor network. We first divide the sensing area into several small regions according to the density of unknown nodes. Then, we distribute the beacon nodes within the sensing area in a reasonable manner. The measured errors of estimated location in beacon nodes are considered as the adjusted values and are broadcasted to the adjacent unknown nodes. Based on the broadcasted adjusted values, the unknown nodes adjust their relative position information. The simulation results show that with the proposed algorithm the node localization errors can be reduced and the accuracy of localization is greatly increased. © 2010 IEEE.

关键词： Adaptive algorithms

来源：评论

学校读者我要写书评

暂无评论

Improving the accuracy of object tracking in three dimensional WSNs using Bayesian estimation methods

Improving the accuracy of object tracking in three dimension...

引用

International Workshop on Wireless Network Algorithm and Theory

作者： Du, Junzhao Mao, Lei Liu, Hui Wu, Bo Guo, Deke Software Engineering Institute Xidian University Xi'an 710071 Shannxi China State Key Lab. of ISN Xidian University Xi'an 710071 Shannxi China Key Lab. of C4ISR Technology College of Information Systems and Management National University of Defense Technology Changsha 410073 Hunan China

ISBN: (纸本)9780769543222

Target tracking plays a critical role in the applications of wireless sensor networks. In this paper, we propose a target tracking algorithm based on Bayesian estimation, the key steps involved in the algorithm include target detection based on a probabilistic model, preliminary localization using the two-stage target locating algorithm, further prediction adopting Bayesian estimation. Simulation results show that our simple and effective algorithm can accurately track the target and save much energy during the tracking process of a moving target. © 2010 IEEE.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

Research and implementation of distributed simulation and parallel rendering system based on grid

Research and implementation of distributed simulation and pa...

引用

International Conference on Networking and Distributed Computing

作者： Zhang, Yaping Peng, Haoyu Wang, Zonghui Shi, Jiaoying Faculty of Computer Science and Information Technology Yunnan Normal University Kunming China College of Computer Science and Information Engineering Zhejiang Gongshang University Hangzhou China College of Computer Science and Technology Zhejiang University Hangzhou China State Key Lab. of CAD and CG Zhejiang University Hangzhou China

ISBN: (纸本)9780769542072

With the development of Grid technology and the extension of Grid application areas, it needs to provide core infrastructure platform and the necessary functional components for large-scale resources sharing and collaboration. Based on the previous implementation of interactive Grid visualization system, this paper extends its runtime environment layer to provide Grid supports for the existing distributed simulation support platform and parallel graphics rendering system based on PC cluster, consequently realizes dynamic resource allocation and scheduling. Additionally, we present and implement a Grid-based distributed simulation and parallel rendering system which provides large-scale distributed simulation service and parallel rendering as well as high-resolution multi-screen tiled display service of massive complex scene to end users through an extended Grid portal. © 2010 IEEE.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Fault diagnosis of transformer using association rule mining and knowledge base

Fault diagnosis of transformer using association rule mining...

引用

2010 10th International Conference on Intelligent Systems Design and Applications, ISDA'10

作者： Zhang, Tiefeng Zhang, Guangquan Lu, Jie School of Electric and Electronic Engineering North China Electric Power University Baoding China Lab. Faculty of Engineering and Information Technology Centre for Quantum Computation and Intelligent Systems P.O. Box 123 Broadway NSW 2007 Australia

ISBN: (纸本)9781424481354

Association rule mining makes interesting associations and/or correlations among large sets of data. Those associations can be refined as decision rules to be used and stored in a knowledge base system. In this paper, an approach based on association rule and knowledge base is proposed and implemented in the fault diagnosis of a transformer system. According to the features of association rule, the Apriori algorithm is adopted and modified to generate decision rules from power transformer information for building knowledge base, then the rules can be refined to diagnose the fault of the transformer through reasoning, and a prototype system is developed. This approach based on association rule is described in detail and the application is illustrated by an example. A comparison with the IEC (International Electrotechnical Commission) three-ratio method shows the proposed method can provide better accuracy in performance. © 2010 IEEE.

关键词： Power transformers

来源：评论

学校读者我要写书评

暂无评论

A theoretical framework for runtime analysis of ant colony optimization

A theoretical framework for runtime analysis of ant colony o...

引用

International Conference on Machine Learning and Cybernetics

作者： Yang, Zhong-Ming Huang, Han Cai, Zhaoquan Qin, Yong Center of Information and Network Maoming University Maoming Guang dong China School of Software Engineering South China University of Technology Guangzhou China State Key Lab. for Novel Software Technology Nanjing University China Dept of Management Sciences College of Business City University of Hong Kong Hong Kong Hong Kong Network Center Huizhou University Huizhou China

ISBN: (纸本)9781424465262

Ant colony optimization (ACO) is one of the most famous bio-inspired algorithms. Its theoretical research contains convergence proof and runtime analysis. The convergence of ACO has been proved since several years ago, but there are less results of runtime analysis of ACO algorithm except for some special and simple cases. The present paper proposes a theoretical framework of a class of ACO algorithms. The ACO algorithm is modeled as an absorbing Markov chain. Afterward its convergence can be analyzed based on the model, and the runtime of ACO algorithm is evaluated with the convergence time which reflects how many iteration times ACO algorithms spend in converging to the optimal solution. Moreover, the runtime analysis result is advanced as an estimation method, which is used to study a binary ACO algorithm as a case study. © 2010 IEEE.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：