In distributed shared memory multiprocessors, remote memory accesses generate processor-tomemory traffic which may result in a bottleneck. It is therefore important to design algorithms that minimize the number of remote memory accesses. We establish a lower bound of 3 on remote access time complexity for mutual exclusion algorithms in a model where processes communicate by means of a general r...

We give asymptotic estimates of the frequency of occurrences of a symbol in a random word generated by any bicomponent stochastic model. More precisely, we consider the random variable Yn representing the number of occurrences of a given symbol in a word of length n generated at random; the stochastic model is defined by a rational formal series r having a linear representation with two primiti...

Using quasiconformal surgery, we prove that any primitive, postcritically-finite hyperbolic polynomial can be tuned with an arbitrary generalized non-escaping critical points, generalizing a result of Douady-Hubbard for quadratic polynomials to the case higher degree polynomials. This solves affirmatively conjecture by Inou and Kiwi on surjectivity renormalization operator in one complex variab...

Verification by static analysis often hinges on the inference of relational numeric information. In real-world programs, the set of active variables is often not fixed for a given program point due to, for instance, heap-allocated cells or recursive function calls. For these program points, an invariant has to summarize values for traces E where a variable x exists and values for traces N where...

Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such as x ∈ S or x 6∈ S. Chase et al. showed that ZKS protocols are underlain by a cryptographic primitive termed mercurial commitment. A (trapdoor) mercurial commitment has two commitment procedures. At committing time, ...

We have implemented an APL/370 compiler which accepts a subset of APL that includes most language features and a majority of APL primitive functions. It produces System/370 assembly code directly to be run independently of an interpreter. The compiler does not require variable declarations. Its front end, which is machine-independent, employs extensive typeshape analysis based on a type-shape c...

‎given a finite non-cyclic group $g$‎, ‎call $sigma(g)$ the smallest number of proper subgroups of $g$ needed to cover $g$‎. ‎lucchini and detomi conjectured that if a nonabelian group $g$ is such that $sigma(g) < sigma(g/n)$ for every non-trivial normal subgroup $n$ of $g$ then $g$ is textit{monolithic}‎, ‎meaning that it admits a unique minimal normal subgroup‎. ‎in this paper we show how thi...

A conservative primitive variable discrete exterior calculus (DEC) discretization of the Navier–Stokes equations is performed. An existing DEC method [M. S. Mohamed, A. N. Hirani, and R. Samtaney, “Discrete incompressible over surface simplicial meshes,” J. Comput. Phys. 312, 175–191 (2016)] modified to this end extended include energy-preserving time integration Coriolis force enhance its appl...

This paper briefly describes process functional language compiler architecture. Process functional language is an experimental functional language with imperative features like memory cell variables. The main parts of the process functional language compiler are presented with short description and examples. Current implementation of PFL compiler comprises a algebraic types, primitive functions...

primitive neuroectodermal tumor (penets) is an uncommon malignancy of bone and soft tissue witch rarely occurs in the kidney. in more than 90% of the cases, the tumor cells relieves a balanced translocation (11; 22) (q24; q12). immunohistochemical staining may be required for diagnosis of penet. the cells of tumor express cd99, vimentin, nse, fl1 but do not express ck, lca, myogenin, and wt1. w...