Acceptance Single Sampling Plan with fuzzy parameter with The Using of Poisson Distribution

Similar documents
CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

1 Introduction to Modulo 7 Arithmetic

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

QUESTIONS BEGIN HERE!

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

12. Traffic engineering

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

SOLVED EXAMPLES. be the foci of an ellipse with eccentricity e. For any point P on the ellipse, prove that. tan

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

Constructive Geometric Constraint Solving

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

Present state Next state Q + M N

Planar Upward Drawings

TOPIC 5: INTEGRATION

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

QUESTIONS BEGIN HERE!

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

DEVELOPING COMPUTER PROGRAM FOR COMPUTING EIGENPAIRS OF 2 2 MATRICES AND 3 3 UPPER TRIANGULAR MATRICES USING THE SIMPLE ALGORITHM

Section 3: Antiderivatives of Formulas

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Integration Continued. Integration by Parts Solving Definite Integrals: Area Under a Curve Improper Integrals

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Garnir Polynomial and their Properties

Journal of Solid Mechanics and Materials Engineering

Binomials and Pascal s Triangle

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A PROPOSAL OF FE MODELING OF UNIDIRECTIONAL COMPOSITE CONSIDERING UNCERTAIN MICRO STRUCTURE

Chapter 16. 1) is a particular point on the graph of the function. 1. y, where x y 1

ME 522 PRINCIPLES OF ROBOTICS. FIRST MIDTERM EXAMINATION April 19, M. Kemal Özgören

MULTIPLE-LEVEL LOGIC OPTIMIZATION II

HIGHER ORDER DIFFERENTIAL EQUATIONS

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

Numbering Boundary Nodes

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Multipoint Alternate Marking method for passive and hybrid performance monitoring

OpenMx Matrices and Operators

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Properties of Hexagonal Tile local and XYZ-local Series

Chem 104A, Fall 2016, Midterm 1 Key

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications

CS September 2018

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

TURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University

Designing A Concrete Arch Bridge

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Aquauno Video 6 Plus Page 1

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

APPLICATIONS OF THE LAPLACE-MELLIN INTEGRAL TRANSFORM TO DIFFERNTIAL EQUATIONS

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

Decimals DECIMALS.

Tangram Fractions Overview: Students will analyze standard and nonstandard

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

Construction 11: Book I, Proposition 42

Computational Biology, Phylogenetic Trees. Consensus methods

Fundamental Algorithms for System Modeling, Analysis, and Optimization

Instructions for Section 1

A comparison of routing sets for robust network design

Formal Concept Analysis

DETAIL B DETAIL A 7 8 APPLY PRODUCT ID LABEL SB838XXXX ADJ FOUR POST RACK SQUARE HOLE RAIL B REVISION

THE EFFECT OF SEED AND SOIL APPLIED SYSTEMIC INSECTICIDES ON APHIDS IN SORGHUM. Texas Agricultural Experiment Station, Nueces County, 2000


Section 10.4 Connectivity (up to paths and isomorphism, not including)

Problem solving by search

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

MA1506 Tutorial 2 Solutions. Question 1. (1a) 1 ) y x. e x. 1 exp (in general, Integrating factor is. ye dx. So ) (1b) e e. e c.

Research Scholar, Vinoba Bhave University, Hazaribag, Jharkhand

Polygons POLYGONS.

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

12 - M G P L Z - M9BW. Port type. Bore size ø12, ø16 20/25/32/40/50/ MPa 10 C to 60 C (With no condensation) 50 to 400 mm/s +1.

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Numbers and indices. 1.1 Fractions. GCSE C Example 1. Handy hint. Key point

0.1. Exercise 1: the distances between four points in a graph

Lecture 11 Waves in Periodic Potentials Today: Questions you should be able to address after today s lecture:

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

EE1000 Project 4 Digital Volt Meter

UNCORRECTED PAGE PROOFS

