• Proceedings of the Korea Institute of Fire Science and Engineering Conference
• /
• 2008.11a
• /
• pp.105-110
• /
• 2008

Unmanned helicopter has several abilities such as vertical take off, hovering, low speed flight at a specific altitude. Such vehicles are becoming popular in actual applications such as search and rescue, aerial reconnaissance and surveillance in the case of a large size disaster and forest fire. In this paper, a flight control system was designed for an unmanned helicopter. This paper was concentrated on describing the systematic design, electronic equipments and their interconnections for realizing the autonomous flight and aerial monitoring. A study on the autonomous waypoint navigation and altitude control performance were performed and tested on a test unmanned helicopter and the performance and the feasibility were represented.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1375-1379
• /
• 2004

Unmanned Helicopter has several abilities such as vertical Take off, hovering, low speed flight at low altitude. Such vehicles are becoming popular in actual applications such as search and rescue, aerial reconnaissance and surveillance. These vehicles also used under risky environments without threatening the life of a pilot. Since a small aerial vehicle is very sensitive to environmental conditions, it is generally known that the flight control is very difficult problems. In this paper, a flight control system was designed for an unmanned helicopter. This paper was concentrated on describing the mechanical design, electronic equipments and their interconnections for acquiring autonomous flight. The design methodologies and performance of the helicopter were illustrated and verified with a linearized equation of motion. The LQG based estimator and controller was designed and tested for this unmanned helicopter.

• The Journal of Information Technology and Database
• /
• v.6 no.2
• /
• pp.71-86
• /
• 1999

The performance of relational database is measured by the number of disk accesses necessary to transfer data from disk to main memory. The paper proposes to vertically partition relations into fragments and to allow attribute replication to reduce the number of disk accesses. To reduce the computational time, heuristic search method using genetic algorithm is used. Genetic algorithm used employs a rank-based-sharing fitness function and elitism. Desirable parameters of genetic algorithm are obtained through experiments and used to find the solutions. Solutions of attribute replication and attribute non-replication problems are compared. Optimal solutions obtained by branch and bound method and by heuristic solutions(genetic algorithm) are also discussed. The solution method proposed is able to solve large-sized problems within acceptable time limit and shows solutions near the optimal value.

• Proceedings of the IEEK Conference
• /
• 2003.07d
• /
• pp.1291-1294
• /
• 2003

This paper presents an approach to extract license plates from parking regulation images which is captured in various photographing direction and complex background. first, we search each row at regular intervals starting from the bottom of a license-plate image, and we set up a rough region for a certain zone in which the sign of intensity vector changes frequently enough and color of license plate is detected enough, assuming it as a candidate location of a license plate. And then, we extract an elaborate area of a license plate by horizontally and vertically projecting vertical edges. Here, tar types of the private and the public, are easily classified according to the color of extracted plates. To evaluate proposed method, we used 200 actual regulation images. As a result, the proposed method showed extraction rate of 96%, which is 9% higher than the previous method using only intensity vector.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.98.3-98
• /
• 2002

Vision-based systems for finding road lanes have to operate robustly under a wide variety of environ-mental conditions including large amount of scene clutters. This paper presents a method for finding the lane boundaries by combining a local line extraction method and dynamic programming as a search tool. The line extractor obtains an initial position estimation of road lane boundaries from the noisy edge fragments. Dynamic programming then improves the initial approximation to an accurate configuration of lane boundaries. Input image frame is divided into a few sub-regions along the vertical direction. The local line extractor then performs to extract candidate lines of road lanes in the...

• Proceedings of the KSR Conference
• /
• 2010.06a
• /
• pp.692-697
• /
• 2010

In this paper, a design program for electric railway pole foundation was developed by applying the estimation study performed by Korean Railway. There are two kinds of shapes in the cross-section of electric railway pole foundation: rectangle and circle. In foundation designing, The rectangular foundation should be satisfied with vertical, horizontal and moment equilibrium equations. On the other hand, the circular foundation should be satisfied with horizontal and moment equilibrium equations. The design program was coded into MFC(Microsoft Foundation Class) by MS Visual C. The equation's roots in the program were obtained by Incremental Search method. Dialog and property sheet(Wizard Mode) input windows were selected for user-friendliness. The biggest advantage of this program is to find an optimum depth in a given section.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.3
• /
• pp.132-138
• /
• 1997

