A logical foundation for session-based concurrent computation

Linear logic has long been heralded for its potential of providing a logical basis for concurrency. While over the years many research attempts were made in this regard, a Curry-Howard correspondence between linear logic and concurrent computation was only found recently, bridging the proof theory of linear logic and session-typed process calculus. Building upon this work, we have developed a theory of intuitionistic linear logic as a logical foundation for session-based concurrent computation, exploring several concurrency related phenomena such as value-dependent session types and polymorphic sessions within our logical framework in an arguably clean and elegant way, establishing with relative ease strong typing guarantees due to the logical basis, which ensure the fundamental properties of type preservation and global progress, entailing the absence of deadlocks in communication. We develop a general purpose concurrent programming language based on the logical interpretation, combining functional programming with a concurrent, session-based process layer through the form of a contextual monad, preserving our strong typing guarantees of type preservation and deadlock-freedom in the presence of general recursion and higher-order process communication. We introduce a notion of linear logical relations for session typed concurrent processes, developing an arguably uniform technique for reasoning about sophisticated properties of session-based concurrent computation such as termination or equivalence based on our logical approach, further supporting our goal of establishing intuitionistic linear logic as a logical foundation for sessionbased concurrency.

Probing the time course of nonlinear discriminations during human electrodermal conditioning

Animal-based theories of Pavlovian conditioning propose that patterning discriminations are solved using unique cues or immediate configuring. Recent studies with humans, however, provided evidence that in positive and negative patterning two different rules are utilized. The present experiment was designed to provide further support for this proposal by tracking the time course of the allocation of cognitive resources. One group was trained in a positive patterning; schedule (A-, B-, AB+) and a second in a negative patterning schedule (A+, B+, AB-). Electrodermal responses and secondary task probe reaction time were measured. In negative patterning, reaction times were slower during reinforced stimuli than during non-reinforced stimuli at both probe positions while there were no differences in positive patterning. These results support the assumption that negative patterning is solved using a rule that is more complex and requires more resources than does the rule employed to solve positive patterning. (C) 2001 Elsevier Science (USA).

Bristle pattern formation in the thorax formation of Drosophila: a systems level approach

A fundamental question in developmental biology is how tissues are patterned to give rise to differentiated body structures with distinct morphologies. The Drosophila wing disc offers an accessible model to understand epithelial spatial patterning. It has been studied extensively using genetic and molecular approaches. Bristle patterns on the thorax, which arise from the medial part of the wing disc, are a classical model of pattern formation, dependent on a pre-pattern of trans-activators and –repressors. Despite of decades of molecular studies, we still only know a subset of the factors that determine the pre-pattern. We are applying a novel and interdisciplinary approach to predict regulatory interactions in this system. It is based on the description of expression patterns by simple logical relations (addition, subtraction, intersection and union) between simple shapes (graphical primitives). Similarities and relations between primitives have been shown to be predictive of regulatory relationships between the corresponding regulatory factors in other Systems, such as the Drosophila egg. Furthermore, they provide the basis for dynamical models of the bristle-patterning network, which enable us to make even more detailed predictions on gene regulation and expression dynamics. We have obtained a data-set of wing disc expression patterns which we are now processing to obtain average expression patterns for each gene. Through triangulation of the images we can transform the expression patterns into vectors which can easily be analysed by Standard clustering methods. These analyses will allow us to identify primitives and regulatory interactions. We expect to identify new regulatory interactions and to understand the basic Dynamics of the regulatory network responsible for thorax patterning. These results will provide us with a better understanding of the rules governing gene regulatory networks in general, and provide the basis for future studies of the evolution of the thorax-patterning network in particular.

Security and Trust in Distributed Computation

