Visualization of Cerenkov radiation and the fields of a moving charge

For some physics students, the concept of a particle travelling faster than the speed of light holds endless fascination, and. Cerenkov radiation is a visible consequence of a charged particle travelling through a medium at locally superluminal velocities. The Heaviside-Feynman equations for calculating the magnetic and electric fields of a moving charge have been known for many decades, but it is only recently that the computing power to plot the fields of such a particle has become readily available for student use. This paper investigates and illustrates the calculation of Maxwell's D field in homogeneous isotropic media for arbitrary, including superluminal, constant velocity, and uses the results as a basis for discussing energy transfer in the electromagnetic field.

NMR microscopy: A tool for measuring monomer diffusion in supercritical CO2

The diffusion of styrene into linear low density polyethylene in a solution of supercritical CO2 was investigated using NMR microimaging. For both pure styrene and styrene dissolved in supercritical CO2, the diffusion was found to follow Fickian kinetics. Supercritical CO2 was found to enhance the rate and extent of diffusion of styrene into the substrate by up to three times under the conditions of this investigation, compared to pure styrene. NMR imaging was used to measure the concentration profiles of the styrene penetrants in real time, and the results were fitted to a Fickian model for diffusion. At a CO2 pressure of 150 bar and temperature of 40 degrees C, the diffusion coefficient of a 30 wt-% solution of styrene into LLDPE was calculated to be 1 X 10(-11) m(2). s(-1). This is significantly faster than the diffusion coefficient measured for pure styrene diffusion at 40 degrees C (3 x 10(-12) m(2). s(-1)). The diffusion coefficients determined by gravimetric analysis were slightly higher than those determined by the imaging method. This was probably due to residual styrene and/or polystyrene adhering to the surface of the films in the gravimetric technique.

Performance comparisons between greedy and lagrange algorithms in adaptive MIMO MC-CDMA systems

This paper describes two algorithms for adaptive power and bit allocations in a multiple input multiple output multiple-carrier code division multiple access (MIMO MC-CDMA) system. The first is the greedy algorithm, which has already been presented in the literature. The other one, which is proposed by the authors, is based on the use of the Lagrange multiplier method. The performances of the two algorithms are compared via Monte Carlo simulations. At present stage, the simulations are restricted to a single user MIMO MC-CDMA system, which is equivalent to a MIMO OFDM system. It is assumed that the system operates in a frequency selective fading environment. The transmitter has a partial knowledge of the channel whose properties are measured at the receiver. The use of the two algorithms results in similar system performances. The advantage of the Lagrange algorithm is that is much faster than the greedy algorithm. ©2005 IEEE

Efficient spatial clustering algorithm using binary tree

In this paper we present an efficient k-Means clustering algorithm for two dimensional data. The proposed algorithm re-organizes dataset into a form of nested binary tree*. Data items are compared at each node with only two nearest means with respect to each dimension and assigned to the one that has the closer mean. The main intuition of our research is as follows: We build the nested binary tree. Then we scan the data in raster order by in-order traversal of the tree. Lastly we compare data item at each node to the only two nearest means to assign the value to the intendant cluster. In this way we are able to save the computational cost significantly by reducing the number of comparisons with means and also by the least use to Euclidian distance formula. Our results showed that our method can perform clustering operation much faster than the classical ones. © Springer-Verlag Berlin Heidelberg 2005

A new relaxation method for roll forming problems

Finite element analysis (FEA) of nonlinear problems in solid mechanics is a time consuming process, but it can deal rigorously with the problems of both geometric, contact and material nonlinearity that occur in roll forming. The simulation time limits the application of nonlinear FEA to these problems in industrial practice, so that most applications of nonlinear FEA are in theoretical studies and engineering consulting or troubleshooting. Instead, quick methods based on a global assumption of the deformed shape have been used by the roll-forming industry. These approaches are of limited accuracy. This paper proposes a new form-finding method - a relaxation method to solve the nonlinear problem of predicting the deformed shape due to plastic deformation in roll forming. This method involves applying a small perturbation to each discrete node in order to update the local displacement field, while minimizing plastic work. This is iteratively applied to update the positions of all nodes. As the method assumes a local displacement field, the strain and stress components at each node are calculated explicitly. Continued perturbation of nodes leads to optimisation of the displacement field. Another important feature of this paper is a new approach to consideration of strain history. For a stable and continuous process such as rolling and roll forming, the strain history of a point is represented spatially by the states at a row of nodes leading in the direction of rolling to the current one. Therefore the increment of the strain components and the work-increment of a point can be found without moving the object forward. Using this method we can find the solution for rolling or roll forming in just one step. This method is expected to be faster than commercial finite element packages by eliminating repeated solution of large sets of simultaneous equations and the need to update boundary conditions that represent the rolls.