• International Journal of Control, Automation, and Systems
• /
• v.6 no.1
• /
• pp.119-125
• /
• 2008

This paper examines the use of a wireless Fieldbus based on IEEE 802.15.4 MAC protocol. The superframe of IEEE 802.15.4 is applied to a transmission scheme of real-time mixed data. The transmission and bandwidth allocation scheme are proposed for real-time communication using a superframe. The proposed wireless Fieldbus protocol is able to transmit three types of data (periodic data, sporadic data, and non real-time messages), and guarantee realtime transmission simultaneously within a limited timeframe.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.4
• /
• pp.403-410
• /
• 2010

The switched Ethernet has many features for real-time communications such as providing traffic isolation, large bandwidth, and full-duplex links, and so on. The switched Ethernet, however, cannot guarantee the timely delivery of a real-time message because message delay increases when collisions occurs at the output ports and message loss can even occur due to the overflow at the output buffer. Recently, many research efforts have been done to use the switched Ethernet as an industrial control network. In the industrial control network, sensors periodically sense the physical environment and transmit the sensed data to an actuator, and the periodic messages from sensors to actuators have typically real-time requirements such that those messages must be transmitted within their deadlines. This paper first suggests a feasible condition for EDF (Earliest Deadline First)-based scheduling of periodic messages on a synchronized switched Ethernet and a message scheduling algorithm which satisfies the proposed feasible condition. Pedreiras, et al. [10] suggested a feasible condition for message scheduling on the Ethernet (shared media Ethernet), but there has been no research result on the scheduling condition on the switched Ethernet until now. We compared the real-time message scheduling capacity between the Ethernet and the switched Ethernet by simulation. The simulation result shows that the message scheduling capacity of the Ethernet has almost remained constant as the number of nodes on the network increases, but, in the case of the switched Ethernet, the message scheduling capacity has increased linearly according to the number of nodes on the network.

• Industrial Engineering and Management Systems
• /
• v.7 no.1
• /
• pp.9-22
• /
• 2008

As an extension of a previous work by the authors (Song and Esogbue, 2006), a new algorithm for automated modeling of nonstationary seasonal time series is presented in this paper. Issues relative to the methodology for building automatically seasonal time series models and periodic time series models are addressed. This is achieved by inspecting the trend, estimating the seasonality, determining the orders of the model, and estimating the parameters. As in our previous work, the major instruments used in the model identification process are correlograms of the modeling errors while the least square method is used for parameter estimation. We provide numerical illustrations of the performance of the new algorithms with respect to building both seasonal time series and periodic time series models. Additionally, we consider forecasting and exercise the models on some sample time series problems found in the literature as well as real life problems drawn from the retail industry. In each instance, the models are built automatically avoiding the necessity of any human intervention.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.45 no.3
• /
• pp.78-89
• /
• 2022

The purpose of this study was to propose useful suggestion by analyzing preventive replacement policy under which there are minor and major failure. Here, major failure is defined as the failure of system which causes the system to stop working, however, the minor failure is defined as the situation in which the system is working but there exists inconvenience for the user to experience the degradation of performance. For this purpose, we formulated an expected cost rate as a function of periodic replacement time and the number of system update cycles. Then, using the probability and differentiation theory, we analyzed the cost rate function to find the optimal points for periodic replacement time and the number of system update cycles. Also, we present a numerical example to show how to apply our model to the real and practical situation in which even under the minor failure, the user of system is not willing to replace or repair the system immediately, instead he/she is willing to defer the repair or replacement until the periodic or preventive replacement time. Optimal preventive replacement timing using two variables, which are periodic replacement time and the number of system update cycles, is provided and the effects of those variables on the cost are analyzed.

• Management Science and Financial Engineering
• /
• v.13 no.1
• /
• pp.93-113
• /
• 2007

