Supporting dispatchability in schedules with consumable resources

Earlier work on scheduling by autonomous systems has demonstrated that schedules in the form of simple temporal networks, with intervals of values for possible event-times, can be made dispatchable, i.e. executable incrementally in real time with guarantees against failure due to unfortunate event-time selections. In this work we show how the property of dispatchability can be extended to networks that include constraints for consumable resources. We first determine conditions for insuring that resource use does not exceed capacity under dispatchable execution for a single sequence of activities, or bout, involving one resource. Then we show how to handle interactions between resource and temporal constraints to insure dispatchability, how to enhance flexibility of resource use under these conditions, and how to handle multiple bouts interspersed with instances of resource release. Finally, we consider methods for establishing the necessary dispatchability conditions during schedule creation (planning stage). The results demonstrate that flexible handling of resource use can be safely extended to the execution layer to provide more effective deployment of consumable resources.     

New approaches for understanding the asymptotic complexity of A* tree searching

Previous studies of A^* tree-searching have modeled heuristics as random variables. The average number of nodes expanded is expressed asymptotically in terms of distance to goal. The conclusion reached is that A^* complexity is an exponential function of heuristic error: Polynomial error implies exponential complexity and logarithmic accuracy is required for polynomial complexity.This paper eliminates simplifying assumptions of earlier studies. Error is replaced by a concept called discrepancy, a measure of the relative attractiveness to A^* of a node for expansion when that node is compared with competing nodes on the solution path. According to our model, in order to have polynomial A^* complexity, it is not necessary to have the logarithmic accuracy described in previous studies. Another way is for a heuristic's values to vary, or cluster, near a central function which grows at least as fast as distance to goal. Generally, logarithmic variation or less is adequate. For one class of heuristics considered, the faster this central function grows, the more is variation from it tolerated.This research has been funded by NCR Corporation.This research has been partially funded by a grant from NCR Corporation.     

Modelling structures in generic space, a condition for adaptiveness of monitoring cognitive agent

The adaptiveness of agents is one of the basic conditions for the autonomy. This paper describes an approach of adaptiveness forMonitoring Cognitive Agents based on the notion of generic spaces. This notion allows the definition of virtual generic processes so that any particular actual process is then a simple configuration of the generic process, that is to say a set of values of parameters. Consequently, generic domain ontology containing the generic knowledge for solving problems concerning the generic process can be developed. This lead to the design of Generic Monitoring Cognitive Agent, a class of agent in which the whole knowledge corpus is generic. In other words, modeling a process within a generic space becomes configuring a generic process and adaptiveness becomes genericity, that is to say independence regarding technology. In this paper, we present an application of this approach on Sachem, a Generic Monitoring Cognitive Agent designed in order to help the operators in operating a blast furnace. Specifically, the NeuroGaz module of Sachem will be used to present the notion of a generic blast furnace. The adaptiveness of Sachem can then be noted through the low cost of the deployment of a Sachem instance on different blast furnaces and the ability of NeuroGaz in solving problem and learning from various top gas instrumentation.     

Reaping the whirlwind: Reply to Harnad's “other bodies,other minds”

Harnad's proposed robotic upgrade of Turing's Test (TT), from a test of linguistic capacity alone to a Total Turing Test (TTT) of linguisticand sensorimotor capacity, conflicts with his claim that no behavioral test provides even probable warrant for attributions of thought because there is no evidence of consciousness besides private experience. Intuitive, scientific, and philosophical considerations Harnad offers in favor of his proposed upgrade are unconvincing. I agree with Harnad that distinguishing real from as if thought on the basis of (presence or lack of) consciousness (thus rejecting Turing (behavioral) testing as sufficient warrant for mental attribution)has the skeptical consequence Harnad accepts — there is in factno evidence for me that anyone else but me has a mind. I disagree with hisacceptance of it! It would be better to give up the neo-Cartesian faith in private conscious experience underlying Harnad's allegiance to Searle's controversial Chinese Room Experiment than give up all claim to know others think. It would be better to allow that (passing) Turing's Test evidences — evenstrongly evidences — thought.     

On tolerable and desirable behaviors in supervisory control of discrete event systems

We formulate and solve a new supervisory control problem for discrete event systems. The objective is to design a logical controller—or supervisor—such that the discrete event system satisfies a given set of requirements that involve event ordering. The controller must deal with a limited amount of controllability in the form of uncontrollable events. Our problem formulation considers that the requirements for the behavior (i.e., set of traces) of the controlled system are specified in terms of a desired behavior and a larger tolerated behavior. Due to the uncontrollable events, one may wish to tolerate behavior that sometimes exceeds the ideal desired behavior if overall this results in achieving more of the desired behavior. The general solution of our problem is completely characterized. The nonblocking solution is also analyzed in detail. This solution requires the study of a new class of controllable languages. Several results are proved about this class of languages. Algorithms to compute certain languages of interest within this class are also presented.Research supported in part by the National Science Foundation under grants ECS-8707671, ECS-9057967, and ECS-9008947.     

Interval routing schemes

