• Title/Summary/Keyword: set test

Search Result 4,976, Processing Time 0.603 seconds

QSPR Study of the Absorption Maxima of Azobenzene Dyes

  • Xu, Jie;Wang, Lei;Liu, Li;Bai, Zikui;Wang, Luoxin
    • Bulletin of the Korean Chemical Society
    • /
    • v.32 no.11
    • /
    • pp.3865-3872
    • /
    • 2011
  • A quantitative structure-property relationship (QSPR) study was performed for the prediction of the absorption maxima of azobenzene dyes. The entire set of 191 azobenzenes was divided into a training set of 150 azobenzenes and a test set of 41 azobenzenes according to Kennard and Stones algorithm. A seven-descriptor model, with squared correlation coefficient ($R^2$) of 0.8755 and standard error of estimation (s) of 14.476, was developed by applying stepwise multiple linear regression (MLR) analysis on the training set. The reliability of the proposed model was further illustrated using various evaluation techniques: leave-many-out crossvalidation procedure, randomization tests, and validation through the test set.

Modified Ranked Ordering Set Samples for Estimating the Population Mean

  • Kim, Hyun-Gee;Kim, Dong-Hee
    • Communications for Statistical Applications and Methods
    • /
    • v.14 no.3
    • /
    • pp.641-648
    • /
    • 2007
  • We propose the new sampling method, called modified ranked ordering set sampling (MROSS). Kim and Kim (2003) suggested the sign test using the ranked ordering set sampling (ROSS), and showed that the asymptotic relative efficiency (ARE) of ROSS against RSS for sign test increases as sample size does. We propose the estimator for the population mean using MROSS. The relative precision (RP) of estimator of the population mean using MROSS method with respect to the usual estimator using modified RSS is higher, and when the underlying distribution is skewed, the bias of the proposed estimator is smaller than that of several ranked set sampling estimators.

Prediction of Prosodic Boundary Strength by means of Three POS(Part of Speech) sets (품사셋에 의한 운율경계강도의 예측)

  • Eom Ki-Wan;Kim Jin-Yeong;Kim Seon-Mi;Lee Hyeon-Bok
    • MALSORI
    • /
    • no.35_36
    • /
    • pp.145-155
    • /
    • 1998
  • This study intended to determine the most appropriate POS(Part of Speech) sets for predicting prosodic boundary strength efficiently. We used 3-level POB bets which Kim(1997), one of the authors, has devised. Three POS sets differ from each other according to how much grammatical information they have: the first set has maximal syntactic and morphological information which possibly affects prosodic phrasing, and the third set has minimal one. We hand-labelled 150 sentences using each of three POS sets and conducted perception test. Based on the results of the test, stochastic language modeling method was used to predict prosodic boundary strength. The results showed that the use of each POS set led to not too much different efficiency in the prediction, but the second set was a little more efficient than the other two. As far as the complexity in stochastic language modeling is concerned, however, the third set may be also preferable.

  • PDF

Use of a Machine Learning Algorithm to Predict Individuals with Suicide Ideation in the General Population

  • Ryu, Seunghyong;Lee, Hyeongrae;Lee, Dong-Kyun;Park, Kyeongwoo
    • Psychiatry investigation
    • /
    • v.15 no.11
    • /
    • pp.1030-1036
    • /
    • 2018
  • Objective In this study, we aimed to develop a model predicting individuals with suicide ideation within a general population using a machine learning algorithm. Methods Among 35,116 individuals aged over 19 years from the Korea National Health & Nutrition Examination Survey, we selected 11,628 individuals via random down-sampling. This included 5,814 suicide ideators and the same number of non-suicide ideators. We randomly assigned the subjects to a training set (n=10,466) and a test set (n=1,162). In the training set, a random forest model was trained with 15 features selected with recursive feature elimination via 10-fold cross validation. Subsequently, the fitted model was used to predict suicide ideators in the test set and among the total of 35,116 subjects. All analyses were conducted in R. Results The prediction model achieved a good performance [area under receiver operating characteristic curve (AUC)=0.85] in the test set and predicted suicide ideators among the total samples with an accuracy of 0.821, sensitivity of 0.836, and specificity of 0.807. Conclusion This study shows the possibility that a machine learning approach can enable screening for suicide risk in the general population. Further work is warranted to increase the accuracy of prediction.

