Classification of Big Data Security Based on Ontology Web Language

A vast amount of data (known as big data) may now be collected and stored from a variety of data sources, including event logs, the internet, smartphones, databases, sensors, cloud computing, and Internet of Things (IoT) devices. The term “big data security” refers to all the safeguards and instruments used to protect both the data and analytics processes against intrusions, theft, and other hostile actions that could endanger or adversely influence them. Beyond being a high-value and desirable target, protecting Big Data has particular difficulties. Big Data security does not fundamentally differ from conventional data security. Big Data security issues are caused by extraneous distinctions rather than fundamental ones. This study meticulously outlines the numerous security difficulties Large Data analytics now faces and encourages additional joint research for reducing both big data security challenges utilizing Ontology Web Language (OWL). Although we focus on the Security Challenges of Big Data in this essay, we will also briefly cover the broader Challenges of Big Data. The proposed classification of Big Data security based on ontology web language resulting from the protégé software has 32 classes and 45 subclasses.

基于上下结合法的战场态势信息本体构建

由于战场态势信息的来源复杂、数据结构和表达方式存在较大差异,建立统一的知识表达模型具有一定的挑战。本体作为语义化的概念模型,常被用于描述知识领域中的概念、关系和属性。提出了一种基于上下结合法的战场态势信息领域本体构建方法。采用自顶向下法构建上层本体,通过定义概念、关系和属性,设计上下位结构明确的概念层次结构模型,建立概念类之间的层级关系和语义关联。采用自底向上法构建底层本体,提出了一种基于双重聚合算法的本体抽取方法。TF-IDF获得实体的特征表示,利用K-means++初步抽象归纳出本体,利用凝聚式层次聚类算法进一步细分本体概念,定义本体之间的关系。使用描述语言OWL和编辑工具Protégé管理本体,最终构建了对战场态势信息进行一致性管理的知识本体模型BattleOnto,在指挥员做出决策时提供支持和帮助。

Typed formal model for WS-CDL specification of web services composition

In order to formally reason and verify web services composition described by web services choreography specification WS-CDL,a typed formal model named typed Abstract WS-CDL（web services choreography description language）for WS-CDL specifications is proposed.In typed Abstract WS-CDL,the syntax of type and session,typing rules and operational semantics are formalized;the collaborations of web services are formally described by sessions;the operational semantics of a session can help to formally reason the execution of the choreography;the typing rules can help to formally check the data type consistency of exchanged information between web services and capture run-time errors due to type mismatches.Particularly,the concepts of type assumption set extension and type assumption set compatibility are proposed,and the merging algorithm of type assumption sets is defined so as to eliminate type assumption conflict.Based on the formal model,typed mapping rules for mapping web services choreography to orchestration is also defined.With the typed mapping rules,orchestration stubs and their type assumption sets can be generated from a given choreography; thus, web services composition can be verified at choreography and orchestration levels,respectively.The model is proved to have properties of type safety,and how the model can help to reason and verify web services composition is illustrated through a case study.

A Testing Method for Web Services Composition Based on Data-Flow

This paper proposes a method of data-flow testing for Web services composition. Firstly, to facilitate data flow analysis and constraints collecting, the existing model representation of business process execution language （BPEL） is modified in company with the analysis of data dependency and an exact representation of dead path elimination （DPE） is proposed, which over-comes the difficulties brought to dataflow analysis. Then defining and using information based on data flow rules is collected by parsing BPEL and Web services description language （WSDL） documents and the def-use annotated control flow graph is created. Based on this model, data-flow anomalies which indicate potential errors can be discovered by traversing the paths of graph, and all-du-paths used in dynamic data flow testing for Web services composition are automatically generated, then testers can design the test cases according to the collected constraints for each path selected.

A Formal Model for BPEL4WS Description of Web Service Composition

Communicating Sequential Processes （CSP） is a kind of process algebra, which is suitable for modeling and verifying Web service composition. This paper describes how to model Web service composition with CSP. A set of rules for translating composition constructor of Business Process Execution Language for Web Services （BPEL4WS） to CSP notations is defined. According to the rules that have been defined, the corresponding translation algorithm is designed and illustrated with examples . The methods for model checking, model verification and model simulation are also introduced.

Evaluation Method of Web Site Structure Based on Web Structure Mining

