Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints
The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some...
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Tagungsbericht |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | 206 |
|---|---|
| container_issue | |
| container_start_page | 202 |
| container_title | |
| container_volume | 4 |
| creator | Bao, Z.W. Cui, L.R. Wei Gao |
| description | The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some inspection cost, the true state of the system can be obtained by sequentially inspecting its components. Our aim is to find the optimal inspection strategies that can minimize the expected inspection cost of complex systems which are subject to block-chain precedence constraints, such as series, parallel or -out-of- system, and the optimal inspection rules of the more complex systems can be obtained by these simple systems. |
| doi_str_mv | 10.1109/ICNC.2008.270 |
| format | Conference Proceeding |
| fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_4667276</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4667276</ieee_id><sourcerecordid>4667276</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-9c15b9d0edb9294562403c6ef8fb425427d5fc680091c0ea4c6bca6cad3839cd3</originalsourceid><addsrcrecordid>eNotT8tKw0AUHdCCtXbpys38QOqdd-5Sg49CsUJ0XZLJDaamScxMwf69EV2dw3nBYexawEoIwNt19pKtJEC6kg7O2BJdCs6iUQo0nrO5FMYlaIyZscvfGIIWqbxgyxD2AKCEcw5wznbbITaHouU5fR2pi81E110YyMem7wLva571h6Glb56fQqRD4Pmx3E82jz2_b3v_mWQfRdPx15E8VdR5mhpdiOMkxnDFZnXRBlr-44K9Pz68Zc_JZvu0zu42SSOciQl6YUqsgKoSJWpjpQblLdVpXWpptHSVqb1NAVB4oEJ7W_rC-qJSqUJfqQW7-dttiGg3jNOn8bTT1jrprPoBjW5Xcw</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Bao, Z.W. ; Cui, L.R. ; Wei Gao</creator><creatorcontrib>Bao, Z.W. ; Cui, L.R. ; Wei Gao</creatorcontrib><description>The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some inspection cost, the true state of the system can be obtained by sequentially inspecting its components. Our aim is to find the optimal inspection strategies that can minimize the expected inspection cost of complex systems which are subject to block-chain precedence constraints, such as series, parallel or -out-of- system, and the optimal inspection rules of the more complex systems can be obtained by these simple systems.</description><identifier>ISSN: 2157-9555</identifier><identifier>ISBN: 9780769533049</identifier><identifier>ISBN: 0769533043</identifier><identifier>DOI: 10.1109/ICNC.2008.270</identifier><identifier>LCCN: 2008904182</identifier><language>eng</language><publisher>IEEE</publisher><subject>Automotive engineering ; block-chain precedence constraints ; Cost function ; Inspection ; k-out-of-n system ; optimal sequencing ; Paper technology ; Programmable logic arrays ; sequential testing ; System testing ; Technology management ; Vehicles</subject><ispartof>2008 Fourth International Conference on Natural Computation, 2008, Vol.4, p.202-206</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4667276$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4667276$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Bao, Z.W.</creatorcontrib><creatorcontrib>Cui, L.R.</creatorcontrib><creatorcontrib>Wei Gao</creatorcontrib><title>Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints</title><title>2008 Fourth International Conference on Natural Computation</title><addtitle>ICNC</addtitle><description>The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some inspection cost, the true state of the system can be obtained by sequentially inspecting its components. Our aim is to find the optimal inspection strategies that can minimize the expected inspection cost of complex systems which are subject to block-chain precedence constraints, such as series, parallel or -out-of- system, and the optimal inspection rules of the more complex systems can be obtained by these simple systems.</description><subject>Automotive engineering</subject><subject>block-chain precedence constraints</subject><subject>Cost function</subject><subject>Inspection</subject><subject>k-out-of-n system</subject><subject>optimal sequencing</subject><subject>Paper technology</subject><subject>Programmable logic arrays</subject><subject>sequential testing</subject><subject>System testing</subject><subject>Technology management</subject><subject>Vehicles</subject><issn>2157-9555</issn><isbn>9780769533049</isbn><isbn>0769533043</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2008</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotT8tKw0AUHdCCtXbpys38QOqdd-5Sg49CsUJ0XZLJDaamScxMwf69EV2dw3nBYexawEoIwNt19pKtJEC6kg7O2BJdCs6iUQo0nrO5FMYlaIyZscvfGIIWqbxgyxD2AKCEcw5wznbbITaHouU5fR2pi81E110YyMem7wLva571h6Glb56fQqRD4Pmx3E82jz2_b3v_mWQfRdPx15E8VdR5mhpdiOMkxnDFZnXRBlr-44K9Pz68Zc_JZvu0zu42SSOciQl6YUqsgKoSJWpjpQblLdVpXWpptHSVqb1NAVB4oEJ7W_rC-qJSqUJfqQW7-dttiGg3jNOn8bTT1jrprPoBjW5Xcw</recordid><startdate>200810</startdate><enddate>200810</enddate><creator>Bao, Z.W.</creator><creator>Cui, L.R.</creator><creator>Wei Gao</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>200810</creationdate><title>Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints</title><author>Bao, Z.W. ; Cui, L.R. ; Wei Gao</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-9c15b9d0edb9294562403c6ef8fb425427d5fc680091c0ea4c6bca6cad3839cd3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2008</creationdate><topic>Automotive engineering</topic><topic>block-chain precedence constraints</topic><topic>Cost function</topic><topic>Inspection</topic><topic>k-out-of-n system</topic><topic>optimal sequencing</topic><topic>Paper technology</topic><topic>Programmable logic arrays</topic><topic>sequential testing</topic><topic>System testing</topic><topic>Technology management</topic><topic>Vehicles</topic><toplevel>online_resources</toplevel><creatorcontrib>Bao, Z.W.</creatorcontrib><creatorcontrib>Cui, L.R.</creatorcontrib><creatorcontrib>Wei Gao</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Bao, Z.W.</au><au>Cui, L.R.</au><au>Wei Gao</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints</atitle><btitle>2008 Fourth International Conference on Natural Computation</btitle><stitle>ICNC</stitle><date>2008-10</date><risdate>2008</risdate><volume>4</volume><spage>202</spage><epage>206</epage><pages>202-206</pages><issn>2157-9555</issn><isbn>9780769533049</isbn><isbn>0769533043</isbn><abstract>The paper concerns the optimal inspection strategies of complex systems subject to block-chain precedence constraints. Supposing a system consists of independent components, and each of which has a known probability of working. The state of each component can be determined by inspecting it for some inspection cost, the true state of the system can be obtained by sequentially inspecting its components. Our aim is to find the optimal inspection strategies that can minimize the expected inspection cost of complex systems which are subject to block-chain precedence constraints, such as series, parallel or -out-of- system, and the optimal inspection rules of the more complex systems can be obtained by these simple systems.</abstract><pub>IEEE</pub><doi>10.1109/ICNC.2008.270</doi><tpages>5</tpages></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | ISSN: 2157-9555 |
| ispartof | 2008 Fourth International Conference on Natural Computation, 2008, Vol.4, p.202-206 |
| issn | 2157-9555 |
| language | eng |
| recordid | cdi_ieee_primary_4667276 |
| source | IEEE Electronic Library (IEL) Conference Proceedings |
| subjects | Automotive engineering block-chain precedence constraints Cost function Inspection k-out-of-n system optimal sequencing Paper technology Programmable logic arrays sequential testing System testing Technology management Vehicles |
| title | Optimal Sequential Inspections of Complex Systems Subject to Block-Chain Precedence Constraints |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T17%3A47%3A26IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Optimal%20Sequential%20Inspections%20of%20Complex%20Systems%20Subject%20to%20Block-Chain%20Precedence%20Constraints&rft.btitle=2008%20Fourth%20International%20Conference%20on%20Natural%20Computation&rft.au=Bao,%20Z.W.&rft.date=2008-10&rft.volume=4&rft.spage=202&rft.epage=206&rft.pages=202-206&rft.issn=2157-9555&rft.isbn=9780769533049&rft.isbn_list=0769533043&rft_id=info:doi/10.1109/ICNC.2008.270&rft_dat=%3Cieee_6IE%3E4667276%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4667276&rfr_iscdi=true |