<efrbr:recordSet xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:efrbr="http://vfrbr.info/efrbr/1.1" xmlns:efrbr-work="http://vfrbr.info/efrbr/1.1/work" xmlns:efrbr-expression="http://vfrbr.info/efrbr/1.1/expression" xmlns:efrbr-manifestation="http://vfrbr.info/efrbr/1.1/manifestation" xmlns:efrbr-person="http://vfrbr.info/efrbr/1.1/person" xmlns:efrbr-corporateBody="http://vfrbr.info/efrbr/1.1/corporateBody" xmlns:efrbr-concept="http://vfrbr.info/efrbr/1.1/concept" xmlns:efrbr-structure="http://vfrbr.info/efrbr/1.1/structure" xmlns:efrbr-responsible="http://vfrbr.info/efrbr/1.1/responsible" xmlns:efrbr-subject="http://vfrbr.info/efrbr/1.1/subject" xmlns:efrbr-other="http://vfrbr.info/efrbr/1.1/other" xsi:schemaLocation="http://vfrbr.info/efrbr/1.1 http://vfrbr.info/schemas/1.1/efrbr.xsd"><efrbr:entities><efrbr-work:work identifier="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107"><efrbr-work:titleOfTheWork>Single sampling plans for attributes satisfying an arbitrary set of constraints—A graphical approach</efrbr-work:titleOfTheWork></efrbr-work:work><efrbr-expression:expression identifier="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107"><efrbr-expression:titleOfTheExpression>Single sampling plans for attributes satisfying an arbitrary set of constraints—A graphical approach</efrbr-expression:titleOfTheExpression><efrbr-expression:formOfExpression vocabulary="DIAS:TYPES">
            Peer-Reviewed Journal Publication
            Δημοσίευση σε Περιοδικό με Κριτές
         </efrbr-expression:formOfExpression><efrbr-expression:dateOfExpression type="issued">2015-11-07</efrbr-expression:dateOfExpression><efrbr-expression:dateOfExpression type="published">1994</efrbr-expression:dateOfExpression><efrbr-expression:languageOfExpression vocabulary="iso639-1">en</efrbr-expression:languageOfExpression><efrbr-expression:summarizationOfContent>In this paper we present a solution to the problem of determining a single sampling plan, using Larson's Nomograph of the binomial distribution. The problem consists of deciding whether a lot of items will be accepted or rejected, by inspecting a sample of specified size n drawn from the lot. The lot is rejected if the number of bad iterms in the sample is greater than a specified threshold c, otherwise the lot is accepted. The classical procedure for determining a single sampling plan (n,c) is to specify the maximum acceptable probabilities of Type I and Type II errors. Next one expresses these errors in terms of n and c by using the binomial approximation to the hypergeometric distribution. Finally, the pair (n,c) is read at the intersection of the characteristic lines which correspond to the specified maximum error probabilities in the Nomograph. Here, we show that there is a region of plans in the Nomograph which satisfy the error constraints, rather than a single plan. Then we generalize the procedure to problems with an arbitrary number of constraints involving both error types. 

</efrbr-expression:summarizationOfContent><efrbr-expression:useRestrictionsOnTheExpression type="creative-commons">http://creativecommons.org/licenses/by/4.0/</efrbr-expression:useRestrictionsOnTheExpression><efrbr-expression:note type="journal name">Microelectronics Reliability</efrbr-expression:note><efrbr-expression:note type="journal volume">6</efrbr-expression:note><efrbr-expression:note type="journal number">34</efrbr-expression:note><efrbr-expression:note type="page range">1071-1077</efrbr-expression:note></efrbr-expression:expression><efrbr-person:person identifier="http://users.isc.tuc.gr/~vkouikoglou"><efrbr-person:nameOfPerson vocabulary="TUC:LDAP">
            Kouikoglou Vasilis
            Κουϊκογλου Βασιλης
         </efrbr-person:nameOfPerson></efrbr-person:person><efrbr-corporateBody:corporateBody identifier="B8AB47CC-8969-4781-952F-7FA659FFBD68"><efrbr-corporateBody:nameOfTheCorporateBody vocabulary="">
            Pergamon
         </efrbr-corporateBody:nameOfTheCorporateBody></efrbr-corporateBody:corporateBody><efrbr-concept:concept identifier="http://id.loc.gov/authorities/subjects/sh99001414"><efrbr-concept:termForTheConcept>
            --Cases, clinical reports, statistics
            --Statistical data
            statistics
            cases clinical reports statistics
            statistical data
         </efrbr-concept:termForTheConcept></efrbr-concept:concept></efrbr:entities><efrbr:relationships><efrbr-structure:structureRelations><efrbr-structure:realizedThrough sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107" targetEntity="expression" targetURI="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107"/></efrbr-structure:structureRelations><efrbr-responsible:responsibleRelations><efrbr-responsible:createdBy sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107" targetEntity="person" targetURI="http://users.isc.tuc.gr/~vkouikoglou"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107" targetEntity="person" targetURI="http://users.isc.tuc.gr/~vkouikoglou" role="author"/><efrbr-responsible:realizedBy sourceEntity="expression" sourceURI="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107" targetEntity="person" targetURI="B8AB47CC-8969-4781-952F-7FA659FFBD68" role="publisher"/></efrbr-responsible:responsibleRelations><efrbr-subject:subjectRelations><efrbr-subject:hasSubject sourceEntity="work" sourceURI="http://purl.tuc.gr/dl/dias/925DE542-9609-4E47-8724-C2DED31A8107" targetEntity="concept" targetURI="http://id.loc.gov/authorities/subjects/sh99001414"/></efrbr-subject:subjectRelations><efrbr-other:otherRelations/></efrbr:relationships></efrbr:recordSet>