• Transactions of the Korean Society of Mechanical Engineers
• /
• v.12 no.1
• /
• pp.163-172
• /
• 1988

An off-line Geometric Adaptive Control Scheme is applied to the milling machine to identify its guideway errors. In the milling process, the workpiece fixed on the bed travels along the guideway while the tool and spindle system is fixed onto the machine. The scheme is based on the exponential smoothing of post-process measurements of relative machining errors due to the tool, workpiece and bed deflections. The guideway error identification system consists of a gap sensor, a, not necessarily accurate, straightedge, and the numerical control unit. Without a priori knowledge of the variations of the cutting parameters, the time-varying parameters are also estimated by an exponentially weighted recursive least squares method. Experimental results show that the guideway error is well identified within the range of RMS values of geometric error changes between machining passes disregarding the machining conditions.

• Management Science and Financial Engineering
• /
• v.14 no.2
• /
• pp.13-23
• /
• 2008

The pricing/lot-sizing problem of determining the robust optimal order quantity and selling price is discussed. The uncertainty of parameters characterized by an ellipsoid is explicitly incorporated into the problem. An approximation scheme is proposed to transform the problem into a geometric program, which can be efficiently and reliably solved using interior-point methods.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.10a
• /
• pp.187-192
• /
• 1993

Thermal deformation causes large amount of machine tool errors. In order to compensate for thermal and geometric errors of the machine tool an off-line geometric adaptive control (GAC) scheme was developed. THe GAC method was realized by using a measuring plate made of precision spheres. Error vectors and volumetric errors were measured by the measuring plate. Error compensation models were obtained from error vectors and a kinematic chain of machine tools. Reliability of the GAC system of thermal and geometric errors were confrimed by large amount of experiments.

• ETRI Journal
• /
• v.29 no.4
• /
• pp.445-451
• /
• 2007

An adaptive modulation scheme is presented for multiuser orthogonal frequency-division multiplexing systems. The aim of the scheme is to minimize the total transmit power with a constraint on the transmission rate for users, assuming knowledge of the instantaneous channel gains for all users using a combined bit-loading and subcarrier allocation algorithm. The subcarrier allocation algorithm identifies the appropriate assignment of subcarriers to the users, while the bit-loading algorithm determines the number of bits given to each subcarrier. The proposed bit-loading algorithm is derived from the geometric progression of the additional transmission power required by the subcarriers and the arithmetic-geometric means inequality. This algorithm has a simple procedure and low computational complexity. A heuristic approach is also used for the subcarrier allocation algorithm, providing a trade-off between complexity and performance. Numerical results demonstrate that the proposed algorithms provide comparable performance with existing algorithms with low computational cost.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.595-606
• /
• 2011

This paper proposes a robust watermarking scheme for GIS digital map by using the geometric properties of polyline and polygon, which are the fundamental components in vector data structure. In the proposed scheme, we calculate the lengths and the perimeters of all polylines and polygons in a map and cluster them to a number of groups. Then we embed the binary watermark by changing the mean of lengths and perimeters in an embedding group. For improving the safety and robustness, we permute the binary watermark through PRNS(pseudo-random number sequence) processing and embed it repeatedly in a model. Experimental results verified that our scheme has a good invisibility, safety and robustness to various geometric attacks and also our scheme needs not the original map in the extracting process of watermark.

• Korean Journal of Computational Design and Engineering
• /
• v.9 no.4
• /
• pp.294-305
• /
• 2004

Highly detailed geometric models are rapidly becoming commonplace in computer graphics and other applications. These complex models, which is often represented as complex1 triangle meshes, mainly suffer from the vast memory requirement for real-time manipulation of arbitrary geometric shapes without loss of data. Various techniques have been devised to challenge these problems in views of geometric processing, not a representation scheme. This paper proposes the new mesh structure for the compact representation and the efficient handling of the highly complex models. To verify the compactness and the efficiency, the memory requirement of our representation is first investigated and compared with other existing representations. And then we analyze the time complexity of our data structure by the most critical operation, that is, the enumeration of the so-called one-ring neighborhood of a vertex. Finally, we evaluate some elementary modeling functions such as mesh smoothing, simplification, and subdivision, which is to demonstrate the effectiveness and robustness of our mesh structure in the context of the geometric modeling and processing.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2003.04a
• /
• pp.253-260
• /
• 2003

In computer-aided geometric modeling(CAGD), subdivision surfaces are frequently employed to construct free-form surfaces. In the present study, Loop scheme and Catmull-Clark scheme are applied to generate smooth surfaces. To be consistent with the limit points of target surface, the initial sampling points are properly rearranged. The pointwise errors of curvature and position in the sequence of subdivision process are evaluated in both Loop scheme & Catmull-Clark subdivision scheme. In partcural, a general subdivision method in order to generate considering extraordinary points are implemented free from surface with arbitrary sampling point information.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.394-399
• /
• 1990

We develop an automatic trajectory planning system (ATPS) for painting robots by proposing a new trajectory planning scheme. The new scheme considers geometric modeling, painting mechanics, and robot dynamics to output an optimal trajectory (in the sense of coating thickness and painting time) based on the CAD data describing the shape of objects, The new scheme is implemented in SUN/4 workstation to develop an ATPS for painting robots. To test the validity of the new scheme and to illustrate the developed system, numerous runs are performed and analyzed.

• International Journal of Contents
• /
• v.5 no.2
• /
• pp.32-37
• /
• 2009

A new video watermarking scheme with robustness against collusion and synchronization attacks is presented. We propose to embed only a few copies of the watermark along the temporal axis into frames, which are located at the borders of each two different plotlines of the video. As a result, each change of the video plotline is transformed into pulse, which is used for watermark embedding and extraction. In addition, since we embed a watermark only into a small number of frames, the distortions of the video are reduced to minimum. Experimental results show the robustness of the proposed scheme.

• The Mathematical Education
• /
• v.25 no.3
• /
• pp.57-69
• /
• 1987

A geometric interpretation of t-designs, in the context of posets, is given in the association scheme, not isomorphic with the Hamming scheme H(2,4), but having the same parameters as H(2,4). It is also shown that there is no similar poset which characterizes the designs for ally of the three exceptional association schemes, not isomorphic with the Johnson scheme J(8,2), but having the same parameters as J(8,2).