Abstract: In this paper, a mathematical model for data object replication in ad hoc networks is formulated. The derived model is general, flexible and adaptable to cater for various applications in ad hoc networks. We propose a game theoretical technique in which players (mobile hosts) continuously compete in a non-cooperative environment to improve data accessibility by replicating data objects. The technique incorporates the access frequency from mobile hosts to each data object, the status of the network connectivity, and communication costs. The proposed technique is extensively evaluated against four well-known ad hoc network replica allocation methods. The experimental results reveal that the proposed approach outperforms the four techniques in both the execution time and solution quality
Abstract: Neural processors have shown good results for
detecting a certain character in a given input matrix. In this paper, a
new idead to speed up the operation of neural processors for character
detection is presented. Such processors are designed based on cross
correlation in the frequency domain between the input matrix and the
weights of neural networks. This approach is developed to reduce the
computation steps required by these faster neural networks for the
searching process. The principle of divide and conquer strategy is
applied through image decomposition. Each image is divided into
small in size sub-images and then each one is tested separately by
using a single faster neural processor. Furthermore, faster character
detection is obtained by using parallel processing techniques to test the
resulting sub-images at the same time using the same number of faster
neural networks. In contrast to using only faster neural processors, the
speed up ratio is increased with the size of the input image when using
faster neural processors and image decomposition. Moreover, the
problem of local subimage normalization in the frequency domain is
solved. The effect of image normalization on the speed up ratio of
character detection is discussed. Simulation results show that local
subimage normalization through weight normalization is faster than
subimage normalization in the spatial domain. The overall speed up
ratio of the detection process is increased as the normalization of
weights is done off line.
Abstract: The understanding of the system level of biological behavior and phenomenon variously needs some elements such as gene sequence, protein structure, gene functions and metabolic pathways. Challenging problems are representing, learning and reasoning about these biochemical reactions, gene and protein structure, genotype and relation between the phenotype, and expression system on those interactions. The goal of our work is to understand the behaviors of the interactions networks and to model their evolution in time and in space. We propose in this study an ontological meta-model for the knowledge representation of the genetic regulatory networks. Ontology in artificial intelligence means the fundamental categories and relations that provide a framework for knowledge models. Domain ontology's are now commonly used to enable heterogeneous information resources, such as knowledge-based systems, to communicate with each other. The interest of our model is to represent the spatial, temporal and spatio-temporal knowledge. We validated our propositions in the genetic regulatory network of the Aarbidosis thaliana flower
Abstract: This paper presents a new method to detect high impedance faults in radial distribution systems. Magnitudes of third and fifth harmonic components of voltages and currents are used as a feature vector for fault discrimination. The proposed methodology uses a learning vector quantization (LVQ) neural network as a classifier for identifying high impedance arc-type faults. The network learns from the data obtained from simulation of a simple radial system under different fault and system conditions. Compared to a feed-forward neural network, a properly tuned LVQ network gives quicker response.
Abstract: This paper describes a 2.4 GHz passive switch mixer
and a 5/2.5 GHz voltage-controlled negative Gm oscillator (VCO)
with an inversion-mode MOS varactor. Both circuits are implemented
using a 1P8M 0.13 μm process. The switch mixer has an input
referred 1 dB compression point of -3.89 dBm and a conversion
gain of -0.96 dB when the local oscillator power is +2.5 dBm.
The VCO consumes only 1.75 mW, while drawing 1.45 mA from a
1.2 V supply voltage. In order to reduce the passives size, the VCO
natural oscillation frequency is 5 GHz. A clocked CMOS divideby-
two circuit is used for frequency division and quadrature phase
generation. The VCO has a -109 dBc/Hz phase noise at 1 MHz
frequency offset and a 2.35-2.5 GHz tuning range (after the frequency
division), thus complying with ZigBee requirements.
Abstract: In this paper, we propose APO, a new packet scheduling
scheme with Quality of Service (QoS) support for hybrid of
real and non-real time services in HSDPA networks. The APO
scheduling algorithm is based on the effective channel anticipation
model. In contrast to the traditional schemes, the proposed method is
implemented based on a cyclic non-work-conserving discipline.
Simulation results indicated that proposed scheme has good
capability to maximize the channel usage efficiency in compared to
another exist scheduling methods. Simulation results demonstrate the
effectiveness of the proposed algorithm.
Abstract: With the rapid development of wireless mobile communication, applications for mobile devices must focus on network security. In 2008, Chang-Chang proposed security improvements on the Lu et al.-s elliptic curve authentication key agreement protocol for wireless mobile networks. However, this paper shows that Chang- Chang-s improved protocol is still vulnerable to off-line password guessing attacks unlike their claims.
Abstract: Mobile Ad Hoc Networks (MANETs) are multi-hop
wireless networks in which all nodes cooperatively maintain network
connectivity. In such a multi-hop wireless network, every node may
be required to perform routing in order to achieve end-to-end
communication among nodes. These networks are energy constrained
as most ad hoc mobile nodes today operate with limited battery
power. Hence, it is important to minimize the energy consumption of
the entire network in order to maximize the lifetime of ad hoc
networks. In this paper, a mechanism involving the integration of
load balancing approach and transmission power control approach is
introduced to maximize the life-span of MANETs. The mechanism is
applied on Ad hoc On-demand Vector (AODV) protocol to make it
as energy aware AODV (EA_AODV). The simulation is carried out
using GloMoSim2.03 simulator. The results show that the proposed
mechanism reduces the average required transmission energy per
packet compared to the standard AODV.
Abstract: Since the presentation of the backpropagation algorithm, a vast variety of improvements of the technique for training a feed forward neural networks have been proposed. This article focuses on two classes of acceleration techniques, one is known as Local Adaptive Techniques that are based on weightspecific only, such as the temporal behavior of the partial derivative of the current weight. The other, known as Dynamic Adaptation Methods, which dynamically adapts the momentum factors, α, and learning rate, η, with respect to the iteration number or gradient. Some of most popular learning algorithms are described. These techniques have been implemented and tested on several problems and measured in terms of gradient and error function evaluation, and percentage of success. Numerical evidence shows that these techniques improve the convergence of the Backpropagation algorithm.
Abstract: A model to identify the lifetime of target tracking
wireless sensor network is proposed. The model is a static clusterbased
architecture and aims to provide two factors. First, it is to
increase the lifetime of target tracking wireless sensor network.
Secondly, it is to enable good localization result with low energy
consumption for each sensor in the network. The model consists of
heterogeneous sensors and each sensing member node in a cluster
uses two operation modes–active mode and sleep mode. The
performance results illustrate that the proposed architecture consumes
less energy and increases lifetime than centralized and dynamic
clustering architectures, for target tracking sensor network.
Abstract: In automotive systems almost all steps concerning the
calibration of several control systems, e.g., low idle governor or
boost pressure governor, are made with the vehicle because the timeto-
production and cost requirements on the projects do not allow for
the vehicle analysis necessary to build reliable models. Here is
presented a procedure using parametric and NN (neural network)
models that enables the generation of vehicle system models based
on normal ECU engine control unit) vehicle measurements. These
models are locally valid and permit pre and follow-up calibrations so
that, only the final calibrations have to be done with the vehicle.
Abstract: This paper presents a practical scheme that can be used for allocating the transmission loss to generators and loads. In this scheme first the share of a generator or load on the current through a branch is determined using Z-bus modified matrix. Then the current components are decomposed and the branch loss allocation is obtained. A motivation of proposed scheme is to improve the results of Z-bus method and to reach more fair allocation. The proposed scheme has been implemented and tested on several networks. To achieve practical and applicable results, the proposed scheme is simulated and compared on the transmission network (400kv) of Khorasan region in Iran and the 14-bus standard IEEE network. The results show that the proposed scheme is comprehensive and fair to allocating the energy losses of a power market to its participants.
Abstract: Innovation is more important in any companies.
However, it is not easy to measure the innovation performance
correctly. Patent is one of measuring index nowadays. This paper
wants to purpose an approach for valuing patents based on market
reaction to patent infringement litigations. The interesting
phenomenon is found from collection of patent infringement litigation
events. That is if any patent litigation event occurs the stock value will
follow changing. The plaintiffs- stock value raises some percentage.
According to this interesting phenomenon, the relationship between
patent litigation and stock value is tested and verified. And then, the
stock value variation is used to deduce the infringed patents- value.
The purpose of this study is providing another concept model to
evaluate the infringed patents. This study can provide a decision assist
system to help drafting patent litigation strategy and determine the
technology value
Abstract: QoS Routing aims to find paths between senders and
receivers satisfying the QoS requirements of the application which
efficiently using the network resources and underlying routing
algorithm to be able to find low-cost paths that satisfy given QoS
constraints. The problem of finding least-cost routing is known to be
NP-hard or complete and some algorithms have been proposed to
find a near optimal solution. But these heuristics or algorithms either
impose relationships among the link metrics to reduce the complexity
of the problem which may limit the general applicability of the
heuristic, or are too costly in terms of execution time to be applicable
to large networks. In this paper, we concentrate an algorithm that
finds a near-optimal solution fast and we named this algorithm as
optimized Delay Constrained Routing (ODCR), which uses an
adaptive path weight function together with an additional constraint
imposed on the path cost, to restrict search space and hence ODCR
finds near optimal solution in much quicker time.
Abstract: Maximal Ratio Combining (MRC) is considered the most complex combining technique as it requires channel coefficients estimation. It results in the lowest bit error rate (BER) compared to all other combining techniques. However the BER starts to deteriorate as errors are introduced in the channel coefficients estimation. A novel combining technique, termed Generalized Maximal Ratio Combining (GMRC) with a polynomial kernel, yields an identical BER as MRC with perfect channel estimation and a lower BER in the presence of channel estimation errors. We show that GMRC outperforms the optimal MRC scheme in general and we hereinafter introduce it to the scientific community as a new “supraoptimal" algorithm. Since diversity combining is especially effective in small femto- and pico-cells, internet-associated wireless peripheral systems are to benefit most from GMRC. As a result, many spinoff applications can be made to IP-based 4th generation networks.
Abstract: In this paper a new fast simplification method is presented. Such method realizes Karnough map with large number of variables. In order to accelerate the operation of the proposed method, a new approach for fast detection of group of ones is presented. Such approach implemented in the frequency domain. The search operation relies on performing cross correlation in the frequency domain rather than time one. It is proved mathematically and practically that the number of computation steps required for the presented method is less than that needed by conventional cross correlation. Simulation results using MATLAB confirm the theoretical computations. Furthermore, a powerful solution for realization of complex functions is given. The simplified functions are implemented by using a new desigen for neural networks. Neural networks are used because they are fault tolerance and as a result they can recognize signals even with noise or distortion. This is very useful for logic functions used in data and computer communications. Moreover, the implemented functions are realized with minimum amount of components. This is done by using modular neural nets (MNNs) that divide the input space into several homogenous regions. Such approach is applied to implement XOR function, 16 logic functions on one bit level, and 2-bit digital multiplier. Compared to previous non- modular designs, a clear reduction in the order of computations and hardware requirements is achieved.
Abstract: IEEE has designed 802.11i protocol to address the
security issues in wireless local area networks. Formal analysis is
important to ensure that the protocols work properly without having
to resort to tedious testing and debugging which can only show the
presence of errors, never their absence. In this paper, we present
the formal verification of an abstract protocol model of 802.11i.
We translate the 802.11i protocol into the Strand Space Model and
then prove the authentication property of the resulting model using
the Strand Space formalism. The intruder in our model is imbued
with powerful capabilities and repercussions to possible attacks are
evaluated. Our analysis proves that the authentication of 802.11i is
not compromised in the presented model. We further demonstrate
how changes in our model will yield a successful man-in-the-middle
attack.
Abstract: In the artificial intelligence field, knowledge
representation and reasoning are important areas for intelligent
systems, especially knowledge base systems and expert systems.
Knowledge representation Methods has an important role in
designing the systems. There have been many models for knowledge
such as semantic networks, conceptual graphs, and neural networks.
These models are useful tools to design intelligent systems. However,
they are not suitable to represent knowledge in the domains of reality
applications. In this paper, new models for knowledge representation
called computational networks will be presented. They have been
used in designing some knowledge base systems in education for
solving problems such as the system that supports studying
knowledge and solving analytic geometry problems, the program for
studying and solving problems in Plane Geometry, the program for
solving problems about alternating current in physics.
Abstract: This paper address the network reliability optimization
problem in the optical access network design for the 3G cellular
systems. We presents a novel 0-1 integer programming model for
designing optical access network topologies comprised of multi-rings
with common-edge in order to guarantee always-on services. The
results show that the proposed model yields access network
topologies with the optimal reliablity and satisfies both network cost
limitations and traffic demand requirements.
Abstract: One of the most important applications of
wireless sensor networks is data collection. This paper
proposes as efficient approach for data collection in wireless
sensor networks by introducing Member Forward List. This list
includes the nodes with highest priority for forwarding the data.
When a node fails or dies, this list is used to select the next node
with higher priority. The benefit of this node is that it prevents
the algorithm from repeating when a node fails or dies. The
results show that Member Forward List decreases power
consumption and latency in wireless sensor networks.