• Journal of KIISE:Software and Applications
• /
• v.33 no.12
• /
• pp.999-1007
• /
• 2006

The Backpropagation learning algorithm is known to have slow and false convergence aroused from plateau and local minima. Many substitutes for backpropagation announced so far appear to pay some trade-off for convergence speed and stability of convergence according to parameters. Here, a new algorithm is proposed, which avoids some of those problems associated with the conventional backpropagation problems, especially with local minima, and gives relatively stable and fast convergence with low storage requirement. This is the separate learning algorithm in which the upper connections, hidden-to-output, and the lower connections, input-to-hidden, separately trained. This algorithm requires less computational work than the conventional backpropagation and other improved algorithms. It is shown in various classification problems to be relatively reliable on the overall performance.

• Interaction and multiscale mechanics
• /
• v.1 no.2
• /
• pp.211-230
• /
• 2008

Owing to the growing size of the eigenvalue problem and the growing number of eigenvalues desired, solution methods of iterative nature are becoming more popular than ever, which however suffer from low efficiency and lack of proper convergence criteria. In this paper, three efficient iterative eigenvalue algorithms are considered, i.e., subspace iteration method, iterative Ritz vector method and iterative Lanczos method based on the cell sparse fast solver and loop-unrolling. They are examined under the mode error criterion, i.e., the ratio of the out-of-balance nodal forces and the maximum elastic nodal point forces. Averagely speaking, the iterative Ritz vector method is the most efficient one among the three. Based on the mode error convergence criteria, the eigenvalue solvers are shown to be more stable than those based on eigenvalues only. Compared with ANSYS's subspace iteration and block Lanczos approaches, the subspace iteration presented here appears to be more efficient, while the Lanczos approach has roughly equal efficiency. The methods proposed are robust and efficient. Large size tests show that the improvement in terms of CPU time and storage is tremendous. Also reported is an aggressive shifting technique for the subspace iteration method, based on the mode error convergence criteria. A backward technique is introduced when the shift is not located in the right region. The efficiency of such a technique was demonstrated in the numerical tests.

• Journal of Korea Multimedia Society
• /
• v.2 no.3
• /
• pp.265-276
• /
• 1999

Video on Demand (VOD) system is definitely one of main applications in upcoming multimedia era. In this research, we have designed and implemented a host-based scalable VOD system (SVOD) which is composed of low cost PC servers and runs on Linux kernel that is currently spotlighted in enterprise and research domains. Our contribution is as follows: first, the previous Ext2 file system was modified to efficiently support continuous media like MPEG stream. Second, the storage server features a host-based scalable architecture. Third, a software MPEG decoder was implemented using Microsoft's DirectShow$\circledR$COM. Finally, flow control between client and server is provided to suppress overflow and underflow of client circular buffer and supports FF VCR operation. We have known that it is possible to develop a thread-based and scalable VOD system on low cost PC servers and free Linux kernel.

• The Research Journal of the Costume Culture
• /
• v.19 no.3
• /
• pp.612-621
• /
• 2011

The process of making or cultivating indigo dyes is very cumbersome and complex. The dye extraction and dyeing methods using general plant dye, moth repellent dye, fast acting natural dye, and other dyes are very different. This research investigates the extraction of indigo dye and liquid dye extraction of polygonum(indigo) plants using calcium oxide water. While extracting indigo dye the concentration of purified indigo dye may be controlled by adjusting the pH level. Due to the various uses of dyes the adjustment of surface color must be considered. In regard to the change according to different concentrations of reducing agents, it was found that cotton fabrics and ramie fabrics show the highest color difference at 0.4% and 0.3% respectively. As the reduction temperature increases, the color difference increases as well. The maximum color difference was found to appear at $90^{\circ}C$. Cotton fabrics and ramie fabrics showed 70.55 and 67.01 respectively. The color difference increases as the concentration of dyes increases, but at a concentration of 300%, cotton fabrics was found to show 6.22PB in H value using the Munsell color system, containing purple and blue color. The pH of the polygonum dyes extracted through this experiment were adjusted by adding calcium oxide to the experimental water, without directly adding calcium oxide to the liquid polygonum extract. In a refine state, it was mixed with polygonum extract to extract a more refine and highly concentrated indigo dye. When lye and reducing agents are added to extracted indigo dye and sealed for long-term storage, it can be effective and easily used for dyeing.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.7
• /
• pp.1753-1762
• /
• 1996

Since the number of spatial objects go easily into millions, they are stored on a secondary storage. In order to speed up accessing the geometric objects, we investigate spatial database system. The spatial objects are organized and accessed by spatial access methods(SAMs). But, SAMs are not able to organize polygons directly The most popular approach for handing polygon in SAMs is to use MBR apporximaotion as a geometric key. MBR provides a fast but inaccurate answers to approximation-based query processing. The performance of approximation-based spatial query processing depends on which type of approximation is chosen for the spatial objects. A suitable approximation is crucial for reducing the size of the candidate set. The better the approxmation quality, the fewer accesses to the exact object are necessary. In this paper, I proposed a new multicontainer approximation named Slice decomposition. The performance of proposed method is compared with other method.

• Proceedings of the KIEE Conference
• /
• 2009.07a
• /
• pp.2219_2220
• /
• 2009

