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

Clustering time-evolving data using an efficient differential evolution 6th

Clustering time-evolving data using an efficient differentia...

6th International Conference on Swarm Intelligence, ICSI 2015 held in conjunction with the 2nd BRICS Congress on Computational Intelligence, CCI 2015

作者： Chen, Gang Luo, Wenjian Anhui Province key Laboratory of Software Engineering in Computing and Communication School of Computer Science and Technology University of Science and Technology of China HefeiAnhui China

ISBN: (纸本)9783319204659

The previous evolutionary clustering methods for time-evolving data usually adopt the temporal smoothness framework, which controls the balance between temporal noise and true concept drift of clusters. They, however, have two major drawbacks: (1) assuming a fixed number of clusters over time;(2) the penalty term may reduce the accuracy of the clustering. In this paper, a Multimodal Evolutionary Clustering (MEC) based on Differential Evolution (DE) is presented to cope with these problems. With an existing chromosome representation of the ACDE, the MEC automatically determines the cluster number at each time step. Moreover, instead of adopting the temporal smoothness framework, we try to deal with the problem from view of the multimodal optimization. That is, the species-based DE (SDE) for multimodal optimization is adopted in the MEC. Thus the MEC is a hybrid of the ACDE and the SDE, and designed for time-evolving data clustering. Experimental evaluation demonstrates the MEC achieves good results. © Springer International Publishing Switzerland 2015.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Learning with privileged information using Bayesian networks

引用

Frontiers of computer Science 2015年第2期9卷 185-199页

作者： Shangfei WANG Menghua HE Yachen ZHU Shan HE Yue LIU Qiang JI School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Lab of Computing and Communicating Software of Anhui Province Hefei 230027 China School of Mathematical Sciences University of Science and Technology of China Hefei 230027 China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY 12180-3590 USA

For many supervised learning applications, addi- tional information, besides the labels, is often available dur- ing training, but not available during testing. Such additional information, referred to the privileged information, can be exploited during training to construct a better classifier. In this paper, we propose a Bayesian network （BN） approach for learning with privileged information. We propose to in- corporate the privileged information through a three-node BN. We further mathematically evaluate different topologies of the three-node BN and identify those structures, through which the privileged information can benefit the classifica- tion. Experimental results on handwritten digit recognition, spontaneous versus posed expression recognition, and gender recognition demonstrate the effectiveness of our approach.

关键词： Bayesian network privileged information clas-sification maximum likelihood estimation

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems, AIS 2015

作者： Zhao, Dongdong Luo, Wenjian Liu, Ran Yue, Lihua 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 School of Computer Science China University of Geosciences Wuhan430074 China

