Search

Background and Context: Learners struggle with conceptual understanding of introductory programming concepts such as variables, expressions, and loops. Objective: We examine whether and how designed activities for conceptual exploration support preliminary engagement with and learning of foundational and often hard-to-grasp programming concepts for students in grades 6–8. Method: Drawing on principles from dynamic mathematics, we developed a suite of non-programming digital and unplugged activities embedded in a curriculum before students engage in Scratch block-based programming. We conducted empirical research in three middle school classrooms in diverse urban US schools and examined student performance through mixed qualitative and quantitative methods. Findings: Learning gains were significant and not predicted by grade, gender or prior academic preparation. Free-choice projects of students showed statistically greater (correct) use of key concepts compared to those not in the study. Implications: Our work demonstrates the promise of novel approaches such as interactive non-programming activities for deeper understanding of programming concepts. [ABSTRACT FROM AUTHOR]

In-memory computing based on memristive logic is considered as a prospective non von Neumann computing paradigm. In this letter, we systematically analyze the four-variable logic method and map it into the operation of two anti-serial complementary memristors in the crossbar array architecture. Arbitrary Boolean logic can be implemented within three cycles with the experimental evidence of reconfigurable NAND, NOR, and XOR logic using Pt/HfO2/TiN devices. Taking advantage of the functional flexibility, a parallel 1-bit full adder that can be realized in 8 cycles within a $\textsf {4}\times \textsf {3}$ array has been designed and verified in simulation. [ABSTRACT FROM AUTHOR]

Precise control of gene expression with small‐molecular or physical inducers has been a central aim of synthetic biology in recent decades, and has led, for example, to dramatic improvements in the production of protein therapeutics. However, the number of inputs for inducible promoters and gene circuits is still limited, and new orthogonal inducers are needed to support the construction of more complex programmable systems in the fields of bioengineering and biocomputing. Here, two new gene switches inducible by the antibiotic simocyclinone D8 (SD8) and the flavonoid luteolin in mammalian cells are presented. Streptomyces antibioticus Tü 6040 has evolved the DNA gyrase inhibitor SD8, which, through the bacterial TetR‐like transcriptional repressor SimR, also regulates the multidrug efflux pump SimX. Taking advantage of SimR, as well as the luteolin‐binding TetR‐like transcriptional repressor EmrR from Sinorhizobium meliloti, we optimized the amounts of transfected genes and DNA operator sites to engineer highly effective, orthogonal transcriptional OFF‐ as well as ON‐switches triggered by SD8 and/or luteolin. We confirmed that SD8 and luteolin are not cytotoxic at the concentrations required for switching, and demonstrated the functionality of these gene switches in a range of biotechnologically relevant cell lines. These switches were combined to generate OR and AND Boolean logic gates, and we confirmed their modularity by the addition of the vanillic acid‐responsive transcriptional repressor VanR to generate a three‐input AND gate. These additions to the panoply of inducers available for synthetic biology are expected to facilitate advances in the fields of biocomputing, biopharmaceutical manufacturing, and biomedicine. © 2018 The Authors. AIChE Journal published by Wiley Periodicals, Inc. on behalf of American Institute of Chemical Engineers. AIChE J, 64: 4237–4246, 2018 [ABSTRACT FROM AUTHOR]

Abstract This paper devises a novel Analog to Digital Converter (ADC) framework for energy-aware acquisition of analog signals with Logic-in-Memory capabilities. The beyond-CMOS hardware architecture has been designed to minimize the overall cost of signal acquisition. Spin-Hall Effect driven Domain Wall Motion (SHE-DWM) devices are utilized to realize the proposed framework called Spin-based Logic-In-Memory ADC (SLIM-ADC). Our simulation results indicate that the proposed SLIM-ADC offers ∼200 fJ energy consumption on average for each analog conversion or logic operation with up to 1 GHz speed. Furthermore, our results indicate that the proposed SLIM-ADC outperforms other state of the art spin-based ADC designs by offering ∼5.45 mW improved power dissipation on average. Additionally, a Majority Gate (MG)-based Full-Adder (MG-FA) is implemented using the proposed SLIM-ADC. Our results show that the proposed MG-FA offers ∼2.9-fold reduced power dissipation on average and ∼1.7-fold reduced delay on average compared to the state of the art Full-Adder designs reported herein. [ABSTRACT FROM AUTHOR]

