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

International Workshop on Artificial Immune Systems, AIS 2015

作者： Wu, Linli 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: (纸本)9781509002986

Existing data publication methods retain the relationship between the quasi-identifier attributes and sensitive attributes of published data. We call them "positive data publication". However, it will lead to potential risk that attackers could deduce the privacy of the corresponding individuals from the published data. Recently, by combining the negative representation with k-anonymity and l-diversity, (k, m)- anonNPD and (l, m)-divNPD algorithms have been proposed, which improve the degree of privacy because the sensitive value of each individual is transformed into a negative value randomly. However, to reduce the average error of the reconstructed distribution, the data published by (k, m)-anonNPD and (l, m)-divNPD are often much larger than the original data. In this paper, we take the Sensitive Value Distribution into consideration, and propose a novel Negative Data Publication approach (i.e. SvdNPD), which is based on l-diversity. According to the sensitive value distribution, the negative selection probability of the sensitive attribute in each record can be calculated. Then the data could be published by transforming the sensitive value to a negative one with this probability. Experimental results show that the effective usage of the individual sensitive value distribution could enhance the utility of published data. Meanwhile, compared with (l, 1)-divNPD, SvdNPD just sacrifices a tiny privacy degree which is acceptable. © 2015 IEEE.

关键词： Metadata

来源：评论

学校读者我要写书评

暂无评论

Fast searching optimal negative surveys

Fast searching optimal negative surveys

引用

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

来源：评论

学校读者我要写书评

暂无评论

Evolutionary clustering with differential evolution

Evolutionary clustering with differential evolution

引用

Congress on Evolutionary computation

作者： Gang Chen Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary clustering is a hot research topic that clusters the time-stamped data and it is essential to some important applications such as data streams clustering and social network analysis. An evolutionary clustering should accurately reflect the current data at any time step while simultaneously not deviate too drastically from the recent past. In this paper, the differential evolution (DE) is applied to deal with the evolutionary clustering problem. Comparing with the typical k-means, evolutionary clustering based on DE (deEC) could perform a global search in the solution space. Experimental results over synthetic and real-world data sets demonstrate that the deEC provides robust and adaptive solutions.

关键词： Clustering algorithms History Vectors Evolutionary computation Equations Sociology Statistics

来源：评论

学校读者我要写书评

暂无评论

Differential evolution with a species-based repair strategy for constrained optimization

Differential evolution with a species-based repair strategy ...

引用

Congress on Evolutionary computation

作者： Chenyang Bu Wenjian Luo Tao Zhu Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

ISBN: (纸本)9781479914869

Evolutionary Algorithms (EAs) with gradient-based repair, which utilize the gradient information of the constraints set, have been proved to be effective. It is known that it would be time-consuming if all infeasible individuals are repaired. Therefore, so far the infeasible individuals to be repaired are randomly selected from the population and the strategy of choosing individuals to be repaired has not been studied yet. In this paper, the Species-based Repair Strategy (SRS) is proposed to select representative infeasible individuals instead of the random selection for gradient-based repair. The proposed SRS strategy has been applied to εDEag which repairs the random selected individuals using the gradient-based repair. The new algorithm is named SRS-εDEag. Experimental results show that SRS-εDEag outperforms εDEag in most benchmarks. Meanwhile, the number of repaired individuals is reduced markedly.

关键词： Maintenance engineering Sociology Statistics Vectors Equations Clustering algorithms Mathematical model

来源：评论

学校读者我要写书评

暂无评论

An improved genetic algorithm for dynamic shortest path problems

An improved genetic algorithm for dynamic shortest path prob...

引用

Congress on Evolutionary computation

作者： Xuezhi Zhu Wenjian Luo Tao Zhu Anhui Province key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China

The Shortest Path (SP) problems are conventional combinatorial optimization problems. There are many deterministic algorithms for solving the shortest path problems in static topologies. However, in dynamic topologies, these deterministic algorithms are not efficient due to the necessity of restart. In this paper, an improved Genetic Algorithm (GA) with four local search operators for Dynamic Shortest Path (DSP) problems is proposed. The local search operators are inspired by Dijkstra's Algorithm and carried out when the topology changes to generate local shortest path trees, which are used to promote the performance of the individuals in the population. The experimental results show that the proposed algorithm could obtain the solutions which adapt to new environments rapidly and produce high-quality solutions after environmental changes.

关键词： Sociology Statistics Heuristic algorithms Topology Algorithm design and analysis Digital signal processing Biological cells

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Real-Valued Negative Databases 12

Real-Valued Negative Databases

引用

12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013

作者： Zhao, Dongdong Luo, Wenjian 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: (纸本)9780262317092

The negative database (NDB) is the negative representation of original data. Existing work has demonstrated that NDB can be used to preserve privacy and hide information. However, most work about NDB is based on binary representation. In some applications which are naturally descripted in real-valued space, the binary negative database is hard to be applied appropriately. Therefore, the real-valued negative database is proposed in this paper, and reversing the real-valued negative database is proved to be an NP-hard problem. Moreover, an effective algorithm for generating real-valued negative databases is given. Finally, an example of applying the realvalued negative database to the privacy-preserving data publication is descripted, and it shows that the real-valued negative database is valuable in practice. © 2013 Proceedings of the 12th European Conference on the Synthesis and Simulation of Living Systems: Advances in Artificial Life, ECAL 2013. All rights reserved.

关键词： computational complexity

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：