Bond behavior of NSM FRP strips between two adjacent cracks in concrete beams: A numerical study

Strengthening RC structures with near-surface mounted (NSM) fibre reinforced polymer (FRP) composites has a number of advantages compared with that with externally bonded (EB) FRP sheets/plates. As with EB FRP, the performance of the bond between NSM FRP and concrete is one of the key factors affecting the behaviour of the strengthened structure. This paper presents a numerical investigation into the behaviour of NSM FRP loaded at its both ends to simulate the NSM FRP-toconcrete bond between two adjacent cracks in RC members. The main objective of this study is to quantitatively clarify the effect of the bondline damage during slip reversal on the ultimate load (bond strength). The results show that the bondline damage has a significant effect on the load-carrying capacity of the NSM FRP-to-concrete bonded interface and should be considered in FE modeling of the interface.

Median Filter Architecture by Accumulative Parallel Counters

The time to process each of the W/B processing blocks of a median calculation method on a set of N W-bit integers is improved here by a factor of three compared with literature. The parallelism uncovered in blocks containing B-bit slices is exploited by independent accumulative parallel counters so that the median is calculated faster than any known previous method for any N, W values. The improvements to the method are discussed in the context of calculating the median for a moving set of N integers, for which a pipelined architecture is developed. An extra benefit of a smaller area for the architecture is also reported.

Y-90-Ibritumomab Tiuxetan (Zevalin (R)) Consolidation of First Remission In Advanced-Stage Follicular Non-Hodgkin's Lymphoma: Updated Results After a Median Follow-up of 66.2 Months From the International, Randomized, Phase III First-Line Indolent Trial (FIT) In 414 Patients

The FIT trial was conducted to evaluate the safety and efficacy of 90Y-ibritumomab tiuxetan (0.4 mCi/kg; maximum dose 32 mCi) when used as consolidation of first complete or partial remission in patients with previously untreated, advanced-stage follicular lymphoma (FL). Patients were randomly assigned to either 90Y-ibritumomab treatment (n = 207) or observation (n = 202) within 3 months (mo) of completing initial induction therapy (chemotherapy only: 86%; rituximab in combination with chemotherapy: 14%). Response status prior to randomization did not differ between the groups: 52% complete response (CR)/CR unconfirmed (CRu) to induction therapy and 48% partial response (PR) in the 90Y-ibritumomab arm vs 53% CR/CRu and 44% PR in the control arm. The primary endpoint was progression-free survival (PFS) of the intent-to-treat (ITT) population. Results from the first extended follow-up after a median of 3.5 years revealed a significant improvement in PFS from the time of randomization with 90Y-ibritumomab consolidation compared with control (36.5 vs 13.3 mo, respectively; P < 0.0001; Morschhauser et al. JCO. 2008; 26:5156-5164). Here we report a median follow-up of 66.2 mo (5.5 years). Five-year PFS was 47% in the 90Y-ibritumomab group and 29% in the control group (hazard ratio (HR) = 0.51, 95% CI 0.39-0.65; P < 0.0001). Median PFS in the 90Y-ibritumomab group was 49 mo vs 14 mo in the control group. In patients achieving a CR/CRu after induction, 5-year PFS was 57% in the 90Y-ibritumomab group, and the median had not yet been reached at 92 months, compared with a 43% 5-year PFS in the control group and a median of 31 mo (HR = 0.61, 95% CI 0.42-0.89). For patients in PR after induction, the 5-year PFS was 38% in the 90Y-ibritumomab group with a median PFS of 30 mo vs 14% in the control group with a median PFS of 6 mo (HR = 0.38, 95% CI 0.27-0.53). Patients who had received rituximab as part of induction treatment had a 5-year PFS of 64% in the 90Y-ibritumomab group and 48% in the control group (HR = 0.66, 95% CI 0.30-1.47). For all patients, time to next treatment (as calculated from the date of randomization) differed significantly between both groups; median not reached at 99 mo in the 90Y-ibritumomab group vs 35 mo in the control group (P < 0.0001). The majority of patients received rituximab-containing regimens when treated after progression (63/82 [77%] in the 90Y-ibritumomab group and 102/122 [84%] in the control group). Overall response rate to second-line treatment was 79% in the 90Y-ibritumomab group (57% CR/CRu and 22% PR) vs 78% in the control arm (59% CR/CRu, 19% PR). Five-year overall survival was not significantly different between the groups; 93% and 89% in the 90Y-ibritumomab and control groups, respectively (P = 0.561). To date, 40 patients have died; 18 in the 90Y-ibritumomab group and 22 in the control group. Secondary malignancies were diagnosed in 16 patients in the 90Y-ibritumomab arm vs 9 patients in the control arm (P = 0.19). There were 6 (3%) cases of myelodysplastic syndrome (MDS)/acute myelogenous leukemia (AML) in the 90Y-ibritumomab arm vs 1 MDS in the control arm (P = 0.063). In conclusion, this extended follow-up of the FIT trial confirms the benefit of 90Y-ibritumomab consolidation with a nearly 3 year advantage in median PFS. A significant 5-year PFS improvement was confirmed for patients with a CR/CRu or a PR after induction. Effective rescue treatment with rituximab-containing regimens may explain the observed no difference in overall survival between both patient groups who were - for the greater part - rituximab-naïve.

