Abstract: One major difficulty that faces developers of
concurrent and distributed software is analysis for concurrency based
faults like deadlocks. Petri nets are used extensively in the
verification of correctness of concurrent programs. ECATNets are a
category of algebraic Petri nets based on a sound combination of
algebraic abstract types and high-level Petri nets. ECATNets have
'sound' and 'complete' semantics because of their integration in
rewriting logic and its programming language Maude. Rewriting
logic is considered as one of very powerful logics in terms of
description, verification and programming of concurrent systems We
proposed previously a method for translating Ada-95 tasking
programs to ECATNets formalism (Ada-ECATNet) and we showed
that ECATNets formalism provides a more compact translation for
Ada programs compared to the other approaches based on simple
Petri nets or Colored Petri nets. We showed also previously how the
ECATNet formalism offers to Ada many validation and verification
tools like simulation, Model Checking, accessibility analysis and
static analysis. In this paper, we describe the implementation of our
translation of the Ada programs into ECATNets.
Abstract: Text Mining is an important step of Knowledge
Discovery process. It is used to extract hidden information from notstructured
o semi-structured data. This aspect is fundamental because
much of the Web information is semi-structured due to the nested
structure of HTML code, much of the Web information is linked,
much of the Web information is redundant. Web Text Mining helps
whole knowledge mining process to mining, extraction and
integration of useful data, information and knowledge from Web
page contents.
In this paper, we present a Web Text Mining process able to
discover knowledge in a distributed and heterogeneous multiorganization
environment. The Web Text Mining process is based on
flexible architecture and is implemented by four steps able to
examine web content and to extract useful hidden information
through mining techniques. Our Web Text Mining prototype starts
from the recovery of Web job offers in which, through a Text Mining
process, useful information for fast classification of the same are
drawn out, these information are, essentially, job offer place and
skills.
Abstract: This paper describes the design and development of pico-hydro generation system using consuming water distributed to houses. Water flow in the domestic pipes has kinetic energy that potential to generate electricity for energy storage purposes in addition to the routine activities such as laundry, cook and bathe. The inherent water pressure and flow inside the pipe from utility-s main tank that used for those usual activities is also used to rotate small scale hydro turbine to drive a generator for electrical power generation. Hence, this project is conducted to develop a small scale hydro generation system using consuming water distributed to houses as an alternative electrical energy source for residential use.
Abstract: The group mutual exclusion (GME) problem is an
interesting generalization of the mutual exclusion problem. Several
solutions of the GME problem have been proposed for message
passing distributed systems. However, none of these solutions is
suitable for real time distributed systems. In this paper, we propose a
token-based distributed algorithms for the GME problem in soft real
time distributed systems. The algorithm uses the concepts of priority
queue, dynamic request set and the process state. The algorithm uses
first come first serve approach in selecting the next session type
between the same priority levels and satisfies the concurrent
occupancy property. The algorithm allows all n processors to be
inside their CS provided they request for the same session. The
performance analysis and correctness proof of the algorithm has also
been included in the paper.
Abstract: Large-scale systems such as Grids offer
infrastructures for both data distribution and parallel processing. The
use of Grid infrastructures is a more recent issue that is already
impacting the Distributed Database Management System industry. In
DBMS, distributed query processing has emerged as a fundamental
technique for ensuring high performance in distributed databases.
Database placement is particularly important in large-scale systems
because it reduces communication costs and improves resource
usage. In this paper, we propose a dynamic database placement
policy that depends on query patterns and Grid sites capabilities. We
evaluate the performance of the proposed database placement policy
using simulations. The obtained results show that dynamic database
placement can significantly improve the performance of distributed
query processing.
Abstract: In this study, Friction Stir Processing (FSP) a recent grain refinement technique was employed to disperse micron-sized (2 *m) SiCp particles into aluminum alloy AA6063. The feasibility to fabricate bulk composites through FSP was analyzed and experiments were conducted at different traverse speeds and wider volumes of the specimens. Micro structural observation were carried out by employing optical microscopy test of the cross sections in both parallel and perpendicular to the tool traverse direction. Mechanical property including micro hardness was evaluated in detail at various regions on the specimen. The composites had an excellent bonding with aluminum alloy substrate and a significant increase of 30% in the micro hardness value of metal matrix composite (MMC) as to that of the base metal has observed. The observations clearly indicate that SiC particles were uniformly distributed within the aluminum matrix.
Abstract: In this paper, we study the cooperative communications where multiple cognitive radio (CR) transmit-receive pairs competitive maximize their own throughputs. In CR networks, the influences of primary users and the spectrum availability are usually different among CR users. Due to the existence of multiple relay nodes and the different spectrum availability, each CR transmit-receive pair should not only select the relay node but also choose the appropriate channel. For this distributed problem, we propose a game theoretic framework to formulate this problem and we apply a regret-matching learning algorithm which is leading to correlated equilibrium. We further formulate a modified regret-matching learning algorithm which is fully distributed and only use the local information of each CR transmit-receive pair. This modified algorithm is more practical and suitable for the cooperative communications in CR network. Simulation results show the algorithm convergence and the modified learning algorithm can achieve comparable performance to the original regretmatching learning algorithm.
Abstract: The customary practice of identifying industrial sickness is a set traditional techniques which rely upon a range of manual monitoring and compilation of financial records. It makes the process tedious, time consuming and often are susceptible to manipulation. Therefore, certain readily available tools are required which can deal with such uncertain situations arising out of industrial sickness. It is more significant for a country like India where the fruits of development are rarely equally distributed. In this paper, we propose an approach based on Artificial Neural Network (ANN) to deal with industrial sickness with specific focus on a few such units taken from a less developed north-east (NE) Indian state like Assam. The proposed system provides decision regarding industrial sickness using eight different parameters which are directly related to the stages of sickness of such units. The mechanism primarily uses certain signals and symptoms of industrial health to decide upon the state of a unit. Specifically, we formulate an ANN based block with data obtained from a few selected units of Assam so that required decisions related to industrial health could be taken. The system thus formulated could become an important part of planning and development. It can also contribute towards computerization of decision support systems related to industrial health and help in better management.
Abstract: In this work a new platform for mobile-health systems is
presented. System target application is providing decision support to
rescue corps or military medical personnel in combat areas. Software
architecture relies on a distributed client-server system that manages a
wireless ad-hoc networks hierarchy in which several different types of
client operate. Each client is characterized for different hardware and
software requirements. Lower hierarchy levels rely in a network of
completely custom devices that store clinical information and patient
status and are designed to form an ad-hoc network operating in the
2.4 GHz ISM band and complying with the IEEE 802.15.4 standard
(ZigBee). Medical personnel may interact with such devices, that are
called MICs (Medical Information Carriers), by means of a PDA
(Personal Digital Assistant) or a MDA (Medical Digital Assistant),
and transmit the information stored in their local databases as well as
issue a service request to the upper hierarchy levels by using IEEE
802.11 a/b/g standard (WiFi). The server acts as a repository that
stores both medical evacuation forms and associated events (e.g., a
teleconsulting request). All the actors participating in the diagnostic
or evacuation process may access asynchronously to such repository
and update its content or generate new events. The designed system
pretends to optimise and improve information spreading and flow
among all the system components with the aim of improving both
diagnostic quality and evacuation process.
Abstract: Double heterogeneity of randomly located pebbles in
the core and Coated Fuel Particles (CFPs) in the pebbles are specific
features in pebble bed reactors and usually, because of difficulty to
model with MCNP code capabilities, are neglected. In this study,
characteristics of HTR-10, Tsinghua University research reactor, are
used and not only double heterogeneous but also truncated CFPs and
Pebbles are considered.Firstly, 8335 CFPs are distributed randomly
in a pebble and then the core of reactor is filled with those pebbles
and graphite pebbles as moderator such that 57:43 ratio of fuel and
moderator pebbles is established.Finally, four different core
configurations are modeled. They are Simple Cubic (SC) structure
with truncated pebbles,SC structure without truncated pebble, and
Simple Hexagonal(SH) structure without truncated pebbles and SH
structure with truncated pebbles. Results like effective multiplication
factor (Keff), critical height,etc. are compared with available data.
Abstract: In this contribution a newly developed e-learning environment is presented, which incorporates Intelligent Agents and Computational Intelligence Techniques. The new e-learning environment is constituted by three parts, the E-learning platform Front-End, the Student Questioner Reasoning and the Student Model Agent. These parts are distributed geographically in dispersed computer servers, with main focus on the design and development of these subsystems through the use of new and emerging technologies. These parts are interconnected in an interoperable way, using web services for the integration of the subsystems, in order to enhance the user modelling procedure and achieve the goals of the learning process.
Abstract: In this paper, the issue of pth moment stability of a class of stochastic neural networks with mixed delays is investigated. By establishing two integro-differential inequalities, some new sufficient conditions ensuring pth moment exponential stability are obtained. Compared with some previous publications, our results generalize some earlier works reported in the literature, and remove some strict constraints of time delays and kernel functions. Two numerical examples are presented to illustrate the validity of the main results.
Abstract: Heterogeneity has to be taken into account when
integrating a set of existing information sources into a distributed
information system that are nowadays often based on Service-
Oriented Architectures (SOA). This is also particularly applicable to
distributed services such as event monitoring, which are useful in the
context of Event Driven Architectures (EDA) and Complex Event
Processing (CEP). Web services deal with this heterogeneity at a
technical level, also providing little support for event processing. Our
central thesis is that such a fully generic solution cannot provide
complete support for event monitoring; instead, source specific
semantics such as certain event types or support for certain event
monitoring techniques have to be taken into account. Our core result
is the design of a configurable event monitoring (Web) service that
allows us to trade genericity for the exploitation of source specific
characteristics. It thus delivers results for the areas of SOA, Web
services, CEP and EDA.
Abstract: CIM is the standard formalism for modeling management
information developed by the Distributed Management Task
Force (DMTF) in the context of its WBEM proposal, designed to
provide a conceptual view of the managed environment. In this
paper, we propose the inclusion of formal knowledge representation
techniques, based on Description Logics (DLs) and the Web Ontology
Language (OWL), in CIM-based conceptual modeling, and then we
examine the benefits of such a decision. The proposal is specified as a
CIM metamodel level mapping to a highly expressive subset of DLs
capable of capturing all the semantics of the models. The paper shows
how the proposed mapping can be used for automatic reasoning
about the management information models, as a design aid, by means
of new-generation CASE tools, thanks to the use of state-of-the-art
automatic reasoning systems that support the proposed logic and use
algorithms that are sound and complete with respect to the semantics.
Such a CASE tool framework has been developed by the authors and
its architecture is also introduced. The proposed formalization is not
only useful at design time, but also at run time through the use of
rational autonomous agents, in response to a need recently recognized
by the DMTF.
Abstract: It is important to predict yield in semiconductor test process in order to increase yield. In this study, yield prediction means finding out defective die, wafer or lot effectively. Semiconductor test process consists of some test steps and each test includes various test items. In other world, test data has a big and complicated characteristic. It also is disproportionably distributed as the number of data belonging to FAIL class is extremely low. For yield prediction, general data mining techniques have a limitation without any data preprocessing due to eigen properties of test data. Therefore, this study proposes an under-sampling method using support vector machine (SVM) to eliminate an imbalanced characteristic. For evaluating a performance, randomly under-sampling method is compared with the proposed method using actual semiconductor test data. As a result, sampling method using SVM is effective in generating robust model for yield prediction.
Abstract: Clustering algorithms help to understand the hidden
information present in datasets. A dataset may contain intrinsic and
nested clusters, the detection of which is of utmost importance. This
paper presents a Distributed Grid-based Density Clustering algorithm
capable of identifying arbitrary shaped embedded clusters as well as
multi-density clusters over large spatial datasets. For handling
massive datasets, we implemented our method using a 'sharednothing'
architecture where multiple computers are interconnected
over a network. Experimental results are reported to establish the
superiority of the technique in terms of scale-up, speedup as well as
cluster quality.
Abstract: In this paper, by using the continuation theorem of coincidence degree theory, M-matrix theory and constructing some suitable Lyapunov functions, some sufficient conditions are obtained for the existence and global exponential stability of periodic solutions of recurrent neural networks with distributed delays and impulses on time scales. Without assuming the boundedness of the activation functions gj, hj , these results are less restrictive than those given in the earlier references.
Abstract: Software reliability, defined as the probability of a
software system or application functioning without failure or errors
over a defined period of time, has been an important area of research
for over three decades. Several research efforts aimed at developing
models to improve reliability are currently underway. One of the
most popular approaches to software reliability adopted by some of
these research efforts involves the use of operational profiles to
predict how software applications will be used. Operational profiles
are a quantification of usage patterns for a software application. The
research presented in this paper investigates an innovative multiagent
framework for automatic creation and management of
operational profiles for generic distributed systems after their release
into the market. The architecture of the proposed Operational Profile
MAS (Multi-Agent System) is presented along with detailed
descriptions of the various models arrived at following the analysis
and design phases of the proposed system. The operational profile in
this paper is extended to comprise seven different profiles. Further,
the criticality of operations is defined using a new composed metrics
in order to organize the testing process as well as to decrease the time
and cost involved in this process. A prototype implementation of the
proposed MAS is included as proof-of-concept and the framework is
considered as a step towards making distributed systems intelligent
and self-managing.
Abstract: The purposes of this study were as follows to evaluate
the economic value of Phu Kradueng National Park by the travel cost
method (TCM) and the contingent valuation method (CVM) and to
estimate the demand for traveling and the willingness to pay. The
data for this study were collected by conducting two large scale
surveys on users and non-users. A total of 1,016 users and 1,034
non-users were interviewed. The data were analyzed using multiple
linear regression analysis, logistic regression model and the
consumer surplus (CS) was the integral of demand function for trips.
The survey found, were as follows:
1)Using the travel cost method which provides an estimate of direct
benefits to park users, we found that visitors- total willingness to pay
per visit was 2,284.57 bath, of which 958.29 bath was travel cost,
1,129.82 bath was expenditure for accommodation, food, and
services, and 166.66 bath was consumer surplus or the visitors -net
gain or satisfaction from the visit (the integral of demand function for
trips).
2) Thai visitors to Phu Kradueng National Park were further willing
to pay an average of 646.84 bath per head per year to ensure the
continued existence of Phu Kradueng National Park and to preserve
their option to use it in the future.
3) Thai non-visitors, on the other hand, are willing to pay an average
of 212.61 bath per head per year for the option and existence value
provided by the Park.
4) The total economic value of Phu Kradueng National Park to Thai
visitors and non-visitors taken together stands today at 9,249.55
million bath per year.
5) The users- average willingness to pay for access to Phu Kradueng
National Park rises
from 40 bath to 84.66 bath per head per trip for improved services
such as road improvement, increased cleanliness, and upgraded
information.
This paper was needed to investigate of the potential market
demand for bio prospecting in Phu Kradueng national Park and to
investigate how a larger share of the economic benefits of tourism
could be distributed income to the local residents.
Abstract: Load balancing is the process of improving the
performance of a parallel and distributed system through a
redistribution of load among the processors [1] [5]. In this paper we
present the performance analysis of various load balancing
algorithms based on different parameters, considering two typical
load balancing approaches static and dynamic. The analysis indicates
that static and dynamic both types of algorithm can have
advancements as well as weaknesses over each other. Deciding type
of algorithm to be implemented will be based on type of parallel
applications to solve. The main purpose of this paper is to help in
design of new algorithms in future by studying the behavior of
various existing algorithms.