The characteristics of the Superconducting Magnetic Energy Storage (SMES) system are faster response, longer life time, more economical, and environment friendly than other Uninterruptible Power Supply (UPS) using battery. Fast charge and discharge time of SMES system can provide powerful performance of improving power quality in the grid. In order to demonstrate the effectiveness of SMES, the authors make a 10kJ SMES system for connection with RTDS (Real Time Digital Simulator). Because the characteristics of superconducting magnet are very important in SMES system, the necessary items such as thermal characteristic, mechanical stress and protection circuit should be considered. In this paper, the authors experimented thermal characteristics of the 10kJ SMES system. The experiment was accomplished using a simulation coils made of aluminium. It has same dimension of the 10kJ class HTS SMES coil. The coil was cooled with GM (Gifford -McMahon) cryocooler through the OFHC (Oxgen Free High thermal Conductivity) conduction bar. The test results of cool down and heat loads characteristics of the simulation coils are described in detail.

• Journal of Soil and Groundwater Environment
• /
• v.21 no.6
• /
• pp.36-45
• /
• 2016

Variability in precipitation due to climate change causes difficulties in securing stable surface water resource, which requires understanding of relation between precipitation and stream discharge. This study simulated stream discharge in a small mountainous forested catchment using antecedent precipitation index (API) models which represent variability of saturation conditions of soil layers depending on rainfall events. During 13 months from May 2015 to May 2016, stream discharge and rainfall were measured at the outlet and in the central part of the watershed, respectively. Several API models with average recession coefficients were applied to predict stream discharge using measured rainfall, which resulted in the best reflection time for API model was 1 day in terms of predictability of stream discharge. This indicates that soil water in riparian zones has fast response to rainfall events and its storage is relatively small. The model can be improved by employing seasonal recession coefficients which can consider seasonal fluctuation of hydrological parameters. These results showed API models can be useful to evaluate variability of streamflow in ungauged small forested watersheds in that stream discharge can be simulated using only rainfall data.

• The KIPS Transactions:PartD
• /
• v.14D no.6
• /
• pp.597-604
• /
• 2007

Stream data is a continuous flow of information that mostly arrives as the form of an infinite rapid stream. Recently researchers show a great deal of interests in analyzing such data to obtain value added information. Here, we propose an efficient cube computation algorithm for multidimensional analysis of stream data. The fact that stream data arrives in an unsorted fashion and aggregation results can only be obtained after the last data item has been read. cube computation requires a tremendous amount of memory. In order to resolve such difficulties, we compute user selected aggregation fables only, and use a combination of an way and AVL trees as a temporary storage for aggregation tables. The proposed cube computation algorithm works even when main memory is not large enough to store all the aggregation tables during the computation. We showed that the proposed algorithm is practically fast enough by theoretical analysis and performance evaluation.

• Imaging Science in Dentistry
• /
• v.30 no.4
• /
• pp.265-274
• /
• 2000

Purpose: The aims of the present study are to determine the optimum compression rate in terms of file size reduction and diagnostic quality of the images after compression and evaluate the transmission speed of original or each compressed image. Materials and Methods: The material consisted of 24 extracted human premolars and molars. The occlusal surfaces and proximal surfaces of the teeth had a clinical disease spectrum that ranged from sound to varying degrees of fissure discoloration and cavitation. The images from Digora system were exported in TIFF and the images from conventional intraoral film were scanned and digitalized in TIFF by Nikon SF-200 scanner (Nikon, Japan). And six compression factors were chosen and applied on the basis of the results from a pilot study. The total number of images to be assessed were 336. Three radiologists assessed the occlusal and proximal surfaces of the teeth with 5-rank scale. Finally diagnosed as either sound or carious lesion by one expert oral pathologist. And sensitivity, specificity and k value for diagnostic agreement was calculated. Also the area (Az) values under the ROC curve were calculated and paired t-test and oneway ANOVA test was performed. Thereafter, transmission time of the image files of the each compression level was compared with that of the original image files. Results: No significant difference was found between original and the corresponding images up to 7% (1 : 14) compression ratio for both the occlusal and proximal caries (p<0.05). JPEG3 (1 : 14) image files are transmitted fast more than 10 times, maintained diagnostic information in image, compared with original image files. Conclusion: 1 : 14 compressed image file may be used instead of the original image and reduce storage needs and transmission time.

• The Journal of Society for e-Business Studies
• /
• v.17 no.3
• /
• pp.1-14
• /
• 2012

As the techniques of electronic and information are advancing, the computing power of a smart phone is becoming more powerful and the storage capacity of a smart phone is becoming larger. As the result, various new useful services are becoming available on smart phones. The context-aware service and mobile augmented reality have recently been the most popular research topics. For those newly developed services, identifying the object in the picture taken by the camera on the phone performs an extremely important role. So, many researches of identifying pictures have been published and most of them are based on the time consuming image recognition techniques. On the contrary, this paper introduces a very fast and effective method of identifying the objects on the photo making use of the sensor data obtained from the smart phone and electronic maps. Our method estimates the line of sight of the camera with the location and orientation information provided by the smart phone. Then it finds any element of the map which intersects the line of sight. By investigating those intersecting elements, our method identifies the objects on the photo.