Formal modeling and analysis techniques for high level Petri nets

Petri Nets are a formal, graphical and executable modeling technique for the specification and analysis of concurrent and distributed systems and have been widely applied in computer science and many other engineering disciplines. Low level Petri nets are simple and useful for modeling control flows but not powerful enough to define data and system functionality. High level Petri nets (HLPNs) have been developed to support data and functionality definitions, such as using complex structured data as tokens and algebraic expressions as transition formulas. Compared to low level Petri nets, HLPNs result in compact system models that are easier to be understood. Therefore, HLPNs are more useful in modeling complex systems. ^ There are two issues in using HLPNs—modeling and analysis. Modeling concerns the abstracting and representing the systems under consideration using HLPNs, and analysis deals with effective ways study the behaviors and properties of the resulting HLPN models. In this dissertation, several modeling and analysis techniques for HLPNs are studied, which are integrated into a framework that is supported by a tool. ^ For modeling, this framework integrates two formal languages: a type of HLPNs called Predicate Transition Net (PrT Net) is used to model a system's behavior and a first-order linear time temporal logic (FOLTL) to specify the system's properties. The main contribution of this dissertation with regard to modeling is to develop a software tool to support the formal modeling capabilities in this framework. ^ For analysis, this framework combines three complementary techniques, simulation, explicit state model checking and bounded model checking (BMC). Simulation is a straightforward and speedy method, but only covers some execution paths in a HLPN model. Explicit state model checking covers all the execution paths but suffers from the state explosion problem. BMC is a tradeoff as it provides a certain level of coverage while more efficient than explicit state model checking. The main contribution of this dissertation with regard to analysis is adapting BMC to analyze HLPN models and integrating the three complementary analysis techniques in a software tool to support the formal analysis capabilities in this framework. ^ The SAMTools developed for this framework in this dissertation integrates three tools: PIPE+ for HLPNs behavioral modeling and simulation, SAMAT for hierarchical structural modeling and property specification, and PIPE+Verifier for behavioral verification.^

Physical dynamic simulation of shipboard power system components in a distributed computational environment

Shipboard power systems have different characteristics than the utility power systems. In the Shipboard power system it is crucial that the systems and equipment work at their peak performance levels. One of the most demanding aspects for simulations of the Shipboard Power Systems is to connect the device under test to a real-time simulated dynamic equivalent and in an environment with actual hardware in the Loop (HIL). The real time simulations can be achieved by using multi-distributed modeling concept, in which the global system model is distributed over several processors through a communication link. The advantage of this approach is that it permits the gradual change from pure simulation to actual application. In order to perform system studies in such an environment physical phase variable models of different components of the shipboard power system were developed using operational parameters obtained from finite element (FE) analysis. These models were developed for two types of studies low and high frequency studies. Low frequency studies are used to examine the shipboard power systems behavior under load switching, and faults. High-frequency studies were used to predict abnormal conditions due to overvoltage, and components harmonic behavior. Different experiments were conducted to validate the developed models. The Simulation and experiment results show excellent agreement. The shipboard power systems components behavior under internal faults was investigated using FE analysis. This developed technique is very curial in the Shipboard power systems faults detection due to the lack of comprehensive fault test databases. A wavelet based methodology for feature extraction of the shipboard power systems current signals was developed for harmonic and fault diagnosis studies. This modeling methodology can be utilized to evaluate and predicate the NPS components future behavior in the design stage which will reduce the development cycles, cut overall cost, prevent failures, and test each subsystem exhaustively before integrating it into the system.

Proteção diferencial de transformadores de potência utilizando a transformada Wavelet

About 10% of faults involving the electrical system occurs in power transformers. Therefore, the protection applied to the power transformers is essential to ensure the continuous operation of this device and the efficiency of the electrical system. Among the protection functions applied to power transformers, the differential protection appears as one of the main schemes, presenting reliable discrimination between internal faults and external faults or inrush currents. However, when using the low frequency components of the differential currents flowing through the transformer, the main difficulty of the conventional methods of differential protection is the delay for detection of the events. However, internal faults, external faults and other disturbances related to the transformer operation present transient and can be appropriately detected by the wavelet transform. In this paper is proposed the development of a wavelet-based differential protection for detection and identification of external faults to the transformer, internal faults, and transformer energizing by using the wavelet coefficient energy of the differential currents. The obtained results reveal the advantages of using of the wavelet transform in the differential protection compared to conventional protection, since it provides reliability and speed in detection of these events.

Síntese e caracterizações estrutural e magnética das ferritas de cobalto-manganês (Co1-xMnxFe2O4 E Co1,2Fe1,8-xMnxO4)

