• Title/Summary/Keyword: real-time programming

Search Result 494, Processing Time 0.032 seconds

Applications of Data Mining Techniques to Operations Planning for Real Time Order Confirmation (실시간 주문 확답을 위한 데이터 마이닝 기반 운용 계획 모델)

  • Han Hyun-Soo;Oh Dong-Ha
    • Korean Management Science Review
    • /
    • v.21 no.3
    • /
    • pp.101-113
    • /
    • 2004
  • In the rapidly propagating Internet based electronic transaction environment. the importance of real time order confirmation has been more emphasized, In this paper, using data mining techniques, we develop intelligent operations decision model to allow real time order confirmation at the time the customer places an order with required delivery terms. Among various operation plannings used for order fulfillment. mill routing is the first interface decision point to link the order receiving at the marketing with the production planning for order fulfillment. Though linear programming based mathematical optimization techniques are mostly used for mill routing problems, some early orders should wait until sufficient orders are gathered for optimization. And that could effect longer order fulfillment lead-time, and prevent instant order confirmation of delivery terms. To cope with this problem, we provide the intelligent decision model to allow instant order based mill routing decisions. Data mining techniques of decision trees and neural networks. which are more popular in marketing and financial applications, are used to develop the model. Through diverse computational trials with the industrial data from the steel company. we have reported that the performance of the proposed approach is effective compared to the present heuristic only mill routing results. Various issues of data mining techniques application to the mill routing problems having linear programming characteristics are also discussed.

A Dynamic Programming Neural Network to find the Safety Distance of Industrial Field (산업 현장의 안전거리 계측을 위한 동적 계획 신경회로망)

  • Kim, Jong-Man;Kim, Won-Sub;Kim, Yeong-Min;Hwang, Jong-Sun;Park, Hyun-Chul
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2001.09a
    • /
    • pp.23-27
    • /
    • 2001
  • Making the safety situation from the various work system is very important in the industrial fields. The proposed neural network technique is the real titre computation method based theory of inter-node diffusion for searching the safety distances from the sudden appearance-objests during the work driving. The main steps of the distance computation using the theory of stereo vision like the eyes of man is following steps. One is the processing for finding the corresponding points of stereo images and the other is the interpolation processing of full image data from nonlinear image data of obejects. All of them request much memory space and titre. Therefore the most reliable neural-network algorithm is drived for real time recognition of obejects, which is composed of a dynamic programming algorithm based on sequence matching techniques. And the real time reconstruction of nonlinear image information is processed through several simulations. I-D LIPN hardware has been composed, and the real time reconstruction is verified through the various experiments.

  • PDF

Optimization of Ship Management System (선박관리 시스템의 최적화)

  • Syan, Lim Chia;Park, Soo-Hong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.6
    • /
    • pp.839-846
    • /
    • 2013
  • In this paper, an effort has been made to design and develop an optimized programming model for Real-time Ship Management System. Replacing the conventional interrupt-driven programming model, an embedded real-time operating system (RTOS) has been implemented on the system, allowing processes to run virtually simultaneous and multitasking. Data management algorithms are designed and developed in the RTOS to facilitate data distribution amongst tasks and optimize the CPU processing time through intelligent resource utilization. Finally, data lost in the system has been minimized via the improvement of data processing rate under the optimized programming model.

Maximizing Concurrency and Analyzable Timing Behavior in Component-Oriented Real-Time Distributed Computing Application Systems

  • Kim, Kwang-Hee Kane;Colmenares, Juan A.
    • Journal of Computing Science and Engineering
    • /
    • v.1 no.1
    • /
    • pp.56-73
    • /
    • 2007
  • Demands have been growing in safety-critical application fields for producing networked real-time embedded computing (NREC) systems together with acceptable assurances of tight service time bounds (STBs). Here a service time can be defined as the amount of time that the NREC system could take in accepting a request, executing an appropriate service method, and returning a valid result. Enabling systematic composition of large-scale NREC systems with STB certifications has been recognized as a highly desirable goal by the research community for many years. An appealing approach for pursuing such a goal is to establish a hard-real-time (HRT) component model that contains its own STB as an integral part. The TMO (Time-Triggered Message-Triggered Object) programming scheme is one HRT distributed computing (DC) component model established by the first co-author and his collaborators over the past 15 years. The TMO programming scheme has been intended to be an advanced high-level RT DC programming scheme that enables development of NREC systems and validation of tight STBs of such systems with efforts far smaller than those required when any existing lower-level RT DC programming scheme is used. An additional goal is to enable maximum exploitation of concurrency without damaging any major structuring and execution approaches adopted for meeting the first two goals. A number of previously untried program structuring approaches and execution rules were adopted from the early development stage of the TMO scheme. This paper presents new concrete justifications for those approaches and rules, and also discusses new extensions of the TMO scheme intended to enable further exploitation of concurrency in NREC system design and programming.

