• 한국정보과학회논문지:소프트웨어및응용
• /
• 제28권10호
• /
• pp.785-794
• /
• 2001

Java 에서 원시 타입과 클래스 타입간에 호환성이 제공되지 않으므로 원시값이 클래스 타입의 변수에 저장되지 못하며, 클래스 타입의 값이 원시 타입 변수에 저장되지 못한다. 객체가 필요한 곳에서 원시값을 사용하기 위해서는 원시 값을 저장하는 래퍼 클래스의 객체 생성이 필요하며, 패러 클래스의 객체에서 저장된 원시 값을 꺼내기 위해서는 특정 메소드를 호출하여야 한다.이러한 불편함과 변환시의 오류를 줄이기 위하여 본 논문에서는 Java의 원시타입과 래퍼 클래스 타입의 호환성 제공을 위한 변환방법을 제안하였다. 원시 타입과 래퍼 클래스 타입간의 호환성 뿐 아니라 원시 타입간의 호환성에 상응하는 래퍼 클래스간의 호환성도 제공하기 위해 래퍼 클래스 계층방법, java.lang.Number 클래스 이용방법, 래퍼 인터페이스 계층방법 등 3가지 변환방법을 제시하였다. 이들 방법의 비교분석과 성능측정을 통하여 래퍼 인터페이스 계층방법이 가장 우수한 방법임을 확인하였다.

• 한국멀티미디어학회논문지
• /
• 제19권5호
• /
• pp.818-825
• /
• 2016

The existing R-peak detection research suggests improving the distortion of the signal such as baseline variations in ECG signals by using preprocessing techniques such as a bandpass filtering. However, preprocessing can introduce another distortion, as it can generate a false detection in the R-wave detection. In this paper, we propose an R-peak detection algorithm in ECG signal, based on primitive signal in order to detect reliably an R-peak in baseline variation. First, the proposed algorithm decides the primitive signal to represent the QRS complex in ECG signal, and by scaling the time axis and voltage axis, extracts multiple primitive signals. Second, the algorithm detects the candidates of the R-peak using the value of the voltage. Third, the algorithm measures the similarity between multiple primitive signals and the R-peak candidates. Finally, the algorithm detects the R-peak using the mean and the standard deviation of similarity. Throughout the experiment, we confirmed that the algorithm detected reliably a QRS group similar to multiple primitive signals. Specifically, the algorithm can achieve an R-peak detection rate greater than an average rate of 99.9%, based on eight records of MIT-BIH ADB used in this experiment.

• Korean Journal of Mathematics
• /
• 제22권3호
• /
• pp.491-500
• /
• 2014

The base of a signed digraph S is the minimum number k such that for any vertices u, v of S, there is a pair of walks of length k from u to v with different signs. Let K be a signed complete graph of order n, which is a signed digraph obtained by assigning +1 or -1 to each arc of the n-th order complete graph $K_n$ considered as a digraph. In this paper we show that for $n{\geq}3$ the base of a primitive non-powerful signed complete graph K of order n is 2, 3 or 4.

• International Journal of Costume and Fashion
• /
• 제10권1호
• /
• pp.29-45
• /
• 2010

In order to provide more systematic approach to analyze fabric trends and to develop fabrics accordingly, ecology fabric trend from 1986 to 2005 was analyzed related with fabric trend themes and fabric attributes. The result shows that in the 1980s, natural theme appeared, followed by primitive theme and imitated natural theme until the mid 1990s. From the late 1990s to the early 2000s, new natural theme appeared, followed by eco-friendly theme, and then recycling theme. In the natural theme, 'clean' was the most important fabric attribute and 'textured' and 'worn' were important fabric attributes in the primitive theme. In the imitated natural theme, 'wet' fabric attribute was preferred. In the new natural theme, 'lightweight' were preferred. The results of this study empirically demonstrated that abstract and ambiguous trend terms can be interpreted with a physical, substantial, and feasible attributes that fabric practitioners can easily understand.

• Journal of applied mathematics & informatics
• /
• 제8권3호
• /
• pp.773-793
• /
• 2001

