• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.

• Phonetics and Speech Sciences
• /
• v.5 no.2
• /
• pp.25-31
• /
• 2013

This study examined cross-generational changes in the vowel system of Seoul Korean. Acoustic analyses of the vowel formants of /o/ and /u/, and their Euclidean distances in the vowel space were undertaken to explore an on-going merger of these two vowels as proposed in previous acoustic studies and a phonological analysis by Chae (1999). A robust cross-generational change of /o/ and /u/ was found, more evident for female speakers than for male speakers. For female speakers, with each successive generation, /o/ became increasingly approximated with /u/, regardless of the syllable positions that the target vowels were posited, whereas the cross-generational differences in the Euclidean distances were only shown in the second syllable position for the male speakers. These results demonstrate that 1) women are more advanced than men in the on-going approximation of /o/ and /u/; 2) the approximation of /o/ and /u/ is common in the non-initial position. Taken together, the merger of /o/ and /u/ appears to be in progress in Seoul Korean.

• Bulletin of the Korean Chemical Society
• /
• v.30 no.3
• /
• pp.567-572
• /
• 2009

In this study, the effects of counter ion valency of the electrolyte on the colloidal repulsion between two parallel cylindrical particles were investigated. Electrostatic interactions of the cylindrical particles were calculated with the variation of counter ion valency. To calculate the electrical repulsive energy working between these two cylindrical particles, Derjaguin approximation was applied. The electrostatic potential profiles were obtained numerically by solving nonlinear Poission-Boltzmann (P-B) equation and calculating middle point potential and repulsive energy working between interacting surfaces. The electrical potential and repulsive energy were influenced by counter ion valency, Debye length, and surface potential. The potential profile and middle point potential decayed with the counter ion valency due to the promoted shielding of electrical charge. On the while, the repulsive energy increased with the counter ion valency at a short separation distance. These behaviors of electrostatic interaction agreed with previous results on planar or spherical surfaces.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.6
• /
• pp.859-868
• /
• 2012

A new fault location algorithm based on stationary wavelet transform and its verification experiment results are described for HVDC submarine cables in this paper. For wavelet based fault location algorithm, firstly, 4th level approximation coefficients decomposed by wavelet transform function are superimposed by correlation, then the distance to the fault point is calculated by time delay between the first incident signal and the second reflected signal. For the verification of this algorithm, the real experiments based on various fault conditions and return types of fault current are performed at HVDC submarine cable test yard located in KEPCO(Korea Electric Power Corporation) Power Testing Center of South Korea. It proves that the fault location method proposed in this paper is very simple but very quick and accurate for HVDC submarine cable fault location.

• Korean Journal of Agricultural Science
• /
• v.50 no.3
• /
• pp.427-435
• /
• 2023

This study was conducted to evaluate the spraying performance according to the flight conditions of agricultural drones for the development of a variable control system. The analyzed flight conditions comprised six factors: spraying direction, flight speed, altitude, wind speed, wind direction, and rotor rotational speed. The ratio of the area sprayed on the water-sensitive paper was used as the coverage, and the distribution and amount of the coverage were evaluated. The coverage distribution based on the distance from the drone was used to evaluate a spray pattern, and the distribution was expressed as a Gaussian function approximation. In addition, the probability distribution based on coverage was expressed as the cumulative probability via Gamma function approximation to analyze the spraying efficiency in the target area. The results showed that the averaged coverage decreased significantly as the flight speed and wind speed increased, and the wind direction changed the spray pattern without a coverage decrease. This study contributes to the development of a control technique for the precision control system of agricultural drones.

• Journal of KIISE:Software and Applications
• /
• v.36 no.6
• /
• pp.479-490
• /
• 2009

