• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.46 no.8
• /
• pp.22-30
• /
• 2009

Due to high levels of integration and complexity, the Network-on-Chip (NoC) approach has emerged as a new design paradigm to overcome on-chip communication issues and data bandwidth limits in conventional SoC(System-on-Chip) design. In particular, exponentially growing of energy consumption caused by high frequency, synchronization and distributing a single global clock signal throughout the chip have become major design bottlenecks. To deal with these issues, a globally asynchronous, locally synchronous (GALS) design combined with low power techniques is considered. Such a design style fits nicely with the concept of voltage-frequency-islands (VFI) which has been recently introduced for achieving fine-grain system-level power management. In this paper, we propose an efficient design methodology that minimizes energy consumption by VFI partitioning on an NoC architecture as well as assigning supply and threshold voltage levels to each VFI. The proposed algorithm which find VFI and appropriate core (or processing element) supply voltage consists of traffic-aware core graph partitioning, communication contention delay-aware tile mapping, power variation-aware core dynamic voltage scaling (DVS), power efficient VFI merging and voltage update on the VFIs Simulation results show that average 10.3% improvement in energy consumption compared to other existing works.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.12
• /
• pp.623-634
• /
• 2016

Most of existing frequent pattern mining methods address time efficiency and greatly rely on the primary memory. However, in the era of big data, the size of real-world databases to mined is exponentially increasing, and hence the primary memory is not sufficient enough to mine for frequent patterns from large real-world data sets. To solve this problem, there are some researches for frequent pattern mining method based on disk, but the processing time compared to the memory based methods took very time consuming. There are some researches to improve scalability of frequent pattern mining, but their processes are very time consuming compare to the memory based methods. In this paper, we present PPFP as a novel disk-based approach for mining frequent itemset from big data; and hence we reduced the main memory size bottleneck. PPFP algorithm is based on FP-growth method which is one of the most popular and efficient frequent pattern mining approaches. The mining with PPFP consists of two setps. (1) Constructing an IFP-tree: After construct FP-tree, we assign index number for each node in FP-tree with novel index numbering method, and then insert the indexed FP-tree (IFP-tree) into disk as IFP-table. (2) Mining frequent patterns with PPFP: Mine frequent patterns by expending patterns using stack based PUSH-POP method (PPFP method). Through this new approach, by using a very small amount of memory for recursive and time consuming operation in mining process, we improved the scalability and time efficiency of the frequent pattern mining. And the reported test results demonstrate them.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.41 no.4
• /
• pp.9-21
• /
• 2004

In this paper, we proposed the image hiding method which decreases calculation amount by encrypt partial data using discrete wavelet transform and linear scale quantization which were adopted as the main technique for frequency transform in JPEG2000 standard. Also we used the chaotic system which has smaller calculation amount than other encryption algorithms and then dramatically decreased calculation amount. This method operates encryption process between quantization and entropy coding for preserving compression ratio of images and uses the subband selection method and the random changing method using the chaotic system. For ciphering the quantization index we use a novel image encryption algerian of cyclically shifted in the right or left direction and encrypts two quantization assignment method (Top-down/Reflection code), made change of data less. Also, suggested encryption method to JPEG2000 progressive transmission. The experiments have been performed with the proposed methods implemented in software for about 500 images. consequently, we are sure that the proposed are efficient image encryption methods to acquire the high encryption effect with small amount of encryption. It has been shown that there exits a relation of trade-off between the execution time and the effect of the encryption. It means that the proposed methods can be selectively used according to the application areas. Also, because the proposed methods are performed in the application layer, they are expected to be a good solution for the end-to-end security problem, which is appearing as one of the important problems in the networks with both wired and wireless sections.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.4
• /
• pp.173-180
• /
• 2014

