Results 11 to 20 of about 19,430 (158)

Generative Models for Crystalline Materials. [PDF]

Adv Mater
Generative machine learning models are increasingly used in crystalline materials design. This review outlines major generative approaches and assesses their strengths and limitations. It also examines how generative models can be adapted to practical applications, discusses key experimental considerations for evaluating generated structures, and ...
Metni H, Ruple L, Walters LN, Torresi L, Teufel J, Schopmans H, Östreicher J, Zhang Y, Neubert M, Koide Y, Steiner K, Link P, Bär L, Petrova M, Ceder G, Friederich P.   +15 more
europepmc   +2 more sources

Entanglement-assisted quantum low-density parity-check codes [PDF]

, 2010
This paper develops a general method for constructing entanglement-assisted quantum low-density parity-check (LDPC) codes, which is based on combinatorial design theory.
C. J. Colbourn, C. J. Colbourn, D. J. C. MacKay, D. J. C. MacKay, D. Poulin, David Clark, E. F. Assmus, I. Devetak, M. Hagiwara, M. Hall, Maarten De Boeck, N. Hamada, N. Hamada, P. Dembowski, Peter Vandendriessche, R. G. Gallager, R. Graham, S. A. Aly, S. J. Johnson, S. J. Johnson, T. Beth, T. Camara, T. P. Kirkman, V. D. Tonchev, Vladimir D. Tonchev, Yuichiro Fujiwara   +25 more
core   +4 more sources

Rational numbers with purely periodic $\beta$-expansion [PDF]

, 2010
We study real numbers $\beta$ with the curious property that the $\beta$-expansion of all sufficiently small positive rational numbers is purely periodic.
Adamczewski, Boris, Frougny, Christiane, Siegel, Anne, Steiner, Wolfgang   +3 more
core   +8 more sources

Intersection distribution of degree four polynomials over finite fields

Designs, Codes and Cryptography
Given a polynomial f over the finite field Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin ...
Shuxing Li, Maosheng Xiong
semanticscholar   +1 more source

New constructions for covering designs

, 1995
A $(v,k,t)$ {\em covering design}, or {\em covering}, is a family of $k$-subsets, called blocks, chosen from a $v$-set, such that each $t$-subset is contained in at least one of the blocks.
Gordon, Daniel, Kuperberg, Greg, Patashnik, Oren   +2 more
core   +2 more sources

Covering of Subspaces by Subspaces [PDF]

, 2012
Lower and upper bounds on the size of a covering of subspaces in the Grassmann graph $\cG_q(n,r)$ by subspaces from the Grassmann graph $\cG_q(n,k)$, $k \geq r$, are discussed.
Etzion, Tuvi
core   +1 more source

Repairable Replication-based Storage Systems Using Resolvable Designs [PDF]

, 2012
We consider the design of regenerating codes for distributed storage systems at the minimum bandwidth regeneration (MBR) point. The codes allow for a repair process that is exact and uncoded, but table-based. These codes were introduced in prior work and
Olmez, Oktay, Ramamoorthy, Aditya, Ramamoorthy, Aditya   +2 more
core   +4 more sources

Steiner t-designs for large t

, 2008
One of the most central and long-standing open questions in combinatorial design theory concerns the existence of Steiner t-designs for large values of t. Although in his classical 1987 paper, L.
A. Betten, A. Delandtsheer, D. Gorenstein, D. Livingstone, D. Pei, D.G. Higman, D.K. Ray-Chaudhuri, D.R. Hughes, D.R. Stinson, D.R. Stinson, F. Buekenhout, F. Buekenhout, G.-C. Rota, H. Lüneburg, H. Wielandt, J. Saxl, J. Tits, J.D. Dixon, J.H. Conway, L. Teirlinck, M. Hall Jr., M. Huber, M. Huber, M. Huber, M. Huber, M.W. Liebeck, M.W. Liebeck, N.D. Tuan, P. Dembowski, P. Kaski, P.J. Cameron, P.J. Cameron, P.J. Cameron, P.J. Cameron, P.J. Cameron, R.A. Fisher, R.E. Block, T.. Beth, W.C. Huffman, W.M. Kantor, W.M. Kantor   +40 more
core   +2 more sources

Problems on q-Analogs in Coding Theory [PDF]

, 2013
The interest in $q$-analogs of codes and designs has been increased in the last few years as a consequence of their new application in error-correction for random network coding. There are many interesting theoretical, algebraic, and combinatorial coding
Etzion, Tuvi
core  

Data‐Guided Photocatalysis: Supervised Machine Learning in Water Splitting and CO2 Conversion

Advanced Intelligent Discovery, EarlyView.
This review highlights recent advances in supervised machine learning (ML) for photocatalysis, emphasizing methods to optimize photocatalyst properties and design materials for solar‐driven water splitting and CO2 reduction. Key applications, challenges, and future directions are discussed, offering a practical framework for integrating ML into the ...
Paul Rossener Regonia, Christian Mark Pelicano   +1 more
wiley   +1 more source