468883
Research and commercial opportunities in Web-Based Simulation
Abstract In a few short years, Web-Based Simulation has exhibited explosive growth in the simulation research community. This paper which grew out of a panel discussion at the 2000 WEBSIM Conference, briefly reviews the development of this research area and considers future opportunities, both on the research and commercial sides. On the research side, the area is maturing, but still quite active. Efforts to expanded Web-Based Simulation to include new capabilities beyond those found in conventional simulation technology or provide interoperation with other information processing technology are particularly promising. On the commercial side, a critical mass of research knowledge is now available. However, some catalyst is needed to produce any substantial movement of simulation vendors toward Web-Based Simulation. This could happen quickly under a couple of scenarios: A small simulation vendor focused on Web-Based Simulation could begin to claim significant market share. Alternatively, the development of a “killer-app” to demonstrate a clear advantage to Web-Based Simulation could make this shift happen very quickly.
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.
3039342
Adding Semantics to Web Services Standards
With the increasing growth in popularity of Web services, discovery of relevant Web services becomes a significant challenge. One approach is to develop semantic Web services where by the Web services are annotated based on shared ontologies, and use these annotations for semantics-based discovery of relevant Web services. We discuss one such approach that involves adding semantics to WSDL using DAML+OIL ontologies. Our approach also uses UDDI to store these semantic annotations and search for Web services based on them. We compare our approach with another initiative to add semantics to support Web service discovery, and show how our approach may fit current standards-based industry approach 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.
15234568
Demonstrating Dynamic Configuration and Execution of Web Processes
Web processes are next generation workflows on the web, created using Web services. In this paper we demonstrate the METEOR-S Configuration and Execution Environment (MCEE) system. It will illustrate the capabilities of the system to a) Discover partners b) Optimize partner selection using constraint analysis, c) Perform interaction protocol and data mediation. A graphical execution monitor to monitor the various phases of execution will be used to demonstrate various aspects of the system.
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.
17749917
Cartesian Genetic Programming
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form of a linear string of integers. The inputs or terminal set and node outputs are numbered sequentially. The node functions are also separately numbered. The genotype is just a list of node connections and functions. The genotype is then mapped to an indexed graph that can be executed as a program. Evolutionary algorithms are used to evolve the genotype in a symbolic regression problem (sixth order polynomial) and the Santa Fe Ant Trail. The computational effort is calculated for both cases. It is suggested that hit effort is a more reliable measure of computational efficiency. A neutral search strategy that allows the fittest genotype to be replaced by another equally fit genotype (a neutral genotype) is examined and compared with non-neutral search for the Santa Fe ant problem. The neutral search proves to be much more effective.
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.
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.
52857539
Computer graphics
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.