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...
详细信息
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.
Mobil Ad Hoc Networks is a dynamic wireless self-organizing networks. Routing techniques is a greatly import part of wireless networks protocol. Some recent routing protocol take into account secure factor, but these ...
详细信息
Mobil Ad Hoc Networks is a dynamic wireless self-organizing networks. Routing techniques is a greatly import part of wireless networks protocol. Some recent routing protocol take into account secure factor, but these protocols yet cannot sufficient the actual demand because of the various forms of attacks to mobile self-organizing networks and self frangibility of mobile Ad Hoc networks. In this paper, the limitation of typical secure protocol has been analyzed, and designing a new routing Incursion-Tolerance based protocol ITDSR. It adopt work in natural monitoring mode to assure building quickest path between original node and destination node, and resolved the problems that baleful node could be contained in path route discovery phase whereas initiate attack on transmit data phase, and jam network on some node because of single path.
After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol...
详细信息
After analyzing the specific security requirements of the wireless communication network based on IEEE802.16, a series of key issues about security methods and techniques were researched. A new authentication protocol for wireless mobile environment was proposed and designed. Then, its security was analyzed from the angle of technical realization and formal analysis to verify whether the original safety goals were achieved. Especially, formal analysis was mostly done. Finally, system testing was also carried out and the results were analyzed to verify function and performance of the new protocol.
In recent studies, the lifetime of Wireless Sensor Network(WSN) has been paid more attention to in order to evaluate the network performance. In this paper, service-oriented lifetime is proposed to provide a new metho...
详细信息
In recent studies, the lifetime of Wireless Sensor Network(WSN) has been paid more attention to in order to evaluate the network performance. In this paper, service-oriented lifetime is proposed to provide a new method of assessment. The deployment of network can be guided by this assessment through placing more nodes where higher service quality is needed. In this way, the wasted energy can be reduced efficiently. To give a concrete scenario validating the feasibility of this assessment, a quantization process of network density is put forward subsequently. Both the theories and the simulations show that this method is feasible.
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.
The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO...
The flowshop scheduling problem has been widely studied in the literature and many techniques have been applied to it, but few algorithms have been proposed to solve it using particle swarm optimization algorithm (PSO) based algorithm. In this paper, an improved PSO algorithm (IPSO) based on the ldquoall differentrdquo constraint is proposed to solve the flowshop scheduling problem with the objective of minimizing makespan. It combines the particle swarm optimization algorithm with genetic operators together effectively. When a particle is going to stagnates, the mutation operator is used to search its neighborhood. The proposed algorithm is tested on different scale benchmarks and compared with the recently proposed efficient algorithms. The results show that both the solution quality and the convergent speed of the IPSO algorithm precede the other two recently proposed algorithms. It can be used to solve large scale flowshop scheduling problem effectively.
CAD drawings reuse is of great importance in promoting design efficiency and productivity. The ability to retrieve CAD drawings is the core of drawings reuse task. Most of the existing drawings retrieval systems rely ...
详细信息
CAD drawings reuse is of great importance in promoting design efficiency and productivity. The ability to retrieve CAD drawings is the core of drawings reuse task. Most of the existing drawings retrieval systems rely only on text descriptions. Due to complexity of visual feature, a little system is based on content. A simplified topological relationship is proposed to describe visual features for dimension reduction. An effective topological relationship vector is constructed by graph spectra. A novel retrieval system based on visual contents, including topological relationships, shape, and directional relationships, is proposed. The experiments show that the proposed approach and system are superior to the text-based and traditional content-based retrieval systems.
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.
Geometric constraint problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on ant colony optimizatio...
详细信息
Geometric constraint problem can be transformed to an optimization problem which the objective function and constraints are non-convex functions. In this paper an evolutionary algorithm based on ant colony optimization algorithm and the immune system model is proposed to provide solution to the geometric constraints problem. In the new algorithm, affinity calculation process and pheromone trail lying is embedded to maintain diversity and carry out the global search and the local search in many directions rather than one direction around the same individual simultaneously. This new algorithm different with current optimization methods in that it gets the good solution by excluding bad solutions. The experimental results reported here will shed more light into how affects the hybrid algorithm's search power in solving geometric constraint problem.
暂无评论