• Transactions of the Korean Society of Automotive Engineers
• /
• v.1 no.3
• /
• pp.95-108
• /
• 1993

The needs for smooth curves and surfaces are increasing in modeling cars, ships, airplanes, and other consumer products either for aesthetic or functional purpose. However, the curves and surfaces generated by conventional modeling methods usually exhibit an unwanted behavior due to digitizing errors or inadequate generation method, and thus much time and extra effort is spent afterwards to get the faired results. The objective of this work is to develop a fairing scheme by which well refined shape of a surface can be acquired with detecting and removing the shape imperfections of the given surface represented by NURBS. The fairing scheme is based on an optimization process in which the control points of the given surface are repositioned to minimize the integration of the jumps(perturbations) of the unit normal vectors at all surface points.

• Communications of the Korean Mathematical Society
• /
• v.31 no.2
• /
• pp.379-388
• /
• 2016

In this study, by using Laplace and normal Laplace operators, we give some characterizations for the Darboux instantaneous rotation vector field of the curves in the Euclidean 3-space $E^3$. Further, we give necessary and sufficient conditions for unit speed space curves to have 1-type Darboux vectors. Moreover, we obtain some characterizations of helices according to Darboux vector.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.10
• /
• pp.835-839
• /
• 2000

보로노이 다이아그램은 계산기하학에서 다양한 형태의 근접 문제를 해결함에 있어 중요한 역할을 하고 있다. 일반적으로 평면상의 n 개의 점에 의한 평면 보로노이 다이아그램 O(nlogn) 시간에 생성할 수 있으며 이 알고리즘의 시간 복잡도가 최적임이 밝혀져 있다. 본 논문에서는 특별한 관계를 갖는 단위 구면상의 점들에 대한 구면 상에서 정의되는 보로노이 다이아그램을 O(n)에 생성하는 알고리즘을 제시한다. 이때 주어진 구면상의 점들은 볼록 다면체의 단위 법선 벡터들의 종점에 해당되며, 구면 보로노이 다이아그램의 선분은 구면상의 geodesic으로 이루어진다.

• Journal of Korea Multimedia Society
• /
• v.22 no.5
• /
• pp.580-587
• /
• 2019

In this paper, a plane detection method using depth information is proposed. 3-D characteristics of a pixel are defined as a direction and length of a normal vector whose is calculated from a plane consisting of a local region centered on the pixel. Image coordinates of each pixel are transformed to 3-D coordinates in order to obtain the local planes. Regions of each plane are detected by calculating similarity of the 3-D characteristics. The similarity of the characteristics consists of direction and distance similarities of normal vectors. If the similarity of the characteristics between two adjacent pixels is enough high, the two pixels are regarded as consisting of same plane. Simulation results show that the proposed method using the depth picture is more accurate for detecting plane areas than the conventional method.

• Journal of Power Electronics
• /
• v.15 no.3
• /
• pp.670-684
• /
• 2015

The hybrid cascaded multilevel inverter (HCMLI) is a popular converter topology that is being increasingly used in high power medium voltage drives. The intricacy of the control technique for a HCMLI increases with the number of levels and due to fluctuating dc voltages. This paper presents a novel offline quadrant search based space vector modulation technique to synthesize a sinusoidal output from a dispersed pattern of voltage vectors due to different voltages in the auxiliary unit. Such an investigation has never been reported in the literature and it is being attempted for the first time. The method suggested distributes the voltage vectors for a reduced total harmonic distortion at minimal computation. In addition, the proposed algorithm determines the maximum modulation index in the linear modulation range in order to synthesize a sinusoidal output for both normal and abnormal vector patterns. It is better suited for a wide range of practical applications. It is particularly well suited for renewable source fed inverters which utilize large capacitor banks to maintain the dc link, which are prone to such slow fluctuations. The proposed quadrant search space vector modulation technique is simulated using MATLAB/SIMULINK and implemented using a Nexys-2 Spartan-3E FPGA for a developed prototype.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 1994.03a
• /
• pp.118-128
• /
• 1994

The planar anisotropic FEM analysis for predicting the earing profiles and draw-in amounts in the deep-drawing processes is introduced. An implicit, incremental, updated Lagrangian formulation with a rigid-viscoplastic constitutive equation is employed. Contact and friction are considered through the mesh-based unit vectors and the normal contact pressure. the consistent full set of governing relations, comprising equilibrium and geometric constraint equations, is appropriately linearized. Barlat's strain-rate potential is employed, whose in-plane anisotropic properties are taken into account with anisotropic coefficients and potential parameter. The linear triangular membrane elements are used for depicting the formed sheet. with the numerical simulations of deep drawing processes of flat-top cylindrical cup for the 2090-T3 aluminum effects on the earing behavior are examined. Earing predictions made for the 2090-T3 aluminum alloy sheet show good agreement with experiments, although some discrepancies were observed in the directional trend of cup height and thickness strains.

• Archives of Pharmacal Research
• /
• v.27 no.6
• /
• pp.633-639
• /
• 2004

