• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2451-2454
• /
• 2003

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses met scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, speech, spectrogram analysis, searching time reduced about 37.5％, 46.21％, 46.3％, 51.29％ in average, computational amount is reduced about 44.76％, 49.44％, 47.03％, 57.40％. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• Journal of Korea Multimedia Society
• /
• v.20 no.2
• /
• pp.163-169
• /
• 2017

There are various algorithms evaluating a threshold for image segmentation. Among them, Otsu's algorithm sets a threshold based on the histogram. It finds the between-class variance for all over gray levels and then sets the largest one as Otsu's optimal threshold, so we can see that Otsu's algorithm requires a lot of the computation. In this paper, we improved the amount of computational needs by using estimated Otsu's threshold rather than computing for all the threshold candidates. The proposed algorithm is compared with the original one in computation amount and accuracy. we confirm that the proposed algorithm is about 29 times faster than conventional method on single processor and about 4 times faster than on parallel processing architecture machine.

• Proceedings of the KAIS Fall Conference
• /
• 2010.05a
• /
• pp.257-260
• /
• 2010

In this paper, we propose the computation reduction methods of LSP(Line spectrum pairs) transformation that is mainly used in CELP vocoders. In order to decrease the computational time in real root method the characteristic of four proposed algorithms is as the following. First, scheme to reduce the LSP transformation time uses mel scale. Developed the second scheme is the control of searching order by the distribution characteristic of LSP parameters. Third, scheme to reduce the LSP transformation time uses voice characteristics. Developed the fourth scheme is the control of searching interval and order by the distribution characteristic of LSP parameters. As a result of searching time, computational amount, transformed LSP parameters, SNR, MOS test, waveform of synthesized speech, spectrogram analysis, searching time is reduced about 37.5%, 46.21%, 46.3%, 51.29% in average, computational amount is reduced about 44.76%, 49.44%, 47.03%, 57.40%. But the transformed LSP parameters of the proposed methods were the same as those of real root method.

• Transactions of Materials Processing
• /
• v.12 no.7
• /
• pp.631-639
• /
• 2003

Ring rolling process is simulated by using the general-purpose commercial finite element analysis software, MSC.Superform. Because the deforming region is restricted to the vicinity of the roll gap, only a ring segment spanning the roll gap is analyzed in order to save computation time and cost. First, a plain ring rolling of rectangular cross-section is simulated. Comparisons between computation and experiment show good agreement in the cross-sectional configuration of the deformed ring. Then, a profile ring with an external round groove is analyzed. The rolls with and without groove have been analyzed to compare the amount of side spread. It is found that the grooves in the rolls are effective in reducing the amount of side spread.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.40 no.4
• /
• pp.373-379
• /
• 2016

It is known that it is expedient to represent the distribution of the properties of a bone with complex heterogeneity as B-spline volume functions. For B-spline-based representation, the pixel values of CT images are interpolated by B-spline volume functions. However, the CT images of a bone are three-dimensional and very large, and hence a large amount of memory and long computation time for the interpolation are required. In this study, a method for resolving these problems is proposed. In the proposed method, the B-spline volume interpolation problem is simplified by using the uniformity of pixel spacing of the image and the properties of B-spline basis functions. This results in a reduction in computation time and the amount of memory used. The proposed method was implemented and it was verified that the computation time and the amount of memory used were reduced.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.5
• /
• pp.1328-1342
• /
• 2013

Searchable encryption is a cryptographic protocol for searching a document in encrypted databases. A simple searchable encryption protocol, which is capable of using only one keyword at one time, is very limited and cannot satisfy demands of various applications. Thus, designing a searchable encryption with useful additional functions, for example, conjunctive keyword search, is one of the most important goals. There have been many attempts to construct a searchable encryption with conjunctive keyword search. However, most of the previously proposed protocols are based on public-key cryptosystems which require a large amount of computational cost. Moreover, the amount of computation in search procedure depends on the number of documents stored in the database. These previously proposed protocols are not suitable for extremely large data sets. In this paper, we propose a new searchable encryption protocol with a conjunctive keyword search based on a linked tree structure instead of public-key based techniques. The protocol requires a remarkably small computational cost, particularly when applied to extremely large databases. Actually, the amount of computation in search procedure depends on the number of documents matched to the query, instead of the size of the entire database.

• Journal of KIISE
• /
• v.42 no.7
• /
• pp.919-928
• /
• 2015

In recent years, many research efforts have been made on privacy-preserving data mining (PPDM) in data of large volume. In this paper, we propose a PPDM solution based on principal component analysis (PCA), which can be widely used in computing correlation among sensitive data sets. The general method of computing PCA is to collect all the data spread in multiple nodes into a single node before starting the PCA computation; however, this approach discloses sensitive data of individual nodes, involves a large amount of computation, and incurs large communication overheads. To solve the problem, in this paper, we present an efficient method that securely computes PCA without the need to collect all the data. The proposed method shares only limited information among individual nodes, but obtains the same result as that of the original PCA. In addition, we present a dimensionality reduction technique for the proposed method and use it to improve the performance of secure similar document detection. Finally, through various experiments, we show that the proposed method effectively and efficiently works in a large amount of multi-dimensional data.

• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.995-998
• /
• 2005

A task in imprecise computation consists of mandatory part and optional part. The optional part can be executed partially and the quality of service is measured by the amount of the execution. Many paper showed that multimedia systems are good applications of imprecise computation. It is important to guarantee QoS which is a critical factor in multimedia systems. Previous works didn't consider QoS and processor slack were assigned randomly to tasks. This paper presented a systemic slack assignment method according to QoS levels of tasks. A simulation result showed that our method can be a good choice for multimedia systems with QoS requirement.

• Journal of Internet Computing and Services
• /
• v.9 no.5
• /
• pp.185-193
• /
• 2008

An MTBF(mean time between failures) of large scale parallel systems is known to be only an order of several hours, and large computations sometimes result in a waste of huge amount of CPU time, However. the MPI(Message Passing Interface), a de facto standard for message passing parallel programming, suggests no possibility to handle such a problem. In this paper, we propose an application-level fault tolerant computation system, purely on the basis of the current MPI standard without using any non-standard fault tolerant MPI library, that can be used for general scientific synchronous parallel computation.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.05a
• /
• pp.94-97
• /
• 2001

An inverse finite element approach is employed for more capability to design the optimum blank shape from the desired final shape with small amount of computation time and effort. For multi-stage deep-drawing processes, numerical analysis is extremely difficult to carry out due to its complexities and convergence problem as well as tremendous computation time. In this paper, multi-stage finite element inverse analysis is applied to multi-stage rectangular cup drawing processes to calculate intermediate blank shapes and strain distributions in each stages. Deformation history of the previous stage is considered in the computation. Finite element patches are used to describe arbitrary intermediate sliding constraint surfaces.