The cobalt-manganese ferrites (Co1¡xMnxFe2O4 and Co1,2Fe1,8¡xMnxO4) has a mixed structure of spinel type and it has been regarded as one of candidates for petitive wide variety of applications in devices from ultrasonic generation and detection, sensors, transformers, as well as in medical industry. Ferrites cobalt-manganese nanostructured were produced via mechanical alloying with subsequent heat treatment and were characterized by X-ray diffraction, X-ray fluorescence, scanning electron microscopy and magnetization. Samples of Co1¡xMnxFe2O4 and Co1,2Fe1,8¡xMnxO4 were obtained from the precursor powders Fe3O4, Co3O4 and Mn3O4 which were stoichiometrically mixed and ground by 10h and heat treated at 900°C for 2h. The diffraction confirmed the formation of the pure nanocrystalline phases to series Co1,2Fe1,8¡xMnxO4 with an average diameter of about 94nm. It was found that the lattice parameter increases with the substitution of Fe3Å by Mn3Å. The x-ray fluorescence revealed that the portions of metals in samples were close to the nominal stoichiometric compositions. The microstructural features observed in micrographs showed that the particles formed show very different morphology and particle size. The magnetic hysteresis measurements performed at low temperature showed that the saturation magnetization and remanence increased as the concentration of manganese, while the coercive field decreased. The anisotropy constant (Ke f ), was estimated from the data adjustments the law of approaching saturation. It was found that the anisotropy decreases substantially with the substitution of Fe by Mn.

Investigating relative clauses in children with specific language impairment

Background: It is well documented that children with Specific Language Impairment (SLI) experience significant grammatical deficits. While much of the focus in the past has been on their morphosyntactic difficulties, less is known about their acquisition of complex syntactic structures such as relative clauses. The role of memory in language performance has also become increasingly prominent in the literature. Aims: This study aims to investigate the control of an important complex syntactic structure, the relative clause, by school age children with SLI in Ireland, using a newly devised sentence recall task. It also aims to explore the role of verbal and short-termworking memory in the performance of children with SLI on the sentence recall task, using a standardized battery of tests based on Baddeley’s model of working memory. Methods and Procedures: Thirty two children with SLI, thirty two age matched typically developing children (AM-TD) between the ages of 6 and 7,11 years and twenty younger typically developing (YTD) children between 4,7 and 5 years, completed the task. The sentence recall (SR) task included 52 complex sentences and 17 fillers. It included relative clauses that are used in natural discourse and that reflect a developmental hierarchy. The relative clauses were also controlled for length and varied in syntactic complexity, representing the full range of syntactic roles. There were seven different relative clause types attached to either the predicate nominal of a copular clause (Pn), or to the direct object of a transitive clause (Do). Responses were recorded, transcribed and entered into a database for analysis. TheWorkingMemory Test Battery for children (WMTB-C—Pickering & Gathercole, 2001) was administered in order to explore the role of short-term memory and working memory on the children’s performance on the SR task. Outcomes and Results: The children with SLI showed significantly greater difficulty than the AM-TD group and the YTD group. With the exception of the genitive subject clauses, the children with SLI scored significantly higher on all sentences containing a Pn main clause than those containing a transitive main clause. Analysis of error types revealed the frequent production of a different type of relative clause than that presented in the task—with a strong word order preference in the NVN direction indicated for the children with SLI. The SR performance for the children with SLI was most highly correlated with expressive language skills and digit recall. Conclusions and Implications: Children with SLI have significantly greater difficulty with relative clauses than YTD children who are on average two years younger—relative clauses are a delay within a delay. Unlike the YTD children they show a tendency to simplify relative clauses in the noun verb noun (NVN) direction. They show a developmental hierarchy in their production of relative clause constructions and are highly influenced by the frequency distribution of the relative clauses in the ambient language.

Formal Modeling and Analysis Techniques for High Level Petri Nets

