• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2009.04a
• /
• pp.139-145
• /
• 2009

Reduction scheme is remarkably useful in the case requiring the repeated calculation procedure. Recently, the efficiency of the reduction scheme has been improved by combining scheme of sub-domain method. But, when the global domain is partitioned into a few sub-domains, sub-domains without constraints can be produced. it is needed to extract the ritz vector from each sub-domain to construct the reduced system of each sub-domain. it is easy to extract the ritz vector from sub-domain with constraint. on the other hand, pseudo inverse method should be employed to extract the ritz vector from sub-domain without constraint. generally, the pseudo inverse takes a large number of computing time to obtain a reduced system of a sub-domain without boundary condition. This trouble can be overcome by the reduced pseudo inverse scheme which proposed in this study. This scheme is based on the static condensation that is not related with selection of the primary degrees of freedom. Numerical examples demonstrate that present method saves computational cost effectively and predicts the accurate eigenvalues.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.22 no.2
• /
• pp.173-179
• /
• 2009

Reduction scheme is remarkably useful in the case requiring the repeated calculation procedure. Recently, the efficiency of the reduction scheme has been improved by combining scheme of sub-domain method. But, when the global domain is partitioned into a few sub-domains, sub-domains without constraints can be produced. it is needed to extract the ritz vector from each sub-domain to construct the reduced system of each sub-domain. it is easy to extract the ritz vector from sub-domain with constraint. on the other hand, pseudo inverse method should be employed to extract the ritz vector from sub-domain without constraint. generally, the pseudo inverse takes a large number of computing time to obtain a reduced system of a sub-domain without boundary condition. This trouble can be overcome by the reduced pseudo inverse scheme which proposed in this study. This scheme is based on the static condensation that is not related with selection of the primary degrees of freedom. Numerical examples demonstrate that present method saves computational cost effectively. In addition, it is shown that the reduced system based on the proposed scheme predicts the accurate eigenvalues of global system.

• Journal of Internet Computing and Services
• /
• v.6 no.5
• /
• pp.11-25
• /
• 2005

In MIPv6 environment, an important design consideration for public key based binding update protocols is to minimize asymmetric cryptographic operations in mobile nodes with constraint computational power, such as PDAs and cellular phones, For that, public key based protocols such as CAM-DH. SUCV and Deng-Zhou-Bao's approach provides an optimization to offload asymmetric cryptographic operations of a mobile node to its home agent. However, such protocols have some problems in providing the optimization. Especially, CAM-DH with this optimization does not unload all asymmetric cryptographic operations from the mobile node, while resulting in the home agent's vulnerability to denial of service attacks. In this paper, we improve the drawbacks of CAM-DH. Furthermore, we adopt Aura's two hash-based CGA scheme to increase the cost of brute-force attacks searching for hash collisions in the CGA method. The comparison of our protocol with other public key based protocols shows that our protocol can minimize the MN's computation overhead, in addition to providing better manageability and stronger security than other protocols.

• Journal of Institute of Control, Robotics and Systems
• /
• v.20 no.8
• /
• pp.875-881
• /
• 2014

The redundancy resolution of the seven DOF (Degree of Freedom) upper limb exoskeleton is key to the synchronous motion between a robot and a human user. According to the seven DOF human arm model, positioning and orientating the wrist can be completed by multiple arm configurations that results in the non-unique solution to the inverse kinematics. This paper presents analysis on the kinematic and dynamic aspect of the human arm movement and its effect on the redundancy resolution of the seven DOF human arm model. The redundancy of the arm is expressed mathematically by defining the swivel angle. The final form of swivel angle can be represented as a linear combination of two different swivel angles achieved by optimizing two cost functions based on kinematic and dynamic criteria. The kinematic criterion is to maximize the projection of the longest principal axis of the manipulability ellipsoid of the human arm on the vector connecting the wrist and the virtual target on the head region. The dynamic criterion is to minimize the mechanical work done in the joint space for each of two consecutive points along the task space trajectory. The contribution of each criterion on the redundancy was verified by the post processing of experimental data collected with a motion capture system. Results indicate that the bimodal redundancy resolution approach improved the accuracy of the predicted swivel angle. Statistical testing of the dynamic constraint contribution shows that under moderate speeds and no load, the dynamic component of the human arm is not dominant, and it is enough to resolve the redundancy without dynamic constraint for the realtime application.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.6
• /
• pp.9-17
• /
• 1999

