نتایج جستجو برای: ekr
تعداد نتایج: 107 فیلتر نتایج به سال:
We prove that almost all digraphs not embedding an independent set of size 3 consist of two disjoint tournaments, and discuss connections with the theory of homogeneous simple structures. Our main result can be stated informally as saying that almost all finite directed graphs in which any three vertices span at least one directed edge consist of two tournaments with some directed edges between...
BACKGROUND Aldo-keto reductase family 1, member B10 (AKR1B10), is known to be significantly induced in the cells of various cancers such as breast cancer. However, the mechanisms of AKR1B10 promoting tumorigenesis in breast cancer remain unclear. In the present study, we demonstrated the potential role and mechanism of AKR1B10 in the invasion and migration of breast cancer cells. METHODS The ...
Two hypergraphs H1, H2 are called cross-intersecting if e1 ∩ e2 ̸= ∅ for every pair of edges e1 ∈ H1, e2 ∈ H2. Each of the hypergraphs is then said to block the other. Given integers n, r,m we determine the maximal size of a sub-hypergraph of [n]r (meaning that it is r-partite, with all sides of size n) for which there exists a blocking sub-hypergraph of [n]r of size m. The answer involves a sel...
Abstract Background and Aims Most patients start haemodialysis (HD) with a fixed dose of three sessions per week, regardless their residual renal function (RKF). This schedule is considered “standard HD or conventional HD” widely accepted without any randomised controlled trial (RCT) having examined whether other schedules fewer week are inadequate harmful. Incremental (iHD), by contrast, adjus...
A new method of estimating Kt/V has been proposed. This was a required update to accommodate frequencies of dialysis other than thrice weekly [1].The original approximate method for calculating Kt/V from preand post-dialysis urea concentrations was developed using linear regression on a data set of measurements taken from patients undergoing thrice-weekly dialysis. The method assumes that the i...
M y c o s i s fiinge)idcs ( M F ) is a c u t a n e o u s ' I ' c-ell l y m p h o m a ( C ' l ' C l , ) w h i e h c a n p r e s e n t a s locali/.e-d i n ( l o l c n l pa l c lu s anel plac(uc-s l h a l c-linic-alK re-se-niblci n l l a n i m a t e i r y ekr i i i a loses , s u c h a s | ) s o r i a s i s , o r a s r a p i d l y preigrc-ssivc luiiie)rs w i t h i n l i l l r a l i o n of l y m p h...
It is well known that equality sets between two morphisms possess a remarkable generative capacity: an arbitrary recursively enumerable set is obtained from an equality set by certain simple operations. Interconnections between simplicity of computations and structural primitivity of words in equality sets have also been observed. The paper discusses recent work in this area, pointing out certa...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید