• Journal of Astronomy and Space Sciences
• /
• v.36 no.3
• /
• pp.159-168
• /
• 2019

In solstices during the solar minimum, the hemispheric difference of the equatorial ionization anomaly (EIA) intensity (hereafter hemispheric asymmetry) is understood as being opposite in the morning and afternoon. This phenomenon is explained by the temporal variation of the combined effects of the fountain process and interhemispheric wind. However, the mechanism applied to the observations during the solar minimum has not yet been validated with observations made during other periods of the solar cycle. We investigate the variability of the hemispheric asymmetry with local time (LT), altitude, season, and solar cycle using the electron density taken by the CHAllenging Minisatellite Payload satellite and the global total electron content (TEC) maps acquired during 2001-2008. The electron density profiles provided by the Constellation Observing System for Meteorology, Ionosphere, and Climate satellites during 2007-2008 are also used to investigate the variation of the hemispheric asymmetry with altitude during the solar minimum. During the solar minimum, the location of a stronger EIA moves from the winter hemisphere to the summer hemisphere around 1200-1400 LT. The reversal of the hemispheric asymmetry is more clearly visible in the F-peak density than in TEC or in topside plasma density. During the solar maximum, the EIA in the winter hemisphere is stronger than that in the summer hemisphere in both the morning and afternoon. When the location of a stronger EIA in the afternoon is viewed as a function of the year, the transition from the winter hemisphere to the summer hemisphere occurs near 2004 (yearly average F10.7 index = 106). We discuss the mechanisms that cause the variation of the hemispheric asymmetry with LT and solar cycle.

• Journal of the Korean Society for Precision Engineering
• /
• v.12 no.12
• /
• pp.165-172
• /
• 1995

Many algorithms to enhance a speed performance of a robot have been studied, but it's rare to consider disign aspect of a robot arm for time optimal problem. In this paper, section demensions of a robot arm and a velocity profile of an end-effector were optimally designed to minimize the cycle time. Capacity of actuators, deflections of end-effector, and a fundamental natural frequency of the robot arm were constrained in optimal design. For a given path with a trapezoidal velocity profile, torques of each joint were calculated using the inverse kinematics and dynamics. For the SCARA type robot which is mainly used for assembly tasks, the time optimal design of each robot arm id presented with the above constraints.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1503-1514
• /
• 2006

Today, consumers can access Internet from everywhere, therefore most commercial and other organizations provide their services on the Web. As the result, countless Web service systems are already on the Internet and more systems are under construction. Therefore, many researches of verifying that the system to be constructed will not have any deadlock and will run successfully without any problem at the early stage of design have been performed. Several Petri net based verification methods have also been published. However, they have focused on building Petri net models of Web service systems and none of them introduces efficient analysis methods. As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the real world is a stochastic number in general. Therefore, this paper proposes 'Mixedly Distributed Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net'. We also introduce a method of analysing a Web service system's response time with the minimum cycle time analysis method for 'Mixedly Distributed Stochastic Timed Net.'.

• IE interfaces
• /
• v.14 no.1
• /
• pp.95-105
• /
• 2001

Previous work measurement methods need much time and effort of time study analysts because they have to measure required time through direct observations. In this study, we propose a method which efficiently measures standard times without involvement of human analysts using digital image processing techniques. This method consists of two main steps: motion representation step and cycle segmentation step. In motion representation step, we first detect the motion of any object distinct from its background by differencing two consecutive images separated by a constant time interval. The images thus obtained then pass through an edge detector filter. Finally, the mean values of coordinates of significant pixels of the edge image are obtained. Through these processes, the motions of the observed worker are represented by two time series data of worker location in horizontal and vertical axes. In the second step, called the cycle segmentation step, we extract the frames which have maximum or minimum coordinates in one cycle and store them in a stack, and calculate each cycle time using these frames. In this step we also consider methods on how to detect work delays due to unexpected events such as operator's escapement from the work area, or interruptions. To condude, the experimental results show that the proposed method is very cost-effective and useful for measuring time standards for various work environment.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2021.06a
• /
• pp.145-145
• /
• 2021

