• Journal of the Korean Society of Clothing and Textiles
• /
• v.25 no.9
• /
• pp.1633-1644
• /
• 2001

이 연구의 목적은 중년여성들의 체형을 분류하고 이들 체형을 분류하는 판별기준을 세우고자 하는 것이다. 이 연구에서 개발한 판별방법은 중년여성들의 체형을 간편하게 판별할 수 있도록 해주므로 이 방법을 활용하여 중년여성복을 제작할 경우, 소비자들은 인체적합도가 높은 의복을 구입 할 수 있고 의류업 체들은 이에 따른 매출증대를 가져올 수 있다. 연구의 진행절차와 이에 따른 결과는 다음과 같다. 1. 만 40세~59세 중년여성 279명에 대 한 인체 계측을 하였다. 인체 계측항목은 34개의 직접 계측항목과 측면사진 촬영을 통한 3개의 간접계측항목,11개의 지수치, 5개의 계산치 등의 총 53개 항목이다. 인체 계측치에 대한 통계분석 방법으로는 분산분석과 SNK검정, 판별분석 방법을 사용하였다. 2. 피험자는 몇 가지 체형으로 분류되었다. 상반신 체형분류는 인체측면 자세와 유방크기를 분류기준으로 하여 바른-유방중소 체형, 바른-유방대 체형, 젖힌-유방중소 체형 , 숙인/휜-유방중소 체형, 숙인/휜-유방대 체형의 5가지로 분류하였다. 하반신 체형분류는 배와 엉덩이의 돌출정도에 따라 분류하여 배정상-엉덩이정상 체형, 배 정상-엉덩이돌출 체형, 배돌출-엉덩이정상 체형 , 배돌출-엉덩이돌출 체형의 4가지로 분류하였다. 3. 분류된 체형은 다음의 판별변수에 따라 체형이 판별되었다. 상반신 체 형 의 판별변수는 앞품/뒤품, 가슴둘레/밑가슴둘레 , 앞길이/뒤 길이, 앞허리선$\longrightarrow$어깨선 길이/어깨선$\longrightarrow$뒤허 리선 길이의 4가지 항목이고, 하반신 판별변수는 엉덩이상부각도, 배 하부각도, 배상부 각도, 엉덩이둘레/엉덩이 최대둘레, 뒤엉덩이둘레의 5가지 항목이다. 상반신 체 형과 하반신 체형 판별함수 모두 70% 이상의 높은 적중률을 나타내었다.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.12
• /
• pp.3964-3975
• /
• 2000

There are two policies for maintaining consistency among the multiple processor caches in a multiprocessor system: Write invalidate and Write update. In the write invalidate policy, whenever a processor attempt to write its cached block, it has to invalidate all the same copies of the updated block in the system. As a results of this frequent invalidations, this policy results in high cache miss ratio. On the other hand, the write update policy renew them, instead of invalidating all the same copies. This policy has to transfer the updated contents through interconnection network, whether the updated block is ptivate or not. Therefore the network suffer from heavy transaction traffic. In this paper we present an efficient cache coherence protocol for shared memory multiprocessor system connected by slotted ring. This protocol is based on the write update policy, but the updated contents are transferred only in case of updating the shared block. Otherwise, if the updated block is private, the updated contents are not transferred. We analyze the proposed protocol and enforce simulation to compare it with previous version.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.26 no.2
• /
• pp.405-413
• /
• 2016

In this paper, we propose a proactive inference method of finding suspicious domains. Our method detects potential malicious domains from the seed domain information extracted from the TLD Zone files and WHOIS information. The inference process follows the three steps: searching the candidate domains, machine learning, and generating a suspicious domain pool. In the first step, we search the TLD Zone files and build a candidate domain set which has the same name server information with the seed domain. The next step clusters the candidate domains by the similarity of the WHOIS information. The final step in the inference process finds the seed domain's cluster, and make the cluster as a suspicious domain set. In experiments, we used .COM and .NET TLD Zone files, and tested 10 seed domains selected by our analysts. The experimental results show that our proposed method finds 55 suspicious domains and 52 true positives. F1 scores 0.91, and precision is 0.95 We hope our proposal will contribute to the further proactive malicious domain blacklisting research.

