Theorem proving based on the extension rule is a new reasoning method. Based on the extension rule algorithm RIER, this paper presents a more efficient algorithm HRIER, which uses the heuristic strategy to guide the c...
详细信息
Designed and implemented an in-vehicle information system based on Linux with IPv6. There were three modules in this system included CDMA connection module based IPv6 applications, NAT/firewall based on IPtables/Netfi...
详细信息
ISBN:
(纸本)9780791802977
Designed and implemented an in-vehicle information system based on Linux with IPv6. There were three modules in this system included CDMA connection module based IPv6 applications, NAT/firewall based on IPtables/Netfilter, and display module based on miniGUI. We could use CDMA connection module to send the GPS and the CAN bus data to the remote servers, and the firewall based on IPtables/Netfilter could provide some rules to protect the system against attack. It was also designed to support the inter-vehicle users to visit internet through the system based on NAT module. The GPS module could get GPS information from GPS receiver. A touch-screen was used to display the information of GPS and CAN bus by the display module.
Flow graph is an effective and graphical tool of knowledge representation and analysis. It explores dependent relation between knowledge in the form of information flow quantity. However, the quantity of flow can not ...
详细信息
Trusted Network Connect (TNC), whose goal is to improve network security from source, now has become hot topic in security domain. We proposed a new access model for the terminals without meeting the requirements in T...
详细信息
One kind of semantic Web service modeling and composition method based on description logic (DL) rule is introduced in this paper. We use DL rule to figure out the hyponymy relationship between concepts of domain onto...
详细信息
One kind of semantic Web service modeling and composition method based on description logic (DL) rule is introduced in this paper. We use DL rule to figure out the hyponymy relationship between concepts of domain ontology and model Web service functional semantic of ServiceProfile, and define service DL rule to describe semantic matching of atomic Web service. Furthermore, we propose DL rule chain to describe semantic Web service composition, and prove that its semantic is corresponding to a new DL rule. Moreover, we give DL rule chain finding algorithm and WSR matching algorithm to find the composition result. Finally, we generate a dataset to test two algorithms above and show perfect execution efficiency.
When diagnosing dynamic system represented as discrete-event systems, it needs to find what happened to the systems from observations. The behavior of system could be represented by automaton model. The diagnostic tas...
详细信息
When diagnosing dynamic system represented as discrete-event systems, it needs to find what happened to the systems from observations. The behavior of system could be represented by automaton model. The diagnostic task consists in determining the models compatible with the observations, but the global computation which is needed in synchronization costs exponential time. In this paper we propose a new method to simplify the automaton by isomorphic determining. The cost of computation will be significantly cut down by merging the automatons with the same structure, and the time-complexity of the diagnosis process could be reduced by the method.
Query interface is used to formulate queries to receive needed data from web databases in deep web. In order to access domain-specific databases, the most important step is to construct an integration interface that a...
详细信息
ISBN:
(纸本)9781424452446
Query interface is used to formulate queries to receive needed data from web databases in deep web. In order to access domain-specific databases, the most important step is to construct an integration interface that allows uniform access to disparate relevant sources. Therefore, this paper proposes a novel method of integrating query interfaces based on ontology in deep web. Firstly, make full use of the complex relationships which are provided by ontology, and find the semantic relationships between attributes. Then, record the matching relationships and matching frequencies into a mapping table to reserve the structure and the order of attributes. Lastly, extract these concepts from ontology as integration interface attributes which are matched with corresponding attribute labels from local interfaces, and descend order in accordance with the matching frequencies to get an integration interface. Experiment result shows that this method has dramatically improved the matching precision of query interfaces.
K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, while almost all of them are based on sin...
详细信息
K-means algorithm is one of the most famous unsupervised clustering algorithms. Many theoretical improvements for the performance of original algorithms have been put forward, while almost all of them are based on single instruction single data (SISD) architecture processors (GPUs), which partly ignored the inherent paralleled characteristic of the algorithms. In this paper, a novel single instruction multiple data (SIMD) architecture processors (GPUs) based k-means algorithm is proposed. In this algorithm, in order to accelerate compute-intensive portions of traditional k-means, both data objects assignment and k-centroids recalculation are offloaded to the GPU in parallel. We have implemented this GPU-based k-means on the newest generation GPU with compute unified device architecture(CUDA). The numerical experiments demonstrated that the speed of GPU-based k-means could reach as high as 40 times of the CPU-based k-means.
In this paper, we introduce two concepts of service semantic relation and semantic relation chain to figure out service composition relation and sequentially service composition. For parallel service composition, we p...
详细信息
In this paper, we introduce two concepts of service semantic relation and semantic relation chain to figure out service composition relation and sequentially service composition. For parallel service composition, we propose Web service community (WSC) model which corresponding to a Split+Join structure, So we introduce a kind of divide and conquer method to convert parallel service composition into sequentially service composition based on WSC chains and which can solve sequential and parallel service composition problems in an agreement way. Finally, a parallel composition example illustrations the execution process of our method.
Automatic deep Web query results extraction is a key step of deep Web query results processing. Extracting the query results correctly is the precondition and guarantee of realizing semantic annotation and data integr...
详细信息
Automatic deep Web query results extraction is a key step of deep Web query results processing. Extracting the query results correctly is the precondition and guarantee of realizing semantic annotation and data integration. In this paper, a simple method for extracting deep Web query results automatically based on tag trees is proposed according to the features of deep Web query results page. The method first builds a tag tree of the given result page. Then finds minimal data regions in the tag tree from top to down, and extracts data records included by them. The experiment has shown that the method is effective.
暂无评论