ISBN: (纸本)9781509002986

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the Khidden algorithm for generating hard-to-reverse NDBs (called Khidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the Khidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the qhidden-NDB. © 2015 IEEE.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

A fine-grained algorithm for generating hard-toreverse negative databases

A fine-grained algorithm for generating hard-toreverse negat...

引用

International Workshop on Artificial Immune Systems (AIS)

作者： Dongdong Zhao Wenjian Luo Ran Liu Lihua Yue Anhui Province Key Laboratory of Software Engineering in Computing and Communication University of Science and Technology of China Hefei Anhui China School of Computer Science China University of Geosciences Wuhan China

The negative database (NDB) is a new technique for privacy preserving and information hiding. It hides information by storing the complementary set instead of the original data. In order to protect the hidden information, NDBs should be hard-to-reverse. In this paper, we propose the K-hidden algorithm for generating hard-to-reverse NDBs (called K-hidden-NDBs). The K-hidden algorithm could be controlled in a more fine-grained manner than existing NDB generation algorithms. Moreover, in terms of the SAT solvers based on the local search strategy, we formally prove that the K-hidden-NDBs could be more hard-to-reverse than the NDBs generated by the typical p-hidden algorithm. Furthermore, we show that the K-hidden-NDB could be more hard-to-reverse (against the local search strategy) than the q-hidden-NDB (NDBs generated by the q-hidden algorithm) when the sizes of NDBs are the same. Finally, as for the Unit Clause heuristic solvers, we prove that the K-hidden-NDB could be the same hard-to-reverse as the q-hidden-NDB.

关键词： Search problems Databases Security Data privacy Algorithm design and analysis computer science NP-hard problem

来源：评论

学校读者我要写书评

暂无评论

A hybrid active contour model with local Gaussian distribution fitting energy for image segmentation

引用

Journal of Information and Computational Science 2015年第17期12卷 6515-6523页

作者： Zhang, Runru Huang, Zhangjin Gu, Naijie School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software Hefei China Institute of Advanced Technology University of Science and Technology of China Hefei China

Active contour models have been widely applied in image segmentation with promising results. However, many of them fail to segment images successfully due to intensity inhomogeneity. To address this problem, we propose a hybrid region-based active contour model which fully utilizes local intensity information. This model develops a localized active contour framework and incorporates a local Gaussian distribution fitting energy. In order to increase both the computational efficiency and stability of the proposed model, a multi-resolution strategy is employed and the active contour is evolved in a reinitialization-free way. Extensive experiments demonstrate that our model is effective and efficient in segmenting images with intensity inhomogeneity, and outperforms several state-of-the-art algorithms. © 2015 by Binary Information Press.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

Performance research and optimization on CPython's interpreter

Performance research and optimization on CPython's interpret...

引用

Federated Conference on computer Science and Information Systems (FedCSIS)

作者： Huaxiong Cao Naijie Gu Kaixin Ren Yi Li Anhui Province Key Laboratory of Computing and Communication Software Department of Computer Science and Technology University of Science and Technology of China Institute of Advanced Technology University of Science and Technology of China Hefei China

ISBN: (纸本)9781479967476

In this paper, the performance research on CPython's latest interpreter is presented, concluding that bytecode dispatching takes about 25 percent of total execution time on average. Based on this observation, a novel bytecode dispatching mechanism is proposed to reduce the time spent on this phase to a minimum. With this mechanism, the blocks associated with each kind of bytecodes are rewritten in hand-tuned assembly, their opcodes are renumbered, and their memory spaces are rescheduled. With these preparations, this new bytecode dispatching mechanism replaces the time-consuming memory reading operations with rapid operations on registers. This mechanism is implemented in CPython-3.3.0. Experiments on lots of benchmarks demonstrate its correctness and efficiency. The comparison between original CPython and optimized CPython shows that this new mechanism achieves about 8.5 percent performance improvement on average. For some particular benchmarks, the maximum improvement is up to 18 percentages.

关键词： Dispatching Benchmark testing Binary codes Switches Optimization Registers Instruction sets

来源：评论

学校读者我要写书评

暂无评论

Emotion recognition from thermal infrared images using deep Boltzmann machine

引用

Frontiers of computer Science 2014年第4期8卷 609-618页

作者： Shangfei WANG Menghua HE Zhen GAO Shan HE Qiang JI School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Lab of Computing and Communicating Software of Anhui Province Hefei 230027 China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY 12180-3590 USA

Facial expression and emotion recognition from thermal infrared images has attracted more and more attentions in recent years. However, the features adopted in current work are either temperature statistical parameters extracted from the facial regions of interest or several hand-crafted features that are commonly used in visible spectrum. Till now there are no image features specially designed for thermal infrared images. In this paper, we propose using the deep Boltzmann machine to learn thermal features for emotion recognition from thermal infrared facial images. First, the face is located and normalized from the thermal infrared im- ages. Then, a deep Boltzmann machine model composed of two layers is trained. The parameters of the deep Boltzmann machine model are further fine-tuned for emotion recognition after pre-tralning of feature learning. Comparative experimental results on the NVIE database demonstrate that our approach outperforms other approaches using temperature statistic features or hand-crafted features borrowed from visible domain. The learned features from the forehead, eye, and mouth are more effective for discriminating valence dimension of emotion than other facial areas. In addition, our study shows that adding unlabeled data from other database during training can also improve feature learning performance.

关键词： emotion recognition thermal infrared images deep Boltzmann machine

来源：评论

学校读者我要写书评

暂无评论

Fusion of visible and thermal images for facial expression recognition

引用

Frontiers of computer Science 2014年第2期8卷 232-242页

作者： Shangfei WANG Shan HE Yue WU Menghua HE Qiang JI School of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Key Lab of Computing and Communicating Software of Anhui Province Hefei 230027 China Department of Electrical Computer and Systems Engineering Rensselaer Polytechnic Institute Troy NY12180-3590 USA

Most present research into facial expression recognition focuses on the visible spectrum, which is sen- sitive to illumination change. In this paper, we focus on in- tegrating thermal infrared data with visible spectrum images for spontaneous facial expression recognition. First, the ac- tive appearance model AAM parameters and three defined head motion features are extracted from visible spectrum im- ages, and several thermal statistical features are extracted from infrared （IR） images. Second, feature selection is per- formed using the F-test statistic. Third, Bayesian networks BNs and support vector machines SVMs are proposed for both decision-level and feature-level fusion. Experiments on the natural visible and infrared facial expression （NVIE） spontaneous database show the effectiveness of the proposed methods, and demonstrate thermal 1R images＇ supplementary role for visible facial expression recognition.

关键词： facial expression recognition feature-level fu-sion decision-level fusion support vector machine Bayesiannetwork thermal infrared images visible spectrum images

来源：评论

学校读者我要写书评

暂无评论

SvdNPD: A negative data publication method based on the sensitive value distribution

SvdNPD: A negative data publication method based on the sens...

引用

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

来源：评论

学校读者我要写书评

暂无评论

Tuning linux's load balancing algorithm for CMT system

Tuning linux's load balancing algorithm for CMT system

引用

2013 IEEE Conference Anthology, ANTHOLOGY 2013

作者： Peng, Jianzhang Gu, Naijie Li, Yehua Xu, Zhang School of Computer Science and Technology University of Science and Technology of China Hefei China Anhui Province Key Laboratory of Computing and Communication Software USTC SICT Joint Laboratory of Network and Communication Hefei China

ISBN: (纸本)9781479916603

Linux 2.6 load balancing algorithm on scheduling domain supports CMP, CMT, SMP, NUMA architecture. For SMT, the algorithm try to assign the new process to the idlest CPU of the idlest core, and if the first CPU of a core is comparati vely idle, it tries to pull moderate amount of tasks from the busiest CPU of the core to balance the system workload periodically. Under certain circumstances, this strategy would cause the system to be more unbalanced. For the above defects, the algorithm can be adjusted in two ways. (1) The idlest CPU of the entire system should be selects for the new process;(2) the idlest CPU of a scheduling domain periodically can move tasks from the scheduling domain to itself. After applying this optimization, the system's performance achieved the highest increase of 8% in hackbench testing on an 8-core 32-thread XLR532 processor. © 2013 IEEE.

关键词： Linux

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：