Abstract: Despite the recent surge of research in control of
worm propagation, currently, there is no effective defense system
against such cyber attacks. We first design a distributed detection
architecture called Detection via Distributed Blackholes (DDBH).
Our novel detection mechanism could be implemented via virtual
honeypots or honeynets. Simulation results show that a worm can be
detected with virtual honeypots on only 3% of the nodes. Moreover,
the worm is detected when less than 1.5% of the nodes are infected.
We then develop two control strategies: (1) optimal dynamic trafficblocking,
for which we determine the condition that guarantees
minimum number of removed nodes when the worm is contained and
(2) predictive dynamic traffic-blocking–a realistic deployment of
the optimal strategy on scale-free graphs. The predictive dynamic
traffic-blocking, coupled with the DDBH, ensures that more than
40% of the network is unaffected by the propagation at the time
when the worm is contained.
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: Due to insufficient frequency band and tremendous growth of the mobile users, complex computation is needed for the use of resources. Long distance communication began with the introduction of telegraphs and simple coded pulses, which were used to transmit short messages. Since then numerous advances have rendered reliable transfer of information both easier and quicker. Wireless network refers to any type of computer network that is wireless, and is commonly associated with a telecommunications network whose interconnections between nodes is implemented without the use of wires. Wireless network can be broadly categorized in infrastructure network and infrastructure less network. Infrastructure network is one in which we have a base station to serve the mobile users and in the infrastructure less network is one in which no infrastructure is available to serve the mobile users this kind of networks are also known as mobile Adhoc networks. In this paper we have simulated the result for different scenarios with protocols like AODV and DSR; we simulated the result for throughput, delay and receiving traffic in the given scenario.
Abstract: Early detection of lung cancer through chest radiography is a widely used method due to its relatively affordable cost. In this paper, an approach to improve lung nodule visualization on chest radiographs is presented. The approach makes use of linear phase high-frequency emphasis filter for digital filtering and
histogram equalization for contrast enhancement to achieve improvements. Results obtained indicate that a filtered image can
reveal sharper edges and provide more details. Also, contrast enhancement offers a way to further enhance the global (or local) visualization by equalizing the histogram of the pixel values within
the whole image (or a region of interest). The work aims to improve lung nodule visualization of chest radiographs to aid detection of lung cancer which is currently the leading cause of cancer deaths worldwide.
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: In this paper, a novel system
recognition of human faces without using face
different color photographs is proposed. It mainly in
face detection, normalization and recognition. Foot
method of combination of Haar-like face determined
segmentation and region-based histogram stretchi
(RHST) is proposed to achieve more accurate perf
using Haar. Apart from an effective angle norm
side-face (pose) normalization, which is almost a might be important and beneficial for the prepr
introduced. Then histogram-based and photom
normalization methods are investigated and ada
retinex (ASR) is selected for its satisfactory illumin
Finally, weighted multi-block local binary pattern
with 3 distance measures is applied for pair-mat
Experimental results show its advantageous perfo
with PCA and multi-block LBP, based on a principle.
Abstract: Silver nanoparticles were prepared by chemical reduction method. Silver nitrate was taken as the metal precursor and hydrazine hydrate as a reducing agent. The formation of the silver nanoparticles was monitored using UV-Vis absorption spectroscopy. The UV-Vis spectroscopy revealed the formation of silver nanopart├¡cles by exhibing the typical surface plasmon absorption maxima at 418-420 nm from the UV–Vis spectrum. Comparison of theoretical (Mie light scattering theory) and experimental results showed that diameter of silver nanoparticles in colloidal solution is about 60 nm. We have used energy-dispersive spectroscopy (EDX), X-ray diffraction (XRD), transmission electron microscopy (TEM) and, UV–Vis spectroscopy to characterize the nanoparticles obtained. The energy-dispersive spectroscopy (EDX) of the nanoparticles dispersion confirmed the presence of elemental silver signal no peaks of other impurity were detected. The average size and morphology of silver nanoparticles were determined by transmission electron microscopy (TEM). TEM photographs indicate that the nanopowders consist of well dispersed agglomerates of grains with a narrow size distribution (40 and 60 nm), whereas the radius of the individual particles are between 10 and 20 nm. The synthesized nanoparticles have been structurally characterized by X-ray diffraction and transmission high-energy electron diffraction (HEED). The peaks in the XRD pattern are in good agreement with the standard values of the face-centered-cubic form of metallic silver (ICCD-JCPDS card no. 4-0787) and no peaks of other impurity crystalline phases were detected. Additionally, the antibacterial activity of the nanopart├¡culas dispersion was measured by Kirby-Bauer method. The nanoparticles of silver showed high antimicrobial and bactericidal activity against gram positive bacteria such as Escherichia Coli, Pseudimonas aureginosa and staphylococcus aureus which is a highly methicillin resistant strain.
Abstract: This study deals with the phenomena of reflection and transmission (refraction) of qSV-waves, for an incident of quasi transverse vertically waves, at a plane interface of two semi-infinite piezoelectric elastic media under the influence of the initial stresses. The relations governing the reflection and transmission coefficients of these reflected waves for various suitable boundary conditions are derived. We have shown analytically that reflection and transmission coefficients of (qP) and (qSV) waves depend upon the angle of incidence, the parameters of electric potential, the material constants of the medium as will as the initial stresses presented in the media. The numerical calculations of the reflection and transmission amplitude ratios for different values of initial stresses have been carried out by computer for different materials as examples and the results are given in the form of graphs. Finally, some of particular cases are considered.
Abstract: Support vector machines (SVMs) are considered to be
the best machine learning algorithms for minimizing the predictive
probability of misclassification. However, their drawback is that for
large data sets the computation of the optimal decision boundary is a
time consuming function of the size of the training set. Hence several
methods have been proposed to speed up the SVM algorithm. Here
three methods used to speed up the computation of the SVM
classifiers are compared experimentally using a musical genre
classification problem. The simplest method pre-selects a random
sample of the data before the application of the SVM algorithm. Two
additional methods use proximity graphs to pre-select data that are
near the decision boundary. One uses k-Nearest Neighbor graphs and
the other Relative Neighborhood Graphs to accomplish the task.
Abstract: In this paper we examine some properties of suborbital graphs for the congruence subgroup r 0 (N) . Then we give necessary and sufficient conditions for graphs to have triangels.
Abstract: We present a simulation and realization of a battery
charge regulator (BCR) in microsatellite earth observation. The tests
were performed on battery pack 12volt, capacity 24Ah and the solar array open circuit voltage of 100 volt and optimum power of about
250 watt. The battery charge is made by solar module. The principle is to adapt the output voltage of the solar module to the battery by
using the technique of pulse width modulation (PWM). Among the different techniques of charge battery, we opted for the technique of
the controller ON/OFF is a standard technique and simple, it-s easy to
be board executed validation will be made by simulation "Proteus Isis
Professional software ". The circuit and the program of this prototype
are based on the PIC16F877 microcontroller, a serial interface connecting a PC is also realized, to view and save data and graphics
in real time, for visualization of data and graphs we develop an interface tool “visual basic.net (VB)--.
Abstract: Star graphs are Cayley graphs of symmetric groups of permutations, with transpositions as the generating sets. A star graph is a preferred interconnection network topology to a hypercube for its ability to connect a greater number of nodes with lower degree. However, an attractive property of the hypercube is that it has a Hamiltonian decomposition, i.e. its edges can be partitioned into disjoint Hamiltonian cycles, and therefore a simple routing can be found in the case of an edge failure. The existence of Hamiltonian cycles in Cayley graphs has been known for some time. So far, there are no published results on the much stronger condition of the existence of Hamiltonian decompositions. In this paper, we give a construction of a Hamiltonian decomposition of the star graph 5-star of degree 4, by defining an automorphism for 5-star and a Hamiltonian cycle which is edge-disjoint with its image under the automorphism.
Abstract: In this paper, the order, size and degree of the nodes
of the isomorphic fuzzy graphs are discussed. Isomorphism between
fuzzy graphs is proved to be an equivalence relation. Some properties
of self complementary and self weak complementary fuzzy graphs
are discussed.
Abstract: In this paper we introduce an efficient solution
method for the Eigen-decomposition of bisymmetric and per
symmetric matrices of symmetric structures. Here we decompose
adjacency and Laplacian matrices of symmetric structures to submatrices
with low dimension for fast and easy calculation of
eigenvalues and eigenvectors. Examples are included to show the
efficiency of the method.
Abstract: An acyclic coloring of a graph G is a coloring of its
vertices such that:(i) no two neighbors in G are assigned the same
color and (ii) no bicolored cycle can exist in G. The acyclic chromatic
number of G is the least number of colors necessary to acyclically
color G. Recently it has been proved that any graph of maximum
degree 5 has an acyclic chromatic number at most 8. In this paper
we present another proof for this result.
Abstract: This paper introduces a technique for simulating a
single-server exponential queuing system. The technique called the
Q-Simulator is a computer program which can simulate the effect of
traffic intensity on all system average quantities given the arrival
and/or service rates. The Q-Simulator has three phases namely: the
formula based method, the uncontrolled simulation, and the
controlled simulation. The Q-Simulator generates graphs (crystal
solutions) for all results of the simulation or calculation and can be
used to estimate desirable average quantities such as waiting times,
queue lengths, etc.
Abstract: The Detour matrix (DD) of a graph has for its ( i , j)
entry the length of the longest path between vertices i and j. The
DD-eigenvalues of a connected graph G are the eigenvalues for its
detour matrix, and they form the DD-spectrum of G. The DD-energy
EDD of the graph G is the sum of the absolute values of its DDeigenvalues.
Two connected graphs are said to be DD- equienergetic
if they have equal DD-energies. In this paper, the DD- spectra of a
variety of graphs and their DD-energies are calculated.
Abstract: Existing work in temporal logic on representing the
execution of infinitely many transactions, uses linear-time temporal
logic (LTL) and only models two-step transactions. In this paper,
we use the comparatively efficient branching-time computational tree
logic CTL and extend the transaction model to a class of multistep
transactions, by introducing distinguished propositional variables
to represent the read and write steps of n multi-step transactions
accessing m data items infinitely many times. We prove that the
well known correspondence between acyclicity of conflict graphs
and serializability for finite schedules, extends to infinite schedules.
Furthermore, in the case of transactions accessing the same set of
data items in (possibly) different orders, serializability corresponds
to the absence of cycles of length two. This result is used to give an
efficient encoding of the serializability condition into CTL.
Abstract: Martensitic stainless steels have been extensively used for their good corrosion resistance and better mechanical properties. Heat treatment was suggested as one of the most excellent ways to this regard; hence, it affects the microstructure, mechanical and corrosion properties of the steel. In the current research work the microstructural changes and corrosion behavior in an AISI 420A stainless steel exposed to temperatures in the 980-1035oC range were investigated. The heat treatment is carried out in vacuum furnace within the said temperature range. The quenching of the samples was carried out in oil, brine and water media. The formation and stability of passive film was studied by Open Circuit Potential, Potentiodynamic polarization and Electrochemical Scratch Tests. The Electrochemical Impedance Spectroscopy results simulated with Equivalent Electrical Circuit suggested bilayer structure of outer porous and inner barrier oxide films. The quantitative data showed thick inner barrier oxide film retarded electrochemical reactions. Micrographs of the quenched samples showed sigma and chromium carbide phases which prove the corrosion resistance of steel alloy.