{"title":"Fine-Grained Complexity of Constraint Satisfaction Problems through Partial Polymorphisms: A Survey","authors":"Miguel Couceiro, L. Haddad, Victor Lagerkvist","doi":"10.1109/ISMVL.2019.00037","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00037","url":null,"abstract":"Constraint satisfaction problems (CSPs) are combinatorial problems with strong ties to universal algebra and clone theory. The recently proved CSP dichotomy theorem states that finite-domain CSPs are always either tractable or NP-complete. However, among the intractable cases there is a seemingly large variance in complexity, which cannot be explained by the classical algebraic approach using polymorphisms. In this contribution we will survey an alternative approach based on partial polymorphisms, which is useful for studying the fine-grained complexity of NP-complete CSPs. Moreover, we will state some challenging open problems in the research field.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114428606","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":"Message from the Program Chair","authors":"H. Suhartanto","doi":"10.1109/ismvl.2019.00006","DOIUrl":"https://doi.org/10.1109/ismvl.2019.00006","url":null,"abstract":"Welcome to the 9th International Conference on High Performance Computing. The conference features 10 contributed paper sessions with 57 papers, 2 invited sessions with 9 papers, an industrial track session, a poster session, 5 keynote addresses, 10 tutorials, and 5 workshops. The 57 contributed papers are from 12 countries. The 10 contributed paper sessions were put together by a distinguished and international program committee that comprised 56 committee members and 5 program vice-chairs: Oscar Ibarra (Algorithms), Vipin Kumar (Applications), Michel Cosnard (Architecture), Mani Srivastava (Communication Networks), and Francis Lau (Systems Software). Following a rigorous review process, the program committee selected 57 of the 145 papers that were submitted in response to the call for papers for presentation at the conference and inclusion in the conference proceedings. The 2 invited sessions were organized by Vijay Kumar (Biocomputation) and Viktor Prasanna (Embedded Systems), the industrial track by Sudheendra Hangal, the poster session by Paul Roe and Rajkumar Buyya, the keynote addresses by Cauligi Raghavendra, the tutorials by Srinivas Aluru, and the workshops by C.P. Ravikumar. I wish to thank the entire program committee and especially the program vice-chairs for the excellent job they did in the review of the 145 submitted papers and subsequent selection of papers. Thanks also go to those who organized the remaining sessions, mentioned above, that make up the conference as well as to those who performed the administrative functions that are essential to the success of this conference. Finally, I thank Viktor Prasanna for giving me the opportunity to serve as program chair of this conference.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"500 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132235093","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":"2019 IEEE 49th International Symposium on Multiple-Valued Logic","authors":"","doi":"10.1109/ismvl.2019.00001","DOIUrl":"https://doi.org/10.1109/ismvl.2019.00001","url":null,"abstract":"","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133352258","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":"Entanglement in Higher-Radix Quantum Systems","authors":"Kaitlin N. Smith, M. Thornton","doi":"10.1109/ISMVL.2019.00028","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00028","url":null,"abstract":"Entanglement is an important phenomenon that enables quantum information processing algorithms and quantum communications protocols. Although entangled quantum states are often described in radix-2, higher-radix qudits can become entangled as well. In this work, we both introduce partial entanglement, a concept that does not exist for radix-2 quantum systems, and differentiate between partial and maximal entanglement within non-binary quantum information processing systems. We also develop and present higher-radix maximal entanglement generator circuits that are analogous to the well-known Bell state generator for binary quantum systems. Because higher-dimensioned qudits can be subjected to entangling processes that result in either partially or maximally entangled states, we demonstrate how higher-radix qudit circuits can be composed to generate these varying degrees of partial quantum entanglement. Theoretical results are provided for the general case where the radix is greater than two, and specific results based on a nair of radix-4 audits are described.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124518560","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}
Alwin Zulehner, Philipp Niemann, R. Drechsler, R. Wille
{"title":"One Additional Qubit is Enough: Encoded Embeddings for Boolean Components in Quantum Circuits","authors":"Alwin Zulehner, Philipp Niemann, R. Drechsler, R. Wille","doi":"10.1109/ISMVL.2019.00009","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00009","url":null,"abstract":"Research on quantum computing has recently gained significant momentum since first physical devices became available. Many quantum algorithms make use of so-called oracles that implement Boolean functions and are queried with highly superposed input states in order to evaluate the implemented Boolean function for many different input patterns in parallel. To simplify or enable a realization of these oracles in quantum logic in the first place, the Boolean reversible functions to be realized usually need to be broken down into several non-reversible sub-functions. However, since quantum logic is inherently reversible, these sub-functions have to be realized in a reversible fashion by adding further qubits in order to make the output patterns distinguishable (a process that is also known as embedding). This usually results in a significant increase of the qubits required in total. In this work, we show how this overhead can be significantly reduced by utilizing coding. More precisely, we prove that one additional qubit is always enough to embed any non-reversible function into a reversible one by using a variable-length encoding of the output patterns. Moreover, we characterize those functions that do not require an additional qubit at all. The made observations show that coding often allows one to undercut the usually considered minimum of additional qubits in sub-functions of oracles by far.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128137925","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":"Synthesis of Nondeterministic Behavior in Recombinase-Based Genetic Circuits","authors":"Zi-Jun Lin, Wei-Chih Huang, J. H. Jiang","doi":"10.1109/ISMVL.2019.00042","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00042","url":null,"abstract":"Recombinases have been exploited in synthetic biology as a technique to engineer genetic circuits for various application tasks. Prior works mostly studied the construction of combinational or sequential circuits with deterministic behavior. Nevertheless, nondeterminism is ubiquitous in biochemical systems and is an essential resource to enable various biochemical processes, such as cell differentiation and pattern formation. In this work, we study the synthesis of nondeterministic recombinase-based genetics circuits specified by a Boolean relation. We develop methods to create nondeterminism and synthesize the intended nondeterministic circuit. The synthesis methodology is experimented to evaluate the effectiveness of DNA sequence length reduction in the constructed genetic circuits.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128405682","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 Inclusion Structure of Boolean Weak Bases","authors":"Victor Lagerkvist, Biman Roy","doi":"10.1109/ISMVL.2019.00014","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00014","url":null,"abstract":"Strong partial clones are composition closed sets of partial operations containing all partial projections, characterizable as partial polymorphisms of sets of relations <tex>$Gamma(mathrm{pPol}(Gamma))$</tex>. If <tex>$mathcal{C}$</tex> is a clone it is known that the set of all strong partial clones whose total component equals <tex>$mathcal{C}$</tex>, has a greatest element <tex>$mathrm{pPo}1(Gamma_{w})$</tex>, where <tex>$Gamma_{w}$</tex> is called a weak base. Weak bases have seen applications in computer science due to their usefulness for proving complexity classifications for constraint satisfaction related problems. In this paper we completely describe the inclusion structure between <tex>$mathrm{pPol}(Gamma_{w}), mathrm{pPol}(Delta_{w})$</tex> for all Boolean weak bases <tex>$Gamma_{w}$</tex> and <tex>$Delta_{w}$</tex>.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"86 9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127991667","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":"Noise Convolutional Neural Networks and FPGA Implementation","authors":"Atsuki Munakata, Hiroki Nakahara, Shimpei Sato","doi":"10.1109/ISMVL.2019.00023","DOIUrl":"https://doi.org/10.1109/ISMVL.2019.00023","url":null,"abstract":"Convolutional neural networks (CNNs) are primarily a cascaded set of pattern recognition filters, which are trained by big data. It enables us to solve complex problems of computer vision applications. A conventional CNN requires numerous parameters (weights) and computations. In this study, we propose a noise CNN (NCNN), which consists of conventional convolutional operation in the former layer and a noise convolutional operation in the latter layers. Noise convolution can be realized by pointwise convolution with the addition of noise to retain recognition accuracy for a large kernel size convolution layer. Using data obtained from theoretical analysis, we apply various convolution layers including a conventional convolution in the former layer and a point-wise convolution with noise in the latter one. Further, we propose an architecture for a noise convolution operation with a pseudo-random circuit as the noise generator. We implement the proposed NCNN in the Xilinx Inc. ZCU104 FPGA evaluation board. The experimental results show that the proposed NCNN can preserve recognition accuracy and achieve high performance.","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"38 31","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"113993720","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":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL), Fredericton, NB, Canada, May 21-23, 2019","authors":"","doi":"10.1109/ismvl.2019.00002","DOIUrl":"https://doi.org/10.1109/ismvl.2019.00002","url":null,"abstract":"","PeriodicalId":329986,"journal":{"name":"2019 IEEE 49th International Symposium on Multiple-Valued Logic (ISMVL)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129882918","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}