• International Journal of Internet, Broadcasting and Communication
• /
• 제15권3호
• /
• pp.94-102
• /
• 2023

Anomaly detection in human movements can improve safety in indoor workplaces. In this paper, we design a framework for detecting anomalous trajectories of humans in indoor spaces based on a variational autoencoder (VAE) with Bi-LSTM layers. First, the VAE is trained to capture the latent representation of normal trajectories. Then the abnormality of a new trajectory is checked using the trained VAE. In this step, the anomaly score of the trajectory is determined using the trajectory reconstruction error through the VAE. If the anomaly score exceeds a threshold, the trajectory is detected as an anomaly. To select the anomaly threshold, a new metric called D-score is proposed, which measures the difference between recall and precision. The anomaly threshold is selected according to the minimum value of the D-score on the validation set. The MIT Badge dataset, which is a real trajectory dataset of workers in indoor space, is used to evaluate the proposed framework. The experiment results show that our framework effectively identifies abnormal trajectories with 81.22% in terms of the F1-score.

• ETRI Journal
• /
• 제45권3호
• /
• pp.365-378
• /
• 2023

ARIA is a block cipher proposed by Kwon et al. at ICISC 2003 that is widely used as the national standard block cipher in the Republic of Korea. Herein, we identify some flaws in the quantum rebound attack on seven-round ARIA-DM proposed by Dou et al. and reveal that the limit of this attack is up to five rounds. Our revised attack applies to not only ARIA-DM but also ARIA-MMO and ARIA-MP among the PGV models, and it is valid for all ARIA key lengths. Furthermore, we present dedicated quantum rebound attacks on seven-round ARIA-Hirose and ARIA-MJH for the first time. These attacks are only valid for the 256-bit key length of ARIA because they are constructed using the degrees of freedom in the key schedule. All our attacks are faster than the generic quantum attack in the cost metric of the time-space tradeoff.

• 대한수학회보
• /
• 제59권2호
• /
• pp.319-343
• /
• 2022

We discuss the notions of positive expansivity, chain transitivity, uniform rigidity, chain mixing, weak specification, and pseudo orbital specification in terms of finite open covers for Hausdorff topological spaces and entourages for uniform spaces. We show that the two definitions for each notion are equivalent in compact Hausdorff spaces and further they are equivalent to their standard definitions in compact metric spaces. We show that a homeomorphism on a Hausdorff uniform space has uniform h-shadowing if and only if it has uniform shadowing and its inverse is uniformly equicontinuous. We also show that a Hausdorff positively expansive system with a Hausdorff shadowing property has Hausdorff h-shadowing.

• 대한수학회보
• /
• 제59권2호
• /
• pp.481-506
• /
• 2022

This paper is concerned with the study of various notions of shadowing of dynamical systems induced by a sequence of maps, so-called time varying maps, on a metric space. We define and study the shadowing, h-shadowing, limit shadowing, s-limit shadowing and exponential limit shadowing properties of these dynamical systems. We show that h-shadowing, limit shadowing and s-limit shadowing properties are conjugacy invariant. Also, we investigate the relationships between these notions of shadowing for time varying maps and examine the role that expansivity plays in shadowing properties of such dynamical systems. Specially, we prove some results linking s-limit shadowing property to limit shadowing property, and h-shadowing property to s-limit shadowing and limit shadowing properties. Moreover, under the assumption of expansivity, we show that the shadowing property implies the h-shadowing, s-limit shadowing and limit shadowing properties. Finally, it is proved that the uniformly contracting and uniformly expanding time varying maps exhibit the shadowing, limit shadowing, s-limit shadowing and exponential limit shadowing properties.

• Journal of applied mathematics & informatics
• /
• 제41권6호
• /
• pp.1341-1364
• /
• 2023

