Liquid metal turbulent flow dynamics in a cylindrical container with free surface: experiment and numerical analysis

The liquid metal flow in induction crucible models is known to be unstable, turbulent and difficult to predict in the regime of medium frequencies when the electromagnetic skin-layer is of considerable extent. We present long term turbulent flow measurements by a permanent magnet incorporated potential difference velocity probe in a cylindrical container filled with eutectic melt In-Ga-Sn. The parallel numerical simulation of the long time scale development of the turbulent average flow is presented. The numerical flow model uses an implicit pseudo-spectral code and k-w turbulence model, which was recently developed for the transitional flow modelling. The results compare reasonably to the experiment and demonstrate the time development of the turbulent flow field and the turbulence energy.

Liquid metal turbulent flow dynamics in a cylindrical container with free surface: experiment and numerical analysis

The liquid metal flow in inducation crucible models is known to be higly unstable and turbutlen in the regim e of medium frequecies when the elctronmagnetic skin-layer is of considerable extent. We present long term turbulent flow measurements by a permanent magnet incorporated potential difference veolocity probe in a cylindirical container filled with eutecti mlt In-Ga-SN. The parallel numerical simulation of the long time scale development of the turbulen average flow is presented. The numerical lfow model uses a pseud-spectral code and k-w turbulence model, which was recently developed for the transitional flow modelling. The result compare reasonably to the experiment and demonstrate the time development of the turbulent flow field.

Bulk synchronous parallelization of industrial electromagentic software

The parallelization of existing/industrial electromagnetic software using the bulk synchronous parallel (BSP) computation model is presented. The software employs the finite element method with a preconditioned conjugate gradient-type solution for the resulting linear systems of equations. A geometric mesh-partitioning approach is applied within the BSP framework for the assembly and solution phases of the finite element computation. This is combined with a nongeometric, data-driven parallel quadrature procedure for the evaluation of right-hand-side terms in applications involving coil fields. A similar parallel decomposition is applied to the parallel calculation of electron beam trajectories required for the design of tube devices. The BSP parallelization approach adopted is fully portable, conceptually simple, and cost-effective, and it can be applied to a wide range of finite element applications not necessarily related to electromagnetics.

Scheduling for parallel dedicated machines with a single server

This paper examines scheduling problems in which the setup phase of each operation needs to be attended by a single server, common for all jobs and different from the processing machines. The objective in each situation is to minimize the makespan. For the processing system consisting of two parallel dedicated machines we prove that the problem of finding an optimal schedule is NP-hard in the strong sense even if all setup times are equal or if all processing times are equal. For the case of m parallel dedicated machines, a simple greedy algorithm is shown to create a schedule with the makespan that is at most twice the optimum value. For the two machine case, an improved heuristic guarantees a tight worst-case ratio of 3/2. We also describe several polynomially solvable cases of the later problem. The two-machine flow shop and the open shop problems with a single server are also shown to be NP-hard in the strong sense. However, we reduce the two-machine flow shop no-wait problem with a single server to the Gilmore-Gomory traveling salesman problem and solve it in polynomial time. (c) 2000 John Wiley & Sons, Inc.

[Book review] Peter Reimann and Hans Spada (eds), Learning in Humans and Machines: Towards an Interdisciplinary Learning Science

Review of: Peter Reimann and Hans Spada (eds), Learning in Humans and Machines: Towards an Interdisciplinary Learning Science, Pergamon. (1995). ISBN: 978-0080425696

Scheduling parallel dedicated machines under a single non-shared resource

The scheduling problem of minimizing the makespan for m parallel dedicated machines under single resource constraints is considered. For different variants of the problem the complexity status is established. Heuristic algorithms employing the so-called group technology approach are presented and their worst-case behavior is examined. Finally, a polynomial time approximation scheme is presented for the problem with fixed number of machines.

Scheduling problems for parallel dedicated machines under multiple resource constraints

The paper considers scheduling problems for parallel dedicated machines subject to resource constraints. A fairly complete computational complexity classification is obtained, a number of polynomial-time algorithms are designed. For the problem with a fixed number of machines in which a job uses at most one resource of unit size a polynomial-time approximation scheme is offered.

Spatial variability of air pollution in the vicinity of a permanent monitoring station in central Paris

