Logic Transformation Research Articles

Оценка надежности системы из элементов с тремя состояниями с использованием ПК АРБИТР

The article deals with reliability assessment methods for systems with three-state elements. It is shown that further development of conventional logic-and-probabilistic methods (LPM) eliminates the LPM deficiencies such as analysis of only two element states and assumption of their independency. Two models of element failure impact on the system reliability are shown which demonstrate the principles of reliability assessment using the ARBITER software which incorporates capabilities of algebra of disjoint event groups and is based on the general logic-and-probabilistic method (GLPM). Description of logic and probabilistic function transformations for disjoint events is shown in the annexes.

Customized and automated routing repair toolset towards side-channel analysis resistant dual rail logic

Dual-rail Precharge Logic (DPL) has been widely studied as an effective countermeasure category for mitigating Side Channel Attack (SCA) threats, where unwanted physical leakages from running crypto devices are inspected and analyzed to retrieve confidential data. DPL protocol requires compensated behavior between the corresponding rails, which differs from conventional logic principles. Thus it needs unusual design flows with repetitive and tedious workload. In this article, we present a custom execution tool to automatically realize a dual rail logic. This controllable and automated design flow relies on Xilinx FPGA platforms, to obtain dual rails with highly symmetric networks. The tool is able to automate the logic transformation from a raw single rail on Xilinx Design Language (XDL) to the Precharge Absorbed DPL (PA-DPL) format. Users can fully or partially convert the circuit in arbitrary placement schemes, without concerning the routing conflicts. Another significance is that this proposal is potentially to be used to other circuits that require precise routing control. SCA Security verification to an 8-bit AES coprocessor on SASEBO-GII indicates enhanced security grade due to the rigorous routing networks achieved by the repair process. Timing analysis further demonstrates that the net delay differences between complementary nets are minimized.

Sequence Number Alteration by Logical Transformation (SALT): A Novel Method for Defending Session Hijacking Attack in Mobile Ad hoc Network

Sequence Number Alteration by Logical Transformation (SALT): A Novel Method for Defending Session Hijacking Attack in Mobile Ad hoc Network

Sociomaterial Negotiation of Conflicting Institutional Logics at the Swedish Migration Board

This study combines the institutional logics perspective with a sociomaterial lens to explore how a new element of an institutional logic is negotiated and manifested in sociomaterial practic-es at the micro-level of organizing. Building on recent research emphasizing the role of agency in the micro-level dynamics and use of logics, we show how the interpretive flexibility of a new and contested element of a logic (Lean Practices) is used to negotiate the influence of competing institutional logics. Moreover, by showing how the development and implementation of a new information system intensifies the negotiation between conflicting institutional logics and manifests meanings in daily work routines, our study sheds light on the constitutive role of information technologies in the negotiation and transformation of institutional logics. While previous research has concentrated on processes of translation between global ideas and local context, this study recognizes how local negotiations and adaptations of new elements such as management concepts can be understood as sociomaterial enactments.

Institutional Complexity in a Transition Field: Responsible Investment in Asset Management (WITHDRAWN)

This paper answers recent calls for more comprehensive research on the processes underlying institutional complexity. We highlight that a key neglect in previous research is that it has tended to study how institutional change can occur in mature and emergent fields wherein logics are highly ‘theorized’. However, no attention has been paid to situations wherein institutional complexity is especially salient; that is, when it is triggered by a logic that is not yet theorized. This paper aims to address this neglect by exploring the field-level dynamics arising from institutional complexity in mature fields that face substantial transformation with the emergence of an untheorized logic: what we refer to as ‘transition fields’. It does so by means of an abductive exploratory case study of the development of Responsible Investment within the Asset Management industry in Europe. We find that organizations in a transition field make sense of complexity by undergoing a process of logic assimilation, which has two core mechanisms: (1) logic theorizationand (2) logic-archetype elaboration. We further find that this process is facilitated by an enabling organization that participated in creating an institutional infrastructure for the new sustainability logic and that the creation and elaboration of tools, models, and governance structures mediated the transformation of logics and their practices.

Generation and validation of traces between requirements and architecture based on formal trace semantics

