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

The algorithm of preserving the spatial location of 3D image on android platform

International Review on computers and software 2012年第6期7卷 3227-3231页

作者： Gu, Yunhua Chen, Peipei Liu, Caisheng Jiangsu Engineering Center of Network Monitoring School of Computer and Software Nanjing University of Information Science and Technology Nanjing China Jiangsu University of Science and Technology Suzhou Institute of Technology China

On Android platform, direction sensor is used to induce the direction change of the device. With the change of the device direction, the spatial position of 3D image also changes. However, users usually expect that the unchanged display position of 3D image can be preserved in some applications. To meet the above demands, the principle of direction sensor, which is used to control and correct the display of the 3D image, is investigated. By means of setting the rotation angles of 3D image, the algorithm of preserving the spatial position of 3D image on Android platform is proposed in this paper. Furthermore, the algorithm of eliminating screen flashing is designed to solve the problem of screen flashing. Experiment results show that the algorithm of preserving the spatial position of 3D image feasibility and correctness, and the algorithm of eliminating screen flashing is valid. © 2012 Praise Worthy Prize S.r.l. - All rights reserved.

关键词： Three dimensional displays

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving top-k query in two-tiered wireless sensor networks

引用

International Journal of Advancements in Computing Technology 2012年第6期4卷 226-235页

作者： Yao, Yonglei Ma, Li Liu, Jingfa Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing China School of Computer and Software Nanjing University of Information Science and Technology Nanjing China

In a two-tiered wireless sensor network, storage nodes act as an intermediate tier between sensors and the sink for storing data and processing queries. This architecture has been widely adopted because of the benefits of power and storage saving for sensors as well as the efficiency of query processing. On the other hand, the importance of storage nodes also makes them attractive targets for compromise. A compromised storage node may leak sensitive information and breach data privacy. In this paper, we propose a privacy-preserving protocol specializing for top-k queries that prevents attackers from gaining sensitive information from sensor collected data. To preserve privacy, an orderpreserving encryption is employed to encrypt sensor data such that a storage node can correctly process top-k queries over encrypted data without knowing their actual values. Detailed theoretical and quantitative results confirm the high efficacy and efficiency of the proposed scheme.

关键词： Efficiency

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving MAX/MIN aggregation in wireless sensor networks

引用

Advances in Information Sciences and Service Sciences 2012年第6期4卷 272-280页

In-network data aggregation has been adopted widely to reduce communication overhead and improve efficiency in wireless sensor networks. On the other hand, security is another basic requirement for wireless sensor network, and providing privacy without disrupting in-network data aggregation is a challenging problem. Although there have been extensive studies on privacy-preserving data aggregation for additive and multiplicative aggregation functions, nonlinear aggregation functions, such as maximum and minimum, have not been well addressed. In this paper, we present a privacy-preserving aggregation method specialized for MAX/MIN aggregation functions. To preserve privacy, encryption and the prefix membership verification scheme are employed, allowing an intermediate aggregator to correctly compare data without access to plaintext data, thus protect data privacy. Extensive simulations are conducted to evaluate the proposed schemes. The results show that our scheme provides privacy protection for both raw and aggregated data items, while achieving high efficiency in terms of energy consumption and time delay.

关键词： Wireless sensor networks

来源：评论

学校读者我要写书评

暂无评论

An improved algorithm based on ACO for cloud service PDTs scheduling

引用

Advances in Information Sciences and Service Sciences 2012年第18期4卷 340-348页

作者： Xue, Shengjun Zhang, Jie Xu, Xiaolong Nanjing University of Information Science and Technology School of Computer and Software Nanjing 210044 China Nanjing University of Information Science and Technology Jiangsu Engineering Center of Network Monitoring Nanjing 210044 China

