17885523
On Constructing Semantic Decision Tables
Decision tables are a widely used knowledge management tool in the decision making process. Ambiguity and conceptual reasoning difficulties arise while designing large decision tables in a collaborative environment. We introduce the notion of Semantic Decision Table (SDT), which enhances a decision table with explicit decision semantics by annotating it properly with a domain ontology. In this paper, we focus on the SDT construction process. First, we map decision items to the ontology by building a rooted tree of decision binary facts and visualize it in a scalable manner. Formal ontological roles are used during this mapping process. Then, we commit the decision rules to the mapping results with a high level pseudo-natural language to ground their semantic. We illustrate with an SDT example from the domain of human resource management.
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.
2826645
PROFILE COMPILER: Ontology-based, community-grounded, multilingual online services to support collaborative decision making
In todaypsilas industries, ontologies and the modern semantic technologies are offered as the potential solutions to support mutual understanding in the collaborative settings. Currently, organizations are unable to cope with collaborative decision making in a particular domain. Mastering domain knowledge and sharing decision rules is a complex yet important issue. In this paper, we first design a generic framework for community-grounded, collaborative decision making enabled, ontology based systems. This framework is constructed with three main engineering tracks: the linguistic engineering track, the ontology engineering track and the group decision engineering track. Each engineering track has its own methodology supported by a tool. Then, we use Semantic Decision Tables to elaborate the knowledge blocks resulting from these three engineering tracks. Semantic Decision Tables are mainly used (1) to elaborate concepts of the domain ontologies, (2) to gather semantically grounded decision rules within a decision group and (3) to provide tabular reports to the users. Finally, an online multilingual knowledge platform - the PROFILE COMPILER is developed as the result. It allows small or medium-sized enterprises (SMEs) to retrieve and personalize existing domain ontology, design and share their decision rules. We illustrate in the domain of Human Resource Management (HRM).
16597693
On Conducting a Decision Group to Construct Semantic Decision Tables
Semantic Decision Table (SDT) was introduced to support collaborative decision making. Semantics, a group of decision makers, mutual understanding and collaborative environment(s) are at the heart of SDT. In practice, it is rather difficult to construct SDT within a decision group. We try to tackle this problem by modeling SDT within the context of information system, which is based on McGrath's Conceptual Framework for the Study of Group. Ontologies and DOGMA (Developing Ontology-Grounded Methods and Applications) approach to ontology engineering are proposed to store the semantics and mutual understanding for SDT. In this paper, we also propose a generic method of guiding a group to construct SDT, which is illustrated with an example of online customer management in the privacy domain.
33017168
An ontology engineering methodology for DOGMA
Although ontologies occupy a central place in the Semantic Web and related research domains, there are currently not many fully fledged ontology engineering methodologies available. In this paper, we want to present an integrated methodology for ontology engineering from scratch, inspired by various scientific disciplines, in particular database semantics and natural language processing.
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.
38545491
Defining Re-usable Composite Aspect Patterns: An FDAF Based Approach
Architecting secure systems is an important and challenging problem. Solutions to model individual, or atomic, security capabilities have been proposed, including security patterns, component based, aspect-oriented, and service-oriented approaches. However, little work is available on how to model reusable compositions of security capabilities, where the security capabilities interact with each other and other parts of the system design. Here, an aspect-oriented approach to modeling composite aspects is presented. The approach is defined as an extension to the Formal Design Analysis Framework (FDAF). The FDAF metamodel is extended to support the static representation of composite aspects and an approach to defining the compositions is introduced. A composite aspect that provides Account Lockout with Selective Event Logging (ALSEL) capabilities is used as an example.
17461739
The design and implementation of LilyTask in shared memory
Constructing high performance computing system and providing easy-to-use programming model for users are two main parts of parallel computing, but the latter has been in a sorry state for a long time. LilyTask programming model is based on tasks which can be easily mapped to the decomposition of computation. Without explict synchronization and mutual exclusion, users will concentrate on the inherent parallelism in a problem instead of lock/unlock programming techniques. Most existing implementations of the task pool, a flexible data structure for task parallel, lack basic representation of relations among tasks. LilyTask introduces task group and task relation to help users easily map subproblems to tasks. The kernel of LilyTask system, a distributed task pool, automatically exploits potential parallelism among tasks at runtime. With runtime task assignment and task stealing, LilyTask system achieves dynamic load balancing. Our performance evaluation shows that LilyTask system with task pool outperforms sequential programs and BSPlib in solving both regular and irregular problems.
44335940
DRC-BK: Mining Classification Rules with Help of SVM
Currently, the accuracy of SVM classifier is very high, but the classification model of SVM classifier is not understandable by human experts. In this paper, we use SVM, which is applied with a Boolean kernel, to construct a hyper-plan for classification, and mine classification rules from this hyper-plane. In this way, we build DRC-BK, a decision rule classifier. Experiment results show that DRC-BK has a higher accuracy than some state-of-art decision rule (decision tree) classifiers, such as C4.5, CBA, CMAR, CAEP and so on.
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.