• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.11 no.5
• /
• pp.31-42
• /
• 2001

Two important requirements in broadcast encryption schemes are traitor traceability and revocability. In this paper, we propose a new type of a traitor tracing scheme that can revoke an unlimited number of traitors\` personal keys. Additionally, we propose an efficient and simple method to provide self-enforcement property. We also describe a variant of our scheme of which encryption algorithm is secure against adaptive chosen ciphertext attacks.

• Computers and Concrete
• /
• v.1 no.4
• /
• pp.371-388
• /
• 2004

Our objective is to model static multi-cracking processes in concrete. The explicit dynamic relaxation (DR) method, which gives the solutions of non-linear static problems on the basis of the steady-state conditions of a critically damped explicit transient solution, is chosen to deal with the high geometric and material non-linearities stemming from such a complex fracture problem. One of the common difficulties of the DR method is its slow convergence rate when non-monotonic spectral response is involved. A modified concept that is distinct from the standard DR method is introduced to tackle this problem. The methodology is validated against the stable three point bending test on notched concrete beams of different sizes. The simulations accurately predict the experimental load-displacement curves. The size effect is caught naturally as a result of the calculation. Micro-cracking and non-uniform crack propagation across the fracture surface also come out directly from the 3D simulations.

• Journal of the Korea Computer Graphics Society
• /
• v.23 no.1
• /
• pp.17-24
• /
• 2017

We propose an efficient method to express water spray effects by adaptively modeling air particles in particle-based water simulation. In real world, water and air continuously interacts with each other around free surfaces and this phenomenon is commonly observed in waterfall or sea with rough waves. Due to thin spray water, the interfaces between water and air become vague and the interactions between them lead to heavy vortex phenomenon. To express this phenomenon, we propose methods of 1) generating adaptive air cell in particle-based water simulation, 2) expressing water spray effects by creating and evolving air particles in the adaptive air cells, and 3) guaranteeing robustness of simulation by solving drifting problem occurred when adjacent air particles are insufficient. Experiments convincingly demonstrate that the proposed approach is efficient and easy to use while delivering high-quality results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.2
• /
• pp.495-502
• /
• 2013

In the mobile Ad hoc Network(MANET), improving technique for management and control of topology is recognized as an important part of the next generation network. In this paper, we proposed an efficient node life time management of ATICC(Adaptive Time Interval Clustering Control) in Ad-hoc Networks. Ad-hoc Network is a self-configuration network or wireless multi-hop network based on inference topology. This is a method of path routing management node for increasing the network life time through the periodical route alternation. The proposed ATICC algorithm is time interval control technique depended on the use of the battery energy while node management considering the attribute of node and network routing. This can reduce the network traffic of nodes consume energy cost effectively. As a result, it could be improving the network life time by using timing control method in ad-hoc networks.

• Nuclear Engineering and Technology
• /
• v.27 no.3
• /
• pp.336-343
• /
• 1995

The Self Tuning Regulator(STR) method which is an approach of adaptive control theory, is ap-plied to design the fully automatic power controller of the nonlinear reactor model. The adaptive control represent a proper approach to design the suboptimal controller for nonlinear, time-varying stochastic systems. The control system is based on a third­order linear model with unknown, time-varying parameters. The updating of the parameter estimates is achieved by the recursive extended least square method with a variable forgetting factor. Based on the estimated parameters, the output (average coolant temperature) is predicted one-step ahead. And then, a weighted one-step ahead controller is designed so that the difference between the output and the desired output is minimized and the variation of the control rod position is small. Also, an integral action is added in order to remove the steady­state error. A nonlinear M plant model was used to simulate the proposed controller of reactor power which covers a wide operating range. From the simulation result, the performances of this controller for ramp input (increase or decrease) are proved to be successful. However, for step input this controller leaves something to be desired.

• Proceedings of the KSR Conference
• /
• 2005.11a
• /
• pp.191-196
• /
• 2005

In this study, to describe vehicle-track-bridge dynamic interaction phenomena with 1/4 vehicle model, nonlinear Hertzian contact spring and nonlinear contact damper are introduced. In this approach external loads acting on 1/4 vehicle model are self weight of vehicle and geometry information of running surface. The constraint equation on contact surface is implemented by Penalty method. Also, to improve the numerical stability and to maintain accuracy of solution, the artificial damper and the reaction from constraint violation are introduced. A nonlinear time integration method, in this study, Newmark method is adopted for both equations of vehicles and structure. And to reduce the error caused by inadequate time step size, adaptive time-stepping technique is partially introduced. As the nonlinear Hertzian contact spring has no resistance to tensile force, the bouncing phenomena of wheelset can be described. Thus, it is expected that more versatile dynamic interaction phenomena can be described by this approach and it can be applied to various railway dynamic problems.

• Kyungpook Mathematical Journal
• /
• v.64 no.1
• /
• pp.69-94
• /
• 2024

In this paper, we introduce an inertial self-adaptive projection method using Bregman distance techniques for solving pseudomonotone equilibrium problems in reflexive Banach spaces. The algorithm requires only one projection onto the feasible set without any Lipschitz-like condition on the bifunction. Using this method, a strong convergence theorem is proved under some mild conditions. Furthermore, we include numerical experiments to illustrate the behaviour of the new algorithm with respect to the Bregman function and other algorithms in the literature.

• The Journal of Korean Association of Computer Education
• /
• v.9 no.5
• /
• pp.77-84
• /
• 2006

In this paper, we propose an adaptive image watermarking algorithm in DWT domain by using HVS(human Visual system) and SOM(Self-Organizing Map) among neural networks. HVS can be described in terms of two properties of HVS: brightness and texture sensitivity. The SOM is used to obtain the local characteristics of image, Therefore, the suitable strength and length of embedded watermark is determined by using HVS and SOM. The experimental results show that proposed method provides a suitable strength and length of watermark and has good perceptual invisibility and robustness for various attacks.

• The Journal of Information Technology
• /
• v.7 no.3
• /
• pp.11-18
• /
• 2004

Learning procedure in the neural network is updating of weights between neurons. Unadequate initial learning coefficient causes excessive iterations of learning process or incorrect learning results and degrades learning efficiency. In this paper, adaptive learning algorithm is proposed to increase the efficient in the learning algorithms of Self-Organization Neural Networks. The algorithm updates the weights adaptively when learning procedure runs. To prove the efficiency the algorithm is experimented to classification of strokes which is the reference handwritten character. The result shows improved classification rate about 1.44~3.65% proposed method compare with Kohonan and Mao's algorithms, in this paper.

• Journal of KIISE:Databases
• /
• v.28 no.4
• /
• pp.742-757
• /
• 2001

Since database management systems(DBMSS) have limited lock resources, transactions requesting locks beyond the limit mutt be aborted. In the worst carte, if such transactions are aborted repeatedly, the DBMS can become paralyzed, i.e., transaction execute but cannot commit. Lock escalation is considered a solution to this problem. However, existing lock escalation methods do not provide a complete solution. In this paper, we prognose a new lock escalation method, adaptive lock escalation, that selves most of the problems. First, we propose a general model for lock escalation and present the concept of the unescalatable look, which is the major cause making the transactions to abort. Second, we propose the notions of semi lock escalation, lock blocking, and selective relief as the mechanisms to control the number of unescalatable locks. We then propose the adaptive lock escalation method using these notions. Adaptive lock escalation reduces needless aborts and guarantees that the DBMS is not paralyzed under excessive lock requests. It also allows graceful degradation of performance under those circumstances. Third, through extensive simulation, we show that adaptive lock escalation outperforms existing lock escalation methods. The results show that, compared to the existing methods, adaptive lock escalation reduces the number of aborts and the average response time, and increases the throughput to a great extent. Especially, it is shown that the number of concurrent transactions can be increased more than 16 ~256 fold. The contribution of this paper is significant in that it has formally analysed the role of lock escalation in lock resource management and identified the detailed underlying mechanisms. Existing lock escalation methods rely on users or system administrator to handle the problems of excessive lock requests. In contrast, adaptive lock escalation releases the users of this responsibility by providing graceful degradation and preventing system paralysis through automatic control of unescalatable locks Thus adaptive lock escalation can contribute to developing self-tuning: DBMSS that draw a lot of attention these days.