Significant methodological progress has taken place to quantify the reliability of networked systems over the past decades. Both numerical and analytical methods have enjoyed improvements via a host of advanced Monte Carlo simulation strategies, state space partition methods, statistical learning, and Boolean functions among others. The latter approach exploits logic to approximate network reliability assessments efficiently while offering theoretical error guarantees. In parallel, physicists have made progress modeling complex systems via tensor networks (TNs), particularly quantum many-body systems. Inspired by the representation power of quantum TNs, this paper offers a new approach to efficiently bound all-terminal network reliability (ATR). It does so by exactly solving a related network Boolean satisfiability counting problem (or # SAT NET ), represented as a TN, by counting configurations in which all network nodes are connected to at least a neighbor. Our # SAT NET counting outperforms state-of-the-art approximate and exact counters for the same problem as shown for challenging two-dimensional lattice networks of increasing size. While the over-counting from # SAT NET increases exponentially relative to the number of configurations that satisfy ATR problems (or # REL AT ), the bias is predictable for ideal networks, such as lattices, and our upper bound is guaranteed with 100 % confidence. This bound also cuts through the upper bound from other analytical methods for the ATR problem, such as recursive decomposition algorithms (RDA)—a desirable feature when exact or approximate methods with error guarantees fail to scale. Clearly, our goal is not to solve the general stochastic network reliability problem, which remains a # P problem in the computational complexity hierarchy (i.e., a counting version of non-deterministic polynomial time [ NP ] problems for which there is no known polynomial time algorithms to find their solutions). Instead, we present a novel bounding technique for network reliability, which relies on exactly counting configurations for our network satisfiability problem by using quantum computing principles. We offer a proof for the counting bound to hold in a connectivity ATR sense, and illustrate trends with cubic and lattice networks. Overall, the proposed method provides an alternative to available system reliability assessment approaches, and opens directions for future research, especially as discoveries in logic, algebraic projections, and quantum computation continue to accrue. [ABSTRACT FROM AUTHOR]

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’. 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).

Building off an earlier study, which examined whether or not it was beneficial to teach Boolean logic to introductory students, the present study examines the efficacy of Boolean OR searching in more advanced search strategies, for example, capstone projects and graduate theses and dissertations. Results show that both simple and advanced Boolean searches yield relevant results. Based on relevance, there is no compelling evidence that either search is superior. To capture all the literature on a topic, however, it is important that upper-level students know the relevant databases for their discipline and perform multiple searches. Results can help inform whether teaching Boolean search skills to upper-division students in disciplinary contexts is time well spent. [ABSTRACT FROM AUTHOR]

Shahr-e-Babak town lacks sanitary landfill for waste disposal. This paper, therefore, deals with siting a proper landfill using GIS software and Fuzzy and Boolean Logic. Hence, several relevant layers including distance to the town, distance to the ways, land-use, hydrography, soils, lithology, faults, as well as groundwater direction, aesthetic aspects and wind direction were prepared. Afterwards, using Boolean and Fuzzy logics, these layers were mixed and several proper sites were selected. From these, site No1, located at 5 Km southeast of the town was ranked first. This site, compared to others, is closer to the road, which makes the transportation of waste more feasible. At the same time it is not too far from the city. Its distance to the town and to a road is suitable and lies down side to the winds as well as to the groundwater flow.

In-memory computing architecture is an emerging revolutionary computing paradigm that can break the von Neumann bottleneck. Computing methodology and circuit codesign using the CMOS compatible 1T1R resistive random access memory (RRAM) integration structure is presented in this paper. Functionally complete Boolean logic and arithmetic functions are experimentally demonstrated. With a single 40-nm CMOS process 1T1R unit, each of the 16 binary logics can be realized in two logic steps with an additional readout step for cascading, which shows functional reconfiguration and low computational complexity. Up to 107 cycles of NAND and XOR logic operations are performed to validate the correctness and reliability. Moreover, several fundamental adder circuits are designed and experimentally demonstrated in 1T1R devices as the proof of concept of the 1T1R computing architecture. The adders proposed in this paper include a ripple-carry adder and its optimized design and a carry-select adder, which all show promising advantages in nonvolatility, computation speed, and circuit area. This paper reports the most complex yet efficient RRAM-based 8-bit addition function experimentally so far and lays a solid foundation for constructing the future in-memory computing architecture. [ABSTRACT FROM AUTHOR]

The municipal waste management has always been one of the most challenging environmental concerns. Today, although different strategies have been developed, sanitary disposal of municipal waste is still considered as one of the most widely used alternatives, especially in developing countries such as Iran. To investigate the land capability of Pishva, for landfill sitting, the important criteria were categorized in two groups of ecological and socioeconomic and then a multi-criteria decision-making model was used with decision-making trial and evaluation decision-making trial and evaluation (DEMATEL)-analytical network process (ANP) approach. First and foremost, the interaction of criteria was determined implementing DEMATEL. It was found that the soil depth criterion not only is the most effective but also is the most influenced one. Moreover, ANP structure was developed to weigh the criteria. In comparison to socioeconomic criteria, ecological ones play a more significant role. Afterwards, factor maps and constraints were standardized using fuzzy and Boolean logic, respectively, and all layers were combined to generate the final capability map of Pishva applying WLC method. The capability map showed that 71% of the area is not capable of landfilling, and only 5% of Pishva has a high capability. The results proved the great effectiveness of the methods proposed in this study. [ABSTRACT FROM AUTHOR]