The structure of Web site became more complex than before. During the design period of a Web site, the lack of model and method results in improper Web structure, which depend on the designer's experience. From the point of view of software engineering, every period in the software life must be evaluated before starting the next period's work. It is very important and essential to search relevant methods for evaluating Web structure before the site is completed. In this work, after studying the related work about the Web structure mining and analyzing the major structure mining methods (Page\|rank and Hub/Authority), a method based on the Page\|rank for Web structure evaluation in design stage is proposed. A Web structure modeling language WSML is designed, and the implement strategies for evaluating system of the Web site structure are given out. Web structure mining has being used mainly in search engines before. It is the first time to employ the Web structure mining technology to evaluate a Web structure in the design period of a Web site. It contributes to the formalization of the design documents for Web site and the improving of software engineering for large scale Web site, and the evaluating system is a practical tool for Web site construction.

Generating test case specifications of web service composition using model checking

Model checking techniques have been widely used in verifying web service compositions to ensure the trustworthi- ness. However, little research has focused on testing web services. Based on the research of model checking techniques~ we propose a model checking based approach for testing web service composition which is described by using the web services choreography description language （WS-CDL）. According to worldwide web consortium （W3C） candidate recommendation, the WS-CDL specification provides a language for characterizing interactions between distinct web services using XML. Since the behaviors of web service composition are asynchronous, distributed, low-coupled and platform independent, we employ the guarded automata （GA） model for specifying the composition described in WS-CDL and using the simple promela interpreter （SPIN） model checker for detecting the collaborations of web services. Test cases can be transformed from counterexamples generated by SPIN using adequacy criteria. In this paper we apply the transition coverage criterion for generating counterex- amples. To illustrate our approach, we set ＂E-commerce service system＂ as an example for demonstrating how test cases can be generated using SPIN for compositions specified in WS-CDL.

AN IMPROVED HYBRID SEMANTIC MATCHING ALGORITHM WITH LEXICAL SIMILARITY

In this paper, we proposed an improved hybrid semantic matching algorithm combining Input/Output (I/O) semantic matching with text lexical similarity to overcome the disadvantage that the existing semantic matching algorithms were unable to distinguish those services with the same I/O by only performing I/O based service signature matching in semantic web service discovery techniques. The improved algorithm consists of two steps, the first is logic based I/O concept ontology matching, through which the candidate service set is obtained and the second is the service name matching with lexical similarity against the candidate service set, through which the final precise matching result is concluded. Using Ontology Web Language for Services (OWL-S) test collection, we tested our hybrid algorithm and compared it with OWL-S Matchmaker-X (OWLS-MX), the experimental results have shown that the proposed algorithm could pick out the most suitable advertised service corresponding to user's request from very similar ones and provide better matching precision and efficiency than OWLS-MX.

An Edge-Based Approach for Semantic Matchmaking of Service Capabilities

Semantic Web Services is an emerging technology that promises to enable dynamic, execution-time discovery, composition, and invocation of Web Services. Semantic matchmaking plays a vital role in the automated and dynamic discovery process of Semantic Web Services and consists in measuring the semantic distance between a requested service and an advertised one. In this paper, an innovative approach to effectively compute the semantic distance between Ontology Web Language for Services （OWL-S） annotated services is proposed. First, an edge-based method for measuring the semantic distance between Web Ontology Language （OWL） concepts is presented. Then, a comparison of the proposed measure and the one presented in a recent related work is made in order to show that our method is more efficient and fine-grained. Finally, some equations to compute semantic matchmaking of service capabilities, which are expressed in terms of inputs and outputs, are presented.

Implementation of Enterprises Interoperation Based on Ontology

The interoperation among enterprises in e-business could block the ambient semantic collaboration and cause a big problem since varying information descriptions and different data models may be used in different enterprises＇ information systems. Ontology is an important tool to overcome the above mentioned syntax and semantic misunderstanding problem. Our goal is to provide a user-friendly environment supporting syntax and neutral format data model for business information. In this paper, two scenarios are discussed and a unified description of data model is developed to solve the gap in interoperation through mapping from logical data of enterprise＇s information system. It provides the methods to realize the mapping among different types of data or information. First, database and other types of information are transformed into neutral format that are described by web ontology language （OWL）. Second, the neutral format can be mapped into the semantic entities and semantic linking through the process of extraction and annotation and added into ontology and then described in a standard format that makes the collaboration be understood easily.

