• 제목/요약/키워드: a-invariant

검색결과 1,827건 처리시간 0.031초

SOME RESULTS ON INVARINAT SUBMANIFOLDS OF LORENTZIAN PARA-KENMOTSU MANIFOLDS

  • Atceken, Mehmet
    • Korean Journal of Mathematics
    • /
    • 제30권1호
    • /
    • pp.175-185
    • /
    • 2022
  • The purpose of this paper is to study invariant submanifolds of a Lorentzian para Kenmotsu manifold. We obtain the necessary and sufficient conditions for an invariant submanifold of a Lorentzian para Kenmotsu manifold to be totally geodesic. Finally, a non-trivial example is built in order to verify our main results.

A Genetic Algorithm Based Source Encoding Scheme for Distinguishing Incoming Signals in Large-scale Space-invariant Optical Networks

  • Hongki Sung;Yoonkeon Moon;Lee, Hagyu
    • Journal of Electrical Engineering and information Science
    • /
    • 제3권2호
    • /
    • pp.151-157
    • /
    • 1998
  • Free-space optical interconnection networks can be classified into two types, space variant and space invariant, according to the degree of space variance. In terms of physical implementations, the degree of space variance can be interpreted as the degree of sharing beam steering optics among the nodes of a given network. This implies that all nodes in a totally space-invariant network can share a single beam steering optics to realize the given network topology, whereas, in a totally space variant network, each node requires a distinct beam steering optics. However, space invariant networks require mechanisms for distinguishing the origins of incoming signals detected at the node since several signals may arrive at the same time if the node degree of the network is greater than one. This paper presents a signal source encoding scheme for distinguishing incoming signals efficiently, in terms of the number of detectors at each node or the number of unique wavelengths. The proposed scheme is solved by developing a new parallel genetic algorithm called distributed asynchronous genetic algorithm (DAGA). Using the DAGA, we solved signal distinction schemes for various network sizes of several topologies such as hypercube, the mesh, and the de Brujin.

  • PDF

Time-Invariant Stock Movement Prediction After Golden Cross Using LSTM

  • Sumin Nam;Jieun Kim;ZoonKy Lee
    • 한국컴퓨터정보학회논문지
    • /
    • 제28권8호
    • /
    • pp.59-66
    • /
    • 2023
  • 골든크로스를 흔히 매수의 신호로 인식하지만, 주식시장은 변동성이 매우 크기에 골든크로스만으로 주식의 등락 여부를 예상하고 의사결정을 내리기에는 무리가 있다. 마찬가지로, 이러한 주가 데이터의 불확실성은 기존의 시계열 기반의 예측을 더욱 어렵게 한다. 본 논문에서는 골든크로스를 하나의 사건으로 인식하여, time-invariant 한 접근을 시도하고자 한다. LSTM 신경망 기법을 사용하여 골든크로스 이후의 주가 변화율을 예측하고, 기존의 시계열 분석에서 도출한 성능과 종목별로 비교한다. 또한, 0을 기준으로 한 주가 변화율의 등락을 혼동행렬로 분류하여 일반화 분류 성능을 입증한다. 최종적으로 본 논문은 예측 정밀도가 83%인 모델을 제안하였다. 골든크로스가 나타날 때 모든 상황에서 매수를 결정하기보다 모델을 활용하여 투자자의 투자 자본 손실을 방지할 수 있다.

스케일 불변적인 연산량 감소를 위한 경량 실시간 소형 적외선 표적 검출 알고리즘 (A Lightweight Real-Time Small IR Target Detection Algorithm to Reduce Scale-Invariant Computational Overhead)

  • 반종희;유준혁
    • 대한임베디드공학회논문지
    • /
    • 제12권4호
    • /
    • pp.231-238
    • /
    • 2017
  • Detecting small infrared targets from the low-SCR images at a long distance is very hard. The previous Local Contrast Method (LCM) algorithm based on the human visual system shows a superior performance of detecting small targets by a background suppression technique through local contrast measure. However, its slow processing speed due to the heavy multi-scale processing overhead is not suitable to a variety of real-time applications. This paper presents a lightweight real-time small target detection algorithm, called by the Improved Selective Local Contrast Method (ISLCM), to reduce the scale-invariant computational overhead. The proposed ISLCM applies the improved local contrast measure to the predicted selective region so that it may have a comparable detection performance as the previous LCM while guaranteeing low scale-invariant computational load by exploiting both adaptive scale estimation and small target feature feasibility. Experimental results show that the proposed algorithm can reduce its computational overhead considerably while maintaining its detection performance compared with the previous LCM.

