• 설비공학논문집
• /
• 제16권10호
• /
• pp.990-998
• /
• 2004

Dynamic behavior of an ammonia-water absorption system was investigated numerically. Thermal-hydraulic model for a single-effect 3 RT chiller was developed by applying transient conservation equations of total mass, $NH_3$ mass, energy and momentum to each component. Transient variations of system properties and transport variables were analysed during start-up operation. Numerical analyses were performed to quantify the effects of bulk concentration and charging ratio on the system performance in terms of cooling capacity, coefficient of performance, and time constant of system. For an absorption chiller considered in the present study, optimum charging ratio and bulk concentration were to found to exist, which resulted in the maximum cooling capacity and COP. The time constant increased as the charging ratio increased, but decreased with the increase of bulk concentration.

• 산업공학
• /
• 제24권4호
• /
• pp.281-294
• /
• 2011

This paper considers the rail crane scheduling problem which is defined as determining the sequence of loading/unloading container on/from a freight train. The objective is to minimize the weighted sum of the range of order completion time and makespan. The range of order completion time implies the difference between the maximum of completion time and minimum of start time of each customer order consisting of jobs. Makespan refers to the time when all the jobs are completed. In a rail freight terminal, logistics firms as a customer wish to reduce the range of their order completion time. To develop a methodology for the crane scheduling, we formulate the problem as a mixed integer program and develop three metaheuristics, namely, genetic algorithm, simulated annealing, and tabu search. To validate the effectiveness of heuristic algorithms, computational experiments are done based on a set of real life data. Results of the experiments show that heuristic algorithms give good solutions for small-size and large-size problems in terms of solution quality and computation time.

• Design & Manufacturing
• /
• 제14권4호
• /
• pp.25-39
• /
• 2020

In this study, an edge device that monitors the injection molding process by measuring the mold vibration(acceleration) signal and the mold surface temperature was developed and evaluated its performance. During injection molding, signals of the injection start, V/P switchover, and packing end sections were obtained through the measurement of the mold vibration and the injection time and packing time were calculated by using the difference between the times of the sections. Then, the mold closed and mold open signals were obtained using a magnetic hall sensor, and cycle time was calculated by using the time difference between the mold closed time each process. As a result of evaluating the performance by comparing the process data monitored by the edge device with the shot data recorded on the injection molding machine, the cycle time, injection time, and packing time showed very small error of 0.70±0.38%, 1.40±1.17%, and 0.69±0.82%, respectively, and the values close to the actual were monitored and the accuracy and reliability of the edge device were confirmed. In addition, it was confirmed that the mold surface temperature measured by the edge device was similar to the actual mold surface temperature.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권11호
• /
• pp.3913-3934
• /
• 2021

Real-time prediction of Web service of quality (QoS) provides more convenience for web services in cloud environment, but real-time QoS prediction faces severe challenges, especially under the cold-start situation. Existing literatures of real-time QoS predicting ignore that the QoS of a user/service is related to the QoS of other users/services. For example, users/services belonging to the same group of category will have similar QoS values. All of the methods ignore the group relationship because of the complexity of the model. Based on this, we propose a real-time Matrix Factorization based Clustering model (MFC), which uses category information as a new regularization term of the loss function. Specifically, in order to meet the real-time characteristic of the real-time prediction model, and to minimize the complexity of the model, we first map the QoS values of a large number of users/services to a lower-dimensional space by the PCA method, and then use the K-means algorithm calculates user/service category information, and use the average result to obtain a stable final clustering result. Extensive experiments on real-word datasets demonstrate that MFC outperforms other state-of-the-art prediction algorithms.

• 한국정보과학회논문지:컴퓨팅의 실제 및 레터
• /
• 제15권7호
• /
• pp.505-509
• /
• 2009