The Supply Water Algorithm for a Condensing Gas Boiler Control (콘덴싱가스보일러 제어를 위한 공급수알고리즘)

  • Han, Do-Young;Yoo, Byeong-Kang
    • Korean Journal of Air-Conditioning and Refrigeration Engineering
    • /
    • v.23 no.6
    • /
    • pp.441-448
    • /
    • 2011
  • The energy consumption of a condensing gas boiler may be greatly reduced by the effective operation of the unit. In this study, the supply water algorithm for a condensing gas boiler control was developed by using the fuzzy logic. This includes the supply water set temperature algorithm, and the control algorithms of a gas valve, a blower and a pump. For the set temperature algorithm, the outside air temperature and the return water temperature were used as input variables. The supply water temperature difference and its slope were used as input variables of the gas valve and blower control algorithm. And the supply water temperature and the return water temperature were used as input variables of the pump control algorithm. In order to analyse performances of these algorithms, the dynamic model of a condensing gas boiler was used. The initial start-up test, the supply water set temperature change test, the outside air temperature change test, and the return water temperature change test were performed. Simulation results showed that algorithms developed in this study may be practically applied for the effective control of a condensing gas boiler.

An Efficient Algorithm for Test Pattern Compaction using Independent Faults and Compatible Faults (독립고장과 양립 가능한 고장을 이용한 효율적인 테스트 패턴 압축 기법)

  • Yun, Do-Hyeon;Gang, Seong-Ho;Min, Hyeong-Bok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.2
    • /
    • pp.145-153
    • /
    • 2001
  • As combinational ATPG algorithms achieve effectively 100% fault coverage, reducing the length of test set without loosing its fault coverage becomes a challenging work. The new approach is based on the independent and the compatible relationships between faults. For more compact test set, the size of compatible fault set must be maximized, thus this algorithm generates fault-pattern pairs, and a fault-pattern pair tree structure using the independent and the compatible relationships between faults. With the fault-pattern pair tree structure, a compact test set effectively generated. The experimental results for ISCAS 85 and 89 benchmark circuits demonstrate the effectiveness of the proposed method.

  • PDF

Path Delay Test-Set Preservation of De Morgan and Re-Substitution Transformations (드모르간 및 재대입 변환의 경로지연고장 테스트집합 유지)

  • Yi, Joon-Hwan;Lee, Hyun-Seok
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.47 no.2
    • /
    • pp.51-59
    • /
    • 2010
  • Two logic transformations, De Morgan and re-substitution, are sufficient to convert a unate gate network (UGN) to a more general balanced inversion parity (BIP) network. Circuit classes of interest are discussed in detail. We prove that De Morgan and re-substitution transformations are test-set preserving for path delay faults. Using the results of this paper, we can easily show that a high-level test set for a function z that detects all path delay faults in any UGN realizing z also detects all path delay faults in any BIP realization of z.

A Large-scale Test Set for Author Disambiguation (저자 식별을 위한 대용량 평가셋 구축)

  • Kang, In-Su;Kim, Pyung;Lee, Seung-Woo;Jung, Han-Min;You, Beom-Jong
    • The Journal of the Korea Contents Association
    • /
    • v.9 no.11
    • /
    • pp.455-464
    • /
    • 2009
  • To overcome article-oriented search functions and provide author-oriented ones, a namesake problem for author names should be solved. Author disambiguation, proposed as its solution, assigns identifiers of real individuals to author name entities. Although recent state-of-the-art approaches to author disambiguation have reported above 90% performance, there are few academic information services which adopt author-resolving functions. This paper describes a large-scale test set for author disambiguation which was created by KISTI to foster author resolution researches. The result of these researches can be applied to academic information systems and make better service. The test set was constructed from DBLP data through web searches and manual inspection, Currently it consists of 881 author names, 41,673 author name entities, and 6,921 person identifiers.

Implementation of D-algorithm by using PROLOG (PRLOG에 의한 D-algorithm의 구현에 관한 연구)

  • 김명기;문영덕
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.3
    • /
    • pp.87-94
    • /
    • 1986
  • This paper introduce a new test generation method based on built-in data base which is suitable for generating of test set by using PROLOG language. The program presented in this paper deals with all the information required for fault detection from the rules describing output signals and internal signals. Example shows the validity of proposed PROLOG program which results in a effective generation of test set comparable to the conventional D-algorithm.

  • PDF

Universal Test Set for Programmable Storage/Logic Arrays (Programmable Storage/Logic Array에 대한 보편적인 Test Set)

  • Do, Yang-Hoe;Gwon, U-Hyeon;Kim, Chae-Yeong
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.1
    • /
    • pp.7-13
    • /
    • 1985
  • Design techniques for programmable storage/logic arrays(SLA's) with easily testable features are discussed. The easily testable SLA's will be designed by using additional hardware to provide an easy means to set or check the states. These augmented SLA's have the very short universal test sequences such that the test patterns and responses are uniquely determined only by the size of the SLA's independently of the function of them. The types of faluts considered here are single and multiple stuck faults, crosspoint faults, and bridge faults in SLA's. Fault location and reapir of SLA's are also considered.

  • PDF