This article introduces a method for estimating the conditional hazard function of a real-valued response variable based on a functional variable. The method uses local linear estimation of the conditional density and cumulative distribution function and is applied to a functional stationary ergodic process where the explanatory variable is in a semi-metric space and the response is a scalar value. We also examine the uniform almost complete convergence of this estimation technique.

• Nonlinear Functional Analysis and Applications
• /
• 제29권1호
• /
• pp.209-224
• /
• 2024

The goal of this study is to instigate various new and novel optimum proximity point theorems using the notion of implicit relation type ℶ-proximal contraction for non-self mappings. An illustrated example is used to demonstrate the validity of the obtained results. Furthermore, some uniqueness results for proximal contractions are also furnished with partial order and graph. Various well-known discoveries in the present state-of-the-art are enhanced, extended, unified, and generalized by our findings. As an application, we generate some fixed point results fulfilling a modified contraction and a graph contraction, using the profundity of the established results.

• 한국HCI학회:학술대회논문집
• /
• 한국HCI학회 2006년도 학술대회 1부
• /
• pp.355-361
• /
• 2006

In large scale environments like airport, museum, large warehouse and department store, autonomous mobile robots will play an important role in security and surveillance tasks. Robotic security guards will give the surveyed information of large scale environments and communicate with human operator with that kind of data such as if there is an object or not and a window is open. Both for visualization of information and as human machine interface for remote control, a 3D model can give much more useful information than the typical 2D maps used in many robotic applications today. It is easier to understandable and makes user feel like being in a location of robot so that user could interact with robot more naturally in a remote circumstance and see structures such as windows and doors that cannot be seen in a 2D model. In this paper we present our simple and easy to use method to obtain a 3D textured model. For expression of reality, we need to integrate the 3D models and real scenes. Most of other cases of 3D modeling method consist of two data acquisition devices. One for getting a 3D model and another for obtaining realistic textures. In this case, the former device would be 2D laser range-finder and the latter device would be common camera. Our algorithm consists of building a measurement-based 2D metric map which is acquired by laser range-finder, texture acquisition/stitching and texture-mapping to corresponding 3D model. The algorithm is implemented with laser sensor for obtaining 2D/3D metric map and two cameras for gathering texture. Our geometric 3D model consists of planes that model the floor and walls. The geometry of the planes is extracted from the 2D metric map data. Textures for the floor and walls are generated from the images captured by two 1394 cameras which have wide Field of View angle. Image stitching and image cutting process is used to generate textured images for corresponding with a 3D model. The algorithm is applied to 2 cases which are corridor and space that has the four wall like room of building. The generated 3D map model of indoor environment is shown with VRML format and can be viewed in a web browser with a VRML plug-in. The proposed algorithm can be applied to 3D model-based remote surveillance system through WWW.

• 대한전자공학회논문지SP
• /
• 제42권4호
• /
• pp.49-59
• /
• 2005

본 논문에서는 측색적인 오차와 낟알 무의 현상을 동시에 감소시키기 위해 추가적인 잉크와 정량적인 낟알 무의 측정자를 이용한 6색 분리 방법을 제안한다. 기존의 6색 분리 방법에서는 3색이나 4색 프린터에서 나타나는 도트의 가시성을 줄이기 위해 밝은 영역에서 사용되는 묽은 잉크(light magenta와 light cyan)를 진한 잉크(magenta와 cym)로 대체한다. 그러나 묽은 잉크와 진한 잉크의 색상의 차이로 인해서 밝은 영역에서 정확한 측색적인 색 재현이 어렵게 되었다. 이러한 측색적인 오차를 줄이기 위해 추가적인 잉크(additional colorants)인 yellow와 light magenta 잉크를 밝은 영역에서 사용한다. 따라서 밝은 영역에서 magenta 잉크는 light magenta와 yellow로 대체되고 cyan은 light cyan과 light magenta로 대체된다. 이러한 추가적인 잉크의 사용은 진한 잉크의 색상과 유사한 색을 만들 수 있기 때문에 측색적인 오차를 줄일 수 있게 된다. 또한 추가적인 잉크는 작은 도트의 가시성을 갖고 있기 때문에 부드러운 영상도 재현될 수 있다. 한편 중간 영역에서도 부드러운 영상을 획득하기 위해 magenta는 light magenta와 magenta로 대체되고 cyan은 light cyan과 cyan으로 대체된다 그러나 농도가 다른 두 잉크의 사용은 거친 도트 패턴을 생성하게 된다. 이러한 현상을 반영하기 위해 정량적인 낟알 무의 측정자가 사용된다. 어두운 영역에서는 묽은 잉크를 사용해도 더 이상 낟알 무늬가 감소되지 않기 때문에 magenta와 cyan 잉크만 사용한다.

