• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.990-994
• /
• 2004

This paper presents a method to predict the transient characteristic of the air lubricated slider head in a hard disk drive by using optimization technique. The time dependent modified Reynolds equation based on the molecular slip flow approximation equations was used to describe the fluid flow within the air bearing and the implicit finite difference scheme is applied to calculate the pressure distribution under the slider head. The exhaustive search combined with the Broyden-Fletcher-Goldfarb-Shanno method were employed to obtain optimum design variables which are taper angle, rail width and taper length in order to keep the forces and moments acting on the slider head in dynamic equilibrium. The results show that the optimal head slider of the magnetic head has good stability characteristic that can reach the steady state within 0.5 microsecond.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.1289-1294
• /
• 2003

This paper proposes a novel and efficient intelligent digital redesign technique for a Takagi-Sugeno (TS) fuzzy system. The term of intelligent digital redesign involves converting an existing analog fuzzy-model-based controller into an equivalent digital counterpart in the sense of state matching. In this paper, we suggest the discretization method based on the dual-rate sampling approximation is first proposed, and then attempt to globally match the states of the overall closed-loop TS fuzzy system with the pre-designed analog fuzzy-model-based controller and those with the digitally redesigned fuzzy-model-based controller. To show the feasibility and the effectiveness of the proposed method, a computer simulation is provided.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 하계종합학술대회 논문집(1)
• /
• pp.7-10
• /
• 2004

This paper describes techniques to implement low-cost adapt ive Pipelined LMS filter for ASIC implement ions of high communication receivers. Power consumpiton can be reduced using a careful selection of architectural, algorithmic, and VLSI circuit techlifue A Pipelined architecture for the strength-reduced algorithm is then developed via the relaxed look-ahead transformation. This technique, which is an approximation of the conventional look-ahead compution, maintains the functionality of the algorithm rather than the input-output behavior Convergence maiysis of the Proposed architecture has been presented and support via simulation results. The resulting pipelined adaptive filter achives a higher though put requires lower power as compared to the filter using the serial algorithm.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제17권2호
• /
• pp.180-185
• /
• 2017

In this research, we proposed the simple and efficient method to calculate the shear stresses by using the mid-point measurements in ${\pm}45^{\circ}$ semiconductor resistor-sensor pair. Compared to the previous works, the measurements became much simpler by combining the approximation theory with the technique of mid-point measurement. In addition, we proposed another novel method for the stress calculation in which we could increase the sensitivity of the stress sensor by controlling the applied voltage between the sensor-pair. For the applied voltage of 8 V, the sensitivity showed a significant increase by 100%.

• JSTS:Journal of Semiconductor Technology and Science
• /
• 제17권3호
• /
• pp.465-472
• /
• 2017

Security has become one of the most important requirements for various devices for multi-sensor based embedded systems. The AES (Advanced Encryption Standard) algorithm is widely used for security, however, it requires high computing power. In order to reduce the CPU power for the data encryption of images, we propose a new image encryption module using hardware memoization, which can reuse previously generated data. However, as image pixel data are slightly different each other, the reuse rate of the simple memoization system is low. Therefore, we further apply an approximate concept to the memoization system to have a higher reuse rate by sacrificing quality. With the novel technique, the throughput can be highly improved by 23.98% with 14.88% energy savings with image quality loss minimization.

• East Asian mathematical journal
• /
• 제34권5호
• /
• pp.661-681
• /
• 2018

In this paper, we discuss a reduced-order modeling for the Benjamin-Bona-Mahony-Burgers (BBMB) equation and its application to a distributed feedback control problem through the centroidal Voronoi tessellation (CVT). Spatial distcritization to the BBMB equation is based on the finite element method (FEM) using B-spline functions. To determine the basis elements for the approximating subspaces, we elucidate the CVT approaches to reduced-order bases with snapshots. For the purpose of comparison, a brief review of the proper orthogonal decomposition (POD) is provided and some numerical experiments implemented including full-order approximation, CVT based model, and POD based model. In the end, we apply CVT reduced-order modeling technique to a feedback control problem for the BBMB equation.

