Results 61 to 70 of about 283,476 (338)
Advanced Functional Materials, EarlyView.Spider dragline silk has extraordinary mechanical properties due to the underlying hierarchical organization of the fiber across multiple length scales. A biomimetic platform for MaSp1 is developed, the main protein component of dragline silk, and thereby elucidates the parameters governing its rapid self‐assembly from soluble protein into complex ...
Ali D. Malay +3 more
wiley +1 more source
On Intuitionistic Fuzzy Context-Free Languages
Journal of Applied Mathematics, 2013 Taking intuitionistic fuzzy sets as the structures of truth values, we propose the notions of intuitionistic fuzzy context-free grammars (IFCFGs, for short) and pushdown automata with final states (IFPDAs).
Jianhua Jin, Qingguo Li, Chunquan Li
doaj +1 more source
RePair Grammars are the Smallest Grammars for Fibonacci Words [PDF]
arXiv, 2022 Grammar-based compression is a loss-less data compression scheme that represents a given string $w$ by a context-free grammar that generates only $w$. While computing the smallest grammar which generates a given string $w$ is NP-hard in general, a number of polynomial-time grammar-based compressors which work well in practice have been proposed. RePair,
arxiv
Advanced Materials Interfaces, EarlyView.This paper systematically introduces the characteristics and functions of 0D‐3D nanomaterials in super‐lubrication, analyzes the lubrication mechanism of these nanomaterials, and prospects the energy‐saving and environmental benefits brought by their progress in this field.
Kang Yang +7 more
wiley +1 more source
Towards a Context-Free Machine Universal Grammar (CF-MUG) in Natural Language Processing
IEEE Access, 2020 In natural language processing, semantic document exchange ensures unambiguity and shares the same meaning for documents sender and receiver cross different natural languages (e.g., English to Chinese), this difference makes the translation between ...
Quanyi Hu +3 more
doaj +1 more source
Efficient learning of context-free grammars from positive structural examples [PDF]
, 1992 In this paper, we introduce a new normal form for context-free grammars, called reversible context-free grammars, for the problem of learning context-free grammars from positive-only examples.
Sakakibara, Yasubumi
core +1 more source
A Multi‐Task Self‐Supervised Strategy for Predicting Molecular Properties and FGFR1 Inhibitors
Advanced Science, EarlyView.The overview of MTSSMol during pretraining. Initially, data augmentation techniques are applied to the raw input data to create various enhanced versions. These images are then fed into GNNs to extract latent features. Finally, the augmented data is utilized for two learning tasks. b.
Xin Yang +6 more
wiley +1 more source
Controlled Rewriting Using Productions and Reductions [PDF]
, 1988 We investigate context-free grammars the rules of which can be used in a productive and in a reductive fashion, while the application of these rules is controlled by a regular language. We distinguish several modes of derivation for this kind of grammar.
Hogendorp, Jan Anne
core +2 more sources
iPRISM: Intelligent Predicting Response to Cancer Immunotherapy through Systematic Modeling
Advanced Intelligent Systems, EarlyView.The Intelligent Predicting Response to cancer Immunotherapy through Systematic Modeling (iPRISM) model uses data from genes and immune responses to predict how well cancer patients will respond to immunotherapy. Tested on multiple cancer types, iPRISM shows higher accuracy compared to existing methods.
Yinchun Su +7 more
wiley +1 more source
A matter of time: Implicit acquisition of recursive sequence structures [PDF]
, 2009 A dominant hypothesis in empirical research on the evolution of language is the following: the fundamental difference between animal and human communication systems is captured by the distinction between regular and more complex non-regular grammars ...
Araújo, S. +5 more
core +1 more source