03480nam 2200625Ia 450 991081478530332120200520144314.01-280-51531-797866105153181-84544-391-8(CKB)1000000000006691(EBL)289859(OCoLC)70721908(SSID)ssj0000466156(PQKBManifestationID)11324280(PQKBTitleCode)TC0000466156(PQKBWorkID)10458331(PQKB)11199457(MiAaPQ)EBC289859(Au-PeEL)EBL289859(CaPaEBR)ebr10058596(CaONFJC)MIL51531(EXLCZ)99100000000000669120040414d2004 uy 0engur|n|---|||||txtccrReconstructability analysis theory and applications /Martin Zwick1st ed.Bradford, West Yorkshire, England Emerald Group Publishing20041 online resource (212 p.)Kybernetes. no. 5/6 ;33Description based upon print version of record.0-86176-963-5 CONTENTS; EDITORIAL ADVISORY BOARD; Abstracts and keywords; Preface; Editorial; An overview of reconstructability analysis; Modified reconstructability analysis for many-valued functions and relations; Reversible modified reconstructability analysis of Boolean circuits and its quantum computation; A comparison of modified reconstructability analysis and Ashenhurst-Curtis decomposition of Boolean functions; Multi-level decomposition of probabilistic relations; The k-systems glitch: granulation of predictor variables; Directed extended dependency analysis for data miningInstant modelling and data-knowledge processing by reconstructability analysisApplication of reconstructability analysis in system structure; A software architecture for reconstructability analysis; Forecast entropy; The forecast model of system reconstructability analysis; Construction of main sequence of gene based on "method of factor reconstruction analysis"; Reconstructability analysis with Fourier transforms; State-based reconstructability analysis; Reconstructability analysis detection of optimal gene order in genetic algorithms; Book reviews; Book reports; AnnouncementsSpecial announcementsA novel many-valued decomposition within the framework of lossless reconstructability analysis (RA) is presented. In previous work, modified reconstructability analysis (MRA) was applied to Boolean functions, where it was shown that most Boolean functions not decomposable using conventional reconstructability analysis (CRA) are decomposable using MRA. Also, it was previously shown that whenever decomposition exists in both MRA and CRA, MRA yields simpler or equal complexity decompositions. In this paper, MRA is extended to many-valued logic functions, and logic structures that correspond to suKybernetes ;v. 33, no. 5/6.CyberneticsSystems engineeringCybernetics.Systems engineering.003003.5Zwick Martin1202587MiAaPQMiAaPQMiAaPQBOOK9910814785303321Reconstructability analysis4075287UNINA