{"title":"Feature Selection Ensemble","authors":"Q. Shen, R. Diao, P. Su","doi":"10.29007/rlxq","DOIUrl":"https://doi.org/10.29007/rlxq","url":null,"abstract":"Many strategies have been exploited for the task of feature selection, in an effort to identify more compact and better quality feature subsets. Such techniques typically involve the use of an individual feature significance evaluation, or a measurement of feature subset consistency, that work together with a search algorithm in order to determine a quality subset. Feature selection ensemble aims to combine the outputs of multiple feature selectors, thereby producing a more robust result for the subsequent classifier learning tasks. In this paper, three novel implementations of the feature selection ensemble concept are introduced, generalising the ensemble approach so that it can be used in conjunction with many subset evaluation techniques, and search algorithms. A recently developed heuristic algorithm: harmony search is employed to demonstrate the approaches. Results of experimental comparative studies are reported in order to highlight the benefits of the present work. The paper ends with a proposal to extend the application of feature selection ensemble to aiding the development of biped robots (inspired by the authors’ involvement in the joint celebration of Olympic and the centenary of the birth of Alan Turing).","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129032538","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Vector Addition Systems Reachability Problem (A Simpler Solution)","authors":"Jérôme Leroux","doi":"10.29007/bnx2","DOIUrl":"https://doi.org/10.29007/bnx2","url":null,"abstract":"The reachability problem for Vector Addition Systems (VASs) is a central problem of net theory. The general problem is known to be decidable by algorithms based on the classical Kosaraju-Lambert-Mayr-Sacerdote-Tenney decomposition (KLMTS decomposition). Recently from this decomposition, we deduced that a final configuration is not reachable from an initial one if and only if there exists a Presburger inductive invariant that contains the initial configuration but not the final one. Since we can decide if a Preburger formula denotes an inductive invariant, we deduce from this result that there exist checkable certificates of non-reachability in the Presburger arithmetic. In particular, there exists a simple algorithm for deciding the general VAS reachability problem based on two semi-algorithms. A first one that tries to prove the reachability by enumerating finite sequences of actions and a second one that tries to prove the non-reachability by enumerating Presburger formulas. In another recent paper we provided the first proof of the VAS reachability problem that is not based on the KLMST decomposition. The proof is based on the notion of production relations that directly proves the existence of Presburger inductive invariants. In this paper we propose new intermediate results that dramatically simplify this last proof.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130517107","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Note on Turing's Three Pioneering Initiatives and on Their Interplays","authors":"J. Kelemen","doi":"10.29007/r4xx","DOIUrl":"https://doi.org/10.29007/r4xx","url":null,"abstract":"The purpose of this article is to remind three fundamental contributions by A. M. Turing to three important fields of contemporary science and engineering (theory of computation, artificial intelligence, and biocomputing), and to emphasize the connections between them. The article reminds and formulates resp., also three hypotheses related to the three initiatives and discuss in short their mutual interrelatedness.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"13 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120894326","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"What kind of machine is the mind?","authors":"Joscha Bach, Mario Verdicchio","doi":"10.29007/k6f4","DOIUrl":"https://doi.org/10.29007/k6f4","url":null,"abstract":"Many computational modeling approaches of the mind seem to be characterized by an implicit strong physicalism, which frequently leads to confusion in philosophy of AI. This work aims at pointing out some fundamental aspects of this problem, both with respect to the relation between epistemological computationalism and physical realization, and the view of symbol manipulation as constrained computation.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127904365","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The Info-Computation Turn in Physics","authors":"Israel Belfer","doi":"10.29007/b3r2","DOIUrl":"https://doi.org/10.29007/b3r2","url":null,"abstract":"Modern Computation and Information theories have had significant impact on science in the 20th century - in theory and application. This influence is tracked (through a generalized, Information-laden scientific Style of Reasoning denoting the Information-theoretical and Computational turn in science), with a focus on the information processing and transfer metaphors and descriptive tools prevalent in current physics. Implementation of Information-Theoretical concepts produces such mathematical physical developments as Black-Hole Thermodynamics (BHTD) and the Black-Hole War. The treatment of physical systems as information processing systems drives such branches of physics as Quantum Information Theory (QIT). The common Informational basis of computation and communication brings about a foundational shift in scientific reasoning with deep – potentially problematic as well as intriguing – philosophical ramifications. Models of computation and of physics","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"216 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126988139","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"The computing power of Turing machine based on quantum logic","authors":"Yun Shang, Xian Lu, R. Lu","doi":"10.29007/k8cb","DOIUrl":"https://doi.org/10.29007/k8cb","url":null,"abstract":"Super-Turing computational power has been invoked by models of computation that make use of new physical principles or of different underlying logic of computation. Recently, it has been observed that Turing machines based on quantum logic can solve undecidable problems. In this paper we will give recursion-theoretical characterization of the computational power of this kind of quantum Turing machines. In detail, for the unsharp case, it is proved that Σ1 ∪ Π1 ⊆ Ld (E ,Σ)(Lw(E ,Σ)) ⊆ Π2 when the truth value lattice is locally finite and the operation ∧ is computable, where Ld (E ,Σ)(Lw(E ,Σ))denotes the class of quantum language accepted by these Turing machine in depth-first model (respectively, width-first model); for the sharp case, we can obtain similar results for usual orthomodular lattices.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134241349","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A Unified View of Induction Reasoning for First-Order Logic","authors":"Sorin Stratulat","doi":"10.29007/nsx4","DOIUrl":"https://doi.org/10.29007/nsx4","url":null,"abstract":"Induction is a powerful proof technique adapted to reason on sets with an unbounded number of elements. In a first-order setting, two different methods are distinguished: the conventional induction, based on explicit induction schemas, and the implicit induction, based on reductive procedures. We propose a new cycle-based induction method that keeps their best features, i.e., performs local and non-reductive reasoning, and naturally fits for mutual and lazy induction. The heart of the method is a proof strategy that identifies in the proof script the subset of formulas contributing to validate the application of induction hypotheses. The conventional and implicit induction are particular cases of our method.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131834244","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Logic, Probability, and Privacy: A Framework for Specifying Privacy Requirements","authors":"T. Hsu, C. Liau, Da-Wei Wang","doi":"10.29007/xs4z","DOIUrl":"https://doi.org/10.29007/xs4z","url":null,"abstract":"In this paper, we propose a probabilistic hybrid logic for the specification of data privacy requirements. The proposed logic is a combination of quantitative uncertainty logic and basic hybrid logic with a satisfaction operator. We show that it is expressive enough for the specification of many well-known data privacy requirements, such as k-anonymity, l-diversity and its precursor logical safety, t-closeness, and δ-disclosure privacy. The main contribution of the work is twofold. On one hand, the logic provides a common ground to express and compare existing privacy criteria. On the other hand, the uniform framework can meet the specification needs of combining new criteria as well as existing ones.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124166746","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On the Mathematical Boundaries of Communication with Zero-Capacity Quantum Channels","authors":"L. Gyongyosi, S. Imre","doi":"10.29007/7h1q","DOIUrl":"https://doi.org/10.29007/7h1q","url":null,"abstract":"In the first decade of the 21st century, many revolutionary properties of quantum channels were discovered. These phenomena are purely quantum mechanical and completely unimaginable in classical systems. Recently, the most important discovery in Quantum Information Theory was the possibility of transmitting quantum information over zerocapacity quantum channels. In this work we prove that the possibility of superactivation of quantum channel capacities is determined by the mathematical properties of the quantum relative entropy function.","PeriodicalId":224408,"journal":{"name":"Turing-100","volume":"93 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123846385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