With the increasing popularity of cloud computing technology, a great many applications are submitted to the cloud platforms for execution. Faced with the low utilization efficiencies and high cost of resources, users need cloud services with "lowest pay and highest efficiency". In this paper, we define a new scheduling model for Partly Dependent Tasks (PDTs) which merge workflow tasks and independent tasks together. Moreover, the scheduling model also takes the time requirements of QoS (Quality of Service) constrains and cost reduction into consideration. In order to meet these requirements, an improved ant colony optimization algorithm also put forward to schedule the PDTs (PIACO). Furthermore, we experiment with a set of PDTs by varying many related parameters such as the iterations, colony size and different deadline settings. Finally, the proposed algorithm PIACO proves to be efficient and suitable for the cloud PDTs scheduling.

关键词： Quality of service

来源：评论

学校读者我要写书评

暂无评论

Nonsubsampled contourlet transform based illumination invariant extracting method

引用

Advances in Information Sciences and Service Sciences 2012年第17期4卷 47-55页

作者： Fan, Chun-nian Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China

Face recognition research in recent years has made great progress, yet many issues still remain to be addressed. Illumination changes are one of the key issues. In order to eliminate the effect of varying illumination on face recognition, a novel illumination invariant method based on nonsubsampled Contourlet transform is proposed. Firstly, we perform illumination normalization on images under varying illumination, which can reduce the effect of varying illumination to some extent. Secondly, the logarithmic transformation and the nonsubsampled Contourlet transform is used to decompose the images into its low frequency and high frequency directional subband components. Thirdly, adaptive NormalShrink is applied to each directional subband to eliminate noise, and the histogram equalization is applied to the low frequency components aimed at weakening the illumination affects further. Lastly, the illumination invariant is obtained by inverse nonsubsampled Contourlet transform using the modified low frequency components and high frequency directional subband components. Experimental results on the Yale face database B and CMU PIE database show that the proposed method can effectively eliminate the effect of varying illumination on face recognition and the obtained illumination invariant is robust.

关键词： Face recognition

来源：评论

学校读者我要写书评

暂无评论

Hybrid Additive Multi-Watermarking Decoder

Hybrid Additive Multi-Watermarking Decoder

引用

第十届全国信息隐藏暨多媒体信息安全学术大会CIHW2012

作者： Jinwei WANG Xingming SUN Yuhui ZHENG Jin HAN Zhihua XIA Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology College of Computer and Software Nanjing University of Information Science and Technology China

With the development of the cloud environment, the multi-copyright protection of the works should be further developing. The multi-watermarking is becoming a possible solution. In this paper, firstly, one novel hybrid multi-watermarking rule is proposed, and is used to embed the watermark into DWT domain. Secondly, corresponding to the hybrid embedding rule, the novel optimum hybrid additive multi-watermarking decoder is proposed, which is based on the minimum Bayesian risk criterion, and simultaneously the performance of the hybrid decoder is theoretically analyzed. The DWT coefficients are modeled as the generalized Gaussian distribution. Finally, the theoretical and empirical experimental results prove the theoretical analysis validity.

关键词： hybrid additive rule optimal hybrid multi-watermarking decoder

来源：评论

学校读者我要写书评

暂无评论

Annealing genetic algorithm for protein folding simulations in the 3D HP model

International Journal of Digital Content Technology and its ...

引用

International Journal of Digital Content Technology and its Applications 2012年第9期6卷 219-226页

作者： Liu, Jingfa Wang, Jun Zheng, Yu Yao, Yonglei Liu, Zhaoxia Network Information Center Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Sience and Technology Nanjing 210044 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China

The protein folding problem, i.e., the prediction of the tertiary structures of protein molecules from their amino acid sequences is one of the most important problems in computational biology. This problem has been widely studied under the HP model in which each amino acid is classified, based on its hydro phobicity, as a hydrophobic (H) residue or a hydrophilic (or polar, P) one. The protein folding problem in the HP model is in fact to find conformations with the lowest energies for some benchmark amino acid sequences. A genetic algorithm (GA) is used to find the lowest energy conformation in this paper. Each time for a newly produced offspring individual, which is originated from the selection, crossover and mutation operator of two parent individuals, we adopt the new acceptance criteria based on the annealing strategy to let it pass into the next generation, and propose a so-called annealing genetic algorithm (aGA) to predict efficiently the protein folding conformations in the three-dimensional (3D) HP model. Eleven benchmarks are tested to verify the effectiveness of the proposed approach and the computational results show that aGA explores the conformation surfaces more efficiently than other methods, and finds new lower energies in several cases, which means that aGA is an efficient tool for the protein folding simulations.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

