On identifying codes that are robust against edge changes

AbstractAssume that G=(V, E) is an undirected graph, and C⊆V. For every v∈V, denote Ir(G; v)={u∈C: d(u,v)≤r}, where d(u,v) denotes the number of edges on any shortest path from u to v in G. If all the sets Ir(G; v) for v∈V are pairwise different, and none of them is the empty set, the code C is called r-identifying. The motivation for identifying codes comes, for instance, from finding faulty processors in multiprocessor systems or from location detection in emergency sensor networks. The underlying architecture is modelled by a graph. We study various types of identifying codes that are robust against six natural changes in the graph; known or unknown edge deletions, additions or both. Our focus is on the radius r=1. We show that in the infinite square grid the optimal density of a 1-identifying code that is robust against one unknown edge deletion is 1/2 and the optimal density of a 1-identifying code that is robust against one unknown edge addition equals 3/4 in the infinite hexagonal mesh. Moreover, although it is shown that all six problems are in general different, we prove that in the binary hypercube there are cases where five of the six problems coincide

Automated Discharging Arguments for Density Problems in Grids

Discharging arguments demonstrate a connection between local structure and global averages. This makes it an effective tool for proving lower bounds on the density of special sets in infinite grids. However, the minimum density of an identifying code in the hexagonal grid remains open, with an upper bound of $\frac{3}{7} \approx 0.428571$ and a lower bound of $\frac{5}{12}\approx 0.416666$. We present a new, experimental framework for producing discharging arguments using an algorithm. This algorithm replaces the lengthy case analysis of human-written discharging arguments with a linear program that produces the best possible lower bound using the specified set of discharging rules. We use this framework to present a lower bound of $\frac{23}{55} \approx 0.418181$ on the density of an identifying code in the hexagonal grid, and also find several sharp lower bounds for variations on identifying codes in the hexagonal, square, and triangular grids.Comment: This is an extended abstract, with 10 pages, 2 appendices, 5 tables, and 2 figure

Information hiding through variance of the parametric orientation underlying a B-rep face

Watermarking technologies have been proposed for many different,types of digital media. However, to this date, no viable watermarking techniques have yet emerged for the high value B-rep (i.e. Boundary Representation) models used in 3D mechanical CAD systems. In this paper, the authors propose a new approach (PO-Watermarking) that subtly changes a model's geometric representation to incorporate a 'transparent' signature. This scheme enables software applications to create fragile, or robust watermarks without changing the size of the file, or shape of the CAD model. Also discussed is the amount of information the proposed method could transparently embed into a B-rep model. The results presented demonstrate the embedding and retrieval of text strings and investigate the robustness of the approach after a variety of transformation and modifications have been carried out on the data

The Fragility of Quantum Information?

We address the question whether there is a fundamental reason why quantum information is more fragile than classical information. We show that some answers can be found by considering the existence of quantum memories and their dimensional dependence.Comment: Essay on quantum information: no new results. Ten pages, published in Lec. Notes in Comp. Science, Vol. 7505, pp. 47-56 (2012. One reference adde

Spatial Interference Detection for Mobile Visible Light Communication

Taking advantage of the rolling shutter effect of CMOS cameras in smartphones is a common practice to increase the transfered data rate with visible light communication (VLC) without employing external equipment such as photodiodes. VLC can then be used as replacement of other marker based techniques for object identification for Augmented Reality and Ubiquitous computing applications. However, the rolling shutter effect only allows to transmit data over a single dimension, which considerably limits the available bandwidth. In this article we propose a new method exploiting spacial interference detection to enable parallel transmission and design a protocol that enables easy identification of interferences between two signals. By introducing a second dimension, we are not only able to significantly increase the available bandwidth, but also identify and isolate light sources in close proximity

Solar Magnetic Tracking. I. Software Comparison and Recommended Practices

Feature tracking and recognition are increasingly common tools for data analysis, but are typically implemented on an ad-hoc basis by individual research groups, limiting the usefulness of derived results when selection effects and algorithmic differences are not controlled. Specific results that are affected include the solar magnetic turnover time, the distributions of sizes, strengths, and lifetimes of magnetic features, and the physics of both small scale flux emergence and the small-scale dynamo. In this paper, we present the results of a detailed comparison between four tracking codes applied to a single set of data from SOHO/MDI, describe the interplay between desired tracking behavior and parameterization of tracking algorithms, and make recommendations for feature selection and tracking practice in future work.Comment: In press for Astrophys. J. 200

The P3 platform: an approach and software system for developing diagrammatic model-based methods in design research

Many issues in design and design management have been explored by building models which capture the relationships between different aspects of the problem at hand. These models require computer support to construct and analyse. However, appropriate modelling tools can be time-consuming to develop in a research environment. Reflecting upon five design research projects, this paper proposes that such projects can be facilitated by recognising the iterative and tightly-coupled nature of research and tool development, and by attempting to minimise the effort of solution prototyping within this process. Our approach is enabled by a software platform which can be rapidly configured to implement many conceivable modelling approaches. This configurability is complemented by an emerging library of modelling and analysis approaches tailored to explore design process systems. The platform-based approach enables any mix of modelling concepts to be easily created. We propose it could thus help researchers to explore a wide range of questions without being constrained to existing conventions for modelling – or for model integration

Impurity-induced sub-gap bound gap states in alkali doped iron chalcogenide superconductors

Measurements of the local density of states near impurities can be useful for identifying the superconducting gap structure in alkali doped iron chalcogenide superconductors K_xFe_{2-y}Se_2. Here, we study the effects of nonmagnetic and magnetic impurities within a nearest neighbor d-wave and next-nearest neighbor s-wave superconducting state. For both repulsive and attractive nonmagnetic impurities, it is shown that sub-gap bound states exist only for d-wave superconductors with the positions of these bound states depending rather sensitively on the electron doping level. Further, for such disorder Coulomb interactions can lead to local impurity-induced magnetism in the case of d-wave superconductivity. For magnetic impurities, both s-wave and d-wave superconducting states support sub-gap bound states. The above results can be explained by a simple analytic model that provides a semi-quantitative understanding of the variation of the impurity bound states energies as a function of impurity potential and chemical doping level.Comment: 8 pages, 7 figure