• Geomechanics and Engineering
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2018

In this paper an efficient and simple refined shear deformation theory is presented for the free vibration of Functionally Graded Plates Under Various Boundary Conditions. The theory accounts for a quadratic variation of the transverse shear strains across the thickness, and satisfies the zero traction boundary conditions on the top and bottom surfaces of the plate without using shear correction factors. The number of independent unknowns of present theory is four, as against five in other shear deformation theories. The plates are considered of the type having two opposite sides simply-supported, and the two other sides having combinations of simply-supported, clamped, and free boundary conditions. The mechanical properties of functionally graded material are assumed to vary according to power law distribution of the volume fraction of the constituents. Equations of motion are derived using Hamilton's principle. The results of this theory are compared with those of other shear deformation theories. Various numerical results including the effect of boundary conditions, power-law index, plate aspect ratio, and side-to-thickness ratio on the free vibration of FGM plates are presented.

• Korean Journal of Mathematics
• /
• v.23 no.3
• /
• pp.337-355
• /
• 2015

We in this note consider a class of rings which is related to both power-Armendariz and central Armendariz rings, in the spirit of Armendariz and Kaplansky. We introduce central power-Armendariz as a generalization of them, and study the structure of central products of coefficients of zero-dividing polynomials. We also observe various sorts of examples to illuminate the relations between central power-Armendariz and related ring properties.

• Journal of Korea Multimedia Society
• /
• v.17 no.7
• /
• pp.769-777
• /
• 2014

With the rapid interest in Geographic Information System (GIS) contents, a large volume of valuable GIS dataset has been distributed illegally by pirates, hackers, or unauthorized users. Therefore the problem focus on how to protect the copyright of GIS vector map data for storage and transmission. At this point, GIS security techniques focusing on secure network and data encryption have been studied and developed to solve the copyright protection and illegal copy prevention for GIS digital map. But GIS vector map data is very large and current data encryption techniques often encrypt all components of data. That means we have encrypted large amount of data lead to the long encrypting time and high complexity computation. This paper presents a novel selective encryption scheme for GIS vector map data protection to store, transmit or distribute to authorized users using K-means algorithm. The proposed algorithm only encrypts a small part of data based on properties of polylines and polygons in GIS vector map but it can change whole data of GIS vector map. Experimental results verified the proposed algorithm effectively and error in decryption is approximately zero.

• Journal of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1089-1104
• /
• 2014

An operator $T{\in}L(H)$, is said to belong to k-quasi class $A_n^*$ operator if $$T^{*k}({\mid}T^{n+1}{\mid}^{\frac{2}{n+1}}-{\mid}T^*{\mid}^2)T^k{\geq}O$$ for some positive integer n and some positive integer k. First, we will see some properties of this class of operators and prove Weyl's theorem for algebraically k-quasi class $A_n^*$. Second, we consider the tensor product for k-quasi class $A_n^*$, giving a necessary and sufficient condition for $T{\otimes}S$ to be a k-quasi class $A_n^*$, when T and S are both non-zero operators. Then, the existence of a nontrivial hyperinvariant subspace of k-quasi class $A_n^*$ operator will be shown, and it will also be shown that if X is a Hilbert-Schmidt operator, A and $(B^*)^{-1}$ are k-quasi class $A_n^*$ operators such that AX = XB, then $A^*X=XB^*$. Finally, we will prove the spectrum continuity of this class of operators.

• Communications of the Korean Mathematical Society
• /
• v.32 no.3
• /
• pp.661-676
• /
• 2017

Let T be a bounded linear operator acting on a complex Hilbert space ${\mathfrak{H}}$. In this paper we introduce the class, denoted ${\mathcal{Q}}(A(k),m)$, of operators satisfying $T^{m{\ast}}(T^{\ast}{\mid}T{\mid}^{2k}T)^{1/(k+1)}T^m{\geq}T^{{\ast}m}{\mid}T{\mid}^2T^m$, where m is a positive integer and k is a positive real number and we prove basic structural properties of these operators. Using these results, we prove that if P is the Riesz idempotent for isolated point ${\lambda}$ of the spectrum of $T{\in}{\mathcal{Q}}(A(k),m)$, then P is self-adjoint, and we give a necessary and sufficient condition for $T{\otimes}S$ to be in ${\mathcal{Q}}(A(k),m)$ when T and S are both non-zero operators. Moreover, we characterize the quasinilpotent part $H_0(T-{\lambda})$ of class A(k) operator.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.9A
• /
• pp.705-713
• /
• 2005