실시간 처리의 가장 큰 목적은 시스템에서 동작 하는 실시간 태스크들이 주어진 데드라인을 잘 지키도록 하는 것이다. 본 논문에서는 임베디드 시스템을 위한 운영체제인 TMO-eCos의 실시간 태스크 스케줄링 성능 개선을 위하여, TMO(Time-triggered Message-triggered Object) 모델에 필수 요소로 규정된 BCC(Basic Concurrency Control) 스케줄러의 구현과, 실시간 객체 TMO의 객체 기반 프로그래밍을 제공하는 TMO 지원 라이브러리의 설계 및 구현에 관하여 기술한다. BCC 스케줄러는 보장성 컴퓨팅 설계를 위한 것으로, 비동기적 사건 구동 태스크의 스케줄을 사전에 스케줄이 정의된 시간 구동 태스크의 구동 시간을 제외한 여유 시간이 충분할 때에만 허용하는 실시간 스케줄러이다.

• 한국해양공학회:학술대회논문집
• /
• 한국해양공학회 2004년도 학술대회지
• /
• pp.61-66
• /
• 2004

In this paper an effort is made to develop an innovative spatial arrangement concept pertaining to ship building industry. The spatial scheduling is the problem that concentrates on effective planning of available space and arrangements of blocks and in a priority manner. In order to create an effective spatial scheduling. a database providing the priority has to be available to make the erection sequence. Such a system works hand in hand with erection sequence generator program The erection sequence program works on the conventional network analysis method which uses a typical parent-children idea for the calculation of the ENT(possible earliest network start time) and LNT(possible latest network start time). This program works in a cyclic manner taking turns by calculating the ENT in upward trace and LNT on the return trace thereby generating the entire erection sequence diagram for the requisite problem The generated database serves as an input data for spatial scheduling problem. When the system works it takes into consideration the entire system based on heuristic concepts as mentioned. There system uses the spatial aspects such as the available area of the P. E area and plan area of the corresponding blocks and its priority of erection from the erection sequence generator program develops the spatial scheduling arrangement. In this paper using all these concepts an innovative spatial schedule development system developed.

• 정보처리학회논문지:컴퓨터 및 통신 시스템
• /
• 제4권9호
• /
• pp.289-296
• /
• 2015

정보의 폭발적인 증가로 사용자들은 원하는 정보를 빠른 시간에 얻는 것이 힘들어졌다. 따라서 이 문제를 해결하기 위한 다양한 방식의 새로운 서비스들이 제공되고 있다. 개인에게 맞는 맞춤 서비스를 제공하는 것이 중요하게 부각되면서 개인화 추천 시스템이 매우 중요하게 되었다. 추천 시스템 중 협업 필터링은 추천 시스템에서 널리 사용되고 있고 개인화 추천 시스템 중에서 가장 성공적인 방법이다. 협업 필터링 방법은 고객들의 프로파일 정보를 기반으로 추천을 하므로 희박성 문제와 cold-start 문제가 있다. 본 논문에서는 개인에게 더 정확하게 추천하기 위해 협업 필터링 기법과 상황기반 기법을 함께 이용하는 방법을 제안한다. 상황기반 기법은 사용자를 둘러싼 시간, 감정, 장소 등과 같은 환경을 고려하여 사용자에게 맞는 아이템을 추천하는 방법으로 상황에 따라 달라지는 사용자의 선호도를 반영할 수 있다. 본 논문에서는 상황기반 기법을 활용하기 위해 상황정보로 감정을 이용하며 이를 위해 개인의 주관적인 정보를 파악하는 데 효과적인 영화 리뷰를 이용한다. 본 논문에서 제안한 방법은 기존의 협업 필터링 방법보다 성능평가 결과, 향상된 성능을 보였다.

• Nutrition Research and Practice
• /
• 제14권6호
• /
• pp.654-666
• /
• 2020

