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

IEEE/WIC/ACM International Conference on Intelligent Agent technology (IAT)

作者： Junzhong Ji Zhen Huang Chunnian Liu Xuejing Liu Ning Zhong College of Computer Science and Technology Beijing Municipal Key Laboratory of Multimedia and Intelligent Software Technology Beijing University of Technology Beijing China School of Information Engineering Shijiazhuang University of Economics Shijiazhuang China Department of Information Engineering Maebashi Institute of Technology Maebashi Japan

ISBN: (纸本)9780769530277

Ant colony optimization (ACO) algorithm is a metaheuristic and stochastic search technology, which has been one of the effective tools for solving discrete optimization problems. However, there are two bottlenecks for large-scaled optimization problems: the ACO algorithm needs too much time to convergent and the solutions may not be really optimal. This paper proposes a novel ACO algorithm for the multidimensional knapsack problems (MKP), which employs a new pheromone diffusion model and a mutation scheme. First, in light of the preference to better solutions, the association distances among objects are mined in each iteration with top-k strategy. Then, a pheromone diffusion model based on info fountain of an object is established, which strengthens the collaborations among ants. Finally, an unique mutation scheme is applied to optimizing the evolution results of each step. The experimental results for the benchmark testing set of MKPs show that the proposed algorithm can not only get much more optimal solutions but also greatly enhance convergence speed.

关键词： Ant colony optimization Multidimensional systems Genetic mutations Intelligent agent software algorithms Benchmark testing Educational institutions computer science Laboratories software tools

来源：评论

学校读者我要写书评

暂无评论

Real-Time Component Composition Using Hierarchical Timed Automata

Real-Time Component Composition Using Hierarchical Timed Aut...

引用

International Conference on Quality software

作者： Xianli Jin Huadong Ma Zonghua Gu Beijing Key Laboratory of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China

In component-based software development, it is important to use formal models to describe component composition. However, the existing component composition models generally ignore real-time issues. We present a formal integration model based on Hierarchical Timed Automata (HTA) for real-time software system. We present formal definition of components and different component composition techniques. We then introduce the notions of composable and compatible composition, and use Multiset Labeled Transition Systems to represent the interface actions of HTA to perform compositional verification. This hierarchical and unified framework establishes the foundation for formal analysis of real-time properties of the system.

关键词： Automata Clocks Real time systems Synchronization Programming Arithmetic computer science software systems Tree data structures Operating systems

来源：评论

学校读者我要写书评

暂无评论

Study on Spatial Windows of Stationary Processes in Communication System

引用

通讯和计算机（中英文版） 2007年第1期4卷 46-48页

作者： LIU Gan RUAN You-lin Department of Electronics and Information Engineering Huazhong University of Science and Technology Wuhan 430074 China Department of Electronics and Information Engineering Hubei University Wuhan 430062 China School of Information Engineering Wuhan University of Technology Wuhan 430070 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China

来源：评论

学校读者我要写书评

暂无评论

Image fusion algorithm based on neighbors and cousins information in nonsubsampled contourlet transform domain

Image fusion algorithm based on neighbors and cousins inform...

引用

International Conference on Wavelet Analysis and Pattern Recognition (ICWAPR)

作者： Xiao-Bo Qu Guo-Fu Xie Jing-Wen Yan Zi-Qian Zhu Ben-Gang Chen Department of Communication Engineering Xiamen University Xiamen China Department of Software Engineering Xiamen University Xiamen China Key Laboratory of Computer Science Chinese Academy and Sciences Beijing China Key Laboratory of Intelligent Manufacturing Technology Ministry of Education Shantou China Research Institute of Chinese Radar Electronic Equipment Wuxi China

Nonsubsampled contourlet transform (NSCT) provides flexible multiresolution, anisotropy and directional expansion for images. Compared with the foremost contourlet transform, it is shift-invariant and can overcome the pseudo-Gibbs phenomena around singularities. In addition, coefficients of NSCT are dependent on their neighborhood coefficients in the local window and cousin coefficients in directional subbands. In this paper, region energy and cousin correlation are defined to represent the neighbors and cousins information, respectively. Salience measure, as the combination of region energy and cousin correlation, is defined to obtain fused coefficients in the high-frequency NSCT domain. First, source images are decomposed into subimages via NSCT. Secondly, salience measure is computed. Thirdly, salience measure-maximum-based rule and average rule are employed to obtain high-frequency and low-frequency coefficients, respectively. Finally, fused image is reconstructed by inverse NSCT. Experimental results show that the proposed algorithm outperforms wavelet-based fusion algorithms and contourlet transform-based fusion algorithms.

关键词： Image fusion Wavelet transforms Filter bank Wavelet analysis Wavelet domain Image analysis Pattern analysis Pattern recognition Laboratories

来源：评论

学校读者我要写书评

暂无评论

Feature Selection and Partial Least Squares Based Dimension Reduction for Tumor Classification

Feature Selection and Partial Least Squares Based Dimension ...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Hua-Long Bu Guo-Zheng Li Xue-Qiang Zeng Jack Y. Yang Mary Qu Yang School of Computer Engineering & Science Shanghai University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China Harvard Medical School Harvard University Cambridge MA USA U.S. Department of Health and Human Services Bethesda National Institutes of Health MD USA

