• Title/Summary/Keyword: 순차 분석

Search Result 1,087, Processing Time 0.03 seconds

Detection Schemes Based on Local Optimality and Sequential Criterion: 1. Threshold Analysis (국소 최적성과 순차 기준을 바탕으로 한 검파 기법: 1. 문턱값 분석)

  • Choi Sang Won;Oh Jongho;Kwon Hyoungmoon;Yoon Seokho;Bae Jinsoo;Song Iickho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6C
    • /
    • pp.532-540
    • /
    • 2005
  • In this paper, a sequential detection scheme is proposed as a combination of a novel weak-signal and a locally optimum(LO) detection schemes. In Part 1, we propose a novel sequential detection scheme for weak signals and show some interesting threshold properties and examples. In Part 2, the performance of the proposed sequential detection scheme is compared with that of the fixed sample size(FSS) test, sequential probability ratio test (SPRT), and truncated sequential probability ratio test(TSPRT).

Sequential Convex Programming Based Performance Analysis of UAV Design (순차 컨벡스 프로그래밍 기반 무인기 설계 형상의 성능 분석)

  • Ko, Hyo-Sang;Choi, Hanlim;Jang, Jong-Youn;Kim, Joon;Ryu, Gu-Hyun
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.11
    • /
    • pp.771-781
    • /
    • 2022
  • Sequential convex programming based performance analysis of the designed UAV is performed. The nonlinear optimization problems generated by aerodynamics are approximated to socond order program by discretization and convexification. To improve the performance of the algorithm, the solution of the relaxed problem is used as the initial trajectory. Dive trajectory optimization problem is analyzed through iterative solution procedure of approximated problem. Finally, the maximum final velocity according to the performance of the actuator model was compared.

Parallel Interworking Model and Performance Analysis of a Connection Control Protocol for Broadband Access Network (광대역 액세스 망을 위한 연결 제어 프로토콜의 병렬형 연동 모델과 성능 분석)

  • Kim, Chun-Hui;Cha, Yeong-Uk;Kim, Jae-Geun;Han, Gi-Jun
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.12
    • /
    • pp.1529-1538
    • /
    • 1999
  • 광대역 액세스 망은 B-ISDN 환경에서 다양한 유형의 가입자들을 서비스 노드로 집선하는 기능을 수행한다. ITU-T의 SG13에서는 광대역 액세스 망과 서비스 노드 사이에서 ATM 자원의 동적인 할당 및 해제를 위하여 연결 제어 프로토콜의 표준화를 수행하고 있다. ATM 연결의 설정을 위한 연결 제어 프로토콜과 신호 프로토콜의 연동 기능은 서비스 노드에서 수행되며, ITU-T에서는 순차적 연동 모델을 채택하고 있다. 순차적 연동 모델은 SN에서 각 프로토콜의 절차가 순차적 방식으로 연동되므로 연결 지연이 크다. 본 논문에서는 광대역 액세스 망의 도입으로 인한 연결 설정 지연을 최소화하기 위하여 병렬형으로 수행되는 연동 모델을 제시하였다. 그리고 본 논문에서 제안한 병렬형 연동 모델의 성능 분석을 통하여 순차적 연동 모델과의 연결 설정 지연 및 완료비에 대한 비교, 분석을 수행하였다. 성능 분석에서 사용된 워크로드 파라미터는 RACE MAGIC 프로젝트의 결과를 적용하였다. Abstract In B-ISDN environment, various subscribers are concentrated into a service node via a broadband access network. The SG13 of ITU-T is standardizing a connection control protocol which provides dynamic allocation of ATM resources between an access network and a service node. To establish an ATM connection, interworking functions between the connection control protocol and the signaling protocol are performed at the service node. ITU-T adopts the sequential interworking model. In this paper, we propose the parallel interworking model which minimizes the overall connection setup delay by introducing the access network. Using the performance analysis, we compare our proposed parallel model with the existing sequential model in terms of connection setup delay and completion ratio. The workload parameters of RACE MAGIC project are applied to the analysis and simulation.

