Scalability of Multicast Delivery for Non-sequential Streaming Access

To serve asynchronous requests using multicast, two categories of techniques, stream merging and periodic broadcasting have been proposed. For sequential streaming access where requests are uninterrupted from the beginning to the end of an object, these techniques are highly scalable: the required server bandwidth for stream merging grows logarithmically as request arrival rate, and the required server bandwidth for periodic broadcasting varies logarithmically as the inverse of start-up delay. However, sequential access is inappropriate to model partial requests and client interactivity observed in various streaming access workloads. This paper analytically and experimentally studies the scalability of multicast delivery under a non-sequential access model where requests start at random points in the object. We show that the required server bandwidth for any protocols providing immediate service grows at least as the square root of request arrival rate, and the required server bandwidth for any protocols providing delayed service grows linearly with the inverse of start-up delay. We also investigate the impact of limited client receiving bandwidth on scalability. We optimize practical protocols which provide immediate service to non-sequential requests. The protocols utilize limited client receiving bandwidth, and they are near-optimal in that the required server bandwidth is very close to its lower bound.

Sequential Memory with ART: A Self-Organizing Network Capable of Learning Sequences of Patterns

A model which extends the adaptive resonance theory model to sequential memory is presented. This new model learns sequences of events and recalls a sequence when presented with parts of the sequence. A sequence can have repeated events and different sequences can share events. The ART model is modified by creating interconnected sublayers within ART's F2 layer. Nodes within F2 learn temporal patterns by forming recency gradients within LTM. Versions of the ART model like ART I, ART 2, and fuzzy ART can be used.

Comparing impacts of new cropping systems on biodiversity in traditional rural China

This study selected six geographically-similar villages with traditional and alternative cultivation methods (two groups of three, one traditional and two alternatives) in two counties of Henan Province, China—a representative area of the Huang-huai-hai Plain representing traditional rural China. Soil heavy metal concentrations, floral and faunal biodiversity, and socio-economic data were recorded. Heavy metal concentrations of surface soils from three sites in each village were analysed using Inductively Coupled Plasma Mass Spectrometry (ICP-MS, chromium, nickel, copper, cadmium, and lead) and Atomic Absorption Spectrophotometer (AAS, zinc). The floral biodiversity of four land-use types was recorded following the Braun-Blanquet coverage-abundance method using 0.5×0.5m quadrats. The faunal biodiversity of two representative farmland plots was recorded using 0.3×0.3m quadrats at four 0.1m layers. The socio-economic data were recorded through face-to-face interviews of one hundred randomly selected households at each village. Results demonstrate different cultivation methods lead to different impact on above variables. Traditional cultivation led to lower heavy metal concentrations; both alternative managements were associated with massive agrochemical input causing heavy metal pollution in farmlands. Floral distribution was significantly affected by village factors. Diverse cultivation supported high floral biodiversity through multi-scale heterogeneous landscapes containing niches and habitats. Faunal distribution was also significantly affected by village factor nested within soil depth. Different faunal groups responded differently, with Acari being taxonomically diverse and Collembola high in densities. Increase in manual labour and crop number in villages using alternative cultivation may positively affect biodiversity. The results point to the conservation potential of diverse cultivation methods in traditional rural China and other regions under social and political reforms, where traditional agriculture is changing to unified, large-scale mechanized agriculture. This study serves as a baseline for conservation in small-holding agricultural areas of China, and points to the necessity of further studies at larger and longer scales.

A feasibility study evaluating docetaxel-based sequential and combination regimens in the adjuvant therapy of node-positive breast cancer

