Abstract: This study, focusing on the importance of encouraging
outdoor activities for children, aims to propose and implement a
Web-GIS based outdoor education program for elementary schools,
which will then be evaluated by users. Specifically, for the purpose of
improved outdoor activities in the elementary school education, the
outdoor education program, with chiefly using the Web-GIS that
provides a good information provision and sharing tool, is proposed
and implemented before being evaluated by users. Conclusions of the
study boil down to:
(1) An eight-staged outdoor education program based on the Web-GIS
was proposed for a “second school" of an elementary school that
was then implemented before being evaluated by users (teachers,
instructors, students, and their parents).
(2) The program generally received a good evaluation, while a lot of
students and their parents evaluated negatively for the degree of
discovery and for the degree of interest, respectively, in the
questionnaire survey of students and their parents conducted after
the “second school". The surveys clearly show that an issue to be
solved, from the viewpoint of teachers in particular, is the
establishment of the GIS that will easily represent teaching materials
developed by teachers and of Web-GIS, and improved significance
of the use of GIS and Web-GIS for their widespread.
Abstract: Recent years have instance that there is a invigoration
of interest in drug discovery from medicinal plants for the support of
health in all parts of the world . This study was designed to examine
the in vitro antimicrobial activities of the flowers and leaves
methanolic and ethanolic extracts of Chenopodium album L.
Chenopodium album Linn. flowers and leaves were collected from
East Esfahan, Iran. The effects of methanolic and ethanolic extracts
were tested against 4 bacterial strains by using disc,well-diffusion
method. Results showed that flowers and leaves methanolic and
ethanolic extracts of C.album don-t have any activity against the
selected bacterial strains. Our study has indicated that ,there are
effective different factors on antimicrobial properties of plant extracts
Abstract: In this paper a one-dimension Self Organizing Map
algorithm (SOM) to perform feature selection is presented. The
algorithm is based on a first classification of the input dataset on a
similarity space. From this classification for each class a set of
positive and negative features is computed. This set of features is
selected as result of the procedure. The procedure is evaluated on an
in-house dataset from a Knowledge Discovery from Text (KDT)
application and on a set of publicly available datasets used in
international feature selection competitions. These datasets come
from KDT applications, drug discovery as well as other applications.
The knowledge of the correct classification available for the training
and validation datasets is used to optimize the parameters for positive
and negative feature extractions. The process becomes feasible for
large and sparse datasets, as the ones obtained in KDT applications,
by using both compression techniques to store the similarity matrix
and speed up techniques of the Kohonen algorithm that take
advantage of the sparsity of the input matrix. These improvements
make it feasible, by using the grid, the application of the
methodology to massive datasets.
Abstract: Service discovery is a very important component of Service Oriented Architectures (SOA). This paper presents two alternative approaches to customise the query results of private service registry such as Universal Description, Discovery and Integration (UDDI). The customisation is performed based on some pre-defined and/or real-time changing parameters. This work identifies the requirements, designs and additional mechanisms that must be applied to UDDI in order to support this customisation capability. We also detail the implements of the approaches and examine its performance and scalability. Based on our experimental results, we conclude that both approaches can be used to customise registry query results, but by storing personalization parameters in external resource will yield better performance and but less scalable when size of query results increases. We believe these approaches when combined with semantics enabled service registry will enhance the service discovery methods within a private UDDI registry environment.
Abstract: The theory of Groebner Bases, which has recently been
honored with the ACM Paris Kanellakis Theory and Practice Award,
has become a crucial building block to computer algebra, and is
widely used in science, engineering, and computer science. It is wellknown
that Groebner bases computation is EXP-SPACE in a general
polynomial ring setting.
However, for many important applications in computer science
such as satisfiability and automated verification of hardware and
software, computations are performed in a Boolean ring. In this paper,
we give an algorithm to show that Groebner bases computation is PSPACE
in Boolean rings. We also show that with this discovery,
the Groebner bases method can theoretically be as efficient as
other methods for automated verification of hardware and software.
Additionally, many useful and interesting properties of Groebner
bases including the ability to efficiently convert the bases for different
orders of variables making Groebner bases a promising method in
automated verification.
Abstract: Human Resource (HR) applications can be used to
provide fair and consistent decisions, and to improve the
effectiveness of decision making processes. Besides that, among
the challenge for HR professionals is to manage organization
talents, especially to ensure the right person for the right job at the
right time. For that reason, in this article, we attempt to describe
the potential to implement one of the talent management tasks i.e.
identifying existing talent by predicting their performance as one of
HR application for talent management. This study suggests the
potential HR system architecture for talent forecasting by using
past experience knowledge known as Knowledge Discovery in
Database (KDD) or Data Mining. This article consists of three
main parts; the first part deals with the overview of HR
applications, the prediction techniques and application, the general
view of Data mining and the basic concept of talent management
in HRM. The second part is to understand the use of Data Mining
technique in order to solve one of the talent management tasks, and
the third part is to propose the potential HR system architecture for
talent forecasting.
Abstract: The problem of frequent pattern discovery is defined
as the process of searching for patterns such as sets of features or items that appear in data frequently. Finding such frequent patterns
has become an important data mining task because it reveals associations, correlations, and many other interesting relationships
hidden in a database. Most of the proposed frequent pattern mining
algorithms have been implemented with imperative programming
languages. Such paradigm is inefficient when set of patterns is large
and the frequent pattern is long. We suggest a high-level declarative
style of programming apply to the problem of frequent pattern
discovery. We consider two languages: Haskell and Prolog. Our
intuitive idea is that the problem of finding frequent patterns should
be efficiently and concisely implemented via a declarative paradigm
since pattern matching is a fundamental feature supported by most
functional languages and Prolog. Our frequent pattern mining
implementation using the Haskell and Prolog languages confirms our
hypothesis about conciseness of the program. The comparative
performance studies on line-of-code, speed and memory usage of
declarative versus imperative programming have been reported in the
paper.
Abstract: Routing in mobile ad hoc networks is a challenging task because nodes are free to move randomly. In DSR like all On- Demand routing algorithms, route discovery mechanism is associated with great delay. More Clearly in DSR routing protocol to send route reply packet, when current route breaks, destination seeks a new route. In this paper we try to change route selection mechanism proactively. We also define a link stability parameter in which a stability value is assigned to each link. Given this feature, destination node can estimate stability of routes and can select the best and more stable route. Therefore we can reduce the delay and jitter of sending data packets.
Abstract: Hypertension is characterized with stress on the heart and blood vessels thus increasing the risk of heart attack and renal diseases. The Renin angiotensin system (RAS) plays a major role in blood pressure control. Renin is the enzyme that controls the RAS at the rate-limiting step. Our aim is to develop new drug-like leads which can inhibit renin and thereby emerge as therapeutics for hypertension. To achieve this, molecular dynamics (MD) simulation and receptor-based pharmacophore modeling were implemented, and three rennin-inhibitor complex structures were selected based on IC50 value and scaffolds of inhibitors. Three pharmacophore models were generated considering conformations induced by inhibitor. The compounds mapped to these models were selected and subjected to drug-like screening. The identified hits were docked into the active site of renin. Finally, hit1 satisfying the binding mode and interaction energy was selected as possible lead candidate to be used in novel renin inhibitors.
Abstract: Automated discovery of Rule is, due to its applicability, one of the most fundamental and important method in KDD. It has been an active research area in the recent past. Hierarchical representation allows us to easily manage the complexity of knowledge, to view the knowledge at different levels of details, and to focus our attention on the interesting aspects only. One of such efficient and easy to understand systems is Hierarchical Production rule (HPRs) system. A HPR, a standard production rule augmented with generality and specificity information, is of the following form: Decision If < condition> Generality Specificity . HPRs systems are capable of handling taxonomical structures inherent in the knowledge about the real world. This paper focuses on the issue of mining Quantified rules with crisp hierarchical structure using Genetic Programming (GP) approach to knowledge discovery. The post-processing scheme presented in this work uses Quantified production rules as initial individuals of GP and discovers hierarchical structure. In proposed approach rules are quantified by using Dempster Shafer theory. Suitable genetic operators are proposed for the suggested encoding. Based on the Subsumption Matrix(SM), an appropriate fitness function is suggested. Finally, Quantified Hierarchical Production Rules (HPRs) are generated from the discovered hierarchy, using Dempster Shafer theory. Experimental results are presented to demonstrate the performance of the proposed algorithm.
Abstract: In Virtual organization, Knowledge Discovery (KD)
service contains distributed data resources and computing grid nodes.
Computational grid is integrated with data grid to form Knowledge
Grid, which implements Apriori algorithm for mining association
rule on grid network. This paper describes development of parallel
and distributed version of Apriori algorithm on Globus Toolkit using
Message Passing Interface extended with Grid Services (MPICHG2).
The creation of Knowledge Grid on top of data and
computational grid is to support decision making in real time
applications. In this paper, the case study describes design and
implementation of local and global mining of frequent item sets. The
experiments were conducted on different configurations of grid
network and computation time was recorded for each operation. We
analyzed our result with various grid configurations and it shows
speedup of computation time is almost superlinear.
Abstract: The rapid expansion of the web is causing the
constant growth of information, leading to several problems such as
increased difficulty of extracting potentially useful knowledge. Web
content mining confronts this problem gathering explicit information
from different web sites for its access and knowledge discovery.
Query interfaces of web databases share common building blocks.
After extracting information with parsing approach, we use a new
data mining algorithm to match a large number of schemas in
databases at a time. Using this algorithm increases the speed of
information matching. In addition, instead of simple 1:1 matching,
they do complex (m:n) matching between query interfaces. In this
paper we present a novel correlation mining algorithm that matches
correlated attributes with smaller cost. This algorithm uses Jaccard
measure to distinguish positive and negative correlated attributes.
After that, system matches the user query with different query
interfaces in special domain and finally chooses the nearest query
interface with user query to answer to it.
Abstract: Resource discovery is one of the chief services of a grid. A new approach to discover the provenances in grid through learning automata has been propounded in this article. The objective of the aforementioned resource-discovery service is to select the resource based upon the user-s applications and the mercantile yardsticks that is to say opting for an originator which can accomplish the user-s tasks in the most economic manner. This novel service is submitted in two phases. We proffered an applicationbased categorization by means of an intelligent nerve-prone plexus. The user in question sets his or her application as the input vector of the nerve-prone nexus. The output vector of the aforesaid network limns the appropriateness of any one of the resource for the presented executive procedure. The most scrimping option out of those put forward in the previous stage which can be coped with to fulfill the task in question is picked out. Te resource choice is carried out by means of the presented algorithm based upon the learning automata.
Abstract: Trust and Energy consumption is the most challenging
issue in routing protocol design for Mobile ad hoc networks
(MANETs), since mobile nodes are battery powered and nodes
behaviour are unpredictable. Furthermore replacing and recharging
batteries and making nodes co-operative is often impossible in
critical environments like military applications. In this paper, we
propose a trust based energy aware routing model in MANET.
During route discovery, node with more trust and maximum energy
capacity is selected as a router based on a parameter called
'Reliability'. Route request from the source is accepted by a node
only if its reliability is high. Otherwise, the route request is
discarded. This approach forms a reliable route from source to
destination thus increasing network life time, improving energy
utilization and decreasing number of packet loss during transmission.
Abstract: Cluster analysis divides data into groups that are
meaningful, useful, or both. Analysis of biological data is creating a
new generation of epidemiologic, prognostic, diagnostic and
treatment modalities. Clustering of protein sequences is one of the
current research topics in the field of computer science. Linear
relation is valuable in rule discovery for a given data, such as if value
X goes up 1, value Y will go down 3", etc. The classical linear
regression models the linear relation of two sequences perfectly.
However, if we need to cluster a large repository of protein sequences
into groups where sequences have strong linear relationship with
each other, it is prohibitively expensive to compare sequences one by
one. In this paper, we propose a new technique named General
Regression Model Technique Clustering Algorithm (GRMTCA) to
benignly handle the problem of linear sequences clustering. GRMT
gives a measure, GR*, to tell the degree of linearity of multiple
sequences without having to compare each pair of them.
Abstract: In construction of any structure, the aesthetic and utility values should be considered in such a way as to make the structure cost-effective. Most structures are composed of elements and joints which are very critical in any skeletal space structure because they majorly determine the performance of the structure. In early times, most space structures were constructed using rigid joints which had the advantage of better performing structures as compared to pin-jointed structures but with the disadvantage of requiring all the construction work to be done on site. The discovery of semi-rigid joints now enables connections to be prefabricated and quickly assembled on site while maintaining good performance. In this paper, cost-effective is discussed basing on strength of connectors at the joints, buckling of joints and overall structure, and the effect of initial geometrical imperfections. Several existing joints are reviewed by classifying them into categories and discussing where they are most suited and how they perform structurally. Also, finite element modeling using ABAQUS is done to determine the buckling behavior. It is observed that some joints are more economical than others. The rise to span ratio and imperfections are also found to affect the buckling of the structures. Based on these, general principles that guide the design of cost-effective joints and structures are discussed.
Abstract: Resource Discovery in Grids is critical for efficient
resource allocation and management. Heterogeneous nature and
dynamic availability of resources make resource discovery a
challenging task. As numbers of nodes are increasing from tens to
thousands, scalability is essentially desired. Peer-to-Peer (P2P)
techniques, on the other hand, provide effective implementation of
scalable services and applications. In this paper we propose a model
for resource discovery in Condor Middleware by using the four axis
framework defined in P2P approach. The proposed model enhances
Condor to incorporate functionality of a P2P system, thus aim to
make Condor more scalable, flexible, reliable and robust.
Abstract: This paper proposes a method that discovers sequential patterns corresponding to user-s interests from sequential data. This method expresses the interests as constraint patterns. The constraint patterns can define relationships among attributes of the items composing the data. The method recursively decomposes the constraint patterns into constraint subpatterns. The method evaluates the constraint subpatterns in order to efficiently discover sequential patterns satisfying the constraint patterns. Also, this paper applies the method to the sequential data composed of stock price indexes and verifies its effectiveness through comparing it with a method without using the constraint patterns.
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: Nowadays, obtaining traditional statistics and reports
is not adequate for the needs of organizational managers. The
managers need to analyze and to transform the raw data into
knowledge in the world filled with information. Therefore in this
regard various processes have been developed. In the meantime the
artificial intelligence-based processes are used and the new topics
such as business intelligence and knowledge discovery have
emerged. In the current paper it is sought to study the business
intelligence and its applications in the organizations.