• Title/Summary/Keyword: due-date

Search Result 1,024, Processing Time 0.024 seconds

Query Processing of Spatio-temporal Trajectory for Moving Objects (이동 객체를 위한 시공간 궤적의 질의 처리)

  • Byoungwoo Oh
    • Journal of Platform Technology
    • /
    • v.11 no.1
    • /
    • pp.52-59
    • /
    • 2023
  • The importance of spatio-temporal trajectories for contact tracing has increased due to the recent COVID-19 pandemic. Spatio-temporal trajectories store time and spatial data of moving objects. In this paper, I propose query processing for spatio-temporal trajectories of moving objects. The spatio-temporal trajectory model of moving objects has point type spatial data for storing locations and timestamp type temporal data for time. A trajectory query is a query to search for pairs of users who have been in close contact by boarding the same bus. To process the trajectory query, I use the Geolife dataset provided by Microsoft. The proposed trajectory query processing method divides trajectory data by date and checks whether users' trajectories were nearby for each date to generate information about contacts as the result.

  • PDF

Estimation of Rice Heading Date of Paddy Rice from Slanted and Top-view Images Using Deep Learning Classification Model (딥 러닝 분류 모델을 이용한 직하방과 경사각 영상 기반의 벼 출수기 판별)

  • Hyeok-jin Bak;Wan-Gyu Sang;Sungyul Chang;Dongwon Kwon;Woo-jin Im;Ji-hyeon Lee;Nam-jin Chung;Jung-Il Cho
    • Korean Journal of Agricultural and Forest Meteorology
    • /
    • v.25 no.4
    • /
    • pp.337-345
    • /
    • 2023
  • Estimating the rice heading date is one of the most crucial agricultural tasks related to productivity. However, due to abnormal climates around the world, it is becoming increasingly challenging to estimate the rice heading date. Therefore, a more objective classification method for estimating the rice heading date is needed than the existing methods. This study, we aimed to classify the rice heading stage from various images using a CNN classification model. We collected top-view images taken from a drone and a phenotyping tower, as well as slanted-view images captured with a RGB camera. The collected images underwent preprocessing to prepare them as input data for the CNN model. The CNN architectures employed were ResNet50, InceptionV3, and VGG19, which are commonly used in image classification models. The accuracy of the models all showed an accuracy of 0.98 or higher regardless of each architecture and type of image. We also used Grad-CAM to visually check which features of the image the model looked at and classified. Then verified our model accurately measure the rice heading date in paddy fields. The rice heading date was estimated to be approximately one day apart on average in the four paddy fields. This method suggests that the water head can be estimated automatically and quantitatively when estimating the rice heading date from various paddy field monitoring images.

Effects of Sowing Date and Cutting Time on Feed Value of Rye in Paddy Field (파종기와 예취시기가 답리작 호밀의 동료가치에 미치는 영향)

  • ;Je-Cheon Chae
    • KOREAN JOURNAL OF CROP SCIENCE
    • /
    • v.39 no.6
    • /
    • pp.519-525
    • /
    • 1994
  • This experiment was conducted to investigate the effects of sowing date and cutting time on feed value of rye in paddy field at Yesan from Oct. 1990 to June 1991. The field experiment was sown 5 times at 10 day intervals from Oct. 5. The content of crude protein, digestible protein, total digestible nutrient(TDN), minerals(P, K, Ca, Mg), and energy(ENE, NEL, NEM, NEG) were decreased due to earlier sowing, while the content of acid detergent fiber (ADF) and neutral detergent fiber(NDF) increased. On the other hand, the yields per unit area for crude and digestible protein, TDN, minerals, and energy increased due to earlier sowing, but there was no significant difference among the plots sown on Oct. 5 through Oct. 25. The highest yield of crude protein was shown at late flowering stage, digestible protein and net energy gain (NEG) at heading stage and TDN at milk stage respectively.

  • PDF

