7,993 research outputs found
Preparation and application of proteomic antibody bank against whole water-soluble proteins from rapid-growing bamboo shoots
No full textFactorizing complementation in a TT-MCTAG for German
No full textTT-MCTAG lets one abstract away from the relative order of co-complements in the final derived tree, which is more appropriate than classic TAG when dealing with flexible word order in German. In this paper, we present the analyses for sentential complements, i.e., wh-extraction, thatcomplementation and bridging, and we work out the crucial differences between these and respective accounts in XTAG (for English) and V-TAG (for German)
Dataset of the article "Bayesian phylogenetics illuminate shallower relationships in Trans-Himalayan languages in Tibet-Arunachal area"
No full textThis repository archives the dataset of the article "Bayesian phylogenetics illuminate shallower relationships in Trans-Himalayan languages in Tibet-Arunachal area". The cognate annotation of Tshangla, Kho-Bwa, Hrusish, Mishmic, and Tani languages were done by us. The cognate decision on the other languages was annotated by Sagart et al. (2019). Please use the following information to cite our work:
Wu, M.-S, Bodt, T. A, Tresoldi, T. (2022). Bayesian phylogenetics illuminate shallower relationships Trans-Himalayan languages in the Tibet-Arunachal area. Linguistics of the Tibeto-Burman Area. [forthcoming]Funding information:
ERC Starting Grant 715618 "Computer-Assisted Language Comparison'' (CALC, http://calc.digling.org, MSW and TT)
Swiss National Science Foundation Postdoc Mobility P2BEP1_181779 (TAB)
Intelligence Community Postdoctoral Research Fellowship Program PF20_100067 (TAB)
Riksbankens Jubileumsfond MXM19-1087:1 ``Cultural evolution of texts'' (TT
Isomorphisms in co-TT graphs
Get PDF2019 Spring.Includes bibliographical references.A threshold tolerance graph is a graph where each vertex v is assigned a weight wv and a tolerance tv, and there is an edge between two vertices vx and vy if and only if wx + wy ≥ min(tx,ty). A co-TT graph is the complement of a threshold tolerance graph. Recognition of these graphs can be done in O(n2) time; however no polynomial-time algorithm to identify isomorphisms between pairs of TT or co-TT graphs was previously known. We give an algorithm to identify these isomorphisms, which takes O(n2) time
The effect of putative anti-σ factor Tt-TolB on the activity of Tt-RpoE1.
No full text<p>(<b>A</b>). The effect of Tt-TolB on the interaction between Tt-RpoE1 and fork-junction structure promoter DNA (T+1/B−10). The indicated proteins were added (+) in an EMSA reaction at a concentration of 5 µM. The solid arrow indicates the supershifted complex formed by Tt-RpoE1, Tt-TolB, and the promoter, and the open arrow indicates the complex formed by Tt-RpoE1 and the promoter. (<b>B</b>). The effect of Tt-TolB on <i>in vitro</i> transcription of Tt-RpoE1. Lane 1. Tt-TolB was added into the transcription system at the same time with Tt-RpoE1. Lane 2. Tt-TolB was added into the transcription system after Tt-RpoE1, <i>E.coli</i> core RNAP and promoter DNA being incubated (see <a href="http://www.plosone.org/article/info:doi/10.1371/journal.pone.0040885#s4" target="_blank">materials and methods</a>). Lane C, the <i>in vitro</i> transcription system without Tt-TolB. The solid arrow indicates the products of transcription.</p
The interaction between <i>T. tengcongensis</i> ECF σ factor Tt-RpoE1 and its putative anti-σ factor Tt-TolB.
No full text<p>(<b>A</b>). Organization of the genes encoding Tt-RpoE1, Tt-TolB and two other proteins (Permease and PtsB). The vertical black line in Tt-TolB indicates the predicted membrane-spanning domain. Partial sequence including the stop codon of <i>Tt-rpoE1</i> and the start codon of <i>Tt-tolB</i> is shown. (<b>B</b>). Y2H analysis of the interaction between Tt-RpoE1 and Tt-TolB and between Tt-RpoE1 and the other two proteins. (<b>C</b>). The interaction between Tt-RpoE1 and the N-terminal or the C-terminal region of Tt-TolB.</p
tt*-geometry and pluriharmonic maps
No full textInternational audienceIn this paper we use the real differential geometric definition of a metric (an unimodular oriented metric) tt*-bundle of Cortés and the author to define a map from the space of metric (unimodular oriented metric) tt*-bundles of rank r over a complex manifold M to the space of pluriharmonic maps from M to (respectively ), where (p,q) is the signature of the metric. In the sequel the image of the map is characterized. It follows, that in signature (r,0) the image of is the whole space of pluriharmonic maps. This generalizes a result of Dubrovin
performance of the low-rank TT-SVD for large dense tensors on modern multicore CPUs
Get PDFThere are several factorizations of multidimensional tensors into lower-dimensional components, known as ``tensor networks."" We consider the popular ``tensor-train"" (TT) format and ask, How efficiently can we compute a low-rank approximation from a full tensor on current multicore CPUs? Compared to sparse and dense linear algebra, kernel libraries for multilinear algebra are rare and typically not as well optimized. Linear algebra libraries like BLAS and LAPACK may provide the required operations in principle but often at the cost of additional data movements for rearranging memory layouts. Furthermore, these libraries are typically optimized for the compute-bound case (e.g., square matrix operations), whereas low-rank tensor decompositions lead to memory bandwidth limited operations. We propose a ``TT singular value decomposition"" (TT-SVD) algorithm based on two building blocks: a ``Q-less tall-skinny QR"" factorization and a fused tall-skinny matrix-matrix multiplication and reshape operation. We analyze the performance of the resulting TT-SVD algorithm using the roofline performance model. In addition, we present performance results for different algorithmic variants for shared-memory as well as distributed-memory architectures. Our experiments show that commonly used TT-SVD implementations suffer severe performance penalties. We conclude that a dedicated library for tensor factorization kernels would benefit the community: Computing a low-rank approximation can be as cheap as reading the data twice from main memory. As a consequence, an implementation that achieves realistic performance will move the limit at which one has to resort to randomized methods that only process part of the data.Numerical Analysi
Unusual Optical Properties of Type-II InAs/GaAs0.7Sb0.3 Quantum Dots by Photoluminescence Studies
No full text- …
