• Proceedings of the Korean Society for Noise and Vibration Engineering Conference
• /
• 2006.11a
• /
• pp.840-843
• /
• 2006

The determination of firing order is very significant procedure in initial stage of design for medium speed diesel engine. Generally, the selection of firing order has been accomplished in view of minimum excitation forces condition. In this paper all possible firing orders under the given number of cylinder were considered to decide the optimum. Meanwhile torsional vibration characteristics using the phase vector sum method and minimum excitation force concept were applied. From these results, some superior cases were selected. And then, the torsional vibration response analysis and the resonance characteristics of engine structure were investigated for the final decision.

• Structural Engineering and Mechanics
• /
• v.16 no.2
• /
• pp.141-152
• /
• 2003

Characteristics of solutions of softening plasticity are discussed in this article. The localized and non-localized solutions are obtained for a three-bar truss and their stability is evaluated with the aid of the second-order work. Beyond the bifurcation point, the single stable loading path splits into several post-bifurcation paths and the second-order work exhibits several competing minima. Among the multiple post-bifurcation equilibrium states, the localized solutions correspond to the minimum points of the second-order work, while the non-localized solutions correspond to the saddles and local maximum points. To determine the real post-bifurcation path, it is proposed that the structure should follow the path corresponding to the absolute minimum point of the second-order work. The proposal is further proved equivalent to Bazant's path criterion derived on a thermodynamics basis.

• 한국태양에너지학회:학술대회논문집
• /
• 2008.11a
• /
• pp.63-68
• /
• 2008

Efforts tp overcome the current challenge of global warming and abnormal temperature are being taken around the world. According to a report, average temperature of Korea has increased by about $0.8^{\circ}C$ for a century. In particular, temperature has rapidly increased since year 2000. Climate changes have brought remarkable changes in our lives. For example, agricultural field will see changes in crops and production. Energy used to maintain and manage architectures will be changed as well. In order to actively cope with rapidly changing global climate which drives changes from the basic behavior of our lives to subtle changes, international cooperation and researches are performed around the word. For instance, as a part of these global efforts, research on typical meterological data for computer simulation program to evaluate architecture energy performance is in progress in Korea. In order to conduct research on typical meterological data in format of data per time, reference regarding monthly maximum/minimum temperature time is required. Unfortunately, however, reference regarding maximum/minimum temperature time hasn't been defined in Korea. Therefore, this study aims to provide fundamental data essential for various researches by calculating maximum/minimum temperature time of major cities across Korea. According to the study, maximum temperature occurs at 3 p.m and minimum temperature occurs at 5 a.m or 6 a.m. respectively, in overall areas.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.3 no.6
• /
• pp.612-627
• /
• 2009

The high-level contribution of this paper is to illustrate the effectiveness of using graph theory tree traversal algorithms (pre-order, in-order and post-order traversals) to generate the chain of sensor nodes in the classical Power Efficient-Gathering in Sensor Information Systems (PEGASIS) data aggregation protocol for wireless sensor networks. We first construct an undirected minimum-weight spanning tree (ud-MST) on a complete sensor network graph, wherein the weight of each edge is the Euclidean distance between the constituent nodes of the edge. A Breadth-First-Search of the ud-MST, starting with the node located closest to the center of the network, is now conducted to iteratively construct a rooted directed minimum-weight spanning tree (rd-MST). The three tree traversal algorithms are then executed on the rd-MST and the node sequence resulting from each of the traversals is used as the chain of nodes for the PEGASIS protocol. Simulation studies on PEGASIS conducted for both TDMA and CDMA systems illustrate that using the chain of nodes generated from the tree traversal algorithms, the node lifetime can improve as large as by 19%-30% and at the same time, the energy loss per node can be 19%-35% lower than that obtained with the currently used distance-based greedy heuristic.

• Journal of Electrical Engineering and Technology
• /
• v.12 no.1
• /
• pp.272-283
• /
• 2017

In this paper, an improved predictive functional control (PFC) scheme for permanent magnet synchronous motor (PMSM) control system is proposed, on account of the standard PFC method cannot provides a satisfying disturbance rejection performance in the case of strong disturbances. The PFC-based method is first introduced in the control design of speed loop, since the good tracking and robustness properties of the PFC heavily depend on the accuracy of the internal model of the plant. However, in orthodox design of prediction model based control method, disturbances are not considered in the prediction model as well as the control design. A minimum-order observer (MOO) is introduced to estimate the disturbances, which structure is simple and can be realized at a low computational load. This paper adopted the MOO to observe the load torque, and the observations are then fed back into PFC model to rebuild it when considering the influence of perturbation. Therefore, an improved PFC strategy with torque compensation, called the PFC+MOO method, is presented. The validity of the proposed method was tested via simulation and experiments. Excellent results were obtained with respect to the speed trajectory tracking, stability, and disturbance rejection.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.289-293
• /
• 2000

