Parallel dynamic graph-partitioning for unstructured meshes

A parallel method for the dynamic partitioning of unstructured meshes is described. The method introduces a new iterative optimization technique known as relative gain optimization which both balances the workload and attempts to minimize the interprocessor communications overhead. Experiments on a series of adaptively refined meshes indicate that the algorithm provides partitions of an equivalent or higher quality to static partitioners (which do not reuse the existing partition) and much more rapidly. Perhaps more importantly, the algorithm results in only a small fraction of the amount of data migration compared to the static partitioners.

VegeDog: Formalism, vegetarian dogs, and partonomies in transition

The pragmatics of 'vegetarian' and 'carnivorous' exhibits an asymmetry that we put in evidence by analyzing a newspaper report about vegetarian dog-owners imposing a vegetarian diet on their pets. More fundamental is the problem of partonomy versus containment, for which we attempt a naive but formal analysis applied to ingestion and the food chain, an issue we derive from the same text analyzed. Our formal tools belong in commonsense modelling, a domain of artificial intelligence related to extra-linguistic knowledge and pragmatics. We first provide an interpretation of events analyzed, and express it graphically in a semantic-network related representation, and propose an alternative that we express in terms of a modal logic, avoiding the full representational power of Hayes's "ontology for liquids".

Upgrading automation for nuclear fuel in-core management: from the symbolic generation of configurations to the neural adaptation of heuristics

FUELCON is an expert system in nuclear engineering. Its task is optimized refueling-design, which is crucial to keep down operation costs at a plant. FUELCON proposes sets of alternative configurations of fuel-allocation; the fuel is positioned in a grid representing the core of a reactor. The practitioner of in-core fuel management uses FUELCON to generate a reasonably good configuration for the situation at hand. The domain expert, on the other hand, resorts to the system to test heuristics and discover new ones, for the task described above. Expert use involves a manual phase of revising the ruleset, based on performance during previous iterations in the same session. This paper is concerned with a new phase: the design of a neural component to carry out the revision automatically. Such an automated revision considers previous performance of the system and uses it for adaptation and learning better rules. The neural component is based on a particular schema for a symbolic to recurrent-analogue bridge, called NIPPL, and on the reinforcement learning of neural networks for the adaptation.

The Exodus evacuation model applied to building evacuation scenarios