ON THE MEDIAN AND THE ANTIMEDIAN OF A COGRAPH

this paper, the median and the antimedian of cographs are discussed. It is shown that if G, and G2 are any two cographs, then there is a cograph that is both Eulerian and Hamiltonian having Gl as its median and G2 as its antimedian. Moreover, the connected planar and outer planar cographs are characterized and the median and antimedian graphs of connected, planar cographs are listed.

Median filtering: structure analysis and application

Median filtering is a simple digital non—linear signal smoothing operation in which median of the samples in a sliding window replaces the sample at the middle of the window. The resulting filtered sequence tends to follow polynomial trends in the original sample sequence. Median filter preserves signal edges while filtering out impulses. Due to this property, median filtering is finding applications in many areas of image and speech processing. Though median filtering is simple to realise digitally, its properties are not easily analysed with standard analysis techniques,

Computing median and antimedian sets in median graphs

The median (antimedian) set of a profile π = (u1, . . . , uk) of vertices of a graphG is the set of vertices x that minimize (maximize) the remoteness i d(x,ui ). Two algorithms for median graphs G of complexity O(nidim(G)) are designed, where n is the order and idim(G) the isometric dimension of G. The first algorithm computes median sets of profiles and will be in practice often faster than the other algorithm which in addition computes antimedian sets and remoteness functions and works in all partial cubes

On the remoteness function in median graphs

A profile on a graph G is any nonempty multiset whose elements are vertices from G. The corresponding remoteness function associates to each vertex x 2 V.G/ the sum of distances from x to the vertices in the profile. Starting from some nice and useful properties of the remoteness function in hypercubes, the remoteness function is studied in arbitrary median graphs with respect to their isometric embeddings in hypercubes. In particular, a relation between the vertices in a median graph G whose remoteness function is maximum (antimedian set of G) with the antimedian set of the host hypercube is found. While for odd profiles the antimedian set is an independent set that lies in the strict boundary of a median graph, there exist median graphs in which special even profiles yield a constant remoteness function. We characterize such median graphs in two ways: as the graphs whose periphery transversal number is 2, and as the graphs with the geodetic number equal to 2. Finally, we present an algorithm that, given a graph G on n vertices and m edges, decides in O.mlog n/ time whether G is a median graph with geodetic number 2

Simultaneous Embeddings Of Graphs As Median And Antimedian Subgraphs

The distance DG(v) of a vertex v in an undirected graph G is the sum of the distances between v and all other vertices of G. The set of vertices in G with maximum (minimum) distance is the antimedian (median) set of a graph G. It is proved that for arbitrary graphs G and J and a positive integer r 2, there exists a connected graph H such that G is the antimedian and J the median subgraphs of H, respectively, and that dH(G, J) = r. When both G and J are connected, G and J can in addition be made convex subgraphs of H.

Median Sets and Median Number of a Graph

A profile is a finite sequence of vertices of a graph. The set of all vertices of the graph which minimises the sum of the distances to the vertices of the profile is the median of the profile. Any subset of the vertex set such that it is the median of some profile is called a median set. The number of median sets of a graph is defined to be the median number of the graph. In this paper, we identify the median sets of various classes of graphs such as Kp − e, Kp,q forP > 2, and wheel graph and so forth. The median numbers of these graphs and hypercubes are found out, and an upper bound for the median number of even cycles is established.We also express the median number of a product graph in terms of the median number of their factors.

Almost Self-Centered Median And Chordal Graphs

Almost self-centered graphs were recently introduced as the graphs with exactly two non-central vertices. In this paper we characterize almost selfcentered graphs among median graphs and among chordal graphs. In the first case P4 and the graphs obtained from hypercubes by attaching to them a single leaf are the only such graphs. Among chordal graph the variety of almost self-centered graph is much richer, despite the fact that their diameter is at most 3. We also discuss almost self-centered graphs among partial cubes and among k-chordal graphs, classes of graphs that generalize median and chordal graphs, respectively. Characterizations of almost self-centered graphs among these two classes seem elusive

The median function on graphs with bounded profiles

The median of a profile = (u1, . . . , uk ) of vertices of a graph G is the set of vertices x that minimize the sum of distances from x to the vertices of . It is shown that for profiles with diameter the median set can be computed within an isometric subgraph of G that contains a vertex x of and the r -ball around x, where r > 2 − 1 − 2 /| |. The median index of a graph and r -joins of graphs are introduced and it is shown that r -joins preserve the property of having a large median index. Consensus strategies are also briefly discussed on a graph with bounded profiles.