• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1232-1239
• /
• 2006

In video standards such as MPEG-1/2/4 and H.264/AVC, motion estimation / compensation(ME/MC) process causes the most encoding complexity of video encoder. The full search method, which is used in general video codecs, exhausts much encoding time because it compares current macroblock with those at all positions within search window for searching a matched block. For the alleviation of this problem, the fast search methods such as TSS, NTSS, DS and HEXBS are exploited at first. Thereafter, DS based MVFAST, PMVFAST, MAS and FAME, which utilize temporal or spacial correlation characteristics of motion vectors, are developed. But there remain the problems of image quality degradation and algorithm complexity increase. In this thesis, the proposed algorithm maximizes search speed and minimizes the degradation of image quality by determining initial search point correctly and using simple one-dimension search patterns considering motion characteristics of each frame.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.43 no.4 s.310
• /
• pp.23-30
• /
• 2006

This paper presents design andd verification of a circuit that improves the control-operation problems of Stored Program Optical Computer (SPOC), which is an optical computer using $LiNbO_3$ optical switching element. Since the memory of SPOC takes the Delay Line Memory (DLM) architecture and instructions that are needless of operands should go though memory access stages, SPOC memory have problems; it takes immoderate access time and unnecessary operations are executed in Arithmetic Logical Unit (ALU) because desired operations can't be selectively executed. In this paper, improvement on circuit has been achieved by removing the memory access of instructions that are needless of operands by decoding instructions before locating operand. Unnecessary operations have been reduced by sending operands to some specific operational units, not to all the operational units in ALD. We show that total execution time of a program is minimized by using the Dual Instruction Register(DIR) architecture.

• The Journal of the Korea Contents Association
• /
• v.8 no.4
• /
• pp.39-47
• /
• 2008

This paper describes the life GIS(Geographic Information System) system that enables users to look up the final destination on a map automatically by setting up a random radius of threshold under the present user position. Various information systems based on the existing GIS have disadvantage that a search is difficult when the destination location is not clear. And it is inefficient that the processing time is delay due to a complex configuration and large amount of informations based on the target of special business supports. Therefore, this paper improves these problems and proposes the customized life GIS which is for the general user in the Flash(Action Script) environment. The customized life GIS confirms the detail items from search results, which is destinations fitting for a condition in the suitable radius of threshold from the present user position. And the user can look up the suitable final destination on a map easily using the customized information system. The result of this paper, which is based on the sample of the large unit locations, will be expected to be able to guide more detail, extensive and various informations.

• Proceedings of the Korean Society of Community Living Science Conference
• /
• 2009.09a
• /
• pp.105-105
• /
• 2009

농촌 주민의 삶의 질 향상을 위한 범정부적 투자가 이루어져 왔지만 농촌지역의 사회서비스 기준을 도시와 비교해 보면 아직도 부족한 부분이 많이 있다. 농촌 인구가 감소되고 있는 상황에서 지속적인 하드웨어 중심적 투자에 대한 의문제기와 함께 농촌주민들이 최소한의 공적 서비스를 활용할 수 있는 기반이 되어야한다는 의견이 대립되고 있는 가운데 그 해결책을 찾기 위하여 '농촌 서비스 기준'을 설정하자는 논의가 추진되고 있다. 이에 본 연구에서는 도농복합권역으로 370가구 1,650명이 거주하고 있으며 농가는 약 70호, 비농가는 300호이었고 대부분 주민들이 상업에 종사하고 있는 경남 밀양시 하남읍 수산리를 대상으로 농촌 정주지원 서비스 현황 및 요구에 대한 사례분석을 실시하였다. 수산리는 낙동강 나루와 수산장의 역사로 이루어진 마을이다. 70~80년대에는 마을 전체가 시장일 정도로 장이 활성화 되었으나 현재는 전통시장이 붕괴한 상황이었다. 지난 3년간 이주한 가구는 40호, 이주해온 가구는 20호 정도로 매년 인구가 줄고 있는 상황이다. 도로/교통 현황은 밀양시와, 대구, 부산으로 나가는 버스가 시간마다 한 대씩 배차되어 있고, 종합병원, 보건소, 한의원, 약국 등의 의료시설이 갖춰져 있으며, 과거에는 낙동강 범람으로 인한 피해사례가 많았으나 현재는 제방을 쌓아 홍수 피해를 없앴으며, 공기와 식수가 좋고 치안 걱정은 없었으나 전화를 통한 사기가 극성이라고 하였다. 문화/여가생활면에서는 읍사무소에서 일부 프로그램을 진행하고 있으나 참여율이 저조한 것으로 나타났다. 유치원/초등학교/중고등학교 및 사설학원도 있어 교육환경은 비교적 좋은 편이라고 할 수 있었다. 수산리는 마을의 중심에 있는 대규모 장을 둘러싸고 상권이 형성되어 대부분 상업에 종사하고 있었으나 수산장이 쇠퇴하고 상권이 죽어 생활경제면에 어려움이 있다고 하였다. 향후 '4대강 살리기' 정책과 '신공항 입지' 선정에 따른 땅값 상승과 경제 재생 등에 대하여 마을 주민들의 관심이 높았고 복지회관이 생겨 다양한 복지프로그램과 서비스를 받고 싶다고 하였다.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.14 no.11
• /
• pp.1147-1152
• /
• 2004

