• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.234-240
• /
• 1999

This paper presents a new approach for large-scale generator maintenance scheduling optimizations. The generator preventive maintenance scheduling problems are typical discrete dynamic n-dimensional vector optimization ones with several inequality constraints. The considered objective function to be minimized a subset of{{{{ { R}^{n } }}}} space is the variance (i.g., second-order momentum) of operating reserve margin to levelize risk or reliability during a year. By its nature of the objective function, the optimal solution can only be obtained by enumerating all combinatorial states of each variable, a task which leads to computational explosion in real-world maintenance scheduling problems. This paper proposes a new priority search mechanism based on each generator's discrete sensitivity value which was analytically developed in this study. Unlike the conventional capacity-based priority search, it can prevent the local optimal trap to some extents since it changes dynamically the search tree in each iteration. The proposed method have been applied to two test systems (i.g., one is a sample system with 10 generators and the other is a real-world lage scale power system with 280 generators), and the results anre compared with those of the conventional capacith-based search method and combinatorial optimization method to show the efficiency and effectiveness of the algorithm.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.1
• /
• pp.11-16
• /
• 2010

This paper compares and studies scheduling methods to reduce jitter in real-time control systems. While previous research has focused on dynamic-priority scheduling schemes, this paper focuses on fixed-priority scheduling which is more widely used. It is pointed out that previously defined jitter measures might not be useful in enhancing the control performance of a real-time task because the measures are relative values. We present a new jitter measure and a new scheduling scheme for fixed-priority tasks. The experimental results through simulation show that the new scheduling scheme reduces jitter and enhances control performance.

• Journal of KIISE:Information Networking
• /
• v.32 no.4
• /
• pp.471-482
• /
• 2005

The high-speed network permits Grid computing to handle large problem of management areas and share various computational resources. As there are many resources and changes of them in Grid computing, the resources should be detected effectively and matched correctly with tasks to provide high performance. In this paper, we propose a mechanism that maximizes the performance of Grid computing systems. According to a priority, grade and site of heterogeneous resources, we assign tasks to those resources. Initially, a volunteer's priority and ranking are determined by static information like as CPU speed, RAM size, storage size and network bandwidth. And then, the rank of resources is decided by considering dynamic information such as correctness, response time, and error rate. We find that overall Grid system performance is improved and high correctness using resource reallocation mechanism is achieved.

• Journal of information and communication convergence engineering
• /
• v.1 no.3
• /
• pp.109-114
• /
• 2003

There is an emergence of Internet applications that have real-time requirements. These applications require IP to support guaranteed capacity, higher priority and lower packet loss rate. To address this, the Internet Engineering Task Force (IETF) is developing a set of protocols and standards for Integrated Services on the Internet. Using RSVP and policies to manage the allocation of network resources in order to provide different levels of service is a topic of great interest to service providers. Currently, it is not possible to dynamically reallocate resources during an application's session. This paper discusses how policies in conjunction with new service class can provide a more enhanced network resource allocation by allowing for this dynamic reallocation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.159-168
• /
• 1997

This paper presents a mechanism which supplies tasks with fast turn-around time on real-time multimedia environments. Tasks are classified into periodic and aperiodic tasks according to their executing period, and the types of them are classified into three groups : critical tasks, essential tasks and common tasks by the degree of its urgency. In the case of periodic tasks, we defer the execution of it within the extent to keep the deadline as long as possible and serve the aperiodic tasks, and provide aperiodic tasks with fast turn-around time. Changing the priority of each task is allowed within the same type and it is scheduled by using the dynamic priority. The emergency tasks are executed within deadline in any circumstances, and the least laxity one is served first when many real-time tasks are waiting for execution. The result of simulation shows that the proposed mechanism is better than the EDZL, known as suboptimal in multiprocessor systems, in the point of rum-around time.

• Journal of Biosystems Engineering
• /
• v.38 no.2
• /
• pp.138-148
• /
• 2013

Purpose: Determining an appropriate path is a top priority in order for a robot to maneuver in a dynamically efficient way especially in a pick-and-place task. In a non-standardized work environment, current robot arm executes its motion based on the kinematic displacements of joint variables, though resulting motion is not dynamically optimal. In this research we suggest analyzing and applying motion patterns of the human arm as an alternative to perform near optimum motion trajectory for arbitrary pick-and-place tasks. Methods: Since the motion of a human arm is very complicated and diverse, it was simplified into two links: one from the shoulder to the elbow, and the other from the elbow to the hand. Motion patterns were then divided into horizontal and vertical components and further analyzed using kinematic and dynamic methods. The kinematic analysis was performed based on the D-H parameters and the dynamic analysis was carried out to calculate various parameters such as velocity, acceleration, torque, and energy using the Newton-Euler equation of motion and Lagrange's equation. In an attempt to assess the efficacy of the analyzed human motion pattern it was compared to the virtual motion pattern created by the joint interpolation method. Results: To demonstrate the efficacy of the human arm motion mechanical and dynamical analyses were performed, followed by the comparison with the virtual robot motion path that was created by the joint interpolation method. Consequently, the human arm was observed to be in motion while the elbow was bent. In return this contributed to the increase of the manipulability and decrease of gravity and torque being exerted on the elbow. In addition, the energy required for the motion decreased. Such phenomenon was more apparent under vertical motion than horizontal motion patterns, and in shorter paths than in longer ones. Thus, one can minimize the abrasion of joints by lowering the stress applied to the bones, muscles, and joints. From the perspectives of energy and durability, the robot arm will be able to utilize its motor most effectively by adopting the motion pattern of human arm. Conclusions: By applying the motion pattern of human arm to the robot arm motion, increase in efficiency and durability is expected, which will eventually produce robots capable of moving in an energy-efficient manner.