Petri Nets are a formal, graphical and executable modeling technique for the specification and analysis of concurrent and distributed systems and have been widely applied in computer science and many other engineering disciplines. Low level Petri nets are simple and useful for modeling control flows but not powerful enough to define data and system functionality. High level Petri nets (HLPNs) have been developed to support data and functionality definitions, such as using complex structured data as tokens and algebraic expressions as transition formulas. Compared to low level Petri nets, HLPNs result in compact system models that are easier to be understood. Therefore, HLPNs are more useful in modeling complex systems. There are two issues in using HLPNs - modeling and analysis. Modeling concerns the abstracting and representing the systems under consideration using HLPNs, and analysis deals with effective ways study the behaviors and properties of the resulting HLPN models. In this dissertation, several modeling and analysis techniques for HLPNs are studied, which are integrated into a framework that is supported by a tool. For modeling, this framework integrates two formal languages: a type of HLPNs called Predicate Transition Net (PrT Net) is used to model a system's behavior and a first-order linear time temporal logic (FOLTL) to specify the system's properties. The main contribution of this dissertation with regard to modeling is to develop a software tool to support the formal modeling capabilities in this framework. For analysis, this framework combines three complementary techniques, simulation, explicit state model checking and bounded model checking (BMC). Simulation is a straightforward and speedy method, but only covers some execution paths in a HLPN model. Explicit state model checking covers all the execution paths but suffers from the state explosion problem. BMC is a tradeoff as it provides a certain level of coverage while more efficient than explicit state model checking. The main contribution of this dissertation with regard to analysis is adapting BMC to analyze HLPN models and integrating the three complementary analysis techniques in a software tool to support the formal analysis capabilities in this framework. The SAMTools developed for this framework in this dissertation integrates three tools: PIPE+ for HLPNs behavioral modeling and simulation, SAMAT for hierarchical structural modeling and property specification, and PIPE+Verifier for behavioral verification.

Field investigation of contactless displacement measurement using computer vision systems for civil engineering applications

Much of the bridge stock on major transport links in North America and Europe was constructed in the 1950s and 1960s and has since deteriorated or is carrying loads far in excess of the original design loads. Structural Health Monitoring Systems (SHM) can provide valuable information on the bridge capacity but the application of such systems is currently limited by access and bridge type. This paper investigates the use of computer vision systems for SHM. A series of field tests have been carried out to test the accuracy of displacement measurements using contactless methods. A video image of each test was processed using a modified version of the optical flow tracking method to track displacement. These results have been validated with an established measurement method using linear variable differential transformers (LVDTs). The results obtained from the algorithm provided an accurate comparison with the validation measurements. The calculated displacements agree within 2% of the verified LVDT measurements, a number of post processing methods were then applied to attempt to reduce this error.

Laboratory investigation of contactless displacement measurement using computer vision systems

Much of the bridge stock on major transport links in North America and Europe was constructed in the 1950’s and 1960’s and has since deteriorated or is carrying loads far in excess of the original design loads. Structural Health Monitoring Systems (SHM) can provide valuable information on the bridge capacity but the application of such systems is currently limited by access and system cost. This paper investigates the development of a low cost portable SHM system using commercially available cameras and computer vision techniques. A series of laboratory tests have been carried out to test the accuracy of displacement measurements using contactless methods. The results from each of the tests have been validated with established measurement methods, such as linear variable differential transformers (LVDTs). A video image of each test was processed using two different digital image correlation programs. The results obtained from the digital image correlation methods provided an accurate comparison with the validation measurements. The calculated displacements agree within 4% of the verified measurements LVDT measurements in most cases confirming the suitability full camera based SHM systems

Top-K Query Processing in Edge-Labeled Graph Data

Edge-labeled graphs have proliferated rapidly over the last decade due to the increased popularity of social networks and the Semantic Web. In social networks, relationships between people are represented by edges and each edge is labeled with a semantic annotation. Hence, a huge single graph can express many different relationships between entities. The Semantic Web represents each single fragment of knowledge as a triple (subject, predicate, object), which is conceptually identical to an edge from subject to object labeled with predicates. A set of triples constitutes an edge-labeled graph on which knowledge inference is performed. Subgraph matching has been extensively used as a query language for patterns in the context of edge-labeled graphs. For example, in social networks, users can specify a subgraph matching query to find all people that have certain neighborhood relationships. Heavily used fragments of the SPARQL query language for the Semantic Web and graph queries of other graph DBMS can also be viewed as subgraph matching over large graphs. Though subgraph matching has been extensively studied as a query paradigm in the Semantic Web and in social networks, a user can get a large number of answers in response to a query. These answers can be shown to the user in accordance with an importance ranking. In this thesis proposal, we present four different scoring models along with scalable algorithms to find the top-k answers via a suite of intelligent pruning techniques. The suggested models consist of a practically important subset of the SPARQL query language augmented with some additional useful features. The first model called Substitution Importance Query (SIQ) identifies the top-k answers whose scores are calculated from matched vertices' properties in each answer in accordance with a user-specified notion of importance. The second model called Vertex Importance Query (VIQ) identifies important vertices in accordance with a user-defined scoring method that builds on top of various subgraphs articulated by the user. Approximate Importance Query (AIQ), our third model, allows partial and inexact matchings and returns top-k of them with a user-specified approximation terms and scoring functions. In the fourth model called Probabilistic Importance Query (PIQ), a query consists of several sub-blocks: one mandatory block that must be mapped and other blocks that can be opportunistically mapped. The probability is calculated from various aspects of answers such as the number of mapped blocks, vertices' properties in each block and so on and the most top-k probable answers are returned. An important distinguishing feature of our work is that we allow the user a huge amount of freedom in specifying: (i) what pattern and approximation he considers important, (ii) how to score answers - irrespective of whether they are vertices or substitution, and (iii) how to combine and aggregate scores generated by multiple patterns and/or multiple substitutions. Because so much power is given to the user, indexing is more challenging than in situations where additional restrictions are imposed on the queries the user can ask. The proposed algorithms for the first model can also be used for answering SPARQL queries with ORDER BY and LIMIT, and the method for the second model also works for SPARQL queries with GROUP BY, ORDER BY and LIMIT. We test our algorithms on multiple real-world graph databases, showing that our algorithms are far more efficient than popular triple stores.