Real-time line control system for automated robotic assembly line for multi-PCB models

  • Park, Jong-Oh;Hyun, Kwang-Ik;Um, Doo-Gan;Kim, Byoung-Doo;Cho, Sung-Jong;Park, In-Gyu;Kim, Young-Sik
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1991.10b
    • /
    • pp.1915-1919
    • /
    • 1991
  • The efficiency of automated assembly line is increased by realizing the automation of each assembly cell, monitoring the line information and developing the real-time line control system it. which production flow is controllable. In this paper, the several modules which are important factors when constructing automated real-time control system, such as, line control S/W module, real-time model change module, error handling module and line production management S/W module, are developed. For developing these important programming modules, real-time control and multi-tasking techniques are integrated. In this paper, operating method of real-time line control in PCB automated assembly line is proposed and for effective control of production line by using multi-tasking technique, proper operating method for relating real-time line control with multi-tasking is proposed by defining the levels of signals and tasks. CIM-Oriented modular programming method considering expandability and flexibility will be added for further research in the future.

  • PDF

Two-Phase Approach to Optimal Weather Routing Using Real-Time Adaptive A* Algorithm and Geometric Programming (실시간 적응 A* 알고리즘과 기하학 프로그래밍을 이용한 선박 최적항로의 2단계 생성기법 연구)

  • Park, Jinmo;Kim, Nakwan
    • Journal of Ocean Engineering and Technology
    • /
    • v.29 no.3
    • /
    • pp.263-269
    • /
    • 2015
  • This paper proposes a new approach for solving the weather routing problem by dividing it into two phases with the goal of fuel saving. The problem is to decide two optimal variables: the heading angle and speed of the ship under several constraints. In the first phase, the optimal route is obtained using the Real-Time Adaptive A* algorithm with a fixed ship speed. In other words, only the heading angle is decided. The second phase is the speed scheduling phase. In this phase, the original problem, which is a nonlinear optimization problem, is converted into a geometric programming problem. By solving this geometric programming problem, which is a convex optimization problem, we can obtain an optimal speed scheduling solution very efficiently. A simple case of numerical simulation is conducted in order to validate the proposed method, and the results show that the proposed method can save fuel compared to a constant engine output voyage and constant speed voyage.

Efficient Content Adaptation Based on Dynamic Programming

  • Thang, Truong Cong;Ro, Yong Man
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2004.05a
    • /
    • pp.326-329
    • /
    • 2004
  • Content adaptation is an effective solution to support the quality of service over multimedia services over heterogeneous environments. This paper deals with the accuracy and the real-time requirement, two important issues in making decision on content adaptation. From our previous problem formulation, we propose an optimal algorithm and a fast approximation based on the Viterbi algorithm of dynamic programming. Through extensive experiments, we show that the proposed algorithms can enable accurate adaptation decisions, and especially they can support the real-time processing.

  • PDF

Swing Trajectory Optimization of Legged Robot by Real-Time Nonlinear Programming (실시간 비선형 최적화 알고리즘을 이용한 족형 로봇의 Swing 궤적 최적화 방법)

  • Park, Kyeongduk;Choi, Jungsu;Kong, Kyoungchul
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.21 no.12
    • /
    • pp.1193-1200
    • /
    • 2015
  • An effective swing trajectory of legged robots is different from the swing trajectories of humans or animals because of different dynamic characteristics. Therefore, it is important to find optimal parameters through experiments. This paper proposes a real-time nonlinear programming (RTNLP) method for optimization of the swing trajectory of the legged robot. For parameterization of the trajectory, the swing trajectory is approximated to parabolic and cubic spline curves. The robotic leg is position-controlled by a high-gain controller, and a cost function is selected such that the sum of the motor inputs and tracking errors at each joint is minimized. A simplified dynamic model is used to simulate the dynamics of a robotic leg. The purpose of the simulation is to find the feasibility of the optimization problem before an actual experiment occurs. Finally, an experiment is carried out on a real robotic leg with two degrees of freedom. For both the simulation and the experiment, the design variables converge to a feasible point, reducing the cost value.

Distributed Real Time Simulation Programming with Time and Message Object Oriented in Computer Network Systems

  • Ra , Sang-Dong;Na, Ha-Sun;Kim, Moon-Hwan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.1C
    • /
    • pp.157-165
    • /
    • 2004
  • Real-time(RT) object-oriented(OO) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the TMO(Time-triggered Message-triggered Object)structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The TMO scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The TMO structuring scheme is a syntactically simple but semantically powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established OO programming languages such as C++ and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems. Start after striking space key 2 times.

Deadline Handling in Real-Time Distributed Object Oriented Programming of TMO

  • Kim, Hee-Chul;Na, Sang-Dong
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.6
    • /
    • pp.863-872
    • /
    • 2002
  • Real-time(RT) object-oriented(00) distributed computing is a form of RT distributed computing realized with a distributed computer system structured in the form of an object network. Several approached proposed in recent years for extending the conventional object structuring scheme to suit RT applications, are briefly reviewed. Then the approach named the TMO(Time-triggered Message-triggered Object) structuring scheme was formulated with the goal of instigating a quantum productivity jump in the design of distributed time triggered simulation. The TMO scheme is intended to facilitate the pursuit of a new paradigm in designing distributed time triggered simulation which is to realize real-time computing with a common and general design style that does not alienate the main-stream computing industry and yet to allow system engineers to confidently produce certifiable distributed time triggered simulation for safety-critical applications. The TMO structuring scheme is a syntactically simple but semantically powerful extension of the conventional object structuring approached and as such, its support tools can be based on various well-established 00 programming languages such as C++ and on ubiquitous commercial RT operating system kernels. The Scheme enables a great reduction of the designers efforts in guaranteeing timely service capabilities of application systems.