Algorithmic Minimization of Non-zero Entries in 0,1-Matrices

In this paper we present algorithms which work on pairs of 0,1- matrices which multiply again a matrix of zero and one entries. When applied over a pair, the algorithms change the number of non-zero entries present in the matrices, meanwhile their product remains unchanged. We establish the conditions under which the number of 1s decreases. We recursively define as well pairs of matrices which product is a specific matrix and such that by applying on them these algorithms, we minimize the total number of non-zero entries present in both matrices. These matrices may be interpreted as solutions for a well known information retrieval problem, and in this case the number of 1 entries represent the complexity of the retrieve and information update operations.

Zero- one- and two-dimensional hydrogen-bonded structures in the 1:1 proton-transfer compounds of 4,5-dichlorophthalic acid with the monocyclic heteroaromatic Lewis bases 2-aminopyrimidine, nicotinamide and isonicotinamide

The structures of the anhydrous 1:1 proton-transfer compounds of 4,5-dichlorophthalic acid (DCPA) with the monocyclic heteroaromatic Lewis bases 2-aminopyrimidine, 3-(aminocarboxy) pyridine (nicotinamide) and 4-(aminocarbonyl) pyridine (isonicotinamide), namely 2-aminopyrimidinium 2-carboxy-4,5-dichlorobenzoate C4H6N3+ C8H3Cl2O4- (I), 3-(aminocarbonyl) pyridinium 2-carboxy-4,5-dichlorobenzoate C6H7N2O+ C8H3Cl2O4- (II) and the unusual salt adduct 4-(aminocarbonyl) pyridinium 2-carboxy-4,5-dichlorobenzoate 2-carboxymethyl-4,5-dichlorobenzoic acid (1/1/1) C6H7N2O+ C8H3Cl2O4-.C9H6Cl2O4 (III) have been determined at 130 K. Compound (I) forms discrete centrosymmetric hydrogen-bonded cyclic bis(cation--anion) units having both R2/2(8) and R2/1(4) N-H...O interactions. In compound (II) the primary N-H...O linked cation--anion units are extended into a two-dimensional sheet structure via amide-carboxyl and amide-carbonyl N-H...O interactions. The structure of (III) reveals the presence of an unusual and unexpected self-synthesized methyl monoester of the acid as an adduct molecule giving one-dimensional hydrogen-bonded chains. In all three structures the hydrogen phthalate anions are

Shape-Dependent Confinement in Ultrasmall Zero-, One-, and Two-Dimensional PbS Nanostructures

Spatial dimensionality affects the degree of confinement when an electron-hole pair is squeezed from one or more dimensions approaching the bulk exciton Bohr radius (alpha(B)) limit. The etectron-hole interaction in zero-dimensional (0D) dots, one-dimensional (1D) rods/wires, and two-dimensional (2D) wells/sheets should be enhanced by the increase in confinement dimensions in the order 0D > 1D > 2D. We report the controlled synthesis of PbS nanomateriats with 0D, 1D, and 2D forms retaining at least one dimension in the strongly confined regime far below alpha(B) (similar to 10 nm for PbS) and provide evidence through varying the exciton-phonon coupling strength that the degree of confinement is systematically weakened by the loss of confinement dimension. Geometry variations show distinguishable far-field optical polarizations, which could find useful applications in polarization-sensitive devices.

Zero-One Designs Produce Small Hard SAT Instances

Some basics of combinatorial block design are combined with certain constraint satisfaction problems of interest to the satisfiability community. The paper shows how such combinations lead to satisfiability problems, and shows empirically that these are some of the smallest very hard satisfiability problems ever constructed. Partially balanced (0,1) designs (PB01Ds) are introduced as an extension of balanced incomplete block designs (BIBDs) and (0,1) designs. Also, (0,1) difference sets are introduced as an extension of certain cyclical difference sets. Constructions based on (0,1) difference sets enable generation of PB01Ds over a much wider range of parameters than is possible for BIBDs. Building upon previous work of Spence, it is shown how PB01Ds lead to small, very hard, unsatisfiable formulas. A new three-dimensional form of combinatorial block design is introduced, and leads to small, very hard, satisfiable formulas. The methods are validated on solvers that performed well in the SAT 2009 and earlier competitions.

A Code for zero-one integer programming, ILLIP-2 : a programming manual for ILLIP-2 /

"UILU-ENG 77 1711."

An implicit enumeration program for zero-one integer programming -- ILLIP-2 /

Thesis (M.S.)--Illinois.

An Implicit enumeration program for zero-one integer programming,

Bibliography: p. 41-42.

A code for zero-one integer linear programming by implicit enumeration, a programming manual for ILLIP.

Issued also as thesis (M.S.) University of Illinois.

The Jordan canonical form for a class of weighted directed graphs

Recently, Cardon and Tuckfield (2011) [1] have described the Jordan canonical form for a class of zero-one matrices, in terms of its associated directed graph. In this paper, we generalize this result to describe the Jordan canonical form of a weighted adjacency matrix A in terms of its weighted directed graph.

Matricial Model for the Study of Lower Bounds

Let V be an array. The range query problem concerns the design of data structures for implementing the following operations. The operation update(j,x) has the effect vj ← vj + x, and the query operation retrieve(i,j) returns the partial sum vi + ... + vj. These tasks are to be performed on-line. We define an algebraic model – based on the use of matrices – for the study of the problem. In this paper we establish as well a lower bound for the sum of the average complexity of both kinds of operations, and demonstrate that this lower bound is near optimal – in terms of asymptotic complexity.

To tremble the zero: art in the age of algorithmic reproduction

