• Journal of the Optical Society of Korea
• /
• 제20권5호
• /
• pp.614-622
• /
• 2016

In this paper, we propose a novel differential equation method for designing a total internal reflection (TIR) LED lens with double freeform surfaces. A complete set of simultaneous differential equations for the method is derived from the condition for minimizing the Fresnel loss, illumination models, Snell’s Law of ray propagation, and a new constraint on the incident angle of a ray on the light-exiting surface of the lens. The last constraint is essential to complete the set of simultaneous differential equations. By adopting the TIR structure and applying the condition for minimizing the Fresnel loss, it is expected that the proposed TIR LED lens can have a high luminous flux efficiency, even though its beam-spread angle is narrow. To validate the proposed method, three TIR LED lenses with beam-spread angles of less than 22.6° have been designed, and their performances evaluated by ray tracing. Their luminous flux efficiencies could be obviously increased by at least 35% and 5%, compared to conventional LED lenses with a single freeform surface and with double freeform surfaces, respectively.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1989년도 추계학술대회 논문집 학회본부
• /
• pp.191-193
• /
• 1989

This paper presents a optimal Var allocation algorithm for minimizing power loss and improving voltage profile in a given system. In this paper, nodal input data is considered as Gaussian distribution with their mean value and their variance. A stochastic Linear Programming technique based on chance constrained method is applied to solve the probabilistic constraint. The test result in IEEE-14 Bus model system showes that the voltage distribution of load buses is improved and the power loss is more reduced than before Var allocation.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1994년도 하계학술대회 논문집 A
• /
• pp.150-152
• /
• 1994

In this paper, the optimum shape design of stator slot of induction motors for iron loss reduction is proposed. To obtain the flux distribution in induction motors, 2-D finite element method with voltage source is employed. The iron loss is calculated from the iron loss data given by the iron manufacturer. To calculate the sensitivity of iron loss to shape variation, the sensitivity analysis of discrete approach is used. The proposed algorithm is applied to a 3-phase squirrel cage induction motor. The nodes at stator slot boundary of the induction motor are defined as design parameters. By controlling these parameters under the constant volume of iron, we can minimize the iron loss. Furthermore, the stator copper loss is reduced by increasing the slot area. So the stator slot area is determined at the point that the summation of iron loss and copper loss of stator is minimized. Since the constraint of constant volume of iron is nonlinear to the design parameters, the Gradient Projection method is used as an optimization algorithm.

• 한국국방경영분석학회지
• /
• 제36권2호
• /
• pp.1-10
• /
• 2010

Learning rate is generally applied to estimate an appropriate production labor cost. Learning effect is obtained from repetitive work during the production period under 3 assumptions ; homogeneous production, same producer, quantity measure in continuous unit. However, production breaks occur frequently in Korean defense industry environment because of budget constraint and annual requirements. In this case previous learning effect can not be applied due to learning loss. This paper proposed the application of learning rate when a production break occurs in Korea defense industry. To obtain a learning loss, we surveyed various learning loss factors for different production breaks(6, 12, 18 months) from 4 defense industry companies. Then, we estimate the first unit labor hours in re-production phase after production break using Anderlohr method and Retrograde method with the result of the survey. This work is the first attempt to show a method which defines and evaluates the learning loss factors in Korean defense industry environment.

• Journal of Mechanical Science and Technology
• /
• 제17권9호
• /
• pp.1287-1296
• /
• 2003

In this paper the dynamic analysis of the Macpherson strut motor-vehicle suspension system is presented. The equations of motion are formulated using a two-step transformation. Initially, the equations of motion are derived for a dynamically equivalent constrained system of particles that replaces the rigid bodies by applying Newton's second law The equations of motion are then transformed to a reduced set in terms of the relative joint variables. Use of both Cartesian and joint variables produces an efficient set of equations without loss of generality For open chains, this process automatically eliminates all of the non-working constraint forces and leads to an efficient solution and integration of the equations of motion. For closed loops, suitable joints should be cut and few cut-joints constraint equations should be included for each closed chain. The chosen suspension includes open and closed loops with quarter-car model. The results of the simulation indicate the simplicity and generality of the dynamic formulation.

• Journal of information and communication convergence engineering
• /
• 제5권1호
• /
• pp.29-34
• /
• 2007

This paper proposes a MAC protocol for real-time VBR (rt-VBR) services in wireless ATM networks. The proposed protocol is characterized by a contention-based mechanism of the reservation request, a contention-free polling scheme for transferring the dynamic parameters, and a priority scheme of the slot allocation. The design objective of the proposed protocol is to guarantee the real-time constraint of rt-VBR traffic. The scheduling algorithm uses a priority scheme based on the maximum cell transfer delay parameter. The wireless terminal establishes an rt-VBR connection to the base station with a contention-based scheme. The base station scheduler allocates a dynamic parameter minislot to the wireless terminal for transferring the residual lifetime and the number of requesting slots as the dynamic parameters. Based on the received dynamic parameters, the scheduler allocates the uplink slots to the wireless terminal with the most stringent delay requirement. The simulation results show that the proposed protocol can guarantee the delay constraint of rt-VBR services along with its cell loss rate significantly reduced.

• 한국소음진동공학회:학술대회논문집
• /
• 한국소음진동공학회 2007년도 춘계학술대회논문집
• /
• pp.1023-1026
• /
• 2007

Optimal damping layout of the constrained viscoelastic damping layer on beam is identified with temperatures by using a gradient-based numerical search algorithm. An optimal design problem is defined in order to determine the constrained damping layer configuration. A finite element formulation is introduced to model the constrained damping layer beam. The four-parameter fractional derivative model and the Arrhenius shift factor are used to describe dynamic characteristics of viscoelastic material with respect to frequency and temperature. Frequency-dependent complex-valued eigenvalue problems are solved by using a simple resubstitution algorithm in order to obtain the loss factor of each mode and responses of the structure. The results of the numerical example show that the proposed method can reduce frequency responses of beam at peaks only by reconfiguring the layout of constrained damping layer within a limited weight constraint.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 추계학술대회 논문집 학회본부 A
• /
• pp.6-9
• /
• 2000

This paper presents the detailed derivation of optimal nodal price for active power to regionally evaluate system loss and congestion cost. The method is to decompose them into different components corresponding to system loss, transmission congestion, voltage constraint, and so on. The decomposed information for nodal price can be used to provide economic signals for generation or transmission investment as well as to improve the efficient usage of power grid and congestion management. The result of case study on IEEE 30 bus system is reported to illustrate the proposed method.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권4호
• /
• pp.371-378
• /
• 1999

This paper presents an efficient algorithm for loss reduction of distribution system by automatic sectionalizing switch operation in large scale distribution systems of radial type. Simulated Annealing algorithm among optimization techniques can avoid escape from local minima by accepting improvements in cost, but the use of this algorithm is also responsible for an excessive computation time requirement. To overcome this major limitation of Simulated Annealing algorithm, we may use advanced Simulated Annealing algorithm. All constaints are divided into two constraint group by using perturbation mechanism and penalty factor, so all trail solutions are feasible. The polynomial-time cooling schedule is used which is based on the statistics calculation during the search. This approaches results in saving CPU time. Numerical examples demonstrate the validity and effectiveness of the proposed methodology.

• 한국정보과학회논문지:시스템및이론
• /
• 제26권10호
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.