The explicit expressions for the 2n+1 primitive idempotents in R/sub pⁿ/ = F[x]/< x/sup pⁿ/ -1>, where F is the field of prime power order q and the multiplicative order of q modulo pⁿ is ø(pⁿ)/2(n≥1 and p is an odd prime), are obtained. An algorithm for computing the generating polynomials of the minimal QR cyclic codes of length pⁿ, generated by these primitive idempotents, is given and hence some bounds on the minimum distance of some QR codes of prime length over GF(q)(q=2, 3, ...) are obtained.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권1호
• /
• pp.169-189
• /
• 2015

Detection of anomalous events from video streams is a challenging problem in many video surveillance applications. One such application that has received significant attention from the computer vision community is traffic video surveillance. In this paper, a Lossy Count based Sequential Temporal Pattern mining approach (LC-STP) is proposed for detecting spatio-temporal abnormal events (such as a traffic violation at junction) from sequences of video streams. The proposed approach relies mainly on spatial abstractions of each object, mining frequent temporal patterns in a sequence of video frames to form a regular temporal pattern. In order to detect each object in every frame, the input video is first pre-processed by applying Gaussian Mixture Models. After the detection of foreground objects, the tracking is carried out using block motion estimation by the three-step search method. The primitive events of the object are represented by assigning spatial and temporal symbols corresponding to their location and time information. These primitive events are analyzed to form a temporal pattern in a sequence of video frames, representing temporal relation between various object's primitive events. This is repeated for each window of sequences, and the support for temporal sequence is obtained based on LC-STP to discover regular patterns of normal events. Events deviating from these patterns are identified as anomalies. Unlike the traditional frequent item set mining methods, the proposed method generates maximal frequent patterns without candidate generation. Furthermore, experimental results show that the proposed method performs well and can detect video anomalies in real traffic video data.

• 대한수학회보
• /
• 제8권1호
• /
• pp.9-15
• /
• 1971

The purpose of this note is to use primitive recursive functions and predicates similar to those presented by Davis [2] to show the well-known result first proved by Godel in [3] that the well-formed formulas of a pure functional calculus form a recursive set. The technique shown in this paper immediately suggests a unique approach to Theorem proving using a computer.

• IEIE Transactions on Smart Processing and Computing
• /
• 제1권3호
• /
• pp.192-200
• /
• 2012

In order for humans and robots to interact in daily life, robots need to understand human speech and link it to their actions. This paper proposes a hierarchical behavior model for robot action control using natural language commands. The model, which consists of episodes, primitive actions and atomic functions, uses a sentential cognitive system that includes multiple modules for perception, action, reasoning and memory. Human speech commands are translated to sentences with a natural language processor that are syntactically parsed. A semantic parsing procedure was applied to human speech by analyzing the verbs and phrases of the sentences and linking them to the cognitive information. The cognitive system performed according to the hierarchical behavior model, which consists of episodes, primitive actions and atomic functions, which are implemented in the system. In the experiments, a possible episode, "Water the pot," was tested and its feasibility was evaluated.

• 항공우주기술
• /
• 제6권2호
• /
• pp.157-163
• /
• 2007

본 연구의 목적은 KSLV-I 영상데이터를 전송하는 PCM/FM 통신시스템에서 리드솔로몬 인코더(255,223)를 설계하고 시뮬레이션하는데 있다 특히 압축영상을 전송하는 무선채널에서는 아주 낮은 BER을 요구하므로 강력한 포워드 오류정정능력을 가지는 리드솔로몬 코딩기법이 적용된다. 본 논문에서 개발된 리드솔로몬 인코더(255,223)는 CCSDS 표준의 원시다항식을 채택하여 각종 계수를 계산하였고 이를 바탕으로 영상압축기의 RF 인터페이스 모듈의 FPGA 하드웨어의 일부분으로 할당하여 시뮬레이션되고 구현되었다.

• 자연과학논문집
• /
• 제8권2호
• /
• pp.69-75
• /
• 1996

다차원 디지탈 필터링 알고리즘을 실시간에 처리할 수 있는 효율적인 시스템 구현을 위한 VLSI 구조를 제안하였다. 다차원 디지탈 필터링 알고리즘에 내재된 병렬성을 상태공간식을 이용하여 추출하여, 이를 프로세서 설계에 사용함으로써 보다 효율적인 다차원 디지탈 필터의 실시간 구현을 기능하게 하였다.