International Journal of Engineering, Mathematical and Physical Sciences

A CFD Study of Turbulent Convective Heat Transfer Enhancement in Circular Pipeflow

Year: 2012 Volume: 6 Issue: 8 995 - 1002 Pages

Abstract: Addition of milli or micro sized particles to the heat transfer fluid is one of the many techniques employed for improving heat transfer rate. Though this looks simple, this method has practical problems such as high pressure loss, clogging and erosion of the material of construction. These problems can be overcome by using nanofluids, which is a dispersion of nanosized particles in a base fluid. Nanoparticles increase the thermal conductivity of the base fluid manifold which in turn increases the heat transfer rate. Nanoparticles also increase the viscosity of the basefluid resulting in higher pressure drop for the nanofluid compared to the base fluid. So it is imperative that the Reynolds number (Re) and the volume fraction have to be optimum for better thermal hydraulic effectiveness. In this work, the heat transfer enhancement using aluminium oxide nanofluid using low and high volume fraction nanofluids in turbulent pipe flow with constant wall temperature has been studied by computational fluid dynamic modeling of the nanofluid flow adopting the single phase approach. Nanofluid, up till a volume fraction of 1% is found to be an effective heat transfer enhancement technique. The Nusselt number (Nu) and friction factor predictions for the low volume fractions (i.e. 0.02%, 0.1 and 0.5%) agree very well with the experimental values of Sundar and Sharma (2010). While, predictions for the high volume fraction nanofluids (i.e. 1%, 4% and 6%) are found to have reasonable agreement with both experimental and numerical results available in the literature. So the computationally inexpensive single phase approach can be used for heat transfer and pressure drop prediction of new nanofluids.

Gene Expression Data Classification Using Discriminatively Regularized Sparse Subspace Learning

Year: 2011 Volume: 5 Issue: 3 374 - 378 Pages

Authors:
Chunming Xu

Abstract: Sparse representation which can represent high dimensional data effectively has been successfully used in computer vision and pattern recognition problems. However, it doesn-t consider the label information of data samples. To overcome this limitation, we develop a novel dimensionality reduction algorithm namely dscriminatively regularized sparse subspace learning(DR-SSL) in this paper. The proposed DR-SSL algorithm can not only make use of the sparse representation to model the data, but also can effective employ the label information to guide the procedure of dimensionality reduction. In addition,the presented algorithm can effectively deal with the out-of-sample problem.The experiments on gene-expression data sets show that the proposed algorithm is an effective tool for dimensionality reduction and gene-expression data classification.

An Advanced Stereo Vision Based Obstacle Detection with a Robust Shadow Removal Technique

Year: 2010 Volume: 4 Issue: 7 913 - 918 Pages

Abstract: This paper presents a robust method to detect obstacles in stereo images using shadow removal technique and color information. Stereo vision based obstacle detection is an algorithm that aims to detect and compute obstacle depth using stereo matching and disparity map. The proposed advanced method is divided into three phases, the first phase is detecting obstacles and removing shadows, the second one is matching and the last phase is depth computing. We propose a robust method for detecting obstacles in stereo images using a shadow removal technique based on color information in HIS space, at the first phase. In this paper we use Normalized Cross Correlation (NCC) function matching with a 5 × 5 window and prepare an empty matching table τ and start growing disparity components by drawing a seed s from S which is computed using canny edge detector, and adding it to τ. In this way we achieve higher performance than the previous works [2,17]. A fast stereo matching algorithm is proposed that visits only a small fraction of disparity space in order to find a semi-dense disparity map. It works by growing from a small set of correspondence seeds. The obstacle identified in phase one which appears in the disparity map of phase two enters to the third phase of depth computing. Finally, experimental results are presented to show the effectiveness of the proposed method.

Analysis for a Food Chain Model with Crowley–Martin Functional Response and Time Delay

Year: 2010 Volume: 4 Issue: 1 75 - 78 Pages

Abstract: This paper is concerned with a nonautonomous three species food chain model with Crowley–Martin type functional response and time delay. Using the Mawhin-s continuation theorem in theory of degree, sufficient conditions for existence of periodic solutions are obtained.

Connectivity Characteristic of Transcription Factor

Year: 2009 Volume: 3 Issue: 4 259 - 262 Pages

Abstract: Transcription factors are a group of proteins that helps for interpreting the genetic information in DNA. Protein-protein interactions play a major role in the execution of key biological functions of a cell. These interactions are represented in the form of a graph with nodes and edges. Studies have showed that some nodes have high degree of connectivity and such nodes, known as hub nodes, are the inevitable parts of the network. In the present paper a method is proposed to identify hub transcription factor proteins using sequence information. On a complete data set of transcription factor proteins available from the APID database, the proposed method showed an accuracy of 77%, sensitivity of 79% and specificity of 76%.

