대용량 텍스트 데이터베이스를 위한 효율적인 2단계 합성 요약 화일 방법

유재수(Yoo Jae Soo),강형일(Kang Hyung Il) 한국정보처리학회 1997 정보처리학회논문지 Vol.4 No.4

In this paper, we propose a two-level hybrid signature file method(THM) to efficiently deal with large text database that use a term discrimination concept. In addition, we apply Yoo's clustering scheme to the two-level hybrid signature file method. The clustering scheme groups similar signatures together according to the similarity of the highly discriminatory terms so that we may achieve better performance on retrieval. The space-time analytical model of the proposed two-level hybrid method is provided. Based on the analytical model and experiments, we compare it with the existing methods, i.e., the bit-sliced method(BM), the two-level method(TM), and the hybrid method(HM). As a result, we show that THM achieves the best retrieval performance in a large database with 100,000 records when the number of matching records is less than 160.

유자액을 이용한 소스의 이화학적 특성 및 저장성

유경미,서우영,서한석,김완수,박재복,황인경 한국조리과학회 2004 한국식품조리과학회지 Vol.20 No.4

The purposes of this study were to investigate the physicochemical characteristics and storage stabilities of various sauces with added Yuza(Citrus Junos). Yuza consisted of three parts: peeled (46.17%), fleshed (43.74%) and seeded (10.09%). Yuza juice revealed 11.33% extraction yield, pH 2.85, 4.18% total acidity, 11° Brix, 1.16% transmittance and 2.63° Brix/acid ratio. Five kinds of sauces with added Yuza juice were Yuza red pepper paste sauce, Yuza soybean sauce for meat, Shahu shabu Yuza sauce, Korean Yuza vegetable sauce and Japanese Yuza soybean sauce. These sauces showed slight changes in pH, total acidity, total bacterial counts and overall sensory characteristics during storage period (60 days). In conclusion, Yuza juice could be applied to various sauces, which remained usable for 60 days.

ATM망 트래픽 제어 알고리즘 연구

유진호,손준영,안재환,박성우,김명수,장혁수 明知大學校 産業技術硏究所 1996 産業技術硏究所論文集 Vol.15 No.-

ATM(Asynchronous Transfer Mode) is a transmission technique for the B-lSDN(Broadband Integrated Service Digital Network). Congestion problems are unavoidable in the ATM networks, since various traffic typos coexist in the networks. The preventive congestion control algorithm is widely used for the real time traffics such as voice and video. The reactive congestion control algorithm works well for the non-real time traffic within a short distance. A mixed traffic control algorithm is proposed, which works either preventively or reactively based on traffic types. The proposed algorithm sets a high and low threshold value at the output buffers and modifies the EPRCA(Enhanced Proportion Rate Control Algorithm) to control loss-sensitive cells. Delay-sensitive cells are handled by the priority control and the UPC(Usage Parameter Control) algorithm. The performance analysis shows that the proposed traffic control algorithm works well for both the VBR(Variab1e Bit Rate) and ABR(Available Bit Rate) traffic with small buffers

여중생의 체육수업 기피요인 분석

유창재,김영수,김수덕 신라대학교 교육과학연구소 2004 교육과학연구 Vol.- No.9

혼화재 종류 및 친환율에 따른 콘크리트의 염소이온 침투저항성 평가에 관한 연구

유재강,김동석,이상수 대한건축학회 2003 대한건축학회 학술발표대회 논문집 - 계획계/구조계 Vol.23 No.1(구조계)

This research was to investigate the invasion and diffusion properties of chloride ion on the concrete containing mineral admixtures. Mineral admixtures contained in mixes were fly-ash, ground granulated blast-furnace slag, silica fume, and meta-kaolin. For the Rapid Chloride Penetration Test(RCPT), Tang and Nilsson's test method was used to estimate chloride ion diffusion coefficients of that mixes. And the RCPT test results were compared with the penetration depth measured from long-term ponding test with 3.6% sodium chloride solution. As a result, the diffusion coefficient of chloride ion were reduced with the use of mineral admixtures and the compressive strength was related with the diffusion coefficient of chloride ion. The diffusion coefficients from the RCPT and the penetration depth at 91 days of ponding test with the sodium chloride solution have a well established.

주의력결핍과잉행동장애와 Alpha-1C-Adrenergic 수용체 유전자와의 연관성에 대한 연구

조수철,김재원,김붕년,황준원,박미라,김순애,조대연,유희정,정운선,손정우,박태원 大韓神經精神醫學會 2008 신경정신의학 Vol.47 No.1

Objectives : Neurobiological and pharmacological research has suggested that the dysregulation of the central noradrenergic systems might be involved in the pathophysiology of ADHD. The aim of this study was to examine the association of the alpha-1C-adrenergic receptor gene (ADRA1C) with ADHD in Korean subjects. Methods : In a case-control study, we assessed 186 DSM-IV ADHD probands and 150 normal controls. One hundred and eight trios were studied in a family-based association analysis. Psychiatric diagnoses were derived through structured diagnostic interviews. For the clinical evaluation of the ADHD subjects, the Child Behavior Checklist (CBCL), the ADHD Rating Scale-IV (ARS) and the Junior Temperament and Character Inventory (JTCI) were administered. A computerized continuous performance test (CPT) was used to measure the inattention and impulsivity of the ADHD children. Results : There were no significant differences in the genotype or allele frequencies of the ADRA1C PstI polymorphism between the ADHD and control group (p>0.05). The transmission disequilibrium test (TDT) analysis observed no evidence for biased transmission of any of the alleles of the PstI polymorphism. There were no significant differences in the CPT or JTCI profiles between those ADHD subjects with the CC genotype and those with the other (CT+TT) genotypes at the PstI polymorphism. Conclusion : The results of this study do not support the ADRA1C as a major genetic susceptibility factor in ADHD.