• 한국CDE학회논문집
• /
• 제21권4호
• /
• pp.443-452
• /
• 2016

This paper proposes a method for expensive black box optimization using radial basis functions (RBFs). The proposed algorithm is a computational strategy that uses a RBF model approximating the expensive black box function to predict an optimum. First, a RBF-based approximation technique is introduced and a sampling plan for estimation of the black box function is described. Then the proposed algorithm is explained, which presents the pseudo-codes for implementation and the detailed description of each step performed in the optimization process. In addition, numerical experiments will be given to analyze the performance of the proposed algorithm, by investigating computation accuracy, number of function evaluations, and convergence history. Finally, geometric distance problem as application example will be also presented for showing the algorithm applicability to different engineering problems.

• 한국컴퓨터그래픽스학회논문지
• /
• 제8권3호
• /
• pp.1-7
• /
• 2002

This paper presents a practical technique for approximating the boundary surface of the volume swept out by three-dimensional objects using the depth-buffer. Objects may change their geometries and orientations while sweeping. The sweep volume is approximated as a union of volume elements, which are just rendered inside appropriate viewing frusta of virtual cameras and mapped into screen viewports with depth-buffer. From the depth of each pixel in the screen space of each rendering, the corresponding point in the original world space can be computed. Appropriately connecting these points yields polygonal faces forming polygonal surface patches approximately covering some portion of the sweep volume. Each view frustum adds one or more surface patches in this way, and these presumably overlapped polygonal surface patches approximately enclose the whole sweep volume. These patches may further be processed to yield non-overlapped polygonal surfaces as an approximation to the boundary of the original 3D sweep volume.

• 대한수학회보
• /
• 제40권3호
• /
• pp.385-397
• /
• 2003

In this paper, we introduce and study a system of nonlinear implicit variational inclusions (SNIVI) in real Banach spaces: determine elements $x^{*},\;y^{*},\;z^{*}\;\in\;E$ such that ${\theta}\;{\in}\;{\alpha}T(y^{*})\;+\;g(x^{*})\;-\;g(y^{*})\;+\;A(g(x^{*}))\;\;\;for\;{\alpha}\;>\;0,\;{\theta}\;{\in}\;{\beta}T(z^{*})\;+\;g(y^{*})\;-\;g(z^{*})\;+\;A(g(y^{*}))\;\;\;for\;{\beta}\;>\;0,\;{\theta}\;{\in}\;{\gamma}T(x^{*})\;+\;g(z^{*})\;-\;g(x^{*})\;+\;A(g(z^{*}))\;\;\;for\;{\gamma}\;>\;0,$ where T, g : $E\;{\rightarrow}\;E,\;{\theta}$ is zero element in Banach space E, and A : $E\;{\rightarrow}\;{2^E}$ be m-accretive mapping. By using resolvent operator technique for n-secretive mapping in real Banach spaces, we construct some new iterative algorithms for solving this system of nonlinear implicit variational inclusions. The convergence of iterative algorithms be proved in q-uniformly smooth Banach spaces and in real Banach spaces, respectively.

• 전자공학회논문지S
• /
• 제34S권5호
• /
• pp.45-51
• /
• 1997

To trnsmit moving image signals by using an object vased coding technique at the rate of 8kbps~11kbps, it is very important to minimize the bit rates used for the compression of the color information of MF-objects. This paper proposes a hybrid coding method which uses the shpae adaptive coding method and the interframe reference method selectively. Gilge's shape adaptive orthogonal coidng method is utilized for shpae adaptive coding. The interfarame reference method approximates the low-passed signals of the image by gilge's shpae adaptive orthogonalization method and then refers the approximation error signals from the high frequency signal components of th eprevious frame. The proposed method achives the bit rates reduction of 17% compared to the gilge's shape adaptive orthogonalization method and 30% rduction compared to the shape adaptive DCT in average.