• The Journal of the Acoustical Society of Korea
• /
• 제23권1E호
• /
• pp.10-15
• /
• 2004

In performing speech conversion from a source speaker to a target speaker, it is important that the pitch contour of the source speakers utterance be converted into that of the target speaker, because pitch contour of a speech utterance plays an important role in expressing speaker's individuality and meaning of the utterance. This paper describes statistical algorithms of pitch contour conversion for Korean language. Pitch contour conversions are investigated at two 1 evels of prosodic phrases: intonational phrase and accentual phrase. The basic algorithm is a Gaussian normalization [7] in intonational phrase. The first presented algorithm is combined with a declination-line of pitch contour in an intonational phrase. The second one is Gaussian normalization within accentual phrases to compensate for local pitch variations. Experimental results show that the algorithm of Gaussian normalization within accentual phrases is significantly more accurate than the other two algorithms in intonational phrase.

• 한국CDE학회논문집
• /
• 제4권3호
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• 대한전기학회논문지:전력기술부문A
• /
• 제53권10호
• /
• pp.542-549
• /
• 2004

The conventional fault location algorithms based on the travelling waves have an inherent problem. In cases of the close-up faults occurring near the relaying point and of the faults having zero degree inception angle of voltage signals, the conventional algorithms can not estimate an accurate fault distance. It is because the shapes of travelling waves are near sinusoidal in those cases. A new method solving this problem is presented in this paper. An FIR(Finite Impulse response) filter which makes high frequency components prominent and makes the power frequency component and dc-offset attenuated is used. With this method, the cross-correlation peak is to be very clear when a close-up fault or a fault having near zero-degree inception angle occurs. The cross-correlation peaks can be clearly distinguished and accurate fault location is practically possible consequently. A series of simulation studies using EMTP(Electromagnetic Transients Program) show that the proposed algorithm can calculate an accurate fault distance having maximum 2% or less error.

• ETRI Journal
• /
• 제28권1호
• /
• pp.31-44
• /
• 2006

In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

• 한국ITS학회 논문지
• /
• 제8권1호
• /
• pp.127-135
• /
• 2009

This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• pp.22-26
• /
• 1999

In general, three are many degrees of freedom (DOF) in industrial robots. That can generate several special end-effector's positions and orientations. For that reason, industrial robots are used in a wide scope of industrial applications such as welding, spray painting, deburring, and so on. In this research, new method is presented which safely maintain the desired constant end-effector's orientation and minimize the numbers of segments in path. These algorithms may apply to welding, painting, and assembling. The simulation study of straight line and circular motions in arc-welding operations is carried out to show the sure proof of these algorithms.

• 전기의세계
• /
• 제24권5호
• /
• pp.107-110
• /
• 1975

This paper describes computational algorithms and a computer program for optimum determinations of wire conductor sizes of radial or tree-type distibution lones with given constraints. Here, The objective function is defined as the total summation of the volume or weight of respective conductor materials required for buildingup the entire distributing system. Four categories of constraints are applied to the obiective function. That is, on the respective load points constraint is imposed by a specified voltage drop limit, and the respective line elements are capable of carrying the current safely(safety current) and also must maintain the minimum thickness in viewpoint of mechanical strength and legal requirements. And finally, the conductor sizes have to be selected among the standardized size levels of the products. These kinds of optimization problems cannot be solved by the ordinary optimization tediniques such as the Linear Programming Method, SUMT Technique, etc. This paper, therefore, successfully devised the powerful alorithms to solve the problem, using the particular properties or characteristics ingerent to the radial or tree-type distribution system. The computer program developed from the algorithms was applied to several sample systems and shown to be exact and very efficient.

• 대한기계학회:학술대회논문집
• /
• 대한기계학회 2001년도 춘계학술대회논문집B
• /
• pp.724-729
• /
• 2001

This paper discusses the composition of the theory of reinforcement learning, which is applied in real-time learning, and evolutionary strategy, which proves its the superiority in the finding of the optimal solution at the off-line learning method. The individuals are reduced in order to learn the evolutionary strategy in real-time, and new method that guarantee the convergence of evolutionary mutations are proposed. It possible to control the control object varied as time changes. As the state value of the control object is generated, applied evolutionary strategy each sampling time because the learning process of an estimation, selection, mutation in real-time. These algorithms can be applied, the people who do not have knowledge about the technical tuning of dynamic systems could design the controller or problems in which the characteristics of the system dynamics are slightly varied as time changes. In the future, studies are needed on the proof of the theory through experiments and the characteristic considerations of the robustness against the outside disturbances.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권7호
• /
• pp.3475-3496
• /
• 2018

Most of current watermarking algorithms for GIS vector data embed copyright information by means of modifying the coordinate values, which will do harm to its quality and accuracy. To preserve the fidelity of vector line data and protect its copyright at the same time, a lossless watermarking algorithm is proposed based on storage feature in this paper. Firstly, the superiority of embedding watermark based on storage feature is demonstrated theoretically and technically. Then, the basic concepts and operations on storage feature have been defined including length and angle of the polyline feature. In the process of embedding watermark, the watermark information is embedded into directions of polyline feature by the quantitative mechanism, while the positions of embedding watermark are determined by the feature length. Hence, the watermark can be extracted by the same geometric features without original data or watermark. Finally, experiments have been conducted to show that coordinate values remain unchanged after embedding watermark. Moreover, experimental results are presented to illustrate the effectiveness of the method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1997년도 하계학술대회 논문집 D
• /
• pp.1078-1082
• /
• 1997

The distance in load parameter space to the closest voltage collapse point provides the worst case power margin and the left eigenvector identifies the most effective direction to steer the system to maximize voltage stability under contingency. This paper presents the results of the comparative performance study of the algorithms, which are applicable to a large scale power system, for computing the closest saddle node bifurcation (CSNB) point. Dobson's iterative method converges with robustness. However the slow process of updating the load increasing direction makes the algorithm less efficient. The direct method converges very quickly. But it diverges if the initial guess is not very close to CSNB. Zeng's method of estimating the approximate critical point in the pre-determined direction is attractive in the sense that it uses only using load flow equations. However, the method is found to be less efficient than Dobson's iterative method. It may be concluded from the above observation that the direct method with the initial values obtained by carrying out the iterative method twice is most efficient at this time and more efficient algorithms are needed for on-line application.