Set Of Logic Equations Research Articles

Corporate culture in Ukraine engineering companies as a special system

In the article, the corporate culture of machine-building enterprises of Ukraine has been considered as a special system, which is based on a set of logical equations that help to build a mission in machine-building enterprises. It has been determined that according to the main purpose of machine-building enterprises, the main elements of the corporate culture are formed. Multifactority of formation of elements of corporate culture has been revealed. The classification scheme of its main types on the main multidimensional classification features has been proposed. Much attention is paid to the culture of states and the culture of action. It has been determined that the culture of states is very topical for transient processes, preserves the equilibrium in an imbalance between the familiar situation and the entrance to the new one. The culture of states helps to simulate the new situation and new processes. The culture of action reflects the dynamics, progressive activity, and continues the culture of the states. In each classification group there is a kind of culture that influences the increase of the competitive status of the machine-building enterprise in the market: a viable culture, a holistic culture, a developed culture, a flexible culture.

Discovery of Drug Synergies in Gastric Cancer Cells Predicted by Logical Modeling.

Discovery of efficient anti-cancer drug combinations is a major challenge, since experimental testing of all possible combinations is clearly impossible. Recent efforts to computationally predict drug combination responses retain this experimental search space, as model definitions typically rely on extensive drug perturbation data. We developed a dynamical model representing a cell fate decision network in the AGS gastric cancer cell line, relying on background knowledge extracted from literature and databases. We defined a set of logical equations recapitulating AGS data observed in cells in their baseline proliferative state. Using the modeling software GINsim, model reduction and simulation compression techniques were applied to cope with the vast state space of large logical models and enable simulations of pairwise applications of specific signaling inhibitory chemical substances. Our simulations predicted synergistic growth inhibitory action of five combinations from a total of 21 possible pairs. Four of the predicted synergies were confirmed in AGS cell growth real-time assays, including known effects of combined MEK-AKT or MEK-PI3K inhibitions, along with novel synergistic effects of combined TAK1-AKT or TAK1-PI3K inhibitions. Our strategy reduces the dependence on a priori drug perturbation experimentation for well-characterized signaling networks, by demonstrating that a model predictive of combinatorial drug effects can be inferred from background knowledge on unperturbed and proliferating cancer cells. Our modeling approach can thus contribute to preclinical discovery of efficient anticancer drug combinations, and thereby to development of strategies to tailor treatment to individual cancer patients.

Synthesis of reversible circuits for large reversible functions

This paper presents a new algorithm MP (multiple pass) to synthesize large reversible binary circuits without ancilla bits. The well-known MMD algorithm for synthesis of reversible circuits requires to store a truth table (or a Reed-Muller - RM transform) as a 2n vector to represent a reversible function of n variables. This representation prohibits synthesis of large functions. However, in MP we do not store such an exponentially growing data structure. The values of minterms are calculated in MP dynamically, one-by-one, from a set of logic equations that specify the reversible circuit to be designed. This allows for synthesis of large scale reversible circuits (30-bits), which is not possible with any existing algorithm. In addition, our unique multi-pass approach where the circuit is synthesized with various, yet specific, minterm orders yields quasi-optimal solution. The algorithm returns a description of the quasi-optimal circuit with respect to gate count or to its 'quantum cost'. Although the synthesis process in MP is relatively slower, the solution is found in real-time for smaller circuits of 8 bits or less.

Multistationarity, the basis of cell differentiation and memory. II. Logical analysis of regulatory networks in terms of feedback circuits.

Circuits and their involvement in complex dynamics are described in differential terms in Part I of this work. Here, we first explain why it may be appropriate to use a logical description, either by itself or in symbiosis with the differential description. The major problem of a logical description is to find an adequate way to involve time. The procedure we adopted differs radically from the classical one by its fully asynchronous character. In Sec. II we describe our "naive" logical approach, and use it to illustrate the major laws of circuitry (namely, the involvement of positive circuits in multistationarity and of negative circuits in periodicity) and in a biological example. Already in the naive description, the major steps of the logical description are to: (i) describe a model as a set of logical equations, (ii) derive the state table from the equations, (iii) derive the graph of the sequences of states from the state table, and (iv) determine which of the possible pathways will be actually followed in terms of time delays. In the following sections we consider multivalued variables where required, the introduction of logical parameters and of logical values ascribed to the thresholds, and the concept of characteristic state of a circuit. This generalized logical description provides an image whose qualitative fit with the differential description is quite remarkable. A major interest of the generalized logical description is that it implies a limited and often quite small number of possible combinations of values of the logical parameters. The space of the logical parameters is thus cut into a limited number of boxes, each of which is characterized by a defined qualitative behavior of the system. Our analysis tells which constraints on the logical parameters must be fulfilled in order for any circuit (or combination of circuits) to be functional. Functionality of a circuit will result in multistationarity (in the case of a positive circuit) or in a cycle (in the case of a negative circuit). The last sections deal with "more about time delays" and "reverse logic," an approach that aims to proceed rationally from facts to models. (c) 2001 American Institute of Physics.

Optimization of Reduced Dependencies for Synchronous Sequential Machines

The purpose of this paper is to describe an algorithmic ``solution'' to the assignment problem of synchronous sequential machines. The figure of merit used provides a mathematical evaluation of the reduced dependencies that may exist in the set of logic equations. If desired, the algorithm can assign the input, state, and output symbols of a given machine so as to ``minimize'' the total logic, i.e., reduced dependencies of both the state and output logic on state and input variables are optimized. The method is nonenumerative in the sense that the first assignmnent found is optimal. A restricted version of the algorithm has been programmed for an IBM 7094 computer.