The expression of therapeutic transgenes in recombinant adenoviral vectors is a major cause of toxicity in dividing cancer cells as well as non dividing normal cells. To solve the problem of toxicity to normal cells, we have reported on a recombinant adenoviral vector system （AdLP-） in which the expression of the transgene is directed by the tumor-specific L-plastin promoter （LP） （Chung et al., 1999）. The object of this study was to generate a recombinant adenoviral vector system which would generate tumor cell specific expression of cytosine deaminase （CD） gene. We report the construction of a replication-incompetent adenoviral vector in which CD is driven by the L-plastin promoter （AdLPCD）. Infection of 293 cells by AdLPCD generated the functional CD protein as measured by HPLC analysis for the conversion of 5-Fluorocy-tosine （5-FC） to 5-Fluorouracil （5-FU）. HPLC analysis in conjunction with counting radioactivity for ［6-$^3$H］-5FC and ［6-$^3$H］-5FU demonstrated vector dose-dependent conversion of 5-FC to 5-FU in AdLPCD infected ovarian cancer cells. The results from present and previous studies（Peng et al., 2001； Akbulut et al., 2003） suggest that the use of the AdLPCD／5-FC system may be of value in the treatment of cancer including microscopic ovarian cancer in the peritoneal cavity.

• Proceedings of the KSME Conference
• /
• 2002.08a
• /
• pp.815-818
• /
• 2002

The elliptic relaxation model(ERM) with the inhomogeneous correction intermediate between near wall with and far from the wall. The source of the ERM usually was appled quasi-homogeneous pressure-strain correlation in homogeneous situations. This formulation was easily applied to the linear model or non-linear pressure-strain model. It is observed that the boundary conditions of the relaxation operator dominate the homogeneous pressure-strain model in the near wall region. While looking at high-Reynolds number flows, it was found necessary to modify the effect of the relaxation operator throughout the log region by accounting for gradients of the flatness variable and turbulent length scales. These effects are kinematic blocking of the wall normal velocity fluctuation and pressure reflections from the surface. This model is wall distances and unit vectors which make the model applicable to flows boundary by a complex geometry. Inhomogeneous correction model is computed inertial and non-inertial channel flow These are compared DNS(Kim et at., Kristofffrsen & Andersson) for channel flow. The present model could be predicted well for rotating flows.

• KIPS Transactions on Software and Data Engineering
• /
• v.12 no.8
• /
• pp.355-364
• /
• 2023

As advanced cyber threats continue to increase in recent years, it is difficult to detect new types of cyber attacks with existing pattern or signature-based intrusion detection method. Therefore, research on anomaly detection methods using data learning-based artificial intelligence technology is increasing. In addition, supervised learning-based anomaly detection methods are difficult to use in real environments because they require sufficient labeled data for learning. Research on an unsupervised learning-based method that learns from normal data and detects an anomaly by finding a pattern in the data itself has been actively conducted. Therefore, this study aims to extract a latent vector that preserves useful sequence information from sequence log data and develop an anomaly detection learning model using the extracted latent vector. Word2Vec was used to create a dense vector representation corresponding to the characteristics of each sequence, and an unsupervised autoencoder was developed to extract latent vectors from sequence data expressed as dense vectors. The developed autoencoder model is a recurrent neural network GRU (Gated Recurrent Unit) based denoising autoencoder suitable for sequence data, a one-dimensional convolutional neural network-based autoencoder to solve the limited short-term memory problem that GRU can have, and an autoencoder combining GRU and one-dimensional convolution was used. The data used in the experiment is time-series-based NGIDS (Next Generation IDS Dataset) data, and as a result of the experiment, an autoencoder that combines GRU and one-dimensional convolution is better than a model using a GRU-based autoencoder or a one-dimensional convolution-based autoencoder. It was efficient in terms of learning time for extracting useful latent patterns from training data, and showed stable performance with smaller fluctuations in anomaly detection performance.

• Journal of Korea Multimedia Society
• /
• v.3 no.3
• /
• pp.298-308
• /
• 2000

We present an efficient algorithm for finding the sequence of extreme vortices of a moving regular convex polyhedron of with respect to a fixed plane H.. The algorithm utilizes the spherical Voronoi diagram that results from the outward unit normal vectors nF$_{i}$ 's of faces of P. It is well-known that the Voronoi diagram of n sites in the plane can be computed in 0(nlogn) time, and this bound is optimal. However. exploiting the convexity of P, we are able to construct the spherical Voronoi diagram of nF$_{i}$ ,'s in O(n) time. Using the spherical Voronoi diagram, we show that an extreme vertex problem can be transformed to a spherical point location problem. The extreme vertex problem can be solved in O(logn) time after O(n) time and space preprocessing. Moreover, the sequence of extreme vertices of a moving regular convex polyhedron with respect to H can be found in (equation omitted) time, where m$^{j}$ $_{k}$ (1$\leq$j$\leq$s) is the number of edges of a spherical Voronoi region sreg(equation omitted) such that (equation omitted) gives one or more extreme vertices.