Abstract: Xanthan gum is one of the major commercial
biopolymers. Due to its excellent rheological properties xanthan gum
is used in many applications, mainly in food industry. Commercial
production of xanthan gum uses glucose as the carbon substrate;
consequently the price of xanthan production is high. One of the
ways to decrease xanthan price, is using cheaper substrate like
agricultural wastes. Iran is one of the biggest date producer countries.
However approximately 50% of date production is wasted annually.
The goal of this study is to produce xanthan gum from waste date
using Xanthomonas campestris PTCC1473 by submerged
fermentation. In this study the effect of three variables including
phosphor and nitrogen amount and agitation rate in three levels using
response surface methodology (RSM) has been studied. Results
achieved from statistical analysis Design Expert 7.0.0 software
showed that xanthan increased with increasing level of phosphor.
Low level of nitrogen leaded to higher xanthan production. Xanthan
amount, increasing agitation had positive influence. The statistical
model identified the optimum conditions nitrogen amount=3.15g/l,
phosphor amount=5.03 g/l and agitation=394.8 rpm for xanthan. To
model validation, experiments in optimum conditions for xanthan
gum were carried out. The mean of result for xanthan was 6.72±0.26.
The result was closed to the predicted value by using RSM.
Abstract: When acid is pumped into damaged reservoirs for
damage removal/stimulation, distorted inflow of acid into the
formation occurs caused by acid preferentially traveling into highly
permeable regions over low permeable regions, or (in general) into
the path of least resistance. This can lead to poor zonal coverage and
hence warrants diversion to carry out an effective placement of acid.
Diversion is desirably a reversible technique of temporarily reducing
the permeability of high perm zones, thereby forcing the acid into
lower perm zones.
The uniqueness of each reservoir can pose several challenges to
engineers attempting to devise optimum and effective diversion
strategies. Diversion techniques include mechanical placement and/or
chemical diversion of treatment fluids, further sub-classified into ball
sealers, bridge plugs, packers, particulate diverters, viscous gels,
crosslinked gels, relative permeability modifiers (RPMs), foams,
and/or the use of placement techniques, such as coiled tubing (CT)
and the maximum pressure difference and injection rate (MAPDIR)
methodology.
It is not always realized that the effectiveness of diverters greatly
depends on reservoir properties, such as formation type, temperature,
reservoir permeability, heterogeneity, and physical well
characteristics (e.g., completion type, well deviation, length of
treatment interval, multiple intervals, etc.). This paper reviews the
mechanisms by which each variety of diverter functions and
discusses the effect of various reservoir properties on the efficiency
of diversion techniques. Guidelines are recommended to help
enhance productivity from zones of interest by choosing the best
methods of diversion while pumping an optimized amount of
treatment fluid. The success of an overall acid treatment often
depends on the effectiveness of the diverting agents.
Abstract: Interactions among proteins are the basis of various
life events. So, it is important to recognize and research protein
interaction sites. A control set that contains 149 protein molecules
were used here. Then 10 features were extracted and 4 sample sets
that contained 9 sliding windows were made according to features.
These 4 sample sets were calculated by Radial Basis Functional neutral
networks which were optimized by Particle Swarm Optimization
respectively. Then 4 groups of results were obtained. Finally, these 4
groups of results were integrated by decision fusion (DF) and Genetic
Algorithm based Selected Ensemble (GASEN). A better accuracy was
got by DF and GASEN. So, the integrated methods were proved to
be effective.
Abstract: The Artificial immune systems algorithms are Meta
heuristic optimization method, which are used for clustering and
pattern recognition applications are abundantly. These algorithms in
multimodal optimization problems are more efficient than genetic
algorithms. A major drawback in these algorithms is their slow
convergence to global optimum and their weak stability can be
considered in various running of these algorithms. In this paper,
improved Artificial Immune System Algorithm is introduced for the
first time to overcome its problems of artificial immune system. That
use of the small size of a local search around the memory antibodies
is used for improving the algorithm efficiently. The credibility of the
proposed approach is evaluated by simulations, and it is shown that
the proposed approach achieves better results can be achieved
compared to the standard artificial immune system algorithms
Abstract: The fuel cost of the motor vehicle operating on its
common route is an important part of the operating cost. Therefore,
the importance of the fuel saving is increasing day by day. One of the
parameters which improve fuel saving is the regulation of driving
characteristics. The number and duration of stop is increased by the
heavy traffic load. It is possible to improve the fuel saving with
regulation of traffic flow and driving characteristics. The researches
show that the regulation of the traffic flow decreases fuel
consumption, but it is not enough to improve fuel saving without the
regulation of driving characteristics. This study analyses the fuel
consumption of two trips of city bus operating on its common route
and determines the effect of traffic density and driving characteristics
on fuel consumption. Finally it offers some suggestions about
regulation of driving characteristics to improve the fuel saving. Fuel
saving is determined according to the results obtained from
simulation program. When experimental and simulation results are
compared, it has been found that the fuel saving was reached up the
to 40 percent ratios.
Abstract: This paper presents an optimization of the hull
separation, i.e. transverse clearance. The main objective is to identify
the feasible speed ranges and find the optimum transverse clearance
considering the minimum wave-making resistance. The dimensions
and the weight of hardware systems installed in the catamaran
structured fuel cell powered USV (Unmanned Surface Vehicle) were
considered as constraints. As the CAE (Computer Aided Engineering)
platform FRIENDSHIP-Framework was used. The hull surface
modeling, DoE (Design of Experiment), Tangent search optimization,
tool integration and the process automation were performed by
FRIENDSHIP-Framework. The hydrodynamic result was evaluated
by XPAN the potential solver of SHIPFLOW.
Abstract: This paper deals with a portfolio selection problem
based on the possibility theory under the assumption that the returns
of assets are LR-type fuzzy numbers. A possibilistic portfolio model
with transaction costs is proposed, in which the possibilistic mean
value of the return is termed measure of investment return, and the
possibilistic variance of the return is termed measure of investment
risk. Due to considering transaction costs, the existing traditional
optimization algorithms usually fail to find the optimal solution
efficiently and heuristic algorithms can be the best method. Therefore,
a particle swarm optimization is designed to solve the corresponding
optimization problem. At last, a numerical example is given to
illustrate our proposed effective means and approaches.
Abstract: The aim of the current study is to develop a numerical
tool that is capable of achieving an optimum shape and design of
hyperbolic cooling towers based on coupling a non-linear finite
element model developed in-house and a genetic algorithm
optimization technique. The objective function is set to be the
minimum weight of the tower. The geometric modeling of the tower
is represented by means of B-spline curves. The finite element
method is applied to model the elastic buckling behaviour of a tower
subjected to wind pressure and dead load. The study is divided into
two main parts. The first part investigates the optimum shape of the
tower corresponding to minimum weight assuming constant
thickness. The study is extended in the second part by introducing the
shell thickness as one of the design variables in order to achieve an
optimum shape and design. Design, functionality and practicality
constraints are applied.
Abstract: The well known NP-complete problem of the Traveling Salesman Problem (TSP) is coded in genetic form. A software system is proposed to determine the optimum route for a Traveling Salesman Problem using Genetic Algorithm technique. The system starts from a matrix of the calculated Euclidean distances between the cities to be visited by the traveling salesman and a randomly chosen city order as the initial population. Then new generations are then created repeatedly until the proper path is reached upon reaching a stopping criterion. This search is guided by a solution evaluation function.
Abstract: In this study, control performance of a smart base
isolation system consisting of a friction pendulum system (FPS) and a
magnetorheological (MR) damper has been investigated. A fuzzy
logic controller (FLC) is used to modulate the MR damper so as to
minimize structural acceleration while maintaining acceptable base
displacement levels. To this end, a multi-objective optimization
scheme is used to optimize parameters of membership functions and
find appropriate fuzzy rules. To demonstrate effectiveness of the
proposed multi-objective genetic algorithm for FLC, a numerical
study of a smart base isolation system is conducted using several
historical earthquakes. It is shown that the proposed method can find
optimal fuzzy rules and that the optimized FLC outperforms not only a
passive control strategy but also a human-designed FLC and a
conventional semi-active control algorithm.
Abstract: Based on the fuzzy set theory this work develops two
adaptations of iterative methods that solve mathematical programming
problems with uncertainties in the objective function and in
the set of constraints. The first one uses the approach proposed by
Zimmermann to fuzzy linear programming problems as a basis and
the second one obtains cut levels and later maximizes the membership
function of fuzzy decision making using the bound search method.
We outline similarities between the two iterative methods studied.
Selected examples from the literature are presented to validate the
efficiency of the methods addressed.
Abstract: This paper presents a hybrid approach for solving nqueen problem by combination of PSO and SA. PSO is a population based heuristic method that sometimes traps in local maximum. To solve this problem we can use SA. Although SA suffer from many iterations and long time convergence for solving some problems, By good adjusting initial parameters such as temperature and the length of temperature stages SA guarantees convergence. In this article we use discrete PSO (due to nature of n-queen problem) to achieve a good local maximum. Then we use SA to escape from local maximum. The experimental results show that our hybrid method in comparison of SA method converges to result faster, especially for high dimensions n-queen problems.
Abstract: The shortest path routing problem is a multiobjective
nonlinear optimization problem with constraints. This problem has
been addressed by considering Quality of service parameters, delay
and cost objectives separately or as a weighted sum of both
objectives. Multiobjective evolutionary algorithms can find multiple
pareto-optimal solutions in one single run and this ability makes them
attractive for solving problems with multiple and conflicting
objectives. This paper uses an elitist multiobjective evolutionary
algorithm based on the Non-dominated Sorting Genetic Algorithm
(NSGA), for solving the dynamic shortest path routing problem in
computer networks. A priority-based encoding scheme is proposed
for population initialization. Elitism ensures that the best solution
does not deteriorate in the next generations. Results for a sample test
network have been presented to demonstrate the capabilities of the
proposed approach to generate well-distributed pareto-optimal
solutions of dynamic routing problem in one single run. The results
obtained by NSGA are compared with single objective weighting
factor method for which Genetic Algorithm (GA) was applied.
Abstract: This paper proposes a Particle Swarm Optimization
(PSO) based technique for the optimal allocation of Distributed
Generation (DG) units in the power systems. In this paper our aim is
to decide optimal number, type, size and location of DG units for
voltage profile improvement and power loss reduction in distribution
network. Two types of DGs are considered and the distribution load
flow is used to calculate exact loss. Load flow algorithm is combined
appropriately with PSO till access to acceptable results of this
operation. The suggested method is programmed under MATLAB
software. Test results indicate that PSO method can obtain better
results than the simple heuristic search method on the 30-bus and 33-
bus radial distribution systems. It can obtain maximum loss reduction
for each of two types of optimally placed multi-DGs. Moreover,
voltage profile improvement is achieved.
Abstract: The design of technological procedures for
manufacturing certain products demands the definition and
optimization of technological process parameters. Their
determination depends on the model of the process itself and its
complexity. Certain processes do not have an adequate mathematical
model, thus they are modeled using heuristic methods. First part of
this paper presents a state of the art of using soft computing
techniques in manufacturing processes from the perspective of
applicability in modern CAx systems. Methods of artificial
intelligence which can be used for this purpose are analyzed. The
second part of this paper shows some of the developed models of
certain processes, as well as their applicability in the actual
calculation of parameters of some technological processes within the
design system from the viewpoint of productivity.
Abstract: The proposed multiplexer-based novel 1-bit full
adder cell is schematized by using DSCH2 and its layout is generated
by using microwind VLSI CAD tool. The adder cell layout
interconnect analysis is performed by using BSIM4 layout analyzer.
The adder circuit is compared with other six existing adder circuits
for parametric analysis. The proposed adder cell gives better
performance than the other existing six adder circuits in terms of
power, propagation delay and PDP. The proposed adder circuit is
further analyzed for interconnect analysis, which gives better
performance than other adder circuits in terms of layout thickness,
width and height.
Abstract: We consider a network of two M/M/1 parallel queues having the same poisonnian arrival stream with rate λ. Upon his arrival to the system a customer heads to the shortest queue and stays until being served. If the two queues have the same length, an arriving customer chooses one of the two queues with the same probability. Each duration of service in the two queues is an exponential random variable with rate μ and no jockeying is permitted between the two queues. A new numerical method, based on linear programming and convex optimization, is performed for the computation of the steady state solution of the system.
Abstract: The demand for higher performance graphics
continues to grow because of the incessant desire towards realism.
And, rapid advances in fabrication technology have enabled us to
build several processor cores on a single die. Hence, it is important to
develop single chip parallel architectures for such data-intensive
applications. In this paper, we propose an efficient PIM architectures
tailored for computer graphics which requires a large number of
memory accesses. We then address the two important tasks necessary
for maximally exploiting the parallelism provided by the architecture,
namely, partitioning and placement of graphic data, which affect
respectively load balances and communication costs. Under the
constraints of uniform partitioning, we develop approaches for optimal
partitioning and placement, which significantly reduce search space.
We also present heuristics for identifying near-optimal placement,
since the search space for placement is impractically large despite our
optimization. We then demonstrate the effectiveness of our partitioning
and placement approaches via analysis of example scenes; simulation
results show considerable search space reductions, and our heuristics
for placement performs close to optimal – the average ratio of
communication overheads between our heuristics and the optimal was
1.05. Our uniform partitioning showed average load-balance ratio of
1.47 for geometry processing and 1.44 for rasterization, which is
reasonable.
Abstract: We consider the problem of bandwidth allocation in a
substrate network as an optimization problem for the aggregate utility
of multiple applications with diverse requirements and describe a
simulation scheme for dynamically adaptive bandwidth allocation
protocols. The proposed simulation model based on Coloured Petri
Nets (CPN) is realized using CPN Tools.
Abstract: The intention of this paper is, to help the user of evolutionary algorithms to adapt them easier to their problem at hand. For a lot of problems in the technical field it is not necessary to reach an optimum solution, but to reach a good solution in time. In many cases the solution is undetermined or there doesn-t exist a method to determine the solution. For these cases an evolutionary algorithm can be useful. This paper intents to give the user rules of thumb with which it is easier to decide if the problem is suitable for an evolutionary algorithm and how to design them.