FUZZY LOGIC PROCEDURE FOR DRAWING UP A PSYCHOLOGICAL PROFILE OF LEARNERS FOR BETTER PERCEPTION IN COURSES

This article offers an original classification procedure based on Mamdani fuzzy inference system (FIS) dedicated to compute multiple criterions each from different type of psychological profiles. The modelling and information analysis of the FIS are developed to draw a general conclusion from several psychological criterions in order to provide better pre-course lecturer preparation and thus better students’ perception. Simulation experiments are carried out in MATLAB environment

NEURAL NETWORK CLASSIFICATION METHOD FOR AIRCRAFT IN ISAR IMAGES

This article offers a neural network method for automatic classification of Inverse Synthetic Aperture Radar objects represented in images with high level of post-receive optimization. A full explanation of the procedures of two-layer neural network architecture creating and training is described. The classification in the recognition stage is proposed, based on several main classes or sets of flying objects. The classification sets are designed according to distinctive specifications in the structural models of the aircrafts. The neural network is experimentally simulated in MATLAB environment. Numerical results of the experiments carried, prove the correct classification of the objects in ISAR optimized images

Reachability analysis of branching probabilistic processes

We study a fundamental class of infinite-state stochastic processes and stochastic games, namely Branching Processes, under the properties of (single-target) reachability and multi-objective reachability. In particular, we study Branching Concurrent Stochastic Games (BCSGs), which are an imperfect-information game extension to the classical Branching Processes, and show that these games are determined, i.e., have a value, under the fundamental objective of reachability, building on and generalizing prior work on Branching Simple Stochastic Games and finite-state Concurrent Stochastic Games. We show that, unlike in the turn-based branching games, in the concurrent setting the almost-sure and limitsure reachability problems do not coincide and we give polynomial time algorithms for deciding both almost-sure and limit-sure reachability. We also provide a discussion on the complexity of quantitative reachability questions for BCSGs. Furthermore, we introduce a new model, namely Ordered Branching Processes (OBPs), which is a hybrid model between classical Branching Processes and Stochastic Context-Free Grammars. Under the reachability objective, this model is equivalent to the classical Branching Processes. We study qualitative multi-objective reachability questions for Ordered Branching Markov Decision Processes (OBMDPs), or equivalently context-free MDPs with simultaneous derivation. We provide algorithmic results for efficiently checking certain Boolean combinations of qualitative reachability and non-reachability queries with respect to different given target non-terminals. Among the more interesting multi-objective reachability results, we provide two separate algorithms for almost-sure and limit-sure multi-target reachability for OBMDPs. Specifically, given an OBMDP, given a starting non-terminal, and given a set of target non-terminals, our first algorithm decides whether the supremum probability, of generating a tree that contains every target non-terminal in the set, is 1. Our second algorithm decides whether there is a strategy for the player to almost-surely (with probability 1) generate a tree that contains every target non-terminal in the set. The two separate algorithms are needed: we show that indeed, in this context, almost-sure and limit-sure multi-target reachability do not coincide. Both algorithms run in time polynomial in the size of the OBMDP and exponential in the number of targets. Hence, they run in polynomial time when the number of targets is fixed. The algorithms are fixed-parameter tractable with respect to this number. Moreover, we show that the qualitative almost-sure (and limit-sure) multi-target reachability decision problem is in general NP-hard, when the size of the set of target non-terminals is not fixed

Col-Graph: Towards Writable and Scalable Linked Open Data

International audienceLinked Open Data faces severe issues of scalability, availability and data quality. these issues are observed by data consumers performing federated queries; SPARQL endpoints do not respond and results can be wrong or out-of-date. If a data consumer finds an error, how can she fix it? This raises the issue of the writability of Linked Data. In this paper, we devise aan extension of the federation of Linked Data to data consumers. A data consumer can make partial copies of different datasets and make them available through a SPARQL endpoint. A data consumer can update her local copy and share updates with data providers and consumers. Update sharing improves general data quality, and replicated data creates opportunities for federated query engines to improve availability. However, when updates occur in an uncontrolled way, consistency issues arise. In this paper, we define fragments as SPARQL CONSTRUCT queries and propose a correction criterion to maintain these fragments incrementally without reevaluating the query. We define a coordination free protocol based on the counting of triples derivations and provenance. We analyze the theoretical complexity of the protocol in time, space and traffic. Experimental results suggest the scalability of our approach

Stereoselective Synthesis of the Quettamine Skeleton

A synthesis of the quettamine skeleton 29 is described comprising ring closure of the diastereomeric phenolic 1-(α-bromobenzyl)-tetrahydroisoquinolines 27a and 27b. In both cases only one diastereomer was obtained. NOE-experiments confirm Shamma's assignments concerning the stereochemistry. - Various attemps to cleave the dithiane derivative 5 of an α-amino ketone in order to obtain the ketone 6 failed on account of the non-bonding electron pair at the N-atom. Wir beschreiben die Synthese des Quettamin-Gerüstes 29 durch Ringschluß der diastereomeren 1-(α-Brombenzyl)-tetrahydroisochinoline 27a and 27b. In beiden Fällen resultierte nur ein Diastereomer. NOE-Messungen bestätigen Shamma's Aussagen zur Stereochemie. - Zahlreiche Versuche, das Dithian-Derivat 5 eines α-Aminoketons zum Keton 6 zu spalten, schlugen fehl wegen des nichtbindenden Elektronenpaars am Stickstoff

Activity and Enantioselectivity of the Hydroxynitrile Lyase MeHNL in Dry Organic Solvents

Water concentration affects both the enantioselectivity and activity of enzymes in dry organic media. Its influence has been investigated using the hydrocyanation of benzaldehyde catalyzed by hydroxynitrile lyase cross-linked enzyme aggregate (MeHNL-CLEA) as a model reaction. The enzyme displayed higher enantioselectivity at higher water concentration, thus suggesting a positive effect of enzyme flexibility on selectivity. The activity increased on reducing the solvent water content, but drastic dehydration of the enzyme resulted in a reversible loss of activity