The strong spatial and temporal variability of traffic-related air pollution detected at roadside locations in a number of European cities has raised the question of how representative the site and time period of air quality measurements actually can be. To address this question, a 7-month sampling campaign was carried out on a major road axis (Avenue Leclerc) leading to a very busy intersection (Place Basch) in central Paris, covering the surroundings of a permanent air quality monitoring station. This station has recorded the highest CO and NOx concentrations during recent years in the region of Paris. Diffusive BTX samplers as well as a mobile monitoring unit equipped with real-time CO, NOx and O3 analysers and meteorological instruments were used to reveal the small-scale pollution gradients and their temporal trends near the permanent monitoring station. The diffusive measurements provided 7-day averages of benzene, toluene, xylene and other hydrocarbons at different heights above the ground and distances from the kerb covering summer and winter periods. Relevant traffic and meteorological data were also obtained on an hourly basis. Furthermore, three semiempirical dispersion models (STREET-SRI, OSPM and AEOLIUS) were tested for an asymmetric canyon location in Av. Leclerc. The analysis of this comprehensive data set has helped to assess the representativeness of air quality monitoring information.

Support vector machines for regression and applications to software quality prediction

Software metrics are the key tool in software quality management. In this paper, we propose to use support vector machines for regression applied to software metrics to predict software quality. In experiments we compare this method with other regression techniques such as Multivariate Linear Regression, Conjunctive Rule and Locally Weighted Regression. Results on benchmark dataset MIS, using mean absolute error, and correlation coefficient as regression performance measures, indicate that support vector machines regression is a promising technique for software quality prediction. In addition, our investigation of PCA based metrics extraction shows that using the first few Principal Components (PC) we can still get relatively good performance.

Scheduling parallel dedicated machines with the speeding-up resource

We consider a problem of scheduling jobs on m parallel machines. The machines are dedicated, i.e., for each job the processing machine is known in advance. We mainly concentrate on the model in which at any time there is one unit of an additional resource. Any job may be assigned the resource and this reduces its processing time. A job that is given the resource uses it at each time of its processing. No two jobs are allowed to use the resource simultaneously. The objective is to minimize the makespan. We prove that the two-machine problem is NP-hard in the ordinary sense, describe a pseudopolynomial dynamic programming algorithm and convert it into an FPTAS. For the problem with an arbitrary number of machines we present an algorithm with a worst-case ratio close to 3/2, and close to 3, if a job can be given several units of the resource. For the problem with a fixed number of machines we give a PTAS. Virtually all algorithms rely on a certain variant of the linear knapsack problem (maximization, minimization, multiple-choice, bicriteria). © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008

Preemptive scheduling on uniform parallel machines with controllable job processing times

In this paper, we provide a unified approach to solving preemptive scheduling problems with uniform parallel machines and controllable processing times. We demonstrate that a single criterion problem of minimizing total compression cost subject to the constraint that all due dates should be met can be formulated in terms of maximizing a linear function over a generalized polymatroid. This justifies applicability of the greedy approach and allows us to develop fast algorithms for solving the problem with arbitrary release and due dates as well as its special case with zero release dates and a common due date. For the bicriteria counterpart of the latter problem we develop an efficient algorithm that constructs the trade-off curve for minimizing the compression cost and the makespan.

Marginal adaptation and performance of bioactive dental restorative materials in deciduous and young permanent teeth

Objective: The aim of this study was to investigate the adaptation of different types of restorations towards deciduous and young permanent teeth. Materials and Methods: Class V cavities were prepared in deciduous and young permanent teeth and filled with different materials (a conventional glass-ionomer, a resin-modified glass-ionomer, a poly-acid-modified composite resin and a conventional composite resin). Specimens were aged in artificial saliva for 1, 6, 12 and 18 months, then examined by SEM. Results: The composite resin and the polyacid-modified composite had better marginal adaptation than the glass-ionomers,though microcracks developed in the enamel of the tooth. The glass-ionomers showed inferior marginal quality and durability, but no microcracking of the enamel. The margins of the resin-modified glass-ionomer were slightly superior to the conventional glass-ionomer. Conditioning improved the adaptation of the composite resin, but the type of tooth made little or no difference to the performance of the restorative material. All materials were associated with the formation of crystals in the gaps between the filling and the tooth; the quantity and shape of these crystals varied with the material. Conclusions: Resin-based materials are generally better at forming sound, durable margins in deciduous and young permanent teeth than cements, but are associated with microcracks in the enamel. All fluoride-releasing materials give rise to crystalline deposits.