• Journal of the Korean Institute of Intelligent Systems
• /
• v.15 no.7
• /
• pp.893-898
• /
• 2005

Due to the merits that only a small amount of computation is needed for solutions and stochastic policies can be handled explicitly, the actor-critic algorithm, which is a class of reinforcement learning methods, has recently attracted a lot of interests in the area of artificial intelligence. The actor-critic network composes of tile actor network for selecting control inputs and the critic network for estimating value functions, and in its training stage, the actor and critic networks take the strategy, of changing their parameters adaptively in order to select excellent control inputs and yield accurate approximation for value functions as fast as possible. In this paper, we consider a new actor-critic algorithm employing an RLS(Recursive Least Square) method for critic learning, and policy gradients for actor learning. The applicability of the considered algorithm is illustrated with experiments on the two linked robot arm.

• Journal of Broadcast Engineering
• /
• v.4 no.2
• /
• pp.134-143
• /
• 1999

In this paper, in order to implement the IDWT(inverse discrete wavelet transform) with relatively low complexity, we propose a VLSI architecture for odd-tap linear-phase IDWT filters. By considering the symmetric property of the linear phase filter, the input is added to the one located at symmetrical position of the filter before filtering. Then. we rearrange the delay line of the filter in a U-shaped fashion. requiring no global interconnection between the components. The proposed architecture for the IDWT filter consists of delay units. operator units, adder units. and postprocessor unit. Since each units are configured regularly and interconnected locally. the proposed architecture can accommodate arbitrary linear phase IDWTs by simply adding/removing the corresponding units. The M -level IDWT can be implemented by interconnecting the proposed architecture in a cascaded or semi-recursive form. It is expected that the proposed architecture for the IDWT can be effectively employed in the related area including MPEG-4, since the proposed architecture is less complex than the conventional architectures.

• Journal of Korean Society of Transportation
• /
• v.24 no.4 s.90
• /
• pp.149-159
• /
• 2006

Traditional trip tables are estimated through large-scale surveys such as household survey, roadside interviews, and license Plate matching. These methods are, however, expensive and time consuming. This paper presents two origin-destination (OD) trip matrix estimation methods from link traffic counts in stochastic assignment, which contains perceived errors of drivers for alternatives. The methods are formulated based on the relation between link flows and OD demands in logit formula. The first method can be expressed to minimize the difference between observed link flows and estimated flows, derived from traffic assignment and be solved by gradient method. The second method can be formulated based on dynamic process, which nay describe the daily movement patterns of drivers and be solved by a recursive equation. A numerical example is used for assessing the methods, and shows the performances and properties of the models.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2006.05a
• /
• pp.53-54
• /
• 2006

The main purpose of tunnel ventilation system is to maintain CO pollutant and VI (visibility index) under an adequate level to provide drivers with safe driving condition. Moreover, it is necessary to minimize power consumption used to operate ventilation system. To achieve the objectives, the control algorithm used in this research is reinforcement teaming (RL) method. RL is a goal-directed teaming of a mapping from situations to actions. The goal of RL is to maximize a reward which is an evaluative feedback from the environment. Constructing the reward of the tunnel ventilation system, two objectives listed above are included. RL algorithm based on actor-critic architecture and natural gradient method is adopted to the system. Also, the recursive least-squares (RLS) is employed to the learning process to improve the efficiency of the use of data. The simulation results performed with real data collected from existing tunnel are provided in this paper. It is confirmed that with the suggested controller, the pollutant level inside the tunnel was well maintained under allowable limit and the performance of energy consumption was improved compared to conventional control scheme.

• School Mathematics
• /
• v.18 no.4
• /
• pp.793-818
• /
• 2016

The purpose of this study is to explore in detail $5^{th}$ grade students' understanding on the big ideas related to addition of fraction with different denominators: fixed whole unit, necessity of common measure, and recursive partitioning connected to algorithms. We conducted teaching experiments on 15 fifth grade students who had learned about addition of fractions with different denominators using the current textbook. Most students approached to the big ideas related to addition of fractions in a procedural way. However, some students were able to conceptually understand the interpretations and algorithms of fraction addition by quantitatively thinking about the context and focusing on the structures of units. Building on these results, this study is expected to suggest specific implications on instruction methods for addition of fractions with different denominators.

• Journal of Internet Computing and Services
• /
• v.18 no.5
• /
• pp.47-53
• /
• 2017