Experiencia colombiana en reparación de núcleos de transformadores de potencia

Este artículo presenta el reporte de caso sobre fallas presentadas en el núcleo de transformadores de potencia y algunas experiencias técnicas y metodológicas en la reparación parcial y total de los mismos a varias unidades, hechas en Industrias Explorer Ingeniería S. A. S., empresa dedicada al mantenimiento y reparación de transformadores. También es presentada la metodología para la selección del tipo de lámina, sistema de corte, ensamble, ajuste y prensado del núcleo, ya que estas actividades son decisivas para conseguir un equipo con menores pérdidas y corrientes de vacío, así como menores niveles de ruido. Se describen las etapas para cálculo del flujo de operación del núcleo, circuito de prueba para la saturación del mismo, consideraciones para realizar la inspección termográfica y medición de las pérdidas de vacío, selección del tipo de lámina y técnicas de ensamble empleadas. Se presentan algunas experiencias como: cambio de medio núcleo, reaislamiento de zonas afectadas empleando fibras Nómex entre láminas, cambio total del núcleo por corte mal realizado desde fábrica, cambio total del núcleo por doble aterrizamiento que ocasionó calentamiento del mismo y afectó el aislamiento de sus láminas dejándolas en corto. En todos los casos se evidencia una disminución de las pérdidas de vacío. Finalmente se presentan el comportamiento de los transformadores después de ser puestos nuevamente en servicio.

Mejoramiento de procesos de manufactura utilizando Kanban

Este artículo presenta la aplicación de la metodología Kanban y el análisis del efecto que puede generar en una empresa de fabricación de transformadores de distribución. Mediante la aplicación de la metodología propuesta es posible mejorar la programación de la producción, con el objetivo de reducir la cantidad de producto en proceso que no es utilizado, de forma que se reduzca el inventario. Para analizar el efecto de aplicar la metodología Kanban en la empresa, se utilizo la técnica de simulación, para lo cual se modelizan el proceso actual y el propuesto con las reglas de dicha metodología. A partir de los resultados que arrojan dichas modelizaciones, se observa que existe un mejoramiento en las líneas de producción cuando se utiliza la metodología Kanban.

Zaufanie a stosunki osobiste

Trust is a pervasive phenomenon in our lives. We trust our family members and lovers, our physicians and teachers, our politicians and even strangers on the street. Trust has instrumental value for us, but at the same time it is often accompanied by risk. This is the reason why it is important to distinguish trust that is warranted or justified from blind trust. In order to answer the question how trust is justified, however, it is crucial to know exactly what is the fundamental nature of trust. In the paper, I reconstruct three accounts of trust that operate with the assumption that trust is fundamentally a mental state – the cognitivist account, the voluntaristic account and the affect-based account. I argue that all of these accounts make reference to deeply held intuitions about trust that are incompatible with each other. As a solution to this unfortunate dialectical situation, I suggest to give up the assumption that trust is primarily a mental state. Instead, I argue for a position according to which trust is best understood as a two-place predicate that characterizes a specific relationship in which we can stand to each other.

Suomen essiivi

