Search

Nowadays cranial disorders are one of the most common type of infants' diseases. However, despite such disorders are widespread, in the state of the art does not exist a system which allows the doctors to share their knowledge in order to support their clinical decisions. This is mainly caused by the different national laws governing the access to information concerning minors. However, it is important to emphasize that such limited access during the decision-making process, is one of the main causes of medical errors, and clearly can lead to serious consequences for the patient's health.In order to overcome the above defined issues, we first propose an engine for the automatic analysis of the patients' cranial data, which allows to detect end quantify eventual disorders. In addition, we propose a collaborative decision support system to enable the secure storing, sharing and analysis of clinically relevant information, which allows to not violate the patients' privacy. In particular, the collaborative system we propose, enables the doctors to rely on a previously acquired base of knowledge, as well as on the opinions of other doctors, during all the phases necessary to carry out the analysis and the clinical evaluation of the patient under examination.The proposed collaborative system can represent a valuable and effective aid for the doctors in charge of such disorders, even allowing to overcome the limitations imposed by national law.

Dijabetička retinopatija posljedica je djelovanja povećane razine šećera u krvi na krvne žile oka. Kod osoba oboljelih od dijabetesa važne su redovite kontrole vida kako bi se što ranije otkrile i liječile eventualne komplikacije. Dijagnoza dijabetičke retinopatije postavlja se na temelju detaljnog pregleda očne pozadine. S obzirom da se javlja problem premalog broja liječnika, javlja se ideja o automatiziranom pregledu pacijenata. Implementiran je informacijski sustav za oftalmološku bazu slika koji omogućava liječnicima lakše i brže obavljanje pregleda. Uz pomoć automatske analize slika očnih pozadina, liječnicima je omogućeno izdavanje uputnica za oftalmologiju oboljelim pacijentima. Oftalmolozi na jednostavan način mogu pregledavati povijest bolesti pacijenta te imaju uvid u slike očne pozadine koje su snimljene od strane medicinskih tehničara. Oftalmolozi lako mogu postavljati dijagnoze, te pacijent u slučaju oboljenja na vrijeme može početi s liječenjem. Diabetic retinopathy is a complication of diabetes that affects the eyes. It's caused by damage to the blood vessels at the back of the eye. In patients with diabetes it’s important to have a comprehensive dilated eye examination frequently. Considering insufficient number of doctors, there is the idea of automatic patient examination. This paper describes implementation of information system for ophthalmologic image database that allows easier and faster examination of the patient. With the help of automatic fundus image analysis, doctor can issue referral to ophthalmologist to the patient with diabetic retinopathy. Ophthalmologist can easily view medical history of the patient and he has access to images of the retina that were taken by medical technician. So, ophthalmologist has possibility of early detection and treatment of patient illness.