A number of temporal abstraction approaches have been suggested so far to handle the high computational complexity of Markov decision problems (MDPs). Although the structure of temporal abstraction can significantly affect the efficiency of solving the MDP, to our knowledge none of current temporal abstraction approaches explicitly consider the relationship between topology and efficiency. In this paper, we first show that a topological measurement from complex network literature, mean geodesic distance, can reflect the efficiency of solving MDP. Based on this, we build an incremental method to systematically build temporal abstractions using a network model that guarantees a small mean geodesic distance. We test our algorithm on a realistic 3D game environment, and experimental results show that our model has subpolynomial growth of mean geodesic distance according to problem size, which enables efficient solving of resulting MDP.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.9 s.240
• /
• pp.1217-1224
• /
• 2005

To improve the accuracy of a metamodel, additional sample points can be selected by using a specified criterion, which is often called sequential sampling approach. Sequential sampling approach requires small computational cost compared to one-stage optimal sampling. It is also capable of monitoring the process of metamodeling by means of identifying an important design region for approximation and further refining the fidelity in the region. However, the existing critertia such as mean squared error, entropy and maximin distance essentially depend on the distance between previous selected sample points. Therefore, although sufficient sample points are selected, these sequential sampling strategies cannot guarantee the accuracy of metamodel in the nearby optimum points. This is because criteria of the existing sequential sampling approaches are inefficient to approximate extremum and inflection points of original model. In this research, new sequential sampling approach using the sensitivity of metamodel is proposed to reflect the response. Various functions that can represent a variety of features of engineering problems are used to validate the sensitivity approach. In addition to both root mean squared error and maximum error, the error of metamodel at optimum points is tested to access the superiority of the proposed approach. That is, optimum solutions to minimization of metamodel obtained from the proposed approach are compared with those of true functions. For comparison, both mean squared error approach and maximin distance approach are also examined.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.356-360
• /
• 2010

Recently, there have been many research efforts on privacy-preserving data mining. In privacy-preserving data mining, accuracy preservation of mining results is as important as privacy preservation. Random perturbation privacy-preserving data mining technique is known to well preserve privacy. However, it has a problem that it destroys distance orders among time-series. In this paper, we propose a notion of the noise averaging effect of piecewise aggregate approximation(PAA), which can be preserved the clustering accuracy as high as possible in time-series data clustering. Based on the noise averaging effect, we define the PAA distance in computing distance. And, we show that our PAA distance can alleviate the problem of destroying distance orders in random perturbing time series.

• Journal of the Society of Naval Architects of Korea
• /
• v.34 no.2
• /
• pp.27-38
• /
• 1997

This paper is concerned with the calculation of the wave resistance for SWATH ships based on a low order Rankine source panel method. Two types of free surface boundary conditions, Dawson type (double model approximation) and Kelvin type (free stream approximation) are used. For the free surface boundary calculation, an analytic differentiation is employed instead of implementing a finite difference scheme. Then, the radiation condition is satisfied by, so called, the panel shift method. The numerical results using the above two methods are compared with those using the thin ship/modified slender body approximation and also with the experimental results. The SWATH models considered are a single strut SWATH and a twin strut SWATH together with the variations of two demihull separation distance. In order to prove the validity of the program developed, the numerical calculations for a Wigley mono hull and Wigley twin hulls are compared with the available experimental results.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.7
• /
• pp.9-16
• /
• 2008

For the efficient routing on a Sensor Network, one may consider a deployment problem to interconnect the sensor nodes optimally. There is an analogous theoretic problem: the Steiner Tree problem of finding the tree that interconnects given points on a plane optimally. One may use the approximation algorithm for the problem to find out the deployment that interconnects the sensor nodes almost optimally. However, the Steiner Tree problem is to interconnect mathematical set of points on a Euclidean plane, and so involves particular cases that do not occur on Sensor Networks. Thus the approach of using the algorithm does not make a proper way of analysis. Differently from the randomly given locations of mathematical points on a Euclidean plane, the locations of sensors on Sensor Networks are assumed to be physically dispersed over some moderate distance with each other. By designing an approximation algorithm for the Sensor Networks in terms of that physical property, one may produce the execution time and the approximation ratio to the optimality that are appropriate for the problem of interconnecting Sensor Networks.