최적유동을 위한 수조 내 팬의 위치에 관한 연구

박성수,도영민,유재환 한국산업안전학회 2002 한국안전학회지 Vol.17 No.3

In this numerical study, characteristics of swirl generation by the fan and selection of the location of the fan was studied theoretically by the modified TEACH code. The governing equation for the system are solved by means of the three dimensional version of the SIMPLE method and STAGGERED grid. From the present results, the optimal position of the fan is 0.625(h/H).

농촌지역 초등학교 유휴시설의 활용방안에 관한 연구 : 해남군 초등학교를 중심으로 Focused on the Elementary School in Hae-Nam

오재섭,이봉수,박향용,유창균,조용준 朝鮮大學校 建設技術硏究所 1998 建設技術硏究 Vol.18 No.2

Recently, number of elementary school students in the rural area have decreased due to move of population to the diminishment of birth population, the generation of idle facilities and even the trend of abolition of school presented problems. This paper was a study of the use plans and generation pattern of idle facilities in present school. And the targeted schools of this study were elementary schools located at Hae-Nam Province in Chun-Nam. The results are as follows : 1) While the number of the elementary school is continuosuly decreased up to now since 1980, the number of branch schools and closed schools is increasing and while general class is decreased continuously, multiple classes are increasing and so the utilization of idle facilities will be continued. 2) The utilization of idle facilities is most frequent in the use of school curriculm(67%), followed by the use of club activities and welfare facilities, but the use by residents is minimum. In the problems in using idle facilities, the lack of finance is most(68%), followed by the lack of illustrative data and technical problems and in the effects of using idle facilities, extra curriculum activities are best and followed by the use of local community and school curriculum. 3) In the most required facilities in using idle facilities, gymnasium and service area are highest and followed by laboratory, learning data room and library and in the common facilities with local residents, swimming pool is most frequent and followed by library.

고차원 색인 구조를 위한 효율적인 벌크 로딩 알고리즘

복경수,이석희,유재수,조기형 충북대학교 컴퓨터 정보통신 연구소 2000 컴퓨터정보통신연구 Vol.8 No.1

고차원 색인 구조를 위한 기존의 벌크 로딩 알고리즘은 색인 구성 시간과 검색 성능 모두를 향상시키지 못하는 문제점을 갖는다. 이 논문은 이와 같은 문제점을 해결한 대량의 고차원 데이터에 대한 색인 구조를 위한 새로운 벌크 로딩 알고리즘을 제안한다. 제안하는 알고리즘은 색인을 구성하는 시간을 단축시키기 위해 전체 데이터 집합을 정렬하는 것이 아니라 데이터의 특성을 파악하여 피벗값에 따라 분할하는 기법을 이용한다. 또한 검색 성능을 향상 시키기 위해 데이터들의 분포 특성에 따라 분할 위치를 선택한다. 제안하는 알고리즘에 대한 우수성을 입증하기 위해 실험을 통해 기존에 제안된 알고리즘과 색인 구성 시간 및 검색 성능을 비교한다. Existing bulk loading algorithms for high-dimensional index structures suffer from improving both index construction time and retrieval performance. In this paper, we propose an efficient bulk loading algorithm to construct high dimensional index structures for large data set that overcomes the problem. Although several bulk loading algorithms have been proposed for this purpose, none of them improve both construction time and search performance. To improve the construction time, we don't sort whole data set and use bisection algorithm that divides the whole data set or a subset into two partitions according to the specific pivot value. Also, we improve the search performance by selecting split positions according to the distribution properties of the data set. In order to show superiority of the proposed algorithm, we compare it with existing algorithms in terms of search time and construction time through experiments.

고차원 색인 구조를 위한 벌크 삽입

복경수,송석일,유재수 충북대학교 컴퓨터정보통신 연구소 2001 컴퓨터정보통신연구 Vol.9 No.1

최근 고차원 데이터를 위한 다양한 색인 구조에 대한 연구가 진행되어 왔다. 지리정보 시스템, 내용기반 이미지 검색 등과 같은 응용분야에서는 일반적으로 색인 구성 후 추가적으로 발생하는 데이터 역시 대량으로 삽입되는 경우가 빈번하다. 대량의 데이터를 하나씩 삽입하게 되면 삽입하기 위해 소요되는 시간과 검색 성능의 저하를 발생시킨다. 이러한 문제점을 해결하고자 다양한 벌크 삽입 기법들이 제시되었다. 벌크 삽입의 목적은 삽입 시간을 단축시키고 검색 성능을 향상시키는 것이다. 그러나 기존의 벌크 삽입 기법들은 한쪽에 군집된 데이터만을 고려하거나 또는 기존의 색인 구조에 존재하는 MBR을 고려하지 않고 있다. 본 논문에서는 일반적인 경우에도 좋은 검색 성능을 보장하고 데이터의 삽입으로 MBR들간의 겹침을 최소화하기 위한 새로운 벌크 삽입 알고리즘을 제안한다. Recently, various high-dimensional index structures have been proposed. Generally, in the applications such as geographic information System, content-based image retrieval and so on, large amount of data are presented to be inserted into existing index structures. Inserting each data item one bye one is very inefficient in terms of insertion time and query performance. In that reason various bulk insertion techniques are proposed to solve the problem. The purpose of bulk insertion speeds up insertion time and improves query performance. However the existing methods perform only for highly skewed data and do not consider existing MBRs of index structures when data objects are inserted. In this paper, we design a bulk insertion algorithm that performs well for general case and minimizes overlap between newly inserted objects and existing MBRs.