• Title/Summary/Keyword: 순차적방법

Search Result 21, Processing Time 0.067 seconds

A sequential outlier detecting method using a clustering algorithm (군집 알고리즘을 이용한 순차적 이상치 탐지법)

  • Seo, Han Son;Yoon, Min
    • The Korean Journal of Applied Statistics
    • /
    • v.29 no.4
    • /
    • pp.699-706
    • /
    • 2016
  • Outlier detection methods without performing a test often do not succeed in detecting multiple outliers because they are structurally vulnerable to a masking effect or a swamping effect. This paper considers testing procedures supplemented to a clustering-based method of identifying the group with a minority of the observations as outliers. One of general steps is performing a variety of t-test on individual outlier-candidates. This paper proposes a sequential procedure for searching for outliers by changing cutoff values on a cluster tree and performing a test on a set of outlier-candidates. The proposed method is illustrated and compared to existing methods by an example and Monte Carlo studies.

A Efficient Debugging Method for Java Programs (자바 프로그램을 위한 효율적인 디버깅 방법)

  • 고훈준;유원희
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2002.06a
    • /
    • pp.170-176
    • /
    • 2002
  • Java language is a representative object-oriented language that is used at the various platform and fields. A structure of java language is simpler than traditional procedural-oriented language because of characters of object-oriented language But it is difficult to debug complicated java programs. Debugging has always been a costly part of software development. Syntax errors of java programs is easily found by the current debugging system. But it is difficult to locate logical errors included in java programs. Traditional debugging techniques locating logical errors in java program have been still used with conventional methods that are used at procedural-oriented languages. Unfortunately, these traditional methods are often inadequate for the task of isolating specific program errors. Debugger users may spend considerable time debugging code of program development with sequential methods according as program size is large and is complicated. It is important to easily locate errors included in java program in the software development. In this paper, we apply algorithmic debugging method that debugger user can easily debug programs to java program. This method executes a program and makes an execution tree from calling relation of functions. And it locates errors at the execution tree. So, Algorithmic debugging method can reduce the number of debugging than conventional sequential method.

  • PDF

An Integrated Method of Iterative and Incremental Requirement Analysis for Large-Scale Systems (시스템 요구사항 분석을 위한 순환적-점진적 복합 분석방법)

  • Park, Jisung;Lee, Jaeho
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.6 no.4
    • /
    • pp.193-202
    • /
    • 2017
  • Development of Intelligent Systems involves effective integration of large-scaled knowledge processing and understanding, human-machine interaction, and intelligent services. Especially, in our project for development of a self-growing knowledge-based system with inference methodologies utilizing the big data technology, we are building a platform called WiseKB as the central knowledge base for storing massive amount of knowledge and enabling question-answering by inferences. WiseKB thus requires an effective methodology to analyze diverse requirements convoluted with the integration of various components of knowledge representation, resource management, knowledge storing, complex hybrid inference, and knowledge learning, In this paper, we propose an integrated requirement analysis method that blends the traditional sequential method and the iterative-incremental method to achieve an efficient requirement analysis for large-scale systems.

Personalized Web Search using RIA Technology (RIA 기술을 활용한 개인화된 웹 검색)

  • Park, Cha-Ra;Rim, Tae-Soo;Lee, Woo-Key
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2007.06a
    • /
    • pp.9-10
    • /
    • 2007
  • 쉽고 유연한 조작과 다양하고 역동적인 화면구성에 초점을 맞춘 인터넷서비스 맞춤기술인 RIA(Rich Internet Aplication)기술들은 웹2.0기술중 사용자 편의성을 강조한 차세대 UI기술로 기대되고 있다. 본 논문은 평면적이고 순차적인 방법의 고급검색을 동적UI로 구현하고 사용자가 개인화 검색정보를 저장해서 검색에 활용할 수 있도록 구현하였다. 또한 사용자중심의 키워드 선호도를 통해 기존 웹 검색보다 개인화된 검색 결과물을 발견할 수 있는 검색구조를 설계하였다. 본 연구는 RIA 기술을 활용한 개인화 검색 관리자의 적용을 통해 검색된 페이지양의 감소를 입증하여 사용자에게 더욱 정제된 데이터를 제공하며 결론적으로 사용자들이 더욱 유연하고 편리한 방법으로 개인화된 웹 검색을 이용할 수 있음을 보였다.

  • PDF

Learning and Modeling of Neuro-Fuzzy modeling using Clustering and Fuzzy rules (클러스터링과 퍼지 규칙을 이용한 뉴로-퍼지 시스템 학습 및 모델링)

  • Kim, Sung-Suk;Kwak, Keun-Chang;Kim, Ju-Sik;Ryu, Jeong-Woong
    • Proceedings of the KIEE Conference
    • /
    • 2005.07d
    • /
    • pp.2879-2881
    • /
    • 2005
  • 본 논문에서는 뉴로-퍼지 모델의 전제부 소속함수의 새로운 학습방법을 통한 모델링 기법을 제안한다. 모델의 크기와 학습시간을 줄이는 기법으로 클러스터링 기법을 이용한 모델의 초기 파라미터 결정 방법이 있다. 이는 클러스터링 후 이들 파라미터를 다시 모델에 적용하여 모델을 학습하는 순차적 방법으로써 모델의 학습이 끝난 후의 전제부 파라미터가 클러스터링 파라미터와 연관성을 가지지 못하는 경우가 발생하였다. 또한 오차미분 기반 학습에서는 전제부 초기치가 국부적 최적해에서 벋어나지 못하는 문제점을 가지고 있다. 본 논문에서는 자율적으로 클러스터의 수를 추정하며 이들 파라미터를 최적화하며 이를 이용하여 뉴로-퍼지 모델의 학습을 실시하는 학습기법을 제안하였다. 제안된 방법에서는 기존의 오차미분 기반 학습을 클러스터링 기반 학습으로 확장하였으며 이를 이용한 모델의 성능을 기존의 연구결과와 비교하여 우수성을 보인다.

  • PDF

