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

Interactive PBIL with Multiple Probability Vectors for Multimodal Optimization with Implicit Performance Indices

Interactive PBIL with Multiple Probability Vectors for Multi...

2010 2nd International Conference on computer Engineering and Technology(2010年第二届计算机工程与技术国际会议 ICCET 2010)

作者： Haifeng You Xufa Wang Department of Computer Science and Technology Anhui Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei China

ISBN: (纸本)9781424463473

Interactive population-based incremental learning (IPBIL) is an effective method to solve optimization problems with implicit performance indices. It can significantly reduce user fatigue compared with interactive evolutionary computation (IEC). However,each run of IPBIL can only find one solution or some similar solutions. Thus it is not suitable for multimodal optimization problems with implicit performance indices. To solve this problem,we propose an IPBIL with multiple probability vectors (IPBIL-MPV) in this work. The key idea is to utilize multiple probability vectors to catch different search directions and thus find more than one solutions. We perform a subjective experiment in which IPBIL-MPV is applied to a fashion design problem. The experimental results show that IPBIL-MPV can find several distinct solutions in a run. Thus it is an effective method to solve multimodal optimization problems with implicit performance indices.

关键词： population-based incremental learning multimodal optimization:implicit performance indices:fashion design

来源：评论

学校读者我要写书评

暂无评论

Extended Doo-Sabin surfaces

引用

Journal of Information and Computational Science 2011年第12期8卷 2239-2247页

作者： Huang, Zhangjin Wang, Feng Wang, Guoping School of Computer Science and Technology University of Science and Technology of China China Key Laboratory of Software in Computing and Communication Anhui Province China USTC-SICT Joint Laboratory on Network and Communication China Peking University China School of Electronic Engineering and Computer Science Peking University China

In this paper we propose a modification of quadratic NURSSes called EDSes (Extended Doo-Sabin Surfaces). EDSes inherit the refinement rules for quadratic NURSSes for four-sided faces but use the refinement rules for Doo-Sabin surfaces for faces with other than four sides. Compared to quadratic NURSSes, if all the knot intervals are positive, EDSes always converge to G1 continuous limit surfaces with closed-form limit point as well as limit normal rules. 1548-7741/Copyright © 2011 Binary Information Press.

关键词： Information 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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Estimating properties of chaotic system based on S-NURBS resampling method

Estimating properties of chaotic system based on S-NURBS res...

引用

International Conference on Measurement, Information and Control (MIC)

作者： Chenxi Shao Qingqing Liu Tingting Wang Binghong Wang Anhui Province Key Laboratory of Software in Computing and Communication University of Science and Technology of China Hefei China Computer Science and Technology Department University of Science and Technology of China Hefei China

ISBN: (纸本)9781479913916

Physical properties of the chaotic system play important roles on studying the innate character and deciding the practical predictability of the dynamics. For a short piece of undersampled chaotic signals, it is very hard to abstract the physical properties of the signal source from the sequence. In this paper, we model this type of data with global S-NURBS method to reconstruct a smooth trajectory and resample the trajectory to get enough series. In this way, the problem of estimating the physical properties from small undersampled data is turned to the work of calculating the properties of the resampled time series. The new interpolation method is named as S-NURBS resampling method, and the simulation experiment demonstrates that the new method has a good performance in studying physical systems from the observed time series.

关键词： Time series analysis Interpolation Trajectory Chaos Splines (mathematics) Surface topography Surface reconstruction

来源：评论

学校读者我要写书评

暂无评论

Constructing the Voronoi Diagram of Planar Point Set in Parallel

Constructing the Voronoi Diagram of Planar Point Set in Para...

引用

International Conference on Computational Intelligence and software Engineering (CiSE)

作者： Lanfang Dong Yuan Wu Shanhai Zhou Anhui Province Key Laboratory of Software In Computing and Communication College of computer science and technology University of Science and Technology Hefei China College of computer science & technology University of Science and Technology Hefei China

By researching Voronoi diagram, parallel algorithm, and divide-and-conquer method, we present a special data structure(change doubly-connected list little) for Voronoi diagram generation in parallel. In this paper we also present two proposal, they are one processor gradually to merge and 22-merger on the parallel machine, the experiment results show that the present algorithm runs faster than the serial program. By analyzing the various results, we should choose the most suitable number of processors according to the point set scale. At last, we can conclude that gradually merger with one processor is better proposal for Voronoi diagram parallel generation.