Type I projection sum of squares by weighted least squares (가중최소제곱법에 의한 제1종 사영제곱합)

  • Choi, Jaesung
    • Journal of the Korean Data and Information Science Society
    • /
    • v.25 no.2
    • /
    • pp.423-429
    • /
    • 2014
  • This paper discusses a method for getting Type I sums of squares by projections under a two-way fixed-effects model when variances of errors are not equal. The method of weighted least squares is used to estimate the parameters of the assumed model. The model is fitted to the data in a sequential manner by using the model comparison technique. The vector space generated by the model matrix can be composed of orthogonal vector subspaces spanned by submatrices consisting of column vectors related to the parameters. It is discussed how to get the Type I sums of squares by using the projections into the orthogonal vector subspaces.

FMC's Robot Path Analysis and Design Using Simulation and Sequential patterns (시뮬레이션과 순차 패턴을 이용한 FMC의 로봇 경로 분석 및 설계)

  • Kim, Sun-Gil;Lee, Hong-Chul
    • Proceedings of the KAIS Fall Conference
    • /
    • 2009.12a
    • /
    • pp.806-809
    • /
    • 2009
  • 본 논문에서는 FMC의 로봇 경로 분석 및 설계를 하기 위해 시뮬레이션을 이용해 FMC의 로봇 패턴을 분석하고 그 결과를 이용해 최적의 로봇 경로를 설계하는 방법을 제시하였다. 전형적인 FMC를 시뮬레이션으로 설계하고 설비에서 신호를 추출 해 순차 패턴 마이닝을 이용해 로봇의 최적 이동 경로를 도출하는 방법을 제시하였다. 이러한 신호의 패턴을 이용한 분석 방법은 로봇의 경로 설계를 도출하기가 용이하여 최적의 경로를 설계하여 FMC에 적용한 결과 기존보다 총 처리량의 증가와 총 처리시간 감소를 가져왔다. 또한 이 방법은 FMC 뿐만 아니라 로봇이 있는 모든 생산라인에 시뮬레이션을 통해 분석이 가능하기 때문에 생산성 향상에 크게 기여할 것으로 기대된다.

  • PDF

A Study on the Fraud Detection through Sequential Pattern Analysis: Focused on Transactions of Electronic Prepayment (순차패턴 분석을 통한 이상금융거래탐지 연구: 선불전자지급수단 거래를 중심으로)

  • Choi, Byung-Ho;Cho, Nam-Wook
    • The Journal of Society for e-Business Studies
    • /
    • v.26 no.3
    • /
    • pp.21-32
    • /
    • 2021
  • Due to the recent development in electronic financial services, transactions of electronic prepayment are rapidly increasing. The increased transactions of electronic prepayment, however, also leads to the increased fraud attempts. It is mainly because electronic prepayment can easily be converted into cash. The objective of this paper is to develop a methodology that can effectively detect fraud transactions in electronic prepayment, by using sequential pattern mining techniques. To validate our approach, experiments on real transaction data were conducted and the applicability of the proposed method was demonstrated. As a result, the accuracy of the proposed method has been 95.6 percent, showing that the proposed method can effectively detect fraud transactions. The proposed method could be used to reduce the damage caused by the fraud attempts of electronic prepayment.

Illumination Robust Feature Descriptor Based on Exact Order (조명 변화에 강인한 엄격한 순차 기반의 특징점 기술자)

  • Kim, Bongjoe;Sohn, Kwanghoon
    • Journal of Broadcast Engineering
    • /
    • v.18 no.1
    • /
    • pp.77-87
    • /
    • 2013
  • In this paper, we present a novel method for local image descriptor called exact order based descriptor (EOD) which is robust to illumination changes and Gaussian noise. Exact orders of image patch is induced by changing discrete intensity value into k-dimensional continuous vector to resolve the ambiguity of ordering for same intensity pixel value. EOD is generated from overall distribution of exact orders in the patch. The proposed local descriptor is compared with several state-of-the-art descriptors over a number of images. Experimental results show that the proposed method outperforms many state-of-the-art descriptors in the presence of illumination changes, blur and viewpoint change. Also, the proposed method can be used for many computer vision applications such as face recognition, texture recognition and image analysis.