The size and complexity of software systems make integration of the new/modified requirements to the software system costly and time consuming. The impact of requirements changes on other requirements, design elements and source code should be traced to determine parts of the software to be changed. Considerable research has been devoted to relating requirements and design artifacts with source code. Less attention has been paid to relating requirements (R) with architecture (A) by using well-defined semantics of traces. Traces between R&A might be manually assigned. This is time-consuming, and error prone. Traces might be incomplete and invalid. In this paper, we present an approach for automatic trace generation and validation of traces between requirements (R) and architecture (A). Requirements relations and architecture verification techniques are used. A trace metamodel is defined with commonly used trace types between R&A. We use the semantics of traces and requirements relations for generating and validating traces with a tool support. The tool provides the following: (1) generation and validation of traces by using requirements relations and/or verification of architecture, (2) generation and validation of requirements relations by using traces. The tool is based on model transformation in ATL and term-rewriting logic in Maude.

ECR

Rewiring is known to be a class of logic restructuring technique that is at least equally powerful in flexibility compared to other logic transformation techniques. Especially it is wiring sensitive and is particularly useful for interconnect-based circuit synthesis processes. One of the most well-studied rewiring techniques is the ATPG-based Redundancy Addition and Removal (RAR) technique which adds a redundant alternative wire to make an originally irredundant target wire become redundant and thus removable. In this article, we propose a new Error-Cancellation-based Rewiring scheme (ECR) which can also identify non-RAR-based rewiring operations with high efficiency. In ECR scheme, it is not necessary for alternative wires to be redundant. Based on the notion of error cancellation, we analyze and reformulate the rewiring problem, and a more generalized rewiring scheme is developed to detect more rewiring cases which are not obtainable by existing schemes while it still maintains a low runtime complexity. Comparing with the most recent non-RAR rewiring tool IRRA, the total number of alternative wires found by our approach is about doubled (202%) while the CPU time used is just slightly more (8%) upon benchmarks preoptimized by ABC’s rewriting. Our experimental results also suggest that the ECR engine is more powerful than IRRA in FPGA technology mapping.

Quantifying the computational efficacy of nanocomputing channels

Information-theoretic computational efficacy measures are introduced and applied to the analysis of interacting effects of noise and structural randomness in nanocomputing channels. Two complementary measures–the computational fidelity and representational faithfulness–are shown together to quantify the efficacy with which a particular noisy computing channel implements a specified logical transformation. The statistics of these two measures, evaluated for an ensemble of nanocomputing channels with random sample-to-sample structural variations, allows quantitative characterization of the interacting effects of transient noise and structural randomness in the channel ensemble. Application of these efficacy measures is illustrated for artificial nanocomputing channels–noisy quantum-dot cellular automata arrays with random defects–although they can be used to quantify the computational efficacy of a wide variety of artificial or natural nanoscale networks with computational capabilities.

Exploring the Role of Objects in the Transformation of Logics: A practice perspective

This article aims to examine the role of objects in the transformation of institutional logics at the practice level. In particular, it explores how financial actors use, transform and are constrained by their ‘market devices’ – defined as a range of instruments, models and tools used by financial markets (Callon, Millo, & Muniesa, 2007) – when aiming to (re)design their logics and practices towards more sustainability. It develops a theoretical model based on ever expanding, institutional theory by combining it with practice theories. In particular, the article argues that actors transform their practices, logics and objects, by transforming an epistemic object through a collective inquiry. Empirical support is drawn from a three-year ethnographic case study of a French asset management company that attempted to (re)design its equity investment process, following new demands for Socially Responsible Investment (SRI). Research methods combine participative observation, semi-structured interviews and documentary evidence. Theoretical and methodological contributions are outlined for both institutional and practice theories.

Securitisation and ‘Riskification’: Second-order Security and the Politics of Climate Change

Risk-security writers of various persuasions have suggested that risk is effectively the new security. They say risk works to widen securitisation whereby exceptional measures are made permanent and introduced to deal with merely potential, hypothetical and less-than-existential dangers. A transformation in the political logic of the security field of this kind is a potentially problematic and momentous change. However, this has so far not been much reflected in the primary theory of what security is, namely the Copenhagen School’s theory of securitisation. This article tries to tackle this problem by identifying the distinct logic of speech acts that turn issues into questions of risk politics suggesting a model for what rules or grammars they follow and what the political implications of them are. A separate kind of speech act – ‘riskification’ – is identified based on a re-theorisation of what distinguishes ‘risks’ from ‘threats’. It is argued that risk politics is not an instance of securitisation, but something distinct with its own advantages and dangers. Threat-based security deals with direct causes of harm, whereas risk-security is oriented towards the conditions of possibility or constitutive causes of harm a kind of ‘second-order’ security politics that promotes long-term precautionary governance. Separating securitisation and ‘riskification’ preserves the analytical precision of the Copenhagen School notion of securitisation, makes a new logic of security understandable to analysts of the security field, and helps to clarify what basic logic ‘normal’ non-securitised politics may follow. The new framework is demonstrated through a critical reading of literature that has suggested that climate change has been securitised.

