• East Asian mathematical journal
• /
• v.34 no.1
• /
• pp.69-84
• /
• 2018

In this paper, we study the viscoelastic Kirchhoff type equation with a nonlinear source for each independent kernels h and g with respect to Volterra terms. Under the smallness condition with respect to Kirchhoff coefficient and the relaxation function and other assumptions, we prove the uniform decay rate of the Kirchhoff type energy.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.2
• /
• pp.542-558
• /
• 2023

A digital focus index (DFI) is a value used to determine image focus in scientific apparatus and smart devices. Automatic focus (AF) is an iterative and time-consuming procedure; however, its processing time can be reduced using a general processing unit (GPU) and a multi-core processor (MCP). In this study, parallel architectures of a minimax search algorithm (MSA) are applied to two DFIs: range algorithm (RA) and image contrast (CT). The DFIs are based on a histogram; however, the parallel computation of the histogram is conventionally inefficient because of the bank conflict in shared memory. The parallel architectures of RA and CT are constructed using parallel reduction for MSA, which is performed through parallel relative rating of the image pixel pairs and halved the rating in every step. The array size is then decreased to one, and the minimax is determined at the final reduction. Kernels for the architectures are constructed using open source software to make it relatively platform independent. The kernels are tested in a hexa-core PC and an embedded device using Lenna images of various sizes based on the resolutions of industrial cameras. The performance of the kernels for the DFIs was investigated in terms of processing speed and computational acceleration; the maximum acceleration was 32.6× in the best case and the MCP exhibited a higher performance.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.5
• /
• pp.103-112
• /
• 2007

In this paper, we implement a hypervisor that runs multiple uC/OS-II real-time kernels on one microprocessor. The hypervisor virtualizes microprocessor and memory that are main resources managed by uC/OS-II kernel. Microprocessor is virtualized by controlling interrupts that uC/OS-II real-time kernel handles and memory is virtualized by partitioning physical memory. The hypervisor consists of three components: interrupt control routines that virtualize timer interrupt and software interrupt, a startup code that initializes the hypervisor and uC/OS-II kernels, and an API that provides communication between two kernels. The original uC/OS-II kernel needs to be modified slightly in source-code level to run on the hypervisor. We performed a real-time test and an independent computation test on Jupiter 32-bit EISC microprocessor and showed that the virtualized kernels run without problem. The result of our research can reduce the hardware cost, the system space and weight, and system power consumption when the hypervisor is applied in embedded applications that require many embedded microprocessors.

• Steel and Composite Structures
• /
• v.22 no.1
• /
• pp.161-182
• /
• 2016

A state space differential reproducing kernel (DRK) method is developed for the three-dimensional (3D) analysis of functionally graded material (FGM) axisymmetric circular plates with simply-supported and clamped edges. The strong formulation of this 3D elasticity axisymmetric problem is derived on the basis of the Reissner mixed variational theorem (RMVT), which consists of the Euler-Lagrange equations of this problem and its associated boundary conditions. The primary field variables are naturally independent of the circumferential coordinate, then interpolated in the radial coordinate using the early proposed DRK interpolation functions, and finally the state space equations of this problem are obtained, which represent a system of ordinary differential equations in the thickness coordinate. The state space DRK solutions can then be obtained by means of the transfer matrix method. The accuracy and convergence of this method are examined by comparing their solutions with the accurate ones available in the literature.

• Nuclear Engineering and Technology
• /
• v.48 no.3
• /
• pp.650-659
• /
• 2016

As a type of accident-tolerant fuel, fully ceramic microencapsulated (FCM) fuel was proposed after the Fukushima accident in Japan. The FCM fuel consists of tristructural isotropic particles randomly dispersed in a silicon carbide (SiC) matrix. For a fuel element with such high heterogeneity, we have proposed a two-temperature homogenized model using the particle transport Monte Carlo method for the heat conduction problem. This model distinguishes between fuel-kernel and SiC matrix temperatures. Moreover, the obtained temperature profiles are more realistic than those of other models. In Part I of the paper, homogenized parameters for the FCM fuel in which tristructural isotropic particles are randomly dispersed in the fine lattice stochastic structure are obtained by (1) matching steady-state analytic solutions of the model with the results of particle transport Monte Carlo method for heat conduction problems, and (2) preserving total enthalpies in fuel kernels and SiC matrix. The homogenized parameters have two desirable properties: (1) they are insensitive to boundary conditions such as coolant bulk temperatures and thickness of cladding, and (2) they are independent of operating power density. By performing the Monte Carlo calculations with the temperature-dependent thermal properties of the constituent materials of the FCM fuel, temperature-dependent homogenized parameters are obtained.

• Archives of design research
• /
• v.17 no.2
• /
• pp.123-134
• /
• 2004

Developing curriculum in the field of illustration is the main purpose of this study. During the past 30 years, illustration industry has achieved remarkable success in South Korea. Moreover the trends in styles are various today. Aspiring Korean illustrators were awarded prizes by authoritative international organization for their illustrated picture books lately. Regardless of achievement in the field of illustration, an adequate curriculum to educate illustrators was never developed. Facing the challenging circumstances of the 21th century, professors of illustration need to be specialized and they must study the ultimate curriculum of illustration. Since illustration is a visual language, the kernels of education for illustration are teaching the nature of visual communication, getting the objectivity of communicating and establishing a professional techniques for expression. Even though the basic formative arts training courses are fairly important to students who major in illustration, it is impossible to see the achievement with the current situation of curriculum. In order to make good products of illustration and competent illustrator, we must try to create education system which well-matched for an independent genre of illustration field. Besides 1 hope this study will be used as one of the teaching methods for the field of animation and cartoon as well as for the field of illustration.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.9
• /
• pp.1-12
• /
• 2021

In this paper, we propose a tool called ARCAV (Atomatic Recovery of CUDA Atomicity violation) to automatically repair atomicity violations in GPU (Graphics Processing Unit) program. ARCAV monitors information of every barrier and memory to make actual memory writes occur at the end of the barrier region or to make the program execute barrier region again. Existing methods do not repair atomicity violations but only detect the atomicity violations in GPU programs because GPU programs generally do not support lock and sleep instructions which are necessary for repairing the atomicity violations. Proposed ARCAV is designed for GPU execution model. ARCAV detects and repairs four patterns of atomicity violations which represent real-world cases. Moreover, ARCAV is independent of memory hierarchy and thread configuration. Our experiments show that the performance of ARCAV is stable regardless of the number of threads or blocks. The overhead of ARCAV is evaluated using four real-world kernels, and its slowdown is 2.1x, in average, of native execution time.