15950590
Model instantiation for query driven simulation in active KDL
The focus of this paper is on how Active KDL can be used to provide a very powerful simulation support environment. Active KDL (Knowledge/Data Language) is an object-oriented database programming language, which provides access to integrated model, knowledge, and data bases. Simulation inputs and outputs can be stored by Active KDL since it supports complex objects. More importantly, Active KDL also allows users to specify rules to capture heuristic knowledge and methods to specify procedural behavior. Finally, Active KDL provides a simple mechanism for specifying concurrent execution, namely tasks embedded in active objects. These facilities provide a powerful mechanism for building simulation models out of pre-existing model components. These capabilities provide a tight coupling between a SIMODULA-like simulation system and a knowledge/database system, supporting query driven simulation, where model instantiation is used for information generation.
9294328
Performance Modeling of Database Recovery Protocols
The performance modeling described in this paper compares several protocols which ensure that a database can be recovered to a consistent state after a transaction failure or system crash. The contributions of the paper include a collection of simple analytic models, based on Markov processes, for these protocols and some surprising results on the relative performance of the protocols. We consider only two-stage transactions (all reads before writes) and ignore effects of serializing transactions. The most interesting performance result presented is that, for systems obeying the assumptions of this paper, the "pessimistic" policy of holding write locks to commit point is considerably less efficient than the "optimistic" policy which allows reading of uncommitted data, but risks cascading aborts. A multiversion policy introduced in [2] was also studied and found always to be nearly as good as the optimistic policy and sometimes much better.
8657310
Constraint driven Web service composition in METEOR-S
Creating Web processes using Web service technology gives us the opportunity for selecting new services, which best suit our need at the moment. Doing this automatically requires us to quantify our criteria for selection. In addition, there are challenging issues of correctness and optimality. We present a constraint driven Web service composition tool in METEOR-S, which allows the process designers to bind Web services to an abstract process, based on business and process constraints and generate an executable process. Our approach is to reduce much of the service composition problem to a constraint satisfaction problem. It uses a multiphase approach for constraint analysis. This work was done as part of the METEORS framework, which aims to support the complete lifecycle of semantic Web processes.
10095666
Simulation modeling within workflow technology
This paper presents an approach for integrating simulation modeling and analysis capabilities within the workflow management system (WFMS) being developed in the Large Scale Distributed Information Systems (LSDIS) Lab at the University of Georgia. Simulation modeling can be used for studying the efficiency of workflow designs as well as studying the general performance and reliability of WFMSs. We also discuss the importance of using sophisticated monitoring and animation capabilities, and the use of workflow management technology to advance simulation technology itself. Finally, we demonstrate a sample simulation where tasks and task managers are simulated.
16899510
Query driven simulation using SIMODULA
This paper describes the design and early implementation phases of a simulation modeling environment that integrates a process-oriented simulation language and a database system with object-oriented extensions. User may interact with the system simply by formulating SQL-like queries to retrieve information stored from previous simulations, or indeed cause information to be automatically generated.
30146652
Workflow Quality of Service
Workflow management systems (WfMSs) have been used to support various types of business processes for more than a decade now. In ecommerce processes, suppliers and customers define a binding agreement or contract between the two parties, specifying quality of service (QoS) items such as products or services to be delivered, deadlines, quality of products, and cost of service. Management of such QoS directly impacts success of organizations participating in e-commerce. Organizations operating in modern markets require an excellent degree of quality of service management. Products and services must be available to customers with well-defined specifications. A good management of quality leads to the creation of quality products and services, which in turn fulfills customer expectations and achieves customer satisfaction. Therefore, when services or products are created or managed using workflow processes, the underlying WfMS must accept the specification, be able to predict, monitor, and control the QoS rendered to customers. To achieve these objectives the first step is to develop an adequate QoS model for workflow processes and develop methods to compute QoS.
206463342
The User Experience
In this article the author provides perspective on user experience, usability and user-centered design. User experience is a broad collection of user-centric issues that cut through the full extent of a project. The author points out new developments in the user experience world that are opening up new opportunities for research and projects. The author also discusses how good user experience processes can be built into the kinds of system development projects that many of us are involved in.
7380263
Getting more from the data in a multinomial selection problem
We consider the problem of determining which of k simulated systems is most likely to be the best per former based on some objective performance measure. The standard experiment is to generate v in dependent vector observations (replications) across the k- systems. A classical multinomial selection pro cedure, BEM (Bechhofer, Elmaghraby, and Morse), prescribes a minimum number of replications so that the probability of correctly selecting the true best system meets or exceeds a prespecified probability. Assuming that larger is better, BEM selects as best the system having the largest value of the performance measure in more replications than any other. We propose using these same v replications across k systems to form vk pseudoreplications (no longer in dependent) that contain one observation from each system, and again select as best the system having the largest value of the performance measure in more pseudoreplications than any other. We expect that this new procedure, AVC (all vector comparisons), dominates BEM in the sense that AVC will never require more independent replications than DEM to meet a prespecified probability of correct selection. We present analytical and simulation results to show how AVC fares versus BEM for different underly ing distribution families, different numbers of populations and various values of v. We also present results for the closely related problem of estimating the probability that a specific system is the best.
8310590
Modeling leadership effects and recruit type in an Army recruiting station
Army recruiters have an uphill battle recruiting well-qualified volunteers into military service. With prospering economy, there are many alternatives to joining the military, and all services are having difficulty recruiting young people. United States Army Recruiting Command (USAREC) sponsored our research in simulating the workings of an Army recruiting station in an effort to help understand more about the recruiting process. Specifically, USAREC wanted a management tool to examine the effects of changing a variety of controllable factors on the way an individual recruiting station performs. We focused this study on the effect of recruiting station commander leadership on recruiting productivity, and the differences in processing times and success rates for different types of applicants (potential recruits). This study added capability to a previous simulation model developed at the Air Force Institute of Technology (AFIT) (J.D. Cordeiro and M.A. Friend, 1998). Cordeiro and Friend's model depicted an Army recruiting station with three types of recruiters, and a single (average) recruiter type. For the current work, we needed to gather pertinent data on the effects of leadership and on the differences between different applicant types. In addition, we needed to incorporate the new data into the simulation model. The remainder of the paper includes an overview of the recruiting process, considerations for modeling leadership effects and applicant types, discussion of incorporating these features in the simulation, a brief look at some simulation output, and some future research interests.
8365397
Input modeling when simple models fail
A simulation model is composed of inputs and logic; the inputs represent the uncertainty or randomness in the system, while the logic determines how the system reacts to the uncertain elements. Simple input models, consisting of independent and identically distributed sequences of random variates from standard probability distributions, are included in every commercial simulation language. Software to fit these distributions to data is also available. In this tutorial we describe input models that are useful when simple models are not.
7336432
Decidability and Complexity Results for Timed Automata and Semi-linear Hybrid Automata
We define a new class of hybrid automata for which reachability is decidable--a proper superclass of the initialized rectangular hybrid automata--by taking parallel compositions of simple components. Attempting to generalize, we encounter timed automata with algebraic constants. We show that reachability is undecidable for these algebraic timed automata by simulating two-counter Minsky machines. Modifying the construction to apply to parametric timed automata, we reprove the undecidability of the emptiness problem, and then distinguish the dense and discrete-time cases with a new result. The algorithmic complexity-- both classical and parametric--of one-clock parametric timed automata is also examined. We finish with a table of computability-theoretic complexity results, including that the existence of a Zeno run is Σ11 -complete for semi-linear hybrid automata; it is too complex to be expressed in first-order arithmetic.