• The KIPS Transactions:PartC
• /
• v.19C no.1
• /
• pp.9-18
• /
• 2012

In 2010, Pedro et al. proposed RFID distance bounding protocol based on WSBC cryptographic puzzle. This paper points out that Pedro et al.'s protocol not only is vulnerable to tag privacy invasion attack and location tracking attack because an attacker can easily obtain the secret key(ID) of a legal tag from the intercepted messages between the reader and the tag, but also requires heavy computation by performing symmetric key operations of the resource limited passive tag and many communication rounds between the reader and the tag. Moreover, to resolve the security weakness and the computation/communication efficiency problems, this paper also present a new RFID distance bounding protocol based on WSBC cryptographic puzzle that can provide strong security and high efficiency. As a result, the proposed protocol not only provides computational and communicational efficiency because it requires secure one-way hash function for the passive tag and it reduces communication rounds, but also provides strong security because both tag and reader use secure one-way hash function to protect their exchanging messages.

• The KIPS Transactions:PartC
• /
• v.17C no.4
• /
• pp.307-314
• /
• 2010

Recently, it is proved that contactless smart-card based RFID tags, which is used for proximity authentication, are vulnerable to relay attacks with various location-based attacks such as distance fraud, mafia fraud and terrorist fraud attacks. Moreover, distance bounding protocols have been researched to prevent these relay attacks that can measure the message transmitted round-trip time between the reader and the tag. In 2005, Hancke and Kuhn first proposed an RFID distance bounding protocol based on secure hash function. However, the Hancke-Kuhn protocol cannot completely prevent the relay attacks because an adversary has (3/4)$^n$ attack success probability. Thus, this paper proposes a new distance-bounding protocol for light-weight RFID systems that can reduce to (5/8)$^n$ for the adversary's attack success probability. As a result, the proposed protocol not only can provide high-space efficient based on a secure hash function and XOR operation, but also can provide strong security against the relay attacks because the adversary's attack success probability is optimized to (5/8)$^n$.

• Journal of Institute of Control, Robotics and Systems
• /
• v.15 no.4
• /
• pp.413-419
• /
• 2009

A decentralized adaptive control method is proposed for large-scale systems with unknown time-delayed nonlinear interconnections unmatched in control inputs. It is assumed that the time-delayed interaction terms are bounded by unknown nonlinear bounding functions. The nonlinear bounding functions and uncertain nonlinear functions of large-scale systems are compensated by the function approximation technique using neural networks. The dynamic surface control method is extended to design the proposed memoryless local controller for each subsystem of uncertain nonlinear large-scale time delay systems. Therefore, although the interconnected systems consist of a large number of subsystems, the proposed controller can be designed simply. We prove that all the signals in the total closed-loop system are semiglobally uniformly bounded and the control errors converge to an adjustable neighborhood of the origin. Finally, an example is given to demonstrate the effectiveness and applicability of the proposed scheme.

• Journal of the Korean Data and Information Science Society
• /
• v.11 no.2
• /
• pp.181-188
• /
• 2000

The shape of an M-estimation function is generally determined in the sense of either/both maximizing efficiency of an M-estimator at the model or/and bounding the influence function of an M-estimator. We propose an empirical method of choosing a value of the bending constant in Huber's ${\psi}-function$, which is the most widely used M-estimation function when estimating the location parameter.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.3
• /
• pp.789-797
• /
• 2017

The main purpose of this paper is to present closed integral form expressions for the Mathieu-type a-series and its associated alternating version whose terms contain a (p, q)-extended Gauss' hypergeometric function. Certain upper bounds for the two series are also given.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.2 s.12
• /
• pp.3-13
• /
• 2004

The TPR-tree exploits bounding rectangles based on the function of time in order to index moving objects. As time passes on, each edge of a BR expands with the fastest velocity vector. Since the expansion of the BR results in a serious overlaps between neighboring nodes, the performance of range query is getting worse. In this paper, we propose schemes to reorganize bounding rectangles of nodes. When inserting a moving object, we exploit a forced merging scheme to merge two overlapped nodes and re-split it. When deleting a moving object, we used forced reinsertion schemes to reinsert other objects of a node into a tree. The forced reinsertion schemes are classified into a deleted node reinsertion scheme and an overlapped nodes reinsertion scheme. The overlapped nodes reinsertion scheme outperforms the forced merging scheme and the deleted node reinsertion scheme in all experiments.

• Journal of the Korea Computer Graphics Society
• /
• v.7 no.1
• /
• pp.1-9
• /
• 2001

We present a scheme and a data structure that decompose the space into adaptive-sized cells to improve the visualization of soft objects. Soft objects are visualized through the evaluation of the field functions at every point of the space. According to the propsed scheme, the affecting soft objects for a point in the space is searched through the data structure called interval tree based on the bounding volume of the components, which represent a soft object whose defining primitive(skeleton) is a simple geometric object such as point or line segment. The bounding volume of each component is generated with respect to the radius of a local field function of the component, threshold value, and the relations between the components and other neighboring components. The proposed scheme can be used in many applications for soft objects such as modeling and rendering, especially in interactive modeling process.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.43 no.4
• /
• pp.469-476
• /
• 2023

Soil plasticity models for cyclic and dynamic loads are essential in non-linear numerical analysis of geotechnical structures. While a single yield surface model shows a linear behavior for cyclic loads, J₂-bounding surface plasticity model with zero elastic region can effectively simulate a nonlinearity of the ground response with the same material properties. The radius of the yield surface inside the boundary surface converged to 0 to make the elastic region disappear, and plastic hardening modulus and dilatancy define plastic strain increment. This paper presents the stress-strain incremental equation of the developed model, and derives plastic hardening modulus for the hyperbolic model. The comparative analyses of the triaxial compression test and the shallow foundation under the cyclic load can show stable numerical convergence, consistency with the theoretical solution, and hysteresis behavior. In addition, plastic hardening modulus for the modified hyperbolic function is presented, and a methodology to estimate model variables conforming 1D equivalent linear model is proposed for numerical modeling of the multi-dimensional behavior of the ground.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.4
• /
• pp.297-305
• /
• 1996

In this paper a novel robust adaptive fuzzy controller for the nonlinear system with state-dependent uncertainty is proposed. The conventional adaptive fuzzy controller determines the function of state variable bounding the state-dependent uncertain term in the system dynamics on the local state space by off-line calculation. Whereas the proposed method determines that function by the fuzzy inference so that it guarantees the stability of the closed loop system globally on the whole state space. In addition, the method is applicable to the multi-input system. We applied the proposed method to the Burn Control of the Tokamak fusion reactor whose dynamics contains the state-dependent uncertainty and proved the effectiveness of the scheme by using the simulation results.

• IE interfaces
• /
• v.22 no.1
• /
• pp.10-16
• /
• 2009

In this paper, we propose an efficient search algorithm for finding an optimal schedule to minimize makespan, while avoiding deadlock situation in Flexible Manufacturing Systems (FMS) with finite capacity, in which each job needs to be processed in several job stages for completion. The proposed algorithm uses a modeling and control method based on Petri-net. Especially, we improve the efficiency of the search algorithm by using a priority rule and an efficient bounding function during the search procedure. The performance of the proposed algorithm is evaluated through a numerical experiment, showing that it holds considerable promise for providing an optimal solution efficiently comparing to past work.