Abstract: In this paper, an approach to reduce the computation steps required by fast neural networksfor the searching process is presented. The principle ofdivide and conquer strategy is applied through imagedecomposition. Each image is divided into small in sizesub-images and then each one is tested separately usinga fast neural network. The operation of fast neuralnetworks based on applying cross correlation in thefrequency domain between the input image and theweights of the hidden neurons. Compared toconventional and fast neural networks, experimentalresults show that a speed up ratio is achieved whenapplying this technique to locate human facesautomatically in cluttered scenes. Furthermore, fasterface detection is obtained by using parallel processingtechniques to test the resulting sub-images at the sametime using the same number of fast neural networks. Incontrast to using only fast neural networks, the speed upratio is increased with the size of the input image whenusing fast neural networks and image decomposition.
Abstract: In this paper, Exp-function method is used for some exact solitary solutions of the generalized Pochhammer-Chree equation. It has been shown that the Exp-function method, with the help of symbolic computation, provides a very effective and powerful mathematical tool for solving nonlinear partial differential equations. As a result, some exact solitary solutions are obtained. It is shown that the Exp-function method is direct, effective, succinct and can be used for many other nonlinear partial differential equations.
Abstract: Feature-based registration is an effective technique for clinical use, because it can greatly reduce computational costs. However, this technique, which estimates the transformation by using feature points extracted from two images, may cause misalignments. To handle with this limitation, we propose to extract the salient edges and extracted control points (CP) of medical images by using efficiency of multiresolution representation of data nonsubsampled contourlet transform (NSCT) that finds the best feature points. The MR images were first decomposed using the NSCT, and then Edge and CP were extracted from bandpass directional subband of NSCT coefficients and some proposed rules. After edge and CP extraction, mutual information was adopted for the registration of feature points and translation parameters are calculated by using particle swarm optimization (PSO). The experimental results showed that the proposed method produces totally accurate performance for registration medical CT-MR images.
Abstract: This paper considers the (2+1)-dimensional breaking soliton equation in its bilinear form. Some exact solutions to this equation are explicitly derived by the idea of three-wave solution method with the assistance of Maple. We can see that the new idea is very simple and straightforward.
Abstract: For a quick and accurate calculation of spatial neutron
distribution in nuclear power reactors 3D nodal codes are usually
used aiming at solving the neutron diffusion equation for a given
reactor core geometry and material composition. These codes use a
second order polynomial to represent the transverse leakage term. In
this work, a nodal method based on the well known nodal expansion
method (NEM), developed at COPPE, making use of this polynomial
expansion was modified to treat the transverse leakage term for the
external surfaces of peripheral reflector nodes.
The proposed method was implemented into a computational
system which, besides solving the diffusion equation, also solves the
burnup equations governing the gradual changes in material
compositions of the core due to fuel depletion. Results confirm the
effectiveness of this modified treatment of peripheral nodes for
practical purposes in PWR reactors.
Abstract: This study experimentally investigates the heat transfer effects of forced convection and natural convection under different substrate openings design. A computational fluid dynamics (CFD) model was established and implemented to verify and explain the experimental results and heat transfer behavior. It is found that different opening position will destroy the growth of the boundary layer on substrates to alter the cooling ability for both forced under low Reynolds number and natural convection. Nevertheless, having too many opening may reduce heat conduction and affect the overall heat transfer performance. This study provides future researchers with a guideline on designing and electronic package manufacturing.
Abstract: This paper presents a computational study of the separated flow in a planer asymmetric diffuser. The steady RANS equations for turbulent incompressible fluid flow and six turbulence closures are used in the present study. The commercial software code, FLUENT 6.3.26, was used for solving the set of governing equations using various turbulence models. Five of the used turbulence models are available directly in the code while the v2-f turbulence model was implemented via User Defined Scalars (UDS) and User Defined Functions (UDF). A series of computational analysis is performed to assess the performance of turbulence models at different grid density. The results show that the standard k-ω, SST k-ω and v2-f models clearly performed better than other models when an adverse pressure gradient was present. The RSM model shows an acceptable agreement with the velocity and turbulent kinetic energy profiles but it failed to predict the location of separation and attachment points. The standard k-ε and the low-Re k- ε delivered very poor results.
Abstract: There is a world-wide need for the development of sustainable management strategies to control pest infestation and the development of phosphine (PH3) resistance in lesser grain borer (Rhyzopertha dominica). Computer simulation models can provide a relatively fast, safe and inexpensive way to weigh the merits of various management options. However, the usefulness of simulation models relies on the accurate estimation of important model parameters, such as mortality. Concentration and time of exposure are both important in determining mortality in response to a toxic agent. Recent research indicated the existence of two resistance phenotypes in R. dominica in Australia, weak and strong, and revealed that the presence of resistance alleles at two loci confers strong resistance, thus motivating the construction of a two-locus model of resistance. Experimental data sets on purified pest strains, each corresponding to a single genotype of our two-locus model, were also available. Hence it became possible to explicitly include mortalities of the different genotypes in the model. In this paper we described how we used two generalized linear models (GLM), probit and logistic models, to fit the available experimental data sets. We used a direct algebraic approach generalized inverse matrix technique, rather than the traditional maximum likelihood estimation, to estimate the model parameters. The results show that both probit and logistic models fit the data sets well but the former is much better in terms of small least squares (numerical) errors. Meanwhile, the generalized inverse matrix technique achieved similar accuracy results to those from the maximum likelihood estimation, but is less time consuming and computationally demanding.
Abstract: In this work, axisymetric CFD simulation of fixed bed
GTL reactor has been conducted, using computational fluid dynamics
(CFD). In fixed bed CFD modeling, when N (tube-to-particle
diameter ratio) has a large value, it is common to consider the packed
bed as a porous media. Synthesis gas (a mixture of predominantly
carbon monoxide and hydrogen) was fed to the reactor. The reactor
length was 20 cm, divided to three sections. The porous zone was in
the middle section of the reactor. The model equations were solved
employing finite volume method. The effects of particle diameter,
bed voidage, fluid velocity and bed length on pressure drop have
been investigated. Simulation results showed these parameters could
have remarkable impacts on the reactor pressure drop.
Abstract: The river flow forecasting represents a crucial point to employ for improving a management policy addressed to the right use of water resources as well as for conjugating prevention and defense actions against environmental degradation. The difficulties occurring during the field activities encourage the development and implementation of operative computation and measuring methods addressed to time reduction for data acquisition and processing maintaining a good level of accuracy. Therefore, the aim of the present work is to test a new entropy based expeditive methodology for the evaluation of the rating curves on three gauged sections with different geometric and morphological characteristics. The methodology requires the choice of only three verticals along the measure section and the sampling of only the maximum velocity. The results underline how in most conditions the rating curves drawn can replace those built with classic methodologies, simplifying thus the procedures of data monitoring and calculation.
Abstract: A semi-analytic boundary discretization method, the Method of Auxiliary Sources (MAS) is used to analyze Optical Antennas consisting of metallic parts. In addition to standard dipoletype antennas, consisting of two pieces of metal, a new structure consisting of a single metal piece with a tiny groove in the center is analyzed. It is demonstrated that difficult numerical problems are caused because optical antennas exhibit strong material dispersion, loss, and plasmon-polariton effects that require a very accurate numerical simulation. This structure takes advantage of the Channel Plasmon-Polariton (CPP) effect and exhibits a strong enhancement of the electric field in the groove. Also primitive 3D antenna model with spherical nano particles is analyzed.
Abstract: The actual grow of the infrastructure in develop country require sophisticate ways manage the operation and control the quality served. This research wants to concentrate in the operation of this infrastructure beyond the construction. The infrastructure-s operation involves an uncertain environment, where unexpected variables are present every day and everywhere. Decision makers need to make right decisions with right information/data analyzed most in real time. To adequately support their decisions and decrease any negative impact and collateral effect, they need to use computational tools called decision support systems (DSS), but now the main source of information came from common users thought an extensive crowdsourcing
Abstract: Identifying protein coding regions in DNA sequences is a basic step in the location of genes. Several approaches based on signal processing tools have been applied to solve this problem, trying to achieve more accurate predictions. This paper presents a new predictor that improves the efficacy of three techniques that use the Fourier Transform to predict coding regions, and that could be computed using an algorithm that reduces the computation load. Some ideas about the combination of the predictor with other methods are discussed. ROC curves are used to demonstrate the efficacy of the proposed predictor, based on the computation of 25 DNA sequences from three different organisms.
Abstract: The noticeable advance in the area of computer technology has paved the way for the invention of powerful mobile devices. However, limited storage, short battery life, and relatively low computational power define the major problems of such devices. Due to the ever increasing computational requirements, such devices may fail to process needed tasks under certain constraints. One of the proposed solutions to this drawback is the introduction of Collaborative Computing, a new concept dealing with the distribution of computational tasks amongst several handhelds. This paper introduces the basics of Collaborative Computing, and proposes a new protocol that aims at managing and optimizing computing tasks in Ad-Hoc Collaborative Computing Environments.
Abstract: In this paper the multi-mode resource-constrained project scheduling problem with discounted cash flows is considered. Minimizing the makespan and maximization the net present value (NPV) are the two common objectives that have been investigated in the literature. We apply one evolutionary algorithm named multiobjective particle swarm optimization (MOPSO) to find Pareto front solutions. We used standard sets of instances from the project scheduling problem library (PSPLIB). The results are computationally compared respect to different metrics taken from the literature on evolutionary multi-objective optimization.
Abstract: This paper presents unified theory for local (Savitzky-
Golay) and global polynomial smoothing. The algebraic framework
can represent any polynomial approximation and is seamless from
low degree local, to high degree global approximations. The representation
of the smoothing operator as a projection onto orthonormal
basis functions enables the computation of: the covariance matrix
for noise propagation through the filter; the noise gain and; the
frequency response of the polynomial filters. A virtually perfect Gram
polynomial basis is synthesized, whereby polynomials of degree
d = 1000 can be synthesized without significant errors. The perfect
basis ensures that the filters are strictly polynomial preserving. Given
n points and a support length ls = 2m + 1 then the smoothing
operator is strictly linear phase for the points xi, i = m+1. . . n-m.
The method is demonstrated on geometric surfaces data lying on an
invariant 2D lattice.
Abstract: Most of the biclustering/projected clustering algorithms are based either on the Euclidean distance or correlation coefficient which capture only linear relationships. However, in many applications, like gene expression data and word-document data, non linear relationships may exist between the objects. Mutual Information between two variables provides a more general criterion to investigate dependencies amongst variables. In this paper, we improve upon our previous algorithm that uses mutual information for biclustering in terms of computation time and also the type of clusters identified. The algorithm is able to find biclusters with mixed relationships and is faster than the previous one. To the best of our knowledge, none of the other existing algorithms for biclustering have used mutual information as a similarity measure. We present the experimental results on synthetic data as well as on the yeast expression data. Biclusters on the yeast data were found to be biologically and statistically significant using GO Tool Box and FuncAssociate.
Abstract: The theory of Groebner Bases, which has recently been
honored with the ACM Paris Kanellakis Theory and Practice Award,
has become a crucial building block to computer algebra, and is
widely used in science, engineering, and computer science. It is wellknown
that Groebner bases computation is EXP-SPACE in a general
polynomial ring setting.
However, for many important applications in computer science
such as satisfiability and automated verification of hardware and
software, computations are performed in a Boolean ring. In this paper,
we give an algorithm to show that Groebner bases computation is PSPACE
in Boolean rings. We also show that with this discovery,
the Groebner bases method can theoretically be as efficient as
other methods for automated verification of hardware and software.
Additionally, many useful and interesting properties of Groebner
bases including the ability to efficiently convert the bases for different
orders of variables making Groebner bases a promising method in
automated verification.
Abstract: The major focus of this work was to characterize hydrodynamics in a packed-bed with and without static mixer by using Computational Fluid Dynamic (CFD). The commercial software: COMSOL MULTIPHYSICSTM Version 3.3 was used to simulate flow fields of mixed-gas reactants i.e. CO and H2. The packed-bed was a single tube with the inside diameter of 0.8 cm and the length of 1.2 cm. The static mixer was inserted inside the tube. The number of twisting elements was 1 with 0.8 cm in diameter and 1.2 cm in length. The packed-bed with and without static mixer were both packed with approximately 700 spherical structures representing catalyst pellets. Incompressible Navier-Stokes equations were used to model the gas flow inside the beds at steady state condition, in which the inlet Reynolds Number (Re) was 2.31. The results revealed that, with the insertion of static mixer, the gas was forced to flow radially inward and outward between the central portion of the tube and the tube wall. This could help improving the overall performance of the packed-bed, which could be utilized for heterogeneous catalytic reaction such as reforming and Fischer- Tropsch reactions.
Abstract: There are two major variants of the Simplex
Algorithm: the revised method and the standard, or tableau method.
Today, all serious implementations are based on the revised method
because it is more efficient for sparse linear programming problems.
Moreover, there are a number of applications that lead to dense linear
problems so our aim in this paper is to present some computational
results on parallel implementation of dense Simplex Method. Our
implementation is implemented on a SMP cluster using C
programming language and the Message Passing Interface MPI.
Preliminary computational results on randomly generated dense
linear programs support our results.