In the previous research, we considered a logistics brokerage problem with the objective of minimizing total transportation lead time of freights in a logistics e-marketplace, in which a logistics brokerage agent intermediates empty vehicles and freights registered by car owners and shippers [7]. However, in the logistics e-marketplace, transportation due date tardiness is more important than the transportation lead time, since transportation service level is critically determined by whether the due date is met or not. Therefore, in this paper, we deal with the logistics brokerage problem with the objective of minimizing total tardiness of freights. Hungarian method based matching algorithms, real time matching(RTM), periodic matching(PM), and fixed matching(FM), are used for solving the problem considered in this paper. In order to test performance of the proposed algorithms, we perform computational experiments on a various problem instances. The results show that the waiting-and-matching algorithms, PM and FM, also give better performance than real time matching strategy, RTM, for the total tardiness minimization problem as the algorithms did for the total lead time minimization problem.

• Transactions of the Korean Society of Mechanical Engineers B
• /
• v.28 no.4
• /
• pp.493-499
• /
• 2004

Variations of temperature and velocity fields in a Hele-Shaw convection cell (HSC) were investigated using a holographic interferometry and 2-D PIV system with varying Rayleigh number. To measure quasi-steady variation of temperature field, two different measurement methods of holographic interferometry, double-exposure method and real-time method, were employed. In the double-exposure method, unwanted waves were eliminated effectively using a digital image processing technique. The reconstructed images are clear, but transient flow cannot be reconstructed clearly. On the other hand, transient convective flow can be reconstructed well using the real-time method. However, the fringe patterns reconstructed by the real-time method contain more noises, compared with the double-exposure method. Experimental results show a steady flow pattern at low Rayleigh numbers and a time-dependent periodic flow structure at high Rayleigh numbers. The periodic flow pattern at high Rayleigh numbers obtained by the real-time holographic interferometer method is in a good agreement with the PIV results.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.4
• /
• pp.304-308
• /
• 2009

This paper presents the deadline driven CPU-Power management scheme for the Real-Time Embedded OS: named TMO-eCos. It used the scheduling scenarios generated by a task serialization technique for hard real- time TMO system. The serializer does a off-line analysis at design time with period, deadline and WCET of periodic tasks. Finally, TMO-eCos kernel controls the CPU speed to save the power consumption under the condition that periodic tasks do not violate deadlines. As a result, the system shows a reasonable amount of power saving. This paper presents all of these processes and test results.

• The Journal of the Korea Contents Association
• /
• v.4 no.2
• /
• pp.50-60
• /
• 2004

Recently, most of the embedded system is required not only many functions but also real-time characteristics in purpose. In the hard real-time system, especially, strict deadline of periodic task can affect the performance of the system. In this paper, we design and implement the scheduler based on RM(Rate-Monotonic) rule. This scheduler makes feasible patterns based on EDF(Earliest deadline first) rule with extended schedulability inspection before execution, for periodic task-set that has high CPU utilization and then, execute periodic task-set depended on feasible patterns. The feasible pattern formed into EDF rule is capable of the efficiency of CPU up to 100 percentage and by the referenced execution of the feasible pattern is possible of removing the red-time scheduling overhead that is the defect of the order of dynamic assignment rule.

• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.397-397
• /
• 2000

This paper presents a gait control scheme for teleoperation of a quadruped-walking robot. In teleoperation of a walking robot, an operator gives a real-time generated velocity command to a walking robot instead of a moving trajectory. When the direction of the velocity command is changed, the periodic gait is not available because this requires an initial foot position . This paper proposes the aperiodic gait control scheme that can converge to a periodic gait Simulation results are given to demonstrate the efficiency of the proposed control scheme.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.1
• /
• pp.39-52
• /
• 2022

We introduce Clifford-valued neural networks with leakage delays. Furthermore, we study the uniqueness and existence of Clifford-valued Hopfield artificial neural networks having the Stepanov weighted pseudo almost periodic forcing terms on leakage delay terms. However the noncommutativity of the Clifford numbers' multiplication made our investigation diffcult, so our results are obtained by decomposing Clifford-valued neural networks into real-valued neural networks. Our analysis is based on the differential inequality techniques and the Banach contraction mapping principle.