• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• Journal of Internet Computing and Services
• /
• v.15 no.6
• /
• pp.125-132
• /
• 2014

Since frequent pattern mining was proposed in order to search for hidden, useful pattern information from large-scale databases, various types of mining approaches and applications have been researched. Especially, frequent graph pattern mining was suggested to effectively deal with recent data that have been complicated continually, and a variety of efficient graph mining algorithms have been studied. Graph patterns obtained from graph databases have their own importance and characteristics different from one another according to the elements composing them and their lengths. However, traditional frequent graph pattern mining approaches have the limitations that do not consider such problems. That is, the existing methods consider only one minimum support threshold regardless of the lengths of graph patterns extracted from their mining operations and do not use any of the patterns' weight factors; therefore, a large number of actually useless graph patterns may be generated. Small graph patterns with a few vertices and edges tend to be interesting when their weighted supports are relatively high, while large ones with many elements can be useful even if their weighted supports are relatively low. For this reason, we propose a weight-based frequent graph pattern mining algorithm considering length-decreasing support constraints. Comprehensive experimental results provided in this paper show that the proposed method guarantees more outstanding performance compared to a state-of-the-art graph mining algorithm in terms of pattern generation, runtime, and memory usage.

• Journal of KIISE:Software and Applications
• /
• v.37 no.12
• /
• pp.882-891
• /
• 2010

Many automated dynamic test data generation technique have been proposed. The techniques evaluate fitness of test data through executing instrumented Software Under Test (SUT) and then generate new test data based on evaluated fitness values and optimization algorithms. Previous researches and experiments have been showed that these techniques generate effective test data. However, optimization algorithms in these techniques incur much time to generate test data, which results in huge test case generation cost. In this paper, we propose a technique for reducing the time of evaluating a fitness of test data among steps of dynamic test data generation methods. We introduce the concept of Fitness Evaluation Program (FEP), derived from a path constraint of SUT. We suggest a test data generation method based on FEP and implement a test generation tool, named ConGA. We also apply ConGA to generate test cases for C programs, and evaluate efficiency of the FEP-based test case generation technique. The experiments show that the proposed technique reduces 20% of test data generation time on average.

• Journal of Korea Water Resources Association
• /
• v.40 no.12
• /
• pp.985-994
• /
• 2007

Small hydropower is the one of the cleanest one among new and renewable energy with less green house gas emissions. Recently, the necessity of developing small hydropower is emerging since its remaining potential resources in this country are abundant. However, a survey or research on the small hydropower development has been hardly performed since the 1990#s. These circumstances encourages a systematic approach for the small hydropower development. The purpose of this study is to propose a methodology of the location analysis for developing small hydropower. To this end, constraint and location criteria with weights are established and quantification method of each factor is presented. Especially, the analysis procedure is established on the basis of GSIS. Also the study focus on raising the objectivity and precision of analysis by developing system model with automatic search. The proposed methodology is applied to Bochung stream in Keum Riverbasin. The result selects the four and two locations of dam type and run-of-river type respectively. This study will be beneficial to the future activation of small hydropower development as a fundamental work.

• Cartoon and Animation Studies
• /
• s.49
• /
• pp.1-23
• /
• 2017

3D animation production has had a pivotal position in current animation industry and the necessity of professional management tool for 3D animation production has claimed due to its sophisticated pipeline from advance of technology and global production partnership trend. Shotgun and Ftrack are providing the most appropriate management toolset for 3D animation management among the extant management tools and the efficiency of Shotgun & Ftrack is identified compared with the traditional document oriented management style. The biggest strength of production management using Shotgun is that all of the production staff can directly participate in the communication on the tools therefore they can share the information on Shotgun & Ftrack in real time without constraint of time and location. Moreover, all the process of the production and the history of the discussion on certain production issues are systematically accrue on the tool so that the production history can be easily tracked. Finally, the production management using tools contributes collecting and analysing the production information for the production management team in studios. However, Shotgun & Ftrack has metadata based retrieval method which cost huge amount of effort by human's manual annotation and it also has the limitation of accuracy. In addition, the fact that studios has to have technical professionals first in order to institute the tools into their studios is the actual difficulty of Korean studios when they want to use management tools for their project. Thus, this paper suggests adopting the content-based retrieval system on the tools and tools' expanded technical service for the studios as the solution of the identified issues.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.4
• /
• pp.83-90
• /
• 2010

In wireless sensor networks, the data transmitted from the sensor nodes are susceptible to corruption by errors which caused of noisy channels and other factors. In view of the severe energy constraint in Sensor Networks, it is important to use the error control scheme of the energy efficiently. In this paper, we presented RS (Reed-Solomon) codes in terms of their BER performance and power consumption. RS codes work by adding extra redundancy to the data. The encoded data can be stored or transmitted. It could have errors introduced, when the encoded data is recovered. The added redundancy allows a decoder to detect which parts of the received data is corrupted, and corrects them. The number of errors which are able to be corrected by RS code can determine by added redundancy. The results of experiment validate the performance of proposed method to provide high degree of reliability in low-power communication. We could predict the lifetime of RS codes which transmitted at 32 byte a 1 minutes. RS(15, 13), RS(31, 27), RS(63, 57), RS(127,115), and RS(255,239) can keep the days of 173.7, 169.1, 163.9, 150.7, and 149.7 respectively. The evaluation based on packet reception ratio (PRR) indicates that the RS(255,239) extends a sensor node's communication range by up about 3 miters.