Electrical characteristics of split-gate flash EEPROM with triple polysilicon is investigated in terms of effects of floating gate and offset gate. In order to search for t the effects of offset gate on programming characteristics, threshold voltage and drain current are studied with variation of control gate voltage. The programming process is believed to depend on vertical and horizontal electric field as well as offset gate length. The erase and program threshold voltage are found to be almost constant with variation of control gate voltage above 12V, while endurance test indicates degradation of program threshold voltage. With increase of offset gate length, program threshold voltage becomes smaller and the drain source voltage just after program under constant control gate voltage becomes higher.

• ETRI Journal
• /
• v.38 no.6
• /
• pp.1104-1113
• /
• 2016

Non-linear document navigation refers to the process of repeatedly reading a document at different levels to provide an overview, including selective reading to search for useful information within a document under time constraints. Currently, this function is not supported well by small-screen tablets. In this study, we propose the concept of structure-aware touch-based scrolling (SATS), which allows structural document navigation using region-dependent touch gestures for non-sequential navigation within tablets or tablet-sized e-book readers. In SATS, the screen is divided into four vertical sections representing the different structural levels of a document, where dragging into the different sections allows navigating from the macro to micro levels. The implementation of a prototype is presented, as well as details of a comparative evaluation using typical non-sequential navigation tasks performed under time constraints. The results showed that SATS obtained better performance, higher user satisfaction, and a lower usability workload compared with a conventional structural overview interface.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.5
• /
• pp.75-82
• /
• 1998

Conventional vector quantization (VQ) codebook design methods have several drawbacks such as edge degradation and high computational complexity. In this paper, we first made activity coordinates from the horizonatal and the vertical activity of the input block. Then it is mapped on the 2-dimensional interconnected codebook, and the codebook is designed using kohonen self-organizing map (KSFM) learning algorithm after the search of a codevector that has the minumum distance from the input vector in a small window, centered by the mapped point. As the serch area is restricted within the window, the computational amount is reduced compared with usual VQ. From the resutls of computer simulation, proposed method shows a better perfomance, in the view point of edge reconstruction and PSNR, than previous codebook training methods. And we also obtained a higher PSNR than that of classified vector quantization (CVQ).

• The Korean Journal of Archival Studies
• /
• no.23
• /
• pp.3-43
• /
• 2010

Finding aids are tools which facilitate to locate and understand archives and records. Traditionally there are two types of archival finding aids: vertical and horizontal. Vertical finding aids such as inventories have multi-level descriptions based on provenance, while horizontal ones such as catalogs and index are tools to guide to the vertical finding aids based on the subject. In the web environment, traditional finding aids are evolving into more dynamic forms. Respecting the principles of provenance and original order, vertical finding aids are changing to multi-entity structures with development of ISAD(G), ISAAR(CPF) and ISDF as standards for describing each entity. However, vertical finding aids can be too difficult, complicated, and boring for many users, who are accustomed to the easy and exciting searching tools in the internet world. Complementing them, new types of finding aids are appearing to provide easy, interesting, and extensive access channels. This study investigates the development and limitation of vertical finding aids, and the recent trend of evolving new finding aids complementing the vertical ones. The study finds three new trends of finding aid development. They are (i) mixture, (ii) integration, and (iii) openness. In recent days, certain finding aids are mixed with stories and others provide integrated searches for the collections of various heritage institutions. There are cases for experimenting user participation in the development of finding aids using Web 2.0 applications. These new types of finding aids can also cause some problems such as decontextualised description and prejudices, especially in the case of mixed finding aids and quality control of user contributed annotations and comments. To solve these problems, the present paper suggests to strengthen the infrastructure of vertical finding aids and to connect them with various new ones and to facilitate interactions with users of finding aids. It is hoped that the present paper will provide impetus for archives including the National Archives of Korea to set up and evaluate the development strategies for archival finding aids.