Citation Statistica Sinica, 2000, v. 10 n. 2, p

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

arxiv: v1 [cs.ds] 20 Feb 2008

Classification Spanning Correlated Data Streams

UNCORRECTED SAMPLE PAGES 4-1. Naming fractions KEY IDEAS. 1 Each shape represents ONE whole. a i ii. b i ii

Knowledge structures (Doignon & Falmagne, 1985, 1999) Parameter estimation in probabilistic knowledge structures with the pks package

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Transcription:

Worl Amy of Sin, Enginring n Thnology 49 9 Aptn Singl Smpling ln with fuzzy prmtr with Th sing of oisson Distriution Ezztllh Bloui Jmhnh,*, Bhrm Sghpour-Gilh, Gholmhossin Yri 3 h.d Stunt, Sin n Rsrh Brnh, Islmi Az nivrsity, Thrn, Irn. _ loui8 @ yhoo.om. Dprtmnt of Sttistis, Fulty of Bsi Sin, nivrsity of Mznrn Blosr, Irn Sghpour@umz..ir 3 Irn nivrsity of Sin n Thnology, Thrn, Irn, yri @iust.. ir Astrt--This purpos of this ppr is to prsnt th ptn singl smpling pln whn th frtion of nononforming itms is fuzzy numr n ing mol s on th fuzzy oisson istriution. W hv shown tht th oprting hrtristi (o) urvs of th pln is li n hving high n low ouns whos with pns on th miguity proportion prmtr in th lot whn tht smpl siz n ptn numrs is fi. Finlly w omplt isuss opinion y numril mpl. An thn w ompr th o ns of using of inomil with th o ns of using of oisson istriution. Kywors--Sttistil qulity ontrol, ptn singl smpling, fuzzy numr. S I. ITRODCTIO TATISTICA qulity ontrol (SQC) is n ffiint mtho of improving firm s pross qulity of proution. Smpling for ptn or rjtion lot is n importnt fil in SQC. Aptn singl smpling is on of th smpling mthos for ptn or rjtion whih is long with lssil ttriut qulity hrtristi. In iffrnt ptn smpling plns th frtion of ftiv itms, is onsir s risp vlu, ut in prti th frtion of ftiv itms vlu must now tly. Mny tims ths vlus r stimt or it is provi y primnt. Th vgunss prsnt in th vlu of p from prsonl jugmnt, primnt or stimtion my trt formlly with th hlp of fuzzy st thory. As nown, fuzzy st thory is powrful mthmtil tool for moling unrtin rsulting. In this sis fining th impris proportion prmtr is s fuzzy numr. With this finition, th numr of nononforming itms in th smpl hs inomil istriution with fuzzy prmtr. Howvr if fuzzy numr p is smll w n us th fuzzy poison istriution to pproimt vlus of th fuzzy inomil. Clssil ptn smpling plns hv n stui y mny rsrhrs. Thy r thoroughly lort y Shilling (98). Singl smpling y ttriuts with rl rquirmnts wr isuss y Oht n Ihihshi (988) ngw n Oht (99), Tmi, Kngw n Oht (99),n Grzgorzwsi(998,). Grzgrozwsi (,) lso onsir smpling pln y vrils with fuzzy rquirmnts. Smpling pln y ttriuts for vgu t wr onsir y Hrniwiz (99, 994). W provi som finition n prliminris of fuzzy sts thory n fuzzy proility in stion. In stion 3 th fuzzy proility of ptn of th lot, ws onsir roly, n its vlus in spil s ws omput. In stion 4, w l with o n of suh pln, with mpl. REIMIARIES AD DEFIITIOS rmtr p (proility of suss in h primnt) of th risp inomil istriution is nown tly, ut somtims w r not l to otin t som unrtinty in th vlu p n is to stimt from rnom smpl or from prt opinion. Th risp poison istriution hs on prmtr, whih w lso ssum is not nown tly. Dfinition: th fuzzy sust of rl lin IR, with th mmrship funtion : IR [,] is fuzzy numr if n only if () is norml () is fuzzy onv () is uppr smi ontinuous () supp ( ) is oun [3]. Dfinition: A tringulr fuzzy numr is fuzzy numr tht mmrship funtion fin y thr numr 3 whr th s of th tringl is th intrvl [, 3 ] n vrt is t = [3]. Dfinitoin3: Th -ut of fuzzy numr is non-fuzzy st fin s IR; ( ). Hn w, whr hv * Corrsponing uthor 7

