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

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Jian Wang Yanheng Liu Xin Sun Yu Jiao College of Computer Science and Technology Jilin University Changchun Jilin 130012 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun Jilin 130012 China

Internet is a complex network with the characteristic of self-organized criticality. The cascading dynamics of Internet are presented and two reasons are pointed out, which may cause cascading failures. Different from betweenness centrality, a congestion function to represent the extent of congestion is proposed. By introducing the concept of "delay time", the correlation between permanent removing and non-removing is built. And a new evaluation function of network efficiency based on congestion function is given in order to measure the damage of cascading failures. Moreover some effects of network structure and size, delay time on congestion propagation are also investigated, and cascading process composed of three phases and some factors affecting cascade propagation are uncovered.

关键词： Internet complex network cascading failures propagation model network topology.

来源：评论

学校读者我要写书评

暂无评论

Self-organization based divide and conquer algorithm for distributed constraint optimization problems

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2008年第11期45卷 1831-1839页

作者： Huang, Jing Liu, Dayou Yang, Bo Jin, Di College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China

Distributed constraint optimization problem (DCOP) is a kind of optimization problem oriented to large-scale, open and dynamic network environments, which has been widely applied in many fields such as computational grid, multimedia networks, e-business, enterprise resource planning and so on. Besides the features such as non-linear and constraint-satisfaction which the traditional optimization problems have, DCOP has its distinct features including dynamic evolution, regional information, localized control and asynchronous updating of network states. It has become a challenge for computer scientists to find out a large-scale, parallel and intelligent solution for DCOP. So far, there have been a lot of methods for solving this problem. However, most of them are not completely decentralized and require prior knowledge such as the global structures of networks as their inputs. Unfortunately, for many applications the assumption that the global views of networks can not be obtained beforehand is not true due to their huge sizes, geographical distributions or decentralized controls. To solve this problem, a self-organizing behavior based divide and conquer algorithm is presented, in which multiple autonomous agents distributed in networks work together to solve the DCOP through a proposed self-organization mechanism. Compared with existing methods, this algorithm is completely decentralized and demonstrates good performance in both efficiency and effectiveness.

关键词： Geographical distribution

来源：评论

学校读者我要写书评

暂无评论

The Application of PSC-CEA in the Process of Resource Allocation Dynamic Policy Triggering during the Switchover of Mobile IP

The Application of PSC-CEA in the Process of Resource All...

引用

International Conference on MultiMedia and Information Technology, MMIT

作者： Wei Da Liu Yan-heng Yu Xue-Gang Hao Jian-ying Li Lian-deng Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Jilin China Jilin University Changchun Jilin CN College of Computer Science and Technology Jilin University China

This paper demonstrates the necessity of the use of PSC-CEA for dynamic policy triggering in the process of mobile IP switching; in the mean time, according to the characteristics of policy based network management, propose a dynamic policy trigger model, and designs a mechanism which is used to update dynamic policy according to known information, experience and knowledge to satisfy the QoS of mobile services and use current network resource sufficiently.

关键词： Resource management Quality of service Space technology Mobile computing Extraterrestrial measurements Technology management Switches Algebra Technology forecasting Information technology

来源：评论

学校读者我要写书评

暂无评论

Logical reinforcement learning method based on heuristic contour list

引用

Jisuanji Yanjiu yu Fazhan/Computer Research and Development 2008年第11期45卷 1824-1830页

作者： Liu, Quan Gao, Yang Chen, Daoxu Sun, Jigui Yao, Wangshu State Key Laboratory for Novel Software Technology Nanjing University Nanjing 210093 China Institute of Computer Science and Technology Soochow University Suzhou 215006 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China

Reinforcement learning gets optimal policy through trial-and-error and interaction with dynamic environment. Its properties of self-improving and online learning make reinforcement learning become one of most important machine learning methods. Against reinforcement learning has been 'curse of dimensionality' troubled by the problem the question, a method of heuristic contour list is proposed on the basis of relational reinforcement learning. The method can represent states, actions and Q-functions through using first-order predications with contour list. Thus advantages of Prolog list can be exerted adequately. The method is to combine logical predication rule with reinforcement learning. A new logical reinforcement learning-CCLORRL is formed and its convergence is proved. The method uses contour shape predicates to build shape state tables, drastically reducing the state space;Using heuristic rules to guide the choice of action can reduce choice blindness when the sample does not exist in the state space. The CCLORRL algorithm is used in the Tetris game. Experiments show that the method is more efficient.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

The Application of Support Vector Machine to Operon Prediction

The Application of Support Vector Machine to Operon Predicti...

引用

International Conference on Future Generation Communication and Networking (FGCN)

作者： Xiumei Wang Wei Du Yan Wang Chen Zhang Chunguang Zhou Shuqin Wang Yanchun Liang College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China

ISBN: (纸本)9781424440085

In this paper, we apply the least-square support vector machine (LS-SVM) to operon prediction of Escherichia coli (***), with different combinations of intergenic distance, gene expression data, and phylogenetic profile. Experimental results demonstrate that the WO pairs tend to have shorter intergenic distances, higher correlation coefficient and much stronger relation of co-envoled between phylogenetic profiles. Also, we dealt with the data sets extracted from WOs¿ and TUBs¿, processed the intergenic distances with log-energy entropy, de-noised the Pearson correlation coefficients of two genes expression data with wavelet transform, and computed the Hamming distances of two phylogenetic profiles. Then we trained LS-SVM using part of the data sets and tested the trained classifier model using the rest data sets. It shows that different combinations of features could affect the prediction results. When the combination of intergenic distance, gene expression data and phylogenetic profile is taken as the input of LS-SVM in the linear kernel type, good results can be obtained, of which the accuracy, sensitivity and specificity are 92.34%, 93.54%, and 90.73%, respectively.

关键词： Support vector machines Phylogeny Gene expression Data mining Entropy Genetic expression Wavelet transforms Testing Kernel Sensitivity and specificity

来源：评论

学校读者我要写书评

暂无评论

Copyright Protection Using A computational Watermarking Scheme

引用

The 9th International Conference for Young Computer Scientists(第九届国际青年计算机大会)

作者： Qi Jiang Dongfeng Han Yi Li Wenhui Li Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China

In this paper an efficient copyright protection watermarking algorithm is proposed. By embedding orthogonal vector into the wavelet-tree structure of the host image, we get the watermarked image. At the same time human vision system is considered to get perceptual results. We design an elaborate function for blind watermarking scheme. This function can dynamically determine the embedding position. The theory and experimental results show that our method successfully survives image processing operation, noise adding, the JPEG lossy compression and image cropping. Especially, the scheme is robust towards image sharpening and image enhancement.

关键词： copyright protection watermark wavelet tree

来源：评论

学校读者我要写书评

暂无评论

An Ant Colony Optimization Method for Prize-collecting Traveling Salesman Problem with Time Windows

An Ant Colony Optimization Method for Prize-collecting Trave...

引用

International Conference on Natural computation (ICNC)

作者： Xiaohu Shi Liupu Wang You Zhou Yanchun Liang Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University Changchun China

Focused on a variation of the Euclidean traveling salesman problem (TSP), namely the prize-collecting traveling salesman problem with time windows (PCTSPTW), this paper presents a novel ant colony optimization solving method. The time window constraints are considered in the computation for the probability of selection of the next city. The parameters of the algorithm are analyzed by experiments. Numerical results also show that the proposed method is effective for the PCTSPTW problem.

关键词： Ant colony optimization Traveling salesman problems Cities and towns Algorithm design and analysis Time factors Performance analysis Educational institutions Computer science Educational technology Laboratories

来源：评论

学校读者我要写书评

暂无评论

Dynamic graph software watermark based on the Chinese Remainder Theorem

引用

Jilin Daxue Xuebao (Gongxueban)/Journal of Jilin University (engineering and Technology Edition) 2008年第SUPPL. 2期38卷 198-201页

作者： Zhu, Jian-Qi Liu, Yan-Heng Yin, Ke-Xin Song, Shuang Key Laboratory of Symbol Computation and Knowledge Engineer College of Computer Science and Technology Jilin University Changchun 130012 China College of Computer Science and Engineering Changchun University of Technology Changchun 130012 China

The watermark is split into a set of shares and represented as a set of graphs, which are embedded into the program dynamically. Code obfuscating technique in the embedding phase was used. A novel scheme of dynamic data structure software watermarking is presented. This scheme can restore the watermark according to partial watermark shares and is very robust and stealthy.

关键词： Application programs

来源：评论

学校读者我要写书评

暂无评论

Translating query for deep web using ontology

Translating query for deep web using ontology

引用

International Conference on Computer Science and Software engineering, CSSE 2008

作者： Hao, Hang Wanli, Zuo Fei, Ren Junhua, Wang College of Computer Science and Technology Jilin University Department of Information Science and Technology Changchun Taxation College Changchun 130117 China Key Laboratory of Symbol Computation and Knowledge Engineering Ministry of Education Changchun 130012 China College of Computer Science and Technology Jilin University Changchun 130012 China

ISBN: (纸本)9780769533360

The E-commerce information on the Surface Web is supported by the Deep Web, which can not be accessed directly by the search engines or the web crawlers. The only way to access the backend database is through query interface. Extracting valid attributes from the query forms and automatic translating the source query into a target query is a solvable way for addressing the current limitations in accessing Deep Web data sources. To generate a valid query, we have to reconcile the key attributes and their semantic relation. We present our framework to solve the problem. To enrich the set of attributes contained in the semantic form, we use the WordNet as kinds of ontology technique and we try to find the semantic relation of the attributes in the same query from and different forms. Extensive experiments over real-word domains show the utility of our query translation framework. © 2008 IEEE.

关键词： Ontology

来源：评论

学校读者我要写书评

暂无评论

Translating Query for Deep Web Using Ontology

Translating Query for Deep Web Using Ontology

引用

International Conference on Computer Science and Software engineering

作者： Hao Liang Wanli Zuo Fei Ren Junhua Wang College of Computer Science and Technology Department of Technology Jilin University Changchun Taxation China College of Computer Science and Technology Key Laboratory of Symbol Computation andKnowledge Engineering of the Ministry of Education Jilin University China College of Computer Science and Technology Jilin University Changchun China College of Computer Science and Technology Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun China

ISBN: (纸本)9781424439027

The e-commerce information on the surface Web is supported by the Deep Web, which can not be accessed directly by the search engines or the Web crawlers. The only way to access the backend database is through query interface. Extracting valid attributes from the query forms and automatic translating the source query into a target query is a solvable way for addressing the current limitations in accessing Deep Web data sources. To generate a valid query, we have to reconcile the key attributes and their semantic relation. We present our framework to solve the problem. To enrich the set of attributes contained in the semantic form, we use the WordNet as kinds of ontology technique and we try to find the semantic relation of the attributes in the same query from and different forms. Extensive experiments over real-word domains show the utility of our query translation framework.

关键词： Ontologies Databases Computer science Educational institutions Search engines Data mining Laboratories knowledge engineering Computer science education Crawlers

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：