El uso de diferentes métodos y herramientas que asistan en la organización y el control de procesos, ha tomado relevancia debido a la necesidadconstante de eficiencia por parte de la industria y a la adecuación de sus prácticasa las emergentes y novedosas técnicas de desarrollo y producción. Como productode estas necesidades, diversos lenguajes para la descripción de procesos de negocioscapturaron el interés tanto del sector productivo, para su aplicación en sus actividades,como así también del sector académico, con el fin de aportar conocimiento ygenerar nuevas herramientas para tal fin. Si bien la mayor parte de los lenguajes para la especificación de procesos denegocios son informales, existen algunos fundados en formalismos matemáticos. Estobrinda a estos lenguajes formales para procesos de negocios la eliminación deambigüedades en la interpretación de especificaciones, y la posibilidad de realizardiferentes análisis formales, como chequeos de sanidad. Sin embargo, las alternativasexistentes poseen en general limitaciones, o bien en poder expresivo, o, para lasalternativas más expresivas, la imposibilidad de realizar algunas tareas de análisisautomáticamente. En este trabajo presentamos un enfoque formal para la especificación y el análisis de procesos de negocios, que permite dar semántica a construccionescomplejas de procesos de negocios, a la vez que admite el análisis de chequeos desanidad usuales de manera automática mediante model checking. Más aún, nuestrapropuesta abarca la posibilidad de que el usuario especifique y analice propiedadesde interés acerca de las especificaciones, mediante lógicas temporales, un mecanismocon frecuencia ausente en los lenguajes existentes. Además del desarrollo de una semántica formal para un lenguaje de proceso denegocios sumamente expresivo, nuestro trabajo toma como base para la especificación de propiedades de procesos de negocios el uso de lógicas temporales. Identificamosalgunos elementos que hacen particularmente complicada la expresión dealgunos tipos de propiedades, en particular cuando las mismas demandan expresarrepeticiones de eventos o tareas, y proponemos una lógica temporal que permitedescribir tales propiedades con mayor facilidad. Con el fin de no perder capacidadde análisis, desarrollamos traducciones que nos permiten capturar los elementosnovedosos de esta lógica en términos de otros elementos, soportados por lógicas temporales tradicionales, con soporte de herramientas. Por otra parte, observamosla tendencia de los lenguajes de descripción de procesos de negocios a no tratar formalmentela descripción de los productos que manipulan. Tomamos un formalismoexcepcional en este sentido, PPML, y definimos a partir del mismo un lenguaje deespecificaciones, una semántica simplificada para el mismo, y una técnica de análisisde especificaciones basada en una caracterización de sus modelos en UPPAAL. Nuestro enfoque está claramente orientado a la producción de herramientas desoporte al proceso de especificación. Para los lenguajes tratados brindamos herramientasde especificación y análisis de procesos de negocios, como así también laposibilidad de construir descripciones de procesos de negocios a partir de las propiedadesque los mismos deben cumplir. Estas tareas son evaluadas en este trabajoa través del desarrollo de casos de estudio tomados de la literatura del área, en loque respecta a descripción de procesos y chequeos de sanidad de los mismos, y enbase a variantes de estos casos en las cuales se enfatiza la necesidad de contar conpropiedades descriptas por el usuario, y de dar más relevancia a la descripción delos productos manipulados por los procesos de negocios. The use of methods and tools to assist in process organization andcontrol is receiving increasing attention. This is due to the constant need for efficiencyin industry, and the pressure on industry to adopt emergent developmentand production techniques, and adapt current practices to these emergent technologies. As a consequence, various languages for describing business processes haveattracted both industry, which applies them in its activities, and academia, whichcan contribute knowledge and help provide novel tools for these languages. Even though most languages for business process specification are informal, someof these languages are founded on mathematical formalisms. Formal business processspecification languages profit from the elimination of ambiguities in the interpretationof their specifications, and the possibility of performing different kinds of formalanalyses, such as soundess checks. However, the available formal alternatives havelimitations, either in expressive power, or, in the case of the more expressive formalisms,the impossibility of performing some analysis tasks fully automatically. Inthis work we present a formal approach for the specification and analysis of businessprocesses, that allows us to provide suitable semantics to complex constructions inbusiness process specifications, while at the same time allowing us to perform typicalsoundness checks fully automatically via model checking. Moreover, our approachincludes the possibility of enabling users to specify and analyze properties of theirinterest about specifications, using temporal logics, a mechanism often missing fromexisting languages. Besides the development of a formal semantics for a very expressive businessprocess language, our work is based on the use of temporal logics for specifyingproperties of business processes. We identify some elements that make it difficult toexpress some kinds of properties, in particular those demanding referring to repetitionsof events or tasks, and propose a temporal logic that allows us to specify theseproperties more conveniently. In order to maintain the possibility of automaticallyanalyzing specifications, we develop translations that enable us to capture the novelelements in our logic in terms of other elements, supported by traditional temporallogics with tool support. Also, we observe a tendency in business process languagesto disregard, in their formalizations, the description of the products that processes manipulate. We take a formalism that is exceptional in this respect, PPML, anddefine a formal specification language in terms of it, a simplified semantics for it,and an analysis technique for its specifications, based on a characterization of itsmodels in UPPAAL. Our approach is clearly oriented towards producing tool support for businessprocess specification. For the languages that we deal with in this work, we providetools for business process specification, property specification, and automatedanalysis. We also enable the user to build business process descriptions from theproperties these processes are required to fullfil. These tasks are assessed in ourwork via case studies taken from the literature, for the case of business process descriptionand soundness checks, and variants of these case studies in which the needof referring to event repetitions, and the role of products in process descriptions, areemphasized. Fil: Regis, Germán Enrique. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina.

航空宇宙技術研究所 16-18 Jun. 1999 東京 日本, National Aerospace Laboratory 16-18 Jun. 1999 Tokyo Japan, 3次元物体周りの非粘性流の高速な自動化解析のためのCartesian格子生成法を開発した。この方法は固体表面とCartesian格子の間の断面が簡単でない場合を考慮することができる。従って薄い物体や鋭角または複数固体領域などをセル内に含む場合を厳密に取り扱うことができる。このようなケースはしばしば超音速輸送機(SST)モデルの計算に現れてくる。計算効率を上げるために、セルの内側の物体表面を表すために擬似平面近似を行い、その結果この適用例では全物体表面の要素を約3分の1に減らすことができた。曲面のまわりの局所細分化格子について新アルゴリズムを使うことによってより高い計算効率を達成できる。, A Cartesian grid generation method has been developed for fast and automated analysis of inviscid flows around three dimensional bodies. It can take into account non-simple cases of intersection between a solid surface and a Cartesian grid, so that a cell containing a thin body, a sharp edge or multiple solid regions is properly handled. These cases appear frequently in the computation of a Supersonic Transport (SST) model. To increase the efficiency of computation, a pseudo-planar approximation is made to represent a body surface inside a cell, resulting in a reduction of total body surface elements by a factor of about three in this application. Higher efficiency is achieved using a new algorithm for local grid refinement around a curved surface., 資料番号: AA0001961042, レポート番号: NAL SP-44

Technologies that measure human nonverbal behavior have existed for some time, and their use in the analysis of social behavior has become more popular following the development of sensor technologies that record full-body movement. However, a standardized methodology to efficiently represent and analyze full-body motion is absent. In this article, we present automated measurement and analysis of body motion (AMAB), a methodology for examining individual and interpersonal nonverbal behavior from the output of full-body motion tracking systems. We address the recording, screening, and normalization of the data, providing methods for standardizing the data across recording condition and across subject body sizes. We then propose a series of dependent measures to operationalize common research questions in psychological research. We present practical examples from several application areas to demonstrate the efficacy of our proposed method for full-body measurements and comparisons across time, space, body parts, and subjects.

Systematic risk analysis can be based on causal analysis of business exceptions. In this paper we describe the concepts of automatic analysis for the exceptional patterns which are hidden in a large set of business data. These exceptions are interesting to be investigated further for their causes and explanations. The analysis process is driven by diagnostic drill-down operations following the equations of the information structure in which the data are organised. Using business intelligence, the analysis method can generate explanations supported by the data.