Compressive sensing is a new signal acquisition paradigm that enables sparse/compressible signal to be sampled under the Nyquist-rate. To fully benefit from its much simplified acquisition process, huge efforts have been made on improving the performance of compressive sensing recovery. However, concerning color images, compressive sensing recovery lacks in addressing image characteristics like energy distribution or human visual system. In order to overcome the problem, this paper proposes a new group-sparsity hard thresholding process by preserving some RGB-grouped coefficients important in both terms of energy and perceptual sensitivity. Moreover, a smoothed group-sparsity iterative hard thresholding algorithm for compressive sensing of color images is proposed by incorporating a frame-based filter with group-sparsity hard thresholding process. In this way, our proposed method not only pursues sparsity of image in transform domain but also pursues smoothness of image in spatial domain. Experimental results show average PSNR gains up to 2.7dB over the state-of-the-art group-sparsity smoothed recovery method.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.3
• /
• pp.251-260
• /
• 2003

A three dimensional (3-D) method of analysis is presented for determining the free vibration frequencies and mode shapes of deep, tapered rods and beams with circular cross section. Unlike conventional rod and beam theories, which are mathematically one-dimensional (1-D), the present method is based upon the 3-D dynamic equations of elasticity. Displacement components u/sup r/, u/sub θ/ and u/sub z/, in the radial, circumferential, and axial directions, respectively, are taken to be sinusoidal in time, periodic in , and algebraic polynomials in the r and z directions. Potential (strain) and kinetic energies of the rods and beams are formulated, the Ritz method is used to solve the eigenvalue problem, thus yielding upper bound values of the frequencies by minimizing the frequencies. As the degree of the polynomials is increased, frequencies converge to the exact values. Convergence to four-digit exactitude is demonstrated for the first five frequencies of the rods and beams. Novel numerical results are tabulated for nine different tapered rods and beams with linear, quadratic, and cubic variations of radial thickness in the axial direction using the 3D theory. Comparisons are also made with results for linearly tapered beams from 1-D classical Euler-Bernoulli beam theory.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.8 s.350
• /
• pp.47-58
• /
• 2006

Due to the movement of nodes, ad-hoc networks suffer from the problems such as the decrease of data delivery ratio, the increase of end-to-end delay, and the increase of routing overhead. The backup routing schemes try to solve these problems by finding the backup routes during the route discovery phase and using them when a route fails. Generally the backup routing schemes outperform the single-path routing schemes in terms of data delivery ratio, end-to-end delay, and routing overhead when the nodes move rapidly. But when the nodes don't move rapidly, the backup routing schemes generate more routing traffics than the single-path routing schemes because they need to exchange packets to find the backup route. In addition, when the backup route fails earlier than the main route, it can not use the backup route because in many backup route algorithms, the backup route is found only at the initial route discovery phase. RBR(Reactive Backup Routing Algorithm) proposed in this paper is an algorithm that provides more stable data delivery than the previous backup routing schemes through the selective maintenance of backup route and the backup route rediscovery. To do that RBR prioritize the backup routes, and maintain and use them selectively Thus it can also decrease the routing overheads. Also, RBR can increase data delivery ratio and decrease delay because it reestablishes the backup route when the network topology changes. For the performance evaluation, OPNET simulator is used to compare RBR with the single-path routing scheme and some of the well known backup routing schemes.

• Journal of Information Management
• /
• v.39 no.3
• /
• pp.95-113
• /
• 2008

In todays environment in which scientific technologies are changing very fast than ever, companies have to monitor and search emerging technologies to gain competitiveness. Actually many nations try to do that. Most of them use Dephi approach based on experts review as a searching method. But experts review has been criticised for probability of inclination and its derivative problems in the sense that it is accomplished only by expert's subjectivity. To overcome such problems, we used Scientometric Method for identifying emerging technology that had been done by Delphi as a rule. We made three particular efforts in order to improve the Quality of the result. Firstly, we selected one alternative database between SCI and Scopus hoping to see evenly-distributing results in wide fields on the front burner. Secondly we used Fractional citation counting in counting citation number in the stage of linear regression analysis. Lastly, we verified Scientometric result with experts opinions to minimize probable errors in a Scientometric research. As a result, we derived 290 emerging technologies from Scientometric analysis with Scopus Database, and visualized them on 2-dimension map with data mining system named KnowledgeMatrix which was developed by KISTI.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.16 no.4
• /
• pp.419-429
• /
• 2003

