Results 61 to 70 of about 3,203 (298)
Glossa Psycholinguistics, 2022 Research on post-repair representations of garden path sentences has found that readers systematically arrive at misinterpretations even after displaying evidence of reanalysis (Christianson et al., 2001; Ferreira et al., 2001).
June Choe, Masaya Yoshida, Jennifer Cole
doaj +1 more source
The Serial Transitive Closure Problem for Trees [PDF]
, 2002 The serial transitive closure problem is the problem of, given a directed graph G and a list of edges, called closure edges, which are in the transitive closure of the graph, to generate all the closure edges from edges in G.
core
Transitive Closure Logic and Multihead Automata with Nested Pebbles [PDF]
, 2020 Several extensions of first-order logic are studied in descriptive complexity theory. These extensions include transitive closure logic and deterministic transitive closure logic, which extend first-order logic with transitive closure operators.
Hirvonen, Minna
core
The SIR Model in a Moving Population: Propagation of Infection and Herd Immunity
Communications on Pure and Applied Mathematics, EarlyView.ABSTRACT In a collection of particles performing independent random walks on Zd$\mathbb {Z}^d$ we study the spread of an infection with SIR dynamics. Susceptible particles become infected when they meet an infected particle. Infected particles heal and are removed at rate ν$\nu$.
Duncan Dauvergne, Allan Sly
wiley +1 more source
International Journal of Cancer, EarlyView.Optimizing neoadjuvant therapy for muscle‐invasive bladder cancer patients who are eligible for cisplatin remains difficult, owing particularly to high toxicity and recurrence rates. This meta‐analysis compared dose‐dense methotrexate, vinblastine, doxorubicin, and cisplatin (ddMVAC) against durvalumab plus gemcitabine‐cisplatin (D‐GC) and GC alone ...
Maurin Helen Mangold +12 more
wiley +1 more source
High Performance Methods for Linked Open Data Connectivity Analytics
Information, 2018 The main objective of Linked Data is linking and integration, and a major step for evaluating whether this target has been reached, is to find all the connections among the Linked Open Data (LOD) Cloud datasets.
Michalis Mountantonakis +1 more
doaj +1 more source
Computing transitive closure on systolic arrays of fixed size [PDF]
, 1989 Forming the transitive closure of a binary relation (or directed graph) is an important part of many algorithms. When the relation is represented by a bit matrix, the transitive closure can be efficiently computed in parallel in a systolic array. Various
Lisper, Björn
core
A Coarse Geometric Approach to Graph Layout Problems
Journal of Graph Theory, EarlyView.ABSTRACT We define a range of new coarse geometric invariants based on various graph–theoretic measures of complexity for finite graphs, including treewidth, pathwidth, cutwidth and bandwidth. We prove that, for bounded degree graphs, these invariants can be used to define functions which satisfy a strong monotonicity property, namely, they are ...
Wanying Huang +3 more
wiley +1 more source
ID-based transitive signature schemes without random oracle
Tongxin xuebao, 2010 Based on waters’ signature scheme,the first identity-based transitive signature scheme was proposed and proved secure against attacks in the standard model.Compared with current transitive signature schemes,the unforgeability of the signature’s ...
MA Xiao-long1 +4 more
doaj +2 more sources
Complete Axiomatizations of Fragments of Monadic Second-Order Logic on Finite Trees [PDF]
Logical Methods in Computer Science, 2012 We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees.
Amélie Gheerbrant, Balder ten Cate
doaj +1 more source