Transparency-Orientated Encoding Strategies for Voice-over-IP Steganography

Embedding transparency is one of the most important criteria for steganography. This paper mainly focuses on transparency-orientated encoding strategies for steganography on Voice over IP (VoIP). Our analysis of the existing encoding strategies proposed for steganography on storage media reveals that they have limited applicability in VoIP-based steganography because they enhance embedding transparency at the expense of a decreased embedding rate (ER). In this paper, we propose three encoding strategies based on digital logic for steganography on VoIP. Differing from the existing approaches, our strategies reduce the embedding distortion by improving the similarity between the cover and the covert message using digital logical transformations, instead of reducing the ER. Therefore, in contrast, our strategies improve the embedding transparency without sacrificing the embedding capacity. Of these three strategies, one adopts logical operations, one employs circular shifting operations and the third combines the operations of the first two. All these schemes are evaluated experimentally through their prototype implementations that are compared with some existing methods in a prototypical covert communication system based on VoIP (called StegVoIP). The experimental results show that the proposed strategies can provide better embedding performance than the existing approaches in terms of embedding transparency and ER.

On Structural Analysis and Efficiency for Graph-Based Rewiring Techniques

The digital logic rewiring technique has been shown to be one of the most powerful logic transformation methods. It has been proven that rewiring is able to further improve some already excellent results on many EDA problems, ranging from logic minimization, partitioning, FPGA technology mappings to final routings. Previous studies have shown that ATPG-based rewiring is one of the most powerful tools for logic perturbation while a graph-based rewiring engine is able to cover nearly one fifth of the target wires with 50 times runtime speedup. For some problems that only require good-enough and very quick solutions, this new rewiring technique may serve as a useful and more practical alternative. In this work, essential elements in graph-based rewiring such as rewiring patterns, pattern size and locality, etc., have been studied to understand their relationship with rewiring performance. A structural analysis on the target-alternative wire pairs discovered by ATPG-based and graph-based engines has also been conducted to analyze the structural characteristics that favor the identification of alternative wires. We have also developed a hybrid rewiring approach that can take the advantages from both ATPG-based and graph-based rewiring. Experimental results suggest that our hybrid engine is able to achieve about 50% of alternative wire coverage when compared with the state-of-the-art ATPG-based rewiring engine with only 4% of the runtime. Through applying our hybrid rewiring approach to the FGPA technology mapping problem, we could achieve similar depth level and look-up table number reductions with much shorter runtime. This shows that the fast runtime of our hybrid approach does not sacrifice the quality of certain rewiring applications.

Logic programming for finding models in the logics of knowledge and its applications: A case study

AbstractThe logics of knowledge are modal logics that have been shown to be effective in representing and reasoning about knowledge in multi-agent domains. Relatively few computational frameworks for dealing with computation of models and useful transformations in logics of knowledge (e.g., to support multi-agent planning with knowledge actions and degrees of visibility) have been proposed. This paper explores the use of logic programming (LP) to encode interesting forms of logics of knowledge and compute Kripke models. The LP modeling is expanded with useful operators on Kripke structures, to support multi-agent planning in the presence of both world-altering and knowledge actions. This results in the first ever implementation of a planner for this type of complex multi-agent domains.

On the physical implementation of logical transformations: Generalized [formula omitted]-machines

Any account of computation in a physical system, whether an artificial computing device or a natural system considered from a computational point of view, invokes some notion of the relationship between the abstract-logical and concrete-physical aspects of computation. In a recent paper, James Ladyman explored this relationship using a “hybrid physical–logical entity”–the L -machine–and the general account of computation that it supports [J. Ladyman, What does it mean to say that a physical system implements a computation?, Theoretical Computer Science 410 (2009) 376–383]. The underlying L -machine of Ladyman’s analysis is, however, classical and highly idealized, and cannot capture essential aspects of computation in important classes of physical systems (e.g. emerging nanocomputing devices) where logical states do not have faithful physical representations and where noise and quantum effects prevail. In this work we generalize the L -machine to allow for generally unfaithful and noisy implementations of classical logical transformations in quantum mechanical systems. We provide a formal definition and physical-information-theoretic characterization of generalized quantum L -machines (QLMs), identify important classes of QLMs, and introduce new efficacy measures that quantify the faithfulness and fidelity with which logical transformations are implemented by these machines. Two fundamental issues emphasized by Ladyman–realism about computation and the connection between logical and physical irreversibility–are reconsidered within the more comprehensive account of computation that follows from our generalization of the L -machine.

