• Journal of the Korean Society of Clothing and Textiles
• /
• v.34 no.5
• /
• pp.819-830
• /
• 2010

This study proposes medical gowns for interns and residents that address the functions of utility and activity. Based on the questionnaires, the prototype focused on the pockets for practical use and movement adaptability. Functional pockets were made by increasing pocket sizes and separating pockets with sections according to use. An inside pocket and a loop for an identification tag was placed on the chest pocket and the side seam pocket were oblique lined. To resolve horizontal stress on the back of the gown,6 cm action pleats were added at both ends of the bladebone. The elbow area was tucked up to improve the workplace activities. To reduce hamper on the gown hemline, slits were added along the gown side seam. The front button was changed into an inside button closure. The cuffs, belt, and back waist belt were removed due to occupational cases of inconvenience. The length of the sleeves was adjusted with belts to improve the movement of the arms. In accordance with design preference, the gown was designed to be knee-length with wrist length sleeves. Blue colored (2.5PB 3/12: by Munsell) material was inserted to reduce the contamination on the neck, cuffs, front closure, and hemline area. The planning cloth of the experimental gown was designed to improve activity function, cleaning, and comfort from light materials. The field test (with 30 doctors at university hospitals and the objective assessment with 9 subject groups)were done by the valuation between the existing gown and the prototype. The results showed that the prototype had to be modified by decreasing the pocket size, expanding the usage of the penholder, and simplify front pockets in order to maintain unity. The loop for the identification tag, inside pocket, and the blue colored material had to be removed. The front closure of the gown had to return to its original state.

• Journal of the Korean Home Economics Association
• /
• v.44 no.7 s.221
• /
• pp.63-72
• /
• 2006

The purpose of this study was to survey the wearing practices and problems in the working uniform for volunteer fire brigade members and then to develop its design with a improved movement adaptability, physical suitability, ease for equipment accommodation, functionality, convenience and fit. Based on the questionnaire, we have made a testing uniform for volunteer fire brigade members first. Through a subjective analysis for functionality and apparence, we suggested a final design. The final design includes the following elements: 1. It was a two-piece style composed of a jumper and trousers with the upper garments pulled out. Raglan sleeves were used to increase arm's movement scope. Pleats and velcro tapes were attached along the base hem of sleeves to prevent heat transmission. 2. Various types of pockets were attached to secure enough space for keeping things. 3. In trousers, spare space was given at the buttock area with rubber string inserted only at selected part of side lines, and knee pads were attached to prevent wearing out.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.10
• /
• pp.52-63
• /
• 1998

In this paper, several improvements to a copy network proposed previously for multicast packet switching are described. The improvements provide a solution to some problems inherent in multicasting. The input fairness problem caused by overf low is solved by a dynamic starting point decider(DSD), which can calculate running sums of copy requests starting from any input port. The starting point is changed adaptively in every time slot based on both the fill level of the input buffers in current time slot and the overflow situations of the previous time slot. Using the fill level of the conventional network. The DSD also provides the function of regulating overall copy requests according to the amount of input traffics. This is an essential function in improving overall throughputs of the copy networks. The throughput of a multicast switch can be improved substantially if partial service of copy request is implemented when overflow occurs. Call-splitting can also be implemented by the DSD in a straightforward manner. The hardware for the DSD is derived with the objective of simple architectures for the high speed operation. Simulation study of the copy network under various traffic conditions is presented to evaluate its performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.3
• /
• pp.580-585
• /
• 2009

Real Time Locating Systems (RTLS) are used to track and identify the location of objects in real time using simple, inexpensive tags attached to or embedded in objects and readers that receive the wireless signals from these tags to determine their locations. A tag is powered an internal source such as a battery. The blink frequency of a tag affects the energy efficiency and the locating accuracy of RTLS. The mobility of a tag also affects the locating accuracy. In this paper, we introduce a RTLS tag design which improves the locating accuracy and the power efficiency. We propose an adaptive transmission-rate control algorithm using a motion sensor. By analyzing the signal pattern of the motion sensor, we can build a model to estimate the speed of the motion. Using this model, our algorithm can achieve better locating accuracy and lower power consumption than those of the conventional method. In our experiments, the number of transmission reduced as 40%, keeping similar locating accuracy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.93-98
• /
• 2024

With the rapid advance in AI (artificial intelligence) and high-performance computing technologies, deep learning is being used in various fields. Deep learning proceeds training by randomly reading a large amount of data and repeats this process. A large number of files are randomly repeatedly referenced during deep learning, which shows different access characteristics from traditional workloads with temporal locality. In order to cope with the difficulty in caching caused by deep learning, we propose a new sampling method that aims at reducing the randomness of dataset reading and adaptively operating on existing buffer cache algorithms. We show that the proposed policy reduces the miss rate of the buffer cache by 16% on average and up to 33% compared to the existing method, and improves the execution time by up to 24%.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.2383-2386
• /
• 2002

