• 대한수학회보
• /
• 제49권4호
• /
• pp.685-692
• /
• 2012

Consider a hypersurface $M^n$ in $\mathbb{R}^{n+1}$ with $n$ distinct principal curvatures, parametrized by lines of curvature with vanishing Laplace invariants. (1) If the lines of curvature are planar, then there are no such hypersurfaces for $n{\geq}4$, and for $n=3$, they are, up to M$\ddot{o}$bius transformations Dupin hypersurfaces with constant M$\ddot{o}$bius curvature. (2) If the principal curvatures are given by a sum of functions of separated variables, there are no such hypersurfaces for $n{\geq}4$, and for $n=3$, they are, up to M$\ddot{o}$bius transformations, Dupin hypersurfaces with constant M$\ddot{o}$bius curvature.

• Korean Journal of Mathematics
• /
• 제28권2호
• /
• pp.205-221
• /
• 2020

Paranormed spaces are important as a generalization of the normed spaces in terms of having more general properties. The aim of this study is to introduce a new paranormed space |𝜙_z|(p) over the paranormed space ℓ(p) using Euler totient means, where p = (p_k) is a bounded sequence of positive real numbers. Besides this, we investigate topological properties and compute the α-, β-, and γ duals of this paranormed space. Finally, we characterize the classes of infinite matrices (|𝜙_z|(p), λ) and (λ, |𝜙_z|(p)), where λ is any given sequence space.

• 대한수학회보
• /
• 제49권5호
• /
• pp.1015-1025
• /
• 2012

Let $[n]=\{1,2,{\cdots},n\}$, and let $PO_n$ be the partial order-preserving transformation semigroup on [n]. Let $$CPO_n=\{{\alpha}{\in}PO_n:({\forall}x,y{\in}dom{\alpha}),\;|x{\alpha}-y{\alpha}|{\leq}|x-y|\}$$ Then $CPO_n$ is a subsemigroup of $PO_n$. In this paper, we characterize Green's relations and the regularity of elements for $CPO_n$.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1988년도 추계학술대회 논문집 학회본부
• /
• pp.115-117
• /
• 1988

The algorithm presented here achieves mathematically better decoupling of the MW-$\theta$ and MVARE Calculations by applying linear transformations to load flow equation on paired initial power. The linear transformations to decouple Jacobian matrix prove to be highly profitable considering both Convergence characteristics and computation time per iteration to those required by the FDLF, because the decoupling does not rely on the assumption that the transmission lines have high X/R ratios.

• Kyungpook Mathematical Journal
• /
• 제55권4호
• /
• pp.909-931
• /
• 2015

This paper presents some new paranormed sequence spaces $X(r,s,t,p;{\Delta})$ where $X{\in}\{l_{\infty}(p),c(p),c_0(p),l(p)\}$ defined by using generalized means and difference operator. It is shown that these are complete linear metric spaces under suitable paranorms. Furthermore, the ${\alpha}$-, ${\beta}$-, ${\gamma}$-duals of these sequence spaces are computed and also obtained necessary and sufficient conditions for some matrix transformations from $X(r,s,t,p;{\Delta})$ to X. Finally, it is proved that the sequence space $l(r,s,t,p;{\Delta})$ is rotund when $p_n$ > 1 for all n and has the Kadec-Klee property.

• 충청수학회지
• /
• 제22권4호
• /
• pp.789-797
• /
• 2009

Invertible transformations over n-bit words are essential ingredients in many cryptographic constructions. When n is large (e.g., n = 64) such invertible transformations are usually represented as a composition of simpler operations such as linear functions, S-P networks, Feistel structures and T-functions. Among them we will study T-functions which are probably invertible transformation and are very useful in stream ciphers. In this paper we will show that $f(x)=x+(g(x)^2{\vee}C)$ mod $2^n$ is a permutation with a single cycle of length $2^n$ if both the least significant bit and the third significant bit in the constant C are 1, where g(x) is a T-function.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 신호처리소사이어티 추계학술대회 논문집
• /
• pp.501-504
• /
• 2003

This paper presents a new fractal coding scheme to find more optimal transformation by estimation of the optimal attractor. The conventional fractal coding schemes based on the collage theorem obtain the transformation to minimize the distance between an original image and its collage image. Heavy computation is why the schemes widely adopt the theorem. In other words, the optimal transformation can be obtained after the attractors of all the possible transformations are generated and then compared with an original image. It is clear that this process is not practical. Therefore, we introduce a sub-optimal scheme that provides better transformation than the conventional scheme, relieving the complexity problem in the optimal transformation. In a simple case, the optimal transformation can be obtained considering all the attractors and then our scheme is compared with the optimal. In general cases not to be able to find the optimal, our scheme is also evaluated and compared with the conventional schemes.

• 한국비블리아학회지
• /
• 제13권2호
• /
• pp.183-195
• /
• 2002

본 논문에서는 한국비블리아학회 2002년 추계학술발표회 때 발표된 논문과 최근에 공공도서관에 관련된 선행연구를 중심으로 우리나라와 미국 공공도서관의 변화와 관련 이슈에 대하여 살펴본 후 지식기반사회에서의 공공도서관의 역할을 재조명함으로써 우리나라공공도서관의 발전에 일조를 하고자 한다. 인터넷의 등장과 기술의 영향으로 공공도서관의 사명과 사서의 역할은 변화하였으며 또한 공공도서관의 다양한 분야에서도 변화를 맞고 있다. 이러한 변화는 인터넷의 새로운 기술과 함께 사회적 변화와 맞물러 계속 진행될 것이다.

• Advances in nano research
• /
• 제1권1호
• /
• pp.35-42
• /
• 2013

Cockroach (Periplaneta americana) broth has been employed to assess its potential as a candidate source animal tissue for the synthesis of gold nanoparticles. The synthesis is performed akin to room temperature in the laboratory ambience. X-ray and transmission electron microscopy analyses are performed to ascertain the formation of nanoparticles. The synthesis of nanoparticles might have resulted due to the activity of chitin, metallothioneine and tropomyosin. A possible involved mechanism for the biosynthesis of nanoparticles has also been proposed. This work further indicates that the animal wastes too can effectively participate in nano-transformations thereby helping in controlling the environmental pollution and subsequently the different diseases.

• 한국ITS학회 논문지
• /
• 제8권1호
• /
• pp.127-135
• /
• 2009

This paper presents a new technique for corner shape based object retrieval from a database. The proposed feature matrix consists of values obtained through a neighborhood operation of detected corners. This results in a significant small size feature matrix compared to the algorithms using color features and thus is computationally very efficient. The corners have been extracted by finding the intersections of the detected lines found using Hough transform. As the affine transformations preserve the co-linearity of points on a line and their intersection properties, the resulting corner features for image retrieval are robust to affine transformations. Furthermore, the corner features are invariant to noise. It is considered that the proposed algorithm will produce good results in combination with other algorithms in a way of incremental verification for similarity.