Dependence of collision frequency on distance between two hard-sphere particles estimated by computer simulation

A Monte Carlo simulation is performed to study the dependence of collision frequency on interparticle distance for a system composed of two hard-sphere particles. The simulation quantitatively shows that the collision frequency drops down sharply as the distance between two particles increases. This characteristic provides a useful evidence for the collision-reaction dynamics of aggregation process for the two-particle system described in the other reference.

Computer generated hologram with geometric occlusion using GPU-accelerated depth buffer rasterization for three-dimensional display

We present a method of rapidly producing computer-generated holograms that exhibit geometric occlusion in the reconstructed image. Conceptually, a bundle of rays is shot from every hologram sample into the object volume.We use z buffering to find the nearest intersecting object point for every ray and add its complex field contribution to the corresponding hologram sample. Each hologram sample belongs to an independent operation, allowing us to exploit the parallel computing capability of modern programmable graphics processing units (GPUs). Unlike algorithms that use points or planar segments as the basis for constructing the hologram, our algorithm's complexity is dependent on fixed system parameters, such as the number of ray-casting operations, and can therefore handle complicated models more efficiently. The finite number of hologram pixels is, in effect, a windowing function, and from analyzing the Wigner distribution function of windowed free-space transfer function we find an upper limit on the cone angle of the ray bundle. Experimentally, we found that an angular sampling distance of 0:01' for a 2:66' cone angle produces acceptable reconstruction quality. © 2009 Optical Society of America.

Computer Simulation Of Random Sphere Packing In An Arbitrarily Shaped Container

Most simulations of random sphere packing concern a cubic or cylindric container with periodic boundary, containers of other shapes are rarely studied. In this paper, a new relaxation algorithm with pre-expanding procedure for random sphere packing in an arbitrarily shaped container is presented. Boundaries of the container are simulated by overlapping spheres which covers the boundary surface of the container. We find 0.4 similar to 0.6 of the overlap rate is a proper value for boundary spheres. The algorithm begins with a random distribution of small internal spheres. Then the expansion and relaxation procedures are performed alternately to increase the packing density. The pre-expanding procedure stops when the packing density of internal spheres reaches a preset value. Following the pre-expanding procedure, the relaxation and shrinking iterations are carried out alternately to reduce the overlaps of internal spheres. The pre-expanding procedure avoids the overflow problem and gives a uniform distribution of initial spheres. Efficiency of the algorithm is increased with the cubic cell background system and double link data structure. Examples show the packing results agree well with both computational and experimental results. Packing density about 0.63 is obtained by the algorithm for random sphere packing in containers of various shapes.

Collective evolution characteristics and computer simulation of short fatigue cracks

Fatigue testing was conducted using a kind of triangular isostress specimen to obtain the short-fatigue-crack behaviour of a weld low-carbon steel. The experimental results show that short cracks continuously initiate at slip bands within ferrite grain domains and the crack number per unit area gradually increases with increasing number of fatigue cycles. The dispersed short cracks possess an orientation preference, which is associated with the crystalline orientation of the relevant slip system. Based on the observed collective characteristics, computer modelling was carried out to simulate the evolution process of initiation, propagation and coalescence of short cracks. The simulation provides progressive displays which imitate the appearance of experimental observations. The results of simulation indicate that the crack path possesses a stable value of fractal dimension whereas the critical value of percolation covers a wide datum band, suggesting that the collective evolution process of short cracks is sensitive to the pattern of crack site distribution.

Cone Effect in Astronomical Adaptive Optics System Investigated by a Pure Numerical Simulation

It is well-known that cone effect or focus anisoplanatism is produced by the limited distance of a laser guide star (LGS) which is created within the Earth atmosphere and consequently located at a finite distance from the observer. In this paper, the cone effect of the LGS for different vertical profiles of the refractive index structure constant Cn2 is numerically investigated by using a revised computer program of atmospheric propagation of optical wave and an adaptive optics (AO) system including dynamic control process. According to the practice, the overall tilt for the tilt-correction mirror is obtained from a natural star and the aberrated wavefront for phase correction of the deformable mirror is obtained from a LGS in our numerical simulation. It is surprisingly found that the effect of altitude of the LGS on the AO phase compensation effectiveness by using the commonly-available vertical profiles of Cn2 and the lateral wind speed in the atmosphere is relatively weak, and the cone effect for some Cn2 profiles is even negligible. It is found that the cone effect does not have obvious relationship with the turbulence strength, however, it depends on the vertical distribution profile of Cn 2 apparently. On the other hand, the cone effect depends on the vertical distribution of the lateral wind speed as well. In comparison to a longer wavelength, the cone effect becomes more obvious in the case of a shorter wavelength. In all cases concerned in this paper, an AO system by using a sodium guide star has almost same phase compensation effectiveness as that by using the astronomical target itself as a beacon. Effect of dynamic control process in an AO system on the cone effect is studied in this paper for the first time within our knowledge.

An Open and Social Spaced Repetition System for Language Learning

In the last decades big improvements have been done in the field of computer aided learning, based on improvements done in computer science and computer systems. Although the field has been always a bit lagged, without using the latest solutions, it has constantly gone forward taking profit of the innovations as they show up. As long as the train of the computer science does not stop (and it won’t at least in the near future) the systems that take profit of those improvements will not either, because we humans will always need to study; Sometimes for pleasure and some other many times out of need. Not all the attempts in the field of computer aided learning have been in the same direction. Most of them address one or some few of the problems that show while studying and don’t take into account solutions proposed for some other problems. The reasons for this can be varied. Sometimes the solutions simply are not compatible. Some other times, because the project is an investigation it’s interesting to isolate the problem. And, in commercial products, licenses and patents often prevent the new projects to use previous work. The world moved forward and this is an attempt to use some of the options offered by technology, mixing some old ideas with new ones.

Using the system dynamics paradigm in teaching and learning technological university subjets

2nd International Conference on Education and New Learning Technologies

Beyond Q-Resolution and Prenex Form: a Proof System for Quantified Constraint Satisfaction

We consider the quanti fied constraint satisfaction problem (QCSP) which is to decide, given a structure and a first-order sentence (not assumed here to be in prenex form) built from conjunction and quanti fication, whether or not the sentence is true on the structure. We present a proof system for certifying the falsity of QCSP instances and develop its basic theory; for instance, we provide an algorithmic interpretation of its behavior. Our proof system places the established Q-resolution proof system in a broader context, and also allows us to derive QCSP tractability results.