• 한국컴퓨터정보학회논문지
• /
• 제14권11호
• /
• pp.31-40
• /
• 2009

가장 많이 활용하는 청소로봇의 청소기법은 크게 랜덤기법과 바둑판식기법으로 나눌 수 있다. 랜덤기법을 이용한 청소로봇은 장애물을 만날 때까지 직진 방향으로 청소를 수행하며, 장애물을 만나면 일정한 각도로 회전한 후 다시 직진 방향으로 청소를 수행한다. 랜덤기법은 중복적인 청소를 수행하는 문제가 빈번히 발생하며, 청소를 완료하는 데 오래 시간이 소요되는 단점이 있다. 바둑판식기법을 이용한 청소로봇은 장애물을 만날 때까지 직진 방향으로 청소를 수행하며, 장애물을 만나면 직진과 회전을 이용하여 청소가 수행되지 않은 위치로 이동하고, 이전에 청소를 수행한 방향의 반대로 청소를 수행한다. 바둑판식기법은 청소공간을 조밀하게 청소하며 진행하기 때문에 장애물이 없거나 작은 공간에서 작업 성능이 뛰어나다. 그러나 바둑판식기법으로 장애물이 있거나 복잡한 공간을 청소할 때는 청소시간이 증가한다. 그러므로 청소의 효율성을 증가시키기 위해서는 작업공간을 정확히 파악하여 청소를 계획적으로 진행해야 한다. 본 논문에서 제안한 가상지도 기반 청소로봇은 작업공간을 효율적으로 청소하는 특성을 갖는다. 시뮬레이션을 통해 제안한 기법의 효율성을 측정하였다.

• 대한수학회보
• /
• 제60권4호
• /
• pp.1131-1139
• /
• 2023

In this paper, we introduce the concept of ω-expansive of random map on compact metric spaces 𝓟. Also we introduce the definitions of positively, negatively shadowing property and shadowing property for two-sided RDS. Then we show that if 𝜑 is ω-expansive and has the shadowing property for ω, then 𝜑 is topologically stable for ω.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권12호
• /
• pp.6161-6176
• /
• 2018

Pseudorandom numbers are useful in cryptographic operations for using as nonce, initial vector, secret key, etc. Security of the cryptosystem relies on the secret key parameters, so a good pseudorandom number is needed. In this paper, we have proposed a new approach for generation of pseudorandom number. This method uses the three dimensional combinational puzzle Rubik Cube for generation of random numbers. The number of possible combinations of the cube approximates to 43 quintillion. The large possible combination of the cube increases the complexity of brute force attack on the generator. The generator uses cryptographic hash function. Chaotic map is being employed for increasing random behavior. The pseudorandom sequence generated can be used for cryptographic applications. The generated sequences are tested for randomness using NIST Statistical Test Suite and other testing methods. The result of the tests and analysis proves that the generated sequences are random.

• 한국연소학회:학술대회논문집
• /
• 한국연소학회 2004년도 제28회 KOSCO SYMPOSIUM 논문집
• /
• pp.133-137
• /
• 2004

The present study is focused on the small scale turbulent mixing processes in the scalar field. In order to deal with molecular mixing in turbulent flow, the linear eddy model is addressed. In each realization, the molecular mixing term is implemented deterministically, and turbulent stirring is represented by a sequence of instantaneous, statistically independent rearrangement event called by triplet map. The LEM approach is applied with relatively simple conditions. The characteristics of scalar mixing and PDF profiles are addressed in detail.

• 대한의용생체공학회:의공학회지
• /
• 제8권2호
• /
• pp.205-214
• /
• 1987

In this paper, a mathmatical model for the purpose of QRS detection is considered in the case of the occurence of nonoverlappjng pulse-shaped waveforms corrupted with white noise. The number of waveform, the arrival times, amplitudes, and widths of QRS complexes are regarded as random variables. The joint MAP estimation of all the unknown Quantities consists of linear filtering followed by an optimization procedure. Because the optimization procedure is time-consuming, this procedure is modified so that a threshold test is obtained.

• 한국자원식물학회지
• /
• 제10권3호
• /
• pp.241-246
• /
• 1997

Linkage maps based on molecular markers are valuable tools in plant breeding and genetic studies. A population of 76 RI lines from the mating of A3733 and PI437.088 was evaluated with Random Amplified Polymorphic DNA(RAPD) and Simple Sequence Repeats (SSR) markers to create soybean molecular linkage map, 302 RAPD and 21 SSR markers were genetically linked and formed forty linkage groups. These linkage groups spanned a genetic distance of 1,775 cM. The average distance between markers was 5.5 cM.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2008년도 정보통신설비 학술대회
• /
• pp.563-565
• /
• 2008

In this paper, we construct an efficient fuzzy identity-based encryption scheme in the random oracle model. The fuzzy identity-based encryption is an extension of identity-based encryption schemes where a user's public key is represented as his identity. Our construction requires constant number of bilinear map operations for decryption and the size of private key is small compared with the previous fuzzy identity-based encryption of Sahai-Waters. We also presents that our fuzzy identity-based encryption can be converted to attribute-based encryption schemes.

• 대한전자공학회논문지
• /
• 제26권8호
• /
• pp.1238-1246
• /
• 1989

In this paper, a texture synthesis technique based on the NCAR(non-causal auto-regressive) model and the pyramid structure is proposed. In order to estimate the NCAR model parameters accurately from a noisy texture, the MAP(maximum a posteriori) estimation technique is also employed. In our approach, since the input texture is decomposed into the Laplacian oyramid planes first and then the NCAR model is applied to each plane, we are able to obtain a good synthesized texture even if the texture exhibits some non-random local structure or non-homogenity. The usrfulness of the proposed method is demonstrated with seveal real textures in the Brodatz album. Finally, the 2-dimensional MAP estimation technique can be used to the image restoration for noisy images as well as a texture image synthesis.

• 대한수학회논문집
• /
• 제34권3호
• /
• pp.967-979
• /
• 2019

Chaotic dynamical systems, preferably on a Cantor-like space with some arithmetic operations are considered as good pseudo-random number generators. There are many definitions of chaos, of which Devaney-chaos and pos itive topological entropy seem to be the strongest. Let $A=\{0,1,{\dots},p-1\}$. We define a continuous map on $A^{\mathbb{Z}}$ using addition with a carry, in combination with the shift map. We show that this map gives rise to a dynamical system with positive entropy, which is also Devaney-chaotic: i.e., it is transitive, sensitive and has a dense set of periodic points.

• 한국컴퓨터정보학회:학술대회논문집
• /
• 한국컴퓨터정보학회 2021년도 제64차 하계학술대회논문집 29권2호
• /
• pp.75-77
• /
• 2021

전력 생산의 효율을 높이고 지속적인 공정관리를 위해 전력 설비 데이터의 패턴을 분석하고 원인이 되는 주요 변수를 찾는 것이 중요하다. 따라서, 본 연구에서는 전력 설비 데이터의 패턴을 분석하기 위해 데이터를 군집화하고 연구 방법으로 Decision Tree, Random Forest와 ResNet을 이용하여 패턴을 분류하였다. Class Activation Map을 이용하여 설비데이터의 원인이 되는 주요 변수를 확인하였다. 본 연구를 통해 전력 설비 데이터의 분류 및 원인 분석이 가능한 통합적 솔루션을 제시하고자 한다.