• MALSORI
• /
• no.56
• /
• pp.195-206
• /
• 2005

Discrimination between speech and music is important in many multimedia applications. In this paper, focusing on the spectral change characteristics of speech and music, we propose a new method of speech/music discrimination based on cepstral distance. Instead of using cepstral distance between the frames with fixed interval, the minimum of cepstral distances among neighbor frames is employed to increase discriminability between fast changing music and speech. And, to prevent misclassification of speech segments including short pause into music, short pause segments are excluded from computing cepstral distance. The experimental results show that proposed method yields the error rate reduction of$68\%$, in comparison with the conventional approach using cepstral distance.

• 한국전산유체공학회:학술대회논문집
• /
• 2001.05a
• /
• pp.134-143
• /
• 2001

Viscous solutions of supersonic jet impinging on a flat plate normal to the flow are simulated using three-dimensional Navier-Stokes solver. The jet impinging flow structure exhibits such complex nature as shock shell, plate shock and Mach disk depending on the flow parameters. Among others, the dominant parameters are the ratio of the nozzle exit pressure to the ambient pressure and the distance between the nozzle exit plane and the impinging plane. In the present study, the nozzle contour and the pressure ratio are held fixed, while the jet impinging distance is varied to illuminate the characteristics of the jet plume with the distance. As the plate is placed close to the nozzle at 3D high, the computed wall pressure at or near the jet center oscillates with large amplitude with respect to the mean value. Here D is the nozzle exit diameter. The amplitude of wall pressure fluctuations subsides as the distance increases, but the maximum pressure level at the plate is achieved when the distance is about 4D high. The frequency of the wall pressure is estimated at 6.0 kHz, 9.3 kHz, and 10.0 kHz as the impinging distance varies from 3D, 4D, to 6D, respectively.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.3
• /
• pp.363-372
• /
• 2008

In this paper, knowledge-based approach using Support Vector Machines (SVMs) are used for estimating the coordinated zonal settings of a distance relay. The approach depends on the detailed simulation studies of apparent impedance loci as seen by distance relay during disturbance, considering various operating conditions including fault resistance. In a distance relay, the impedance loci given at the relay location is obtained from extensive transient stability studies. SVMs are used as a pattern classifier for obtaining distance relay co-ordination. The scheme utilizes the apparent impedance values observed during a fault as inputs. An improved performance with the use of SVMs, keeping the reach when faced with different fault conditions as well as system power flow changes, are illustrated with an equivalent 265 bus system of a practical Indian Western Grid.

• Journal of Biomedical Engineering Research
• /
• v.30 no.4
• /
• pp.341-346
• /
• 2009

Cutaneous electrogastrography is the measurement of electrical activity of the stomach on the abdominal surface. The validity of cutaneous electrogastrography is dependent upon the quality of the recording technique. The locations of electrodes are an important issue. We examined the influences of the inter-electrode distance of bipolar leads on electrogastrography measurements. The sensitivity distributions of EGG leads were calculated based on a 2D body fat model and evaluated according to the region of interest sensitivity ratio (ROISR). We simulated the ROISR of the inter-electrode distance in relation to various body fat thicknesses. The distance between the electrodes was proportional to the distance between the ROI and the surface of the abdomen. The results imply that inter-electrode distance can be applied in electrogastrography according to human body fat thickness.

• Journal of the Korean Mathematical Society
• /
• v.49 no.3
• /
• pp.475-491
• /
• 2012

In 1950 a class of generalized Petersen graphs was introduced by Coxeter and around 1970 popularized by Frucht, Graver and Watkins. The family of $I$-graphs mentioned in 1988 by Bouwer et al. represents a slight further albeit important generalization of the renowned Petersen graph. We show that each $I$-graph $I(n,j,k)$ admits a unit-distance representation in the Euclidean plane. This implies that each generalized Petersen graph admits a unit-distance representation in the Euclidean plane. In particular, we show that every $I$-graph $I(n,j,k)$ has an isomorphic $I$-graph that admits a unit-distance representation in the Euclidean plane with a $n$-fold rotational symmetry, with the exception of the families $I(n,j,j)$ and $I(12m,m,5m)$, $m{\geq}1$. We also provide unit-distance representations for these graphs.

• Journal of Korean Society for Atmospheric Environment
• /
• v.18 no.5
• /
• pp.393-400
• /
• 2002

Separation distance between industrial source and residential areas to avoid odor annoyance was investigated using AUSPLUME model. A Gaussian plume model (AUSPLUME) for the dispersion was used to calculate odor emission from ground level area source. Using the dispersion model to calculate ambient odor concentrations, the separation distance between industrial source and residental areas was defined by %HA (percentage of highly annoyed person) and odor percentile concentration (C98). The result was compared with the separation distance of various nation guidelines for livestock buildings. The calculated separation distance for industrial source showed similar pattern comparing with various guidelines for livestock buildings.

• Bulletin of the Korean Mathematical Society
• /
• v.54 no.2
• /
• pp.507-519
• /
• 2017

We present an upper bound on the Cheeger constant of a distance-regular graph. Recently, the authors found an upper bound on the Cheeger constant of distance-regular graph under a certain restriction in their previous work. Our new bound in the current paper is much better than the previous bound, and it is a general bound with no restriction. We point out that our bound is explicitly computable by using the valencies and the intersection matrix of a distance-regular graph. As a major tool, we use the discrete Green's function, which is defined as the inverse of ${\beta}$-Laplacian for some positive real number ${\beta}$. We present some examples of distance-regular graphs, where we compute our upper bound on their Cheeger constants.

• Journal of information and communication convergence engineering
• /
• v.10 no.1
• /
• pp.1-4
• /
• 2012

Given separated points divided by a line, called a wall, in a plane, we aim to make a gate in the wall to connect the separated points to each other. In this setting, the problem is to find a location for the gate that minimizes the average distance between the points. The problem is a variant of the well-known facility location problem, which is extensively studied in the fields of operations research, location theory, theoretical computer science, and so on. In this paper, we consider the $L^1$-distance of the points in the plane. The points are projected onto the wall and so the problem is transformed to a proximity problem of points on a line. Then it is shown that the transformed problem is related to the weighted median problem of points on the line. Therefore, we obtain an O(n log n)-time algorithm to solve our problem.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9C
• /
• pp.854-859
• /
• 2005

We construct the fuzzy entropy for measuring of uncertainty with the help of relation between distance measure and similarity measure. Proposed fuzzy entropy is constructed through distance measure. In this study, the distance measure is used Hamming distance measure. Also for the measure of similarity between fuzzy sets or crisp sets, we construct similarity measure through distance measure, and the proposed 려zzy entropies and similarity measures are proved.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2004.04a
• /
• pp.422-425
• /
• 2004

Many believe that electronic distance teaming education transform higher education, saving money and improving learning qualify So, the open University, which teaches around 280,000 students at a distance, is examining the adaption of its distance teaching methods for the internet. But, there are only one type of distance learning education of one way direction. To understand all of a student which selected some of e teaming course, teacher must check that how many student to understand and what is the difficult problems. Without checking this condition, It will be a very difficult and boring distance learning course. In this paper, we introduce of intelligent learning contents of full duplex direction that teach understanding student and not understanding student. The computer simulation results confirms that full duplex e learning system has been proven to be much more efficient than one way direction which not considering about understanding problems.