• Structural Engineering and Mechanics
• /
• v.27 no.6
• /
• pp.713-739
• /
• 2007

Nowadays computers can perform symbolic computations in addition to mere number crunching operations for which they were originally designed. Symbolic computation opens up exciting possibilities in Structural Mechanics and engineering. Classical areas have been increasingly neglected due to the advent of computers as well as general purpose finite element software. But now, classical analysis has reemerged as an attractive computer option due to the capabilities of symbolic computation. The repetitive cycles of simultaneous - equation sets required by the finite element technique can be eliminated by solving a single set in symbolic form, thus generating a truly closed-form solution. This consequently saves in data preparation, storage and execution time. The power of Symbolic computation is demonstrated by six examples by applying symbolic computation 1) to solve coupled shear wall 2) to generate beam element matrices 3) to find the natural frequency of a shear frame using transfer matrix method 4) to find the stresses of a plate subjected to in-plane loading using Levy's approach 5) to draw the influence surface for deflection of an isotropic plate simply supported on all sides 6) to get dynamic equilibrium equations from Lagrange equation. This paper also presents yet another computationally efficient and accurate numerical method which is based on the concept of derivative of a function expressed as a weighted linear sum of the function values at all the mesh points. Again this method is applied to solve the problems of 1) coupled shear wall 2) lateral buckling of thin-walled beams due to moment gradient 3) buckling of a column and 4) static and buckling analysis of circular plates of uniform or non-uniform thickness. The numerical results obtained are compared with those available in existing literature in order to verify their accuracy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.8
• /
• pp.3826-3851
• /
• 2016

With traditional data storage solutions becoming too expensive and cumbersome to support Big Data processing, enterprises are now starting to outsource their data requirements to third parties, such as cloud service providers. However, this outsourced initiative introduces a number of security and privacy concerns. In this paper, homomorphic encryption is suggested as a mechanism to protect the confidentiality and privacy of outsourced data, while at the same time allowing third parties to perform computation on encrypted data. This paper also discusses the challenges of Big Data processing protection and highlights its differences from traditional data protection. Existing works on homomorphic encryption are technically reviewed and compared in terms of their encryption scheme, homomorphism classification, algorithm design, noise management, and security assumption. Finally, this paper discusses the current implementation, challenges, and future direction towards a practical homomorphic encryption scheme for securing outsourced Big Data computation.

• Bulletin of the Korean Mathematical Society
• /
• v.50 no.6
• /
• pp.2035-2051
• /
• 2013

In this paper, we study numerical schemes for solving multi-dimensional option pricing problem. We compare the direct solving method and the Operator Splitting Method(OSM) by using finite difference approximations. By varying parameters of the Black-Scholes equations for the maximum on the call option problem, we observed that there is no significant difference between the two methods on the convergence criterion except a huge difference in computation cost. Therefore, the two methods are compatible in practice and one can improve the time efficiency by combining the OSM with parallel computation technique. We show numerical examples including the Equity-Linked Security(ELS) pricing based on either two assets or three assets by using the OSM with the Monte-Carlo Simulation as the benchmark.

• Water for future
• /
• v.26 no.3
• /
• pp.103-111
• /
• 1993

The HEC(Hydrologic Engineering Center)-2 program, which utilize the standard step method, is usually adopted in the practical works for the water surface profile computation of natural channels. Water profile computation is, in general, carried upstream for subcritical flow. On the other hand, when the reference water surface si given upstream, numerous efforts and a great deal of time are necessary to compute the downstream water surface profile for subcritical flow. A simple method, computing the water surface profile from upstream to downstream for subcritical flow by HEC-2, is suggested in this paper. The applicability and the accuracy of this method are discussed by applying this method to both prismatic and natural channels.

• 한국전산유체공학회:학술대회논문집
• /
• 1995.10a
• /
• pp.43-48
• /
• 1995

A numerical computation is carried out to analyse characteristics of flow fields around Air Supported Ships having arbitrary form. The computations are performed in a rectangular grid system with MAC(Marker And Cell) method. The governing equations are represented in a Finite Difference form by forward differencing in time and centered differencing in space except for convection terms. For validation of this numerical analysis method, the computation of flow fields around Catamaran and ACV(Air Cushion Vehicle) with pressure distribution on free surface are done, and that around Surface Effect Ship is also carried out. The results of the computations are compared with the those of existed numerical computation and experimental results with the same condition.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.1097-1100
• /
• 1999

Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.2 no.4
• /
• pp.177-184
• /
• 2010

In this study, geometric modeling techniques and their application to ship modeling and design are presented. Traditionally the hull shape is defined by using curves called the lines and various necessary computations are performed based on the discrete points obtained from the lines. However, some applications find difficulty in using the lines such as seakeeping analysis, which requires the computation of wetted part that is changing dynamically over time. To overcome such a problem and increase accuracy and efficiency in computation, two essential geometric modeling techniques, surface modeling and surface-to-surface intersection, are introduced and their application to ship modeling and analysis including hydrostatic computation, slamming and seakeeping analyses is presented.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.8 no.1
• /
• pp.107-115
• /
• 2012

This paper proposes on the structure for reducing the circuit area and increasing the computation speed in implementing to hardware using the SEED algorithm of a 128-bit block cipher. SEED cipher can be implemented with S/W or H/W method. It should be important that we have minimize the area and computation time in H/W implementation. To increase the computation speed, we used the structure of the pipelined systolic array, and this structure is a simple thing without including any buffer at the input and output circuit. This circuit can record the encryption rate of 320 Mbps at 10 MHz clock. We have designed the circuit with the Verilog HDL coding showing the circuit performances in the figures and the table.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2471-2474
• /
• 2003

The modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) are employed in subband/transform coding schemes as the analysis/synthesis filter bank based on time domain aliasing cancellation (TDAC). And they are the most computational intensive operations in layer III of the MPEG audio coding standard. In this paper, we propose a new efficient algorithm for the MDCT/IMDCT computation. It is based on the MDCT/IMDCT computation algorithm using the discrete cosine transforms (DCTs), and it employs two discrete cosine transform of type II(DCT-II) to compute the MDCT/IMDCT. In addition to, it takes advantage of ability in calculating the MDCT/IMDCT computation, where the length of a data block is divisible by 4. The proposed algorithm in this paper requires less calculation complexity than the existing methods. Also, it can be implemented by the parallel structure,, and its structure is particularly suitable for VLSI realization.

• Journal of Industrial Technology
• /
• v.26 no.B
• /
• pp.233-242
• /
• 2006

Continuous, discrete and semi continuous HMM systems are used for the speech recognition. Discrete systems have the advantage of low run-time computation. However, vector quantization reduces accuracy and this can lead to poor performance. Continuous systems let us get good correctness but they need much calculation so that occasionally they are unable to be used for practice. Although there are semi-continuous systems which apply advantage of continuous and discrete systems, they also require much computation. In this paper, we proposed the way which reduces calculation for continuous systems. The proposed method has the same computational load as discrete systems but can give better recognition accuracy than discrete systems.