Loss performance of tagged and normal ATM cells at a partiallyshared buffer

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     

Evaluation of the efficacy of sequential intravenous-oral administration of pefloxacin in community-acquired lower respiratory tract infections in patients with underlying conditions

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.     

Parallel triangulation of a polygon in two calls to the trapezoidal map

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.     

FTIR characterization of tropical wood–polymer composites

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.     

An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints

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.     

Formulating efficient software solution for digital image processing system

Digital image processing systems are complex, being usually composed of different computer vision libraries. Algorithm implementations cannot be directly used in conjunction with algorithms developed using other computer vision libraries. This paper formulates a software solution by proposing a processor with the capability of handling different types of image processing algorithms, which allow the end users to install new image processing algorithms from any library. This approach has other functionalities like capability to process one or more images, manage multiple processing jobs simultaneously and maintain the manner in which an image was processed for later use. It is a computational efficient and promising technique to handle variety of image processing algorithms. To promote the reusability and adaptation of the package for new types of analysis, a feature of sustainability is established. The framework is integrated and tested on a medical imaging application, and the software is made freely available for the reader. Future work involves introducing the capability to connect to another instance of processing service with better performance. Copyright © 2015 John Wiley & Sons, Ltd.     

Integrating functional,social, and psychological determinants to explain online social networking usage

People involved in business are increasingly aware of the online social phenomenon and its potential as a marketing tool. Building upon the marketing, social psychology, and information system literature, this study empirically examines a set of functional determinants derived from the technology acceptance model and socio-psychological determinants drawn from the theory of reasoned action and social cognitive theory that may be responsible for the motivations of participants in online social networks. We propose a model by integrating functional, social, and psychological factors in predicting attitude and online social network usage. The survey outcomes from a cross-sectional study among 387 Facebook users in Malaysia support the hypothesised model. This study contributes by extending the cognitive learning theories in predicting online social networking usage. Particularly, this research presents a different perspective on online social networking by exploring the mediating effect of attitude and the moderating role of individual characteristics. This study demonstrates that desirable changes in the perception of functional benefits, self-efficacy, and need for cognition as well as perceptions of social pressure from significant others might lead to corresponding changes in attitude towards online social networking. Results of the study support the model efficacy and predictive ability of the proposed integrative model which may serve as a theoretical foundation for future researchers interested in examining other virtual community engagements such as blogging, online advertising, and online public relations activities.     

Parametric Sequence Alignment with Constraints

Approximate matching techniques based on string alignment are important tools for investigating similarities between strings, such as those representing DNA and protein sequences. We propose a constraint based approach for parametric sequence alignment which allows for more general string alignment queries where the alignment cost can itself be parameterized as a query with some initial constraints. Thus, the costs need not be fixed in a parametric alignment query unlike the case in normal alignment. The basic dynamic programming string edit distance algorithm is generalized to a naive algorithm which uses inequalities to represent the alignment score. The naive algorithm is rather costly and the remainder of the paper develops an improvement which prunes alternatives where it can and approximates the alternatives otherwise. This reduces the number of inequalities significantly and strengthens the constraint representation with equalities. We present some preliminary results using parametric alignment on some general alignment queries.     

A Simultaneous Search Problem

We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x,y ∈ [0,1] with as little uncertainty as possible, using some given number k of probes. Each probe is specified by a real number r∈ [0,1] . After a probe at r , we are told whether x≤ r or x \geq r , and whether y≤ r or y\geq r . We derive the optimal strategy and prove that the asymptotic behavior of the total uncertainty after k probes is 13/7 2 ^-(k+1)/2 for odd k and 13/10 2 ^-k/2 for even k . Received November 11, 1996; revised October 2, 1997, and July 13, 1998.     

An Effective Technique for Subpixel Image Registration Under Noisy Conditions

This paper proposes an effective higher order statistics method to address subpixel image registration. Conventional power spectrum-based techniques employ second-order statistics to estimate subpixel translation between two images. They are, however, susceptible to noise, thereby leading to significant performance deterioration in low signal-to-noise ratio environments or in the presence of cross-correlated channel noise. In view of this, we propose a bispectrum-based approach to alleviate this difficulty. The new method utilizes the characteristics of bispectrum to suppress Gaussian noise. It develops a phase relationship between the image pair and estimates the subpixel translation by solving a set of nonlinear equations. Experimental results show that the proposed technique provides performance improvement over conventional power-spectrum-based methods under different noise levels and conditions.