• Journal of Computing Science and Engineering
• /
• 제1권2호
• /
• pp.177-194
• /
• 2007

Index selection is one of the most important decisions to take in the physical design of relational data warehouses. Indices reduce significantly the cost of processing complex OLAP queries, but require storage cost and induce maintenance overhead. Two main types of indices are available: mono-attribute indices (e.g., B-tree, bitmap, hash, etc.) and multi-attribute indices (join indices, bitmap join indices). To optimize star join queries characterized by joins between a large fact table and multiple dimension tables and selections on dimension tables, bitmap join indices are well adapted. They require less storage cost due to their binary representation. However, selecting these indices is a difficult task due to the exponential number of candidate attributes to be indexed. Most of approaches for index selection follow two main steps: (1) pruning the search space (i.e., reducing the number of candidate attributes) and (2) selecting indices using the pruned search space. In this paper, we first propose a data mining driven approach to prune the search space of bitmap join index selection problem. As opposed to an existing our technique that only uses frequency of attributes in queries as a pruning metric, our technique uses not only frequencies, but also other parameters such as the size of dimension tables involved in the indexing process, size of each dimension tuple, and page size on disk. We then define a greedy algorithm to select bitmap join indices that minimize processing cost and verify storage constraint. Finally, in order to evaluate the efficiency of our approach, we compare it with some existing techniques.

• 한국통신학회논문지
• /
• 제27권1A호
• /
• pp.26-34
• /
• 2002

IS-95 또는 IMT-2000 등의 이동통신 시스템에서는 10~20msec 길이의 프레임 단위로 정보를 교환하게 되므로 수신측에서는 이와 같은 크기의 프레임을 저장할 버퍼가 필요하다. 연성판정 비터비 복호기를 사용할 때, 이를 위한 버퍼의 크기, 즉 한 프레임에 들어 있는 비트 수는 길쌈부호의 부호율(1 대 n), 전송속도(bps), 그리고 연성판정 비트 수에 비례하여 증가한다. 본 논문에서는 연성판정 비트 수를 4 비트에서 3 비트로 낮추면서 비터비 복호기의 성능 저하를 줄이기 위한 양자화 방법을 제안한다. 연성판정 비트 수(4,3,2,1)별로 양자화 판정 기준 점의 오프셋 크기와 양자화 간격에 대해 비터비 복호기의 성능을 AWGN 환경에서 시뮬레이션 하였고, 이를 토대로 최적의 BER 성능을 갖는 오프셋 크기와 양자화 간격을 결정하였다. 그 결과로서 4 비트 연성판정의 성능에 근접하는 3비트 연성판정 양자화 방법을 도출하였고, IS-95(4 비트)의 최대 40배의 전송속도를 지원하는 IMT-2000 시스템에 적용하였을 대 미미한 성능 손실(-0.05 dB)을 유지하면서 입력 버퍼의 크기를 3/4 배로 줄일 수 있음을 보였다. 또한, 다양한 전송속도에 따라 반복된 누산 입력신호를 제안된 비트 수로 변환하기 위한 최적 SMT(symbol metric table)를 고안하였다.