• Proceedings of the IEEK Conference
• /
• 2002.06b
• /
• pp.101-104
• /
• 2002

This paper propose that is algorithm of power dissipation reduction in the high level synthesis design for DSP(Digital Signal Processor), as the portable terminal system recently demand high power dissipation. This paper obtain effect of power dissipation reduction and switching activity that increase correlation of operands as input data of function unit. The algorithm search loop or repeatedly data to the input operands of function unit. That can be reduce the power dissipation using the new low power high level synthesis algorithm. In this Paper, scheduling operation search same nodes from input DFG(Data Flow Graph) with correlation coefficient of first input node and among nodes. Function units consist a multiplier, an adder and a register. The power estimation method is added switching activity for each bits of nodes. The power estimation have good efficient using proposed algorithm. This paper result obtain more Power reduction of fifty percents after using a new low power algorithm in a function unit as multiplier.

• Proceedings of the KIPE Conference
• /
• 2003.07b
• /
• pp.925-928
• /
• 2003

As the maximum power operating point(MPOP) of photovoltaic(PV) power generation systems changes with changing atmospheric conditions such as solar radiation and temperature, an important consideration in the design of efficient PV system is to track the MPOP correctly. Many maximum power point tracking(MPPT) techniques have been considered in the past, however, techniques using microprocessors with appropriate MPPT algorithms are favored because of their flexibility and compatibility with different PV arrays. Although the efficiency of these MPPT algorithms is usually high, it drops noticeably in case of rapidly changing atmospheric conditions. This paper proposed a new MPPT algorithm based on perturb & observe(P&O) algorithm with experiment. The results shows that the new P&O algorithm has successfully tracked the MPOP, even in case of rapidly changing atmospheric conditions, and has higher efficiency than ordinary algorithms.

• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.43-53
• /
• 2004

The distributed OCSP (Online Certificate Status Protocol), composed of multiple responders, is a model that enhances the utilization of each responder and reduces the response time. In a multi-user distributed environment, load balancing mechanism must be developed for the improvement of the performance of the whole system. Conservative load balancing algorithms often ignore the communication cost of gathering the information of responders. As the number of request is increased, however, fail to consider the communication cost may cause serious problems since the communication time is too large to disregard. We propose an adaptive load balancing algorithm and evaluate the effectiveness by performing modeling and simulation. The principal advantage of new algorithm is in their simplicity: there is no need to maintain and process system state information. We evaluated the quality of load balancing achieved by the new algorithm by comparing the queue size of responders and analyzing the utilization of these responders. The simulation results show how efficiently load balancing is done with the new algorithm.

• Proceedings of the KIEE Conference
• /
• 1998.07a
• /
• pp.70-72
• /
• 1998

This paper discusses the development of a new optimization algorithm for DC motor design. In principle, the new algorithm utilizes a mixed method that consists of genetic algorithms in conjunction with direct search method. The genetic algorithms are used for locating the global optimum region while the direct search method is used to achieve objective function convergence. In order to validate the effectiveness, the new algorithm has been applied to an actual DC motor. Field and torque characteristics of the DC motor are computed using finite element method and the principle of virtual work, respectively.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.39 no.1
• /
• pp.51-59
• /
• 1990

In this paper, a new variable structure control algorithm is proposed to reduce the reaching time on a phase plane. In the new method, a term proportional to the magnitude of the switching variables is added to the Morgan and Ozguners algorithm. When this algorithm is applied to second order systems the simulation results show that the new approach of the control algorithm is more effective than morgan's algorithm.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.8 no.5
• /
• pp.1069-1075
• /
• 2007

New BESA cryptographic algorithm is suitable network environment and wire/wireless communication network, on implement easy, security rate preservation, scalable & reconfigurable. Though proposed algorithm strengthens security vulnerability of TCP/IP protocol and keep security about many user as that have authentication function in network environment, there is important purpose. So that new BESA cryptographic algorithm implemented by hardware base cryptosystem and en/decryption is achieved at the same time, composed architecture.

• PNF and Movement
• /
• v.13 no.2
• /
• pp.55-72
• /
• 2015

Purpose: The purpose of this study was to propose a new therapy algorithm that combines motor imagery and physiotherapy as a physiotherapeutic clinical intervention technique that can stimulate the recovery of damaged physical function for patients with stroke. Methods: A variety of scientific research results related to motor imagery were reviewed and analyzed to investigate their applicability to physiotherapy in clinics. Results: As a new therapy algorithm for the therapeutic approach of motor imagery in stroke rehabilitation, a therapy algorithm that combines motor imagery with physiotherapy is proposed, which consists of three stages or steps: STEP 1 motor imagery familiarization, STEP 2 explicit learning stage, and STEP 3 implicit learning. Conclusion: The new therapy algorithm proposed in this study is expected to be a very useful clinical therapeutic approach for stimulating the recovery of damaged physical function in patients with stroke. It is believed that it will be necessary to confirm and standardize the effects of the therapeutic algorithm proposed in this study in the future by conducting diverse clinical studies.

• ETRI Journal
• /
• v.40 no.6
• /
• pp.774-787
• /
• 2018

Arabic handwriting segmentation and recognition is an area of research that has not yet been fully understood. Dealing with Arabic ligature segmentation, where the Arabic characters are connected and unconstrained naturally, is one of the fundamental problems when dealing with the Arabic script. Arabic character-recognition techniques consider ligatures as new classes in addition to the classes of the Arabic characters. This paper introduces an enhanced technique for Arabic handwriting recognition using the deep belief network (DBN) and a new morphological algorithm for ligature segmentation. There are two main stages for the implementation of this technique. The first stage involves an enhanced technique of the Sari segmentation algorithm, where a new ligature segmentation algorithm is developed. The second stage involves the Arabic character recognition using DBNs and support vector machines (SVMs). The two stages are tested on the IFN/ENIT and HACDB databases, and the results obtained proved the effectiveness of the proposed algorithm compared with other existing systems.

• Korean Journal of Computational Design and Engineering
• /
• v.2 no.4
• /
• pp.215-221
• /
• 1997

A new approach in solving design centering problem is presented. Like most stochastic optimization problems, optimal design centering problems have intrinsic difficulties in multivariate intergration of probability density functions. In order to avoid to avoid those difficulties, genetic algorithm and very coarse Monte Carlo simulation are used in this research. The new algorithm performs robustly while producing improved yields. This result implies that the combination of robust optimization methods and approximated simulation schemes would give promising ways for many stochastic optimizations which are inappropriate for mathematical programming.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.15 no.4
• /
• pp.267-275
• /
• 2011

This paper proposes a new quickly convergent pattern search quasi-Newton algorithm that employs the multi-step version of the Symmetric Rank One (SRI). The new algorithm works on the factorizations of the inverse Hessian approximations to make available a sequence of convergent positive bases required by the pattern search process. The algorithm, in principle, resembles that developed in [1] with multi-step methods dominating the dervation and with numerical improvements incurred, as shown by the numerical results presented herein.