Filters








487 Hits in 2.2 sec

One-dimensional modelling of a vascular network in space-time variables

S.J. Sherwin, V. Franke, J. Peiró, K. Parker
2003 Journal of Engineering Mathematics  
Using this numerical model the role of nonlinearity is also considered by comparison of the linearised and nonlinearised results.  ...  Consideration of the linearised system also allows for the derivation of a reflection coefficient analogous to the approach adopted in acoustics and surface waves.  ...  The bifurcations are, however, not well-matched for backward travelling waves.  ... 
doi:10.1023/b:engi.0000007979.32871.e2 fatcat:6phhyfjn5baodeaydrccyojyx4

Lock-Free Hopscotch Hashing [article]

Robert Kelly, Barak A. Pearlmutter, Phil Maguire
2019 arXiv   pre-print
The common pattern is that, at low thread counts, all algorithms are very competitive in terms of performance.  ...  In contrast, tree structures require a total ordering on keys or key/value pairings, but don't require a hash function.  ... 
arXiv:1911.03028v1 fatcat:ta3546j5hzca3pkefiyhdljqyy

Between Tree Patterns and Conjunctive Queries: Is There Tractability beyond Acyclicity? [chapter]

Filip Murlak, Michał Ogiński, Marcin Przybyłko
2012 Lecture Notes in Computer Science  
) and tree patterns (tree-like acyclic CQs).  ...  Most importantly, we show that vertical tree patterns can be costlessly extended with full horizontal CQs over children.  ...  Under disjunction-free DTDs BC-SAT(↓, ) for tree patterns is PSpacehard, even for a fixed DTD. Proof. We modify the reduction from the linearised tiling problem used in Theorem 4.  ... 
doi:10.1007/978-3-642-32589-2_61 fatcat:ub2m3y4dl5gizk34rse7coustm

Applying adversarial planning techniques to Go

Steven Willmott, Julian Richardson, Alan Bundy, John Levine
2001 Theoretical Computer Science  
Approaches to computer game playing based on -ÿ search of the tree of possible move sequences combined with a position evaluation function have been successful for many games, notably Chess.  ...  the problem (P), the number of moves GoBI tried (M ), whether GoBI succeeded in ÿnding a correct problem solution (Res; C = correct answer; F = fail), and the estimated number of moves in the -ÿ search tree  ...  matching.  ... 
doi:10.1016/s0304-3975(00)00076-1 fatcat:us7qgujc7zdhldgfacjrmgdzjm

An introduction to wave intensity analysis

Kim H. Parker
2009 Medical and Biological Engineering and Computing  
Given c, it is possible to separate the waveforms into their forward and backward components.  ...  It is positive for forward waves and negative for backward waves, providing a convenient tool for quantifying the timing, direction and magnitude of waves.  ...  If arterial bifurcations are well-matched for forward wavefronts, they are necessarily poorly matched for backward wavefronts in one of the daughter vessels.  ... 
doi:10.1007/s11517-009-0439-y pmid:19205773 fatcat:zse4ypoh55aqdonoqm4hpmc2ii

Analysing the pattern of pulse waves in arterial networks: a time-domain study

J. Alastruey, K. H. Parker, J. Peiró, S. J. Sherwin
2009 Journal of Engineering Mathematics  
However, the reflection coefficients in (31) show that the same bifurcations have to be poorly matched for backward-travelling waves [10] .  ...  Figure 8 shows the tree of waves for the bifurcating tree in Fig. 2 (left) .  ... 
doi:10.1007/s10665-009-9275-1 fatcat:7ro7hczxjzekfmxmz6b3gg4bb4

APACIC++ 2.0. A PArton Cascade In C++

F. Krauss, A. Schälicke, G. Soff
2006 Computer Physics Communications  
It incorporates some features, that are specific for the consistent merging with multi-particle matrix elements at tree-level.  ...  The full radiation pattern is identified as a chain of 1 → 2 processes, a Markov chain, which translates into the class Tree. A Tree in turn is realised as a list of linked Knots.  ...  The SHERPA results have been multiplied by a constant K-factor of 1.45 to match the data.  ... 
doi:10.1016/j.cpc.2005.11.009 fatcat:k6qvvkk65jejlpamipndoi3qja

A generic framework for symbolic execution: A coinductive approach

Dorel Lucanu, Vlad Rusu, Andrei Arusoaie
2017 Journal of symbolic computation  
Fig. 6 . 6 The finite proof tree under SCC corresponding to the infinite proof tree T 2 inFig. 5 Lemma 6. 1 1 shows how derivatives can equivalently be computed using matching.  ...  A set X satisfying X ⊆ F (X) is called backward closed w.r.t. F . (u) | u ∈ U} is backward closed, i.e., {f (u) | u ∈ U} ⊆ {z, f (u) | z ∈ Z, u ∈ U} ∪ {nil}.  ...  Let P be a proof tree of an RL formula under SYSTEP.  ... 
doi:10.1016/j.jsc.2016.07.012 fatcat:rxdxl2gxjvcepecrbm5bjzt7qu

