• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1994.10a
• /
• pp.145-151
• /
• 1994

Welded connections have been designed on basis of allowable stresses, wherein the response to loading is assumed to be totally elastic. This is the vector analysis method, which resolves the stresses determined from the direct stress formula and the torsion formula into a vector combination to obtain a solution. It has been known that this method gives conservative answers and typically a very high factor of safety. An analytical method based on the Instantaneous Center of Rotation has been developed which predicts the ultimate strength of an eccentically loaded fillet welded connection. The method of Instantaneous Center of Rotation results in weld resistance capacities greater than the vector analysis method, by recognizing the variation in fillet weld strength with respect to the direction of the applied loading and actual load-deformation response of elemental fillet welds. The procedure of numerical analysis is iterative and complex. The relations between vector analysis method and the method of Instantaneous Center of Rotation on eccentrical distance subjected to variation of load direction are presented in this paper. Considering of the effects on configuration of weld groups, the method of Instantaneous Center of Rotation are provided a more exact results of the numerical analysis.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.27 no.8
• /
• pp.98-104
• /
• 2013

AC machines are in wide use in industry and d-q transformation from 3 phase of a, b, c is commonly used to analyze these kinds of machines. The equivalent circuits of d and q axis are, however, generally cross coupled and difficult to analyze. In this study, a modeling technique of AC machine including induction and PM synchronous motors using matrix vector is proposed. With that model, it can not only explain the AC machines physically but also make it simple to analyze them. The separating process of d and q components is not needed in this model and this model can be applied to analyze asymmetric motors like IPMSM machine. With this technique, the model becomes simple, easy to understand physically, and yields results that are the same as those from other models. These simulation results of the proposed model for induction motor are compared with those of other models to verify the method proposed.

• Journal of information and communication convergence engineering
• /
• v.6 no.2
• /
• pp.187-191
• /
• 2008

In the mobile environments for the vector map services, a map simplification work through the map generalization steps helps improve the readability of the map on a large scale. The generalization operations are various such as selection, aggregation, simplification, displacement, and so on, the formal operation algorithms have not been built yet. Because the algorithms require deep special knowledge and heuristic, which make it hard to automate the processes. This thesis proposes some map generalization algorithms specialized in mobile vector map services, based on previous works. This thesis will show the detail to adapt the approaches on the mobile environment, to display complex spatial objects efficiently on the mobile devices which have restriction on the resources.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.7
• /
• pp.807-818
• /
• 1988

This paper proposes new algorithms for the estimation of displacement vector and moving object extraction using difference picture. First, the relations between the boundary of moving objects in two consecutive image and the boundary of difference picture regions are analyzed, then displacement vector estimation algorithm is proposed. Using the estimated displacement vector, moving objects are directly extracted from difference picture. Since the proposed algorithms do not process gray-valued image, they have a short processing time and are suitable to real time processing. From the experimental results, we observed that, if difference picture is wel extracted, the proposecd algorithms work well even in the circumstances of complex background, fast or slow motion, rotation etc., including occlusion where is not moving area.

• Communications of the Korean Mathematical Society
• /
• v.13 no.3
• /
• pp.545-560
• /
• 1998

Let ø and A be denoted by the structure tensor field of type (1,1) and by the shape operator of a real hypersurface in a complex space form $M_{n}$ (c), c $\neq$ 0 respectively. The main purpose of this paper is to prove that if a real hypersurface in $M_{n}$ (c) satisfies $R_{ξ}$ øA = $AøR_{ξ}$, then the structure vector field ξ is principal, where $R_{ξ}$ / is the Jacobi operator with respect to ξ.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.9 no.3
• /
• pp.48-55
• /
• 2006

This paper describes the antenna based GPS anti-jamming technology called CRPA(Controlled Reception Pattern Antenna), which used $2{\times}2$ array elements. In this system, the main functions are the antenna complex weight control and the GPS digital I/Q VM(Vector Modulator). To update the VM's I/Q complex weights, the PC based DAC(Digital to Analog Converter) module was also used and the two analog output voltages were applied to the $2{\times}2$ array elements to synthesize the null pattern. In the study, we also simulated the $2{\times}2$ GPS array null patterns to compare the null depth with experimental results. The VM was also modified at the frequency of 1.575GHz for the GPS L1 and controlled by the PC based VM software.

• Journal of the Korean Mathematical Society
• /
• v.49 no.2
• /
• pp.251-263
• /
• 2012

A CW complex B is said to be I-trivial if there does not exist a $\mathbb{Z}_2$-map from $S^{i-1}$ to S(${\alpha}$) for any vector bundle ${\alpha}$ over B a any integer i with i > dim ${\alpha}$. In this paper, we consider the question of determining whether $\Sigma^k\mathbb{R}P^n$ is I-trivial or not, and to this question we give complete answers when k $\neq$ 1, 3, 8 and partial answers when k = 1, 3, 8. A CW complex B is I-trivial if it is "W-trivial", that is, if for every vector bundle over B, all the Stiefel-Whitney classes vanish. We find, as a result, that $\Sigma^k\mathbb{R}P^n$ is a counterexample to the converse of th statement when k = 2, 4 or 8 and n $\geq$ 2k.

• Honam Mathematical Journal
• /
• v.42 no.3
• /
• pp.621-643
• /
• 2020

Depending on the characteristic vector filed ζ, a generic lightlike submanifold M in an indefinite Kaehler manifold ${\bar{M}}$ with a semi-symmetric metric connection has various characterizations. In this paper, when the characteristic vector filed ζ belongs to the screen distribution S(TM) of M, we provide some characterizations of (Lie-) recurrent generic lightlike submanifold M in an indefinite Kaehler manifold ${\bar{M}}$ with a semi-symmetric metric connection. Moreover, we characterize various generic lightlike submanifolds in an indefinite complex space form ${\bar{M}}$ (c) with a semi-symmetric metric connection.

• East Asian mathematical journal
• /
• v.38 no.1
• /
• pp.43-63
• /
• 2022

Let M be a semi-invariant submanifold of codimension 3 with almost contact metric structure (φ, ξ, η, g) in a complex space form M_n+1(c). We denote by R_ξ the structure Jacobi operator with respect to the structure vector field ξ and by ${\bar{r}}$ the scalar curvature of M. Suppose that R_ξ is φ∇_ξξ-parallel and at the same time the third fundamental form t satisfies dt(X, Y) = 2θg(φX, Y) for a scalar θ(≠ 2c) and any vector fields X and Y on M. In this paper, we prove that if it satisfies R_ξφ = φR_ξ, then M is a Hopf hypersurface of type (A) in M_n+1(c) provided that ${\bar{r}-2(n-1)c}$ ≤ 0.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.26 no.4
• /
• pp.263-279
• /
• 2022

This paper presents an automatic inspection of defects in semiconductor images. We devise a statistical method to find defects on homogeneous background from the observation that it has a log-normal distribution. If computer aided design (CAD) data is available, we use it to construct a signed distance function (SDF) and change the pixel values so that the average of pixel values along the level curve of the SDF is zero, so that the image has a homogeneous background. In the absence of CAD data, we devise a hybrid method consisting of a model-based algorithm and two neural networks. The model-based algorithm uses the first right singular vector to determine whether the image has a linear or complex structure. For an image with a linear structure, we remove the structure using the rank 1 approximation so that it has a homogeneous background. An image with a complex structure is inspected by two neural networks. We provide results of numerical experiments for the proposed methods.