Iris Recognition Based on a Shift-Invariant Wavelet Transform

  • Cho, Seongwon;Kim, Jaemin
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제4권3호
    • /
    • pp.322-326
    • /
    • 2004
  • This paper describes a new iris recognition method based on a shift-invariant wavelet sub-images. For the feature representation, we first preprocess an iris image for the compensation of the variation of the iris and for the easy implementation of the wavelet transform. Then, we decompose the preprocessed iris image into multiple subband images using a shift-invariant wavelet transform. For feature representation, we select a set of subband images, which have rich information for the classification of various iris patterns and robust to noises. In order to reduce the size of the feature vector, we quantize. each pixel of subband images using the Lloyd-Max quantization method Each feature element is represented by one of quantization levels, and a set of these feature element is the feature vector. When the quantization is very coarse, the quantized level does not have much information about the image pixel value. Therefore, we define a new similarity measure based on mutual information between two features. With this similarity measure, the size of the feature vector can be reduced without much degradation of performance. Experimentally, we show that the proposed method produced superb performance in iris recognition.

시계열 데이터 기반의 대칭-불변 윤곽선 이미지 매칭 (Symmetric-Invariant Boundary Image Matching Based on Time-Series Data)

  • 이상훈;방준상;문성우;문양세
    • 정보처리학회논문지:소프트웨어 및 데이터공학
    • /
    • 제4권10호
    • /
    • pp.431-438
    • /
    • 2015
  • 본 논문에서는 대칭 변환을 지원하는 윤곽선 이미지 매칭 문제를 다룬다. 이미지 매칭에서 이미지의 대칭 변환을 지원하는 것은 직관적이고 정확한 매칭을 위한 매우 중요한 요소이다. 그러나 기존 이미지 매칭에서는 이미지의 회전 변환만 고려하였을 뿐 대칭 변환은 고려하지 않았다. 본 논문에서는 기존 회전-불변 윤곽선 이미지 매칭에 대칭 변환까지 지원하는 대칭-불변 윤곽선 이미지 매칭을 제안한다. 이를 위해, 먼저 이미지 대칭의 개념을 정의하고, 어떠한 대칭각을 사용하더라도 회전-불변 매칭의 결과는 동일함을 정형적으로 증명한다. 또한, 대칭 변환을 위해 이미지 윤곽선으로부터 대칭 시계열을 효율적으로 추출하는 방법을 제안한다. 그런 다음, 이미지를 대칭하여 생성한 대칭 시계열과 원본 이미지 시계열을 직접 대칭하여 생성한 대칭 시계열을 사용한 회전-불변 매칭 결과가 동일함을 정형적으로 증명한다. 실험 결과, 제안하는 대칭-불변 윤곽선 이미지 매칭은 회전 변환만을 지원하는 기존 이미지 매칭에 비해 보다 정확하고 직관적인 결과를 도출하는 것으로 나타났다. 이같은 결과는 대칭-불변 윤곽선 이미지 매칭이 이미지의 대칭 변환 문제를 시계열 도메인에서 해결한 우수한 해결책임을 의미한다.

The Centering of the Invariant Feature for the Unfocused Input Character using a Spherical Domain System

  • Seo, Choon-Weon
    • 조명전기설비학회논문지
    • /
    • 제29권9호
    • /
    • pp.14-22
    • /
    • 2015
  • TIn this paper, a centering method for an unfocused input character using the spherical domain system and the centering character to use the shift invariant feature for the recognition system is proposed. A system for recognition is implemented using the centroid method with coordinate average values, and the results of an above 78.14% average differential ratio for the character features were obtained. It is possible to extract the shift invariant feature using spherical transformation similar to the human eyeball. The proposed method, which is feature extraction using spherical coordinate transform and transformed extracted data, makes it possible to move the character to the center position of the input plane. Both digital and optical technologies are mixed using a spherical coordinate similar to the 3 dimensional human eyeball for the 2 dimensional plane format. In this paper, a centering character feature using the spherical domain is proposed for character recognition, and possibilities for the recognized possible character shape as well as calculating the differential ratio of the centered character using a centroid method are suggested.

ON THE CLASS OF κTH ROOTS OF PARANORMAL OPERATORS

  • YANG, YOUNG OH
    • 호남수학학술지
    • /
    • 제26권2호
    • /
    • pp.137-145
    • /
    • 2004
  • we shall study some properties of a new class ($\sqrt[\kappa]{P}$) (defined below). Also we show that T may not be normaloid when $T{\in}(\sqrt[\kappa]{P})$, and that the class ($\sqrt{H}$) may not have the translation-invariant propety.

  • PDF

Estimates of invariant metrics on some pseudoconvex domains in $C^N$

  • Cho, Sang-Hyun
    • 대한수학회지
    • /
    • 제32권4호
    • /
    • pp.661-678
    • /
    • 1995
  • In this paper we will estimate from above and below the values of the Bergman, Caratheodory and Kobayashi metrics for a vector X at z, where z is any point near a given point $z_0$ in the boundary of pseudoconvex domains in $C^n$.

  • PDF

LINEARLY INVARIANT FUNCTIONS

  • Song, Tai-Sung
    • 대한수학회논문집
    • /
    • 제10권4호
    • /
    • pp.867-874
    • /
    • 1995
  • Linear invariance is closely related to the concept of uniform local univalence. We give a geometric proof that a holomorphic locally univalent function defined on the open unit disk is linearly invariant if and only if it is uniformly locally univalent.

  • PDF