• Title/Summary/Keyword: optimal algorithm

Search Result 6,798, Processing Time 0.034 seconds

Speech Recognition and Its Learning by Neural Networks (신경회로망을 이용한 음성인식과 그 학습)

  • 이권현
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.16 no.4
    • /
    • pp.350-357
    • /
    • 1991
  • A speech recognition system based on a neural network, which can be used for telephon number services was tested. Because in Korea two different cardinal number systems, a koreanic one and a sinokoreanic one, are in use, it is necessary that the used systems is able to recognize 22 discret words. The structure of the neural network used had two layers, also a structure with 3 layers, one hidden layreformed of each 11, 22 and 44 hidden units was tested. During the learning phase of the system the so called BP-algorithm (back propagation) was applied. The process of learning can e influenced by using a different learning factor and also by the method of learning(for instance random or cycle). The optimal rate of speaker independent recognition by using a 2 layer neural network was 96%. A drop of recognition was observed by overtraining. This phenomen appeared more clearly if a 3 layer neural network was used. These phenomens are described in this paper in more detail. Especially the influence of the construction of the neural network and the several states during the learning phase are examined.

  • PDF

A 3-Step Speed Control for Minimizing Energy Consumption for Battery-Powered Wheeled Mobile Robots (배터리로 구동되는 이동 로봇의 에너지 소모 최소화를 위한 3-구간 속도 제어)

  • Kim Byung-Kook;Kim Chong-Hui
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.3
    • /
    • pp.208-220
    • /
    • 2006
  • Energy of wheeled mobile robot is usually supplied by batteries. In order to extend operation time of mobile robots, it is necessary to minimize the energy consumption. The energy is dissipated mostly in the motors, which strongly depends on the velocity profile. This paper investigates various 3-step (acceleration - cruise - deceleration) speed control methods to minimize a new energy object function which considers the practical energy consumption dissipated in motors related to motor control input, velocity profile, and motor dynamics. We performed an analysis on the energy consumption various velocity profile patterns generated by standard control input such as step input, ramp input, parabolic input, and exponential input. Based on these standard control inputs, we analyzed the six 3-step velocity profile patterns: E-C-E, P-C-P, R-C-R, S-C-S, R-C-S, and S-C-R (S means a step control input, R means a ramp control input, P means a parabolic control input, and E means an exponential control input, C means a constant cruise velocity), and suggested an efficient iterative search algorithm with binary search which can find the numerical solution quickly. We performed various computer simulations to show the performance of the energy-optimal 3-step speed control in comparison with a conventional 3-step speed control with a reasonable constant acceleration as a benchmark. Simulation results show that the E-C-E is the most energy efficient 3-step velocity profile pattern, which enables wheeled mobile robot to extend working time up to 50%.

Cycle-by-Cycle Plant Growth Automatic Control Monitoring System using Smart Device (스마트기기를 이용한 주기별 식물 생장 인식 자동 제어 모니터링 시스템)

  • Kim, Kyong-Ock;Kim, Eung-Kon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.8 no.5
    • /
    • pp.745-750
    • /
    • 2013
  • In many recent studies, a variety of environmental control system for practical gardening facilities such as facility house and plant factory have been proposed. However, the plants have been exposed to growth disorder and disease and pest injury because the temperature and humidity have not properly controlled so far. Therefore, a lot of damage of farmers have been reported. The air circulation fan and industrial dehumidifier have been currently utilized as the countermeasures, but they do not meet the expectation. In this study, the growth phase of each plant is recognized by using cycle-by-cycle plants growth recogniztion algorithm to provide optimal environment according to the growth phases of each plant.he productivity can be raised by using cycle-by-cycle plant growth recognition monitoring system because it optimally controls the environment by cycle that is required for plant growth.

