• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.30 no.5
• /
• pp.15-23
• /
• 2002

For molecular dynamics requires high-performance computers or supercomputers to handle huge amount of computation, it is not until recent days that the application of molecular dynamics to materials fracture simulations draw some attention from many researchers. With the recent advent of high-performance computers, computation intensive methods become more tractable than ever. However, carrying out materials simulation on high-performance computers costs too much in general. In this study, a PC cluster consisting of multiple commodity PCs is established and computer simulations of materials with cracks are carried out on it via molecular dynamics technique. The effect of the number of nodes, speedup factors, and communication time between nodes are measured to verify the performance of the PC cluster. Upon using the PC cluster, materials fracture simulations with more than 50,000 molecules are carried out successfully.

• Journal of Broadcast Engineering
• /
• v.7 no.4
• /
• pp.300-309
• /
• 2002

The object of this paper is to make temporal direct mode clear by providing a solution to the following problem : if the co-located block in the list 1 reference picture for direct mode has only the 1ist 1 motion vector or both the 1ist 0 and list 1 motion vectors, then which motion vector will be used for the direct mode motion vector calculation\ulcorner This paper also shows how to derive reference picture index and direct mode motion vector for each list in order to guarantee the high coding efficiency. when the co-located macroblock is in intra mode. Furthermore, the reasonable calculation methods for the direct mode motion vectors in the various cases are presented. Finally, experimental results show that the proposed temporal direct mode provides the comparable performance against the spatial direct mode. Therefore, the simulation proves that the proposed temporal direct mode is acceptable.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.134-143
• /
• 1999

In this paper, in order to implement the IDWT(inverse discrete wavelet transform) with relatively low complexity, we propose a VLSI architecture for odd-tap linear-phase IDWT filters. By considering the symmetric property of the linear phase filter, the input is added to the one located at symmetrical position of the filter before filtering. Then. we rearrange the delay line of the filter in a U-shaped fashion. requiring no global interconnection between the components. The proposed architecture for the IDWT filter consists of delay units. operator units, adder units. and postprocessor unit. Since each units are configured regularly and interconnected locally. the proposed architecture can accommodate arbitrary linear phase IDWTs by simply adding/removing the corresponding units. The M -level IDWT can be implemented by interconnecting the proposed architecture in a cascaded or semi-recursive form. It is expected that the proposed architecture for the IDWT can be effectively employed in the related area including MPEG-4, since the proposed architecture is less complex than the conventional architectures.

• Tunnel and Underground Space
• /
• v.25 no.6
• /
• pp.534-542
• /
• 2015

Round trip activity occurs discretely due to the abrasion of drill bit in the deep drilling project. Round trip has great impact on the drilling performance because it takes more time to change a drill bit as the depth goes deeper. Therefore, a reliable prediction technology of the round trip should be secured for feasibility analysis and effective management of the drilling project. Lee et al. (2013) developed the TOSA (round trip occurrence simulation algorithm) which can analyze the depth and timing of round trip occurrence at each abrasion state of bit. However, TOSA has weakness that it takes long time for simulation because the number of simulation increase exponentially as increasing the number of simulation section. This study developed the TOSA based round trip performance prediction module using genetic algorithm for simulating in a short time and verified simulation results.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.38 no.5
• /
• pp.489-495
• /
• 2014

A micro-genetic algorithm (MGA) is one of the improved forms of a genetic algorithm. It is used to reduce the number of iterations and the computing resources required by using small populations. The efficiency of MGAs has been proved through many problems, especially problems with 3-5 design variables. This study proposes an optimization algorithm based on the sequential design of experiments (SDOE) and an MGA. In a previous study, the authors used the SDOE technique to reduce trial-and-error in the conventional approximate optimization method by using the statistical design of experiments (DOE) and response surface method (RSM) systematically. The proposed algorithm has been applied to various mathematical examples and a structural problem.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.24 no.2
• /
• pp.175-182
• /
• 2006

