• 제어로봇시스템학회논문지
• /
• 제21권7호
• /
• pp.699-708
• /
• 2015

In the testing of a software component-based robot system, generating test cases for the system is a time-consuming and difficult task that requires the combining of test data. This paper proposes an adaptive combinatorial testing method which is based on the input/output relationship among components and which automatically generates the test cases for the system. The proposed algorithm first generates an input/output relationship graph in order to analyze the input/output relationship of the system. It then generates the reduced set of test cases according to the analyzed type of input/output relationship. To validate the proposed algorithm some comparisons are given in terms of the time complexity and the number of test cases.

• ETRI Journal
• /
• 제32권1호
• /
• pp.73-83
• /
• 2010

Combinatorial testing has been an active research area in recent years. One challenge in this area is dealing with the combinatorial explosion problem, which typically requires a very expensive computational process to find a good test set that covers all the combinations for a given interaction strength (t). Parallelization can be an effective approach to manage this computational cost, that is, by taking advantage of the recent advancement of multicore architectures. In line with such alluring prospects, this paper presents a new deterministic strategy, called multicore modified input parameter order (MC-MIPOG) based on an earlier strategy, input parameter order generalized (IPOG). Unlike its predecessor strategy, MC-MIPOG adopts a novel approach by removing control and data dependency to permit the harnessing of multicore systems. Experiments are undertaken to demonstrate speedup gain and to compare the proposed strategy with other strategies, including IPOG. The overall results demonstrate that MC-MIPOG outperforms most existing strategies (IPOG, IPOF, IPOF2, IPOG-D, ITCH, TConfig, Jenny, and TVG) in terms of test size within acceptable execution time. Unlike most strategies, MC-MIPOG is also capable of supporting high interaction strengths of t > 6.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제41권7호
• /
• pp.469-480
• /
• 2014

소프트웨어 제품라인은 제품들 간의 공통성 및 가변성을 전체 개발라이프사이클에 걸쳐 체계적으로 계획하고 재사용하여 생산성 향상, 비용절감, 시장적시성 향상을 꾀하는 소프트웨어 개발 패러다임이다. 소프트웨어 제품라인이 가져다 주는 이익을 최대화하기 위하여 시험은 도메인 공학과 어플리케이션 공학의 두 라이프사이클을 구성하는 프로세스들과 일관된 방식으로 통합되어야 하며, 더불어 시험 노력을 절감할 수 있어야 한다. 본 논문에서는 조합 시험 설계를 적용하여 제품라인 플랫폼을 시험할 시험항목을 생성함으로써 시험항목 개수를 상당히 줄이면서 동시에 재사용이 용이한 시험항목 생성을 지원하여 시험노력을 절감할 수 있는 조합 시험 설계를 이용한 제품라인 시험항목 생성 방법을 제안한다. 또한, 사례연구를 통하여 제안한 방법이 조합 설계를 이용하거나 그렇지 않은 기존의 다른 방법들 보다 효율적임을 보인다.

• Journal of Information Processing Systems
• /
• 제13권5호
• /
• pp.1089-1102
• /
• 2017

In software systems, it has been observed that a fault is often caused by an interaction between a small number of input parameters. Even for moderately sized software systems, exhaustive testing is practically impossible to achieve. This is either due to time or cost constraints. Combinatorial (t-way) testing provides a technique to select a subset of exhaustive test cases covering all of the t-way interactions, without much of a loss to the fault detection capability. In this paper, an approach is proposed to generate 2-way (pairwise) test sets using genetic algorithms. The performance of the algorithm is improved by creating an initial solution using the overlap coefficient (a similarity matrix). Two mutation strategies have also been modified to improve their efficiency. Furthermore, the mutation operator is improved by using a combination of three mutation strategies. A comparative survey of the techniques to generate t-way test sets using genetic algorithms was also conducted. It has been shown experimentally that the proposed approach generates faster results by achieving higher percentage coverage in a fewer number of generations. Additionally, the size of the mixed covering arrays was reduced in one of the six benchmark problems examined.

• Biomolecules & Therapeutics
• /
• 제13권3호
• /
• pp.181-184
• /
• 2005

The solution-phase combinatorial synthesis of iminodiacetic acid triamide libraries linked to 1-(4-chlorobenzhydryl)piperazine has been reported. Ten mixture libraries, each containing 5 components, were synthesized in 4 steps from N-BOC-iminodiacetic acid anhydride. Antibradykinin effects of the mixture and individual libraries were compared using guinea-pig ileum smooth muscle. The changes in the inhibition were also observed by testing the combination of two different compounds from the same library. We found out the correlation between the inhibition of mixtures and that of individual libraries. It is possible to choose the mixtures with relatively high inhibitory effects to find out the most effective individual compound for further synthesis.