Systematic risk analysis can be based on causal analysis of business exceptions. In this paper we describe the concepts of automatic analysis for the exceptional patterns which are hidden in a large set of business data. These exceptions are interesting to be investigated further for their causes and explanations. The analysis process is driven by diagnostic drill-down operations following the equations of the information structure in which the data are organised. Using business intelligence, the analysis method can generate explanations supported by the data.

Atrial fibrillation is the most common cardiac arrhythmia and its pathophysiology is still poorly understood. To date, there is no animal model in which the arrhythmia occurs spontaneously. As ageand hypertension are major risk factors of atrial fibrillation in humans, we examined whether the aging (11-13 months of age) spontaneously hypertensive rat (SHR) develops this pathology. Telemetric recordings of electrocardiogram (ECG) were obtained in four groups of conscious rats. They revealed the presence in the aging SHR of many non-sustained atrial tachyarrhythmic episodes that were observed neither in the young SHR nor in the young or aging normotensive Wistar Kyotorat. These results were obtained by visual examination of the whole ECG recordings, which is extremely time consuming and thus, not compatible with routine experiments. Therefore, we chose to develop an automated method to detect atrial arrhythmias in the conscious rat. This method only uses RR intervalsbecause P waves cannot always be accurately identified in telemetric recordings. It recognizes characteristicpatterns of tachyarrhythmia by using an automaton structure, and shows a good performance when applied to previously collected telemetric data. The new animal model, together with the new, automated method of ECG analysis, are expected to be extremely useful for producing high quality phenotypic data, which are necessary to test present molecular hypotheses of atrial fibrillation pathophysiology., La fibrillation atriale est la plus fréquente des arythmies cardiaques et sa physiopathologie reste mal comprise. Il n’existe pas actuellement de modèle animal dans lequel cette arythmie survienne de manière spontanée. Comme l’âge et l’hypertension artérielle sont deux facteurs de risque majeurs dela fibrillation atriale chez l’Homme, nous avons recherché si le rat spontanément hypertendu (SHR)vieillissant (11-13 mois d’âge) développe cette pathologie. Des enregistrements télémétriques de 24 h de l’électrocardiogramme (ECG) ont été réalisés dans 4 groupes de rats vigils. Ils ont révélé chez le rat SHR vieillissant la présence de nombreux épisodes de tachyarythmie atriale non soutenus, épisodes qui ne sont pas observés chez le rat SHR jeune ni chez lerat normotendu Wistar Kyoto jeune ou vieillissant. Les résultats rapportés ci-dessus ont été obtenus grâce à l’analyse visuelle de l’intégralité de chaque enregistrement ECG, ce qui représente une durée d’analyse incompatible avec des expérimentations de routine. Nous avons donc choisi de développer une méthode automatique de reconnaissance des arythmies atriales chez le rat vigil. Cette méthode utilise exclusivement les intervalles RR car les ondes P ne peuvent pas toujours être identifiées avec fiabilité dans les enregistrements télémétriques de l’ECG. Elle repère les motifs caractéristiques de tachyarythmie grâce à une structure d’automate, et présente une bonne performance sur les enregistrements télémétriques déjà réalisés. Le nouveau modèle animal, conjointement à la nouvelle méthode automatique d’analyse de l’ECG, devrait permettre de réaliser les analyses phénotypiques de qualité indispensables aux hypothèses physiopathologiques moléculaires actuellement avancées dans la fibrillation atriale.

Awareness that networked embedded systems are vulnerable to cyber-threats has been constantly raising since some years ago. In the industrial arena recent severe attacks, such as the popular case of the Stuxnet worm, have completely debunked the myth of security of embedded devices based on their isolation. Indeed, the ever increasing dependence of many industrial systems on digital communication networks is causing the cyber-security requirements to become a priority in their planning, design, deployment and management. This paper deals with our experience in checking the conformance of a distributed industrial automation system, which includes several types of embedded devices, with respect to a set of security policies defined at the global system level. In particular, the focus of the paper is on the use of modeling techniques and semi-automated s/w tools to verify the configuration of devices and services with attention to the correct use of their security capabilities to support the desired set of policies.

International audience; Widely studied in terms of perception, acoustics or aerodynamics, dysphonia stays nevertheless a speech phenomenon, closely related to the phonetic composition of the message conveyed by the voice. In this paper, we present a series of three works with the aim to understand the implications of the phonetic manifestation of dysphonia. Our first study proposes a new approach to the perceptual analysis of dysphonia (the phonetic labeling), which principle is to listen and evaluate each phoneme in a sentence separately. This study confirms the hypothesis of Laver that the dysphonia is not a constant noise added to the speech signal, but a discontinuous phenomenon, occurring on certain phonemes, based on the phonetic context. However, the burden of executing the task has led us to look to the techniques of automatic speaker recognition (ASR) to automate the procedure. With the collaboration of the LIA, we have developed a system for automatic classification of dysphonia from the techniques of ASR. This is the subject of our second study. The first results obtained with this system suggest that the unvoiced consonants show predominant performance in the task of automatic classification of dysphonia. This result is surprising since it is often assumed that dysphonia occurs only on laryngeal vibration. We started looking for explanations of this phenomenon and we present our assumptions and experiences in the third work we present.; Largement étudiée sous l’angle perceptif, acoustique ou aérodynamique, la dysphonie n’en reste pas moins un phénomène de parole, étroitement lié à la composition phonétique du message que la voix véhicule. Dans cet article, nous présentons une série de trois travaux menés dans l’objectif de comprendre les implications phonétiques de la manifestation de la dysphonie. Notre première étude propose une nouvelle approche de l’analyse perceptive de la dysphonie, le phonetic labelling, dont le principe est d’écouter et d’évaluer chaque phonème d’une phrase séparément. Cette étude confirme l’hypothèse de Laver (Laver, 1981) selon laquelle la dysphonie n’est pas un bruit constant ajouté au signal de parole, mais un phénomène discontinu, intervenant sur certains phonèmes en fonction du contexte phonétique. Cependant, la lourdeur d’exécution de la tâche nous a conduits à nous tourner vers les techniques de reconnaissance automatique du locuteur (RAL) afin d’automatiser la procédure. Grâce à la collaboration du LIA, nous avons développé un système de classification automatique de la dysphonie issu des techniques de la RAL. C’est l’objet de notre seconde étude. Les premiers résultats obtenus avec ce système suggèrent que les consonnes non-voisées montrent des performances prépondérantes dans la tâche de classification automatique de la dysphonie. Ce résultat est surprenant dans la mesure où l’on considère souvent que la dysphonie n’intervient que sur la vibration laryngée. Nous sommes donc partis à la recherche d’explications de ce phénomène et nous exposons nos hypothèses et expériences dans le troisième travail que nous présentons.

