Exploration of Finite 2D Square Grid by a Metamorphic Robotic System

We consider exploration of finite 2D square grid by a metamorphic robotic system consisting of anonymous oblivious modules. The number of possible shapes of a metamorphic robotic system grows as the number of modules increases. The shape of the system serves as its memory and shows its functionality. We consider the effect of global compass on the minimum number of modules necessary to explore a finite 2D square grid. We show that if the modules agree on the directions (north, south, east, and west), three modules are necessary and sufficient for exploration from an arbitrary initial configuration, otherwise five modules are necessary and sufficient for restricted initial configurations

Positional Encoding by Robots with Non-Rigid Movements

Consider a set of autonomous computational entities, called \emph{robots}, operating inside a polygonal enclosure (possibly with holes), that have to perform some collaborative tasks. The boundary of the polygon obstructs both visibility and mobility of a robot. Since the polygon is initially unknown to the robots, the natural approach is to first explore and construct a map of the polygon. For this, the robots need an unlimited amount of persistent memory to store the snapshots taken from different points inside the polygon. However, it has been shown by Di Luna et al. [DISC 2017] that map construction can be done even by oblivious robots by employing a positional encoding strategy where a robot carefully positions itself inside the polygon to encode information in the binary representation of its distance from the closest polygon vertex. Of course, to execute this strategy, it is crucial for the robots to make accurate movements. In this paper, we address the question whether this technique can be implemented even when the movements of the robots are unpredictable in the sense that the robot can be stopped by the adversary during its movement before reaching its destination. However, there exists a constant $\delta > 0$, unknown to the robot, such that the robot can always reach its destination if it has to move by no more than $\delta$ amount. This model is known in literature as \emph{non-rigid} movement. We give a partial answer to the question in the affirmative by presenting a map construction algorithm for robots with non-rigid movement, but having $O(1)$ bits of persistent memory and ability to make circular moves

Plane Formation by Synchronous Mobile Robots in the Three Dimensional Euclidean Space

Creating a swarm of mobile computing entities frequently called robots, agents or sensor nodes, with self-organization ability is a contemporary challenge in distributed computing. Motivated by this, we investigate the plane formation problem that requires a swarm of robots moving in the three dimensional Euclidean space to land on a common plane. The robots are fully synchronous and endowed with visual perception. But they do not have identifiers, nor access to the global coordinate system, nor any means of explicit communication with each other. Though there are plenty of results on the agreement problem for robots in the two dimensional plane, for example, the point formation problem, the pattern formation problem, and so on, this is the first result for robots in the three dimensional space. This paper presents a necessary and sufficient condition for fully-synchronous robots to solve the plane formation problem that does not depend on obliviousness i.e., the availability of local memory at robots. An implication of the result is somewhat counter-intuitive: The robots cannot form a plane from most of the semi-regular polyhedra, while they can form a plane from every regular polyhedron (except a regular icosahedron), whose symmetry is usually considered to be higher than any semi-regular polyhedrdon

The Random Bit Complexity of Mobile Robots Scattering

We consider the problem of scattering $n$ robots in a two dimensional continuous space. As this problem is impossible to solve in a deterministic manner, all solutions must be probabilistic. We investigate the amount of randomness (that is, the number of random bits used by the robots) that is required to achieve scattering. We first prove that $n \log n$ random bits are necessary to scatter $n$ robots in any setting. Also, we give a sufficient condition for a scattering algorithm to be random bit optimal. As it turns out that previous solutions for scattering satisfy our condition, they are hence proved random bit optimal for the scattering problem. Then, we investigate the time complexity of scattering when strong multiplicity detection is not available. We prove that such algorithms cannot converge in constant time in the general case and in $o(\log \log n)$ rounds for random bits optimal scattering algorithms. However, we present a family of scattering algorithms that converge as fast as needed without using multiplicity detection. Also, we put forward a specific protocol of this family that is random bit optimal ($n \log n$ random bits are used) and time optimal ($\log \log n$ rounds are used). This improves the time complexity of previous results in the same setting by a $\log n$ factor. Aside from characterizing the random bit complexity of mobile robot scattering, our study also closes its time complexity gap with and without strong multiplicity detection (that is, $O(1)$ time complexity is only achievable when strong multiplicity detection is available, and it is possible to approach it as needed otherwise)

Observation of Scaling Violations in Scaled Momentum Distributions at HERA

Charged particle production has been measured in deep inelastic scattering (DIS) events over a large range of $x$ and $Q^2$ using the ZEUS detector. The evolution of the scaled momentum, $x_p$, with $Q^2,$ in the range 10 to 1280 $GeV^2$, has been investigated in the current fragmentation region of the Breit frame. The results show clear evidence, in a single experiment, for scaling violations in scaled momenta as a function of $Q^2$.Comment: 21 pages including 4 figures, to be published in Physics Letters B. Two references adde

Modified Reconstruction of Standard Model in Non-Commutative Differential Geometry

Sogami recently proposed the new idea to express Higgs particle as a kind of gauge particle by prescribing the generalized covariant derivative with gauge and Higgs fields operating on quark and lepton fields. The field strengths for both the gauge and Higgs fields are defined by the commutators of the covariant derivative by which he could obtain the Yang-Mills Higgs Lagrangian in the standard model. Inspired by Sogami's work, we present a modification of our previous scheme to formulate the spontaneously broken gauge theory in non-commutative geometry on the discrete space; Minkowski space multiplied by two points space by introducing the generation mixing matrix in operation of the generalized derivative on the more fundamental fields a_i(x,y) which compose the gauge and Higgs fields. The standard model is reconstructed according to the modified scheme, which does not yields not only any special relations between the particle masses but also the special restriction on the Higgs potential.Comment: 21 page

