• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.8
• /
• pp.1972-1988
• /
• 2013

In order to deal with key exposure problem, we introduce forward secure technique into certificateless proxy signature scheme, and propose the formal definition and security model of the forward secure certificateless proxy signature. Our security model takes into account the super adversary in certificateless signature. Furthermore, we present a construction of forward secure certificateless proxy signature scheme with bilinear maps. Based on the difficulty of computational Diffie-Hellman problem, we prove the scheme is secure against chosen message attack in the random oracle model. Finally, we analyze efficiency of the proposed scheme.

• Journal of Ship and Ocean Technology
• /
• v.6 no.1
• /
• pp.34-53
• /
• 2002

Numerical solution of the forward-speed radiation problem for a half-immersed cylinder advancing in regular waves is presented by making use of the improved Green integral equation in the frequency domain. The B-spline higher order panel method is employed stance the potential and its derivative are unknown at the same time. The present numerical solution of the improved Green integral equation by the B-spline higher order Kelvin panel method is shown to be free of irregular frequencies which are present in the Green integral equation using the forward-speed Kelvin-type Green function.

• IE interfaces
• /
• v.22 no.2
• /
• pp.153-164
• /
• 2009

An effective management for reverse flows of products such as reuse, repair and disposal, has become an important issue for every aspect of business. In this paper, we study the Location-Routing Problem (LRP) in the multi-stage closed-loop supply chain network. The closed-loop supply chain in this study integrated both forward and reverse flows. In forward flow, a factory, Distribution Center (DC) and retailer are considered as usual. Additionally in reverse flow, we consider the Central Returns collection Center (CRC) and disposal facility. We propose a mixed integer programming model for the design of closed-loop supply chain integrating both forward and reverse flows. Since the LRP belongs to an NP-hard problem, we suggest a heuristic algorithm based on genetic algorithm. For some test problems, we found the optimal locations and routes by changing the numbers of retailers and facility candidates. Furthermore, we compare the efficiencies between open-loop and closed-loop supply chain networks. The results show that the closed-loop design is better than the open one in respect to the total routing distance and cost. This phenomenon enlarges the cut down effect on cost as an experimental space become larger.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.4
• /
• pp.137-145
• /
• 2008

In this paper, novel CMOS charge pump having NMOS and PMOS transfer switches and a bulk-pumping circuit has been proposed. The NMOS and PMOS transfer switches allow the charge pump to improve the current-driving capability at the output. The bulk-pumping circuit effectively solves the bulk forward problem of the charge pump. To verify the effectiveness, the proposed charge pump was designed using a 80-nm CMOS process. The comparison results indicate that the proposed charge pump enhances the current-driving capability by more than 47% with pumping speed improved by 9%, as compared to conventional charge pumps having either NMOS or PMOS transfer switch. They also indicate that the charge pump reduces the worst-case forward bias of p-type bulk by more than 24%, effectively solving the forward current problem.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.3
• /
• pp.1502-1522
• /
• 2019

Leakage of secret keys may be the most devastating problem in public key cryptosystems because it means that all security guarantees are missing. The forward security mechanism allows users to update secret keys frequently without updating public keys. Meanwhile, it ensures that an attacker is unable to derive a user's secret keys for any past time, even if it compromises the user's current secret key. Therefore, it offers an effective cryptographic approach to address the private key leakage problem. As an extension of the forward security mechanism in certificate-based public key cryptography, forward-secure certificate-based signature (FS-CBS) has many appealing merits, such as no key escrow, no secure channel and implicit authentication. Until now, there is only one FS-CBS scheme that does not employ the random oracles. Unfortunately, our cryptanalysis indicates that the scheme is subject to the security vulnerability due to the existential forgery attack from the malicious CA. Our attack demonstrates that a CA can destroy its existential unforgeability by implanting trapdoors in system parameters without knowing the target user's secret key. Therefore, it is fair to say that to design a FS-CBS scheme secure against malicious CAs without lying random oracles is still an unsolved issue. To address this problem, we put forward an enhanced FS-CBS scheme without random oracles. Our FS-CBS scheme not only fixes the security weakness in the original scheme, but also significantly optimizes the scheme efficiency. In the standard model, we formally prove its security under the complexity assumption of the square computational Diffie-Hellman problem. In addition, the comparison with the original FS-CBS scheme shows that our scheme offers stronger security guarantee and enjoys better performance.

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

