Abstract: Reducing the risk of information leaks is one of
the most important functions of identity management systems. To
achieve this purpose, Dey et al. have already proposed an account
management method for a federated login system using a blind
signature scheme. In order to ensure account anonymity for the
authentication provider, referred to as an IDP (identity provider),
a blind signature scheme is utilized to generate an authentication
token on an authentication service and the token is sent to an IDP.
However, there is a problem with the proposed system. Malicious
users can establish multiple accounts on an IDP by requesting such
accounts. As a measure to solve this problem, in this paper, the
authors propose an account checking method that is performed before
account generation.
Abstract: This paper is to develop a fuzzy net present value (FNPV) method by taking vague cash flow and imprecise required rate of return into account for evaluating the value of the Build-Operate-Transfer (BOT) sport facilities. In order to clearly manifest a more realistic capital budgeting model based on the classical net present value (NPV) method, some uncertain financial elements in NPV formula will be fuzzified as triangular fuzzy numbers. Through the conscientious manipulation of fuzzy set theory, we will find that the proposed FNPV model is a more explicit extension of classical (crisp) model and could be more practicable for the financial managers to capture the essence of capital budgeting of sport facilities than non-fuzzy model.
Abstract: Palestinian cities face the challenges of land scarcity,
high population growth rates, rapid urbanization, uneven
development and territorial fragmentation. Due to geopolitical
constrains and the absence of an effective Palestinian planning
institution, urban development in Palestinian cities has not followed
any discernable planning scheme. This has led to a number of
internal contradictions in the structure of cities, and adversely
affected land use, the provision of urban services, and the quality of
the living environment.
This paper explores these challenges, and the potential that exists
for introducing a more sustainable urban development pattern in
Palestinian cities. It assesses alternative development approaches
with a particular focus on sustainable development, promoting ecodevelopment
imperatives, limiting random urbanization, and meeting
present and future challenges, including fulfilling the needs of the
people and conserving the scarce land and limited natural resources.
This paper concludes by offering conceptual proposals and guidelines
for promoting sustainable physical development in Palestinian cities.
Abstract: In the recent past Learning Classifier Systems have
been successfully used for data mining. Learning Classifier System
(LCS) is basically a machine learning technique which combines
evolutionary computing, reinforcement learning, supervised or
unsupervised learning and heuristics to produce adaptive systems. A
LCS learns by interacting with an environment from which it
receives feedback in the form of numerical reward. Learning is
achieved by trying to maximize the amount of reward received. All
LCSs models more or less, comprise four main components; a finite
population of condition–action rules, called classifiers; the
performance component, which governs the interaction with the
environment; the credit assignment component, which distributes the
reward received from the environment to the classifiers accountable
for the rewards obtained; the discovery component, which is
responsible for discovering better rules and improving existing ones
through a genetic algorithm. The concatenate of the production rules
in the LCS form the genotype, and therefore the GA should operate
on a population of classifier systems. This approach is known as the
'Pittsburgh' Classifier Systems. Other LCS that perform their GA at
the rule level within a population are known as 'Mitchigan' Classifier
Systems. The most predominant representation of the discovered
knowledge is the standard production rules (PRs) in the form of IF P
THEN D. The PRs, however, are unable to handle exceptions and do
not exhibit variable precision. The Censored Production Rules
(CPRs), an extension of PRs, were proposed by Michalski and
Winston that exhibit variable precision and supports an efficient
mechanism for handling exceptions. A CPR is an augmented
production rule of the form: IF P THEN D UNLESS C, where
Censor C is an exception to the rule. Such rules are employed in
situations, in which conditional statement IF P THEN D holds
frequently and the assertion C holds rarely. By using a rule of this
type we are free to ignore the exception conditions, when the
resources needed to establish its presence are tight or there is simply
no information available as to whether it holds or not. Thus, the IF P
THEN D part of CPR expresses important information, while the
UNLESS C part acts only as a switch and changes the polarity of D
to ~D. In this paper Pittsburgh style LCSs approach is used for
automated discovery of CPRs. An appropriate encoding scheme is
suggested to represent a chromosome consisting of fixed size set of
CPRs. Suitable genetic operators are designed for the set of CPRs
and individual CPRs and also appropriate fitness function is proposed
that incorporates basic constraints on CPR. Experimental results are
presented to demonstrate the performance of the proposed learning
classifier system.
Abstract: In this paper, the effect of atmospheric turbulence on
bit error probability in free-space optical CDMA scheme with
Sequence Inverse Keyed (SIK) optical correlator receiver is analyzed.
Here Intensity Modulation scheme is considered for transmission.
The turbulence induced fading is described by the newly introduced
gamma-gamma pdf[1] as a tractable mathematical model for
atmospheric turbulence. Results are evaluated with Gold and Kasami
code & it is shown that Gold sequence can be used for more
efficient transmission than Kasami sequence in an atmospheric
turbulence channel.
Abstract: Sliding mode control with a fuzzy boundary layer is presented to hydraulic position control problem in this paper. A nonlinear hydraulic servomechanism which has an asymmetric cylinder is modeled and simulated first, then the proposed control scheme is applied to this model versus the conventional sliding mode control. Simulation results proved that the chattering free position control is achieved by tuning the fuzzy scaling factors properly.
Abstract: In this paper, to resolve the problem of existing
schemes, an alternative fast handover Proxy Mobile IPv6 (PMIPv6)
scheme using the IEEE 802.21 Media Independent Handover (MIH)
function is proposed for heterogeneous wireless networks. The proposed
scheme comes to support fast handover for the mobile node
(MN) irrespective of the presence or absence of MIH functionality
as well as L3 mobility functionality, whereas the MN in existing
schemes has to implement MIH functionality. That is, the proposed
scheme does not require the MN to be involved in MIH related signaling
required for handover procedure. The base station (BS) with MIH
functionality performs handover on behalf of the MN. Therefore, the
proposed scheme can reduce burden and power consumption of MNs
with limited resource and battery power since MNs are not required
to be involved for the handover procedure. In addition, the proposed
scheme can reduce considerably traffic overhead over wireless links
between MN and BS since signaling messages are reduced.
Abstract: IETF defines mobility support in IPv6, i.e. MIPv6, to
allow nodes to remain reachable while moving around in the IPv6
internet. When a node moves and visits a foreign network, it is still
reachable through the indirect packet forwarding from its home
network. This triangular routing feature provides node mobility but
increases the communication latency between nodes. This deficiency
can be overcome by using a Binding Update (BU) scheme, which let
nodes keep up-to-date IP addresses and communicate with each other
through direct IP routing. To further protect the security of BU, a
Return Routability (RR) procedure was developed. However, it has
been found that RR procedure is vulnerable to many attacks. In this
paper, we will propose a lightweight RR procedure based on
geometric computing. In consideration of the inherent limitation of
computing resources in mobile node, the proposed scheme is
developed to minimize the cost of computations and to eliminate the
overhead of state maintenance during binding updates. Compared with
other CGA-based BU schemes, our scheme is more efficient and
doesn-t need nonce tables in nodes.
Abstract: In this paper the behavior of fixed series compensated
extra high voltage transmission lines during faults is simulated. Many
over-voltage protection schemes for series capacitors are limited in
terms of size and performance, and are easily affected by
environmental conditions. While the need for more compact and
environmentally robust equipment is required. use of series
capacitors for compensating part of the inductive reactance of long
transmission lines increases the power transmission capacity.
Emphasis is given on the impact of modern capacitor protection
techniques (MOV protection). The simulation study is performed
using MATLAB/SIMULINK®and results are given for a three phase
and a single phase to ground fault.
Abstract: The group mutual exclusion (GME) problem is a
variant of the mutual exclusion problem. In the present paper a
token-based group mutual exclusion algorithm, capable of handling
transient faults, is proposed. The algorithm uses the concept of
dynamic request sets. A time out mechanism is used to detect the
token loss; also, a distributed scheme is used to regenerate the token.
The worst case message complexity of the algorithm is n+1. The
maximum concurrency and forum switch complexity of the
algorithm are n and min (n, m) respectively, where n is the number of
processes and m is the number of groups. The algorithm also satisfies
another desirable property called smooth admission. The scheme can
also be adapted to handle the extended group mutual exclusion
problem.
Abstract: This paper introduces an adiabatic register file based
on two-phase CPAL (Complementary Pass-Transistor Adiabatic
Logic circuits) with power-gating scheme, which can operate on a
single-phase power clock. A 32×32 single-phase adiabatic register file
with power-gating scheme has been implemented with TSMC 0.18μm
CMOS technology. All the circuits except for the storage cells employ
two-phase CPAL circuits, and the storage cell is based on the
conventional memory one. The two-phase non-overlap power-clock
generator with power-gating scheme is used to supply the proposed
adiabatic register file. Full-custom layouts are drawn. The energy and
functional simulations have been performed using the net-list
extracted from their layouts. Compared with the traditional static
CMOS register file, HSPICE simulations show that the proposed
adiabatic register file can work very well, and it attains about 73%
energy savings at 100 MHz.
Abstract: In this paper, we investigate the study of techniques
for scheduling users for resource allocation in the case of multiple
input and multiple output (MIMO) packet transmission systems. In
these systems, transmit antennas are assigned to one user or
dynamically to different users using spatial multiplexing. The
allocation of all transmit antennas to one user cannot take full
advantages of multi-user diversity. Therefore, we developed the case
when resources are allocated dynamically. At each time slot users
have to feed back their channel information on an uplink feedback
channel. Channel information considered available in the schedulers
is the zero forcing (ZF) post detection signal to interference plus
noise ratio. Our analysis study concerns the round robin and the
opportunistic schemes.
In this paper, we present an overview and a complete capacity
analysis of these schemes. The main results in our study are to give
an analytical form of system capacity using the ZF receiver at the
user terminal. Simulations have been carried out to validate all
proposed analytical solutions and to compare the performance of
these schemes.
Abstract: In this paper we will consider the most known ratios
control schemes ((L/D, V/B),(L/D,V/F), Ryskamp-s, and
(D/(L+D),V/B)) for binary distillation column and we compare them
in the basis of interactions and disturbance propagation. The models
for these configurations are deuced using mathematical
transformations taking the energy balance structure (LV) as a base
model. The dynamic relative magnitude criterion (DRMC) is used to
assess the interactions. The results show that the introduction of
ratios in controlling the column tends to minimize the degree of
interactions between the loops.
Abstract: Graph decompositions are vital in the study of combinatorial design theory. Given two graphs G and H, an H-decomposition of G is a partition of the edge set of G into disjoint isomorphic copies of H. An n-sun is a cycle Cn with an edge terminating in a vertex of degree one attached to each vertex. In this paper we have proved that the complete graph of order 2n, K2n can be decomposed into n-2 n-suns, a Hamilton cycle and a perfect matching, when n is even and for odd case, the decomposition is n-1 n-suns and a perfect matching. For an odd order complete graph K2n+1, delete the star subgraph K1, 2n and the resultant graph K2n is decomposed as in the case of even order. The method of building n-suns uses Walecki's construction for the Hamilton decomposition of complete graphs. A spanning tree decomposition of even order complete graphs is also discussed using the labeling scheme of n-sun decomposition. A complete bipartite graph Kn, n can be decomposed into n/2 n-suns when n/2 is even. When n/2 is odd, Kn, n can be decomposed into (n-2)/2 n-suns and a Hamilton cycle.
Abstract: Quality evaluation of an image is an important task in image processing applications. In case of image compression, quality of decompressed image is also the criterion for evaluation of given coding scheme. In the process of compression -decompression various artifacts such as blocking artifacts, blur artifact, ringing or edge artifact are observed. However quantification of these artifacts is a difficult task. We propose here novel method to quantify blur and ringing artifact in an image.
Abstract: This paper proposes the stochastic tabu search (STS)
for improving the measurement scheme for power system state
estimation. If the original measured scheme is not observable, the
additional measurements with minimum number of measurements are
added into the system by STS so that there is no critical measurement
pair. The random bit flipping and bit exchanging perturbations are
used for generating the neighborhood solutions in STS. The Pδ
observable concept is used to determine the network observability.
Test results of 10 bus, IEEE 14 and 30 bus systems are shown that
STS can improve the original measured scheme to be observable
without critical measurement pair. Moreover, the results of STS are
superior to deterministic tabu search (DTS) in terms of the best
solution hit.
Abstract: Ad hoc networks are characterized by multi-hop
wireless connectivity and frequently changing network topology.
Forming security association among a group of nodes in ad-hoc
networks is more challenging than in conventional networks due to the
lack of central authority, i.e. fixed infrastructure. With that view in
mind, group key management plays an important building block of
any secure group communication. The main contribution of this paper
is a low complexity key management scheme that is suitable for fully
self-organized ad-hoc networks. The protocol is also password
authenticated, making it resilient against active attacks. Unlike other
existing key agreement protocols, ours make no assumption about the
structure of the underlying wireless network, making it suitable for
“truly ad-hoc" networks. Finally, we will analyze our protocol to show
the computation and communication burden on individual nodes for
key establishment.
Abstract: This paper introduces a technique of distortion
estimation in image watermarking using Genetic Programming (GP).
The distortion is estimated by considering the problem of obtaining a
distorted watermarked signal from the original watermarked signal as
a function regression problem. This function regression problem is
solved using GP, where the original watermarked signal is
considered as an independent variable. GP-based distortion
estimation scheme is checked for Gaussian attack and Jpeg
compression attack. We have used Gaussian attacks of different
strengths by changing the standard deviation. JPEG compression
attack is also varied by adding various distortions. Experimental
results demonstrate that the proposed technique is able to detect the
watermark even in the case of strong distortions and is more robust
against attacks.
Abstract: In this paper, an H1-Galerkin mixed finite element method is discussed for the coupled Burgers equations. The optimal error estimates of the semi-discrete and fully discrete schemes of the coupled Burgers equation are derived.
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.