The objective of this work is to develop a new design method to find optimal coils, especially the optimal coil configuration of an optical pickup actuator. In designing actuator coils, the developed Lorenz force in the coils along the desired direction should be made as large as possible while forces and torques in other directions should be made as small as possible. The design methodology we are developing is a systematic approach that can generate optimal coil configurations for given permanent magnet configurations. To consider the best coil configuration among all feasible coil configurations, we formulate the design problem as a topology optimization of a coil. The present formulation for coil design is noble in the sense that the existing topology optimization is mainly concerned with the design of yokes and permanent magnets and that the optimization of actuator coils is so far limited within shape or size optimization. Though the present design methodology applies to any problem, the specific design example considered is the design of fine-pattern tracking and focusing coils.

• Journal of Life Science
• /
• v.14 no.5
• /
• pp.855-858
• /
• 2004

The experiment was conducted to investigate optimal condition for callus induction and plant regeneration for transformation system of gerbera. Callus induction was more effective in 'white day' then other two cultivar 'Songsongee' and 'Love Song' The optimized plant growth regulators concentration on callus induction, was MS basal medium with NAA 0.1 mg/L＋ TDZ 0.5 mg/L. The optimized plant growth regulators concentration on plant regeneration, which was used MS basal medium was IAA 1.0 mg/L ＋ BA 1.0 mg/L ＋ Zeatin 0.1 mg/L. The optimized petiole age for more effective plant regeneration was 32 days petiole after in vitro subculture and MS basal medium strength was 1/2 MS strength.

• Journal of Digital Contents Society
• /
• v.19 no.9
• /
• pp.1641-1652
• /
• 2018

In this study, a design of emoticons based on sex was studied through Kansai engineering method. First, we developed emoticon prototypes according to a design guideline derived from existing related literatures. Then, the design guidelines was updated from the survey results on the properties of emoticon, and the two sets of modified emoticons were developed from them. Another survey was executed to evaluate the degree of emotional expressions on the three types of emoticons developed in this way. A small number of emoticons were found to be designed fulling the researcher's intention. However, in many other emoticons, it was difficult to find a consistent characteristics. Even though it was observed through detailed analysis that one of the main causes of this result was lack of detail in the design guidelines, the results of this study are expected to be used as basic data for the development and application of character - type emoticons suitable for male and female users' emotional expressions in future researches.

• Journal of Internet Computing and Services
• /
• v.14 no.6
• /
• pp.9-18
• /
• 2013

In this paper, we design and implement an intelligent system for finding objects with RFID(Radio Frequency IDentification) tag in which an mobile robot can do. The system we developed is a learning system of artificial neural network that uses RSSI(Received Signal Strength Indicator) value as input and absolute coordination value as target. Although a passive RFID is used for location estimation, we consider an active RFID for expansion of recognition distance. We design the proposed system and construct the environment for indoor location estimation. The designed system is implemented with software and the result related learning is shown at test bed. We show various experiment results with similar environment of real one from earning data generation to real time location estimation. The accuracy of location estimation is verified by simulating the proposed method with allowable error. We prepare local test bed for indoor experiments and build a mobile robot that can find the objects user want.

• The KIPS Transactions:PartD
• /
• v.12D no.1 s.97
• /
• pp.151-158
• /
• 2005

In order to use the existing map data base in the mobile phone, the dynamic creation technique of the radio map which will be able to be converted into the raster image and transmitted was proposed. We transferred the client module functions such as the coordinate conversion, data compression and decoding to server, and made driving of JAVA browser in the mobile phone which has the restricted resources possible for the dynamic creation of the radio map. We made the radio electronic map service possible without map data base for the mobile phone use only by performing the general work of the map at the sever. And we guaranteed the client waiting time less then the limit time by performing the filtering work of the map at the server also. After we input the keyword at the user interface for searching the region or facility, and verified the performance of the proposed technique by confirming that the raster electronic map usable at the mobile phone was created dynamically.

• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.477-486
• /
• 2003

In combinatorial auctions buyers nay bid for arbitrary combinations of goods. But determining the winners of combinatorial auctions who maximize the profit of a seller is known to be NP-complete. A branch-and-bound method can be one of practical algorithm for winner determination. However, bid selection heuristics play a very important role in the efficiency of a branch-and-bound method. In this paper, we designed and implemented an algorithm which used a branch-and-bound method and Linear Programming for winner determination in combinatorial auctions. We propose new bid selection heuristics which consider a branching bid and conflicting bids simultaneously to select a branching bid in the algorithm. In addition, upper bounds are reused to reduce the running time in specific cases. We evaluated the performance of the algorithm by experiments with five data distributions and compared our method with others. The algorithm using heuristics showed a superior efficiency in two data distributions and a similar efficiency in three distributions.