A novel decision criterion for weak M-ary signals is proposed in this paper. In the sense of minimizing the error probability, the proposed decision criterion is optimum when the signal strength approaches zero. In Part 1, the proposed detection criterion is proposed and investigated in detail, some interesting properties of the proposed decision criterion are described, and examples of decision regions are obtained. Based on the proposed detection criterion, a detection scheme for ultra wideband multiple access systems is investigated in the presence of impulsive interference in Part 2.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.3C
• /
• pp.250-257
• /
• 2006

In this paper, we propose an efficient algorithm for the RDO mode decision in H.264/AVC encoder. Based on the properties of DCT coefficients and the RDO mode decision processing, we derive a new condition for detecting an error block having all-zero DCT coefficient (AZCB). (I)DCT, (I)Q, and entropy coding are skipped for AZCBs in the proposed algorithm. It makes the reduction of the computational complexity for the RDO mode decision. Simulation results show that the proposed algorithm achieves computational saving over 40% compared to the conventional method.

• 한국초전도학회:학술대회논문집
• /
• v.9
• /
• pp.261-261
• /
• 1999

We observed leveling-off of the resistance in granular In/InO$_x$ thin films in the zero-temperature limit. The temperature T$_b$ at which the leveling-off appears gets larger as the sheet resistance R$_n$ increases. This is consistent with the concept that the leveling-off of the resistance is due to the dissipation of the bosonic phase and that the dissipation is enhanced as the resistance increases. The magnetic field dependence of the saturated resistance R$_b$ at low temperatures fits the modified square-root cusp-like form R$_b$/R$_n$=α exp[-b(B/B$_c$-1)$^{-1/2}$] for the magnetic field in the range B$_c$$_f$ where B$_c$ is the onset magnetic field of the resistance leveling-off. α and b are constants of order 1. For B>B$_f$ tansport properties are described by the theory of the fermi insulator. From the results, we attribute the leveling-off to the dissipative quantum tunneling of vortices, which supports the models predicting the vortex-motion-induced insulating phase related with the concept like"dirty boson" [1]l and "hose metal" [2].

• 한국초전도학회:학술대회논문집
• /
• v.9
• /
• pp.256-259
• /
• 1999

The effects of Pr doping on structural and superconducting properties of (Pb$_{0.5}$V$_{0.5}$)Sr$_2$(Ca$_{1-x}$Pr$_x$)Cu$_2$O$_z$ have been studied. We have observed systematic variation of lattice parameters with increasing Pr content. A maximum Tc of about40 K has been observed in this system. The correlation between the crystal structure and superconductivity has been addressed.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.173-179
• /
• 1999

In reverse engineering, when a shape containing multi-patched surfaces is digitized, the boundaries of these surfaces should be detected. The objective of this paper is to introduce a computationally efficient segmentation technique for extracting edges, ad partitioning the 3D measuring point data based on the location of the boundaries. The procedure begins with the identification of the edge points. An automatic edge-based approach is developed on the basis of local geometry. A parametric quadric surface approximation method is used to estimate the local surface curvature properties. the least-square approximation scheme minimizes the sum of the squares of the actual euclidean distance between the neighborhood data points and the parametric quadric surface. The surface curvatures and the principal directions are computed from the locally approximated surfaces. Edge points are identified as the curvature extremes, and zero-crossing, which are found from the estimated surface curvatures. After edge points are identified, edge-neighborhood chain-coding algorithm is used for forming boundary curves. The original point set is then broke down into subsets, which meet along the boundaries, by scan line algorithm. All point data are applied to each boundary loops to partition the points to different regions. Experimental results are presented to verify the developed method.