Partial least squares (PLS) is one of the widely used dimension reduction methods for analysis of gene expression microarray data, it represents the data in a low dimensional space through linear transformation, the size of the reduced space by PLS is critical to generalization performance of classifiers. The previous works always determined the top fixed number of components or the top several components by cross-validation. Here we demonstrate the usage of feature selection for PLS based dimension reduction. As a case study, PLS is combined with two feature selection methods (genetic algorithm and sequential backward floating selection) to get more robust and efficient dimensional space, and then the constructed data from the selected components is used as input for the support vector machine (SVM) classifier. We use the method for tumor classification on gene microarray data, experimental results illustrate that our proposed framework is effective both to reduce classification error rates and get compact dimensional space.

关键词： Least squares methods Neoplasms Gene expression Support vector machines Support vector machine classification Feature extraction Data mining Humans Genomics Bioinformatics

来源：评论

学校读者我要写书评

暂无评论

Probabilistic bisimulations for quantum processes

引用

Information and Computation 2007年

作者： Yuan Feng Runyao Duan Zhengfeng Ji Mingsheng Ying State Key Laboratory of Intelligent Technology and Systems Department of Computer Science and Technology Tsinghua University Beijing 100084 China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences Beijing 100084 China

来源：评论

学校读者我要写书评

暂无评论

Support Vector Regression with Feature Selection for the Multivariate Calibration of Spectrofluorimetric Determination of Aromatic Amino Acids

Support Vector Regression with Feature Selection for the Mul...

引用

IEEE Symposium on Bioinformatics and Bioengineering (BIBE)

作者： Guo-Zheng Li Hao-Hua Meng Mary Qu Yang Jack Y. Yang School of Computer Science & Engineering Shanghai University Shanghai China State Key Laboratory for Novel Software Technology Nanjing University Nanjing China National Human Genome Research Institute U.S. Department of Health and Human Services National Institutes of Health DHHS Bethesda MD USA Harvard Medical School Harvard University Cambridge MA USA

Several artificial intelligent methods, including support vector regression (SVR), artificial neural networks (ANNs), and partial least square (PLS) are used for the multivariate calibration in the determination of the three aromatic amino acids (phenylalanine, tyrosine and tryptophan) in their mixtures by fluorescence spectroscopy. The results of the leave-one-out method show that SVR perform better than other methods, and appear to be good methods for this task. Furthermore, feature selection is performed for SVR to remove redundant features and a novel algorithm named PRIFER (prediction risk based feature selection for support vector regression) is proposed. Results on the above multivariate calibration data set show that PRIFER is a powerful tool for solving the multivariate calibration problems.

关键词： Calibration Amino acids Fluorescence Humans Bioinformatics Artificial neural networks Prediction algorithms Chemistry Kernel Spectroscopy

来源：评论

学校读者我要写书评

暂无评论

Remove Irrelevant Atomic Formulas for Timed Automaton Model Checking

引用

Journal of computer science & technology 2006年第1期21卷 41-51页

作者：赵建华李宣东郑滔郑国梁 State Key Laboratory of Novel Software Technology Nanjing University Nanjing 210093 P.R. China Department of Computer Science and Technology Nanjing University Nanjing 210093 P.R. China

Most of the timed automata reachability analysis algorithms in the literature explore the state spaces by enumeration of symbolic states, which use time constraints to represent a set of concrete states. A time constraint is a conjunction of atomic formulas which bound the differences of clock values. In this paper, it is shown that some atomic formulas of symbolic states generated by the algorithms can be removed to improve the model checking time- and spaceefficiency. Such atomic formulas are called as irrelevant atomic formulas. A method is also presented to detect irrelevant formulas based on the test-reset information about clock variables. An optimized model-checking algorithm is designed based on these techniques. The case studies show that the techniques presented in this paper significantly improve the space- and time-efficlency of reachability analysis.

关键词： formal method model checking timed automaton

来源：评论

学校读者我要写书评

暂无评论

Research on Cognitive Cooperation in Multi-Agent Systems

引用

Wuhan University Journal of Natural sciences 2006年第1期11卷 278-282页

作者： SUN Juan DOU Wan-chun State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 JiangsuChina Department of Computer Science and Technology Nanjing University Nanjing 210093Jiangsu China

The accomplishment of a complex problem usually involves cooperation between participators with different knowledge background concerned. This paper identifies interdependency between different sub problems （through problem decomposition） as the major factor that influences cooperative relations in multi-Agent systems, based on which we propose an efficient means to measure cooperation coefficient （degree） between different Agents. Then cognitive cooperation between Agents is analyzed which aims at collecting the wisdom of the cognitive community for a systematic solution to the overall problem.

关键词： multi-Agent systems cognitive cooperation knowledge flow

来源：评论

学校读者我要写书评

暂无评论

Using JavaCard to Guarantee Protection for Remote Mobile Agent

引用

电子学报(英文版) 2006年第3期15卷 417-421页

作者： LI Jie WANG Ruchuan Department of Computer Science and Technology Nanjing University of Posts and Telecommunications Nanjing 210003 China State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China College of Computer Science ＆ Information Henan University Kaifeng 475001 China

As a new distributed computing technology, mobile agent has a wide application prospect. But the protection of mobile agent in remote agent platform is an awkward problem because agent is completely exposed in remote host and it is easy to be isolated and attacked by the malicious host. A solution is puts forward by using JavaC-ard to supply a secure execution environment for agent. First, attack of agent and current research status are analyzed. Then the detailed solution based on JavaCard is given;Later a bran-new partition method and distribution algorithm is put forward;Last, the experiment system model is analyzed and testified by using three kinds of aggressive methods. The experiment result of the proposed partition algorithm shows a high efficiency and reliability.

关键词：移动代理安全性保护策略分布计算技术

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：