A new heuristic algorithm for packing equal circles into a larger equilateral triangular container

引用

International Journal of Advancements in Computing Technology 2012年第3期4卷 260-270页

作者： Liu, Jingfa Zhang, Guojian Liu, Wenjie Gao, Zexu Zhou, Ziling Network Information Center Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China

This paper studies the problem of packing equal circles into a larger equilateral triangular container, which is concerned with how to pack these circles into the container without overlapping. Its aim is to minimize the edge length of the container as much as possible. By incorporating some heuristic configuration update strategies, a local search strategy based on the gradient method and the dichotomous search (DS) strategy into the simulated annealing (SA) algorithm, a new heuristic algorithm, the heuristic simulated annealing algorithm based on dichotomous search (HSADS), is put forward for solving this problem. In HSADS, the heuristic configuration update strategies are used to produce new configurations, and the gradient method is used to search for lower-energy minima near newly generated configurations, and the dichotomous search strategy is used to gain the minimal edge length of the equilateral triangular container. By testing six equal circles instances from the literature, the proposed algorithm improves the best known results of them so far. The experimental results show that HSADS is an effective algorithm for the problem of packing equal circles into a larger equilateral triangular container.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

A fast KNN algorithm based on centre vector condensing

引用

Journal of Computational Information Systems 2012年第23期8卷 9792-9798页

作者： Ma, Tinghuai Yan, Yonggang Tian, Wei Zhong, Shuiming Cao, Jie Wang, Jian Jiangsu Engineering Centre of Network Monitoring College of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China College of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China School of Electronic Science and Engineering Nanjing University Nanjing 210093 China

The K-Nearest Neighbor (KNN) is one of the most widely used classification algorithms. For large dataset, the computational demands for classifying patterns using KNN can be expensive. A way to solve this problem is through the condensing approach. It means we remove instances that will bring computational burden but do not contribute to better classification accuracy. In this paper, we propose a new condensing algorithm based on centre vector. The proposed idea is to extract some representative samples and take the processed result as a new training sample set. Our experiments show that the proposed strategy can dramatically shorten the time consumption compared with the traditional KNN. On average, the speedup ratios improve 90% while classification accuracy only has 6% decrease. ©2012 by Binary Information Press.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

Hybrid neural network model application in annual precipitation forecast

引用

International Journal of u- and e- Service, Science and Technology 2012年第4期5卷 21-30页

作者： Ma, Li Li, Xuelian Wang, Jin Jiangsu Engineering Center of Network Monitoring Nanjing University of Information Science and Technology Nanjing 210044 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China Key Laboratory of Meteorological Disaster of Ministry of Education Nanjing University of Information Science and Technology Nanjing 210044 China

When applied to precipitation forecasting, the mean generating function - optimal subset regression (MGF-OSR) model is limited by its low accuracy and high error, while the back propagation (BP) neural network model has difficulty in learning for matrix selection. This paper proposes a new MGF-OSR-BP model, which uses a MGF to extend original data, an OSR to select the best series as the BP neural network input node and learning matrix, and the resultant data for training. The training procedure determines the number of hidden layers and uses an optimal number of hidden layers for model training. This paper uses the MGF-OSR-BP model to analyze precipitation data from Hangzhou, China, for 53 years, from 1956 to 2008. The 1956-2006 precipitation data are used as the training sample, and the 2007-2008 data are used as the test set data to verify the practicality of the forecast system. A fitting verification is performed using the forecasted data against field measurement data, and the results show that the forecast accuracy is better than that of the MGF-OSR model or the MGF stepwise multiple regression model.

关键词： Backpropagation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：