Abstract: The decisions made by admission control algorithms are
based on the availability of network resources viz. bandwidth, energy,
memory buffers, etc., without degrading the Quality-of-Service (QoS)
requirement of applications that are admitted. In this paper, we
present an energy-aware admission control (EAAC) scheme which
provides admission control for flows in an ad hoc network based
on the knowledge of the present and future residual energy of the
intermediate nodes along the routing path. The aim of EAAC is to
quantify the energy that the new flow will consume so that it can
be decided whether the future residual energy of the nodes along
the routing path can satisfy the energy requirement. In other words,
this energy-aware routing admits a new flow iff any node in the
routing path does not run out of its energy during the transmission
of packets. The future residual energy of a node is predicted using
the Multi-layer Neural Network (MNN) model. Simulation results
shows that the proposed scheme increases the network lifetime. Also
the performance of the MNN model is presented.
Abstract: In this paper, a two factor scheme is proposed to
generate cryptographic keys directly from biometric data, which
unlike passwords, are strongly bound to the user. Hash value of the
reference iris code is used as a cryptographic key and its length
depends only on the hash function, being independent of any other
parameter. The entropy of such keys is 94 bits, which is much higher
than any other comparable system. The most important and distinct
feature of this scheme is that it regenerates the reference iris code by
providing a genuine iris sample and the correct user password. Since
iris codes obtained from two images of the same eye are not exactly
the same, error correcting codes (Hadamard code and Reed-Solomon
code) are used to deal with the variability. The scheme proposed here
can be used to provide keys for a cryptographic system and/or for
user authentication. The performance of this system is evaluated on
two publicly available databases for iris biometrics namely CBS and
ICE databases. The operating point of the system (values of False
Acceptance Rate (FAR) and False Rejection Rate (FRR)) can be set
by properly selecting the error correction capacity (ts) of the Reed-
Solomon codes, e.g., on the ICE database, at ts = 15, FAR is 0.096%
and FRR is 0.76%.
Abstract: Cheating on standardized tests has been a major
concern as it potentially minimizes measurement precision. One
major way to reduce cheating by collusion is to administer multiple
forms of a test. Even with this approach, potential collusion is still
quite large. A Latin-square treatment structure for distributing
multiple forms is proposed to further reduce the colluding potential.
An index to measure the extent of colluding potential is also
proposed. Finally, with a simple algorithm, the various Latin-squares
were explored to find the best structure to keep the colluding
potential to a minimum.
Abstract: In digital signal processing it is important to
approximate multi-dimensional data by the method called rank
reduction, in which we reduce the rank of multi-dimensional data from
higher to lower. For 2-dimennsional data, singular value
decomposition (SVD) is one of the most known rank reduction
techniques. Additional, outer product expansion expanded from SVD
was proposed and implemented for multi-dimensional data, which has
been widely applied to image processing and pattern recognition.
However, the multi-dimensional outer product expansion has behavior
of great computation complex and has not orthogonally between the
expansion terms. Therefore we have proposed an alterative method,
Third-order Orthogonal Tensor Product Expansion short for 3-OTPE.
3-OTPE uses the power method instead of nonlinear optimization
method for decreasing at computing time. At the same time the group
of B. D. Lathauwer proposed Higher-Order SVD (HOSVD) that is
also developed with SVD extensions for multi-dimensional data.
3-OTPE and HOSVD are similarly on the rank reduction of
multi-dimensional data. Using these two methods we can obtain
computation results respectively, some ones are the same while some
ones are slight different. In this paper, we compare 3-OTPE to
HOSVD in accuracy of calculation and computing time of resolution,
and clarify the difference between these two methods.
Abstract: The fuzzy technique is an operator introduced in order
to simulate at a mathematical level the compensatory behavior in
process of decision making or subjective evaluation. The following
paper introduces such operators on hand of computer vision
application.
In this paper a novel method based on fuzzy logic reasoning
strategy is proposed for edge detection in digital images without
determining the threshold value. The proposed approach begins by
segmenting the images into regions using floating 3x3 binary matrix.
The edge pixels are mapped to a range of values distinct from each
other. The robustness of the proposed method results for different
captured images are compared to those obtained with the linear Sobel
operator. It is gave a permanent effect in the lines smoothness and
straightness for the straight lines and good roundness for the curved
lines. In the same time the corners get sharper and can be defined
easily.
Abstract: Computer networks are essential part in computerbased
information systems. The performance of these networks has a
great influence on the whole information system. Measuring the
usability criteria and customers satisfaction on small computer
network is very important. In this article, an effective approach for
measuring the usability of business network in an information system
is introduced. The usability process for networking provides us with a
flexible and a cost-effective way to assess the usability of a network
and its products. In addition, the proposed approach can be used to
certify network product usability late in the development cycle.
Furthermore, it can be used to help in developing usable interfaces
very early in the cycle and to give a way to measure, track, and
improve usability. Moreover, a new approach for fast information
processing over computer networks is presented. The entire data are
collected together in a long vector and then tested as a one input
pattern. Proposed fast time delay neural networks (FTDNNs) use
cross correlation in the frequency domain between the tested data and
the input weights of neural networks. It is proved mathematically and
practically that the number of computation steps required for the
presented time delay neural networks is less than that needed by
conventional time delay neural networks (CTDNNs). Simulation
results using MATLAB confirm the theoretical computations.
Abstract: Unified Modeling Language (UML) is a standard
language for modeling of a system. UML is used to visually specify
the structure and behavior of a system. The system requirements are
captured and then converted into UML specification. UML
specification uses a set of rules and notations, and diagrams to
specify the system requirements. In this paper, we present a tool for
developing the UML specification. The tool will ease the use of the
notations and diagrams for UML specification as well as increase the
understanding and familiarity of the UML specification. The tool will
also be able to check the conformance of the diagrams against each
other for basic compliance of UML specification.
Abstract: This paper presents a new heuristic algorithm useful
for long-term planning of survivable WDM networks. A multi-period
model is formulated that combines network topology design and
capacity expansion. The ability to determine network expansion
schedules of this type becomes increasingly important to the
telecommunications industry and to its customers. The solution
technique consists of a Genetic Algorithm that allows generating
several network alternatives for each time period simultaneously and
shortest-path techniques to deduce from these alternatives a least-cost
network expansion plan over all time periods. The multi-period
planning approach is illustrated on a realistic network example.
Extensive simulations on a wide range of problem instances are
carried out to assess the cost savings that can be expected by
choosing a multi-period planning approach instead of an iterative
network expansion design method.
Abstract: In recent years, everything is trending toward digitalization
and with the rapid development of the Internet technologies,
digital media needs to be transmitted conveniently over the network.
Attacks, misuse or unauthorized access of information is of great
concern today which makes the protection of documents through
digital media a priority problem. This urges us to devise new data
hiding techniques to protect and secure the data of vital significance.
In this respect, steganography often comes to the fore as a tool for
hiding information. Steganography is a process that involves hiding
a message in an appropriate carrier like image or audio. It is of
Greek origin and means "covered or hidden writing". The goal of
steganography is covert communication. Here the carrier can be sent
to a receiver without any one except the authenticated receiver only
knows existence of the information. Considerable amount of work
has been carried out by different researchers on steganography. In this
work the authors propose a novel Steganographic method for hiding
information within the spatial domain of the gray scale image. The
proposed approach works by selecting the embedding pixels using
some mathematical function and then finds the 8 neighborhood of
the each selected pixel and map each bit of the secret message in
each of the neighbor pixel coordinate position in a specified manner.
Before embedding a checking has been done to find out whether the
selected pixel or its neighbor lies at the boundary of the image or not.
This solution is independent of the nature of the data to be hidden
and produces a stego image with minimum degradation.