• Journal of Korea Multimedia Society
• /
• v.7 no.12
• /
• pp.1708-1718
• /
• 2004

In this paper, we are concerned with a digital fingerprinting scheme for multi-purchase where a buyer wants to buy more than a digital content. If we apply previous schemes to multi-purchase protocol, the number of execution of registration step and decryption key should be increased in proportion to that of digital contents to be purchased in order to keep unlinkability. More worse, most of fingerprinting schemes in the literature are based on either secure multi-party computation or general zero-knowledge proofs with very high computational complexity. These high complexities complicate materialization of fingerprinting protocol more and more. In this paper, we propose a multi-purchase fingerprinting scheme with lower computational complexity. In the proposed scheme, a buyer executes just one-time registration step regardless of the number of contents to be purchased. The number of decryption key is constant and independent of the number of contents to be purchased. We can also reduce the computational costs of buyers by introducing a concept of proxy-based fingerprinting protocol.

• International Journal of Reliability and Applications
• /
• v.15 no.1
• /
• pp.23-50
• /
• 2014

This paper deals with formulation of optimum multi-objective modified step-stress accelerated life test (ALT) plan for Burr type-XII distribution under type-I censoring. Since it is impractical to estimate only one objective parameter after conducting costly ALT tests; also, it is not desirable to assume instantaneous changes in stress levels because of limited capacity of test equipments and the presence of undesirable failure modes, therefore, an optimum multi-objective modified step-stress ALT plan has been designed. The optimal test plan consists in determining the optimum low stress level and optimal time at which stress starts linearly increasing from low stress by minimizing the weighted sum of the asymptotic variances of the maximum likelihood estimator of quantile lifetimes at design constant stress. The method developed has been illustrated using an example. Sensitivity analysis has been carried out. Comparative study has also been done to highlight the merits of the proposed model.

• Journal of the Korea Society for Simulation
• /
• v.9 no.3
• /
• pp.91-102
• /
• 2000

The distribution routing problem is one of the important problems in distribution and supply center management. This research is concerned with an integrated distribution routing problem for multi-supply centers based on improved genetic algorithm and GUI-type programming. In this research, we used a three-step approach; in step 1 a sector clustering model is developed to transfer the multi-supply center problem to single supply center problems which are more easy to be solved, in step 2 we developed a vehicle routing model with time and vehicle capacity constraints and in step 3, we developed a GA-TSP model which can improve the vehicle routing schedules by simulation. For the computational purpose, we developed a GUI-type computer program according to the proposed methods and the sample outputs show that the proposed method is very effective on a set of standard test problems, and it could be potentially useful in solving the distribution routing problems in multi-supply center problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.10
• /
• pp.2479-2496
• /
• 2013

Increasing demand for Full High-Definition (FHD) video and Ultra High-Definition (UHD) video services has led to active research on high speed video processing. Widespread deployment of multi-core systems has accelerated studies on high resolution video processing based on parallelization of multimedia software. Even if parallelization of a specific decoding step may improve decoding performance partially, such partial parallelization may not result in sufficient performance improvement. Particularly, entropy decoding has often been considered separately from other decoding steps since the entropy decoding step could not be parallelized easily. In this paper, we propose a parallelization technique called Integrated Multi-Threaded Parallelization (IMTP) which takes parallelization of the entropy decoding step, with other decoding steps, into consideration in an integrated fashion. We used the Simultaneous Multi-Threading (SMT) technique with appropriate thread scheduling techniques to achieve the best performance for the entire decoding step. The speedup of the proposed IMTP method is up to 3.35 times faster with respect to the entire decoding time over a conventional decoding technique for H.264/AVC videos.

• Kyungpook Mathematical Journal
• /
• v.60 no.4
• /
• pp.753-765
• /
• 2020

Smoking is one of the main causes of health problems and continues to be one of the world's most significant health challenges. In this paper, we use the multi-step Adomian decomposition method (MSADM) to obtain approximate analytical solutions for a mathematical fractional model of the evolution of the smoking habit. The proposed MSADM scheme is only a simple modification of the Adomian decomposition method (ADM), in which ADM is treated algorithmically with a sequence of small intervals (i.e. time step) for finding accurate approximate solutions to the corresponding problems. A comparative study between the new algorithm and the classical Runge-Kutta method is presented in the case of integer-order derivatives. The solutions obtained are also presented graphically. The results reveal that the method is effective and convenient for solving linear and nonlinear differential equations of fractional order.

• Korean Journal of Computational Design and Engineering
• /
• v.11 no.4
• /
• pp.315-325
• /
• 2006