A Tessellation of a Polynomial Curve by a Sequential Method (다항식곡선으로부터 순차적 방법에 의한 점열의 생성)

  • Ju S.Y.
    • Korean Journal of Computational Design and Engineering
    • /
    • v.11 no.3
    • /
    • pp.205-210
    • /
    • 2006
  • Curve tessellation, which generates a sequence of points from a curve, is very important for curves rendering on a computer screen and for NC machining. For the most case the sequence of discrete points is used rather than a continuous curve. This paper deals with a method of tessellation by calculating the maximal deviation of a curve. The maximal deviation condition is introduced to find the point with the maximal chordal deviation on a curve segment. In the previous research a curve tessellation was tried by the subdivision method, that is, a curve is subdivided until the maximal chordal deviation is less than the given tolerance. On the other hand, a curve tessellation by sequential method is tried in this paper, that is, points are generated successively by using the local property of a curve. The sequential method generates relatively much less points than the subdivision method. Besides, the sequential method can generate a sequence of points from a spatial curve by approximation to a planar curve. The proposed method can be applied for high-accuracy curve tessellation and NC tool-path generation.

Design of dual-mode bandpass DR filter in a loaded cavity (유전체 공진기가 삽입된 공동공진기를 이용한 이중모드 대역통과 필터의 설계)

  • Park, Do-Young;Yoon, Soon-Il;Park, Mie-Hwa;Na, Seong-Uk;Lee, Kie-Jin
    • Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
    • /
    • 2004.07b
    • /
    • pp.578-581
    • /
    • 2004
  • 유전체가 삽입된 공동 공진기는 유전체에 대부분의 전자계가 집속되어 있기 때문에, 도체 손실이 매우 적고 높은 Q값과 온도 안정성이 뛰어나다. 동일한 주파수에서 동작하는 다른 필터에 비해 상대적으로 작기 때문에 소형화에도 적합하다. 본 논문에서는 유전체가 삽입된 공동 공진기의 전자기 분포와 특성을 수치해석과 HFSS(High Frequency Structure Simulator)를 이용하여 분석하였고 이 결과를 토대로 HFSS를 이용한 순차적 방법을 도입하여 4-pole 이중모드 대역통과 필터를 설계, 제작하였다.

  • PDF

Development of the RP and SP Combined using Error Component Method (Error Component 방법을 이용한 RP.SP 결합모형 개발)

  • 김강수;조혜진
    • Journal of Korean Society of Transportation
    • /
    • v.21 no.2
    • /
    • pp.119-130
    • /
    • 2003
  • SP data have been widely used in assessing new transport policies and transport related plans. However, one of criticisms of using SP is that respondents may show different reaction between hypothetical experiments and real life. In order to overcome the problem, combination of SP and RP data has been suggested and the combined methods have been being developed. The purpose of this paper is to suggest a new SP and RP combined method using error component method and to verify the method. The error component method decomposes IID extreme value error into non-IID error component(s) and an IID error component. The method estimates both of component parameters and utility parameters in order to obtain relative variance of SP data and RP data. The artificial SP and RP data was created by using simulation and used for the analysis, and the estimation results of the error component method were compared with those of existing SP and RP combined methods. The results show that regardless of data size, the parameters of the error component method models are similar to those assumed parameters much more than those of the existing SP and RP combined models, indicating usefulness of the error component method. Also the values of time for error component method are more similar to those assumed values than those of the existing combined models. Therefore, we can conclude that the error component method is useful in combining SP and RP data and more efficient than the existing methods.

RIA based Personalized Search with Widget Implementation (RIA 기반 개인화 검색을 위한 Widget 응용의 구현)

  • Park, Cha-Ra;Lim, Tae-Soo;Lee, Woo-Key
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.6
    • /
    • pp.402-406
    • /
    • 2007
  • Rich Internet Application(RIA) is one of the Web 2.0 technologies and is expected to be a next generation user interface technique which allows flexible and dynamic manipulation for Web searches. This paper addresses a personalization mechanism for advanced Web search using RIA for abundant user interactions. We devised a dynamic and graphical user interface instead of previous text-based searches and a client side application for storing personal preference information. In this research, we implemented the graphical personalized search manager using Yahoo web search API and widget, and demonstrated its effectiveness by performing some experiments with various query terms and representative predicates.

Efficient Implementation of Morphological Filters by Structuring Element Decomposition (형태소 분해를 통한 형태학적 필터의 효율적 구현)

    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9A
    • /
    • pp.1419-1424
    • /
    • 1999
  • In order to implement morphological filters on image processing systems, the size of structuring element must be small due to the architectural constraints of the systems, which requires the decomposition of structuring element into small elements for the filters with large structuring elements. In this paper, an algorithm for decomposition of structuring element with no restriction on the shape and size is developed which enables sub-optimal implementation of any morphological filter on 3X3 pipeline machine. The given structuring element is first decomposed into the union of elements using sequential search procedure, then each element is further decomposed optimally into 3X3 elements, resulting in final sub-optimal 3$\times$3 hybrid decomposition. The proposed algorithm is applied to some structuring elements and the results close to the optimum are obtained.

  • PDF