An MDA approach to knowledge engineering

This paper proposes an MDA approach to knowledge engineering, centered on the CommonKADS knowledge model. The latter corresponds to the CIM level of MDA whereas PRR, which represents production rules and rulesets, corresponds to the PIM level. The paper explores the mapping between CommonKADS knowledge models and production rules and rulesets based on PRR. Mapping CommonKADS knowledge models into PRR is very useful, due to the fact that the CIM level remains relatively unexplored, despite its key role in MDA. This motivates our choice to focus on the CIM and PIM levels. Furthermore, the mapping between PIM and PSM (i.e. the implementation of production rules in specific rule-based systems) constitutes less of an issue. To map CommonKADS knowledge models into PRR production rules and rulesets, we propose and illustrate a set of transformations. To ease these transformations, we start by grouping elements of the CommonKADS knowledge models into so-called “inference groups”. We propose and illustrate an algorithm that defines these inference groups automatically. The definition of transformations between models (CIM to PIM levels) requires a specific metamodel for CommonKADS as well as a dedicated metamodel for PRR. Unlike PRR, there is no published CommonKADS metamodel. This paper proposes a comprehensive CommonKADS knowledge metamodel. We describe and discuss an example, applying the whole approach.     

Logic for improving integrity checking in relational data bases⋆

Summary When an updating operation occurs on the current state of a data base, one has to ensure the new state obeys the integrity constraints. So, some of them have to be evaluated on this new state. The evaluation of an integrity constraint can be time consuming, but one can improve such an evaluation by taking advantage from the fact that the integrity constraint is satisfied in the current state. Indeed, it is then possible to derive a simplified form of this integrity constraint which is sufficient to evaluate in the new state in order to determine whether the initial constraint is still satisfied in this new state. The purpose of this paper is to present a simplification method yielding such simplified forms for integrity constraints. These simplified forms depend on the nature of the updating operation which is the cause of the state change. The operations of inserting, deleting, updating a tuple in a relation as well as transactions of such operations are considered. The proposed method is based on syntactical criteria and is validated through first order logic. Examples are treated and some aspects of the method application are discussed.The work reported in this paper was supported by the D.R.E.T.     

Stereoelective polymerization of β-butyrolactone

Racemic β-butyrolactone was polymerized using chiral initiators obtained from the reaction of organometallic derivatives (ZnEt₂, CdMe₂, AlEt₃) with R(−) 3,3 dimethyl-1,2 butanediol. With the zinc initiator, R(+) enantiomer is preferentially incorporated in the polymer chain with a stereoelectivity ratio r_R equal to 1.6. Crude polymer was fractionated into a crystalline, predominantly isotactic, part and an amorphous heterotactic part, both optically active. Sites of different stereospecificities, present in the initiator, are all active for the stereoelective polymerization. With the cadmium initiator, S(−) enantiomer is preferentially polymerized (r_s = 1.01), extending homosteric-antisteric rules previously established for thiiranes. Aluminium initiator leads to an homosteric process (r_R = 1.1). Chiroptical properties (o.r.d. and c.d.) of polymers prepared with zinc initiator show a predominance of R-configurational units, indicating that ring-opening occurs by O-acyl cleavage with retention of configuration.     

Characterization of Fractionated Soy Proteins Produced by a New Simplified Procedure

It was possible to fractionate soy protein into two soy protein isolate fractions (>90% protein) enriched in either glycinin or β-conglycinin by using a new simplified procedure (referred to as the Deak procedure) employing CaCl₂ and NaHSO₃. The Deak procedure produced fractions with higher yields of solids, protein, and isoflavones, and similar protein purities as well as improved functional properties compared to fractions recovered by established, more complex soy protein fractionation procedures. The Deak glycinin-rich fraction comprised 15.5% of the solids, 24.4% of the protein, and 20.5% of the isoflavones in the starting soy flour, whereas the glycinin-rich fraction of the established procedure (Wu procedure) comprised only 11.6% of the solids, 22.3% of the protein, and 9.6% of the isoflavones. The Deak β-conglycinin-rich fraction comprised 23.1% of the solids, 37.1% of the protein, and 37.5% of the isoflavones in the starting soy flour, whereas the Wu β-conglycinin-rich fraction comprised only 11.5% of the solids, 18.5% of the protein, and 3.3% of the isoflavones. Protein purities were >80% for both fractions when using both procedures. The Wu procedure produced protein fractions with slightly higher solubilities and similar surface hydrophobicities; whereas, the fractions produced by the Deak procedure had superior emulsification and foaming properties and similar dynamic viscosity behaviors.     

Two‐phase thermo‐mechanical and macrosegregation modelling of binary alloys solidification with emphasis on the secondary cooling stage of steel slab continuous casting processes