A three-dimensional (3-D) method of analysis is presented for determining the free vibration frequencies of thick, hyperboloidal shells of revolution. Unlike conventional shell theories, which are mathematically two-dimensional (2-D), the present method is based upon the 3-D dynamic equations of elasticity. Displacement components u/sub r/, u/sub θ/, u/sub z/ in the radial, circumferential, and axial directions, respectively, we taken to be sinusoidal in time, periodic in θ, and algebraic polynomials in the r and z directions. Potential(strain) and kinetic energies of the hyperboloidal shells are formulated, and the Ritz method is used to solve the eigenvalue problem, thus yielding upper bound values of the frequencies by minimizing the frequencies. As the degree of the polynomials is increased, frequencies converge to the exact values. Convergence to four digit exactitude is demonstrated for the first five frequencies of the hyperboloidal shells of revolution. Numerical results are tabulated for eighteen configurations of completely free hyperboloidal shells of revolution having two different shell thickness ratios, three variant axis ratios, and three types of shell height ratios. Poisson's ratio (ν) is fixed at 0.3. Comparisons we made among the frequencies for these hyperboloidal shells and ones which ate cylindrical or nearly cylindrical( small meridional curvature. ) The method is applicable to thin hyperboloidal shells, as well as thick and very thick ones.

• Journal of Korean Tunnelling and Underground Space Association
• /
• v.24 no.2
• /
• pp.193-215
• /
• 2022

Recently, ground structures have reached saturation, and underground construction using underground structures such as tunnels has been in the spotlight as a way to solve increasing traffic difficulties and environmental problems. However, due to the increasing number of underground structures, close construction is inevitable for continuous underground development. When a new underground structure is constructed closely, stability may become weak due to the influence on the existing tunnel, which may cause collapse. Therefore, analyzing the stability of existing tunnels due to new structures is an essential consideration. In this study, the effect of excavating new tunnels under parallel tunnels on existing parallel tunnels was analyzed using numerical analysis. Using the Displacement Control Model (DCM), the volume loss generated during construction was simulated into three case (0.5%, 1.0%, and 1.5%). Based on the center of the pillar, the distance where the new tunnel is located was set to 5 m, 6 m, 7 m, 8 m, 9 m, and the space for each distance were set to 5 (0D₁, 0.37D₁, 0.75D₁, 1.13D₁, 1.5D₁). In general, as the volume loss increased and the distance approached, the maximum displacement and angular displacement increased, and the strength/stress ratio to evaluate the stability of the pillar also decreased. As a result, when the distance between the new tunnel and the center of the pillar is 5 m, the space is 0D₁, and the volume loss is 1.5%, the stability of the existing parallel tunnel is the weakest.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.1
• /
• pp.19-30
• /
• 2023

An electric scooter(e-scooter), one popularized micro-mobility vehicle has shown rapidly increasing use in many cities. In South Korea, the use of e-scooters has greatly increased, as some companies have launched e-scooter sharing services in a few large cities, starting with Seoul in 2018. However, the use of e-scooters is still controversial because of issues such as parking and safety. Since the perception toward the means of transportation affects the mode choice, it is necessary to track the trends for electric scooters to make the use of e-scooters more active. Hence, this study aimed to analyze the trends related to e-scooters. For this purpose, we analyzed news articles related to e-scooters published from 2014 to 2020 using dynamic topic modeling to extract issues and sentiment analysis to investigate how the degree of positive and negative opinions in news articles had changed. As a result of topic modeling, it was possible to extract three different topics related to micro-mobility technologies, shared e-scooter services, and regulations for micro-mobility, and the proportion of the topic for regulations for micro-mobility increased as shared e-scooter services increased in recent years. In addition, the top positive words included quick, enjoyable, and easy, whereas the top negative words included threat, complaint, and ilegal, which implies that people satisfied with the convenience of e-scooter or e-scooter sharing services, but safety and parking issues should be addressed for micro-mobility services to become more active. In conclusion, this study was able to understand how issues and social trends related to e-scooters have changed, and to determine the issues that need to be addressed. Moreover, it is expected that the research framework using dynamic topic modeling and sentiment analysis will be helpful in determining social trends on various areas.