BACKGROUND/OBJECTIVES: This study aimed to evaluate how breastfeeding and complementary nutrition practices of mothers of 0-24-month-old children comply with the World Health Organization (WHO) recommendations for infant and young child feeding and to compare the results with selected demographic parameters related to the mother and child. SUBJECTS/METHODS: The research sample comprised mothers (n = 250) with children less than 2 years old. Data were obtained via questionnaire and were analyzed using SPSS 20.0 package program. The Pearson χ² or Fisher's exact tests were used for assessing relationships between categorical variables. The one-sample t-test was used for comparisons with reference values. RESULTS: Most mothers (97.2%) breastfed their babies immediately after birth. The mean time to breastfeeding after delivery was 47.8 ± 14.8 minutes, and 40.8% of the mothers complied with the WHO recommendation. Furthermore, 59.8% of the mothers exclusively breastfed their children for 6 months (mean 5.2 ± 1.5 months). The mean duration to the start of providing complementary food was 5.8 ± 0.6 months, and 76.1% of mothers who complied with the WHO recommendation. Only 12.3% of mothers breastfed their children for at least 12 months (mean 7.7 ± 3.3 months). On average, mothers gave cow milk to their children for the first time at 10.1 ± 1.7 months and honey at 11.8 ± 2.3 months. The mothers' rates of compliance with the WHO recommendations on cow milk and honey feeding were 32.0% and 71.6%, respectively. The rate of mothers who complied with the WHO minimum meal frequency recommendation was 88.3%. CONCLUSIONS: We suggest that the WHO recommendations on this subject will be realized more fully by emphasizing the importance of the positive effects of breastfeeding until the age of 2 years and of a timely start of complementary food provision. Such changes will affect child health over the long term.

• 한국항공우주학회지
• /
• 제34권5호
• /
• pp.65-73
• /
• 2006

위성이 발사체로부터 분리될 때 초기 각속도가 발생한다. B-dot 로직은 일반적으로 위성의 초기각속도 제어에 사용되나, 상대적으로 제어시간이 많이 소요된다는 단점이 있다. 이런 문제를 해결하기 위해 본 논문에서는 피치 바이어스 모멘텀 방식을 사용하는 초소형 위성에 적용 가능한 디텀블링(detumbling) 방식을 새롭게 제안하였다. 제안된 디텀블링 방식은 제어시간이 약 20분 이내로 기존의 방식에 비해 상당한 시간을 줄일 수 있다. 본 논문에서 제안한 디텀블링 방식을 사용할 경우 기존의 모멘텀 휠 초기구동 방식을 사용할 수 없다. 따라서 휠의 속도를 안정적으로 공칭 속도까지 증가시키는 방식을 제안하고 시뮬레이션을 통해 비교, 검증하였다. 시뮬레이션 결과 기존의 방식과 비교했을 때 제어시간을 단축할 수 있었으며 휠의 공칭 속도와 3축 안정화를 이룰 수 있었다.

• 한국정보과학회논문지:시스템및이론
• /
• 제27권5호
• /
• pp.464-474
• /
• 2000

완전교환 통신은 행렬전이, 푸리에변환 혹은 분산 테이블 검색과 같은 여러 가지 응용에서 아주 많이 활용되는 통신 방법이다. 본 논문은 웜홀 방식을 채용한 2차원 토러스에서의 개시 지연 시간을 줄이기 위하여 분할 및 합병 (divide-and-conquer) 방식을 사용한 효율적인 완전교환 통신 알고리즘을 제 안한다. 전체망을 2x2 형태의 기본셀로 분할한 뒤 각 기본셀에서는 마스터노드라고 불리는 특정 노드를 지정하여 기본셀내의 여타 노드들의 메시지를 이 마스터노드가 수집한다. 이 마스터노드들이 다른 모든 노드로 보내질 메시지를 수집한 뒤 각 기본셀내의 모든 마스터 노드들만이 가상 망을 형성하여 망의 크기가 N/2 x N/2으로 줄어든 상태로 완전 교환 알고리즘을 수행한다. 마스터노드들간의 완전교환 연산을 수행 한 뒤 이 마스터노드들은 자기가 전담했던 여타 노드들의 메시지를 재분배해 줌으로써 주어진 완전교환 연산을 완료한다. 기존의 여러 가지 알고리즘과의 비교 분석을 제시하였으며 제시한 알고리즘이 약 2배 정도의 개시 지연시간 면에서 우수함을 보인다.