The purpose of this paper is to demonstrate the potential of the EXODUS evacuation model in building environments. The latest PC/workstation version of EXODUS is described and is also applied to a large hypothetical supermarket/restaurant complex measuring 50 m x 40 m. A range of scenarios is presented where population characteristics (such as size, individual travel speeds, and individual response times), and enclosure configuration characteristics (such as number of exits, size of exits, and opening times of exits) are varied. The results demonstrate a wide range of occupant behavior including overtaking, queuing, redirection, and conflict avoidance. Evacuation performance is measured by a number of model predicted parameters including individual exit flow rates, overall evacuation flow rates, total evacuation time, average evacuation time per occupant, average travel distance, and average wait time. The simulations highlight the profound impact that variations in individual travel speeds and occupant response times have in determining the overall evacuation performance. 1. Jin, T., and Yamada T., "Experimental Study of Human Behavior in Smoke Filled Corridors," Proceedings of The Second International Symposium on Fire Safety Science, 1988, pp. 511-519. 2. Galea, E.R., and Galparsoro, J.M.P., "EXODUS: An Evacuation Model for Mass Transport Vehicles," UK CAA Paper 93006 ISBN 086039 543X, CAA London, 1993. 3. Galea, E.R., and Galparsoro, J.M.P., "A Computer Based Simulation Model for the Prediction of Evacuation from Mass Transport Vehicles," Fire Safety Journal, Vol. 22, 1994, pp. 341-366. 4. Galea, E.R., Owen, M., and Lawrence, P., "Computer Modeling of Human Be havior in Aircraft Fire Accidents," to appear in the Proceedings of Combus tion Toxicology Symposium, CAMI, Oklahoma City, OK, 1995. 5. Kisko, T.M. and Francis, R.L., "EVACNET+: A Computer Program to Determine Optimal Building Evacuation Plans," Fire Safety Journal, Vol. 9, 1985, pp. 211-220. 6. Levin, B., "EXITT, A Simulation Model of Occupant Decisions and Actions in Residential Fires," Proceedings of The Second International Symposium on Fire Safety Science, 1988, pp. 561-570. 7. Fahy, R.F., "EXIT89: An Evacuation Model for High-Rise Buildings," Pro ceedings of The Third International Sym posium on Fire Safety Science, 1991, pp. 815-823. 8. Thompson, P.A., and Marchant, E.W., "A Computer Model for the Evacuation of Large Building Populations," Fire Safety Journal, Vol. 24, 1995, pp. 131-148. 9. Still, K., "New Computer System Can Predict Human Behavior Response to Building Fires," FIRE 84, 1993, pp. 40-41. 10. Ketchell, N., Cole, S.S., Webber, D.M., et.al., "The Egress Code for Human Move ment and Behavior in Emergency Evacu ations," Engineering for Crowd Safety (Smith, R.A., and Dickie, J.F., Eds.), Elsevier, 1993, pp. 361-370. 11. Takahashi, K., Tanaka, T. and Kose, S., "An Evacuation Model for Use in Fire Safety Design of Buildings," Proceedings of The Second International Symposium on Fire Safety Science, 1988, pp. 551- 560. 12. G2 Reference Manual, Version 3.0, Gensym Corporation, Cambridge, MA. 13. XVT Reference Manual, Version 3.0 XVT Software Inc., Boulder, CO. 14. Galea, E.R., "On the Field Modeling Approach to the Simulation of Enclosure Fires, Journal of Fire Protection Engineering, Vol. 1, No. 1, 1989, pp. 11-22. 15. Purser, D.A., "Toxicity Assessment of Combustion Products," SFPE Handbook of Fire Protection Engineering, National Fire Protection Association, Quincy, MA, pp. 1-200 - 1-245, 1988. 16. Hankin, B.D., and Wright, R.A., "Pas senger Flows in Subways," Operational Research Quarterly, Vol. 9, 1958, pp. 81-88. 17. HMSO, The Building Regulations 1991 - Approved Document B, section B 1 (1992 edition), HMSO publications, London, pp. 9-40. 18. Polus A., Schofer, J.L., and Ushpiz, A., "Pedestrian Flow and Level of Service," Journal of Transportation Engineering, Vol. 109, 1983, pp. 46-47. 19. Muir, H., Marrison, C., and Evans, A., "Aircraft Evacuations: the Effect of Passenger Motivation and Cabin Con figuration Adjacent to the Exit," CAA Paper 89019, ISBN 0 86039 406 9, 1989. 20. Muir, H., Private communication to appear as a CAA report, 1996.

Two-stage no-wait scheduling models with setup and removal times separated

This paper studies two models of two-stage processing with no-wait in process. The first model is the two-machine flow shop, and the other is the assembly model. For both models we consider the problem of minimizing the makespan, provided that the setup and removal times are separated from the processing times. Each of these scheduling problems is reduced to the Traveling Salesman Problem (TSP). We show that, in general, the assembly problem is NP-hard in the strong sense. On the other hand, the two-machine flow shop problem reduces to the Gilmore-Gomory TSP, and is solvable in polynomial time. The same holds for the assembly problem under some reasonable assumptions. Using these and existing results, we provide a complete complexity classification of the relevant two-stage no-wait scheduling models.

Some models for discretized series of events

A discretized series of events is a binary time series that indicates whether or not events of a point process in the line occur in successive intervals. Such data are common in environmental applications. We describe a class of models for them, based on an unobserved continuous-time discrete-state Markov process, which determines the rate of a doubly stochastic Poisson process, from which the binary time series is constructed by discretization. We discuss likelihood inference for these processes and their second-order properties and extend them to multiple series. An application involves modeling the times of exposures to air pollution at a number of receptors in Western Europe.

Molecular dynamics simulation of adsorption of Ag particles on a graphite substrate

We have performed for the first time a molecular dynamics simulation of the adsorption of gas-phase Ag particles on a graphite substrate to provide an insight into the results of a comprehensive STM-based experiment on this system. Both pair-wise and many-body interatomic potentials have been employed, and a Morse-type Ag–C potential was specifically constructed to describe the interactions at the interface. Our simulation has successfully reproduced a significant portion of the experimental findings. We have also observed the intercalation of silver in graphite.

Automatic code generation of overlapped communications in a parallelisation tool