• Journal of Korean Medical classics
• /
• v.18 no.1 s.28
• /
• pp.121-136
• /
• 2005

통적연구진사탁적장부오행병리급잡병오행병리적운용연구(通適硏究陳士鐸的臟腑五行病理及雜病五行病理的運用硏究), 득출이하결론(得出以下結論) : 진사탁인위진관폐금극간목(陳士鐸認爲盡管肺金克肝木), 단시약간중지화왕성(但是若肝中之火旺盛), 칙폐무법극간차치간화극토사장토수손(則肺無法克肝且致肝火克土使將土受損), 종이사비위무법생금이치폐금갱가쇠약(從而使脾胃無法生金而致肺金更加衰弱), 폐불능생수이수무법극화(肺不能生水而水無法克火), 도치상중하삼초지화균과왕(導致上中下三焦之火均過旺). 타인위간희소설(他認爲肝喜疏泄), 당약울체회사기극비위(?若鬱滯會使其克脾胃), 비위수극칙토극수(脾胃受克則土克水), 이신수손무법생목(而腎受損無法生木), 사간울갱심심화무법화생(使肝鬱更甚心火無法化生), 차폐역무법극목(且肺亦無法克木). 차시(此時), 응이해울법내치료(應以解鬱法來治療). 타인위수연토극수(他認爲雖然土克水), 단시토생수여금생수적관계갱위밀절(但是土生水與金生水的關係更爲密切), 이폐여신우위밀절차유상생적관계(而肺與腎尤爲密切且有相生的關係), 고지유신중지수충족(故只有腎中之水充足), 방가수화기제(方可水火旣濟). 타인위심위군화시유형지화(他認爲心爲君火是有形之火), 가용수극지(可用水克之), 이신중지화위무형지화(而腎中之火爲無形之火), 차가양수(且可養水). 타인위명문지화가생비토(他認爲命門之火可生脾土), 단약과왕칙무법생비토반이극토(但若過旺則無法生脾土反而克土). 차시(此時), 여기직접보신수(與其直接補腎水), 불여보폐금사금생수(不如補肺金使金生水), 차위보수적근본지법(此爲補水的根本之法). 진사탁재설명오장적병리기제시인위(陳士鐸在說明五臟的病理機制時認爲), 오장지화과왕칙회사상생관계변성상극관계(五臟之火過旺則會使相生關係變成相克關係), 이적의적화칙능유지정상적상생관계(而適宜的火則能維持正常的相生關係), 차즉사화불족역가유지상생(且卽使火不足亦可維持相生). 진사탁인위제료외감(陳士鐸認爲除了外感), 기호소유적잡병도이장부오행적상생(幾乎所有的雜病都以臟腑五行的相生), 상극(相克), 이급상관적관계위중심내설명료기병리(以及相關的關係爲中心來說明了其病理), 저일점성위료기학술사상적중요특점(這一點成爲了其學術思想的重要特點).

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.5
• /
• pp.529-539
• /
• 2000

This paper proposes a prefetch-based disk buffer management algorithm, which we call W2R (Veighingjwaiting Room). Instead of using elaborate prefetching schemes to decide which blockto prefetch and when, we simply follow the LRU-OBL (One Block Lookahead) approach and prefetchthe logical next block along with the block that is being referenced. The basic difference is that theW2R algorithm logically partitions the buffer into two rooms, namely, the Weighing Room and theWaiting Room. The referenced, hence fetched block is placed in the Weighing Room, while theprefetched logical next block is placed in the Waiting Room. By so doing, we alleviate some inherentdeficiencies of blindly prefetching the logical next block of a referenced block. Specifically, a prefetchedblock that is never used may replace a possibly valuable block and a prefetched block, thoughreferenced in the future, may replace a block that is used earlier than itself. We show through tracedriven simulation that for the workloads and the environments considered the W2R algorithm improvesthe hit rate by a maximum of 23.19 percentage points compared to the 2Q algorithm and a maximumof 10,25 percentage feints compared to the LRU-OBL algorithm.

• Journal of Korean Ophthalmic Optics Society
• /
• v.13 no.1
• /
• pp.43-48
• /
• 2008