关键词： Data structures Educational institutions computer science Parallel algorithms Proposals Switches Merging Concurrent computing Parallel machines Geography

来源：评论

学校读者我要写书评

暂无评论

Non-reference virtual view quality evaluation of MVD

引用

Journal of Shanghai University(English Edition) 2011年第4期15卷 342-346页

作者：张艳安平张秋闻王元庆张兆杨 School of Communication and Information Engineering Shanghai University Department of Computer Science and Technology Anhui University of Finance and EconomicsBengbu 230030AnhuiP.R.China Key Laboratory of Advanced Display and System Application (shanghai University) Ministry of Education Department of Electronics Science and Engineering Nanjing University

The quality of virtual view based on multi-view video （MVD） plus depth format is often evaluated by PSNR or subjectively judged. However, due to synthesizing arbitrary view images, the virtual view images mostly have no reference images and are only assessed using non-reference. Virtual view images synthesized by depth estimation reference software （DERS） and view synthesis reference software （VSRS） often accompanied with blockiness and other distortions on the edge. In addition, matching level for the depth map and the corresponding texture maps of left and right views also affects the quality of the virtual view. This paper compares the edge similarity of the depth and the corresponding texture maps which generate the intermediate virtual view and combined with the virtual view＇s blockiness which causing blur to evaluate the quality of the virtual view. Experiment results show that the proposed method can reflect the quality of the virtual view better.

关键词： non-reference quality evaluation virtual view multi-view video （MVD） plus depth free viewpoint television （FTV）

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A real-time schedule method for aircraft landing scheduling problem based on cellular automaton 09

A real-time schedule method for aircraft landing scheduling ...

引用

2009 World Summit on Genetic and Evolutionary Computation, 2009 GEC Summit - 1st ACM/SIGEVO Summit on Genetic and Evolutionary Computation, GEC'09

作者： Shenpeng, Yu Xianbin, Cao Maobin, Hu Wenbo, Du Jun, Zhang Department of Computer Science and Technology University of Science and Technology of China Hefei 230026 86-551-3601545 China Anhui Province Key Laboratory of Software in Computing and Communication Hefei 230026 China School of Engineering Science University of Science and Technology of China Hefei 230026 86-551-3600127 China School of Electronic and Information Engineering Beihang University Beijing 100083 China

ISBN: (纸本)9781605583266

The Aircraft Landing Scheduling (ALS) problem is a typical hard multi-constraint optimization problem. In real applications, it is not most important to find the best solution but to provide a feasible landing schedule in an acceptable time. We propose a novel approach which can effectively solve the ALS while satisfying the real-time need. It consists of two steps: (i) Use CA to simulate the landing process in the terminal airspace and to find a considerably good landing sequence;(ii) a simple Genetic Algorithm associated with a Relaxation Operator is used to obtain a better result based on the CA result. Experiments have shown that our method is much faster and suitable for real-time ALS problem compared with traditional optimization methods. For all the 13 data sets, the proposed approach can find satisfactory solutions in less than 2 seconds. Copyright 2009 ACM.

关键词： Cellular automata

来源：评论

学校读者我要写书评

暂无评论

A Lightweight OS-Level Virtualization Architecture Based on Android

A Lightweight OS-Level Virtualization Architecture Based on ...

引用

2017 2nd International Conference on computer, Network Security and communication Engineering(CNSCE2017)

作者： Bo-wen LIU Nai-jie GU De-he GU School of Computer Science and Technology University of Science and Technology of China Institute of Advanced Technology University of Science and Technology of China Anhui Province Key Laboratory of Computing and Communication Software

All kinds of intelligent terminal equipment emerge in endlessly and grow explosively. Typical devices, such as smartphones and tablets, are becoming more and more popular, furthermore, intelligent equipment market share has more than that on PCs. And on mobile devices area, the demand for virtualization technology is gradually increasing. As an important branch of computer technology development, operating system level virtualization is becoming a hot spot of current research due to its low overhead and the advantages of lightweight. In this paper, based on the Android system on mobile devices, implement a prototype which can run multiple virtual system instances on only an Android OS by modifying the namespace mechanism in the Linux kernel to and expand into driver namespace mechanism. In addition, put forward a model called the active-inactive model guaranteeing the process if and only if in the active namespace to operate the device drivers, which was designed and implemented a new scheme of operating system level virtualization.

关键词： Virtualization Android Namespace

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：