• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.6
• /
• pp.1480-1491
• /
• 2013

Certificate-based cryptography is a new cryptographic primitive which eliminates the necessity of certificates in the traditional public key cryptography and simultaneously overcomes the inherent key escrow problem suffered in identity-based cryptography. However, to the best of our knowledge, all existed constructions of certificate-based encryption so far have to be based on the bilinear pairings. The pairing calculation is perceived to be expensive compared with normal operations such as modular exponentiations in finite fields. The costly pairing computation prevents it from wide application, especially for the computation limited wireless sensor networks. In order to improve efficiency, we propose a new certificate-based encryption scheme that does not depend on the pairing computation. Based on the decision Diffie-Hellman problem assumption, the scheme's security is proved to be against the chosen ciphertext attack in the random oracle. Performance comparisons show that our scheme outperforms the existing schemes.

• 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.

• Transactions of Materials Processing
• /
• v.7 no.5
• /
• pp.474-480
• /
• 1998

In the present study a domain decomposition scheme using the substructuring method is developed for the computational efficiency of the finite element analysis of metal forming processes. in order to avoid calculation of an inverse matrix during the substructuring procedure, the modified Cholesky decomposition method is implemented. As obtaining the data independence by the substructuring method the program is easily paralleized using the Parallel Virtual machine(PVM) library on a work-station cluster connected on networks. A numerical example for a simple upsetting is calculated and the speed-up ratio with respect to various number of subdomains and number of processors. The efficiency of the parallel computation is discussed by comparing the results.

• Journal of Biomedical Engineering Research
• /
• v.22 no.3
• /
• pp.223-229
• /
• 2001

In this paper, we have compared the direct fan-beam reconstruction method with the rebinning method in terms of computation time and spatial resolution using computer simulation. As a result, the direct fan-beam method is superior to the rebinning method in the spatial resolution though the former needs longer computation time. However, if we adopt the quarter-detector-offset technique to improve the spatial resolution, the rebinning method outperforms the direct fan-beam method. The computation times have been evaluated using the fast algorithms optimized to reduce the number of interpolation calculations at the back-projection, and the spatial resolutions have been compared using the computer generated phantoms.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2002.05a
• /
• pp.643-646
• /
• 2002

This paper proposes an evolutionary computation approach for automated design of mechanical structures especially in its early stage of design phases. Due to the known characteristics of the stage, the approach basically involves a synthetic design method with the composition of building blocks representing the elements of mechanical objects. In order for the building blocks to be more suitable for representation and evolution of mechanical structures, Elementary Cell Blocks (ECBs) are introduced as new building blocks. A new Darwinian evolution process for the new building blocks is also necessarily involved in the approach. We have demonstrated the implementation of the approach with the design of multi-step gear systems.

• 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.

• Transactions of Materials Processing
• /
• v.19 no.3
• /
• pp.185-190
• /
• 2010

Application of CAE analyses are wide spread in shaping processes and structural safety verification of plastic products. The importance of CAE analysis and its contributions are getting increase since the processibility and structural safety of product can be predicted. CAE analysis for complex shaped product need a lot of time for modeling and computation compare with simpler one. Therefore careful simulation modeling is required for complex shaped product. Structural analysis for plastic door handle of automobile has been performed and structural safety has been investigated for various load directions and modeling cases. Large stress occurred at the hinge in handle regardless of load direction and modeling case. Consequently hinge is considered structurally very weak among the parts in plastic door handle. It is concluded that simple modeling rather than total modeling with adequate boundary condition equivalent to real situation gives reasonable computational results with saving modeling effort and computation time.

• Journal of the Korean Mathematical Society
• /
• v.51 no.1
• /
• pp.137-162
• /
• 2014

In this work we study the local and semilocal convergence of the relaxed Newton's method, that is Newton's method with a relaxation parameter 0 < ${\lambda}$ < 2. We give a Kantorovich-like theorem that can be applied for operators defined between two Banach spaces. In fact, we obtain the recurrent sequence that majorizes the one given by the method and we characterize its convergence by a result that involves the relaxation parameter ${\lambda}$. We use a new technique that allows us on the one hand to generalize and on the other hand to extend the applicability of the result given initially by Kantorovich for ${\lambda}=1$.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.262-264
• /
• 2002

In this paper we focused on the color representation prob1em based on fuzzy set theory. The main factor is the determination or computation of color membership function and color difference formula. The mathematical formula to calculate the color difference should generate a uniform color scaling, and due to this reason we adopted a CIELAB color- space as a fundamental feature space. With the help of the CIELAB color space we created a new color model, referred to fuzzy color model, which can represent the ambiguous characteristics underlying colors. Based on the proposed color difference formula between fuzzy colors, we could obtain the membership computation method of an arbitrary color for a given color family.