Abstract: In the k-set agreement problem, each process proposes a value and has to decide a value in such a way that a decided value is a proposed value and at most k different values are decided. This problem can easily be solved in synchronous systems or in asynchronous systems prone to t process crashes when t < k. In contrast, it has been shown that k-set agreement cannot be solved in async...

Non-radiative surface plasma oscillations in a semi-infinite metal are quantized by using a hydrodynamic jellium model for electrons in the metal. In consequence of the quantization, the electronSF (surface plasmon) vertex function is obtained for the overall region of the surface plasmon wave vector k. In the electrostatic limit, it coincides with the usual electrostatic vertex function obtain...

In the k-set agreement problem, each process proposes a value and has to decide a value in such a way that a decided value is a proposed value and at most k different values are decided. This problem can easily be solved in synchronous systems or in asynchronous systems prone to t process crashes when t < k. In contrast, it has been shown that k-set agreement cannot be solved in asynchronous sy...

When atmosphere from cotton plants (Gossypium hirsutum L., var. Deltapine Smoothleaf) was condensed by passing it over the expansion coil of an air conditioner and three 1-hour collections per day (early morning, noon, and late afternoon) were made, the total essential oils were found to consist of 50 to 60% beta-bisabolol (I(k) 1660) and gamma-bisabolene (I(k) 1550) and 30 to 40% geraniol (I(k...

A triple crossing is a crossing in a projection of a knot or link that has three strands of the knot passing straight through it. A triple crossing projection is a projection such that all of the crossings are triple crossings. We prove that every knot and link has a triple crossing projection and then investigate c3(K), which is the minimum number of triple crossings in a projection of K. We o...

Given a pair of elliptic curves $E_1,E_2$ over field $k$, we have natural map $\text{CH}^1(E_1)_0\otimes\text{CH}^1(E_2)_0\to\text{CH}^2(E_1\times E_2)$, and conjecture due to Beilinson predicts that the image this is finite when $k$ number field. We construct $2$-parameter family can be used produce examples pairs where finite. The constructed guarantee existence rational curve passing through...

We consider the problem of stochastic flow of multiple particles traveling on a closed loop, with a constraint that particles move without passing. We use a Markov chain description that reduces the problem to a generalized random walk on a hyperplane (with boundaries). By expressing positions via a moving reference frame, the geometry of the no-passing criteria is greatly simplified, with the ...

This paper proposes a novel concept of multidestination message passing mechanism for wormhole k-ary n-cube networks. Similar to the familiar car-pool concept, this mechanism allows data to be delivered to or picked-up from multiple nodes with a single message-passing step. Such messages can propagate along any valid path in a wormhole network conforming to the underlying base routing scheme (d...

This paper addresses the issue of K-mutual exclusion in a distributed system. Our proposed algorithm divides a network into root nodes and regular nodes. The root nodes communicate with each other via a ring network and communicate directly with a set of regular nodes that they are assigned to. Mutual exclusion is achieved by using k tokens that are maintained by the root nodes, the collaborati...

We study Weyl-Heisenberg (=Gabor) expansions for either L2(IR ) or a subspace of it. These are expansions in terms of the spanning set X = (EM φ : k ∈ K, l ∈ L,φ ∈ Φ), where K and L are some discrete lattices in IR, Φ ⊂ L2(IR ) is finite, E is the translation operator, and M is the modulation operator. Such sets X are known as WH systems. The analysis of the “basis” properties of WH systems (e....