In this paper the problem of routing messages along shortest paths in a distributed network without using complete routing tables is considered. In particular, the complexity of deriving minimum (in terms of number of intervals) interval routing schemes is analyzed under different requirements. For all the cases considered NP-hardness proofs are given, while some approximability results are provided. Moreover, relations among the different cases considered are studied.This work was supported by the EEC ESPRIT II Basic Research Action Program under Contract No. 7141 Algorithms and Complexity II, by the EEC Human Capital and Mobility MAP project, and by the Italian MURST 40% project Algoritmi, Modelli di Calcolo e Strutture Informative.     

On parsing two-level grammars

Summary Making use of the fact that two-level grammars (TLGs) may be thought of as finite specification of context-free grammars (CFGs) with infinite sets of productions, known techniques for parsing CFGs are applied to TLGs by first specifying a canonical CFG G — called skeleton grammar — obtained from the cross-reference of the TLG G. Under very natural restrictions it can be shown that for these grammar pairs (G, G) there exists a 1 — 1 correspondence between leftmost derivations in G and leftmost derivations in G. With these results a straightforward parsing algorithm for restricted TLGs is given.     

A knowledge-based system for reactive scheduling decision-making in FMS

This paper describes research into the development of an intelligent simulation environment. The environment was used to analyze reactive scheduling scenarios in a specific flexible manufacturing systems (FMS) configuration. Using data from a real FMS, simulation models were created to study the reactive scheduling problem and this work led to the concept of capturing instantaneous FMS status data as snapshot data for analysis. Various intelligent systems were developed and tested to asses their decision-making capabilities. The concepts of History Logging and expert system learning is proposed and these ideas are implemented into the environment to provide decision-making and control across a FMS schedule lifetime. This research proposes an approach for the analysis of reactive scheduling in an FMS. The approach and system that was subsequently developed was based on the principle of automated intelligent decision-making via knowledge elicitation from FMS status data, together with knowledge base augmentation to facilitate a learning ability based on past experiences.     

Virtual Connections and a Traffic Optimization Model for an ATM Network

The number of virtual connections in the nodal space of an ATM network of arbitrary structure and topology is computed by a method based on a new concept—a covering domain having a concrete physical meaning. The method is based on a network information sources—boundary switches model developed for an ATM transfer network by the entropy approach. Computations involve the solution of systems of linear equations. The optimization model used to compute the number of virtual connections in a many-category traffic in an ATM network component is useful in estimating the resource of nodal equipment and communication channels. The variable parameters of the model are the transmission bands for different traffic categories.     

Type inference with non-structural subtyping

We present an O(n³) time type inference algorithm for a type system with a largest type, a smallest type , and the usual ordering between function types. The algorithm infers type annotations of least shape, and it works equally well for recursive types. For the problem of typability, our algorithm is simpler than the one of Kozen, Palsberg, and Schwartzbach for type inferencewithout . This may be surprising, especially because the system with is strictly more powerful.     

Uniformization based sensitivity estimation for a class of discrete-event systems

Infinitestimal Perturbation Analysis (IPA) estimators are based on particular couplings of parameteric families of discrete event systems where small changes in the parameter value, typically, cause small changes in the timing of events and, for finite horizons, the sequence of states visisted remains the same. We consider another coupling approach based on the uniformization procedure and a simple generalization of it. In our case any small change in the parameter value causes a change in the state of the system; our parameterization of trajectories keeps them highly synchronized, hence the effect of such changes can be estimated, sometimes efficiently. In this framework, we define three tupes of performance sensitivity estimators for a broad class of performance measures and with respect to a range of parameter values. Performance measures on finite deterministic horizons are considered and it is shown that they are unbiased under mild conditions. We show that for some systems the derivative estimators can be calculated from a nominal sample path of the system.     

Mechanizing set theory

Fairly deep results of Zermelo-Frænkel (ZF) set theory have been mechanized using the proof assistant Isabelle. The results concern cardinal arithmetic and the Axiom of Choice (AC). A key result about cardinal multiplications is =, where is any infinite cardinal. Proving this result required developing theories of orders, order-isomorphisms, order types, ordinal arithmetic, cardinals, etc.; this covers most of Kunen, Set Theory, Chapter I. Furthermore, we have proved the equivalence of 7 formulations of the Well-ordering Theorem and 20 formulations of AC; this covers the first two chapters of Rubin and Rubin, Equivalents of the Axiom of Choice, and involves highly technical material. The definitions used in the proofs are largely faithful in style to the original mathematics.     

A systems approach to chemical management by manufacturing firms in an environmentally constrained world

The regional and global environmental perturbations resulting from the effects of human economic activity on fundamental biological, chemical, and physical systems can no longer be ignored. Indeed, a complex and expanding set of statutory and regulatory responses, directed in large part at industrial and manufacturing activity, demonstrates society's increasing understanding of this process. These developments have driven the evolution of industry environmental compliance and management systems. In particular, integrated chemical management systems (ICMS), which consist of two subsystems — a data subsystem and a management subsystem, have become both more complex and more integrated into traditional business operating and management systems. Three stages in ICMS evolution are defined and described: stage I, the presystemic stage; stage II, the static system stage; and stage III, the interactive system stage.     

