Ontology Population in Conversational Recommender System for Smartphone Domain

The Conversational recommender system (CRS) is a knowledge-based recommendation system that uses ontology as its knowledge representation.The knowledge of a CRS is based on a real world knowledge base service where information on the topic such as product details and descriptions must always be up-to-date.However, the process of gathering the information is still conducted manually.The process is very time consuming and prone to error.Therefore, automatic or semi-automatic processes that can adapt to update, find and insert information into the knowledge base that matches a given ontology are needed. Hence, this study aims to design a framework for ontology population on Conversational Recommender Systems based on the Functional Requirements as in [4] from tabular web documents so its instantiation as ontology result can substitute manual ontology update on CRS. The framework includes a clustering process that employs the Bi-Layer K-Means Clustering Algorithm as a part of knowledge acquisition. To reach the objective, it is necessary to analyze and check the individual consistency of the resulting ontology. Another aim of this study is to analyze the resulting ontology still suitable according to CRS ontology requirements by checking the CRS Ontology Requirements.The experiment is conducted using data from www.gsmarena.com through a crawler engine. There are four steps in an ontology population process: Document Crawling, Identification of the page (individuals, attributes and values), KnowledgeAcquisition, and OWL Ontology Export. Using input from the tabular web document and developing OWL ontology export that mapping the instances and relations, the result shows that the specifications included in the Weak Clustering, Reasonable Clustering and strong clustering categories can be recommended for the Conversational Recommender System ontology. Analysis of consistency checking shows that the ontology remains consistent and suitable for the CRS ontology requirement

Formal Verification of Probabilistic SystemC Models with Statistical Model Checking

Transaction-level modeling with SystemC has been very successful in describing the behavior of embedded systems by providing high-level executable models, in which many of them have inherent probabilistic behaviors, e.g., random data and unreliable components. It thus is crucial to have both quantitative and qualitative analysis of the probabilities of system properties. Such analysis can be conducted by constructing a formal model of the system under verification and using Probabilistic Model Checking (PMC). However, this method is infeasible for large systems, due to the state space explosion. In this article, we demonstrate the successful use of Statistical Model Checking (SMC) to carry out such analysis directly from large SystemC models and allow designers to express a wide range of useful properties. The first contribution of this work is a framework to verify properties expressed in Bounded Linear Temporal Logic (BLTL) for SystemC models with both timed and probabilistic characteristics. Second, the framework allows users to expose a rich set of user-code primitives as atomic propositions in BLTL. Moreover, users can define their own fine-grained time resolution rather than the boundary of clock cycles in the SystemC simulation. The third contribution is an implementation of a statistical model checker. It contains an automatic monitor generation for producing execution traces of the model-under-verification (MUV), the mechanism for automatically instrumenting the MUV, and the interaction with statistical model checking algorithms.Comment: Journal of Software: Evolution and Process. Wiley, 2017. arXiv admin note: substantial text overlap with arXiv:1507.0818

Semantics of trace relations in requirements models for consistency checking and inferencing

Requirements traceability is the ability to relate requirements back to stakeholders and forward to corresponding design artifacts, code, and test cases. Although considerable research has been devoted to relating requirements in both forward and backward directions, less attention has been paid to relating requirements with other requirements. Relations between requirements influence a number of activities during software development such as consistency checking and change management. In most approaches and tools, there is a lack of precise definition of requirements relations. In this respect, deficient results may be produced. In this paper, we aim at formal definitions of the relation types in order to enable reasoning about requirements relations. We give a requirements metamodel with commonly used relation types. The semantics of the relations is provided with a formalization in first-order logic. We use the formalization for consistency checking of relations and for inferring new relations. A tool has been built to support both reasoning activities. We illustrate our approach in an example which shows that the formal semantics of relation types enables new relations to be inferred and contradicting relations in requirements documents to be determined. The application of requirements reasoning based on formal semantics resolves many of the deficiencies observed in other approaches. Our tool supports better understanding of dependencies between requirements

"Natural relations" : a note on X'-structure

With the rise of minimalism, many concepts related to the geometrical relations of phrase structure held fast to in earlier approaches have been reconsidered. This article deals with distinguishing (relational and technical) properties of specifiers and adjuncts in a Bare Phrase Structure framework (X'-Theory). I extend specific aspects of X-structure relevant to the discussion of specifiers vs. adjuncts. I argue that unique specifiers can be derived from the system and that adjunction, possibly multiple, results from Direct Merge only. The final product is a series of relationships in line with recent thoughts and minimalist premises, but formally more similar to earlier conceptions of the X'-schema. I address conceptual, empirical and theoretical arguments against multiple specifiers and related issues next, that is beyond the predictions immediately following from the tripartitional view of clause structure proposed in Grohmann (2000). After laying out my motivations to critically consider the issue, I present a set of data that casts serious doubt over the justifications offered to replace Agr with v as the accusative casemarker. Having conceptual and empirical back-up, I then tackle the theoretical validity of specifiers, and ways to distinguish unique specifiers from (multiple) adjuncts. I introduce a version of Bare Phrase Structure that does so, yet keeps the spirit of defining structural identification over relational rather than categorial properties

On the Verification of a WiMax Design Using Symbolic Simulation

In top-down multi-level design methodologies, design descriptions at higher levels of abstraction are incrementally refined to the final realizations. Simulation based techniques have traditionally been used to verify that such model refinements do not change the design functionality. Unfortunately, with computer simulations it is not possible to completely check that a design transformation is correct in a reasonable amount of time, as the number of test patterns required to do so increase exponentially with the number of system state variables. In this paper, we propose a methodology for the verification of conformance of models generated at higher levels of abstraction in the design process to the design specifications. We model the system behavior using sequence of recurrence equations. We then use symbolic simulation together with equivalence checking and property checking techniques for design verification. Using our proposed method, we have verified the equivalence of three WiMax system models at different levels of design abstraction, and the correctness of various system properties on those models. Our symbolic modeling and verification experiments show that the proposed verification methodology provides performance advantage over its numerical counterpart.Comment: In Proceedings SCSS 2012, arXiv:1307.802

The syntax of slavic predicate case

In this article I provide a syntactic framework for case patterns found in Slavic secondary predicates