Abstract: A new class of percolation model in complex networks,
in which nodes are characterized by hidden variables reflecting the
properties of nodes and the occupied probability of each link is
determined by the hidden variables of the end nodes, is studied
in this paper. By the mean field theory, the analytical expressions
for the phase of percolation transition is deduced. It is determined
by the distribution of the hidden variables for the nodes and the
occupied probability between pairs of them. Moreover, the analytical
expressions obtained are checked by means of numerical simulations
on a particular model. Besides, the general model can be applied
to describe and control practical diffusion models, such as disease
diffusion model, scientists cooperation networks, and so on.
Abstract: In this paper, 3X3 routing nodes are proposed to
provide speedup and parallel processing capability in Data Vortex
network architectures. The new design not only significantly
improves network throughput and latency, but also eliminates the
need for distributive traffic control mechanism originally embedded
among nodes and the need for nodal buffering. The cost effectiveness
is studied by a comparison study with the previously proposed 2-
input buffered networks, and considerable performance enhancement
can be achieved with similar or lower cost of hardware. Unlike
previous implementation, the network leaves small probability of
contention, therefore, the packet drop rate must be kept low for such
implementation to be feasible and attractive, and it can be achieved
with proper choice of operation conditions.
Abstract: Rooted in the study of social functioning of space in architecture, Space Syntax (SS) and the more recent Network Pattern (NP) researches demonstrate the 'spatial structures' of city, i.e. the hierarchical patterns of streets, junctions and alley ends. Applying SS and NP models, planners can conceptualize the real city-s patterns. Although, both models yield the optimal path of the city their underpinning displays of the city-s spatial configuration differ. The Axial Map analyzes the topological non-distance-based connectivity structure, whereas, the Central-Node Map and the Shortcut-Path Map, in contrast, analyze the metrical distance-based structures. This research contrasts and combines them to understand various forms of city-s structures. It concludes that, while they reveal different spatial structures, Space Syntax and Network Pattern urban models support each the other. Combining together they simulate the global access and the locally compact structures namely the central nodes and the shortcuts for the city.
Abstract: ZnO+Ga2O3 functionally graded thin films (FGTFs)
were examined for their potential use as Solar cell and organic light
emitting diodes (OLEDs). FGTF transparent conducting oxides (TCO)
were fabricated by combinatorial RF magnetron sputtering. The
composition gradient was controlled up to 10% by changing the
plasma power of the two sputter guns. A Ga2O3+ZnO graded region
was placed on the top layer of ZnO. The FGTFs showed up to 80%
transmittance. Their surface resistances were reduced to < 10% by
increasing the Ga2O3: pure ZnO ratio in the TCO. The FGTFs- work
functions could be controlled within a range of 0.18 eV. The
controlled work function is a very promising technology because it
reduces the contact resistance between the anode and Hall transport
layers of OLED and solar cell devices.
Abstract: In this study, we introduced a communication system
where human body was used as medium through which data were
transferred. Multiple biosignal sensing units were attached to a subject
and wireless personal area network was formed. Data of the sensing
units were shared among them. We used wideband pulse
communication that was simple, low-power consuming and high data
rated. Each unit functioned as independent communication device or
node. A method of channel search and communication among the
modes was developed. A protocol of carrier sense multiple
access/collision detect was implemented in order to avoid data
collision or interferences. Biosignal sensing units should be located at
different locations due to the nature of biosignal origin. Our research
provided a flexibility of collecting data without using electrical wires.
More non-constrained measurement was accomplished which was
more suitable for u-Health monitoring.
Abstract: The Cluster Dimension of a network is defined as, which is the minimum cardinality of a subset S of the set of nodes having the property that for any two distinct nodes x and y, there exist the node Si, s2 (need not be distinct) in S such that ld(x,s1) — d(y, s1)1 > 1 and d(x,s2) < d(x,$) for all s E S — {s2}. In this paper, strictly non overlap¬ping clusters are constructed. The concept of LandMarks for Unique Addressing and Clustering (LMUAC) routing scheme is developed. With the help of LMUAC routing scheme, It is shown that path length (upper bound)PLN,d < PLD, Maximum memory space requirement for the networkMSLmuAc(Az) < MSEmuAc < MSH3L < MSric and Maximum Link utilization factor MLLMUAC(i=3) < MLLMUAC(z03) < M Lc
Abstract: A real time image-guided electroplating system is
proposed in this paper. Unlike previous electroplating systems, instead
of using the intermittent mode to electroplate 500um long copper
specimen, a CCD camera and a motion controller are used to adjust
anode-cathode distance to obtain better results. Since the image of the
gap distance is highly deteriorated due to complex chemical-electrical
operation inside the electrolyte, to determine the gap distance, an
image processing algorithm is developed and mainly based on the
entropy and energy values. In addition, the color and incidence
direction of light source are also discussed to help the image process in
this paper. From the experiment results, the specimens created by the
proposed system show better structure, better uniformity and better
finishing surface compared to those by previous intermittent
electroplating setup.
Abstract: With the widespread growth of applications of
Wireless Sensor Networks (WSNs), the need for reliable security
mechanisms these networks has increased manifold. Many security
solutions have been proposed in the domain of WSN so far. These
solutions are usually based on well-known cryptographic
algorithms.
In this paper, we have made an effort to survey well known
security issues in WSNs and study the behavior of WSN nodes that
perform public key cryptographic operations. We evaluate time
and power consumption of public key cryptography algorithm for
signature and key management by simulation.
Abstract: Two-dimensional finite element model was created in this work to investigate the stresses distribution within rock-like samples with offset open non-persistent joints under biaxial loading. The results of this study have explained the fracture mechanisms observed in tests on rock-like material with open non-persistent offset joints [1]. Finite element code SAP2000 was used to study the stresses distribution within the specimens. Four-nodded isoperimetric plain strain element with two degree of freedom per node, and the three-nodded constant strain triangular element with two degree of freedom per node were used in the present study.The results of the present study explained the formation of wing cracks at the tip of the joints for low confining stress as well as the formation of wing cracks at the middle of the joint for the higher confining stress. High shear stresses found in the numerical study at the tip of the joints explained the formation of secondary cracks at the tip of the joints in the experimental study. The study results coincide with the experimental observations which showed that for bridge inclination of 0o, the coalescence occurred due to shear failure and for bridge inclination of 90o the coalescence occurred due to tensile failure while for the other bridge inclinations coalescence occurred due to mixed tensile and shear failure.
Abstract: Clustering large populations is an important problem
when the data contain noise and different shapes. A good clustering
algorithm or approach should be efficient enough to detect clusters
sensitively. Besides space complexity, time complexity also gains
importance as the size grows. Using hierarchies we developed a new
algorithm to split attributes according to the values they have and
choosing the dimension for splitting so as to divide the database
roughly into equal parts as much as possible. At each node we
calculate some certain descriptive statistical features of the data
which reside and by pruning we generate the natural clusters with a
complexity of O(n).
Abstract: A number of routing algorithms based on learning
automata technique have been proposed for communication
networks. How ever, there has been little work on the effects of
variation of graph scarcity on the performance of these algorithms. In
this paper, a comprehensive study is launched to investigate the
performance of LASPA, the first learning automata based solution to
the dynamic shortest path routing, across different graph structures
with varying scarcities. The sensitivity of three main performance
parameters of the algorithm, being average number of processed
nodes, scanned edges and average time per update, to variation in
graph scarcity is reported. Simulation results indicate that the LASPA
algorithm can adapt well to the scarcity variation in graph structure
and gives much better outputs than the existing dynamic and fixed
algorithms in terms of performance criteria.
Abstract: In order to investigate water deficit stress on 24 of
soybean (Glycine Max. L) cultivars and lines in temperate climate, an
experiment was conducted in Iran Seed and Plant Improvement
Institute. Stress levels were irrigation after evaporation of 50, 100,
150 mm water from pan, class A. Randomized Completely Block
Design was arranged for each stress levels. Some traits such as, node
number, plant height, pod number per area, grain number per pod,
grain number per area, 1000 grains weight, grain yield and harvest
index were measured. Results showed that water deficit stress had
significant effect on node number, plant height, pod number per area,
grain number per pod, grain number per area, 1000 grains weight and
harvest index. Also all of agronomic traits except harvest index
influenced significantly by cultivars and lines. The least and most
grain yield was belonged to Ronak X Williams and M41 x Clark
respectively.
Abstract: A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic clustering and utilizes temporary-cluster-heads to distribute the energy load among high-power sensor nodes; thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC outperforms LEACH in terms of network lifetime and power consumption minimization.
Abstract: This paper proposes a new approach to offer a private
cloud service in HPC clusters. In particular, our approach relies on
automatically scheduling users- customized environment request as a
normal job in batch system. After finishing virtualization request jobs,
those guest operating systems will dismiss so that compute nodes will
be released again for computing. We present initial work on the
innovative integration of HPC batch system and virtualization tools
that aims at coexistence such that they suffice for meeting the
minimizing interference required by a traditional HPC cluster. Given
the design of initial infrastructure, the proposed effort has the potential
to positively impact on synergy model. The results from the
experiment concluded that goal for provisioning customized cluster
environment indeed can be fulfilled by using virtual machines, and
efficiency can be improved with proper setup and arrangements.
Abstract: Delay and Disruption Tolerant Networking is part of
the Inter Planetary Internet with primary application being Deep
Space Networks. Its Terrestrial form has interesting research
applications such as Alagappa University Delay Tolerant Water
Monitoring Network which doubles as test beds for improvising its
routing scheme. DTNs depend on node mobility to deliver packets
using a store-carry-and forward paradigm. Throwboxes are small and
inexpensive stationary devices equipped with wireless interfaces and
storage. We propose the use of Throwboxes to enhance the contact
opportunities of the nodes and hence improve the Throughput. The
enhancement is evaluated using Alunivdtnsim, a desktop simulator in
C language and the results are graphically presented.
Abstract: The increasing importance of data stream arising in a
wide range of advanced applications has led to the extensive study of
mining frequent patterns. Mining data streams poses many new
challenges amongst which are the one-scan nature, the unbounded
memory requirement and the high arrival rate of data streams. In this
paper, we propose a new approach for mining itemsets on data
stream. Our approach SFIDS has been developed based on FIDS
algorithm. The main attempts were to keep some advantages of the
previous approach and resolve some of its drawbacks, and
consequently to improve run time and memory consumption. Our
approach has the following advantages: using a data structure similar
to lattice for keeping frequent itemsets, separating regions from each
other with deleting common nodes that results in a decrease in search
space, memory consumption and run time; and Finally, considering
CPU constraint, with increasing arrival rate of data that result in
overloading system, SFIDS automatically detect this situation and
discard some of unprocessing data. We guarantee that error of results
is bounded to user pre-specified threshold, based on a probability
technique. Final results show that SFIDS algorithm could attain
about 50% run time improvement than FIDS approach.
Abstract: The decoding of Low-Density Parity-Check (LDPC) codes is operated over a redundant structure known as the bipartite graph, meaning that the full set of bit nodes is not absolutely necessary for decoder convergence. In 2008, Soyjaudah and Catherine designed a recovery algorithm for LDPC codes based on this assumption and showed that the error-correcting performance of their codes outperformed conventional LDPC Codes. In this work, the use of the recovery algorithm is further explored to test the performance of LDPC codes while the number of iterations is progressively increased. For experiments conducted with small blocklengths of up to 800 bits and number of iterations of up to 2000, the results interestingly demonstrate that contrary to conventional wisdom, the error-correcting performance keeps increasing with increasing number of iterations.
Abstract: Target tracking and localization are important applications
in wireless sensor networks. In these applications, sensor nodes
collectively monitor and track the movement of a target. They have
limited energy supplied by batteries, so energy efficiency is essential
for sensor networks. Most existing target tracking protocols need to
wake up sensors periodically to perform tracking. Some unnecessary
energy waste is thus introduced. In this paper, an energy efficient
protocol for target localization is proposed. In order to preserve
energy, the protocol fixes the number of sensors for target tracking,
but it retains the quality of target localization in an acceptable
level. By selecting a set of sensors for target localization, the other
sensors can sleep rather than periodically wake up to track the target.
Simulation results show that the proposed protocol saves a significant
amount of energy and also prolongs the network lifetime.
Abstract: Wireless Sensor Networks (WSNs) are wireless
networks consisting of number of tiny, low cost and low power
sensor nodes to monitor various physical phenomena like
temperature, pressure, vibration, landslide detection, presence of any
object, etc. The major limitation in these networks is the use of nonrechargeable
battery having limited power supply. The main cause of
energy consumption WSN is communication subsystem. This paper
presents an efficient grid formation/clustering strategy known as Grid
based level Clustering and Aggregation of Data (GCAD). The
proposed clustering strategy is simple and scalable that uses low duty
cycle approach to keep non-CH nodes into sleep mode thus reducing
energy consumption. Simulation results demonstrate that our
proposed GCAD protocol performs better in various performance
metrics.
Abstract: Particle Swarm Optimization (PSO) with elite PSO
parameters has been developed for power flow analysis under
practical constrained situations. Multiple solutions of the power flow
problem are useful in voltage stability assessment of power system.
A method of determination of multiple power flow solutions is
presented using a hybrid of Particle Swarm Optimization (PSO) and
local search technique. The unique and innovative learning factors of
the PSO algorithm are formulated depending upon the node power
mismatch values to be highly adaptive with the power flow problems.
The local search is applied on the pbest solution obtained by the PSO
algorithm in each iteration. The proposed algorithm performs reliably
and provides multiple solutions when applied on standard and illconditioned
systems. The test results show that the performances of
the proposed algorithm under critical conditions are better than the
conventional methods.