The efficient management for minimum losses and demage precautions of fragile region against coastal disasters such as seismic waves and seawater overflows is proceeding continually. This study is to analyze inundation trace and extract expected damage areas with historic records of tsunami using Geographic Information System. Creating a digital elevation model of the Mangsang and the Nobong region in the east coast, we marked inundation record of tsunami and forecasted the flood area with a seismic wave height between 3 m and 5 m. The inundation trace layers and the expected damage areas on the cadastral map layer were superimposed individually. Consequently, the range and lot numbers of inundation expected area were calculated and inundation areas of 5 m tsunami were increased by 2.8 times than 3 m tsunami in case of subject regions. Analyzed results are expected to use evacuation work in case of seismic waves and to predict the compensation of the damaged area. And this study is expected to use suitable countermeasure for prevention from natural disasters.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.11
• /
• pp.5385-5391
• /
• 2013

As on-line purchases is activated, customers' demand increases for the realistic and accurate digital information of a product design. In this paper, we propose a practical method that can generate a realistic 3D model of a real product using a 3D geometry obtained by a 3D scanner and its photographic images. In order to register images to the 3D geometry, the camera focal length, the CCD scanning aspect ratio and the transformation matrix between the camera coordinate and the 3D object coordinate must be determined. To perform this 2D-3D registration with consideration of computational complexity, a three-step method is applied, which consists of camera calibration, determination of a temporary optimum translation vector (TOTV) and nonlinear optimization for three rotational angles. A case study for a metallic coated industrial part, of which the colour appearance is hardly obtained by a 3D colour scanner has performed to demonstrate the effectiveness of the proposed method.

• Journal of Korean Society for Geospatial Information Science
• /
• v.18 no.2
• /
• pp.113-118
• /
• 2010

Recently, 3D-reconstruction for geographic information and study of geospatial information is progressing in various fields through national policy such as R&D business and pilot project. LiDAR system has a advantage of acquisition the 3D information data easily and densely so that is used in many different fields. Considering to characterist of the point data formed with 3D, it need a high specification CPU because it requires a number of processing operation for 2D form expressed by monitor. In contrast, 2D grid structure, like DEM, has a advantage on costs because of simple structure and processing speed. Therefore, purpose of this study is to solve the problem of requirement of more storage space, when LiDAR data stored in forms of 3D is used for 3D-geographic and 3D-buliding representation. Additionally, This study reconstitutes 2D-gird data to supply the representation data of 3D-geographic and presents the storage method which is available for detailed representation applying tree-structure and reduces the storage space.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.15 no.1
• /
• pp.126-132
• /
• 2011

In the application areas of LBS(Location Based Service) and ITS(Intelligent Transportation System), continuous k-nearest neighbor query(CkNN) which is defined as a query to find the nearest points of interest to all the points on a given path is widely used. It is necessary to acquire results quickly in the above applications and be applicable to spatial network databases. It is also able to cope successfully with frequent updates of POI objects. This paper proposes a new method to search nearest POIs for moving query objects on the spatial networks. The method produces a set of split points and their corresponding k-POIs as results with partial order among k-POIs. The results obtained from experiments with real dataset show that the proposed method outperforms the existing methods. The proposed method achieves very short processing time(15%) compared with the existing method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.415-421
• /
• 2005

Passive RFID tag does not have its own power, so it has very poor computation abilities and it can deliver signals in very short range. From the facts, most RFID Tag security schemes assumed that the backward channel from tags to a reader is safe from eavesdropping. However, eavesdroppers near a tag can overhear message from a tag illegally. In this paper, we propose a method to protect the backward channel from eavesdropping by illegal readers. The proposed scheme can overcome the problems of conventional schemes such as randomized tree walking, which have been proposed to secure tag information in tree-walking algorithm as an anti-collision scheme for RFID tags. We showed the efficiency of our proposed method by using an analytical model, and it is also shown that the proposed method can provide the probability of eavesdropping in some standardized RFID tag system such as EPCglobal, ISO, uCode near to '0'.