In the Chinese question answering system, the answer extraction is generally realized by extracting answers from answer sentence pattern which is corresponded to the question. But the extraction of answer sentence pat...
详细信息
In the Chinese question answering system, the answer extraction is generally realized by extracting answers from answer sentence pattern which is corresponded to the question. But the extraction of answer sentence pattern greatly depended on expert's language knowledge, so the patterns can't be listed fully that the precision of the answer extraction will be affected. A method that the answer sentence pattern can be obtained by machine learning is proposed in this paper. All types of Chinese question answer pairs are statistically analyzed, the query of question is constructed, and then the corresponding documents are recalled by search engines. Next, the sentence patterns with the maximum weights are selected as the candidate answer sentence pattern by calculating the weight of sentence patterns in corresponding document. At last, the answer to the question is extracted from the Internet based on the answers sentence pattern which has been obtained. The experiment on extracting answer for Chinese factoid question is done. The experiment results make a very good effect that the MRAR value equals 0.28.
As security is becoming a significant obstacle to wider deployment of wireless LANs, IEEE 802.1x and EAPoW has been put forward to enhance authentication in WLAN. At present, some existing client solution such as Xsup...
详细信息
In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonym...
详细信息
ISBN:
(纸本)9783540725893
In lager-scale P2P file sharing systems, peers often must interact with unknown or unfamiliar peers without the benefit of trusted third parties or authorities to mediate the interactions. The decentralized and anonymous characteristics of P2P environments make the task of controlling access to sharing information more difficult. In this paper, we identify access control requirements and propose a trust based access control framework for P2P file-sharing systems. The model integrates aspects of trust and recommendation, fairness based participation schemes and access control schemes.
Based on the property of Human vision system (HVS) that human eye's sensitivity to an image varies with different information regions of the image, Pulse-coupled neural network (PCNN) model is modified for image s...
详细信息
Based on the property of Human vision system (HVS) that human eye's sensitivity to an image varies with different information regions of the image, Pulse-coupled neural network (PCNN) model is modified for image segmentation. The modified PCNN stimulated by an input image has pulse output with multiple pulse values rather than only two in the conventional PCNN, according to the local information rate of the input image. This results in image segmentation according to local information rate delivered from the image by the modified PCNN. Experiments with the modified PCNN on image segmentation and image compression on the segmented images with the principle that the lower information rate is, the higher compression rate is applied, show much better performance in compression rate compared with that on the segmented images with the conventional PCNN.
Due to the existence of a large amount of legacy information systems, how to obtain the information and integrate the legacy systems is becoming more and more concerned. This paper introduces the integration pattern b...
详细信息
2-D projective moment invariants were firstly proposed by Suk and Flusser in [12]. We point out here that there is a useless projective moment invariant which is equivalent to zero in their paper. 3-D projective momen...
详细信息
2-D projective moment invariants were firstly proposed by Suk and Flusser in [12]. We point out here that there is a useless projective moment invariant which is equivalent to zero in their paper. 3-D projective moment invariants are generated theoretically by investigating the property of signed volume of a tetrahedron. The main part is the selection of permutation invariant cores for multiple integrals to generate independent and nonzero 3-D projective moment invariants. We give the conclusion that projective moment invariants don't exist strictly speaking because of their convergence problem.
As security is becoming a significant obstacle to wider deployment of wireless LANs, IEEE 802.1x and EAPoW has been put forward to enhance authentication in WLAN. At present, some existing client solution such as Xsup...
详细信息
ISBN:
(纸本)9781424431397;9780769527963
As security is becoming a significant obstacle to wider deployment of wireless LANs, IEEE 802.1x and EAPoW has been put forward to enhance authentication in WLAN. At present, some existing client solution such as Xsupplicant or WIRE1x has only applies to one platform, Linux or Windows, and is ill-considered of EAPoW. This paper discusses an integrated multi- platform EAPOW-based WLAN AAA Solution - IMEWAS, its architecture and module design and implementation. The integrated flexible and secure solution has been proved feasible.
In open Internet environment, it is inevitable that multiple ontologies coexist. Centralized service discovery mechanism becomes the bottleneck of SOC (service oriented computing), which results in poor scalability of...
详细信息
In open Internet environment, it is inevitable that multiple ontologies coexist. Centralized service discovery mechanism becomes the bottleneck of SOC (service oriented computing), which results in poor scalability of system. Aiming at solving these problems, a two layered P2P based model for semantic service discovery is proposed in this paper. The model is based on ontology community and integrates iVCE (Internet-based virtual computing environment) core concepts into a P2P model. Based on this model, a service discovery algorithm composed of two stages and three steps is proposed. It matches services across communities as well as within community. Within a community, algorithm locates registers holding service information with a high probability of satisfying a request firstly. Then it captures semantic matching between service advertisements and service requests by logical reasoning. Service discovery across communities occurs according to some policies. The model is suitable for opening environment with coexistent multiple ontologies. Experimental results show that given an appropriate setting, the model can make a tradeoff between recall and responding time. In addition, the model will release the mean load of registers efficiently while holding recall.
Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which coul...
详细信息
ISBN:
(纸本)9781424415786
Structure alignment could help to find shape similarities between proteins and guide structure classification and fold recognition. Common substructure detection and extraction are especially important, for which could guide the biologist to discover binding site or active site. We represent each segment of alpha-carbon backbone by using dihedral angles and curve moment invariants. Then, local and global structure alignment could be performed by iterative closest point algorithm. Maximum common substructures between a pair of proteins or within a protein could be found. Active sites also could be detected by the proposed algorithm.
The static network shortest path algorithms have been developed thoroughly, whereas the studies for dynamic network shortest path algorithms are few. To satisfy the need of theoretical research and application, the dy...
详细信息
The static network shortest path algorithms have been developed thoroughly, whereas the studies for dynamic network shortest path algorithms are few. To satisfy the need of theoretical research and application, the dynamic network shortest path problems have been a hot spot in the field of geographic information science and computer science. When the weights of the network are functions with parameter, the network is called a dynamic network, in which it is difficult to resolve shortest path by the traditional algorithms. In this paper, we first propose the shortest path problem in a multi-stage weighted network with quadratic parameter. Next, we give the implicit enumerative labelling algorithm to look for the shortest path of this network based on the thought of the Dijkstra algorithm and the implicit enumerative method. Finally, we analyse the complexity of the algorithm. The theory analysis and the experiment indicate that the algorithm is not polynomial but effective for proper scale of the network.
暂无评论