Abstract: Granular computing deals with representation of information in the form of some aggregates and related methods for transformation and analysis for problem solving. A granulation scheme based on clustering and Rough Set Theory is presented with focus on structured conceptualization of information has been presented in this paper. Experiments for the proposed method on four labeled data exhibit good result with reference to classification problem. The proposed granulation technique is semi-supervised imbibing global as well as local information granulation. To represent the results of the attribute oriented granulation a tree structure is proposed in this paper.
Abstract: Globalization, supported by information and
communication technologies, changes the rules of competitiveness
and increases the significance of information, knowledge and
network cooperation. In line with this trend, the need for efficient
trust-building tools has emerged. The absence of trust building
mechanisms and strategies was identified within several studies.
Through trust development, participation on e-business network and
usage of network services will increase and provide to SMEs new
economic benefits. This work is focused on effective trust building
strategies development for electronic business network platforms.
Based on trust building mechanism identification, the questionnairebased
analysis of its significance and minimum level of requirements
was conducted. In the paper, we are confirming the trust dependency
on e-Skills which play crucial role in higher level of trust into the
more sophisticated and complex trust building ICT solutions.
Abstract: This study was conducted to determine effect of water stress on chlorophyll content and chlorophyll fluorescence parameter in young `Dezful- olive trees. Three irrigation regimes (40% ETcrop, 65% ETcrop and 100% ETcrop) were used. After irrigation treatments were applied, some of biochemical parameters including chlorophyll a, b, total chlorophyll, chlorophyll fluorescence and also chlorophyll content index (C.C.I) were measured. Results of Analysis of variance showed that irrigation treatments had significant effect on chlorophylla, total chlorophyll (chl a+b), C.C.I and Fv/Fm ratio. The amount of decreased chlorophyll a and total chlorophyll in plants were received 40% ETcrop were 51.55% and 46.86%, respectively, compared with 100% ETcrop.
Abstract: To understand life as biological system, evolutionary
understanding is indispensable. Protein interactions data are rapidly
accumulating and are suitable for system-level evolutionary analysis.
We have analyzed yeast protein interaction network by both
mathematical and biological approaches. In this poster presentation,
we inferred the evolutionary birth periods of yeast proteins by
reconstructing phylogenetic profile. It has been thought that hub
proteins that have high connection degree are evolutionary old. But
our analysis showed that hub proteins are entirely evolutionary new.
We also examined evolutionary processes of protein complexes. It
showed that member proteins of complexes were tend to have
appeared in the same evolutionary period. Our results suggested that
protein interaction network evolved by modules that form the
functional unit. We also reconstructed standardized phylogenetic trees
and calculated evolutionary rates of yeast proteins. It showed that
there is no obvious correlation between evolutionary rates and
connection degrees of yeast proteins.
Abstract: We present a visualization technique for radial drawing of trees consisting of two slightly different algorithms. Both of them make use of node-link diagrams for visual encoding. This visualization creates clear drawings without edge crossing. One of the algorithms is suitable for real-time visualization of large trees, as it requires minimal recalculation of the layout if leaves are inserted or removed from the tree; while the other algorithm makes better utilization of the drawing space. The algorithms are very similar and follow almost the same procedure but with different parameters. Both algorithms assign angular coordinates for all nodes which are then converted into 2D Cartesian coordinates for visualization. We present both algorithms and discuss how they compare to each other.
Abstract: This paper focuses on the data-driven generation
of fuzzy IF...THEN rules. The resulted fuzzy rule base can be
applied to build a classifier, a model used for prediction, or
it can be applied to form a decision support system. Among
the wide range of possible approaches, the decision tree and
the association rule based algorithms are overviewed, and two
new approaches are presented based on the a priori fuzzy
clustering based partitioning of the continuous input variables.
An application study is also presented, where the developed
methods are tested on the well known Wisconsin Breast Cancer
classification problem.
Abstract: In order to compare vertical stratification, floristic composition, and woody species diversity of subtropical evergreen broadleaf forests between the Ryukyu Archipelago, Japan, and South China, tree censuses in a 400 m2 plot in Ishigaki Island and a 1225 m2 plot in Dinghushan Nature Reserve were performed. Both of the subtropical forests consisted of five vertical strata. The floristic composition of the Ishigaki forest was quite different from that of the Dinghushan forest in terms of similarity on a species level (Kuno-s similarity index r0 = 0.05). The values of Shannon-s index H' and Pielou-s index J ' tended to increase from the bottom stratum upward in both forests, except H' for the top stratum in the Ishigaki forest and the upper two strata in the Dinghushan forest. The woody species diversity in the Dinghushan forest (H'= 3.01 bit) was much lower than that in the Ishigaki forest (H'= 4.36 bit).
Abstract: Tehran, one of the heavily-populated capitals, is
severely suffering from increasing air pollution. To show a
documented trend of such pollutants during last years, plane tree
species (Platanus orientalis) were suited to be studied as indicators,
for the species have been planted throughout the city many years
ago. Two areas (Saadatabad and Narmak districts) allotting different
contents of crowed and highly-traffic routs but the same ecological
characteristics were selected. Twelve sample individuals were cored
twice perpendicularly in each area. Tree-rings of each core were
measured by a binocular microscope and separated annually for the
last 25 years. Two heavy metals including Cd and Pb accompanied
by a mineral element (Ca) were analyzed using Hatch method. Treerings
analysis of the two areas showed different groups in term of
physiologically ability as the growths were plunged during the last
10 years in Saadatabad district and showed a slight decrease in the
same period for another studying area. In direct contrast to
decreasing growth trend in Saadatabad, all three mentioned elements
increased sharply during last 25 years in the same area. When it came
to Narmak district, the trend was completely different with
Saadatabad. There were some fluctuations in absorbing trace
elements like tree-rings widths were, yet calcium showed an upward
trend all the last 25 years. The results of the study proved the
possibility of using tree species of each region to monitor its air
pollution trends of the past, hence to depict a pollution assessment of
a populated city for last years and then to make appropriate decisions
for the future as it is well-known what the trend is. On the other
hand, risen values of calcium (as the stress-indicator element)
accompanied by increased trace elements suggests non-sustainable
state of the trees.
Abstract: This work provides a practical method for the
development of rural road networks in rural areas of developing
countries. The proposed methodology enables to determine
obligatory points in the rural road network maximizing the number of
settlements that have access to basic services within a given
maximum distance. The proposed methodology is simple and
practical, hence, highly applicable to real-world scenarios, as
demonstrated in the definition of the road network for the rural areas
of Nepal.
Abstract: The objective of this research intends to create a suitable model of distance training for community leaders in the upper northeastern region of Thailand. The implementation of the research process is divided into four steps: The first step is to analyze relevant documents. The second step deals with an interview in depth with experts. The third step is concerned with constructing a model. And the fourth step takes aim at model validation by expert assessments. The findings reveal the two important components for constructing an appropriate model of distance training for community leaders in the upper northeastern region. The first component consists of the context of technology management, e.g., principle, policy and goals. The second component can be viewed in two ways. Firstly, there are elements comprising input, process, output and feedback. Secondly, the sub-components include steps and process in training. The result of expert assessments informs that the researcher-s constructed model is consistent and suitable and overall the most appropriate.
Abstract: A hybrid learning automata-genetic algorithm (HLGA) is proposed to solve QoS routing optimization problem of next generation networks. The algorithm complements the advantages of the learning Automato Algorithm(LA) and Genetic Algorithm(GA). It firstly uses the good global search capability of LA to generate initial population needed by GA, then it uses GA to improve the Quality of Service(QoS) and acquiring the optimization tree through new algorithms for crossover and mutation operators which are an NP-Complete problem. In the proposed algorithm, the connectivity matrix of edges is used for genotype representation. Some novel heuristics are also proposed for mutation, crossover, and creation of random individuals. We evaluate the performance and efficiency of the proposed HLGA-based algorithm in comparison with other existing heuristic and GA-based algorithms by the result of simulation. Simulation results demonstrate that this paper proposed algorithm not only has the fast calculating speed and high accuracy but also can improve the efficiency in Next Generation Networks QoS routing. The proposed algorithm has overcome all of the previous algorithms in the literature.
Abstract: In this paper, we deal with the Steiner tree problem
(STP) on a graph in which a fuzzy number, instead of a real number,
is assigned to each edge. We propose a modification of the shortest
paths approximation based on the fuzzy shortest paths (FSP)
evaluations. Since a fuzzy min operation using the extension
principle leads to nondominated solutions, we propose another
approach to solving the FSP using Cheng's centroid point fuzzy
ranking method.
Abstract: In this paper, we proposed the robust mobile object
detection method for light effect in the night street image block based
updating reference background model using block state analysis.
Experiment image is acquired sequence color video from steady
camera. When suddenly appeared artificial illumination, reference
background model update this information such as street light, sign
light. Generally natural illumination is change by temporal, but
artificial illumination is suddenly appearance. So in this paper for
exactly detect artificial illumination have 2 state process. First process
is compare difference between current image and reference
background by block based, it can know changed blocks. Second
process is difference between current image-s edge map and reference
background image-s edge map, it possible to estimate illumination at
any block. This information is possible to exactly detect object,
artificial illumination and it was generating reference background
more clearly. Block is classified by block-state analysis. Block-state
has a 4 state (i.e. transient, stationary, background, artificial
illumination). Fig. 1 is show characteristic of block-state respectively
[1]. Experimental results show that the presented approach works well
in the presence of illumination variance.
Abstract: The main purpose of this research was to study how to
communicate the identity of the Amphawa district, Samut Songkram
province for sustainable tourism. The qualitative data was collected
through studying related materials, exploring the area, in-depth
interviews with three groups of people: three directly responsible
officers who were key informants of the district, twenty foreign
tourists and five Thai tourist guides. A content analysis was used to
analyze the qualitative data. The two main findings of the study were
as follows:
1. The identity of the Amphawa District, Samut Songkram
province is the area controlled by Amphawa sub district (submunicipality).
The working unit which runs and looks after
Amphawa sub district administration is known as the Amphawa
mayor. This establishment was built to be a resort for normal
people and tourists visiting the Amphawa district near the
Maekong River consisting of rest accommodations. Along the
river there is a restaurant where food and drinks are served, rich
mangrove forests, a learning center, fireflies and cork trees. The
Amphawa district was built to honor and commemorate King
Rama II and is where the greatest number of fireflies and cork
trees can be seen in Thailand from May to October each year.
2. The communication of the identity of Amphawa District, Samut
Songkram Province which the researcher could find and design
to present in English materials can be summed up in 5 items: 1)
The history of the Amphawa District, Samut Songkram province
2) The history of King Rama II Memorial Park 3) The identity of
Amphawa Floating Market 4) The Learning center of
Ecosystem: Fireflies and Cork Trees 5) How to keep Amphawa
District, Samut Songkram Province for sustainable tourism.
Abstract: In this paper, a near lossless image coding scheme
based on Orthogonal Polynomials Transform (OPT) has been
presented. The polynomial operators and polynomials basis operators
are obtained from set of orthogonal polynomials functions for the
proposed transform coding. The image is partitioned into a number of
distinct square blocks and the proposed transform coding is applied to
each of these individually. After applying the proposed transform
coding, the transformed coefficients are rearranged into a sub-band
structure. The Embedded Zerotree (EZ) coding algorithm is then
employed to quantize the coefficients. The proposed transform is
implemented for various block sizes and the performance is
compared with existing Discrete Cosine Transform (DCT) transform
coding scheme.
Abstract: Liveable city is referred to as the quality of life in an
area that contributes towards a safe, healthy and enjoyable place. This
paper discusses the role of the streets- activities in making Kuala
Lumpur a liveable city and the happiness level of the residents
towards the city-s street activities. The study was conducted using the
residents of Kuala Lumpur. A mixed method technique is used with
the quantitative data as a main data and supported by the qualitative
data. Data were collected using questionnaires, observation and also
an interview session with a sample of residents of Kuala Lumpur.
The sampling technique is based on multistage cluster data sampling.
The findings revealed that, there is still no significant relationship
between the length of stay of the resident in Kuala Lumpur with the
happiness level towards the street activities that occurred in the city.
Abstract: There are various overlay structures that provide
efficient and scalable solutions for point and range query in a peer-topeer
network. Overlay structure based on m-Binary Search Tree
(BST) is one such popular technique. It deals with the division of the
tree into different key intervals and then assigning the key intervals to
a BST. The popularity of the BST makes this overlay structure
vulnerable to different kinds of attacks. Here we present four such
possible attacks namely index poisoning attack, eclipse attack,
pollution attack and syn flooding attack. The functionality of BST is
affected by these attacks. We also provide different security
techniques that can be applied against these attacks.
Abstract: Reliable secure multicast communication in mobile
adhoc networks is challenging due to its inherent characteristics of
infrastructure-less architecture with lack of central authority, high
packet loss rates and limited resources such as bandwidth, time and
power. Many emerging commercial and military applications require
secure multicast communication in adhoc environments. Hence key
management is the fundamental challenge in achieving reliable
secure communication using multicast key distribution for mobile
adhoc networks. Thus in designing a reliable multicast key
distribution scheme, reliability and congestion control over
throughput are essential components. This paper proposes and
evaluates the performance of an enhanced optimized multicast cluster
tree algorithm with destination sequenced distance vector routing
protocol to provide reliable multicast key distribution. Simulation
results in NS2 accurately predict the performance of proposed
scheme in terms of key delivery ratio and packet loss rate under
varying network conditions. This proposed scheme achieves
reliability, while exhibiting low packet loss rate with high key
delivery ratio compared with the existing scheme.
Abstract: Opportunistic Data Forwarding (ODF) has drawn much attention in mobile adhoc networking research in recent years. The effectiveness of ODF in MANET depends on a suitable routing protocol which provides a powerful source routing services. PLSR is featured by source routing, loop free and small routing overhead. The update messages in PLSR are integrated into a tree structure and no need to time stamp routing updates which reduces the routing overhead.
Abstract: Many multimedia communication applications require a
source to transmit messages to multiple destinations subject to quality
of service (QoS) delay constraint. To support delay constrained
multicast communications, computer networks need to guarantee an
upper bound end-to-end delay from the source node to each of
the destination nodes. This is known as multicast delay problem.
On the other hand, if the same message fails to arrive at each
destination node at the same time, there may arise inconsistency and
unfairness problem among users. This is related to multicast delayvariation
problem. The problem to find a minimum cost multicast
tree with delay and delay-variation constraints has been proven to
be NP-Complete. In this paper, we propose an efficient heuristic
algorithm, namely, Economic Delay and Delay-Variation Bounded
Multicast (EDVBM) algorithm, based on a novel heuristic function,
to construct an economic delay and delay-variation bounded multicast
tree. A noteworthy feature of this algorithm is that it has very high
probability of finding the optimal solution in polynomial time with
low computational complexity.