• Speech Sciences
• /
• v.11 no.3
• /
• pp.165-172
• /
• 2004

In this paper, we propose the computational complexity reduction methods of delta pitch search that is used in G.723.1 vocoder. In order to decrease the computational complexity in delta pitch search the characteristic of proposed algorithms is as the following. First, scheme to reduce the computational complexity in delta pitch search uses NAMDF. Developed the second scheme is the skipping technique of lags in pitch searching by using the threshold value. By doing so, we can reduce the computational amount of pitch searching more than 64% with negligible quality degradation.

• Proceedings of the Korean Society for Bioinformatics Conference
• /
• 2003.10a
• /
• pp.120-120
• /
• 2003

• Journal of computational fluids engineering
• /
• v.21 no.1
• /
• pp.1-9
• /
• 2016

Atmospheric icing may have significant effects not only on safety of aircraft in air, but also on performance of wind turbine and power networks on ground. Thus, ice protection measure should be developed to protect these systems from icing hazards. A very efficient method is the electro-thermal de-icing based on a process by which ice accretion is melted and blown away through aerodynamic forces. In this computational study, a state-of-the-art icing code, FENSAP-ICE, was used for the analysis of electro thermal de-icing system. Computational results including detailed conjugate heat transfer analysis were then validated with experimental data. Further, the computational model was applied to the DU21 airfoil section of NREL 5MW wind turbine with calculated heater parameters.

• Journal of Power System Engineering
• /
• v.17 no.2
• /
• pp.46-55
• /
• 2013

In this paper, the computational algorithm for free vibration analysis of an axisymmetric cylindrical shell is formulated by the Sylvester-transfer stiffness coefficient method (S-TSCM) which combines the Sylvester's inertia theorem and the transfer stiffness coefficient method. After the computational programs for obtaining the natural frequencies and natural modes of the axisymmetric cylindrical shell are made by the S-TSCM and the finite element method (FEM), the computational results which are natural frequencies, natural modes, and computational times by both methods are compared. From the computational results, we can confirm that S-TSCM has the reliability in the free vibration analysis of the axisymmetric cylindrical shell and is superior to FEM in the viewpoint of computational times.

• Korean Institute of Interior Design Journal
• /
• no.41
• /
• pp.266-274
• /
• 2003

Synectics is one of several techniques used to enhance brainstorming by taking a more active role and introducing metaphor and structure into the process. It is unclear at what level of specificity this should be formulated as a pattern. This thesis reviews recent computational as well as experimental work on analogical reasoning based on synectics. New results regarding information processing of analogical reasoning stages, major computational models and recent attempts to compare these models are reviewed. Computational models are also discussed in the computational as well as cognitive psychology perspectives. Future directions in analogical reasoning research are proposed. The following import is the need to accommodate the typology and normal assessment in the concrete circumstances where actual reasoning and problem solving take place. In order to get to this end, we used computational models by Thagard who take the stand of ‘Computational Philosophy of Science’, which assumes ‘Weak AI’ to explicate what constitute the very pecularity of Analogical Reasoning.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.865-873
• /
• 2009

Goodman([3]) presented the question of finding a best possible upper bound of the form $t(G)\;+\;t(G^c)$, where t(G) denote the number of triangles in given graph G. In this, the form of squares of degrees is appeared and many researches have been pursued as an application related to this. Here, we would like to deal with corollary related to the results of Nikiforov([6]).

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1999.10a
• /
• pp.411-420
• /
• 1999

The computational model and a new eigenvalue solution algorithm for large-scale structures is presented in the form of parallel computation. The computational loads and data storages required during the solution process are drastically reduced by evenly distributing computational loads to each processor. As the parallel computational model, multiple personal computers are connected by 10Mbits per second Ethernet card. In this study substructuring techniques and static condensation method are adopted for modeling a large-scale structure. To reduce the size of an eigenvalue problem the interface degrees of freedom and one lateral degree of freedom are selected as the master degrees of freedom in each substructure. The performance of the proposed parallel algorithm is demonstrated by applying the algorithm to dynamic analysis of two-dimensional structures.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.5C
• /
• pp.521-526
• /
• 2009

In this paper, a complex-valued recursive least squares escalator filter algorithm with reduced computational complexity for complex-valued signal processing applications is presented. The local tap weight of RLS-ESC algorithm is updated by incrementing its old value by an amount equal to the local estimation error times the local gain scalar, and for the gain scalar, the local input autocorrelation is calculated at the previous time. By deriving a new gain scalar that can be calculated by using the current local input autocorrelation, reduced computational complexity is accomplished. Compared with the computational complexity of the complex-valued version of RLS-ESC algorithm, the computational complexity of the proposed method can be reduced by 50% without performance degradation. The reduced computational complexity of the proposed algorithm is even less than that of the LMS-ESC. Simulation results for complex channel equalization in 64QAM modulation schemes demonstrate that the proposed algorithm has superior convergence and constellation performance.

• Journal of Multimedia Information System
• /
• v.8 no.3
• /
• pp.191-196
• /
• 2021

Computational thinking refers to the process and method of solving everyday problems using computers. When teaching a computational thinking class for computer majors and non-majors at university, the easiest example to deliver the concept of computational thinking is sorting. Sorting is the concept of arranging given data in order. In this work, we have implemented four visualized sorting algorithms that anyone can easily use. In particular, it helps to understand the difference between the algorithms by showing the number of comparisons and exchanges between elements, which are the criteria for evaluating the performance of the sorting algorithm in real time. It was confirmed that the practice of using the sorting visualization app developed in this research contributed to the improvement of students' understanding of computational thinking.

• Journal of Korea Multimedia Society
• /
• v.22 no.4
• /
• pp.472-479
• /
• 2019

Today, computational thinking takes an important role in problem solving in software education. As a result, software education as liberal arts for non-CS major students is rapidly expanding. It is necessary to study the effects of computational thinking on software problem solving ability compared to traditional programming language education. In this paper, we propose an evaluation model for analyzing the effects of computational thinking on the overall software development process, and analyze how the problem solving process is different for learners who take computing thinking classes and programming language courses as liberal arts courses. As a result, students who learned computational thinking showed higher ability in problem analysis and design process.