نتایج جستجو برای: s2

تعداد نتایج: 12987  

2007
Ho Yun Lee Jin Wook Chung Jeong Min Lee Chang Jin Yoon Whal Lee Hwan Jun Jae Yong Hu Yin Sung-Gwon Kang Jae Hyung Park

OBJECTIVE The conventional method of dividing hepatic segment 2 (S2) and 3 (S3) is subjective and CT interpretation is unclear. The purpose of our study was to test the validity of our hypothesis that the actual plane dividing S2 and S3 is a vertical plane of equal distance from the S2 and S3 portal veins in clinical situations. MATERIALS AND METHODS We prospectively performed thin-section io...

Journal: :The Journal of neuroscience : the official journal of the Society for Neuroscience 2015
Benjamin A Suter Gordon M G Shepherd

Primary motor (M1) and secondary somatosensory (S2) cortices, although anatomically and functionally distinct, share an intriguing cellular component: corticospinal neurons (CSP) in layer 5B. Here, we investigated the long-range circuits of CSPs in mouse forelimb-M1 and S2. We found that interareal projections (S2 → M1 and M1 → S2) monosynaptically excited pyramidal neurons across multiple laye...

Journal: :Circulation 1992
Y Kobayashi W Peters S S Khan W J Mandel H S Karagueuzian

BACKGROUND We tested the hypothesis that action potential duration (APD) restitution of normal ventricular muscle cells is different during double premature stimuli (S3) compared with a single premature stimulus (S2). We propose a possible ionic mechanism for such a difference. METHODS AND RESULTS Action potentials and isometric tension were recorded simultaneously from isolated canine right ...

Journal: :Psychophysiology 2001
M Rose R Verleger E Wascher

We examined changes of event-related potentials (ERPs) while participants learned stimulus-to-stimulus relations in an S1-S2 task. The design allowed for separating processes of associative learning from nonspecific effects. Participants had to respond to S2 by a left or right key-press dependent on S2 identity (letter W or M). Preparation for S2 could be improved by using the associative infor...

2011
ANAR AKHMEDOV DOUG PARK B. D. PARK

We construct an infinite family of mutually nondiffeomorphic irreducible smooth structures on the topological 4-manifold S2 × S2.

Journal: :Journal of visualized experiments : JoVE 2010
Daniel W Buster Jonathan Nye Joseph E Klebba Gregory C Rogers

The ideal experimental system would be cheap and easy to maintain, amenable to a variety of techniques, and would be supported by an extensive literature and genome sequence database. Cultured Drosophila S2 cells, the product of disassociated 20-24 hour old embryos, possess all these properties. Consequently, S2 cells are extremely well-suited for the analysis of cellular processes, including t...

Journal: :Combinatorica 1995
Rudolf Ahlswede Péter L. Erdös Niall Graham

In every dense poset P every maximal antichain S may be partitioned into disjoint subsets S1 and S2 , such that the union of the upset of S1 with the downset of S2 yields the entire poset: U(S1) [ D(S2) = P . To nd a similar splitting of maximal antichains in posets is NP{hard in general.

Journal: :The Journal of biological chemistry 2006
Larry E Wagner Matthew J Betzenhauser David I Yule

The subtype- and splice variant-specific modulation of inositol 1,4,5-trisphosphate receptors (InsP3R) by interaction with cellular factors plays a fundamental role in defining the characteristics of Ca2+ release in individual cell types. In this study, we investigate the binding properties and functional consequences of the expression of a putative nucleotide binding fold (referred to as the A...

Journal: :Inf. Process. Lett. 2003
Yin-Te Tsai

This paper considers a constrained version of longest common subsequence problem for two strings. Given strings S1, S2 and P , the constrained longest common subsequence problem for S1 and S2 with respect to P is to find a longest common subsequence lcs of S1 and S2 such that P is a subsequence of this lcs. An O(rn 2m2) time algorithm based upon the dynamic programming technique is proposed for...

Journal: :Discrete Mathematics 2013
Wei Xiong Hong-Jian Lai Xiaoling Ma Keke Wang Meng Zhang

For an integer s1, s2, s3 > 0, let Ns1,s2,s3 denote the graph obtained by identifying each vertex of a K3 with an end vertex of three disjoint paths Ps1+1, Ps2+1, Ps3+1 of length s1, s2, and s3, respectively. We determine a family F of graphs such that, every 3-connected (K1,3, Ns1,s2,1)-free graph Γ with s1 + s2 + 1 ≤ 10 is hamiltonian if and only if the closure of Γ is L(G) for some graph G /...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید