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 in...
详细信息
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.
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 g...
详细信息
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.
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 da...
详细信息
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.
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 importan...
详细信息
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.
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 susceptibil...
详细信息
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.
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...
详细信息
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.
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 permit...
详细信息
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.
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...
详细信息
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.
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...
详细信息
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.
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 imp...
详细信息
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.
暂无评论