ABSTRACT This study investigates the factors influencing renewable energy consumption and renewable electricity in Sub‐Sahara Africa (SSA) using the Lewbel 2SLS approach, panel quantile regression and Driscoll and Kraay estimator. It focuses on a panel dataset covering 41 countries from 1998 to 2020.
Emmanuel K. Manu, Simplice A. Asongu
wiley +1 more source
Extended Grammar of Systematized Nomenclature of Medicine - Clinical Terms for Semantic Representation of Clinical Data: Methodological Study. [PDF]
Gaudet-Blavignac C +6 more
europepmc +1 more source
A Novel Depression Recognition Network Based on Brain Functional Connectivity from Prefrontal Emotional State EEG. [PDF]
Sun Y +6 more
europepmc +1 more source
A knowledge graph construction method for compliance review of water conservancy project reports. [PDF]
Ding Z +5 more
europepmc +1 more source
Graph identification of proteins in tomograms (GRIP-Tomo) 2.0: Topologically aware classification for proteins. [PDF]
Li C +9 more
europepmc +1 more source
Interaction of nanoplastics with platelets: activation and fibrin clot formation. [PDF]
Trostchansky A, Alarcón M.
europepmc +1 more source
Combining Triazole Scaffold Repurposing and Generative Transformer Architecture for Structure-Based Inhibitor Design Targeting the LasR Quorum Sensing Receptor of <i>Pseudomonas aeruginosa</i>. [PDF]
Khan A +7 more
europepmc +1 more source
Related searches:
A temporal graph grammar formalism
Journal of Visual Languages and Computing, 2018Abstract As a useful formalism tool, graph grammars provide a rigorous but intuitive way to specify visual languages. This paper, based on the existing Edge-based Graph Grammar (EGG), proposes a new context-sensitive graph grammar formalism called the Temporal Edge-based Graph Grammar, or TEGG.
Yang Zou, Xiaoqin Zeng
exaly +3 more sources
Graph compression using graph grammars. [PDF]
This thesis presents work done on compressed graph representations via hyperedge replacement grammars. It comprises two main parts. Firstly the RePair compression scheme, known for strings and trees, is generalized to graphs using graph grammars. Given an object, the scheme produces a small context-free grammar generating the object (called a “straight-
Peternek, Fabian Hans Adolf
core +6 more sources
The concept of Chomsky-grammars is generalized to graph-grammars; the "gluing" of graphs is defined by a pushout-construction. In the present paper, we allow the left-hand and right-hand side of a production to be partial graphs, i.e. graphs in which there may be edges without a source or target node.
Hans Jürgen Schneider, Hartmut Ehrig
openaire +2 more sources