Worl Amy of Sin, Enginring n Thnology 49 9 inf IR; ( ) sup IR; ( ) Dfinition4: Du to th unrtinty in th i s vlus w sustitut i, fuzzy numr, for h i n ssum tht < i < ll i. Thn X togthr with th i vlu is isrt fuzzy proility istriution. W writ for fuzzy n w hv ({ i }) i. t A,..., l} sust of X. Thn fin: l ( A)[ ] { i s} () i For, whr stns for th sttmnt n i i[ ], in, i this is our rstrit fuzzy i rithmti[]. Dfinition5: In m inpnnt Brnoulli primnt lt us ssum tht p, proility of suss in h primnt is not nown prisly n ns to stimt, or otin from prt opinion. So tht p vlu is unrtin n w sustitut p for p n q for q so tht thr is p p[] n q q[] with p q. ow lt ( r ) th fuzzy proility of r susss in m inpnnt trils of th primnt. nr our rstrit fuzzy lgr w otin r r mr ( r)[ ] { Cm p q s} () For, whr now S is th sttmnt, p p[ ], q q [ ], p q. If ( r)[ ] [ r ( ), ( )] thn r r r mr r ( ) min{ C p q s} m r r mr r ( ) m{ C p q s m n } n if [, ] proility of susss so tht fuzzy, thn m ([, ] { C p q s} (3) if ([, ] [ ([, ], ([, ]] thn: m ([, ] min Cm p q s n m ([, ] m Cm p q s m th fuzzy Whr S is th sm with pst s[]. Dfinition 6: lt rnom vril hving th poison mss funtion. If () stns for th proility tht X,thn ( ) (4) For,,,... n prmtr. ow sustitut fuzzy numr for to prou th fuzzy poison proility mss funtion. t ( ) to th fuzzy proility tht X. Thn w fin -ut of this fuzzy numr s ( ) For ll, (5). t X rnom vril hving th fuzzy inomil istriution n p in th finition 4 smll. Whih mns tht ll p p r suffiintly smll. Thn, using th fuzzy poison pproimtion[]., np!. ACCETACE SIGE SAMIG A WITH FZZY ARAMETER Suppos tht w wnt to inspt lot with lrg siz of. First t rnomiz smpl of siz n from th lot, thn inspt ll itms in th smpl, n th numr of ftiv itms ( ) will ount own. If th numr of osrvtion ftiv itms is lss thn or qul to ptn numr, thn th lot will pt, othrwis th lot rjtion []. If th siz of lot lrg, th rnom vril hs inomil istriution with prmtr n n p in whih p inits th lot s ftiv itms. Howvr if th siz of smpl lrg n p is smll thn th rnom vril hs oisson pproimtion istriution with np. So, th proility for th numr of ftiv itms to tly qul to is: np ( np ) ( ) (7)! n th proility for ptn of th lot ( p ) is: (6) 8

Worl Amy of Sin, Enginring n Thnology 49 9 p np ( np) ( ) (8)! Suppos tht w wnt to inspt lot with th lrg siz of, suh tht th proportion of mg itms is not nown prisly. So w rprsnt this prmtr with fuzzy numr p s follows: p (,, ), [], 3 p p q q [], p q. A singl smpling pln with fuzzy prmtr if fin y th smpl siz n,n ptn numr,n if th numr of osrvtion ftiv prout is lss thn or qul to,th lot will ptn. If is lrg numr, thn th numr of ftiv itms in this smpl () hs fuzzy inomil istriution, n if p is smll, thn rnom vril hs fuzzy oisson istriution with prmtr n p []. So th fuzzy proility for th numr of ftiv itms in smpl siz tht is tly qul to is: ( ftiv ), (9) min np,! m! np n fuzzy ptn proility is s follows: p,! min m!! (), Empl: Th prin of Mznrn Ksht V Snt Shoml Compl mngmnt shows tht hlf prnt r ill-p. Mjor ustomrs hoos n inspt 6 itms of this prout vill in lrg stor to uy thm. If th numr of nononforming itms in this smpl quls zro or on, th ustomr will uy ll prouts in th stor. If th numr of nononforming inrss, th ustomr will not uy thm. Bus of th proportion of ftiv prouts hs plin linguistilly, w n onsir tht s fuzzy numr p (,.5,. ). Thrfor, th proility purhsing will sri in th following: 6,, p,.5,.,,.3,.6,.3,.6. ( ) n 3 p Aoring to tht th ( ) rsing, thn: (.6.3 ).3 (.6.3 ),(.3 ) p w otin p.878, unr tht is, it is t tht for vry lots in suh pross, 88 to lots will pt. lph.9.8.7.6.5.4.3...86.88.9.9.94.96.98 fuzzy proility of ptn Fig. fuzzy proility of ptn with p (,.5,.). OC-BAD WITH FZZY ARAMETER Oprting hrtristi urv is on of th importnt ritri in th smpling pln. By this urv, on oul trmin th proility of ptn or rjtion of lot hving som spifi ftiv itms []. th o urv rprsnts th prformn of th ptn smpling plns y plotting th proility of ptn lot vrsus its proution qulity, whih is prss y th proportion of nononforming itms in th lot [4]. O urv is in sltion of plns tht r fftiv in ruing ris n inits isriminting powr of th pln. Suppos tht th vnt A is th vnt of ptn of lot. Thn th fuzzy proility of ptn lot in trms of fuzzy frtion of ftiv itms woul s n with uppr n lowr ouns. Th unrtinty gr of proportion prmtr is on of th ftors tht nwith pns on tht. Th lss unrtinty vlu rsults in lss nwith, n if proportion prmtr gts risp vlu, lowr n uppr ouns will om qul, whih tht o urv is in lssi stt. Knowing th unrtinty gr of proportion prmtr (givn,, 3 ) n vrition of its position on horizontl is, w hv iffrnt fuzzy numr 9

Worl Amy of Sin, Enginring n Thnology 49 9 ( p ) n hn w will hv iffrnt proportion ( p ) whih th o ns r plott in trms of it. To hiv this im w onsir th strutur of p s follows: p = (, +, 3 + ), p p[], qq [], p q n n p ( n, n n, n3 n) Figur shows th o n of th mpl. This figur rprsnts tht whn th pross qulity rs from vry goo stt to mort stt, thn th o n will wir..9.8 Whih with vrition of in th omin of [,- 3 ], th o n, is plott oring to th lultion of follow fuzzy proility: p [ ] [ p( ), p( )] [, 3 ( 3 ) ], n n, n n3 n( 3 ) p ( A), () fuzzy proility of ptn.7.6.5.4.3.. =, n=6...3.4.5.6.7.8.9. Fig. o n for singl smpling pln with fuzzy prmtr of, n 6 min m A! A! In Ksht V Snt Compl ompny rlt to mpl w h,.5,.thn w hv p 3 n, n.n,. 99 () ( ),( ( n.n) ( n.n) Tl: fuzzy proility of ptn p p,.,( n) n.878,..,..666,.878..,.3.468,.666.3.3,.4.384,.468.4.4,.5.99,.384.5.5,.6.57,.99, n 6 Empl : suppos tht, n in mpl.5,., p,. n thn w hv 3,.,. 99 thrfor o urv in trms fuzzy Binomil istriution n fuzzy oisson istriution is s follows: p ( p) p p (.99 ),( ) (. ), pp fuzzy proility ptn.9.8.7.6.5.4.3.. inomil inomil oisson oissn..4.6.8...4.6.8. Fig.3 o n for singl smpling pln with fuzzy prmtr of, n Figur 3 n tl show tht thr two ns pproimt. Finlly it n si tht o n with using from fuzzy oisson istriution optiml pproimnt for o n with using from fuzzy inomil istriution. With rgr this, suh pln n sign s on o fuzzy oisson istriution.

Worl Amy of Sin, Enginring n Thnology 49 9 Tl: fuzzy proility of ptn, n p pp.879,.887,..6676,.879.673,.887..5437,.6676.5488,.673.3.44,.5437.4493,.5488 Figur 4 shows two o ns for n=, n=4. Initing tht o ns r onv with zro ptn numr n this ls to qui rution of fuzzy proility of ptn for proportion of ftiv itms with smll fuzzy numrs, n it will mor th inrs of n. [4] B..M. Dut,.M. Sriv, An optimiztion s pproh for signing ttriut ptn smpling plns, Int. journl of qulity & rliility mngmnt.vol. 5 no. 8,8. [5]. Grzgorzwsi(988) A soft sign of ptn smpling y ttriuts, in: proings of th VIth intrntionl worshop on intllignt sttistil qulity ontrol Wurzurg, Sptmr 4-6,.9-38. [6]. Grzgorzwsi ( ) Aptn smpling plns y ttriuts with fuzzy riss n qulity lvls, in: Frontirs in frontirs in sttistil qulity ontrol. Vol. 6, Es. Wilrih. Th. nz H. J. Springr, Hilrg,. 36-46. [7]. Grzgorzwsi () A soft sign of ptn smpling plns y vrils, in: thnologis for ontruting intllignt systms, Es, springr, vol.. pp. 75-86. [8] O. Hryniwisz (99) sttistil ptn smpling with unrtin informtion from smpl n fuzzy qulity ritri woring ppr of SRI AS, Wrsow, (in polish). [9] A. Kngw,H. Oht (99), A sign for singl smpling ttriut pln s on fuzzy st thory, fuzzy sts n systms, 37. 73-8. [] D. C. Montgomry (99), introution to sttistil qulity ontrol, wily w yor. [] H. Oht,H. Ihihshi (998), Dtrmintion of singl-smpling ttriut plns s on mmrship funtion, Int. J. ro, Rs 6, 477-485. [] J.. Romu, nrstning inomil squntil tsting, R strt, Volum, umr. [3] E.G. Shiling (98), ptn smpling qulity ontrol, Dr, w yor. [4] F. Tmi, A. Kngw, Oht H. (99), A fuzzy sign of smpling insption plns y ttriuts, Jpns journl of fuzzy thory n systms, 3, 35-37..9 fuzzy proility ptn.8.7.6.5.4.3 n=,=.. n=4, =..4.6.8...4.6 Fig.4 o n for singl smpling pln with fuzzy prmtr of n, ; n 4, V. COCSIO In th prsnt ppr w hv propos mtho for signing ptn singl smpling plns with fuzzy qulity hrtristi with using fuzzy oisson istriution. Ths plns r wll fin sin if th frtion of ftiv itms is risp thy ru to lssil plns. As it ws shown tht o urvs of th pln is li n hving high n low ouns. W h shown tht in this pln o ns r onv with zro ptn numr. REFERECES [] J. J. Buly (3) fuzzy proility: nw pproh n pplition, physi-vlg, Hilrg,Grmny. [] J.J. Buly (6) fuzzy proility n sttistis, springr-vrlg Brlin Hilrg. [3] D. Duis, H. r (978) Oprtions of fuzzy numr, Int. J. syst.