Tool wear monitoring using neuro-fuzzy techniques: a comparative study in a turning process

Tool wear detection is a key issue for tool condition monitoring. The maximization of useful tool life is frequently related with the optimization of machining processes. This paper presents two model-based approaches for tool wear monitoring on the basis of neuro-fuzzy techniques. The use of a neuro-fuzzy hybridization to design a tool wear monitoring system is aiming at exploiting the synergy of neural networks and fuzzy logic, by combining human reasoning with learning and connectionist structure. The turning process that is a well-known machining process is selected for this case study. A four-input (i.e., time, cutting forces, vibrations and acoustic emissions signals) single-output (tool wear rate) model is designed and implemented on the basis of three neuro-fuzzy approaches (inductive, transductive and evolving neuro-fuzzy systems). The tool wear model is then used for monitoring the turning process. The comparative study demonstrates that the transductive neuro-fuzzy model provides better error-based performance indices for detecting tool wear than the inductive neuro-fuzzy model and than the evolving neuro-fuzzy model.

Approximate Relational Reasoning for Probabilistic Programs

La seguridad verificada es una metodología para demostrar propiedades de seguridad de los sistemas informáticos que se destaca por las altas garantías de corrección que provee. Los sistemas informáticos se modelan como programas probabilísticos y para probar que verifican una determinada propiedad de seguridad se utilizan técnicas rigurosas basadas en modelos matemáticos de los programas. En particular, la seguridad verificada promueve el uso de demostradores de teoremas interactivos o automáticos para construir demostraciones completamente formales cuya corrección es certificada mecánicamente (por ordenador). La seguridad verificada demostró ser una técnica muy efectiva para razonar sobre diversas nociones de seguridad en el área de criptografía. Sin embargo, no ha podido cubrir un importante conjunto de nociones de seguridad “aproximada”. La característica distintiva de estas nociones de seguridad es que se expresan como una condición de “similitud” entre las distribuciones de salida de dos programas probabilísticos y esta similitud se cuantifica usando alguna noción de distancia entre distribuciones de probabilidad. Este conjunto incluye destacadas nociones de seguridad de diversas áreas como la minería de datos privados, el análisis de flujo de información y la criptografía. Ejemplos representativos de estas nociones de seguridad son la indiferenciabilidad, que permite reemplazar un componente idealizado de un sistema por una implementación concreta (sin alterar significativamente sus propiedades de seguridad), o la privacidad diferencial, una noción de privacidad que ha recibido mucha atención en los últimos años y tiene como objetivo evitar la publicación datos confidenciales en la minería de datos. La falta de técnicas rigurosas que permitan verificar formalmente este tipo de propiedades constituye un notable problema abierto que tiene que ser abordado. En esta tesis introducimos varias lógicas de programa quantitativas para razonar sobre esta clase de propiedades de seguridad. Nuestra principal contribución teórica es una versión quantitativa de una lógica de Hoare relacional para programas probabilísticos. Las pruebas de correción de estas lógicas son completamente formalizadas en el asistente de pruebas Coq. Desarrollamos, además, una herramienta para razonar sobre propiedades de programas a través de estas lógicas extendiendo CertiCrypt, un framework para verificar pruebas de criptografía en Coq. Confirmamos la efectividad y aplicabilidad de nuestra metodología construyendo pruebas certificadas por ordendor de varios sistemas cuyo análisis estaba fuera del alcance de la seguridad verificada. Esto incluye, entre otros, una meta-construcción para diseñar funciones de hash “seguras” sobre curvas elípticas y algoritmos diferencialmente privados para varios problemas de optimización combinatoria de la literatura reciente. ABSTRACT The verified security methodology is an emerging approach to build high assurance proofs about security properties of computer systems. Computer systems are modeled as probabilistic programs and one relies on rigorous program semantics techniques to prove that they comply with a given security goal. In particular, it advocates the use of interactive theorem provers or automated provers to build fully formal machine-checked versions of these security proofs. The verified security methodology has proved successful in modeling and reasoning about several standard security notions in the area of cryptography. However, it has fallen short of covering an important class of approximate, quantitative security notions. The distinguishing characteristic of this class of security notions is that they are stated as a “similarity” condition between the output distributions of two probabilistic programs, and this similarity is quantified using some notion of distance between probability distributions. This class comprises prominent security notions from multiple areas such as private data analysis, information flow analysis and cryptography. These include, for instance, indifferentiability, which enables securely replacing an idealized component of system with a concrete implementation, and differential privacy, a notion of privacy-preserving data mining that has received a great deal of attention in the last few years. The lack of rigorous techniques for verifying these properties is thus an important problem that needs to be addressed. In this dissertation we introduce several quantitative program logics to reason about this class of security notions. Our main theoretical contribution is, in particular, a quantitative variant of a full-fledged relational Hoare logic for probabilistic programs. The soundness of these logics is fully formalized in the Coq proof-assistant and tool support is also available through an extension of CertiCrypt, a framework to verify cryptographic proofs in Coq. We validate the applicability of our approach by building fully machine-checked proofs for several systems that were out of the reach of the verified security methodology. These comprise, among others, a construction to build “safe” hash functions into elliptic curves and differentially private algorithms for several combinatorial optimization problems from the recent literature.

