Asymptotic behavior of the density of states on a random lattice

We study the diffusion of a particle on a random lattice with fluctuating local connectivity of average value q. This model is a basic description of relaxation processes in random media with geometrical defects. We analyze here the asymptotic behavior of the eigenvalue distribution for the Laplacian operator. We found that the localized states outside the mobility band and observed by Biroli and Monasson (1999, J. Phys. A: Math. Gen. 32 L255), in a previous numerical analysis, are described by saddle point solutions that breaks the rotational symmetry of the main action in the real space. The density of states is characterized asymptotically by a series of peaks with periodicity 1/q.Comment: 11 pages, 2 figure

Answering the Call for more Accountability

Although the issue of metadata quality is recognized as an important topic within the metadata research community, the cultural heritage sector has been slow to develop methodologies, guidelines and tools for addressing this topic in practice. This paper concentrates on metadata quality specifically within the museum sector and describes the potential of data-profiling techniques for metadata quality evaluation. A case study illustrates the application of a general purpose data-profiling tool on a large collection of metadata records from an ethnographic collection. After an analysis of the results of the case-study the paper reviews further steps in our research and presents the implementation of a metadata quality tool within an open-source collection management software

Relating Inter-Agent and Intra-Agent Specifications (The Case of Live Sequence Charts)

The problem of relating inter-agent and intra-agent behavioral specifications is investigated. These two views are complimentary, in that the former is closer to scenario-based user requirements whereas the latter is design-oriented. We use a graphical, user-friendly and very simple language as inter-agent specification language: Live Sequence Charts (LSC). LSC is presented and its properties are investigated: it is highly succinct, but inexpressive. There are essentially two ways to relate inter-agent and intra-agent specifications: (i) by checking that an intra-agent specification is correct with respect to some LSC specification and (ii) by automatically building an intra-agent specification from an LSC specification. Several variants of these problems exist: closed/open systems and centralized/distributed systems. We give inefficient but optimal algorithms solving all problems, besides synthesis of open distributed systems, which we show is undecidable. All the problems considered are difficult, even for a very restricted subset of LSCs, without alternatives, interleaving, conditions nor loops. We investigate the cost of extending the language with control flow constructs, conditions, real-time and symbolic instances. An implementation of the algorithms is proposed. The applicability of the language is illustrated on a real-world case study.(DOCSC06)--FUNDP, 200