• International Journal of Control, Automation, and Systems
• /
• 제4권2호
• /
• pp.165-171
• /
• 2006

This paper proposes a data fusion algorithm of nonlinear multi sensor dynamic systems of synchronous sampling based on filtering step by step. Firstly, the object state variable at the next time index can be predicted by the previous global information with the systems, then the predicted estimation can be updated in turn by use of the extended Kalman filter when all of the observations aiming at the target state variable arrive. Finally a fusion estimation of the object state variable is obtained based on the system global information. Synchronously, we formulate the new algorithm and compare its performances with those of the traditional nonlinear centralized and distributed data fusion algorithms by the indexes that include the computational complexity, data communicational burden, time delay and estimation accuracy, etc.. These compared results indicate that the performance from the new algorithm is superior to the performances from the two traditional nonlinear data fusion algorithms.

• 한국멀티미디어학회논문지
• /
• 제18권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.

• 전자공학회논문지A
• /
• 제28A권12호
• /
• pp.73-87
• /
• 1991

This paper presents a new approach to the scheduling problem in the high level synthesis. In this approach, iterative rescheduling processes starting with ASAP(As Soon As Possible) scheduling result are performed in a branch-and-bound manner so to arrive at the scheduling result of the lowest hardware cost under the given timing constraint. At each iteration step, only the selected nodes are considered for rescheduling, and the lower bound cost estimation is performed to avoid the unnecessary attempts to search for an optimal result. This branch-and-bound method turns out to be effective in pruning the search space, and thus reducing run time considerably in many cases.

• 대한교통학회지
• /
• 제5권2호
• /
• pp.5-18
• /
• 1987

Buses arrive at a traffic intersection later than passenger cars by the amount of dwell time at previous bus stops. This late arrival of buses affects the total passenger delay at intersections especially in the street carrying large bus volume. The bus progression signal system in which the signal offset is given in favor of bus platoons was applied in the case area of Kangnam street in Seoul, and various effects were analyzed using the TRANSYT-7F simulation model. It was observed that the total passenger delay can be reduced significantly if the bus progression signal system is applied, and the most effective bus priority treatment is proved to be the bus progression signal system installed with exclusive bus lanes.

• 수산해양기술연구
• /
• 제29권1호
• /
• pp.11-20
• /
• 1993

The purpose of this paper is to study the subject of economic evaluation in respect of optimum ship size and basic design spiral for fishing vessels. The main ta나 is developed the methodology of engineering economic system in order to apply various methods and tools which may be utilized by the designer in his efforts to arrive at principal design characteristics of fishing vessels with optimum size. The design procedure has been modeled in mathematical form with CBR as an criteria and applied to the optimization method. The contents of the study are as follows (the special treatises).

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2003년도 추계학술대회 논문집
• /
• pp.266-271
• /
• 2003

Many port states such as New Zealand. the USA. Australia and Canada have strict regulations to prevent ships which arrive in their port from discharging polluted ballast water which contain harmful aquatic organism and pathogens. They are notified that transfer of polluted ballast water can cause serious injury to public health and damage to property and environment. For this reason. they perceived that the ballast exchange in deep sea is the most effective method. together with submitting the ballast management plan which contains the effective exchange method. ballast system and safety consideration. In this study, we make an effort to develop optimum ballast water exchange management and in result of that. it provide more convenient and stable process to prepare ballast water management plan for Bulk Carrier.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.591-595
• /
• 1998

This paper proposes a new concept of optimal shortest path algorithm which reduce average vehicle wating time and improve average vehicle speed, Electro sensitive traffic system can extend the traffic cycle when three are many vehicles on the road or it can reduce the traffic cycle when there are small vehicles on the road. But electro sensitive traffic light system doesn't control that kind of function when the average vehicle speed is 10km -20km. Therefore, in this paper to reduce vehicle waiting time we developed design of traffic cycle software tool that can arrive destinination as soon as possible using optimal shortest pass algorithm. Computer simulation result proved 10%-32% reducing average vehicle wating time and average vehicle speed which can select shortest route using built in G.P.S. vehicle is better than not being able to select shortest route function.

• 한국수학교육학회지시리즈A:수학교육
• /
• 제44권1호
• /
• pp.41-65
• /
• 2005

In this paper we make an experiment in order to test whether the teaching method with the Zone of Proximal Development (ZPD) developed by Vygotsky can be more effective and well applied in the middle school pratces. Based on this investigation, we conclude that ZPD help to efficiently enhance the study of students, in particular, the inferior student group. Moreover, if we divide the student by more precise stoups, the ZPD will be more effective on teaching and learning in middle school. Lastly, we arrive at the conclusion that a continuous teaching with ZPD will improve the student attitude positively in solving mathematical problem even it does not appeared apparently on this test.

• 한국농업기계학회:학술대회논문집
• /
• 한국농업기계학회 2000년도 THE THIRD INTERNATIONAL CONFERENCE ON AGRICULTURAL MACHINERY ENGINEERING. V.III
• /
• pp.811-818
• /
• 2000

Agricultural chemicals spraying is one of the most efficient methods for pesticides control. General farming groups use Speed Sprayer but its deposition amount on practical crops is only 20% of total amount in SS case. Agricultural chemicals which fail to arrive the crops not only cause environmental contamination but loss of agriculture chemicals by lower deposition efficiency. For the purpose of improvement of these problems, this experiment proposes SS attachment type electrostatic induction spraying apparatus with DC power which improves deposition efficiency of agriculture chemicals on the crops.

• 응용통계연구
• /
• 제23권6호
• /
• pp.1209-1216
• /
• 2010

48장의 화투패가 섞어지는 과정을 수학적으로 기술하고 그것이 완전히 섞여지기 위해서 몇 번을 반복해 쳐야 하는가에 대한 답을 제시한다. 또한 그보다 작은 횟수로 치는 경우 예상되는 불완전한 임의성의 형태를 밝힌다.