The aim of this study was to arrange an automatic quantitative measure of the electroencephalographic (EEG) signal amplitude variability during non-rapid eye movement (NREM) sleep, correlated with the visually extracted cyclic alternating pattern (CAP) parameters. Ninety-eight polysomnographic EEG recordings of normal controls were used. A new algorithm based on the analysis of the EEG amplitude variability during NREM sleep was designed and applied to all recordings, which were also scored visually for CAP. All measurements obtained with the new algorithm correlated positively with corresponding CAP parameters. In particular, total CAP time correlated with total NREM variability time (r = 0.596; P 1E-07), light sleep CAP time with light sleep variability time (r = 0.597; P 1E-07) and slow wave sleep CAP time with slow wave sleep variability time (r = 0.809; P 1E-07). Only the duration of CAP A phases showed a low correlation with the duration of variability events. Finally, the age-related modifications of CAP time and of NREM variability time were found to be very similar. The new method for the automatic analysis of NREM sleep amplitude variability presented here correlates significantly with visual CAP parameters; its application requires a minimum work time, compared to CAP analysis, and might be used in large studies involving numerous recordings in which NREM sleep EEG amplitude variability needs to be assessed.

[ES] La idea principal es realizar una prueba automática y sistema de análisis para los bordes de corte con el fin de mejorar la resistencia al desgaste y reducir la energía de corte en hojas industriales. En primer lugar se desarrolló un algoritmo para caracterizar contornos regulares geométricos 2D. Posteriormente se desarrolló un sistema de medidas con CAN-BUS. La idea es realizar un producto que es compatible con otros dispositivos, tales como sensores, actuadores, etc Después de que un algoritmo de 3D se implementa para mecánico futuro y simulaciones de fluidos., [EN] The main idea is to realize an automatic test and analysis system for cutting edges in order to improve the wear resistance and reduce the cutting energy in industrial blades. Firstly it is developed an algorithm to characterize contours by regular 2D geometries. Afterwards it is developed an measuring system with CAN-BUS. The idea is to realize a product which is compatible with other devices, such as sensors, actuators, etc. After that a 3D algorithm is implemented for future mechanical and fluids simulations.

In this work we propose a joint two-side masking procedure for automatic analysis of mammographic images. The primary objective is the improvement of computerized systems capability in revealing additional findings, as the asymmetrical changes of the breast parenchyma. The method allows the proper comparison of the left and right breast by progressive selection of paired small areas on the mammogram, primarily the so-called “forbidden areas”, zones that need special attention in mammographic interpretation. The masking of specific areas of the mammogram requires the identification of two anatomical structures of the breast: the pectoral muscle and the nipple used, together with the breast skin line, to find paired matching points on the images for comparison. With this purpose, specific algorithms have been developed. In particular, a new method for nipple extraction will be presented and validated by expert radiologists, by the use of a proprietary program developed by the authors. Finally, an application example of the automatic Tabar masking procedure will be shown, in order to point out the potential of this method in detection of suspicious areas in mammograms.

