• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2701-2710
• /
• 1997

Recursive circulant graph has recently developed as a new model of multiprocessors, and drawn considerable attention to supercomputing, In this paper, we investigate the routing of a message i recursive circulant, that is a key to the performance of this network. On recursive circulant network, we would like to transmit m packets from a source node to a destination node simultaneously along paths, where the ith packet will traverse along the ith path $(o{\leq}i{\leq}m-1)$. In oder for all packets to arrive at the destination node quickly and securely, the ith 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{\times}n)$ matrices, we present $O(n^2)$ parallel routing algorithm on recursive circulant network.

• Korean Journal of Optics and Photonics
• /
• v.35 no.4
• /
• pp.164-169
• /
• 2024

We applied recursive numerical computation to create a basic design of a camera optical module for mobile phones. To enhance the resolution performance for a 38-degree field of view, we constructed the optical system with six non-spherical lenses. However, to increase its applicability to a compact mobile phone, we limited the overall length to 5 mm in the design. Using the data obtained from the basic design, we proceeded with optimization design using the Zemax design tool. The optimized optical system achieved a resolution performance with a modulation transfer function value of more than 19% for a 280 lines/mm pattern and image distortion within 1.0% for all wavelength rays. In this paper, we verify the feasibility of using recursive numerical computation for the basic design of a compact mobile phone camera.

• Industrial Engineering and Management Systems
• /
• v.7 no.2
• /
• pp.182-188
• /
• 2008

Automated parking systems, which automatically park and retrieve vehicles, have been steadily replacing conventional parking systems. The spiral parking system is a type of automated parking systems that has cylindrical parking tower. We develop an economic design model of spiral parking system based on a recursive optimization and simulation procedure in which the dynamic nature of the parking system can be integrated into the mathematical programming model. The optimal values of design parameters are found that gives the minimum total cost while complying with the desired performance of the system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.164-167
• /
• 1996

This paper presents an off-line P.I.D parameter estimation method during normal operation in power plant. The process parameters are estimated using the recursive least square method. The controller parameters are estimated on the basis of desired characteristics of the dynamic model of the closed-loop control.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.399-401
• /
• 1989

Utilizing an interconnected set of neuron-like elements, the present study is to provide a method of parameter estimation for a second order linear time invariant system of self-tuning controller. The result from the proposed method is evaluated by comparing with those obtained by the recursive least square (RLS) identification algorithm and extended recursive least square (ERLS) algorithm, and it shows that, although the smoothness of system performance is still to be improved, the effectiveness of shorter computing time is demonstrated which may be of considerable value to real time computing.

• Structural Engineering and Mechanics
• /
• v.27 no.5
• /
• pp.527-540
• /
• 2007

The modal controller of single-input system cannot stabilize the defective system with positive real part of repeated eigenvalues, because some of the generalized modes are uncontrollable. In order to stabilize the uncontrollable modes with positive real part of eigenvalues, the multi-input system should be introduced. This paper presents a recursive procedure for designing the feedback controller of the multi-input system with defective repeated eigenvalues. For a nearly defective system, we first transform it into a defective one, and apply the same method to manage. The proposed methods are based on the modal coordinate equations, to avoid the tedious mathematic manipulation. As an application of the presented procedure, two numerical examples are given at end of the paper.

• Journal of Korea Multimedia Society
• /
• v.16 no.7
• /
• pp.897-904
• /
• 2013

The recursive circulant network G(N,d) can be widely used in the design and implementation of parallel processing architectures. It consists of N identical nodes, each node is connected through bidirectional, point-to-point communication channels to different neighbors by jumping $d^i$, where $0{\leq}i{\leq}{\lceil}{\log}_dN{\rceil}$ - 1. In this paper, we investigate the routing of a message on $G(2^m,4)$, a special kind of RCN, that is key to the performance of this network. On $G(2^m,4)$ we would like to transmit k packets from a source node to k destination nodes simultaneously along paths on this network, the $i^{th}$ packet will be transmitted along the $i^{th}$ path, where $1{\leq}k{\leq}m-1$, $0{{\leq}}i{{\leq}}m-1$. In order for all packets to arrive at a destination node quickly and securely, we present an $O(m^4)$ routing algorithm on $G(2^m,4)$ for generating a set of one-to-many node-disjoint and nearly shortest paths, where each path is either shortest or nearly shortest and the total length of these paths is nearly minimum since the path is mainly determined by employing the Hungarian method.

• Proceedings of the Korean Information Science Society Conference
• /
• 2005.11a
• /
• pp.922-924
• /
• 2005

실시간 시스템의 개발 및 운영에 사용되는 실시간 운영체제는 여러 개의 태스크가 동시에 작업할 수 있는 멀티태스킹 환경과 각 태스크에 우선순위를 부여하여 가장 높은 우선순위의 태스크가 CPU 를 선점하는 스케줄링 방법, 그리고 태스크간 동기화 및 통신을 위한 메커니즘을 제공하고 있다. 또한 여러 태스크들에 의해 사용되는 공유자원을 관리하기 위해 세마포어(Semaphore)를 사용하여 태스크간 동기화를 제공한다. 그러나 하나의 태스크가 세마포어를 이용하여 공유자원에 대해 여러 번 접근 할 경우, 데드락(Deadlock)을 일으킬 소지가 많다. 본 논문에서는 실시간 운영체제인 $iRTOS^{TM}$ 에서 데드락을 방지하기 위한 재귀적 세마포어(Recursive Semaphore)를 설계 및 구현하였다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3289-3295
• /
• 2010

In business material management, as the number of products and their parts increases, the employment of databases becomes inevitable. Many researchers have tried to incorporate semantics in traditional models using logic programming, resulting in the deductive method. However, since the designer of this method does not overcome the traditional design concept of relational method, there have been not much successful implementations in deductive method. Therefore, this paper propose the new way designing the retrieval methods for deductive databases and using those relations the query that makes recursive retrievals possible and hypotheses test in business material management.

• 한국해양학회지
• /
• v.19 no.2
• /
• pp.133-140
• /
• 1984

Oceanographic applications of digital filters are studied with special emphasis on the convolution filter with Hamming window and the recursive filters. Convolution filters are simple to understand and easy to design but not efficient for a long data set. Recursive filters, despite of the complexities, have advantages on economy and filter characteristic. By means of digital filtering technique we find that the alongshore wind at Pusan and the sea surface temperature at Gampo in summers during 1973 to 1979 are negatively correlated at low frequencies (periods longer than 5 days) but not so at high frequencies.