Abstract: In many applications, data is in graph structure, which
can be naturally represented as graph-structured XML. Existing
queries defined on tree-structured and graph-structured XML data
mainly focus on subgraph matching, which can not cover all the
requirements of querying on graph. In this paper, a new kind of
queries, topological query on graph-structured XML is presented.
This kind of queries consider not only the structure of subgraph but
also the topological relationship between subgraphs. With existing
subgraph query processing algorithms, efficient algorithms for topological
query processing are designed. Experimental results show the
efficiency of implementation algorithms.
Abstract: Using efficient classification methods is necessary for automatic fingerprint recognition system. This paper introduces a new structural approach to fingerprint classification by using the directional image of fingerprints to increase the number of subclasses. In this method, the directional image of fingerprints is segmented into regions consisting of pixels with the same direction. Afterwards the relational graph to the segmented image is constructed and according to it, the super graph including prominent information of this graph is formed. Ultimately we apply a matching technique to compare obtained graph with the model graphs in order to classify fingerprints by using cost function. Increasing the number of subclasses with acceptable accuracy in classification and faster processing in fingerprints recognition, makes this system superior.
Abstract: Adsorption of methanol and ethanol over mesoporous
siliceous material are studied in the current paper. The pure
mesoporous silica is prepared using tetraethylorthosilicate (TEOS) as
silica source and dodecylamine as template at low pH. The prepared
material was characterized using nitrogen adsorption,nX-ray
diffraction (XRD) and scanning electron microscopy (SEM). The
adsorption kinetics of methanol and ethanol from aqueous solution
were studied over the prepared mesoporous silica material. The
percent removal of alcohol was calculated per unit mass of adsorbent
used. The 1st order model is found to be in agreement with both
adsorbates while the 2nd order model fit the adsorption of methanol
only.
Abstract: This paper presents an improved variable ordering method to obtain the minimum number of nodes in Reduced Ordered Binary Decision Diagrams (ROBDD). The proposed method uses the graph topology to find the best variable ordering. Therefore the input Boolean function is converted to a unidirectional graph. Three levels of graph parameters are used to increase the probability of having a good variable ordering. The initial level uses the total number of nodes (NN) in all the paths, the total number of paths (NP) and the maximum number of nodes among all paths (MNNAP). The second and third levels use two extra parameters: The shortest path among two variables (SP) and the sum of shortest path from one variable to all the other variables (SSP). A permutation of the graph parameters is performed at each level for each variable order and the number of nodes is recorded. Experimental results are promising; the proposed method is found to be more effective in finding the variable ordering for the majority of benchmark circuits.
Abstract: To increase reliability of face recognition system, the
system must be able to distinguish real face from a copy of face such
as a photograph. In this paper, we propose a fast and memory efficient
method of live face detection for embedded face recognition system,
based on the analysis of the movement of the eyes. We detect eyes in
sequential input images and calculate variation of each eye region to
determine whether the input face is a real face or not. Experimental
results show that the proposed approach is competitive and promising
for live face detection.
Abstract: This report focus on phase behavior of polyethylene glycol (PEG)4000/ phosphate/ guanidine hydrochloride/ water system at different guanidine hydrochloride concentrations and pH. The binodal of the systems was displaced toward higher concentrations of the components with increasing guanidine hydrochloride concentrations. The partition coefficient of guanidine hydrochloride was near unity and increased with decreasing pH and increasing PEG/salt (%w/w) ratio.
Abstract: Random Oracle Model (ROM) is an effective method
for measuring the practical security of cryptograph. In this paper, we
try to use it into information hiding system (IHS). Because IHS has its
own properties, the ROM must be modified if it is used into IHS.
Firstly, we fully discuss why and how to modify each part of ROM
respectively. The main changes include: 1) Divide the attacks that IHS
may be suffered into two phases and divide the attacks of each phase
into several kinds. 2) Distinguish Oracles and Black-boxes clearly. 3)
Define Oracle and four Black-boxes that IHS used. 4) Propose the
formalized adversary model. And 5) Give the definition of judge.
Secondly, based on ROM of IHS, the security against known original
cover attack (KOCA-KOCA-security) is defined. Then, we give an
actual information hiding scheme and prove that it is
KOCA-KOCA-secure. Finally, we conclude the paper and propose the
open problems of further research.
Abstract: This paper deals with the design, development & implementation of a temperature sensor using zigbee. The main aim of the work undertaken in this paper is to sense the temperature and to display the result on the LCD using the zigbee technology. ZigBee operates in the industrial, scientific and medical (ISM) radio bands; 868 MHz in Europe, 915 MHz in the USA and 2.4 GHz in most jurisdictions worldwide. The technology is intended to be simpler and cheaper than other WPANs such as Bluetooth. The most capable ZigBee node type is said to require only about 10 % of the software of a typical Bluetooth or Wireless Internet node, while the simplest nodes are about 2 %. However, actual code sizes are much higher, more like 50 % of the Bluetooth code size. ZigBee chip vendors have announced 128-kilobyte devices. In this work undertaken in the design & development of the temperature sensor, it senses the temperature and after amplification is then fed to the micro controller, this is then connected to the zigbee module, which transmits the data and at the other end the zigbee reads the data and displays on to the LCD. The software developed is highly accurate and works at a very high speed. The method developed shows the effectiveness of the scheme employed.
Abstract: Discharges in hydrogen, ignited by wire explosion, with current amplitude up to 1.5 MA were investigated. Channel diameter oscillations were observed on the photostreaks. Voltage and current curves correlated with the photostreaks. At initial gas pressure of 5-35 MPa the oscillation period was proportional to square root of atomic number of the initiating wire material. These oscillations were associated with aligned magnetic and gas-kinetic pressures. At initial pressure of 80-160 MPa acoustic pressure fluctuations on the discharge chamber wall were increased up to 150 MPa and there were the growth of voltage fluctuations on the discharge gap up to 3 kV simultaneously with it. In some experiments it was observed abrupt increase in the oscillation amplitude, which can be caused by the resonance of the acoustic oscillations in discharge chamber volume and the oscillations connected with alignment of the gaskinetic pressure and the magnetic pressure, as far as frequencies of these oscillations are close to each other in accordance with the estimates and the experimental data. Resonance of different type oscillations can produce energy density increasing in the discharge channel. Thus, the appropriate initial conditions in the experiment allow to increase the energy density in the discharge channel
Abstract: A spanning tree of a connected graph is a tree which
consists the set of vertices and some or perhaps all of the edges from
the connected graph. In this paper, a model for spanning tree
transformation of connected graphs into single-row networks, namely
Spanning Tree of Connected Graph Modeling (STCGM) will be
introduced. Path-Growing Tree-Forming algorithm applied with
Vertex-Prioritized is contained in the model to produce the spanning
tree from the connected graph. Paths are produced by Path-Growing
and they are combined into a spanning tree by Tree-Forming. The
spanning tree that is produced from the connected graph is then
transformed into single-row network using Tree Sequence Modeling
(TSM). Finally, the single-row routing problem is solved using a
method called Enhanced Simulated Annealing for Single-Row
Routing (ESSR).
Abstract: Abstract–Let k ≥ 3 be an integer, and let G be a graph of order n with n ≥ 9k +3- 42(k - 1)2 + 2. Then a spanning subgraph F of G is called a k-factor if dF (x) = k for each x ∈ V (G). A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G is a fractional k-deleted graph if there exists a fractional k-factor after deleting any edge of G. In this paper, it is proved that G is a fractional k-deleted graph if G satisfies δ(G) ≥ k + 1 and |NG(x) ∪ NG(y)| ≥ 1 2 (n + k - 2) for each pair of nonadjacent vertices x, y of G.
Abstract: this paper gives a novel approach towards real-time speed estimation of multiple traffic vehicles using fuzzy logic and image processing techniques with proper arrangement of camera parameters. The described algorithm consists of several important steps. First, the background is estimated by computing median over time window of specific frames. Second, the foreground is extracted using fuzzy similarity approach (FSA) between estimated background pixels and the current frame pixels containing foreground and background. Third, the traffic lanes are divided into two parts for both direction vehicles for parallel processing. Finally, the speeds of vehicles are estimated by Maximum a Posterior Probability (MAP) estimator. True ground speed is determined by utilizing infrared sensors for three different vehicles and the results are compared to the proposed algorithm with an accuracy of ± 0.74 kmph.
Abstract: The Block Sorting problem is to sort a given
permutation moving blocks. A block is defined as a substring
of the given permutation, which is also a substring of the
identity permutation. Block Sorting has been proved to be
NP-Hard. Until now two different 2-Approximation algorithms
have been presented for block sorting. These are the best known
algorithms for Block Sorting till date. In this work we present
a different characterization of Block Sorting in terms of a
transposition cycle graph. Then we suggest a heuristic,
which we show to exhibit a 2-approximation performance
guarantee for most permutations.
Abstract: In this paper a new definition of adjacency matrix in
the simple graphs is presented that is called fuzzy adjacency matrix,
so that elements of it are in the form of 0 and
n N
n
1 , ∈
that are
in the interval [0, 1], and then some charactristics of this matrix are
presented with the related examples . This form matrix has complete
of information of a graph.
Abstract: Let G be a graph of order n, and let k 2 and m 0 be two integers. Let h : E(G) [0, 1] be a function. If e∋x h(e) = k holds for each x V (G), then we call G[Fh] a fractional k-factor of G with indicator function h where Fh = {e E(G) : h(e) > 0}. A graph G is called a fractional (k,m)-deleted graph if there exists a fractional k-factor G[Fh] of G with indicator function h such that h(e) = 0 for any e E(H), where H is any subgraph of G with m edges. In this paper, it is proved that G is a fractional (k,m)-deleted graph if (G) k + m + m k+1 , n 4k2 + 2k − 6 + (4k 2 +6k−2)m−2 k−1 and max{dG(x), dG(y)} n 2 for any vertices x and y of G with dG(x, y) = 2. Furthermore, it is shown that the result in this paper is best possible in some sense.
Abstract: Connected dominating set (CDS) problem in unit disk
graph has signi£cant impact on an ef£cient design of routing protocols
in wireless sensor networks, where the searching space for a
route is reduced to nodes in the set. A set is dominating if all the
nodes in the system are either in the set or neighbors of nodes in the
set. In this paper, a simple and ef£cient heuristic method is proposed
for £nding a minimum connected dominating set (MCDS) in ad hoc
wireless networks based on the new parameter support of vertices.
With this parameter the proposed heuristic approach effectively
£nds the MCDS of a graph. Extensive computational experiments
show that the proposed approach outperforms the recently proposed
heuristics found in the literature for the MCD
Abstract: Traveling salesman problem (TSP) is hard to resolve
when the number of cities and routes become large. The frequency
graph is constructed to tackle the problem. A frequency graph
maintains the topological relationships of the original weighted graph.
The numbers on the edges are the frequencies of the edges emulated
from the local optimal Hamiltonian paths. The simplest kind of local
optimal Hamiltonian paths are computed based on the four vertices
and three lines inequality. The search algorithm is given to find the
optimal Hamiltonian circuit based on the frequency graph. The
experiments show that the method can find the optimal Hamiltonian
circuit within several trials.
Abstract: pH-sensitive drug targeting using nanoparticles for
cancer chemotherapy have been spotlighted in recent decades. Graft
copolymer composed of poly (L-histidine) (PHS) and dextran
(DexPHS) was synthesized and pH-sensitive nanoparticles were
fabricated for pH-responsive drug delivery of doxorubicin (DOX).
Nanoparticles of DexPHS showed pH-sensitive changes in particle
sizes and drug release behavior, i.e. particle sizes and drug release rate
were increased at acidic pH, indicating that DexPHS nanoparticles
have pH-sensitive drug delivery potentials. Antitumor activity of
DOX-incorporated DexPHS nanoparticles were studied using CT26
colorectal carcinoma cells. Results indicated that fluorescence
intensity was higher at acidic pH than basic pH. These results
indicated that DexPHS nanoparticles have pH-responsive drug
targeting.
Abstract: Palm shell obtained from coastal part of southern
India was studied for the removal for the adsorption of Hg (II) ions.
Batch adsorption experiments were carried out as a function of pH,
concentration of Hg (II) ions, time, temperature and adsorbent dose.
Maximum removal was seen in the range pH 4.0- pH 7.0. The palm
shell powder used as adsorbent was characterized for its surface area,
SEM, PXRD, FTIR, ion exchange capacity, moisture content, and
bulk density, soluble content in water and acid and pH. The
experimental results were analyzed using Langmuir I, II, III, IV and
Freundlich adsorption isotherms. The batch sorption kinetics was
studied for the first order reversible reaction, pseudo first order;
pseudo second order reaction and the intra-particle diffusion reaction.
The biomass was successfully used for removal Hg (II) from
synthetic and industrial effluents and the technique appears
industrially applicable and viable.
Abstract: This paper presents a methodology for operational and
economic characteristics based evaluation and selection of a power
plant using Graph theoretic approach. A universal evaluation index
on the basis of Operational and economics characteristics of a plant is
proposed which evaluates and ranks the various types of power plants.
The index thus obtained from the pool of operational characteristics
of the power plant attributes Digraph. The Digraph is developed
considering Operational and economics attributes of the power plants
and their relative importance for their smooth operation, installation
and commissioning and prioritizing their selection. The sensitivity
analysis of the attributes towards the objective has also been carried
out in order to study the impact of attributes over the desired outcome
i.e. the universal operational-economics index of the power plant.