A formalism and method for representing and reasoning with process models authored by subject matter experts

Enabling Subject Matter Experts (SMEs) to formulate knowledge without the intervention of Knowledge Engineers (KEs) requires providing SMEs with methods and tools that abstract the underlying knowledge representation and allow them to focus on modeling activities. Bridging the gap between SME-authored models and their representation is challenging, especially in the case of complex knowledge types like processes, where aspects like frame management, data, and control flow need to be addressed. In this paper, we describe how SME-authored process models can be provided with an operational semantics and grounded in a knowledge representation language like F-logic in order to support process-related reasoning. The main results of this work include a formalism for process representation and a mechanism for automatically translating process diagrams into executable code following such formalism. From all the process models authored by SMEs during evaluation 82% were well-formed, all of which executed correctly. Additionally, the two optimizations applied to the code generation mechanism produced a performance improvement at reasoning time of 25% and 30% with respect to the base case, respectively.

Probabilistic reasoning with an enzyme-driven DNA device

We present a biomolecular probabilistic model driven by the action of a DNA toolbox made of a set of DNA templates and enzymes that is able to perform Bayesian inference. The model will take single-stranded DNA as input data, representing the presence or absence of a specific molecular signal (the evidence). The program logic uses different DNA templates and their relative concentration ratios to encode the prior probability of a disease and the conditional probability of a signal given the disease. When the input and program molecules interact, an enzyme-driven cascade of reactions (DNA polymerase extension, nicking and degradation) is triggered, producing a different pair of single-stranded DNA species. Once the system reaches equilibrium, the ratio between the output species will represent the application of Bayes? law: the conditional probability of the disease given the signal. In other words, a qualitative diagnosis plus a quantitative degree of belief in that diagno- sis. Thanks to the inherent amplification capability of this DNA toolbox, the resulting system will be able to to scale up (with longer cascades and thus more input signals) a Bayesian biosensor that we designed previously.

Automated end user-centred adaptation of web components through automated description logic-based reasoning

Context: This paper addresses one of the major end-user development (EUD) challenges, namely, how to pack today?s EUD support tools with composable elements. This would give end users better access to more components which they can use to build a solution tailored to their own needs. The success of later end-user software engineering (EUSE) activities largely depends on how many components each tool has and how adaptable components are to multiple problem domains. Objective: A system for automatically adapting heterogeneous components to a common development environment would offer a sizeable saving of time and resources within the EUD support tool construction process. This paper presents an automated adaptation system for transforming EUD components to a standard format. Method: This system is based on the use of description logic. Based on a generic UML2 data model, this description logic is able to check whether an end-user component can be transformed to this modeling language through subsumption or as an instance of the UML2 model. Besides it automatically finds a consistent, non-ambiguous and finite set of XSLT mappings to automatically prepare data in order to leverage the component as part of a tool that conforms to the target UML2 component model. Results: The proposed system has been successfully applied to components from four prominent EUD tools. These components were automatically converted to a standard format. In order to validate the proposed system, rich internet applications (RIA) used as an operational support system for operators at a large services company were developed using automatically adapted standard format components. These RIAs would be impossible to develop using each EUD tool separately. Conclusion: The positive results of applying our system for automatically adapting components from current tool catalogues are indicative of the system?s effectiveness. Use of this system could foster the growth of web EUD component catalogues, leveraging a vast ecosystem of user-centred SaaS to further current EUSE trends.

Aproximaciones y Procedimientos Creativos en los Procesos de Aprendizaje-Des_aprendizaje Proyectual

