• Journal of Korea Multimedia Society
• /
• v.18 no.9
• /
• pp.1083-1090
• /
• 2015

A generalized recursive circulant network(GR) is widely used in the design and implementation of local area networks and parallel processing architectures. In this paper, we investigate the routing of a message on this network, that is a key to the performance of this network. We would like to transmit maximum number of packets from a source node to a destination node simultaneously along paths on this network, where the i^th packet traverses along the i^th path. In order for all packets to arrive at the destination node securely, the i^th path must be node-disjoint from all other paths. For construction of these paths, employing the Hamiltonian Circuit Latin Square(HCLS), a special class of (n x n) matrices, we present O(n²) parallel routing algorithm on generalized recursive circulant networks.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.471-474
• /
• 1998

In this paper, we consider the problem of optimal broadcasting in recursive circulants under multi-port communication model. Recursive circulant G(N, d) that is defined to be a circulant graph with N vertices and jumps of powers of d is a useful interconnection network from the viewpoint of network metrices. Our model assumes that a processor can transmit a message to $\alpha$ neighboring processors simultaneously where $\alpha$ is two or three. For the broadcasting problem, we introduce 3-trees and 4-trees. And then we show that 3-trees and 4-trees are minimum broadcast trees in 2-port model and 3-port model. Using the above results, we show that recursive circulants g(2m, 2) have optimum broadcasting time in 2-port model and 3-port model.

• International Journal of Automotive Technology
• /
• v.6 no.4
• /
• pp.375-381
• /
• 2005

This paper presents linear algebraic equations in the form of recursive formula to compute elastokinematic characteristics of a suspension system. Conventional methods of elastokinematic analysis are based on nonlinear kinematic constrant equations and force equilibrium equations for constrained mechanical systems, which require complicated and time-consuming implicit computing methods to obtain the solution. The proposed linearized elastokinematic equations in the form of recursive formula are derived based on the assumption that the displacements of elastokinematic behavior of a constrained mechanical system under external forces are very small. The equations can be easily computerized in codes, and have the advantage of sharing the input data of existing general multi body dynamic analysis codes. The equations can be applied to any form of suspension once the type of kinematic joints and elastic components are identified. The validity of the method has been proved through the comparison of the results from established elastokinematic analysis software. Error estimation and analysis due to piecewise linear assumption are also discussed.

• Journal of the Korean Society for Aviation and Aeronautics
• /
• v.20 no.4
• /
• pp.7-13
• /
• 2012

This paper is to estimate aerodynamic coefficients needed to determine the missiles' controller design and stability from simulation data of Skid-to-Turn missile. Method of determining aerodynamic coefficients is to apply Neural Network and Recursive Least Square and results were compared and researched. Also analysing actual flight test data was considered and sensor noise was added. Estimate parameter of data with sensor noise added and estimated performance and reliability for both methods that did not need initial values. Both Neural Network and Recursive Least Square methods showed excellent estimate results without adding the noise and with noise added Neural Network method showed better estimate results.

• Proceedings of the Acoustical Society of Korea Conference
• /
• autumn
• /
• pp.527-530
• /
• 2004

We present a recursive total least squares (RTLS) algorithm for multilayer feedforward neural networks. So far, recursive least squares (RLS) has been successfully applied to training multilayer feedforward neural networks. But, when input data contain additive noise, the results from RLS could be biased. Such biased results can be avoided by using the recursive total least squares (RTLS) algorithm. The RTLS algorithm described in this paper gives better performance than RLS algorithm over a wide range of SNRs and involves approximately the same computational complexity of $O(N^{2})$.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.1323-1326
• /
• 2007

현재 전 세계는 IPv6 조기 도입을 위한 노력을 기울이고 있으며 전략적인 IPv6 인프라 구축 사업을 추진을 하고 있다. 그러나 완전히 IPv6로 전이되기 전까지 IPv4와 IPv6가 공존해야만 한다. 이에 따라 IPv4망에서 IPv6망으로의 안정적인 전이를 위한 상호 운영기술이 필요하다. 이러한 기술을 적용하기 위한 다양한 응용 프로그램의 운영을 위해서 IPv6 기반의 DNS 기술은 그 핵심적인 요소라 할 수 있다. IPv6를 지원하는 Recursive DNS는 기존의 IPv4 기반의 데이터베이스 구조와 플랫폼 및 OS를 IPv6 기반으로 변경해야 하며 IPv4 기반의 DNS 메시지 구조와 이를 처리하는 DNS의 네임 레졸루션 기능이 확장되어야 한다. 따라서 이 논문에서는 IPv6 망 전이를 위하여 변환 프로토콜인 NAT-PT를 이용한 Recursive DNS 구성 방안을 제시한다.

• Journal of the Korea Society of Computer and Information
• /
• v.10 no.5 s.37
• /
• pp.171-177
• /
• 2005

This paper describes the method of calculating coordinate using Forward Kinematics and expresses the recursive equation as the numerical formula using a homogeneous coordinate for creating workspace. This paper proposes an algorithm for the workspace of human model using the recursive equation and the joint limit angle of human model, and describes the results of workspace of the human model as computer graphics.

• Journal of Mechanical Science and Technology
• /
• v.17 no.1
• /
• pp.77-84
• /
• 2003

Virtual work in multibody systems is frequently expressed as the inner product of the virtual displacement and the resultant force at the centroid. But provided that the resultant force is converted into the equipollent forces there is no restriction on where the analysis reference point is placed. There are basically three candidate points : the centroid, joint point and the instant global origin. The traditional fully recursive formulation uses the centroid, but the present work verifies that the instant global origin always shows better efficiency (e.g. 86% CPU time of the centroid for quarter car model) and joint point shows the efficiency between that of the centroid and the instant global origin. A discussion on how important it is to define the analysis reference point properly in a fully recursive formulation is also presented.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.8 no.3
• /
• pp.42-51
• /
• 1999

An experimental modeling of cutting and structural dynamics and the on-line detection of malfunction process is substantial not only for the investigation of the static and dynamic characteristics of cutting process but also for the analytic realization of diagnostic systems. In this regard, We have discussed on the comparative assessment of two recursive time series modeling algorithms that can represent the machining process and detect the abnormal machining behaviors in precision round shape machining such as turning, drilling and boring in mold and die making. In this study, simulation and experimental work were performed to show the malfunctioned behaviors. For this purpose, two new recursive approach (REIVM, RLSM) were adopted fur the on-line system identification and monitoring of a machining process, we can apply these new algorithm in real process for the detection of abnormal machining behaviors such as chipping, chatter, wear and round shape lobe waviness.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.10-13
• /
• 1995

This paper considers the linear-quadratic optimal regulator problem for nonstandard singularly perturbed systems making use of the recursive technique. We first derive a generalized Riccati differential equation by the Hamilton-Jacobi equation. In order to obtain the feedback gain, we must solve the generalized algebraic Riccati equation. Using the recursive technique, we show that the solution of the generalized algebraic Riccati equation converges with the rate of convergence of O(.epsilon.). The existence of a bounded solution of error term can be proved by the implicit function theorem. It is enough to show that the corresponding Jacobian matrix is nonsingular at .epsilon. = 0. As a result, the solution of optimal regulator problem for nonstandard singularly perturbed systems can be obtained with an accuracy of O(.epsilon.$^{k}$ ). The proposed technique represents a significant improvement since the existing method for the standard singularly perturbed systems can not be applied to the nonstandard singularly perturbed systems.