• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.48 no.2
• /
• pp.6-13
• /
• 2011

This paper deals with the interconnection problem in ad-hoc networks or sensor networks, where relay nodes are deployed additionally to form connections between given nodes. This problem can be reduced to a NP-hard problem. The nodes of the networks, by applications or geographic factors, can be deployed densely in some areas while sparsely in others. For such a case one can make an approximation scheme, which gives shorter execution time, for the additional node deployments by ignoring the interconnections inside the dense area of nodes. However, the case is still a NP-hard, so it is proper to establish a polynomial time approximation scheme (PTAS) by implementing a dynamic programming. The analysis can be made possible by an elaboration on making the definition of the objective function. The objective function should be defined to be able to deal with the requirement incurred by the substitution of the dense area with its abstraction.

• Wind and Structures
• /
• v.34 no.1
• /
• pp.59-72
• /
• 2022

In this work the numerical results of the flow around a 5:1 rectangular cylinder at Reynolds numbers 3 000 and 40 000, zero angle of attack and smooth incoming flow condition are presented. Implicit Large Eddy Simulations (ILES) have been performed with a high-order accurate spatial scheme and an implicit high-order accurate time integration method. The spatial approximation is based on a discontinuous Galerkin (dG) method, while the time integration exploits a linearly-implicit Rosenbrock-type Runge-Kutta scheme. The aim of this work is to show the feasibility of high-fidelity flow simulations with a moderate number of DOFs and large time step sizes. Moreover, the effect of different parameters, i.e., dimension of the computational domain, mesh type, grid resolution, boundary conditions, time step size and polynomial approximation, on the results accuracy is investigated. Our best dG result at Re=3 000 perfectly agrees with a reference DNS obtained using Nek5000 and about 40 times more degrees of freedom. The Re=40 000 computations, which are strongly under-resolved, show a reasonable correspondence with the experimental data of Mannini et al. (2017) and the LES of Zhang and Xu (2020).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.727-736
• /
• 2009

In this paper, the $arccos(cos^{-1})$ arithmetic unit for mobile graphics accelerator is designed. The mobile vector graphics applications need tight area, execution time, power dissipation, and accuracy constraints compared to desktop PC applications. The designed processor adopts 2nd-order polynomial approximation scheme based on IEEE floating point data format to satisfy speed and accuracy conditions and reduces area via hardware sharing structure. The arccosine processor consists of 15,280 gates and its estimated operating frequency is about 125Mhz at operating condition of $0.35{\mu}m$ CMOS technology. Because the processor can execute arccosine function within 7 clock cycles, it has about 17 MOPS(million arccos operations per second) execution rate and can be applicable to mobile OpenVG processor. And because of its flexible architecture, it can be applicable to the various transcendental functions such as exponential, trigonometric and logarithmic functions via replacement of ROM and minor hardware modification.