Loop transformation is a crucial step in parallelizing compilers. We introduce the concept of positive coordinate basis for deriving loop transformations. The basis serves to find proper loop transformations to change the dependence vectors into the desired forms. We demonstrate how this approach can systematically eztract maximal outer loop parallelism. Based on the concept, we can also constr...

According to J.A.N. Lee in 1996, computer scientists “are reaching the stage of development where each new generation of participants is unaware both of their overall technological ancestry and the history of the development of their speciality, and have no past to build upon” [1, p.54]. A technically and historically accurate account, as attempted here, can help us, computer scientists, grasp ...

Common conceptions of the notions of role, relationship, and collaboration in object-oriented programming and related disciplines are briefly recalled and related to each other, working towards a view that allows it to fit them all together, eventually setting the cornerstones for the definition of a truly useful and widely accepted novel programming language construct.

We explicitly construct and characterize all possible independent loop states in 3+1 dimensional loop quantum gravity by regulating it on a 3-d regular lattice in the Hamiltonian formalism. These loop states, characterized by the (dual) angular momentum quantum numbers, describe SU(2) rigid rotators on the links of the lattice. The loop states are constructed using the Schwinger bosons which ar...

While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exist, we provide as large as possible classes of infinite graphs with finite cop number. More precisely, for each infinite cardinal and each positive integer k, we construct 2 non-isomorphic k-cop-win graphs satisfying addi...

We consider variants o f propositional dynamic logic (PDL) augmented with the converse construct. Intuitively, the converse a of a program a is a programs whose semantics is to run a backwards. While PDL consists o f assertions about weakest preconditions, the converse construct enable us to make assertions about strongest postconditions. We investigate the interaction of converse with two cons...

We construct a specific formalism for calculating the one-loop virtual corrections for standard model processes with an arbitrary number of external legs. The procedure explicitly separates the infrared and ultraviolet divergences analytically from the finite one-loop contributions, which can then be evaluated numerically using recursion relations. Using the formalism outlined in this paper, we...

We construct a specific formalism for calculating the one-loop virtual corrections for standard model processes with an arbitrary number of external legs. The procedure explicitly separates the infrared and ultraviolet divergences analytically from the finite one-loop contributions, which can then be evaluated numerically using recursion relations. Using the formalism outlined in this paper, we...

We show that minuscule entropic forces, on the order of 100 fN, can prevent the formation of DNA loops–a ubiquitous means of regulating the expression of genes. We observe a tenfold decrease in the rate of LacI-mediated DNA loop formation when a tension of 200 fN is applied to the substrate DNA, biasing the thermal fluctuations that drive loop formation and breakdown events. Conversely, once lo...