Abstract: Scheduling of diversified service requests in
distributed computing is a critical design issue. Cloud is a type of
parallel and distributed system consisting of a collection of
interconnected and virtual computers. It is not only the clusters and
grid but also it comprises of next generation data centers. The paper
proposes an initial heuristic algorithm to apply modified ant colony
optimization approach for the diversified service allocation and
scheduling mechanism in cloud paradigm. The proposed optimization
method is aimed to minimize the scheduling throughput to service all
the diversified requests according to the different resource allocator
available under cloud computing environment.
Abstract: This paper proposes a novel solution for optimizing
the size and communication overhead of a distributed multiagent
system without compromising the performance. The proposed approach
addresses the challenges of scalability especially when the
multiagent system is large. A modified spectral clustering technique
is used to partition a large network into logically related clusters.
Agents are assigned to monitor dedicated clusters rather than monitor
each device or node. The proposed scalable multiagent system is
implemented using JADE (Java Agent Development Environment)
for a large power system. The performance of the proposed topologyindependent
decentralized multiagent system and the scalable multiagent
system is compared by comprehensively simulating different
fault scenarios. The time taken for reconfiguration, the overall computational
complexity, and the communication overhead incurred are
computed. The results of these simulations show that the proposed
scalable multiagent system uses fewer agents efficiently, makes faster
decisions to reconfigure when a fault occurs, and incurs significantly
less communication overhead.
Abstract: Ant colony based routing algorithms are known to
grantee the packet delivery, but they suffer from the huge overhead
of control messages which are needed to discover the route. In this
paper we utilize the network nodes positions to group the nodes
in connected clusters. We use clusters-heads only on forwarding
the route discovery control messages. Our simulations proved that
the new algorithm has decreased the overhead dramatically without
affecting the delivery rate.
Abstract: Social bookmarking is an environment in which
the user gradually changes interests over time so that the tag
data associated with the current temporal period is usually more
important than tag data temporally far from the current period.
This implies that in the social tagging system, the newly tagged
items by the user are more relevant than older items. This study
proposes a novel recommender system that considers the users-
recent tag preferences. The proposed system includes the
following stages: grouping similar users into clusters using an
E-M clustering algorithm, finding similar resources based on
the user-s bookmarks, and recommending the top-N items to
the target user. The study examines the system-s information
retrieval performance using a dataset from del.icio.us, which is
a famous social bookmarking web site. Experimental results
show that the proposed system is better and more effective than
traditional approaches.
Abstract: In the paper we submit the non-local modification of
kinetic Smoluchowski equation for binary aggregation applying to
dispersed media having memory. Our supposition consists in that that
intensity of evolution of clusters is supposed to be a function of the
product of concentrations of the lowest orders clusters at different
moments. The new form of kinetic equation for aggregation is
derived on the base of the transfer kernels approach. This approach
allows considering the influence of relaxation times hierarchy on
kinetics of aggregation process in media with memory.
Abstract: In molecular biology, microarray technology is widely and successfully utilized to efficiently measure gene activity. If working with less studied organisms, methods to design custom-made microarray probes are available. One design criterion is to select probes with minimal melting temperature variances thus ensuring similar hybridization properties. If the microarray application focuses on the investigation of metabolic pathways, it is not necessary to cover the whole genome. It is more efficient to cover each metabolic pathway with a limited number of genes. Firstly, an approach is presented which minimizes the overall melting temperature variance of selected probes for all genes of interest. Secondly, the approach is extended to include the additional constraints of covering all pathways with a limited number of genes while minimizing the overall variance. The new optimization problem is solved by a bottom-up programming approach which reduces the complexity to make it computationally feasible. The new method is exemplary applied for the selection of microarray probes in order to cover all fungal secondary metabolite gene clusters for Aspergillus terreus.
Abstract: Self-organizing map (SOM) is a well known data
reduction technique used in data mining. It can reveal structure in
data sets through data visualization that is otherwise hard to detect
from raw data alone. However, interpretation through visual
inspection is prone to errors and can be very tedious. There are
several techniques for the automatic detection of clusters of code
vectors found by SOM, but they generally do not take into account
the distribution of code vectors; this may lead to unsatisfactory
clustering and poor definition of cluster boundaries, particularly
where the density of data points is low. In this paper, we propose the
use of an adaptive heuristic particle swarm optimization (PSO)
algorithm for finding cluster boundaries directly from the code
vectors obtained from SOM. The application of our method to
several standard data sets demonstrates its feasibility. PSO algorithm
utilizes a so-called U-matrix of SOM to determine cluster boundaries;
the results of this novel automatic method compare very favorably to
boundary detection through traditional algorithms namely k-means
and hierarchical based approach which are normally used to interpret
the output of SOM.
Abstract: Content-based Image Retrieval (CBIR) aims at searching image databases for specific images that are similar to a given query image based on matching of features derived from the image content. This paper focuses on a low-dimensional color based indexing technique for achieving efficient and effective retrieval performance. In our approach, the color features are extracted using the mean shift algorithm, a robust clustering technique. Then the cluster (region) mode is used as representative of the image in 3-D color space. The feature descriptor consists of the representative color of a region and is indexed using a spatial indexing method that uses *R -tree thus avoiding the high-dimensional indexing problems associated with the traditional color histogram. Alternatively, the images in the database are clustered based on region feature similarity using Euclidian distance. Only representative (centroids) features of these clusters are indexed using *R -tree thus improving the efficiency. For similarity retrieval, each representative color in the query image or region is used independently to find regions containing that color. The results of these methods are compared. A JAVA based query engine supporting query-by- example is built to retrieve images by color.
Abstract: This paper proposes an analytical method for the
dynamics of generating firms- alliance networks along with business
phases. Dynamics in network developments have previously been
discussed in the research areas of organizational strategy rather than in
the areas of regional cluster, where the static properties of the
networks are often discussed. The analytical method introduces the
concept of business phases into innovation processes and uses
relationships called prior experiences; this idea was developed in
organizational strategy to investigate the state of networks from the
viewpoints of tradeoffs between link stabilization and node
exploration. This paper also discusses the results of the analytical
method using five cases of the network developments of firms. The
idea of Embeddedness helps interpret the backgrounds of the
analytical results. The analytical method is useful for policymakers of
regional clusters to establish concrete evaluation targets and a
viewpoint for comparisons of policy programs.
Abstract: Skin color based tracking techniques often assume a
static skin color model obtained either from an offline set of library
images or the first few frames of a video stream. These models
can show a weak performance in presence of changing lighting or
imaging conditions. We propose an adaptive skin color model based
on the Gaussian mixture model to handle the changing conditions.
Initial estimation of the number and weights of skin color clusters
are obtained using a modified form of the general Expectation
maximization algorithm, The model adapts to changes in imaging
conditions and refines the model parameters dynamically using spatial
and temporal constraints. Experimental results show that the method
can be used in effectively tracking of hand and face regions.
Abstract: Chest pain is one of the most prevalent complaints
among adults that cause the people to attend to medical centers. The
aim was to determine the prevalence and risk factors of chest pain
among over 30 years old people in Tehran. In this cross-sectional
study, 787 adults took part from Apr 2005 until Apr 2006. The
sampling method was random cluster sampling and there were 25
clusters. In each cluster, interviews were performed with 32 over 30
years old, people lived in those houses. In cases with chest pain, extra
questions asked. The prevalence of CP was 9% (71 cases). Of them
21 cases (6.5%) were in 41-60 year age ranges and the remainders
were over 61 year old. 19 cases (26.8%) mentioned CP in resting
state and all of the cases had exertion onset CP. The CP duration was
10 minutes or less in all of the cases and in most of them (84.5%), the
location of pain mentioned left anterior part of chest, left anterior part
of sternum and or left arm. There was positive history of myocardial
infarction in 12 cases (17%). There was significant relation between
CP and age, sex and between history of myocardial infarction and
marital state of study people. Our results are similar to other studies-
results in most parts, however it is necessary to perform
supplementary tests and follow up studies to differentiate between
cardiac and non-cardiac CP exactly.
Abstract: The purpose of this study is to identify the critical success factors (CSFs) for the effective implementation of Six Sigma in non-formal service Sectors.
Based on the survey of literature, the critical success factors (CSFs) for Six Sigma have been identified and are assessed for their importance in Non-formal service sector using Delphi Technique. These selected CSFs were put forth to the panel of expert to cluster them and prepare cognitive map to establish their relationship.
All the critical success factors examined and obtained from the review of literature have been assessed for their importance with respect to their contribution to Six Sigma effectiveness in non formal service sector.
The study is limited to the non-formal service sectors involved in the organization of religious festival only. However, the similar exercise can be conducted for broader sample of other non-formal service sectors like temple/ashram management, religious tours management etc.
The research suggests an approach to identify CSFs of Six Sigma for Non-formal service sector. All the CSFs of the formal service sector will not be applicable to Non-formal services, hence opinion of experts was sought to add or delete the CSFs. In the first round of Delphi, the panel of experts has suggested, two new CSFs-“competitive benchmarking (F19) and resident’s involvement (F28)”, which were added for assessment in the next round of Delphi. One of the CSFs-“fulltime six sigma personnel (F15)” has been omitted in proposed clusters of CSFs for non-formal organization, as it is practically impossible to deploy full time trained Six Sigma recruits.
Abstract: A genetic algorithm (GA) based feature subset
selection algorithm is proposed in which the correlation structure of
the features is exploited. The subset of features is validated according
to the classification performance. Features derived from the
continuous wavelet transform are potentially strongly correlated.
GA-s that do not take the correlation structure of features into
account are inefficient. The proposed algorithm forms clusters of
correlated features and searches for a good candidate set of clusters.
Secondly a search within the clusters is performed. Different
simulations of the algorithm on a real-case data set with strong
correlations between features show the increased classification
performance. Comparison is performed with a standard GA without
use of the correlation structure.
Abstract: The company-s ability to draw on a range of external
sources to meet their needs for innovation, has been termed 'open
innovation' (OI). Very few empirical analyses have been conducted
on Small and Medium Enterprises (SMEs) to the extent that they
describe and understand the characteristics and implications of this
new paradigm.
The study's objective is to identify and characterize different
modes of OI, (considering innovation process phases and the variety
and breadth of the collaboration), determinants, barriers and
motivations in SMEs. Therefore a survey was carried out among
Italian manufacturing firms and a database of 105 companies was
obtained. With regard to data elaboration, a factorial and cluster
analysis has been conducted and three different OI modes have
emerged: selective low open, unselective open upstream, and mid-
partners integrated open. The different behaviours of the three
clusters in terms of determinants factors, performance, firm-s
technology intensity, barriers and motivations have been analyzed
and discussed.
Abstract: Octree compression techniques have been used
for several years for compressing large three dimensional data
sets into homogeneous regions. This compression technique
is ideally suited to datasets which have similar values in
clusters. Oil engineers represent reservoirs as a three dimensional
grid where hydrocarbons occur naturally in clusters. This
research looks at the efficiency of storing these grids using
octree compression techniques where grid cells are broken
into active and inactive regions. Initial experiments yielded
high compression ratios as only active leaf nodes and their
ancestor, header nodes are stored as a bitstream to file on
disk. Savings in computational time and memory were possible
at decompression, as only active leaf nodes are sent to the
graphics card eliminating the need of reconstructing the original
matrix. This results in a more compact vertex table, which can
be loaded into the graphics card quicker and generating shorter
refresh delay times.
Abstract: Un-doped GaN film of thickness 1.90 mm, grown on
sapphire substrate were uniformly implanted with 325 keV Mn+ ions
for various fluences varying from 1.75 x 1015 - 2.0 x 1016 ions cm-2 at
3500 C substrate temperature. The structural, morphological and
magnetic properties of Mn ion implanted gallium nitride samples
were studied using XRD, AFM and SQUID techniques. XRD of the
sample implanted with various ion fluences showed the presence of
different magnetic phases of Ga3Mn, Ga0.6Mn0.4 and Mn4N.
However, the compositions of these phases were found to be
depended on the ion fluence. AFM images of non-implanted sample
showed micrograph with rms surface roughness 2.17 nm. Whereas
samples implanted with the various fluences showed the presence of
nano clusters on the surface of GaN. The shape, size and density of
the clusters were found to vary with respect to ion fluence. Magnetic
moment versus applied field curves of the samples implanted with
various fluences exhibit the hysteresis loops. The Curie temperature
estimated from zero field cooled and field cooled curves for the
samples implanted with the fluence of 1.75 x 1015, 1.5 x 1016 and 2.0
x 1016 ions cm-2 was found to be 309 K, 342 K and 350 K
respectively.
Abstract: A neurofuzzy approach for a given set of input-output training data is proposed in two phases. Firstly, the data set is partitioned automatically into a set of clusters. Then a fuzzy if-then rule is extracted from each cluster to form a fuzzy rule base. Secondly, a fuzzy neural network is constructed accordingly and parameters are tuned to increase the precision of the fuzzy rule base. This network is able to learn and optimize the rule base of a Sugeno like Fuzzy inference system using Hybrid learning algorithm, which combines gradient descent, and least mean square algorithm. This proposed neurofuzzy system has the advantage of determining the number of rules automatically and also reduce the number of rules, decrease computational time, learns faster and consumes less memory. The authors also investigate that how neurofuzzy techniques can be applied in the area of control theory to design a fuzzy controller for linear and nonlinear dynamic systems modelling from a set of input/output data. The simulation analysis on a wide range of processes, to identify nonlinear components on-linely in a control system and a benchmark problem involving the prediction of a chaotic time series is carried out. Furthermore, the well-known examples of linear and nonlinear systems are also simulated under the Matlab/Simulink environment. The above combination is also illustrated in modeling the relationship between automobile trips and demographic factors.
Abstract: We study a long-range percolation model in the hierarchical
lattice ΩN of order N where probability of connection between
two nodes separated by distance k is of the form min{αβ−k, 1},
α ≥ 0 and β > 0. The parameter α is the percolation parameter,
while β describes the long-range nature of the model. The ΩN is
an example of so called ultrametric space, which has remarkable
qualitative difference between Euclidean-type lattices. In this paper,
we characterize the sizes of large clusters for this model along the
line of some prior work. The proof involves a stationary embedding
of ΩN into Z. The phase diagram of this long-range percolation is
well understood.
Abstract: n-CdO/p-Si heterojunction diode was fabricated using
sol-gel spin coating technique which is a low cost and easily scalable
method for preparing of semiconductor films. The structural and
morphological properties of CdO film were investigated. The X-ray
diffraction (XRD) spectra indicated that the film was of
polycrystalline nature. The scanning electron microscopy (SEM)
images indicate that the surface morphology CdO film consists of the
clusters formed with the coming together of the nanoparticles. The
electrical characterization of Au/n-CdO/p–Si/Al heterojunction diode
was investigated by current-voltage. The ideality factor of the diode
was found to be 3.02 for room temperature. The reverse current of
the diode strongly increased with illumination intensity of 100
mWcm-2 and the diode gave a maximum open circuit voltage Voc of
0.04 V and short-circuits current Isc of 9.92×10-9 A.
Abstract: In this paper an algorithm is used to detect the color defects of ceramic tiles. First the image of a normal tile is clustered using GCMA; Genetic C-means Clustering Algorithm; those results in best cluster centers. C-means is a common clustering algorithm which optimizes an objective function, based on a measure between data points and the cluster centers in the data space. Here the objective function describes the mean square error. After finding the best centers, each pixel of the image is assigned to the cluster with closest cluster center. Then, the maximum errors of clusters are computed. For each cluster, max error is the maximum distance between its center and all the pixels which belong to it. After computing errors all the pixels of defected tile image are clustered based on the centers obtained from normal tile image in previous stage. Pixels which their distance from their cluster center is more than the maximum error of that cluster are considered as defected pixels.