Se aborda como objetivo una reflexión operativa sobre los actos creativos en el proyecto de arquitectura investigando los procedimientos que intervienen recurrentemente en los procesos del aprendizaje y proyectación. Aprendizaje entendido como actitud ininterrumpida en el discurso del creador, estado inacabado, en constante evolución, continuo, no suscrito al momento particular, como situación connatural al hecho creativo. El marco epistemológico de la Creatividad y sus técnicas asociadas en constante aplicación en otras disciplinas se desvela como un sustrato gnoseológico referencial para el entendimiento de los procesos de génesis y producción del proyecto y su aprendizaje. Se inscribe la investigación de la tesis en una doble línea de pensamiento lógico-racional y lógico-intuitivo, mediante inferencias de naturaleza deductiva, inductiva y abductiva. Se busca suscitar un interés por la creatividad que contribuya a extender el campo de investigación sobre cómo se genera y se produce la arquitectura y su aplicación al aprendizaje. Proponemos la elaboración de una cartografía taxonómica de procedimientos creativos en el proyectar, de tal manera que nos conduzca hacia la enunciación de una Metaheurística de la Creatividad. Metaheurística que contenga el mapa operativo de Procedimientos y de sus Metaprincipios de aplicación a distintos entornos y problemas, con capacidad de respuesta adaptativa en todos los estados divergentes del proceso. Cartografía, en definitiva, de relaciones más que de sistematizaciones. Este mapa creativo estará formado por 9 Procedimientos resultado de 9 aproximaciones que constituyen 9 Lógicas de acción y razonamiento, en unas condiciones de campo hologramáticas. Enfocadas hacia una nueva actitud creativa, desprejuiciada, atenta a los flujos transdisciplinares, regida indistintamente por el azar y el rigor, expansiva y condensadora, múltiple y poliédrica, abierta e inconclusa, lúdica y frívola, automática e impredecible. Actitud creativa que actúa con lógicas procedimentales relacionales, siempre en constante redefinición, alejadas de toda teorización, sin constituir un meta-relato, más como gestión de información que como dispositivo disciplinar: abductiva, analógica, sinéctica, metafórica, difusa, azarosa, suspendida, divergente y des_aprendida. ABSTRACT Abstract: An operative reflection is approached as aim on the creative acts in the project of architecture, investigating the procedures involved recursively in the processes of learning and project. Learning understood as uninterrupted attitude in the speech of the creator, in unfinished condition, in constant evolution, continuous, not signed to the particular moment, as inherent to the creative fact. The epistemological framework of the Creativity and its techniques associated in constant application in other disciplines is revealed as a referential gnoseologic substratum for the understanding of the processes of genesis and production of the project and his learning. The investigation of the thesis registers in a double line of logical - rational and logical - intuitive thought, by means of inferences of deductive, inductive and abductive nature. One seeks to arouse an interest in the creativity that will help to extend the field of investigation on how it is generated and produces the architecture and its application to the learning. We propose the elaboration of a taxonomic mapping creative procedures in the project, in such a way to lead us towards the enunciation of a Metaheuristic of creativity. Metaheuristic that contains containing the operative map of Procedures and their Metaprinciples of application to different environments and problems, with capacity of adaptive response in all the divergent conditions of the process. Cartography, definitively, of relationships rather than of systematizings. The map of procedures will be formed by 9 procedures as result of 9 approaches that constitute 9 logics of action and reasoning, in hologramatics conditions of field. Focused on a new creative attitude, ideologically unbiased, attentive to transdisciplinary flows, governed either by random and rigor, expansive and condenser, multiple and multifaceted, open and unfinished, playful and frivolous, automatic and unpredictable. Creative attitude that acts with procedural relational logics, always in constant redefinition, away from all theorizing, without being a meta-relate, more like information that discipline as device management: abductive, analogical, synectical, metaphorical, diffuse, randomness, suspended, divergent and mis_learnt.

Normative Practical Reasoning via Argumentation and Dialogue

Postprint

Case-based reasoning to support decision making for managing drinking water quality events in distribution systems

Peer reviewed

Accumulation of a Clock-Regulated Transcript during Flower-Inductive Darkness in Pharbitis nil1

To clarify the molecular basis of the photoperiodic induction of flowering in the short-day plant Pharbitis nil cv Violet, we examined changes in the level of mRNA in cotyledons during the flower-inductive photoperiod using the technique of differential display by the polymerase chain reaction. A transcript that accumulated during the inductive dark period was identified and a cDNA corresponding to the transcript, designated PnC401 (P. nil C401), was isolated. RNA-blot hybridization verified that levels of PnC401 mRNA fluctuated with a circadian rhythm, with maxima between 12 and 16 h after the beginning of the dark period) and minima of approximately 0. This oscillation continued even during an extended dark period but was damped under continuous light. Accumulation of PnC401 mRNA was reduced by a brief exposure to red light at the 8th h of the dark period (night-break treatment) or by exposure to far-red light at the end of the light period (end-of-day far-red treatment). These results suggest that fluctuations in levels of PnC401 mRNA are regulated by phytochrome(s) and a circadian clock and that they are associated with photoperiodic events that include induction of flowering.

