Results 71 to 80 of about 557 (235)
Electrically Tuning Electromagnetic Wave Shielding in Phase Engineered 1T/2H‐MoS2‐Based Devices
Advanced Electronic Materials, EarlyView.Sub‐millimeter‐thick phase‐engineered 1T/2H‐MoS2 structures enable electrically tunable electromagnetic interference shielding through active modulation of microwave absorption and reflection. The coexistence of metallic and semiconducting phases, combined with a PVA/KOH gel electrolyte, provides dynamic control over charge transport and interfacial ...
Mustafa Akyol +3 more
wiley +1 more source
Grammars and Other Rewriting Systems [PDF]
, 2008 Grammarware comprises grammars and all grammar-dependent software. The term grammar is meant here in the sense of all established grammar formalisms and grammar notations including context-free grammars, class dictionaries, and XML schemas as well as ...
Ralf Lämmel, Chris Verhoef, Paul Klint
core
Computation graphs for actor grammars [PDF]
, 1993 Actor grammars are a model of actor systems based on graph rewriting. Computation graphs model rewriting processes in actor grammars, and hence, computations in actor systems.
Rozenberg, G., Janssens, D., Lens, M.
core +1 more source
Annals of Gastroenterological Surgery, EarlyView.ABSTRACT Scirrhous gastric cancer, characterized by diffuse infiltration and a high propensity for peritoneal dissemination, remains one of the most aggressive subtypes of gastric cancer. Despite a relatively high incidence of splenic hilar lymph node (No. 10) metastasis, the oncologic benefit of splenectomy remains controversial, while its association
Tsutomu Hayashi, Takaki Yoshikawa
wiley +1 more source
Narrowing Trees for Syntactically Deterministic Conditional Term Rewriting Systems [PDF]
, 2018 A narrowing tree for a constructor term rewriting system and a pair of terms is a finite representation for the space of all possible innermost-narrowing derivations that start with the pair and end with non-narrowable terms. Narrowing trees have grammar
Maeda, Yuya, Nishida, Naoki
core +1 more source
Large Language Model‐Based Chatbots in Higher Education
Advanced Intelligent Systems, Volume 7, Issue 3, March 2025.The use of large language models (LLMs) in higher education can facilitate personalized learning experiences, advance asynchronized learning, and support instructors, students, and researchers across diverse fields. The development of regulations and guidelines that address ethical and legal issues is essential to ensure safe and responsible adaptation
Defne Yigci +4 more
wiley +1 more source
Explicit Calculation of Structural Commutation Relations for Stochastic and Dynamical Graph Grammar Rule Operators in Biological Morphodynamics. [PDF]
Front Syst Biol, 2022 Mjolsness E.
europepmc +1 more source
Accepting pure grammars and systems [PDF]
, 1999 We consider several types of pure grammars and systems as language acceptors and compare them to their generating counterparts. In contrast with the case (considered in earlier papers of the authors) encountered when admitting nonterminals in these ...
Magdeburg Univ. (Germany). Fakultaet fuer Informatik +3 more
core
Barriers and Enablers for Effective Support Coordination in the National Disability Insurance Scheme
Australian Journal of Social Issues, EarlyView.ABSTRACT Support coordinators act as intermediaries between the National Disability Insurance Scheme (NDIS) and participants, facilitating access to funded supports. To optimise outcomes, they must navigate NDIS complexities, identify services that meet individual needs and engage with diverse stakeholders.
Sharyn McDonald +3 more
wiley +1 more source
Pattern matching of compressed terms and contexts and polynomial rewriting [PDF]
, 2011 A generalization of the compressed string pattern match that applies to terms with variables is investigated: Given terms s and t compressed by singleton tree grammars, the task is to find an instance of s that occurs as a subterm in t. We show that this
Schmidt-Schauß, Manfred +1 more
core