• Journal of the Korean Wood Science and Technology
• /
• 제12권1호
• /
• pp.31-37
• /
• 1984

For the modification of kiln drying schedule, relations between resistance to drying Rd and the moisture content or drying times were found for 4/4, 6/4 and 8/4 green Douglas fir heartwood by the mild drying schedule and the severe drying schedule until the average moisture content was about 10 percent. The results of this study were as follows. 1. Resistance to drying of thicker lumber was higher than that of thinner lumber and resistance to drying of three different thicknesses were negligible between the mild-and the severe drying schedule. The relationships between resistance to drying and two schedules or three thicknesses of lumber were $Rd_1=1.830{\times}10^5\;M^{-2.24}$ for 4/4 lumber by the mild drying schedule, $Rd_2=1.822{\times}10^5\;M^{-2.25}$ for 4/4 lumber by the severe drying schedule, $Rd_3=2.352{\times}10^5\;M^{-2.14}$ for 6/4 lumber by the mild drying schedule, $Rd_4=3.457{\times}10^5\;M^{-2.27}$ for 6/4 lumber by the severe drying schedule, $Rd_5=1.317{\times}10^6\;M^{-2.56}$ for 8/4 lumber by the mild drying schedule, $Rd_6=8.267{\times}10^5\;M^{-2.40}$ for 8/4 lumber by the severe drying schedule. 2. Thinner lumber exhibited lower level of moisture content and shorter drying time required at intersection point between the moisture content and resistance to drying as a function of drying time than those of thicker lumber. Drying time of mild drying was longer than that of severe drying and similar to the level of moisture content at intersection point.

• 정보저장시스템학회:학술대회논문집
• /
• 정보저장시스템학회 2005년도 추계학술대회 논문집
• /
• pp.139-144
• /
• 2005

Because of the photorefractive recording dynamics, each newly recorded hologram partially erases all previously stored image. Thus achieving the desired diffraction efficiency profile for the entire sequence after all images have been recorded requires exposure time schedule. The often cited classical exposure-schedule model predicts a rising-exponential build-up and an exponential decay in An with an exposure time. However because we cannot directly measure the An, it's difficult to establish the relation of both. In this paper, we deduce the relation of diffraction efficiency and exposure time from experiment data and suggest an algorithm to make time schedule profile in angle/fractal multiplexing of holographic data storage. After that, we present simulated result with equal hologram diffraction efficiency for a sequence of 250 holograms recorded by angle/fractal multiplexing.

• ETRI Journal
• /
• 제46권3호
• /
• pp.473-484
• /
• 2024

We introduce a machine learning-based web application to help travel agents plan a package tour schedule. K-nearest neighbor (KNN) classification predicts the optimal tourists' dwelling time based on a variety of information to automatically generate a convenient tour schedule. A database collected in collaboration with an established travel agency is fed into the KNN algorithm implemented in the Python language, and the predicted dwelling times are sent to the web application via a RESTful application programming interface provided by the Flask framework. The web application displays a page in which the agents can configure the initial data and predict the optimal dwelling time and automatically update the tour schedule. After conducting a performance evaluation by simulating a scenario on a computer running the Windows operating system, the average response time was 1.762 s, and the prediction consistency was 100% over 100 iterations.

• 한국방송∙미디어공학회:학술대회논문집
• /
• 한국방송∙미디어공학회 2018년도 추계학술대회
• /
• pp.114-116
• /
• 2018

본 논문에서는 빔-호핑 위성 전송 시스템을 위한 카운터를 기반의 연속적인 beam allocation time schedule (BATS) 변경 기법을 제안한다. 제안하는 기법은 BATS 를 처음 변경할 때, 카운터를 기반으로 gateway (GW)와 space craft (SC) 양단에서 BATS 변경 시점을 동기화 시킨다. 이 후, BATS를 계속 변경하더라도 전송 데이터 손실 없이 BATS 를 변경할 수 있다.

• 경영정보학연구
• /
• 제6권2호
• /
• pp.195-208
• /
• 2004

소프트웨어 규모가 대형화 됨에 따라 개발에 소요되는 시간과 인력도 대형화 되고 있으며, 또한 원하는 수준의 소프트웨어 품질을 얻기 위해 필요한 테스트 비용도 점점 더 증가하고 있다. 소프트웨어 프로젝트 개발 과정에서 품질 관리를 위해 다양한 결함 제거 기법들이 사용되고 있으나, 이러한 결함제거 기법과 결함 제거 시간이 전체 일정에 미치는 영향은 아직까지 체계적으로 분석되지 못하고 있다. 본 논문에서는 일정한 소프트웨어 품질 수준을 달성하기 위해 소요되는 시간을 소프트웨어 개발 일정 관리에 반영한 새로운 일정관리 모델을 제안한다. 제안된 모델은 CMU의 PSP/TSP (Personal Software Process/Team Software Process)를 적용하는 개발 과정에서 수집된 결함 정보, 결함 제거 시간, 평균 결함 제거시간 및 단계별 결함 제거율을 사용하여 일정 지연 여부를 실시간으로 추적할 수 있도록 하고 있다. 이를 위해 본 논문에서는 소프트웨어 품질 달성에 필요한 작업량을 일정 관리 측정체계와 동일한 측정체계에서 사용할 수 있도록 하는 품질 지수(Quality Value)를 새로 제안한다. 본 연구의 결과는 일정과 품질을 분리하여 관리하는 기존의 일정 관리 방법을 보완하여 프로젝트 관리자를 비롯한 모든 관계자가 품질 관리의 중요성을 인식하고 품질 저하 문제를 사전에 예방하는데 활용될 수 있을 것으로 기대된다.