• Journal of KIISE:Software and Applications
• /
• v.33 no.8
• /
• pp.668-680
• /
• 2006

Web services on the Internet are not always reliable in terms of service availability and performance. Dynamic service coordination capability of a system or an application invoking Web services is essential to cope with such unreliable situations. In dynamic service coordination, if a Web service does not respond within a specific time constraint, it is replaced with another Web service at run time for reliable invocation of Web services. In this paper, we develop an exception based dynamic service coordination framework for Web services. In the framework, all necessary information for dynamic service coordination is explicitly specified and summarized as a set of attributes. Then classes and workflows, supporting dynamic service coordination and invoking Web services, are automatically created based on these attributes. Developers of Web services client programs can make the invocations of Web services reliable by calling the methods of the classes. Some performance loss has been observed in the indirect invocation of a Web service. However, when we consider the flexibility and reliability gained from the method, the performance loss would be acceptable in many cases.

• Geophysics and Geophysical Exploration
• /
• v.4 no.2
• /
• pp.25-33
• /
• 2001

Loop-loop electromagnetic (EM) survey in frequency domain has been carried out in order to provide basic solution to geotechnical applications. Source and receiver configuration may be horizontal co-planar (HCP) and/or vertical co-planar (VCP). Three quadrature components of mutual impedance ratio for each configuration are used to construct the subsurface image. For the purpose of obtaining the model response and validating the reasonable performance of the inversion, we obtained each responses of two-layered and three-layered earth models and two-dimensional (2-D) isolated anomalous body. The response of 2-D isolated anomalous body has been calculated using extended Born approximation for the solution of 2.5-D integral equation describing EM scattering problem. As a result of the least-squares inversion with variable Lagrangian multiplier, we could construct more resolvable image from HCP data than VCP data. Furthermore, joint inversion of HCP and VCP data made better stability and resolution of the inversion. Resistivity values, however, did not exactly match the true ones. Loop-loop EM field data was obtained with EM34-3XL system manufactured by Geonics Ltd. (Canada). Electrical resistivity survey was conducted on the same line for the comparison in advance. Since the constructed image from loop-loop EM data by 2-D inversion algorithm showed almost similar resistivity distribution to that from electrical resistivity one, we expect the developed 2.5-D loop-loop EM inversion program can be applied for the reconnaissance site survey.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.42 no.5 s.305
• /
• pp.123-136
• /
• 2005

We propose a recognition system for superimposed patterns based on selective attention model and SVM which produces better performance than artificial neural network. The proposed selective attention model includes attention layer prior to SVM which affects SVM's input parameters. It also behaves as selective filter. The philosophy behind selective attention model is to find the stopping criteria to stop training and also defines the confidence measure of the selective attention's outcome. Support vector represents the other surrounding sample vectors. The support vector closest to the initial input vector in consideration is chosen. Minimal euclidean distance between the modified input vector based on selective attention and the chosen support vector defines the stopping criteria. It is difficult to define the confidence measure of selective attention if we apply common selective attention model, A new way of doffing the confidence measure can be set under the constraint that each modified input pixel does not cross over the boundary of original input pixel, thus the range of applicable information get increased. This method uses the following information; the Euclidean distance between an input pattern and modified pattern, the output of SVM, the support vector output of hidden neuron that is the closest to the initial input pattern. For the recognition experiment, 45 different combinations of USPS digit data are used. Better recognition performance is seen when selective attention is applied along with SVM than SVM only. Also, the proposed selective attention shows better performance than common selective attention.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.41 no.2
• /
• pp.141-152
• /
• 2018

Although the 1997 Raw Data of the National Wealth Statistical Survey (South Korea) is timely 20-year-old data, it is meaningful as a benchmarking in the capital stock estimations of Korea, which is estimated by PIM (permanent inventory method). In the case of machinery/equipment, it is the data that can analyze in depth the changes in the industrial structure of Korea. In the case of ASL (average service life) which has economic concept, since the change of ASL is not so large, ASL yielded by the Raw Data of the 1997 National Wealth Statistical Survey is meaningful as reference value for the ASL estimated by the Bank of Korea and the National Statistical Office. As you know Japan has changed its service life due to changes in its industrial structure. However, many of its assets are still used for the years indicated in Showa (before 1989). The same trend with other countries such as Japan. However, the United States is constantly devoted to assessing the useful ASL and value of assets by distinguishing between the Hulten-Wykoff models and those not. Korea has also benchmarked the useful ASL of the United States and Japan when it conducted its own survey every 10 years by due diligence until 1997. In this study, the 'constraint' Iowa curve estimation by the Raw Data of the 1997 National Wealth Statistical Survey is based on the age records of the assets and the maximum age of the assets appropriately derived. And then we made modified Iowa curve by smoothing. From this modified one, we suggested ASL by asset. After 1997, the vintage disposal data directly were collected by the National Statistical Office with Oh Hyun Seung, Cho Jin Hyung, in order to estimate the useful ASL. Since then, the B/S team of the Economic and Statistics Bureau of the Bank of Korea has been working on a new concept of content training.