• KIEE International Transactions on Power Engineering
• /
• v.5A no.2
• /
• pp.177-185
• /
• 2005

This paper proposes an expert system that can enhance the accuracy of real-time bus reconfiguration strategy by adopting the local minimum tree search method and that can minimize the spreading effect of the fault by considering the operating condition when a main transformer fault occurs in an automated substation. The local minimum tree search method is used to expand the best-first search method. This method has the advantage that it can improve the solution performance within the limits of the real-time condition. The inference strategy proposed expert system consists of two stages. The first stage determines the switching candidate set by searching possible switching candidates starting from the main transformer or busbar related to the event. The second stage determines the rational real-time bus reconfiguration strategy based on heuristic rules from the obtained switching candidate set. Also, this paper proposes generalized distribution substation modeling using graph theory, and a substation database based on the study results is designed.

• 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.

• Proceedings of the Safety Management and Science Conference
• /
• 2004.05a
• /
• pp.117-127
• /
• 2004

In U.S.A., minimum wage of New Jersey in April 1, 1992 rose from $4.25 to $5.05. At this assession, there was survey by 410 numbers related back and pro minimum wage in New Jersey and eastern Pennsylvania.. At stores of New Jersey and eastern Pennsylvania, comparison of the increase of employment at constant minimum wag is with estimative effect of increase of minimum wage. Through comparison of stores of low wage and high wage above $5, employment volatility in New Jersey was studied. In U.S.A., increase of minimum wage was not caused to reduce to employment. Contrary to this, result of Korea was not consisted after timing of IMF bailout of 1997. It is because drop of revenue was caused to decrease employees of part-time and full-time job at the viewpoint of cost minimization.

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

This paper proposes a path planning algorithm for mobile robot. To generate an optimal path and minimum time path for a mobile robot, we use the Genetic Algorithm(GA) and Visibility Graph. After finding a minimum-distance between start and goal point, the path is revised to find the minimum time path by path-smoothing algorithm. Simulation results show that the proposed algorithms are more effective.

• Journal of Korea Multimedia Society
• /
• v.8 no.12
• /
• pp.1589-1596
• /
• 2005

The imprecise real-time system provides flexibility in scheduling time-critical tasks. Most scheduling problems of satisfying both 0/1 constraint and timing constraints, while the total error is minimized, are NP complete when the optional tasks have arbitrary processing times. Liu suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on uniprocessors for minimizing the total error. Song et al suggested a reasonable strategy of scheduling tasks with the 0/1 constraint on multiprocessors for minimizing the total error. But, these algorithms are all off-line algorithms. On the other hand, in the case of on line scheduling, Shih and Liu proposed the NORA algorithm which can find a schedule with the minimum total error for a task system consisting solely of on-line tasks that are ready upon arrival. But, for the task system with 0/1 constraint, it has not been known whether the NORA algorithm can be optimal or not in the sense that it guarantees all mandatory tasks are completed by their deadlines and the total error is minimized. So, this paper suggests an optimal algorithm to search minimum total error for the imprecise on-line real-time task system with 0/1 constraint. Furthermore, the proposed algorithm has the same complexity, O(N log N), as the NORA algorithm, where N is the number of tasks.

• Nuclear Engineering and Technology
• /
• v.53 no.4
• /
• pp.1266-1276
• /
• 2021

The mask parameters of a coded aperture are critical design features when optimizing the performance of a gamma-ray camera. In this paper, experiments and Monte Carlo simulations were performed to derive the minimum detectable activity (MDA) when one seeks a real-time imaging capability. First, the impact of the thickness of the modified uniformly redundant array (MURA) mask on the image quality is quantified, and the imaging of point, line, and surface radiation sources is demonstrated using both cross-correlation (CC) and maximum likelihood expectation maximization (MLEM) methods. Second, the minimum detectable activity is also derived for real-time imaging by altering the factors used in the image quality assessment, consisting of the peak-to-noise ratio (PSNR), the normalized mean square error (NMSE), the spatial resolution (full width at half maximum; FWHM), and the structural similarity (SSIM), all evaluated as a function of energy and mask thickness. Sufficiently sharp images were reconstructed when the mask thickness was approximately 2 cm for a source energy between 30 keV and 1.5 MeV and the minimum detectable activity for real-time imaging was 23.7 MBq at 1 m distance for a 1 s collection time.

• The KIPS Transactions:PartA
• /
• v.17A no.2
• /
• pp.103-112
• /
• 2010

Cluster sensor network is a sensor network where input nodes crowd densely around some nuclei. Steiner minimum tree is a tree connecting all input nodes with introducing some additional nodes called Steiner points. This paper proposes a mechanism for efficient construction of a cluster sensor network connecting all sensor nodes and base stations using connections between nodes in each belonged cluster and between every cluster, and using repetitive constructions of approximate Steiner minimum trees. In experiments, while taking 1170.5% percentages more time to build cluster sensor network than the method of Euclidian minimum spanning tree, the proposed mechanism whose time complexity is O($N^2$) could spend only 20.3 percentages more time for building 0.1% added length network in comparison with the method of Euclidian minimum spanning tree. The mechanism could curtail the built trees' average length by maximum 3.7 percentages and by average 1.9 percentages, compared with the average length of trees built by Euclidian minimum spanning tree method.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.495-508
• /
• 2005

We investigated both classical and quantum properties of a damped harmonic oscillator with a time-variable elastic coefficient using invariant operator method. We acquired the energy eigenvalues, uncertainties and probability densities for several types of wave packet. The probability density corresponding to the displaced minimum wave packet expressed in terms of the time-dependent Gaussian function. The displaced minimum wave packet not only be attenuated but also oscillates about x = 0. We confirmed that there exist correspondence between quantum and classical behaviors for the time-dependent damped harmonic oscillator.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.3
• /
• pp.374-382
• /
• 2018

This paper has done a hardware-based approach to increase the modulation index in 3-phase inverters, unlike the conventional software algorithm-based approaches. The minimum required time to measure the currents in a three-phase inverters with shunt resistors has also been analyzed. By the analysis, the longest time in minimum required time is AD conversion time. To shorten the minimum required time, this paper proposed a sample-and-hold(S/H) circuit implemented at the inverter current signal output to retain the current signal. When the linear operation region of an inverter with S/H was compared with that without it, the modulation index was increased by 7.8 %. Inverters with S/H circuits can employ the traditional software algorithms, such as the voltage injection method or current restoration method, and it will yield further increase the modulation index.

• Journal of applied mathematics & informatics
• /
• v.23 no.1_2
• /
• pp.193-203
• /
• 2007

In this paper we consider the inverse minimum flow (ImF) problem, where lower and upper bounds for the flow must be changed as little as possible so that a given feasible flow becomes a minimum flow. A linear time and space method to decide if the problem has solution is presented. Strongly and weakly polynomial algorithms for solving the ImF problem are proposed. Some particular cases are studied and a numerical example is given.