• 대한수학회지
• /
• 제53권1호
• /
• pp.187-199
• /
• 2016

The r-ary number sequences given by $$(b^{(r)}_n)_{n{\geq}0}=\Large{\frac{1}{(r-1)n+1}}(^{rn}_n)$$ are analogs of the sequence of the Catalan numbers ${\frac{1}{n+1}}(^{2n}_n)$. Their history goes back at least to Lambert [8] in 1758 and they are of considerable interest in sequential testing. Usually, the sequences are considered separately and the generalizations can go in several directions. Here we link the various r first by introducing a new combinatorial structure related to GR trees and then algebraically as well. This GR transition generalizes to give r-ary analogs of many sequences of combinatorial interest. It also lets us find infinite numbers of combinatorially defined sequences that lie between the Catalan numbers and the Ternary numbers, or more generally, between $b^{(r)}_n$ and $b^{(r+1)}_n$.

• 한국경영과학회지
• /
• 제19권3호
• /
• pp.187-201
• /
• 1994

This paper introduces an effective hybridization of the usual simplex method and an interior point method in the convergent framework of Dembo and Sahi. We formulate a specific and detailed algorithm (HYBRID) and report the results of some preliminary testing on small dense problems for its viability. By piercing through the feasible region, the newly developed hybrid algorithm avoids the combinatorial structure of linear programs, and several other interesting and important characteristics of this algorithm are also discussed.

• 한국정보전자통신기술학회논문지
• /
• 제11권5호
• /
• pp.572-578
• /
• 2018

본 논문은 조합 문제의 하나로써 그룹검사(Group Testing)의 성능 하한치를 유도한다. 그룹검사는 2차 세계대전 동안 군인들의 매독 감염을 검진하기 위해 시작되었고 지금까지 오랫동안 학문적 기초를 마련하였다. 최근 들어 그룹검사의 활용가치가 증대되어 재발견됨으로써 학계에서 큰 관심을 받고 있다. 그룹검사는 다수의 샘플 중에서 극소수의 결함 샘플을 찾는 문제와 동일하며, 이것은 압축센싱(Compressed Sensing)의 선형 역문제(inverse problem)와 유사하다. 본 논문에서는 그룹검사가 무엇인지 살펴보고 그룹검사의 관련 연구내용을 알아본다. 정보이론에서 사용한 조건부 엔트로피와 에러율 간의 관계를 밝히는 정리를 이용하여 결함 샘플을 찾기 위해 필요한 검사 수에 대한 최소 에러율의 경계값을 도출할 뿐만 아니라 기존 연구와 어떠한 차이점이 있는지 살펴본다.

• 한국멀티미디어학회논문지
• /
• 제5권6호
• /
• pp.638-645
• /
• 2002

컴퓨터 기반 교육의 잠재적인 이점은 개별화 교습이다. 그러나 컴퓨터를 기반으로 한 교습의 목표는 완전하게 실행될 수 없었다. 가장 큰 이유는 자연어 이해에 대한 제약과 내재된 많은 문제점이다. 그럼에도 불구하고 컴퓨터 기반 평가 길이를 적당히 조절함으로써 학습자의 학습능력을 평가할 수 있는 CAT(Computer-based Adaptive Testing)프로그램 개발은 가능하다. 평가를 위한 문항 수가 두드러지게 감소하면서 반면에 합격과 불합격 판정이 매우 정확하다. 본 논문에서는 SPRT(Sequential Probability Ratio Testing)방식을 이용한 평가시스템을 설계하고 구현하였다. 이 시스템은 개별화 수업을 위하여 다양한 멀티미디어 오브젝트를 지원하고 클라이언트/서버 환경과 학습자 피드백, 다중-SPRT 그리고 학습자 모델을 유지 관리한다. 아울러 문항의 독립성을 위하여 각 문항의 coefficient alpha 값을 측정하여 관리하는 기능을 지원한다.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.154-157
• /
• 2003

In order for testing faults of combinatorial logic circuit, the authors have developed a new diagnosis method: "Neural Network (NN) fault diagnosis", based on fm error back propagation functions. This method has proved the capability to test gate faults of wider range including so called SSA (single stuck-at) faults, without assuming neither any set of test data nor diagnosis dictionaries. In this paper, it is further shown that what kind of fault models can be detected in the NN fault diagnosis, and the simply modified one can extend to test delay faults, e.g. logic hazard as long as the delays are confined to those due to gates, not to signal lines.