We propose two new algorithms for parallelism-independent scheduling. The machine code generated from the compiler using these algorithms in its scheduling phase is parallelism-independent code, executable in minimum time regardless of the number of the processors in the parallel computer. Our new algorithms have the following phases: finding the minimum number of processors on which the program can be executed in minimal time, scheduling by an heuristic algorithm for this predefined number of processors, and serialization of the parallel schedule according to the earliest start time of the tasks. At run time tasks are taken from the serialized schedule and assigned to the processor which allows the earliest start time of the task. The order of the tasks decided at compile time is not changed at run time regardless of the number of the available processors which means there is no out-of-order issue and execution. The scheduling is done predominantly at compile time and dynamic scheduling is minimized and diminished to allocation of the tasks to the processors. We evaluate the proposed algorithms by comparing them in terms of schedule length to the CP/MISF algorithm. For performance evaluation we use both randomly generated DAGs (directed acyclic graphs) and DACs representing real applications. From practical point of view, the algorithms we propose can be successfully used for scheduling programs for in-order superscalar processors and shared memory multiprocessor systems. Superscalar processors with any number of functional units can execute the parallelism-independent code in minimum time without necessity for dynamic scheduling and out-of-order issue hardware. This means that the use of our algorithms will lead to reducing the complexity of the hardware of the processors and the run-time overhead related to the dynamic scheduling.

• International Journal of Contents
• /
• v.3 no.1
• /
• pp.1-8
• /
• 2007

The distributions of the minimum correlated F-variable arises in many applied statistical problems including simultaneous analysis of variance (SANOVA), equality of variance, selection and ranking populations, and reliability analysis. In this paper, negative binomial sampling technique is employed to derive the distributions of the minimum of chi-square variables and hence the distributions of the minimum correlated F-variables. The work presented in this paper is divided in two parts. The first part is devoted to develop some combinatorial identities arised from the negative binomial sampling. These identities are constructed and justified to serve important purpose, when we deal with these distributions or their characteristics. Other important results including cumulants and moments of these distributions are also given in somewhat simple forms. Second, the distributions of minimum, chisquare variable and hence the distribution of the minimum correlated F-variables are then derived within the negative binomial sampling framework. Although, multinomial theory applied to order statistics and standard transformation techniques can be used to derive these distributions, the negative binomial sampling approach provides more information regarding the nature of the relationship between the sampling vehicle and the probability distributions of these functions of chi-square variables. We also provide an algorithm to compute the percentage points of the distributions. The computation methods we adopted are exact and no interpolations are involved.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.22 no.2
• /
• pp.31-35
• /
• 1985

This paper presents novel designs of a digital minimum-time controller and a digital adaptive controller using reference no del for single input-single out put linear time-invariant plants with known parameters. The proposed digital minimum-time controller which has a deadbeat response is designed to make the transfer function of this controller equal to that of reference model, and the proposed digital adaptive controller is designed by applying the adaptation method to the proposed digital minimum-time controller. The designs of these two controllers are very simple and easy, and all types of input signal with any reference models are controllable. These dffectivenesses have been demon-strated by computer simulations carried out for a third-order plant.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.24 no.10
• /
• pp.130-135
• /
• 2010

In this paper, the shading ratio about to output the minimum critical power of a photovoltaic panel was determined by experiment and simulation. A 2.475[kW] poly-crystalline photovoltaic panel consisting of 11 modules was used in the experiment and its surface was covered with shading curtains, thus the amount of light incident to the modules were controlled. In order to compare with the experimental results, the experimental circuits were modelled with the CASPOC (power electronics electrical drives simulator) and module parameters were applied to it, by which the minimum critical power was calculated. As a result, the photovoltaic panel was about to generate the power when the 5th shading curtains were removed from the module surface, after then the output power linearly increased by removing the shading curtains. In addition, the CASPOC simulation results were similar to the experimental results in the abrupt decreasing pattern of power.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.29 no.2
• /
• pp.33-39
• /
• 2015

Power supplying capacity of the distribution feeder should be maintained within thermal capacity of the wire. This paper presents the minimum spanning tree based load balancing technique to release multiple overloading of distribution feeders. In order to minimize number of involved backup feeders, Dijkstra and Prim algorithm are adopted to construct minimum spanning tree. Simulation testing result based on part of KEPCO's commercial distribution systems shows effectiveness of proposed scheme.