Description method of conceptual model based on the ontology

The conceptual model is the first time abstraction ceptual model description method based on the UML and the of the real world. The traditional con- text usually has the semantic ambiguity problem. The formal description method lacks the mechanism of integrity and consistency check. Therefore both of them cannot support the simulation scenario description and the model compos- ability. A simulation conceptual description method based on ontology is put forward. According to the OWL language which was put forward by the W3C organization, a conceptual model description language is established. The OWL language semantic element in the description function in the mili- tary conceptual model is introduced. Then two layers of the military conceptual model framework are built up based on the general ontology and the domain ontology. In the general ontology, the class and property definition are given. While in the domain ontology, they are extended and a relat- ed example is given. The technique advantages of our method include the mechanism of conceptual model consistency and integrity check, the support of composable simulation models, and automatic creation of simulation scenario.

Alzheimer’s Disease Diagnosis Based on a Semantic Rule-Based Modeling and Reasoning Approach

Alzheimer’s disease(AD)is a very complex disease that causes brain failure,then eventually,dementia ensues.It is a global health problem.99%of clinical trials have failed to limit the progression of this disease.The risks and barriers to detecting AD are huge as pathological events begin decades before appearing clinical symptoms.Therapies for AD are likely to be more helpful if the diagnosis is determined early before the final stage of neurological dysfunction.In this regard,the need becomes more urgent for biomarker-based detection.A key issue in understanding AD is the need to solve complex and high-dimensional datasets and heterogeneous biomarkers,such as genetics,magnetic resonance imaging(MRI),cerebrospinal fluid(CSF),and cognitive scores.Establishing an interpretable reasoning system and performing interoperability that achieves in terms of a semantic model is potentially very useful.Thus,our aim in this work is to propose an interpretable approach to detect AD based on Alzheimer’s disease diagnosis ontology(ADDO)and the expression of semantic web rule language(SWRL).This work implements an ontology-based application that exploits three different machine learning models.These models are random forest(RF),JRip,and J48,which have been used along with the voting ensemble.ADNI dataset was used for this study.The proposed classifier’s result with the voting ensemble achieves a higher accuracy of 94.1%and precision of 94.3%.Our approach provides effective inference rules.Besides,it contributes to a real,accurate,and interpretable classifier model based on various AD biomarkers for inferring whether the subject is a normal cognitive(NC),significant memory concern(SMC),early mild cognitive impairment(EMCI),late mild cognitive impairment(LMCI),or AD.

Development and Research on the Internet Resources Aggregation Platform

We proposed an Intemet resource aggregation platform based on semantic web. The platform includes an Web Ontology Language（OWL） ontology design toolkit（VO-Editor） and a selective inference algorithm engine so that it can visually editing ontology and using novel selective reasoning for information aggregation. We introduce the VO-Editor and the principle of selective inference algorithm. At last a case of budget travel system is used to interpret the approach of Internet resources aggregation by this platform.

An OWL-based WordNet lexical ontology

This paper discribes a data representation for WordNet 2.1 based on Web Ontology Language (OWL). The main components of WordNet database are transformed as classes in OWL, and the relations between synsets or lexcial words are transformed as OWL properties. Our conversion is based on the data file of WordNet instead of the Prolog database. This work can be used to enrich the work in progress of standard conversion of WordNet to the RDF/OWL representation at W3C.

Generalized Testability Scheme Modeling of Materiel System Based on Information Ontology

A mode of ontology-based information integration and management( OIIM) for testability scheme was proposed through expatiating on the connotation of the system testability scheme.Aiming at the complexity of influencing factors in optimal design procedure of the testability scheme, the information of concept entities,concept attributions and concept relationships was analyzed and extracted,and then the testability scheme information ontology( TSIO) was built and coded via web ontology language( OWL).Based on the information ontology, the generalized model for testability scheme( GMTS) was founded by defining transformation rules. The primary study shows that the mode of OIIM for testability scheme can make up the deficiencies in knowledge representation and reasoning existing in traditional information models,and achieve the information share and reuse. It provides the effectual model basis for the optimal design of the testability scheme.

