Residual Vibration Reduction in Computer Controlled Machines

Control of machines that exhibit flexibility becomes important when designers attempt to push the state of the art with faster, lighter machines. Three steps are necessary for the control of a flexible planet. First, a good model of the plant must exist. Second, a good controller must be designed. Third, inputs to the controller must be constructed using knowledge of the system dynamic response. There is a great deal of literature pertaining to modeling and control but little dealing with the shaping of system inputs. Chapter 2 examines two input shaping techniques based on frequency domain analysis. The first involves the use of the first deriviate of a gaussian exponential as a driving function template. The second, acasual filtering, involves removal of energy from the driving functions at the resonant frequencies of the system. Chapter 3 presents a linear programming technique for generating vibration-reducing driving functions for systems. Chapter 4 extends the results of the previous chapter by developing a direct solution to the new class of driving functions. A detailed analysis of the new technique is presented from five different perspectives and several extensions are presented. Chapter 5 verifies the theories of the previous two chapters with hardware experiments. Because the new technique resembles common signal filtering, chapter 6 compares the new approach to eleven standard filters. The new technique will be shown to result in less residual vibrations, have better robustness to system parameter uncertainty, and require less computation than other currently used shaping techniques.

Theory of elasticity and electric polarization effects in the group-III nitrides

In this work, the properties of strained tetrahedrally bonded materials are explored theoretically, with special focus on group-III nitrides. In order to do so, a multiscale approach is taken: accurate quantitative calculations of material properties are carried out in a quantum first-principles frame, for small systems. These properties are then extrapolated and empirical methods are employed to make predictions for larger systems, such as alloys or nanostructures. We focus our attention on elasticity and electric polarization in semiconductors. These quantities serve as input for the calculation of the optoelectronic properties of these systems. Regarding the methods employed, our first-principles calculations use highly- accurate density functional theory (DFT) within both standard Kohn-Sham and generalized (hybrid functional) Kohn-Sham approaches. We have developed our own empirical methods, including valence force field (VFF) and a point-dipole model for the calculation of local polarization and local polarization potential. Our local polarization model gives insight for the first time to local fluctuations of the electric polarization at an atomistic level. At the continuum level, we have studied composition-engineering optimization of nitride nanostructures for built-in electrostatic field reduction, and have developed a highly efficient hybrid analytical-numerical staggered-grid computational implementation of continuum elasticity theory, that is used to treat larger systems, such as quantum dots.

Excluding mammalian predators from diamondback terrapin nesting beaches with an electric fence

Gemstone Team Saving Testudo

Design and Evaluation of a Retrofittable Electric Snow Melting System for Pavements

Gemstone Team SnowMelt

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.

Demonstration thermo-electric and MHD mathematical models of a 500 kA A1 electrolysis cell

In the present study, a 3D full cell quarter thermo-electric model of a 500kA demonstration cell has been developed and solved. In parallel, a non-linear wave MHD model of the same 500 kA demonstration cell has been developed and solved. A preliminary study of the impact of the interactions between the cell thermo-electric and MHD models will be presented.

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.

Time dependent electric, magnetic and hydrodynamic interaction in aluminium electrolysis cells

The waves in commercial cells for electrolytic aluminium production originate at the interface between the liquid aluminium and electrolyte, but their effect can spread into the surrounding busbar network as electric current perturbation, and the total magnetic field acquires a time dependent component. The presented model for the wave development accounts for the nonuniform electric current distribution at the cathode and the whole network of the surrounding busbars. The magnetic field is computed for the continuous current in the fluid zones, all busbars and the ferromagnetic construction elements. When the electric current and the associated magnetic field are computed according to the actual electrical circuit and updated for all times, the instability growth rate is significantly affected. The presented numerical model for the wave and electromagnetic interaction demonstrates how different physical coupling factors are affecting the wave development in the electrolysis cells. These small amplitude self-sustained interface oscillations are damped in the presence of intense turbulent viscosity created by the horizontal circulation velocity field. Additionally, the horizontal circulation vortices create a pressure gradient contributing to the deformation of the interface. Instructive examples for the 500 kA demonstration cell are presented.

High electric current density-induced interfacial reactions in micro ball grid array (μBGA) solder joints

The effect of a high electric current density on the interfacial reactions of micro ball grid array solder joints was studied at room temperature and at 150 °C. Four types of phenomena were reported. Along with electromigration-induced interfacial intermetallic compound (IMC) formation, dissolution at the Cu under bump metallization (UBM)/bond pad was also noticed. With a detailed investigation, it was found that the narrow and thin metallization at the component side produced “Joule heating” due to its higher resistance, which in turn was responsible for the rapid dissolution of the Cu UBM/bond pad near to the Cu trace. During an “electromigration test” of a solder joint, the heat generation due to Joule heating and the heat dissipation from the package should be considered carefully. When the heat dissipation fails to compete with the Joule heating, the solder joint melts and molten solder accelerates the interfacial reactions in the solder joint. The presence of a liquid phase was demonstrated from microstructural evidence of solder joints after different current stressing (ranging from 0.3 to 2 A) as well as an in situ observation. Electromigration-induced liquid state diffusion of Cu was found to be responsible for the higher growth rate of the IMC on the anode side.

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.