Estimating the flow rate capacity of an overturned rail carriage end exit in the presence of smoke

While incidents requiring the rapid egress of passengers from trains are infrequent, perhaps the most challenging scenario for passengers involves the evacuation from an overturned carriage subjected to fire. In this paper we attempt to estimate the flow rate capacity of an overturned rail carriage end exit. This was achieved through two full-scale evacuation experiments, in one of which the participants were subjected to non-toxic smoke. The experiments were conducted as part of a pilot study into evacuation from rail carriages. In reviewing the experimental results, it should be noted that only a single run of each trial was undertaken with a limited — though varied — population. As a result it is not possible to test the statistical significance of the evacuation times quoted and so the results should be treated as indicative rather than definitive. The carriage used in the experiments was a standard class Mark IID which, while an old carriage design, shares many features with those carriages commonly found on the British rail network. In the evacuation involving smoke, the carriage end exit was found to achieve an average flow rate capacity of approximately 5.0 persons/min. The average flow rate capacity of the exit without smoke was found to be approximately 9.2 persons/min. It was noted that the presence of smoke tended to reduce significantly the exit flow rate. Due to the nature of the experimental conditions, these flow rates are considered optimistic. Finally, the authors make several recommendations for improving survivability in rail accidents. Copyright © 2000 John Wiley & Sons, Ltd.

Minimizing total weighted completion time in a proportionate flow shop

We study the special case of the m machine flow shop problem in which the processing time of each operation of job j is equal to pj; this variant of the flow shop problem is known as the proportionate flow shop problem. We show that for any number of machines and for any regular performance criterion we can restrict our search for an optimal schedule to permutation schedules. Moreover, we show that the problem of minimizing total weighted completion time is solvable in O(n2) time. © 1998 John Wiley & Sons, Ltd.

Proportionate flow shop with controllable processing times

This paper considers a special class of flow-shop problems, known as the proportionate flow shop. In such a shop, each job flows through the machines in the same order and has equal processing times on the machines. The processing times of different jobs may be different. It is assumed that all operations of a job may be compressed by the same amount which will incur an additional cost. The objective is to minimize the makespan of the schedule together with a compression cost function which is non-decreasing with respect to the amount of compression. For a bicriterion problem of minimizing the makespan and a linear cost function, an O(n log n) algorithm is developed to construct the Pareto optimal set. For a single criterion problem, an O(n2) algorithm is developed to minimize the sum of the makespan and compression cost. Copyright © 1999 John Wiley & Sons, Ltd.

Kappa calculus and evidential strength: A note on Åqvist's logical theory of legal evidence

Lennart Åqvist (1992) proposed a logical theory of legal evidence, based on the Bolding-Ekelöf of degrees of evidential strength. This paper reformulates Åqvist's model in terms of the probabilistic version of the kappa calculus. Proving its acceptability in the legal context is beyond the present scope, but the epistemological debate about Bayesian Law isclearly relevant. While the present model is a possible link to that lineof inquiry, we offer some considerations about the broader picture of thepotential of AI & Law in the evidentiary context. Whereas probabilisticreasoning is well-researched in AI, calculations about the threshold ofpersuasion in litigation, whatever their value, are just the tip of theiceberg. The bulk of the modeling desiderata is arguably elsewhere, if one isto ideally make the most of AI's distinctive contribution as envisaged forlegal evidence research.

Utilising computational fluid dynamics (CFD) for the modelling of granular material in large-scale engineering processes

In this paper, the framework is described for the modelling of granular material by employing Computational Fluid Dynamics (CFD). This is achieved through the use and implementation in the continuum theory of constitutive relations, which are derived in a granular dynamics framework and parametrise particle interactions that occur at the micro-scale level. The simulation of a process often met in bulk solids handling industrial plants involving granular matter, (i.e. filling of a flat-bottomed bin with a binary material mixture through pneumatic conveying-emptying of the bin in core flow mode-pneumatic conveying of the material coming out of a the bin) is presented. The results of the presented simulation demonstrate the capability of the numerical model to represent successfully key granular processes (i.e. segregation/degradation), the prediction of which is of great importance in the process engineering industry.

Scheduling batches with sequential job processing for two-machine flow and open shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.

Scheduling three-operation jobs in a two-machine flow shop to minimize makespan

This paper considers a variant of the classical problem of minimizing makespan in a two-machine flow shop. In this variant, each job has three operations, where the first operation must be performed on the first machine, the second operation can be performed on either machine but cannot be preempted, and the third operation must be performed on the second machine. The NP-hard nature of the problem motivates the design and analysis of approximation algorithms. It is shown that a schedule in which the operations are sequenced arbitrarily, but without inserted machine idle time, has a worst-case performance ratio of 2. Also, an algorithm that constructs four schedules and selects the best is shown to have a worst-case performance ratio of 3/2. A polynomial time approximation scheme (PTAS) is also presented.