A Study on the Evaluation of Optimal Program Applicability for Face Recognition Using Machine Learning (기계학습을 이용한 얼굴 인식을 위한 최적 프로그램 적용성 평가에 대한 연구)

  • Kim, Min-Ho;Jo, Ki-Yong;You, Hee-Won;Lee, Jung-Yeal;Baek, Un-Bae
    • Korean Journal of Artificial Intelligence
    • /
    • v.5 no.1
    • /
    • pp.10-17
    • /
    • 2017
  • This study is the first attempt to raise face recognition ability through machine learning algorithm and apply to CRM's information gathering, analysis and application. In other words, through face recognition of VIP customer in distribution field, we can proceed more prompt and subdivided customized services. The interest in machine learning, which is used to implement artificial intelligence, has increased, and it has become an age to automate it by using machine learning beyond the way that a person directly models an object recognition process. Among them, Deep Learning is evaluated as an advanced technology that shows amazing performance in various fields, and is applied to various fields of image recognition. Face recognition, which is widely used in real life, has been developed to recognize criminals' faces and catch criminals. In this study, two image analysis models, TF-SLIM and Inception-V3, which are likely to be used for criminal face recognition, were selected, analyzed, and implemented. As an evaluation criterion, the image recognition model was evaluated based on the accuracy of the face recognition program which is already being commercialized. In this experiment, it was evaluated that the recognition accuracy was good when the accuracy of the image classification was more than 90%. A limit of our study which is a way to raise face recognition is left as a further research subjects.

A performance analysis of layered LDPC decoder for mobile WiMAX system (모바일 WiMAX용 layered LDPC 복호기의 성능분석)

  • Kim, Eun-Suk;Kim, Hae-Ju;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.15 no.4
    • /
    • pp.921-929
    • /
    • 2011
  • This paper describes an analysis of the decoding performance and decoding convergence speed of layered LDPC(low-density parity-check) decoder for mobile WiMAX system, and the optimal design conditions for hardware implementation are searched. A fixed-point model of LDPC decoder, which is based on the min-sum algorithm and layered decoding scheme, is implemented and simulated using Matlab model. Through fixed-point simulations for the block lengths of 576, 1440, 2304 bits and the code rates of 1/2, 2/3A, 2/3B, 3/4A, 3/4B, 5/6 specified in the IEEE 802.16e standard, the effect of internal bit-width, block length and code rate on the decoding performance are analyzed. Simulation results show that fixed-point bit-width larger than 8 bits with integer part of 5 bits should be used for acceptable decoding performance.

High-Performance FFT Using Data Reorganization (데이터 재구성 기법을 이용한 고성능 FFT)

  • Park Neungsoo;Choi Yungho
    • The KIPS Transactions:PartA
    • /
    • v.12A no.3 s.93
    • /
    • pp.215-222
    • /
    • 2005
  • The efficient utilization of cache memories is a key factor in achieving high performance for computing large signal transforms. Nonunit stride access in computation of large DFTs causes cache conflict misses, thereby resulting in poor cache performance. It leads to a severe degradation in overall performance. In this paper, we propose a dynamic data layout approach considering the memory hierarchy system. In our approach, data reorganization is performed between computation stages to reduce the number of cache misses. Also, we develop an efficient search algorithm to determine the optimal tree with the minimum execution time among possible factorization trees considering the size of DFTs and the data access stride. Our approach is applied to compute the fast Fourier Transform (FFT). Experiments were performed on Pentium 4, $Athlon^{TM}$ 64, Alpha 21264, UtraSPARC III. Experiment results show that our FFT achieve performance improvement of up to 3.37 times better than the previous FFT packages.

An Autonomous Downlink Power Adjustment Method of Femtocell for Coverage Optimization in Next Generation Heterogeneous Networks (차세대 이종망에서 커버리지 최적화를 위한 자율적 펨토셀 전송 전력 조절 기법 연구)

  • Jo, Sangik;Lim, Jaechan;Hong, Daehyoung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.38B no.1
    • /
    • pp.18-25
    • /
    • 2013
  • In this paper, we propose a self-optimization scheme for indoor femtocell coverage in heterogeneous networks. If the femtocell coverage is larger than indoor area, neighbor cell users passing by the outer area of the femtocell coverage may request an unnecessary handover which incurs wasteful signaling overhead. On the other hand, if the coverage is smaller than the indoor area, some of indoor users might not be connected to the indoor femtocell. Therefore, we propose the method by which the femtocell coverage attains the exact indoor area employing self-organized scheme. Autonomous self TX power adjustment of the femtocell is possible because the proposed method utilizes handover request events and membership information of users that can be obtained by the femtocell itself. We show that the TX power obtained by the proposed algorithm converges to the optimal TX power that can be obtained analytically to attain the indoor coverage area.

