The Role of Structural Reflection in Distributed Virtual Reality

The emergence of collaborative virtual world applications that run over the Internet has presented Virtual Reality (VR) application designers with new challenges. In an environment where the public internet streams multimedia data and is constantly under pressure to deliver over widely heterogeneous user-platforms, there has been a growing need that distributed virtual world applications be aware of and adapt to frequent variations in their context of execution. In this paper, we argue that in contrast to research efforts targeted at improvement of scalability, persistence and responsiveness capabilities, much less attempts have been aimed at addressing the flexibility, maintainability and extensibility requirements in contemporary Distributed VR applications. We propose the use of structural reflection as an approach that not only addresses these requirements but also offers added value in the form of providing a framework for scalability, persistence and responsiveness that is itself flexible, maintainable and extensible

OpenPING: A Reflective Middleware for the Construction of Adaptive Networked Game Applications

The emergence of distributed Virtual Reality (VR) applications that run over the Internet has presented networked game application designers with new challenges. In an environment where the public internet streams multimedia data and is constantly under pressure to deliver over widely heterogeneous user-platforms, there has been a growing need that distributed VR applications be aware of and adapt to frequent variations in their context of execution. In this paper, we argue that in contrast to research efforts targeted at improvement of scalability, persistence and responsiveness capabilities, much less attempts have been aimed at addressing the flexibility, maintainability and extensibility requirements in contemporary distributed VR platforms. We propose the use of structural reflection as an approach that not only addresses these requirements but also offers added value in the form of providing a framework for scalability, persistence and responsiveness that is itself flexible, maintainable and extensible. We also present an adaptive middleware platform implementation called OpenPING1 that supports our proposal in addressing these requirements

Interoperating with heterogeneous Mobile Services

Mobile applications are now developed upon a wide range of service development platforms, commonly referred to as middleware. However, the diversity of those available presents a problem for mobile client development. How can a single client implementation interoperate with heterogeneous service implementations

Fine Grained Component Engineering of Adaptive Overlays: Experiences and Perspectives

Recent years have seen significant research being carried out into peer-to-peer (P2P) systems. This work has focused on the styles and applications of P2P computing, from grid computation to content distribution; however, little investigation has been performed into how these systems are built. Component based engineering is an approach that has seen successful deployment in the field of middleware development; functionality is encapsulated in ‘building blocks’ that can be dynamically plugged together to form complete systems. This allows efficient, flexible and adaptable systems to be built with lower overhead and development complexity. This paper presents an investigation into the potential of using component based engineering in the design and construction of peer-to-peer overlays. It is highlighted that the quality of these properties is dictated by the component architecture used to implement the system. Three reusable decomposition architectures are designed and evaluated using Chord and Pastry case studies. These demonstrate that significant improvements can be made over traditional design approaches resulting in much more reusable, (re)configurable and extensible systems

Quantum-mechanical communication theory

Optimum signal reception using quantum-mechanical communication theor

Assessing Financial Vulnerability in the Nonprofit Sector

Effective nonprofit governance relies upon understanding an organization's financial condition and vulnerabilities. However, financial vulnerability of nonprofit organizations is a relatively new area of study. In this paper, we compare two models used to forecast bankruptcy in the corporate sector (Altman 1968 and Ohlson 1980) with the model used by nonprofit researchers (Tuckman and Chang 1991). We find that the Ohlson model has higher explanatory power than either Tuckman and Chang's or Altman's in predicting four different measures of financial vulnerability. However, we show that none of the models, individually or combined, are effective in predicting financial distress. We then propose a more comprehensive model of financial vulnerability by adding two new variables to represent reliance on commercial-type activities to generate revenues and endowment sufficiency. We find that this model outperforms Ohlson's model and performs substantially better in explaining and predicting financial vulnerability. Hence, the expanded model can be used as a guide for understanding the drivers of financial vulnerability and for identifying more effective proxies for nonprofit sector financial distress for use in future research. This publication is Hauser Center Working Paper No. 27. The Hauser Center Working Paper Series was launched during the summer of 2000. The Series enables the Hauser Center to share with a broad audience important works-in-progress written by Hauser Center scholars and researchers

Maximum size binary matroids with no AG(3,2)-minor are graphic

We prove that the maximum size of a simple binary matroid of rank $r \geq 5$ with no AG(3,2)-minor is $\binom{r+1}{2}$ and characterise those matroids achieving this bound. When $r \geq 6$, the graphic matroid $M(K_{r+1})$ is the unique matroid meeting the bound, but there are a handful of smaller examples. In addition, we determine the size function for non-regular simple binary matroids with no AG(3,2)-minor and characterise the matroids of maximum size for each rank

The Gordon-Haus effect for modified NLS solitons

Random jitter in the soliton arrival time (the Gordon-Haus effect) is analyzed for solitons being solutions of the integrable modified nonlinear Schroedinger equation. It is shown that the mean square fluctuation of the soliton position depends on the soliton parameters which can be properly adjusted to suppress the Gordon-Haus jitter.Comment: LaTeX, 7 pages, 3 figures, to be published in Europhys. Let