• Earthquakes and Structures
• /
• v.11 no.2
• /
• pp.195-215
• /
• 2016

Rehabilitation of historical unreinforced masonry (URM) buildings is a priority in many parts of the world, since those buildings are a living part of history and a testament of human achievement of the era of their construction. Many of these buildings are still operational; comprising brittle materials with no reinforcements, with spatially distributed mass and stiffness, they are not encompassed by current seismic assessment procedures that have been developed for other structural types. To facilitate the difficult task of selecting a proper rehabilitation strategy - often restricted by international treaties for non-invasiveness and reversibility of the intervention - and given the practical requirements for the buildings' intended reuse, this paper presents a practical procedure for assessment of seismic demands of URM buildings - mainly historical constructions that lack a well-defined diaphragm action. A key ingredient of the method is approximation of the spatial shape of lateral translation, ${\Phi}$, that the building assumes when subjected to a uniform field of lateral acceleration. Using ${\Phi}$ as a 3-D shape function, the dynamic response of the system is evaluated, using the concepts of SDOF approximation of continuous systems. This enables determination of the envelope of the developed deformations and the tendency for deformation and damage localization throughout the examined building for a given design earthquake scenario. Deformation demands are specified in terms of relative drift ratios referring to the in-plane and the out-of-plane seismic response of the building's structural elements. Drift ratio demands are compared with drift capacities associated with predefined performance limits. The accuracy of the introduced procedure is evaluated through (a) comparison of the response profiles with those obtained from detailed time-history dynamic analysis using a suite of ten strong ground motion records, five of which with near-field characteristics, and (b) evaluation of the performance assessment results with observations reported in reconnaissance reports of the field performance of two neoclassical torsionally-sensitive historical buildings, located in Thessaloniki, Greece, which survived a major earthquake in the past.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8B
• /
• pp.509-520
• /
• 2007

In this paper, we propose a real-time sensor node platform that guarantees the real-time scheduling of periodic and aperiodic tasks through a multitask-based software decomposition technique. Since existing sensor networking operation systems available in literature are not capable of supporting the real-time scheduling of periodic and aperiodic tasks, the preemption of aperiodic task with high priority can block periodic tasks, and so periodic tasks are likely to miss their deadlines. This paper presents a comprehensive evaluation of how to structure periodic or aperiodic task decomposition in real-time sensor-networking platforms as regard to guaranteeing the deadlines of all the periodic tasks and aiming to providing aperiodic tasks with average good response time. A case study based on real system experiments is conducted to illustrate the application and efficiency of the multitask-based dynamic component execution environment in the sensor node equipped with a low-power 8-bit microcontroller, an IEEE802.15.4 compliant 2.4GHz RF transceiver, and several sensors. It shows that our periodic and aperiodic task decomposition technique yields efficient performance in terms of three significant, objective goals: deadline miss ratio of periodic tasks, average response time of aperiodic tasks, and processor utilization of periodic and aperiodic tasks.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.12 no.6
• /
• pp.2760-2769
• /
• 2011

An intelligent autonomous robot generates a plan to achieve a goal. A plan is a sequence of robot actions that accomplish a given mission by being successfully executed. However, in the complex and dynamic real world, a robot may encounter unexpected situations and may not execute its planned actions any more. Therefore, an intelligent autonomous robot must prepare an efficient handling process to cope with these situations to successfully complete a given mission. Plan repair with milestone states is an efficient method to cope with the situation. It retains the advantages of other plan repair procedures. This paper proposes a regressive method of formulating milestone states and a method of assigning weighting values on conditions that compose a milestone state. The task to repair a plan may employ the weighting values as its job priority. The regressive method formulates less complex milestone states and leads to the conditions of a milestone state to take pertinent weighting values for an efficient handling procedure to repair a plan with milestone states.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1589-1598
• /
• 2014

To support the WBAN, IEEE 802.15 Task Group 6 announced standardized documents on technical requirements of the PHY and MAC. In the IEEE 802.15.6 MAC protocol, CSMA/CA(Carrier Sense Multiple Access with Collision Avoidance) algorithm is performed based on the eight-level priorities according to the type of traffics of the periodic data from medical sensor nodes. Several nodes, which detected the changed bio signals, transmit emergency data at the same time, so latency could be higher than emergency latency and energy consumption will increase. In this thesis, we proposed a CSMA/CA algorithm in WBAN to solve these problems. Simulations are performed using a Castalia based on the OMNeT++ network simulation framework to estimate the performance of the proposed superframe and algorithms. Performance evaluation results show that the packet transmission success rate and energy efficiency are improved by reducing the probability of collision using the proposed MAC protocol.