42663338
Automatic curve fitting with quadratic B-spline functions and its applications to computer-assisted animation
Abstract Automatic fitting to digitized curves by quadratic B-spline functions is discussed. Due to its simplicity, it is possible to find a quick fit within a given error tolerance bound which is defined as the maximum distance between the fitted curve and the original curve. Again due to the simple form of a quadratic polynomial, some complicated computations in computer-assisted animation such as hidden line removal can also be easily handled.
23496769
Image Enhancement for Segmentation by Self-Induced Autoregressive Filtering
A filter induced by the autoregressive pattern from an image is used to enhance the image itself. The enhanced image usually reveals the wave pattern and nonstationary structures more clearly than the original. Unlike the Fourier analysis, local structures in the image are still retained. The merits have been demonstrated on simulated data and synthetic-aperture radar (SAR) ocean imagery. >
39597496
A Hybrid Parallel Loop Scheduling Scheme on Grid Environments
Effective loop-scheduling can significantly reduce the total execution time of a program on grid environments, especially for loop-intensive applications. This paper describes a two-phased method, named HPLS (Hybrid Parallel Loop Scheduling), to dynamically schedule loop iterations of a program on grid environments. In the first phase, most of the workload is dispatched to each node for execution according to its performance. Then, some well-known self-scheduling scheme is utilized to schedule the remaining workload. Experimental results showed that in most cases our approach could produce more efficient scheduling than previous schemes on our testbed grid. In addition, the results suggest that our approach is suitable for loop scheduling on grid environments.
33193327
An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications
A new algorithm is developed for making attacks to certain comparatively simple LFSR based ciphersystems. Special attention is paid towards minimizing the solution distance and guaranteeing the success probability of the attacks. The algorithm is then applied to crack the random bit generators of Geffe (1973) and Beth-Piper (1984).
18362603
Apply cluster and grid computing on parallel 3D rendering
A cluster is a collection of independent and cheap machines, used together as a supercomputer to provide a solution. In this paper, a PC cluster consisting of one master node and nine disk-less slave nodes (10 processors), is proposed and built for parallel rendering purposes. The system architecture and benchmark performances of this cluster are also presented. Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. Harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. Also, in this paper, we construct two heterogeneous PC clusters for parallel rendering purpose and install Linux Red Hat 9 on each PC cluster. Then, these clusters are set to the different subnet. Therefore, we use the grid middleware lambdaobus ToolKit, to connect these two clusters to form a grid computing environment on multiple Linux PC clusters. We also install the SUN Grid Engine, to manage and monitor incoming or outgoing computing jobs and schedule the job to achieve high performance computing and high CPU utilization. The system architecture and benchmark performances of this cluster are also presented
6437408
Application-specific file prefetching for multimedia programs
This paper describes the design, implementation, and evaluation of an automatic application-specific file prefetching mechanism that is designed to improve the I/O performance of multimedia programs with complicated access patterns. The key idea of the proposed approach is to convert an application into two threads: a computation thread, which is the original program containing both computation and disk I/O, and a prefetch thread, which contains all the instructions in the original program that are related to disk accesses. At run time, the prefetch thread is scheduled to run far ahead of the computation thread, so that disk blocks can be prefetched and put in the file system buffer cache before the computation thread needs them. A source-to-source translator is developed to automatically generate the prefetch and computation thread from a given application program without any user intervention. We have successfully implemented a prototype of this automatic application-specific file prefetching mechanism under Linux. The prototype is shown to provide as much as 54% overall performance improvement for real-world multimedia applications.
5672930
An e-Learning Platform Based on Grid Architecture
The overall popularity of the Internet has helped e-learning become a hot method for learning in recent years. Over the Internet, learners can freely absorb new knowledge without restrictions on time or place. Many companies have adopted e-learning to train their employees. An e-learning system can make an enterprise more competitive by increasing the knowledge of its employees. E-learning has been shown to have impressive potential in e-commerce. At present, most e-learning environment architectures use single computers or servers as their structural foundations. As soon as their work loads increase, their software and hardware must be updated or renewed. This is a big burden on organizations that lack sufficient funds. Thus, in this study we employ a kind of Grid Computing technology, called the ”Data Grid” to integrate idle computer resources in enterprises into e-learning platforms, thus eliminating the need to purchase costly high-level servers and other equipment.