파측정회로의 경로 활성화 지정에 과한 연구

  • 이강현;김용득
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.9
    • /
    • pp.745-752
    • /
    • 1990
  • This paper deals with the path sensitization algrithm from PI to PO center on the nodes of high testability mainstay when CUT is tested by pseudo exhaustive testing. In CUT, the node definition of high testability mainstay treats the testability values of the entire nodes with the population composed of the raw data, and after we examined the level of significance(1-a) region, we accomplished in the estimation of the confidence interval of the testability. Focusing on the defined nodes of high testability mainstay, we performed the singular cover and consistency operation to the forward and backward logic gates. Thus, we easily generated the pseudo exhausitve test patterns. As a result, (1-a) region has 0.1579 and the pseudo exhaustive test patterns are least generated and the rate of test pattern is 1.22%, compared with exhaustive testing. (1-a) region has 0.2368 and this results exhibits the optimal performance of the singular cover and consistency operation. Applying the generated pseudo exhaustive test patterns to the stuck-at faults existing on the inputs and internal nodes in CUT, we verified this performance on the output. Thus, it is confirmed that functional testing of the proposed path sensitization algorithm is very useful.

  • PDF

Efficient Deferred Incremental Refresh of XML Query Cache Using ORDBMS (ORDBMS를 사용한 XML 질의 캐쉬의 효율적인 지연 갱신)

  • Hwang Dae-Hyun;Kang Hyun-Chul
    • The KIPS Transactions:PartD
    • /
    • v.13D no.1 s.104
    • /
    • pp.11-22
    • /
    • 2006
  • As we are to deal with more and more XML documents, research on storing and managing XML documents in databases are actively conducted. Employing RDBMS or ORDBMS as a repository of XML documents is currently regarded as most practical. The query results out of XML documents stored in databases could be cached for query performance though the cost of cache consistency against the update of the underlying data is incurred. In this paper, we assume that an ORDBMS is used as a repository for the XML query cache as well as its underlying XML documents, and that XML query cache is refreshed in a deferred way with the update log. When the same XML document was updated multiple times, the deferred refresh of the XML query cache may Bet inefficient. We propose an algorithm that removes or filters such duplicate updates. Based on that, the optimal SQL statements that are to be executed for XML query cache consistency are generated. Through experiments, we show the efficiency of our proposed deferred refresh of XML query cache.

Wind Power Grid Integration of an IPMSG using a Diode Rectifier and a Simple MPPT Control for Grid-Side Inverters

  • Ahmed, Tarek;Nishida, Katsumi;Nakaoka, Mutsuo
    • Journal of Power Electronics
    • /
    • v.10 no.5
    • /
    • pp.548-554
    • /
    • 2010
  • In this paper, a 1.5 kW Interior Permanent Magnet Synchronous Generator (IPMSG) with a power conditioner for the grid integration of a variable-speed wind turbine is developed. The power-conditioning system consists of a series-type 12-pulse diode rectifier powered by a phase shifting transformer and then cascaded to a PWM voltage source inverter. The PWM inverter is utilized to supply sinusoidal currents to the utility line by controlling the active and reactive current components in the q-d rotating reference frame. While the q-axis active current of the PWM inverter is regulated to follow an optimized active current reference so as to track the maximum power of the wind turbine. The d-axis reactive current can be adjusted to control the reactive power and voltage. In order to track the maximum power of the wind turbine, the optimal active current reference is determined by using a simple MPPT algorithm which requires only three sensors. Moreover, the phase angle of the utility voltage is detected using a simple electronic circuit consisting of both a zero-crossing voltage detecting circuit and a counter circuit employed with a crystal oscillator. At the generator terminals, a passive filter is designed not only to decrease the harmonic voltages and currents observed at the terminals of the IPMSG but also to improve the generator efficiency. The laboratory results indicate that the losses in the IPMSG can be effectively reduced by setting a passive filter at the generator terminals.