We propose three research problems to explore the relations between trust and security in the setting of distributed computation. In the first problem, we study trust-based adversary detection in distributed consensus computation. The adversaries we consider behave arbitrarily disobeying the consensus protocol. We propose a trust-based consensus algorithm with local and global trust evaluations. The algorithm can be abstracted using a two-layer structure with the top layer running a trust-based consensus algorithm and the bottom layer as a subroutine executing a global trust update scheme. We utilize a set of pre-trusted nodes, headers, to propagate local trust opinions throughout the network. This two-layer framework is flexible in that it can be easily extensible to contain more complicated decision rules, and global trust schemes. The first problem assumes that normal nodes are homogeneous, i.e. it is guaranteed that a normal node always behaves as it is programmed. In the second and third problems however, we assume that nodes are heterogeneous, i.e, given a task, the probability that a node generates a correct answer varies from node to node. The adversaries considered in these two problems are workers from the open crowd who are either investing little efforts in the tasks assigned to them or intentionally give wrong answers to questions. In the second part of the thesis, we consider a typical crowdsourcing task that aggregates input from multiple workers as a problem in information fusion. To cope with the issue of noisy and sometimes malicious input from workers, trust is used to model workers' expertise. In a multi-domain knowledge learning task, however, using scalar-valued trust to model a worker's performance is not sufficient to reflect the worker's trustworthiness in each of the domains. To address this issue, we propose a probabilistic model to jointly infer multi-dimensional trust of workers, multi-domain properties of questions, and true labels of questions. Our model is very flexible and extensible to incorporate metadata associated with questions. To show that, we further propose two extended models, one of which handles input tasks with real-valued features and the other handles tasks with text features by incorporating topic models. Our models can effectively recover trust vectors of workers, which can be very useful in task assignment adaptive to workers' trust in the future. These results can be applied for fusion of information from multiple data sources like sensors, human input, machine learning results, or a hybrid of them. In the second subproblem, we address crowdsourcing with adversaries under logical constraints. We observe that questions are often not independent in real life applications. Instead, there are logical relations between them. Similarly, workers that provide answers are not independent of each other either. Answers given by workers with similar attributes tend to be correlated. Therefore, we propose a novel unified graphical model consisting of two layers. The top layer encodes domain knowledge which allows users to express logical relations using first-order logic rules and the bottom layer encodes a traditional crowdsourcing graphical model. Our model can be seen as a generalized probabilistic soft logic framework that encodes both logical relations and probabilistic dependencies. To solve the collective inference problem efficiently, we have devised a scalable joint inference algorithm based on the alternating direction method of multipliers. The third part of the thesis considers the problem of optimal assignment under budget constraints when workers are unreliable and sometimes malicious. In a real crowdsourcing market, each answer obtained from a worker incurs cost. The cost is associated with both the level of trustworthiness of workers and the difficulty of tasks. Typically, access to expert-level (more trustworthy) workers is more expensive than to average crowd and completion of a challenging task is more costly than a click-away question. In this problem, we address the problem of optimal assignment of heterogeneous tasks to workers of varying trust levels with budget constraints. Specifically, we design a trust-aware task allocation algorithm that takes as inputs the estimated trust of workers and pre-set budget, and outputs the optimal assignment of tasks to workers. We derive the bound of total error probability that relates to budget, trustworthiness of crowds, and costs of obtaining labels from crowds naturally. Higher budget, more trustworthy crowds, and less costly jobs result in a lower theoretical bound. Our allocation scheme does not depend on the specific design of the trust evaluation component. Therefore, it can be combined with generic trust evaluation algorithms.

Desempeño numérico de los niños de primer año de básica

Las destrezas numéricas que poseen los niños en el kindergarten (primer año de básica en Ecuador) predicen altamente su desempeño escolar posterior, lo cual sugiere que evaluar estas destrezas a temprana edad es fundamental con miras a implementar programas de refuerzo que los ayude a mejorar su rendimiento académico a lo largo de la escolaridad. El objetivo del presente estudio fue examinar las destrezas numéricas de los niños de primer año de básica por medio del Test de Evaluación Matemática Temprana. Los participantes fueron 100 niños de primer año de básica de cuatro escuelas particulares de Cuenca. Los resultados indicaron que los niños presentan un nivel bueno de desempeño numérico y que el dominio de habilidades para establecer relaciones lógicas es superior al dominio de habilidades para contar. No se observaron diferencias de género en este desempeño. Adicionalmente, se encontró que existen diferencias significativas entre escuelas en el desarrollo de las destrezas numéricas de sus estudiantes. Las implicaciones teóricas y prácticas de este estudio son discutidas.

Les relations mères-enfants lorsqu'un enfant enfreint une règle : étude de l'impact des stratégies visant à renforcer les règles et du climat interpersonnel

La documentation sur les pratiques parentales suggère qu’afin de favoriser le développement optimal des enfants, les parents devraient utiliser des pratiques qui sont structurantes et qui soutiennent leur autonomie (Grolnick & Pomerantz, 2009). Dans certaines situations, par exemple lorsqu’un enfant enfreint une règle, il peut toutefois sembler difficile pour les parents d’adopter des stratégies parentales qui allient ces deux dimensions. Qui plus est, peu d’études se sont penchées sur la façon dont les parents peuvent renforcer la structure tout en tenant simultanément compte des besoins et de l’individualité des enfants. L’objectif de cette thèse est d’évaluer l’impact de trois stratégies visant à renforcer les règles (répéter la règle, donner une punition ou avoir recours à une conséquence logique) variant quant à leurs niveaux de structure et de soutien à l’autonomie, et de vérifier leurs effets lorsqu’elles sont employées au sein d’un climat interpersonnel soutenant l’autonomie ou d’un climat interpersonnel contrôlant. Le premier article s’intéresse à l’impact conjoint des stratégies visant à renforcer les règles et du climat interpersonnel sur des indicateurs de conformité et d’intériorisation rapportés par 221 enfants et leurs mères. Les résultats montrent que les mères considèrent les conséquences logiques utilisées dans un climat qui soutient l’autonomie comme étant les pratiques les plus efficaces et les plus acceptables (effet interactif). Les enfants pensent aussi qu’un climat interpersonnel qui soutient l’autonomie est plus efficace et plus acceptable qu’un climat interpersonnel contrôlant. De plus, les résultats suggèrent que les enfants considèrent les conséquences logiques comme des pratiques aussi efficaces, mais plus acceptables que les punitions. Le fait de répéter la règle est jugé comme étant acceptable, mais peu efficace comparativement aux autres stratégies. Pour les enfants, les résultats montrent qu’il n’y a pas d’interaction entre les stratégies visant à renforcer les règles et le climat interpersonnel. Le second article vise à documenter les réactions émotionnelles potentielles des mêmes enfants (N = 221) face aux trois stratégies visant à renforcer les règles et aux climats interpersonnels. Quatre émotions déterminantes dans le processus d’intériorisation sont étudiées, soit la colère, la tristesse, la culpabilité et la honte. Les résultats montrent d’abord qu’un climat interpersonnel contrôlant amènerait les enfants à vivre plus de colère, de tristesse et de honte qu’un climat soutenant l’autonomie. Par contre, les enfants rapportent autant de culpabilité au sein des deux climats interpersonnels. Les résultats suggèrent également que les punitions susciteraient plus de tristesse, de culpabilité et de colère que les conséquences logiques, que les conséquences logiques feraient vivre aux enfants plus de tristesse et de culpabilité que répéter la règle et que les punitions amèneraient les enfants à vivre davantage de honte que répéter la règle. Finalement, les résultats suggèrent que les effets des stratégies visant à renforcer les règles et du climat interpersonnel sont additifs; il n’y a pas d’interaction entre ces deux facteurs. Les contributions théoriques de cette thèse à la documentation sur les pratiques parentales et le développement des enfants, de même que ses implications pratiques pour les parents dans la socialisation des enfants sont discutées.

