Results 1  10
of
36
Integrating Behavioral Properties in an Ontology to Automatically Produce an Information System
"... Abstract — The use of domain ontologies lies at the very heart of Information Systems, as they provide a shared conceptualization of domains. However, using an ontology, which by essence embraces a wide range of concepts, poses several questions among which the determination of the subset of its con ..."
Abstract
 Add to MetaCart
Abstract — The use of domain ontologies lies at the very heart of Information Systems, as they provide a shared conceptualization of domains. However, using an ontology, which by essence embraces a wide range of concepts, poses several questions among which the determination of the subset of its concepts that is actually needed for an application and how this subontology can support the production of Information System artifacts compliant with user requirements. We present an approach based on the enrichment of an ontology with properties deduced from the user requirements to determine the subset of the ontology that is necessary for a new Information System. These properties also make possible the automatic production of an operational IS with a prototypical GUI. This approach, implemented by the ISIS platform, can support a high number of specificationimplementationvalidation cycles without increasing the global cost of the project.
Probabilistic user behavior models in online stores for recommender systems
"... Recommender systems are widely used in online stores because they are expected to improve both user convenience and online store profit. As such, a number of recommendation methods have been proposed in recent years. Functions required for recommender systems vary significantly depending on busines ..."
Abstract
 Add to MetaCart
on business models or/and situations. Although an online store can acquire various kinds of information about user behaviors such as purchase history and visiting time of users, this information has not yet been fully used to fulfill the diverse requirements. In this thesis, we propose probabilistic user
Efficient Computation of Minimal Polynomials in Algebraic Extensions of Finite Fields
 In Proceedings of the 1999 International Symposium on Symbolic and Algebraic Computation (Vancouver, BC
, 1999
"... New algorithms are presented for computing the minimal polynomial over a finite field K of a given element in an algebraic extension of K of the form K[ff] or K[ff][fi]. The new algorithms are explicit and can be implemented rather easily in terms of polynomial multiplication, and are much more effi ..."
Abstract

Cited by 30 (0 self)
 Add to MetaCart
New algorithms are presented for computing the minimal polynomial over a finite field K of a given element in an algebraic extension of K of the form K[ff] or K[ff][fi]. The new algorithms are explicit and can be implemented rather easily in terms of polynomial multiplication, and are much more efficient than other algorithms in the literature. 1 Introduction In this paper, we consider the problem of computing the minimal polynomial over a finite field K of a given element oe in an algebraic extension of K of the form K[ff] or K[ff][fi]. The minimal polynomial of oe is defined to be the unique monic polynomial OE oe=K 2 K[x] of least degree such that OE oe=K (oe) = 0. In the first case, we assume that the ring K[ff] is given as K[x]=(f) where f 2 K[x] is a monic polynomial of degree n, and that elements in K[ff] are represented in the natural way as elements of K[x] !n (the set of polynomials of degree less than n). Similarly, in the second case, we assume that K[ff] is given as a...
Lagrangian Relaxation Based Algorithms for Convex Programming Problems
, 2004
"... This thesis deals with a class of Lagrangian relaxation based algorithms developed in the computer science community in last couple of decades. We present a unified framework for designing such algorithms for a large family of convex programming problems. Our algorithms are based on exponential pote ..."
Abstract

Cited by 22 (2 self)
 Add to MetaCart
This thesis deals with a class of Lagrangian relaxation based algorithms developed in the computer science community in last couple of decades. We present a unified framework for designing such algorithms for a large family of convex programming problems. Our algorithms are based on exponential potential functions and given any 2 (0; 1), compute (1 + )approximate solutions in number of iterations proportional to .
Autas: a tool for supporting fmeca generation in aeronautic systems
 In Proceedings 16 th European Conference on Artificial Intelligence  ECAI04
, 2004
"... Abstract. The goal of the FMECA (Failure Mode, Effects and Criticality Analysis) process is to determine the consequences that failures may have on the function of a complex system. In aeronautic industries, this process is very important and must comply with international standards. Today, most of ..."
Abstract

Cited by 4 (1 self)
 Add to MetaCart
of the process is performed manually. This can be problematic, since, although the basic process is not difficult, taking into account all behaviors and all the interactions between the behaviors of several components of a system can be very complex, error prone and costly. In the paper, we discuss how MBR
A modelbased methodology for the integration of diagnosis and fault analysis during the entire life cycle
 In Proceedings Volume from the 6th IFAC Symposium on Fault Detection, Supervision and Safety of Technical Processes (Safeprocess06
, 2006
"... The work presented here uses a library of behavior models of system components as a core for supportive tools for several work processes during the life cycle. Models of complex systems can be automatically composed from such library elements and provide the basis for the automated generation, inste ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
The work presented here uses a library of behavior models of system components as a core for supportive tools for several work processes during the life cycle. Models of complex systems can be automatically composed from such library elements and provide the basis for the automated generation
SECURITY CLASS. Unclassified
, 2004
"... The goal of the FMECA (Failure Mode, Effects and Criticality Analysis) process is to determine the consequences that failures may have on the function of a complex system. In aeronautic industries, this process is very important and must comply with international standards. Today, most of the proces ..."
Abstract
 Add to MetaCart
of the process is performed manually. This can be problematic, since, although the basic process is not difficult, taking into account all behaviors and all the interactions between the behaviors of several components of a system can be very complex, error prone and costly. In the paper, we discuss how MBR
unknown title
"... The paper presents the theoretical foundations and an algorithm to reduce the efforts of testing physical systems. A test is formally described as a set of stimuli (inputs to the system) to shift the system into a particular situation or state, and a set of variables whose observation or measuremen ..."
Abstract
 Add to MetaCart
or measurement refutes hypotheses about the behavior mode the system is operating in. Tests (either generated automatically or by humans) may contain redundancy in the sense that some of its stimuli and/or observables maybe irrelevant for achieving the result of the test. Identifying and dropping them
Decision diagrams in machine learning: an empirical study on reallife creditrisk data,” Expert Systems with Applications
, 2004
"... Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result of which the produced classifiers might become too large to be comprehensible by the human experts that have to validat ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
Decision trees are a widely used knowledge representation in machine learning. However, one of their main drawbacks is the inherent replication of isomorphic subtrees, as a result of which the produced classifiers might become too large to be comprehensible by the human experts that have to validate them. Alternatively, decision diagrams, a generalization of decision trees taking on the form of a rooted, acyclic digraph instead of a tree, have occasionally been suggested as a potentially more compact representation. Their application in machine learning has nonetheless been criticized, because the theoretical size advantages of subgraph sharing did not always directly materialize in the relatively scarce reported experiments on realworld data. Therefore, in this paper, starting from a series of rule sets extracted from three reallife creditscoring data sets, we will empirically assess to what extent decision diagrams are able to provide a compact visual description. Furthermore, we will investigate the practical impact of finding a good attribute ordering on the achieved size savings. 1 1
Results 1  10
of
36