Structure-activity relationships derived by machine learning: the use of atoms and their bond connectivities to predict mutagenicity by inductive logic programming.

We present a general approach to forming structure-activity relationships (SARs). This approach is based on representing chemical structure by atoms and their bond connectivities in combination with the inductive logic programming (ILP) algorithm PROGOL. Existing SAR methods describe chemical structure by using attributes which are general properties of an object. It is not possible to map chemical structure directly to attribute-based descriptions, as such descriptions have no internal organization. A more natural and general way to describe chemical structure is to use a relational description, where the internal construction of the description maps that of the object described. Our atom and bond connectivities representation is a relational description. ILP algorithms can form SARs with relational descriptions. We have tested the relational approach by investigating the SARs of 230 aromatic and heteroaromatic nitro compounds. These compounds had been split previously into two subsets, 188 compounds that were amenable to regression and 42 that were not. For the 188 compounds, a SAR was found that was as accurate as the best statistical or neural network-generated SARs. The PROGOL SAR has the advantages that it did not need the use of any indicator variables handcrafted by an expert, and the generated rules were easily comprehensible. For the 42 compounds, PROGOL formed a SAR that was significantly (P < 0.025) more accurate than linear regression, quadratic regression, and back-propagation. This SAR is based on an automatically generated structural alert for mutagenicity.

Use of an oocyte expression assay to reconstitute inductive signaling.

We have developed a paracrine signaling assay capable of mimicking inductive events in the early vertebrate embryo. RNA encoding one or more secreted proteins is microinjected into a Xenopus laevis oocyte. After a brief incubation to allow translation, a piece of embryonic tissue competent to respond to the signaling protein is grafted onto the oocyte. The secreted protein's effect on the grafted explant is then scored by assaying expression of tissue-specific markers. Explants of ectodermal tissue from blastula or gastrula stage embryos were grafted onto oocytes that had been injected with RNA encoding activin or noggin. We found that the paracrine assay faithfully reconstitutes mesoderm induction by activin and neural induction by noggin. Blastula-stage explants grafted onto activin-expressing oocytes expressed the mesodermal marker genes brachyury, goosecoid, and muscle actin. Gastrula-stage explants grafted onto noggin-expressing oocytes expressed neural cell adhesion molecule (NCAM) and formed cement gland. By injecting pools of RNA synthesized from a cDNA expression library into the oocyte, we also used the assay to screen for secreted neural-inducing proteins. We assayed 20,000 independent transformants of a library constructed from LiCl-dorsalized Xenopus laevis embryos, and we identified two cDNAs that induced neural tissue in ectodermal explants from gastrula-stage embryos. Both cDNAs encode noggin. These results suggest that the paracrine assay will be useful for the cloning of novel signaling proteins as well as for the analysis of known factors.

Basic fibroblast growth factor can mediate the early inductive events in renal development.

The earliest characterized events during induction of tubulogenesis in renal anlage include the condensation or compaction of metanephrogenic mesenchyme with the concurrent upregulation of WT1, the gene encoding the Wilms tumor transcriptional activator/suppressor. We report that basic fibroblast growth factor (FGF2) can mimic the early effects of an inductor tissue by promoting the condensation of mesenchyme and inhibiting the tissue degeneration associated with the absence of an inductor tissue. By in situ hybridization, FGF2 was also found to mediate the transcriptional activation of WT1 and of the hepatocyte growth factor receptor gene, c-met. Although FGF2 can induce these early events of renal tubulogenesis, it cannot promote the epithelial conversion associated with tubule formation in metanephrogenic mesenchyme. For this, an undefined factor(s) from pituitary extract in combination with FGF2 can cause tubule formation in uninduced mesenchyme. These findings support the concept that induction in kidney is a multiphasic process that is mediated by more than a single comprehensive inductive factor and that soluble molecules can mimic these inductive activities in isolated uninduced metanephrogenic mesenchyme.

Development of prospective mathematics teachers’ professional noticing in a specific domain: proportional reasoning

The aim of this research is to identify aspects that support the development of prospective mathematics teachers’ professional noticing in a b-learning context. The study presented here investigates the extent to which prospective secondary mathematics teachers attend and interpret secondary school students’ proportional reasoning and decide how to respond. Results show that interactions in an on-line discussion improve prospective mathematics teachers’ ability to identify and interpret important aspects of secondary school students’ mathematical thinking.

[Forensic disputation on reasoning], undated

Folio-sized leaf containing a handwritten disputation on reasoning. The disputation begins with the question: "Whether the Faculty of reasoning is improved by a Knowledge of Syllogym?"