This Thesis deals with the domain of cryptography based on hybrid chaotic dynamics.In order to increase the robustness of the security in data transmission with respect to known text attack, this work was particularly focused on two directions: the statistical approach and the automation control.The main contributions of this work are organized in the mentioned two directions.The choice of the measured variable and its influence on the transmitter of plain messages, alongside the possibility to recover the dynamics at the reception.These are studied in the context of discrete and continuous-time chaotic systems.Statistical independence of the state variables of chaotic systems is investigated in relation with the spatial non-correlation of the states.A method of hiding the secret message, depending on the evolution of the chaotic transmitter and prior to its inclusion in this dynamics is proposed.The feasibility of a delayed time hybrid scheme that is used for secure data transmission is shown in an analog implementation.Simulations and analysis of the obtained results are done in order to prove the efficiency of the proposed studies and methods.The Thesis is organized as follows: Chapter I resumes theoretical notions and algorithms used to achieve the goal of this work.Chapter II is dedicated to the study of the Lyapunov exponents. The chaotic systems used in this report are described.Chapter III presents a study of some structural properties of the chaotic systems from Chapter II.The investigation is focused on the calculation of the observability indexes and the determination of the manifolds of observability singularity.Chapter IV analyses the statistical independence in the context of the considered chaotic systems:how large should be the sampling distance (how many iterations or, equivalently, time) to ensure statical independence between variables extracted from the chaotic systems.An original test for statistical independence (the Badea-Vlad test) was used; the procedure is applicable to all kind of continuous random variables, even of unknown probability law as needed here.Chapter V illustrates the physical point of view.The transient time corresponds to the time spent by the chaotic system in the basin of attraction before rejoining the strange attractor.It is also important to know after how long the points localized in a certain region of the strange attractor become uncorrelated.In Chapter VI, knowing the identifiability of the parameters of chaotic systems described by polynomial equations, an improvement of the inclusion of messages in this type of enciphering is proposed.The plain-message is enciphered using classical substitution and transposition boxes, prior to its inclusion in the chaotic transmitter.The results of the proposed algorithm are evaluated on text and image.Chapter VII rises some questions, and tries to find some answers to these questions, in the context of hybrid dynamical schemes.As for example if it is possible to recover the secret message by using an observer, when the dynamics that includes it is time-delayed.The answer is positive and this is shown in the case of a full transmission of the output of the system.It is important to mention that this work is multidisciplinary, starting from control theory and going to the statistical methods through the fields of electronics, mathematics and computing., Cette thèse traite du domaine de la cryptographie basée sur des dynamiques chaotiques hybrides.Afin de robustifier la transmission sécurisée de données à l'égard de l'attaque à texte-claire connue, ce travail a été particulièrement axée sur deux directions, l'approche statistique, et l'approche automatique.Les principales contributions de ce travail sont organisées dans ces deux directions.Le choix de la variable mesurée et son influence sur l'émetteur d'un message secret et la possibilité de récupérer la dynamique à la réception.Ceci a été étudié dans le contexte des systèmes chaotiques discrets et continus.L'indépendance statistique des variables d'état des systèmes chaotiques est étudié en relation avec la non-corrélation spatiale de ces états.Ainsi une méthode pour cacher le message secret en fonction de l'évolution de l'émetteur chaotique, et ceci avant son inclusion dans cette dynamique, est proposée.La faisabilité d'un système retardée hybride qui est utilisée pour la transmission sécurisée des données est analysée dans une mise en œuvre analogique.Des simulations et les analyses des résultats obtenus sont faits, afin de prouver l'efficacité des études et des méthodes proposées.La thèse est organisée comme suit: le Chapitre I reprend les notions théoriques et les algorithmes utilisés pour atteindre l'objectif de ce travail.Le chapitre II est consacré à l'étude des exposants de Lyapunov.Les systèmes chaotiques utilisés dans le présent document sont ensuite décrits.Le chapitre III présente une étude de certaines propriétés structurales des systèmes du chapitre II.L'étude se concentre sur le calcul des indices d'observabilité et la détermination des hypersurfaces de la singularité d'observabilité.Le chapitre IV analyse l'indépendance statistique dans le contexte des systèmes chaotiques considérés:la taille de la distance d'échantillonnage (combien d'itérations ou de manière équivalente, combien de temps) pour assurer l'indépendance statistique entre les variables extraites des systèmes chaotiques.Un test original pour l'indépendance statistique (le test Badea-Vlad) a été utilisée; la procédure est applicable à tous les types de variables aléatoires continues, même reparties selon une loi de probabilité inconnue au besoin ici.Le chapitre V illustre le point de vue physique. Le temps transitoire correspond au temps passé par le système chaotique dans le bassin d'attraction avant de rejoindre l'attracteur étrange.De même il est important de savoir après combien de temps les points localisés dans une certaine région de l'attracteur étrange devient non-corrélés.Dans le chapitre VI, sachant l'identifiabilité des paramètres des systèmes chaotiques décrits par des équations polynomiales, une amélioration des inclusions du message dans ce type de cryptographie, est proposé.Le message clair est chiffré en utilisant une substitution classique avec boîtes de transposition, avant son inclusion dans l'émetteur chaotique.Les résultats de l'algorithme proposé sont évalués sur le texte et sur l'image.Le chapitre VII pose quelques questions, et essaie de trouver quelques-unes des réponses à ces questions, dans le cadre du schéma hybride.Comme par exemple, est-il possible de récupérer le message secret en utilisant un observateur, lorsque la dynamique qui lui inclut est retardée?La réponse est positive, et cela est montrée dans le cas d'une transmission intégrale de la sortie du système.Il est important de mentionner que ce travail est pluridisciplinaire, allant de la théorie du contrôle aux statistiques en passant par les domaines de l'électronique, de la mathématique et de l'informatique.

In a scientific study of dream content, artificial intelligence has been utilized to automatically score dream content. An initial attempt focused on scoring for emotional tone of dream reports. The contribution of this thesis demonstrates methods by which accuracy of such a system can be improved beyond text-mining. It was hypothesized that data extraction based on psychological processes will provide significant information that would produce an accurate model. In our first article, the significance of words expressed in dream reports, along with their associated words was explored. Extraction and inclusion of these associations provided detailed information that improved automatic scoring of positive and negative affect even though these associations exhibited skewed distribution. The second article demonstrated how normalization of the data was possible and how it could result in a more accurate model. Our last article was able to demonstrate that the model can differentiate between male and female dreams.

