نتایج جستجو برای: 305
تعداد نتایج: 7433 فیلتر نتایج به سال:
................................................................................................................................................3
BACKGROUND Toll-like receptor (TLR)-2 is an important mediator of innate immunity and ischemia/reperfusion-induced cardiac injury. We have previously shown that TLR2 inhibition reduces infarct size and improves cardiac function in mice. However, the therapeutic efficacy of a clinical grade humanized anti-TLR2 antibody, OPN-305, in a large-animal model remained to be addressed. METHODS AND RES...
Accepted for publication 9 October 1995 Abstract Background/Aims-The course of primary sclerosing cholangitis (PSC) is highly variable and unpredictable. This study describes the natural history and outcome of PSC. These data were used to construct a prognostic model for patients with PSC. Methods-A total of 305 Swedish patients with PSC were studied. The median follow up time was 63 (1-194) mo...
In this lecture we take a step back from the previous lecture and review some basic graph theory and graph exploration algorithms for exploring and decomposing graphs. As we argued in the last lecture, graphs are fundamental and pervasive combinatorial objects. They are one of the simplest types of structured of nite sets: if you have a set of n items, i1, ..., in and pairwise relationships bet...
Solution: Let G be a disconnected graph in which case we can decompose it into k connected components C1, C2, . . . , Ck. We want to show that G is connected i.e. there is a path between any u and v in G. In the case that u and v are in different components we know that there exist an edge (a path of length one) between them in G. In the case that u and v are in the same component, say Ci, we c...
There are two main topics we cover in this lecture. First, we introduce and study matroids a generalization of spanning trees and the notion of independence that embody the greedy algorithm we saw last class. Second, we start a new problem, the maximum ow problem. In some sense, todays lecture is about one of the easiest and hardest problems in combinatorial optimization for which we have reaso...
An edge-colored graph is said to be swell-colored if each triangle contains exactly 1 or 3 colors but never 2 colors and if the graph contains more than one color. It is shown that a swell-colored complete graph with n vertices contains at least √ n + 1 colors. The complete graph with n 2 vertices has a swell coloring using n + 1 colors if and only if there exists a finite affine plane of order...
1. (Kleinberg Tardos 7.27) Some of your friends with jobs out West decide they really need some extra time each day to sit in front of their laptops, and the morning commute from Woodside to Palo Alto seems like the only option. So they decide to carpool to work. Unfortunately, they all hate to drive, so they want to make sure that any carpool arrangement they agree upon is fair and doesn’t ove...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید