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

2014 International Conference on Information and Network Security, ICINS 2014

作者： Lu, Yihui Luo, Wenjian Zhao, Dongdong School of Computer Science and Technology University of Science and Technology of China Hefei Anhui230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui230027 China

ISBN: (纸本)9781849199094

In a negative survey, a category which does not agree with the fact of each participant is collected. Hence, data collectors cannot acquire the realistic data of participants, and this can efficiently protect participants' private information and sensitive data. However, existing approaches used to estimate the distribution of positive surveys from negative surveys are not practical and time-consuming. This paper proposed a method in order to acquire practical estimation results with a lower computing cost, namely fastNStoPS. Usually, privacy and utility are used to measure the performances of negative surveys, and they are two conflicting metrics. Users have different demands on privacy (or utility) under different circumstances. The optimal negative surveys are a Pareto font of these two objectives. To demonstrate its practicability, the proposed fastNStoPS method is embedded into a Differential Evolution (DE), which is used to find the optimal negative surveys. The experiment results show that the DE has a much better performance on find the optimal negative surveys, and the computing cost is very low.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Requirement-oriented privacy protection analysis architecture in cloud computing

引用

Journal of communications 2015年第1期10卷 55-63页

作者： Ke, Changbo Wang, Ruchuan Xiao, Fu Huang, Zhiqiu School of Computer Sci. and Tech./School of Software Nanjing Univ. of Posts and Telecom Nanjing210023 China Jiangsu High Tech Research Key Laboratory for Wireless Sensor Networks NanjingJiangsu210003 China College of computer Sci. and Tech Nanjing Univ. of Aeronautics and Astronautics NanjingJiangsu210016 China Key Lab of Broadband Wireless Communication and Sensor Network Tech Nanjing University of Posts and Telecom Ministry of Education Jiangsu Province NanjingJiangsu210003 China

As a new software paradigm, cloud computing provides services dynamically according to user requirements. However, it is difficult to control personal privacy information because of the opening, virtualization, multi-tenancy and service outsourcing characters. Therefore, how to protect user privacy information has become a research focus. In this paper, we propose requirement-oriented privacy protection theory analysis architecture and implementation platform. Firstly, the theory analysis architecture is depicted as layers, and we analyze the function and key technologies of every layer. Secondly, we address the privacy property description method with ontology and description logic, and then analyze the theory modules of privacy items conflict checking layer, privacy policy negotiation layer and privacy agreement forensics layer. Thirdly, according to theory architecture, we design the implementation platform of requirement-oriented privacy protection, and discuss the function and workflow. In the end, we conclude and point out the future work. © 2015 Engineering and Technology Publishing.

关键词： Data privacy

来源：评论

学校读者我要写书评

暂无评论

Combining multipopulation evolutionary algorithms with memory for dynamic optimization problems

Combining multipopulation evolutionary algorithms with memor...

引用

Congress on Evolutionary Computation

作者： Tao Zhu Wenjian Luo Lihua Yue Anhui Province Key Laboratory of Software Engineering in Computing and Communication Hefei Anhui China School of Computer Science and Technology University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Both multipopulation and memory are widely used approaches in the field of evolutionary dynamic optimization. It would be interesting to examine the effect of the combinations of multipopulation algorithms (MPAs) and memory schemes. However, since most of the existing memory schemes are proposed with single population algorithms, straightforwardly applying them to MPAs may cause problems. By addressing the possible problems, a new memory scheme is proposed for MPAs in this paper. In the experiments, several existing memory schemes and the newly proposed scheme are combined with a MPA, i.e. the Species-based Particle Swarm Optimizer (SPSO), and these combinations are tested on cyclic and acyclic problems. The experimental results indicate that 1) straightforwardly using the existing memory schemes sometimes degrades the performance of SPSO even on cyclic problems; 2) the newly proposed memory scheme is very competitive.

关键词： Sociology Statistics Memory management Optimization Heuristic algorithms Benchmark testing Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

FACIAL ACTION UNIT RECOGNITION BY RELATION MODELING FROM BOTH QUALITATIVE KNOWLEDGE AND QUANTITATIVE DATA

FACIAL ACTION UNIT RECOGNITION BY RELATION MODELING FROM BOT...

引用

IEEE International Conference on Multimedia and Expo Workshops

作者： Zhen Gao Shangfei Wang Chongliang Wu Jun Wang Qiang Ji Key Lab of Computing and Communication Software of Anhui Province School of Computer Science and Technology University of Science and Technology of China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute

ISBN: (纸本)9781479947164

In this paper, we propose to capture Action Unit (AU) relations existing in both qualitative knowledge and quantitative data through Credal Networks (CN). Each node of the CN represents an AU label, and the links and probability intervals capture the probabilistic dependencies among multiple AUs. The structure of CN is designed based on prior knowledge. The parameters of CN are learned from both knowledge and ground-truth AU labels. The AU preliminary estimations are obtained by an existing image-driven recognition method. With the learned credal network, we infer the true AU labels by combining the relationships among labels with the previous obtained estimations. Experimental results on the CK+ database and MMI database demonstrate that with complete AU labels, our CN model is slightly better than the Bayesian Network (BN) model, demonstrating that credal sets learned from data can capture uncertainty more reliably;With incomplete and error-prone AU annotations, our CN model outperforms the BN model, indicating that credal sets can successfully capture qualitative knowledge.

关键词： Prior knowledge Credal network AU recognition

来源：评论

学校读者我要写书评

暂无评论

Capture expression-dependent AU relations for expression recognition

Capture expression-dependent AU relations for expression rec...

引用

IEEE International Conference on Multimedia and Expo Workshops (ICMEW)

作者： Jun Wang Shangfei Wang Mengdi Huai Chongliang Wu Zhen Gao Yue Liu Qiang Ji Key Lab of Computing and Communication Software of Anhui Province University of Science and Technology of China Hefei Anhui P.R.China University of Science and Technology of China Hefei Anhui CN Department of Electrical Rensselaer Polytechnic Institute Troy NY USA

ISBN: (纸本)9781479947164

To date, there is only limited research that explicitly exploits the relationships among Action Units and expressions for facial expression recognition. In this paper, we propose an facial expression recognition method through modeling the expression-dependent AU relations. First, the incremental association Markov blanket algorithm is adopted to select crucial action units for a certain expression. Second, a Bayesian Network (BN) is constructed to capture the relationships between a certain expression and its crucial action units. Given the learned BNs and measurements of AUs and expression, we can then perform expression recognition within the BN through a probabilistic inference. Experimental results on the CK+ and MMI databases demonstrate the effectiveness and generalization ability of our method.

关键词： Gold Markov processes Databases Training Accuracy Face recognition Bayes methods

来源：评论

学校读者我要写书评

暂无评论

Classifying and clustering in negative databases

引用

Frontiers of computer Science 2013年第6期7卷 864-874页

作者： Ran LIU Wenjian LUO Lihua YUE School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei 230027 China

Recently, negative databases （NDBs） are proposed for privacy protection. Similar to the traditional databases, some basic operations could be conducted over the NDBs, such as select, intersection, update, delete and so on. However, both classifying and clustering in negative databases have not yet been studied. Therefore, two algorithms, i.e., a k nearest neighbor （kNN） classification algorithm and a k-means clustering algorithm in NDBs, are proposed in this paper, respectively. The core of these two algorithms is a novel method for estimating the Hamming distance between a binary string and an NDB. Experimental results demonstrate that classifying and clustering in NDBs are promising.

关键词： negative databases classification clustering k nearest neighbor k-means hamming distance

来源：评论

学校读者我要写书评

暂无评论

MR image segmentation based on local information entropy geodesic active contour model

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2014年第4期9卷 127-136页

作者： Zhang, Jianwei Ma, Xiang Chen, Yunjie Fang, Lin Wang, Jin School of Math and Statistics Nanjing University of Information Science and Technology Nanjing 210044 China Intelligent Transportation of Anhui Province Key Lab Hefei 230088 China School of Computer and Software Nanjing University of Information Science and Technology Nanjing 210044 China

In this paper, an improved Geometric Active Contour model is presented. This model introduced a window function to research the mean information of each pixel's neighbor region, and constructed a novel signed pressure force function based on the entropy to drive the contour towers the boundary. In order to improve the efficiency and stability of the algorithm, this paper adopts two valued level set method to realize the segmentation process. The experimental results show that this method can obtain satisfied result even when the images have intensity inhomogeneity and weak edges. © 2014 SERSC.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

IPRAR: A DFG-based approach to instruction clustering for multicluster VLIW DSP processor with SIMD structure

引用

Journal of Computational Information Systems 2014年第3期10卷 1257-1269页

作者： Yang, Yangzhao Gu, Naijie Zhao, Zeng Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China

Modern Very Long Instruction (VLIW) DSP can improve performance by using instruction-level parallelism (ILP) and obtain better parallelism through instruction clustering. The essence of clustering is resource allocation. Traditional clustering method assumes that one instruction can only be assigned to a certain cluster, which is inapplicable to the architecture with SIMD structure. To address this issue, this paper presents IPRAR, a novel instruction clustering algorithm for the features of SIMD structure based on DFG. Due to considering the features of SIMD structure, IPRAR can be implemented on BWDSP100 with satisfactory. Besides, IPRAR can make the load of cluster more balanced and minimize the intercluster communication overload. Finally, numerous experiment results show that the IPRAR has an average of 7-10% performance improvement compared to the traditional methods. © 2014 Binary Information Press.

关键词： Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Optimizing BLAS2 for a decoupled access/execute architecture processor

引用

Journal of Computational Information Systems 2014年第3期10卷 1231-1241页

作者： Zhao, Zeng Gu, Naijie Yang, Yangzhao Ren, Kaixin School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China USTC and Loongson Technology Associated Laboratory Institute of Advanced Technology University of Science and Technology of China Hefei 230027 China Anhui Province Key Laboratory of Computing and Communication Software Hefei 230027 China

Basic Linear Algebra Subroutines (BLAS) is a widely used basic mathematical library for high-performance computing. It has a great impact on the performance of supercomputers. This paper focuses on memory accessing optimization for the level-2 library of BLAS (BLAS2) based on Godson-3B chips. The key contribution of this work is proposing several methods to make full use of the Godson-3B's hardware features, as well as to improve the performance of memory access. GEMV, the kernel function of BLAS2, is selected to demonstrate the optimization methods for Godson-3B. Using Single Instruction Multiple Data (SIMD) instructions, Direct Register Access (DRA) and Direct Cache Access (DCA) of Godson-3B, two optimization algorithms for GEMV are introduced in this paper. Experiments show that the best computing performance of the optimized GEMVs on Godson-3B is more than 1.8Gops, which is far superior to that of other versions. While the test scale of GEMVs is greater than the size of L2-cache, its average performance exceeds UBLAS and OpenBlas, the two most famous optimized BLAS libraries for GODSON, by more than 60% and 20% respectively. © 2014 Binary Information Press.

关键词： Supercomputers

来源：评论

学校读者我要写书评

暂无评论

Eye localization from infrared thermal images

Eye localization from infrared thermal images

引用

1st IAPR TC3 Workshop on Multimodal Pattern Recognition of Social Signals in Human-computer-Interaction, MPRSS 2012

作者： Wang, Shangfei Shen, Peijia Liu, Zhilei Key Lab. of Computing and Communication Software of Anhui Province School of Computer Science and Technology University of Science and Technology of China HeFei AnHui 230027 China

ISBN: (纸本)9783642370809

By using the knowledge of facial structure and temperature distribution, this paper proposes an automatic eye localization method from infrared thermal images. A facial structure consisting of 15 sub-regions is proposed to extract Haar-like features. Eight classifiers are learned from the features selected by Adaboost algorithm for left and right eye, respectively. A vote strategy is used to find the most likely eyes. Experimental results on the NVIE and Equinox databases show the effectiveness of our approach. © 2013 Springer-Verlag.

关键词： Adaptive boosting

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：