International audience; In this paper, we aim at modeling and analyzing the behavior of a spatial population of agents through an exploration of their state space. Agents are localized on a dynamic graph and they have internal states. They interact with an environment. The evolution of the agents and of the environment is specified by a set of rules. The framework is carefully designed to enable the construction of a global state space that can be automatically build and analyzed. The formalism, called IRNs for integrated regulatory networks, may be seen as an extension of logical regulatory networks (à la Thomas) developed in systems biology with spatial information and generalized to use arbitrary data values and update functions of this values. This thus allows to model systems with multiple agents that may be located on a varying spatial structure, may store and update local information, may depend on varying global information and may communicate in their neighborhood. A model of such a system can be defined as an IRN, and then analyzed using model-checking to asses its properties. This paper sketches the modeling framework and its semantics. We show how IRN may be used for the modeling of a population of simple agents, the automatic analysis of various reachability properties and the use of symmetries to reduce the size of the state space.

In many domains where images are produced and acquired, the field of view of cameras can be subject to oscillations and movements, which can induce errors in the interpretation of the frame contents and can even jeopardize the analysis of the videos. The problem is particularly severe in applications such as nuclear fusion, in which, typically, no stable and reliable reference points exist within the camera fields of view to register the frames. A nonadditive form of entropy S(q), which is more sensitive to long-range correlations than the Shannon entropy, has been applied to the problem of automatically detecting such camera movements in the videos of a JET wide-angle infrared camera. A systematic analysis of the results, covering more than 110 000 frames, has been undertaken, and the results obtained, reaching a total success rate of almost 97%, are more than satisfactory.

Recently, the importance of system design in the field of mechanical engineering has been increasingly recognized. However suitable and useful methods for machine design are not yet established. An analytical method of the dynamic characteristics in the mechanical system, a method utilizing linear graph theory, is proposed. In this paper, for practical use of this analytical method, a program is developed which can analyze the dynamic characteristics automatically. As an example, in the mechanical vibration system, with the arrangement of the elements on the computer display, the system graph and the equations of motion are automatically produced by means of a cut-set matrix, and the dynamic characteristics of the system are derived by means of a computer algebraic method., rights: 社団法人日本機械学会rights: 本文データは学協会の許諾に基づきCiNiiから複製したものであるrelation: IsVersionOf: http://ci.nii.ac.jp/naid/110002381106/

Five healthy adult women, aged from 20 to 28, had 12-15 polysomnographic recordings taken. Sleep stages were scored according to the Rechtschaffen and Kales criteria. Cz-A1 EEG recordings were also analyzed with a spindle and delta wave real-time automatic analyzing system in a 16-bit microcomputer. Sleep stage analysis revealed no significant changes in the ordinary sleep parameters, i.e. percentage of each sleep stage, sleep latency or REM latency when the low and high body temperature phases were compared. On the other hand, the sleep spindle parameters derived from the Personal Spindle Delta-wave Analyzer changed markedly during the menstrual cycle. Spindle frequency was slower at about 14 days before the first menstruation day and increased after that and it was faster at just before the first menstruation day. The pattern of spindle density change was similar to that of frequency. Amplitude and duration did not tend to change during the menstrual cycle nor did the parameters of the slow wave. No prior reports have mentioned the relationship between the menstrual cycle and sleep spindle. From these results, it can be hypothesized that the frequency of the sleep spindle reflects sleep propensity and that it is a very important sleep parameter.

Recently, the importance of system design in the field of mechanical engineering has been increasingly recognized. But suitable and useful methods for machine design are not yet established. An analytical method for the dynamic characteristics in the mechanical system, a method using linear graph theory, is proposed. In this paper, for the purpose of the practical use of this analytical method, a program which can analyze the dynamic characteristic automatically is developed. As an example, in the motion transmitting mechanism arranging the elements on the display of the computer, the system graph and the tableau equation are automatically produced, and the dynamic characteristics of the system are derived., rights: 社団法人日本機械学会rights: 本文データは学協会の許諾に基づきCiNiiから複製したものであるrelation: IsVersionOf: http://ci.nii.ac.jp/naid/110002380305/

La recherche d'information (RI) est une démarche faite par un utilisateur pour obtenir de l'information pertinente qui répond à ses besoins moyennant un système de RI (SRI). Toutefois, les SRI montrent certains écarts entre la pertinence de l'utilisateur et la pertinence du système. Ces écarts sont liés essentiellement à l'imperfection de l'indexation (approche directement liée au processus de RI), aux problèmes de l'incompréhension du langage naturel et à la non correspondance entre le besoin réel de l'utilisateur et la réponse à sa requête. D'où l'idée de penser à une indexation qui prend en compte le point de vue de l'usager. Ce dernier en consultant le document peut construire des informations à valeur ajoutée sur le contenu existant : il s'agit de nouvelles informations qui enrichissent le contenu, qui permettent la visibilité sémantique ou qui facilitent la lecture par les annotations, par des liens vers d'autres contenus, par de nouveaux descripteurs, des résumés propres à l'usager : c'est la réindexation des contenus par l'apport ou le vote des usages Mots clés : Recherche d'information (RI), réindexation, vote de l'usager, filtrage de contenus, analyse automatique, catégorisation documentaire.; International audience; Information retrieval (IR) is a user approach to obtain relevant information which meets needs with the help of a IR system (IRS). However, the IRS shows certain differences between user relevance and system relevance. These gaps are essentially related to the imperfection of the indexing process (as approach related to the IR), to problems related to the misunderstanding of the natural language and the non correspondence between the real needs of the user and the results of his query. As idea is to think about an “intellectual” indexing that takes into account the point of view of the user. By consulting the document, user can build information as added-value on the existing content: new information which grows contents and allows the semantic visibility or facilitates the reading by the annotations, by links to other content, by new descriptors, specific new abstracts of users: it is the reindexing of the contents by the contribution or the vote of the uses