It is very often necessary to search for similar parts during designing a new product because its parts are often easily designed by modifying existing similar parts. In this way, the design time and cost can be reduced. Thus it would be nice to have an efficient similarity comparison algorithm that can be used anytime in the design process. There have been many approaches to compare shape similarity between two solids. In this paper, two parts represented in B-Rep is compared in two steps: one for overall appearances and the other for detail features. In the first step, geometric information is used in low level of detail for easy and fast pre-classification by the overall appearance. In the second step, feature information is used to compare the detail shape in high level of detail to find more similar design. To realize the idea above, a multi resolution algorithm is proposed so that a given solid is described by an overall appearance in a low resolution and by detail features in high resolution. Using this multi-resolution representation, parts can be compared based on the overall appearance first so that the number of parts to be compared in high resolution is reduced, and then detail features are investigated to retrieve the most similar part. In this way, computational time can be reduced by the fast classification in the first step while reliability can be preserved by detail comparison in the second step.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.672-675
• /
• 1997

This paper proposes a structure of the control system for the step & scan exposure tool. The step & scan exposure tool is used for the manufacturing process of the semiconductor DRAM memory of giga bit. The control system employs the VME bus instead of the conventional ISA bus so that all control signals and data can be managed separately by the 4 VME-PCs for fast and fault-free flow of signals for multi-tasking. A high speed I/O card is equipped for the real-time monitoring and control of the sub module equipment. Then all the subsystems are integrated and aligned for the operation of the step & scan exposure tool with the VME bus and, I/O card.

• Journal of Positioning, Navigation, and Timing
• /
• v.8 no.4
• /
• pp.201-208
• /
• 2019

Numerical integration is necessary for satellite orbit determination and its prediction. The numerical integration algorithm can be divided into single-step and multi-step method. There are lots of single-step and multi-step methods. However, the Runge-Kutta method in single-step and the Adams method in multi-step are generally used in global navigation satellite system (GNSS) satellite orbit. In this study, 4th and 8th order Runge-Kutta methods and various order of Adams-Bashforth-Moulton methods were used for GLObal NAvigation Satellite System (GLONASS) orbit integration using its broadcast ephemeris and these methods were compared with international GNSS service (IGS) final products for 7days. As a result, the RMSE of Runge-Kutta methods were 3.13m and 4th and 8th order Runge-Kutta results were very close and also 3rd to 9th order Adams-Bashforth-Moulton results. About result of computation time, this study showed that 4th order Runge-Kutta was the fastest. However, in case of 8th order Runge-Kutta, it was faster than 14th order Adams-Bashforth-Moulton but slower than 13th order Adams-Bashforth-Moulton in this study.

• Interaction and multiscale mechanics
• /
• v.3 no.3
• /
• pp.235-255
• /
• 2010

This paper investigates the heat equation for domains subjected to an internal source with a sharp spatial gradient. The solution is first approximated using linear finite elements, and sufficiently small time-step sizes to yield stable simulations. The main area of interest is then in the ability to approximate the solution using Generalized Finite Elements, and again explore the time-step limitations required for stable simulations. Both high order elements, as well as elements with special enrichments are used to generate solutions. When compared to linear finite elements, the high order elements deliver better accuracy at a given level of mesh refinement, but do not offer an increase in critical time-step size. When special enrichment functions are used, the solution can be approximated accurately on very coarse meshes, while yielding solutions which are both accurate and computationally efficient. The major conclusion of interest is that the significantly larger element size yields larger allowable time-step sizes while still maintaining stability of the time-stepping algorithm.

• Journal of the Korean Crystal Growth and Crystal Technology
• /
• v.31 no.1
• /
• pp.55-62
• /
• 2021

In order to improve fuel economy and reduce CO2, HEV adopts ISG system as a standard. This ISG system increased the electric load that the battery had to bear, and the number of starting increased rapidly. AGM Lead Acid batteries have been developed and used, but the charging time is about three times longer as the electrolyte amount control during formation must be maintained at a higher level compared to conventional lead-acid batteries. In this study, we tried to shorten the charging time by increasing the charging efficiency through the optimization of the formation pattern. In order to optimize the Formation Pattern, 10 charging steps and 6 discharging steps were applied to 16 multi steps, and the charging current for each step was controlled, and the test was conducted under 4 conditions (21 hr, 24 hr, 27 hr, 30 hr). As a result of simultaneous application of multi-step and discharge step, it was verified that minimizing the current loss and eliminating the sudden polarization during charging contributes to the improvement of charging efficiency. As a result, it showed excellent results in reducing the charging time by about 30 % with improved charging efficiency compared to the previous one.