Structured Reactive Controllers

Service robots, such as autonomous office couriers or robot tourguides, must be both reliable and efficient. This requires them to flexibly interleave their tasks, exploit opportunities, quickly plan their course of action, and, if necessary, revise their intended activities. In this paper, we show how structured reactive controllers (SRCs) satisfy these requirements. The novel feature of SRCs is that they employ and reason about plans that specify and synchronize concurrent percept-driven behavior. Powerful control abstractions enable SRCs to integrate physical action, perception, planning, and communication in a uniform framework and to apply fast but imperfect computational methods without sacrificing reliability and flexibility. Concurrent plans are represented in a transparent and modular form so that automatic planning processes can reason about the plans and revise them. We present experiments in which SRCs are used to control two autonomous mobile robots. In one of them an SRC controlled the course of action of a museum tourguide robot that has operated for thirteen days, more than ninetyfour hours, completed 620 tours, and presented 2668 exhibits.     

An approach to analyzing and planning post-merger IS integration: Insights from two field studies

Information systems (IS) integration is among the most challenging tasks in corporate mergers and acquisitions (M&As). In this paper we propose and illustrate the use of an approach to analyzing and planning post-merger IS integration that extends general theory for IS planning, considering the specific characteristics of the M&A context. We highlight that planning effectiveness is possible to achieve in fundamentally different ways, dependent on the characteristics of the merger or acquisition at hand.

Business Object Modeling, Validation, and Mediation for Integrating Heterogeneous Application Systems

When different business organizations come together to conduct a joint business in a virtual enterprise environment, their application systems need to have a convenient way to specify the services needed from other systems and to transfer data needed by these services. The transferred data needs to be validated and, in some cases, mediated to meet the constraints and data representation requirements of both the source and target application systems. Ideally, the validation and mediation tasks should be done outside of the legacy application systems so that these systems do not have to be modified. In this work, the Business Object Documents (BODs) introduced by the Open Applications Group (OAG) are used for specifying business operations and transferring data among application systems. We use an active object model to model BODs. The model captures not only the data attributes and methods associated with these business objects, but also events and rules for specifying and triggering the enforcement of attribute constraints and inter-attribute constraints and the activation of data mediation operations. The conceptual models of these BODs with their added semantics are used to generate entity classes, converters and skeletal programs needed for enforcing constraints and for converting data. These generated object classes and software components in Java constitute the platform-independent adapters through which heterogeneous application systems inter-operate over CORBA and RMI communication infrastructures. A distributed approach to data validation and mediation is used. It allows the generated code for validation and mediation to be distributed and processed at different sites, thus avoiding the potential network bottleneck of a centralized approach to the validation and mediation of business object documents.     

Sensors structures and regional detectability of parabolic distributed systems

In this paper, we deal with the linear infinite dimensional systems in a Hilbert space where the dynamics of the system is governed by strongly continuous semi-groups. We study the concept of asymptotic (exponential) regional detectability in connection with the structures of sensors for a class of parabolic distributed parameter systems. For different sensors structures, we give the characterization of the asymptotic (exponential) regional detectability in order that asymptotic (exponential) regional observability be achieved. Furthermore, we apply these results to the regional observer for distributed parameter diffusion systems.     

Robust Estimation of GARMA Model Parameters with an Application to Cointegration among Interest Rates of Industrialized Countries

We review the literature on long memory ARFIMA and GARMA models andintroduce a new efficient estimator for GARMA models, which we show to berobust. Next we conduct a Monte Carlo study to demonstate the power of theDickie–Fuller test when the data are generated from a stationary GARMAprocess. We conclude with a brief discussion of cointegration in the contextof GARMA models with an application to international interest rates.     

From concepts to consistent object specifications: Translation of a domain-oriented feature framework into practice

A steady increase in consumer demands,and severe constraints from both a somewhat damaged environment and newly installed government policies,require today‘s product design and development to be faster and more efficient than ever before,yet utilizing even fewer resources.New holistic approaches,such at total product life cycle modeling which embraces all aspercts of a product‘s life cycle,are current attempts to solve these problems,Within the field of product design and modeling,feature technology has proved to be one very promising solution component.Owing to the tremendous increase in information technology,to transfer from low level data processing towards knowledge modeling and information processing is about to bring a change in almost every computerized application.From this viewpoint,current problems of both feature frameworks and feature systems are analyzed in respect to static and dynamic consistency breakdowns.The analysis ranges from early stager of designing(feature)concepts to final system implementation and application.For the first tie,an integrated view is given on approaches,solutions and practical experience,with feature concepts and structures,providing both a feature framework and its implementation with sufficient system architecture and computational power to master a fair number of known consistency breakdowns,while providing for robust contexts for feature semantics and integrated models.Within today;s heavy use of information technology these are pre-requisites if the full potential of feature technology is to be successfully translated into practice.     

Tool integration for flexible simulation of distributed algorithms

Over the last two decades, considerable research has been done in distributed operating systems, which can be attributed to faster processors and better communication technologies. A distributed operating system requires distributed algorithms to provide basic operating system functionality like mutual exclusion, deadlock detection, etc. A number of such algorithms have been proposed in the literature. Traditionally, these distributed algorithms have been presented in a theoretical way, with limited attempts to simulate actual working models. This paper discusses our experience in simulating distributed algorithms with the aid of some existing tools, including OPNET and Xplot. We discuss our efforts to define a basic model‐based framework for rapid simulation and visualization, and illustrate how we used this framework to evaluate some classic algorithms. We have also shown how the performance of different algorithms can be compared based on some collected statistics. To keep the focus of this paper on the approach itself, and our experience with tool integration, we only discuss some relatively simple models. Yet, the approach can be applied to more complex algorithm specifications. Copyright © 2001 John Wiley & Sons, Ltd.     

Application of the modified Taylor approximation

In this paper we introduce and describe a new scheme for the numerical integration of smooth functions. The scheme is based on the modified Taylor expansion and is suitable for functions that exhibit near-sinusoidal or repetitive behaviour. We discuss the method and its rate of convergence, then implement it for the approximation of certain integrals. Examples include integrands involving Airy wave, Bessel, Gamma, and elliptic functions. The results, from the data in the tables, demonstrate that the method converges rapidly and approximates the integral as well as some well-known numerical integration methods used with sufficiently small step sizes.