Abstract: Memristive devices acting as high‐performance in‐memory computing fabrics have attracted much attention for nonvolatile parallel architectures to break the von Neumann bottleneck. Here, for the first time, a nonvolatile digital logic system with three‐terminal Pt/SiO2/Pt/Ag/GeTe/Ta one‐memristor‐one‐resistor (1M1R) structure is presented. Programmable nonvolatile Boolean logic gates and clocked sequential logic blocks including D latch and D flip‐flop are experimentally implemented, based on which a 4‐bit linear‐feedback shift register with timing design is functionally verified in simulation. With information generation, processing, transmission, and storage performing within the same 1M1R‐based logic blocks, these results consolidate the feasibility of building memristive digital computing system for future non‐von Neumann computing. [ABSTRACT FROM AUTHOR]

Researchers have investigated different approaches to maintain the minimum cost and effort in regression testing. Here, test suite reduction is a common technique to decrease the cost of regression testing by removing the redundant test cases from the test suite and then, obtaining a representative set of test cases that still yield a high level of code coverage. Accordingly, here, the authors have developed two various techniques for test suite reduction. In the first technique, ATAP measure is newly developed to find the reduced test suite with the help of greedy search algorithm. In the second technique, DIV‐TBAT (DIVersity‐based BAT) algorithm is newly devised based on the mechanisms of Boolean logic within BAT algorithm which improve diversity during the search process. The proposed techniques are experimented using eight programs from SIR subject programs and the performance study is conducted using nine different evaluation metrics based on different research questions. The comparative analysis is performed with the existing algorithms like GreedyRatio, GreedyEIrreplaceability, diversity‐based genetic algorithm, TBAT, and TAP, to prove the performance improvement over the eight software programs considered. [ABSTRACT FROM AUTHOR]

A consensus among logically conflicting agents is defined as a subset of all the information conveyed by the agents such that this subset does not conflict with the information of any of the agents. Hopefully, each agent might be inclined to endorse such a consensus since this latter one does not conflict with the agent’s own information. This form of consensus is investigated from a practical computational point of view within an extended Boolean logic-based knowledge representation framework. A method that is based on a single step discrete optimisation process to compute one maximal consensus is shown viable even for very large information sets. Interestingly, we allow each agent to require some additional hypothetical – possibly mutually conflicting – information to be point-wise compatible with any consensus. [ABSTRACT FROM AUTHOR]

The quantum-dot cellular automata (QCA) computing paradigm presents great promise as a potential strategy for future nanocomputing devices. Perhaps the greatest challenge facing the QCA architecture is finding a robust wire crossing strategy. In this paper, the recently introduced QCA signal distribution grid is extended to carry out generalized sum-of-products and product-of-sums calculations that are performed concurrently with signal distribution. The new signal calculation grid is capable of performing an arbitrary number of simultaneous programmable Boolean operations on an arbitrary number of inputs, and the time required to perform all of these parallel calculations is just seven clock cycles. [ABSTRACT FROM AUTHOR]

Anion sensing characteristics of a pyrazolyl-bis-benzthiazol-based Ru(II)-bipyridine complex is analyzed through Boolean, fuzzy logic, ANN and ANFIS tools. [Display omitted] • Multi-channel anion sensing characteristics of a Ru(II)-bipyridine complex containing 3,5-bis (benzthiazol-2-yl)pyrazole motif. • Absorption and emission spectral as well as electrochemical properties of the complex are substantially altered in presence of selected anions. • The complex can function as anion- and acid-induced molecular switch. • The absorption and emission spectral outputs of the complex in presence of anions and acid are employed to mimic Boolean logic function. • Deep learning tools such as Fuzzy logic, artificial neural networks and adaptive neuro-fuzzy inference system are implemented to envisage the full anion sensing aspects of the complex. Multi-channel anion sensing characteristics of a Ru(II) complex of the form [(bpy) 2 Ru (Hpzbzth)](ClO 4) 2 (1) {bpy = 2,2′-bipyridine and Hpzbzth = 3,5-bis(benzthiazol-2-yl)pyrazole} has been carried out in this work and analyzed through multiple machine learning tools. The complex possesses one pyrazole NH proton in its outer sphere which upon interaction with specific anions yields considerable change in its photo-redox behaviours. The anion sensing aspect of the complex is systematically investigated in acetonitrile through absorption, steady state and time-resolved emission spectroscopy as well as by square-wave (SWV) voltammetry. In absence of anions, the complex displays emission and represents the "on-state", while complete quenching of emission takes place in presence of basic anions and designates the "off-state" of the system. The initial state of the complex could also be restored upon addition of acid and the process is reversible. Essentially, the complex acts as anion- and acid-induced molecular switches. The absorption, emission and electrochemical outputs of the complex in presence of anions and acid are employed to mimic different types of Boolean and Fuzzy logic (FL) functions. Additionally, we implemented herein different deep learning tools such as artificial neural networks (ANNs) and adaptive neuro-fuzzy inference system (ANFIS) to envisage the full anion sensing aspects of the complex. The outcomes of the three models are compared and also tallied with the experimental results. [ABSTRACT FROM AUTHOR]