In this paper, we propose a new technology mapping algorithm for CPLD under time constraint. In our technology mapping algorithm, a given logic equation is constructed as the DAG type, then the DAG is reconstructed by replicating the node that outdegree is more than or equal to 2. As a result, it makes delay time and the number of CLBs to be minimized. Also, after the number of multi-level is defined and cost of each nodes is calculated, the graph is partitioned in order to fit to k that is the number of OR term within CLB. The partitioned nodes are merged through collapsing and bin packing is performed in order to fit to the number of OR term within CLB. In the results of experiments to MCNC circuits for logic synthesis benchmark, we can shows that proposed technology mapping algorithm reduces delay time and the number of CLBs much more than the existing tools of technology mapping algoritm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

• Journal of the Korea Society of Computer and Information
• /
• v.9 no.4 s.32
• /
• pp.117-125
• /
• 2004

The berth and crane scheduling problem in a container terminal encompasses the whole process of assigning berth to each ship. determining the duration of berthing, assigning container cranes to each ship, and determining the specific start and end time of each crane service, for all the ships scheduled to be arriving at the terminal during a certain scheduling horizon. This problem is basically a constraint satisfaction problem in which all the constraints should be satisfied. However, it is also an optimization problem because the requested arrival and departure time should be met for as many of the scheduled ships as possible. while the operation cost of the terminal should be minimized. In this paper. I present an effective approach to solving this problem, which combines both constraint satisfaction search and iterative improvement search. I test this method on a real world container terminal problem and the results show that the method can produce better results than any other existing method.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.3
• /
• pp.81-87
• /
• 2016

This paper analysis the AM-SCS-MMA (Adaptive Modulus-Soft Constraint Satisfaction-MMA) based on the adaptive modulus and minimus-disturbance technique in order to improve the stability and robustness in low signal to noise power of current MMA adaptive equalization algorithm. In AM-SCS-MMA, it updates the filter coefficient applying the adaptive modulus and minimum-disturbance technique of deterministic optimization problem instead of LMS or gradient descend algorithm for obtain the minimize the cost function of adaptive equalization. It is possible to improve the equalizer filter stability, robustness to the various noise characteristic and simultaneous reducing the intersymbol interference due to the amplitude and phase distortion occurred at channel. The computer simulation were performed for confirming the improved performance of SCS-MMA. For these, the output signal constellation of equalizer, residual isi, MSE, EMSE (Excess MSE) which means the channel traking capability and SER which means the robustness were applied. As a result of computer simulation, the AM-SCS-MMA have slow convergence time and less residual quantities after steady state, more good robustness in the poor signal to noise ratio, but poor in channel tracking capabilities was confirmed than MMA.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.6
• /
• pp.748-754
• /
• 2010

To reduce the computational cost required for assembling vessel fragments using surface geometry, this paper proposes a fast axis estimation method. Using circular constraint of pottery and local planar patch assumption, it finds the axis of the symmetry. First, the circular constraint on each cylinder is used. A circular symmetric pot can be thought of unions of many cylinders with different radii. It selects one arbitrary point on the pot fragment surface and searches a path where a circumference exists on that point. The variance of curvature will be calculated along the path and the path with the minimum variance will be selected. The symmetric axis will pass through the center of that circle. Second, the planar patch assumption and profile curve is used. The surface of fragment is divided into small patches and each patch is assumed as plane. The surface normal of each patch will intersects the axis in 3D space since each planar patch faces the center of the pot. A histogram method and minimization of the profile curve error are utilized to find the probability distribution of the axis location. Experimental results demonstrate the improvement in speed and robustness of the algorithms.

• The Journal of the Korea Contents Association
• /
• v.15 no.2
• /
• pp.433-443
• /
• 2015

This study aims to analyze key antecedents of customer loyalty based on dedication-based and constraint-based mechanisms. Our framework provides a theoretical lens of how two distinctive mechanisms influence customer loyalty in a coffee chain context. In this regard, this study examines the effects of customer satisfaction and switching costs on customer loyalty in a coffee shop market. In order to test the proposed model, data collected from 263 university students were empirically tested by using partial least squares regression. The analysis results reveal that customer loyalty is jointly influenced by both a dedication-based and a constraint-based mechanisms. Coffee quality service quality, price and value, and service atmosphere significantly affect user satisfaction. Habit and brand image were found to be the key factors of forming perceived switching costs.