Water distribution networks (WDNs) are designed to satisfy water requirement of an urban community. One of the central issues in human history is providing sufficient quality and quantity of water through WDNs. A WDN consists of a great number of pipelines with different ages, lengths, materials, and sizes in varying degrees of deterioration. The available annual budget for rehabilitation of these infrastructures only covers part of the network; thus it is important to manage the limited budget in the most cost-effective manner. In this study, a novel pipe replacement scheduling approach is proposed in order to smooth the annual investment time series based on a life cycle cost assessment. The proposed approach is applied to a real WDN currently operating in South Korea. The proposed scheduling plan considers both the annual budget limitation and the optimum investment on pipes' useful life. A non-dominated sorting genetic algorithm is used to solve a multi-objective optimization problem. Three decision-making objectives, including the minimum imposed LCC of the network, the minimum standard deviation of annual cost, and the minimum average age of the network, are considered to find optimal pipe replacement planning over long-term time period. The results indicate that the proposed scheduling structure provides efficient and cost-effective rehabilitation management of water network with consistent annual budget.

• Journal of Korean Society of Transportation
• /
• v.12 no.1
• /
• pp.55-73
• /
• 1994

The objective of this research is to evaluate the pedestrian signal time involving green and flashing green times. The minimum pedestrian green indication should give time for pedestrian to start crossing safely, and the flashing green indication should give time to complete the crossing. An average pedestrian crossing speed of 1.1(m/s) was estimated by analyzing the field data which was slower than the 1.2(m/s) currently used. Furthermore, the study proposed that design speed for the flashing green time should be slow speed for considerations pedestrian safety, not the average speed. The 0.78-1.01(m/s) of pedestrian speed was estimated at the elementary school areas that indicated 0.2(m/s) slower than the other areas. The pedestrian starting time (perception/reaction time) and time headway from front to back of herd was estimated to determine minimum pedestrian green time. the pedestrian starting time was estimated to determine minimum pedestrian green time. The pedestrian starting time was ranged 2.52-4.29 seconds. The time interval between the pedestrian rows was found to be 1.25-1.86 seconds, which declines as the pedestrian rows increases, The equation to calculate the pedestrian signal, which declines as the pedestrian rows increases. The equation to calculate the pedestrian signal time is proposed using the pedestrian starting time, the time interval between the pedestrian rows, and pedestrian crossing speed given area types (commercial, business, mixed, and elementary school areas), number of both-directional pedestrians for a cycle, crosswalk length and width.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1805-1810
• /
• 1991

This paper derives the upper and the lower bound of the mean cycle time and the mean service time of the class 6 and the class 4, within which the minimum utilization constrain of the class 4 is guaranteed. Also, derived are conditions under which the token bus network is stable or unstable. These bounds and stable conditions are represented in terms of the high priority token hold time, the token rotation time and the arrival rate and the total station number etc. This paper suggest a parameter tuning algorithm in a partially symmetric token bus network with two classes, which maximizes the token rotation time for a suitable high priority token hold time and at the same time meets the stability condition of the network, the real time constraint and the minimum utilization constraint of the class 4.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.43 no.1
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.2
• /
• pp.429-434
• /
• 2017

In a graph G=(V, E) with n vertices, there is an unique box which is finally laid on each vertex. Thus each vertex and box is both numbered from 1 to n and the box i should be laid on the vertex i. But, the box ${\pi}$(i) is initially located on the vertex i according to a permutation ${\pi}$. In each step, the robot can walk along an edge of G and can carry at most one box at a time. Also when arriving at a vertex, the robot can swap the box placed there with the box it is carrying. The problem is to minimize the total step so that every vertex has its own box, that is, the shuffled boxes are sorted. In this paper, we shall find an upper bound of the minimum number of steps and show that the movement of the robot is found in $O(n^2)$ time when G is a cycle.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.04a
• /
• pp.305-312
• /
• 1999

This study is intended to propose a systematic and practical life cycle cost(LCC) model for the development of the reliability-based seismic safety and cost-effective performance criteria for design and upgrading of long-span PC bridges. The LCC models consist of five cost functions such as initial cost, repair/replacement cost, human losses, road user cost, and indirect losses of regional economy. The proposed model Is successfully expressed in temrs of Park-Ang damage indices and life cycle damage probability obtained from SMART-DRAIN-2DX which is an existing algorithm for nonlinear time history analysis. The proposed LCC model is successfully applied to a viaduct constructed by PSM, in Seoul. Based on the observations, the proposed systematic procedure for the formulation of LCC model may be useful for the development of the reliability-based seismic safety and cost-effective performance criteria for design and upgrading of long-span PC bridges.