http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
유원경,정을윤,Yu, Won-Gyeong,Jeong, Eul-Yun 한국정보처리학회 1995 정보처리논문지 Vol.2 No.6
대부분의 데이타베이스 시스템에서, 이미지는 캡션(caption), 주석(annotation), 속성(attribute)과 같이 그 이미지와 관련된 텍스트를 이용하여 간접적으로 인덱스 되었다. 그러나, 이미지에 포함된 정보를 직접적으로 사용하여 내용에 기반한 이미 지의 저장과 검색을 지원하는 이미지 데이타베이스 시스템의 요구가 점점 증가하고 있다. 내용에 기반한 몇몇 인덱싱 방법들이 있는데 그중에서 Petrakis는 이미지를 구성하는 오브젝트들의 공간관계와 속성을 고려한 이미지 인덱싱 방법을 제안했다. 이것은'2-D string'에 기반한 인덱싱 연구의 확장인데. 이 방법은 많은 저장공간을 필요로 하며 융통성이 부족하다. 본 논문은 페이징 기법을 사용하는 kd-trr를 이용한 인덱스 화일구조를 제안한다. 그리고 정규화 과정을 사용해서 실제 이미지로부터 키를 추출하는 예를 보이고 시뮬레이션을 통해 비교하였다. 실험 결과는 제안된 방법이 훨씬 적은 저장공간을 요구하고, 융통성면에서 개선이 되었음을 보여준다. In most database systems images have been indexed indirectly using related texts such as captions, annotations and image attributes. But there has been an increasing requirement for the image database system supporting the storage and retrieval of images directly by content using the information contained in the images. There has been a few indexing methods based on contents. Among them, Pertains proposed an image indexing method considering spatial relationships and properties of objects forming the images. This is the expansion of the other studies based on '2-D string. But this method needs too much storage space and lacks flexibility. In this paper, we propose a more flexible index structure based on kd-tree using paging techniques. We show an example of extracting keys using normalization from the from the raw image. Simulation results show that our method improves in flexibility and needs much less storage space.
다중매체 데이터베이스 시스템에서 효과적인 데이터 검색에 관한 연구
유원경 성신여자대학교기초과학연구소 1998 基礎科學硏究誌 Vol.16 No.-
The data in multimedia database systems are usually large and variable in size and the contents of the media data are binary in nature. So data have been indexed indirectly using related texts such as captions and annotations. But there has been an increasing requirement for accessing the data by content using the information contained in the data. The compressed representations of the data objects are usually called features. In this paper, we propose a method to handle approximate searching by applying the similarity measure to the features based on properties of objects contained in images and on relationships between objects. The images are mapped to points in a mulitidimensional space and are indexed using R*-tree. We implemented this method and perform experiments on a synthetic data base.
큐잉 네트워크 모델을 이용한 결함 허용 실시간 시스템의 성능분석
유원경 성신여자대학교 기초과학연구소 1991 基礎科學硏究誌 Vol.8 No.-
이 논문은 fault-tolerant multiprocessor system의 성능을 분석하기 위해서 fault tolerant scheme의 하나 DRB(distributed recovery block) 수행의 영향을 Queueing Network Model을 적용하여 분석하였다. ??RB 방식을 사용하는 radar 제어 시스템을 예로 하여, 그 성능을 각 processor의 utilization과 반응지연시간(대기시간)을 인자로 하여 구하고, 그 결과를 simulation의 경우와 비교하여 보았다. This paper analyze the execution overhead of DRB(distributed Recovery Block) execution. Multiprocessor systems capable of execution of DRB components are considered and a queueing network model of such systems is adopted. The example experiment model is a radar control system. To measure the impact of the recovery mechanism, utilization of the processors and the waiting time lays are considered, and the results are compared to the simulation.
유원경 성신여자대학교기초과학연구소 1988 基礎科學硏究誌 Vol.5 No.-
분산데이타베이스시스템에서 질의어를 처리하는 경우에는 그것을 구현하는 방법에 따라 시간이나 비용면에서 많은 차이가 있다. 질의어를 처리하는 비용은 여러가지 요인에 영향을 받을 수 있는데 그 요인에 따른 질의처리의 최적화에 관한 알고리즘들을 고찰·비교하였다. The distributed query processing costs can vary over the several implementation approaches. There are several factors which influence the costs. The purpose of this paper is to briefly survey and compare the several query optimization algorithms in distributed database systems.
유원경 성신여자대학교기초과학연구소 2000 基礎科學硏究誌 Vol.18 No.-
With an explosion in the availability of electronic information, the size of information collections is growing rapidly. Most information in the modern world is text based; textual information retrieval is the most prevalent form of information retrieval (IR). The aim of an IR system (IRS) is to organize and sotre the information, and retrieve the useful information when a user poses a query to the system. Given a large collection of articles such as documents, information items, etc., keywords (usually word sna dphrases) are matched between a query and the articles to predict the potential usefulness of the articles for fulfilling the user's information nee. Search engines based on information retrieval techniques have become an integral part of the web. The field of IR strives ot enhance the search effectiveness of such systems. To find all the relevant information with desirable precision in short time, wer need efficient indexing structures, and query processing methods which are the advantages of database management systems (DBMS). Yet, there are few DBMS systems which can answer the similarity queries. So we integrate IRS and DBMS for dealing with uncertainty and a need for data models which can cope with uncertainty. One of the models suggested by many authors is Probabilistic models based on the probabilistic relational algebra. In this paper, we implemented the operations based on probabilistic relational algebra using Oracle RDBMS on Unix.
데이타베이스 : 내용에 기반한 이미지 인덱싱 방법에 관한 연구
유원경(Yoo Weon Kyung),정을윤(Chung Eul Yun) 한국정보처리학회 1995 정보처리학회논문지 Vol.2 No.6
In most database systems, images have been indexed indirectly using related texts such as captions, annotations and image attributes. But there has been an increasing requirement for the image database system supporting the storage and retrieval of images directly by content using the information contained in the images. There has been a few indexing methods based on contents. Among them, Petrakis proposed an image indexing method considering spatial relationships and properties of objects forming the images. This is the expansion of the other studies based on ''2-D string''. But this method needs too much storage space and lacks flexibility. In this pager, we propose a more flexible index structure based on kd-tree using paging techniques. We show an example of extracting keys using normalization from the raw image. Simulation results show that our method improves in flexibility and needs much less storage space.
Wedge 형상을 가지는 덕트의 입구유동 조건변화에 따른 열전달 특성에 대한 연구
유원경(Won Kyung Yoo),양장식(Jang Sik Yang),손창민(Chang Min Son),이성한(Sung Han Lee),안대현(Ahn Dai Hyun),황계하(Kye Ha Hwang),김성하(Sung Ha Kim) 대한기계학회 2014 대한기계학회 춘추학술대회 Vol.2014 No.11
This paper studies the effect of inlet cross flow on the heat transfer in narrow radial ducts with the aspect ratio of 12. Total three geometries, one smooth, two wedged ducts, are modeled for analytical studies. Reynolds number is varied in the range from 13100 to 21000. Ratio of the mass flow rate of main flow and cross flow is maintained to 0.5. Heat transfer characteristics of cross flow are compared to those of no cross flow. Normal-inflow (without cross flow) case results show that area-averaged Nu number of smooth duct is highest. Nu number of Wedge 1 duct is 5% lower than smooth duct and Wedge 2 duct is 21% lower than smooth duct. Cross flow case result also show that area-averaged Nu number of smooth duct is highest. Nu number of Wedge 1 duct is 2% lower than smooth duct and Wedge 2 duct is 18% lower than smooth duct. Cross flow case of smooth duct Nu number is decreased 11% than normal inflow case result, Wedge 1 duct is decreased 8% and Wedge 2 duct is decreased 7%.