Fluid–structure interaction in a fully coupled three-dimensional mitral–atrium–pulmonary model

Liuyang Feng, Hao Gao, Nan Qi, Mark Danton, Nicholas A. Hill, Xiaoyu Luo
2021 Biomechanics and Modeling in Mechanobiology  
The haemodynamic changes along the pulmonary vessel trees on different scales from microscopic vessels to the main pulmonary artery can all be captured in this model.  ...  realistic three-dimensional geometries, fibre-reinforced hyperelastic materials and fluid–structure interaction, and the pulmonary vessels are modelled as one-dimensional network ended with structured trees  ...  In the AF case, the late-diastole backward waves disappear and similar wave patterns still remain during systole but with much smaller amplitude compared with the control case.  ... 
doi:10.1007/s10237-021-01444-6 pmid:33770307 pmcid:PMC8298265 fatcat:wy7dxpiq5zckxknptzzkte23cm

The asymmetry and antisymmetry of syntax: A relational approach to displacement

Justin Malčić
2019 Zenodo  
Building on work taking the LCA to hold throughout the derivation, I argue that precedence relations may be the basis of phrase structure, though without claiming that linearisation is necessary for LF  ...  The linearised specifier is then inserted into a progressively larger structure by matching the root node of the specifier in question with the corresponding terminal node in the spine which hosts the  ...  Chomsky (2015, p. 6 ) then advocates abandoning trees because of the absence of labelled nodes in representations, but for expository purposes I will use an unlabelled tree diagram to represent the FSAequivalent  ... 
doi:10.5281/zenodo.3773332 fatcat:zqubk7wnafavvc6urpzrdbgh3m

Parametric uncertainty analysis of pulse wave propagation in a model of a human arterial network

Dongbin Xiu, Spencer J. Sherwin
2007 Journal of Computational Physics  
This necessarily implies that reflected waves are not well-matched when propagating toward the root of the arterial tree and this leads to a wave trapping phenomena, in which backward travelling waves  ...  Since a typically heart beat is of order of a second, linearised analysis suggests that the wave-lengths of pulses in the arterial tree are of the order of 3 to 10 metres which is far larger than any length  ... 
doi:10.1016/j.jcp.2007.05.020 fatcat:vyetnkukebdalnk3xt4nv2qieq

Algorithmic Design of Cotranscriptionally Folding 2D RNA Origami Structures [chapter]

Abdulmelik Mohammed, Pekka Orponen, Sachith Pai
2018 Lecture Notes in Computer Science  
After generating a tile from a spanning tree, we can linearise its strand routing to an arc diagram and investigate it for cotranscriptional polymerase trapping.  ...  The arc diagram in (a) reveals that the horizontal spanning tree edge of the U tile has no cost since the corresponding long stem pairing only crosses the kissing loops in the backward direction.  ... 
doi:10.1007/978-3-319-92435-9_12 fatcat:vurzlcuclvcvheykul5senh4pi

FutureMapping 2: Gaussian Belief Propagation for Spatial AI [article]

Andrew J. Davison, Joseph Ortiz
2019 arXiv   pre-print
So belief propagation is able to efficiently determine marginal distributions for every variable in a tree graph with a one time forward/backward sweep of message passing through the graph.  ...  One is to convert a general graph into a tree by combining nodes via graph cliques. These will be perfect trees, but with large compound nodes, and leads to the junction tree family of methods.  ... 
arXiv:1910.14139v1 fatcat:2fzvcdv2wjez7awrtyc4ytjip4

Top-down Tree Structured Decoding with Syntactic Connections for Neural Machine Translation and Parsing

Jetic Gū, Hassan S. Shavarani, Anoop Sarkar
2018 Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing  
encoder with tree-structured decoding augmented with a syntax-aware attention model.  ...  In addition, we use the syntactic structure of the sentence to add new connections to the tree-structured decoder neural network (Seq2DRNN+SynC).  ...  Aharoni and Goldberg (2017) treated constituency trees as sequential strings (linearised-tree) and trained a Seq2Seq model to produce such sequences.  ... 
doi:10.18653/v1/d18-1037 dblp:conf/emnlp/GuSS18 fatcat:s3ygw36n5fgm5j2uzd2pye54w4

Top-down Tree Structured Decoding with Syntactic Connections for Neural Machine Translation and Parsing [article]

Jetic Gū and Hassan S. Shavarani and Anoop Sarkar
2018 arXiv   pre-print
encoder with tree-structured decoding augmented with a syntax-aware attention model.  ...  In addition, we use the syntactic structure of the sentence to add new connections to the tree-structured decoder neural network (Seq2DRNN+SynC).  ...  Aharoni and Goldberg (2017) treated constituency trees as sequential strings (linearised-tree) and trained a Seq2Seq model to produce such sequences.  ... 
arXiv:1809.01854v1 fatcat:fzxngmhobrb6pjnpssiisnwmja
« Previous Showing results 1 — 15 out of 487 results