International audience; This paper presents a system architecture to bridge the gap between the users computing activity in collaborative platforms and the analysis of this activity which is carried out by researchers in human and social sciences. This research work tends to highlight the capacity of a computer-supported observation station, based on a theoretical model called TBS (Trace-Based System), to assist researchers automatically in their activity of analysis using a high abstraction level. We present the modules of a prototype of an observation station called CARTE (Collection, activity Analysis and Regulation based on Traces Enriched) which enable the interoperability between the collaborative platforms , where the users produce raw traces and the analysis environments, where the researchers study traces of a very high abstraction level.

Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing the limitations of this method, we define a new one, based on the handling of the knowledge of protocol participants. This second method is general and of natural use, as it consists in adding simple annotations in the protocol specification. It is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the Fair Zhou-Gollmann protocol and the optimistic Cederquist-Corin-Dashti protocol, discovering attacks in each. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself.

One of the most challenging aspects of computer-supported collaborative learning (CSCL) research is automation of collaboration and interaction analysis in order to understand and improve the learning processes. It is particularly necessary to look in more depth at the joint analysis of the collaborative process and its resulting product. In this article, we present a framework for comprehensive analysis in CSCL synchronous environments supporting a problem-solving approach to learning. This framework is based on an observation–abstraction–intervention analysis life-cycle and consists of a suite of analysis indicators, procedures for calculating indicators and a model of intervention based on indicators. Analysis indicators are used to represent the collaboration and knowledge building process at different levels of abstraction, and to characterize the solution built using models of the application domain, the problems to solve and their solutions. The analysis procedures combine analysis of actions and dialogue with analysis of the solution. In this way, the process and the solution are studied independently as well as together, enabling the detection of correlations between them. In order to exemplify and test the framework, the methodological process underlying the framework was followed to guide the implementation of the analysis subsystems of two existing CSCL environments. In addition, a number of studies have been conducted to evaluate the framework's approach, demonstrating that certain modes of collaborating and working imply particular types of solutions and vice versa. (http://www.sciencedirect.com/science?_ob=ArticleURL&_udi=B6WGR-4T7XGWR-1&_user=641661&_rdoc=1&_fmt=&_orig=search&_sort=d&view=c&_version=1&_urlVersion=0&_userid=641661&md5=e80c8a806e4dc3b427bad4a144138dfd)

In this paper, we study how existing natural language processing tools for Italian perform on ancient texts. The first goal is to understand to what extent such tools can be used "as they are" for the automatic analysis of old literary works. Indeed, while NLP tools for Italian achieve today good performance, it is not clear if they could be successfully used for the humanities, to support the critical study of historical works. Our analysis will show how tools' performance systematically vary across different time periods, and within literary movements. As a second goal, we want to verify whether or not simple customization methods can improve the tools performance over the old works.

Modem development environments integrate various static analyses into the build process. Analyses that analyze the whole project whenever the project changes are impractical in this context. We present an approach to automatic incrementalization of analyses that are specified as tabled logic programs and evaluated using incremental tabled evaluation, a technique for efficiently updating memo tables in response to changes in facts and rules. The approach has been implemented and integrated into the Eclipse IDE. Our measurements show that this technique is effective for automatically incrementalizing a broad range of static analyses.

Non-repudiation protocols have an important role in many areas where secured transactions with proofs of participation are necessary. Formal methods are clever and without error, therefore using them for verifying such protocols is crucial. In this purpose, we show how to partially represent non-repudiation as a combination of authentications on the Fair Zhou-Gollmann protocol. After discussing its limits, we define a new method based on the handling of the knowledge of protocol participants. This method is very general and is of natural use, as it consists in adding simple annotations, like for authentication problems. The method is very easy to implement in tools able to handle participants knowledge. We have implemented it in the AVISPA Tool and analyzed the optimistic Cederquist-Corin- Dashti protocol, discovering two unknown attacks. This extension of the AVISPA Tool for handling non-repudiation opens a highway to the specification of many other properties, without any more change in the tool itself.

On large and complex distributed systems hardware and software faults, as well as vulnerabilities, exhibit significant dependencies and interrelationships. Being able to assess their actual impact on the overall system dependability is especially important. The goal of this paper is to propose a unifying way of describing a complex hardware and software system, in order to assess the impact of both vulnerabilities and faults by means of the same underlying reasoning mechanism, built on a standard Prolog inference engine. Some preliminary experimental results show that a prototype tool based on these techniques is both feasible and able to achieve encouraging performance levels on several synthetic test cases.

Multitemporal analysis of Synthetic Aperture Radar (SAR) images has gained an ever increasing attention due to the availability of several satellite platforms with different revisit times and to the intrinsic capability of the SAR system of producing all-weather observations. As a drawback, automated analysis in general and change detection in particular are made difficult by the inherent noisiness of SAR imagery. Even if a preprocessing step aimed at speckle reduction is adopted, most of algorithms borrowed from computer vision cannot be profitably used. In this work, a novel pixel feature suitable for change analysis is derived from information-theoretic concepts. It does not require preliminary despeckling and capable of providing accurate change maps from a couple of SAR images. The rationale is that the negative of logarithm of the probability of an amplitude level in one image conditional to the level of the same pixel in the other image conveys an information on the amount of change occurred between the two passes. Experimental results carried out on two couples of multitemporal SAR images demonstrate that the proposed IT feature outperforms the Log-Ratio in terms of capability of discriminating flooded areas and outlining their borders.