• Journal of the Korean Wood Science and Technology
• /
• 제18권1호
• /
• pp.39-51
• /
• 1990

This research was carried out to offer the basis data for development of optimum drying schedule for a domestic oak species (Quercus grosseserrata B1.) by investigating drying rate. stress, defect, and moisuture gradient with board thicknesses and drying schedules (code number T4-C2 and T3-B1). The results were obtained as follows: 1. Average drying rate and total drying time from 52.2% to 5.8% were 0.105%/hr and 486 hours for drying schedule T4-C2 and those from 62.1% to 8.3% were 0.070%/hr. and 811 hours for drying schedule T3-B1. 2. Drying rates for 28mm- and 31mm-thick boards showed similar tendency, but were significantly different from 25mm- thick board in drying schedule T4-C2 and those for 22mm-, 25mm- 28mm- and 31mm-thick boards showed similar tendency but were significantly different from 19mm- thick boards in drying schedule T3-B1. 3. The moisture gradients for drying schedule T4-C2 were steeper than those for drying schedule T3-B1 during drying period. and especially in early drying stage slow slope of moisture gradients of drying schedule T3-B1 was effective in preventing serious problem of surface checks. 4. Drying stresses were lower in drying schedule T3-B1 than in drying schedule T4-C2 during drying period. 5. Drying schedule T4-C2 was appropriate for 25mm-thick board but not for 28mm- and 31mm-thick board because of strong drying condition. Drying schedule T3-B1 was appropriate for 28mm- and 31 mm-thick board but not for 19mm-, 22mm-, and 25mm-thick board because of weak drying condition.

• Journal of Information Processing Systems
• /
• 제7권4호
• /
• pp.613-626
• /
• 2011

In this paper, we focus on the pinwheel task model with a variable voltage processor with d discrete voltage/speed levels. We propose an intra-task DVS algorithm, which constructs a minimum energy schedule for k tasks in O(d+k log k) time We also give an inter-task DVS algorithm with O(d+n log n) time, where n denotes the number of jobs. Previous approaches solve this problem by generating a canonical schedule beforehand and adjusting the tasks' speed in O(dn log n) or O($n^3$) time. However, the length of a canonical schedule depends on the hyper period of those task periods and is of exponential length in general. In our approach, the tasks with arbitrary periods are first transformed into harmonic periods and then profile their key features. Afterward, an optimal discrete voltage schedule can be computed directly from those features.

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1996년도 춘계공동학술대회논문집; 공군사관학교, 청주; 26-27 Apr. 1996
• /
• pp.213-216
• /
• 1996

R'||'&'||'D project management is a process of decisions concerned with the achievement of goals of objectives. Especially, defense R'||'&'||'D project planning is the key in the successfull management of defense development. The defense project managers are constantly having to perform "what if\ulcorner" exercise, such as what if the project is extended out for an additional cost\ulcorner In this reserch, we developed a schedule-cost analysis model based upon Critical Path Method(CPM) and Venture Evaluation and Review Technique(VERT) for schedule-cost trade off analysis defense R'||'&'||'D projects. In the first step, a deterministic model is developed as a heuristic which deterministic model is developed as a heuristic which determines the schedule extension and reduction cost as a function desired schedule. In the second step, a stochastic network simulation model is developed to analyse the project risk (sucess and failure). The expected time and cost can be determined for desired schedule under the assumptions of stochastic arc data (time and cost) with a various precedence relationships. This model provides the defense R'||'&'||'D managers with an estimated and expected cost for curtailing or extending a project a given amount of time. The effectiveness and efficiency of the proposed methods, a heuristic and stochastic networks simulations, have been demonstrated through examples.

• 한국철도학회논문집
• /
• 제13권1호
• /
• pp.23-30
• /
• 2010

4D CAD에 의한 건설공사 공정관리시스템은 가상건설기법의 그래픽에 의한 계획일정위주 공정관리에 중점을 두고 있으므로 실제 현장상황의 판단에 의한 진도관리가 어려운부분이 있다. 본 연구는 4D CAD기반의 공정관리에 현장 웹카메라를 갖춘 Telepresence 기법을 이용한 원격현장 실시간 진도관리 모니터링체계를 연동하는 공정관기시스템 개발을 시도하고 있다. 개발된 시스템은 철도시설공사에 적용하여 활용성을 검증하였으며, 4D CAD에 의한 계획 공정현황과 웹카메라에 의한 실시간 실제현장 영상을 비교하여 시각적 진도관리를 가능하게 할 수 있다.

• Architectural research
• /
• 제11권2호
• /
• pp.43-49
• /
• 2009

Since the late 1980s, the schedule technique applied to the construction industry around the world has rapidly changed from the traditional ADM (Arrow Diagramming Method) to the PDM (Precedence Diagramming Method) technique. The main reason for this change is to overcome the limits and inconveniences of the traditional ADM technique. The time-cost trade-off is one of the core scheduling techniques to establish the best optimized combination plan in terms of a relationship between the cost and schedule. However, most of the schedule-related textbooks and research papers have discussed and proposed applications of a time-cost trade-off technique based only on the Finish to Start relationship. Therefore, there are almost no consideration and discussion of problems or restrictions that emerge when the time-cost trade-off technique is applied to the PDM network that has overlapping relationships. This paper proposes the lead-time adjustment method as a methodology for overcoming some restrictions that are encountered when the time-cost trade-off technique is applied to the overlapping relationships of the PDM network.