The User Requirements Notation (URN) is a standard modeling language that includes two complementary views, one for goals with the Goaloriented Requirement Language (GRL) and one for scenarios/processes with Use Case Maps (UCM). The URN standard, however, does not provide means of checking consistency between the GRL and UCM views, leading to models that are potentially erroneous. This paper pr...

The Nearest subspace classifier (NSS) finds an estimation of the underlying subspace within each class and assigns data points to the class that corresponds to its nearest subspace. This paper mainly studies how well NSS can be generalized to new samples. It is proved that NSS is strongly consistent under certain assumptions. For completeness, NSS is evaluated through experiments on various sim...

Traffic repositories with TCP/IP header information are very important for network analysis. Researchers often assume that such repositories reliably represent all traffic that has been flowing over the network; little thoughts are made regarding the consistency of these repositories. Still, for various reasons, the traffic capturing process may have missed packets. For certain kinds of analysi...

Information about the incidence and prevalence of diseases and injuries at the population level is frequently required for benchmarking, for advocacy of particular policies, to assist in setting funding priorities, for monitoring achievements towards internationally accepted goals and targets, and to guide technical strategies and responses. In this issue of the Bulletin (pp. 622–628), Kruijsha...

This paper describes methods and tools for automatic safety analysis of UML statechart specifications. Two types of analysis are presented. The first one checks completeness and consistency based on the static structure of the specification, thus it does not requires the generation of the reachability graph. Accordingly, this method scales up well to large systems. The second one performs dynam...

It is shown by a purely syntactic argument how the completeness of resolution in type theory implies the consistency of type theory with axioms of extensionality, descriptions, and infinity. In this system the natural numbers are defined, and Peanos Postulates proved; indeed, classical analysis and much more can be formalized here. Nevertheless, Godels results show that the completeness of reso...

Devices – Models of Computation) Manuscript received: 2 July 2003 Communicating Editor: Sidney A. Morris Copyright© 2004, Australian Computer Society Inc. General permission to republish, but not for profit, all or part of this material is granted, provided that the JRPIT copyright notice is given and that reference is made to the publication, to its date of issue, and to the fact that reprinti...

It has been shown that sets of convergent operators with a shared fixed point can simulate autonomic control mechanisms, but many questions remain about this management technique. We discuss how an autonomous agent can reason about whether its convergent operators share a fixed point with the operators of other agents. Using a concept of time based upon operator repetition, we show that a failu...

Consistency analysis (IDR analysis) has been used to process ENCODE and modENCODE production dataset. This is a non-technical introduction on the statistical method of the consistency analysis (a.k.a. IDR analysis). It describes the consistency analysis on a pair of replicates.