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

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Multilocus association analysis into susceptibility genes of schizophrenia

引用

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

作者： Zhang, Hong-Li Liu, Yuan-Ning Zhang, Hao Yu, Ya-Qin Yu, Qiong Kou, Chang-Gui Shi, Jie-Ping Meng, Xiang-Fei Tao, Lu Qu, Ting College of Computer Science and Technology Jilin University Changchun 130012 China Key Laboratory of Symbol Computation and Knowledge Engineering Jilin University Changchun 130012 China Research Center for Genomic Medicine School of Public Health Jilin University Changchun 130021 China

A model based on multilocus interaction of schizophrenia was designed. Using the program of MATLAB through a C-language interface, combined with Fisher's exact test, a total of 18 SNPs that came from 9 susceptibility genes of the cPLA2 and PNPLA8 family were analyzed to detect positive sites of schizophrenia in multilocus association analysis. Results show that 4 positive sites at rs3816533, rsl668589, rsl356410 and rs40848 were detected in 13 SNPs, which did not deviate from the Hardy-Weinberg equilibrium (P>0.05). The haplotype significance test of these positive sites indicates that 6 haplotypes passing through rs3816533, rsl668589, rsl356410 and 2 haplotypes passing through rs40848 are associated with schizophrenia.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

Recognizing the agent's goals incrementally:planning graph as a basis

引用

中国高等学校学术文摘·计算机科学 2007年第1期1卷 26-36页

作者： SUN Jigui YIN Minghao College of Computer Science Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Computer Science Jilin UniversityChangchun 130012China Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Changchun 130012China College of Computer Northeast Normal UniversityChangchun 130024China

Plan recognition,the inverse problem of plan synthesis,is important wherever a system is expected to produce a kind of cooperative or competitive *** plan recognizers,however,suffer the problem of acquisition and hand-coding a larger plan *** paper is aims to show that modern planning techniques can help build plan recognition systems without suffering such ***,we show that the planning graph,which is an important component of the classical planning system Graphplan,can be used as an implicit,dynamic planning library to represent actions,plans and *** also show that modern plan generating technology can be used to find valid plans in this *** this sense,this method can be regarded as a bridge that connects these two research *** and theoretical results also show that the method is efficient and scalable.

关键词： Graphplan plan recognition constraints automated planning

来源：评论

学校读者我要写书评

暂无评论

Inference and learning in hybrid probabilistic network

引用

中国高等学校学术文摘·计算机科学 2007年第4期1卷 429-435页

作者： WANG Limin WANG Xuecheng LI Xiongfei Key Laboratory of Symbol Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China The Institute of Information Spreading Engineering Changchun University of TechnologyChangchun 130012China

This paper proposed a novel hybrid probabilistic network,which is a good tradeoff between the model complexity and learnability in *** relaxes the conditional independence assumptions of Naive Bayes while still permitting efficient inference and *** studies on a set of natural domains prove its clear advantages with respect to the generalization ability.

关键词： hybrid probabilistic network conditional independence assumption Bayesian network probabilistic neural network

来源：评论

学校读者我要写书评

暂无评论

Dynamic watermarking scheme based on the Shamir threshold and branch structure

引用

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

作者： Yin, Ke Wang, Zhi-Quan Zhu, Jian-Qi Dong, Gang School of Automation Nanjing University of Science and Technology Nanjing 210094 China Electric Power Simulation and Control Engineering Center Nanjing Institute of Technology Nanjing 211167 China Key Laboratory of Symbol Computation and Knowledge Engineer College of Computer Science and Technology Jilin University Changchun 130012 China

A novel dynamic software watermark scheme based on the Shamir threshold and branch structure is presented. First, we split the watermark into a set of shares using the Shamir threshold scheme. Second, these values are encrypted with the DES block cipher that forms the watermark shares to be embedded into different methods of program according to the dynamic behavior of the branch structure. Our scheme can withstand most semantics-preserving attacks and can retrieve the original watermark based on partial information. Simulation tests show that our scheme is very robust, stealthy and has a high price performance rate compared with other methods.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Hilbert-huang transform-based local regions descriptors

Hilbert-huang transform-based local regions descriptors

引用

2007 18th British Machine Vision Conference, BMVC 2007

作者： Han, Dongfeng Li, Wenhui Guo, Wu Li, Zongcheng Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun China School of Engineering Technology Shandong University of Technology Zibo China

ISBN: (纸本)1901725340

This paper presents a new interest local regions descriptors method based on Hilbert-Huang Transform. The neighborhood of the interest local region is decomposed adaptively into oscillatory components called intrinsic mode functions (IMFs). Then the Hilbert transform is applied to each component and get the phase and amplitude information. The proposed descriptors samples the phase angles information and amalgamates them into 10 overlap squares with 8-bin orientation histograms. The experiments show that the proposed descriptors are better than SIFT and other standard descriptors. Essentially, the Hilbert-Huang Transform based descriptors can belong to the class of phase-based descriptors. So it can provides a better way to overcome the illumination changes. Additionally, the Hilbert-Huang transform is a new tool for analyzing signals and the proposed descriptors is a new attempt to the Hilbert-Huang transform.

关键词： Hilbert-Huang transform

来源：评论

学校读者我要写书评

暂无评论

Region-based image retrieval using graph-cuts and global/local features

引用

Journal of Harbin Institute of Technology (New Series) 2007年第SUPPL. 2期14卷 68-71页

作者： Li, Wenhui Han, Dongfeng Zhang, Zhenhua Guo, Wu Wang, Yi Key Laboratory of Symbol Computation and Knowledge Engineering College of Computer Science and Technology Jilin University Changchun 130012 China

This paper describes a region-based retrieval system based on graph-cuts and global/local feature. We also use dynamic partial function (DPF), indexing by locality sensitive hashing (LSH) and learning feedback for improving system performance. Such a system is useful for finding a sub-object from a large image database. In order to obtain the sub-object from a sample image, we propose an efficient graph-cuts segmentation method to cut out the object. The system utilizes the segmentation results to capture the higher-level concept of images and gets a stable and accurate result. Also the feedback method is efficient. Experimental and comparison results, which are performed using a general purpose database containing 5,000 images, are encouraging.

关键词： Image retrieval

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：