Purpose: This study is to evaluate reliability of geometrical optics properties of spectacle lenses by using ISO and the medical instrument standard of KFDA, which are being sold in Korea. Methods: We used samples of three hundred and ninety eight spectacle lenses of eight company in total. Refractive indices of each samples which were used in experiment were classified into three groups of medium index (1.55~1.56), high index (1.60~1.61) and extra high index (1.67). Results: Conformity of refractive power was 81.61% in total spectacle lenses. The results showed that thickness conformity 90%, appearance conformity 85.18%, size conformity 96.23% and optical center point conformity 99.50% in total. Conclusions: We found that they deviated from the permitting value in many spectacle lenses on refractive power. The results of errors on prism power, surface inspection and optical center point showed small values in total products. In experiment of lens size and thickness, the bulk of indication rates and conformities of samples deviated from the permitting errors.

• Journal of KIISE:Computer Systems and Theory
• /
• v.37 no.4
• /
• pp.215-225
• /
• 2010

The NAND flash memory based SSDs are considered to replace the existing HDDs. To maximize the I/O performance, SSD is composed of several NAND flash memories in parallel. However, to adopt the hybrid mapping scheme in SSD may cause degradation of the I/O performance. In this paper, we propose a new mapping scheme for the SSD called WADPM. WADPM loads only necessary mapping information into RAM and dynamically adjusts the size of mapping information in the RAM. So, WADPM avoids the shortcoming of page-level mapping scheme that requires too large mapping table. Performance evaluation using simulations shows that I/O performance of WADPM is 3.5 times better than the hybrid-mapping scheme and maximum size of mapping table of WADPM is about 50% in comparison with the page-level mapping scheme.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.10
• /
• pp.2686-2703
• /
• 1998

The widening pClformnnce gap between processor and memory causes an emergence of the promising architecture, processor-memory (PM) integration In this paper, various design issues for P-M integration are studied, First, an analytical model of the DRAM access time is constructed considering both the bank conflict ratio and the DRAM page hit ratio. Then the points of both the performance improvement and the perfonnance bottle neck are found by the proposed model as designing on-chip DRAM architectures. This paper proposes the new architecture, called the delayed precharge bank architecture, to improve the perfonnance of memory system as increasing the DRAM page hit ratio. This paper also adapts an efficient bank interleaving mechanism to the proposed architecture. This architecture is verified !II he better than the hierarchical multi-bank architecture as well as the conventional bank architecture by executiun driven simulation. Eight SPEC95 benchmarks are used for simulation as changing parameters for the cache architecture, the number of DRAM banks, and the delayed time quantum.

• The Journal of Society for e-Business Studies
• /
• v.13 no.4
• /
• pp.173-191
• /
• 2008

As volumes of electronic commerce increase rapidly, customers are faced with information overload, and it becomes difficult for them to find necessary information and select what they need. In this situation, recommender systems can help the customers search and select the products and services they need more conveniently. These days, the recommender systems play important roles in customer relationship management. In this research, we develop a recommender system that recommends the books to the customers of Internet bookstore. In previous researches on recommender systems, collaborative filtering technique has been often employed. For the collaborative filtering technique to be used, the rating scores on books given by previous purchasers have to be collected. However, the collection of rating scores is not an easy task in reality. Therefore, in this research, we employed case-based reasoning technique that can work only with the book purchase history of customers. The accuracy of recommendation of the resulting book recommender system was about 40% on the level 3 classification code.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.10
• /
• pp.113-120
• /
• 2010

Video proxy server which is located near clients can store the frequently requested video data in storage space in order to minimize initial latency and network traffic significantly. However, due to the limited storage space in video proxy server, an appropriate video selection method is needed to store the videos which are frequently requested by users. Thus, we present a time constraint multiple access technique to efficiently store the video in video proxy server. If the video is requested by user, it is temporarily stored during the predefined interval and then, delivered to the user. A video which is stored is deleted or moved into the storage space of video proxy server depending on the request condition. In addition, we propose a video deletion method in video proxy server for newly stored video data. The simulation results show that the proposed method performs better than other methods in terms of the block hit rate and the number of block deletion.