This paper addresses the exploitation of overlapping communication with calculation within parallel FORTRAN 77 codes for computational fluid dynamics (CFD) and computational structured dynamics (CSD). The obvious objective is to overlap interprocessor communication with calculation on each processor in a distributed memory parallel system and so improve the efficiency of the parallel implementation. A general strategy for converting synchronous to overlapped communication is presented together with tools to enable its automatic implementation in FORTRAN 77 codes. This strategy is then implemented within the parallelisation toolkit, CAPTools, to facilitate the automatic generation of parallel code with overlapped communications. The success of these tools are demonstrated on two codes from the NAS-PAR and PERFECT benchmark suites. In each case, the tools produce parallel code with overlapped communications which is as good as that which could be generated manually. The parallel performance of the codes also improve in line with expectation.

A novel neural/symbolic hybrid approach to heuristically optimized fuel allocation and automated revision of heuristics in nuclear engineering

FUELCON is an expert system for optimized refueling design in nuclear engineering. This task is crucial for keeping down operating costs at a plant without compromising safety. FUELCON proposes sets of alternative configurations of allocation of fuel assemblies that are each positioned in the planar grid of a horizontal section of a reactor core. Results are simulated, and an expert user can also use FUELCON to revise rulesets and improve on his or her heuristics. The successful completion of FUELCON led this research team into undertaking a panoply of sequel projects, of which we provide a meta-architectural comparative formal discussion. In this paper, we demonstrate a novel adaptive technique that learns the optimal allocation heuristic for the various cores. The algorithm is a hybrid of a fine-grained neural network and symbolic computation components. This hybrid architecture is sensitive enough to learn the particular characteristics of the ‘in-core fuel management problem’ at hand, and is powerful enough to use this information fully to automatically revise heuristics, thus improving upon those provided by a human expert.

SMARTFIRE: an intelligent CFD-based fire model

This paper describes a project aimed at making Computational Fluid Dynamics (CFD) based fire simulation accessible to members of the fire safety engineering community. Over the past few years, the practise of CFD based fire simulation has begun the transition from the confines of the research laboratory to the desk of the fire safety engineer. To a certain extent, this move has been driven by the demands of performance based building codes. However, while CFD modelling has many benefits over other forms of fire simulation, it requires a great deal of expertise on the user’s part to obtain reasonable simulation results. The project described in this paper, SMARTFIRE, aims to relieve some of this dependence on expertise so that users are less concerned with the details of CFD analysis and can concentrate on results. This aim is achieved by the use of an expert system component as part of the software suite which takes some of the expertise burden away from the user. SMARTFIRE also makes use of the latest developments in CFD technology in order to make the CFD analysis more efficient. This paper describes design considerations of the SMARTFIRE software, emphasising its open architecture, CFD engine and knowledge based systems.

A domain decomposition algorithm for viscous/inviscid coupling

In fluid mechanics, it is well accepted that the Euler equation is one of the reduced forms of the Navier-Stokes equation by truncating the viscous effect. There are other truncation techniques currently being used in order to truncate the Navier-Stokes equation to a reduced form. This paper describes one such technique, suitable for adaptive domain decomposition methods for the solution of viscous flow problems. The physical domain of a viscous flow problem is partitioned into viscous and inviscid subdomains without overlapping regions, and the technique is embedded into a finite volume method. Some numerical results are provided for a flat plate and the NACA0012 aerofoil. Issues related to distributed computing are discussed.

An extension of Purcell's vector method with applications to panel element equations

The classical Purcell's vector method, for the construction of solutions to dense systems of linear equations is extended to a flexible orthogonalisation procedure. Some properties are revealed of the orthogonalisation procedure in relation to the classical Gauss-Jordan elimination with or without pivoting. Additional properties that are not shared by the classical Gauss-Jordan elimination are exploited. Further properties related to distributed computing are discussed with applications to panel element equations in subsonic compressible aerodynamics. Using an orthogonalisation procedure within panel methods enables a functional decomposition of the sequential panel methods and leads to a two-level parallelism.

An application of quasi-Newton methods for the numerical solution of interface problems

Quasi-Newton methods are applied to solve interface problems which arise from domain decomposition methods. These interface problems are usually sparse systems of linear or nonlinear equations. We are interested in applying these methods to systems of linear equations where we are not able or willing to calculate the Jacobian matrices as well as to systems of nonlinear equations resulting from nonlinear elliptic problems in the context of domain decomposition. Suitability for parallel implementation of these algorithms on coarse-grained parallel computers is discussed.

A defect equation approach for the coupling of subdomains in domain decomposition methods

A defect equation for the coupling of nonlinear subproblems defined in nonoverlapped subdomains arise in domain decomposition methods is presented. Numerical solutions of defect equations by means of quasi-Newton methods are considered.