As an approach towards a better modelling of solidification problems, we introduce a thermo‐mechanical and macrosegregation model that considers a solidifying alloy as a binary mixture made of a liquid and a solid phase. Macroscopic conservation laws for mass, momentum and solute are obtained by spatial averaging of the respective microscopic conservation equations. Assuming local thermal equilibrium, a single equation for the conservation of the mixture energy is then written. A single equation can be obtained for the solute as well by invoking a proper microsegregation rule. The numerical implementation in a two‐dimensional finite element code is then detailed. Lastly, some examples of simulations of academic tests as well as industrial applications for continuous casting of steel slabs are discussed. They particularly enlighten the ability of the formulation to describe the formation of central macrosegregation during the secondary cooling of slab continuous casting processes. Copyright © 2006 John Wiley & Sons, Ltd.     

Negotiating Dialogue Games

Recently in the field of agent communication, many authors have adopted the view of interaction as a joint activity regulated by means of dialogue games. It is argued in particular that this approach should increase the flexibility of dialogues by allowing a variety of game compositions. In this research note, we present a framework suited to this feature. A preliminary attempt to capture the negotiation phase (which allows agents to agree upon the dialogue game currently regulating their conversation) is discussed.     

Dual-Priority versus Background Scheduling: A Path-Wise Comparison

In this paper, two well-known scheduling policies for real-time systems, namely background scheduling (BS) and dual-priority (DP) are compared in terms of response times for soft real-time traffic (SRT). It is proved in the preemptive as well as in the non-preemptive case that, when the SRT traffic is FIFO, the DP policy always outperforms BS for all instances of SRT tasks. When the SRT traffic is not FIFO but if all tasks are of equal size then, in the non-preemptive case, the average response times is shown to be always better under DP than under BS. As a complementary result, some non-FIFO examples where BS behaves better than DP for some SRT tasks but also on the average of the SRT response times, are given. The proofs are based on a trajectorial method that may be used for comparing other scheduling policies.     

Structure of Anxiety and Depression in Urban Youth: An Examination of the Tripartite Model.

In this study, the authors examined the validity of the tripartite model of anxiety and depression (L. A. Clark & D. Watson, 1991) in a community epidemiological sample of 467 urban African American youth. Participants completed the Baltimore How I Feel (N. S. Ialongo, S. G. Kellam, & J. Poduska, 1999), a measure of anxiety and depressive symptoms, in Grades 6 and 9. Confirmatory factor analyses indicated that a 3-factor model representing the tripartite model fit the data well and better than competing models. Longitudinal confirmatory factor analysis revealed configural invariance of the tripartite factor structure. However, a predicted divergence among dimensions over time was not evidenced. High correlations among the tripartite dimensions suggest that anxiety and mood symptoms may not differentiate in urban youth. Results are discussed in terms of the ethnicity and urban context of this community sample. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Rain or Snow Detection in Image Sequences Through Use of a Histogram of Orientation of Streaks

The detection of bad weather conditions is crucial for meteorological centers, specially with demand for air, sea and ground traffic management. In this article, a system based on computer vision is presented which detects the presence of rain or snow. To separate the foreground from the background in image sequences, a classical Gaussian Mixture Model is used. The foreground model serves to detect rain and snow, since these are dynamic weather phenomena. Selection rules based on photometry and size are proposed in order to select the potential rain streaks. Then a Histogram of Orientations of rain or snow Streaks (HOS), estimated with the method of geometric moments, is computed, which is assumed to follow a model of Gaussian-uniform mixture. The Gaussian distribution represents the orientation of the rain or the snow whereas the uniform distribution represents the orientation of the noise. An algorithm of expectation maximization is used to separate these two distributions. Following a goodness-of-fit test, the Gaussian distribution is temporally smoothed and its amplitude allows deciding the presence of rain or snow. When the presence of rain or of snow is detected, the HOS makes it possible to detect the pixels of rain or of snow in the foreground images, and to estimate the intensity of the precipitation of rain or of snow. The applications of the method are numerous and include the detection of critical weather conditions, the observation of weather, the reliability improvement of video-surveillance systems and rain rendering.     

Towards Perceptual Simplification of Models with Arbitrary Materials

Real‐time rendering of models with high polygon count is still an important issue in interactive computer graphics. A common way to improve rendering performance is to generate different levels of detail of a model. These are mostly computed using polygonal simplification techniques, which aim to reduce the number of polygons without significant loss of visual fidelity. Most existing algorithms use geometric error bounds, which are well‐suited for silhouette preservation. They ignore the fact that a much more aggressive simplification is possible in low‐contrast areas inside the model. The main contribution of this paper is an efficient simplification algorithm based on the human visual system. The key idea is to move the domain of error computation from image‐space to vertex‐space to avoid a costly per‐pixel comparison. This way the error estimation of a simplification operation can be accelerated significantly. To account for the human vision, we introduce a perceptually based metric depending on the contrast and spatial frequency of the model at a single vertex. Finally, we validate our approach with a user study.