The Statistical Properties of Filtered Signals

Year: 2013 Volume: 7 Issue: 5 825 - 828 Pages

Abstract: In this paper, the statistical properties of filtered or convolved signals are considered by deriving the resulting density functions as well as the exact mean and variance expressions given a prior knowledge about the statistics of the individual signals in the filtering or convolution process. It is shown that the density function after linear convolution is a mixture density, where the number of density components is equal to the number of observations of the shortest signal. For circular convolution, the observed samples are characterized by a single density function, which is a sum of products.

Improved Asymptotic Stability Criteria for Uncertain Neutral Systems with Time-varying Discrete Delays

Year: 2010 Volume: 4 Issue: 1 69 - 74 Pages

Abstract: This paper investigates the robust stability of uncertain neutral system with time-varying delay. By using Lyapunov method and linear matrix inequality technology, new delay-dependent stability criteria are obtained and formulated in terms of linear matrix inequalities (LMIs), which can be easy to check the robust stability of the considered systems. Numerical examples are given to indicate significant improvements over some existing results.

Almost Periodic Sequence Solutions of a Discrete Cooperation System with Feedback Controls

Year: 2011 Volume: 5 Issue: 8 1284 - 1292 Pages

Abstract: In this paper, we consider the almost periodic solutions of a discrete cooperation system with feedback controls. Assuming that the coefficients in the system are almost periodic sequences, we obtain the existence and uniqueness of the almost periodic solution which is uniformly asymptotically stable.

Direct Numerical Simulation of Oxygen Transfer at the Air-Water Interface in a Convective Flow Environment and Comparison to Experiments

Year: 2011 Volume: 5 Issue: 6 844 - 848 Pages

Authors:
B. Kubrak J. Wissink H. Herlina

