1361502
Model Ontological Commitments Using ORM+ in T-Lex
When designing and developing ontology based applications, we semantically ground them by ontologically committing the application rules to their respective domain. These rules can be, for instance decision rules for a decision support system. For the DOGMA framework we have introduced ORM + , a novel extension of ORM for modeling, visualizing and interchanging ontological commitments. In this paper, we illustrate our ongoing research on ORM + and T-Lex as its supporting tool. We demonstrate in the field of on-line customer management.
2555681
Judicial Support Systems: Ideas for a Privacy Ontology-Based Case Analyzer
Nowadays, ontology is applied as an integral part of many applications in several domains, especially in the world of law. The ontology based judicial support system is believed as a useful tool to support, for example, the legal argumentation assistant and legal decision taking in court. The privacy case analyzer is considered as one of the most interesting applications of ontology based privacy judicial support systems. The efficiency of privacy case analyzers depend on several factors such as how to tackle the problem of linking cases to legislations, how to imply the guidance of privacy principles, and how to improve the extraction of cases. This paper addresses those items and describes the research issues that will be investigated challenges of ontology based judicial support systems.
32294667
Use Semantic Decision Tables to Improve Meaning Evolution Support Systems
Meaning Evolution Support Systems have been recently introduced as a real-time, scalable, community-basedcooperative systems to support the ontology evolution. In this paper, we intend to address the problems of accuracyand effectivenessin Meaning Evolution Support Systems in general. We use Semantic Decision Tables to tackle these problems. A Semantic Decision Table separates general decision rules from the processes, bootstraps policies and template dependencies in the whole system. Recently, DOGMA-MESS (" D eveloping O ntology G rounded M ethodology and A pplications" framework based " M eaning E volution S upport S ystems") is developed at VUB STARLab as a collection of meaning evolution support systems. We embed Semantic Decision Tables in DOGMA-MESS to illustrate our approach. Semantic Decision Tables play the roles in both top-downand bottom-upprocesses of the meaning evolution cycle. The decision rules that consist of templates dependency rules are mainly responsible for the top-down process execution. The bottom-up process execution relies on the ones that contain the concept lifting algorithms.
35426902
Towards Ontological Commitments with Omega -RIDL Markup Language
In the DOGMA (Developing Ontology-Grounded Methods and Applications) ontology engineering approach, ontology construction starts from an uninterpreted base of elementary fact types, called lexons, which are mined from linguistic descriptions. Applications that ontologically commit to such a lexon base are assigned a formal semantics by mapping the application symbols to paths in this lexon base. Besides specifying which concepts are used, we restrict how they may be used and queried with semantic constraints, or rules, based on the fact-based database modeling method NIAM/ORM. Such ontological commitments are specified in the Ω-RIDL1 language. In this paper we present the Ω -RIDL Markup Language and illustrate with a case from the field of Human Resources Management.
1436959
Towards Semantically Grounded Decision Rules Using ORM +
Recently, ontologies are proposed for many purposes to assist decision making, such as representing terminology and categorizing information. Current ontology-based decision support systems mainly contain semantically rich decision rules. In order to ground the semantics, we formalize those rules by committing them to domain ontologies. Those semantically grounded decision rules can represent the semantics precisely, thus improve the functionalities of many available rule engines. We model and visualize the rules by means of a novel extension of ORM. These rules are further stored in an XML-based markup language, ORM+ ML, which is a hybrid language of Rule-ML and ORM-ML. We demonstrate in the field of on-line customer management.
31156520
An Ontology-based Data Matching Framework: use Case Competency-based HRM
As part of the European PROLIX (Process Oriented Learning and Information eXchange) project, VUB STARLab designed a generic ontology-based data matching framework (ODMF). Within the project, the ODMF is used to calculate the similarity between data elements, e.g. competency, function, person, task, and qualification, based on competency-information. Several ontology-based data matching strategies were implemented and evaluated as part of the ODMF. In this article we describe the ODMF and discuss the implemented matching strategies.
8498633
The Data Scales in Multi-valued Context Based on Formal Concept Analysis
Formal Concept Analysis has very important meaning in mathematical methods for data mining and knowledge processing. In the face of the variety of the data structure, traditional methods can hardly meet decider’s need. This paper summarizes a few of data structure for the concept analysis and present the data scale methods for each other based on their own characters. It not only extends the application of the concept analysis, but also makes the data scale methods more efficiently.
16895768
A Novel Stroke Extraction Model for Chinese Characters based on Steerable Filters
The technology of stroke extraction plays a key role in the off-line Chinese character recognition field. The accuracy and computing complexity of classifying depend on the output of stroke extraction. Based on the analysis of the existing methods, this paper proposed a novel stroke extraction model with steerable filters. The experiments indicate that this model can be used to extract strokes from both printed and handwritten Chinese characters. Meanwhile, it also can be applied to eliminate the redundant stroke connections impressively with considerable low computing complexity
14166643
3D Model Simplification Method Based on ROI
Based on edge-collapse algorithm and ROI (region of interest), an effective 3D mesh simplification method is proposed. During the simplification procedure, this method could successfully preserve a high resolution for the 3D part that the user is interested in while the rest parts could meet the basic requirement with lower resolution. The experiments support the conclusion.
40790501
A Practical Peer-Performance-Aware DHT
How to Build an efficient Distributed Hash Table (DHT) is a fundamental issue in Peer-to-Peer research field. Previous solutions ignore the heterogeneity of the large scale network. However, in practice, the fact is that the resource held by each peer in the Internet is extremely diverse. And the the willing to share local resources of each peer is also diverse. Therefore, the contribution for the system of a peer should depend on the resources it holds or how many resources it want to share, and should not be uniform. In this paper, we propose a Peer-Performance-Aware Distributed Hash Table (PPADHT) which aims to exploit the heterogeneity. It takes the performance difference of peers into consideration to construct a dynamic variation of wrapped butterfly to achieve the goal. We also show how to optimize the performance of PPADHT in the view of hop counts by random graphs. Our simulation results show that the average lookup hop counts of the PPADHT is approximately a log scale with constant out degrees. And it can achieve loadbalance in two ways: both the document load and message routing load, without introducing any additional load on the peer. Here, the load balance means the load is proportion to the performance of peer.
12737531
Accelerating the 2D Mallat decomposition algorithm with cyclical convolution and FNTT
This paper presents a novel approach to accelerate the 2D Mallat decomposition algorithm. In particular the proposed approach performs the 2D Mallat decomposition algorithm by way of computing the 2D cyclical convolution, and further completes the 2D cyclical convolution with the fast number theoretical transform (FNTT). Therefore, the 2D Mallat decomposition algorithm can be speeded up. The results obtained from the theoretical analysis and the experiment show that the 2D Mallat decomposition algorithm is significantly improved.