Dynamic computer simulation of electrophoretic enantiomer migration order and separation in presence of a neutral cyclodextrin

2014 ◽  
Vol 35 (19) ◽  
pp. 2833-2841 ◽  
Author(s):  
Wolfgang Thormann ◽  
Lali Chankvetadze ◽  
Mehmet Gumustas ◽  
Bezhan Chankvetadze
Keyword(s):  
Computer Simulation ◽  
Dynamic Computer Simulation

Concept development for the optimisation of the Hamburg Wastewater Treatment Plants

2000 ◽  
Vol 41 (9) ◽  
pp. 89-95 ◽  
Author(s):  
G. Ladiges ◽  
N-P. Bertram ◽  
R. Otterpohl
Keyword(s):  
Computer Simulation ◽  
Wastewater Treatment ◽  
Simulation Study ◽  
Storage Capacity ◽  
Wastewater Treatment Plants ◽  
Concept Development ◽  
Final Solution ◽  
Effluent Standards ◽  
Dynamic Computer Simulation ◽  
Traditional Manner

The Hamburger Stadtentwässerung (HSE) is planning to take on a further approximately 250,000 PE in addition to the 1.85 m PE already served by its combined wastewater treatment plants at Köhlbrandhöft/Dradenau. To cope with the increased load, a concept for the extension of the plants had to be developed. Various concepts were compared and evaluated using a dynamic computer simulation. The very wide-ranging simulation study showed that the required effluent standards can still be achieved after the volume of the sludge liquor storage capacity has been increased. As many concepts had been assessed in detail, the final solution chosen was considerably less expensive than if the wastewater treatment plants had been extended in a traditional manner.

Efficient Dynamic Computer Simulation of Simple-Closed Spatial Linkages

1990 ◽  
Author(s):  
L. T. Wang
Keyword(s):  
Computer Simulation ◽  
Computational Algorithm ◽  
Equations Of Motion ◽  
Joint Space ◽  
Kinematic Chains ◽  
Spatial Linkages ◽  
Dynamic Computer Simulation ◽  
The Stability ◽  
Coordinate Partitioning ◽  
Generalized Coordinate

Abstract A new method of formulating the generalized equations of motion for simple-closed (single loop) spatial linkages is presented in this paper. This method is based on the generalized principle of D’Alembert and the use of the transformation Jacobian matrices. The number of the differential equations of motion is minimized by performing the method of generalized coordinate partitioning in the joint space. Based on this formulation, a computational algorithm for computer simulation the dynamic motions of the linkage is developed, this algorithm is not only numerically stable but also fully exploits the efficient recursive computational schemes developed earlier for open kinematic chains. Two numerical examples are presented to demonstrate the stability and efficiency of the algorithm.

The Non-Recursive Newton-Euler Formulation of the Dynamic Equation for Robotic Mechanisms

1986 ◽  
Vol 10 (1) ◽  
pp. 16-20
Author(s):  
You-Sun Li ◽  
Anastasios Kessaris
Keyword(s):  
Computer Simulation ◽  
Dynamic Equation ◽  
Kinematic Chain ◽  
Open Loop ◽  
Dynamic Equations ◽  
Design Stage ◽  
Real Time Control ◽  
Time Control ◽  
Dynamic Computer Simulation ◽  
New Formulation

A new formulation of the dynamic equations of an open loop kinematic chain is presented in this paper. This new method is based upon the composite link system concept and the dynamic equations are derived using vectorial analysis. In comparison with conventional methods, the method presented in this paper is more efficient and more explicit, hence it is applicable to both real time control and dynamic computer simulation during the design stage of new robotic mechanisms.

Sign in / Sign up

Export Citation Format

Share Document