Abstract: Bond graph models of an electrical transformer
including the nonlinear saturation are presented. These models
determine the relation between self and mutual inductances, and
the leakage and magnetizing inductances of power transformers
with two and three windings using the properties of a bond
graph. The modelling and analysis using this methodology to
three phase power transformers or transformers with internal
incipient faults can be extended.
Abstract: Graph coloring is an important problem in computer
science and many algorithms are known for obtaining reasonably
good solutions in polynomial time. One method of comparing
different algorithms is to test them on a set of standard graphs where
the optimal solution is already known. This investigation analyzes a
set of 50 well known graph coloring instances according to a set of
complexity measures. These instances come from a variety of
sources some representing actual applications of graph coloring
(register allocation) and others (mycieleski and leighton graphs) that
are theoretically designed to be difficult to solve. The size of the
graphs ranged from ranged from a low of 11 variables to a high of
864 variables. The method used to solve the coloring problem was
the square of the adjacency (i.e., correlation) matrix. The results
show that the most difficult graphs to solve were the leighton and the
queen graphs. Complexity measures such as density, mobility,
deviation from uniform color class size and number of block
diagonal zeros are calculated for each graph. The results showed that
the most difficult problems have low mobility (in the range of .2-.5)
and relatively little deviation from uniform color class size.
Abstract: Task of object localization is one of the major
challenges in creating intelligent transportation. Unfortunately, in
densely built-up urban areas, localization based on GPS only
produces a large error, or simply becomes impossible. New
opportunities arise for the localization due to the rapidly emerging
concept of a wireless ad-hoc network. Such network, allows
estimating potential distance between these objects measuring
received signal level and construct a graph of distances in which
nodes are the localization objects, and edges - estimates of the
distances between pairs of nodes. Due to the known coordinates of
individual nodes (anchors), it is possible to determine the location of
all (or part) of the remaining nodes of the graph. Moreover, road
map, available in digital format can provide localization routines
with valuable additional information to narrow node location search.
However, despite abundance of well-known algorithms for solving
the problem of localization and significant research efforts, there are
still many issues that currently are addressed only partially. In this
paper, we propose localization approach based on the graph mapped
distances on the digital road map data basis. In fact, problem is
reduced to distance graph embedding into the graph representing area
geo location data. It makes possible to localize objects, in some cases
even if only one reference point is available. We propose simple
embedding algorithm and sample implementation as spatial queries
over sensor network data stored in spatial database, allowing
employing effectively spatial indexing, optimized spatial search
routines and geometry functions.
Abstract: This study was designed to formulate,
pharmaceutically evaluate a topical skin-care cream (w/o emulsion)
of Aloe Vera versus its vehicle (Base) as control and determine their
effects on Stratum Corneum (SC) water content and Transepidermal
water loss (TEWL). Base containing no extract and a Formulation
containing 3% concentrated extract of Aloe Vera was developed by
entrapping in the inner aqueous phase of w/o emulsion (cream).
Lemon oil was incorporated to improve the odor. Both the Base and
Formulation were stored at 8°C ±0.1°C (in refrigerator), 25°C±0.1°C,
40°C±0.1°C and 40°C± 0.1°C with 75% RH (in incubator) for a
period of 4 weeks to predict their stability. The evaluation parameters
consisted of color, smell, type of emulsion, phase separation,
electrical conductivity, centrifugation, liquefaction and pH. Both the
Base and Formulation were applied to the cheeks of 21 healthy
human volunteers for a period of 8 weeks Stratum corneum (SC)
water content and Transepidermal water loss (TEWL) were
monitored every week to measure any effect produced by these
topical creams. The expected organoleptic stability of creams was
achieved from 4 weeks in-vitro study period. Odor was disappeared
with the passage of time due to volatilization of lemon oil. Both the
Base and Formulation produced significant (p≤0.05) changes in
TEWL with respect to time. SC water content was significantly
(p≤0.05) increased by the Formulation while the Base has
insignificant (p 0.05) effects on SC water content. The newly
formulated cream of Aloe Vera, applied is suitable for improvement
and quantitative monitoring of skin hydration level (SC water
content/ moisturizing effects) and reducing TEWL in people with dry
skin.
Abstract: This work focuses on the remediation of polycyclic
aromatic hydrocarbons (PAHs)-contaminated soil via Fenton
treatment coupled with novel chelating agent (CA). The feasibility of
chelated modified Fenton (MF) treatment to promote PAH oxidation
in artificially contaminated soils was investigated in laboratory scale
batch experiments at natural pH. The effects of adding inorganic and
organic CA are discussed. Experiments using different iron catalyst
to CA ratios were conducted, resulting in hydrogen peroxide: soil:
iron: CA weight ratios that varied from 0.049: 1: 0.072: 0.008 to
0.049: 1: 0.072: 0.067. The results revealed that (1) inorganic CA
could provide much higher PAH removal efficiency and (2) most of
the proposed CAs were more efficient than commonly utilised CAs
even at mild ratio. This work highlights the potential of novel
chelating agents in maintaining a suitable environment throughout
the Fenton treatment, particularly in soils with high buffer capacity.
Abstract: In this paper, we propose a morphing method by which face color images can be freely transformed. The main focus of this work is the transformation of one face image to another. This method is fully automatic in that it can morph two face images by automatically detecting all the control points necessary to perform the morph. A face detection neural network, edge detection and medium filters are employed to detect the face position and features. Five control points, for both the source and target images, are then extracted based on the facial features. Triangulation method is then used to match and warp the source image to the target image using the control points. Finally color interpolation is done using a color Gaussian model that calculates the color for each particular frame depending on the number of frames used. A real coded Genetic algorithm is used in both the image warping and color blending steps to assist in step size decisions and speed up the morphing. This method results in ''very smooth'' morphs and is fast to process.
Abstract: In the context of channel coding, the Generalized Belief Propagation (GBP) is an iterative algorithm used to recover the transmission bits sent through a noisy channel. To ensure a reliable transmission, we apply a map on the bits, that is called a code. This code induces artificial correlations between the bits to send, and it can be modeled by a graph whose nodes are the bits and the edges are the correlations. This graph, called Tanner graph, is used for most of the decoding algorithms like Belief Propagation or Gallager-B. The GBP is based on a non unic transformation of the Tanner graph into a so called region-graph. A clear advantage of the GBP over the other algorithms is the freedom in the construction of this graph. In this article, we explain a particular construction for specific graph topologies that involves relevant performance of the GBP. Moreover, we investigate the behavior of the GBP considered as a dynamic system in order to understand the way it evolves in terms of the time and in terms of the noise power of the channel. To this end we make use of classical measures and we introduce a new measure called the hyperspheres method that enables to know the size of the attractors.
Abstract: In practice, wireless networks has the property that
the signal strength attenuates with respect to the distance from the
base station, it could be better if the nodes at two hop away are
considered for better quality of service. In this paper, we propose a
procedure to identify delay preserving substructures for a given
wireless ad-hoc network using a new graph operation G 2 – E (G) =
G* (Edge difference of square graph of a given graph and the
original graph). This operation helps to analyze some induced
substructures, which preserve delay in communication among them.
This operation G* on a given graph will induce a graph, in which 1-
hop neighbors of any node are at 2-hop distance in the original
network. In this paper, we also identify some delay preserving
substructures in G*, which are (i) set of all nodes, which are mutually
at 2-hop distance in G that will form a clique in G*, (ii) set of nodes
which forms an odd cycle C2k+1 in G, will form an odd cycle in G*
and the set of nodes which form a even cycle C2k in G that will form
two disjoint companion cycles ( of same parity odd/even) of length k
in G*, (iii) every path of length 2k+1 or 2k in G will induce two
disjoint paths of length k in G*, and (iv) set of nodes in G*, which
induces a maximal connected sub graph with radius 1 (which
identifies a substructure with radius equal 2 and diameter at most 4 in
G). The above delay preserving sub structures will behave as good
clusters in the original network.
Abstract: The main objective developed in this paper is to find a
graphic technique for modeling, simulation and diagnosis of the
industrial systems. This importance is much apparent when it is about
a complex system such as the nuclear reactor with pressurized water
of several form with various several non-linearity and time scales. In
this case the analytical approach is heavy and does not give a fast
idea on the evolution of the system. The tool Bond Graph enabled us
to transform the analytical model into graphic model and the
software of simulation SYMBOLS 2000 specific to the Bond Graphs
made it possible to validate and have the results given by the
technical specifications. We introduce the analysis of the problem
involved in the faults localization and identification in the complex
industrial processes. We propose a method of fault detection applied
to the diagnosis and to determine the gravity of a detected fault. We
show the possibilities of application of the new diagnosis approaches
to the complex system control. The industrial systems became
increasingly complex with the faults diagnosis procedures in the
physical systems prove to become very complex as soon as the
systems considered are not elementary any more. Indeed, in front of
this complexity, we chose to make recourse to Fault Detection and
Isolation method (FDI) by the analysis of the problem of its control
and to conceive a reliable system of diagnosis making it possible to
apprehend the complex dynamic systems spatially distributed applied
to the standard pressurized water nuclear reactor.
Abstract: In the last few years, the Semantic Web gained scientific acceptance as a means of relationships identification in knowledge base, widely known by semantic association. Query about complex relationships between entities is a strong requirement for many applications in analytical domains. In bioinformatics for example, it is critical to extract exchanges between proteins. Currently, the widely known result of such queries is to provide paths between connected entities from data graph. However, they do not always give good results while facing the user need by the best association or a set of limited best association, because they only consider all existing paths but ignore the path evaluation. In this paper, we present an approach for supporting association discovery queries. Our proposal includes (i) a query language PmSPRQL which provides a multiparadigm query expressions for association extraction and (ii) some quantification measures making easy the process of association ranking. The originality of our proposal is demonstrated by a performance evaluation of our approach on real world datasets.
Abstract: Let G be a Hamiltonian graph. A factor F of G is called
a Hamiltonian factor if F contains a Hamiltonian cycle. In this paper,
two sufficient conditions are given, which are two neighborhood
conditions for a Hamiltonian graph G to have a Hamiltonian factor.
Abstract: In this paper, we represent protein structure by using
graph. A protein structure database will become a graph database.
Each graph is represented by a spectral vector. We use Jacobi
rotation algorithm to calculate the eigenvalues of the normalized
Laplacian representation of adjacency matrix of graph. To measure
the similarity between two graphs, we calculate the Euclidean
distance between two graph spectral vectors. To cluster the graphs,
we use M-tree with the Euclidean distance to cluster spectral vectors.
Besides, M-tree can be used for graph searching in graph database.
Our proposal method was tested with graph database of 100 graphs
representing 100 protein structures downloaded from Protein Data
Bank (PDB) and we compare the result with the SCOP hierarchical
structure.
Abstract: In mobile environments, unspecified numbers of transactions
arrive in continuous streams. To prove correctness of their
concurrent execution a method of modelling an infinite number of
transactions is needed. Standard database techniques model fixed
finite schedules of transactions. Lately, techniques based on temporal
logic have been proposed as suitable for modelling infinite schedules.
The drawback of these techniques is that proving the basic
serializability correctness condition is impractical, as encoding (the
absence of) conflict cyclicity within large sets of transactions results
in prohibitively large temporal logic formulae. In this paper, we show
that, under certain common assumptions on the graph structure of
data items accessed by the transactions, conflict cyclicity need only
be checked within all possible pairs of transactions. This results in
formulae of considerably reduced size in any temporal-logic-based
approach to proving serializability, and scales to arbitrary numbers
of transactions.
Abstract: We consider a heterogeneously mixing SIR stochastic
epidemic process in populations described by a general graph.
Likelihood theory is developed to facilitate statistic inference for the
parameters of the model under complete observation. We show that
these estimators are asymptotically Gaussian unbiased estimates by
using a martingale central limit theorem.
Abstract: Graph based image segmentation techniques are
considered to be one of the most efficient segmentation techniques
which are mainly used as time & space efficient methods for real
time applications. How ever, there is need to focus on improving the
quality of segmented images obtained from the earlier graph based
methods. This paper proposes an improvement to the graph based
image segmentation methods already described in the literature. We
contribute to the existing method by proposing the use of a weighted
Euclidean distance to calculate the edge weight which is the key
element in building the graph. We also propose a slight modification
of the segmentation method already described in the literature, which
results in selection of more prominent edges in the graph. The
experimental results show the improvement in the segmentation
quality as compared to the methods that already exist, with a slight
compromise in efficiency.
Abstract: The hydrogen peroxide treatment was able to
remediate chlorophenols, polycyclic aromatic hydrocarbons, diesel
and transformer oil contaminated soil. Chemical treatment of
contaminants adsorbed in peat resulted in lower contaminants-
removal and required higher addition of chemicals than the treatment
of contaminants in sand. The hydrogen peroxide treatment was found
to be feasible for soil remediation at natural soil pH. Contaminants in
soil could degrade with the addition of hydrogen peroxide only
indicating the ability of transition metals ions and minerals of these
metals presented in soil to catalyse the reaction of hydrogen peroxide
decomposition.
Abstract: In the Top Right Access point Minimum Length Corridor (TRA-MLC) problem [1], a rectangular boundary partitioned into rectilinear polygons is given and the problem is to find a corridor of least total length and it must include the top right corner of the outer rectangular boundary. A corridor is a tree containing a set of line segments lying along the outer rectangular boundary and/or on the boundary of the rectilinear polygons. The corridor must contain at least one point from the boundaries of the outer rectangle and also the rectilinear polygons. Gutierrez and Gonzalez [1] proved that the MLC problem, along with some of its restricted versions and variants, are NP-complete. In this paper, we give a shorter proof of NP-Completeness of TRA-MLC by findig the reduction in the following way.
Abstract: For positive integer s and t, the Ramsey number R(s, t)
is the least positive integer n such that for every graph G of order n, either G contains Ks as a subgraph or G contains Kt as a subgraph.
We construct the circulant graphs and use them to obtain lower bounds of some small Ramsey numbers.
Abstract: The aim of this study is to show innovative techniques that describe the effectiveness of individuals diagnosed with antisocial personality disorders (ASPD). The author presents information about hate schemas regarding persons with ASPD and their understanding of the role of hate. The data of 60 prisoners with ASPD, 40 prisoners without ASPD, and 60 men without antisocial tendencies, has been analyzed. The participants were asked to describe their hate inspired by a photograph. The narrative discourse was analyzed, the three groups were compared. The results show the differences between the inmates with ASPD, those without ASPD, and the controls. The antisocial individuals describe hate as an ambivalent feeling with low emotional intensity, i.e., actors (in stories) are presented more as positives than as partners. They use different mechanisms to keep them from understanding the meaning of the emotional situation. The schema's characteristics were expressed in narratives attributed to high Psychopathy.
Abstract: Microparticles carrier systems made from naturally occurring polymers based on chitosan/casein system appears to be a promising carrier for the sustained release of orally and parenteral administered drugs. In the current study we followed a microencapsulation technique based aqueous coacervation method to prepare chitosan/casein microparticles of compositions 1:1, 1:2 and 1:5 incorporated with chloramphenicol. Glutaraldehyde was used as a chemical cross-linking agent. The microparticles were prepared by aerosol method and studied by optical microscopy, infrared spectroscopy, thermo gravimetric analysis, swelling studies and drug release studies at various pH. The percentage swelling of the polymers are found to be in the order pH 4 > pH 10 > pH 7 and the increase in casein composition decrease the swelling percentage. The drug release studies also follow the above order.