On d-antimagic labelings of prisms

title: Complete characterization of almost Moore digraphs of degree three
abstract: It is well known that Moore digraphs do not exist except for trivial cases (degree 1 or diameter 1), but there are digraphs of diameter two and arbitrary degree which miss the Moore bound by one. No 2004 Wiley Periodicals, Inc.

title: Bounds on the number of isolates in sum graph labeling
abstract: A simple undirected graph H is called a sum graph if there is a labeling L of the vertices of H into distinct positive integers such that any two vertices u and v of H are adjacent if and only if there is a vertex w with label L(w )= L(u )+ L(v). The sum number � (G) of a graph G =( V; E) is the least integer r such that the graph H consisting of G and r isolated vertices is a sum graph. It is clear that � (G)6|E|. In this paper, we discuss general upper and lower bounds on the sum number. In particular, we prove that, over all graphs G =( V; E) with 5xed |V |?3 and |E|, the average of � (G) is at least |E |− 3|V |(log|V |)=[log(( |V | 2 )=|E|)] −| V |− 1. In other words, for most graphs, � (G) ∈ (|E|).

title: Connected graphs which are not mod sum graphs
abstract: In this paper we prove that no wheel with the exception of W 4 can be a mod sum graph. We also give the unique (up to multiplication by positive integers) mod sum labelling of W 4 . We also prove that the symmetric complete bipartite graph K n . n is not a mod sum graph.

title: Characterization of eccentric digraphs
abstract: The eccentric digraphED(G) of a digraph G represents the binary relation, defined on the vertex set of G, of being 'eccentric'; that is, there is an arc from u to v in ED(G) if and only if v is at maximum distance from u in G. A digraph G is said to be eccentric if there exists a digraph H such that G=ED(H). This paper is devoted to the study of the following two questions: what digraphs are eccentric and when the relation of being eccentric is symmetric. We present a characterization of eccentric digraphs, which in the undirected case says that a graph G is eccentric iff its complement graph G@? is either self-centered of radius two or it is the union of complete graphs. As a consequence, we obtain that all trees except those with diameter 3 are eccentric digraphs. We also determine when ED(G) is symmetric in the cases when G is a graph or a digraph that is not strongly connected.

title: Minimum Diameter of Diregular Digraphs of Degree 2
abstract: Etude de certaines relations entre le nombre de sommets, degre et diametre de graphes finis diregulaires. Les trois problemes consideres sont N(d,k), K(u,d) et D(u, k) ou, autrement dit, trouver le nombre maximum possible de sommets etant donnes le degre d et le diametre k; trouver le diametre minimum possible etant donnes le nombre de sommets n et le degre d et trouver le degre minimum possible etant donnes le nombre de sommets n et le diametre k respectivement

title: Concurrency Among Strangers
abstract: Programmers write programs, expressing plans for machines to execute. When composed so that they may cooperate, plans may instead interfere with each other in unanticipated ways. Plan coordination is the art of simultaneously enabling plans to cooperate, while avoiding hazards of destructive plan interference. For sequential computation within a single machine, object programming supports plan coordination well. For concurrent computation, this paper shows how hard it is to use locking to prevent plans from interfering without also destroying their ability to cooperate.

title: Information measures for object recognition accommodating signature variability
abstract: This paper presents measures characterizing the information content of remote observations of ground scenes imaged via optical and infrared sensors. Object recognition is posed in the context of deformable templates; the special Euclidean group is used to accommodate geometric variation of object pose. Principal component analysis of object signatures is used to represent and efficiently accommodate variation in object signature due to changes in the thermal state of the object surface. Mutual information measures, which are independent of the recognition system, are calculated quantifying both the information gain due to remote observations of the scene and the information loss due to signature variability. Signature model mismatch is quantitatively examined using the Kullback-Leibler divergence. Expressions are derived quadratically approximating the posterior conditional entropy on the orthogonal group for high signal-to-noise ratio. It is demonstrated that quadratic modules accurately characterize the posterior entropy for broad ranges of signal-to-mise ratio. Information gain in multiple-sensor scenarios is quantified, and it is demonstrated that the cost of signature uncertainty for the Comanche series of FLIR images collected by the US Army Night Vision Electronic Sensors Directorate is approximately 0.8 bits with an associated near doubling of mean-squared error uncertainty in pose.

title: A stochastic model for studying the laminar structure of cortex from MRI
abstract: The human cerebral cortex is a laminar structure about 3 mm thick, and is easily visualized with current magnetic resonance (MR) technology. The thickness of the cortex varies locally by region, and is likely to be influenced by such factors as development, disease and aging. Thus, accurate measurements of local cortical thickness are likely to be of interest to other researchers. We develop a parametric stochastic model relating the laminar structure of local regions of the cerebral cortex to MR image data. Parameters of the model include local thickness, and statistics describing white, gray and cerebrospinal fluid (CSF) image intensity values as a function of the normal distance from the center of a voxel to a local coordinate system anchored at the gray/white matter interface. Our fundamental data object, the intensity-distance histogram (IDH), is a two-dimensional (2-D) generalization of the conventional 1-D image intensity histogram, which indexes voxels not only by their intensity value, but also by their normal distance to the gray/white interface. We model the IDH empirically as a marked Poisson process with marking process a Gaussian random field model of image intensity indexed against normal distance. In this paper, we relate the parameters of the IDH model to the local geometry of the cortex. A maximum-likelihood framework estimates the parameters of the model from the data. Here, we show estimates of these parameters for 10 volumes in the posterior cingulate, and 6 volumes in the anterior and posterior banks of the central sulcus. The accuracy of the estimates is quantified via Cramer-Rao bounds. We believe that this relatively crude model can be extended in a straightforward fashion to other biologically and theoretically interesting problems such as segmentation, surface area estimation, and estimating the thickness distribution in a variety of biologically relevant contexts.

title: Objects in Concurrent Logic Programming Languages
abstract: Concurrent Prolog supports object-oriented programming with a clean semantics and additional programming constructs such as incomplete messages, unification, direct broadcasting, and concurrency synchronization [Shapiro 1983a]. While it provides excellent computational support, we claim it does not provide good notation for expressing the abstractions of object-oriented programming. We describe a preprocessor that remedies this problem. The resulting language, Vulcan, is then used as a behicle for exploring new variants of object-oriented programming which become possible in this framework.

title: Large deviations for coding Markov chains and Gibbs random fields
abstract: Fixed block coding schemes for Gibbs random fields are proposed in which the empirical expectations of the local interactions of the Gibbs measure is compared to its expectation with respect to all Gibbs measures having those interactions. The exponential decay of the error probabilities is proven and it is shown that the code rates equal the entropy of the random field. In addition, it is shown that any coding scheme based on regarding the field as a 1-D sequence of symbols has rate greater than the entropy of the field. The theory of fixed length coding is approached from the point of view of large deviations, both for the calculation of the error exponents or error probabilities and for the calculation of the encoding rates or the asymptotic combinatorics of the coding schemes. This approach is also applied to fixed length coding schemes of Markov sources for which estimates on the error exponents and on the rates are derived.