Mechanism of heat transport in nanofluids

We have calculated thermal conductivity of alumina nanofluids (with water and ethylene glycol as base fluids) using temperature as well as concentration-dependent viscosity, η. The temperature profile of η is obtained using Gaussian fit to the available experimental data. In the model, the interfacial resistance effects are incorporated through a phenomenological parameter α. The micro-convection of the alumina nanoparticle (diameter less than 100 nm) is included through Reynolds and Prandtl numbers. The model is further improved by explicitly incorporating the thermal conductivity of the nanolayer surrounding the nanoparticles. Using this improved model, thermal conductivity of copper nanofluid is calculated. These calculations capture the particle concentration-dependent thermal conductivity and predict the dependence of the thermal conductivity on the size of the nanoparticle. These studies are significant to understand the underlying processes of heat transport in nanofluids and are crucial to design superior coolants of next generation.     

Miniaturization and bandwidth enhancement of a cavity backed circular microstrip patch antenna

The resonant frequency of a circular patch antenna with and without circular cavity is measured. The patch miniaturization in the presence of the cavity is proved. Different methods of reducing resonant frequencies and broadening bandwidth without significantly reducing antenna gain are presented. Capacitively loaded patch and slits on the patch stimulate the patch at lower frequencies and multiple resonances, thus help miniaturization. Finally ferrite loading on the feed probe further increases the bandwidth without significantly reducing the antenna gain. The method is much more improved than that for a resistive loaded patch and a deformed patch. © 2007 Wiley Periodicals, Inc. Int J RF and Microwave CAE, 2007.     

Synthesis of corneal keratan sulfate proteoglycans by bovine keratocytes in vitro

Keratan sulfate proteoglycans (KSPGs) are the major proteoglycans of the cornea and are secreted by keratocytes in the corneal stroma. Previous studies have been able to show only transient secretion of KSPG in cell culture. In this study, cultures of bovine keratocytes were found to secrete the three previously characterized KSPG proteins into culture medium. Reactivity with monoclonal antibody I22 demonstrated substitution of these proteins with keratan sulfate chains. KSPG constituted 15% of the proteoglycan metabolically labeled with [35S]sulfate in keratocyte culture medium. This labeled KSPG contained keratan sulfate chains of 4700 Da compared to 21,000 Da for bovine corneal keratan sulfate. Labeled keratan sulfate from cultures contained nonsulfated, monosulfated, and disulfated disaccharides that were released by digestion with endo-beta-galactosidase or keratanase II. Nonsulfated disaccharides were relatively more abundant in keratan sulfate from culture than in corneal keratan sulfate. These results show that cultured bovine keratocytes maintain the ability to express all three of the known KSPG proteins, modified with keratan sulfate chains and sulfated on both N-acetylglucosamine and galactose moieties. KSPG made in vitro differs from that found in vivo in the length and sulfation of its keratan sulfate chains. The availability of cell cultures secreting corneal keratan sulfate proteoglycans provides an opportunity to examine biosynthesis and control of this important class of molecules.     

Selection of optimized features for fusion of palm print and finger knuckle‐based person authentication

The impact of digital technology in biometrics is much more efficient at interpreting data than humans, which results in completely replacement of manual identification procedures in forensic science. Because the single modality‐based biometric frameworks limit performance in terms of accuracy and anti‐spoofing capabilities due to the presence of low quality data, therefore, information fusion of more than one biometric characteristic in pursuit of high recognition results can be beneficial. In this article, we present a multimodal biometric system based on information fusion of palm print and finger knuckle traits, which are least associated to any criminal investigation as evidence yet. The proposed multimodal biometric system might be useful to identify the suspects in case of physical beating or kidnapping and establish supportive scientific evidences, when no fingerprint or face information is present in photographs. The first step in our work is data preprocessing, in which region of interest of palm and finger knuckle images have been extracted. To minimize nonuniform illumination effects, we first normalize the detected circular palm or finger knuckle and then apply line ordinal pattern (LOP)‐based encoding scheme for texture enrichment. The nondecimated quaternion wavelet provides denser feature representation at multiple scales and orientations when extracted over proposed LOP encoding and increases the discrimination power of line and ridge features. To best of our knowledge, this first attempt is a combination of backtracking search algorithm and 2D²LDA has been employed to select the dominant palm and knuckle features for classification. The classifiers output for two modalities are combined at unsupervised rank level fusion rule through Borda count method, which shows an increase in performance in terms of recognition and verification, that is, 100% (correct recognition rate), 0.26% (equal error rate), 3.52 (discriminative index), and 1,262 m (speed).     

Favorable influence of ssDNA-functionalized SWCNT on the navigation pattern of C. elegans

Microsystem Technologies - Single-Walled Carbon Nanotubes (SWCNTs) are widely used as potential carriers in drug delivery systems. The objective of this work was to observe the effects of pristine,...     

Retraction of “Developing an integrated display of health data for aging in place”

The following article from Human Factors and Ergonomics in Manufacturing & Service Industries, “Developing an Integrated Display of Health Data for Aging in Place,” by Yang Gong and Arpita Chandra, published online on October 20, 2011 in Wiley Online Library ( www.onlinelibrary.wiley.com ), has been retracted by agreement between the authors, the journal Editors‐in‐Chief, Waldemar Karwowski and Gavriel Salvendy, and Publisher Wiley Periodicals, Inc. The retraction has been agreed as these articles were mistakenly published after being rejected.     

I-convergence in probabilistic n-normed space

In this article we introduce the notion of I-Cauchy sequence and I-convergent sequence in probabilistic n-normed space. The concept of I*-Cauchy sequence and I*-convergence in probabilistic n-normed space are also introduced and some of their properties related to these notions have been established.     

Average-case analysis of the Modified Harmonic algorithm

In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf ₁ andf ₂ be two linear combinations of random variables {N _i } _i=1 ^k where theN _i 's have a joint multinomial distribution for eachn= _i=1 ^k ,N _i . LetE(f ₁) O andE(f ₂) 0. Then lim_n E(max(_{f 1},f ₂ ))/n = lim _n max(E(f ₁),E(f ₂))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.     

Average-case analysis of the Modified Harmonic algorithm

In this paper we analyze the average-case performance of the Modified Harmonic algorithm for on-line bin packing. We first analyze the average-case performance for arbitrary distribution of item sizes over (0,1]. This analysis is based on the following result. Letf ₁ andf ₂ be two linear combinations of random variables {N _i } _i=1 ^k where theN _i 's have a joint multinomial distribution for eachn=σ _i=1 ^k ,N _i . LetE(f ₁) ≠ O andE(f ₂)≠ 0. Then lim_{n →}∞E(max(_{f 1},f ₂ ))/n = lim _n →∞ max(E(f ₁),E(f ₂))/n. We then consider the special case when the item sizes are uniformly distributed over (0,1]. For specific values of the parameters, the Modified Harmonic algorithm turns out to be better than the other two linear-time on-line algorithms—Next Fit and Harmonic—in both the worst case as well as the average case. We also obtain optimal values for the parameters of the algorithm from the average-case standpoint. For these values of the parameters, the average-case performance ratio is less than 1.19. This compares well with the performance ratios 1.333. and 1.2865. of the Next Fit algorithm and the Harmonic algorithm, respectively.