• The Journal of the Korea Contents Association
• /
• v.5 no.5
• /
• pp.17-25
• /
• 2005

In this paper, we design data transformation interface for the automation of PCB product. The data designed to CAD does not exchange itself for the assembly line, so we construct an automation system which is exchangeable. To do this, we analyze the information of PCB components and construct the Information of IC components as database. We also develope two kinds of algorithm; one is to detect human error and another is to exchange itself for the data which is suitable for PCB assembly line. We design data transformation interface to do addition and revision of the information for PCB assembly line. By automating existing manual processing, we are able to shorten access time and enhance reliability of the data and the efficient assembly line of PCB.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2228-2231
• /
• 2003

In this paper, a transcoding algorithm for the Selectable Mode Vocoder (SMV) and the G.723.1 speech coder via direct parameter transformation is proposed. In contrast to the conventional tandem transcoding algorithm, the proposed algorithm converts the parameters of one coder to the Other Without going through the decoding md encoding process. The proposed algorithm is composed of four parts: the parameter decoding, line spectral pair (LSP) conversion, pitch period conversion, excitation conversion and rate selection. The evaluation results show that the proposed algorithm achieves equivalent speech quality to that of tandem transcoding with reduced computational complexity and delay.

• Journal of the Korean Society of Visualization
• /
• v.8 no.4
• /
• pp.26-30
• /
• 2010

A PTV algorithm was constructed using a linear transformation, in which the merits of the conventional PIV and PTV were adopted. In PIV calculations, the obtained velocity vectors are affected by the filtering effects by its calculation principle. PTV techniques are widely used for their excellences of measuring small scaled flows, such as nano and bio flows. However, PTVs produce vector errors due to interpolation process. To overcome these problems, a hybrid PTV algorithm was constructed by combining PTVs' and PIVs' benefits using a linear transformation. The Taylor-Green vortex flows were generated for the tests of vorticity calculations. The conventional gray-level cross-correlation PIV technique and 2-Frame PTV technique were tested for the same flows for comparisons with those obtained by the constructed hybrid algorithm. The excellence of the constructed hybrid algorithm was validated through an actual experiment on the cylinder wake.

• Communications for Statistical Applications and Methods
• /
• v.14 no.3
• /
• pp.583-592
• /
• 2007

Given the moments of a symmetric random variable, its density and distribution functions can be accurately approximated by making use of the algorithm proposed in this paper. This algorithm is specially designed for approximating symmetric distributions and comprises of four phases. This approach is essentially based on the transformation of variable technique and moment-based density approximants expressed in terms of the product of an appropriate initial approximant and a polynomial adjustment. Probabilistic quantities such as percentage points and percentiles can also be accurately determined from approximation of the corresponding distribution functions. This algorithm is not only conceptually simple but also easy to implement. As illustrated by the first two numerical examples, the density functions so obtained are in good agreement with the exact values. Moreover, the proposed approximation algorithm can provide the more accurate quantities than direct approximation as shown in the last example.

• Communications of the Korean Mathematical Society
• /
• v.23 no.4
• /
• pp.607-610
• /
• 2008

We aim mainly at presenting a generalization of a transformation formula found by Baillon and Bruck. The result is derived with the help of the well-known quadratic transformation formula due to Gauss.

• Journal of Computing Science and Engineering
• /
• v.3 no.1
• /
• pp.27-58
• /
• 2009

Aggregation join queries are an important class of queries over data streams. These queries involve both join and aggregation operations, with window-based joins followed by an aggregation on the join output. All existing research address join query optimization and aggregation query optimization as separate problems. We observe that, by putting them within the same scope of query optimization, more efficient query execution plans are possible through more versatile query transformations. The enabling idea is to perform aggregation before join so that the join execution time may be reduced. There has been some research done on such query transformations in relational databases, but none has been done in data streams. Doing it in data streams brings new challenges due to the incremental and continuous arrival of tuples. These challenges are addressed in this paper. Specifically, we first present a query processing model geared to facilitate query transformations and propose a query transformation rule specialized to work with streams. The rule is simple and yet covers all possible cases of transformation. Then we present a generic query processing algorithm that works with all alternative query execution plans possible with the transformation, and develop the cost formulas of the query execution plans. Based on the processing algorithm, we validate the rule theoretically by proving the equivalence of query execution plans. Finally, through extensive experiments, we validate the cost formulas and study the performances of alternative query execution plans.

• Spatial Information Research
• /
• v.20 no.2
• /
• pp.117-127
• /
• 2012

The purpose of this study is to develop the auto-building algorithm of the Geometric Network Model(GNM), a topology model including geometric information because of the need to reflect the features' geometric characteristic into the topology model, which is for development of indoor 3D virtual model enabling queries. As the critical algorithm, the Straight Medial Axis Transformation(SMAT) algorithm is proposed in order to automatically extract the medial axis of features. The SMAT algorithm is generalized from the existing S-MAT algorithm and a range of target features where applicable is extended from simple polygons to weakly simple polygons which mean the polygons containing the inner ring inside. The GNM built automatically is finally printed out as the .csv file for easy access and w ide application in other systems. This auto-building algorithm of the GNM is available for plenty of cases such as finding a shortest path, guiding a route in emergency situation, and semantic analysis.

• Communications for Statistical Applications and Methods
• /
• v.7 no.1
• /
• pp.47-54
• /
• 2000

This article is concerned with the algorithm for the Chebyshev estimation with/without linear equality and/or inequality constraints. The algorithm employs a linear scaling transformation scheme to reduce the computational burden which is induced when the data set is quite large. The convergence of the proposed algorithm is proved. And the updating and orthogonal decomposition techniques are considered to improve the computational efficiency and numerical stability.

• Communications of the Korean Mathematical Society
• /
• v.24 no.4
• /
• pp.501-508
• /
• 2009

This paper presents a new representation algorithm which computes the representation for elements of a free group generated by two linear fractional transformations and also the justification of the algorithm in order to show how it operates correctly and efficiently according to inputs.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.6
• /
• pp.696-708
• /
• 2002

In this paper, a novel transcoding algorithm for the Adaptive Multi Rate(AMR) and the Enhanced Variable Rate Codec(EVRC) vocoders via direct parameter transformation is proposed. In contrast to the conventional tandem transcoding algorithm, the proposed algorithm converts the parameters of one coder to the other without going through the decoding and encoding processes. The proposed algorithm consists of the parameter decoding, frame classification, mode decision, and transcoders for two frame types. The transcoders convert the parameters such as LSP, frame energy, pitch delay for the adaptive codebook, fixed codebook vector, and codebook gains. Evaluation results show that while exhibiting better computational and delay characteristics, the proposed algorithm produces equivalent speech quality to that produced by the tandem transcoding algorithm.