19675613
Near Optimal Unconditionally Secure Authentication
An efficient unconditionally secure authentication scheme with arbitration is presented which is also secure against attacks by the arbiter. Arguments are presented that suggest this scheme is almost optimal with respect to codeword lengths, and when many messages are sent the amount of key data per message approaches, at worst, 1/3 more than the best possible. An improved unconditionally secure authentication scheme without arbitration is also briefly presented.
29618653
An Algorithm for Calculating the Availability and Mean Time to Restore for Communication Through a Network
Abstract This paper presents algorithms for approximate calculation of the availability, Mean Time To Failure (MTTF) and Mean Time To Restore (MTTR) for communication through a network, as experienced by a certain origin-destination pair. The approximations should lead to quite minor errors, and in the case of the availability algorithm bounds on these errors are computed. The availability algorithm is similar to earlier algorithms [2], but the algorithm for calculating MTTF and MTTR is new as far as the authors are aware. In addition to presenting the calculation methods, a theory which predicts the computation time for the availability algorithm is developed and verified by comparison with the results of trials. The computation time for any algorithm for network availability must be expected to rise exponentially with the size of the network, but it has been found that in real networks, the values of network parameters are such that quite large networks can be analysed by the algorithm presented in this paper.
16320765
Small World Dynamics and The Process of Knowledge Diffusion: The Case of The Metropolitan Area of Greater Santiago De Chile
This paper aims to understand some of the mechanisms which dominate the phenomenon of knowledge diffusion in the process that is called â€˜interactive learningâ€™. We examine how knowledge spreads in a network in which agents have â€˜face-to-faceâ€™ learning interactions. We define a social network structured as a graph consisting of agents (vertices) and connections (edges) and situated on a grid which resembles the geographical characteristics of the metropolitan area of Greater Santiago de Chile. The target of this simulation is to test whether knowledge diffuses homogeneously or whether it follows some biased path generating geographical divergence between a core area and a periphery. We also investigate the efficiency of our â€˜preferenceâ€™ model of agent decision-making and show that this system evolves towards a small-world type network.
636531
Design for test and the cost of quality
A generalized methodology is presented which can be used to select a cost effective design-for-test technique for use in the design process. The intent is to factor in both increased research and development costs as well as increased production costs. The authors also correlate the expected levels of test coverage. Thus, for a particular design, it is possible to predict the increase in cost of research and development, and increased production costs, and correlate this with test coverage. The tangible factors in the cost of quality can be determined.<<ETX>>
12238212
Taking a RaSP to Enterprise Stakeholder Dissonance
We present a model based approach to the resolution of conflict between the many stakeholders involved in large scale information system deployment and use. The work is based on the authors experience of more than $20B of outsourcing contracts. The approach, rapid scenario planning (RaSP) yields concrete evidence of the underlying assumptions that drive design and deployment, as well as critical insights into systems and business dynamics. Social and long term management and governance benefits are also obvious. Our implementation of the methodology is supported by specific tools, however equivalent general purpose tools can be used to support this methodology.
58005408
SEAMS 2007: Software Engineering for Adaptive and Self-Managing Systems
The objective of the SEAMS (Software Engineering for Adaptive and Self-managing Systems) workshops is to consolidate the interest in the software engineering community on autonomic, self-managing, self-healing, self-optimizing, self-configuring, and self-adaptive systems. SEAMS provides a forum for researchers to share new results, raise awareness, and promote collaboration within the community. The SEAMS 2007 workshop builds on the great success of SEAMS 2006 at ICSE in Shanghai to assess progress and identify challenges in this area.
34686410
ICSE 97 program update
A terrific 4-parallel track program has emerged from the recent meetings of the ICSE 97 Program Committee and Program Coordinators. As described in earlier columns here in SEN, we have worked hard to develop a variety of new program elements and to construct a meeting of high value to both practitioners and researchers alike. The Advance Program will provide all the details, and will appear both in the next issue of SEN as well as in the mail and on the ICSE 97 website (http://www.ics.uci.edu/icse97/). Until then we thought we'd provide you with a brief update.