Deterministic meeting of sniffing agents in the plane

Two mobile agents, starting at arbitrary, possibly different times from arbitrary locations in the plane, have to meet. Agents are modeled as discs of diameter 1, and meeting occurs when these discs touch. Agents have different labels which are integers from the set of 0 to L-1. Each agent knows L and knows its own label, but not the label of the other agent. Agents are equipped with compasses and have synchronized clocks. They make a series of moves. Each move specifies the direction and the duration of moving. This includes a null move which consists in staying inert for some time, or forever. In a non-null move agents travel at the same constant speed, normalized to 1. We assume that agents have sensors enabling them to estimate the distance from the other agent (defined as the distance between centers of discs), but not the direction towards it. We consider two models of estimation. In both models an agent reads its sensor at the moment of its appearance in the plane and then at the end of each move. This reading (together with the previous ones) determines the decision concerning the next move. In both models the reading of the sensor tells the agent if the other agent is already present. Moreover, in the monotone model, each agent can find out, for any two readings in moments t1 and t2, whether the distance from the other agent at time t1 was smaller, equal or larger than at time t2. In the weaker binary model, each agent can find out, at any reading, whether it is at distance less than \r{ho} or at distance at least \r{ho} from the other agent, for some real \r{ho} > 1 unknown to them. Such distance estimation mechanism can be implemented, e.g., using chemical sensors. Each agent emits some chemical substance (scent), and the sensor of the other agent detects it, i.e., sniffs. The intensity of the scent decreases with the distance.Comment: A preliminary version of this paper appeared in the Proc. 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO 2016), LNCS 998

Adjusting insulin doses : from knowledge to decision

The aim of this study was to analyze the absence of adjustment of insulin doses in type 1 diabetic patients with poorly controlled diabetes. Twenty-eight patients (HbA1c higher than 8.5% during the last 6 months, performing at least three capillary blood glucose determinations per day), completed a questionnaire on the degree of confidence in their own knowledge, the nature of their health beliefs, their fear of hypoglycemia, their own appreciation on how they adjust their insulin doses (subjective score). An analysis of their diabetes logbook provided an objective score of the adjustment of doses actually performed. The results show that the subjective and objective scores of adjustment were not significantly correlated. Further there was a significant negative correlation between the score of uncertainty on knowledge and the subjective score of adjustment of the insulin doses, but not with the objective score. There was a significant correlationbetween the score of positive health beliefs and the subjective score of adjustment of the insulin doses, but not with the objective score. No correlation was found between the score of fear of hypoglycemia and the subjective score of adjustment of the insulin doses. Correlation with the objective score was higher, but not significant. Actually, the fear of hypoglycemia was the most frequently given reason for not adjusting the insulin doses, when the question was asked to the patients with an open answer. This study illustrates the difference between thinking and doing. It also shows that the degree of confidence in one’s own knowledge, the health beliefs, and the fear of hypoglycemia differently influence the perception that the patients have of their behavior, and what they really do. © 2004 Elsevier Ireland Ltd. All rights reserved

Ionisation by quantised electromagnetic fields: The photoelectric effect

In this paper we explain the photoelectric effect in a variant of the standard model of non relativistic quantum electrodynamics, which is in some aspects more closely related to the physical picture, than the one studied in [BKZ]: Now we can apply our results to an electron with more than one bound state and to a larger class of electron-photon interactions. We will specify a situation, where ionisation probability in second order is a weighted sum of single photon terms. Furthermore we will see, that Einstein's equality $$E_{kin}=h\nu-\bigtriangleup E>0$$ for the maximal kinetic energy $E_{kin}$ of the electron, energy $h\nu$ of the photon and ionisation gap $\bigtriangleup E$ is the crucial condition for these single photon terms to be nonzero.Comment: 59 pages, LATEX2

Robots with Lights: Overcoming Obstructed Visibility Without Colliding

Robots with lights is a model of autonomous mobile computational entities operating in the plane in Look-Compute-Move cycles: each agent has an externally visible light which can assume colors from a fixed set; the lights are persistent (i.e., the color is not erased at the end of a cycle), but otherwise the agents are oblivious. The investigation of computability in this model, initially suggested by Peleg, is under way, and several results have been recently established. In these investigations, however, an agent is assumed to be capable to see through another agent. In this paper we start the study of computing when visibility is obstructable, and investigate the most basic problem for this setting, Complete Visibility: The agents must reach within finite time a configuration where they can all see each other and terminate. We do not make any assumption on a-priori knowledge of the number of agents, on rigidity of movements nor on chirality. The local coordinate system of an agent may change at each activation. Also, by definition of lights, an agent can communicate and remember only a constant number of bits in each cycle. In spite of these weak conditions, we prove that Complete Visibility is always solvable, even in the asynchronous setting, without collisions and using a small constant number of colors. The proof is constructive. We also show how to extend our protocol for Complete Visibility so that, with the same number of colors, the agents solve the (non-uniform) Circle Formation problem with obstructed visibility