NF-κB: A lesson in family values

A set of mobile robots (represented as points) is distributed in the Cartesian plane. The collection contains an unknown subset of byzantine robots which are indistinguishable from the reliable ones. The reliable robots need to gather, i.e., arrive to a configuration in which at the same time, all of them occupy the same point on the plane. The robots are equipped with GPS devices and at the beginning of the gathering process they communicate the Cartesian coordinates of their respective positions to the central authority. On the basis of this information, without the knowledge of which robots are faulty, the central authority designs a trajectory for every robot. The central authority aims to provide the trajectories which result in the shortest possible gathering time of the healthy robots. The efficiency of a gathering strategy is measured by its competitive ratio, i.e., the maximal ratio between the time required for gathering achieved by the given trajectories and the optimal time required for gathering in the offline case, i.e., when the faulty robots are known to the central authority in advance. The role of the byzantine robots, controlled by the adversary, is to act so that the gathering is delayed and the resulting competitive ratio is maximized. The objective of our paper is to propose efficient algorithms when the central authority is aware of an upper bound on the number of byzantine robots. We give optimal algorithms for collections of robots known to contain at most one faulty robot. When the proportion of byzantine robots is known to be less than one half or one third, we provide algorithms with small constant competitive ratios. We also propose algorithms with bounded competitive ratio in the case where the proportion of faulty robots is arbitrary

Membrane protein dynamics: limited lipid control

Correlation of lipid disorder with membrane protein dynamics has been studied with infrared spectroscopy, by combining data characterizing lipid phase, protein structure and, via hydrogen-deuterium (H/D) exchange, protein dynamics. The key element was a new measuring scheme, by which the combined effects of time and temperature on the H/D exchange could be separated. Cyanobacterial and plant thylakoid membranes, mammalian mitochondria membranes, and for comparison, lysozyme were investigated. In dissolved lysozyme, as a function of temperature, H/D exchange involved only reversible movements (the secondary structure did not change considerably); heat-denaturing was a separate event at much higher temperature. Around the low-temperature functioning limit of the biomembranes, lipids affected protein dynamics since changes in fatty acyl chain disorders and H/D exchange exhibited certain correlation. H/D exchange remained low in all membranes over physiological temperatures. Around the high-temperature functioning limit of the membranes, the exchange rates became higher. When temperature was further increased, H/D exchange rates went over a maximum and afterwards decreased (due to full H/D exchange and/or protein denaturing). Maximal H/D exchange rate temperatures correlated neither with the disorder nor with the unsaturation of lipids. In membrane proteins, in contrast to lysozyme, the onsets of sizable H/D exchange rates were the onsets of irreversible denaturing as well. Seemingly, at temperatures where protein self-dynamics allows large-scale H/D exchange, lipid-protein coupling is so weak that proteins prefer aggregating to limit the exposure of their hydrophobic surface regions to water. In all membranes studied, dynamics seemed to be governed by lipids around the low-temperature limit, and by proteins around the high-temperature limit of membrane functionality

Emergent Functional Properties of Neuronal Networks with Controlled Topology

The interplay between anatomical connectivity and dynamics in neural networks plays a key role in the functional properties of the brain and in the associated connectivity changes induced by neural diseases. However, a detailed experimental investigation of this interplay at both cellular and population scales in the living brain is limited by accessibility. Alternatively, to investigate the basic operational principles with morphological, electrophysiological and computational methods, the activity emerging from large in vitro networks of primary neurons organized with imposed topologies can be studied. Here, we validated the use of a new bio-printing approach, which effectively maintains the topology of hippocampal cultures in vitro and investigated, by patch-clamp and MEA electrophysiology, the emerging functional properties of these grid-confined networks. In spite of differences in the organization of physical connectivity, our bio-patterned grid networks retained the key properties of synaptic transmission, short-term plasticity and overall network activity with respect to random networks. Interestingly, the imposed grid topology resulted in a reinforcement of functional connections along orthogonal directions, shorter connectivity links and a greatly increased spiking probability in response to focal stimulation. These results clearly demonstrate that reliable functional studies can nowadays be performed on large neuronal networks in the presence of sustained changes in the physical network connectivity

Dominant inhibition of Fas ligand-mediated apoptosis due to a heterozygous mutation associated with autoimmune lymphoproliferative syndrome (ALPS) Type Ib

<p>Abstract</p> <p>Background:</p> <p>Autoimmune lymphoproliferative syndrome (ALPS) is a disorder of lymphocyte homeostasis and immunological tolerance due primarily to genetic defects in Fas (CD95/APO-1; <it>TNFRSF6</it>), a cell surface receptor that regulates apoptosis and its signaling apparatus.</p> <p>Methods:</p> <p>Fas ligand gene mutations from ALPS patients were identified through cDNA and genomic DNA sequencing. Molecular and biochemical assessment of these mutant Fas ligand proteins were carried out by expressing the mutant FasL cDNA in mammalian cells and analysis its effects on Fas-mediated programmed cell death.</p> <p>Results:</p> <p>We found an ALPS patient that harbored a heterozygous A530G mutation in the FasL gene that replaced Arg with Gly at position 156 in the protein's extracellular Fas-binding region. This produced a dominant-interfering FasL protein that bound to the wild-type FasL protein and prevented it from effectively inducing apoptosis.</p> <p>Conclusion:</p> <p>Our data explain how a naturally occurring heterozygous human FasL mutation can dominantly interfere with normal FasL apoptotic function and lead to an ALPS phenotype, designated Type Ib.</p