The loss performance of tagged and normal ATM cells at a first-in-first-out (FIFO) buffer is studied. The authors show that if a partial buffer sharing mechanism is adopted the loss probability of normal cells can be firmly guaranteed, regardless of the traffic intensity of tagged cells 相似文献
We studied the efficacy of sequential intravenous-oral pefloxacin therapy in community-acquired lower respiratory tract infection in 24 patients with one or more underlying conditions. Twenty-eight patients were enrolled into the study but only 24 patients were evaluated. There were 16 males and 8 females with a mean age of 66.9 +/- 11.2 years (mean +/- SD, range 46 to 87 years). The underlying conditions present were bronchiectasis, chronic obstructive lung disease and diabetes mellitus. Patients who were older than 70 years but without any underlying condition were also enrolled. All received 4 days of intravenous pefloxacin 400 mg twice a day followed by oral pefloxacin 400 mg twice a day for another 10 days. Assessment of success was based on clinical, microbiological and radiological improvement. Pefloxacin produced 79.2% clinical cure rate. Another 8.3% showed improvement. Pefloxacin was well tolerated. There were few adverse effects and none of the patients required a change of antibiotic. Pefloxacin was an effective and well tolerated treatment for respiratory tract infection and had the advantage of broad in-vitro antibacterial activity, twice daily dosing and sequential availability in an intravenous and oral formulation. 相似文献
The importance of the misframe times for DS1 frame synchronization has often been addressed in designing and using network elements and mediation units. By extending the work of J. H. Eu and W. W. Rollins (1991), Markov chain first passage time analysis is used to derive higher moments of the misframe times in both random and burst error environments. This methodology is of great value in evaluating frame synchronization techniques for digital transmission systems. By experimenting with several out-of-frame detection schemes and reasonable values for bit error ratio (BER), it is shown that misframe times are always approximately exponentially distributed for all schemes 相似文献
We give a parallel method for triangulating a simple polygon by two (parallel) calls to the trapezoidal map computation. The method is simpler and more elegant than previous methods. Along the way we obtain an interesting partition of one-sided monotone polygons. Using the best-known trapezoidal map algorithm, ours run in timeO(logn) usingO(n) CREW PRAM processors. 相似文献
Wood–polymer composites (WPC) of Geronggang (Cratoxylon arborescens), a light tropical hardwood, impregnated with methyl methacrylate (MMA), methyl methacrylate-co-acrylonitrile (1 : 1; MAN), and styrene-co-acrylonitrile (3 : 2; STAN), were prepared by in situ polymerization using gamma radiation or the catalyst–heat treatment. The FTIR spectra of the three types of WPC, with polymer loadings ranging from 10 to 70%, were compared with that of the wood itself and the respective polymers. Characteristic peaks due to C?O vibration of MMA, C?N stretching of acrylonitrile, and ring stretching and bending of styrene monomers, were prominent in the samples that had higher polymer loadings. For the copolymeric systems, quantitation of the FTIR spectra of these characteristic peaks enabled calculations of incorporated acrylonitrile and styrene monomers in the composites to be made. The FTIR spectra of the residues remaining, after exhaustive extraction to remove homopolymer, showed that graft copolymerization of wood components with acrylonitrile and styrene monomers was possible, but not with MMA. Composites prepared by the two methods, gamma radiation and the catalyst–heat treatment, were shown to be chemically very similar. 相似文献
Surface modification of two types of fluorinated polyimide (FPI) films, either by plasma polymerization and deposition of 4‐vinylpyridine (4VP) or by UV‐induced graft copolymerization with 4VP under atmospheric conditions, was carried out for adhesion enhancement with the electrolessly deposited copper. X‐ray photoelectron spectroscopy (XPS) and Fourier transform infrared (FTIR) results revealed that the pyridine groups in the plasma polymerized 4VP (pp‐4VP) layer could be preserved to a large extent under proper glow discharge conditions. The grafted 4VP layer with well‐preserved pyridine groups was used not only as the chemisorption sites for the palladium complexes (without the need for prior sensitization by SnCl2) during the electroless plating of copper, but also as an adhesion promotion layer for the electrolessly deposited copper. The T‐peel adhesion strength of the electrolessly deposited copper with both the 4VP plasma‐polymerized FPI (pp‐4VP‐FPI) film and the 4VP graft‐copolymerized FPI (4VP‐g‐FPI) film was much higher than that of the electrolessly deposited copper with the pristine or the Ar plasma‐treated FPI films. The high adhesion strength between the electrolessly deposited copper and the surface‐modified FPI film was attributed to the fact that the plasma‐polymerized and the UV graft‐copolymerized 4VP chains were covalently tethered on the FPI surfaces, as well as the fact that these grafted 4VP polymer chains were spatially and reactively distributed into the copper matrix.
A table constraint is explicitly represented as its set of solutions or non-solutions. This ad hoc (or extensional) representation
may require space exponential to the arity of the constraint, making enforcing GAC expensive. In this paper, we address the
space and time inefficiencies simultaneously by presenting the mddc constraint. mddc is a global constraint that represents its (non-)solutions with a multi-valued decision diagram (MDD). The MDD-based representation
has the advantage that it can be exponentially smaller than a table. The associated GAC algorithm (called mddc) has time complexity linear to the size of the MDD, and achieves full incrementality in constant time. In addition, we show
how to convert a positive or negative table constraint into an mddc constraint in time linear to the size of the table. Our experiments on structured problems, car sequencing and still-life,
show that mddc is also a fast GAC algorithm for some global constraints such as sequence and regular. We also show that mddc is faster than the state-of-the-art generic GAC algorithms in Gent et al. (2007), Lecoutre and Szymanek (2006), Lhomme and Régin (2005) for table constraint. 相似文献