In past few years, high-throughput sequencing, big-data generation, cloud computing, and computational biology are revolutionary. RNA sequencing is emerging as an attractive alternative to DNA microarrays. And the methods for constructing Gene Regulatory Network (GRN) from RNA-Seq are extremely lacking and urgently required. Because GRN has obtained substantial observation from genomics and bioinformatics, an elementary requirement of the GRN has been to maximize distinguishable genes. Despite of RNA sequencing techniques to generate a big amount of data, there are few computational methods to exploit the huge amount of the big data. Therefore, we have suggested a novel gene selection algorithm combining Support Vector Machines and Intensity-dependent normalization, which uses log differential expression ratio in RNAseq. It is an extended variation of support vector machine recursive feature elimination (SVM-RFE) algorithm. This algorithm accomplishes minimum relevancy with subsets of Big-Data, such as NCBI-GEO. The proposed algorithm was compared to the existing one which uses gene expression profiling DNA microarrays. It finds that the proposed algorithm have provided as convenient and quick method than previous because it uses all functions in R package and have more improvement with regard to the classification accuracy based on gene ontology and time consuming in terms of Big-Data. The comparison was performed based on the number of genes selected in RNAseq Big-Data.

• Journal of KIISE:Software and Applications
• /
• v.34 no.1
• /
• pp.11-17
• /
• 2007

One of the popular methods used for pattern classification is the MBR (Memory-Based Reasoning) algorithm. Since it simply computes distances between a test pattern and training patterns or hyperplanes stored in memory, and then assigns the class of the nearest training pattern, it cannot explain how the classification result is obtained. In order to overcome this problem, we propose an incremental teaming algorithm based on RPA (Recursive Partition Averaging) to extract IF-THEN rules that describe regularities inherent in training patterns. But rules generated by RPA eventually show an overfitting phenomenon, because they depend too strongly on the details of given training patterns. Also RPA produces more number of rules than necessary, due to over-partitioning of the pattern space. Consequently, we present the IREA (Incremental Rule Extraction Algorithm) that overcomes overfitting problem by removing useless conditions from rules and reduces the number of rules at the same time. We verify the performance of proposed algorithm using benchmark data sets from UCI Machine Learning Repository.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.44 no.4
• /
• pp.298-307
• /
• 2016

Attitude determination of satellite is categorized by deterministic and recursive method. The recursive algorithm using Kalman filter is widely used. Cubesat has limitation for payload to minimize then only two attitude sensors are installed which are sun sensor and magnetometer. Sun sensor measurements are useless during eclipse, however cubesat keeps estimating attitude to complete the successful mission. In this paper, Attitude determination algorithm based on Kalman filter is developed by additional term which considering the dynamics for SNUSAT-1 with disturbance torque. Verification of attitude accuracy of the algorithm is conducted during eclipse. Attitude determination algorithm is simulated to compare the performance between typical method and proposed algorithm. In addition, Attitude errors are analysed with various magnitude of disturbance torque caused by space environment.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1468-1476
• /
• 1997

In mobile communication systems, the Reduced State Sequence Estimation(RSSE) receiver must be able to track changes in the channel. This is carried out by the adaptive channel estimator. However, when the tentative decisions are used in the channel estimator, incorrect decisions can cause error propagation. This paper presents a new channel estimator using the path history in the Viterbi decoder for preventing error propagation. The selection of the path history in the Viterbi decoder for preventing error propagation. The selection of the path history for the channel estimator depends on the path metric as in the decoding of the Viterbi decoder in RSSE. And a discussion on the channel estimator with different adaptation algorithms such as Least Mean Square(LMS) algorithm and Recursive Least Square(RLS) algorithm is provided. Results from computer simulations show that the RSSE receivers using the proposed channel estimator have better performance than the other conventional RSSE receiver, and that the channel estimator with RLS algorithm is adequate for multipath fading channel.

• Journal of rehabilitation welfare engineering & assistive technology
• /
• v.11 no.4
• /
• pp.363-370
• /
• 2017

In this paper, we proposed a low-complexity speech enhancement algorithm based on a improved minima controlled recursive averaging (IMCRA) and log minimum mean square error (logMMSE). The IMCRA algorithm track the minima value of input power within buffers in local window and identify the speech presence using ratio between input power and its minima value. In this process, many number of operations are required. To reduce the number of operations of IMCRA algorithm, minima value is tracked using time-varying frequency-dependent smoothing based on speech presence probability. The proposed algorithm enhanced speech quality by 2.778%, 3.481%, 2.980% and 2.162% in 0, 5, 10 and 15dB SNR respectively and reduced computational complexity by average 9.570%.