Abstract: Two-dimensional Direct Numerical Simulation (DNS) of high Schmidt number mass transfer in a convective flow environment (Rayleigh-B'enard) is carried out and results are compared to experimental data. A fourth-order accurate WENO-scheme has been used for scalar transport in order to aim for a high accuracy in areas of high concentration gradients. It was found that the typical spatial distance between downward plumes of cold high concentration water and the eddy size are in good agreement with experiments using a combined PIV-LIF technique for simultaneous and spatially synoptic measurements of 2D velocity and concentration fields.

Solving Inhomogeneous Wave Equation Cauchy Problems using Homotopy Perturbation Method

Year: 2009 Volume: 3 Issue: 7 495 - 498 Pages

Abstract: In this paper, He-s homotopy perturbation method (HPM) is applied to spatial one and three spatial dimensional inhomogeneous wave equation Cauchy problems for obtaining exact solutions. HPM is used for analytic handling of these equations. The results reveal that the HPM is a very effective, convenient and quite accurate to such types of partial differential equations (PDEs).

CAD Based Predictive Models of the Undeformed Chip Geometry in Drilling

Year: 2009 Volume: 3 Issue: 4 252 - 258 Pages

Abstract: Twist drills are geometrical complex tools and thus various researchers have adopted different mathematical and experimental approaches for their simulation. The present paper acknowledges the increasing use of modern CAD systems and using the API (Application Programming Interface) of a CAD system, drilling simulations are carried out. The developed DRILL3D software routine, creates parametrically controlled tool geometries and using different cutting conditions, achieves the generation of solid models for all the relevant data involved (drilling tool, cut workpiece, undeformed chip). The final data derived, consist a platform for further direct simulations regarding the determination of cutting forces, tool wear, drilling optimizations etc.

Likelihood Estimation for Stochastic Epidemics with Heterogeneous Mixing Populations

Year: 2011 Volume: 5 Issue: 7 981 - 985 Pages

Authors:
Yilun Shang

Abstract: We consider a heterogeneously mixing SIR stochastic epidemic process in populations described by a general graph. Likelihood theory is developed to facilitate statistic inference for the parameters of the model under complete observation. We show that these estimators are asymptotically Gaussian unbiased estimates by using a martingale central limit theorem.

Influence of Axial Magnetic Field on the Electrical Breakdown and Secondary Electron Emission in Plane-Parallel Plasma Discharge

Year: 2011 Volume: 5 Issue: 8 1278 - 1283 Pages

Abstract: The influence of axial magnetic field (B=0.48 T) on the variation of ionization efficiency coefficient h and secondary electron emission coefficient g with respect to reduced electric field E/P is studied at a new range of plane-parallel electrode spacing (0< d< 20 cm) and different nitrogen working pressure between 0.5-20 Pa. The axial magnetic field is produced from an inductive copper coil of radius 5.6 cm. The experimental data of breakdown voltage is adopted to estimate the mean Paschen curves at different working features. The secondary electron emission coefficient is calculated from the mean Paschen curve and used to determine the minimum breakdown voltage. A reduction of discharge voltage of about 25% is investigated by the applied of axial magnetic field. At high interelectrode spacing, the effect of axial magnetic field becomes more significant for the obtained values of h but it was less for the values of g.

Modified Fast and Exact Algorithm for Fast Haar Transform

Year: 2007 Volume: 1 Issue: 11 542 - 545 Pages

Abstract: Wavelet transform or wavelet analysis is a recently developed mathematical tool in applied mathematics. In numerical analysis, wavelets also serve as a Galerkin basis to solve partial differential equations. Haar transform or Haar wavelet transform has been used as a simplest and earliest example for orthonormal wavelet transform. Since its popularity in wavelet analysis, there are several definitions and various generalizations or algorithms for calculating Haar transform. Fast Haar transform, FHT, is one of the algorithms which can reduce the tedious calculation works in Haar transform. In this paper, we present a modified fast and exact algorithm for FHT, namely Modified Fast Haar Transform, MFHT. The algorithm or procedure proposed allows certain calculation in the process decomposition be ignored without affecting the results.

Computing Center Conditions for Non-analytic Vector Fields with Constant Angular Speed

Year: 2011 Volume: 5 Issue: 12 1961 - 1963 Pages

Authors:
Li Feng

Abstract: We investigate the planar quasi-septic non-analytic systems which have a center-focus equilibrium at the origin and whose angular speed is constant. The system could be changed into an analytic system by two transformations, with the help of computer algebra system MATHEMATICA, the conditions of uniform isochronous center are obtained.

Laplace Decomposition Approximation Solution for a System of Multi-Pantograph Equations

Year: 2013 Volume: 7 Issue: 7 1157 - 1162 Pages

Abstract: In this work we adopt a combination of Laplace transform and the decomposition method to find numerical solutions of a system of multi-pantograph equations. The procedure leads to a rapid convergence of the series to the exact solution after computing a few terms. The effectiveness of the method is demonstrated in some examples by obtaining the exact solution and in others by computing the absolute error which decreases as the number of terms of the series increases.

Survivability of Verhulst-free Populations under Mutation Accumulation

Year: 2012 Volume: 6 Issue: 7 752 - 754 Pages

Abstract: Stable nonzero populations without random deaths caused by the Verhulst factor (Verhulst-free) are a rarity. Majority either grow without bounds or die of excessive harmful mutations. To delay the accumulation of bad genes or diseases, a new environmental parameter Γ is introduced in the simulation. Current results demonstrate that stability may be achieved by setting Γ = 0.1. These steady states approach a maximum size that scales inversely with reproduction age.

Lagrange and Multilevel Wavelet-Galerkin with Polynomial Time Basis for Heat Equation

Year: 2011 Volume: 5 Issue: 12 1951 - 1960 Pages

Abstract: The Wavelet-Galerkin finite element method for solving the one-dimensional heat equation is presented in this work. Two types of basis functions which are the Lagrange and multi-level wavelet bases are employed to derive the full form of matrix system. We consider both linear and quadratic bases in the Galerkin method. Time derivative is approximated by polynomial time basis that provides easily extend the order of approximation in time space. Our numerical results show that the rate of convergences for the linear Lagrange and the linear wavelet bases are the same and in order 2 while the rate of convergences for the quadratic Lagrange and the quadratic wavelet bases are approximately in order 4. It also reveals that the wavelet basis provides an easy treatment to improve numerical resolutions that can be done by increasing just its desired levels in the multilevel construction process.

A Modified Laplace Decomposition Algorithm Solution for Blasius’ Boundary Layer Equation of the Flat Plate in a Uniform Stream

Year: 2013 Volume: 7 Issue: 7 1152 - 1156 Pages

Abstract: In this work, we apply the Modified Laplace decomposition algorithm in finding a numerical solution of Blasius’ boundary layer equation for the flat plate in a uniform stream. The series solution is found by first applying the Laplace transform to the differential equation and then decomposing the nonlinear term by the use of Adomian polynomials. The resulting series, which is exactly the same as that obtained by Weyl 1942a, was expressed as a rational function by the use of diagonal padé approximant.

A Contractor for the Symmetric Solution Set

Year: 2010 Volume: 4 Issue: 11 1426 - 1431 Pages

Authors:
Milan Hladik

Abstract: The symmetric solution set Σ sym is the set of all solutions to the linear systems Ax = b, where A is symmetric and lies between some given bounds A and A, and b lies between b and b. We present a contractor for Σ sym, which is an iterative method that starts with some initial enclosure of Σ sym (by means of a cartesian product of intervals) and sequentially makes the enclosure tighter. Our contractor is based on polyhedral approximation and solving a series of linear programs. Even though it does not converge to the optimal bounds in general, it may significantly reduce the overestimation. The efficiency is discussed by a number of numerical experiments.