Essiivi on suomen kielen sijamuoto, jota käytetään nykykielessä erilaisten olotilojen ilmaisemiseen (Hän on opettajana ~ sairaana). Se on taustaltaan lokatiivi, jonka paikanilmaisutehtävä näkyy edelleen erilaisissa kiteytymissä (kotona, luona). Essiivi kuuluu myös ajankohdanilmaisujärjestelmään (lauantaina, ensi vuotena). Tässä tutkimuksessa kuvaan essiivisijan käyttöä erityisesti olotilan ilmaisemisen näkökulmasta. Kiinnitän huomiota sijan merkitykseen ja pyrin tarkentamaan sen lauseopillista kuvausta hyödyntämällä yleislingvistis-kielitypologisia olotilanilmausten kategoriointitapoja. Tutkimukseni aineisto on kolmijakoinen. Pääaineistonani on Lauseopin arkisto, jota koskevan haun tuloksena olen saanut 9096 essiivisijaisen sanan sisältävää lauseketta virkekonteksteineen. Täydennän tätä aineistoa käytöstä poimituilla esimerkeillä ja intuitioon pohjautuvilla ns. selvillä tapauksilla. Tutkimusmenetelmänä on pääosin aineiston kvalitatiivinen tarkastelu, mutta tarkastelen essiiviä myös teoreettisemmin sääntöjärjestelmän näkökulmasta. Tärkeimpänä lähtökohtanani on tuottaa tutkimustietoa, joka kykenee käymään vuoropuhelua kielitypologisen tutkimuksen kanssa siten, että tutkimus kuitenkin tapahtuu yksittäiskielen ehdoilla. Erityisesti semantiikan kuvauksessa tarkastelutapani on kognitiivisen kielitieteen mukaisesti orientoitunut. Essiivin tehtävänä on pelkistetyssä nominaalilauseessa ilmaista olotilan tilapäisyyttä ja muutoksellisuutta, kun taas merkitystä kantavan verbin yhteydessä essiivisijainen olotilan ilmaus saa usein muita merkityksiä ja voi ilmaista myös vaihtoehtoisen tai tilanteen syynä olevan olotilan. Aspektinäkökulmasta essiivi tuo tilaan toimin¬nallisia piirteitä, ja se myös muodostaa selvästi omanlaisensa reviirin suhteessa muihin olotilaa ja sen lähimerkityksiä ilmaiseviin kieli- ja johto-opin kategorioihin. Syntaktisen luokittelun näkökulmasta essiivisijaiset predikoivat olotilanilmaukset jakautuvat kolmeen pääryhmään sen perusteella, millainen niiden suhde lauseen predikaattiin on. Ne voivat toimia kopulalauseen nominaalipredikaatteina, merkitystä kantavien verbien täydennyksinä ja sekundaarisina predikaatteina, jotka ovat määritteitä. Lisäksi essiivisijaiset olotilan ilmaukset voivat toimia predikoimattomina lauseadverbiaaleina. Tutkimus on essiivisijan laaja aineistopohjainen kuvaus, joka osoittaa, että yleislingvistis-kielitypologinen lähestymistapa sopii suomen essiivin kuvaukseen. Alakategorioinnissa joudutaan kuitenkin turvautumaan semantiikkaan. Myös pääkategorioiden jatkumomaisuus on hyväksyttävä. Tulosten perusteella on mahdollista käydä keskustelua siitä, olisiko predikoivien lauseenjäsenten syntaktista luokittelua mahdollista uudistaa. Lisäksi tutkimus avaa uusia kysymyksiä tutkittavaksi erityisesti sijojen käyttöä vertailevasta näkökulmasta.

Correção fenotípica do nanismo avaliada por diferentes parâmetros de crescimento após administração de DNA plasmidial em modelo animal de deficiência isolada do hormônio do crescimento

Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)

Efficient Secure Computation for Real-world Settings and Security Models

Secure computation involves multiple parties computing a common function while keeping their inputs private, and is a growing field of cryptography due to its potential for maintaining privacy guarantees in real-world applications. However, current secure computation protocols are not yet efficient enough to be used in practice. We argue that this is due to much of the research effort being focused on generality rather than specificity. Namely, current research tends to focus on constructing and improving protocols for the strongest notions of security or for an arbitrary number of parties. However, in real-world deployments, these security notions are often too strong, or the number of parties running a protocol would be smaller. In this thesis we make several steps towards bridging the efficiency gap of secure computation by focusing on constructing efficient protocols for specific real-world settings and security models. In particular, we make the following four contributions: - We show an efficient (when amortized over multiple runs) maliciously secure two-party secure computation (2PC) protocol in the multiple-execution setting, where the same function is computed multiple times by the same pair of parties. - We improve the efficiency of 2PC protocols in the publicly verifiable covert security model, where a party can cheat with some probability but if it gets caught then the honest party obtains a certificate proving that the given party cheated. - We show how to optimize existing 2PC protocols when the function to be computed includes predicate checks on its inputs. - We demonstrate an efficient maliciously secure protocol in the three-party setting.