Calculated Performance of Greases in Journal Bearings

Horowitz, H. H.; Steidler, F. E.

doi:10.1080/05698196308972018

Cited by 36 publications

(55 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…I) suggests that there is a subset of lymphocytes that may be considered precursors to cells capable of forming spontaneous rosettes with SRBC. It is believed that immature T lymphocytes may constitute a subset of null cells (10 defects (29). Moreover, thymosin acts on human null cells possessing T-lymphocyte antigens, but not B-cell antigens (30).…”

Section: Discussionmentioning

confidence: 99%

“…This may indicate that only a small proportion of lymphocytes induced to maturity by thymosin possess the capability for forming avid ER. It has been shown that the functional change induced by thymosin may not be correlated to total ER formation, but rather, to increased active ER formation (29). No attempt was made to characterize the response of lymphocytes to thymosin in a saturated SRBClymphocyte milieu.…”

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

In vitro thymosin effect on T lymphocytes in alcoholic liver disease

Mutchníck

Goldstein

1979

Clinical Immunology and Immunopathology

View full text Add to dashboard Cite

The in vitro effect of thymosin fraction 5, a thymic gland extract, on thymus-dependent lymphocytes was studied in 12 patients with alcoholic hepatitis (AH) and in 18 patients with compensated alcoholic cirrhosis (CAC). The baseline number and proportion of spontaneous rosette-forming T lymphocytes were significantly reduced in AH as compared to the controls. No such decrease was seen in CAC. When the lymphocytes of patients with AH were incubated in the presence of thymosin fraction 5, the subsequent number and proportion of rosette-forming T lymphocytes showed a significant increase. There was no significant reponse to thymosin in CAC or in control subjects. There appears to be a subset of immature T lymphocytes in patients with AH that is responsive to exogenous thymic factors with subsequent activation of the capacity to form spontaneous rosettes.

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

In vitro thymosin effect on T lymphocytes in alcoholic liver disease

Mutchníck

Goldstein

1979

Clinical Immunology and Immunopathology

View full text Add to dashboard Cite

show abstract

“…Also, the radix sort will take O(n) time. Note that we only need to sort O(log n) bits of each P i (1 ≤ i ≤ n) and this sorting can be done in O(n) time (see e.g., [17]). Observation 1.…”

Section: Algorithm Sa1mentioning

confidence: 99%

An elegant algorithm for the construction of suffix arrays

Rajasekaran

Nicolae

2014

Journal of Discrete Algorithms

View full text Add to dashboard Cite

The suffix array is a data structure that finds numerous applications in string processing problems for both linguistic texts and biological data. It has been introduced as a memory efficient alternative for suffix trees. The suffix array consists of the sorted suffixes of a string. There are several linear time suffix array construction algorithms (SACAs) known in the literature. However, one of the fastest algorithms in practice has a worst case run time of O(n2). The problem of designing practically and theoretically efficient techniques remains open. In this paper we present an elegant algorithm for suffix array construction which takes linear time with high probability; the probability is on the space of all possible inputs. Our algorithm is one of the simplest of the known SACAs and it opens up a new dimension of suffix array construction that has not been explored until now. Our algorithm is easily parallelizable. We offer parallel implementations on various parallel models of computing. We prove a lemma on the ℓ-mers of a random string which might find independent applications. We also present another algorithm that utilizes the above algorithm. This algorithm is called RadixSA and has a worst case run time of O(n log n). RadixSA introduces an idea that may find independent applications as a speedup technique for other SACAs. An empirical comparison of RadixSA with other algorithms on various datasets reveals that our algorithm is one of the fastest algorithms to date. The C++ source code is freely available at http://www.engr.uconn.edu/~man09004/radixSA.zip.

show abstract

“…The eccentricity of the vertices can be obtained by Floyd's algorithm [3], which takes if we use matrix. Finding the maximum and minimum of the eccentricities can be done in time by using divide and conquer Minimum and Maximum algorithm [4,5]. The following algorithm has been developed which determines the sets , and and their cardinality in time.…”

Section: Algorithm To Generate the Sets Andmentioning

confidence: 99%

Generating the Vertex Sets with some Distance Parameter Properties in Caterpillar Graphs

Shindhe¹,

Ishwar.²,

Marriswamy.³

2013

IJCA

View full text Add to dashboard Cite

In this paper the vertices of caterpillar tree are viewed with different approach and categorized into the sets , and , based on the distance parameters i.e., diameter and radius. The distance parameters have been presented with some set theory views. Here is the set of diametral vertices, is the set of central vertices and is the set of vertices which are neither central nor peripheral. Then, . The cardinality of these sets has some property and helps to specify the basic characters of caterpillar tree. A linear complexity algorithm is also designed to generate these sets.

show abstract

Calculated Performance of Greases in Journal Bearings

Cited by 36 publications

References 4 publications

In vitro thymosin effect on T lymphocytes in alcoholic liver disease

In vitro thymosin effect on T lymphocytes in alcoholic liver disease

An elegant algorithm for the construction of suffix arrays

Generating the Vertex Sets with some Distance Parameter Properties in Caterpillar Graphs

Contact Info

Product

Resources

About