To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
The discrete-time G/GI/∞ queue model is explored. Jobs arrive to an infinite-server queuing system following an arbitrary input process X; job sizes are general independent and identically distributed random variables. The system's output process Y (of job departures) and queue process N (tracking the number of jobs present in the system) are analyzed. Various statistics of the stochastic maps X↦ Y and X↦ N are explicitly obtained, including means, variances, autocovariances, cross-covariances, and multidimensional probability generating functions. In the case of stationary inputs, we further compute the spectral densities of the stochastic maps, characterize the fixed points (in the L2 sense) of the input–output map, precisely determine when the output and queue processes display either short-ranged or long-ranged temporal dependencies, and prove a decomposition result regarding the intrinsic L2 structure of general stationary G/GI/∞ systems.
This article presents a novel approach for the dynamic control of a signalized intersection. At the intersection, there is a number of arrival flows of cars, each having a single queue (lane). The set of all flows is partitioned into disjoint combinations of nonconflicting flows that will receive green together. The dynamic control of the traffic lights is based on the numbers of cars waiting in the queues. The problem concerning when to switch (and which combination to serve next) is modeled as a Markovian decision process in discrete time. For large intersections (i.e., intersections with a large number of flows), the number of states becomes tremendously large, prohibiting straightforward optimization using value iteration or policy iteration. Starting from an optimal (or nearly optimal) fixed-cycle strategy, a one-step policy improvement is proposed that is easy to compute and is shown to give a close to optimal strategy for the dynamic problem.
Single-server queues in which the server takes vacations arise naturally as models for a wide range of computer, communication, and production systems. In almost all studies on vacation models, the vacation lengths are assumed to be independent of the arrival, service, workload, and queue length processes. In the present study, we allow the length of a vacation to depend on the length of the previous active period (viz. the period since the previous vacation). Under rather general assumptions regarding the offered work during active periods and vacations, we determine the steady-state workload distribution, both for single and multiple vacations. We conclude by discussing several special cases, including polling models, and relate our findings to results obtained earlier.
This article shows that very accurate accurate approximations to performance measures in the multiserver M/D/c/c+N queue with finite buffer and deterministic service times can be obtained by replacing the deterministic service time by a two-phase process with exponential sojourn times and branching probabilities outside the interval [0, 1].
The probabilistic distance clustering method of works well if the cluster sizes are approximately equal. We modify that method to deal with clusters of arbitrary size and for problems where the cluster sizes are themselves unknowns that need to be estimated. In the latter case, our method is a viable alternative to the expectation-maximization (EM) method.
In this article we discuss fairness in queues, view it in the context of social justice at large, and survey the recently published research work and publications dealing with the issue of measuring fairness of queues. The emphasis is placed on the underlying principles of the different measurement approaches, on reviewing their methodology, and on examining their applicability and intuitive appeal. Some quantitative results are also presented.
The article has three major parts (sections) and a short concluding discussion. In the first part we discuss fairness in queues and its importance in the broader context of the prevailing conception of social justice at large, and the distinction between fairness of the queue and fairness at large is illuminated. The second part is dedicated to explaining and discussing three main properties expected of a fairness measure: conformity to the general concept of social justice, granularity, and intuitive appeal and rationality. The third part reviews the fairness of the queue evaluating and measuring approaches proposed and studied in recent years. We describe the underlying principles of the different approaches, present some of their results, and review them in context of the three main properties expected from a measure. The short discussion that follows centers on future research issues.
Identification of latent or unarticulated customer and other stakeholder needs has been a significant barrier to improving the efficiency and effectiveness of the front-end phase of new product development processes. In-depth determination of stakeholder needs entails analysis of their intentions; the overall aim of the work reported in this article is to establish a framework of intentional analysis, and its associated methods and techniques for improving traceability of design practice during the early phases of the design process. The specific aim of this article is to present a conceptual framework for design rationale systems. The framework built upon the cross-fertilization of approaches and methods drawn from systems engineering and philosophy, focussing on the notions of antecedence and consequence. It was developed in the course of tackling design problems originating in industrial contexts. The methods developed were thus evaluated, updated, and refined in real applications. Two application cases are described that have been drawn from the aerospace and power sectors, respectively. The applications showed that the framework's central antecedent/consequent scheme provides a cell from which to develop either a history of actual successive changes, or a tree of alternative possible projected designs.
Rationale research in software development is a challenging area because although there is no shortage of advocates for its value, there is also no shortage of reasons for why rationale is unlikely to be captured in practice. Despite more than 30 years of research there still remains much uncertainty: how useful are the potential benefits and how insurmountable are the barriers? Will the value of the rationale (design and otherwise) justify the cost of collecting it? Although there have been numerous rationale research projects, many, if not most, received little or no empirical evaluation. There also have not been many studies examining what the needs are of the practitioners who would be supported by the rationale. This article discusses the “doom and gloom” predictions of rationale's failure, provides a survey of evaluations of rationale systems, and discusses what we hope is a brighter outlook for rationale research in the future. There are development standards and synergistic research areas that may help with rationale research and its acceptance in the software community with which we should be working. This article also presents the results of a pilot survey of software developers who were asked how they would envision using rationale and what they believe the most important barriers are. Although some results were as expected, there were also some surprises. Research on technology transfer indicates that, among other things, to transition successfully from research into practice we need to understand the need that is being met and demonstrate the value of our approach. Until we have determined how our work is needed by the people we are trying to help we will remain researching under uncertainty.
This article presents Kuaba, a new design rationale representation approach that enables employing design rationale to support reuse of model-based designs, particularly, software design. It is shown that this can be achieved through the adoption of an appropriate vocabulary that allows design rationale representations to be computationally processed. The architecture and implementation of an integrated design environment to support recording design rationale using Kuaba is also shown. The Kuaba approach integrates the design rationale representation model with the formal semantics provided by the metamodel of the design method or modeling language used for describing the artifact being designed. This integration makes the design rationale representations more specific according to the design methods and enables a type of software design reuse at the highest abstraction level, where rationales can be integrated and reemployed in designing a new artifact.
Design rationale should be regarded both as a tool for the practice of design, and as a method to enable the science of design. Design rationale answers questions about why a given design takes the form that it does. Answers to these why questions represent a significant portion of the knowledge generated from design research. This knowledge, along with that from empirical studies of designs in use, contributes to what Simon called the sciences of the artificial. Most research on the nature and use of design rationale has been analytic or theoretical. In this article, we describe an empirical study of the roles that design rationale can play in the conduct of design research. We report results from an interview study with 16 design researchers investigating how they construe and carry out design as research. The results include an integrated framework of the affordances design rationale can contribute to design research. The framework and supporting qualitative data provide insight into how design rationale might be more effectively leveraged as a first-class methodology for research into the creation and use of artifacts.
This paper presents an approach to capture and exchange the arguments and rationale architects develop while designing. The approach was inspired by experiments conducted in the context of a larger research project on architectural redesign. Protocol analysis revealed that architects tend to use three mechanisms in constructing arguments for design solutions: chunks, lines of thought, and strategies. These three mechanisms were used to record “real-world” design processes in architectural practice, the results of which were evaluated by assessors with different backgrounds. The paper closes by comparing the approach to related work, and outlining challenges for the future.
The Designers' Workbench is a system developed by the Advanced Knowledge Technologies Consortium to support designers in large organizations, such as Rolls-Royce, to ensure that the design is consistent with the specification for the particular design as well as with the company's design rule book(s). In the principal application discussed here, the evolving design is described using a jet engine ontology. Design rules are expressed as constraints over the domain ontology. Currently, to capture the constraint information, a domain expert (design engineer) has to work with a knowledge engineer to identify the constraints, and it is then the task of the knowledge engineer to encode these into the Workbench's knowledge base. This is an error-prone and time-consuming task. It is highly desirable to relieve the knowledge engineer of this task, so we have developed a system, ConEditor+, that enables domain experts themselves to capture and maintain these constraints. Further, we hypothesize that to appropriately apply, maintain, and reuse constraints, it is necessary to understand the underlying assumptions and context in which each constraint is applicable. We refer to them as “application conditions,” and these form a part of the rationale associated with the constraint. We propose a methodology to capture the application conditions associated with a constraint and demonstrate that an explicit representation (machine interpretable format) of application conditions (rationales) together with the corresponding constraints and the domain ontology can be used by a machine to support maintenance of constraints. Support for the maintenance of constraints includes detecting inconsistencies, subsumption, redundancy, fusion between constraints, and suggesting appropriate refinements. The proposed methodology provides immediate benefits to the designers, and hence, should encourage them to input the application conditions (rationales).
Documented engineering design rationale has the potential to become a key source of information about past designs. Ease of comprehension of design rationale might play a crucial role in ensuring that the full potential of documented information is realized and that the effort and time necessary to capture design rationale pay off. This research proposes an empirical methodology for evaluating how structuring design rationale and supplying it with visual nontextual cues influences reading and interpretation. The study compares reading and interpretation of technical documentation presented in different formats to engineering graduate trainees in the aerospace industry.
This is the first of four volumes containing reprints of the papers in the original Cabal Seminar volumes of the Springer Lecture Notes in Mathematics series [cabal i, cabal ii, cabal iii, cabal iv], unpublished material, and new papers. We have grouped the papers of the original Cabal Seminar volumes according to their topics. This volume contains the papers on “Games and Scales” (Part I) and “Suslin Cardinals, Partition Properties, Homogeneity” (Part II). Each of the parts contains an introductory survey (written by John Steel and Steve Jackson, respectively) putting the papers into a present-day context. Table 1 gives an overview of the papers in this volume with their original references.
This volume must not be understood as a historical edition of old papers. In the 1980s, there were a number of results obtained by the researchers associated with the Cabal Seminar, some of which were intended for a fifth Cabal volume that was never published. We include some of these papers in this volume, together with papers reporting on new developments related to the research of the Cabal Seminar. These papers are Steel's “Scales in K(ℝ)” and “The Length-ω1 Open Game Quantifier Propagates Scales” in Part Iand “The Equivalence of Partition Properties and Determinacy” and “Generic Codes for Uncountable Ordinals, Partition Properties, and Elementary Embeddings” by Kechris and Woodin, “The Tree of a Moschovakis Scale is Homogeneous” by Martin and Steel, and “Weakly Homogeneous Trees” by Martin and Woodin in Part II.