Results 71 to 80 of about 274,129 (290)

AN ALGORITHMIC APPROACH TO STRING PHENOMENOLOGY [PDF]

Modern Physics Letters A, 2010
We review the recent programme undertaken to construct, systematically and algorithmically, large classes of heterotic vacua, as well as the search for the MSSM therein. Specifically, we outline the monad construction of vector bundles over complete intersection Calabi–Yau threefolds, their classification, stability, equivariant cohomology and ...
openaire   +3 more sources

Advanced Design for Weakly Coupled Resonators by Automatic Active Optimization

Advanced Materials Technologies, EarlyView.
An Automatic Active Optimization (AAO) strategy integrates machine learning predictors and genetic algorithms in a closed‐loop workflow. By iteratively expanding its dataset with new discoveries, AAO overcomes the limits of conventional methods. This approach finds superior microstructural designs beyond the initial sample space. We demonstrate this on
Wei Yue, Yuan Gao, Fanping Sui, Jason Wang, Megan Teng, Peggy Tsao, Huicong Deng, Yande Peng, Liwei Lin   +8 more
wiley   +1 more source

Encoded expansion: an efficient algorithm to discover identical string motifs.

PLoS ONE, 2014
A major task in computational biology is the discovery of short recurring string patterns known as motifs. Most of the schemes to discover motifs are either stochastic or combinatorial in nature. Stochastic approaches do not guarantee finding the correct
Aqil M Azmi, Abdulrakeeb Al-Ssulami
doaj   +1 more source

Smart Closed‐Loop Systems in Personalized Healthcare: Advances and Outlook

Advanced Materials Technologies, EarlyView.
A smart closed‐loop e‐textile integrates multimodal sensing, onboard processing, wireless communication, and wearable power to enable real‐time physiological/biochemical monitoring and feedback‐controlled therapy. ABSTRACT Smart textiles represent a revolutionary frontier in healthcare, seamlessly blending fabric and advanced technologies to create ...
Safoora Khosravi, Sang Won Lee, Mohammad Abrar Uddin, Sina Hassanpoor, Neha Suvindran, Katherine Le, Harun Arkaz, Harishkumar Narayana, Saeid Soltanian, Danial Khorsandi, Negar Hosseinzadeh Kouchehbaghi, Taeil Kim, Yangzhi Zhu   +12 more
wiley   +1 more source

String attractors and combinatorics on words [PDF]

, 2019
The notion of string attractor has recently been introduced in [Prezza, 2017] and studied in [Kempa and Prezza, 2018] to provide a unifying framework for known dictionary-based compressors.
Mantaci S., Restivo A., Romana G., Rosone G., Sciortino M.   +4 more
core  

Optimality program in segment and string graphs

, 2018
Planar graphs are known to allow subexponential algorithms running in time $2^{O(\sqrt n)}$ or $2^{O(\sqrt n \log n)}$ for most of the paradigmatic problems, while the brute-force time $2^{\Theta(n)}$ is very likely to be asymptotically best on general ...
BS Baker, C McDiarmid, D Marx, D Marx, DE Knuth, ED Demaine, ED Demaine, ED Demaine, ED Demaine, IE Zverovich, J Alber, J Fox, J Kratochvíl, J Kratochvíl, J Matoušek, M Schaefer, M Schaefer, N Robertson, R Impagliazzo, RJ Lipton, S Cabello   +20 more
core   +1 more source

Magnetic Textiles: A Review of Materials, Fabrication, Properties, and Applications

Advanced Materials Technologies, EarlyView.
Magnetic textiles (M‐textiles) are emerging as a programmable materials platform that merges magnetic matter with hierarchical textile structures. This article consolidates magnetic material classes, textile architectures, and fabrication and magnetization strategies, revealing structure–property–function relationships that govern magneto‐mechanical ...
Li Ke, Moses Kumi, Xiaoming Tao, Junhong Pu   +3 more
wiley   +1 more source

Improved algorithms for approximate string matching (extended abstract)

BMC Bioinformatics, 2009
Background The problem of approximate string matching is important in many different areas such as computational biology, text processing and pattern recognition.
Papamichail Georgios, Papamichail Dimitris   +1 more
doaj   +1 more source

Evolving neural networks with genetic algorithms to study the string landscape

Journal of High Energy Physics, 2017
We study possible applications of artificial neural networks to examine the string landscape. Since the field of application is rather versatile, we propose to dynamically evolve these networks via genetic algorithms.
Fabian Ruehle
doaj   +1 more source

On the Use of Suffix Arrays for Memory-Efficient Lempel-Ziv Data Compression

, 2009
Much research has been devoted to optimizing algorithms of the Lempel-Ziv (LZ) 77 family, both in terms of speed and memory requirements. Binary search trees and suffix trees (ST) are data structures that have been often used for this purpose, as they ...
Ferreira, Artur, Figueiredo, Mario, Oliveira, Arlindo   +2 more
core   +1 more source