With the rapid development of information technology,semantic web data present features of massiveness and complexity. As the data-centric science, social computing have great influence in collecting and analyzing sem...
详细信息
With the rapid development of information technology,semantic web data present features of massiveness and complexity. As the data-centric science, social computing have great influence in collecting and analyzing semantic data. In our contribution, we propose an integrity constraint validation for DL-Lite R based ontology in view of data correctness issue in the progress of social computing ***, at the basis of translations from integrity constraint axioms into a set of conjunctive queries, integrity constraint validation is converted into the conjunctive query answering over knowledge bases. Moreover, rewriting rules are used for reformulating the integrity constraint axioms using standard axioms. On this account, the integrity constraint validation can be reduced to the query evaluation over the ABox, and use query mechanisms in database management systems to optimize integrity constraint validation. Finally, the experimental result shows that the rewritingbased method greatly improves the efficiency of integrity constraint validation and is more appropriate to scalable data in the semantic web.
In this paper,the authors first apply the Fitzpatrick algorithm to multivariate vectorvalued osculatory rational *** based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis,the authors ...
详细信息
In this paper,the authors first apply the Fitzpatrick algorithm to multivariate vectorvalued osculatory rational *** based on the Fitzpatrick algorithm and the properties of an Hermite interpolation basis,the authors present a Fitzpatrick-Neville-type algorithm for multivariate vector-valued osculatory rational *** may be used to compute the values of multivariate vector-valued osculatory rational interpolants at some points directly without computing the interpolation function explicitly.
When several actions preformed at the same time, or performed concurrently, the possibility of multiple concurrent and mutually interacting make the planning solving process difficult. In this paper, we reform the fra...
详细信息
Pancreatic cancer acts as one of the leading causes of cancer-connective deaths. Its five-year overall survival rate being reported is about 7.7% from 2006 to 2012 by the National Cancer Institute. One of the main cau...
详细信息
Pancreatic cancer acts as one of the leading causes of cancer-connective deaths. Its five-year overall survival rate being reported is about 7.7% from 2006 to 2012 by the National Cancer Institute. One of the main causes for its poor prognosis is because its non-typical symptoms make early diagnosis very challenging. Therefore, a predominant strategy for early accurate detection and prognostication on pancreatic cancer is vital to the whole course of comprehensive therapy. In this research, we proposed a method which combined Recursive Feature Elimination (RFE) method based on Support Vector Machine (SVM) and Large Margin Distribution Machine (LDM) to identify potential biomarkers for pancreatic cancer. In our experiments, we have strengthened the process of RFE to achieve better performance. The dataset GSE15471 we adopted are from GEO database with 39 pairs of pancreatic ductal carcinoma and adjacent control pancreatic tissues. Through experiments, a panel of twelve genes was identified as biomarkers in pancreatic cancer with 91.28% classification accuracy. The universality of the candidate genes was examined on another dataset GSE28735 and the classification accuracy was higher than 80%. In addition, by using the SVM, LDM and BP classifiers, we compared the ordered feature sets generated by our proposed method with T-test, SVM-RFE and LDM-RFE, and the results indicated our proposed method obtained higher average classification accuracy.
Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency ...
详细信息
Maintaining Generalized Arc Consistency (GAC) during search is considered an efficient way to solve non-binary constraint satisfaction problems. Bit-based representations have been used effectively in Arc Consistency algorithms. We propose STRbit, a GAC algorithm, based on simple tabular reduction (STR) using an efficient bit vector support data structure. STRbit is extended to deal with compression of the underlying constraint with c-tuples. Experimental evaluation show our algorithms are faster than many algorithms (STR2, STR2-C, STR3, STR3-C and MDDc) across a variety of benchmarks except for problems with small tables where complex data structures do not payoff.
In order to distinguish and extract the topic information from other interferential information on the BBC news website for the study in social computing, the BBC News Hunter was proposed in this paper. The whole syst...
详细信息
Group key management plays an important role in ensuring the safety and reliability of the VANET(vehicular ad-hoc network) over the channelThrough considering the characteristics of VANET communication and topology, a...
详细信息
ISBN:
(纸本)9781510828087
Group key management plays an important role in ensuring the safety and reliability of the VANET(vehicular ad-hoc network) over the channelThrough considering the characteristics of VANET communication and topology, a VANET group key management scheme is proposed based on random transmission which is combined with the construction of polynomial and key updating by Hash chainThe scheme achieves the random transmission function of group key and the node revocation capabilityMoreover, it can ensure the forward and backward and other security attributes of the group keyThe results show that the proposed scheme has less communication complexity and better communication performance, also it can suitable for large scale VANET group.
A minimum cover set coverage algorithm(MCSCA) for pursuing low energy is presented in this paper to prolong the lifetime of wireless sensor networks. The proposed algorithm improves energy efficiency in three aspect...
A minimum cover set coverage algorithm(MCSCA) for pursuing low energy is presented in this paper to prolong the lifetime of wireless sensor networks. The proposed algorithm improves energy efficiency in three aspects. First, when generating cover sets, the selection strategy of the algorithm considers the contributions of sensor nodes, energy variance, and other factors. The algorithm can cover all targets with a few sensor nodes. Second, useless coverage optimization reduces coverage areas without target nodes to save energy. Third, redundant coverage optimization further saves energy by reducing redundant coverage in wireless sensor networks. Compared with similar heuristic algorithms, the proposed MCSCA can extend network lifetime by 11% on average.
Joint mechanism is a key factor for a snake robot adjusting its postures adapted to clutter environments in search and rescue *** joint mechanisms in prior research simply consist of serially connected revolute joints...
详细信息
ISBN:
(纸本)9781509009107
Joint mechanism is a key factor for a snake robot adjusting its postures adapted to clutter environments in search and rescue *** joint mechanisms in prior research simply consist of serially connected revolute joints,which are lack of great load carrying *** nature snake structure,a modular bionic parallel joint mechanism(BPJM) is proposed for the rescue snake *** analysis of the BPJM is necessary for its optimal design and control,providing the force and constraint that must be resisted by joints,links and *** reduce the dynamics computation load,Newton equation and Euler equation are combined by synchronizing the inertial force and inertial moment with the aid of screw ***,the dynamics equations for moving platform and links are formulated in a simplified *** friction at the joints and external force acting on BPJM,which actually affect the motion,are both considered in the ***,the virtual prototype is provided in order to visualize the joint mechanism and the numerical results from the dynamics analysis are given.
Automatically analyzing interactions from video has gained much attention in recent years. Here a novel method has been proposed for analyzing interactions between two agents based on the tra jectories. Previous works...
详细信息
Automatically analyzing interactions from video has gained much attention in recent years. Here a novel method has been proposed for analyzing interactions between two agents based on the tra jectories. Previous works related to this topic are methods based on features, since they only extract features from objects. A method based on qualitative spatio-temporal relations is adopted which utilizes knowledge of the model(qualitative spatio-temporal relation calculi) instead of the original tra jectory information. Based on the previous qualitative spatio-temporal relation works, such as Qualitative tra jectory calculus(QTC), some new calculi are now proposed for long term and complex interactions. By the experiments, the results showed that our proposed calculi are very useful for representing interactions and improved the interaction learning more effectively.
暂无评论