Abstract: The material selection problem is concerned with the
determination of the right material for a certain product to optimize
certain performance indices in that product such as mass, energy
density, and power-to-weight ratio. This paper is concerned about
optimizing the selection of the manufacturing process along with the
material used in the product under performance indices and
availability constraints. In this paper, the material selection problem
is formulated using binary programming and solved by genetic
algorithm. The objective function of the model is to minimize the
total manufacturing cost under performance indices and material and
manufacturing process availability constraints.
Abstract: MicroRNAs are small non-coding RNA found in
many different species. They play crucial roles in cancer such as
biological processes of apoptosis and proliferation. The identification
of microRNA-target genes can be an essential first step towards to
reveal the role of microRNA in various cancer types. In this paper,
we predict miRNA-target genes for lung cancer by integrating
prediction scores from miRanda and PITA algorithms used as a
feature vector of miRNA-target interaction. Then, machine-learning
algorithms were implemented for making a final prediction. The
approach developed in this study should be of value for future studies
into understanding the role of miRNAs in molecular mechanisms
enabling lung cancer formation.
Abstract: Mumbai, being traditionally the epicenter of India's
trade and commerce, the existing major ports such as Mumbai and
Jawaharlal Nehru Ports (JN) situated in Thane estuary are also
developing its waterfront facilities. Various developments over the
passage of decades in this region have changed the tidal flux
entering/leaving the estuary. The intake at Pir-Pau is facing the
problem of shortage of water in view of advancement of shoreline,
while jetty near Ulwe faces the problem of ship scheduling due to
existence of shallower depths between JN Port and Ulwe Bunder. In
order to solve these problems, it is inevitable to have information
about tide levels over a long duration by field measurements.
However, field measurement is a tedious and costly affair;
application of artificial intelligence was used to predict water levels
by training the network for the measured tide data for one lunar tidal
cycle. The application of two layered feed forward Artificial Neural
Network (ANN) with back-propagation training algorithms such as
Gradient Descent (GD) and Levenberg-Marquardt (LM) was used to
predict the yearly tide levels at waterfront structures namely at Ulwe
Bunder and Pir-Pau. The tide data collected at Apollo Bunder, Ulwe,
and Vashi for a period of lunar tidal cycle (2013) was used to train,
validate and test the neural networks. These trained networks having
high co-relation coefficients (R= 0.998) were used to predict the tide
at Ulwe, and Vashi for its verification with the measured tide for the
year 2000 & 2013. The results indicate that the predicted tide levels
by ANN give reasonably accurate estimation of tide. Hence, the
trained network is used to predict the yearly tide data (2015) for
Ulwe. Subsequently, the yearly tide data (2015) at Pir-Pau was
predicted by using the neural network which was trained with the
help of measured tide data (2000) of Apollo and Pir-Pau. The analysis of measured data and study reveals that: The
measured tidal data at Pir-Pau, Vashi and Ulwe indicate that there is
maximum amplification of tide by about 10-20 cm with a phase lag
of 10-20 minutes with reference to the tide at Apollo Bunder
(Mumbai). LM training algorithm is faster than GD and with increase
in number of neurons in hidden layer and the performance of the
network increases. The predicted tide levels by ANN at Pir-Pau and
Ulwe provides valuable information about the occurrence of high and
low water levels to plan the operation of pumping at Pir-Pau and
improve ship schedule at Ulwe.
Abstract: This paper presents the performance characteristics of
Darrieus-type vertical axis wind turbine (VAWT) with NACA airfoil
blades. The performance of Darrieus-type VAWT can be
characterized by torque and power. There are various parameters
affecting the performance such as chord length, helical angle, pitch
angle and rotor diameter. To estimate the optimum shape of Darrieustype
wind turbine in accordance with various design parameters, we
examined aerodynamic characteristics and separated flow occurring
in the vicinity of blade, interaction between flow and blade, and
torque and power characteristics derived from it. For flow analysis,
flow variations were investigated based on the unsteady RANS
(Reynolds-averaged Navier-Stokes) equation. Sliding mesh algorithm
was employed in order to consider rotational effect of blade. To
obtain more realistic results we conducted experiment and numerical
analysis at the same time for three-dimensional shape. In addition,
several parameters (chord length, rotor diameter, pitch angle, and
helical angle) were considered to find out optimum shape design and
characteristics of interaction with ambient flow. Since the NACA
airfoil used in this study showed significant changes in magnitude of
lift and drag depending on an angle of attack, the rotor with low drag,
long cord length and short diameter shows high power coefficient in
low tip speed ratio (TSR) range. On the contrary, in high TSR range,
drag becomes high. Hence, the short-chord and long-diameter rotor
produces high power coefficient. When a pitch angle at which airfoil
directs toward inside equals to -2° and helical angle equals to 0°,
Darrieus-type VAWT generates maximum power.
Abstract: Patient-specific models are instance-based learning
algorithms that take advantage of the particular features of the patient
case at hand to predict an outcome. We introduce two patient-specific
algorithms based on decision tree paradigm that use AUC as a
metric to select an attribute. We apply the patient specific algorithms
to predict outcomes in several datasets, including medical datasets.
Compared to the patient-specific decision path (PSDP) entropy-based
and CART methods, the AUC-based patient-specific decision path
models performed equivalently on area under the ROC curve (AUC).
Our results provide support for patient-specific methods being a
promising approach for making clinical predictions.
Abstract: Recently, traffic monitoring has attracted the attention
of computer vision researchers. Many algorithms have been
developed to detect and track moving vehicles. In fact, vehicle
tracking in daytime and in nighttime cannot be approached with the
same techniques, due to the extreme different illumination conditions.
Consequently, traffic-monitoring systems are in need of having a
component to differentiate between daytime and nighttime scenes. In
this paper, a HSV-based day/night detector is proposed for traffic
monitoring scenes. The detector employs the hue-histogram and the
value-histogram on the top half of the image frame. Experimental
results show that the extraction of the brightness features along with
the color features within the top region of the image is effective for
classifying traffic scenes. In addition, the detector achieves high
precision and recall rates along with it is feasible for real time
applications.
Abstract: Data fusion technology can be the best way to extract
useful information from multiple sources of data. It has been widely
applied in various applications. This paper presents a data fusion
approach in multimedia data for event detection in twitter by using
Dempster-Shafer evidence theory. The methodology applies a mining
algorithm to detect the event. There are two types of data in the
fusion. The first is features extracted from text by using the bag-ofwords
method which is calculated using the term frequency-inverse
document frequency (TF-IDF). The second is the visual features
extracted by applying scale-invariant feature transform (SIFT). The
Dempster - Shafer theory of evidence is applied in order to fuse the
information from these two sources. Our experiments have indicated
that comparing to the approaches using individual data source, the
proposed data fusion approach can increase the prediction accuracy
for event detection. The experimental result showed that the proposed
method achieved a high accuracy of 0.97, comparing with 0.93 with
texts only, and 0.86 with images only.
Abstract: Ant algorithms are well-known metaheuristics which
have been widely used since two decades. In most of the literature,
an ant is a constructive heuristic able to build a solution from scratch.
However, other types of ant algorithms have recently emerged: the
discussion is thus not limited by the common framework of the
constructive ant algorithms. Generally, at each generation of an ant
algorithm, each ant builds a solution step by step by adding an
element to it. Each choice is based on the greedy force (also called the
visibility, the short term profit or the heuristic information) and the
trail system (central memory which collects historical information of
the search process). Usually, all the ants of the population have the
same characteristics and behaviors. In contrast in this paper, a new
type of ant metaheuristic is proposed, namely SMART (for Solution
Methods with Ants Running by Types). It relies on the use of different
population of ants, where each population has its own personality.
Abstract: Many cluster based routing protocols have been
proposed in the field of wireless sensor networks, in which a group of
nodes are formed as clusters. A cluster head is selected from one
among those nodes based on residual energy, coverage area, number
of hops and that cluster-head will perform data gathering from
various sensor nodes and forwards aggregated data to the base station
or to a relay node (another cluster-head), which will forward the
packet along with its own data packet to the base station. Here a
Game Theory based Diligent Energy Utilization Algorithm (GTDEA)
for routing is proposed. In GTDEA, the cluster head selection is done
with the help of game theory, a decision making process, that selects
a cluster-head based on three parameters such as residual energy
(RE), Received Signal Strength Index (RSSI) and Packet Reception
Rate (PRR). Finding a feasible path to the destination with minimum
utilization of available energy improves the network lifetime and is
achieved by the proposed approach. In GTDEA, the packets are
forwarded to the base station using inter-cluster routing technique,
which will further forward it to the base station. Simulation results
reveal that GTDEA improves the network performance in terms of
throughput, lifetime, and power consumption.
Abstract: Model updating is an inverse eigenvalue problem which
concerns the modification of an existing but inaccurate model with
measured modal data. In this paper, an efficient gradient based
iterative method for updating the mass, damping and stiffness
matrices simultaneously using a few of complex measured modal
data is developed. Convergence analysis indicates that the iterative
solutions always converge to the unique minimum Frobenius norm
symmetric solution of the model updating problem by choosing a
special kind of initial matrices.
Abstract: This paper outlines the development of an
experimental technique in quantifying supersonic jet flows, in an
attempt to avoid seeding particle problems frequently associated with
particle-image velocimetry (PIV) techniques at high Mach numbers.
Based on optical flow algorithms, the idea behind the technique
involves using high speed cameras to capture Schlieren images of the
supersonic jet shear layers, before they are subjected to an adapted
optical flow algorithm based on the Horn-Schnuck method to
determine the associated flow fields. The proposed method is capable
of offering full-field unsteady flow information with potentially
higher accuracy and resolution than existing point-measurements or
PIV techniques. Preliminary study via numerical simulations of a
circular de Laval jet nozzle successfully reveals flow and shock
structures typically associated with supersonic jet flows, which serve
as useful data for subsequent validation of the optical flow based
experimental results. For experimental technique, a Z-type Schlieren
setup is proposed with supersonic jet operated in cold mode,
stagnation pressure of 4 bar and exit Mach of 1.5. High-speed singleframe
or double-frame cameras are used to capture successive
Schlieren images. As implementation of optical flow technique to
supersonic flows remains rare, the current focus revolves around
methodology validation through synthetic images. The results of
validation test offers valuable insight into how the optical flow
algorithm can be further improved to improve robustness and
accuracy. Despite these challenges however, this supersonic flow
measurement technique may potentially offer a simpler way to
identify and quantify the fine spatial structures within the shock shear
layer.
Abstract: Orthogonal Frequency Division Multiplexing
(OFDM) has been used in many advanced wireless communication
systems due to its high spectral efficiency and robustness to
frequency selective fading channels. However, the major concern
with OFDM system is the high peak-to-average power ratio (PAPR)
of the transmitted signal. Some of the popular techniques used for
PAPR reduction in OFDM system are conventional partial transmit
sequences (CPTS) and clipping. In this paper, a parallel
combination/hybrid scheme of PAPR reduction using clipping and
CPTS algorithms is proposed. The proposed method intelligently
applies both the algorithms in order to reduce both PAPR as well as
computational complexity. The proposed scheme slightly degrades
bit error rate (BER) performance due to clipping operation and it can
be reduced by selecting an appropriate value of the clipping ratio
(CR). The simulation results show that the proposed algorithm
achieves significant PAPR reduction with much reduced
computational complexity.
Abstract: Visibility problems are central to many computational geometry applications. One of the typical visibility problems is computing the view from a given point. In this paper, a linear time procedure is proposed to compute the visibility subsets from a corner of a rectangular prism in an orthogonal polyhedron. The proposed algorithm could be useful to solve classic 3D problems.
Abstract: The crossover probability and mutation probability are the two important factors in genetic algorithm. The adaptive genetic algorithm can improve the convergence performance of genetic algorithm, in which the crossover probability and mutation probability are adaptively designed with the changes of fitness value. We apply adaptive genetic algorithm into a function optimization problem. The numerical experiment represents that adaptive genetic algorithm improves the convergence speed and avoids local convergence.
Abstract: Energy has a prominent role for development of
nations. Countries which have energy resources also have strategic
power in the international trade of energy since it is essential for all
stages of production in the economy. Thus, it is important for
countries to analyze the weaknesses and strength of the system. On
the other side, international trade is one of the fields that are analyzed
as a complex network via network analysis. Complex network is one
of the tools to analyze complex systems with heterogeneous agents
and interaction between them. A complex network consists of nodes
and the interactions between these nodes. Total properties which
emerge as a result of these interactions are distinct from the sum of
small parts (more or less) in complex systems. Thus, standard
approaches to international trade are superficial to analyze these
systems. Network analysis provides a new approach to analyze
international trade as a network. In this network, countries constitute
nodes and trade relations (export or import) constitute edges. It
becomes possible to analyze international trade network in terms of
high degree indicators which are specific to complex networks such
as connectivity, clustering, assortativity/disassortativity, centrality,
etc. In this analysis, international trade of crude oil and coal which
are types of fossil fuel has been analyzed from 2005 to 2014 via
network analysis. First, it has been analyzed in terms of some
topological parameters such as density, transitivity, clustering etc.
Afterwards, fitness to Pareto distribution has been analyzed via
Kolmogorov-Smirnov test. Finally, weighted HITS algorithm has
been applied to the data as a centrality measure to determine the real
prominence of countries in these trade networks. Weighted HITS
algorithm is a strong tool to analyze the network by ranking countries
with regards to prominence of their trade partners. We have
calculated both an export centrality and an import centrality by
applying w-HITS algorithm to the data. As a result, impacts of the
trading countries have been presented in terms of high-degree
indicators.
Abstract: In order to retrieve images efficiently from a large
database, a unique method integrating color and texture features
using genetic programming has been proposed. Opponent color
histogram which gives shadow, shade, and light intensity invariant
property is employed in the proposed framework for extracting color
features. For texture feature extraction, fast discrete curvelet
transform which captures more orientation information at different
scales is incorporated to represent curved like edges. The recent
scenario in the issues of image retrieval is to reduce the semantic gap
between user’s preference and low level features. To address this
concern, genetic algorithm combined with relevance feedback is
embedded to reduce semantic gap and retrieve user’s preference
images. Extensive and comparative experiments have been conducted
to evaluate proposed framework for content based image retrieval on
two databases, i.e., COIL-100 and Corel-1000. Experimental results
clearly show that the proposed system surpassed other existing
systems in terms of precision and recall. The proposed work achieves
highest performance with average precision of 88.2% on COIL-100
and 76.3% on Corel, the average recall of 69.9% on COIL and 76.3%
on Corel. Thus, the experimental results confirm that the proposed
content based image retrieval system architecture attains better
solution for image retrieval.
Abstract: In this paper, an Infinite Impulse Response (IIR) filter
has been designed and simulated on an Field Programmable Gate
Arrays (FPGA). The implementation is based on Multiply Add and
Accumulate (MAC) algorithm which uses multiply operations for
design implementation. Parallel Pipelined structure is used to
implement the proposed IIR Filter taking optimal advantage of the
look up table of target device. The designed filter has been
synthesized on Digital Signal Processor (DSP) slice based FPGA to
perform multiplier function of MAC unit. The DSP slices are useful
to enhance the speed performance. The proposed design is simulated
with Matlab, synthesized with Xilinx Synthesis Tool, and
implemented on FPGA devices. The Virtex 5 FPGA based design can
operate at an estimated frequency of 81.5 MHz as compared to 40.5
MHz in case of Spartan 3 ADSP based design. The Virtex 5 based
implementation also consumes less slices and slice flip flops of target
FPGA in comparison to Spartan 3 ADSP based implementation to
provide cost effective solution for signal processing applications.
Abstract: The current web has become a modern encyclopedia,
where people share their thoughts and ideas on various topics around
them. This kind of encyclopedia is very useful for other people who
are looking for answers to their questions. However, with the
growing popularity of social networking and blogging and ever
expanding network services, there has also been a growing diversity
of technologies along with a different structure of individual web
sites. It is therefore difficult to directly find a relevant answer for a
common Internet user. This paper presents a web application for the
real-time end-to-end analysis of selected Internet trends where the
trend can be whatever the people post online. The application
integrates fully configurable tools for data collection and analysis
using selected webometric algorithms, and for its chronological
visualization to user. It can be assumed that the application facilitates
the users to evaluate the quality of various products that are
mentioned online.
Abstract: Advances in spatial and spectral resolution of satellite
images have led to tremendous growth in large image databases. The
data we acquire through satellites, radars, and sensors consists of
important geographical information that can be used for remote
sensing applications such as region planning, disaster management.
Spatial data classification and object recognition are important tasks
for many applications. However, classifying objects and identifying
them manually from images is a difficult task. Object recognition is
often considered as a classification problem, this task can be
performed using machine-learning techniques. Despite of many
machine-learning algorithms, the classification is done using
supervised classifiers such as Support Vector Machines (SVM) as the
area of interest is known. We proposed a classification method,
which considers neighboring pixels in a region for feature extraction
and it evaluates classifications precisely according to neighboring
classes for semantic interpretation of region of interest (ROI). A
dataset has been created for training and testing purpose; we
generated the attributes by considering pixel intensity values and
mean values of reflectance. We demonstrated the benefits of using
knowledge discovery and data-mining techniques, which can be on
image data for accurate information extraction and classification from
high spatial resolution remote sensing imagery.
Abstract: Genetic algorithm is widely used in optimization
problems for its excellent global search capabilities and highly parallel
processing capabilities; but, it converges prematurely and has a poor
local optimization capability in actual operation. Simulated annealing
algorithm can avoid the search process falling into local optimum. A
hybrid genetic algorithm based on simulated annealing is designed by
combining the advantages of genetic algorithm and simulated
annealing algorithm. The numerical experiment represents the hybrid
genetic algorithm can be applied to solve the function optimization
problems efficiently.