Abstract: Project managers are the ultimate responsible for the
overall characteristics of a project, i.e. they should deliver the project
on time with minimum cost and with maximum quality. It is vital for
any manager to decide a trade-off between these conflicting
objectives and they will be benefited of any scientific decision
support tool. Our work will try to determine optimal solutions (rather
than a single optimal solution) from which the project manager will
select his desirable choice to run the project. In this paper, the
problem in project scheduling notated as
(1,T|cpm,disc,mu|curve:quality,time,cost) will be studied. The
problem is multi-objective and the purpose is finding the Pareto
optimal front of time, cost and quality of a project
(curve:quality,time,cost), whose activities belong to a start to finish
activity relationship network (cpm) and they can be done in different
possible modes (mu) which are non-continuous or discrete (disc), and
each mode has a different cost, time and quality . The project is
constrained to a non-renewable resource i.e. money (1,T). Because
the problem is NP-Hard, to solve the problem, a meta-heuristic is
developed based on a version of genetic algorithm specially adapted
to solve multi-objective problems namely FastPGA. A sample project
with 30 activities is generated and then solved by the proposed
method.
Abstract: A new numerical scheme based on the H1-Galerkin mixed finite element method for a class of second-order pseudohyperbolic equations is constructed. The proposed procedures can be split into three independent differential sub-schemes and does not need to solve a coupled system of equations. Optimal error estimates are derived for both semidiscrete and fully discrete schemes for problems in one space dimension. And the proposed method dose not requires the LBB consistency condition. Finally, some numerical results are provided to illustrate the efficacy of our method.
Abstract: It is not easy to imagine how the existing city can be
converted to the principles of sustainability, however, the need for
innovation, requires a pioneering phase which must address the main
problems of rehabilitation of the operating models of the city. Today,
however, there is a growing awareness that the identification and
implementation of policies and measures to promote the adaptation,
resilience and reversibility of the city, require the contribution of our
discipline. This breakthrough is present in some recent international
experiences of Climate Plans, in which the envisaged measures are
closely interwoven with those of urban planning. These experiences,
provide some answers principle questions, such as: how the strategies
to combat climate can be integrated in the instruments of the local
government; what new and specific analysis must be introduced in
urban planning in order to understand the issues of urban
sustainability, and how the project compares with different spatial
scales.
Abstract: A computational platform is presented in this
contribution. It has been designed as a virtual laboratory to be used
for exploring optimization algorithms in biological problems. This
platform is built on a blackboard-based agent architecture. As a test
case, the version of the platform presented here is devoted to the
study of protein folding, initially with a bead-like description of the
chain and with the widely used model of hydrophobic and polar
residues (HP model). Some details of the platform design are
presented along with its capabilities and also are revised some
explorations of the protein folding problems with different types of
discrete space. It is also shown the capability of the platform to
incorporate specific tools for the structural analysis of the runs in
order to understand and improve the optimization process.
Accordingly, the results obtained demonstrate that the ensemble of
computational tools into a single platform is worthwhile by itself,
since experiments developed on it can be designed to fulfill different
levels of information in a self-consistent fashion. By now, it is being
explored how an experiment design can be useful to create a
computational agent to be included within the platform. These
inclusions of designed agents –or software pieces– are useful for the
better accomplishment of the tasks to be developed by the platform.
Clearly, while the number of agents increases the new version of the
virtual laboratory thus enhances in robustness and functionality.
Abstract: The modeling of sound radiation is of fundamental importance for understanding the propagation of acoustic waves and, consequently, develop mechanisms for reducing acoustic noise. The propagation of acoustic waves, are involved in various phenomena such as radiation, absorption, transmission and reflection. The radiation is studied through the linear equation of the acoustic wave that is obtained through the equation for the Conservation of Momentum, equation of State and Continuity. From these equations, is the Helmholtz differential equation that describes the problem of acoustic radiation. In this paper we obtained the solution of the Helmholtz differential equation for an infinite cylinder in a pulsating through free and homogeneous. The analytical solution is implemented and the results are compared with the literature. A numerical formulation for this problem is obtained using the Boundary Element Method (BEM). This method has great power for solving certain acoustical problems in open field, compared to differential methods. BEM reduces the size of the problem, thereby simplifying the input data to be worked and reducing the computational time used.
Abstract: Negation is useful in the majority of the real world applications. However, its introduction leads to semantic and canonical problems. We propose in this paper an approach based on stratification to deal with negation problems. This approach is based on an extension of predicates nets. It is characterized with two main contributions. The first concerns the management of the whole class of stratified programs. The second contribution is related to usual operations optimizations on stratified programs (maximal stratification, incremental updates ...).
Abstract: This article is devoted to the numerical solution of
large-scale quadratic eigenvalue problems. Such problems arise in
a wide variety of applications, such as the dynamic analysis of
structural mechanical systems, acoustic systems, fluid mechanics,
and signal processing. We first introduce a generalized second-order
Krylov subspace based on a pair of square matrices and two initial
vectors and present a generalized second-order Arnoldi process for
constructing an orthonormal basis of the generalized second-order
Krylov subspace. Then, by using the projection technique and the
refined projection technique, we propose a restarted generalized
second-order Arnoldi method and a restarted refined generalized
second-order Arnoldi method for computing some eigenpairs of largescale
quadratic eigenvalue problems. Some theoretical results are also
presented. Some numerical examples are presented to illustrate the
effectiveness of the proposed methods.
Abstract: The Sphere Method is a flexible interior point algorithm for linear programming problems. This was developed mainly by Professor Katta G. Murty. It consists of two steps, the centering step and the descent step. The centering step is the most expensive part of the algorithm. In this centering step we proposed some improvements such as introducing two or more initial feasible solutions as we solve for the more favorable new solution by objective value while working with the rigorous updates of the feasible region along with some ideas integrated in the descent step. An illustration is given confirming the advantage of using the proposed procedure.
Abstract: Mixed model assembly lines (MMAL) are a type of
production line where a variety of product models similar in product
characteristics are assembled. The effective design of these lines
requires that schedule for assembling the different products is
determined. In this paper we tried to fit the sequencing problem with
the main characteristics of make to order (MTO) environment. The
problem solved in this paper is a multiple objective sequencing
problem in mixed model assembly lines sequencing using weighted
Sum Method (WSM) using GAMS software for small problem and
an effective GA for large scale problems because of the nature of
NP-hardness of our problem and vast time consume to find the
optimum solution in large problems. In this problem three practically
important objectives are minimizing: total utility work, keeping a
constant production rate variation, and minimizing earliness and
tardiness cost which consider the priority of each customer and
different due date which is a real situation in mixed model assembly
lines and it is the first time we consider different attribute to
prioritize the customers which help the company to reduce the cost of
earliness and tardiness. This mechanism is a way to apply an advance
available to promise (ATP) in mixed model assembly line sequencing
which is the main contribution of this paper.
Abstract: Exploring an autistic child in Elementary school is a
difficult task that must be fully thought out and the teachers should
be aware of the many challenges they face raising their child
especially the behavioral problems of autistic children. Hence there
arises a need for developing Artificial intelligence (AI)
Contemporary Techniques to help diagnosis to discover autistic
people.
In this research, we suggest designing architecture of expert
system that combine Cognitive Maps (CM) with Case Based
Reasoning technique (CBR) in order to reduce time and costs of
traditional diagnosis process for the early detection to discover
autistic children. The teacher is supposed to enter child's information
for analyzing by CM module. Then, the reasoning processor would
translate the output into a case to be solved a current problem by
CBR module. We will implement a prototype for the model as a
proof of concept using java and MYSQL.
This will be provided a new hybrid approach that will achieve new
synergies and improve problem solving capabilities in AI. And we
will predict that will reduce time, costs, the number of human errors
and make expertise available to more people who want who want to
serve autistic children and their families.
Abstract: Healthcare issues continue to pose huge problems and incur massive costs. As a result there are many challenging problems still unresolved. In this paper, we will carry out an extensive scientific survey of different areas of management and planning in an attempt to identify where there has already been a substantial contribution from management science methods to healthcare problems and where there is a clear potential for more work to be done. The focus will be on the read-across to the healthcare domain from such approaches applied generally to management and planning and how the methods can be used to improvement patient care. We conclude that, since the healthcare domain significantly differs from traditional areas of management and planning, in some cases there is a need to modify the approaches so as to incorporate the complexities of healthcare, and fully exploit the potential for improvement.
Abstract: Gaussian mixture background model is widely used in
moving target detection of the image sequences. However, traditional
Gaussian mixture background model usually considers the time
continuity of the pixels, and establishes background through statistical
distribution of pixels without taking into account the pixels- spatial
similarity, which will cause noise, imperfection and other problems.
This paper proposes a new Gaussian mixture modeling approach,
which combines the color and gradient of the spatial information, and
integrates the spatial information of the pixel sequences to establish
Gaussian mixture background. The experimental results show that the
movement background can be extracted accurately and efficiently, and
the algorithm is more robust, and can work in real time in tracking
applications.
Abstract: In this paper a new embedded Singly Diagonally
Implicit Runge-Kutta Nystrom fourth order in fifth order method for
solving special second order initial value problems is derived. A
standard set of test problems are tested upon and comparisons on the
numerical results are made when the same set of test problems are
reduced to first order systems and solved using the existing
embedded diagonally implicit Runge-Kutta method. The results
suggests the superiority of the new method.
Abstract: A thin layer on the component surface can be found
with high tensile residual stresses, due to turning operations, which
can dangerously affect the fatigue performance of the component. In
this paper an analytical approach is presented to reconstruct the
residual stress field from a limited incomplete set of measurements.
Airy stress function is used as the primary unknown to directly solve
the equilibrium equations and satisfying the boundary conditions. In
this new method there exists the flexibility to impose the physical
conditions that govern the behavior of residual stress to achieve a
meaningful complete stress field. The analysis is also coupled to a
least squares approximation and a regularization method to provide
stability of the inverse problem. The power of this new method is
then demonstrated by analyzing some experimental measurements
and achieving a good agreement between the model prediction and
the results obtained from residual stress measurement.
Abstract: To investigates the effect of fiberglass clamping
process improvement on drape simulation prediction. This has
great effect on the mould and the fiber during manufacturing
process. This also, improves the fiber strain, the quality of the
fiber orientation in the area of folding and wrinkles formation
during the press-forming process. Drape simulation software
tool was used to digitalize the process, noting the formation
problems on the contour sensitive part. This was compared
with the real life clamping processes using single and double
frame set-ups to observe the effects. Also, restrains are
introduced by using clips, and the G-clamps with predetermine
revolution to; restrain the fabric deformation during the
forming process.The incorporation of clamping and fabric
restrain deformation improved on the prediction of the
simulation tool. Therefore, for effective forming process,
incorporation of clamping process into the drape simulation
process will assist in the development of fiberglass application
in manufacturing process.
Abstract: Throughout this paper, a relatively new technique, the Tabu search variable selection model, is elaborated showing how it can be efficiently applied within the financial world whenever researchers come across the selection of a subset of variables from a whole set of descriptive variables under analysis. In the field of financial prediction, researchers often have to select a subset of variables from a larger set to solve different type of problems such as corporate bankruptcy prediction, personal bankruptcy prediction, mortgage, credit scoring and the Arbitrage Pricing Model (APM). Consequently, to demonstrate how the method operates and to illustrate its usefulness as well as its superiority compared to other commonly used methods, the Tabu search algorithm for variable selection is compared to two main alternative search procedures namely, the stepwise regression and the maximum R 2 improvement method. The Tabu search is then implemented in finance; where it attempts to predict corporate bankruptcy by selecting the most appropriate financial ratios and thus creating its own prediction score equation. In comparison to other methods, mostly the Altman Z-Score model, the Tabu search model produces a higher success rate in predicting correctly the failure of firms or the continuous running of existing entities.
Abstract: In this paper, a pipelined version of genetic algorithm,
called PLGA, and a corresponding hardware platform are described.
The basic operations of conventional GA (CGA) are made pipelined
using an appropriate selection scheme. The selection operator, used
here, is stochastic in nature and is called SA-selection. This helps
maintaining the basic generational nature of the proposed pipelined
GA (PLGA). A number of benchmark problems are used to compare
the performances of conventional roulette-wheel selection and the
SA-selection. These include unimodal and multimodal functions with
dimensionality varying from very small to very large. It is seen that
the SA-selection scheme is giving comparable performances with
respect to the classical roulette-wheel selection scheme, for all the
instances, when quality of solutions and rate of convergence are considered.
The speedups obtained by PLGA for different benchmarks
are found to be significant. It is shown that a complete hardware
pipeline can be developed using the proposed scheme, if parallel
evaluation of the fitness expression is possible. In this connection
a low-cost but very fast hardware evaluation unit is described.
Results of simulation experiments show that in a pipelined hardware
environment, PLGA will be much faster than CGA. In terms of
efficiency, PLGA is found to outperform parallel GA (PGA) also.
Abstract: In this paper the neural network-based controller is
designed for motion control of a mobile robot. This paper treats the
problems of trajectory following and posture stabilization of the
mobile robot with nonholonomic constraints. For this purpose the
recurrent neural network with one hidden layer is used. It learns
relationship between linear velocities and error positions of the
mobile robot. This neural network is trained on-line using the
backpropagation optimization algorithm with an adaptive learning
rate. The optimization algorithm is performed at each sample time to
compute the optimal control inputs. The performance of the proposed
system is investigated using a kinematic model of the mobile robot.
Abstract: The Chinese Postman Problem (CPP) is one of the
classical problems in graph theory and is applicable in a wide range
of fields. With the rapid development of hybrid systems and model
based testing, Chinese Postman Problem with Time Dependent Travel
Times (CPPTDT) becomes more realistic than the classical problems.
In the literature, we have proposed the first integer programming
formulation for the CPPTDT problem, namely, circuit formulation,
based on which some polyhedral results are investigated and a cutting
plane algorithm is also designed. However, there exists a main drawback:
the circuit formulation is only available for solving the special
instances with all circuits passing through the origin. Therefore, this
paper proposes a new integer programming formulation for solving
all the general instances of CPPTDT. Moreover, the size of the circuit
formulation is too large, which is reduced dramatically here. Thus, it
is possible to design more efficient algorithm for solving the CPPTDT
in the future research.
Abstract: Discrete particle swarm optimization (DPSO) is a
powerful stochastic evolutionary algorithm that is used to solve the
large-scale, discrete and nonlinear optimization problems. However,
it has been observed that standard DPSO algorithm has premature
convergence when solving a complex optimization problem like
transmission expansion planning (TEP). To resolve this problem an
advanced discrete particle swarm optimization (ADPSO) is proposed
in this paper. The simulation result shows that optimization of lines
loading in transmission expansion planning with ADPSO is better
than DPSO from precision view point.