An Adaptive Delay Control based on the Transmission Urgency of the Packets in the Wireless Networks (무선망에서 패킷의 전송 긴급성을 고려한 적응적 지연 제어 방안)

  • Jeong, Dae-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.35 no.1A
    • /
    • pp.44-53
    • /
    • 2010
  • This paper proposes a traffic management policy for delay control in the wireless networks. The so-called EDD(Earliest Due Date) scheme is adopted as the packet scheduling policy, so that the service provision is performed in the order of the transmission urgency of the backlogged packets. In addition, we derive a formula to determine the contention window, one of the MAC parameters, with the goal of minimizing the non-work conserving characteristics of the traditional MAC scheme. This method eliminates the burden of the class-wise parameter settings which is typically required for the priority control. Simulations are performed to show the validity of the proposed scheme in comparison with the policy that adopts the class-level queue management such as the IEEE 802.11e standard. Smaller delays and higher rates of delay guarantees are observed throughout the experiments.

Change of Climatic Growing Season in Korea (한반도의 기후학적 식물생육기간의 변화)

  • Jung, Myung-Pyo;Shim, Kyo-Moon;Kim, Yongseok;Choi, In-Tae
    • Korean Journal of Environmental Agriculture
    • /
    • v.34 no.3
    • /
    • pp.192-195
    • /
    • 2015
  • BACKGROUND: The growing season (GS) has been understood as a useful indicator for climate change due to high relationship with increasing temperature. Hear this study was conducted to examine changes in the thermal GS over South Korea from 1970 to 2013 based on daily mean air temperature for assessing the temporal and spatial variability in GS. METHODS AND RESULTS: Three GS parameters (starting date, ending date, and length) were determined at 19 stations throughout South Korea. The results show that the GS has been extended by 4.2 days/decade between 1970 and 2013 on average. The growing season start (GSS) has been advanced by 2.7 days/decade and the growing season end (GSE) has been delayed by 1.4 day/decade. Spatial variation in the GS parameters in Korea are shown. The GS parameters, especially GSS, of southeastern part of Korea have been changed more than that of northwestern part of Korea. The extension of GS may be more influenced on earlier onset in spring rather than later GSE. CONCLUSION: Under climate change scenarios, the GS will be more extended due to delayed GSE as well as advanced GSS. And These are more notable in the northeastern part of Korea.

Modeling and Verification of Workflows with Time Constraints (시간 제약을 포함한 워크플로우 모델링 및 검증)

  • Jeong, Hui-Taek;Lee, Do-Heon;Kim, Mun-Ja;Ryu, Yeong-Cheol
    • The Transactions of the Korea Information Processing Society
    • /
    • v.6 no.2
    • /
    • pp.261-274
    • /
    • 1999
  • Recently, automated business processing systems, so called workflow systems, have been studied. have been studied. even though each task has noticible duration inherently, most of previous models regard it as a simple finite automation where state transitions occur instantly. In this paper, we propose a modeling method for workflow each of whose component task has minimum processing time and due-date. Firstly we provide a priority function to choose the proper alternatives when tasks fail before their due-date. The priority function considers the time-relevant factor and the semantic compatibility level to decide the best alternative. secondly, we identify six different types of execution requirements for tasks with noticible durations. They are serial, parallel, simultaneous start simultaneous termination, interleaved and nested dependency. Note that previous models deal with only serial execution and parallel execution. Lastly, we also propose graph-based methods to detect logical conflicts in time constraint-based workflow specifications.

  • PDF