τSQWRL:A TSQL2-Like Query Language for Temporal Ontologies Generated from JSON Big Data

Temporal ontologies allow to represent not only concepts,their properties,and their relationships,but also time-varying information through explicit versioning of definitions or through the four-dimensional perdurantist view.They are widely used to formally represent temporal data semantics in several applications belonging to different fields(e.g.,Semantic Web,expert systems,knowledge bases,big data,and artificial intelligence).They facilitate temporal knowledge representation and discovery,with the support of temporal data querying and reasoning.However,there is no standard or consensual temporal ontology query language.In a previous work,we have proposed an approach namedτJOWL(temporal OWL 2 from temporal JSON,where OWL 2 stands for"OWL 2 Web Ontology Language"and JSON stands for"JavaScript Object Notation").τJOWL allows(1)to automatically build a temporal OWL 2 ontology of data,following the Closed World Assumption(CWA),from temporal JSON-based big data,and(2)to manage its incremental maintenance accommodating their evolution,in a temporal and multi-schema-version environment.In this paper,we propose a temporal ontology query language forτJOWL,namedτSQWRL(temporal SQWRL),designed as a temporal extension of the ontology query language—Semantic Query-enhanced Web Rule Language(SQWRL).The new language has been inspired by the features of the consensual temporal query language TSQL2(Temporal SQL2),well known in the temporal(relational)database community.The aim of the proposal is to enable and simplify the task of retrieving any desired ontology version or of specifying any(complex)temporal query on time-varying ontologies generated from time-varying big data.Some examples,in the Internet of Healthcare Things(IoHT)domain,are provided to motivate and illustrate our proposal.

An XPath-based OWL storage model for effective ontology management in Semantic Web environment

With the rapid growth of the Web, the volume of information on the Web is increasing exponentially. However, information on the current Web is only understandable to humans, and this makes precise information retrieval difficult. To solve this problem, the Semantic Web was proposed. We must use ontology languages that can assign data the semantics for realizing the Semantic Web. One of the representative ontology languages is the Web ontology language OWL, adopted as a recommen-dation by the World-Wide Web Consortium (W3C). OWL includes hierarchical structural information between classes or prop-erties. Therefore, an efficient OWL storage model that considers a hierarchical structure for effective information retrieval on the Semantic Web is required. In this paper we suggest an XPath-based OWL storage (XPOS) model, which includes hierarchical information between classes or properties in XPath form, and enables intuitive and effective information retrieval. Also, we show the comparative evaluation results for the performance of the XPOS model, Sesame, and the XML file system-based storage (XFSS) model, in terms of query processing and ontology updating.

Towards a Service-Oriented Architecture for a Mobile Assistive System with Real-time Environmental Sensing

With the growing aging population, age-related diseases have increased considerably over the years.In response to these, Ambient Assistive Living（AAL） systems are being developed and are continually evolving to enrich and support independent living. While most researchers investigate robust Activity Recognition（AR）techniques, this paper focuses on some of the architectural challenges of the AAL systems. This work proposes a system architecture that fuses varying software design patterns and integrates readily available hardware devices to create Wireless Sensor Networks（WSNs） for real-time applications. The system architecture brings together the Service-Oriented Architecture（SOA）, semantic web technologies, and other methods to address some of the shortcomings of the preceding system implementations using off-the-shelf and open source components. In order to validate the proposed architecture, a prototype is developed and tested positively to recognize basic user activities in real time. The system provides a base that can be further extended in many areas of AAL systems,including composite AR.

Detecting Vicious Cycles in Urban Problem Knowledge Graph using Inference Rules

Urban areas have many problems,including homelessness,graffiti,and littering.These problems are influenced by various factors and are linked to each other;thus,an understanding of the problem structure is required in order to detect and solve the root problems that generate vicious cycles.Moreover,before implementing action plans to solve these problems,local governments need to estimate cost-effectiveness when the plans are carried out.Therefore,this paper proposed constructing an urban problem knowledge graph that would include urban problems’causality and the related cost information in budget sheets.In addition,this paper proposed a method for detecting vicious cycles of urban problems using SPARQL queries with inference rules from the knowledge graph.Finally,several root problems that led to vicious cycles were detected.Urban-problem experts evaluated the extracted causal relations.