• Title/Summary/Keyword: start time

Search Result 1,584, Processing Time 0.028 seconds

Dynamic Analysis of an Ammonia-Water Absorption Chiller (암모니아-물 흡수식 냉각기의 동적 해석)

  • Kim Byong Joo
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.16 no.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.

Metaheuristics of the Rail Crane Scheduling Problem (철송 크레인 일정계획 문제에 대한 메타 휴리스틱)

  • Kim, Kwang-Tae;Kim, Kyung-Min
    • IE interfaces
    • /
    • v.24 no.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.

Development and evaluation of edge devices for injection molding monitoring (사출성형공정 모니터링용 엣지 디바이스 개발 및 평가)

  • Kim, Jong-Sun;Lee, Jun-Han
    • Design & Manufacturing
    • /
    • v.14 no.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.

An expanded Matrix Factorization model for real-time Web service QoS prediction

  • Hao, Jinsheng;Su, Guoping;Han, Xiaofeng;Nie, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.15 no.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.

A TMO Supporting Library and a BCC Scheduler for the Microscale Real-time OS, TMO-eCos) (초경량 실시간 운영체제 TMO-eCos를 위한 TMO 지원 라이브러리 및 BCC 스케줄러)

  • Ju, Hyun-Tae;Kim, Jung-Guk
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.15 no.7
    • /
    • pp.505-509
    • /
    • 2009
  • It is the most important object of real-time computing to make real-time tasks keep their given time conditions. In this paper, we implemented BCC(Basic Concurrency Constraint) scheduler which is provided as an essential element of TMO(Time-triggered Message-triggered Object) model, and TMO Supporting Library that supports object-oriented design for TMO. BCC scheduler is a means to design timeliness-guaranteed computing, and it predicts the start of SpMs first, and then it makes the execution of SvMs deferred when it is predicted that any SpM begins to run currently. In this way, BCC is able to prevent collisions between SpM and SvM, and it gives higher priority to SpMs than SvMs.

A Study on Spatial Scheduling in the P.E. Stage (선행 탑재장에서의 공간일정계획에 관안 연구)

  • Koo Chung-kon;Yoon Duck-Young;Bae Tae-Kyu;Cho Min-Ch
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2004.05a
    • /
    • 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.

  • PDF

Personalized Movie Recommendation System Using Context-Aware Collaborative Filtering Technique (상황기반과 협업 필터링 기법을 이용한 개인화 영화 추천 시스템)

  • Kim, Min Jeong;Park, Doo-Soon;Hong, Min;Lee, HwaMin
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.4 no.9
    • /
    • pp.289-296
    • /
    • 2015
  • The explosive growth of information has been difficult for users to get an appropriate information in time. The various ways of new services to solve problems has been provided. As customized service is being magnified, the personalized recommendation system has been important issue. Collaborative filtering system in the recommendation system is widely used, and it is the most successful process in the recommendation system. As the recommendation is based on customers' profile, there can be sparsity and cold-start problems. In this paper, we propose personalized movie recommendation system using collaborative filtering techniques and context-based techniques. The context-based technique is the recommendation method that considers user's environment in term of time, emotion and location, and it can reflect user's preferences depending on the various environments. In order to utilize the context-based technique, this paper uses the human emotion, and uses movie reviews which are effective way to identify subjective individual information. In this paper, this proposed method shows outperforming existing collaborative filtering methods.

Compliance of mothers' breastfeeding and complementary feeding practices with WHO recommendations in Turkey

  • Demir, Gulperi;Yardimci, Hulya;Ozcelik, Ayse Ozfer;Cakiroglu, Funda Pinar
    • Nutrition Research and Practice
    • /
    • v.14 no.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 χ2 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.

Rapid Initial Detumbling Strategy for Micro/Nanosatellite with Pitch Bias Momentum System (피치 바이어스 모멘텀 방식을 사용하는 초소형 위성의 초기 자세획득 방안 연구)

  • Lee, Byeong-Hun;Choe, Jeong-Won;Jang, Yeong-Geun;Yun, Mi-Yeon
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.34 no.5
    • /
    • pp.65-73
    • /
    • 2006
  • When a satellite separates from the launch vehicle, an initial high angular rate or a tip-off rate is generated. B-dot logic is generally used for controlling the initial tip-off rate. However, it has the disadvantage of taking a relatively long time to control the initial tip-off rate. To solve this problem, this paper suggests a new detumbling control method to be able to adapt to micro/nanosatellite with the pitch bias momentum system. Proposed detumbling method was able to control the angular rate within 20 minutes which is significantly reduced compared to conventional methods. Since the previous wheel start-up method cannot be used if the detumbling controller proposed by this paper is used, a method is also proposed for bringing up the momentum wheel speed to nominal rpm while maintaining stability in this paper. The performance of the method is compared and verified through simulation. The overall result shows much faster control time compared to the conventional methods, and achievement of the nominal wheel speed and 3-axes stabilization while maintaining stability.

Efficient All-to-All Personalized Communication Algorithms in Wormhole Networks (웜홀 방식 망에서의 효율적인 완전교환 통신 알고리즘)

  • Kim, Si-Gwan;Maeng, Seung-Ryoul;Cho, Jung-Wan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.27 no.5
    • /
    • pp.464-474
    • /
    • 2000
  • All-to-all personalized communication, or complete exchange, is at the heart of numerous applications, such as matrix transposition, fast Fourier Transform(FFT), and distributed table lookup.We present an efficient all-to-all personalized communication algorithm for a 2D torus inwormhole-routed networks. Our complete exchange algorithm adopts divide-and-conquer approach toreduce the number of start-up latency significantly, which is a good metric for network performancein wormhole networks. First, we divide the whole network into 2x2 basic cells, After speciallydesignated nodes called master nodes have collected messages to transmit to the rest of the basic cell,only master nodes perform complete exchange with reduced network size, N/2 x N/2. When finishedwith this complete exchange in master nodes, these nodes distribute messages to the rest of the masternode, which results in the desired complete exchange communication. After we present our algorithms,we analyze time complexities and compare our algorithms with several previous algorithms. And weshow that our algorithm is efficient by a factor of 2 in the required start-up time which means thatour algorithm is suitable for wormhole-routed networks.

  • PDF