A method for bi-decomposition of partial Boolean functions

A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. The problem of bi-decomposition is reduced to the problem of two-block weighted covering a set of edges of a graph of rows orthogonality of a ternary or binary matrix that specify a given function, by complete bipartite subgraphs (bicliques). Each biclique is assigned in a certain way with a set of arguments of the given function, and the weight of a biclique is the cardinality of this set. According to each of bicliques, a Boolean function is constructed whose arguments are the variables from the set, which is assigned to the biclique. The obtained functions form a solution of the bi-decomposition problem

Энергосберегающее кодирование частичных состояний параллельного автомата

The problem of a low-power assignment of the partial states of a parallel automaton is considered. A method to solve that problem is suggested that provides minimizing the number of memory elements in the implementing circuit of the automaton and minimization of their switching activity. The problem is reduced to nding a minimal weighted cover of a graph with its complete bipartite sub-graphs (bi-cliques)

Ion Channels in Native Chloroplast Membranes: Challenges and Potential for Direct Patch-Clamp Studies

Photosynthesis without any doubt depends on the activity of the chloroplast ion channels. The thylakoid ion channels participate in the fine partitioning of the light-generated proton-motive force (p.m.f.). By regulating, therefore, luminal pH, they affect the linear electron flow and non-photochemical quenching. Stromal ion homeostasis and signaling, on the other hand, depend on the activity of both thylakoid and envelope ion channels. Experimentally, intact chloroplasts and swollen thylakoids were proven to be suitable for direct measurements of the ion channels activity via conventional patch-clamp technique; yet, such studies became infrequent, although their potential is far from being exhausted. In this paper we wish to summarize existing challenges for direct patch-clamping of native chloroplast membranes as well as present available results on the activity of thylakoid Cl- (ClC?) and divalent cation-permeable channels, along with their tentative roles in the p.m.f. partitioning, volume regulation, and stromal Ca2+ and Mg2+ dynamics. Patch-clamping of the intact envelope revealed both large-conductance porin-like channels, likely located in the outer envelope membrane and smaller conductance channels, more compatible with the inner envelope location. Possible equivalent model for the sandwich-like arrangement of the two envelope membranes within the patch electrode will be discussed, along with peculiar properties of the fast-activated cation channel in the context of the stromal pH control

SV channels dominate the vacuolar Ca2+ release during intracellular signaling

AbstractVacuoles have long been suggested to mediate a rise in the cytosolic free Ca2+ during environmental signal transduction. This study addresses the issue of the control of vacuolar calcium release by some of the known signaling molecules such as IP3, cADPR, ABA, ATP, cAMP, cGMP, H2O2 and CaM. Over 30 concentrations and/or combinations of these signaling compounds were studied in a series of electrophysiological experiments involving non-invasive ion flux measurements (the MIFE) and patch-clamp techniques. Our results suggest that calcium, calmodulin and nucleotides cause calcium release via SV channels

On bi-decomposition of incompletely specified Boolean functions

A method for bi-decomposition of incompletely specified (partial) Boolean functions is suggested. The problem of bi-decomposition is reduced to the problem of a weighted two-block covering the edge set of the orthogonality graph of the truth table rows by complete bipartite subgraphs (bicliques). Every biclique is assigned with a set of variables in a definite way. The weight of a biclique is the size of that set. According to each biclique of the obtained cover, a Boolean function is constructed whose arguments are the variables from the assigned set

Энергосберегающее кодирование частичных состояний параллельного автомата

The problem of a low-power assignment of the partial states of a parallel automaton is considered. A method to solve that problem is suggested that provides minimizing the number of memory elements in the implementing circuit of the automaton and minimization of their switching activity. The problem is reduced to finding a minimal weighted cover of a graph with its complete bipartite sub-graphs (bi-cliques)

Minimization of Boolean functions in the class of orthogonal disjunctive normal forms

An approach to solving the problem of orthogonalization of a disjunctive normal form (DNF) of a Boolean function is suggested. The means of graph theory are used in the approach. Two methods to obtain an orthogonal DNF are suggested

Circuit implementation of parallel logical control algorithms represented in PRALU description

Software system LOCON-2 for circuit implementation of parallel logical control algorithms is described in this chapter. The system allows obtaining proper descriptions (models) in VHDL at any stage of transforming descriptions of the control algorithms. Obtaining of VHDL models provides possibility to integrate LOCON-2 with technical synthesizers of logic circuits

Синтез комбинационных схем путем алгебраической декомпозиции булевых функций

The problem of combinational circuits synthesis in the basis of two-input gates is considered. Those gates are AND, OR, NAND and NOR. A method for solving this problem by means of Boolean functions bi-decomposition is suggested. The method reduces the problem to the search for a weighted two-block cover of the orthogonality graph of ternary matrice rows representing the given Boolean function by complete bipartite subgraphs (bi-cliques). Each bi-clique in the obtained cover is assigned in a certain way with a set of variables that are the arguments of the function. This set is the weight of the bi-clique. Each of those bi-cliques defines a Boolean function whose arguments are the variables assigned to it. The functions obtained in such a way constitute the required decomposition. The process of combinational circuit synthesis consists in successively applying bi-decomposition to the functions obtained. The method for two-block covering the orthogonality graph of ternary matrice rows is described