Search

The design of SQL is based on a three-valued logic (3VL), rather than the familiar two-valued Boolean logic (2VL). In addition to true and false, 3VL adds unknown to handle nulls. Viewed as indispensable for SQL expressiveness, it is often criticized for unintuitive behavior of queries and for being a source of programmer mistakes. We show that, contrary to the widely held view, SQL could have been designed based on 2VL, without any loss of expressiveness. Similarly to SQL’s WHERE clause, which only keeps true tuples, we conflate false and unknown for conditions involving nulls to obtain an equally expressive 2VL-based version of SQL. This applies to the core of the 1999 SQL Standard. Queries written under the 2VL semantics can be efficiently trans lated into the 3VL SQL and thus executed on any existing RDBMS. We show that 2VL enables additional optimizations. To gauge its applicability, we establish criteria under which 2VL and 3VL seman tics coincide, and analyze common benchmarks such as TPC-H and TPC-DS to show that most of their queries are such. For queries that behave differently under 2VL and 3VL, we undertake a user study to show a consistent preference for the 2VL semantics.

Biomolecular materials offer tremendous potential for the development of memristive devices due to their low cost of production, environmental friendliness, and, most notably, biocompatibility. Herein, biocompatible memristive devices based on amyloid–gold nanoparticle hybrids have been investigated. These memristors demonstrate excellent electrical performance, featuring an ultrahigh Roff/Ron ratio (>107), a low switching voltage (

Ainda que a tecnologia tenha um crescimento exponencial e a programação já não seja uma novidade, a sua integração num contexto escolar, que vá para além do saber programar, é muito reduzida. São muitos os autores que defendem que aprender a programar tem de acontecer em contexto e, de preferência, para que os alunos aprendam conceitos de diferentes áreas. Para isso acontecer em sala de aula, é necessário que os professores passem por experiências semelhantes durante a sua formação inicial. Neste artigo apresenta-se um estudo de caso de uma turma no 1.º ano da Licenciatura em Educação Básica, em que os futuros educadores de infância e professores do 1.º e 2.º ciclo do ensino básico abordaram conceitos de lógica booleana através da programação. Faz-se uma descrição da experiência e apresentam-se as perspetivas, aprendizagens e dificuldades dos estudantes ao longo de toda a experiência. Os resultados são positivos, tanto ao nível do conhecimento de programação, como em relação às atitudes e perspetivas dos futuros educadores de infância e professores dos 1.º e 2.º ciclos do ensino básico quanto à sua utilização em sala de aula., RE@D - Revista de Educação a Distância e Elearning, Vol. 5 N.º 1: Pensamento Crítico, Criatividade e Pensamento Computacional na Sociedade Digital

Background and purpose: In recent years, the rapid growth of cities has been led to an increase in the production of various types of solid wastes in urban areas. Although landfilling is the last step in municipal solid waste management, but it is one of the common methods in developing countries’ municipal solid waste management. The purpose of this study is to accurately locate urban landfills in Naien county by using a combination of fuzzy and boolean methods. Materials and methods: In this study, AHP model was used to standardize and determine the weight of criteria and sub-criteria. The innovation of this research is the combination of the results of fuzzy and boolean logic. The fuzzy method consists of two groups, the first group is calculation the weight of criteria and the other one by calculating the weight of sub-criteria, and the results of boolean logic with five classes including calculation the weight of criteria and sub-criteria. Results: The results of this study show that the mentioned fuzzy and boolean methods have identified 34, 48779, 16000 and 7630 hectares of areas in Nain county as the most suitable areas for creating urban landfills. According to the weight of methods, a single map with four main patches is resulted by combination of these four methods, which includes a total of 5055 hectares in Nain. Conclusion: The results of this study show that the combination of fuzzy and boolean logic results provides better areas for landfill than using the methods individually.

Understanding sustainable livestock production requires consideration of both qualitative and quantitative factors in a temporal and/or spatial frame. This study adapted Qualitative Comparative Analysis (QCA) to relate conditions of social, economic, and governance factors to changes in livestock inventory across several counties and over time. This paper presents an approach that (1) identified factors with the potential to relate to a change in livestock inventory and (2) analyzed commonalities within these factors related to changes spatially and temporally. This paper illustrates the approach and results when applied to five counties in eastern South Dakota. The specific response variables were periods of increasing, no change, or decreasing beef cattle, dairy cattle, and swine inventories in the specific counties for five-year census periods between 1992 and 2017. In the spatial analysis of counties, stable beef inventories and decreasing dairy inventories related to counties with increasing gross domestic products. The presence of specific social communities related to increases in county swine inventories. In the temporal analysis of census periods, local governance and economic factors, particularly market price influences, were more prevalent. Swine inventory showed a stronger link to cash crop markets than to livestock markets, whereas cattle market price increases associated with stable inventories for all animal types. Local governance tools had mixed effects for the different animal types across space and time. The factors and analysis results are context-specific. However, the process considers the various socio-economic processes in livestock production and community development applicable to agricultural sustainability questions in the Midwest and beyond.

Isothermal nucleic acid amplification tests (iNATs), such as loop-mediated isothermal amplification (LAMP), are good alternatives to PCR-based amplification assays, especially for point-of-care and low-resource use, in part because they can be carried out with relatively simple instrumentation. However, iNATs can often generate spurious amplicons, especially in the absence of target sequences, resulting in false-positive results. This is especially true if signals are based on non-sequence-specific probes, such as intercalating dyes or pH changes. In addition, pathogens often prove to be moving, evolving targets and can accumulate mutations that will lead to inefficient primer binding and thus false-negative results. Multiplex assays targeting different regions of the analyte and logical signal readout using sequence-specific probes can help to reduce both false negatives and false positives. Here, we describe rapid conversion of three previously described SARS-CoV-2 LAMP assays that relied on a non-sequence-specific readout into individual and multiplex one-pot assays that can be visually read using sequence-specific oligonucleotide strand exchange (OSD) probes. We describe both fluorescence-based and Boolean logic-gated colorimetric lateral flow readout methods and demonstrate detection of SARS-CoV-2 virions in crude human saliva. IMPORTANCE One of the key approaches to treatment and control of infectious diseases, such as COVID-19, is accurate and rapid diagnostics that is widely deployable in a timely and scalable manner. To achieve this, it is essential to go beyond the traditional gold standard of quantitative PCR (qPCR) that is often faced with difficulties in scaling due to the complexity of infrastructure and human resource requirements. Isothermal nucleic acid amplification methods, such as loop-mediated isothermal amplification (LAMP), have been long pursued as ideal, low-tech alternatives for rapid, portable testing. However, isothermal approaches often suffer from false signals due to employment of nonspecific readout methods. We describe general principles for rapidly converting nonspecifically read LAMP assays into assays that are read in a sequence-specific manner by using oligonucleotide strand displacement (OSD) probes. We also demonstrate that inclusion of OSD probes in LAMP assays maintains the simplicity of one-pot assays and a visual yes/no readout by using fluorescence or colorimetric lateral-flow dipsticks while providing accurate sequence-specific readout and the ability to logically query multiplex amplicons for redundancy or copresence. These principles not only yielded high-surety isothermal assays for SARS-CoV-2 but might also aid in the design of more sophisticated molecular assays for other analytes.

Abstract Biosensor is a device that responds to a particular target in a selective way by incorporation of biological recognition as sensing unit. For practical biomedical applications, a digital output (a qualitative YES/NO answer) is highly demanded for certain end‐user or point‐of‐care applications. Boolean logic, which can be applied to any type of information expressed as 0 (NO) and 1 (YES), is widely employed to achieve such qualitative analysis. Over the past decade, owing to DNA's advantages of stability, accessibility, and manipulability, significant research efforts have been focused on the design and application of DNA logic gates (DLG)‐based biosensors capable of implementing logic‐gated biomedical functions. This review summarizes the existed representative examples and the advanced developments of DLG biosensors, and discusses the limitations and the future directions on the development of novel nanosensors based on DNA logic operations for realizing highly efficient diagnosis.

George Boole is one of the first logicians who offered a systematic formalization of language. He developed a notation to encode ordinary language sentences to algebraic symbols and developed algebraic methods to manipulate those symbols and to deduce results that are interpretable in the ordinary language. His methods formed the basis of modern logic. Boole applied his formal methods to many of the contemporary questions of his time, one of them being scholastic logic. In this paper, I explain how Boole deals with Aristotelian logic. I will start with his notation and algebraic methods, then apply them to Aristotelian conversions and syllogisms. It must be noted Boole has two versions of notation and methods, one is developed in Mathematical Analysis of Logic and the other is in his seminal book The Laws of Thought. I focus on the later version. George Boole dili sistematik bir şekilde yapısallaştıran ilk mantıkçılardan biridir. Dildeki sıradan cümleleri cebirsel sembollerle ifade edebilmek için bir notasyon ve bu sembolleri sistematik bir şekilde değiştirerek gündelik dilde de yorumlananabilen sonuçlar bulmak için cebirsel yöntemler geliştirdi. Geliştiridiği bu yöntemleri modern mantığın temelini oluşturmuştur. Geliştirdiği metotları skolastik mantık da dahil zamanındaki bir çok probleme uygulamıştır. Bu makalede Boole’un metotlarının Aristoteles'in mantığına nasıl uygulandığını inceliyorum. Öncelikle notasyonuna ve cebirsel metotlarına değinip, daha sonra bunları Aristoteles’in evirmelerine ve kıyaslarına uygulanışını gösteriyorum. Boole’un notasyon ve metotlarının iki versiyonu bulunmaktadır, bir tanesi Mantığın Matematiksel Analizi’nde diğeri ise Düşüncenin Yasaları’nda geliştirilen. Bu makalede Düşüncenin Yasaları’nda geliştirdiği versiyon esas alınmıştır.

This presentation was given in an online webinar. This presentation covers; 1. A basic Concept of Keywords & MeSH terms 2. Understanding Boolean Logic 3. What are Boolean Operators 4. Why you should always search with Boolean Terms 5. Common search database&nbsp

We study theoretically neural networks embedding a nonlinear wave as a computing reservoir. We demonstrate interpolation of large datasets and Boolean logic. We discuss the existence of a critical nonlinearity for learning.

This study presents an assessment of potential sites for the installation of Ghana's first NPP using a combination of multi-criteria decision-making approaches. The selection process considered only the first two steps involve in the site selection as indicated in the IAEA guidelines. According to the results, site 1 is 9.3 km North-west of Mpaha, a spacely populated area, and approximately 20 km from the national grid. Site 2 is relatively remote than site 1 and is 20 km northeast of the town of Kinyanga. Site 3 is 4.5 km northeast of the town of Abama, a sparsely populated area in the country. Site 4 is located 20 km northeast of the town of Atebubu, with a proximity to the national transmission and road network of 19 km and 2.8 km, respectively. The final site 5 is further south of the country, approximately 5 km southeast of Takorowatwen.

With the massive spread of the use of the Internet and the computer tool in general, the accessibility of user interfaces is an increasingly pressing need. Ease of use of computing devices is indeed a critical point in fostering adoption. Thus, the difficulties experienced by certain users, such as the elderly or in a situation of neurocognitive difficulties, require more acutely the question of accessibility. Much work has focused on this subject in order to define generic or situational accessibility recommendations. One possible approach is to adapt the interfaces to the context of use. However, difficulties remain, particularly linked to the complexity of the possible contexts of use, leading to a multiplicity of characteristics to be taken into account, an imprecision of the values assigned to these characteristics and the combination of multiple adaptation rules. We address these three obstacles through the following research question: how to improve the accessibility of UIs through adaptive interfaces by taking into account the multiplicity of context characteristics, the imprecision of context values ; as well as the complexity and the combination of rules?By relying on a generic adaptation architecture, we propose a dynamic adaptation engine based on fuzzy logic, used to implement accessibility recommendations. We show how fuzzy logic manages the three obstacles identified through a prototype. We will highlight these advantages compared to a classical approach in Boolean logic. In order to validate these advantages, we carried out a comparative analysis between the 2 types of rules (fuzzy and binary logic) in a theoretical way and with an evaluation by experts. The results validate the interest of fuzzy logic for adapting interfaces for accessibility purposes.; Avec la diffusion massive de l’utilisation d’Internet et de l’outil informatique en général, l’accessibilité des interfaces utilisateur est un besoin toujours plus prégnant. La facilité d’utilisation des dispositifs informatiques est en effet un point critique pour en favoriser l’adoption. Ainsi, les difficultés vécues par certains utilisateurs, tels que les personnes âgées ou en situation de difficultés neurocognitive, posent de façon plus aiguë la question de l'accessibilité. De nombreux travaux se sont penchés sur ce sujet afin de définir des recommandations d’accessibilité génériques ou situationnelles. Une approche possible est d’adapter les interfaces au contexte d’usage. Cependant, des difficultés demeurent, notamment liées à la complexité des contextes d’usage possibles, entrainant une multiplicité des caractéristiques à prendre en compte, une imprécision des valeurs attribuées à ces caractéristiques et la combinaison de multiples règles d’adaptation. Nous abordons ces trois verrous au travers de la question de recherche suivante : comment améliorer l’accessibilité des IHM par le biais d’interfaces adaptatives en prenant en compte la multiplicité des caractéristiques du contexte, l’imprécision des valeurs de contexte ainsi que la complexité et la combinaison des règles ?En nous appuyant sur une architecture générique d’adaptation, nous proposons un moteur d’adaptation dynamique basé sur la logique floue, utilisé pour implémenter les préconisations en accessibilité. Nous montrons comment la logique floue permet de gérer les trois verrous identifiés au travers d’un prototype. Nous mettrons en avant ces avantages par rapport à une approche classique en logique booléenne. Afin de valider ces avantages, nous avons mené une analyse comparative entre les 2 types de règles (logiques floue et binaire) de manière théorique et avec une évaluation auprès d’experts. Les résultats valident l’intérêt de la logique floue pour l’adaptation des interfaces à des fins d’accessibilité.

With the massive spread of the use of the Internet and the computer tool in general, the accessibility of user interfaces is an increasingly pressing need. Ease of use of computing devices is indeed a critical point in fostering adoption. Thus, the difficulties experienced by certain users, such as the elderly or in a situation of neurocognitive difficulties, require more acutely the question of accessibility. Much work has focused on this subject in order to define generic or situational accessibility recommendations. One possible approach is to adapt the interfaces to the context of use. However, difficulties remain, particularly linked to the complexity of the possible contexts of use, leading to a multiplicity of characteristics to be taken into account, an imprecision of the values assigned to these characteristics and the combination of multiple adaptation rules. We address these three obstacles through the following research question: how to improve the accessibility of UIs through adaptive interfaces by taking into account the multiplicity of context characteristics, the imprecision of context values ; as well as the complexity and the combination of rules?By relying on a generic adaptation architecture, we propose a dynamic adaptation engine based on fuzzy logic, used to implement accessibility recommendations. We show how fuzzy logic manages the three obstacles identified through a prototype. We will highlight these advantages compared to a classical approach in Boolean logic. In order to validate these advantages, we carried out a comparative analysis between the 2 types of rules (fuzzy and binary logic) in a theoretical way and with an evaluation by experts. The results validate the interest of fuzzy logic for adapting interfaces for accessibility purposes.; Avec la diffusion massive de l’utilisation d’Internet et de l’outil informatique en général, l’accessibilité des interfaces utilisateur est un besoin toujours plus prégnant. La facilité d’utilisation des dispositifs informatiques est en effet un point critique pour en favoriser l’adoption. Ainsi, les difficultés vécues par certains utilisateurs, tels que les personnes âgées ou en situation de difficultés neurocognitive, posent de façon plus aiguë la question de l'accessibilité. De nombreux travaux se sont penchés sur ce sujet afin de définir des recommandations d’accessibilité génériques ou situationnelles. Une approche possible est d’adapter les interfaces au contexte d’usage. Cependant, des difficultés demeurent, notamment liées à la complexité des contextes d’usage possibles, entrainant une multiplicité des caractéristiques à prendre en compte, une imprécision des valeurs attribuées à ces caractéristiques et la combinaison de multiples règles d’adaptation. Nous abordons ces trois verrous au travers de la question de recherche suivante : comment améliorer l’accessibilité des IHM par le biais d’interfaces adaptatives en prenant en compte la multiplicité des caractéristiques du contexte, l’imprécision des valeurs de contexte ainsi que la complexité et la combinaison des règles ?En nous appuyant sur une architecture générique d’adaptation, nous proposons un moteur d’adaptation dynamique basé sur la logique floue, utilisé pour implémenter les préconisations en accessibilité. Nous montrons comment la logique floue permet de gérer les trois verrous identifiés au travers d’un prototype. Nous mettrons en avant ces avantages par rapport à une approche classique en logique booléenne. Afin de valider ces avantages, nous avons mené une analyse comparative entre les 2 types de règles (logiques floue et binaire) de manière théorique et avec une évaluation auprès d’experts. Les résultats valident l’intérêt de la logique floue pour l’adaptation des interfaces à des fins d’accessibilité.

The advent of modern single-cell biology has revealed the striking molecular diversity of cell populations once thought to be more homogeneous. This newly appreciated complexity has made intersectional genetic approaches essential to understanding and probing cellular heterogeneity at the functional level. Here, we build on previous knowledge to develop a simple adeno-associated virus (AAV)-based approach to define specific subpopulations of cells by Boolean exclusion logic (AND NOT). This expression by Boolean exclusion (ExBoX) system encodes for a gene of interest that is turned on by a particular recombinase (Cre or FlpO) and turned off by another. ExBoX allows for the specific transcription of a gene of interest in cells expressing only the activating recombinase, but not in cells expressing both. We show the ability of the ExBoX system to tightly regulate expression of fluorescent reporters in vitro and in vivo, and further demonstrate the adaptability of the system by achieving expression of a variety of virally delivered coding sequences in the mouse brain. This simple strategy will expand the molecular toolkit available for cell- and time-specific gene expression in a variety of systems., Summary: The generation of a novel AAV-based intersectional approach to define and target specific subpopulations of cells in time and space via a Expression by Boolean Exclusion (ExBoX) system.

The flow of data between processing and memory units in contemporary computing systems is their main performance and energy-efficiency bottleneck, often referred to as the &lsquo, von Neumann bottleneck&rsquo, or &lsquo, memory wall&rsquo, Emerging resistance switching memories (memristors) show promising signs to overcome the &lsquo, by enabling computation in the memory array. Majority logic is a type of Boolean logic, and in many nanotechnologies, it has been found to be an efficient logic primitive. In this paper, a technique is proposed to implement a majority gate in a memory array. The majority gate is realised in an energy-efficient manner as a memory R E A D operation. The proposed logic family disintegrates arithmetic operations to majority and NOT operations which are implemented as memory R E A D and W R I T E operations. A 1-bit full adder can be implemented in 6 steps (memory cycles) in a 1T&ndash, 1R array, which is faster than I M P L Y , N A N D , N O R and other similar logic primitives.

Qualitative Comparative Analysis (QCA) is increasingly establishing itself as a method in social research. QCA is a set-theoretic, truth-table-based method that identifies complex combinations of conditions (configurations) that are necessary and/or sufficient for an outcome. An advantage of QCA is that it models the complexity of social phenomena by accounting for conjunctural, asymmetric, and equifinal patterns. Accordingly, the method does not assume isolated net effects of single variables but recognizes that the effect of a single condition (that is, an explanatory factor) often unfolds only in combination with other conditions. Moreover, QCA acknowledges that the occurrence of a phenomenon can have a different explanation from its non-occurrence. Finally, QCA allows for different, mutually non-exclusive explanations of the same phenomenon. QCA is not only a technique; there is a diversity of approaches to how it can be implemented before, during and after the “technical moment,” depending on the analytic goals related to contributing to theory, engaging with cases, and the approach to explanation. Particularly since 2012, an increasing number of scholars have turned to using QCA to investigate public administrations. Even though the boundaries of Public Administration (PA) as an academic discipline are difficult to determine, it can be defined as an intellectual forum for those who want to understand both public administrations as organizations and their relationships to political, economic, and societal actors—especially in the adoption and implementation of public policies. Owing to its fragmented nature, there has been a long-lasting debate about the methodological sophistication and appropriateness of different comparative methods. In particular, the high complexity and strong context dependencies of causal patterns challenge theory-building and empirical analysis in Public Administration. Moreover, administrative settings are often characterized by relatively low numbers of cases for comparison, as well as strongly multilevel empirical settings. QCA as a technique allows for context-sensitive analyses that take into account this complexity. Against this background, it is not surprising that applications of QCA have become more widespread among scholars of Public Administration. A systematic review of articles using QCA published in the major Public Administration journals shows that the use of QCA started in mid-2000s and then grew exponentially. The review shows that, especially in two thematic areas, QCA has high analytical value and may (alongside traditional methodological approaches) help improve theories and methods of PA. The first area is the study of organizational decision-making and the role of bureaucrats during the adoption and implementation of public policies and service delivery. The second area where QCA has great merits is in explaining different features of public organizations. Especially in evaluation research where the aim is to investigate performance of various kinds (especially effectiveness in terms of both policy and management), QCA is a useful analytical tool to model these highly context-dependent relationships. The QCA method is constantly evolving. The development of good practices for different QCA approaches as well as several methodological innovations and software improvements increases its potential benefits for the future of Public Administration research.

Driven by the need to address both the von Neumann bottleneck and scaling limits predicted by Moore's law, spintronic devices have been shown to be strong contenders for logic-in-memory applications. While several field-free spin–orbit torque (SOT)-driven logic devices have been proposed, their operation typically requires additional initialization or reset pulses, the exchange-coupled canted spins reduce both anomalous Hall sign-to-noise ratio as well as thermal stability of the ferromagnetic layer, and device-to-device variation in exchange coupling strength is expected. A reconfigurable SOT-driven logic device using a double Hall cross structure with an integrated bias field line for the generation of a local bias field is experimentally demonstrated. The on-chip bipolar bias field can be toggled to flip the SOT-induced switching chirality, and to assist with deterministic SOT magnetization switching, thereby enabling on-the-fly reconfigurability of the logic device to function as one of the several possible logic gates, e.g., AND, NOR, XNOR, XOR, NIMP, and converse NIMP. It is then shown through compact-modeling and circuit simulation that the applications of such reconfigurable logic devices can be further expanded to build half-adders. Agency for Science, Technology and Research (A*STAR) National Research Foundation (NRF) The work was supported by the Singapore National Research Foundation, Prime Minister’s Office under a Competitive Research Programme (Non-volatile Magnetic Logic and Memory Integrated Circuit Devices, NRF-CRP9-2011-01) and an Industry-IHL Partnership Program (NRF2015-IIP001-001). The support from a RIE2020 ASTAR AME IAF-ICP Grant (No. I1801E0030) and an ASTAR AME Programmatic Grant (No. A1687b0033) is also acknowledged. W.S.L. is a member of the SG-SPIN Consortium.

Determining the minimum number of sensor nodes to observe the internal state of the whole system is important in analysis of complex networks. However, existing studies suggest that a large number of sensor nodes are needed to know the whole internal state. In this paper, we focus on identification of a small set of sensor nodes to discriminate statically and periodically steady states using the Boolean network model where steady states are often considered to correspond to cell types. In other words, we seek a minimum set of nodes to discriminate singleton and periodic attractors. We prove that one node is not necessarily enough but two nodes are always enough to discriminate two periodic attractors by using the Chinese remainder theorem. Based on this, we present an algorithm to determine the minimum number of nodes to discriminate all given attractors. We also present a much more efficient algorithm to discriminate singleton attractors. The results of computational experiments suggest that attractors in realistic Boolean networks can be discriminated by observing the states of only a small number of nodes.

This is the summary of Qualitative Transparency Deliberations Final Report on Set-Analytic Approaches, Especially Qualitative Comparative Analysis (QCA), Working Group number III.4.10.2139/ssrn.3333483

Biocomputing uses molecular biology parts as the hardware to implement computational devices. By following pre-defined rules, often hard-coded into biological systems, these devices are able to process inputs and return outputs-thus computing information. Key to the success of any biocomputing endeavor is the availability of a wealth of molecular tools and biological motifs from which functional devices can be assembled. Synthetic biology is a fabulous playground for such purpose, offering numerous genetic parts that allow for the rational engineering of genetic circuits that mimic the behavior of electronic functions, such as logic gates. A grand challenge, as far as biocomputing is concerned, is to expand the molecular hardware available beyond the realm of genetic parts by tapping into the host metabolism. This objective requires the formalization of the interplay of genetic constructs with the rest of the cellular machinery. Furthermore, the field of metabolic engineering has had little intersection with biocomputing thus far, which has led to a lack of definition of metabolic dynamics as computing basics. In this perspective article, we advocate the conceptualization of metabolism and its motifs as the way forward to achieve whole-cell biocomputations. The design of merged transcriptional and metabolic circuits will not only increase the amount and type of information being processed by a synthetic construct, but will also provide fundamental control mechanisms for increased reliability.

Diploid budding yeast (Saccharomyces cerevisiae) can adopt one of several alternative differentiation fates in response to nutrient limitation, and each of these fates provides distinct biological functions. When different strain backgrounds are taken into account, these various fates occur in response to similar environmental cues, are regulated by the same signal transduction pathways, and share many of the same master regulators. I propose that the relationships between fate choice, environmental cues and signaling pathways are not Boolean, but involve graded levels of signals, pathway activation and master-regulator activity. In the absence of large differences between environmental cues, small differences in the concentration of cues may be reinforced by cell-to-cell signals. These signals are particularly essential for fate determination within communities, such as colonies and biofilms, where fate choice varies dramatically from one region of the community to another. The lack of Boolean relationships between cues, signaling pathways, master regulators and cell fates may allow yeast communities to respond appropriately to the wide range of environments they encounter in nature.

Tennis is a sport with a very complex technique. Amateur tennis players have trainers and/or coaches, but are not usually accompanied by them to championships. Curiously, in this sport, the result of many matches can be changed by a small hint like `hit the ball a little higher when serving&rsquo, However, the biomechanical of a tennis stroke is only clear to an expert. We, therefore, developed a prototype of a rule-based expert system (RBES) aimed at an amateur competition player that is not accompanied by his/her coach to a championship and is not serving as usual (the RBES is so far restricted to serving). The player has to answer a set of questions about how he/she is serving that day and his/her usual serving technique and the RBES obtains a diagnosis using logic inference about the possible reasons (according of the logic rules that have been previously given to the RBES). A certain knowledge of the tennis terminology and technique is required from the player, but that is something known at this level. The underlying logic is Boolean and the inference engine is algebraic (it uses Groebner bases).

International audience; Analogical proportions are statements of the form a is to b as c is to d. Such expressions compare the pair (a,b)with the pair (c,d). Previous papers have developed logical modelings of such proportions both in Boolean and in multiple-valued settings. They emphasize a reading of the proportion as “the way a and b differ is the same as c and d differ”. The ambition of this paper is twofold. The paper first provides a deeper understanding and further justifications of the Boolean modeling, before introducing analogical inequalities, where “as” is replaced by “as much as” in the comparison of two pairs. From an abstract viewpoint, analogical proportions are supposed to obey at least three postulates expressing reflexivity, symmetry, and stability under central permutation. Nevertheless these postulates are not enough to determine a single model and a minimality condition has to be added as shown in this paper. These models are organized in a complete lattice based on set inclusion. This leads us to discuss lower and upper approximations of the minimal model. Apart from being minimal, this model can also be evaluated in terms of Kolmogorov complexity via an expression reflecting the intended meaning of analogy. We show that the six Boolean patterns of the minimal model that make Boolean analogy true minimize this expression. Besides, analogical proportions extend to 4-tuples of Boolean vectors. This enables us to explain why analogical proportions also reads in terms of similarity (rather than difference, i.e., dissimilarity): a and d share the same presence or absence of features as b and c. Moreover, we establish a link between analogical proportion and Hamming distances between components of the proportion. We also emphasize that analogical proportions are pervasive in any comparison of two vectors a and d that implicitly induce the existence of “intermediary” vectors b and c forming together such a proportion. The similarity reading and the dissimilarity reading of a Boolean analogical proportion are no longer equivalent in the multiple-valued setting, where they give birth to two distinct options that are recalled. These options are also discussed with respect to their capability to handle so-called “continuous” logical proportions of the form a is to b as b is to c involving some idea of “betweenness”. In all the previously investigated issues, the pairs involved in the 4-tuples were compared via equalities of similarities or equalities of dissimilarities. This observation suggests to also consider statements of the form “a is to b at least as much as c is to d”, leading to the concept of “analogical inequalities”. Thus, instead of expressing equality between differences or similarities, as it is the case for analogical proportions, it is also interesting to express inequalities between such differences or similarities. Starting from the modeling of analogical proportions, we investigate the logical modeling of analogical inequalities, both in the Boolean and in the multiple-valued cases, and discuss their potential use in relation with some recent related work in computer vision.

A promising application of DNA self-assembly is the fabrication of chromophore-based excitonic devices. DNA brick assembly is a compelling method for creating programmable nanobreadboards on which chromophores may be rapidly and easily repositioned to prototype new excitonic devices, optimize device operation, and induce reversible switching. Using DNA nanobreadboards, we have demonstrated each of these functions through the construction and operation of two different excitonic AND logic gates. The modularity and high chromophore density achievable via this brick-based approach provide a viable path toward developing information processing and storage systems.

Decoders are combinational circuits that convert information from n inputs to a maximum of 2(n) outputs. This operation is of major importance in computing systems yet it is vastly underexplored in synthetic biology. Here, we present a synthetic gene network architecture that operates as a biological decoder in human cells, converting 2 inputs to 4 outputs. As a proof-of-principle, we use small molecules to emulate the two inputs and fluorescent reporters as the corresponding four outputs. The experiments are performed using transient transfections in human kidney embryonic cells and the characterization by fluorescence microscopy and flow cytometry. We show a clear separation between the ON and OFF mean fluorescent intensity states. Additionally, we adopt the integrated mean fluorescence intensity for the characterization of the circuit and show that this metric is more robust to transfection conditions when compared to the mean fluorescent intensity. To conclude, we present the first implementation of a genetic decoder. This combinational system can be valuable toward engineering higher-order circuits as well as accommodate a multiplexed interface with endogenous cellular functions.

Following technological advancements and integrated municipal solid waste management in recent decades, various methods such as recycling, biotreatment, thermal treatment, and sanitary landfills have been developed and employed. Creating sanitary landfills is a major strategy in the integrated solid waste management hierarchy. It is cheaper and thus more common than other disposal methods. Selecting a suitable solid waste landfill site can prevent adverse ecological and socioeconomic effects. Landfill site selection requires the analysis of spatial data, regulations, and accepted criteria. The present study aimed to use the geographic information system and the analytic hierarchy process to identify an appropriate landfill site for municipal solid wastes in Najafabad (Isfahan, Iran). Environmental and socioeconomic criteria were evaluated through different information layers in the Boolean and fuzzy logics. The analytical hierarchy process was applied for weighing the fuzzy information layers. Subsequently, two suitable sites were identified by superimposing the maps from the Boolean and fuzzy logics and considering the minimum required landfill area for 20 years. However, proximity of these two sites to Tiran (a nearby city) made them undesirable landfill sites for Najafabad. Therefore, due to the existing restrictions in Najafabad, the possibility of creating landfill sites in common with adjacent cities should be further investigated.

Metastasis, initially driven by cells migrating and invading through the local environment, leads to most cancer-associated deaths. Cells can use a variety of modes to move in vitro, all of which depend on Rho GTPases at some level. While traditionally it was thought that Rac1 activity drives protrusive lamellipodia at the leading edge of a polarised cell while RhoA drives rear retraction, more recent work in 3D microenvironments has revealed a much more complicated picture of GTPase dynamics. In particular, RhoA activity can dominate the leading edge polymerisation of actin to form filopodial actin-spike protrusions that drive more invasive cell migration. We recently described a potential mechanism to abrogate this pro-invasive localised leading edge Rac1 to RhoA switch via manipulation of a negative feedback loop that was revealed by adopting a logical modelling approach. Both challenging dogma and taking a formal, mathematical approach to understanding signalling involved in motility may be vital to harnessing harmful cell migration and preventing metastasis in future research.

Draft prepared for a workshop on Early Digital Practices, University Siegen December 2016.; Shannon's 1938 did not got integrated immediately into the circuit designers' practice, a number of circumstances prevented straightforward application. Instead it took about a decade before it was made practical. This paper sketches this slow appropriation.

Recently published experimental work on evolution-in-materio applied to nanoscale materials shows promising results for future reconfigurable devices. These experimental results are based on disordered nanoparticle networks, without a predefined design. The material is treated as a black-box, and genetic algorithms are used to find appropriate configuration voltages to enable a targeted functionality. To support future experimental work, we developed simulation tools for predicting candidate functionalities. One of these tools is based on a neural network model, but the one presented here is based on a physical model. The physical model describes the charge transport between the nanoparticles, which is governed by what is known as the Coulomb blockade effect. The new simulation tool combines a genetic algorithm with Monte-Carlo simulations that are based on this physical model. The code of the new simulation tool has been validated with known results on small deterministically designed nanoparticle networks from literature. The code has also been applied to simulate reconfigurable logic in small k χ k grids of nanoparticles. The results show that the new approach has great potential for partly replacing costly and time-consuming experiments.

In this paper we present a short history of logics: from particular cases of 2-symbol or numerical valued logic to the general case of n-symbol or numerical valued logic. We show generalizations of 2-valued Boolean logic to fuzzy logic, also from the Kleene’s and Lukasiewicz’ 3-symbol valued logics or Belnap’s 4-symbol valued logic to the most general n-symbol or numerical valued refined neutrosophic logic. Two classes of neutrosophic norm (n-norm) and neutrosophic conorm (n-conorm) are defined. Examples of applications of neutrosophic logic to physics are listed in the last section. Similar generalizations can be done for n-Valued Refined Neutrosophic Set, and respectively n-Valued Refined Neutrosopjhic Probability

[EN] In recent years, automation has encroached upon “soft knowledge” fields long considered the exclusive preserve of human agents, particularly in the production and analysis of texts framed in natural language. Like most technological innovations, automation has been embraced with minimal skepticism: mainstream voices have assumed that new technologies, while changing the type of work available, will continue creating new jobs to replace those it renders obsolete, and harsh criticism has been confined mainly to the ideological fringes. There is reason to believe that this optimism is unjustified with respect to the automation of intellectual labor, which may prove to have pernicious consequences both for the market economy and for human values that yield only poorly to abstract calculation. [ES] En los últimos años, la automatización ha invadido zonas del “conocimiento blando” tradicionalmente consideradas como de dominio exclusivo para agentes humanos, sobre todo en cuanto a la producción y análisis de textos enmarcados en el lenguaje natural. Como en la mayoría de las innovaciones tecnológicas, la automatización ha sido adoptada con escaso escepticismo: las corrientes generales han asumido que las nuevas tecnologías, pese a que cambian el tipo de trabajo disponible, seguirán creando nuevos empleos que sustituirán a los obsoletos y las críticas duras se han visto restringidas principalmente a márgenes ideológicos. Hay razones para creer que este optimismo en torno a la automatización del trabajo intelectual no está justificado, lo que podría tener consecuencias perniciosas tanto para la economía de mercado como para los valores humanos que no rinden bien bajo el cálculo abstracto.

We present a unifying semantical and proof-theoretical framework for investigating depth-bounded approximations to Boolean Logic, namely approximations in which the number of nested applications of a single structural rule, representing the classical Principle of Bivalence, is bounded above by a fixed natural number. These approximations provide a hierarchy of tractable logical systems that indefinitely converge to classical propositional logic. The framework we present here brings to light a general approach to logical inference that is quite different from the standard Gentzen-style approaches, while preserving some of their nice proof-theoretical properties, and is common to several proof systems and algorithms, such as KE, KI and Stalmarck?s method.

In this paper, a novel approach to discrete modeling of gene regulatory networks is presented. The approach is based on timed automata and is new in: (i) reflecting discrete abstraction of gene expression with arbitrary granularity, (ii) combining boolean logic with approximation of Hill kinetics. This is achieved by introducing delays that change dynamically with respect to current activity levels of regulating genes. The approach is implemented in UPPAAL and evaluated on benchmark models and on a biological case study.

Sepsis is a syndrome observed in patients combining a documented infection (microbiologically or clinically suspected) with a systemic inflammatory response (Systemic Inflammatory Response Syndrome : SIRS). It may progress to severe sepsis if it is associated with failures of one or more organs. Septic shock is the combination of a severe sepsis and a hemodynamic dysfunction characterized by an acute fall in blood pressure that cannot be corrected by a procedure of vascular filling.Sepsis syndromes represent today the first cause of mortality in intensive care units around the world. This poor survival rate, in particular for the most severe cases, such as septic shock, testifies a real curative therapeutic demand.Based on the assumption that severe sepsis syndromes are the consequence of a loss of control in early mechanisms of inflammatory response regulation, we studied via two complementary approaches the initiation of TLR4 signaling pathway and the intracellular mechanisms contributing to its regulation.First, the use of transcriptomic approaches allowed us to identify the mTOR signaling pathway as discriminating between healthy patients (SIRS induced by the infusion of endotoxins) and patients with severe septic syndromes. We then developed and used logic modeling approaches to in silico simulate the role played by the mTOR signaling pathway in the resolution of an inflammatory response. These encouraging results open perspectives for new therapeutic applications in the field of sepsis; Le sepsis est un syndrome observé chez des patients associant une infection documentée (microbiologiquement ou cliniquement suspectée) à une réponse inflammatoire systémique (Systemic Inflammatory Response Syndrome : SIRS).Celui-ci peut évoluer vers un sepsis sévère s'il est associé à la défaillance d'un ou de plusieurs organes. Le choc septique est l'association d'un état septique grave et d'une défaillance hémodynamique caractérisée par une chute aiguë de la pression artérielle ne pouvant pas être corrigée par une procédure standard de remplissage vasculaire. Les syndromes septiques sont aujourd'hui la première cause de mortalité en unités de réanimation. Cette mortalité élevée, en particulier pour les cas les plus graves tels que les chocs septiques, témoigne d'une absence de traitements curatifs pour cette pathologie. Partant de l'hypothèse que les syndromes septiques graves sont la conséquence d'une perte de contrôle précoce de la régulation de la réponse inflammatoire, nous avons étudié, via deux démarches complémentaires, l'initiation de la voie de signalisation TLR4 et les mécanismes intracellulaires contribuant à sa régulation. Dans un premier temps, l'utilisation d'approches transcriptomiques nous a permis d'identifier la voie de signalisation mTOR comme discriminante entre des patients sains (SIRS induit par l'injection d'endotoxines) et des patients souffrant de syndromes septiques graves. Nous avons ensuite développé et utilisé des techniques de modélisation logique pour simuler in silico le rôle joué par la voie mTOR dans la résolution d'une réponse inflammatoire. Ces résultats encourageants ouvrent des perspectives pour de nouvelles applications thérapeutiques dans le domaine du sepsis

Sepsis is a syndrome observed in patients combining a documented infection (microbiologically or clinically suspected) with a systemic inflammatory response (Systemic Inflammatory Response Syndrome : SIRS). It may progress to severe sepsis if it is associated with failures of one or more organs. Septic shock is the combination of a severe sepsis and a hemodynamic dysfunction characterized by an acute fall in blood pressure that cannot be corrected by a procedure of vascular filling.Sepsis syndromes represent today the first cause of mortality in intensive care units around the world. This poor survival rate, in particular for the most severe cases, such as septic shock, testifies a real curative therapeutic demand.Based on the assumption that severe sepsis syndromes are the consequence of a loss of control in early mechanisms of inflammatory response regulation, we studied via two complementary approaches the initiation of TLR4 signaling pathway and the intracellular mechanisms contributing to its regulation.First, the use of transcriptomic approaches allowed us to identify the mTOR signaling pathway as discriminating between healthy patients (SIRS induced by the infusion of endotoxins) and patients with severe septic syndromes. We then developed and used logic modeling approaches to in silico simulate the role played by the mTOR signaling pathway in the resolution of an inflammatory response. These encouraging results open perspectives for new therapeutic applications in the field of sepsis; Le sepsis est un syndrome observé chez des patients associant une infection documentée (microbiologiquement ou cliniquement suspectée) à une réponse inflammatoire systémique (Systemic Inflammatory Response Syndrome : SIRS).Celui-ci peut évoluer vers un sepsis sévère s'il est associé à la défaillance d'un ou de plusieurs organes. Le choc septique est l'association d'un état septique grave et d'une défaillance hémodynamique caractérisée par une chute aiguë de la pression artérielle ne pouvant pas être corrigée par une procédure standard de remplissage vasculaire. Les syndromes septiques sont aujourd'hui la première cause de mortalité en unités de réanimation. Cette mortalité élevée, en particulier pour les cas les plus graves tels que les chocs septiques, témoigne d'une absence de traitements curatifs pour cette pathologie. Partant de l'hypothèse que les syndromes septiques graves sont la conséquence d'une perte de contrôle précoce de la régulation de la réponse inflammatoire, nous avons étudié, via deux démarches complémentaires, l'initiation de la voie de signalisation TLR4 et les mécanismes intracellulaires contribuant à sa régulation. Dans un premier temps, l'utilisation d'approches transcriptomiques nous a permis d'identifier la voie de signalisation mTOR comme discriminante entre des patients sains (SIRS induit par l'injection d'endotoxines) et des patients souffrant de syndromes septiques graves. Nous avons ensuite développé et utilisé des techniques de modélisation logique pour simuler in silico le rôle joué par la voie mTOR dans la résolution d'une réponse inflammatoire. Ces résultats encourageants ouvrent des perspectives pour de nouvelles applications thérapeutiques dans le domaine du sepsis

none 4 no In geotechnical modelling, some minor stratigraphic features are usually discarded in order to simplify the problem, avoiding to deal with further uncertainties about their position, thickness and lateral extent. The study proposes a new method based on the stochastic generation of different soil layers configurations, following a boolean logic: the material is either matrix or layer (i.e., gravel lenses in a clay-rich matrix).The method has been called BoSG (Boolean Stochastic Generation). The methodology allows to randomize the presence of a specific material interdigitated in a uniform matrix thus enabling to gather a dataset which could be analysed automatically, in order quantify the error associated with the adopted simplification.The commercial codes FLAC and FLAC3D were used for the geotechnical modelling. A specifically-coded MatLab program allows to generate randomly the different soil configurations and then to automate the computation with the commercial software in order to maximize the sample number.In this paper the methodology is applied with reference to a simplified slope in 2D and in 3D. Results show that within a low resistance matrix, the presence of layers with higher friction angle can significantly affect significantly the stability and the displacement pattern of an unstable slope. Therefore, a method to investigate the influence of the spatial distribution of these layers can be particularly useful. Bossi, G.; Borgatti, L.; Gottardi, G.; Marcato, G. Bossi, G.; Borgatti, L.; Gottardi, G.; Marcato, G.

Shannon's 1938 did not got integrated immediately into the circuit designers' practice, a number of circumstances prevented straightforward application. Instead it took about a decade before it was made practical. This paper sketches this slow appropriation.

Fluorescence resonance energy transfer (FRET) is a promising means of enabling information processing in nanoscale devices, but dynamic control over exciton pathways is required. Here, we demonstrate the operation of two complementary switches consisting of diffusive FRET transmission lines in which exciton flow is controlled by DNA. Repeatable switching is accomplished by the removal or addition of fluorophores through toehold-mediated strand invasion. In principle, these switches can be networked to implement any Boolean function.

With population increase, lack of conventional fresh water resources and uncertainties due to climate change, there is growing interest in the arid and semi-arid areas to increase groundwater recharge with recycled water. Finding the best locations for artificial recharge of groundwater in such areas is one of the most crucial design steps to guarantee the long life and the sustainability of these projects. This study presents two ways to go about performing analysis; creating a suitability map to find out the suitability of every location on the map and another way is querying the created data sets to obtain a Boolean result of true or false map. These techniques have been applied on Sadat Industrial City which is located in a semi arid area in the western desert fringes of The Nile delta in the north west of Egypt. Thematic layers for number of parameters were prepared from some maps and satellite images and they have been classified, weighted and integrated in ArcGIS environment. By the means of the overlay weighted model in ArcGIS a suitability map which is classified into number of priority zones was obtained and it could be compared with the obtained true-false map of Boolean logic. Both methods suggested mostly the northern parts of the city for groundwater recharge; however the weighted model could give more accurate suitability map while Boolean logic suggested wider ranges of areas. This study recommends Boolean logic as a first estimator for locating the best locations as it is easier and not time consuming, while the overlay weighted model for more accurate results.

Computing with words (CWW) relies on linguistic representation of knowledge that is processed by operating at the semantical level defined through fuzzy sets. Linguistic representation of knowledge is a major issue when fuzzy rule based models are acquired from data by some form of empirical learning. Indeed, these models are often requested to exhibit interpretability, which is normally evaluated in terms of structural features, such as rule complexity, properties on fuzzy sets and partitions. In this paper we propose a different approach for evaluating interpretability that is based on the notion of cointension. The interpretability of a fuzzy rule-based model is measured in terms of cointension degree between the explicit semantics, defined by the formal parameter settings of the model, and the implicit semantics conveyed to the reader by the linguistic representation of knowledge. Implicit semantics calls for a representation of user’s knowledge which is difficult to externalise. Nevertheless, we identify a set of properties – which we call “logical view” – that is expected to hold in the implicit semantics and is used in our approach to evaluate the cointension between explicit and implicit semantics. In practice, a new fuzzy rule base is obtained by minimising the fuzzy rule base through logical properties. Semantic comparison is made by evaluating the performances of the two rule bases, which are supposed to be similar when the two semantics are almost equivalent. If this is the case, we deduce that the logical view is applicable to the model, which can be tagged as interpretable from the cointension viewpoint. These ideas are then used to define a strategy for assessing interpretability of fuzzy rule-based classifiers (FRBCs). The strategy has been evaluated on a set of pre-existent FRBCs, acquired by different learning processes from a well-known benchmark dataset. Our analysis highlighted that some of them are not cointensive with user’s knowledge, hence their linguistic representation is not appropriate, even though they can be tagged as interpretable from a structural point of view.

Los motores de búsqueda son objetos culturales que presentan, como toda herramienta destinada a la organización y circulación de la información, desafíos de carácter semiótico y epistémico así como sesgos ideológicos. El presente artículo analiza el modo en que alumnos de escuela primaria conceptualizan el modo de funcionamiento de un buscador que usan asiduamente. La perspectiva teórica adoptada considera los aportes de la tradición sociohistórica vigotskiana y del constructivismo relacional piagetiano. El diseño metodológico se inscribe en un estudio cualitativo de casos en el que se emplean dos instrumentos de recolección: observaciones de clase (en el aula y en la sala de informática), y entrevistas clínico-críticas posteriores. Los resultados evidencian que en situaciones didácticas donde el buscador se convierte en objeto de análisis, los alumnos toman conciencia de que la construcción de las palabras clave los ubica en una situación de escritura para un "lector robot" que no coopera en la interpretación. Ante este problema, se proponen usar una sintaxis en la que las palabras se enlazan con signos diversos a los que adjudican funciones vinculadas con sus conocimientos del lenguaje natural. La contradicción se produce porque los motores de búsqueda utilizan una lógica más próxima a las matemáticas.Search engines are cultural objects which represent semiotic and epistemological challenges as well as ideological bias, like every tool destined to the organization and circulation of information. This article analyzes the conceptualizations of elementary school students about a search engine that frequently used. The adopted theoretical perspective considers both the contribution of the Vigotskian sociohistorical tradition and the Piagetian relational constructivism. The methodological design consisted of a qualitative study of cases. Two data collection instruments are used: observations in the classroom and in the computer lab and post-clinical-critical interviews. The results show that in those didactic situations where the search engine becomes an object of analysis, the students develop awareness of the fact that the construction of keywords places them in a writing situation for a "robot reader" that does not cooperate in the interpretation. In view of this problem, they propose to use a syntax in which the words connect with different signs. But the students give to these signs functions linked with their own knowledge of the natural language. The contradiction occurs because the search engines use logic close to the mathematical languages.

Подається загальна концепція базових функціонально-аналітичних операцій в середовищі геоінформаційних систем. Обговорюються деякі особливості окремих ГІС-операцій, які доцільно використовувати в предметній галузі геоекології. На прикладах вирішення регіональних геоекологічних задач доводиться, що вибірки та запити по інформації, що знаходиться в БД ГІС, є ефективним засобом, який може бути успішно застосований як до просторових, так і до атрибутивних даних, щоб, зокрема, сприяти досягненню цілей територіального природоохоронного менеджменту.Наводяться релевантні приклади ГІС-операцій з посиланням на графічний інтерфейс користувача програмного забезпечення відомої ГІС-платформи., The paper represents the general concept of the GIS analytical capabilities provided through basic GIS-operations. Some particular procedures of these operations are described and discussed due to the geoecological subject area. Few examples of the regional environmental tasks are provided with their solutions through GIS-operations. It is proved that data selections and queries to both spatial and non-spatial information are the effective method, which can be performed for the areal environmental management.The paper provides some relevant interface examples from a well-known GIS-platform., Излагается общая концепция базовых функционально-аналитических операций в среде геоинформационных систем. Обсуждаются некоторые особенности отдельных ГІС-операций, которые целесообразно использовать в предметной отрасли геоэкологии. На примерах решения региональных геоэкологических задач обосновывается, что выборки и запросы по информации, которая находится в БД ГИС, являются эффективным инструментом, который может быть успешно применен как к пространственным, так и к атрибутивным данным. В частности, для того, чтобы способствовать достижению целей территориального природоохранного менеджмента. Приводятся релевантные примеры ГІС-операций с ссылкой на графический интерфейс пользователя программного обеспечения известной ГІС-платформы.

The ability to map environmental signals onto distinct internal physiological states or programmes is critical for single-celled microbes. A crucial systems dynamics feature underpinning such ability is multistability. While unlimited multistability is known to arise from multi-site phosphorylation seen in the signalling networks of eukaryotic cells, a similarly universal mechanism has not been identified in microbial signalling systems. These systems are generally known as two-component systems comprising histidine kinase (HK) receptors and response regulator proteins engaging in phosphotransfer reactions. We develop a mathematical framework for analysing microbial systems with multi-domain HK receptors known as hybrid and unorthodox HKs. We show that these systems embed a simple core network that exhibits multistability, thereby unveiling a novel biochemical mechanism for multistability. We further prove that sharing of downstream components allows a system with n multi-domain hybrid HKs to attain 3n steady states. We find that such systems, when sensing distinct signals, can readily implement Boolean logic functions on these signals. Using two experimentally studied examples of two-component systems implementing hybrid HKs, we show that bistability and implementation of logic functions are possible under biologically feasible reaction rates. Furthermore, we show that all sequenced microbial genomes contain significant numbers of hybrid and unorthodox HKs, and some genomes have a larger fraction of these proteins compared with regular HKs. Microbial cells are thus theoretically unbounded in mapping distinct environmental signals onto distinct physiological states and perform complex computations on them. These findings facilitate the understanding of natural two-component systems and allow their engineering through synthetic biology.\ud

Serviço Nacional de Aprendizagem Comercial Learning is a complex process involving many variables, including the environment, social context, educational methodologies, teachers and students knowledge, among others. Highlighting the diversity of students in this process, this work presents the development of an Adaptive Learning Object using techniques of Adaptive Hypermedia and Artificial Intelligence as well as its application in classrooms, in beginners undergraduate classes, as a case study. For this purpose, this case study focuses on the learning of Algebra and Boolean Logic concepts, which has direct application in various disciplines that belong to the curriculum of several courses, like Electrical Engineering, Computer Science, Technology in Computer Networks, Systems Analysis and Development, Telecommunications, among others. By pointing out the difficulty of learning in Boolean Algebra and Logic-based subjects, this work aims to provide an improvement of educational performance in heterogeneous classrooms. Since the learning process is a challenging, interactive and iterative activity that involves a variety of aspects, it is intended that the application of adaptive techniques to a Learning Object can facilitate the skills development process by students. A aprendizagem é um processo complexo que envolve diversas variáveis, desde o ambiente, o contexto social, as metodologias educacionais, o conhecimento do professor e do aluno, entre outras. Destacando a heterogeneidade dos alunos nesse processo, este trabalho apresenta o desenvolvimento de um Objeto de Aprendizagem Adaptativo usando técnicas de Hipermídia Adaptativa e Inteligência Artificial, bem como sua aplicação em salas de aula, em turmas iniciantes da graduação de nível superior, como estudo de caso. Para tal finalidade, este estudo de caso concentra-se na aprendizagem de conceitos de Álgebra e Lógica Booleana, que tem aplicação direta em diversas disciplinas que compõem o currículo dos cursos de Engenharia Elétrica, Ciência da Computação, Tecnologia em Redes de Computadores, Análise e Desenvolvimento de Sistemas, Telecomunicações, entre outros. Evidenciando a dificuldade de aprendizagem dos alunos em disciplinas que utilizem Álgebra e Lógica de Boole, esta proposta de trabalho visa proporcionar a melhoria do desenvolvimento do desempenho educacional em salas de aula heterogêneas. Uma vez que o processo de aprendizagem é uma atividade desafiadora, interativa e iterativa que envolve uma variedade de aspectos, pretende-se que a aplicação de técnicas de adaptatividade a um Objeto de Aprendizagem possa facilitar o processo de desenvolvimento de competências ao educando.

The so-called classical limit of quantum mechanics is generally studied in terms of the decoherence of the state operator that characterizes a system. This is not the only possible approach to decoherence. In previous works we have presented the possibility of studying the classical limit in terms of the decoherence of relevant observables of the system. On the basis of this approach, in this paper we introduce the classical limit from a logical perspective, by studying the way in which the logical structure of quantum properties corresponding to relevant observables acquires Boolean characteristics., 12 pages

We discuss the role and importance of dynamics in the brain and biological neural networks, and argue that dynamics is one of the main missing elements in conventional Boolean logic and circuits. We summarize a simple dynamics based computing method, and categorize different techniques that we have introduced to realize logic, functionality, and programmability. We discuss the role and importance of coupled dynamics in networks of biological excitable cells, and then review our simple coupled dynamics based method for computing. In this paper, for the first time, we show how dynamics can be used and programmed to implement computation in any given base, including but not limited to base two.

The mesoscopic activity of the brain is strongly dynamical, while at the same time exhibits remarkable computational capabilities. In order to examine how these two features coexist, here we show that the patterns of synchronized oscillations displayed by networks of neural mass models, representing cortical columns, can be used as substrates for Boolean-like computations. Our results reveal that the same neural mass network may process different combinations of dynamical inputs as different logical operations or combinations of them. This dynamical feature of the network allows it to process complex inputs in a very sophisticated manner. The results are reproduced experimentally with electronic circuits of coupled Chua oscillators, showing the robustness of this kind of computation to the intrinsic noise and parameter mismatch of the coupled oscillators. We also show that the information-processing capabilities of coupled oscillations go beyond the simple juxtaposition of logic gates. Work supported by the Ministerio de Economia y Competividad (Spain) and FEDER through projects FIS2012-37655-C02-01 and FIS2013-41057-P. JG acknowledges support from the ICREA Academia programme and from the Generalitat de Catalunya (project 2014SGR0974)

Engineering biological cells to perform computations has a broad range of important potential applications, including precision medical therapies, biosynthesis process control, and environmental sensing. Implementing predictable and effective computation, however, has been extremely difficult to date, due to a combination of poor composability of available parts and of insufficient characterization of parts and their interactions with the complex environment in which they operate. In this paper, the author argues that this situation can be improved by quantitative signal-to-noise analysis of the relationship between computational abstractions and the variation and uncertainty endemic in biological organisms. This analysis takes the form of a ΔSNRdB function for each computational device, which can be computed from measurements of a device’s input/output curve and expression noise. These functions can then be combined to predict how well a circuit will implement an intended computation, as well as evaluating the general suitability of biological devices for engineering computational circuits. Applying signal-to-noise analysis to current repressor libraries shows that no library is currently sufficient for general circuit engineering, but also indicates key targets to remedy this situation and vastly improve the range of computations that can be used effectively in the implementation of biological applications.

This article attempts to study the notion of Transcendence from the perspective of Quantum Mechanics. The Laws of Physics reveal that nature is dynamic and it is understood in terms of mathematical models and relations. Uncertainty is a fundamental feature of the Quantum reality. Quantum structural pattern is the fundamental nature of reality, whether observable or unobservable. Transcendence in Quantum Mechanics is a dynamic concept which must be understood in terms of dynamic state. Transcendencein Quantum Mechanics is the process of uncovering deep treasures of the reality, which is dynamic. A movement toward the deeper reality of God is what is behind the notion of transcendence. Este artículo intenta estudiar la noción de Transcendencia desde la perspectiva de la mecánica cuántica. Las leyes de la física revelan que la naturaleza es dinámica y es comprendida en términos de modelos matemáticos y relaciones. La incertidumbre es una propiedad fundamental de la realidad cuántica. El patrón cuántico estructural es la naturaleza fundamental de la realidad, bien sea observable o no observable. La Transcendencia en la Mecánica Cuántica es un concepto dinámico que debe ser comprendido en términos de un estado dinámico. La transcendencia en la mecánica cuántica es el proceso de descubrimiento de tesoros profundos de una realidad que es dinámica. Por ello, un movimiento hacia la realidad más profunda de Dios se halla tras la noción de Transcendencia.