Transreal logical space of all propositions

Transreal numbers provide a total semantics containing classical truth values, dialetheaic, fuzzy and gap values. A paraconsistent Sheffer Stroke generalises all classical logics to a paraconsistent form. We introduce logical spaces of all possible worlds and all propositions. We operate on a proposition, in all possible worlds, at the same time. We define logical transformations, possibility and necessity relations, in proposition space, and give a criterion to determine whether a proposition is classical. We show that proofs, based on the conditional, infer gaps only from gaps and that negative and positive infinity operate as bottom and top values.

Cyprus presidency and Turkey's relations with the European Union. OSW Commentary No. 82, 2012-06-26

Turkey’s intention to boycott Cyprus presidency of the EU Council in the second half of 2012 is a logical consequence of Ankara’s policy of not recognising the Republic of Cyprus. The boycott will have a negative but limited impact on Turkey-EU relations, and will not in practice significantly affect their intensity in the second half-year. The so-called positive agenda, a new co-operation mechanism between the EU and Turkey, offers a provisional way for the two sides to circumvent the formal obstacle for mutual contacts created by the Cyprus conflict. In itself, however, the launch of the positive agenda is not a breakthrough for Turkey’s integration with the EU. Any such breakthrough is unlikely to occur until progress is made in regulating the Cyprus conflict, and some member states change their attitude towards Turkey’s accession to the EU.

An Analysis of Some Relations Among Domain Ontologies

* This paper was made according to the program of fundamental scientific research of the Presidium of the Russian Academy of Sciences «Mathematical simulation and intellectual systems», the project "Theoretical foundation of the intellectual systems based on ontologies for intellectual support of scientific researches".

Towards a logical foundation of randomized computation

This dissertation investigates the relations between logic and TCS in the probabilistic setting. It is motivated by two main considerations. On the one hand, since their appearance in the 1960s-1970s, probabilistic models have become increasingly pervasive in several fast-growing areas of CS. On the other, the study and development of (deterministic) computational models has considerably benefitted from the mutual interchanges between logic and CS. Nevertheless, probabilistic computation was only marginally touched by such fruitful interactions. The goal of this thesis is precisely to (start) bring(ing) this gap, by developing logical systems corresponding to specific aspects of randomized computation and, therefore, by generalizing standard achievements to the probabilistic realm. To do so, our key ingredient is the introduction of new, measure-sensitive quantifiers associated with quantitative interpretations. The dissertation is tripartite. In the first part, we focus on the relation between logic and counting complexity classes. We show that, due to our classical counting propositional logic, it is possible to generalize to counting classes, the standard results by Cook and Meyer and Stockmeyer linking propositional logic and the polynomial hierarchy. Indeed, we show that the validity problem for counting-quantified formulae captures the corresponding level in Wagner's hierarchy. In the second part, we consider programming language theory. Type systems for randomized \lambda-calculi, also guaranteeing various forms of termination properties, were introduced in the last decades, but these are not "logically oriented" and no Curry-Howard correspondence is known for them. Following intuitions coming from counting logics, we define the first probabilistic version of the correspondence. Finally, we consider the relationship between arithmetic and computation. We present a quantitative extension of the language of arithmetic able to formalize basic results from probability theory. This language is also our starting point to define randomized bounded theories and, so, to generalize canonical results by Buss.

As relações de gênero em uma escola de futebol : quando o jogo é possível? = Genders relations at a football school : when the game happen?

Universidade Estadual de Campinas . Faculdade de Educação Física

O Serviço de Recreação Operaria e a sociabilização do trabalhador sindicalizado no Brasil : 1943-1964

Universidade Estadual de Campinas . Faculdade de Educação Física