많은 ISP업체와 서버 관리자들은 자신의 시스템 향상을 위하여 많을 비용을 쏟아 붇고 있지만 그 결과는 비관적이다. 지금까지는 하드웨어적인 성능만을 고려하였으나, 최근에는 리눅스를 탑재하여 낮은 가격과 높은 가용성을 가지면서, 증가하는 네트워크 요청에 효과적으로 대응하기 위한 해결책으로 여러 대의 호스트로 구성되는 클러스터링 기술이 각광을 받고 있다. 또한 클러스터는 저렴한 호스트들로 구성되므로 구축 비용이 절감되는것 뿐만 아니라, 일부 호스트가 고장 나더라도 다른 호스트는 네트워크 작업 분담을 재설정하여 정상적으로 동작함으로 가용성이 항상 유지될 수 있다는 것을 보여준다. 최근 군에서도 정보화 과학화의 열풍에 힘입어 그 어느때보다도 업무의 전산화, 정보화에 박차를 가하고 있는 실정이다. 이로 인한 군업무에 적용되는 중대형 서버의 증가와 1인 1PC정책에 의한 클라이언트의 증가, 네트웍 인프라 구축에 심혈을 기울이고 있다. 그러나 사용자의 요구만큼 군환 경하에서의 정보화 업무를 감당하는 서버의 역량은 제한이 있다. 군업무의 특수성에 비추어 볼때에도 사회의 금융업무와 마찬가지로 중단없는 서비스의 수행과 서버의 안정화는 군전산의 가장 중요한 요소중의 하나임에 불구하고 아직까지도 현실성은 많이 미비한 상태이다. 본 연구는 이와 같은 문제를 해결하기 위하여 NAS와 SAN개념(네트웍기반)을 도입하여 군 서버 구축 새로운 패러다임을 제공하여 업무의 통폐합과 함께 서버의 통폐합의 전초단계인 무정지 클러스터링 서버의 구축방안을 제시하여 군정보화, 과학화의 초석을 다지는 계기로 삼고자 한다.위상변화에 대한 적응성을 높일 수 있도록 한다. SQL Server 2000 그리고 LSF를 이용하였다. 그리고 구현 환경과 구성요소에 대한 수행 화면을 보였다.ool)을 사용하더라도 단순 다중 쓰레드 모델보다 더 많은 수의 클라이언트를 수용할 수 있는 장점이 있다. 이러한 결과를 바탕으로 본 연구팀에서 수행중인 MoIM-Messge서버의 네트워크 모듈로 다중 쓰레드 소켓폴링 모델을 적용하였다.n rate compared with conventional face recognition algorithms. 아니라 실내에서도 발생하고 있었다. 정량한 8개 화합물 각각과 총 휘발성 유기화합물의 스피어만 상관계수는 벤젠을 제외하고는 모두 유의하였다. 이중 톨루엔과 크실렌은 총 휘발성 유기화합물과 좋은 상관성 (톨루엔 0.76, 크실렌, 0.87)을 나타내었다. 이 연구는 톨루엔과 크실렌이 총 휘발성 유기화합물의 좋은 지표를 사용될 있고, 톨루엔, 에틸벤젠, 크실렌 등 많은 휘발성 유기화합물의 발생원은 실외뿐 아니라 실내에도 있음을 나타내고 있다.>10)의 $[^{18}F]F_2$를 얻었다. 결론: $^{18}O(p,n)^{18}F$ 핵반응을 이용하여 친전자성 방사성동위원소 $[^{18}F]F_2$를 생산하였다. 표적 챔버는 알루미늄으로 제작하였으며 본 연구에서 연구된 $[^{18}F]F_2$가스는 친핵성 치환반응으로 방사성동위원소를 도입하기 어려운 다양한 방사성의 약품개발에 유용하게 이용될 수 있을 것이다.었으나 움직임

• Journal of Intelligence and Information Systems
• /
• v.16 no.4
• /
• pp.21-41
• /
• 2010

This paper proposes a system that can serve users with appropriate search results through real time filtering, and implemented adaptive user profiling based personalized information retrieval system(PIRS) using users' implicit feedbacks in order to deal with the problem of existing search systems such as Google or MSN that does not satisfy various user' personal search needs. One of the reasons that existing search systems hard to satisfy various user' personal needs is that it is not easy to recognize users' search intentions because of the uncertainty of search intentions. The uncertainty of search intentions means that users may want to different search results using the same query. For example, when a user inputs "java" query, the user may want to be retrieved "java" results as a computer programming language, a coffee of java, or a island of Indonesia. In other words, this uncertainty is due to ambiguity of search queries. Moreover, if the number of the used words for a query is fewer, this uncertainty will be more increased. Real-time filtering for search results returns only those results that belong to user-selected domain for a given query. Although it looks similar to a general directory search, it is different in that the search is executed for all web documents rather than sites, and each document in the search results is classified into the given domain in real time. By applying information filtering using real time directory classifying technology for search results to personalization, the number of delivering results to users is effectively decreased, and the satisfaction for the results is improved. In this paper, a user preference profile has a hierarchical structure, and consists of domains, used queries, and selected documents. Because the hierarchy structure of user preference profile can apply the context when users perfomed search, the structure is able to deal with the uncertainty of user intentions, when search is carried out, the intention may differ according to the context such as time or place for the same query. Furthermore, this structure is able to more effectively track web documents search behaviors of a user for each domain, and timely recognize the changes of user intentions. An IP address of each device was used to identify each user, and the user preference profile is continuously updated based on the observed user behaviors for search results. Also, we measured user satisfaction for search results by observing the user behaviors for the selected search result. Our proposed system automatically recognizes user preferences by using implicit feedbacks from users such as staying time on the selected search result and the exit condition from the page, and dynamically updates their preferences. Whenever search is performed by a user, our system finds the user preference profile for the given IP address, and if the file is not exist then a new user preference profile is created in the server, otherwise the file is updated with the transmitted information. If the file is not exist in the server, the system provides Google' results to users, and the reflection value is increased/decreased whenever user search. We carried out some experiments to evaluate the performance of adaptive user preference profile technique and real time filtering, and the results are satisfactory. According to our experimental results, participants are satisfied with average 4.7 documents in the top 10 search list by using adaptive user preference profile technique with real time filtering, and this result shows that our method outperforms Google's by 23.2%.

• Journal of the Institute of Electronics Engineers of Korea TE
• /
• v.42 no.3
• /
• pp.31-38
• /
• 2005

This paper proposes an implementation method of intelligent characters that can properly adapt to action patterns of opponent characters in fighting games by using genetic algorithm. For this intelligent characters, past actions patterns of opponent characters should be included in the learning process. To verify the effectiveness of the proposed method, two types of experiments are performed and their results are compared. In first experiment(exp-1), intelligent characters consider current action and its step of an opponent character. In second experiment (exp-2), on the other hands, they take past actions of an opponent characters into account additionally. As a performance index, the ratio of score obtained by an intelligent character to that of an opponent character is adopted. Experimental results shows that even if the performance index of exp-1 is better than that of exp-2 at the beginning of stages, but the performance index of exp-2 outperforms that of exp-1 as stages go on. Moreover, optimum solutions are always found in all experimental cases in exp-2. Futhermore, intelligent characters in exp-2 could learn moving actions (forward and backward) and waiting actions for getting more scores through self evolution.

• 전자공학회논문지 IE
• /
• v.45 no.1
• /
• pp.15-23
• /
• 2008

In this paper, an algorithm, that provisions absolute differentiation of packet delays is proposed, simulated, and implemented with VHDL on XPC 860 CPU based test board with an objective for enhancing quality of service (QoS) in future packet networks. It features a scheme that compensates the deviation for prediction on the traffic to be arrived continuously. It predicts the traffic to be arrived at the beginning of a time slot and measures the actual arrived traffic at the end of the time slot and derives the difference between them. The deviation is utilized to the delay control operation for the next time slot to offset it. As it compensates the prediction error continuously, it shows superior adaptability to the bursty traffic as well as the exponential traffic. It is demonstrated through both simulation and the real traffic test on the board that the algorithm meets the quantitative delay bounds and shows superiority to the traffic fluctuation in comparison with the conventional non-adaptive mechanism.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.4
• /
• pp.252-258
• /
• 2013

As WSN is energy constraint so energy efficiency of nodes is important. Because avoiding long distance communication, clustering operating in rounds is an efficient algorithm for prolonging the lifetime of WSN and its performance depends on duration of a round. A short round time leads to frequent re-clustering while a long round time increases energy consume of cluster heads more. So existing clustering schemes determine proper round time, based on the parameters of initial WSN. But it is not appropriate to apply the round time according to initial value throughout the whole network time because WSN is very dynamic networks nodes can be added or vanished. In this paper we propose a new algorithm which calculates the round time relying on the alive node number to adapt the dynamic WSN. Simulation results validate the proposed algorithm has better performance in terms of energy consumption of nodes and loss rate of data.