Abstract: The classification of the protein structure is commonly
not performed for the whole protein but for structural domains, i.e.,
compact functional units preserved during evolution. Hence, a first
step to a protein structure classification is the separation of the
protein into its domains. We approach the problem of protein domain
identification by proposing a novel graph theoretical algorithm. We
represent the protein structure as an undirected, unweighted and
unlabeled graph which nodes correspond the secondary structure
elements of the protein. This graph is call the protein graph. The
domains are then identified as partitions of the graph corresponding
to vertices sets obtained by the maximization of an objective function,
which mutually maximizes the cycle distributions found in the
partitions of the graph. Our algorithm does not utilize any other kind
of information besides the cycle-distribution to find the partitions. If
a partition is found, the algorithm is iteratively applied to each of
the resulting subgraphs. As stop criterion, we calculate numerically
a significance level which indicates the stability of the predicted
partition against a random rewiring of the protein graph. Hence,
our algorithm terminates automatically its iterative application. We
present results for one and two domain proteins and compare our
results with the manually assigned domains by the SCOP database
and differences are discussed.
Abstract: We present a non standard Euclidean vehicle
routing problem adding a level of clustering, and we revisit the use
of self-organizing maps as a tool which naturally handles such
problems. We present how they can be used as a main operator
into an evolutionary algorithm to address two conflicting
objectives of route length and distance from customers to bus stops
minimization and to deal with capacity constraints. We apply the
approach to a real-life case of combined clustering and vehicle
routing for the transportation of the 780 employees of an
enterprise. Basing upon a geographic information system we
discuss the influence of road infrastructures on the solutions
generated.
Abstract: Shape optimization of the airfoil with high aspect ratio
of long endurance unmanned aerial vehicle (UAV) is performed by the
multi-objective optimization technology coupled with computational
fluid dynamics (CFD). For predicting the aerodynamic characteristics
around the airfoil the high-fidelity Navier-Stokes solver is employed
and SMOGA (Simple Multi-Objective Genetic Algorithm), which is
developed by authors, is used for solving the multi-objective
optimization problem. To obtain the optimal solutions of the design
variable (i.e., sectional airfoil profile, wing taper ratio and sweep) for
high performance of UAVs, both the lift and lift-to-drag ratio are
maximized whereas the pitching moment should be minimized,
simultaneously. It is found that the lift force and lift-to-drag ratio are
linearly dependent and a unique and dominant solution are existed.
However, a trade-off phenomenon is observed between the lift-to-drag
ratio and pitching moment. As the result of optimization, sixty-five
(65) non-dominated Pareto individuals at the cutting edge of design
spaces that is decided by airfoil shapes can be obtained.
Abstract: An important step in three-dimensional reconstruction
and computer vision is camera calibration, whose objective is to
estimate the intrinsic and extrinsic parameters of each camera. In this
paper, two linear methods based on the different planes are given. In
both methods, the general plane is used to replace the calibration
object with very good precision. In the first method, after controlling
the camera to undergo five times- translation movements and taking
pictures of the orthogonal planes, a set of linear constraints of the
camera intrinsic parameters is then derived by means of homography
matrix. The second method is to get all camera parameters by taking
only one picture of a given radius circle. experiments on simulated
data and real images,indicate that our method is reasonable and is a
good supplement to camera calibration.
Abstract: Safety Health and Environment Code of Practice (SHE
COP) was developed to help road transportation operators to manage
its operation in a systematic and safe manner. A study was conducted
to determine the effectiveness of SHE COP implementation during
non-OPS period. The objective of the study is to evaluate the
implementations of SHE COP among bus operators during wee hour
operations. The data was collected by completing a set of checklist
after observing the activities during pre departure, during the trip, and
upon arrival. The results show that there are seven widely practiced
SHE COP elements. 22% of the buses have average speed exceeding
the maximum permissible speed on the highways (90 km/h), with
13% of the buses were travelling at the speed of more than 100 km/h.
The statistical analysis shows that there is only one significant
association which relates speeding with prior presence of
enforcement officers.
Abstract: This paper is focused on issues of nonlinear dynamic process modeling and model-based predictive control of a fed-batch sugar crystallization process applying the concept of artificial neural networks as computational tools. The control objective is to force the operation into following optimal supersaturation trajectory. It is achieved by manipulating the feed flow rate of sugar liquor/syrup, considered as the control input. A feed forward neural network (FFNN) model of the process is first built as part of the controller structure to predict the process response over a specified (prediction) horizon. The predictions are supplied to an optimization procedure to determine the values of the control action over a specified (control) horizon that minimizes a predefined performance index. The control task is rather challenging due to the strong nonlinearity of the process dynamics and variations in the crystallization kinetics. However, the simulation results demonstrated smooth behavior of the control actions and satisfactory reference tracking.
Abstract: Nowadays, the pace of business change is such that,
increasingly, new functionality has to be realized and reliably
installed in a matter of days, or even hours. Consequently, more and
more business processes are prone to a continuous change. The
objective of the research in progress is to use the MAP model, in a
conceptual modeling method for flexible and adaptive business
process. This method can be used to capture the flexibility
dimensions of a business process; it takes inspiration from
modularity concept in the object oriented paradigm to establish a
hierarchical construction of the BP modeling. Its intent is to provide
a flexible modeling that allows companies to quickly adapt their
business processes.
Abstract: The objective of this paper, is to apply support vector machine (SVM) approach for the classification of cancerous and normal regions of prostate images. Three kinds of textural features are extracted and used for the analysis: parameters of the Gauss- Markov random field (GMRF), correlation function and relative entropy. Prostate images are acquired by the system consisting of a microscope, video camera and a digitizing board. Cross-validated classification over a database of 46 images is implemented to evaluate the performance. In SVM classification, sensitivity and specificity of 96.2% and 97.0% are achieved for the 32x32 pixel block sized data, respectively, with an overall accuracy of 96.6%. Classification performance is compared with artificial neural network and k-nearest neighbor classifiers. Experimental results demonstrate that the SVM approach gives the best performance.
Abstract: Restructured electricity markets may provide
opportunities for producers to exercise market power maintaining
prices in excess of competitive levels. In this paper an oligopolistic
market is presented that all Generation Companies (GenCos) bid in a
Cournot model. Genetic algorithm (GA) is applied to obtain
generation scheduling of each GenCo as well as hourly market
clearing prices (MCP). In order to consider network constraints a
multiperiod framework is presented to simulate market clearing
mechanism in which the behaviors of market participants are
modelled through piecewise block curves. A mixed integer linear
programming (MILP) is employed to solve the problem. Impacts of
market clearing process on participants- characteristic and final
market prices are presented. Consequently, a novel multi-objective
model is addressed for security constrained optimal bidding strategy
of GenCos. The capability of price-maker GenCos to alter MCP is
evaluated through introducing an effective-supply curve. In addition,
the impact of exercising market power on the variation of market
characteristics as well as GenCos scheduling is studied.
Abstract: Polyurethane foams (PUF) has been prepared from
vegetable; soybean based polyols. They were characterized into
flexible and semi rigid polyurethane foam. This work is directed to
production of flexible polyurethane foams by a process involving the
reaction of mixture of 2,4- and 2,6-Toluene di Isocyanate isomers,
with portion of to blends of soy polyols with petroleum polyol in the
presence of other ingredients such as blowing agents, silicone
surfactants and accelerating agents. Additon of chain extender
improves the property then further decreases the properties on further
addition of the same. The objective of this work was to study the
effect of chain extender and role of phosphoric acid catalyst to the
final properties and correlate the morphology image with mechanical
properties of these foams.
Abstract: The objective of the research is to study and compare
response surface designs: Central composite designs (CCD), Box-
Behnken designs (BBD), Small composite designs (SCD), Hybrid
designs, and Uniform shell designs (USD) over sets of reduced models
when the design is in a spherical region for 3 and 4 design variables.
The two optimality criteria ( D and G ) are considered which larger
values imply a better design. The comparison of design optimality
criteria of the response surface designs across the full second order
model and sets of reduced models for 3 and 4 factors based on the
two criteria are presented.
Abstract: This paper presents a new method which applies an
artificial bee colony algorithm (ABC) for capacitor placement in
distribution systems with an objective of improving the voltage profile
and reduction of power loss. The ABC algorithm is a new population
based meta heuristic approach inspired by intelligent foraging behavior
of honeybee swarm. The advantage of ABC algorithm is that
it does not require external parameters such as cross over rate and
mutation rate as in case of genetic algorithm and differential evolution
and it is hard to determine these parameters in prior. The other
advantage is that the global search ability in the algorithm is implemented
by introducing neighborhood source production mechanism
which is a similar to mutation process. To demonstrate the validity
of the proposed algorithm, computer simulations are carried out on
69-bus system and compared the results with the other approach
available in the literature. The proposed method has outperformed the
other methods in terms of the quality of solution and computational
efficiency.
Abstract: In this paper, multi-processors job shop scheduling problems are solved by a heuristic algorithm based on the hybrid of priority dispatching rules according to an ant colony optimization algorithm. The objective function is to minimize the makespan, i.e. total completion time, in which a simultanous presence of various kinds of ferons is allowed. By using the suitable hybrid of priority dispatching rules, the process of finding the best solution will be improved. Ant colony optimization algorithm, not only promote the ability of this proposed algorithm, but also decreases the total working time because of decreasing in setup times and modifying the working production line. Thus, the similar work has the same production lines. Other advantage of this algorithm is that the similar machines (not the same) can be considered. So, these machines are able to process a job with different processing and setup times. According to this capability and from this algorithm evaluation point of view, a number of test problems are solved and the associated results are analyzed. The results show a significant decrease in throughput time. It also shows that, this algorithm is able to recognize the bottleneck machine and to schedule jobs in an efficient way.
Abstract: Economic Load Dispatch (ELD) is a method of determining
the most efficient, low-cost and reliable operation of a power
system by dispatching available electricity generation resources to
supply load on the system. The primary objective of economic
dispatch is to minimize total cost of generation while honoring
operational constraints of available generation resources. In this paper
an intelligent water drop (IWD) algorithm has been proposed to
solve ELD problem with an objective of minimizing the total cost of
generation. Intelligent water drop algorithm is a swarm-based natureinspired
optimization algorithm, which has been inspired from natural
rivers. A natural river often finds good paths among lots of possible
paths in its ways from source to destination and finally find almost
optimal path to their destination. These ideas are embedded into
the proposed algorithm for solving economic load dispatch problem.
The main advantage of the proposed technique is easy is implement
and capable of finding feasible near global optimal solution with
less computational effort. In order to illustrate the effectiveness of
the proposed method, it has been tested on 6-unit and 20-unit test
systems with incremental fuel cost functions taking into account the
valve point-point loading effects. Numerical results shows that the
proposed method has good convergence property and better in quality
of solution than other algorithms reported in recent literature.
Abstract: The only relevant basis for the design of an educational application are objectives of learning for the content area. This study analyses the process in which the real – not only the formal – objectives could work as the starting point for the construction of an educational game. The application context is the education of perioperative nursing. The process is based on the panel discussions of nursing teachers. In the panels, the teachers elaborated the objectives. The transcribed discussions were analysed in terms of the conceptions of learning and teaching of perioperative nursing. The outcome of the study is first the elaborated objectives, which will be used in the implementation of an educational game for the needs of pre-, intra and post-operative nursing skills learning. Second, the study shows that different views of learning are necessary to be understood in order to design an appropriate educational application.
Abstract: Grid computing provides a virtual framework for
controlled sharing of resources across institutional boundaries.
Recently, trust has been recognised as an important factor for
selection of optimal resources in a grid. We introduce a new method
that provides a quantitative trust value, based on the past interactions
and present environment characteristics. This quantitative trust value
is used to select a suitable resource for a job and eliminates run time
failures arising from incompatible user-resource pairs. The proposed
work will act as a tool to calculate the trust values of the various
components of the grid and there by improves the success rate of the
jobs submitted to the resource on the grid. The access to a resource
not only depend on the identity and behaviour of the resource but
also upon its context of transaction, time of transaction, connectivity
bandwidth, availability of the resource and load on the resource. The
quality of the recommender is also evaluated based on the accuracy
of the feedback provided about a resource. The jobs are submitted for
execution to the selected resource after finding the overall trust value
of the resource. The overall trust value is computed with respect to
the subjective and objective parameters.
Abstract: In this paper an ant colony optimization algorithm is
developed to solve the permutation flow shop scheduling problem. In
the permutation flow shop scheduling problem which has been vastly
studied in the literature, there are a set of m machines and a set of n
jobs. All the jobs are processed on all the machines and the sequence
of jobs being processed is the same on all the machines. Here this
problem is optimized considering two criteria, makespan and total
flow time. Then the results are compared with the ones obtained by
previously developed algorithms. Finally it is visible that our
proposed approach performs best among all other algorithms in the
literature.
Abstract: Stock portfolio selection is a classic problem in finance,
and it involves deciding how to allocate an institution-s or an individual-s
wealth to a number of stocks, with certain investment objectives
(return and risk). In this paper, we adopt the classical Markowitz
mean-variance model and consider an additional common realistic
constraint, namely, the cardinality constraint. Thus, stock portfolio
optimization becomes a mixed-integer quadratic programming problem
and it is difficult to be solved by exact optimization algorithms.
Chemical Reaction Optimization (CRO), which mimics the molecular
interactions in a chemical reaction process, is a population-based
metaheuristic method. Two different types of CRO, named canonical
CRO and Super Molecule-based CRO (S-CRO), are proposed to solve
the stock portfolio selection problem. We test both canonical CRO
and S-CRO on a benchmark and compare their performance under
two criteria: Markowitz efficient frontier (Pareto frontier) and Sharpe
ratio. Computational experiments suggest that S-CRO is promising
in handling the stock portfolio optimization problem.
Abstract: Predict daily global solar radiation (GSR) based on meteorological variables, using Multi-layer perceptron (MLP) neural networks is the main objective of this study. Daily mean air temperature, relative humidity, sunshine hours, evaporation, wind speed, and soil temperature values between 2002 and 2006 for Dezful city in Iran (32° 16' N, 48° 25' E), are used in this study. The measured data between 2002 and 2005 are used to train the neural networks while the data for 214 days from 2006 are used as testing data.
Abstract: This paper presents a procedure for modeling and tuning the parameters of Thyristor Controlled Series Compensation (TCSC) controller in a multi-machine power system to improve transient stability. First a simple transfer function model of TCSC controller for stability improvement is developed and the parameters of the proposed controller are optimally tuned. Genetic algorithm (GA) is employed for the optimization of the parameter-constrained nonlinear optimization problem implemented in a simulation environment. By minimizing an objective function in which the oscillatory rotor angle deviations of the generators are involved, transient stability performance of the system is improved. The proposed TCSC controller is tested on a multi-machine system and the simulation results are presented. The nonlinear simulation results validate the effectiveness of proposed approach for transient stability improvement in a multimachine power system installed with a TCSC. The simulation results also show that the proposed TCSC controller is also effective in damping low frequency oscillations.