Flow shop scheduling problems under machine–dependent precedence constraints

The paper considers the flow shop scheduling problems to minimize the makespan, provided that an individual precedence relation is specified on each machine. A fairly complete complexity classification of problems with two and three machines is obtained.

Can density functional theory (DFT) be used as an aid to a deeper understanding of tandem mass spectrometric fragmentation pathways?

Prediction of tandem mass spectrometric (MS/MS) fragmentation for non-peptidic molecules based on structure is of immense interest to the mass spectrometrist. If a reliable approach to MS/MS prediction could be achieved its impact within the pharmaceutical industry could be immense. Many publications have stressed that the fragmentation of a molecular ion or protonated molecule is a complex process that depends on many parameters, making prediction difficult. Commercial prediction software relies on a collection of general heuristic rules of fragmentation, which involve cleaving every bond in the structure to produce a list of 'expected' masses which can be compared with the experimental data. These approaches do not take into account the thermodynamic or molecular orbital effects that impact on the molecule at the point of protonation which could influence the potential sites of bond cleavage based on the structural motif. A series of compounds have been studied by examining the experimentally derived high-resolution MS/MS data and comparing it with the in silico modelling of the neutral and protonated structures. The effect that protonation at specific sites can have on the bond lengths has also been determined. We have calculated the thermodynamically most stable protonated species and have observed how that information can help predict the cleavage site for that ion. The data have shown that this use of in silico techniques could be a possible way to predict MS/MS spectra. Copyright (C) 2009 John Wiley & Sons, Ltd.

Modelling of a dosator: an analytical approach based on measured powder flow properties

[No abstract is available for this article.]

The dependence of power consumption of pneumatic conveying systems upon bulk material properties, pipeline bore and routing, and mode of flow

In this paper the dependence of the power consumption of pneumatic conveyors upon conveyed materials, pipeline route and bore, and mode of flow has been examined. The findings are that, with different materials and modes of flow, not only is the amount of power consumed very different but it varies in different ways with pipe bore and routing. Additionally it has been found that, for any given conveying system, the choice of air mover also has a strong influence on the power requirement.

Informal Learning in Online Knowledge Communities: Predicting Community Response to Visitor Inquiries

Nistor, N., Dascalu, M., Stavarache, L.L., Serafin, Y., & Trausan-Matu, S. (2015). Informal Learning in Online Knowledge Communities: Predicting Community Response to Visitor Inquiries. In G. Conole, T. Klobucar, C. Rensing, J. Konert & É. Lavoué (Eds.), 10th European Conf. on Technology Enhanced Learning (pp. 447–452). Toledo, Spain: Springer.

Through the portal – improving the flow of information on non-native marine species in Great Britain.

Abstract: The UK Government funded, GB Non-Native Species Information Portal (GBNNSIP) collects and collates data on non-native species in Great Britain making information available online. Resources include a comprehensive register of non-native species and detailed fact sheets for a sub-set, significant to humans or the environment. Reporting of species records are linked to risk analyses, rapid responses and horizon scanning to support the early recognition of threats (Figure 12). The portal has improved flow of new and existing distributional data to the National Biodiversity Network (NBN) to generate distribution maps for the portal. The project is led by the Biological Records Centre and the Marine Biological Association is responsible for marine non-native species within this scheme. The INTERREG IV funded project Marinexus has included professional research and citizen science work, which has fed directly into the portal. The portal outputs and the work of Marinexus have a range of marine governance applications, including supporting work towards MSFD compliance.

Fundamentals of steady state, non-Newtonian rimming flow

Rimming flow on the inner surface of a horizontal rotating cylinder is investigated. Using a scale analysis, a theoretical description is obtained for steady-state non-Newtonian flow. Simple lubrication theory is applied since the Reynolds number is small and the liquid film is thin. Since the Deborah number is very small the flow is viscometric. The shear-thinning number, which characterizes the shear-thinning effect, may be small or large. A general constitutive law for this kind of flow requires only a single function relating shear stress and shear rate that corresponds to a generalized Newtonian liquid. For this case the run-off condition for rimming flow is derived. Provided the run-off condition is satisfied, the existence of a continuous steady-state solution is proved. The rheological models, which show Newtonian behavior at low shear rates with transition to power-law shear thinning at moderate shear rates, are considered. Numerical results are carried out for the Carreau and Ellis models, which exhibit Newtonian behavior near the free surface and power-law behavior near the wall of the rotating cylinder.

Numerical simulation of separation factor of NaCl in surface force pore flow model

This work deals with modelling and experimental verification of desalination theory (surface force pore flow) . The work has direct application in desalination of sea water.