A Design of High Gain Sequentially Rotated Array Microstrip Antenna (고 이득 순차 회전 배열 마이크로스트립 안테나의 설계)

  • Park, Byoung-Woo;Han, Jeoug-Se
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.19 no.7
    • /
    • pp.707-712
    • /
    • 2008
  • In this paper, the sequentially rotated array(SRA) antenna with 256 elements applicable for satellite broadcasting reception was designed by arraying this triple(4+8+4 element) SRA antenna as a sub-array antenna. The structure of a triple SRA antenna is a combination of three coaxial shells composed with 4 elements of inner shell and 8 elements of middle shell and 4 elements of outer shell. In accordance with the optimum design rules for realizing a high gain antenna, the sequential array factors(M, P) of inner shell and outer shell have been chosen M=4 and P=1 and that of middle shell has been chosen M=8 and P=1. The results of the simulation and the measurement for the proposed triple(4+8+4 element) SRA antenna and the SRA antenna with 256 elements show good characteristics on the integration, bandwidth of the axial ratio and the cross-polarization, the gain respectively.

A study on the SIC with the improved delay time in CDMA System (CDMA시스템에서 지연 시간을 향상시킨 순차적 간섭 제거기에 관한 연구)

  • Choe, Byeong-Gu;Park, Yong-Wan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.37 no.7
    • /
    • pp.1-8
    • /
    • 2000
  • In this paper, we introduce a modified interference cancellation scheme for multiuser detection in CDMA(Code Division Multiple Access). This detector uses SIC(Successive Interference Canceller) scheme and divides the received signals to reduce the delay time. In this proposed structure, the active users are divided into a number of groups. Within each group, parallel detection is performed to estimate the output signal of that group. The estimated output signal due to that group is then subtracted from the received signal and the resulting residual signal is used for the parallel detection of the next group. This parallel and serial cancellation process is repeated until the last group in the stage is completed. The estimated output signals due to all groups except -th group are MAI for the user signals in -th group. Therefore, the estimated output signals due to all groups except th group are subtracted from the received signal, and then the obtained signal becomes the input signal of -th SIC. The proposed RDSIC (Reduced Delay time of Successive Interference Canceller) has performance and complexity close to the SIC, but with much less detection delay.

  • PDF

Design and Implementation of Sequential Pattern Miner to Analyze Alert Data Pattern (경보데이터 패턴 분석을 위한 순차 패턴 마이너 설계 및 구현)

  • Shin, Moon-Sun;Paik, Woo-Jin
    • Journal of Internet Computing and Services
    • /
    • v.10 no.2
    • /
    • pp.1-13
    • /
    • 2009
  • Intrusion detection is a process that identifies the attacks and responds to the malicious intrusion actions for the protection of the computer and the network resources. Due to the fast development of the Internet, the types of intrusions become more complex recently and need immediate and correct responses because the frequent occurrences of a new intrusion type rise rapidly. Therefore, to solve these problems of the intrusion detection systems, we propose a sequential pattern miner for analysis of the alert data in order to support intelligent and automatic detection of the intrusion. Sequential pattern mining is one of the methods to find the patterns among the extracted items that are frequent in the fixed sequences. We apply the prefixSpan algorithm to find out the alert sequences. This method can be used to predict the actions of the sequential patterns and to create the rules of the intrusions. In this paper, we propose an extended prefixSpan algorithm which is designed to consider the specific characteristics of the alert data. The extended sequential pattern miner will be used as a part of alert data analyzer of intrusion detection systems. By using the created rules from the sequential pattern miner, the HA(high-level alert analyzer) of PEP(policy enforcement point), usually called IDS, performs the prediction of the sequence behaviors and changing patterns that were not visibly checked.

  • PDF