Abstract: Fault tree analysis is a well-known method for
reliability and safety assessment of engineering systems. In the last 3
decades, a number of methods have been introduced, in the literature,
for automatic construction of fault trees. The main difference between these methods is the starting model from which the tree is constructed. This paper presents a new methodology for the construction of static and dynamic fault trees from a system Simulink
model. The method is introduced and explained in detail, and its correctness and completeness is experimentally validated by using an example, taken from literature. Advantages of the method are also mentioned.
Abstract: Competing risks survival data that comprises of more
than one type of event has been used in many applications, and one
of these is in clinical study (e.g. in breast cancer study). The
decision tree method can be extended to competing risks survival
data by modifying the split function so as to accommodate two or
more risks which might be dependent on each other. Recently,
researchers have constructed some decision trees for recurrent
survival time data using frailty and marginal modelling. We further
extended the method for the case of competing risks. In this paper,
we developed the decision tree method for competing risks survival
time data based on proportional hazards for subdistribution of
competing risks. In particular, we grow a tree by using deviance
statistic. The application of breast cancer data is presented. Finally,
to investigate the performance of the proposed method, simulation
studies on identification of true group of observations were executed.
Abstract: This paper presents a simple and effective method for approximate indexing of instances for instance based learning. The method uses an interval tree to determine a good starting search point for the nearest neighbor. The search stops when an early stopping criterion is met. The method proved to be very effective especially when only the first nearest neighbor is required.
Abstract: Phylogenies ; The evolutionary histories of groups of
species are one of the most widely used tools throughout the life
sciences, as well as objects of research with in systematic,
evolutionary biology. In every phylogenetic analysis reconstruction
produces trees. These trees represent the evolutionary histories of
many groups of organisms, bacteria due to horizontal gene transfer
and plants due to process of hybridization. The process of gene
transfer in bacteria and hybridization in plants lead to reticulate
networks, therefore, the methods of constructing trees fail in
constructing reticulate networks. In this paper a model has been
employed to reconstruct phylogenetic network in honey bee. This
network represents reticulate evolution in honey bee. The maximum
parsimony approach has been used to obtain this reticulate network.
Abstract: Independent spanning trees (ISTs) provide a number of advantages in data broadcasting. One can cite the use in fault tolerance network protocols for distributed computing and bandwidth. However, the problem of constructing multiple ISTs is considered hard for arbitrary graphs. In this paper we present an efficient algorithm to construct ISTs on hypercubes that requires minimum resources to be performed.
Abstract: Generator of hypotheses is a new method for data mining. It makes possible to classify the source data automatically and produces a particular enumeration of patterns. Pattern is an expression (in a certain language) describing facts in a subset of facts. The goal is to describe the source data via patterns and/or IF...THEN rules. Used evaluation criteria are deterministic (not probabilistic). The search results are trees - form that is easy to comprehend and interpret. Generator of hypotheses uses very effective algorithm based on the theory of monotone systems (MS) named MONSA (MONotone System Algorithm).
Abstract: The acid rain causes change in pH level of soil it is
directly influence on root and leaf growth. Yield of the crop was
reduced if acidity of soil is more. Acid rain seeps into the earth and
poisons plants and trees by dissolving toxic substances in the soil,
such as aluminum, which get absorbed by the roots. In present
investigation, effect of acid rain on crop Vigna radiata was studied.
The effect of acid rain on change in soil fertility was detected in
which pH of control sample was 6.5 and pH of 1% H2SO4 and 1%
HNO3 were 3.5. Nitrogen nitrate in soil was high in 1% HNO3 treated
soil & Control sample. Ammonium nitrogen in soil was low in 1%
HNO3 & H2SO4 treated soil. Ammonium nitrogen was medium in
control and other samples. The effect of acid rain on seed
germination on 3rd day of germination control sample growth was
6.1cm with plumule 0.001% HNO3 & 0.001% H2SO4 was 5.5cm
with plumule and 8cm with plumule. On 10th day fungal growth was
observed in 1% and 0.1% H2SO4 concentrations when all plants were
dead. The effect of acid rain on crop productivity was investigated on
3rd day roots were developed in plants. On 12th day Vigna radiata
showed more growth in 0.1% HNO3 and 0.1% H2SO4 treated plants
as compare to control plants. On 20th day development of
discoloration of plant pigments were observed on acid treated plants
leaves. On 34th day Vigna radiata showed flower in 0.1% HNO3,
0.01% HNO3 and 0.01% H2SO4treated plants and no flowers were
observed on control plants. On 42th day 0.1% HNO3, 0.01% HNO
and 0.01% H2SO4 treated Vigna radiata variety and control plants
were showed seeds on plants. In Vigna radiate variety 0.1%, 0.01%
HNO3, 0.01% H2SO4treated plants were dead on 46th day and fungal
growth was observed. The toxicological study was carried out on
Vigna radiata plants exposed to 1% HNO3 cells were damaged more
than 1% H2SO4. Leaf sections exposed to 0.001% HNO3 & H2SO4
showed less damaged of cells and pigmentation observed in entire
slide when compare with control plant.
Abstract: In this study, a high accuracy protein-protein interaction
prediction method is developed. The importance of the proposed
method is that it only uses sequence information of proteins while
predicting interaction. The method extracts phylogenetic profiles of
proteins by using their sequence information. Combining the phylogenetic
profiles of two proteins by checking existence of homologs
in different species and fitting this combined profile into a statistical
model, it is possible to make predictions about the interaction status
of two proteins.
For this purpose, we apply a collection of pattern recognition
techniques on the dataset of combined phylogenetic profiles of protein
pairs. Support Vector Machines, Feature Extraction using ReliefF,
Naive Bayes Classification, K-Nearest Neighborhood Classification,
Decision Trees, and Random Forest Classification are the methods
we applied for finding the classification method that best predicts
the interaction status of protein pairs. Random Forest Classification
outperformed all other methods with a prediction accuracy of 76.93%
Abstract: Data mining techniques have been used in medical
research for many years and have been known to be effective. In order
to solve such problems as long-waiting time, congestion, and delayed
patient care, faced by emergency departments, this study concentrates
on building a hybrid methodology, combining data mining techniques
such as association rules and classification trees. The methodology is
applied to real-world emergency data collected from a hospital and is
evaluated by comparing with other techniques. The methodology is
expected to help physicians to make a faster and more accurate
classification of chest pain diseases.
Abstract: Methods for organizing web data into groups in order
to analyze web-based hypertext data and facilitate data availability
are very important in terms of the number of documents available
online. Thereby, the task of clustering web-based document structures
has many applications, e.g., improving information retrieval on the
web, better understanding of user navigation behavior, improving web
users requests servicing, and increasing web information accessibility.
In this paper we investigate a new approach for clustering web-based
hypertexts on the basis of their graph structures. The hypertexts will
be represented as so called generalized trees which are more general
than usual directed rooted trees, e.g., DOM-Trees. As a important
preprocessing step we measure the structural similarity between the
generalized trees on the basis of a similarity measure d. Then,
we apply agglomerative clustering to the obtained similarity matrix
in order to create clusters of hypertext graph patterns representing
navigation structures. In the present paper we will run our approach
on a data set of hypertext structures and obtain good results in
Web Structure Mining. Furthermore we outline the application of
our approach in Web Usage Mining as future work.
Abstract: The inherent flexibilities of XML in both structure
and semantics makes mining from XML data a complex task with
more challenges compared to traditional association rule mining in
relational databases. In this paper, we propose a new model for the
effective extraction of generalized association rules form a XML
document collection. We directly use frequent subtree mining
techniques in the discovery process and do not ignore the tree
structure of data in the final rules. The frequent subtrees based on the
user provided support are split to complement subtrees to form the
rules. We explain our model within multi-steps from data preparation
to rule generation.
Abstract: Wavelet transforms are multiresolution
decompositions that can be used to analyze signals and images.
Image compression is one of major applications of wavelet
transforms in image processing. It is considered as one of the most
powerful methods that provides a high compression ratio. However,
its implementation is very time-consuming. At the other hand,
parallel computing technologies are an efficient method for image
compression using wavelets. In this paper, we propose a parallel
wavelet compression algorithm based on quadtrees. We implement
the algorithm using MatlabMPI (a parallel, message passing version
of Matlab), and compute its isoefficiency function, and show that it is
scalable. Our experimental results confirm the efficiency of the
algorithm also.
Abstract: Scene interpretation systems need to match (often ambiguous)
low-level input data to concepts from a high-level ontology.
In many domains, these decisions are uncertain and benefit greatly
from proper context. This paper demonstrates the use of decision
trees for estimating class probabilities for regions described by feature
vectors, and shows how context can be introduced in order to improve
the matching performance.
Abstract: A new target detection technique is presented in this
paper for the identification of small boats in coastal surveillance. The
proposed technique employs an adaptive progressive thresholding (APT) scheme to first process the given input scene to separate any
objects present in the scene from the background. The preprocessing
step results in an image having only the foreground objects, such as
boats, trees and other cluttered regions, and hence reduces the search
region for the correlation step significantly. The processed image is then fed to the shifted phase-encoded fringe-adjusted joint transform
correlator (SPFJTC) technique which produces single and delta-like
correlation peak for a potential target present in the input scene. A
post-processing step involves using a peak-to-clutter ratio (PCR) to determine whether the boat in the input scene is authorized or unauthorized. Simulation results are presented to show that the
proposed technique can successfully determine the presence of an authorized boat and identify any intruding boat present in the given input scene.
Abstract: Pattern matching based on regular tree grammars have been widely used in many areas of computer science. In this paper, we propose a pattern matcher within the framework of code generation, based on a generic and a formalized approach. According to this approach, parsers for regular tree grammars are adapted to a general pattern matching solution, rather than adapting the pattern matching according to their parsing behavior. Hence, we first formalize the construction of the pattern matches respective to input trees drawn from a regular tree grammar in a form of the so-called match trees. Then, we adopt a recently developed generic parser and tightly couple its parsing behavior with such construction. In addition to its generality, the resulting pattern matcher is characterized by its soundness and efficient implementation. This is demonstrated by the proposed theory and by the derived algorithms for its implementation. A comparison with similar and well-known approaches, such as the ones based on tree automata and LR parsers, has shown that our pattern matcher can be applied to a broader class of grammars, and achieves better approximation of pattern matches in one pass. Furthermore, its use as a machine code selector is characterized by a minimized overhead, due to the balanced distribution of the cost computations into static ones, during parser generation time, and into dynamic ones, during parsing time.
Abstract: Text categorization - the assignment of natural language documents to one or more predefined categories based on their semantic content - is an important component in many information organization and management tasks. Performance of neural networks learning is known to be sensitive to the initial weights and architecture. This paper discusses the use multilayer neural network initialization with decision tree classifier for improving text categorization accuracy. An adaptation of the algorithm is proposed in which a decision tree from root node until a final leave is used for initialization of multilayer neural network. The experimental evaluation demonstrates this approach provides better classification accuracy with Reuters-21578 corpus, one of the standard benchmarks for text categorization tasks. We present results comparing the accuracy of this approach with multilayer neural network initialized with traditional random method and decision tree classifiers.
Abstract: The purpose of this paper is to develop models that would enable predicting student success. These models could improve allocation of students among colleges and optimize the newly introduced model of government subsidies for higher education. For the purpose of collecting data, an anonymous survey was carried out in the last year of undergraduate degree student population using random sampling method. Decision trees were created of which two have been chosen that were most successful in predicting student success based on two criteria: Grade Point Average (GPA) and time that a student needs to finish the undergraduate program (time-to-degree). Decision trees have been shown as a good method of classification student success and they could be even more improved by increasing survey sample and developing specialized decision trees for each type of college. These types of methods have a big potential for use in decision support systems.
Abstract: In this paper, we present two new ranking and unranking
algorithms for k-ary trees represented by x-sequences in Gray
code order. These algorithms are based on a gray code generation algorithm
developed by Ahrabian et al.. In mentioned paper, a recursive
backtracking generation algorithm for x-sequences corresponding to
k-ary trees in Gray code was presented. This generation algorithm
is based on Vajnovszki-s algorithm for generating binary trees in
Gray code ordering. Up to our knowledge no ranking and unranking
algorithms were given for x-sequences in this ordering. we present
ranking and unranking algorithms with O(kn2) time complexity for
x-sequences in this Gray code ordering
Abstract: This work investigated the phenology of Parah tree
(Elateriospermum tapos) using the General Purpose Atmosphere
Plant Soil Simulator (GAPS model) to determine the amount of Plant
Available Water (PAW) in the soil. We found the correlation
between PAW and the timing of budburst and flower burst at Khao
Nan National Park, Nakhon Si Thammarat, Thailand. PAW from the
GAPS model can be used as an indicator of soil water stress. The low
amount of PAW may lead to leaf shedding in Parah trees.
Abstract: The trend of growing density on chips has increases not
only the temperature in chips but also the gradient of the temperature
depending on locations. In this paper, we propose the balanced skew
tree generation technique for minimizing the clock skew that is
affected by the temperature gradients on chips. We calculate the
interconnect delay using Elmore delay equation, and find out the
optimal balanced clock tree by modifying the clock trees generated
through the Deferred Merge Embedding(DME) algorithm. The
experimental results show that the distance variance of clock insertion
points with and without considering the temperature gradient can be
lowered below 54% and we confirm that the skew is remarkably
decreased after applying the proposed technique.