Rational matrix pseudodifferential operators

The skewfield K(d) of rational pseudodifferential operators over a differential field K is the skewfield of fractions of the algebra of differential operators K[d]. In our previous paper we showed that any H from K(d) has a minimal fractional decomposition H=AB^(-1), where A,B are elements of K[d], B is non-zero, and any common right divisor of A and B is a non-zero element of K. Moreover, any right fractional decomposition of H is obtained by multiplying A and B on the right by the same non-zero element of K[d]. In the present paper we study the ring M_n(K(d)) of nxn matrices over the skewfield K(d). We show that similarly, any H from M_n(K(d)) has a minimal fractional decomposition H=AB^(-1), where A,B are elements of M_n(K[d]), B is non-degenerate, and any common right divisor of A and B is an invertible element of the ring M_n(K[d]). Moreover, any right fractional decomposition of H is obtained by multiplying A and B on the right by the same non-degenerate element of M_n(K [d]). We give several equivalent definitions of the minimal fractional decomposition. These results are applied to the study of maximal isotropicity property, used in the theory of Dirac structures.Comment: 20 page

Many parameter Hoelder perturbation of unbounded operators

If $u\mapsto A(u)$ is a $C^{0,\alpha}$-mapping, for $0< \alpha \le 1$, having as values unbounded self-adjoint operators with compact resolvents and common domain of definition, parametrized by $u$ in an (even infinite dimensional) space, then any continuous (in $u$) arrangement of the eigenvalues of $A(u)$ is indeed $C^{0,\alpha}$ in $u$.Comment: LaTeX, 4 pages; The result is generalized from Lipschitz to Hoelder. Title change

The locally covariant Dirac field

We describe the free Dirac field in a four dimensional spacetime as a locally covariant quantum field theory in the sense of Brunetti, Fredenhagen and Verch, using a representation independent construction. The freedom in the geometric constructions involved can be encoded in terms of the cohomology of the category of spin spacetimes. If we restrict ourselves to the observable algebra the cohomological obstructions vanish and the theory is unique. We establish some basic properties of the theory and discuss the class of Hadamard states, filling some technical gaps in the literature. Finally we show that the relative Cauchy evolution yields commutators with the stress-energy-momentum tensor, as in the scalar field case.Comment: 36 pages; v2 minor changes, typos corrected, updated references and acknowledgement

On Z-gradations of twisted loop Lie algebras of complex simple Lie algebras

We define the twisted loop Lie algebra of a finite dimensional Lie algebra $\mathfrak g$ as the Fr\'echet space of all twisted periodic smooth mappings from $\mathbb R$ to $\mathfrak g$. Here the Lie algebra operation is continuous. We call such Lie algebras Fr\'echet Lie algebras. We introduce the notion of an integrable $\mathbb Z$-gradation of a Fr\'echet Lie algebra, and find all inequivalent integrable $\mathbb Z$-gradations with finite dimensional grading subspaces of twisted loop Lie algebras of complex simple Lie algebras.Comment: 26 page

Perturbation Theory around Non-Nested Fermi Surfaces I. Keeping the Fermi Surface Fixed

The perturbation expansion for a general class of many-fermion systems with a non-nested, non-spherical Fermi surface is renormalized to all orders. In the limit as the infrared cutoff is removed, the counterterms converge to a finite limit which is differentiable in the band structure. The map from the renormalized to the bare band structure is shown to be locally injective. A new classification of graphs as overlapping or non-overlapping is given, and improved power counting bounds are derived from it. They imply that the only subgraphs that can generate $r$ factorials in the $r^{\rm th}$ order of the renormalized perturbation series are indeed the ladder graphs and thus give a precise sense to the statement that `ladders are the most divergent diagrams'. Our results apply directly to the Hubbard model at any filling except for half-filling. The half-filled Hubbard model is treated in another place.Comment: plain TeX with postscript figures in a uuencoded gz-compressed tar file. Put it on a separate directory before unpacking, since it contains about 40 files. If you have problems, requests or comments, send e-mail to [email protected]