'To Tremble the Zero: Art in the Age of Algorithmic Reproduction' is a philosophic, political and sensuous journey playing with (and against) Benjamin's 'Art in the Age of Mechanical Reproduction'. In an age inundated by the 'post-': postmodernity, posthuman, post art, postsexual, post-feminist, post-society, post-nation, etc, 'To Tremble the Zero' sets out to re/present the nature of what it means to do or make 'art', as well as what it means to be or have 'human/ity' when the ground is nothing other than the fractal, and algorithmically infinite, combinations of zero and one. The work will address also the unfortunate way in which modern forms of metaphysics continue to creep 'unsuspectingly' into our understanding of contemporary media/electronic arts, despite (or perhaps even because of) the attempts by Latour, Badiou, or Agamben especially when addressing the zero/one as if a contradictory 'binary' rather than as a kind of 'slice' or (to use Deleuze and Guattari) an immanent plane of immanence. This work argues that by retrieving Benjamin, Einstein, Gödel, and Haraway, a rather different story of art can be told.

Estimation of parameters for macroparasite population evolution using approximate Bayesian computation

We estimate the parameters of a stochastic process model for a macroparasite population within a host using approximate Bayesian computation (ABC). The immunity of the host is an unobserved model variable and only mature macroparasites at sacrifice of the host are counted. With very limited data, process rates are inferred reasonably precisely. Modeling involves a three variable Markov process for which the observed data likelihood is computationally intractable. ABC methods are particularly useful when the likelihood is analytically or computationally intractable. The ABC algorithm we present is based on sequential Monte Carlo, is adaptive in nature, and overcomes some drawbacks of previous approaches to ABC. The algorithm is validated on a test example involving simulated data from an autologistic model before being used to infer parameters of the Markov process model for experimental data. The fitted model explains the observed extra-binomial variation in terms of a zero-one immunity variable, which has a short-lived presence in the host.

Generation of Minimum Leakage Input Vectors with Constrained NBTI Degradation

Technology scaling has caused Negative Bias Temperature Instability (NBTI) to emerge as a major circuit reliability concern. Simultaneously leakage power is becoming a greater fraction of the total power dissipated by logic circuits. As both NBTI and leakage power are highly dependent on vectors applied at the circuit’s inputs, they can be minimized by applying carefully chosen input vectors during periods when the circuit is in standby or idle mode. Unfortunately input vectors that minimize leakage power are not the ones that minimize NBTI degradation, so there is a need for a methodology to generate input vectors that minimize both of these variables.This paper proposes such a systematic methodology for the generation of input vectors which minimize leakage power under the constraint that NBTI degradation does not exceed a specified limit. These input vectors can be applied at the primary inputs of a circuit when it is in standby/idle mode and are such that the gates dissipate only a small amount of leakage power and also allow a large majority of the transistors on critical paths to be in the “recovery” phase of NBTI degradation. The advantage of this methodology is that allowing circuit designers to constrain NBTI degradation to below a specified limit enables tighter guardbanding, increasing performance. Our methodology guarantees that the generated input vector dissipates the least leakage power among all the input vectors that satisfy the degradation constraint. We formulate the problem as a zero-one integer linear program and show that this formulation produces input vectors whose leakage power is within 1% of a minimum leakage vector selected by a search algorithm and simultaneously reduces NBTI by about 5.75% of maximum circuit delay as compared to the worst case NBTI degradation. Our paper also proposes two new algorithms for the identification of circuit paths that are affected the most by NBTI degradation. The number of such paths identified by our algorithms are an order of magnitude fewer than previously proposed heuristics.

Reduced-complexity partial-interference-cancellation group decoder for STBCs

In this letter, we propose a reduced-complexity implementation of partial interference cancellation group decoder with successive interference cancellation (PIC-GD-SIC) by employing the theory of displacement structures. The proposed algorithm exploits the block-Toeplitz structure of the effective matrix and chooses an ordering of the groups such that the zero-forcing matrices associated with the various groups are obtained through Schur recursions without any approximations. We show using an example that the proposed implementation offers a significantly reduced computational complexity compared to the direct approach without any loss in performance.

Spiral-Wave Dynamics in a Mathematical Model of Human Ventricular Tissue with Myocytes and Fibroblasts

Cardiac fibroblasts, when coupled functionally with myocytes, can modulate the electrophysiological properties of cardiac tissue. We present systematic numerical studies of such modulation of electrophysiological properties in mathematical models for (a) single myocyte-fibroblast (MF) units and (b) two-dimensional (2D) arrays of such units; our models build on earlier ones and allow for zero-, one-, and two-sided MF couplings. Our studies of MF units elucidate the dependence of the action-potential (AP) morphology on parameters such as E-f, the fibroblast resting-membrane potential, the fibroblast conductance G(f), and the MF gap-junctional coupling G(gap). Furthermore, we find that our MF composite can show autorhythmic and oscillatory behaviors in addition to an excitable response. Our 2D studies use (a) both homogeneous and inhomogeneous distributions of fibroblasts, (b) various ranges for parameters such as G(gap), G(f), and E-f, and (c) intercellular couplings that can be zero-sided, one-sided, and two-sided connections of fibroblasts with myocytes. We show, in particular, that the plane-wave conduction velocity CV decreases as a function of G(gap), for zero-sided and one-sided couplings; however, for two-sided coupling, CV decreases initially and then increases as a function of G(gap), and, eventually, we observe that conduction failure occurs for low values of G(gap). In our homogeneous studies, we find that the rotation speed and stability of a spiral wave can be controlled either by controlling G(gap) or E-f. Our studies with fibroblast inhomogeneities show that a spiral wave can get anchored to a local fibroblast inhomogeneity. We also study the efficacy of a low-amplitude control scheme, which has been suggested for the control of spiral-wave turbulence in mathematical models for cardiac tissue, in our MF model both with and without heterogeneities.