BACKGROUND AND PURPOSE: Docetaxel is an active agent in the treatment of metastatic breast cancer. We evaluated the feasibility of docetaxel-based sequential and combination regimens as adjuvant therapies for patients with node-positive breast cancer. PATIENTS AND METHODS: Three consecutive groups of patients with node-positive breast cancer or locally-advanced disease, aged < or = 70 years, received one of the following regimens: a) sequential A-->T-->CMF: doxorubicin 75 mg/m2 q 3 weeks x 3, followed by docetaxel 100 mg/m2 q 3 weeks x 3, followed by i.v. CMF days 1 + 8 q 4 weeks x 3; b) sequential accelerated A-->T-->CMF: A and T were administered at the same doses q 2 weeks; c) combination therapy: doxorubicin 50 mg/m2 + docetaxel 75 mg/m2 q 3 weeks x 4, followed by CMF x 4. When indicated, radiotherapy was administered during or after CMF, and tamoxifen started after the end of CMF. RESULTS: Seventy-nine patients have been treated. Median age was 48 years. A 30% rate of early treatment discontinuation was observed in patients receiving the sequential accelerated therapy (23% during A-->T), due principally to severe skin toxicity. Median relative dose-intensity was 100% in the three treatment arms. The incidence of G3-G4 major toxicities by treated patients, was as follows: skin toxicity a: 5%; b: 27%; c: 0%; stomatitis a: 20%; b: 20%; c: 3%. The incidence of neutropenic fever was a: 30%; b: 13%; c: 48%. After a median follow-up of 18 months, no late toxicity has been reported. CONCLUSIONS: The accelerated sequential A-->T-->CMF treatment is not feasible due to an excess of skin toxicity. The sequential non accelerated and the combination regimens are feasible and under evaluation in a phase III trial of adjuvant therapy.

3-year results of docetaxel-based sequential and combination regimens in the adjuvant therapy of node-positive breast cancer: a pilot study.

BACKGROUND: Docetaxel has proven efficacy in metastatic breast cancer. In this pilot study, we explored the efficacy/feasibility of docetaxel-based sequential and combination regimens as adjuvant therapy of node-positive breast cancer. PATIENTS AND METHODS: From March 1996 till March 1998, four consecutive groups of patients with stages II and III breast cancer, aged < or = 70 years, received one of the following regimens: a) sequential Doxorubicin (A) --> Docetaxel (T) --> CMF (Cyclophosphamide+Methotrexate+5-Fluorouracil): A 75 mg/m q 3 wks x 3, followed by T100 mg/m2 q 3 wks x 3, followed by i.v. CMF Days 1+8 q 4 wks x 3; b) sequential accelerated A --> T --> CMF: A and T administered at the same doses q 2 wks with Lenograstin support; c) combination therapy: A 50 mg/m2 + T 75 mg/m2 q 3 wks x 4, followed by CMF x 4; d) sequential T --> A --> CMF: T and A, administered as in group a), with the reverse sequence. When indicated, radiotherapy was administered during or after CMF, and Tamoxifen after CMF. RESULTS: Ninety-three patients were treated. The median age was 48 years (29-66) and the median number of positive axillary nodes was 6 (1-25). Tumors were operable in 94% and locally advanced in 6% of cases. Pathological tumor size was >2 cm in 72% of cases. There were 21 relapses, (18 systemic, 3 locoregional) and 11 patients (12%) have died from disease progression. At median follow-up of 39 months (6-57), overall survival (OS) was 87% (95% CI, 79-94%) and disease-free survival (DFS) was 76% (95% CI, 67%-85%). CONCLUSION: The efficacy of these docetaxel-based regimens, in terms of OS and DFS, appears to be at least as good as standard anthracycline-based adjuvant chemotherapy (CT), in similar high-risk patient populations.

Sequential anomaly detection in the presence of noise and limited feedback

This paper describes a methodology for detecting anomalies from sequentially observed and potentially noisy data. The proposed approach consists of two main elements: 1) filtering, or assigning a belief or likelihood to each successive measurement based upon our ability to predict it from previous noisy observations and 2) hedging, or flagging potential anomalies by comparing the current belief against a time-varying and data-adaptive threshold. The threshold is adjusted based on the available feedback from an end user. Our algorithms, which combine universal prediction with recent work on online convex programming, do not require computing posterior distributions given all current observations and involve simple primal-dual parameter updates. At the heart of the proposed approach lie exponential-family models which can be used in a wide variety of contexts and applications, and which yield methods that achieve sublinear per-round regret against both static and slowly varying product distributions with marginals drawn from the same exponential family. Moreover, the regret against static distributions coincides with the minimax value of the corresponding online strongly convex game. We also prove bounds on the number of mistakes made during the hedging step relative to the best offline choice of the threshold with access to all estimated beliefs and feedback signals. We validate the theory on synthetic data drawn from a time-varying distribution over binary vectors of high dimensionality, as well as on the Enron email dataset. © 1963-2012 IEEE.