It is well known that the design and development of complex distributed systems, such as those used in modern factory automation and process control environments, can obtain significant benefits from the adoption of formal methods during the specification and verification phases. The importance of using formal techniques for verifying the design correctness is even more evident when aspects such as security and safety are considered and a class of protocols, known as "cryptographic" protocols, is taken into account. Cryptographic protocols, in fact, are becoming more and more used in industrial networks to support security-related services such as cryptographic keys exchange/distribution and authentication, due to the ever increasing use of internet/intranet-based connections and the introduction of wireless communications. This paper reports on some experimental investigations on the formal verification of two cryptographic protocols, that are commonly used in industrial wireless 802.11 networks. Investigations are carried out by means of fully automatic and publicly available tools that are based on state-exploration techniques. The aim of our work is twofold: first we intend to offer a contribution in understanding whether or not the current prototype tools can be considered mature enough for helping the designer with the analysis of real protocols, and second we wish to develop some (preliminary) considerations on their characteristics and performance.

S-VPN gateways are today core elements in network security infrastructure. As networks and services become more complex, managing IPSec access rules becomes an error-prone task. Conflicts in a poiicy can cause holes in security, and often they can be hard to find when performing only visual or manual inspection. We have defined firstly a methodology to systematically classify the severity of rule conflicts and secondly we have proposed two different solutions to automatically resolve conflicts in an access list, implementing and testing one of them.

International audience; Formant values of oral vowels are automatically measured ina total of 50000 segments from four hours of journalisticbroadcast speech in French and German. After automaticsegmentation using the LIMSI speech alignment system,formant values are automatically extracted using PRAAT.Vowels with unlikely formant values are discarded (4%). Themeasured values are exposed with respect to segment durationand language identity. The gap between the measured meanFi values and reference Fi values is inversely proportional tovowel duration: a tendency to reduction for vowels of shortduration clearly emerges for both languages. These results arebriefly discussed in terms of centralisation and coarticulation.

International audience; Formant values of oral vowels are automatically measured in a total of 50000 segments from four hours of spontaneous broadcast speech in French and German. After the automatic segmentation using the LIMSI automatic speech alignment system., formant values are extracted for the oral vowel segments using the PRAAT software. Vowels with unlikely formant values are discarded (4%). The measured values are discussed with respect to three parameters: speaker sex, segment duration and language. For 60% of the vowels the measured formant values are within a 200Hz range of established reference formant values. The gap between the measured mean Fi values and the reference values is inversely proportional to vowel duration. A tendency of vowel centralization clearly emerges for both languages.

Testing equivalence is a powerful means for expressing the security properties of cryptographic protocols, but its formal verification is a difficult task because of the quantification over contexts on which it is based. Previous articles have provided insights into using theorem-proving for the verification of testing equivalence of spi calculus specifications. This article addresses the same verification problem, but uses a state exploration approach. The verification technique is based on the definition of an environment-sensitive, labeled transition system representing a spi calculus specification. Trace equivalence defined on such a transition system coincides with testing equivalence. Symbolic techniques are used to keep the set of traces finite. If a difference in the traces of two spi descriptions (typically a specification and the corresponding implementation of a protocol) is found, it can be used to automatically build the spi calculus description of an intruder process that can exploit the difference.

Reflexión sintética para revisar las propuestas más relevantes que, siguiendo la teoría matemática de la comunicación de Shannon y Weaver, hayan afectado a los procedimientos del análisis automático del contenido documental. Partiendo del empleo de la teoría matemática en Ciencia de la Información se explican sus aplicaciones metodológicas en nuestra especialidad, en especial respecto a las técnicas de recuperación de la información. Para después describir los modelos matemáticos aplicados al análisis automático del contenido: leyes de Zipf y Goffman, antidiccionarios para índices permutados, Indización Estadística de Términos por Frecuencias, algoritmos n-grams y de stemming, así como los referidos a los métodos de agrupación y clasificación como clusters por valor de discriminación y por relevancia de los términos como son los métodos de agrupación basados en Grafos Teóricos, los basados en Centros de masas, el algoritmo K-vecinos o Kmedias, el K-vecinos axial o incremental, y el algoritmo ISODATA. Para luego exponer los clasificadores cienciométricos como el método de Chen y finalmente los métodos con sistemas de aprendizaje. ABSTRACT: This paper analyzes the most important proposals following the Shannon and Weaver's Mathematic Theory of Communication that have influenced in proceedings of automatic content analysis. It's explained the methodological applications of this theory in our discipline, especially about information retrieval. After this, describes the mathematical models applied to automatic content analysis: Laws of Zipf and Goffman, anti-dictionaries to permuted indexes, Statistical Indexation of terms by frequencies, n-grams and stemming algorisms. Also studies the methods of relation and classification like clusters by value of discrimination and by relevance of terms: for example, methods of relations based in Graph Theory, mass core, the K-means or incremental K-means, and the ISODATA algorism. Finally, explains the scientometrics indicators as Chen's coowording and methods with learning systems.

Capturing the variations characterizing the set of products belonging to a product line is a key issue for the requirements engineering of this development philosophy. This paper describes ways to extend the well-known Use Case formalism in order to make possible the representation of these variations, in the perspective to make them suitable for an automatic analysis.