Intelligent Character Recognition System for Account Payable by using SVM and RBF Kernel

  • Farooq, Muhammad Umer;Kazi, Abdul Karim;Latif, Mustafa;Alauddin, Shoaib;Kisa-e-Zehra, Kisa-e-Zehra;Baig, Mirza Adnan
    • International Journal of Computer Science & Network Security
    • /
    • v.22 no.11
    • /
    • pp.213-221
    • /
    • 2022
  • Intelligent Character Recognition System for Account Payable (ICRS AP) Automation represents the process of capturing text from scanned invoices and extracting the key fields from invoices and storing the captured fields into properly structured document format. ICRS plays a very critical role in invoice data streamlining, we are interested in data like Vendor Name, Purchase Order Number, Due Date, Total Amount, Payee Name, etc. As companies attempt to cut costs and upgrade their processes, accounts payable (A/P) is an example of a paper-intensive procedure. Invoice processing is a possible candidate for digitization. Most of the companies dealing with an enormous number of invoices, these manual invoice matching procedures start to show their limitations. Receiving a paper invoice and matching it to a purchase order (PO) and general ledger (GL) code can be difficult for businesses. Lack of automation leads to more serious company issues such as accruals for financial close, excessive labor costs, and a lack of insight into corporate expenditures. The proposed system offers tighter control on their invoice processing to make a better and more appropriate decision. AP automation solutions provide tighter controls, quicker clearances, smart payments, and real-time access to transactional data, allowing financial managers to make better and wiser decisions for the bottom line of their organizations. An Intelligent Character Recognition System for AP Automation is a process of extricating fields like Vendor Name, Purchase Order Number, Due Date, Total Amount, Payee Name, etc. based on their x-axis and y-axis position coordinates.

A Study on Simulation Analyze on Scheduling Application to Lifetime Value(LTV) (LTV(Lifetime Value)를 적용한 일정계획의 시뮬레이션 분석에 관한 연구)

  • 양광모;박재현;강경식
    • Journal of the Korea Safety Management & Science
    • /
    • v.6 no.1
    • /
    • pp.219-228
    • /
    • 2004
  • We can be acquire the conformation about on the due date of supplier by using the A TP(A vail able to Promise) function of management about real and concurrent access on the supply chain, also decide the affect about product availability due to forecasting or customer's orders through the A TP. Under the these environments, defines the A TP rule that can improve the customer value and data flow related the LTV(Life Time Value) and builds on a algorithm. In this paper, It consolidates the necessity on a LTV (Life Time Value) and analyzes data which is concerned of Customer Value. Under the these environments, defines the LTV rule that can improve the customer value. And then, Scheduling plays an important role in shop floor planning. Therefore, this study tries to proposed that Scheduling by customer needs group for minimizing the problem.

Dispatching rules for assembly job shops with process times relying on machine capacity (장비가용능력에 의존적인 공정시간을 가지는 조립주문생산에서의 우선순위 규칙)

  • Kim, Bong-Hyeok;Na, Dong-Gil;Gil, Guk-Ho;Kim, Dong-Won
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2005.05a
    • /
    • pp.517-522
    • /
    • 2005
  • This paper addresses scheduling heuristics for an assembly job-shop that includes at least an assembly process throughout its processes. The assembly job shop has certain characteristics not only considering the precedence relationship between the processes but also considering the processing progress between the parts. In addition, it probably presents a different processing time for the same product according to the order of processes and the point of workable time, due to the difference in the availability of equipments. The paper proposes several priority-based dispatching rules that consider these characteristics of the assembly job-shop, aiming to minimize the total tardiness of products in the shop floor. Computational tests showed that job due date based priority rules significantly outperform existing priority rules in terms of total tardiness.

  • PDF

A Study of Master Production Scheduling Scheme in TFT-LCD Factory considering Line Balancing (TFT-LCD 공장의 라인 밸런싱을 고려한 MPS 수립에 관한 연구)

  • Won, Dae-Il;Baek, Jong-Kwan;Kim, Sung-Shick
    • IE interfaces
    • /
    • v.16 no.4
    • /
    • pp.463-472
    • /
    • 2003
  • In this study we consider the problem of MPS(master production planning) of TFT-LCD(Thin Film Transistor - Liquid Crystal Display) production factory. Due to the complexities of the TFT-LCD production processes, it is difficult to build effective MPS. This study presents an algorithm having a concept of IDPQ(Ideal Daily Production Quantity) that considers line balancing of TFT-LCD production process. In general, the MPS building procedure does not consider line balancing in non-bottleneck processes. MPS without considering line balancing may make ineffective schedule. We present algorithms for building MPS considering factory capacity and line balancing according to the sales order.