• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.12
• /
• pp.1433-1441
• /
• 2009

In multibody dynamic analysis, one of the most important problems is to reduce computation times for real-time simulation. This paper presents the derivation procedure of equations of motion of a 6${\times}$6 autonomous vehicle in terms of chassis local coordinates which do not require coordinates transformation matrix to enhance efficiency for real-time dynamic analysis. Also, equations of motion are derived using the VT(velocity transformation) technique and symbolic computation method coded by MATLAB. The Jacobian matrix of the equations of motion of a system is derived from symbolic operations to apply the implicit integration method. The analysis results were compared with ADAMS results to verify the accuracy and approve the feasibility of real time analysis.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.15 no.10
• /
• pp.3482-3497
• /
• 2021

Artificial intelligence has emerged as the core of the 4th industrial revolution, and large amounts of data processing, such as big data technology and rapid data analysis, are inevitable. The most fundamental and universal data interpretation technique is an analysis of information through regression, which is also the basis of machine learning. Ridge regression is a technique of regression that decreases sensitivity to unique or outlier information. The time-consuming calculation portion of the matrix computation, however, basically includes the introduction of an inverse matrix. As the size of the matrix expands, the matrix solution method becomes a major challenge. In this paper, a new algorithm is introduced to enhance the speed of ridge regression estimator calculation through series expansion and computation recycle without adopting an inverse matrix in the calculation process or other factorization methods. In addition, the performances of the proposed algorithm and the existing algorithm were compared according to the matrix size. Overall, excellent speed-up of the proposed algorithm with good accuracy was demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.4
• /
• pp.878-894
• /
• 2013

Secure multimedia multicast applications involve group communications where group membership requires secured dynamic key generation and updating operations. Such operations usually consume high computation time and therefore designing a key distribution protocol with reduced computation time is necessary for multicast applications. In this paper, we propose a new key distribution protocol that focuses on two aspects. The first one aims at the reduction of computation complexity by performing lesser numbers of multiplication operations using a ternary-tree approach during key updating. Moreover, it aims to optimize the number of multiplication operations by using the existing Karatsuba divide and conquer approach for fast multiplication. The second aspect aims at reducing the amount of information communicated to the group members during the update operations in the key content. The proposed algorithm has been evaluated based on computation and communication complexity and a comparative performance analysis of various key distribution protocols is provided. Moreover, it has been observed that the proposed algorithm reduces the computation and communication time significantly.

• Structural Engineering and Mechanics
• /
• v.27 no.6
• /
• pp.713-739
• /
• 2007

Nowadays computers can perform symbolic computations in addition to mere number crunching operations for which they were originally designed. Symbolic computation opens up exciting possibilities in Structural Mechanics and engineering. Classical areas have been increasingly neglected due to the advent of computers as well as general purpose finite element software. But now, classical analysis has reemerged as an attractive computer option due to the capabilities of symbolic computation. The repetitive cycles of simultaneous - equation sets required by the finite element technique can be eliminated by solving a single set in symbolic form, thus generating a truly closed-form solution. This consequently saves in data preparation, storage and execution time. The power of Symbolic computation is demonstrated by six examples by applying symbolic computation 1) to solve coupled shear wall 2) to generate beam element matrices 3) to find the natural frequency of a shear frame using transfer matrix method 4) to find the stresses of a plate subjected to in-plane loading using Levy's approach 5) to draw the influence surface for deflection of an isotropic plate simply supported on all sides 6) to get dynamic equilibrium equations from Lagrange equation. This paper also presents yet another computationally efficient and accurate numerical method which is based on the concept of derivative of a function expressed as a weighted linear sum of the function values at all the mesh points. Again this method is applied to solve the problems of 1) coupled shear wall 2) lateral buckling of thin-walled beams due to moment gradient 3) buckling of a column and 4) static and buckling analysis of circular plates of uniform or non-uniform thickness. The numerical results obtained are compared with those available in existing literature in order to verify their accuracy.

• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.05a
• /
• pp.1432-1436
• /
• 2006

Feasibility of optimizing Zwicker's loudness has been shown by using MSC/NASTRAN, SYSNOISE, and a semi-analytical design sensitivity by Wang and Kang. Design sensitivity analysis of Zwicker's loudness is developed by using ANSYS, COMET, and an adjoint variable method in order to reduce computation. A numerical example shows significant reduction of computation time for design sensitivity analysis.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.05a
• /
• pp.94-97
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Deformation history of the previous stage is considered in the computation. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

• Transactions of Materials Processing
• /
• v.10 no.5
• /
• pp.389-395
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes with large aspect ratio, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem. as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Deformation history of the previous stage is considered in the computation. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.5B no.1
• /
• pp.39-42
• /
• 2005

Though full 3D analysis is the proper method to analyze the hybrid stepping motor (HSM), it has weak points in the areas of computation time and complexity. This paper introduces 2D FEA using a virtual magnetic barrier for the axial cross section to save computation time. For the purpose of 2D FEA, the virtual magnetic barrier and equivalent permanent magnet model of HSM are proposed. This result is compared with that of experimental and 3D analysis, considered as a reference result.

• Journal of applied mathematics & informatics
• /
• v.6 no.1
• /
• pp.175-184
• /
• 1999

Along with the computation and analysis for nonlinear system being more and more involved in the fields such as automation control electronic technique and electrical power system the nonlin-ear theory has become quite a attractive field for academic research. In this paper we derives the solutions for state equation of nonlinear system by using the inverse operator expression of the so-lutions is obtained. An actual computation example is given giving a comparison between IOM and Runge-kutta method. It has been proved by our investigation that IOM has some distinct advantages over usual approximation methods in that it is computationally con-venient rapidly convergent provides accurate solutions not requiring perturbation linearization or the massive computation inherent in discrietization methods such as finite differences. So the IOM pro-vides an effective method for the solution of nonlinear system is of potential application valuable in nonlinear computation.

• Journal of the Korean Mathematical Society
• /
• v.52 no.4
• /
• pp.797-819
• /
• 2015

A trapdoor discrete logarithm group is a cryptographic primitive with many applications, and an algorithm that allows discrete logarithm problems to be solved faster using a pre-computed table increases the practicality of using this primitive. Currently, the distinguished point method and one extension to this algorithm are the only pre-computation aided discrete logarithm problem solving algorithms appearing in the related literature. This work investigates the possibility of adopting other pre-computation matrix structures that were originally designed for used with cryptanalytic time memory tradeoff algorithms to work as pre-computation aided discrete logarithm problem solving algorithms. We find that the classical Hellman matrix structure leads to an algorithm that has performance advantages over the two existing algorithms.