The 6-DOF parallel manipulator is a closed-kindmatic chain robot manipulator that is capable of providing high structural rigidity and positional accuracy. Because of its advantage, the parallel manipulator have been widely used in many engineering applications such as vehicle/flight driving simulators, rogot maniplators, attachment tool of machining centers, etc. However, the kinematic analysis for the implementation of a real-time controller has some problem because of the lack of an efficient lagorithm for solving its highly nonliner forward kinematic equation, which provides the translational and orientational attitudes of the moveable upper platform from the lenght of manipulator linkages. Generally, Newton-Raphson method has been widely sued to solve the forward kinematic problem but the effectiveness of this methodology depend on how to set initial values. This paper proposes a hybrid method using genetic algorithm(GA) and Newton-Raphson method to solve forward kinematics. That is, the initial values of forward kinematics solution are determined by adopting genetic algorithm which can search grobally optimal solutions. Since determining this values, the determined values are used in Newton-Raphson method for real time calcuation.

• Communications for Statistical Applications and Methods
• /
• v.8 no.2
• /
• pp.337-346
• /
• 2001

In this paper we consider the problem of identifying and testing the outliers in linear regression. first we consider the problem for testing the null hypothesis of no outliers. The test based on the ratio of two scale estimates is proposed. We show the asymptotic distribution of the test statistic by Monte Carlo simulation and investigate its properties. Next we consider the problem of identifying the outliers. A forward sequential procedure based on the suggested test is proposed and shown to perform fairly well. The forward sequential procedure is unaffected by masking and swamping effects because the test statistic is based on robust estimate.

• Journal of the Korean Data and Information Science Society
• /
• v.14 no.3
• /
• pp.673-685
• /
• 2003

In this paper we consider the problem of identifying and testing outliers in linear regression. First we consider the problem for testing the null hypothesis of no outliers. A test based on the ratio of two residual scale estimates is proposed. We show the asymptotic distribution of the test statistics by Monte Carlo simulation and investigate its properties. Next we consider the problem of identifying the outliers. A forward sequential procedure using the suggested test is proposed and shown to perform fairly well. Unlike other forward procedures, the present one is unaffected by masking and swamping effects because the test statistic is based on robust scale estimate.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.7
• /
• pp.1632-1642
• /
• 1994

The Stewart Platform is a six-degree-of-freedom in-parallel-actuated manipiulator mechanism. The kinematic behavior of parallel mechanisms shows inverse characteristics as compared that of serial mechanisms; i.e, the inverse kinematic problem of Stewart Platform is straightforward, but no closed form solution of the forward kinematic problem has been previously presented. Thus it is difficult to calculate the 6 DOF displacement of the platform from the measured lengths of the six actuators in real time. Here, a real-time estimation algorithm which solves the Stewart Platform kinematic problem is proposed and tested through computer simulations and experiments. The proposed algorithm shows stable convergence characteristics, no estimation errors in steady state and good estimation performance with higher sampling rate. In experiments it is shown that the estimation result is the same as that of simulation even in the presence of measurement noise.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.25 no.3
• /
• pp.339-352
• /
• 2001

The inverse kinematics problem of Stewart platform is straightforward, but no closed form solution of the forward kinematic problem has been presented. Since we need the real-time forward kinematic solution in MIMO control and the motion monitoring of the platform, it is important to acquire the 6 DOF displacements of the platform from measured lengths of six cylinders in small sampling period. Newton-Raphson method a simple algorithm and good convergence, but it takes too long calculation time. So we reduce 6 nonlinear kinematic equations to 3 polynomials using Nairs method and 3 polynomials to 2 polynomials. Then Newton-Raphson method is used to solve 3 polynomials and 2 polynomials respectively. We investigate operation counts and performance of three methods which come from the equation reduction and Newton-Raphson method, and choose the best method.