Ontology Instance Matching based MPEG-7 Resource Integration

Heterogeneous multimedia contents are annotated by a sharable formal conceptualization, often called ontology, and these contents, regardless of their media, become sharable resources/instances. Integration of the sharable resources and acquisition of diverse knowledge is getting researchers’ attention at a rapid pace. In this regard, MPEG-7 standard convertible to semantic Resource Description Framework (RDF) evolves for containing structured data and knowledge sources. In this paper, the authors propose an efficient approach to integrate the multimedia resources annotated by the standard of MPEG-7 schema using ontology instance matching techniques. MPEG-7 resources are usually specified explicitly by their surrounding MPEG-7 schema entities, e.g., concepts and properties, in conjunction with other linked resources. Therefore, resource integration needed schema matching as well. In this approach, the authors obtained the schema matching using their scalable ontology alignment algorithm and collected the semantically linked resources, referred to as the Semantic Link Cloud (SLC) collectively for each of the resources. Techniques were addressed to solve several data heterogeneity: value transformation, structural transformation and logical transformation. These experiments show the strength and efficiency of the proposed matching approach.

A digital cmos sequential circuit model for bio-cellular adaptive immune response pathway using phagolysosomic digestion: a digital phagocytosis engine

Living systems have to constantly counter micro-or- ganisms which seek parasitic existence by extracting nutrition (amino acids) from the host. Phagocytosis is the ingestion of micro-creatures by certain cells of living systems for counter nutrition (breakdown of the micro-creature into basic components) as part of cellular adaptive immune response. These particular cells are called phagocytes, all of which are different types of white blood cells or their derivatives. Phagocytes are activated by certain components of the micro-creatures which act as an antigen, generating an- tibody secretion by the phagocyte. This paper develops a digital CMOS circuit model of phagocytosis: the immune response biochemical pathway of a pha- gocyte. A micro-sequenced model has been developed where the different stages in phagocytosis are modeled as different states clocked by circadian time intervals. The model converts the bio-chemical immune system digestive pathway into a cascade of CMOS multi-step logical transformations from micro-crea- ture ingestion to the secretion of indigestible residuals. This modeling technique leads to the understanding of cellular immune deficiency diseases of living systems in the form of logical (electrical) faults in a circuit.

A micro-sequenced CMOS model for cell signalling pathway using G-protein and phosphorylation cascade

Communication between cells in multi-cellular organisms such as animals, humans and plants is essential for co-ordinating the organismic activities of fertilization, growth, survival and reproduction. This bio-chemical communication between trillions of cells in organisms can be more complex than the Internet. This paper develops a CMOS circuit model of signal reception and signal transduction within a cell in response to extra-cellular molecular signals. A micro-sequenced model has been developed where the signal transduction steps are clocked by circadian time intervals. The model converts the chemical signaling pathway into a CMOS multi-step logical transformation cascade transducing a received signal molecule into an activated cellular protein response. This modeling technique leads to understanding cellular malfunctions (diseases) in the form of logical (electrical) faults in a circuit.

Towards an embedding of Graph Transformation in Intuitionistic Linear Logic

Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embedding of double-pushout graph transformations into quantified linear logic, leading to a Curry-Howard style isomorphism between graphs and transformations on one hand, formulas and proof terms on the other. With linear implication representing rules and reachability of graphs, and the tensor modelling parallel composition of graphs and transformations, we obtain a language able to encode graph transformation systems and their computations as well as reason about their properties.

Crisp sets as classes of discontinuous fuzzy sets

This paper aims to show how, by using a threshold-based approach, a path from imprecise information to a crisp ‘decision’ can be developed. It deals with the problem of the logical transformation of a fuzzy set into a crisp set. Such threshold arises from the ideas of contradiction and separation, and allows us to prove that crisp sets can be structurally considered as classes of discontinuous fuzzy sets. It is also shown that continuous fuzzy sets are computationally indistinguishable from some kind of discontinuous fuzzy sets.

From Ojibwa to Dakota: Toward a Typology of Semantic Transformations in American Indian Languages

In this article we propose a radical new typological approach to the diversity of North American languages that is directly inspired by Claude Lévi-Strauss’s Mythologiques and his concept of transformation. As with mythology, the semantic dimension of phenomena is crucial. A comparison between the grammars of an Algonquian and a Siouan language will serve as a first illustration of the logical transformations linking two language families that previously have been considered to be fundamentally distinct. A parallel appears between the results obtained and those stemming from a comparison between the principal ritual manifestations of Sioux culture and Subarctic Algonquian culture.