Effects of computers on Japanese schools

In this paper I consider how the computer can or should be accepted in Japanese schools. The concept of teaching in Japan stresses learning from a long-term perspective. Whereas in the instructional technology, on which the CAI or the Tutoring System depends, step-by-step attainments in relatively short time are emphasized. The former is reluctant in using the computer, but both share the Platonic perspective which are goal-oriented. However, The Socratic teacher, who intends to activate students' innate disposition to be better, would find another way of teaching and use of the computer.     

A graph-theoretic optimal control problem for terminating discrete event processes

Most of the results to date in discrete event supervisory control assume a zero-or-infinity structure for the cost of controlling a discrete event system, in the sense that it costs nothing to disable controllable events while uncontrollable events cannot be disabled (i.e., their disablement entails infinite cost). In several applications however, a more refined structure of the control cost becomes necessary in order to quantify the tradeoffs between candidate supervisors. In this paper, we formulate and solve a new optimal control problem for a class of discrete event systems. We assume that the system can be modeled as a finite acylic directed graph, i.e., the system process has a finite set of event trajectories and thus is terminating. The optimal control problem explicitly considers the cost of control in the objective function. In general terms, this problem involves a tradeoff between the cost of system evolution, which is quantified in terms of a path cost on the event trajectories generated by the system, and the cost of impacting on the external environment, which is quantified as a dynamic cost on control. We also seek a least restrictive solution. An algorithm based on dynamic programming is developed for the solution of this problem. This algorithm is based on a graph-theoretic formulation of the problem. The use of dynamic programming allows for the efficient construction of an optimal subgraph (i.e., optimal supervisor) of the given graph (i.e., discrete event system) with respect to the cost structure imposed. We show that this algorithm is of polynomial complexity in the number of vertices of the graph of the system.Research supported in part by the National Science Foundation under grant ECS-9057967 with additional support from GE and DEC.     

H∞ Robust Control Design for an Arm Manipulator

This paper deals with the application of the optimal H control design technique to derive a controller for a 3 DOF arm manipulator affected by nonmodeled dynamics, nonlinearities, actuator dynamics and sensor noise. The control objectives were to obtain a robust stable with robust performance controlled system. A family of nonparametric models for a finite number of the arm configurations was obtained. Then, a multivariable nominal model was proposed and derived together with additive nonparametric uncertainty bounds. Weighting functions were used to normalize the H norm of the uncertainty and to act on the command, sensor, and error signals. Finally, a controller was computed by solving the corresponding H optimization problem. The controller was tried on the nominal and worst case configuration models. The results showed robust stability and robust performance of the controlled system.     

A Philosophical Approach to the Concept of Data Model: Is a Data Model, in Fact, a Model?

The design of the database is crucial to the process of designing almost any Information System (IS) and involves two clearly identifiable key concepts: schema and data model, the latter allowing us to define the former. Nevertheless, the term model is commonly applied indistinctly to both, the confusion arising from the fact that in Software Engineering (SE), unlike in formal or empirical sciences, the notion of model has a double meaning of which we are not always aware. If we take our idea of model directly from empirical sciences, then the schema of a database would actually be a model, whereas the data model would be a set of tools allowing us to define such a schema.The present paper discusses the meaning of model in the area of Software Engineering from a philosophical point of view, an important topic for the confusion arising directly affects other debates where model is a key concept. We would also suggest that the need for a philosophical discussion on the concept of data model is a further argument in favour of institutionalizing a new area of knowledge, which could be called: Philosophy of Engineering.     

Alternative human role in manufacturing

The limits of Taylorism are alive and well in today's manufacturing systems. Automation does have to constrain human ability creativity, judgement and skill, and undermine human dignity. The paper presents an interactive concept of manufacturing. Human-Oriented Manufacturing Systems (HOMS), which aims to achieve high flexibility and quality of production while creating an environment for happy working and joyful living.Presented at conference on Ecology of Science and Technology, Japan Science Foundation, Tokyo, 1992.     

Human–Machine Interaction in Intelligent Robotic Systems: A Unifying Consideration with Implementation Examples

In this paper, we propose a two-layer sensor fusion scheme for multiple hypotheses multisensor systems. To reflect reality in decision making, uncertain decision regions are introduced in the hypotheses testing process. The entire decision space is partitioned into distinct regions of correct, uncertain and incorrect regions. The first layer of decision is made by each sensor indepedently based on a set of optimal decision rules. The fusion process is performed by treating the fusion center as an additional virtual sensor to the system. This virtual sensor makes decision based on the decisions reached by the set of sensors in the system. The optimal decision rules are derived by minimizing the Bayes risk function. As a consequence, the performance of the system as well as individual sensors can be quantified by the probabilities of correct, incorrect and uncertain decisions. Numerical examples of three hypotheses, two and four sensor systems are presented to illustrate the proposed scheme.