A multilevel algorithm for force-directed graph drawing

We describe a heuristic method for drawing graphs which uses a multilevel technique combined with a force-directed placement algorithm. The multilevel process groups vertices to form clusters, uses the clusters to define a new graph and is repeated until the graph size falls below some threshold. The coarsest graph is then given an initial layout and the layout is successively refined on all the graphs starting with the coarsest and ending with the original. In this way the multilevel algorithm both accelerates and gives a more global quality to the force- directed placement. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on a number of examples ranging from 500 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 30 seconds for a 10,000 vertex graph to around 10 minutes for the largest graph. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.

A multilevel algorithm for force-directed graph-drawing

We describe a heuristic method for drawing graphs which uses a multilevel framework combined with a force-directed placement algorithm. The multilevel technique matches and coalesces pairs of adjacent vertices to define a new graph and is repeated recursively to create a hierarchy of increasingly coarse graphs, G0, G1, …, GL. The coarsest graph, GL, is then given an initial layout and the layout is refined and extended to all the graphs starting with the coarsest and ending with the original. At each successive change of level, l, the initial layout for Gl is taken from its coarser and smaller child graph, Gl+1, and refined using force-directed placement. In this way the multilevel framework both accelerates and appears to give a more global quality to the drawing. The algorithm can compute both 2 & 3 dimensional layouts and we demonstrate it on examples ranging in size from 10 to 225,000 vertices. It is also very fast and can compute a 2D layout of a sparse graph in around 12 seconds for a 10,000 vertex graph to around 5-7 minutes for the largest graphs. This is an order of magnitude faster than recent implementations of force-directed placement algorithms.

A hybrid fractal video compression method

Fractal image compression is a relatively recent image compression method. Its extension to a sequence of motion images is important in video compression applications. There are two basic fractal compression methods, namely the cube-based and the frame-based methods, being commonly used in the industry. However there are advantages and disadvantages in both methods. This paper proposes a hybrid algorithm highlighting the advantages of the two methods in order to produce a good compression algorithm for video industry. Experimental results show the hybrid algorithm improves the compression ratio and the quality of decompressed images.

Matching search in fractal video compression and its parallel implementation in distributed computing environments

Fractal video compression is a relatively new video compression method. Its attraction is due to the high compression ratio and the simple decompression algorithm. But its computational complexity is high and as a result parallel algorithms on high performance machines become one way out. In this study we partition the matching search, which occupies the majority of the work in a fractal video compression process, into small tasks and implement them in two distributed computing environments, one using DCOM and the other using .NET Remoting technology, based on a local area network consists of loosely coupled PCs. Experimental results show that the parallel algorithm is able to achieve a high speedup in these distributed environments.

Adaptive partition and hybrid method in fractal video compression

Fractal image compression is a relatively recent image compression method, which is simple to use and often leads to a high compression ratio. These advantages make it suitable for the situation of a single encoding and many decoding, as required in video on demand, archive compression, etc. There are two fundamental fractal compression methods, namely, the cube-based and the frame-based methods, being commonly studied. However, there are advantages and disadvantages in both methods. This paper gives an extension of the fundamental compression methods based on the concept of adaptive partition. Experimental results show that the algorithms based on adaptive partition may obtain a much higher compression ratio compared to algorithms based on fixed partition while maintaining the quality of decompressed images.

Droplet formation with electromagnetic pulse force

Methods for serial generation of droplets from a liquid jet are shortly reviewed. A method of liquid metal droplet generation based on AC high frequency magnetic field is considered in detail. Numerical model for direct simulation of the time dependent droplet generation process is presented. Computed examples demonstrate the liquid silicon droplet formation for the cases of 500-1500 μm diameter.

Design of parallel algorithms for fractal video compression

The intrinsic independent features of the optimal codebook cubes searching process in fractal video compression systems are examined and exploited. The design of a suitable parallel algorithm reflecting the concept is presented. The Message Passing Interface (MPI) is chosen to be the communication tool for the implementation of the parallel algorithm on distributed memory parallel computers. Experimental results show that the parallel algorithm is able to reduce the compression time and achieve a high speed-up without changing the compression ratio and the quality of the decompressed image. A scalability test was also performed, and the results show that this parallel algorithm is scalable.

Grey video compression methods using fractals

The authors' experience in the treatment of grey video compression using fractals is summarized and compared with other research in the same field. Experience with parallel and distributed computing is also discussed.

Manufacturing of uniformly-sized silicon particles for solar cell from molten metal jet by electromagnetic pinch force

Spherical silicon solar cells are expected to serve as a technology to reduce silicon usage of photovoltaic (PV) power systems[1, 2, 3]. In order to establish the spherical silicon solar cell, a manufacturing method of uniformly sized silicon particles of 1mm in diameter is required. However, it is difficult to mass-produce the mono-sized silicon particles at low cost by existent processes now. We proposed a new method to generate liquid metal droplets uniformly by applying electromagnetic pinch force to a liquid metal jet[4]. The electromagnetic force was intermittently applied to the liquid metal jet issued from a nozzle in order to fluctuate the surface of the jet. As the fluctuation grew, the liquid jet was broken up into small droplets according to a frequency of the intermittent electromagnetic force. Firstly, a preliminary experiment was carried out. A single pulse current was applied instantaneously to a single turn coil around a molten gallium jet. It was confirmed that the jet could be split up by pinch force generated by the current. And then, electromagnetic pinch force was applied intermittently to the jet. It was found that the jet was broken up into mono-sized droplets in the case of a force frequency was equal to a critical frequency[5], which corresponds to a natural disturbance wave length of the jet. Numerical simulations of the droplet generation from the liquid jet were then carried out, which consisted of an electromagnetic analysis and a fluid flow calculation with a free surface of the jet. The simulation results were compared with the experiments and the agreement between the two was quite good.

Characterization of chitin–metal silicates as binding superdisintegrants

When chitin is used in pharmaceutical formulations, processing of chitin with metal silicates is advantageous, from both an industrial and pharmaceutical perspective, compared to processing using silicon dioxide. Unlike the use of acidic and basic reagents for the industrial preparation of chitin-silica particles, coprecipitation of metal silicates is dependent upon a simple replacement reaction between sodium silicate and metal chlorides. When coprecipitated onto chitin particles, aluminum, magnesium, or calcium silicates result in nonhygroscopic, highly compactable/disintegrable compacts. Disintegration and hardness parameters for coprocessed chitin compacts were investigated and found to be independent of the particle size. Capillary action appears to be the major contributor to both water uptake and the driving force for disintegration of compacts. The good compaction and compression properties shown by the chitin-metal silicates were found to be strongly dependent upon the type of metal silicate coprecipitated onto chitin. In addition, the inherent binding and disintegration abilities of chitin-metal silicates are useful in pharmaceutical applications when poorly compressible and/or highly nonpolar drugs need to be formulated. (C) 2009 Wiley-Liss, Inc. and the American Pharmacists Association J Pharm Sci 98:4887-4901, 2009.

Mode shape expansion using perturbed force vector approach

A new technique for mode shape expansion in structural dynamic applications is presented based on the perturbed force vector approach. The proposed technique can directly adopt the measured incomplete modal data and include the effect of the perturbation between the analytical and test models. The results show that the proposed technique can provide very accurate expanded mode shapes, especially in cases when significant modelling error exists in the analytical model and limited measurements are available.