Finite mixture distributions, sequential likelihood and the EM algorithm

A popular way to account for unobserved heterogeneity is to assume that the data are drawn from a finite mixture distribution. A barrier to using finite mixture models is that parameters that could previously be estimated in stages must now be estimated jointly: using mixture distributions destroys any additive separability of the log-likelihood function. We show, however, that an extension of the EM algorithm reintroduces additive separability, thus allowing one to estimate parameters sequentially during each maximization step. In establishing this result, we develop a broad class of estimators for mixture models. Returning to the likelihood problem, we show that, relative to full information maximum likelihood, our sequential estimator can generate large computational savings with little loss of efficiency.

The impact of cropping on wild populations of Saguinus mystax and Saguinus fuscicollis in Peru

A transect census technique was used to estimate the population densities of Saguinus mystax and Saguinus fuscicollis at two sites in Peru. Cropping of these two species had occurred five years before the census at one site and two years before at the other. The populations of S. mystax at both sites had recovered completely from cropping, and the relationship between S. mystax and S. fuscicollis had not been altered at one site and had been reversed in favor of S. mystax at the other. Copyright © 1984 Wiley‐Liss, Inc., A Wiley Company

A model of sequential heart and composite tissue allotransplant in rats.

BACKGROUND: Some of the 600,000 patients with solid organ allotransplants need reconstruction with a composite tissue allotransplant, such as the hand, abdominal wall, or face. The aim of this study was to develop a rat model for assessing the effects of a secondary composite tissue allotransplant on a primary heart allotransplant. METHODS: Hearts of Wistar Kyoto rats were harvested and transplanted heterotopically to the neck of recipient Fisher 344 rats. The anastomoses were performed between the donor brachiocephalic artery and the recipient left common carotid artery, and between the donor pulmonary artery and the recipient external jugular vein. Recipients received cyclosporine A for 10 days only. Heart rate was assessed noninvasively. The sequential composite tissue allotransplant consisted of a 3 x 3-cm abdominal musculocutaneous flap harvested from Lewis rats and transplanted to the abdomen of the heart allotransplant recipients. The abdominal flap vessels were connected to the femoral vessels. No further immunosuppression was administered following the composite tissue allotransplant. Ten days after composite tissue allotransplantation, rejection of the heart and abdominal flap was assessed histologically. RESULTS: The rat survival rate of the two-stage transplant surgery was 80 percent. The transplanted heart rate decreased from 150 +/- 22 beats per minute immediately after transplant to 83 +/- 12 beats per minute on day 20 (10 days after stopping immunosuppression). CONCLUSIONS: This sequential allotransplant model is technically demanding. It will facilitate investigation of the effects of a secondary composite tissue allotransplant following primary solid organ transplantation and could be useful in developing future immunotherapeutic strategies.

Scheduling batches with sequential job processing for two-machine flow and open shops

In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in batches, and the processing time of a batch is the sum of the processing times of the operations in that batch. A setup time, which depends only on the machine, is required before a batch is processed on a machine, and all jobs in a batch remain at the machine until the entire batch is processed. The aim is to make batching and sequencing decisions, which specify a partition of the jobs into batches on each machine, and a processing order of the batches on each machine, respectively, so that the makespan is minimized. The flow-shop problem is shown to be strongly NP-hard. We demonstrate that there is an optimal solution with the same batches on the two machines; we refer to these as consistent batches. A heuristic is developed that selects the best schedule among several with one, two, or three consistent batches, and is shown to have a worst-case performance ratio of 4/3. For the open-shop, we show that the problem is NP-hard in the ordinary sense. By proving the existence of an optimal solution with one, two or three consistent batches, a close relationship is established with the problem of scheduling two or three identical parallel machines to minimize the makespan. This allows a pseudo-polynomial algorithm to be derived, and various heuristic methods to be suggested.