@INPROCEEDINGS{0000:Boost,
TITLE="Boost Chopper Circuit for Low Power Wind Turbine Driven {PM} Synchronous
Generator",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="184-188",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="A Wind Generator System that employs a boost
chopper and a permanent magnet synchronous generator is
studied. By replacing the main circuit of generator and boost
chopper with the equivalent circuit, the power and DC output
voltage are obtained as a function of duty ratio of the boost
chopper and generator rotational frequency. Maximum power
from the generator characterized by the load and optimum
duty ratio is theoretically determined. Results of MATLAB/
SIMULINK simulation are presented."
}

@INPROCEEDINGS{A.F.0705:Autonomic,
AUTHOR="Antonio {A.F. Loureiro}",
TITLE="Autonomic Wireless Networks in Smart Environments",
BOOKTITLE="Fifth Annual Conference on Communication Networks and Services Research",
ADDRESS="Fredericton, New Brunswick, Canada",
DAYS=14,
MONTH=may,
YEAR=2007,
ABSTRACT="Autonomic Computing defines computational systems that are able to manage
themselves with none or minimal human intervention. The concepts related to
autonomic computing in computer networks leads to the development of a new
concept: autonomic networks. This kind of network is able to perform
self-management of its elements and data communication links. Smart
environments represent the next evolutionary development step in building,
utilities, industrial, home, shipboard, and transportation systems
automation. In those scenarios, wireless transmission is complex and often
problematic, where a number of conditions such as multipath interference,
transmission collisions, and obstructions adversely impact the reliability,
scalability and
data throughput of high bandwidth communications. This tutorial will
present a perspective on autonomic wireless networks to be employed in the
scenarios described above. The goal is to present the main characteristics
of protocols, applications and services for those scenarios and how
autonomic wireless networks can help in the design process."
}

@INPROCEEDINGS{A.Ra0000:Comparison,
AUTHOR="Mohamad Kamal {A. Rahim}",
TITLE="Comparison between Straight and U shape of Ultra Wide Band Microstrip
Antenna using Log Periodic Technique",
BOOKTITLE="International Conference on Ultra-Wideband 2007",
ADDRESS="Marina Mandarin Singapore, Singapore",
DAYS=24,
MONTH=sep,
YEAR=2007,
ABSTRACT="Abstract  — This paper described the design, simulation and fabrication
of the Ultra Wideband (UWB) antennas  for straight and U shape using
seventeen elements log-periodic (LP) technique. The antennas have been
modeled using microstrip lines and S parameter data from individual single
element. The data is extracted from the momentum simulation and combined
with the microstrip transmission line. The properties of antennas such as
bandwidth return loss and radiation pattern have been investigated and
compared between simulation and measurements. A bandwidth for UWB antenna
is achieved using seventeen element arrays. The cross-polar isolation of
the UWB antenna is in the range 8 to 20 dB for straight shape."
}

@INPROCEEDINGS{A0704:Link,
AUTHOR="Antony Franklin A and Venkataramana Badarla and Siva Ram Murthy",
TITLE="A Link Layer Adaptive Pacing Scheme for Improving Performance of Wireless
Mesh Networks",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="In this paper, we propose an adaptive pacing scheme at the Link layer for
IEEE 802.11 based multihop wireless networks. Our objective is to improve
the performance of higher layer protocols without any modifications to
them. Our adaptive pacing scheme estimates the four hop transmission delay
in the network path without incurring any additional overheads, and
accordingly paces the packets to reduce the contention in the network. We
implemented the Link layer adaptive pacing scheme in ns-2.29 network
simulator and extensively studied its performance for both User Datagram
Protocol (UDP) and Transmission Control Protocol (TCP) traffic in different
network scenarios. In all the cases our scheme shows a significant
improvement in the performance of both UDP and TCP."
}

@INPROCEEDINGS{A0711:Node,
AUTHOR="Antony Franklin A and Siva Ram Murthy",
TITLE="Node Placement Algorithm for Deployment of {Two-Tier} Wireless Mesh
Networks",
BOOKTITLE="IEEE Globecom 2007 Wireless Networking Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="In the deployment of Wireless Mesh Networks (WMNs) the placement of Mesh
Nodes (MNs) is an important design issue. The performance of WMNs is
greatly affected by the location of the MNs. As it is difficult to place
the MNs in a regular pattern in the real deployment, finding the optimal
locations in the deployment environment is of much interest for the service
providers. For a given possible locations for the MNs and the user density
in the deployment environment, we aim to find the locations of the MNs to
be used that maximizes the coverage and the connectivity of the network
together. Due to high computational complexity of the exhaustive searching
algorithm, an efficient local searching algorithm is proposed. Numerical
results show that, the local search algorithm can give close to optimal
performance with much lower time complexity than exhaustive searching."
}

@INPROCEEDINGS{Aabe0000:Arabic,
AUTHOR="Mohammed Aabed and Sameh Awaideh and Abdul-Rahman Elshafei and Adnan Gutub",
TITLE="Arabic Diacritics Based Steganography",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="756-759",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Arabic text; data hiding; diacritic symbols; text steganography; text
watermarking",
ABSTRACT="New steganography methods are being proposed to embed secret information
into text cover media in order to search for new possibilities employing
languages other than English. This paper utilizes the advantages of
diacritics in Arabic to implement text steganography. Diacritics - or
Harakat - in Arabic are used to represent vowel sounds and can be found in
many formal and religious documents. The proposed approach uses eight
different diacritical symbols in Arabic to hide binary bits in the original
cover media. The embedded data are then extracted by reading the diacritics
from the document and translating them back to binary."
}

@INPROCEEDINGS{Aad0710:E,
AUTHOR="Imad Aad and Philipp Hofmann and Luis Loyola and Farhan Riaz and Joerg
Widmer",
TITLE="{E-MAC:} {Self-Organizing} 802.11-Compatible {MAC} with Elastic Realtime
Scheduling",
BOOKTITLE="The Fourth IEEE International Conference on Mobile Ad-hoc and Sensor
Systems",
ADDRESS="Pisa, Italy",
DAYS=8,
MONTH=oct,
YEAR=2007,
ABSTRACT="To overcome the lack of strict QoS guarantees in existing hotspots, in this
paper we present a system for real-time traffic support in 802.11 networks
that works in either infrastructure or ad-hoc mode. The proposed mechanism,
called elastic MAC (E-MAC) protocol, helps stations with real-time traffic
to organize and establish a transmission schedule in a distributed manner,
while coexisting with standard 802.11 stations. This distributed scheduling
guarantees very short delays and a minimum reserved data rate for real-time
stations, while protecting best-effort
802.11 traffic from starvation. Another feature of our mechanism is
time-slot reuse, which improves the network efficiency by allowing other
real-time stations to take over unused slots (e.g., in case of using voice
codecs with silence suppression). We evaluate the performance of our system
using a testbed implementation, ns-2 simulations and a mathematical model,
and show how it outperforms other QoS schemes (e.g., 802.11e) in terms of
throughput, delay, and jitter."
}

@INPROCEEDINGS{Aalo0711:Call,
AUTHOR="Valentine Aalo and Suwat Pattaramalai and George Efthymoglou",
TITLE="Call Completion Probability with Weibull Distributed Call Holding Time and
Cell Dwell Time",
BOOKTITLE="IEEE Globecom 2007 Performance Modeling, QoS and Reliability Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="In this paper, we derive a simple closed-form expression for the call
completion probability in a wireless cellular network under Weibull
distributed cell dwell time and call holding time.  The derived expression
is given in terms of the Meijer-G function which can be easily evaluated by
commonly available computer software such as Mathematica.  Numerical
results are presented to show that the call completion probability is very
sensitive to changes in the shape parameter of the Weibull distribution
when its value is less than unity (heavy tail region)."
}

@INPROCEEDINGS{Aalt0706:Impact,
AUTHOR="Samuli Aalto and Pasi Lassila",
TITLE="Impact of size-based scheduling on flow level performance in wireless
downlink data channels",
BOOKTITLE="20th International Teletraffic Congress",
ADDRESS="Ottawa, Ontario, Canada",
DAYS=17,
MONTH=jun,
YEAR=2007,
ABSTRACT="We analyze the impact of size-based scheduling on the flow 
level performance of elastic traffic in wireless downlink 
data channels. The impact is assessed by comparing the flow 
level delay of the simple RR scheduler to two optimized 
non-anticipating schedulers (FB and $\mathrm{FB}^\circ$) and 
SRPT. The optimized distance-aware scheduler $\mathrm{FB}^\circ$ 
is derived by applying the Gittins index approach. Our results 
show that for Pareto-type file size distributions, the size-based 
information is more important than the location information. 
Additionally, FB not only decreases the overall mean delay, but 
it can also decrease considerably the mean delay of all users 
independently of their location."
}

@INPROCEEDINGS{Aalt0706:Mean,
AUTHOR="Samuli Aalto and Urtzi Ayesta",
TITLE="Mean delay optimization for the {M/G/1} queue with Pareto type service
times",
BOOKTITLE="SIGMETRICS 2007--International Conference on Measurement and Modeling of
Computer Systems",
ADDRESS="San Diego, California, USA",
DAYS=14,
MONTH=jun,
YEAR=2007,
ABSTRACT="We consider mean delay optimization in an M/G/1 queue 
for some Pareto type service time distributions. If 
the Pareto distribution is defined in such a way 
that all positive values are allowed, then the 
distribution has a decreasing hazard rate, which 
implies that the FB discipline is optimal. However, 
if it is defined starting from a strictly positive 
value, the hazard rate is no longer monotonous. In 
this paper we prove that, not only for this but for 
a whole class of service time distributions, the 
optimal discipline is a combination of FCFS and FB 
disciplines, which gives full priority to the jobs 
with attained service less than some fixed threshold 
$\theta^*$. These priority jobs are served in the 
FCFS manner. If there are no jobs with attained 
service less than $\theta^*$, full priority is given 
to the job with least amount of attained service. In 
our proof, we utilize the index approach developed 
by Gittins and Klimov."
}

@INPROCEEDINGS{Aazh0000:Cooperative,
AUTHOR="Behnaam Aazhang",
TITLE="Cooperative and Opportunistic Communication",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
DAYS=3,
MONTH=dec,
YEAR=2007
}

@INPROCEEDINGS{Abad0703:Model,
AUTHOR="Andrea {Abad Ramirez} and Augusto {Velasquez Mendez} and Zoila {Ramos
Rodriguez}",
TITLE="Model To Apply {AMR} Systems In Energy Electromechanical Meter Using Low
Voltage Distribution Lines {(117} {VAC} {–} 60 Hz.) In Colombia.",
BOOKTITLE="International Symposium on Power Line Communications and Its Applications",
ADDRESS="Pisa, Italy, Italy",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="This paper presents a model proposed by GITUN Group (Telecommunications
Research Group of the National University of Colombia) about using
Colombian low voltage distribution lines as data transmission channel for
Automatic Meter Reading (AMR) applications. Residential energy
electromechanical meter data reading and transmission are studied, also
electrical noise measurement and simulations are developed for Colombian
low voltage distribution lines (117VAC Phase-Neutral– 60Hz) which affects
data transmission using PLC in AMR. Laboratory essays permit to find the
communications channel model, which is simulated using MATLAB to determine
technical possibility of the use of AMR system via PLC in Colombia.
Finally, involved PLC regulations in Colombia are shown as the same as
technical and economical benefits."
}

@INPROCEEDINGS{Abad0706:More,
AUTHOR="Arash Abadpour and Attahiru Alfa and Anthony Soong",
TITLE="A More Realistic Approach to {Information--Theoretic} Sum Capacity of
Reverse Link {CDMA} Systems in a Single Cell",
BOOKTITLE="ICC 2007 Communications QoS, Reliability and Performance Modelling
Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="The information--theoretic approach to maximizing the aggregate capacity of
the reverse link in a CDMA system looks for the best pattern of
transmission power of the stations. In this framework, where the
transmission from each station is noise to all others, extra constraints
should be considered to lead to a practically applicable solution. The
previous research has suggested a minimum guaranteed quality of service
plus bounds on individual transmissions and the aggregate one as
constraints. However, extensive analysis has revealed that these two
constraints are not enough to produce a solution which can be realized in
an actual system. Basically, lack of any constraint including the maximum
capacity of each station or dealing with the unfairness of the whole system
has been found to be responsible for the partial solution in which all
stations except for one are left to transmit at the lowest possible
bandwidth, while the selected station is served with a non-realistic
bandwidth of couple of hundreds more. In this paper we devise a maximum
capacity constraint and give an algorithm for solving the problem. Then,
empirical evidence are analyzed to show that the system actually becomes
more balanced and practical when the new constraint is added."
}

@INPROCEEDINGS{Abal0707:Extending,
AUTHOR="Carlos Abalde and Víctor {Gulías} and Laura Castro",
TITLE="Extending the {VoDKA} Architecture with {P2P} Aggregated Content Management",
BOOKTITLE="12th IEEE Symposium on Computers and Communications",
ADDRESS="Aveiro, Portugal",
DAYS=1,
MONTH=jul,
YEAR=2007,
ABSTRACT="This paper presents our results building a decentralized and structured P2P
video content distribution network, developed as an extension of an
existing on-demand streaming server. It has been designed to improve
streaming server capacity, without any infrastructure upgrade, when it must
deal with big LAN-networks and highly-correlated server access patterns. A
coordination algorithm build on top of a distributed hash table is
presented, and its integration inside the streaming server architecture is
explained. Experimental results show that the design is an appropriate
approach for video content distribution with interesting scalability and
availability properties."
}

@INPROCEEDINGS{Abat0708:GPU,
AUTHOR="Andrea Abate and Michele Nappi and Stefano Ricciardi and Gabriele Sabatino",
TITLE="{GPU} Accelerated {3D} Face Registration / Recognition",
BOOKTITLE="The 2nd IAPR / IEEE International Conference on Biometrics",
ADDRESS="Seoul, Korea",
DAYS=27,
MONTH=aug,
YEAR=2007,
KEYWORDS="3D face;  normal map; GPU",
ABSTRACT="This paper proposes a novel approach to both registration and recognition
of face in three dimensions. The presented method is based on normal map
metric to perform either the alignment of captured face to a reference
template or the comparison between any two faces in a gallery. As the
metric involved is highly suited to be computed via vector processor, we
propose an implementation of the whole framework on last generation
graphics boards, to exploit the potential of GPUs applied to large scale
biometric identification applications. This work shows how the use of
affordable consumer grade hardware could allow ultra rapid comparison
between face descriptors through their highly specialized architecture. The
approach also addresses facial expression changes by means of a subject
specific weighting masks. We include preliminary results of experiments
conducted on a proprietary gallery and on a subset of FRGC database."
}

@INPROCEEDINGS{Abat0709:Face,
AUTHOR="Andrea Abate and Michele Nappi and Maria {De Marsico} and Daniel Riccio",
TITLE="Face, Ear and Fingerprint: Designing Multibiometric Architectures",
BOOKTITLE="International Conference on Image Analysis and Processing 2007",
ADDRESS="Modena, Italy",
DAYS=10,
MONTH=sep,
YEAR=2007,
ABSTRACT="The number of biometries as well as the number of publications about
biometrics have noticeably grown in the last ten years. However, it was not
possible yet to identify a bodily or behavioral feature able by itself to
satisfy the acceptability and reliability constraints imposed by real
applications.
In this work we analyze the combination of the three different biometries
face, ear and fingerprint using both a new multimodal schema, namely the
N-Cross Testing Protocol, and a fast hierarchical architecture.
Experimental results in the final part of our work provide a positive
feedback."
}

@INPROCEEDINGS{Abay0710:ZigBee,
AUTHOR="Tanya Vanessa Abaya and Christina Lei Manio and Marjo Kristina Marasigan
and Maria Theresa {De Leon} and Marc Rosales and John Richard Hizon",
TITLE="{ZigBee-Compliant} {Fully-Integrated} {Delta-Sigma} {Analog-to-Digital}
Converters Implemented in 0.25um {CMOS} Process",
BOOKTITLE="7th International Symposium on Communications and Information Technologies",
ADDRESS="Sydney, Australia",
DAYS=16,
MONTH=oct,
YEAR=2007,
ABSTRACT="Analog-to-digital converter designs are considerably becoming critical
parts of wireless receiver improvement studies.  Delta-sigma ADCs, which
offer high-resolution, low cost and low power benefits are tested for
aptness for the ZigBee standard - an emerging standard developed to address
the needs of wireless sensing and control based on IEEE 802.15.4. Eight
fully integrated delta-sigma analog-to-digital converters in 0.25m
digital CMOS process are presented.  The following analog modulator
topologies are used: single-ended continuous-time (SECT), single-ended
discrete-time (SEDT), fully-differential continuous-time (FDCT), and
fully-differential discrete-time (FDDT). For each topology, two digital
filters are designed. The converters employ a first-order single-bit
delta-sigma conversion.  Specifications matched for suitability in ZigBee
receivers include data rate, effective number of bits, oversampling ratio,
and power consumption."
}

@INPROCEEDINGS{AbAz0000:Particle,
AUTHOR="Nor Azlina {Ab Aziz} and Ammar wahab mohemmed Mohemmed and 0,1,2 Sagar",
TITLE="Particle Swarm Optimization and Voronoi Diagram for Wireless Sensor
Networks Coverage Optimization",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="The focus of this study is the sensor coverage problem. It is a crucial
issue in Wireless Sensor Networks (WSN), where a high coverage rate will
ensure a high quality of service of the WSN. This paper proposes a new
algorithm to optimize sensor coverage using Particle Swarm Optimization
(PSO). PSO is
chosen to find the optimal position of the sensors that gives the best
coverage and Voronoi diagram is used to evaluate the fitness of the
solution."
}

@INPROCEEDINGS{Abba0000:Multimodality,
AUTHOR="Jehanzeb Abbas and Charlie Dagli and Thomas Huang",
TITLE="A Multimodality Framework for Creating {Speaker/Non-Speaker} Profile",
BOOKTITLE="2007 IEEE International Workshop on Semantic Learning Applications in
Multimedia",
ADDRESS="Minneapolis, USA",
DAYS=18,
MONTH=jun,
YEAR=2007,
ABSTRACT="We propose a complete solution to full modality person-profiling for
speakers and submodality person-profiling for non-speakers in real-world
videos. This is a step towards building an elaborate database of face, name
and voice correspondence for speakers appearing in the news videos. In
addition we are also interested in only name and face correspondence
database for non-speakers who appear during voice-overs. We use an
unsupervised technique for creating
a speaker identification database and a unique primary feature matching and
parallel line matching algorithm for creating a non-speaker identification
database. We tested our approach on real world data and the results show
good
performance for news videos. It can be incorporated as part of a larger
multimedia news video analysis system or a multimedia search system for
efficient news video retrieval and browsing."
}

@INPROCEEDINGS{Abba0701:Improvement,
AUTHOR="Ash Mohammad Abbas and Tehzeeb Ahmed Abbasi",
TITLE="An Improvement Over Incremental Approach for Guaranteed Identification of
Multiple {Node-Disjoint} Paths in Mobile Ad hoc Networks",
BOOKTITLE="The Second International Conference on COMmunication Systems softWAre and
middlewaRE",
ADDRESS="Banglaore, India",
DAYS=7,
MONTH=jan,
YEAR=2007,
ABSTRACT="Identifying multiple node-disjoint paths between a given source and a
destination is a challenging task in mobile ad hoc networks. One cannot
guarantee to identify multiple node-disjoint paths in a single route
discovery. However, one can guarantee to identify multiple node-disjoint
paths in multiple attempts in an incremental fashion. In this paper, we
present an improved version of a protocol that is guaranteed to discover
multiple node-disjoint paths between a given source and a destination. We
have analytically shown that our version requires less number of route
discoveries than that required by existing protocol."
}

@INPROCEEDINGS{Abba0708:Alleviating,
AUTHOR="Ash Mohammad Abbas",
TITLE="Alleviating Path Correlation Using Directional Antenna in {Node-Disjoint}
Multipath Routing for Mobile Ad hoc Networks",
BOOKTITLE="IWCMC 2007 Mobile Computing Symposium",
ADDRESS="Honolulu, Hawaii, USA, USA",
DAYS=12,
MONTH=aug,
YEAR=2007,
ABSTRACT="Identifying independent node-disjoint paths is a challenging task in an ad
hoc environment. In this paper, we study the impact of employing
directional antennas on
node-disjoint multipath routing in mobile ad hoc networks. We focus on
routing overheads and correlation among node-disjoint multipaths between a
given pair of
nodes. We have proposed schemes to mitigate routing overheads and path
correlation using semi-directional and directional antennas. We have shown
analytically that routing overheads as well as path correlation are reduced
using proposed schemes which utilize directional antennas in comparison to
existing schemes where
omni-directional antennas are used."
}

@INPROCEEDINGS{Abba0710:Distributed,
AUTHOR="Ameer Abbasi and Kemal Akkaya and Mohamed Younis",
TITLE="A Distributed Connectivity Restoration Algorithm in Wireless Sensor and
Actor Networks",
BOOKTITLE="The 32nd Annual IEEE Conference on Local Computer Networks (LCN)",
ADDRESS="Dublin, Ireland",
DAYS=15,
MONTH=oct,
YEAR=2007,
ABSTRACT="There has been an increased interest in applications of wireless sensor and
actor networks (WSANs) in recent years. In such applications, a set of
mobile actor nodes are deployed in addition to sensors in order to collect
sensors’ data and perform specific tasks in response to detected
events/objects. In most scenarios actors have to respond collectively which
requires an inter-actor coordination. Therefore, maintaining a connected
inter-actor network is crucial to the effectiveness of WSANs. However,
WSANs often operate unattended in harsh environments where actors can
easily fail or get damaged. Due to such failures an actor will be unable to
communicate with its neighbors which may lead to partitioning the
inter-actor network.  In this paper we present DARA; a Distributed Actor
Recovery Algorithm, which opts to efficiently restore the connectivity of
the inter-actor network that has been affected by the failure of an actor.
The idea is to identify the least set of actors that should be repositioned
in order to establish connectivity among disjoint network partitions. DARA
strives to localize the scope of the recovery process and minimize the
movement overhead imposed on the involved actors. The effectiveness of DARA
is validated through simulation experiments."
}

@INPROCEEDINGS{Abba0712:Iranian,
AUTHOR="Melika {Abbasian Nik} and Azam Bastanfard and Mohammad Dehshibi",
TITLE="Iranian Face Database With Age, Pose and Expression",
BOOKTITLE="International Conference on Machine Vision 2007",
ADDRESS="Islamabad, Pakistan",
DAYS=28,
MONTH=dec,
YEAR=2007,
KEYWORDS="face image database; age classification; feature detection algorithm",
ABSTRACT="This paper introduces a database of over 3,600 color images which we
collected from 616 different human faces. It includes facial images of
people between ages 2-85. Face images of persons with different ages is
needed to generate a reliable age classification algorithm. Four different
poses, two different expressions, and one image with glasses were taken if
the subjects were interested. Information such as career, kind of skin,
fingerprint, and cosmetic points (surgical points, fracture or laceration
on face) is taken from participants. The background was a white frame and
the only illumination was the daylight. We named this database the Iranian
Face Database (IFDB). 
To evaluate the database the experimental result of a new feature detection
algorithm is reported."
}

@INPROCEEDINGS{Abba0712:Route,
AUTHOR="Ash Mohammad Abbas",
TITLE="Route Establishment Overheads in a Slotted and {Cross-Layer}
{Node-Disjoint} Multipath Routing Protocol for Mobile Ad hoc Networks",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="40-44",
DAYS=3,
MONTH=dec,
YEAR=2007,
KEYWORDS="Routing, ad hoc networks, cross-layer, path diminution, node-disjoint
paths.",
ABSTRACT="An ad hoc network is a multi-hop wireless network with no stationary
infrastructure. As opposed to ``single hop''(i.e. cellular) networks, which
require fixed base stations interconnected by a wired backbone, multi-hop
networks have neither a fixed base station nor a wired backbone. The main
application for mobile wireless ad hoc networks is rapid deployment and
dynamic reconfiguration in
scenarios where wire-line network is either not available or is not cost
effective e.g. battle field communications, search and rescue ad hoc
networking, etc. In such cases, multi-hop wireless networks provide a
feasible and cost effective
means for communication among many mobile hosts.


        In such situations, providing a source with more than one path can
be quite useful, because if one path fails due to movement of an
intermediate node, the communication is continued through the alternate
paths. When the routes are disjoint, reliability can be maximized in the
sense that instead of sending a packet through one path, it can be sent
through available disjoint paths. Therefore, in case of link failures the
packet is more likely to be received successfully at the destination. If
links are assumed sufficiently reliable, the available throughput is
increased if number of packets to be sent are distributed along available
disjoint paths.  Also, the traffic conditions along the different paths are
least likely to be correlated i.e. a single node failure may not disrupt
all the available paths. Since every fresh route discovery inherently has
control overheads, therefore, one can minimize frequent route discoveries
for a communicating pair until all the paths are exhausted if the paths are
disjoint.


In one of our previous works, we proposed a protocol
called node-disjoint multipath ad hoc routing (NDMA), for computing
node-disjoint multiple paths between a given source and a destination. It
was based on the fact that at any intermediate node only first copy of RREQ
is forwarded to its immediate neighbors if it does not have a route to the
destination. All later copies of the same RREQ are discarded. Ofcourse, the
overheads in this protocol are low but there was a higher probability that
no alternate node-disjoint path is
returned even if it exists in the network. The reason being that later
RREQs were restricted to participate in disjointness computation at the
destination because of immature discard. In our another previous work, we
described the disjoint path diminution problem and proposed the solutions
to overcome it. Also, we have computed probability of diminution using
neighbor level graphs. The disjoint path diminution problem needs to be
explored from the point of view of trade-off between overheads and
probability of getting disjoint paths.

The design of a routing protocol to identify multiple node-disjoint paths
between a given source and a destination is a challenging task in an ad hoc
environment. In this paper, we propose a slotted and cross-layer routing
protocol to be used to identify node-disjoint paths in a mobile ad hoc
network. We propose schemes for forwarding copies of a route request at an
intermediate node. Our schemes are slotted and utilize the cross-layer
properties of an ad hoc network.  We observe that as we go for higher
probability of getting all the disjoint paths, the computational and
communication overheads are also increased. Our schemes may provide a
trade-off between the overheads incurred in identifying node-disjoint paths
and the probability of disjoint path diminution."
}

@INPROCEEDINGS{Abbo0711:Effect,
AUTHOR="Amin Abbosh and David Thiel",
TITLE="Effect of Mutual Coupling on the Energy Requirement of {MIMO-Based}
Wireless Sensor Networks",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="436-439",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Energy efficiency; multiple-input multiple-output (MIMO); wireless sensors
networks",
ABSTRACT="A theoretical model was developed to estimate effect of the mutual coupling
on the energy requirement of a multiple-input multiple-output (MIMO) based
wireless sensor network (WSN).  Clustered channel modeling with Rician
fading distribution is assumed to include the effect of the line-of-sight
(LOS) ray paths. The effect of propagation environments is included in the
analysis by assuming a two-slope path loss model. The effect of knowing the
channel state information (CSI) in the MIMO system ( ) is also included in
the analysis. It is shown that the presence of mutual coupling between
elements of MIMO array decreases the energy required by the MIMO based WSN.
Simulation results also show that it is possible to use a compact circular
antenna array with a quarter wavelength diameter to build a   based WSN
that requires almost constant energy for applications that cover a range
from few meters up to around 100m."
}

@INPROCEEDINGS{Abbo0711:Energy,
AUTHOR="Amin Abbosh and David Thiel",
TITLE="Energy Efficient Wireless Sensor Networks",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="440-443",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Energy efficiency; multiple-input multiple-output (MIMO); wireless sensors
networks",
ABSTRACT="A theoretical model is presented to estimate the energy requirements of
MIMO systems when used in wireless sensor networks (WSN) assuming clustered
channel modeling, with Rician distribution and cochannel interference. The
effect of different propagation environments is simulated. Simulation
results show that the SISO can only be useful with short range systems
(less than 20m). The MIMO system with channel state information has the
best performance for applications that require a range more than 20m and
under different propagation conditions. The results presented in this paper
indicate that increasing the number of antennas for MIMO systems has a
negative effect on the performance under free space propagation, whereas it
has a positive effect, especially for MIMO with CSI, under “severe”
conditions."
}

@INPROCEEDINGS{Abbo0711:Method,
AUTHOR="Amin Abbosh",
TITLE="Design Method for {UWB} Planar Antenna with Subband Rejection Capability",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1163-1166",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Planar antenna; subband rejection; ultra wideband antenna",
ABSTRACT="A simple guideline for designing a compact planar antenna is presented. The
objective of the design is to have a bandwidth covering the range from 3.1
GHz till 10.6 GHz, assuming a 10 dB return loss reference. The proposed
antenna has the capability to reject any undesired subband within the whole
bandwidth of its operation by incorporating a tuning slot within the
radiating structure. Assuming GML1032 dielectric substrate with relative
permittivity of 3.2, the designed antenna features a compact size of 27 mm
× 27 mm. Results of simulation show that the designed antenna has a 10-dB
return loss bandwidth from 2.8 GHz to more than 11 GHz excluding any
undesired subband, such as the 4.9-5.9GHz band assigned for IEEE802.11a and
HIPERLAN/2. The antenna has near omnidirectional characteristics, and its
radiation efficiency is higher than 90 \% over the whole pass-band."
}

@INPROCEEDINGS{Abbo0711:UWB,
AUTHOR="Amin Abbosh and Marek E. Bialkowski",
TITLE="Design of {UWB} Planar Antenna for Microwave Imaging Systems",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="193-196",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Microwave imaging, planar antenna, ultra wideband",
ABSTRACT="A simple design method for an ultra wideband planar monopole antenna is
presented. The antenna is to be used in a microwave imaging system for
medical applications. The designed antenna has a compact size, with
dimension of 28 mm by 28 mm. The measured 10 dB return loss bandwidth of
this antenna element is from 3.2 GHz to more than 15 GHz. Its radiation
efficiency is higher than 90\% over the whole 10 dB return loss bandwidth.
The measured time domain response of the antenna indicates the capability
of the designed antenna to support distortionless pulse transmission with a
high fidelity factor for any angle of orientation."
}

@INPROCEEDINGS{Abch0711:FPGA,
AUTHOR="Antoine Abche and Aldo Maalouf and Rafic Ayoubi and Elie Karam and Abdul
Alameddine",
TITLE="An {FPGA} Implementation of a High Resolution Phase Shift Beamformer",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1319-1322",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Ultrasound Imaging, Beamforming, Cordic, FPGA, Xilinx",
ABSTRACT="In this work, an implementation of a high resolution phase shift beamformer
on FPGA is presented. This implementation is based on the Angle Recording
(AR) CORDIC algorithm and uses a fine precision 2-path floating point adder
for an accurate computation of the phase shifts.  A pipelined architecture
is used to decrease the chip area requirements and to increase the
throughput of the beamformer. The proposed approach is quantitatively
evaluated by performing a comparison with am approach based on the Xilinx
core generator modules. The results show that the proposed implementation
outperforms the latter technique in terms of speed and area. The
implemented beamformer could be used for acquiring 2D and 3D ultrasound
medical images in real time."
}

@INPROCEEDINGS{Abda0706:Power,
AUTHOR="Alaa Eddien Abdallah and Thomas Fevens and Jaroslav Opatrny",
TITLE="{Power-Aware} {3D} Position-based Routing",
BOOKTITLE="ICC 2007 Wireless Adhoc and Sensor Networks Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="A crucial problem in ad hoc networks is finding an
efficient and correct route between a source and a destination;
however for many networks, a more important problem is
providing an energy efficient route because of, for example, the
limited battery life of the wireless nodes. Most previous routing
protocols make the routing decision without taking into account
the energy budget of the nodes. In addition, when using a fixed
transmission power, nodes may waste power by transmitting with
more power than is needed for correct reception. In positionbased
routing algorithms, the nodes use the geographical position
of the nodes to make the routing decisions. In this paper
we present several localized power-aware 3D position-based
routing algorithms that increase the life-time of the network by
maximizing the life time of the nodes. These new algorithms use
the idea of replacing the constant transmission power of the node
with an adjusted transmission power during two stages – first
a lower power while discovering the neighboring nodes, and, if
needed, a second higher transmission power during the routing
process. We evaluate our algorithms and compare their power
savings with the current power-aware routing algorithms. The
simulation results show a significant improvement in the energy
saving (up to 50\%)."
}

@INPROCEEDINGS{AbdA0711:Accurate,
AUTHOR="Raed Abd-Alhameed and Peter Excell",
TITLE="Accurate Power Loss Computation of closely spaced radiating Wire Elements
for Mobile Phone {MIMO} application",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="412-415",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Mobile phone, wire antennas, Power loss",
ABSTRACT="A moment-method formulation was developed using two
geometrically-orthogonal basis functions to represent the total non-uniform
surface current distribution over wire radiating element. Extended basis
functions were used to reliably treat the discontinuity of the current at
the free ends. A surface kernel was used all over the antenna structure. It
was found that the axially-directed component of the current distribution
around the surface of the wire was highly non-uniform and that there was
also a significant circumferential current flow due to inter-turn
capacitance, both effects that are overlooked by standard filamentary
current representations using an extended kernel. The impedance
characteristic showed good agreement with the predictions of a standard
filamentary-current code, in the case of applied uniform excitation along
the local axis of the wire. However, the power loss computations produce
significantly different results."
}

@INPROCEEDINGS{Abde0000:Entwicklung,
AUTHOR="Anja Abdel-Haq and Ute Morgenstern",
TITLE="Entwicklung eines Bausteins der multimedialen Lern- und Trainingssoftware
für die Biomedizintechnik: {KARDIOS} {–} {EKG} und Herzschrittmacher",
BOOKTITLE="BMT 2007",
ADDRESS="Aachen, Germany",
DAYS=26,
MONTH=sep,
YEAR=2007,
KEYWORDS="inf-l+t; imp-akt",
ABSTRACT="Die Lern- und Trainingssoftware KARDIOS wird als weiterer Softwarebaustein
für die Ausbildung in der Bio-medizintechnik (BMT) konzipiert. Die
vorgesehene Nutzergruppe sind Studenten und Praktiker. Lerngegenstand sind
die Themengebiete Elektrophysiologie und –pathophysiologie des Herzens,
EKG und Herzschrittmacher-technik. Als Entwicklungswerkzeug dient die
Autorensoftware IDEA 3.24. Der eigentlichen Programmierung von KARDIOS ging
eine umfangreiche Konzeptionsphase voraus, in der ein mediendidaktischer
Leitfaden und ein Mediendesign-Leitfaden erstellt wurden. Im Ergebnis wird
eine didaktisch aufbereitete Lernsoftware erwartet, die eine
Qualitätsprüfung mit guten Ergebnissen besteht."
}

@INPROCEEDINGS{Abde0000:Fault,
AUTHOR="Sherif Abdelwahed and Nagarajan Kandasamy",
TITLE="{Fault-Adaptive} Control for Robust Performance Management of Computing
Systems",
BOOKTITLE="4th IEEE International Conference on Autonomic Computing",
ADDRESS="Jacksonville, Florida, USA",
DAYS=11,
MONTH=jun,
YEAR=2007,
ABSTRACT="This paper introduces a fault-adaptive control approach for the robust and
reliable performance management of computing systems. Complex computing
systems typically require capabilities for accommodating unavoidable faults
that can occur during the system operation. Fault accommodation involves
the detection and isolation of faults, and then taking appropriate control
actions to mitigate the fault effects and maintain control. This requires
the integration of fault diagnostics with control in a carefully designed
feedback loop. This paper discusses a generic framework for building
fault-adaptive control systems using a model-based approach, with special
emphasis on the modeling schemes that describe different aspects of the
system at different levels of abstraction and granularity. The concepts are
illustrated by a fault adaptive control of a signal detection system and a
power management system."
}

@INPROCEEDINGS{Abde0000:Web,
AUTHOR="Mohammed Abdelhakim and Shervin Shirmohammadi",
TITLE="A {Web-Based} Group Decision Support System for the Selection and
Evaluation of Educational Multimedia",
BOOKTITLE="ACM Workshop on Educational Multimedia and Multimedia Education 2007",
ADDRESS="Augsburg, Germany",
DAYS=28,
MONTH=sep,
YEAR=2007,
KEYWORDS="Educational Multimedia; Instructional Design; Knowledge Management;
Web-Based Group Decision Support System.",
ABSTRACT="Multimedia is now a relatively mature field, having advanced over more than
two decades. The combination of text, images, videos, animations, etc. in
both presentational and conversational form is now a standard part of most
computer applications, web-based and stand-alone alike. As such,
Educational Multimedia (EMM) can be a great tool to improve teaching and
learning. However, EMM selection and evaluation for higher education is a
complex and interdisciplinary problem characterised by uncertainty,
dynamics, explicit and implicit knowledge and constraints, and involvement
of different stakeholders. In this work, we use a domain-based web oriented
Group Decision Support System (GDSS) for the selection and continuous
evaluation of EMM for educational providers. We investigate the viability
of developing and validating a web-based GDSS, integrated with knowledge
management (KM) and instructional design, as a support tool to overcome the
difficulties in the selection and evaluation of EMM. The proposed solution
manages and supports the six phases of planning, intelligence, design,
choice, implementation, and evaluation. In addition to design and
implementation, performance evaluation is also presented using data
collected from experts, instructors, and EMM producers. The results reveal
that the proposed solution can successfully help educational consumers in
selecting and evaluating EMM."
}

@INPROCEEDINGS{Abde0705:Security,
AUTHOR="Chehri Abdellah and Paul Fortier and Pierre-Martin Tardif",
TITLE="Security Monitoring using Wireless Sensor Networks",
BOOKTITLE="Fifth Annual Conference on Communication Networks and Services Research",
ADDRESS="Fredericton, New Brunswick, Canada",
DAYS=14,
MONTH=may,
YEAR=2007,
ABSTRACT="The underground environment is a harsh and hazardous workspace for plant
and personnel. It is damp, dusty and hot, there is a risk of roof and rock
falls and the atmosphere can be potentially explosive. Recent incidents are
a reminder of how crucial safety is in mining. The increasing
miniaturization of RF devices and micro-electromechanical systems (MEMS)
and the advances in wireless
technologies, has generated a great deal of research interest in the area
of wireless sensor networks (WSNs). Sensor networks provide a promising
infrastructure for gathering information about parameters of the physical
world.
Such networks have many applications in military and civilian environments.
In this paper, a new wireless sensor networks architecture is introduced
for surveillance and security monitoring underground mines and confined
areas."
}

@INPROCEEDINGS{Abde0706:Dynamic,
AUTHOR="Ahmed Younus and Wissam {Abdel Samad} and Thomas Stockhammer and Waqar Zia
and Wen Xu",
TITLE="Dynamic Interactive Multimedia Scenes in Mobile Broadcast Environments",
BOOKTITLE="ICC 2007 Network Services and Operation Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Dynamic Interactive Multimedia Scenes (DIMS) is the latest 3GPP multimedia
standard aiming at the development and delivery of rich media services over
mobile networks, specifically for the constrained devices. DIMS is a
concept
that encompasses a declarative format for audio-visual scene
representation, as a composition of rich media objects with specific
properties and behaviour. This paper focuses on the issues related to the
delivery of Interactive TV like services with DIMS in mobile broadcast
environments. We have investigated
the system design parameters which would ensure better QoS for the
subscribers. With the simulation results, we have setup guidelines for the
selection of Application Layer FEC parameters, Video Coding settings and
optimum Base Station Transmit Power. These guidelines assist in improving
the overall Rich Media experience offered to the end-users."
}

@INPROCEEDINGS{Abde0706:Eigen,
AUTHOR="Chehri Abdellah and Paul Fortier and Pierre-Martin Tardif",
TITLE="Eigen-analysis of {UWB} channel in underground mines based on information
theoretic criteria",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Underground mine galleries can be considered as complex transmission lines
where multipath, attenuation, reflection, diffraction and scattering
effects are dominants. However, some companies have started to deploy
modern wireless system networks in mine galleries with the objective of
increasing safety and productivity. In the last decade, ultra-wideband
(UWB) technology has gained much interest for its application to wireless
communications. This paper reports on experimental results of UWB channel
propagation in underground mine. An eigen-decomposition and subspace-based
statistical signal processing on the autocorrelation matrix of the channel
impulse responses is used. We apply information theoretic criteria to
estimate the number of significant eigenvalues. This result is then used to
calculate the RMS delay spread of the channel."
}

@INPROCEEDINGS{Abde0706:Generalized,
AUTHOR="Khaled Abdel-Ghaffar and Jos Weber",
TITLE="Generalized Iterative Decoding for Linear Block Codes on the Binary Erasure
Channel",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="The generalized iterative decoding concept offers attractive performance
versus complexity trade-off opportunities in the spectrum between
traditional iterative decoding and optimal decoding for linear block codes
over the binary erasure channel. In each iteration, a system of equations
is solved. The maximum number of equations to be solved in one iteration is
called the order of the decoder. In case the order is just one, the
generalized iterative decoder reduces to the traditional iterative decoder.
On the other hand, if the order is set to the redundancy of the codes, the
generalized iterative decoder gives the same performance as the optimal
decoder. Varying the order between these two extremes allows for a better
match to the system specifications. In this paper, we consider aspects
regarding the implementation of generalized iterative decoding and we
determine the minimum order (as a function of the girth) that can
potentially lead to improvement over traditional iterative decoding."
}

@INPROCEEDINGS{Abde0706:Linear,
AUTHOR="Khaled Abdel-Ghaffar and Hendrik Ferreira and Ling Cheng",
TITLE="On Linear and Cyclic Codes for Correcting Deletions",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="The use of linear and cyclic codes for correcting synchronization errors
is investigated. These codes are typically required to have the capability
to correct substitution errors, which are the most common type of errors in
most
communication and storage systems. However, synchronization errors,
associated with the deletion and insertion of symbols, can also occur and
may
cause severe performance degradation unless the coding scheme possesses
the
capability to recover from such errors. We show that linear codes of rate
greater than 1/2 cannot correct deletion or insertion errors. Although
cyclic codes, except for repetition codes, cannot correct deletion or
insertion errors, we show that adding one extra symbol to the codewords
of a binary or nonbinary cyclic code of rate at most 1/3 or 1/2,
respectively,
yields a code capable of correcting a single deletion or insertion."
}

@INPROCEEDINGS{Abde0706:Speech,
AUTHOR="Nemat {Abdel Kader}",
TITLE="Speech Coding Applied on Wireless Channels",
BOOKTITLE="Mosharaka International Conference on Communication Systems and Circuits",
ADDRESS="Amman, Jordan",
DAYS=7,
MONTH=jun,
YEAR=2007,
ABSTRACT="Speech coders have assumed considerable importance in communication systems
as their performance determines the quality of the recovered speech and the
storage of the system. In wireless communication systems, bandwidth is a
precious commodity, and service provides are continuously facing the
challenge of accommodating more users within a limited allocated bandwidth.
Low bit rate speech coding offers a way to meet this challenge. The lower
the bit-rate, the more speech channels can be compressed within a given
bandwidth. A number of techniques were developed and standardized as speech
coding algorithms. The Mixed Excitation Linear Prediction (MELP) is a low
bit rate coding technique developed originally for wireless communication.
In this paper, some compression techniques are used to compress the MELP
parameters in the time domain without degradation of the speech quality.
The proposed speech coder achieves good quality over a wide range of sound
effects and human voices. At around 2 Kbps, it performs as well as the
standard MELP (2.4 Kbps). The proposed speech coder is applied to the
Binary Phase Shift Keying (BPSK) technique with slow fading and fast fading
channels at different signal to noise ratios. Mean opinion score tests"
}

@INPROCEEDINGS{Abde0707:Kiph,
AUTHOR="Humberto Abdelnur and Radu State and Olivier Festor",
TITLE="Kiph: A stateful {SIP} Fuzzer",
BOOKTITLE="Principles, Systems and Applications of IP Telecommunications",
ADDRESS="New York, New York, USA",
PAGES="44-53",
DAYS=19,
MONTH=jul,
YEAR=2007,
ABSTRACT="With the recent evolution in the VoIP market, where more and more  devices
and services are being pushed on a very promising market, assuring their 
security becomes crucial. Among the most dangerous threats to VoIP,
failures and bugs in the software implementation  will still rank high on
the list of vulnerabilities. In this paper we address the issue of
detecting such vulnerabilities using a stateful fuzzer. We  describe an
automated attack approach capable to self-improve and to track the state
context of a target device. We implemented our approach and were able to
discover vulnerabilities in market leading and well known equipments and
software."
}

@INPROCEEDINGS{Abde0709:Practical,
AUTHOR="Sherif Abdelwahed and Gabor Karsai",
TITLE="Practical Considerations in Systems Diagnosis using Timed Failure
Propagation Graph Models",
BOOKTITLE="AUTOTESTCON 2007",
ADDRESS="Baltimore, MD, USA",
PAGES="129-136",
DAYS=17,
MONTH=sep,
YEAR=2007,
KEYWORDS="consistency-based diagnosis; practical applications;",
ABSTRACT="The ability to react rapidly to unpredictable and dramatic changes in both
the system and the environment is a key requirement for future engineering
systems and applications.  Successful operation of these systems relies on
the existence of efficient mechanisms to detect, isolate and correct
problems early, and re-allocate resources where they are most needed.
Model-based diagnoses technologies help address these issues by enabling
run-time analysis and providing effective means to identify operation
problems at early stages. 
In earlier work we developed a qualitative condition-based diagnosis
approach based on the timed failure propagation graph (TFPG) model aimed to
handle a general class of practical sensor-based systems efficiently. The
timed failure propagation graph is a directed graph where the nodes
represent failure modes, which are fault causes; discrepancies, which are
off-nominal conditions that are the effects of failure modes. Discrepancies
can either be monitored (attached to alarms) or silent, and depending on
the way it is affected by the incoming signals it is further classified as
either “AND” or “OR” discrepancy. Attributed edges between nodes in
the graph represent causality, and the attributes specify the likelihood
and temporality of causation. The TFPG representation has been extended
recently so that nodes and edges can be present or absent under particular
conditions. The new representation supports the definition of these
conditions in terms of the operation modes of the system. In whole, a TFPG
represents temporal progressions (paths) of effects that are caused by
failure modes, some of which are observed.
Diagnosis of TFPG models is conducted online based on incremental
non-monotonic reasoning that is robust with respect to various forms of
alarm failures. The diagnostic system operates on the TFPG model and
characterizes the fault status (actual current state) of the system by
hypothesizing about the faults in components and sensors based on the
signals received from the sensors and the current mode of the system. The
diagnoser uses the TFPG model and the timed sensor/mode-switching signals
to generate a set of logically valid hypotheses of the current state of the
system. The hypotheses are then ranked according to certain criterion based
on the number of supporting alarms versus the number of inconsistent one.
The set of hypotheses with the highest rank are selected as the most
plausible estimations of the current state of the system. We have developed
and tested a real-time diagnosis tool based on the hybrid failure
propagation graph. 
The diagnoser is implemented as a reactive module that is triggered by
signals from the set of active sensors and well as mode-switching signals.
The diagnoser is triggered whenever the state of a discrepancy is changed
or the system changes mode. The diagnoser responds to input signals by
generating hypotheses. Each hypothesis is an evaluation of the status of a
failure mode. The hypothesis structure contains information about the
corresponding failure mode, the estimated time of failure, and the set of
supporting and inconsistent alarms as conceived based on the failure graph
structure. In addition to generating and updating hypotheses, the diagnoser
also generates a list of false alarms, namely those alarms that could not
be explained by any hypothesis based on the timing and structure of the
failure propagation graph. At the occurrence of every event, the diagnoser
updates the set of hypothesis and the faulty components will be identified.
The diagnoser updates the set of possible hypotheses about the system state
based on the causal and timing consistency between the discrepancies. 
The quality of hypotheses in the TFPG settings can be measured based on two
independent factors; the number of failure modes it identify as active, and
the correspondence with the current physical state of the system. These two
factors are combined together in what we define as the hypothesis rank.
Based on this rank measure, it is easy to see that the rank of any current
hypothesis will either decrease or remain unchanged, immediately after the
occurrence of an observable event (such as mode change or a new alarm).
This is based on the fact that at least one mismatch will occur between the
current physical state (the observed state of all discrepancy nodes) and
any hypothetical state (the state of a discrepancy node according to a
valid hypothesis). The diagnoser will then update the current set of
hypothesis incrementally in a way to improve the current ranking. In other
words, the diagnoser will consider changes to the hypothetical states only
if such changes can increase the current rank of the underlying hypothesis.
In addition changes are restricted so that the changed hypothesis remains
valid.
The original TFPG diagnosis tool was developed for a general class of
engineering applications. Since then major updates has been made to address
the complexity of applications dynamics and the limitations of practical
execution platforms. In this paper we present several practical modeling
and reasoning considerations that have been addressed based on our
experience with avionic system applications. In particular we consider the
following:
•	Handling intermittent faults: The original diagnosis engine assumes
permanent state change for monitored discrepancies. In this setting,
intermittent faults are handled by backtracking when the monitored alarm
changes its state from ON to OFF. This may cause significant overhead for
long-duration intermittent fault. A more effective approach can be used by
identifying potential intermittent alarms (for instance, those with
relatively little support from other alarms) and consider it in both states
(ON/OFF) during the diagnosis process. This will eliminate the need for
backtracking at a minor extra expense in space requirements. The user will
be able to specify which alarms to apply this method for during the
execution.
•	Resource bounded reasoning: Certain aspects of the diagnoses systems
can be tuned to reduce the run-time computational requirements. These
include the max number of hypotheses and the maximum duration of
backtracking. We will investigate the effect of changing these values to
the accuracy and requirements of the diagnosis system such that the
diagnoser can be optimally adjusted for specific time and space
requirements.
•	Model Reduction: In some situations it is possible to generate a
reduced model that is semantically equivalent to a given model. Two main
approaches for reductions will be investigated. The first is based on the
elimination of silent discrepancies. This reduction method will generate a
TFPG model with all monitored discrepancies that is semantically equivalent
to a given TFPG. The other approach will define a set of discrepancies that
are equivalent with respect to failure identification. If such equivalence
can be established then we can replace the model with a semantically
equivalent model with a well defined map between the discrepancies in the
original model and those in the reduced one. We will define the conditions
for the existence of such equivalent relation and develop the underlying
reduction algorithm. In many practical situations, significant decrease in
both time and space requirements can be achieved through model reduction.  

•	Automatic generation of TFPG model: TFPG model is an abstraction of the
system dynamics that focuses on the temporal aspects of failure
propagation. Such abstract dynamics is represented as timed causal
dependencies between discrepancies in the system outputs (measurements). In
many situations the failure propagation graph structure as well as its
temporal characteristics can be inferred from a more detailed physical
model of the system, by simulating the system under various fault
conditions. We proposed to develop a tunable procedure to automate the
development of TFPG models from detailed simulation models.
•	Simulation Engine: The simulation engine help verify the model against
certain test-case scenarios. Such scenarios can either be generated from
simulation runs of the physical system model or automatically generated by
the simulation engine. The simulation engine will provide a set of
user-defined settings to tune the simulation for specific operation
conditions. These setting will include the set of failure modes, possible
number of false and missing alarms, simulation time, and frequency of mode
switching."
}

@INPROCEEDINGS{Abde0711:High,
AUTHOR="Saleh Abdel-hafeez and Ahmad Sawalmeh and Sameer Bataineh",
TITLE="High Performance {AES} Design Using Pipelining Structure Over {GF((24)2)}",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="716-719",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="AES pipeline; FPGA; GF((24)2); Rijndael; S-BOX.",
ABSTRACT="High data throughput AES hardware architecture is proposed by partitioning
the ten rounds into sub-blocks of repeated AES modules.  The blocks are
separated by intermediate buffers providing a complete ten stages of AES
pipeline structure.  In addition, the AES is internally evenly divided to
eleven pipeline stages; such that, the shift rows block is structured to
operate before the ByteSubstitute block.  This proposed swapping operation
has no effect on the AES encryption algorithm; however, it streamlines the
processing of four blocks of data in parallel rather than 16 blocks.  We
evaluate the performance of our new implementation and current
implementations in terms of throughput rate and hardware area for ALTERA
MAX3000A family FPGA EMP3128ATC100-5.  The simulation results show that the
proposed AES has higher throughput rate of about 11.25\% than the general
AES pipeline structure with a saving hardware area of 75\%."
}

@INPROCEEDINGS{Abde0711:Simulation,
AUTHOR="Salah Abdelkrim and Olivier Serres and Jaafar Gaber and Rachid Outbib and
EL -Sayed Houda",
TITLE="Simulation Of The Fuel Cell Thermal Behavior With Unified Parallel C",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="149-152",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Global Nodal Network Model (GNNM), Parallel algorithm, UPC, Thermal
behavior, Fuel Cell, PEMFC.",
ABSTRACT="In this paper, a parallel simulation algorithm to analyze the
thermal behavior of Proton Exchange Membrane Fuel Cell (PEMFC),
using UPC is presented. PEMFCs are considered as a very promising
alternative solution for energy generations in the future for
stationary and mobile applications. The
computation model based on a Global Nodal Network Method
(GNNM) to describe the thermal behavior presents high scalability
and intrinsic parallel characteristics suitable for parallel
implementation.
The objective of this work is to develop a parallel
implementation of GNNM using UPC for
a cluster of processors according to the distributed shared memory
programming paradigm. UPC is an explicit parallel language
that provides the facilities for direct user specification of program
parallelism and control of data distribution and access. Simulations
results shows that computation time to conduct thermal behavior
simulation is drastically reduced compared to sequential
simulations and obtained simulation data are highly accurate and
precise."
}

@INPROCEEDINGS{Abdo0705:Probabilistic,
AUTHOR="Afshin Abdollahi",
TITLE="Probabilistic Decision Diagrams for Exact Probabilistic Analysis",
BOOKTITLE="International Workshop on Logic and Synthesis 2007",
ADDRESS="San Diego, CA, USA",
PAGES="170-176",
DAYS=30,
MONTH=may,
YEAR=2007,
KEYWORDS="Reliability, Probabilistic Analysis, Nano-electronics",
ABSTRACT="A decision diagram based framework is proposed for representing the
probabilistic behavior of circuits with faulty gates. We introduce
Probabilistic decision diagrams (PDD) as an exact computational tool which
along with vast expressive power holds many other useful properties such as
space efficiency (on average) and efficient manipulation algorithms
(polynomial in size.) 
An algorithm for constructing the PDD for a circuit is proposed. Useful
information about probabilistic behavior of the circuit (such as output
error probability for arbitrary input probability distribution) can be
directly extracted from the PDD representation. Experimental results
demonstrate the effectiveness and applicability of the proposed approach."
}

@INPROCEEDINGS{Abdo0712:Dff,
AUTHOR="Seyed Abdollahi",
TITLE="dff-based programmable digital controlled oscillator",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="298-300",
DAYS=3,
MONTH=dec,
YEAR=2007,
KEYWORDS="dco,pll",
ABSTRACT="Abstract

A 1.8GHz, ~ 18 mW (at) 2.4Volt dynamic DFF based multi-channel digitally
controlled crystal oscillator (DCXO) core is designed in a 0.18 micron CMOS
process that can be used for clock recovery, wireless or cable
communications applications. This architecture is suitable for digital
wireless and cable transceivers that use different bands for transmit and
receive modes. As crystal-based-delay (Dynamic DFF) cells control its
dominant propagation delay, we have obtained a reduced phase-noise in
comparison to recently published analog-based DCOs. 

Keywords :DCO, DCXO, DFF, CMOS, PLL

1. Introductions

As the complexity, bandwidth and synchronization requirements of modern
communication systems increase, use of digital techniques is becoming more
versatile and cost effective. New sub-micron MOS integrated circuit
technologies have provided an extended performance for digital high-speed
VLSI circuit. In high performance VLSI systems, the clock is practically
generated by an analog block, namely a phase-locked loop (PLL). Typically
PLLs contain a phase-frequency detector, a charge pump, a loop filter, a
voltage-controlled or current-controlled oscillator, and one or more
frequency dividers. Arguably, the controllable oscillator is the most
important component. A digitally-controlled oscillator (DCO) is the digital
counterpart of a voltage-controlled oscillator (VCO) in digital phase
locked loops (DPLLs) and is a very important building block in modern
communication circuits. DCO is more flexible and usually more robust. 
There are five types of DCOs, four of which analyzed in [1]. The fifth type
is effectively a large variable-delay element constructed using inverters
connected in parallel. Still, the frequency resolution of the oscillator
remains relatively coarse, because, it is limited by the resolution of the
variable-delay element [2]. Current-starved ring oscillator’s frequency
is controllable using transistors having binary-weighted widths. The
frequency can be substantially perturbed when the control bits are updated.
This problem is reduced in this design.
 In this design, DCXO’s transistors have the same widths. As
crystal-based delay cells control its dominant propagation delay, we have
successfully reduced the block phase noise in comparison to analog-based
DCOs, which have been presented in [1-3] and we have reduced our DCO’s
area considerably.

2. Oscillator Architecture and Analysis

Due to DCXO all-digital structure, equal sized transistors,  it can easily
be ported to a CMOS process. The main advantage of this new DCXO is that by
using   switch tuning, path propagation delay lines built in dynamic DFF,
it possesses a simple structure, high resolution and good linearity in each
band of oscillation. By using more control bits, we are able to have better
resolution. 
In this DCXO the main delay cell is a DFF that by selecting its clock
frequency we can control the DCXO free running frequency and increase the
sensitivity and linearity of the DCXO.
 For a controllable operation in higher frequency bands, we need basic
delay cells with small delays or using higher frequency for dynamic DFF
sampling frequency clock. So, this implies a comparable dominant delay that
controls free running frequency of oscillator by DFF controllable internal
propagation delay. Therefore, We have the nonlinearity problem to obtain
higher frequency of operation is using smaller sampling delay by DFF.
However, this will reduce the controllability, so there is a trade-off
between free running frequency selection and nonlinearity. 
 As the DCXO is based on binary weighted ring oscillator decomposition, we
reduced considerable phase-noise and thermal drift in comparison to other
[2-3].  We can consider fine-tuning oscillation mode based on current
controlling of DFF internal delay cells. 
Fig. 1 shows ABDOLLAHI DCXO architecture, this figure consists of two part
of oscillator tuning control signals (for coarse and fine-tuning). We use
internal binary weighted delay cells of the DFF for digital fine-tuning
cells of this DCXO and by using the output’s signal of crystal-based
programmable divider for using as a sampling clock of the dynamic DFF, we
can tune the oscillation free running frequency.
 As shown in the simulation results, by using a lower frequency clock for
DFF, we obtain a better linearity. Notice in equations (1), when we have
great main delay cell ( DDCXO ) created by a DFF sampling clock period (
DTclk ) plus the DFF internal programmable propagation delay  (DIDFF),
DTclk constructs our oscillator center frequency, as fine-tuning control
delay DIDFF is very smaller than DTclk , Based on this idea, we obtain a
very high resolution and linearity as shown in simulation results. Based on
this architecture, we have a multi-channel DCXO. By using a programmable
divider that arbitrarily divides master crystal frequency, we can generate
different clock frequencies for DFF. The clock frequency controls the DFF
incremental sampling delay. 

                           (1)

 
Figure 1: ABDOLLAHI DCXO Architecture that consists of a dynamic DFF with 
programmable propagation delay.

However, ABDOLLAHI architecture reduces the area of oscillator and its
complexity. In fully optimized design the main source of timing jitter is
the inherent thermal and/or shot noise of the active and passive devices
that make up the logic cells. 1/f noise is usually not of practical
importance since the PLL loop filter rejects it. Therefore minimizing the
impacts of thermal and shot noise becomes the key to attaining low timing
jitter.  If we feed the programmable divider input clock by an oven
crystal, As we know, by considering (1), the dependency of DDCXO with  
will be computed as 
                           (2)
As we have supposed , so we have 
                                              (3)
Therefore , the percent of thermal delay variation is approximately equal
                                                          (4)

So, the jitter and thermal drifts of the DCXO are less than those of the
conventional DCOs that discussed in [1].
3. Simulation Results

Simulation results show the output frequency as a function of the control
word at different ratios for R=DTclk/DDCXO. To achieve good linearity and
sensitivity, we have to use a large R. A large R is obtained by using lower
clock frequency for DFF, [1].
By using proper coarse-tuning bits, we can select the desired oscillation
band and we have a narrower bandwidth than conventional DCOs. Also,  we can
control the oscillator in fine-tuning mode for each oscillation band. 

 
Figure 2:  A sample Simulation of DCXO frequency variation by Matlab with
the 7-bit (5 (MSB) fixed coarse-tuning bits and 7 (LSB) fine-tuning bits
for MDCO) control word.

 But, DCXO has 5 (MSB) coarse and 7 (LSB) fine-tuning control bits. In Fig.
2 these coarse-tuning bits are fixed. 
Fig. 6 shows DCXO output waveform and FFT of  its tuned central oscillation
frequency is 1GHz, By using programmable divider we selected 5 GHz clock
frequency for dynamic DFF. By using higher or lower frequency master clock
or variation in coarse-tuning bits, we can increase or decrease DCXO free
running frequency.
 
a)	DCXO output’s Waveform that the frequency changes by changing the
fine-tuning control bit.
 
b)	FFT of  DCXO Sample Output

 
c)	PSD of DCXO 
Figure 6: DCXO output waveform, FFT and PSD; its tuned central oscillation
frequency is 1GHz.

4. Conclusion

Our simulation results indicate that the designed all-digital DCXO has a
proper linear transfer function compared to other mostly nonlinear DCOs. By
using high-speed advanced deep sub-micron process, we can implement high
frequency DCXOs with proper resolution. We can use this DCXO for multi-band
wireless and cable transceivers. DCXO has a more stable oscillation
frequency than conventional DCO and is more robust against physical
variations compared to other DCOs. In a 0.18 micron CMOS process, the DCXO
dissipates approximately 18mW at 2.4volt power supply level with 1.8 GHz
oscillation frequency. This method leads us to consider a wideband
programmable oscillator frequency from 0 Hz to a maximum that is determined
by the programmable divider clock frequency and technology limitation.
Using crystal-based oscillator reduces chip area considerably compared to
the DCOs that discussed in [1-3].  

5. References

[1]	S. R. Abdollahi, S. M. Fakhraie, M. Kamarei “A Crystal-Based
Low-Voltage All-Digital Programmable Ring Oscillator”, Analog Integrated
Circuits and Signal Processing, Kluwer Academic Publishers,  Vol. 43, 
Issue 2, pp. 147 – 157,   May 2005.  

[2]	Jin-Jer Jong and Chen-Yi Lee, “A novel structure for portable
digitally controlled oscillator”, Proceeding of ISCAS2001, Vol. 1, 2001,
pp. 272-275."
}

@INPROCEEDINGS{Abdr0705:Service,
AUTHOR="Atef Abdrabou and Weihua Zhuang",
TITLE="Service Time Approximation in {IEEE} {802.11} Ad Hoc Networks",
BOOKTITLE="INFOCOM 2007 Minisymposium",
ADDRESS="Anchorage, Alaska, USA",
DAYS=6,
MONTH=may,
YEAR=2007,
ABSTRACT="The simplicity and the distributed nature of IEEE 802.11 make it a very
suitable protocol for wireless ad hoc networks. The performance of the IEEE
802.11 distributed coordination function (DCF) and the impact of the
queuing model have been extensively studied in the literature. To the best
of our knowledge, almost all of the proposed queuing models include general
service time distributions that are not easy to handle for statistical
resource allocation in order to provision quality-of-service (QoS). Only
the first and the second order statistics can be easily used, which leads
to inefficient resource utilization. This paper addresses the memoryless
behavior of the service time for IEEE 802.11 saturated ad hoc networks. We
show that the number of packets successfully transmitted by any node over a
time interval follows a general distribution, which is close to a Poisson
distribution with an upper bounded distribution distance. The bound on the
distribution distance is almost constant and is mainly affected by some
system parameters and very slightly by the network scale. We also show that
the service time distribution can be approximated by a geometric
distribution. We illustrate that the usage of discrete-time queuing
analysis (M/Geo/1) near saturation greatly simplifies the queuing problem
and leads to sufficiently accurate results for both the first order
statistics and the probability distribution of the number of packets in the
system. We verify our analysis by computer simulations. The results
indicate a very close match with the analysis."
}

@INPROCEEDINGS{Abdr0711:Link,
AUTHOR="Atef Abdrabou and Weihua Zhuang",
TITLE="A {Link-Layer} Channel Model for {IEEE} {802.11} Ad Hoc Networks",
BOOKTITLE="IEEE Globecom 2007 Ad-hoc and Sensor Networking Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="This paper introduces a novel stochastic link-layer
channel model for IEEE 802.11 ad hoc networks. The model
characterizes the variations of the channel service process in
a non-saturated case using a Markov-modulated Poisson process
(MMPP) model. It offers a tool for distributed statistical resource
allocation in ad hoc networks that combines both efficient
resource utilization and quality-of-service (QoS) provisioning
to a certain probabilistic limit. We also propose a distributed
call admission control algorithm based on the link-layer model.
Simulation results demonstrate that the model can be used
efficiently in allocating resources with stochastic QoS guarantees."
}

@INPROCEEDINGS{Abdu0000:Adaptive,
AUTHOR="Abu Hamed Abdur-Rahim",
TITLE="Adaptive {STATCOM} Control for a Multi-machine Power System",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="Synchronous static compensator (STATCOM) can be used to improve the dynamic
performance of a power system. This article presents an online adaptive
pole-shift method for stabilization of a multi-machine power system.
Considering the speed deviation of the generator to which the STATCOM is
connected as the output and the magnitude of the converter voltage as the
input, an adaptive linear plant model is estimated. The stabilizing control
is derived from a variable pole-shift strategy which moves the poles of the
identified model to the center of unit circle in z-domain. The controller
performance has been tested for various disturbances from a number of
simulation studies on a multi-machine power system. It was observed that
the adaptive algorithm converges very quickly and also provides robust
damping profiles to the under damped power system."
}

@INPROCEEDINGS{Abdu0000:Characteristics,
AUTHOR="Muhammad Abdulla and Robert Simon",
TITLE="Characteristics of Common Mobility Models for Opportunistic Networks",
BOOKTITLE="10th ACM-IEEE International Symposium on Modeling, Analysis and Simulation
of Wireless and Mobile Systems",
ADDRESS="Chania, Crete Island, Greece",
DAYS=22,
MONTH=oct,
YEAR=2007,
KEYWORDS="mobility models; mobility characteristics; opportunistic networks",
ABSTRACT="Understanding mobility characteristics is important for the design and
analysis of routing schemes for mobile ad hoc networks (MANETs). This is
especially true for mobile opportunistic networks where node mobility is
utilized to achieve message delivery. In this paper, we study the
properties of common mobility models. Specifically, we analytically show
that inter-contact times of mobile nodes can be closely approximated as
exponentially distributed in Random Waypoint and Random Direction mobility
models under typical opportunistic network settings. We give analytical
results for the inter-contact rate, the contact time when nodes encounter,
and the effect of beacon message intervals on inter-contact rate. Through
extensive simulation study, we show that our analytical results for
mobility characteristics are accurate."
}

@INPROCEEDINGS{Abdu0000:Dynamic,
AUTHOR="Abu Hamed Abdur-Rahim",
TITLE="Dynamic Performance Improvement of an Isolated Wind Turbine Induction
Generator",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="A dynamic model of a variable speed stand alone wind generation unit is
developed. The steady state as well as the dynamic performance of the wind
system is explored. The necessary conditions for steady operation have been
established. The performance of the system under variable wind gust and
other disturbance conditions has been studied. It has been observed that a
stand alone generator is very vulnerable to transient variations in the
system. This is because of the lack of excitation to the unit. A
stabilizing control scheme through a thyristor controlled variable
capacitance at the generator terminal is suggested for stabilizing the
system. PI controller with optimized gain settings is included in the
control loop. The PI controlled variable capacitance strategy has
demonstrated very good steady state and transient performance of the wind
turbine-generator system."
}

@INPROCEEDINGS{Abdu0000:Effect,
AUTHOR="Jiwa Abdullah",
TITLE="Effect of Mobility on the Performance of {GA-based} {QoS} Routing in Mobile
Ad Hoc Networks",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="The problem of QoS Routing for MANET posses several challenges that must be
addressed. To select the most optimal route from source to destination, one
has to choose from a set of routes with the corresponding quality of
connectivity and
resources. Node mobility demands an exceptional performance of the
protocol. It needs to select the route with the longest residual node-pair
connectivity lifetime simultaneously as other metrics of interest. QOSRGA
(QoS Routing Using GA) was designed to select QoS route based on QoS
metrics such as bandwidth, delay
and node connectivity index (nci). We outlined the GA process and how its
related parameters are chosen. In this paper we specifically depicts the
effect of mobility on performances of QOSRGA protocol."
}

@INPROCEEDINGS{Abdu0000:Multi,
AUTHOR="Azizuddin {Abdul Aziz} and Mohamad Naufal {Mohamad Saad} and Nagi Elfadel",
TITLE="{Multi-User} Detection for the {OCDMA:} Optical Parallel Interference
Cancellation with Optical Limiter",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="187-190",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="Optical Code Division Multiple Access Multiple (OCDMA) is considered as the
strongest candidate for the future ultra-high speed optical networks due to
the huge bandwidth offered by the system. However, Multiple Access
Interference (MAI) which originates from other simultaneous users is the
major reason for the system degradation in the OCDMA systems. MAI increases
with the number of simultaneous users, resulting in higher bit error rate
and limiting the maximum number of simultaneous users in the OCDMA system.
Several techniques have been proposed and discussed in the literature
aiming at lowering the effect of MAI. In particular, Optical Parallel
Interference Cancellation (OPIC) has been extensively studied for the sake
of reducing the MAI. In this paper, an Optical Hard Limiter (OHL) has been
used in front of the receiver side to reduce the effects of MAI. OHL
improves the performance of OPIC system because of its ability to exclude
some combinations of interference patterns from becoming heavily localized
in a smaller part of non-zero positions of signature codes. Moreover, it is
found that high performance of OPIC can be obtained by selecting the
minimum threshold value for the desired user. The results reveal that
optical hard limiter improves the performance of the conventional OPIC
while reducing the effect of MAI."
}

@INPROCEEDINGS{Abdu0000:One,
AUTHOR="Azizuddin {Abdul Aziz} and Nagi Elfadel and Mohamad Naufal {Mohamad Saad}",
TITLE="One Stage Optical Parallel Interference Cancellation for the Optical {CDMA}",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="191-194",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="Abstract-Optical Parallel Interference Cancellation (OPIC) is an effective
technique to reduce the Multiple Access Interference (MAI) in the Optical
Code Division Multiple Access (OCDMA). However, the increasing demands for
hardware in the OPIC system results in more complexity, higher processing
time and cost.  In this paper a new receiver is presented which is based
mainly on the Optical Parallel Interference Cancellation (OPIC) for the
Optical Code Division Multiple Access (OCDMA) local area networks. Optical
Orthogonal Code (OOC) is adopted as a signature sequence for the
performance analysis and a new expression for the error probability is
derived.  The results show that the proposed method is effective to reduce
the hardware complexity, processing time and cost while maintaining the
same bit error probability at the cost of increasing the threshold value."
}

@INPROCEEDINGS{Abdu0703:Recursive,
AUTHOR="Ribhan Zafira {Abdul Rahman}",
TITLE="Recursive Least Square and Fuzzy Modelling Using Genetic Algorithm for
Process Control Application",
BOOKTITLE="Asia Modelling Symposium 2007",
ADDRESS="Phuket, Thailand",
DAYS=27,
MONTH=mar,
YEAR=2007,
ABSTRACT="A technique for the modelling of nonlinear process control using Recursive
Least Square and Takagi-Sugeno Fuzzy System with Genetic Algorithm topology
is described. This paper discusses the identification of parameters of the
fuzzy sets at the antecedent part and linear model at the consequent part
of fuzzy model within an application to process control. The key issues of
finding the best model of the process are described. The result shows that
Takagi-Sugeno fuzzy model with genetic algorithm can minimize the error
between fuzzy output and real data output by optimizing the parameters of
fuzzy model compare with Recursive Least Square"
}

@TECHREPORT{Abdu0706:Delay,
AUTHOR="Salman {Abdul Baset} and Eli Brosh and Vishal Misra and Dan Rubenstein and
Henning Schulzrinne",
TITLE="The {Delay-Friendliness} of {TCP}",
INSTITUTION="Columbia University",
NUMBER="cucs-023-07",
DAYS=30,
MONTH=jun,
YEAR=2007,
ABSTRACT="Traditionally, TCP has been considered unfriendly for real-time
applications. Nonetheless, popular applications such as Skype use TCP due
to the deployment of NATs and firewalls that prevent UDP traffic. This
observation motivated us to study the delay performance of TCP for
real-time media flows using an analytical model and experiments. The
results obtained yield the working region for VoIP and live video streaming
applications and guidelines for delay-friendly TCP settings. Further, our
research indicates that simple application-level schemes, such as packet
splitting and parallel connections, can significantly improve the delay
performance of real-time TCP flows."
}

@INPROCEEDINGS{Abdu0710:Improving,
AUTHOR="Jamal-deen Abdulai and Mohamed Ould-Khaoua and Lewis Mackenzie",
TITLE="Improving Probabilistic Route Discovery in Mobile Ad Hoc Networks",
BOOKTITLE="The Third IEEE International Workshop on Performance and Management of
Wireless and Mobile Networks (P2MNet 2007)",
ADDRESS="Dublin, Ireland",
DAYS=15,
MONTH=oct,
YEAR=2007,
ABSTRACT="Abstract: Conventional on-demand route discovery methods in Mobile Ad hoc
Networks (MANET) employ blind flooding, where a mobile node blindly
rebroadcasts received Route Request (RREQ) packets. This can potentially
lead to high channel contention, causing redundant retransmissions and thus
excessive packet collisions in the network. Such a phenomenon induces what
is known as broadcast storm problem, which has been shown to greatly
increase the network communication overhead and end-to-end delay. In this
paper we show that the deleterious impact of such a problem can be reduced
if measures are taken during the dissemination of RREQ packets. We propose
a new probabilistic method for on-demand route discovery, which is simple
to implement and significantly reduces the dissemination of RREQs. Our
results show that even in moderately dense networks, equipping AODV with
probabilistic route discovery can result in significant performance
improvements on all the standard metrics."
}

@INPROCEEDINGS{Abdu0710:Performance,
AUTHOR="Nurul Muazzah {Abdul Latiff} and Charalampos Tsimenidis and Bayan Sharif",
TITLE="Performance Comparison of Optimization Algorithms for Clustering in
Wireless Sensor Networks",
BOOKTITLE="The Fourth IEEE International Conference on Mobile Ad-hoc and Sensor
Systems",
ADDRESS="Pisa, Italy",
DAYS=8,
MONTH=oct,
YEAR=2007,
ABSTRACT="Clustering in wireless sensor networks (WSNs) is one of the techniques that
can expand the lifetime of the whole network through data aggregation at
the cluster head. This paper presents performance comparison between
Particle Swarm Optimization (PSO) and Genetic Algorithms (GA) with a new
cost function that has the objective of simultaneously minimizing the
intra-cluster distance and optimizing the energy consumption of the
network. Furthermore, a comparison is made with the well known
cluster-based protocols developed for WSNs, LEACH (Low-Energy Adaptive
Clustering Hierarchy) and LEACH-C, the later being an improved version of
LEACH, as well as the traditional K-means clustering algorithm. Simulation
results demonstrate that the proposed protocol using PSO algorithm has
higher efficiency and can achieve better network lifetime and data delivery
at the base station over its comparatives."
}

@INPROCEEDINGS{Abdu0711:TDOAAOA,
AUTHOR="Omar Abdul-Latif and Peter Shepherd and Stephen Pennock",
TITLE="{TDOA/AOA} Data Fusion for Enhancing Positioning in an Ultra Wideband
System",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1531-1534",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Location Positioning; UWB; TDoA; AoA; Data Fusion.",
ABSTRACT="This paper considers a new location scheme for Ultra Wideband (UWB)
positioning system. The newly adopted scheme combines the Time Difference
of Arrival (TDoA) and the Angle of Arrival (AoA) positioning techniques in
order to enhance the accuracy of the positioning system compared to the
classical technique (TDoA). The new technique is simulated in a sports
tracking application in a football field. Results are compared with results
from a similar system using classical TDOA technique in order to establish
a proof-of-concept. Simulation shows that the new technique is actually
giving better performance with an acceptably longer processing time. This
technique has the promise of boosting positioning accuracy with a
relatively low level of complexity."
}

@INPROCEEDINGS{Abdu0712:Single,
AUTHOR="Salman {Abdul Moiz}",
TITLE="Single Lock Manager Approach for Achieving Concurrency Control in Mobile
Environments",
BOOKTITLE="14th Annual IEEE International Conference on High Performance Computing",
ADDRESS="Goa, India",
DAYS=18,
MONTH=dec,
YEAR=2007,
ABSTRACT="In a mobile computing environment, users can perform on-line transaction
processing independent of their physical location. In a mobile environment,
multiple mobile hosts may update the data simultaneously which may result
in inconsistency of data. To solve such problems many concurrency control
techniques have been proposed. The traditional two phase locking protocol
has some inherent problems such as deadlocks \& long unpredictable
blocking. In this paper we propose a concurrency control mechanism with
dynamic timer adjustment which helps in reducing the communication overhead
and enhances the transaction throughput. The simulation results specify the
performance trade off metrics."
}

@INPROCEEDINGS{AbdW0000:RFID,
AUTHOR="Mohd Helmy {Abd Wahab} and Loh {Poh Chuan} and Ayob Johari and Danial {Md.
Nor} and Nik Shahidah Afifi {Md. Taujuddin} and Mohd Erdi Ayob",
TITLE="An {RFID} Warehouse Robot",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="RFID; robot; line follower; sensors; reader; servo motor",
ABSTRACT="RFID is one of the latest trend in the industry.  Its potential application
can range from warehouse to library management.  This project is aimed to
build an autonomous robot with RFID application. The project integrates
RFID reader and PIC microcontroller as the main components.  The movement
control comprises servo-motor with infrared sensors for the line follower. 
The whole programming operation was carried out by assembly language using
MPLab 7.3. The robot has the ability to  identify the items by reading the
tag on the items.  The robot will pick up the item and navigate to
prescribed destination using line follower module to store the item at the
appropriate place and location.   A small white platform with black line is
built for demonstration and testing."
}

@INPROCEEDINGS{Abe0711:Differential,
AUTHOR="Tetsushi Abe and Gerhard Bauch",
TITLE="Differential Codebook {MIMO} Precoding Technique",
BOOKTITLE="IEEE Globecom 2007 Wireless Communications",
ADDRESS="Washington, DC, USA",
PAGES="208-213",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="In this paper, we present a differential codebook precoding technique for
MIMO spatial multiplexing systems. The proposed scheme updates the
precoding matrix by multiplying the codebook matrix specified by the
receiver to the previous precoding matrix. The codebook matrices are
designed to include quasi-diagonal matrices for finer quantization of the
channel.
We analyze the capacity of the differential precoding scheme as well as
existing precoding schemes by taking into account various practical aspects
such as precoding update interval, feedback delay, and feedback error.
Simulation results show that in a MIMO system with four transmit and two
receive antennas, the proposed precoding scheme requires smaller codebook
size by about 1 - 2 bits than the one-shot precoding scheme with
Grassmanian codebook to achieve the same capacity level when the channel
variation is relatively small. Finally, we show that the proposed precoding
scheme provides similar throughput performance gain in MIMO-OFDM systems in
frequency selective fading channels."
}

@INPROCEEDINGS{Abed0706:Application,
AUTHOR="Ali Abedi and Mary Thompson and Amir K. Khandani",
TITLE="Application of Cumulant Method In Performance Evaluation of {Turbo-Like}
Codes",
BOOKTITLE="ICC 2007 Communication Theory Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="In this article, a new method for performance evaluation of Turbo-like
codes is presented. This is based on estimating the Probability Density
Function (pdf) of the bit Log-Likelihood-Ratio (LLR) using higher order
statistics. We
do not restrict ourselves to any specific model for the pdf and try to
estimate it directly using a Cumulant matching method. Numerical results
show a close agreement between the proposed method and simulations. The
complexity of this method is similar to the Monte-Carlo simulation with the
advantage of providing similar accuracy using significantly fewer samples."
}

@INPROCEEDINGS{Abei0706:MobiSplit,
AUTHOR="Julien Abeillé and Rui Aguiar and Joao Girao and Telemaco Melia and
Ignacio Soto and Patrick Stupar",
TITLE="{MobiSplit} in a Virtualized, {Multi-Device} Environment",
BOOKTITLE="ICC 2007 Network Services and Operation Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="This paper details a novel architecture, MobiSplit, for managing mobility
in future IP based networks. The architecture separates mobility management
in two levels, local and global, that are managed in completely independent
ways. We describe how such a mobility architecture can be used to support a
new paradigm in mobility. By combining the user’s identity with a multi
physical virtual terminal we treat the movement of people rather than their
physical manifestations in one device. We conclude by analyzing the
concrete system, built from this new architecture and existing protocols,
in terms of scalability, flexibility and security."
}

@INPROCEEDINGS{Abei0711:Mobility,
AUTHOR="Julien Abeillé and Marco Liebsch and Telemaco Melia",
TITLE="Mobility Anchor Controlled Route Optimization for Network Based Mobility
Management",
BOOKTITLE="IEEE Globecom 2007 Internet Protocol Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="Future Internet Protocol mobile communications systems will implement
solutions for network-based mobility management, to enable mobility for
terminals, which do not support Mobile IP. The Internet Engineering Task
Force is specifying a base proto¬col for network-based mobility, which
supports registration, deregistration and handover. Support for
optimi¬zation will be consi¬d¬ered in a subsequent standardization step.
This paper pro¬po¬ses a solution to enable support for route
optimization, being under control of the mobility anchor of the
network-based mobility domain. The route optimization protocol solution has
been specified with the objective, to cope with difficult scenarios, which
can occur in a network-based mobility enabled system. The protocol has been
implemented and evaluated based on a base protocol specification, taking
future porting into the final standard base protocol into account.
Important perfor¬mance characteristics have been obtained from a hybrid
test-bed, which comprises physical and virtual network entities. The
results show, that the proposed protocol sets up and maintains optimized
routes efficiently."
}

@INPROCEEDINGS{Abey0703:Dynamic,
AUTHOR="B. A. Hirantha Sithira Abeysekera and Takahiro Matsuda and Tetsuya Takine",
TITLE="Dynamic Contention Window Control to Achieve Fairness between Uplink and
Downlink Flows in {IEEE} {802.11} {WLANs}",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="This paper considers a fairness issue between uplink and downlink flows in
IEEE 802.11 wireless LANs, where uplink flows dominate over downlink flows
in terms of wireless bandwidth usage. As a solution to this unfairness, we
propose modifying the IEEE 802.11 MAC protocol at access points (APs). Our
scheme dynamically controls the minimum contention window size at APs and
provides an ample opportunity for them to acquire the transmission right. 
Because the control is based only on the number of downlink flows, APs can
easily find the optimal window size to achieve per-flow fairness. Note that
the proposed scheme does not require any modifications in the MAC protocol
at
wireless terminals. Through simulation experiments with UDP flows, we show
that the proposed scheme can achieve fairness between uplink and downlink
flows."
}

@INPROCEEDINGS{Abhi0703:Weighted,
AUTHOR="Vineet Abhishek and Ajit Chaturvedi",
TITLE="A Weighted Combining Approach to Multiuser Detection in Macrodiversity",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="A new linear complexity algorithm using weighted combining is proposed for
Multiuser Detection (MUD) in Macrodiversity for synchronous DS-CDMA. Error
probability expression is derived for weighted combining based receivers
and a framework for finding optimal weights is proposed. Simulation results
show that the performance of the proposed algorithm compares with the
optimal maximum-likelihood (ML) MUD under various situations."
}

@INPROCEEDINGS{AbiA0711:Bounds,
AUTHOR="Fadi Abi-Abdallah and Raymond Knopp",
TITLE="Bounds on the Distortion for Distributed Sensing of {Slowly-Varying} Random
Fields",
BOOKTITLE="IEEE Globecom 2007 Ad-hoc and Sensor Networking Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007
}

@INPROCEEDINGS{Abic0000:Authenticated,
AUTHOR="Pierre {Abi char} and Abdallah Mhamed and Bachar {El Hassan}",
TITLE="A New Authenticated Key Agreement Protocol, Pierre {E.} {ABI-CHAR}",
BOOKTITLE="The first International Conference on New Technologies, Mobility and
Security",
ADDRESS="PARIS, France",
DAYS=2,
MONTH=may,
YEAR=2007,
ABSTRACT="Several protocols have been proposed to provide robust mutual
authentication and key establishment for wireless local area network
(WLAN). In this paper we present a New Authenticated Key Agreement (NAKA)
protocol that provides secure mutual authentication, key establishment and
key confirmation over an untrusted network. The main comparative study of
our proposed protocol concerns the performance capabilities, including
computational and communication load. In addition, the new protocol
achieves many of the required security properties. It can resist dictionary
attacks mounted by either passive or active networks intruders, allowing
even the use of a weak password to be used. It can resist Impersonate
attack. It also offers perfect forward secrecy which protects past sessions
and passwords against future compromise. Finally, it can resist known-key
and resilience to server attack. Our proposed protocol combines techniques
of challenge-response protocols with symmetric key agreement protocols and
offers significantly improved performance in computational and
communication load over comparably many authenticated key agreement
protocols such as B-SPEKE, SRP, AMP, PAK-RY, PAK-X, SKA and LR-AKE."
}

@INPROCEEDINGS{Abic0709:Fast,
AUTHOR="Pierre {Abi char} and Abdallah Mhamed and Bachar {El Hassan}",
TITLE="A Fast and Secure Elliptic Curve Based Authenticated Key Agreement Protocol
For Low Power Mobile Communications",
BOOKTITLE="International Conference and Exhibition on Next Generation Mobile
Applications, Services, and Technologies",
ADDRESS="Cardiff, Wales, United Kingdom",
DAYS=12,
MONTH=sep,
YEAR=2007,
KEYWORDS="WLAN, EC-Cryptography, ECEGS, Key Agreement Protocol, Authentication
protocol.",
ABSTRACT="The increasing progress in wireless mobile communication
has attracted an important amount of attention on the
security issue. To provide secure communication for mobile
devices, authenticated key agreement protocol is an important
primitive for establishing session key. So far, several
protocols have been proposed to provide robust mutual
authentication and key establishment for wireless local
area network (WLAN). In this paper we present a fast
and Secure Authenticated Key Agreement (EC-SAKA) protocol
based on Elliptic Curve Cryptography. Our proposed
protocol provides secure mutual authentication, key establishment
and key confirmation over an untrusted network.
The new protocol achieves many of the required security
and performance properties. It can resist dictionary attacks
mounted by either passive or active networks intruders. It
can resist Man-In-The Middle attack. It also offers perfect
forward secrecy which protects past sessions and passwords
against future compromise. In addition, it can resist knownkey
and resilience to server attack. Our proposed protocol
uses ElGamal signature techniques (ECEGS). We show that
our protocol meets the above security attributes under the
assumption that the elliptic curve discrete logarithm problem
is secure. Our proposed protocol offers significantly improved
performance in computational and communication
load over comparably many authenticated key agreement
protocols such as B-SPEKE, SRP, AMP, PAK-RY, PAK-X,
SKA, LR-AKE and EC-SR"
}

@INPROCEEDINGS{Abic0709:Secure,
AUTHOR="Pierre {Abi char}",
TITLE="A Secure Authenticated Key Agreement Protocol For Wireless Communications.",
BOOKTITLE="International Conference and Exhibition on Next Generation Mobile
Applications, Services, and Technologies",
ADDRESS="Cardiff, Wales, United Kingdom",
DAYS=12,
MONTH=sep,
YEAR=2007,
KEYWORDS="WLAN, Cryptography, challenge-response protocol, Key Agreement Protocol,
Authentication protocol.",
ABSTRACT="Several protocols have been proposed to provide robust mutual
authentication and key establishment for wireless local area network
(WLAN). In this paper we present a new Secure Authenticated Key Agreement
(SAKA) protocol that provides secure mutual authentication, key
establishment and key confirmation over an untrusted network. The new
protocol achieves many of the required security and performance properties.
It can resist dictionary attacks mounted by either passive or active
networks intruders. It can resist Man-In-The Middle attack, and Impersonate
attack. It also offers perfect forward secrecy which protects past sessions
and passwords against future compromise. In addition, it can resist
known-key and resilience to server attack. Our proposed protocol combines
techniques of challenge-response protocols with symmetric key agreement
protocols and offers significantly improved performance in computational
and communication load over comparably many authenticated key agreement
protocols such as B-SPEKE, SRP, AMP, PAK-RY, PAK-X, SKA and LR-AKE."
}

@INPROCEEDINGS{Abid0000:Analyse,
AUTHOR="Wafa Abid and Khaled Taouil and Mohamed Salim Bouhlel",
TITLE="Analyse des Coupes Histologiques Osseuses par utilisation de la morphologie
mathématique",
BOOKTITLE="First International Conference of E-medical Systems",
ADDRESS="Fès, Morocco",
DAYS=24,
MONTH=oct,
YEAR=2007,
ABSTRACT="La coupe histologique osseuse est une lame qui présente la structure
interne de l’os à l’échelle microscopique. Le screening (étape de
lecture d’une lame) est une activité humaine manuelle subjective en
histologie.  Un système informatique semi-automatique pourrait contribuer
à la détection des erreurs de screening grâce à une meilleure
fiabilité. 
La maladie de l’ostéoporose peut  être prédite à partir des
caractéristiques histologiques des coupes osseuses.  
L’objectif de la segmentation des images numérisées des coupes
histologiques osseuses est d’isoler le réseau trabéculaire de
l’espace médullaire. 
Nous présentons dans ce papier une nouvelle  stratégie de segmentation
basée sur  l’utilisation de la ligne de partage des eaux contrainte par
marqueurs. Ces travaux ont été réalisés en collaboration avec la
faculté de médecine de Sfax.  
La quantification transforme la coupe histologique à traiter en un
ensemble de paramètres numériques qui résument les caractéristiquement
de constitution du réseau trabéculaire.

Mots clés: segmentation, seuillage d’histogramme, opérateurs
morphologiques,  squelettisation, ligne de partage des eaux."
}

@INPROCEEDINGS{Abid0705:Effective,
AUTHOR="Diran Abidakun and Marthinus Pretorius",
TITLE="Effective Management of Technology in Africa: Issues, Perspectives and
Peculiarities",
BOOKTITLE="International Conference on Management of Technology 2007",
ADDRESS="Miami Beach, Florida, USA",
PAGES="216-230",
DAYS=13,
MONTH=may,
YEAR=2007,
ABSTRACT="Most companies do not have a strategic plan for ‘resting or retiring’
their technological products and services in Africa and this is in the
spite of the fact that most of these technological products and services
will invariably end up in Africa and indeed remain in Africa for a longer
period of time – especially for the more successfully commercialised
ones. Reasons why inadequacy is given to Africa in the firms’ business
plans include, lack of peace and security in Africa, the presence of
fragmented and undefined markets almost all through the region, inadequate
physical and social infrastructures, the absence of an effective and
regulatory framework and weak financial systems amongst others. There are
reasons however why the writer believes the development of a strategic
business plan for the resting of technological products will bring great
competitive advantage to companies. One of the more compelling ones is the
fact that businesses are aware of where the products will eventually end
– and remain for a long time – and should plan for that. This paper -
using extensive documentation reviews, experiences, interviews, surveys and
an interdisciplinary approach – investigates the reasons around why
companies must take time to develop strategic business plans for the
effective retirement of their technological products in Africa. Relevant
successful case studies are also presented. On the basis of findings, a
four-staged approach is recommended for the strategic development of an
Africa ‘resting’ plan. It is expected that this pioneer study will
motivate further research into this topic."
}

@INPROCEEDINGS{Abid0709:Stereo,
AUTHOR="Besma Abidi and Shafik Huq and Mongi Abidi",
TITLE="Stereo-based {3D} Face Modeling using Annealing in Local Energy
Minimization",
BOOKTITLE="International Conference on Image Analysis and Processing 2007",
ADDRESS="Modena, Italy",
DAYS=10,
MONTH=sep,
YEAR=2007,
ABSTRACT="In the past few years, 3D face modeling has gained significant attention.
Reliable modeling of the face is necessary for good performance of a 3D
assisted face recognition system. In this paper, we model 3D human face
from binocular stereo images. The stereo matching problem has been
formulated as an energy minimization problem that progressively propagates
depth from reliable regions to unreliable regions by an annealing scheme.
The concept of smooth 2D grid is used to enable regularizing the final
depth solution. In the energy equation, area based matching is used for the
data term. The smoothness term relies on annealing. The 2D grid facilitates
the estimation of the smoothness parameter, from a correlation profile
obtained from neighborhood of the grid node. It is evident from 3D modeling
results that the proposed algorithm performs well on images of human faces."
}

@INPROCEEDINGS{Abiy0712:Evaluation,
AUTHOR="Adalet Abiyev",
TITLE="An Evaluation of Reactive Electrical Power in Sinusoidal Conditions by Use
of the Peculiar Properties of the Walsh Functions",
BOOKTITLE="The third International Conference on Intelligent Sensors, Sensor Networks
and Information Processing - 2007",
ADDRESS="Melbourne, Australia, Australia",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="This paper presents a new Walsh function (WF) based method for the
evaluation of reactive power (RP) component from instantaneous power signal
in the sinusoidal conditions. Proposed method simplifies the multiplication
procedure to evaluate the reactive components from instantaneous power
signal. The advantages of the proposed method have been verified by
experimental studies. One of these advantages is that in contrast to the
known existing methods which involve phase shift operation of the input
signal, the proposed technique does not require the time delay of the
current signal to the   with respect to the voltage signal. Another
advantage is related to the computational saving properties of the proposed
approach coming from use of the Walsh Transform (WT) based signal
processing method. Validity and effectiveness of the suggested method for
evaluation of the RP components of the electrical power have been tested by
use of a simulation tool developed on the base of “Matlab”."
}

@INPROCEEDINGS{Abla0707:Eye,
AUTHOR="Markus Ablassmeier and Frank Wallhoff and Tony Poitschke and Klaus Bengler
and Gerhard Rigoll",
TITLE="Eye Gaze Studies comparing {Head-Up} and {Head-Down} Displays in Vehicles",
BOOKTITLE="ICME'07 - Multimedia Interaction, Human Machine Interface Track",
ADDRESS="Beijing, P.R. China",
DAYS=2,
MONTH=jul,
YEAR=2007,
ABSTRACT="To minimize the mental workload for the driver and to keep the increasing
amount of information easily accessible, sophisticated display and
interaction techniques are essential. This contribution focuses on a
user-centered analysis for an authoritative grading of head-up displays
(HUDs) in cars. Two studies delivered the evaluation data. In a field test,
the potential and the usability of the HUD were analyzed. For special
driving situations the according display needs and requirements of the
users have been identified and compared with in-car displays, so-called
head-down displays (HDD). As major result, a high acceptance of the HUD by
the driver and a good performance compared to other in-car displays had
been reached."
}

@INPROCEEDINGS{Abob0711:Analytical,
AUTHOR="Abdosllam Abobaker and Nakkeeran Kaliyaperumal and Patrice {Tchofo Dinda}",
TITLE="Analytical design of terrestrial dispersion-managed optical fiber systems",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="265-268",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Optical fiber communication; Optical solitons; Nonlinear wave propagation;
Nonlinear differential equations; Design methodology",
ABSTRACT="We present an analytical method for designing terrestrial
dispersion-managed (DM) optical fiber system for any desired fiber
(dispersion, nonlinearity and losses) and pulse (width and energy)
parameters.  We show that this analytical design allows to transmit
chirp-free Gaussian pulses for very long distances in DM fiber systems with
dispersion map length longer than the amplification period.

We present an analytical method for designing terrestrial
dispersion-managed (DM) optical fiber system for any desired fiber
(dispersion, nonlinearity and losses) and pulse (width and energy)
parameters.  We show that this analytical design allows to transmit
chirp-free Gaussian pulses for very long distances in DM fiber systems with
dispersion map length longer than the amplification period."
}

@INPROCEEDINGS{Abol0000:Indoor,
AUTHOR="Mehran Abolhasan and Jerry Chun-Ping Wang and Daniel Franklin",
TITLE="On Indoor Multi-hopping capacity of Wireless Ad hoc Mesh Networks",
BOOKTITLE="First IEEE International Workshop on Enabling Technologies and Standards
for Wireless Mesh Networking",
ADDRESS="Pisa, Italy",
DAYS=8,
MONTH=oct,
YEAR=2007,
KEYWORDS="Ad hoc Mesh, Test-bed, Routing protocol, Multi-hopping",
ABSTRACT="The capacity and multi-hopping performance of ad hoc mesh networks in
dynamic environment still remains an open research issue. Previous
theoretical studies suggest that they do not scale in densely distributed
networks. However, a recent study has shown that scalability and hence the
multi-hopping capacity of mesh network is not only bound by the number of
nodes in the network but also the number of hops. In this paper we
investigate the performance of multi-hop ad hoc mesh networks, using both
simulation studies and an experimental test-bed, and monitor the
performance of the network as the number of hops in the network increases.
Our results show that the drop in performance in multi-hopping is much more
significant when the traffic levels are high. Furthermore our test-bed
study shows that ad hoc mesh networks can maintain high levels of packet
delivery
and throughput when traffic levels are low, however, the delay experienced
continues to increase after each hop."
}

@INPROCEEDINGS{Abol0704:Effects,
AUTHOR="Bahman Abolhassani",
TITLE="Effects of Channel Estimation on Dynamic Resource Allocation in Multiuser
{OFDM} Systems",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="This paper investigates effects of pilot assisted channel estimation on
dynamic resource allocation in a multiuser orthogonal frequency division
multiplexing (OFDM) system. The channel estimation is done in each OFDM
symbol through least-squared error (LSE) or minimum mean-squared error
(MMSE) algorithm. The performance of each of these algorithms is evaluated
through computer simulations. The maximal total capacity and the fair
resource allocations are considered. It is shown that there is an optimal
power distribution among pilots and data for maximizing the capacity. It is
also shown that the equal power allocation among data subchannels is the
optimum for maximizing the system capacity with channel estimation."
}

@INPROCEEDINGS{Abol0706:Modified,
AUTHOR="Vahid Abolghasemi",
TITLE="Modified {CELP} Coder Using {Cepstral-Analysis}",
BOOKTITLE="Mosharaka International Conference on Communication Systems and Circuits",
ADDRESS="Amman, Jordan",
DAYS=7,
MONTH=jun,
YEAR=2007,
ABSTRACT="Abstract: A simple Code Excited Linear Prediction
Coder based on Cepstral-Analysis to decrease the bitrate
of coder has been proposed. The proposed method
first applies Cepstral analysis to the input speech
signal and then attempts to remove insignificant
coefficients of the cepstrum. These modified
coefficients rather than the input speech samples, are
fed to our simple CELP coder to be encoded. At the
decoder side, we compute inverse cepstrum of the
decoded coefficients and obtain the reconstructed
speech signal. Our experimental results approve the
reduction of bit-rate."
}

@INPROCEEDINGS{Abou0000:INVITED,
AUTHOR="Chadi Abou-Rjeily",
TITLE="{INVITED} : On the impact of {ISI} and {MUI} on {MIMO} ultra wide band
communication systems",
BOOKTITLE="European Wireless 2007",
ADDRESS="Paris, France",
DAYS=1,
MONTH=apr,
YEAR=2007,
ABSTRACT="Abstract—In this paper, we study the impact of Inter-
Symbol-Interference (ISI) and Multi-User-Interference (MUI)
on Multiple-Input-Multiple-Output (MIMO) Ultra-Wideband
(UWB) communication systems. At the transmitter side, we
consider the two cases where the transmitted data flows are
either uncoded or encoded by a convenient Space-Time (ST)
block code. These transmission schemes are associated with pulse
amplitude modulation (PAM), pulse position modulation (PPM)
or joint pulse position and amplitude modulation (PPM-PAM).
The receiver is composed of a Rake receiver followed by a
maximum-likelihood decoder. The proposed scheme constitutes a
candidate solution for very high data rate UWB communications.
The considered system model takes the ISI and MUI into account
and permits to analyze the performance over the highly frequency
selective UWB channels."
}

@INPROCEEDINGS{Abou0705:Outage,
AUTHOR="Mohamad {Abou El-Nasr} and Heba Shaban and Bill Tranter",
TITLE="Outage Probability and Percentage of Cell Area for {OFDMA} Cellular Systems
with Sectoring",
BOOKTITLE="Fifth Annual Conference on Communication Networks and Services Research",
ADDRESS="Fredericton, New Brunswick, Canada",
DAYS=14,
MONTH=may,
YEAR=2007,
ABSTRACT="Orthogonal Frequency Division Multiplexing (OFDM) is an important candidate
for fourth generation cellular systems that support high data rates.
Performance of OFDM systems is sensitive to non-perfect frequency
synchronization, which leads to frequency offsets and a consequent
degradation in system performance. In cellular systems, there is a tradeoff
between link quality and capacity; both are controlled by cell cluster
size. Smaller cluster sizes gain higher capacity, yet they cause an
increase in co-channel interference, which degrades the system outage
probability performance. Moreover, a key technique for reducing co-channel
interference is sectoring, where a single OMNI directional antenna is
replaced by multiple directional antennas. In this paper, the performance
of OFDMA cellular systems with sectoring is investigated aided with
extensive simulations. System performance is evaluated through the
investigation of system outage probability and percentage of cell area for
various system configurations namely, various cluster sizes, sectoring
factors and frequency offsets."
}

@INPROCEEDINGS{Abou0706:Delay,
AUTHOR="Jamshid Abouei and Alireza Bayesteh and Amir K. Khandani",
TITLE="Delay-throughput analysis in decentralized single-hop wireless networks",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="In this paper, an asymptotic analysis for the delay-throughput
of a single-hop wireless network with n pairs of nodes
is presented. The analysis relies on the decentralized on-off power
allocation strategy, in which the on-off transmission policy for
each link is based on comparing its direct channel gain with
optimum threshold \tau\_{n}. We first provide a new definition of the
transmission delay in a homogenous network. It is proved that
the delay threshold level that results the dropping probability for
each link tends to zero, while achieving the maximum average
sum-rate scales as \omega(n/log n). Also, the minimum delay in order
to make the dropping probability for the whole network approach
zero scales as \omega(n/ log n)+n. Furthermore, we drive lower and
upper bounds for the link activation probability, q, such that
the order of the average sum-rate is preserved. Based on the
upper bound on q, an asymptotic analysis shows that the delay
in each link and in the network improves without any significant
impact on the the average sum-rate. Finally, we present a new
definition of the throughput for the link in the cases of one and
infinite buffer size. It is demonstrated that the maximum average
throughput of the network with the decentralized on-off power
allocation strategy is independent of the buffer size."
}

@INPROCEEDINGS{Abou0706:Sum,
AUTHOR="Jamshid Abouei and Alireza Bayesteh and Masoud Ebrahimi and Amir K.
Khandani",
TITLE="{Sum-Rate} Maximization in {Single-Hop} Wireless Networks with the {On-Off}
Power Scheme",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT={{"}THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD{"}
http://www.isit2007.org/ - best student paper awards

A single-hop wireless network with $K$ links is considered, where the links
are partitioned into $M$ clusters, each operating in a subchannel 
with bandwidth $\frac{W}{M}$. We assume that the links in each cluster
perform the on-off power allocation strategy proposed in \cite{Masoud2006}.

The problem is to analyze the average sum-rate of the network in terms of
$M$ and under the shadow-fading effect with probability $\alpha$. It is
demonstrated that for $M \sim o(K)$ and $0<\alpha \leq 1$, where $\alpha$
is a fixed parameter, the average sum-rate of the network scales as  
$\frac{W}{\alpha} \log K$. For $M \sim \Theta (K)$, we present an upper
bound for the average sum-rate. It is proved that the maximum average 
sum-rate of the network for every value of $0<\alpha \leq 1$ is achieved at
$M=1$. In fact, in the proposed model, partitioning the bandwidth 
$W$ into $M$ subchannels has no gain in terms of enhancing the throughput.}
}

@INPROCEEDINGS{Abou0711:Broadcast,
AUTHOR="Yasmine Abouelseoud and Hassan ElKamchouchi",
TITLE="Broadcast Encryption Schemes: A Comparative Study",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="700-703",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Digital Rights Management, Broadcast Encryption, Traitor Tracing",
ABSTRACT="We live in the digital information age. The growth of new technologies for
communication infrastructure and the wide availability of digital storage
devices resulted in most data being produced, distributed and ultimately
consumed by end users in digital form. The intrinsic nature of digital data
makes the task of manipulating, replicating and distributing digital copies
extremely easy. Publishing content covered by intellectual property or
copyright is then faced by the challenge of countering illegal access to
the digital good, while still enabling consumers to exercise their usage
rights on purchased contents. Digital Rights Management (DRM) systems
consist of architectures, protocols and technologies aimed at providing
satisfactory solutions to the above problem. This paper aims to guide DRM
system designers choose  among  cryptographic primitives available in the
literature by offering a comparative study of some of the well-known
constructions."
}

@INPROCEEDINGS{Abou0711:Hybrid,
AUTHOR="Pooyan Abouzar and Siavash Yousefi and Seyed Kamaledin Setarehdan",
TITLE="Hybrid {WT} {Based-DCT} Based Face Recognition",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="963-966",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Wavelet transform,Discrete Cosine Transform, PCA, SVM,  Image database",
ABSTRACT="In this paper a robust face recognition algorithm based on both WT (Wavelet
Transform) and DCT (Discrete Cosine Transform) is presented. The proposed
algorithm takes the advantage of data reduction property of both WT and
DCT, hence a large reduction in the data size, while saving most of the
information. Initially, 2D WT is used to compress the data at various
levels, which also removes the high frequency noise from the input image.
Then 1D DCT is applied to each column of the resulting image from the
previous step for more data reduction. Finally, PCA (Principle Component
Analysis) is applied to extract principle components of the data in the
training set.  SVM (Support Vector Machine) is then used to separate  
different classes (picture of different persons obtained at various
conditions). Comparison of the proposed algorithm with previously reported
WT based algorithm shows a significant improvement in the classification
results."
}

@INPROCEEDINGS{Abou0711:Multi,
AUTHOR="Yasmine Abouelseoud and Hassan ElKamchouchi",
TITLE="A Multi-recipient Tree-based Signcryption Scheme",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="69-72",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Signcryption, Identity-based Encryption, Subset Cover Schemes",
ABSTRACT="Achieving both message confidentiality and authenticity at a reasonable
computational cost, especially in case of using smart cards with limited
processing capabilities, has always been considered a challenging problem.
Signcryption is one attractive solution. An even more challenging problem
is that of achieving both goals in multi-cast operations. This paper
presents a new tree-based, multi-recipient identity-based signcryption
scheme.  It addresses the reduction of bandwidth requirements as well as
computations in case of multiple recipients signcryption. Performance
issues are addressed  and possible applications of the proposed scheme are
suggested. Common applications include authenticated email transfers,
communications among members of a project as well as stock market
applications."
}

@INPROCEEDINGS{Abra0706:Centralized,
AUTHOR="Andrea Abrardo and Alessandro Alessio and Paolo Detti and Marco Moretti",
TITLE="Centralized Radio Resource Allocation for {OFDMA} Cellular Systems",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Efficient resource allocation in cellular OFDMA systems envisages the
assignment of the number of sub-carriers and the relative transmission
format on the basis of the experimented link quality. In this way, a higher
number of subcarriers with low per-carrier bit rates should be assigned to
users at cell border.
This strategy has already proved its e±ciency in the single-cell scenario,
while no study has been provided in the multi-cell scenario.
Under the simpli¯ed assumption that each cell is characterized by the same
throughput and that each user is assigned the same bit-rate, we show that
iterative decentralized allocation strategies cannot take advantage from
subcarrier transmission format adaptation. This is because users at cell
border tends to consume the most of the resources (i.e., they are assigned
the most of subcarriers), thus producing interference for the neighbor
cells over a large set of subcarriers. Hence, since in this case neighbor
cells are forced to use those (few) subcarriers which experiment low
interference, the diversity gain tends to be missed. In this paper we
present a centralized optimization approach for the multi-cell scenario of
an OFDMA cellular system which allows to overcome this impairment. The
proposed centralized resource allocation strategy is characterized by huge
implementation complexity, and, hence, it can be hardly implemented in the
real world. However, it can help the system designer in capturing the
essence of interference limitations in OFDMA cellular systems,
thus allowing the elaboration of e±cient heuristic decentralized
approaches."
}

@INPROCEEDINGS{Abra0710:Simulation,
AUTHOR="Filipe Abrantes",
TITLE="A Simulation Study of {XCPb} Performance in Wireless Multihop Networks",
BOOKTITLE="3rd ACM International Workshop on QoS and Security for Wireless and Mobile
Networks",
ADDRESS="Chania, Crete Island, Greece",
DAYS=22,
MONTH=oct,
YEAR=2007,
ABSTRACT="XCP-b proposes a modification to the XCP router algorithm
that computes the spare bandwidth. The modification removes
the need for an XCP router to know the exact capacity
of the channel, making it possible to use the XCP-b
variant in transmission media where the capacity is hard to
measure. An example of this kind of medium is the IEEE
802.11. Previous work shows that XCP-b behaves well in
single-hop wireless networks and that it outperforms TCP
in terms of fairness, queuing delay, stability and efficiency
when the bandwidth delay product of the network grows. In
this paper we extend the validation and evaluation of XCP-b
to the case of multi-hop wireless networks, both stand-alone
and as access networks to other wired networks.
The results show that XCP-b maintains its fundamental
characteristics in wireless multi-hop scenarios, such as stable
throughput and low standing queues, while distributing the
bandwidth fairly and using the available capacity efficiently.
The simulations also show that XCP-b produces congestion
window values that are closer than TCP to the theoretical
upper-bound which maximizes spatial reuse."
}

@INPROCEEDINGS{Abra0712:Expected,
AUTHOR="Yuri Abramovich and Ben Johnson",
TITLE="Expected likelihood estimation: Asymptotic properties for ``stochastic''
complex Gaussian models",
BOOKTITLE="Second IEEE Workshop on Computational Advances in Multisensor Adaptive
Processing",
ADDRESS="St. Thomas, US Virgin Islands, USA",
PAGES="33-36",
DAYS=11,
MONTH=dec,
YEAR=2007,
ABSTRACT="Expected likelihood estimation allows for the ``quality assessment''
of potential parameter estimates based on the likelihood ratio of
the covariance matrix model constructed with the parameter estimates
relative to the measured covariance matrix.  A solution is
considered acceptable and further iterative refinement of the
estimation process is terminated when the observed likelihood ratio
is statistically as good as the unknown true solution.  We derive
the asymptotic performance of expected likelihood and show it has a
larger average error than the Cram\'{e}r-Rao bound and is therefore
not technically efficient.  However, the degradation in the error is
fixed, relatively small, and a function of the dimension of the data
vector $M$, so it can therefore be used to impose useful statistical
bounds on the likelihood function value."
}

@INPROCEEDINGS{Abra0712:Multi,
AUTHOR="Ajith Abraham and Hongbo Liu",
TITLE="Multi-objective {P2P} {Neighbor-Selection} Strategy Using Genetic Algorithm",
BOOKTITLE="14th Annual IEEE International Conference on High Performance Computing",
ADDRESS="Goa, India",
DAYS=18,
MONTH=dec,
YEAR=2007,
ABSTRACT="Peer-to-peer (P2P) topology has significant influence on the performance,
search efficiency and functionality, and scalability of the
application. In this paper, we present a Genetic Agorithm (GA) approach to
the problem of multi-objective Neighbor Selection (NS) in
P2P Networks. The encoding representation is from the upper half of
the peer-connection matrix through the undirected graph, which reduces
the search space dimension. The results indicate that GA usually could
obtain better results than Particle Swarm Optimization (PSO)."
}

@INPROCEEDINGS{Abre0703:Super,
AUTHOR="Giuseppe Abreu and Giuseppe Destino",
TITLE="Super {MDS:} Source Location from Distance and Angle Information",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Networking",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="We consider the simultaneous localization of multiple sources from distance
and angle information. An extension of the multidimensional scaling (MDS)
technique is given, which allows for both distance and angle information to
be processed algebraically (without iteration) and simultaneously.
Simulations demonstrate the superiority the super MDS algorithm compared to
conventional metric MDS, which relies only on Euclidean distances, and
illustrate the impact that angle information may have on the accuracy of
source localization. An advantage of the method is that localization under
an absolute coordinate system is achievable with knowledge of the
coordinates of a single node."
}

@INPROCEEDINGS{Abre0706:Simulation,
AUTHOR="Giuseppe Abreu",
TITLE="On the Simulation of Tikhonov Random Processes",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="A novel, simple yet general method for the simulation of Tikhonov processes
is proposed. The proposed method is based on the mixture of processes
constructed from Gaussian and Cauchy random variables (RV's). The accuracy
of the method is quantified analytically and examples computed for
different implementations illustrate its remarkable accuracy. The algorithm
is also extremely efficient, consuming a single pair of uniform random
numbers per generated sample. The mixture probabilities used in the random
mixture are derived from the characteristic functions of the Gaussian,
Cauchy and Tikhonov processes, all of which are either known or given here
in closed form. Accuracy of the moments of the simulated processes, up to a
significantly high order, result by construction. Another by-product of the
technique is that piecewise continuous (autocorrelated) Tikhonov processes
can also be easily generated."
}

@INPROCEEDINGS{Abta0000:Experimental,
AUTHOR="Mohammad Abtahi and Julien Magné and Mehrdad Mirshafiei and Serge Doucet
and Leslie Rusch and Sophie LaRochelle",
TITLE="Experimental Generation of {FCC-Compliant} {UWB} Pulse using {FBGs}",
BOOKTITLE="ECOC 2007 - 33rd European Conference and Exhibition on Optical
Communication",
ADDRESS="Berlin, International Congress Center (ICC), Germany, Germany",
DAYS=16,
MONTH=sep,
YEAR=2007,
KEYWORDS="Ultrawideband; Fiber Bragg grating; Microwave Photonics",
ABSTRACT="A simple and robust technique for the generation of power-efficient,
FCC-compliant UWB pulses is proposed and experimentally demonstrated. An
FBG shapes the source spectrum and a length of SMF performs the
frequency-to-time conversion."
}

@INPROCEEDINGS{AbuA0000:Performance,
AUTHOR="Marwan Abu-Amara and Ashraf Mahmoud and Tarek Sheltami",
TITLE="Performance of {UMTS/WLAN} Integration at {Hot-Spot} Locations Using
{OPNET}",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="Due to the many benefits provided by both the third-generation (3G) mobile
networks and the IEEE 802.11 wireless local area networks (WLANs), it is
desirable to integrate both types of networks. While studies specifying
generic integration architectures are abundant, there are little or no
studies that are dedicated for applications performance over such
heterogeneous networks. Using simulations, this paper evaluates the
performance of two 3G/WLAN integration schemes: loose and open coupling,
together with two mobility management schemes: Mobile IP and mobile stream
control transmission protocol (mSCTP) for an airport as a typical example
of a hot-spot location. In addition, the evaluation is carried out for a
wide range of application mixes consisting of FTP, HTTP and multimedia.
Utilizing OPNET as the simulation platform and incorporating the required
protocols to support our implementation of the Mobile IP and mSCTP, we
generate a large matrix of performance figures for the 4 network
configurations under all applications mixes considered. The results
summarized in this paper indicate that integration methods considered have
little impact on the application mixes studied in terms of delay but show
that FTP and HTTP throughput is better with loose coupling scheme. Further,
quantifying the handoff delay between the 3G and WLAN networks, the results
indicate that a loose-couple integration solution together with Mobile IP
provides the best performance."
}

@INPROCEEDINGS{AbuA0702:Capacitive,
AUTHOR="Alaeddin Abu-Abed and Robert Lindquist",
TITLE="Capacitive Transduction in Partially Disordered Systems: Application to
{LC-Based} Biosensors",
BOOKTITLE="Sensors Applications Symposium",
ADDRESS="San Diego, California, USA",
DAYS=6,
MONTH=feb,
YEAR=2007,
ABSTRACT="Liquid crystals have recently been demonstrated to be excellent candidates
for low cost, portable, highly selective chemical and biological sensors.
In these sensors, the molecular alignment of the liquid crystal is altered
by the presence of targeted chemical or biological agents. Due to the
collective behavior of liquid crystal molecules, a minor change in the
structure at the surface is amplified into a significant change in the
average molecular alignment of the LC film. The key innovation of this work
is to utilize capacitive transduction rather than optical transduction to
track the LC anisotropy in partially disorder systems. Capacitive
transduction is shown to offer significant advantages over optical
techniques such as the ability to identify and track the deformation rather
than simply sensing an LC distortion. Capacitance measurements have been
used to uniquely track the director axis of a perfectly or partially
ordered LC film. The candidate structure has been fabricated and tested.
Simulation and experimental results will be provided to give a
comprehensive understanding."
}

@INPROCEEDINGS{Abua0706:Capacity,
AUTHOR="Ibrahim Abualhaol and Mustafa Matalgah",
TITLE="Capacity Analysis of {MIMO} System Over Identically Independent Distributed
Weibull Fading Channels",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="The capacity of multiple input multiple output
(MIMO) system over wireless channels has been investigated
analytically and by simulation over different types of wireless
fading channels, such as Rayleigh, and Nakagami-m fading channels.
The capacity of MIMO system over identically independent
distributed (iid) Weibull fading channels has not been considered
in the literature yet because of the complexity in obtaining closed
form expressions for either the probability of outage capacity
or the average capacity over Weibull fading channels. In this
paper, Finite Mixture (FM) with Expectation-Maximization (EM)
algorithm is utilized to derive simple approximate expression for
the probability density function (pdf) of the capacity distribution
over Weibull fading channels. This approximation converts the
complicated capacity distribution to a simple weighted sum
of univariate normal distributions with appropriate weighting
coefficients, means, and variances for a predefined system model
and channel statistics. The resultant approximation simplified the
mathematical analysis of the average capacity and the outage
capacity in terms of well known Q-functions."
}

@INPROCEEDINGS{Abua0711:End,
AUTHOR="Ibrahim Abualhaol and Mustafa Matalgah",
TITLE="{End-to-End} Performance Analysis of Cooperative {Relay-Based} Wireless
System Over Generalized {Gaussian-Finite-Mixture} Fading Channels",
BOOKTITLE="IEEE Globecom 2007 Wireless Communications",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="The end-to-end performance of cooperative relay-based
wireless communication system with nonregenerative relay
over generalized Gaussian-Finite-Mixture fading channels is
presented. The received signal-to-noise-ratio (SNR) is maximized
by optimizing the relay gain given that the fading statistics of
the links in a cooperative system are known by the relay. The
statistics of the received SNR at optimum gain are derived in
closed forms. More specifically the probability density function
(pdf), the cumulative distribution function (CDF), the moment
generating function (MGF), and the amount of fading (AoF) for
noise-limited cooperative system are derived. In this paper, Finite
Mixture (FM) with Expectation-Maximization (EM) algorithm is
utilized to derive simple approximate expressions for the pdfs of
Rayleigh, Nakagami-m and Weibull fading channels. Numerical
results using Monte Carlo simulation are used to validate the
derived closed-form expressions. The resultant expressions of
the statistics of the received SNR simplify the analysis of
the end-to-end performance of cooperative relay-based wireless
communication system."
}

@INPROCEEDINGS{AbuA0711:Space,
AUTHOR="Ala {Abu Alkheir} and Khalid Qaraqe and Mohamed-Slim Alouini",
TITLE="{Space-Time} Channel Correlation of {MIMO} Rayleigh Fading Based on
Non-isotropic {3D} Scattering",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="648-651",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="MIMO systems; Fading channels; space-time correlation; 3D geometry",
ABSTRACT="In this paper, a general space time correlation function is derived
for narrowband (MIMO) Rayleigh fading channels assuming 3D
scattering around the mobile station (MS). Non-isotropic scattering
is assumed, and the Von Mises PDF of the angle of arrival (AOA) is
used. The resulting 3D based correlation functions contain general
non-isotropic 2D based functions, as well as isotropic 3D based
functions as special cases. It has been shown that non-isotropic
scattering increases the channel correlation as functions of the MS
antenna spacing. Also, as means of proving the validity of the
derived correlation functions, a multichannel autoregressive (AR)
simulation method is used to generate channel samples possessing
those correlation statistics"
}

@INPROCEEDINGS{AbuB0000:Wireless,
AUTHOR="Jaafar {Abu Bakar}",
TITLE="{Wireless-Wireline} Convergence: Challenges for Ubiquitous Connectivity",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
DAYS=3,
MONTH=dec,
YEAR=2007
}

@INPROCEEDINGS{AbuB0711:One,
AUTHOR="Ayman AbuBaker and Rami Qahwaji and Stan Ipson and Mohmmad Saleh",
TITLE="One Scan Connected Component Labeling Technique",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1283-1286",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Connected Component Labeling; Image Analysis; Mammograms",
ABSTRACT="This paper, presents a new component labeling algorithm which is based on
scanning and labeling the objects in a single scan. The algorithm has the
ability to test the four and eight connected braches of the object. This
algorithm, which is fast and requires low memory allocations, can also
process an image that contains large numbers of objects. The algorithm is
used to scan the image from left to right and from top to bottom to find
the unlabeled objects. A comparison analysis is performed with other
component labeling algorithms. Our algorithm has shown an outstanding
performance with respect to the processing time. A practical application
with computer based mammography is also included."
}

@INPROCEEDINGS{AbuB0711:Texture,
AUTHOR="Ayman AbuBaker and Rami Qahwaji and Stan Ipson",
TITLE="{Texture-Based} Feature Extraction for the Microcalcification from Digital
Mammogram Images",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="896-899",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Feature Extraction; False Positive; mammogram images; Statistical texture
analysis;",
ABSTRACT="This paper describes our ongoing efforts to provide efficient and accurate
classification for microcalcification clusters in mammogram images. In this
paper, a study on the characteristics of true microcalcification compared
to the falsely detected microcalcification is carried out using first and
second order statistical texture analysis techniques. Thus, features for
the first and second order are generated in order to reduce the false
positive (FP) ratio at the mammogram images. A study of these features is
presented in this paper. The statistical method presented here can
successfully reduce the ratio of false positives (FP) by 18\% without
affecting the ratio of true positives (TP) which is currently at 98\%."
}

@INPROCEEDINGS{AbuE0000:Bridging,
AUTHOR="Ahmad Abu-El-Haija",
TITLE="Bridging the Digital Divide in the Arab Countries",
BOOKTITLE="Mosharaka International Conference on Communications, Networking and
Information Technology",
ADDRESS="Amman, Jordan",
DAYS=6,
MONTH=dec,
YEAR=2007,
KEYWORDS="Digital Divide",
ABSTRACT={The Digital Divide is the divide between those who “Have” and are
effectively using Information Technology, and those who “Do not have”,
or they have, but are not using IT effectively. There are two dimensions of
the Digital Divide: the global divide (among nations), and the social
divide (within nations). All countries and groups are increasing their
access to and use of ICT, but “IT-have” countries and groups within
countries are increasing their access and use at such an exceptional rate.
Industrialized countries and privileged groups are increasing their access
and effective use of ICT in their daily work (home, business, government)
of at an exponential rate, and increasing productivity and lowering costs,
and have increased trade with each other
(through E-Commerce, E-Business and E-services (using the internet), and
hence more growth. At the same time, developed countries and non-privileged
groups have difficulty acquiring IT and using IT effectively because of the
relatively small number of those who can afford to buy computers
(illiteracy, low level of skills, high cost of access, speed of access,
cultural impediments, poor mastery of the English language, etc.). In this
presentation, we relate the digital divide with development, highlighting
the importance of avoiding the divide within the country and as compared
with other countries. Then we define the components for measuring the
digital divide in accordance
with international criteria, such as the {"}Digital Access Index{"}, which
is developed by the International telecommunication Union. Since education
is one of the measures of digital divide, we look at the UNESCO indicators
for ICT in education, with particular emphasis on Jordan and some Arabic
countries. Then we present some comparisons between countries to see where
we stand in the digital divide as compared with others. Finally, we explore
the methods and possibilities for bridging the digital divide and what are
the elements to achieve that.}
}

@INPROCEEDINGS{Abue0000:GCC,
AUTHOR="Muhammad Abuelma'atti",
TITLE="In {GCC} Universities Which Electrical and Computer Engineering Curricula
are Really Needed: Flexible or Specialized?",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="In most of the universities of the Gulf Corporation Council (GCC) countries
the electrical and computer engineering curricula have focused on narrow
specializations and technical subjects with extensive overlaps between
programs and neglected other dimensions like social, economical and ethical
issues. Restructuring the electrical and computer engineering education is
vital for the prosperity of GCC countries. This paper is an attempt to
present guidelines for such process by discussing the pros and cons of the
flexible and specialized electrical and computer engineering curricula."
}

@INPROCEEDINGS{Abue0703:Approach,
AUTHOR="Ali Abuelmaatti and Ian Thayne and Steve Beaumont",
TITLE="A new approach to {QPSK:} Mechanism and Implementation",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="The work reported in this paper serves two purposes. First, an alternative
comprehensive approach is proposed for the understanding of the mechanism
behind QPSK. This focuses on how a QPSK modulator decides to represent each
pair of bits by which of its four possible phase shifts. This approach is
based entirely on phasors analysis and is completely mathematical-less. The
second part of this work proposes a method by which complex modulation
schemes, like QPSK, can be implemented using only first degree components
in Simulink, avoiding all the hurdles of mathematically-complicated blocks.
The implementation in the second part confirms the viability of the
approach in the first part. Results show the data received on the other end
of a noiseless channel exactly matches the data sent despite the slight
inevitable delay."
}

@INPROCEEDINGS{Abue0703:BlueBridge,
AUTHOR="Omar Abuelmaatti and Anirach Mingkhwan and Madjid Merabti and Robert
Askwith",
TITLE="{BlueBridge:} A Wireless Interworking Architecture for the Ubiquitous Home",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="The plethora of networked multimedia services and ubiquitous devices have
ultimately changed the objective of networking to one that strives in
enabling the provision and interaction of network services. It is therefore
necessary especially in the home environment to consider the enhancement of
the way services are provided to the end user. To be able to realise such a
vision, a common interworking layer needs to be adopted. This allows all
the devices to use the same IP addressing domain and therefore be
considered as operating on one network. That would ultimately provide a
common networking layer for the applications. In doing so, we would enable
services to interact seamlessly without the needs of provision for roaming
and handover functionalities. In this paper we present BlueBridge, a
solution that provides seamless wireless interworking in the lower layers.
We detail its design and implementation and provide results that prove the
enhanced capabilities of its functionality."
}

@INPROCEEDINGS{Abue0709:TAPR,
AUTHOR="Mahmoud Abuelela and Stephan Olariu",
TITLE="{TAPR:} {Traffic-Adaptive} Packet Relaying in Vehicular Ad Hoc Networks",
BOOKTITLE="Fourth ACM International Workshop on Vehicular Ad Hoc Networks",
ADDRESS="Montréal, QC, Canada",
DAYS=10,
MONTH=sep,
YEAR=2007,
ABSTRACT="Recently, the problem of providing scalable routing in highway scenarios
has received a great deal of well-deserved attention. It is somewhat
surprising that most authors assume end-to-end connectivity between the
sender and receiver.

Our first contribution is to prove that even in reasonably dense
traffic, the probability of establishing an end-to-end route consisting
entirely of co-directional cars is rather small.
This counter-intuitive result confirms, quite unequivocally, the findings
of Little et al. [23] that routing in VANET must use both co-directional
and oncoming traffic.

Our second contribution is to develop a Traffic-Adaptive Packet Relaying
protocol (TAPR) that makes adaptive packet relaying decisions. Every car
running TAPR uses a simple strategy to decide whether to use co-directional
or oncoming traffic based on local traffic conditions. We prove that TAPR
is time-optimal in the sense that no other protocol can deliver a packet
faster.
The performance of TAPR in terms of packet relaying time and overhead has
been evaluated by extensive simulation."
}

@INPROCEEDINGS{AbuH0711:Enhanced,
AUTHOR="Eman Abu-Hammad and Faten Hamad and Khalid Kaabneh",
TITLE="Enhanced Skin Detection Technique Using Block Matching",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="21-24",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Image Processing; Skin Detection; Skin Neural Network",
ABSTRACT="Skin detection represents a challenge in recent years, due to the fact that
imaging conditions and illumination factor affect the resulted image. In
addition, human skin color has a wide range making it a tedious task to
target and extract. This paper addresses a novel method to detect skin in
still images. The detection approach is based on five face detection models
with integral modifications to increase detection rate in those models. Our
hybrid skin detection method is used to detect skin regions in images using
a block matching technique integrated over the resulted map of each model
to pick the most frequent block as the final result. The hybrid model
produced a better result in reference to the overall skin recall and
precision values when tested on a single and multiple subjects in an image."
}

@INPROCEEDINGS{Abuh0711:Robust,
AUTHOR="Hasan Abuhilal and Aykut Hocanin and Huseyin Bilgekul",
TITLE="Robust {MIMO-CDMA} Decorrelating Detector",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="732-735",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="MIMO CDMA, channel estimation error, timing errors, impulsive noise",
ABSTRACT="The multiuser detection of space coded, Multi Input Multi Output (MIMO),
Code Division Multiple Access (CDMA) signals in the downlink
direction with channel estimation error is investigated. The main challenge
in the system is dealing with  the errors in estimating the channel
coefficients  at the receiving antennas. The performance of the
decorrelating detector (DD) under different channel estimation errors,
timing errors, and impulsive noise is investigated. A new  Robust
decorrelating detector (RDD) is proposed which compensates the channel
estimation errors by modifying the channel matrix in the system. RDD also
deals with the timing errors by the modification of the spreading matrix,
and finally, it passes the impulsive components of the additive noise
through a robust non-linearity to reduce the impulsive effects. The results
show that the performance of the RDD is superior to that of the DD."
}

@INPROCEEDINGS{Abur0000:Comprehensive,
AUTHOR="Abdurazzag Aburas",
TITLE="Comprehensive Review for Arabic Handwriting and Printed Characters
Recognition",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="The characteristics of the Arabic character (handwritten or printed)make
great challenge in the field of automatic optical character recognition OCR
in terms of accuracy and recognition rate. This paper provides a
comprehensive review of the latest techniques and methods have been
proposed and their results. The characteristics of the handwriting Arabic
characters are also discussed in more detail. Finally, a new method based
on image compression is proposed to overcome the traditional OCR’s
problems as well as to achieve both higher accuracy and higher rate."
}

@INPROCEEDINGS{Abur0000:Handwriting,
AUTHOR="Abdurazzag Aburas",
TITLE="Handwriting Arabic Character Recognition using Haar Wavelet Compression",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="The typical Optical Character Recognition(OCR) systems, regardless the
character's nature, are based mainly on three stages, preprocessing,
features extraction and discrimination (recognizer). Each stage has its own
problems and effects on the system efficiency such as time consuming and
recognition errors. In order to avoid these difficulties this research
paper presents new construction of OCR system for handwriting Arabic
characters using a technique similar to that is used in wavelet
compression. The proposed algorithm obtained promising results in terms of
accuracy (reaches 97.9\% for some letters at average 80\%) as well as in
terms of time consuming."
}

@INPROCEEDINGS{Abur0703:SNR,
AUTHOR="Mosa Aburgheff and Lin Tang and Mingqi Li and Haifeng Wang",
TITLE="Novel {SNR} Analysis for Adaptive Modulation and Coding in Generalized
{OFDM} and Single Carrier Systems",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="GOFDM (Generalized OFDM) has been proposed as a tradeoff solution between
Cyclic Prefix Single Carrier (CPSC)and OFDM system that can alleviate the
Peak to Average Power Ratio (PAPR) problem of OFDM. In this paper, a novel
estimation method for the estimation of the received SNR of GOFDM signal
that is required in the Adaptive Modulation and Coding (AMC) is presented.
The simulation results of the estimated SNR show excellent correlation with
the analytical results. 
Furthermore, the received SNRs of the GOFDM exhibit repetition of as set
values that can be clustered for Modulation and Coding scheme (MCS)
allocation in group-based AMC.
The paper also presents various performances of the proposed GOFDM with AMC
and compares them with the corresponding performance of OFDM and CP-SC
under same operating conditions."
}

@INPROCEEDINGS{Abur0704:Linear,
AUTHOR="Sulaiman Aburakhia and Ehab Badran and Darwish {Abdel Aziz}",
TITLE="Linear Companding Transform for the Reduction of {Peak-to-Average} Power
Ratio of {OFDM} Signals",
BOOKTITLE="Wireless Telecommunications Symposium 2007",
ADDRESS="Pomona, California, USA",
DAYS=26,
MONTH=apr,
YEAR=2007,
ABSTRACT="A major drawback of orthogonal frequency-division multiplexing (OFDM)
signals is their high peak-to-average power ratio (PAPR), which causes
serious degradation in performance when a nonlinear power amplifier (PA) is
used. Companding transform is a well-known method to reduce PAPR without
restrictions on system parameters such as number of subcarriers, frame
format and constellation type. Recently, a linear nonsymmetrical companding
transform (LNST) that has a better performance than logarithmic-based
transform such as µ-law companding is proposed. In this paper, we propose
a new linear transform with more design flexibility than LNST, computer
simulations show that the proposed transform has a better PAPR reduction
and bit error rate (BER) performance than LNST with better power spectral
density (PSD), an excellent BER performance can be achieved by the proposed
transform with small input backoffs (IBO) to the power amplifier."
}

@INPROCEEDINGS{AbuS0000:Human,
AUTHOR="Mohammad Abd-Alrahman Mahmoud Abushariah and Raja Noor Ainon and Roziati
Zainuddin and Othman Khalifa",
TITLE="Human Computer Interaction Using {Isolated-Words} Speech Recognition
Technology",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="32-37",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="This research paper aims to develop an isolated-word automatic speech
recognition (IWASR) system based on Vector Quantization (VQ). This system
receives, analyzes, searches and matches an input speech signal with the
trained set of speech signals which are stored in the database/codebook,
and returns matching results to users. IWASR is meant to assist customers
calling a university's telephone operator to respond to their enquiries in
a convenient way using their natural speech. Callers
are assisted to select language, faculty and the staff name they wish to
contact. To extract features from speech signals, Mel-Frequency Cepstral
Coefficients (MFCC) algorithm was applied. Subsequently, Vector
Quantization was used for all feature vectors generated from the MFCC. A
codebook was resulted from training the VQ initial codebook and
experimental results showed that the recognition rate has been improved
with the increase of codebook size and showed that the codebook size of 81
feature vectors had a recognition rate exceeded 85\%."
}

@INPROCEEDINGS{Abus0709:Dual,
AUTHOR="Murad Abusubaih and Berthold Rathke and Adam Wolisz",
TITLE="A Dual Distance Measurement Scheme for Indoor {IEEE} {802.11} Wireless
Local Area Networks",
BOOKTITLE="The Ninth IFIP/IEEE International Conference on Mobile and Wireless
Communications Networks",
ADDRESS="Cork, Ireland",
DAYS=19,
MONTH=sep,
YEAR=2007,
KEYWORDS="Distance Estimation; IEEE802.11 WLANs",
ABSTRACT="Abstract — In this paper we address the problem of distance measurement
in indoor  IEEE 802.11 WLANs. The Received Signal Strength Indicator (RSSI)
and the Signal Propagation Time (SPT) have been widely used for distance
estimation in indoor  WLAN deployments. However, neither approach by itself
is accurate. Moreover, there is no mean by which WLAN nodes know whether
the estimated distance is accurate or not. In this work we combine an RSSI
and a propagation time - based schemes and utilize both results for mutual
cross-validation. The performance of our combined mechanism has been
evaluated through real experiments."
}

@INPROCEEDINGS{Abus0710:Optimal,
AUTHOR="Murad Abusubaih and Adam Wolisz",
TITLE="An Optimal Station Association Policy for {Multi-Rate} {IEEE802.11}
Wireless {LANs}",
BOOKTITLE="10th ACM-IEEE International Symposium on Modeling, Analysis and Simulation
of Wireless and Mobile Systems",
ADDRESS="Chania, Crete Island, Greece",
DAYS=22,
MONTH=oct,
YEAR=2007,
KEYWORDS="Optimal Association; AP Selection; Self-Managed WLANs; IEEE802.11",
ABSTRACT="In wireless local area networks (WLANs) often a station can potentially
associate   with more than one Access Point (AP). In IEEE 802.11, the
station simply   associates to the AP from which it has received the
strongest signal during the scanning process. However, this may result in a
significant load imbalance   between several APs since some of them might
be highly loaded while others are lightly loaded or even idle. Moreover,
the multi-rate flexibility provided by  several IEEE 802.11 variants can
cause low bit rate stations to negatively affect high bit rate ones and
consequently degrade the overall network throughput.  Therefore, a relevant
question is how to optimally distribute stations among APs so as to
maximize the overall network performance. This paper presents a centralized
optimal association policy for IEEE 802.11 WLANs. We first derive the
optimal solution for stations association. Then, we evaluate the
effectiveness of   the solution through the results obtained from Lingo
optimization and NCTUns simulation packages."
}

@INPROCEEDINGS{AbuS0711:Ensemble,
AUTHOR="Shadi Abu-Surra and William Ryan and Dariush Divsalar",
TITLE="Ensemble Enumerators for {Protograph-Based} Generalized {LDPC} Codes",
BOOKTITLE="IEEE Globecom 2007 Communication Theory Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="Protograph-based LDPC codes have the advantages of a simple design (or
search) procedure and highly structured encoders and decoders. These
advantages have also been exploited in the design of protograph-based
generalized LDPC (G-LDPC) codes. Recently, a technique for computing
ensemble weight enumerators and stopping set enumerators for
protograph-based LDPC codes has been published. In the current paper, we
extend those results to protograph-based G-LDPC codes. That is, we first
derive ensemble weight and stopping set enumerators for finite-length
G-LDPC
codes based on protographs, and then we consider the asymptotic case. In
the
weight enumerator case, the asymptotic results allow us to determine
whether
or not the typical minimum distance in the ensemble grows linearly with
codeword length. In the stopping set enumerator case, the asymptotic
results
allows us to determine whether or not the typical smallest stopping set
size
grows linearly with codeword length."
}

@INPROCEEDINGS{Abus0711:TARP,
AUTHOR="Loay Abusalah and Ashfaq Khokhar",
TITLE="{TARP} Performance in a Mobile World",
BOOKTITLE="IEEE Globecom 2007 Ad-hoc and Sensor Networking Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="Trust-Aware Routing Protocol (TARP) has been proposed as a secure-trusted
Ad-hoc routing protocol. In TARP security is inherently built into the
routing protocol where each node evaluates the trust level of its neighbors
based on a set of attributes. In this paper, we study TARP performance
using different mobility models. Three important mobility models are
considered, namely, Random Waypoint, Manhattan Grid and Reference Point
Group Mobility (RPGM). The study shows the packet delivery ratio, network
delay, routing overhead and the energy consumption versus mobility using
the three different mobility models. The application of these models will
enhance the realism of simulation to actual real life mobility in an urban
or military setup scenario."
}

@INPROCEEDINGS{Abut0706:Joint,
AUTHOR="Mohammed Abuthinien and Sheng Chen and Andreas Wolfgang and Lajos Hanzo",
TITLE="Joint Maximum Likelihood Channel Estimation and Data Detection for {MIMO}
Systems",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Blind and semiblind adaptive schemes are proposed for joint maximum
likelihood 
(ML) channel estimation and data detection for multiple-input
multiple-output 
(MIMO) systems. The joint ML optimisation over channel and data is
decomposed 
into an iterative two-level optimisation loop. An efficient global
optimisation 
search algorithm called the repeated weighted boosting search is employed
at the 
upper level to identify the unknown MIMO channel model while an enhanced ML

sphere detector called the optimised hierarchy reduced search algorithm
aided ML 
detector is used at the lower level to perform the ML detection of the 
transmitted data. A simulation example is included to demonstrate the 
effectiveness of these two schemes."
}

@INPROCEEDINGS{Acco0702:Kundenkarten,
AUTHOR="Rafael Accorsi and Martin Kaehmer",
TITLE="Kundenkarten in hochdynamischen Systemen: Von einer Gefährdung zum Schutz
der Privatsphäre",
BOOKTITLE="KiVS'07 Workshop Netzwerksicherheit - Sichere Netzwerkkonfiguration
(NETSEC'07)",
ADDRESS="Bern, Switzerland",
DAYS=27,
MONTH=feb,
YEAR=2007,
ABSTRACT="Durch den Einsatz von Technologien des Ubiquitous Computing wie
RFID-Tags, Sensor- und Funknetze wandeln sich Einkaufsläden in
hochdynamische Systeme, in denen die Kundenbindung durch personalisierte
Dienste wie individuelle Werbung möglich ist. In Kombination mit
Kundenkarten greifen diese Ansätze jedoch tief in die Privatsphäre der
Kunden ein, so dass diese den Technikeinsatz bereits heute abzulehnen
drohen. Um dem entgegenzutreten, wird in diesem Beitrag ein Weg
aufgezeigt, wie Kundenkarten stattdessen auch zum Schutz der
Privatsphäre in hochdynamischen Systemen verwendet werden können.
Schwerpunkt dieses Beitrags ist die Erweiterung der Policy-Sprache NAPS
um Operatoren, die Vergleich und Differenz zweier Richtlinien
ermöglichen."
}

@INPROCEEDINGS{Aceb0708:Fully,
AUTHOR="Juan Acebron and Renato Spigler",
TITLE="A fully scalable parallel algorithm for solving elliptic partial
differential equations",
BOOKTITLE="Parallel numerical algorithms",
ADDRESS="Rennes, France",
DAYS=28,
MONTH=aug,
YEAR=2007,
KEYWORDS="Parallel numerical algorithms; Scalability; Monte Carlo methods;Domain
Decomposition",
ABSTRACT="A comparison is made between the probabilistic domain decomposition (DD)
method and a certain deterministic DD method for solving linear elliptic
boundary-value problems. Since in the deterministic approach the CPU time
is affected by intercommunications among the processors, it turns out that
the probabilistic method performs better, especially when the number of
subdomains (hence, of processors) is increased. This fact is clearly
illustrated by some examples. The probabilistic DD algorithm has been
implemented in an MPI environment, in order to exploit distributed
computer
architectures. Scalability and fault-tolerance of the probabilistic DD
algorithm are emphasized."
}

@ARTICLE{Acem0705:Competition,
AUTHOR="Daron Acemoglu and Asuman Ozdaglar",
TITLE="Competition in {Parallel-Serial} Networks",
JOURNAL="IEEE Journal on Selected Areas in Communications NON-COOPERATIVE BEHAVIOR
IN NETWORKING",
DAYS=1,
MONTH=may,
YEAR=2007,
ABSTRACT="We study the efficiency implications of competition among
profit-maximizing service providers in communication networks.
Service providers set prices for transmission of flows through
their (sub)network. The central question is whether the presence
of prices will help or hinder network performance. We investigate
this question by considering the difference between users'
willingness to pay and delay costs as the efficiency metric.
Previous work has demonstrated that in networks consisting of
parallel links, efficiency losses from competition are bounded.
Nevertheless, parallel-link networks are special, and in most
networks, traffic has to simultaneously traverse links (or
subnetworks) operated by independent service providers. The
simplest network topology allowing for this feature is the
parallel-serial structure, which we study in this paper. In
contrast to existing results, we show that in the presence of
serial links, the efficiency loss relative to the social optimum
can be arbitrarily large. The reason for this degradation of
performance is the double marginalization problem, whereby
each serial provider charges high prices not taking into account
the effect of this strategy on the profits of other providers
along the same path. Nevertheless, when there are no delay costs
without transmission (i.e., latencies at zero are equal to zero),
irrespective of the number of serial and parallel providers, the
efficiency of strong oligopoly equilibria can be bounded by 1/2,
where strong oligopoly equilibria are equilibria in which each
provider plays a strict best response and all of the traffic is
transmitted."
}

@ARTICLE{Acem0705:Partially,
AUTHOR="Daron Acemoglu and Ramesh Johari and Asuman Ozdaglar",
TITLE="Partially Optimal Routing",
JOURNAL="IEEE Journal on Selected Areas in Communications NON-COOPERATIVE BEHAVIOR
IN NETWORKING",
DAYS=1,
MONTH=may,
YEAR=2007,
ABSTRACT="Most large-scale communication networks, such as the Internet,
consist of interconnected administrative domains. While source (or
selfish) routing, where transmission follows the least cost path
for each source, is reasonable across domains, service providers
typically engage in traffic engineering to improve operating
performance within their own network. Motivated by this
observation, we develop and analyze a model of {\em partially
optimal routing}, where optimal routing within subnetworks is
overlaid with selfish routing across domains. We demonstrate that
optimal routing within a subnetwork does not necessarily improve
the performance of the overall network. In particular, when
Braess' paradox occurs in the network, partially optimal routing
may lead to worse overall network performance. We provide bounds
on the worst-case loss of efficiency that can occur due to
partially optimal routing. For example, when all congestion costs
can be represented by affine latency functions and all
administrative domains have a single entry and exit point, the
worst-case loss of efficiency is no worse than 25\\% relative to
the optimal solution. In the presence of administrative domains
incorporating multiple entry and/or exit points, however, the performance
of partially optimal routing can be arbitrarily inefficient even
with linear latencies. We also provide conditions for traffic
engineering to be individually optimal for service providers."
}

@INPROCEEDINGS{Acer0709:Weak,
AUTHOR="Utku Acer and Shivkumar Kalyanaraman and Alhussein Abouzeid",
TITLE="Weak State Routing for Large Scale Dynamic Networks",
BOOKTITLE="13th Annual International Conference on Mobile Computing and Networking",
ADDRESS="Montreal, Canada",
DAYS=10,
MONTH=sep,
YEAR=2007,
ABSTRACT={Routing in ad-hoc networks involves the indirection from a
persistent name (or ID) to a locator. In a mobile network, the
locator and ID-to-locator mappings are both dynamic. Geographic
routing helps reduce the number and dynamism complexity of bindings
by exploiting the cartesian properties. However, ID-to-location
indirection is still a problem in geographic routing and nodes
require an efficient location service which records the locations of
every node in the network.

In this paper, we propose a mechanism; Weak State Routing (WSR) for
mobile and large networks (with hundreds of nodes), which
accomplishes routing using {"}random walks{"} biased by
destination-injected state information. Unlike traditional routing
table state, the state information is {"}weak{"}, i.e. interpreted
not as absolute truth, but as {"}probabilistic hints{"}. Nodes only
have partial information on the region a destination node is likely
to be. This method also allows us to {"}aggregate{"} information
about a number of remote locations in a geographic region. In other
words, the state information maps a {"}set-of-IDs{"} to a 
{"}geographical region{"}. The intermediate nodes receiving the random
walk use a method similar to longest-prefix-match in order to
prioritize their mappings to decide how to bias the random walk.

Through an extensive set of simulations for up to 1000 mobile nodes,
with node speed up to 20 m/s, we show that WSR offers a high packet
delivery ratio, more than 98\%. The total overhead incurred in the
network scales as O(N) for N-node networks. Due to the
aggregation of state information, WSR also scales well in storage
complexity. The total state information required is O(N^(3/2)) and
state information is distributed evenly. We compare WSR with Dynamic
Source Routing (DSR) and geographic routing combined with Grid
Location Service (GLS). Our results indicate that WSR delivers more
packets with less overhead. The price paid by WSR is the increased
path length.}
}

@INPROCEEDINGS{Acha0000:Real,
AUTHOR="Arup Acharya and Nilanjan Banerjee and Bikram Sengupta and Xiping Wang and
Charles Wright",
TITLE="Real-time monitoring of {SIP} infrastructure using message classification",
BOOKTITLE="Third Workshop on Mining Network Data (MineNet 2007)",
ADDRESS="San Diego, USA",
DAYS=12,
MONTH=jun,
YEAR=2007,
KEYWORDS="Session Initiation Protocol, Management, VoIP, State machine,",
ABSTRACT="Session Initiation Protocol (SIP) is a control-plane protocol for multiple
services such as VoIP, Instant Messaging and Presence, and in addition, is
key to IP Multimedia Subsystem (IMS).  A SIP message consists of plain-text
headers and their corresponding values, which are used to route the message
between one or more endpoints, resulting in a media session. These headers
and values are often re-written at intermediate SIP servers
(“proxies”). It is important to monitor the transformation of such
messages in real-time, as they progress end-to-end, for system-wide
diagnostics. We designed and implemented a programmable in-kernel Linux SIP
message classification engine, that can be programmed to monitor incoming
and outgoing SIP messages from a server.  We build upon this information to
infer the state of a SIP session on individual servers on the call path and
aggregated call-state. Primarily, two categories of problems can be
identified in the domain of SIP network management. They are (i) functional
testing of SIP overlay network by monitoring synthetic SIP dialogs or
sessions; and (ii) real-time end-to-end monitoring of SIP dialogs or
sessions and gather aggregate dialog or session information for network
management. The first one helps resolving issues with malfunctioning or
ill-configured SIP entities (servers, proxies, and user agents), while the
second helps in the deployment of appropriate network management techniques
such as load balancing to ensure efficient network operation."
}

@INPROCEEDINGS{Acha0706:Framework,
AUTHOR="Joydeep Acharya and Roy Yates",
TITLE="A Framework for Dynamic Spectrum Sharing between Cognitive Radios",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We consider a cognitive radio system like the future 802.22 networks where
license-exempt service providers (SPs) will share a fixed spectrum in a
non-interference basis to each other and also to the licensed users in that
spectrum. The percentage of spectrum utilized by one SP depends on how many
users it is serving and how much spectrum each user application demands. We
assume that an user can obtain service from all the SPs. The quality of
service depends on system parameters such as number of users and SPs, the
channel conditions between the users and SPs and the total power available
at each user. We adopt an user utility maximization framework to analyze
this system. Given the user utility functions, and the above mentioned
system parameters we derive optimal values of spectrum that the users
should obtain from the SPs. We also introduce the notion of spectrum price
and use it to demonstrate several key results about spectrum allocation.
The spectrum price proves to be the regulatory mechanism that brings about
coordination amongst the SPs with minimal control messaging. Our approach
thus strikes a balance between a centralized network and a fully
uncoordinated open access network."
}

@INPROCEEDINGS{Acha0712:,
AUTHOR="Arup Acharya and Xiping Wang and Charles Wright",
TITLE="A Programmable Message Classification Engine for Session Initiation
Protocol {(SIP)}",
BOOKTITLE="Symposium on Architectures for Networking and Communications Systems",
ADDRESS="Orlando, Florida, USA",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="Session Initiation Protocol (SIP) has begun to be widely deployed for
multiple services such as VoIP, Instant Messaging and Presence. Each of
these services uses different subsets of SIP messages, and depending on the
value of a service, e.g. revenue, the associated messages may need to be
prioritized accordingly. Even within the same service, different messages
may be assigned different priorities.  In this paper, we present the design
and implementation of a programmable classification engine for SIP messages
in the Linux kernel. This design uses a novel algorithm that in addition to
classifying messages can extract and maintain state information across
multiple messages. We apply the classifier for overload control using
operator-specified rules for categorizing messages and associated actions,
augmented with a protocol-level understanding of SIP message structure. 
When faced with loads beyond their capacity (e.g., during catastrophic
situations and major network outages),   SIP servers must drop messages
from the input stream.  It is therefore desirable that the server process
high-value messages in preference to dropping lower-value messages. We
evaluated our in-kernel classifier implementation with a commonly-used open
source SIP server (SER) for such an overload scenario. The workload
consists of a mix of call setup and call handoff SIP messages and the
classifier is programmed with rules that prioritize handoffs over call
setups (reflecting typical message prioritization used by mobile service
providers).   We show that, while SER can process about 40K  messages/sec
(in a FIFO manner), our classifier can examine  and prioritize about 105K
messages/sec  during overload.  With the classifier operating at peak
throughput, SER’s processing rate drops to about  31.6 K messages/sec,
but it should be noted that the processed messages  reflect as much of the
high-value messages as available in the input stream."
}

@INPROCEEDINGS{Achm0000:Visual,
AUTHOR="Balza Achmad and Mohd Noh Karsiti",
TITLE="{Visual-Based} Fuzzy Navigation System for Mobile Robot: Wall And Corridor
Follower",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="fuzzy controller; mobile robot navigation; visual-based system",
ABSTRACT="This paper presents the development of a visual–based fuzzy navigation
system that enables a mobile robot in moving through a corridor or
following a wall. The system employs a camera to detect the existence of
walls on the left, the right, and the front of the robot. A mamdani-type
fuzzy logic controller uses the information gathered by the camera to
determine the turning angle and the speed of the robot. The fuzzy system is
tested using an OpenGL-based 3D simulator that capable in animating the
movement of the robot as well as generating the images captured by the
camera. The results of the test confirm that the controller shows a good
performance in navigating the robot."
}

@INPROCEEDINGS{Acht0010:ARPD,
AUTHOR="Andreas Achtzehn and Christian Rohner and Ioana Rodhe",
TITLE="{ARPD:} Asynchronous random key predistribution in the {LEAP} framework for
Wireless Sensor Networks",
BOOKTITLE="3rd IEEE International Workshop on Wireless and Sensor Networks Security",
ADDRESS="Pisa, Italy",
DAYS=8,
MONTH=oct,
YEAR=2007,
ABSTRACT="In the LEAP framework for wireless sensor networks a set of keys is used to
secure communication. LEAP distinguishes between unicast (pairwise)
communication, group (cluster) communication and global (broadcast)
communication. Keys in pairwise communication are derived from an initial
key KI nodes are equipped with prior to deployment and that is deleted
after link setup. Further keys are distributed encrypted with these
pairwise keys. If the initial key is ever disclosed, the whole network is
compromised. To lower the threat of KI disclosure, we present a novel KI
-less scheme for key predistribution. Our scheme is based on random key
predistribution, and proves to perform better in medium sized networks than
previous proposals. It is resilient against node capture attacks and allows
node to node authentication. Attacks against overlying protocols in the
network are more difficult with this scheme. We have conducted computations
to show the feasibility of our scheme for networks up to a size of 1000
nodes. By introducing a key reuse system we are able to increase the
probability of a successful link setup. We have included a security
analysis that discusses our scheme’s resistance against commonly known
attacks."
}

@INPROCEEDINGS{Acke0704:Dynamic,
AUTHOR="David Acker and Sarvesh Kulkarni",
TITLE="A Dynamic Load Dispersion Algorithm for {Load-Balancing} in a Heterogeneous
Grid System",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="The ever changing demands on computational resources has information
systems managers looking for solutions that are more flexible then before.
Using a “bigger box” that has more and faster processors, more random
access memory (RAM), and more and faster permanent storage is not a viable
solution as the system usage patterns vary. In order for the system to
handle the peak load adequately, it must also go underutilized much of the
time. A grid based distributed system can solve this problem by allowing
multiple jobs to run over a network of heterogeneous computers. Large jobs
can consume large amounts of resources while smaller jobs can consume
single systems. Capacity can be added over time in a dynamic fashion.
Keeping the workload represented by these jobs balanced over the network of
computers requires network-aware scheduling algorithms that are dynamic,
transparent, scalable, and quick. We present such an algorithm that handles
load-balancing of jobs submitted at any point in the grid. Our algorithm
accommodates jobs with differing CPU and I/O requirements and load-balances
them over varying grid loads and varying network latencies."
}

@INPROCEEDINGS{Acke0709:Agile,
AUTHOR="Brant Ackerman",
TITLE="Agile Rapid Global Combat Support {(ARGCS)}",
BOOKTITLE="AUTOTESTCON 2007",
ADDRESS="Baltimore, MD, USA",
DAYS=17,
MONTH=sep,
YEAR=2007,
ABSTRACT="The Agile Rapid Global Combat Support (ARGCS) Advanced Concept Technology
Demonstration uses emerging test technologies to integrate automatic test
system (ATS) hardware and software with a net-centric support system to
improve electronic systems maintenance.  The ARGCS concept is a Department
of Defense common core system using complementary measurement hardware and
software to meet specific test and diagnostics requirements.  As an ACTD
the ARGCS program is being conducted to quickly assess new technologies
that could affect warfighter capabilities.  This is not a full blown
acquisition program but a quick technology demonstration.

	The ARGCS system is designed to be interoperable with existing test
program sets (TPS), making it rapidly reconfigurable for work on different
equipment across the Services.  An integrated diagnostic feedback
capability will be included so that data captured during the maintenance
cycle can be reused.  The ARGCS will be capable of providing diagnostic
support at the organizational, intermediate, depot, and factory levels of
maintenance.  ARGCS is intended to be easily and quickly deployable
worldwide with reduced airlift requirements over current ATS.

As an ACTD program there will be Military Utility Assessments performed at
various locations and across all 4 services to assess if ARGCS can improve
the following warfighter problems in regards to existng ATE and echelons of
maintenance throughout the Department of Defense. 

Problem 1 SYSTEM INTEROPERABILITY:  Lack of interoperability between
Services’ support equipment (and limited interoperability between each
Service’s Organizational and Intermediate maintenance levels) is
prohibiting correlated/integrated weapon system support necessary in
today’s Joint Operational Environment which requires interoperability for
Integrated Diagnostics, Knowledge Based Diagnostics, Weapon System Health
Management, and Common Support Systems (CSS).   No fluent ability to
utilize Joint service Logistical resources.  Additionally, there is no
interoperability with Coalition Services. All of this prohibits initiatives
such as regional maintenance. 

Problem 2 SYSTEM FIELDING TO SUPPORT FIELDING:  Excessive delays in
providing support to the War Fighter for new or upgraded weapon system. 
Support equipment sometimes lags introduction of weapon systems by several
years.

Problem 3 SYSTEM PERFORMANCE:  The performance accuracy required by
today’s newly deployed weapon systems is quickly surpassing the technical
capability of existing CSS. The testing of integrated weapon systems
requires sophisticated CSS to accurately verify functional performance of
the weapon system, diagnose, and identify faults. Current Support Systems
are experiencing difficulties in deploying rapidly to meet world mission
demands.  Further, much of today’s CSS cannot be upgraded to meet
tomorrow’s weapon system performance requirements.

Problem 4 SUPPORT COSTS:  Support costs are rising significantly as the
hundreds of ageing DoD combat support systems (mostly designed in the70s
and 80s) become obsolete.  Advances in technology and obsolescence of
equipment are driving many CSS systems toward major product improvements to
continue supporting legacy systems and implementing new test and diagnostic
capability required by new weapon system designs. 

Problem 5 PROLIFERATION/SYSTEM SUPPORT/MAINTAINABILITY:  Proliferation of
test system types and old technology drives huge logistic footprints
(volume/weight), which lengthen time to deploy and inflate required
resources (spares, personnel and facilities).  

Problem 6 MARGINAL TESTING PERFORMANCE SCALABILITY: Existing CSSs are not
scalable, are too slow, have high CNV/NEOF/RTOK/A799 rates, and do not
support multiple levels of maintenance.

The ARGCS Military Utility Assessments (MUA) will complete in August 2007. 
MUA are set up to assess if ARGCS technolgies can solve warfighting
problems and address the problems discusse above.  At the conclusion of the
MUA events the ARGCS opertional manager will produce a final report
recommending what technologies should be transitioned into each Services
Program of record (POR) for Automeated test Equipment (ATE).

Those technologies will be transitioned into POR thorugh the DoD Joint
Capabilities Integration and Development System (JCIDS).

For the Autotestcon Panel the ARGCS Operational Manager and may of the
warfighters used during the military assessments will be presenting results
of the ARGCS ACTD and avaialable for questions and discussion."
}

@INPROCEEDINGS{Acol0706:Space,
AUTHOR="Kodzovi Acolatse and Yeheskel Bar-Ness",
TITLE="Space Time Block Coding {HARQ} scheme for Highly Frequency Selective
Channels",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We proposed a Hybrid Automatic Repeat reQuest (HARQ) packet transmission
scheme for a Multiple Input Multiple Output (MIMO) system  in a frequency
selective fading channel.   The scheme combines Alamouti space-frequency
block coding with MIMO-HARQ and single-carrier frequency domain
equalization (SC-FDE). It is shown the technique works in a frequency flat
fading channel as well."
}

@INPROCEEDINGS{Acs0010:Security,
AUTHOR="Gergely Acs and Levente Buttyan and Istvan Vajda",
TITLE="The Security Proof of a Link-state Routing Protocol for Wireless Sensor
Networks",
BOOKTITLE="3rd IEEE International Workshop on Wireless and Sensor Networks Security",
ADDRESS="Pisa, Italy",
DAYS=8,
MONTH=oct,
YEAR=2007,
ABSTRACT="In this work, we present a flexible and mathematically rigorous formal
model to analyze the security of wireless sensor network
routing protocols. Our framework involves a powerful adversary model
that allows for insider attack, where the adversary is assumed to
control legitimate nodes in the network. Additionally, we demonstrate
the strength of our model by proving that INSENS (Intrusion-Tolerant
Routing in Wireless Sensor Networks), which is a secure sensor network
routing protocol, is indeed secure in our model. Finally, we show
the benefit of formal reasoning with respect to routing security in
sensor networks: we identify an important design principle of secure
link-state routing protocols, which might not be apparent immediately
using only informal security analysis."
}

@INPROCEEDINGS{Acto0704:Inverse,
AUTHOR="Randal Acton and Nathan Friess and John Aycock",
TITLE="Inverse Geolocation: Worms with a Sense of Direction",
BOOKTITLE="2nd International Swarm Intelligence \& Other Forms of Malware Workshop",
ADDRESS="New Orleans, Louisiana, USA",
DAYS=11,
MONTH=apr,
YEAR=2007,
ABSTRACT="Mapping Internet addresses into physical locations is accomplished
through geolocation and reverse geolocation, two different but
related problems.  We introduce a third problem, inverse geolocation,
which can be used by worms to locate potential targets. Techniques
for inverse geolocation are presented, along with a discussion of
defenses... assuming inverse geolocation can be prevented at all."
}

@INPROCEEDINGS{Adac0712:Acoustic,
AUTHOR="Yoshihiro Adachi",
TITLE="Acoustic Features for Estimation of Perceptional Similarity.",
BOOKTITLE="Pacific-Rim Conference on Multimedia",
ADDRESS="City University of Hong Kong, Hong Kong",
DAYS=11,
MONTH=dec,
YEAR=2007,
KEYWORDS="Perception similarity; Physical similarity; Acoustic features; Spearman's
rank correlation coefficient",
ABSTRACT="This paper describes examination of the acoustic features for the
estimation of perceptional similarity between speeches. We firstly extract
some acoustic features including personality from speeches of 36 persons.
Secondly, we calculate each distance between extracted features using
Gaussian Mixture Model (GMM) or Dynamic Time Warping DTW, and then we sort
speeches based on the physical similarity. On the other hand, there is the
permutation based on the perceptional similarity which is sorted according
to the subject. We evaluate the physical features by the Spearman's rank
correlation coefficient with two permutations. Consequently, the results
show that DTW distance with MFCC is a optimum feature for estimation of
perceptional similarity."
}

@INPROCEEDINGS{Adac0712:Delay,
AUTHOR="Fumiyuki Adachi and Kazuki Takeda",
TITLE="{Delay-time/Code} Division Multi-access for Uplink Transmission In A
Frequency-selective Fading Channel",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="637-641",
DAYS=3,
MONTH=dec,
YEAR=2007,
KEYWORDS="multi-access; delay-time domain; MMSE-FDE",
ABSTRACT="Since the broadband wireless channel is composed of many propagation paths
having different time delays, the bit error rate (BER) performance of
direct sequence-code division multi-access (DS-CDMA) using rake combining
significantly degrades due to strong inter-chip interference (ICI) arising
from frequency-selective fading channel. Frequency-domain equalization
(FDE) based on the minimum mean square error (MMSE) criterion can improve
the BER performance of DS-CDMA downlink (base-to-mobile) by obtaining the
frequency diversity gain while suppressing the ICI. However, in the uplink
(mobile-to-base) case, since different user signals go through different
channels, the orthogonality among different user signals is severely
distorted and therefore, strong multi-access interference (MAI) is
produced. The BER performance of DS-CDMA uplink significantly degrades due
to the MAI even if MMSE-FDE is used.
In this paper, we propose a new hybrid multi-access technique called
delay-time/code division multi-access (DT/CDMA) for the uplink
transmission. Chip-spaced discrete-time representation is used. U users are
simultaneously transmitting their data to a base station. In DT/CDMA, each
user’s data symbol is spread by the same spreading sequence with the
spreading factor SF having a user specific cyclic time delay. The uth user
is given a cyclic time delay of uD chips, u=0~U-1. After inserting the
cyclic prefix into the Ng-sample guard interval (GI), the spread signal is
transmitted.
The channel is assumed to be composed of L distinct paths, each having an
integer multiple of chip length Tc. A superposition of U user signals is
received at the base station. After applying SF-point fast Fourier
transform (FFT) to transform the received signal into the frequency-domain
signal, FDE is carried out. After FDE, the frequency-domain signal is
transformed by SF-point inverse FFT (IFFT) into a delay-time domain signal.
Using the FDE weight which can remove the spreading sequence and desired
user’s cyclic time delay, different user's received signals are
superimposed but not to overlap in delay-time domain. If the minimum cyclic
time delay is set less than the GI length, the desired user's signal can be
separated without MAI. The decision variable can be obtained by using the
delay-time domain channel matched filter. However, since the amplitude of
the spreading sequence varies in frequency-domain, this method produces the
noise enhancement. To avoid the noise enhancement and to equalize the
channel simultaneously, we derive the MMSE weight that can separate
different users while obtaining the frequency diversity gain (its
derivation is omitted for the sake of brevity, but will be shown in the
final paper).
The uplink BER performance in a strong frequency-selective channel is
evaluated by computer simulation. We assume an L=16-path frequency
selective Rayleigh fading channel having uniform power delay profile. The
maximum delay time difference of the channel is assumed to be less than the
GI length. A long pseudo noise (PN) sequence is used as the spreading
sequence. The BER performance of conventional DS-CDMA using MMSE-FDE
significantly degrades due to the strong MAI. However, the BER performance
of DT/CDMA is significantly improved since all the users can be separated
in delay-time domain. It is shown that the BER performance of DT/CDMA is
much better than that of conventional CDMA."
}

@INPROCEEDINGS{Adam0704:Medium,
AUTHOR="Athanassios Adamis and Konstantinos Maliatsos and Philip Constantinou",
TITLE="A New Medium Access Control Protocol with Control Channel {Auto-Discovery}
for {Self-Deployed} Cognitive Radio Networks",
BOOKTITLE="European Wireless 2007",
ADDRESS="Paris, France",
DAYS=1,
MONTH=apr,
YEAR=2007,
ABSTRACT="The old-dated spectrum regulations have lead to a spectrum shortage
problem. This problem isn't actually real since many frequency bands are
not used efficiently. Spectrum Pooling and unlicensed spectrum access as
enabled by Cognitive Radios (CR) can compensate for the spectrum scarcity
and optimize spectral utilization. The common problem among many proposed
CR architectures that operate in an unlicensed-overlay manner is the lack
of a dedicated control channel. In this paper a novel idea is proposed, to
also use a different unlicensed band as the control channel which, though,
must have some special characteristics. This Band is auto-discovered by CR
terminals and is used to convey signaling and control messages. A new MAC
has been also developed that operates on two different unlicensed bands,
one for control and signaling information conveyance and the other for
actual data traffic. The protocol has been implemented and evaluated in an
OPNET based Simulator."
}

@INPROCEEDINGS{Adam0705:Development,
AUTHOR="Davide Adami and Stefano Giordano and Fabio Mustacchio and Michele Pagano",
TITLE="Design and development of a {DS-TE} experimental testbed with {P2MP} {LSP}
support",
BOOKTITLE="3rd Euro-NGI Conference on Next Generation Internet Networks - Design and
Engineering for Heterogeneity",
ADDRESS="Trondheim, Norway",
DAYS=21,
MONTH=may,
YEAR=2007,
ABSTRACT="Nowadays, many IP backbone networks adopt separate control and forwarding
planes for unicast and multicast traffic flows. Indeed, while MPLS
(Multiprotocol Label Switching) is widely deployed for unicast traffic,  IP
multicast is the only available solution for the delivery of
“one-to-many” traffic flows. With P2MP LSPs (Point-to-Multipoint Label
Switched Paths) support, a unified control and forwading plane may be
devised. Such a reduction in the number of protocols used in the core of
the network as well as in the number of encapsulations in the data plane,
results in simplified network operations. 
The paper discusses the design and the development of the control and data
planes extensions needed to provide P2MP LSP support in an MPLS network. In
particular, such signalling and forwarding mechanisms have been implemented
in a network testbed based on open-source routers. Finally, tests have been
performed to assess the new mechanisms from both an operational and
performance point-of-view."
}

@INPROCEEDINGS{Adam0706:Adaptive,
AUTHOR="Janet Adams and Gabriel-Miro Muntean",
TITLE="{Adaptive-Buffer} Power Save Mechanism for Mobile Multimedia Streaming",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Wireless networks are becoming a part of everyday life for many people.
When a mobile device has wireless LAN capability, multimedia content can be
streamed over a wireless network to that device. However, a major
disadvantage of all mobile devices is their limited battery lifetime.
Multimedia streaming puts extra pressure on the battery, causing it to
discharge faster. In some cases, streaming tasks cannot be completed purely
because the battery of the device becomes fully discharged, which causes
significant user dissatisfaction. Consequently, it is necessary to devise
mechanisms to enable longer battery lifetime in order to support complex
applications such as mobile multimedia streaming.

This paper proposes an Adaptive-Buffer Power Save mechanism (AB-PSM) for
increasing the battery life of mobile devices during multimedia streaming.
This increase is achieved by controlling how and when data is sent over a
wireless LAN. AB-PSM introduces an additional buffer which hides data from
the station it is intended for, allowing it to return to sleep and
consequently saving power. Data is eventually delivered in one of the
station's following attempts to receive it. Tests involving AB-PSM have
been performed and show good results in terms of significant increases in
battery lifetime. The comparison between AB-PSM and the IEEE 802.11 legacy
power save mechanism shows important increases in battery lifetime of more
than 100\%"
}

@INPROCEEDINGS{Adam0706:Path,
AUTHOR="Davide Adami and Christian Callegari and Stefano Giordano and Michele
Pagano",
TITLE="A New Path Computation Algorithm and its Implementation in {NS2}",
BOOKTITLE="ICC 2007 Communications QoS, Reliability and Performance Modelling
Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Originally conceived as a fast forwarding technique, MPLS provides support
for Traffic Engineering and network survivability. Constrained-based path
computation is a key building block for Traffic Engineering in MPLS
networks, since it allows to select a path that satisfies assigned QoS
requirements. In this paper, we introduce a novel path computation
procedure  which aims at improving the performance of the well-known
Wang-Crowcroft algorithm by means of some heuristics. Moreover, the two
algorithms have been developed in NS2 as an extension of OSPF-TE\ns and
integrated with RSVP-TE\ns. Finally, the paper shows how the developed
software module can be used to satisfy a set of LSP allocation requests
with multiple QoS constraints."
}

@ARTICLE{Adam0711:Evaluation,
AUTHOR="Brian Adamson and Justin Dean and Ian Downard and Joe Macker",
TITLE="An Evaluation of Simplified Multicast Forwarding Strategies in Simulated
Mobile Ad hoc Networks",
JOURNAL="Mobile Computing and Communications Review",
DAYS=28,
MONTH=nov,
YEAR=2007,
ABSTRACT="This paper presents design issues and performance analysis of optimized
cover set algorithms supporting Simplified Multicast Forwarding (SMF) of
user data within mobile ad hoc network (MANET) environments. SMF is
presently being developed within the Internet Engineering Task Force (IETF)
as an experimental specification to provide simplified multicast data
dissemination among multi-hop, wireless nodes within peer MANET routing
neighborhoods. SMF provides a framework supporting a variety of potential
minimized cover set techniques to optimize the data flooding and relaying
process between multi-hop mobile routing peers. A variety of distributed
algorithms for forming connected dominating sets (CDS) are being considered
that reduce the required relay set. This paper presents modeling and
analysis of early work with CDS relay set algorithms and demonstrates
operation within an SMF framework. We provide a brief problem background,
discuss models and scenarios, compare various algorithms, and then
summarize observations as well as discuss future work. We observe similar
efficiency and robustness performance for several forwarding algorithms of
interest. We have also observed robustness of CDS-based algorithms to both
highly dynamic and congested networks."
}

@INPROCEEDINGS{Adam0711:G,
AUTHOR="Davide Adami and Christian Callegari and Stefano Giordano and Michele
Pagano and Michela Toninelli",
TITLE="{G-RDM:} a New Bandwidth Constraints Model for {DS-TE} networks",
BOOKTITLE="IEEE Globecom 2007 Performance Modeling, QoS and Reliability Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="MPLS traffic engineering (TE) allows the creation of end-to-end paths
across the network with bandwidth reservations. The main drawback of the
basic MPLS-TE model is that it operates at an aggregate level and so it is
unaware of traffic classes. DiffServ-aware MPLS-TE (DS-TE) refines the
MPLS-TE model by allowing bandwidth reservations to be carried out on a
per-class basis. The result is the ability to give strict QoS guarantees
while optimizing the use of network resources. Bandwidth constraints models
play a key role in the DS-TE architecture, since they establish how
bandwidth is distributed among different classes.  
In this paper, we first present a new bandwidth constraints  model, called
G-RDM. Then, we compare the performance of G-RDM with respect to MAM and
RDM in different scenarios by means of an analytical model based on
Markov-chains. The results show that G-RDM, joining the best features of
MAM and RDM, allows to improve their performance."
}

@INPROCEEDINGS{Adco0000:FXPAL,
AUTHOR="John Adcock and Matthew Cooper and Francine Chen",
TITLE="{FXPAL} {MediaMagic} Video Search System",
BOOKTITLE="ACM International Conference on Image and Video Retrieval 2007",
ADDRESS="Amsterdam, The Netherlands",
PAGES="644-644",
DAYS=9,
MONTH=jul,
YEAR=2007,
ABSTRACT={This paper describes FXPAL’s interactive video search
application, {"}MediaMagic{"}. 

FXPAL has participated in the TRECVID interactive search
task since 2004. In our search application we employ a rich set of
redundant visual cues to help the searcher quickly sift through the
video collection. A central element of the interface and underlying
search engine is a segmentation of the video into stories, which
allows the user to quickly navigate and evaluate the relevance of
moderately-sized, semantically-related chunks.}
}

@INPROCEEDINGS{Adeb0703:Low,
AUTHOR="Bamidele Adebisi and Bahram Honary and Carlos López Giovaneli and Mohammad
Mowlavi",
TITLE="Low Complexity Turbo Equalisation for Power Line Communications",
BOOKTITLE="International Symposium on Power Line Communications and Its Applications",
ADDRESS="Pisa, Italy, Italy",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="Low Complexity Turbo Equalisation for Power Line Communications

Bamidele Adebisi, Carlos López Giovaneli, and Bahram Honary

Department of Communication Systems, InfoLab21, South Drive, 
Lancaster University 
Lancaster, Lancashire, LA1 4WA, United Kingdom
Tel: +44-1524-510398, Fax: +44-1524-510489

E-mail: b.adebisi1(at)lancaster.ac.uk,c.lopezgiovaneli(at)lancaster.ac.uk  
b.honary(at)lancaster.ac.uk   

ABSTRACT

Due to the highly dispersive nature of the power line channel, there has
been a strong trend towards the use of orthogonal frequency division
multiplexing (OFDM) modulation for wideband power line communications
(PLC). This multi-carrier scheme transforms a frequency-selective channel
into a set of multiple flat-frequency fading channels. Thus, equalisation
of the data with coherent detection amounts simply to a normalisation by a
complex scalar, while non-coherent detection does not require any further
equalisation. Since tones spaced apart by more than the channel coherence
bandwidth experience independent fading, OFDM can exploit frequency
diversity via coding and interleaving across tones [1]. This is known as
coded OFDM (COFDM). However, OFDM modulation has the drawbacks of high
peak-to-average power ratio and increased sensitivity to carrier
synchronisation errors. On the other hand, single-carrier (SC) modulation
techniques do not suffer from these problems. Due to their simple
implementation, these techniques are widely used in narrowband PLC. For
broadband PLC, however, the strong intersymbol interference (ISI)
introduced by the power line channel calls for the use of powerful coding
and equalisation techniques, such as turbo coding/equalisation [2], [3].
Since the computational complexity of turbo equalisation schemes based on
optimal maximum a-posteriori (MAP) algorithms grows exponentially with the
length of the channel, the design of receiver structures with lower
complexity which can offer good, yet suboptimal performance, are necessary
for practical PLC implementations. In this paper, we investigate a low
complexity soft-input soft-output (SISO) decision feedback equaliser (DFE)
scheme, which enables efficient turbo equalisation over power line
channels. Modelling the power line channel as a linear, discrete-time
filter with 31 tap coefficients, the proposed scheme outperforms a turbo
COFDM system over the entire range of SNR values.

REFERENCES

[1] R. Wessel and J. Cioffi, “Fundamentals of coding for broadcast
OFDM,” Proc. Asilomar Conf. Signals, Systems, and Computers, vol.1, pp.
2-6, Pacific Grove, CA, USA, October/November 1995.

[2] C. Berrou, A. Glavieux, and P. Thitimajshima, “Near Shsnnon limit
error-correcting coding and decoding: turbo codes,” Proc. IEEE Int. Conf.
Commun., pp. 1064-1070, Geneva, Switzerland, May 1993.

[3] C. Douillard, M. Jézéquel, C. Berrou, A. Picart, P. Didier, and A.
Glavieux, “Iterative correction of intersymbol interference:
Turbo-equalization,” European Trans. Telecommun., vol. 6, no. 5, pp.
507-511, September-October 1995."
}

@INPROCEEDINGS{Aded0711:Joint,
AUTHOR="Steven Adedoyin and Anil Fernando and Amar Aggoun",
TITLE="A Joint Motion and Disparity Based Estimation Technique with Half Pixel
Refinement for {3D} Integral Video Compression",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="348-351",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="3D; Evolutionary Strategy; Video Coding; Half Pixel; 3D Integral Images",
ABSTRACT="In this paper we propose a novel approach to use both motion and disparity
information to compress 3D integral video sequences. Integral video and
imaging involves many microlenses. The integral video sequence is
decomposed into 8 viewpoint video sequences which are formed from the
microlenses and a block search is performed to jointly exploit the motion
and disparity redundancies to maximize the compression. A half pixel
refinement algorithm is then applied by interpolating macro blocks in the
previous frame to further improve the video quality. Experimental results
show that the method proposed achieves approximately a 1.5dB gain in video
quality over a full search motion algorithm."
}

@INPROCEEDINGS{Adel0000:File,
AUTHOR="Frank Adelstein and Rob Joyce",
TITLE="File Marshal: Automatic Extraction of {Peer-to-Peer} Data",
BOOKTITLE="7th Annual Digital Forensics Research Workshop",
ADDRESS="Pittsburgh, PA, USA",
DAYS=13,
MONTH=aug,
YEAR=2007,
ABSTRACT="Generally, digital forensic investigators find computers, or the images of
the disks, they examine contain peer-to-peer, or file sharing, software
present.  They must first determine what software is present, where it
stores the information, retrieve that information from the appropriate
directories, and then analyze the results.  File Marshal is a tool that
will automatically detect and analyze peer-to-peer client use on a disk. 
The tool automates what is currently a manual and labor intensive process. 
It will determine what clients currently are or have been installed on a
machine, and then extracts per-user usage information, specifically a list
of peer-servers contacted, and files that were shared and downloaded.  The
tool was designed to perform its actions in a forensically sound way,
including maintaining a detailed audit trail of all actions performed. 
File Marshal is extensible, using a configuration file to specify details
about specific peer-to-peer clients (e.g., location of log files and
registry keys indicating installation).  This paper describes the general
design and features of File Marshal, its current status, and the plans for
continued development and release.  When complete, File Marshal, a National
Institute of Justice funded effort, will be disseminated for free to law
enforcement."
}

@INPROCEEDINGS{Adel0709:Mobile,
AUTHOR="Robert Adelmann",
TITLE="Mobile Phone Based Interaction with Everyday Products {–} On the Go",
BOOKTITLE="International Conference and Exhibition on Next Generation Mobile
Applications, Services, and Technologies",
ADDRESS="Cardiff, Wales, United Kingdom",
DAYS=12,
MONTH=sep,
YEAR=2007,
KEYWORDS="mobile phones, user interaction, barcode recognition",
ABSTRACT="Automatic identification technology such as RFID promises to connect
physical objects with virtual representations or even computational
capabilities. However,
even though RFID tags are continuously falling in price, their widespread
use on consumer items is still several years away, rendering the
interaction with objects currently present in our everyday lives
impossible. Much more ubiquitous are printed barcodes on consumer products.
Recently there is an increasing interest in applications based on the
recognition of standard 1D barcodes using the built-in cameras of mobile
phones. Since many of the potential applications are especially useful when
”on the go”, e.g. while shopping, a simple and fast user interaction is
essential. In this paper we want to presents two contributions that enable
such a simple and fast interaction with everyday products and services
associated to them: A systems for the recognition of 1D barcodes on mobile
phones that differs in two aspects from already existing solutions: the
very fast and robust realtime recognition of codes on the camera’s video
images as well as the life detection of additional codes parameters, like
the barcode’s relative orientation to the mobile phone. Besides that, we
present and suggest the usage of these additional parameters in order to
ease and accelerate the user interaction process - for example with the
help of orientation sensitive menus."
}

@INPROCEEDINGS{Adel0712:Low,
AUTHOR="Ehsan {Adeli Mosabbeb} and Maryam Sadeghi and Mahmood Fathy",
TITLE="A Low-cost Strong Shadow-based Segmentation Approach for Vehicle Tracking
in Congested Traffic Scenes",
BOOKTITLE="International Conference on Machine Vision 2007",
ADDRESS="Islamabad, Pakistan",
DAYS=28,
MONTH=dec,
YEAR=2007,
ABSTRACT="In this paper, we propose a vehicle tracking algorithm that uses a new
approach to deal with occlusion. This approach uses the novel feature,
recently proposed to improve the accuracy of object localization and
occlusion handling. It was constructed on the basis of the strong shadow
under the vehicle in real-world traffic scenes. In this paper, we use some
statistical parameters of each frame to detect and segment these shadows.
To demonstrate robustness and accuracy of our proposed approach, impressive
results of our method in real traffic images including high congestion,
noise, clutter, snow, and rain containing remarkable cast shadows, bad
illumination conditions and occlusions, taken from both scenes of outdoor
highways and urban roads are presented."
}

@INPROCEEDINGS{Adem0710:Time,
AUTHOR="Astrit Ademaj and Hermann Kopetz",
TITLE="{Time-Triggered} Ethernet and {IEEE} 1588 Clock Synchronization",
BOOKTITLE="International Symposium on Precision Clock Synchronization for Measurement,
Control, and Communication",
ADDRESS="Vienna, Austria",
DAYS=1,
MONTH=oct,
YEAR=2007,
ABSTRACT="he Time-Triggered Ethernet unifies real-time and non-real-time traffic into
a single communication architecture. We have built a prototype
implementation of an FPGA TT-Ethernet switch and an FPGA TT Ethernet
communication controller supporting a network bandwidth of 100Mbit/sec.
Time-Triggered Ethernet introduces two message classes, i) the standard
event-triggered Ethernet messages, denoted as ET messages, and ii) the
time-triggered Ethernet messages, denoted as TT messages. All TT messages
are transmitted periodically and are scheduled a priori in a way that there
are no conflicts on the network. The network handles these messages
according to the cut-through paradigm. Computer nodes containing TT
Ethernet communication controllers establish and maintain global time base
by making sure of timed transmission of TT messages. However nodes
containing standard Ethernet controllers can be connected to a TT Ethernet
system and can send ET messages without affecting the temporal properties
of the TT messages. The global time format of the TT Ethernet deploys the
UTC time format which is compatible with the time format of the IEEE 1588
standard. The clock synchronization mechanisms are compatible with the IEEE
1588 standard. In these work we present how we deploy the IEEE 1588 in
order to synchronize the TT Ethernet controllers which require a tight
synchronization among them. Additionally the IEEE 1588 clock
synchronization based protocol will be implemented at standard Ethernet
controllers such that they can be establish and maintain a global time
base."
}

@INPROCEEDINGS{Adep0702:Model,
AUTHOR="Francis Adepoju and Khalil Arshak",
TITLE="A Model for Estimating the {Real-Time} Positions of a moving Object in
Wireless Telemetry Applications using {RF} Sensors",
BOOKTITLE="Sensors Applications Symposium",
ADDRESS="San Diego, California, USA",
DAYS=6,
MONTH=feb,
YEAR=2007,
ABSTRACT="We discuss system and method of determining the real-time location of an
omni-directional diagnostic radio frequency (RF) system while the object is
moving freely inside an inaccessible organ. A specific application to the
human gastrointestinal (GI) organ is presented, showing the importance of
the method in accessing a specific site for drug administration or for
extracting fluid or tissue samples for biopsy and similar medical
investigations. Our method interfaces with wireless technology to provide
non-invasive real-time acquisition of intestinal physiology data and also
relay information about the object’s whereabouts at all times during the
entire period of diagnosis. The system consists of a miniature RF
transceiver embedded in the GI tract and a set of receivers positioned
external to the body. RF signal is transmitted at 433MHz to achieve half
duplex communication between the transmitter and receiver."
}

@INPROCEEDINGS{Adep0705:Linearized,
AUTHOR="Francis Adepoju and Khalil Arshak",
TITLE="Linearized Transformation of {RF} Data For Capsule Tracking in Wireless
Telemetry",
BOOKTITLE="First International Workshop on Smart Homes for Tele-Health",
ADDRESS="Niagara Falls, Ontario, Canada",
DAYS=21,
MONTH=may,
YEAR=2007,
ABSTRACT="In this paper, we discuss system and method of determining the real-time
location of an omni-directional diagnostic radio frequency (RF) system
while the object (transmitter) is moving freely inside an inaccessible
organ.  A specific application to the human gastrointestinal (GI) organ is
presented, showing the importance of the method in accessing a specific
site for drug administration or for extracting fluid or tissue samples for
biopsy and similar medical investigations. For practical purposes, we
assume omnidirectional transmitter transmitting at 433MHz, Input power 1W,
and Es/No = 20dB (corresponding to the linear region of the target
transceiver). We also discuss the method for using the original analogue
signal, after conversion to voltage, for position tracking. In our
algorithm, we employed a path loss scenario based on the popular log-normal
model to simulate the effects of organs on signal quality between
transmitter and receiver at various distances"
}

@INPROCEEDINGS{Adey0712:Extending,
AUTHOR="Michael Adeyeye and Neco Ventura",
TITLE="Extending Web Browsers Architectures to support {HTTP} Session Mobility",
BOOKTITLE="CoNEXT Student Workshop",
ADDRESS="New York, USA",
DAYS=10,
MONTH=dec,
YEAR=2007,
ABSTRACT="In a bid to extend web browsers capabilities, a new extension that
transfers HTTP session between two web browsers also knows as User Agents
will be developed. The capabilities of these web browsers will be extended
by integrating a Session Initiation Protocol (SIP) stack into them. SIP has
been chosen because it has clearly defined session mobility types namely
Third-party Call Control and Session Hand-off. This paper identifies the
modifications that will be made to the present-day web browsers
architectures and describes the two services that can be provided namely
content sharing and session transfer between any two user agents."
}

@INPROCEEDINGS{Adi0703:Secured,
AUTHOR="Wael Adi and Ali Dawood and Rachid Benlamri and Ali Al-Qayedi and O.
Al-Baker",
TITLE="Secured Human Face Identification and Authenticated Mobile Remote Signature
for {E-Government} Applications",
BOOKTITLE="IEEE International Conference on Portable Information Devices",
ADDRESS="Orange County Convention Center, Orlando, Florida USA, USA",
DAYS=25,
MONTH=mar,
YEAR=2007,
ABSTRACT="Human face recognition has been widely used in applications such as video
surveillance camera, criminal identification, and content-based image
retrieval. With the advances in wireless communication, and smart portable
computing devices, it is now becoming feasible to make such identification
operations network wise available. Mobile assisted signature and contract
authentication appears to be quite relevant for the growing e-government
applications.  This paper describes mobile based authenticated human face
identification associated with video-recorded authenticated hand-signature
protocol. The system can be used to verify, prove, and enforce “mobile
contracts”. A possible basic scenario is devised and demonstrated to
deploy a mobile video image for signing documents for e-government
applications. The proposed system offers secured mutually-authenticated
image exchange and face identification scheme, as well as remote signing of
document by transferring authenticated video for personal face and
signature operation. The whole operation should be equivalent to signing a
contract or document at a notary office. The system is designed using novel
low-cost public- and secret-key cryptographic mechanisms integrated in the
mobile device to ensure image authentication of the integrated mobile
camera without involving the mobile service operator. The system integrates
two secured entities, a mobile device camera and a smart-card both
certified by some authority to enable undeniable visualized “mobile
signature”. 
Cascading secured visual means in addition to the conventional
cryptographic transaction control would tremendously enhance the security
threshold. The result is an integrated user-transparent secured image
recording supported by user-non-transparent cryptographic transaction
control for highly secured and legally traceable e-government applications."
}

@INPROCEEDINGS{Adia0701:Family,
AUTHOR="Mehdi Adian",
TITLE="A family of {LMS} adaptive beamforming algorithms {WCDMA} systems in uplink",
BOOKTITLE="The 5th Asian International Mobile Computing Conference",
ADDRESS="Kolkata, India",
DAYS=3,
MONTH=jan,
YEAR=2007,
ABSTRACT="-Smart antenna technology is gaining more and more interest in wireless
community. Smart antenna compared to conventional antenna, significantly
improves channel capacity, spectral efficiency, and coverage area. In a
WCDMA system, since all users share the same frequency, the interference
reduction is a major criterion to improve capacity and performance. In this
study, we focus on adaptive beamforming algorithms with smart antenna at
the CDMA base station for interference reduction and multipath suppression
in the uplink. Adaptive beamforming is a key feature of WCDMA systems that
leads to interference mitigation and capacity increase of wireless
networks. This paper presents a family of LMS adaptive beamforming
algorithm for WCDMA systems in uplink. This family includes conventional
LMS, Normalized LMS, Signed LMS, Signed-Regressor LMS and Sign-Sign LMS
algorithms"
}

@INPROCEEDINGS{Adia0701:FDNLMS,
AUTHOR="Mehdi Adian",
TITLE="{FDNLMS} with active tap detection ad adaptive beamforming algorithm for
uplink of {WCDMA} systems",
BOOKTITLE="The 5th Asian International Mobile Computing Conference",
ADDRESS="Kolkata, India",
DAYS=3,
MONTH=jan,
YEAR=2007,
ABSTRACT="In the realization of adaptive beamforming algorithms, the
least-mean-squares (LMS) algorithm had been the most popular scheme used
for Smart Antenna systems. This Paper proposes an alternate scheme in the
form of the Normalized LMS (NLMS) algorithm with active tap detection for
WCDMA systems. By taking advantage of spatial filtering, the proposed
scheme promises to reduce the bandwidth required for transmitting data by
improving convergence rate. The performance of the Frequency Domain NLMS
algorithm in the presence of multipath effects and multiple users is
analyzed using simulations. This analysis is compared to that of LMS
algorithm and suggests improvement in the convergence rate and number of
active taps used, which leads to better system efficiency."
}

@INPROCEEDINGS{Adib0706:Security,
AUTHOR="Mustapha Adib",
TITLE="Security certificates for the operational armies needs",
BOOKTITLE="Mosharaka International Conference on Communication Systems and Circuits",
ADDRESS="Amman, Jordan",
DAYS=7,
MONTH=jun,
YEAR=2007,
ABSTRACT="The army troops and the police force members have
specific needs for communication security. This specificity rises
from the characteristics of their missions. Indeed, the mobility of
members, the dynamicity of group composition, the hierarchical
tree structure and the high level of required security, make the
search for communication security solution of this kind of groups
more complex. In this paper, we propose certificates which,
associated with exchange protocols, make group communication
in a secured way, while answering their specificities. The solution
proposed is independent of architectures and technologies used.
It is directed wireless applications and thus takes consideration
of the constraints of this kind of medium. So it adapts perfectly to
the various circumstances such absence of link with the
command, disappearance or nomination of a new chief, fusion of
troops, etc."
}

@INPROCEEDINGS{Adib0711:Comparison,
AUTHOR="Mehdi Adibi and Vahid {Taba Taba Vakili}",
TITLE="Comparison of Cooperative and Non-cooperative Game Schemes for
{SINR-Constrained} Power Allocation in Multiple Antenna {CDMA}
Communication Systems",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1151-1154",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Multiple antenna; SINR-constrained power allocation; code division
multiaccess; game theory; Nash equilibrium; Nash bargaining model; MIMO MAC",
ABSTRACT="In this paper, We formulate the SINR-constrained power allocation problem
in the wideband Multiantenna CDMA cellular system as a game. Using the
cooperative theory and Nash bargaining model, we compared it to the
noncooperative game scheme proposed in (S. Koskie, Z. Gajic, IEEE trans. on
Networking, 2005)[1]. We define a utility function which considers both
power usage and QoS. We show that the resulting operating point using Nash
bargaining model is fair and Pareto optimal, however, the Nash equilibrium
operating point obtained in the noncooperative game scheme is not in
general Pareto optimal. Also, we proposed a centralized power control
algorithm based on conjugate gradient algorithm for multiantenna CDMA
cellular systems, when the transmitted power and SINR which each user
experience is constrained. In addition, we can extend the result to the
rate optimization in a multiuser multiple antenna regime through a power
control problem subject to SINR constraints."
}

@INPROCEEDINGS{Adid0711:Estimation,
AUTHOR="Sankar Adida and Venkatesh Tamarapalli and Siva Ram Murthy",
TITLE="Estimation of Node Losses in Optical Burst Switched Networks using Network
Tomography",
BOOKTITLE="IEEE Globecom 2007 Optical Networks and Systems Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="Optical Burst Switching (OBS) is envisioned as the paradigm for a
high-bandwidth Internet. Losses due to contention is a serious problem in
OBS networks. Since the core nodes have limited capabilities, loss rate
cannot be determined at the nodes. Thus, estimating the losses on a path
purely based on end-to-end measurements and thereafter develop proactive
measures for loss reduction is an attractive option. For the first time, we
apply a tomographic technique that can estimate the losses at the core
nodes from end-to-end measurement between the edge nodes. We use passive
unicast tomography to minimize the network overhead. We model the problem
of estimating loss rate at the nodes from path-level measurements as a
Maximum Likelihood problem and solve it using the Expectation-Maximization
algorithm. In simulations, we use a multiple source, multiple destination
embedding on the NSFNET topology and observe losses on multiple paths to
infer losses at the core nodes. The estimated losses are found to match
closely with actual losses measured."
}

@INPROCEEDINGS{Adis0707:MQF,
AUTHOR="Kevin Adistambha and Christian Ritz and Ian Burnett",
TITLE="{MQF:} An {XML} Based Multimedia Query Format",
BOOKTITLE="ICME'07 - Multimedia Systems and Applications Track",
ADDRESS="Beijing, P.R. China",
DAYS=2,
MONTH=jul,
YEAR=2007,
ABSTRACT="MQF is a new XML based format designed to facilitate communication between
disparate systems for applications involving multimedia query by content.
Currently no standardized protocol exists which are able to provide
flexibility in formulation of a query, such as the combination of any
multimedia format (image, video, sound) to serve as query terms, combined
with very complicated query conditions that can utilize a hierarchy of
meta-search engines. In this work, we propose MQF as a flexible solution to
serve as a communication format between a client and server for use in
content based multimedia searching."
}

@INPROCEEDINGS{Adis0710:MPEG,
AUTHOR="Kevin Adistambha and Mario Doeller and Ruben Tous and Matthias Gruhne and
Masanori Sano and Chrisa Tsinaraki and Stavros Christodoulakis and Kyoungro
Yoon and Christian Ritz",
TITLE="The {MPEG-7} Query Format: A New Standard in Progress for Multimedia Query
by Content",
BOOKTITLE="7th International Symposium on Communications and Information Technologies",
ADDRESS="Sydney, Australia",
DAYS=16,
MONTH=oct,
YEAR=2007,
ABSTRACT="ln recent years, the amount of Internet accessible
digital audiovisual media files has vastly increased. Therefore
the need to describe the media (by way of metadata) has also
increased significantly. MPEG-7 (finalized in 2001) provides a
comprehensive and rich metadata standard for the description of
multimedia content. Unfortunately, a standardized query format
does not exist for MPEG-7, or other multimedia metadata. Such
a standard would provide for communications between querying
clients and databases, supporting cross-modal and cross-media
retrieval. The ISO/IEC SC29WG11 committee decided therefore
to contribute to this application space by adding such
functionality as a new part of the MPEG-7 series of standards. In
response to a Call for Proposals, six proposals were submitted.
This paper describes the strengths of each proposal as well as the
resulting draft standard for the MPEG-7 query format."
}

@INPROCEEDINGS{Adji0000:Annotated,
AUTHOR="Teguh Adji and Baharum Baharudin and Norshuhani Zamin",
TITLE="Annotated Disjunct in Link Grammar for Machine Translation",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="In this paper, a Machine Translation (MT) model using the Link Grammar (LG)
formalism is introduced. The contribution to this formalism is by
developing a hybrid of direct and rule-based translation model which is
suitable for translating a source language text with its parser into target
language text with no grammar formalism and corpus yet. This model can
theoretically handle one-to-one, many-to-one, and many-to-many word(s)
translations."
}

@INPROCEEDINGS{Adji0704:Autoconfiguration,
AUTHOR="Saadi Boudjit and Cedric Adjih and Paul Muhlethaler and Anis Laouiti",
TITLE="Autoconfiguration protocol for a multiple interfaces {OLSR} network",
BOOKTITLE="European Wireless 2007",
ADDRESS="Paris, France",
DAYS=1,
MONTH=apr,
YEAR=2007,
ABSTRACT="Network configuration is the assignment
of network parameters necessary for a device to integrate the
network, examples being: an IP address, netmask, the IP address of the
gateway, etc ... In the case of
Mobile Ad hoc NETworks (MANETs), the connectivity of nodes is highly
dynamic and a central
administration or configuration by the user is very difficult.
In this paper, we are interested in
presenting an autoconfiguration solution for ad hoc networks running
$OLSR$~\cite{rfc3626} (Optimized
Link state Routing protocol). This solution is based on an efficient
Duplicate
Address Detection (DAD)
algorithm which takes advantage of the genuine optimization of the
\textit{OLSR} routing protocol. The proposed autoconfiguration
algorithm is proved to operate correctly
in a multiple interfaces \textit{OLSR} network."
}

@INPROCEEDINGS{Adl0702:Low,
AUTHOR="Sanaz Adl and Martin Peckerar",
TITLE="Low noise pre-amplifier/amplifier chain for high capacitance sensors",
BOOKTITLE="Sensors Applications Symposium",
ADDRESS="San Diego, California, USA",
DAYS=6,
MONTH=feb,
YEAR=2007,
ABSTRACT="A low-noise readout array is proposed for use with high capacitance
detectors.  The readout array is composed of a pre-amplifier/amplifier
chain.  The signal processing chain is designed for use with CdZnTe gamma
ray detectors employed by NASA for radiation detection.  This approach
employs correlated double sampling and capacitive matching to increase the
signal-to-noise ratio.  The readout array is custom designed to fit into
one detector pixel. The pre-amplifier/amplifier chain is designed and
simulated in 0.13u CMOS8RF IBM technology.  The readout array results show
that the signal-to-noise ratio is significantly improved compared to
previous work done in this field."
}

@INPROCEEDINGS{Adla0706:Joint,
AUTHOR="Sachin Adlakha and Xiaoqing Zhu and Bernd Girod and Andrea Goldsmith",
TITLE="Joint Capacity, Flow and Rate Allocation for Multiuser Video Streaming over
Wireless {Ad-Hoc} Networks",
BOOKTITLE="ICC 2007 Multimedia Communications and Home Services Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Simultaneous support of multiple delay-critical application
sessions such as multiuser video streaming require a
paradigm shift in the design of ad-hoc wireless networks. Instead
of the conventional layered approach, cross-layer optimization is
needed for more efficient resource allocation, across the protocol
stack and among multiple users. In this work, we extend our
previous effort in joint capacity and flow assignment at the
MAC and network layers, to include rate allocation at the
application layer of each user. The proposed optimization aims to
minimize the tradeoff between encoded video quality of all users
versus overall network congestion. Compared to a scheme with
oblivious layers, where capacity, flow and video rates are assigned
individually, simulation results show significant performance gain
of our proposed cross-layer approach, in terms of maximum
sustainable rate and quality of the video streams."
}

@INPROCEEDINGS{Adle0709:Efficient,
AUTHOR="Philipp Adler and Wolfram Amme",
TITLE="Efficient Bytecode Verification for Constrained Devices",
BOOKTITLE="2nd Workshop on Embedded Systems Security",
ADDRESS="Salzburg, Austria",
DAYS=30,
MONTH=sep,
YEAR=2007,
ABSTRACT="Java Bytecode is applied on a large variety of different architectures.
Still, one problem arising is verification of class files. This is
especially true for constrained devices like cell phones and embedded
systems. In the paper we present the basic principles of type-separated
bytecode and show how its properties can be used to achieve a more
efficient verification algorithm. Different verification techniques are
illustrated and compared. The best algorithm presented achieves a linear
verification time without a substantial overhead in program size."
}

@INPROCEEDINGS{Adna0710:Integrating,
AUTHOR="Asmaa Adnane and Rafael {de Sousa Júnior} and Christophe Bidan and Ludovic
Me",
TITLE="Integrating Trust Reasonings into Node Behavior in {OLSR:} Analysis and
Simulation",
BOOKTITLE="3rd ACM International Workshop on QoS and Security for Wireless and Mobile
Networks",
ADDRESS="Chania, Crete Island, Greece",
DAYS=22,
MONTH=oct,
YEAR=2007,
ABSTRACT="In ad hoc networks, route discovery and maintenance introduce specific
security problems for routing protocols to prevent, detect or respond. For
the OLSR routing protocol, the correct routing operation requires an
expected node behavior regarding the cooperation for discovering neighbors,
selecting routers and announcing topology information, but the protocol
lacks the means to verify this expected behavior. In this paper, we propose
for OLSR the integration of trust reasonings into each node behavior, so as
to allow a self-organized trust-based control to help nodes to detect
misbehavior attacks. These reasonings are based on the idea that each node
should mistrust received information and has to verify their validity. Our
analysis of the OLSR specification brings out the trust rules that
characterize this protocol and allows us to express formally the
trust-related properties that can be verified by each node to assess the
correct behavior of the other nodes. Simulation of OLSR with nodes
reasoning on trust allows us to demonstrate the effectiveness of our
approach for a node to detect inconsistencies in routing information
received from the network. Moreover, the simulation allows us to compare
trust-based routing choices with the bare OLSR reachability-based choices."
}

@INPROCEEDINGS{Adra0000:WiMax,
AUTHOR="Nadine {Akkari Adra} and Samir Tohme and Mahmoud Doughan",
TITLE="{WiMax-based} Vertical handovers for Next Generation Networks",
BOOKTITLE="The first International Conference on New Technologies, Mobility and
Security",
ADDRESS="PARIS, France",
DAYS=2,
MONTH=may,
YEAR=2007,
ABSTRACT="This paper describes a new vision for mobility management in next
generation all IP networks. We propose a mobility architecture offering
mobile users, roaming in next generation networks, and service continuity
without QoS degradation. In this architecture, the proposed  stand-by
Inter-Domain Management module SIDM guides the vertical handover to WiMax
network, capable of offering the user the same QoS and context parameters,
if seamless handover from UMTS to WLAN or vice versa could not be
performed. The mobility management is based on fast MIP handovers coupled
with the Context Transfer Protocol CTP."
}

@INPROCEEDINGS{Adra0702:Applying,
AUTHOR="Nadine {Akkari Adra} and Samir Tohme and Mahmoud Doughan",
TITLE="Applying Anticipated vertical handover {(AVHO)} in Next Generation Networks",
BOOKTITLE="European Conference on Universal Multiservice Networks",
ADDRESS="Toulouse, France",
DAYS=14,
MONTH=feb,
YEAR=2007,
ABSTRACT={This paper describes an anticipated mobility protocol for mobility
management between the two complementary access technologies WLAN and UMTS.
Due to their contradictory characteristics in terms of network coverage and
data rates, the mobility between the two access technologies, known as
vertical handover, is highly considered in the next generation networks. We
propose to apply Anticipated Vertical Handover (AVHO) in the integration of
the third generation wireless communication (3G) from one side and WLAN
802.11 from the other side. The proposed AVHO offers mobile users, roaming
in next generation networks, fast handover based on a pre-network selection
such as the {"}make-before-break{"} approach used in fast MIP handovers.
The use of AVHO for mobility management will result in better service
continuity with minimum handover latency and minimum packet loss. 

 Anticipated Vertical Handover (AVHO)is based on FMIPv6 mobility protocol
but in the context of vertical handovers specifivally the mobility between
WLAN to UMTS and vice versa. This will allow a fast handover based on prior
CoA acquisition due to  the FMIPv6 signaling messages done prior to
Handover. Based on Anticipated Vertical Handover (AVHO), simulation results
were conducted and compared to the MIPv6 mobility protocol in terms of the
handover latency and packet loss.}
}

@INPROCEEDINGS{Adra0703:Vertical,
AUTHOR="Nadine {Akkari Adra} and Samir Tohme and Mahmoud Doughan",
TITLE="{Vertical-to-Horizontal} Handovers: Architecture and Mobility Management",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Networking",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT={This paper describes a new vision for mobility management in next
generation all IP networks. We evaluate the vertical-to-horizontal handover
in the proposed integration architecture for the third generation wireless
communication (3G) from one side and WLAN 802.11 from the other side. In
this architecture, the Inter-Domain Management IDM module introduced is
modeled and analytically studied  in order to evaluate the handover calls
dropping probability and the call blocking probability in function of the
access network bandwidth, number of users and the admission control
strategy…  In this scenario, if it is not possible to guide the handover 
to a different access network capable of providing the same QoS and context
parameters, or in other words, if the vertical handover could not be
performed,  it will be guided horizontally. In this case, the user is
guided to the same access technology, resulting in a vertical-to-
horizontal handover. This handover  scenario will decrease the handover
dropping probability as well as the QoS degradation sine the Handover is
{"}guided{"} to the next access network.}
}

@INPROCEEDINGS{Adri0706:**,
AUTHOR="Pieter Adriaans and Paul Vitanyi",
TITLE="{**} {WITHDRAWN} {**} The Power and Perils of {MDL}",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We point out a potential weakness in the application of the
celebrated Minimum Description Length (MDL) principle for model selection.
Specifically, it is shown that (although the index of the model class
which
actually minimizes a two-part code has many desirable properties) a model
which has a shorter two-part code-length than another is not necessarily
better (unless of course it achieves the global minimum).
This is illustrated by an application to infer a grammar (DFA) from
positive examples.
We also analyze computability issues, and robustness under recoding of the
data.
Generally, the classical approach is
inadequate to express the goodness-of-fit of individual models
for individual data sets. In practice however, this is precisely
what we are interested in: both to express the goodness of a procedure
and where and how it can fail. To achieve this practical goal, we
paradoxically have to use the, supposedly impractical, vehicle of
Kolmogorov complexity."
}

@INPROCEEDINGS{Adya0000:Footprint,
AUTHOR="Aloysius Adya and Andaya Lestari and Adit Kurniawan and Andriyan Suksmono",
TITLE="Footprint Adjustment On {SFCW-GPR} With Modified Dipole Array",
BOOKTITLE="International Conference on Ultra-Wideband 2007",
ADDRESS="Marina Mandarin Singapore, Singapore",
DAYS=24,
MONTH=sep,
YEAR=2007,
ABSTRACT="Antennas footprint is an important parameter in GPR.  The various condition
of soil under which a target is buried may change the footprint of an
antenna.  An antenna with adaptation capability is therefore needed. This
type of antenna is capable of keeping the footprint constant. The antennas
footprint is related to the antennas dimension. In this paper, Modified
dipole array is proposed as an adaptive antenna for GPR. With RF Switch
circuit, we choose the element on the antenna that will be fed considering
to  footprint that will be produced. If coupling between element in the
array is significant, the array for GPR application will fail to create its
adaptation capability. Resistive loading is used to reduce coupling level
between elements in the array."
}

@INPROCEEDINGS{Afsa0703:10,
AUTHOR="Ahmad Afsahi and Mohammad Rashti",
TITLE="10-Gigabit {iWARP} Ethernet: Comparative Performance Analysis with
{InfiniBand} and {Myrinet-10G}",
BOOKTITLE="7th Workshop on Communication Architecture for Clusters",
ADDRESS="Long Beach, California, USA",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="iWARP is a set of standards enabling Remote Direct Memory Access (RDMA)
over Ethernet.  iWARP supporting RDMA and OS bypass, coupled with TCP/IP
Offload Engines, can fully eliminate the host CPU involvement in an
Ethernet environment.  With the iWARP standard and the introduction of
10-Gigabit Ethernet, there is now an alternative path to the proprietary
interconnects for high-performance computing, while maintaining
compatibility with the existing Ethernet infrastructure and protocols.
Recently, NetEffect Inc. has introduced an iWARP–enabled 10-Gigabit
Ethernet Channel Adapter.  In this paper, we assess the potential of such
an interconnect for high-performance computing by comparing its performance
with two leading cluster interconnects, namely InfiniBand and Myrinet-10G. 
The results show the NetEffect iWARP implementation achieves an
unprecedented latency for Ethernet, and saturating 87\% of the available
bandwidth.  It also scales better with multiple connections.  At MPI level,
iWARP performs better than InfiniBand in queue usage and buffer re-use."
}

@INPROCEEDINGS{Afsa0703:Comprehensive,
AUTHOR="Ahmad Afsahi and Ryan Grant",
TITLE="A Comprehensive Analysis of Multithreaded {OpenMP} Applications on
{Dual-Core} Intel Xeon {SMPs}",
BOOKTITLE="Workshop on Multithreaded Architectures and Applications",
ADDRESS="Long Beach, California, USA",
DAYS=30,
MONTH=mar,
YEAR=2007,
ABSTRACT="Industry has adopted the development of aggressive Chip Multithreading
(CMT) processors for general-purpose applications.  CMT processors combine
Chip Multiprocessing (CMP) and Simultaneous Multithreading to provide
better support for thread level parallelism.  Hybrid CMT/SMP systems
present new challenges as well as new opportunities to maximize
performance.  Our intention in this study is to identify the individual
resources that might become a performance bottleneck under different
multithreaded architectures.  This knowledge will be useful to the research
community in developing software techniques to improve the performance of
multithreaded shared memory programs on modern multi-core multiprocessors.
In this paper, we study a two-way dual-core Hyper-Threaded (HT) Intel Xeon
SMP server using a number of OpenMP parallel applications.  We use the NAS
benchmark suite to measure the performance of single program and
multi-program multithreaded workloads. Our performance results indicate
that in the single-program case, the CMP-based SMP and CMT-based SMP
configurations have the highest average speedup across all of the
applications.  The most efficient architecture is a single HT-enabled
dual-core processor that is almost comparable to the performance of a 2-way
dual-core HT-disabled system."
}

@INPROCEEDINGS{Afsh0000:Using,
AUTHOR="Narges Afshordi and Mohammad Reza Meybodi",
TITLE="Using Learning Automata for Tuning Fuzzy Membership Functions in Learning
Driver Preferences",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="With the growth of car navigation systems technology comes a variety of
enhancements aiming to increase user comfort and satisfaction. One such
application is the appearance of methods for learning a driver’s
preferences in making a choice between several routes. A driver may know
his/her basic and most important factors in making such a decision, but may
have these factors weighing in differently. Hence, machine learning methods
can be applied to model the driver’s preferences, thus predicting the
result of the decision process. This paper proposes a new method which
combines a fuzzy expert system approach with learning automata."
}

@INPROCEEDINGS{Agap0708:Synthetic,
AUTHOR="Andrei Agapi and Thilo Kielmann and Henri Bal",
TITLE="Synthetic Coordinates for Disjoint Multipath Routing Over the Internet",
BOOKTITLE="CoreGRID Symposium - In conjunction with The Thirteenth International
Conference on Parallel Computing",
ADDRESS="Rennes, France",
DAYS=27,
MONTH=aug,
YEAR=2007
}

@INPROCEEDINGS{Agar0000:Demonstration,
AUTHOR="Anjali Agarwal and Ronald Menendez and Paul Toliver and Janet Jackel and
Shahab Etemad",
TITLE="Demonstration of Modified Hadamard Codes for {OCDM-based} Confidentiality",
BOOKTITLE="ECOC 2007 - 33rd European Conference and Exhibition on Optical
Communication",
ADDRESS="Berlin, International Congress Center (ICC), Germany, Germany",
DAYS=16,
MONTH=sep,
YEAR=2007,
KEYWORDS="fiber optic communications; optical code division multiplexing",
ABSTRACT="We implement novel orthogonal codes using a complex monomial matrix
transformation on the conventional Hadamard codes for a spectral
phase-encoded OCDM system. The resulting exponentially larger code space is
invaluable for potentially enhancing data confidentiality."
}

@INPROCEEDINGS{Agar0000:Exploiting,
AUTHOR="Ashish Agarwal and Thomas Little and David Starobinski",
TITLE="Exploiting Downstream Mobility to Achieve Fast Upstream Message Propagation
in Vehicular Ad Hoc Networks",
BOOKTITLE="INFOCOM 2007 MObile Networks for Vehicular Environments Workshop",
ADDRESS="Anchorage, Alaska, USA",
DAYS=6,
MONTH=may,
YEAR=2007,
ABSTRACT="Providing mechanisms for vehicular networking is
challenging due to inherent characteristics of mobility, network
fragmentation, and wireless communications. Existing interconnection
schemes include pure ad hoc, access-point (including
cellular), and hybrid. With many scenarios involving internetworking
absent costly infrastructure such as access points,
there is a fundamental question of the viability and potential
performance of multihop communication in such a dynamic
and fragmented system. In this paper, we consider the analysis
of time-varying connectivity expected in vehicular networks
under a multihop ad hoc network model. Of particular interest
is the rate of message propagation in a highly fragmented
vehicular network. Through an analytical model supported by
simulation we demonstrate that increased vehicular mobility
from 0 to 10m/s provides improvement of at least 400m/s in
the propagation rate."
}

@INPROCEEDINGS{Agar0703:Hash,
AUTHOR="Pankaj Agarwal",
TITLE="A New {Hash-Based} Search Technique for Finding Patterns in Molecular
Sequences",
BOOKTITLE="1st International Conference on Information Systems, Technology and
Management",
ADDRESS="New Delhi, India",
DAYS=12,
MONTH=mar,
YEAR=2007,
ABSTRACT="This Paper presents a new and effective way towards finding patterns
(exact/inexact) with certain functional significance from molecular
sequence. For simplicity we have considered only DNA Sequences. Our method
uses the concept of Hash tables with a view to reduce the search time
effectively. We have used three bits for representing each nucleotide i.e.
A, T, G and C, which gives a compressed representation of the Sequences.
Hash Table has been used to keep all possible combination of DNA
Subsequences of order K (here we have taken K=3). Hash table is constructed
only once and is stored permanently in the database. Molecular Sequences
are now indexed into the Hash-table and are stored in relational (table)
format in the database of sequences. In recent times a lot is being talked
about the significance of relational format for storing molecular sequences
in databases so that query languages like SQL can be used to manipulate and
retrieve the data effectively if required.[1] Our method provides the
solution to above stated problem quite effectively as far as time
complexity is concerned and is better than most of the existing algorithms."
}

@INPROCEEDINGS{Agar0704:Integrated,
AUTHOR="Ankur Agarwal and Georgiana Hamza-Lup and James Ansley and Ravi Shankar",
TITLE="An Integrated Methodology for {QoS} Driven Reusable Component Design and
Component Selection",
BOOKTITLE="1st Annual IEEE Systems Conference",
ADDRESS="Waikiki, Honolulu, Hawaii, USA",
DAYS=9,
MONTH=apr,
YEAR=2007,
ABSTRACT="A system design process is inherently complex. The different (design)
groups working on different design phases bring different perspectives
towards system design. The system or product inconsistencies primarily
arise out of lack of appropriate communication among various design teams.
For example, concerns of a hardware (HW) design engineer are different from
that of a software (SW) designer. Such constraints lead to increase in
product development cycle and product development cost, thereby reducing
system design productivity. 
To enhance this declining productivity, one will have to exploit the
principle of “design-and-reuse” to its full potential. This will
require us to design and develop a component library. Then, a system
(subsystem) would be composed of reusable sub-systems (components). For
example, Network-on-Chip (NOC) architecture can serve as a reusable
communication sub-system for an embedded device. To develop a system from
such reusable components, one will have to design and develop variants of
each component. For example, buffer size is a customizable parameter for an
input buffer. Similarly, scheduling criteria provides customizability for
scheduler component.
 
For these components to be reusable, we should properly define their
attributes, methods, concurrency signals, customizable parameters, and
performance characteristics. Attributes are the inputs and outputs of a
component, methods represent functions of a component, customizable
parameters refers to possible customization that can bring a change in
component performance, concurrency signal refer to interfacing signals and
conditions for composing systems (subsystems), and performance
characteristics of a component are the parameters such as, area, power
consumption, latency, and cost. The performance parameters will have to be
abstracted using either bottom-up annotation process such as SW estimation,
SW emulation, and rapid-prototyping or a top-down annotation process such
as subsystem modeling, and literature survey. Thus, for components to be
used as reusable building blocks, we must properly define interfaces and
encapsulate their performance metrics for various useful parameter
combinations, in order to help the architect to make informed decisions.
One should use middle-out philosophy, where the system is modeled using the
top-down approach from system specification document, and performance
parameters are abstracted using the bottom-up and top-down approach.

We need to address this problem in two parallel phases. First phase will
model a reusable component library. Secondly, we should be able to select a
right component, and platform from the component library based of
performance and quality-of-service (QoS) parameters to yield a globally
optimized solutions. Such a model at the design phase will provide key
decisions and reduce the scope of the multidimensional search space. These
key decisions may include the number of processors, HW/SW partitioning,
estimated performance values for new components, and the use of existing
components in software or hardware. Such design decisions have the
potential to significantly enhance productivity of system design. However,
system modeling, analysis and design will not be an effective solution
until we bring an automated process of component selection satisfying QoS
requirements and specifications. 

In this paper, we present an integrated methodology for system design that
will address three main concerns: (1) To develop a methodology for
designing reusable component(s); (2) To develop a middle-out philosophy for
abstracting performance parameters and QoS matrices for annotation; (3) To
develop an automated process of component selection. Figure 1, shows the
basic overview of an integrated methodology. We further present two
different techniques (Semantic Web, and use of Optimized algorithms for
component selection) for component selection process. We propose to use
non-linear regression analysis to construct dependency relationships among
various component parameters. This dependency can be used to impose a
certain order among components, in terms of their QOS parameters, and would
allow a more informed search through the candidate solutions space.

For our problem, a Greedy approach would involve choosing at each step the
component that “seems” (at that point) to be the most helpful in
achieving our objectives (the functional and QOS requirements).
Backtracking is required in order to allow us to follow a different path in
our search space in case the functional and QoS requirements can no longer
be satisfied. Backtracking also enables finding more than one solution.
Different heuristics can be used in determining the “best” component to
be chosen at each step. We propose an approach in which we construct a
heuristic based on the dependency between the component parameters and the
QOS parameters of those components. Semantic Web on the other hand,
utilizes document layering to provide differing levels of context to
information. Using these layers to provide context to database information
allows for more efficient and intelligent database queries. One of the
applications of these queries is to search component databases for the
reuse of components in new designs."
}

@INPROCEEDINGS{Agar0705:IEEE,
AUTHOR="Niraj Agarwal and Divya ChanneGowda and Lakshmi Narasimhan Kannan and Marco
Tacca and Andrea Fumagalli",
TITLE="{IEEE} 802.11b Cooperative {Protocols:A} Performance Study",
BOOKTITLE="IFIP/TC6 NETWORKING 2007",
ADDRESS="Atlanta, GA, USA",
DAYS=14,
MONTH=may,
YEAR=2007,
ABSTRACT="This paper investigates the use of cooperative communications
in the context of IEEE 802.11b to combat radio signal
degradation.
The performance gain of both an existing cooperative
protocol and the one proposed in the paper is discussed.
It is quantitatively shown how much the two cooperative protocols
increase throughput, lower delivery latency, and extend transmission
span, when compared to the conventional IEEE 802.11b protocol.
These features may help improve connectivity and
network performance in ad hoc applications."
}

@INPROCEEDINGS{Agar0706:Cell2Notify,
AUTHOR="Yuvraj Agarwal and Ranveer Chandra and Alec Wolman and Victor Bahl and
Kevin Chin and Rajesh Gupta",
TITLE="{Cell2Notify:} Energy Efficient {VoIP} for {Wi-Fi} Enabled Smartphones",
BOOKTITLE="Fifth International Conference on Mobile Systems Applications and Services
- MobiSys 2007",
ADDRESS="San Juan, Puerto Rico",
DAYS=11,
MONTH=jun,
YEAR=2007,
ABSTRACT="Enterprises are actively embracing Voice over IP (VoIP) technology for
their communication needs. Wi-Fi offers the ability to make VoIP ubiquitous
via Wi-Fi enabled Smartphones. However, the adoption of these devices has
been slow due to energy drain when using Wi-Fi. We propose a novel system,
called {\em Cell2Notify}, that leverages the cellular radio on a Smartphone
to optimize the usage of the Wi-Fi interface for the purposes of VoIP
communications. Our system can be deployed incrementally and requires
minimal changes to an existing VoIP deployment. We describe the design,
implementation and evaluation of the Cell2Notify system. Our system
provides greater than 2x increase in the operating lifetime of a Smartphone
while maintaining acceptable performance."
}

@INPROCEEDINGS{Agar0706:Error,
AUTHOR="Manish Agarwal and Dongning Guo and Mike Honig",
TITLE="Error Exponent for Gaussian Channels with Partial Sequential Feedback",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We consider an additive white Gaussian noise (AWGN) channel with
 partial sequential feedback. Namely, for every fixed-length
block of forward transmissions a fraction of the received symbols
are fed back sequentially to the transmitter through a noiseless
feedback link. It is well known that complete noiseless feedback can
provide a dramatic improvement in reliability (i.e.,
double-exponential error rate with block length). We show that
partial feedback can also provide a substantial improvement in error
rate. Specifically, we propose a capacity-achieving coding scheme
with partial feedback, in which the feedback is used to induce a
prior distribution for the decoding of random forward error control
(FEC) codewords. The error-exponent for this scheme is larger than
the error-exponent with FEC coding only at all rates. For rates
greater than those achieved by transmissions with feedback alone, we
give an upper bound on the error exponent. Exponents close to this
bound can be achieved with both the proposed scheme and a simple
rate-splitting scheme. With finite block lengths, the proposed coding
scheme
achieves lower error rates than rate-splitting."
}

@INPROCEEDINGS{Agar0706:Low,
AUTHOR="Rachit Agarwal and Ralf Koetter and Emanuel Popovici",
TITLE="A Low Complexity Algorithm and Architecture for Systematic Encoding of
Hermitian Codes",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We present an algorithm for systematic encoding of Hermitian codes. For a
Hermitian code defined over GF(q^2), the proposed algorithm achieves a run
time complexity of O(q^2) and is suitable for VLSI implementation. The
encoder architecture uses as main blocks q varying-rate Reed-Solomon
encoders and achieves a space complexity of O(q^2) in terms of finite field
multipliers and memory elements."
}

@INPROCEEDINGS{Agar0711:Efficient,
AUTHOR="Rajiv Agarwal and Vinay Majjigi and John Cioffi",
TITLE="Efficient Scheduling for Heterogeneous Services in {OFDMA} Downlink",
BOOKTITLE="IEEE Globecom 2007 Wireless Communications",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="We consider optimal allocation of resources to users in a downlink OFDMA
system to support heterogeneous applications consisting of both
deadline-sensitive (DS) and best-effort (BE) data in a cross-layer manner.
Given the user queue-states and long-term channel statistics, the proposed
persistent scheduling algorithm allocates the minimum resource to `just'
meet the deadlines for DS packets (QoS guarantee). The remaining resources
are then optimally split between the users for their BE data to maximize
sum-rate, minimize buffer holding cost or any general utility function. We
formulate both the resource allocation problems as geometric programs (GP)
which can be solved very efficiently using standard convex optimization
software tools. Simulation results are presented for Poisson packet
arrivals and exponentially distributed packet lengths on a Rayleigh fading
channel to study the performance trade-off between the DS and BE
applications."
}

@INPROCEEDINGS{Agar0711:Innovative,
AUTHOR="Megha Agarwal and Sumit Johar and Kaushik Saha and Emiliano Piccinelli",
TITLE="An Innovative Approach For Adaptation Of Generic Rate Control Algorithms
For Target Video Standards",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="336-339",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Rate Control Algorithm; Adaptation Layer; Video Coding; Quantization
parameter",
ABSTRACT="The paper discusses an innovative approach to make a generic rate control
algorithm, adaptable to a specific targeted video standard, by
incorporating the ‘Adaptation layer’. The proposed Adaptation Layer
utilizes the technique of statistical regression to provide a mechanism
using which the rate control algorithm can be acclimatized to any video
standard. Experimental results, on applying the proposed technique on a
constant bitrate control algorithm for VC1, show that a maximum deviation
of 1.5\% from the target bitrate is obtained with desired quality. 
Furthermore, the proposed technique drastically reduces the design
complexity required in adapting a rate control algorithm to a particular
video standard for marginal increase in computational complexity."
}

@INPROCEEDINGS{Agar0711:Opportunistic,
AUTHOR="Rajiv Agarwal and Vineet Abhishek and John Cioffi",
TITLE="Opportunistic Feedback in {OFDMA} Downlink",
BOOKTITLE="IEEE Globecom 2007 Wireless Communications",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="This paper presents an opportunistic feedback (OF) protocol that reduces
the amount of channel-state information feedback for the OFDMA downlink
system. The OF protocol associates a channel value instead of a user to
each feedback slot. The users access the slots opportunistically based on
their channel state measurement. This allows the base-station to deduce the
channel state from the slot index without explicit channel-state feedback.
The OF protocol is designed to support heterogeneous traffic, where users
with deadline-sensitive applications are prioritized over best-effort
users. The OF protocol is shown to (a) require finite number of feedback
slots upper bounded by a small number, (b) be fully distributed, and (c)
provide QoS to the deadline-sensitive applications."
}

@INPROCEEDINGS{Agar0712:Intruder,
AUTHOR="Tarun Agarwal and Venkatesan Ekambaram and P Vijay Kumar",
TITLE="Intruder detection over sensor placement in a hexagonal lattice",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="467-471",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="I. INTRODUCTION
The problem of intrusion detection via a distributed
signal processing algorithm running over a wireless
sensor network is considered. It is assumed that the
application permits careful placement of the sensors. We
restrict our attention here to a placement of sensors corresponding
to the two-dimensional hexagonal lattice A2.
This lattice simultaneously solves the packing, kissing,
covering and quantization problems in 2 dimensions.
It is the covering property that is perhaps of greatest
relevance to sensor networks as this tells us that for
a given sensor node density, the hexagonal lattice has
minimum covering radius, i.e., the furthest point from
any sensor node is closer in a hexagonal lattice in
comparison with any other two-dimensional lattice.
In this paper we present a solution to the specific
problem of detecting an intruder (assumed stationary for
the period of detection) of known source amplitude in the
presence of clutter. By clutter we mean a harmless source
of seismic vibrations. We assume that the sensors used
are vibrational sensors, i.e., sensors that detect seismic
vibrations induced by the intruder[2]. The algorithm is
assumed to operate over a sensor network that is primarily
energy constrained. In case of no stringent constraint
on the energy, the best strategy is to communicate all the
sensor readings to a fusion center. However, to minimize
the energy spent in communication, our algorithm does
communication in terms of single bits in each stage. We
introduce a signal-space view point to the problem and
the algorithm presented here is best understood from this
view-point.

II. PROPAGATION MODEL AND SENSOR COVERAGE
For simplicity, we adopt the following propagation
model,
v = VI/max(rho, rs)
where VI is the vibration amplitude at (reference) distance
rs = 1 from the intruder and where v is the
vibration level at a sensor node located a distance rho away
from the intruder location. More sophisticated models
such as that provided in [1] can be used without loss
of generality if desired. We assume a clutter amplitude
(VC) given by
VC = kappa*VI
where kappa is taken as 0.5 in our analysis.
We assume noise to be AWGN.

III. SIGNAL-SPACE VIEWPOINT
In any practical application, for any given fixed intruder
or clutter location, only a small number say N,
of sensor nodes will register a significant reading. The
deep holes of an M-dimensional lattice are the points in
M-dimensional space that are furthest from any lattice
point. In the case of the hexagonal lattice, M = 2 and
the deep holes correspond to the centroids of triangles,
where each triangle corresponds to a set of 3 neighboring
nodes, see Fig.1.
Note that in the hexagonal lattice, associated with
each deep hole is a sequence {Tn} of equilateral triangles
of non-decreasing size having the deep hole as
their common centroid.
We assume without loss of generality that the disturbance
caused by either intruder or clutter is located
in a particular triangle T1. Consider the space Re^N in
which the ith component si corresponds to the reading
of the ith sensor node (according to some ordering) in
the absence of sensor noise. A fixed intruder location
within T1 corresponds to a fixed point in Re^N. By
varying the intruder location over T1, one obtains a three-dimensional
surface SI in Re^N. It follows that the surface
SC associated to clutter is given by
SC = {kappa*s | s \in SI}.
The signal space for N = 3 under the assumption
of the intruder or clutter located in T1 is shown in
Fig.2. This enables us to understand the algorithm more
easily. In this case the problem of separating the intruder
and clutter amounts to setting up a decision boundary
between SI and SC.

A. Decision Boundary
The evaluation of an optimal decision boundary is
mathematically intractable for this case. Hence we resort
to approximation of the decision boundary. We restrict
our attention to the simplest decision test, achieved using
a hyperplane as the decision boundary. As the deep-hole
point is closest to the origin in the signal space, it is
the most vulnerable point for miss-detection. Thus we
derive the optimal decision test for the intruder at the
deep-hole.
Due to the coverage property of the hexagonal lattice,
the deep-hole signal points are furthest away from the
origin for the same sensor density as compared to any
other lattice. This provides for better performance of a
detection algorithm in terms of probability of error.
We take N = 6 sensors (see Fig.1) and obtain the
optimal hyperplane that separates the intruder and clutter
points corresponding to that of a deep hole. A way
of obtaining this hyperplane is by using the Neyman-
Pearson (NP) criterion [4] to detect an intruder from
clutter at the deep-hole point.
T = tau' is the decision surface which is the required
hyperplane in 6 dimensions. Fig.3 shows the ROC curve
for this hyperplane.1
Note that as the intruder moves away from the deephole
the signal points move away from the hyper-plane
(see Fig.2) and the probability of miss reduces. However
the clutter points move towards the decision surface
increasing the probability of false alarm.

IV. ALGORITHM
Given an L bit representation of the quantization
levels of the sensor reading, the bit communicated by
a sensor at the lth stage is the lth bit starting from
MSB. The sensor readings are optimally quantized using
Lloyd-Max algorithm. Although due to the AWGN noise
model, limits of the sensor reading ranges from −1 to
+1, we will assume a finite limit for quantization.
We denote the range of thetai given the first l bits
as (thetalowerlimit,thetaupperlimit).We assume that through a pre-defined
scheme each sensor knows which bit corresponds to
which sensor.
Algorithm for sensor i with L bit quantization:
1)2)3)
Observe that a sensor may collaborate in more than a
single set of 6 sensors. Even so the bit it is required to
transmit remains the same for all sets and hence a single
broadcast of the bit is sufficient.
This algorithm in effect approximates the hyperplane
decision boundary in a sequential manner. Note that the
algorithm can be suitably tailored for all other decision
boundaries as well.
A. Simulation Studies
We run the simulation for 6 sensors placed in a
hexagonal lattice with sensor-to-sensor distance (d) =
5p3 units (see Fig 1). The distance of the deep hole
from the nearest sensor node is given by d p3
. Fig.3
and Fig.4 show the plots for the performance of the
algorithm implementing the decision surface for with
and without deep-hole restrictions on source locations
for quantization of L = 8 and L = 4 bits respectively.
The noise variance sigma^2 is taken as 5e − 13.
Fig.5 and Fig.6 shows the results for average bits spent
in detection with respect to the values chosen for tau'. It
can be seen that the performance of the algorithm is close
to the optimal and the performance does not degrade
much even when the deep-hole restriction is removed. It
can be seen that the number of bits spent in detection is
low.

REFERENCES
[1] H. Amick. A Frequency-Dependent Soil Propagation Model.
SPIE Conference on Current Developments in Vibration Control
for Optomechanical Systems, Denver, Colorado, 1999.
[2] GP Mazarakis and JN Avaritsiotis. A prototype sensor node
for footstep detection. Proceeedings of the Second European
Workshop on Wireless Sensor Networks, pages 415–418, 2005.
[3] J. Tsitsiklis and M. Athans. On the complexity of decentralized
decision making and detection problems. Automatic Control, IEEE
Transactions on, 30(5):440–446, 1985.
[4] H.L. Van Trees. Detection, Estimation, and Modulation Theory
Part I. 1968.
[5] J.H. Conway and N.J.A. Sloane. Sphere Packings, Lattices and
Groups. 1993.
[6] R. Viswanathan and PK Varshney. Distributed detection with
multiple sensors I. Fundamentals. Proceedings of the IEEE,
85(1):54–63, 1997"
}

@INPROCEEDINGS{Agga0703:Generation,
AUTHOR="Preeti Aggarwal",
TITLE="Generation of image signatures for image retrieval",
BOOKTITLE="1st International Conference on Information Systems, Technology and
Management",
ADDRESS="New Delhi, India",
DAYS=12,
MONTH=mar,
YEAR=2007,
ABSTRACT="Image Signatures are one of the methods to improve the efficiency of image
retrieval systems. Image signature is basically a short, one-dimensional
entity, like a fingerprint, which extracts the image features and then
compare it with all the similar types of signatures in the database and
then retrieves the image by some matching criteria. The comparison can be
done with K-means clustering algorithm. Pre and post processing of ICM
algorithm can be done which was proposed by Jason Kinser to get the better
results."
}

@INPROCEEDINGS{Agga0704:X,
AUTHOR="Sudhir Aggarwal and Daniel Beech and Rajarshi Das and Breno {de Medeiros}
and Eric Thompson",
TITLE="{X-Online:} An Online Interface for Digital Decryption Tools",
BOOKTITLE="The 2nd International Workshop on Systematic Approaches to Digital Forensic
Engineering",
ADDRESS="Seattle, Washington, USA",
DAYS=10,
MONTH=apr,
YEAR=2007,
ABSTRACT="In this paper, we describe X-Online, a Web application designed to
interface with a password-recovery and/or decryption tool such as
AccessData’s Distributed Network Attack (DNA™) tool. X-Online allows
for submission of documents in a highly secure and reliable manner for
digital forensic processing. The output of the digital forensic tool
interfaced with X-online is displayed back to the user. We anticipate that
web service-based applications such as X-Online will be increasingly
important as e-Forensic tools. 
In this paper, we give an overview of the need for such systems, describe
our system’s design, and discuss the key security and reliability aspects
associated with the system. X-Online is based on two different Operating
System platforms (Linux and Windows), and uses a secure webserver as well
as additional authentication protocols for security. File sharing supports
interfacing to the widely used DNA Digital Decryption tool, and protecting
this service was accordingly a major component of our overall security
design. We also discuss the features that we plan to support in the future,
and our designs to use it in connection with a broader forensic research
initiative."
}

@INPROCEEDINGS{Agga0706:Boolean,
AUTHOR="Vaneet Aggarwal and Robert Calderbank",
TITLE="Boolean Functions, Projection Operators and Quantum Error Correcting Codes",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="This paper describes a common mathematical
framework for the design of additive and non-additive Quantum
Error Correcting Codes. It is based on a correspondence between
boolean functions and projection operators. The new framework
extends to operator quantum error correcting codes."
}

@INPROCEEDINGS{Agga0706:Computing,
AUTHOR="Alok Aggarwal and Erik Stauffer and Teresa Meng",
TITLE="Computing the Optimal Amount of Constellation Distortion in {OFDM} Systems",
BOOKTITLE="ICC 2007 Signal Processing for Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="The primary disadvantage of orthogonal frequency-division multiplexing
(OFDM)
is the high time-domain peak-to-average power ratio (PAR) that severely
limits the transmitter power efficiency. The PAR can be globally minimized
by distorting the OFDM constellation subject to a constraint on the error
vector magnitude (EVM). In this paper, we demonstrate that an optimal
amount of EVM exists for minimizing the transmitter power consumption while
maintaining a constant bit error rate (BER) at the receiver. Alternatively,
the EVM value may be chosen to maximize the channel capacity while
maintaining a constant power consumption at the transmitter. Both EVM
levels are only a function of the required signal-to-noise ratio at the
OFDM receiver."
}

@INPROCEEDINGS{Agga0709:Sensor,
AUTHOR="Vineet Aggarwal",
TITLE="Sensor Simulation on {FPGA} Hardware",
BOOKTITLE="AUTOTESTCON 2007",
ADDRESS="Baltimore, MD, USA",
PAGES="167-173",
DAYS=17,
MONTH=sep,
YEAR=2007,
KEYWORDS="sensors; data acquisition; ATE; simulation; FPGA; safety",
ABSTRACT="Automatic test systems often evaluate the functionality of measurement
and/or control hardware by simulating real world signals and verifying the
expected response.  Simulation takes the dynamics of a real-world
environments and models them using software to test the performance of
critical system hardware components.  Sensor simulation is the process of
providing realistic sensor signals to the inputs of a device under test and
evaluating how a piece of equipment will respond across a broad range of
operating conditions.  This paper will discuss the benefits of sensor
simulation, and specifically reference the additional advantages to using
an FPGA-based implementation."
}

@INPROCEEDINGS{Agha0706:Optimal,
AUTHOR="Farshid Agharebparast and Victor Leung",
TITLE="Optimal Shaping for Transmission over Wireless Fading Channels",
BOOKTITLE="The 8th IEEE Symposium on a World of Wireless, Mobile and Multimedia
Networks (WoWMoM 2007)",
ADDRESS="Helsinki, Finland",
DAYS=18,
MONTH=jun,
YEAR=2007,
ABSTRACT="In this paper, we derive the parameters of an optimal leaky-bucket shaper
for the transmission of constrained traffic over a wireless fading channel.
The analysis is based on an efficient stochastic min-plus system theory for
the derivations of second-order statistics, as a wireless fading channel is
a stochastic rate-latency server. The shaper is optimal in the sense that
it minimizes the end-to-end delay and buffer requirements under the
constraints dictated by the lower layer characteristics, in particular the
wireless channel. Our model is used to plot the analytic delay and buffer
sizes in comparison to simulation results for various values of shaper’s
parameters, from which the optimal or sub-optimal solution is calculated."
}

@INPROCEEDINGS{Agni0706:Enhancing,
AUTHOR="Samar Agnihotri and Pavan Nuggehalli and Ramesh Rao",
TITLE="Enhancing Sensor Network Lifetime Using Interactive Communication",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We are concerned with maximizing the lifetime of a sensor network
consisting of set of nodes directly communicating with a base-station. We
model this scenario as the interactive communication between multiple
correlated informants (sensor nodes) and a recipient (base-station). With
this framework, we show that interactive communication can indeed enhance
network lifetime. Both worst-case and average-case performances are
considered."
}

@INPROCEEDINGS{Agra0000:Energy,
AUTHOR="Prathima Agrawal and Pratap Prasad",
TITLE="Energy Efficient Spatial Distribution of Nodes in a Sensor Network",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="A principal factor in sensor network design is energy efficiency. In
this work, we propose to extend the lifetime of sensor networks
using appropriate choice of sensor node distribution. The key idea
of our scheme is to deploy more nodes in areas of extensive energy
usage. Using this scheme of sensor node distribution, we use
probabilistic angular routing to route data packets from the sensor
nodes to a sink. This scheme makes use of link usage probabilities to route
data
packets to immediate neighbors. It also incorporates angular routing
which forwards packets only to neighboring sensor nodes present in
assigned conical regions to prevent unnecessarily lengthy routes."
}

@INPROCEEDINGS{Agra0000:Issues,
AUTHOR="Dharma Agrawal",
TITLE="Design Issues and Information Retrieval in Sensor Networks",
BOOKTITLE="Mosharaka International Conference on Communications, Networking and
Information Technology",
ADDRESS="Amman, Jordan",
DAYS=6,
MONTH=dec,
YEAR=2007,
KEYWORDS="Sensor Networks",
ABSTRACT="The study of sensor networks is very peculiar and intriguing. The objective
of this tutorial is to start with basics of Cellular infrastructure; extend
to the functionality of ad hoc networks work; and then fully understand
issues in designing Sensor Networks. We bring out many underlying
interdependencies and cross-layer interactions in such networks. We explain
the impact of coverage area of each sensor as well as establish
communications
requirements among adjacent sensors. We consider the energy consumed by a
sensor unit in performing associated functionalities and explain different
ways of optimizing energy consumption. We consider several possible
applications of sensor networks in many civilian areas and explore their
potential usefulness. Then we concentrate on examining ways of collecting
sensed data from individual sensors. We look at the protocols used for
medium access, link layer and routing layer and understand relative
advantages and disadvantages. We also explore in both flat and hierarchical
topologies and investigate
how information could be effectively retrieved from such a sensor
deployment. The readers will not only understand and position themselves in
this hot area of sensor networks, but will also able to develop new
capabilities, enhance skills, share expertise, and consolidate their
knowledge."
}

@INPROCEEDINGS{Agra0703:Dynamic,
AUTHOR="Prathima Agrawal",
TITLE="Dynamic Interface Selection in Portable Multi-interface Terminals",
BOOKTITLE="IEEE International Conference on Portable Information Devices",
ADDRESS="Orange County Convention Center, Orlando, Florida USA, USA",
DAYS=25,
MONTH=mar,
YEAR=2007,
ABSTRACT="This paper addresses the problem of dynamic interface selection in a
terminal embedded with multiple interfaces. A mathematical model, to select
the best interface possible for a particular application at a given
instant, is described. The model takes into consideration the available
access networks and their characteristics. A handoff algorithm, for
transparently switching active sessions between interfaces, is proposed."
}

@INPROCEEDINGS{Agra0705:Diagnosing,
AUTHOR="Shipra Agrawal and K. v. m. Naidu and Rajeev Rastogi",
TITLE="Diagnosing Link-level Anomalies Using Passive Probes",
BOOKTITLE="IEEE INFOCOM 2007",
ADDRESS="Anchorage, Alaska, USA",
DAYS=6,
MONTH=may,
YEAR=2007,
ABSTRACT="In this paper, we develop passive network tomography
techniques for inferring link-level anomalies like excessive
loss rates and delay from path-level measurements. Our approach
involves placing a few passive monitoring devices on strategic
links within the network, and then passively monitoring the
performance of network paths that pass through those links. In
order to keep the monitoring infrastructure and communication
costs low, we focus on minimizing (1) the number of passive
probe devices deployed, and (2) the set of monitored paths.
For mesh topologies, we show that the above two minimization
problems are NP-hard, and consequently, devise polynomial-time
greedy algorithms that achieve a logarithmic approximation
factor, which is the best possible for any algorithm. We also
consider tree topologies typical of Enterprise networks, and
show that while similar NP-hardness results hold, constant factor
approximation algorithms are possible for such topologies."
}

@INPROCEEDINGS{Agra0706:Scalable,
AUTHOR="Deepak Agrawal and Mario Baldi and Michele Corrà and Giorgio Fontana and
Guido Marchetto and Viet Thang Nguyen and Yoram Ofek and Danilo Severina
and Huong Truong",
TITLE="Scalable Switching Testbed not “Stopping” the Serial Bit Stream",
BOOKTITLE="ICC 2007 Optical Networks and Systems Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="In order to achieve ultra scalable IP packet switching it is essential to
minimize “stopping” of the serial bit streams. In our recent
experimental work we demonstrated how such switch can be realized with and
ultra-scalable switching architecture reaching multi-terabits per second in
a single chassis. The implemented testbed uses only off-the-shelf optical
and electronic components. The scalability of this architecture is the
direct outcome of how global time (i.e., UTC – coordinated universal
time) and pipeline forwarding are utilized. The paper presents design and
some experimental details."
}

@INPROCEEDINGS{Agra0708:Analysis,
AUTHOR="Rajeev Agrawal and Anand Bedekar and Suresh Kalyanasundaram",
TITLE="Analysis of Paging in Distributed Architectures for {4G} Systems",
BOOKTITLE="IWCMC 2007 Next Generation Mobile Networks Symposium",
ADDRESS="Honolulu, Hawaii, USA, USA",
DAYS=12,
MONTH=aug,
YEAR=2007,
ABSTRACT="As 3G wireless systems evolve towards 4G, various wireless network
technology organizations looking at network architectures for 4G are
considering a redesign of the network away from the traditional
centralized, hierarchical design towards a more distributed operation of
network functions. In this paper, we present some mechanisms for
distributed operation of paging in 4G systems. Our focus is on highlighting
the tradeoffs that drive the design choice of whether to centralize or
distribute the paging operation. One such tradeoff arises from
considerations of service reliability and availability.  We present a
distributed redundancy scheme for improving the reliability and
availability for distributed paging.  We analyze the fraction of time that
mobiles remain reachable through paging (i.e.  the paging service
availability) in idle mode in the presence of base station and backhaul
failures."
}

@INPROCEEDINGS{Agra0712:Asymmetric,
AUTHOR="Priya Agrawal and Shahwar Nishat and Ekram Khan and Athar Moinuddin",
TITLE="Asymmetric Modulation for Transmission of {SPIHT} coded Images over
Wireless Channels",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="1110-1113",
DAYS=3,
MONTH=dec,
YEAR=2007,
KEYWORDS="Image coding, wavelet transform, SPIHT, QAM, HQAM, and Image Transmission,
wireless channel",
ABSTRACT="Due to recent advances in computing technology, data compression and high
bandwidth networks, demands for new multimedia services (“anytime” and
“anywhere”) over wireless networks are increasing day-by-day. The
image/video based multimedia services are highly bandwidth hungry and need
to be compressed before the transmission. Most of the compression
algorithms works on the principle of redundancy reduction, therefore,
increasing the dependency of generated bits over each other. Further, the
generated bits are of varying significance. On the other hand, wireless
channels are bandwidth limited and noisy, therefore highly unreliable. Thus
it is a challenging task to design efficient transmission systems to
deliver image/video over such unreliable wireless channels.
The wavelet transform has emerged as a sophisticated tool in the field of
image and video compression. Some of the most popular wavelet-based codecs
include SPIHT [1] and JPEG2000 [2]. SPIHT is a zerotree based algorithm and
is an improved version of EZW algorithm [3]. It provides outstanding
rate-distortion performance in noise free environments with many attractive
features such as resolution and quality progressive coding and is well
suited to the challenges of modern communication systems. However in the
presence of channel noise it is extremely sensitive to bit errors. Even a
single bit error may lead to loss of synchronization between the encoder
and the decoder beyond erroneous bit. As a result the quality of the
reconstructed image degrades substantially unless proper error correcting
methods are used.
Recently, in the literature many error resilient methods utilizing forward
error correction (FEC) are proposed for EZW and SPIHT bit streams. Sherwood
and Zeger [4] used rate compatible punctured convolution / cyclic
redundancy check (RCPC/CRC) to protect each fixed size packets equally,
irrespective of the relative importance of individual bits. In [5],
modified SPIHT bit streams are separated based on their error sensitivity,
and three tiers UEP is applied. 
The detailed analysis of SPIHT algorithm reveals that encoder generates
different type of bits that have different degree of vulnerability to the
channel errors. The effect of error in some bits is more severe, damaging
the image globally by disturbing the synchronization between the encoder
and decoder. Based on the degree of their sensitivity, the bits generated
by SPIHT algorithm can be classified into two classes: critical (CB) and
non-critical (NCB) bits. The error in the critical bits, in general, causes
global distortion while the non-critical bits, if erroneous, results in
distortion only locally.
The impact of channel errors, therefore, to a large extent, depends on what
portion of data is contaminated. In these situations, the effective use of
the limited system resources calls for a priority scheme to be set among
those portions. Naturally, the more important parts of the data should be
given higher priority and therefore protected more against transmission
impairments than the less sensitive data. 
In this paper, we propose the use of asymmetric modulation such as
hierarchical QAM (H-QAM) [6] to assign priorities to transport SPIHT coded
image bitstream over erroneous channels. The block diagram of proposed
communication system is shown in Fig. 1. SPIHT bitstream is rearranged and
partitioned into critical and non-critical sub-bitstreams based on their
bit-error sensitivity.  Generally, critical bits are 2-3 times higher than
the non-critical bits. It is observed that critical bits generated in the
later passes have relatively smaller error sensitivity as compared to those
of early passes of SPIHT. In order to have nearly equal number of bits in
each sub-bitstreams, some of the critical bits of later passes are appended
in the non-critical bitstream. The bitstream having critical bits of early
passes are assigned higher priority and are called high priority (HP) bits.
Whereas, the remaining bits are assigned low priority and are called low
priority (LP) bits.  This bitstream partitioning allows matching the
bit-error sensitivity of transmitted symbols in terms of mapping in the
constellation diagram of H-QAM. For 16-HQAM, each of the 4-bits symbols are
formed by two bits from each bitstream with HP bits as the MSBs and LP bits
are LSBs of the symbols. These symbols are mapped to the non-uniform signal
constellation of 16-HQAM as shown in Fig. 2. By adjusting the modulation
parameter , the relative priority of two bitstreams can be changed,
depending upon the noise conditions in the channel.   corresponds to
uniform constellation of QAM.
In order to prove the effectiveness of the proposed system, we have
considered the   gray-scale LENA image. The performance is evaluated in
terms of peak signal to noise ratio (PSNR) of the image at the receiver for
various noise conditions of AWGN channel with various values of  as shown
in Fig. 3. It can be observed that the increase in   increases the quality
of received image under the same noise conditions. This is because with
increasing ‘α’ greater protection is provided to the HP bits as a
result the significant information in the image is protected. 
In this paper the use of H-QAM technique, to priorities the compressed data
is investigated. The performance of two-level HQAM based image transmission
system is evaluated under Additive White Gaussian Noise (AWGN) conditions.
The extensive simulation results showed that the use of asymmetric
modulation results in significantly higher quality of reconstructed image
as compared to the symmetric modulation.
REFERENCES
1.	A. Said and W. Pearlman, “A new fast and efficient codec based on set
partitioning in hierarchical trees,” ” IEEE Transaction on Circuits
System for Video Technology, vol. 6, pp. 243-250, June 1996.
2.	D. Taubman and M. Marcellin. JPEG2000: Image Compression Fundamentals,
Standards, and Practice. Kluwer, 2001.
3.	J.M. Shapiro, “Embedded image coding using zerotrees of wavelet
coefficients,” IEEE Transaction on Accoust, Speech and Signal Processing,
vol. 41, pp. 3445-3462, December 1993.
4.	P. G. Sherwood and K. Zeger, “Progressive image coding on noisy
channels”, IEEE Signal Processing Letters, vol. 4, pp. 189-191, July
1997.
5.	H. Man, F. Kossentini and M. J. T. Smith, “A family of efficient and
channel error resilient wavelet/subband image coders”, IEEE Trans.
Circuit \& Systems for Video Technology, vol. 9, pp. 95-108, Feb. 1999.
6.	S. Mirabbasi and K. Martin, “Hierarchical QAM: a spectrally efficient
DC-free modulation scheme”, IEEE Communication Magazine, Vol. 38, pp.
140-146, Nov. 2000."
}

@INPROCEEDINGS{Agra0712:Enhanced,
AUTHOR="Dharma Agrawal",
TITLE="Enhanced Approach for Random Key {Pre-Distribution} in Wireless Sensor
Networks",
BOOKTITLE="Mosharaka International Conference on Communications, Networking and
Information Technology",
ADDRESS="Amman, Jordan",
DAYS=6,
MONTH=dec,
YEAR=2007,
KEYWORDS="Random Key Pre-Distribution; Wireless Sensor Networks; Symmetric Key;
Secured Communication",
ABSTRACT="Secure communication has to be achieved when a wireless sensor network
(WSN) is deployed in a hostile environment. The resource constraint of tiny
sensors makes symmetric key cryptography more preferable for data
encryption. Due to lack of infrastructure support, how to distribute secret
keys into sensor nodes in large-scale WSNs is not a trivial problem. Based
on a well-designed key matrix pool, we propose an enhanced approach to
randomly distribute secret keys into sensor nodes before they are deployed.
Unlike existing random key approaches, our scheme guarantees secure link
between any two neighboring sensor nodes with lower key storage overhead.
In addition, our scheme achieves better network resilience against
node-capture attack. An efficient one-way hash chain is further used to
update the established pairwise key between sensor nodes against possible
key compromise and replay attacks."
}

@INPROCEEDINGS{Agud0703:Statistical,
AUTHOR="Jordi {Agud Ruiz} and Shigeru Shimamoto",
TITLE="Statistical Modeling of Intra-body Propagation Channel",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="Intra-body communications based on near-field radio signals is a short
range communication solution suitable for Body Area Networks wherein the
human body is used as the transmission medium. This paper proposes a
statistical model for the intra-body propagation channel based on
experimental data of the human body transmission characteristics. The
channel models are presented over three measurements configurations with
several transmitter and receiver locations and considering two common
scenarios: the human body not moving and walking. We define the statistical
models in terms of most fitting probability density function to the
experimental data of the received signal power among 15 families of
probability distributions. These general models should be useful for
simulating propagation effects in the laboratory and, therefore, we believe
that these models will play a significant role in the design and evaluation
of intra-body communication systems."
}

@INPROCEEDINGS{Ague0704:Wireless,
AUTHOR="Max Agueh and Francois-Olivier Devaux and Jean Francois Diouris",
TITLE="A wireless Motion {JPEG} 2000 video streaming scheme with a priori channel
coding",
BOOKTITLE="European Wireless 2007",
ADDRESS="Paris, France",
DAYS=1,
MONTH=apr,
YEAR=2007,
ABSTRACT="In this work, we present a wireless image/video streaming system for robust
transmission of JPEG 2000 codestreams over wireless systems. The proposed
architecture, based on a priori Forward Error Correction (FEC) rate
allocation allied to layered Unequal Error Protection (UEP), is implemented
according to the main recommendations of Wireless JPEG 2000 standard final
draft. We highlight the effectiveness of the proposed scheme by presenting
results from JPEG 2000 frames streaming over memoryless Binary Symmetric
Channel (BSC) and Gilbert-Elliot channel (based on Markov chain of order
1). Going straightforward we derived interesting results from Motion JPEG
2000 video streaming over real wireless channel traces."
}

@INPROCEEDINGS{Ague0706:Relay,
AUTHOR="Ramon Aguero and Johnny Choque and Luis {Muñoz}",
TITLE="On the {Relay-Based} Coverage Extension for {Non-Conventional} {Multi-Hop}
Wireless Networks",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Due to the rapid growth of personal communications,
it is now believed that multi-hop topologies will certainly
play a key role in forthcoming wireless communications scenarios.
Amongst other aspects, they will facilitate the appearance of
new business models, allowing e.g. the possibility for operators
to extend their services on a cost effective way. In this sense, an
end-user may act as a relaying node, offering other end-users the
possibility to connect to a Base Station (or Access Point) even
if these were not able to do it directly (because e.g. they were
not within the coverage area or they were not costumers of that
operator). This paper analyzes one of the benefits brought about
by multi-hop accesses, particularly the coverage extension that
could be brought about by these approaches, by performing both
an analytical and a simulation study. With to the obtained results
some conclusions, which can be used to streamline subjacent
routing and networking procedures, are extracted."
}

@INPROCEEDINGS{Agui0000:Multimodal,
AUTHOR="Gualberto Aguilar and Gabriel Sanchez and Karina Toscano and Mariko Nakano
and Héctor {Pérez}",
TITLE="Multimodal Biometric System Using Fingerprint",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="AFIS, FFT, Gabor Filter, Minutiaes, Recognition, Verification.",
ABSTRACT="Fingerprint recognition is one of the most popular methods used for
identification with greater degree of success. The fingerprint has unique
characteristics called minutiae, which are points where a curve track
finishes, intersect or branches off. Identification systems using
fingerprints biometric patterns are called AFIS (Automatic Fingerprint
Identification System). In this work a method multi-biometric is considered
using a combination of Fast Fourier Transform (FFT) and Gabor Filters to
enhancement the image and later a novel stage of recognition using Local
Features and Statistical Parameters."
}

@INPROCEEDINGS{Agui0707:Enabling,
AUTHOR="Alberto Aguilar and Raimund Ege and Kia Makki and Raime Bustos",
TITLE="Enabling Peer Cooperation in Private Local Networks Using {BitTorrent}",
BOOKTITLE="12th IEEE Symposium on Computers and Communications",
ADDRESS="Aveiro, Portugal",
DAYS=1,
MONTH=jul,
YEAR=2007,
ABSTRACT="The number of computers and high-speed networks connected to the Internet
in large-scale organizations has grown in the last two decades. As a
consequence, a large number of software applications must be installed and
the quantity of data needed for their operation is considerable. This has a
high price for IT departments: distribute this content efficiently. We
claim that content distribution using P2P file sharing systems can be used
to accomplish this; we
propose a solution that works even in environments that use NAT and
utilizes WAN links efficiently."
}

@INPROCEEDINGS{Agui0708:Embedding,
AUTHOR="Rui Aguiar and Alfredo Matos and Susana Sargento",
TITLE="Embedding Identity in Mobile Environments",
BOOKTITLE="The Second International Workshop on Mobility in the Evolving Internet
Architecture",
ADDRESS="Kyoto, Japan",
PAGES="23-30",
DAYS=27,
MONTH=aug,
YEAR=2007,
ABSTRACT="Recent trends bring Identity concepts into the application layer, although
usually focusing in web environments. While this enables new solutions,
interactions and paradigms at the application layer, the lower layers are
neglected, and considered irrelevant for identity purposes. However, making
Identity information available to the OSI stack enables enhanced protocols,
which better integrate with A4C mechanisms, and provide better cross-layer
integration. We present a solution to integrate identity information into
all layers of the OSI stack, and enhance it with resolution mechanisms,
enabling full fledged use of Identity by lower layers, such as transport
and network. In particular, a new mobility paradigm can be created through
an identity-dependent design."
}

@INPROCEEDINGS{Agul0712:Reducing,
AUTHOR="Emmanuel Agullo and Abdou Guermouche and Jean-Yves L'Excellent",
TITLE="On Reducing the {IO} Volume in a Sparse Out-of-core Solver",
BOOKTITLE="14th Annual IEEE International Conference on High Performance Computing",
ADDRESS="Goa, India",
DAYS=18,
MONTH=dec,
YEAR=2007,
ABSTRACT="High performance sparse direct solvers are often a method of choice
in various simulation problems. However, they
require a large amount of memory compared to iterative methods.
In this context, out-of-core solvers must be employed, where
disks are used when the storage requirements are too large with
respect to the physical memory available. In this paper, we
study how to minimize the I/O requirements in the multifrontal
method, a particular direct method to solve large-scale problems
efficiently. We show from a theoretical point of view
that minimizing
the I/O volume is very different from minimizing the storage requirements.
Experiments on large real-life problems show that the volume of I/O
obtained
when minimizing the storage requirement can be significantly reduced
when applying algorithms designed to reduce the I/O volume."
}

@INPROCEEDINGS{Aham0712:Efficient,
AUTHOR="Shaik Ahamed",
TITLE="An Efficient Realization of the sign {LMS} based Adaptive Decision Feedback
Equalizer using Block Floating Point Arithmetic",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="422-426",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="An efficient scheme is presented for implementing
the sign adaptive decision feedback equalizer in block floating
point (BFP) arithmetic is presented. The scheme adopts separate BFP
format, which permits processing of data over a wide dynamic range,
at temporal and hardware complexities significantly less than that
of a floating point processor. A particular version of the sign
ADFE, namely, the signed-regressor ADFE has been considered. This
scheme adopts separate BFP formats for  for the feed forward and the
feedback filter weights and works out separate update relations for
their respective mantissas and exponents. Care is taken to prevent
overflow in all computations by using a dynamic scaling of the data
and a carefully chosen upper bound for the step size $\mu$. Since no
block processing of the feedback input is possible, an efficient
scheme is presented for block formatting the data stored in the
feedback filter memory, at each time index. The proposed scheme
mostly employs simple fixed point operations and achieves
considerable speed up over its floating point counterpart.
The adaptive decision feedback equalizer (ADFE) provides a very
effective means for equalizing communication channels that exhibit
spectral nulls and / or have very long impulse response spanning
several symbol periods. The ADFE consists of a feed forward filter
(FFF) and a feedback filter (FBF). The FFF, working directly on the
received data, tries to equalize the anticausal part of the channel
impulse response. The residual ISI at the FFF output is then
cancelled by passing the past decisions through an appropriately
designed FBF and subtracting the FBF output from the FFF output.
Both the FFF and the FBF coefficients are trained by some
appropriate adaptive algorithm.

In practical communication receivers, the input to the ADFE is
obtained by first processing the received sample, usually very weak
in strength, through a programmable gain amplifier (PGA). The PGA
continuously adjusts its gain (by a power of two) so as to make the
best usage of the available dynamic range of the ADC. This, however,
gives rise to a floating point (FP) representation of the ADFE
input, with the mantissa and the exponent given respectively by the
ADC output and the negative of the log of the PGA gain. A direct FP
based implementation of the ADFE would, however, require much higher
processing complexity than a typical fixed point (FxP) based
realization, as, in FP, each step of computation requires several
additional steps not required in FxP. The block floating point (BFP)
data format, in this context, is a viable alternative to the FP
system. In BFP, a common exponent is assigned to a block of data. As
a result, computations involving these data require only simple FxP
operations, while presence of the exponent provides a FP like high
dynamic range. Over decades, the BFP format has been used for
efficient implementation of many signal processing algorithms.
Recently, the BFP treatment has been extended for efficient
implementation of LMS based adaptive filters [\cite{am0}-\cite{mc1}]
and LMS based ADFE[\cite{rafi}].
 In this
paper, we present a scheme for BFP based realization of sign ADFE.
The proposed scheme may be viewed as an extension of BFP-based ADFE
[\cite{rafi}]. In literature, there exist three versions of the sign
ADFE, namely, the signed regressor ADFE, the sign-sign ADFE, and the
sign ADFE, all three requiring only half as many multiplications as
in the conventional ADFE, thus making attractive from practical
implementation point of view. We present here a BFP treatment to the
first one, i.e., the signed-regressor ADFE. The same for the second
and third can be developed along analogous lines. Our proposed
scheme adopts approprite BFP formats for the FFF and the FBF filter
coefficients. Care is also taken to prevent overflow during
filtering and weight updating. Finally, it is shown that given a low
cost, simple FxP processor, our proposed scheme is about \emph{two
and a half times faster} than its FP-based counterpart."
}

@INPROCEEDINGS{Ahir0000:FPGA,
AUTHOR="Balkrishan Ahirwal and Mahesh Khadtare and Rakesh Mehta",
TITLE="{FPGA} based system for Color Space Transformation {RGB} to {YIQ} and
{YCbCr}",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="FPGA, Image processing, Xilinx, Color Space, ITU-R BT.601 standards YCbCr
Color Space, YIQ Color space, thermal Imaging",
ABSTRACT="This paper explores the performance and architectural tradeoffs involved in
the design of FPGA based real time image processing systems. Image
processing is a rapidly evolving field with growing applications in science
and engineering. The study of color is important in the design and
development of color Vision. There are several coordinate systems which
came into existence for variety of reasons.  This paper discusses the use
of restructurable hardware specifically field programming gate arrays, for
R’G’B’ Color Space to Y’CbCr and YIQ color Space. YCbCr color space
is necessary in many video designs.  YIQ color space is used by NTSC
composite color video standard n. The reference design files show RTL
(VHDL) code to describe the conversion equations and synthesize to a target
FPGA. The code is parameterizable for the input/output precision and the
internal coefficient precision. Simulation test vectors (25\%, 50\%, 75\%,
and 100\% RGB Color Bars) are also provided as an implementation example,
placed and routed design in a Spartan-II device (2S200PQ208) is discussed.
In case of YCbCr conversion, HDTV color space coefficients are different
(covered in BT.709-3, June 1990). This application note does not cover this
area."
}

@INPROCEEDINGS{Ahls0706:Oblivious,
AUTHOR="Rudolph Ahlswede and Imre Csiszar",
TITLE="On oblivious transfer capacity",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007
}

@INPROCEEDINGS{Ahma0000:Dynamic,
AUTHOR="H Farooq Ahmad",
TITLE="A dynamic Policy based Security Architecture for Mobile Agents",
BOOKTITLE="The first International Conference on New Technologies, Mobility and
Security",
ADDRESS="PARIS, France",
DAYS=2,
MONTH=may,
YEAR=2007,
ABSTRACT="Mobile agents are undoubtedly the upcoming trend in the agent community. As
their use is increasing, security problems are coming forth. A mobile agent
must address several security issues. An agent may be malicious, the
platform on which it executes may carry on sinister activities on it or the
agent may be harmed by another malicious agent. Most of the security
approaches do not provide any flexibility or dynamic decision making.
Therefore, security threats increase further. In our paper, we suggest an
approach that uses dynamic ontology based policies to enforce security in
platforms as well as in mobile agents. The approach is a hybrid one which
utilizes other security measures as well. We have also evaluated the
approach on software quality parameters other than security like
portability, flexibility and efficiency. The results have been
satisfactory."
}

@INPROCEEDINGS{Ahma0000:Implementation,
AUTHOR="Noor Azurati {Ahmad (at) Salleh} and Rosbi Mamat",
TITLE="Implementation of Embedded Web Server for Mobile Robot Systems",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="261-266",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="minimal TCP/IP stack; mobile robot; embedded system; embedded Web server",
ABSTRACT="With the rapid growth of the Internet¸ the interest for connecting small
devices such as sensors or embedded system appliances into an existing
network infrastructure has increased.  Web browser is used by remote
operator to control and monitor the devices via Internet and these
applications are widely utilized in tele-operation, space exploration and
tele-training systems.  Such devices often have very limited CPU and memory
resources and may not be able to run a complete TCP/IP protocol suite. This
paper described an implementation of embedded Web server for a mobile robot
using minimal TCP/IP stack.  The minimal TCP/IP stack has to minimize the
standard TCP/IP, in terms of code size and resources to be embedded into
minimal systems such as small mobile robots. The performance of the
embedded Web server for tele-control of a mobile robot was evaluated and
presented."
}

@INPROCEEDINGS{Ahma0000:Surface,
AUTHOR="Siti Ahmad and Paul Chappell",
TITLE="Surface {EMG} Classification Using Moving Approximate Entropy",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="155-159",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="moving approximate entropy; surface EMG; wrist flexion/ extension,
isometric, co-contraction",
ABSTRACT="Moving approximate entropy has been proposed as a new method to extract
information from the surface electromyographic signal.    Twenty subjects
performed wrist flexion/ extension, isometric and co-contraction while
electromyographic signals were recorded with surface electrodes.  A moving
data window of 200 values was applied to the data (moving approximate
entropy).  The results show that there is regularity in an EMG signal at
the beginning and end of a muscle contraction with low regularity during
the middle part."
}

@INPROCEEDINGS{Ahma0706:Efficient,
AUTHOR="Ahmad Ahmad and Khaled Masmoudi and Hossam Afifi",
TITLE="Efficient Group Management For {InterPAN}",
BOOKTITLE="ICC 2007 Wireless Adhoc and Sensor Networks Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="This paper presents an architecture for resource sharing in wireless
personal networks (WPANs). Resources are not necessarily in the same
authentication domain and the group that use them is called a federation.
The architecture is based on two components: A signaling protocol and a
group key management system. We describe the federation architecture and
explain the different interactions with the protocols. We describe the
efficient group key algorithm. We conclude by presenting a performance
evaluation of the different procedures.—"
}

@INPROCEEDINGS{Ahma0706:SAMcast,
AUTHOR="Waseem Ahmad and Ashfaq Khokhar",
TITLE="{SAMcast} - A Scalable, Secure and Authenticated Multicast Protocol for
Large Scale {P2P} Networks",
BOOKTITLE="ICC 2007 Computer and Communications Network Security Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Overlay networks have shown tremendous potential in solving large scale
data dissemination problem by employing peer-topeer communication
protocols. These networks, however, have mostly been used for illegal
dissemination of copyrighted material.
This paper is aimed at investigating an incentive driven approach to
encourage users to actively participate in overlay activities. The users
are also discouraged from indulging in illegal distribution of copyrighted
material by employing an efficient public key based broadcast encryption
scheme along with a deterministic traitor tracing mechanism. We note that
public key based broadcast
encryption schemes require some mechanism by which a peer can verify the
integrity of contents downloaded from other peers. SAMcast is the first
protocol, to the best of our knowledge, which provides an efficient
integrity verification mechanism along with public key based broadcast
encryption. Our experiment results show that the proposed broadcast
encryption scheme is highly scalable and the integrity verification is
extremely efficient both in terms of computation and communication."
}

@INPROCEEDINGS{Ahma0711:Cache,
AUTHOR="Mahmood Ahmadi and Stephan Wong",
TITLE="A Cache Architecture for Counting Bloom Filter",
BOOKTITLE="15th IEEE International Conference on Networks ICON2007",
ADDRESS="Adelaide, South Australia, Australia",
PAGES="493-498",
DAYS=19,
MONTH=nov,
YEAR=2007,
KEYWORDS="Cached counting Bloom filter; network processor; packet processing, cache
levels",
ABSTRACT="Overhead on memory accesses limits the performance of packet
processing systems. To overcome this limitation, network processor
utilize alternatives such as multi-level memory hierarchies, special
hardware cache architectures, and hardware threading. In this paper,
we introduce a multi-level memory hierarchy and special hardware
cache architecture for counting Bloom filters that are utilized by
network processors and packet processing applications such as packet
classification and distributed web caching systems. Based on the
value of the counters in the counting Bloom filter a multi-level
cache architecture called a cache counting Bloom filter (CCBF) is
presented and analyzed. The results show that the proposed cache
architecture decreases the number of accesses by at least 51.3\%
when it compared to standard Bloom filter."
}

@INPROCEEDINGS{Ahma0711:Hybrid,
AUTHOR="Alireza Ahmadian and Shahrbanoo HamidPour and Reza Zoroofi and Javad
{Hasani Bidgoli}",
TITLE="Hybrid Segmentation of Colon Boundaries in {CT} Images Based On Geometric
Deformable Model",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="967-970",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Colonic walls segmentation;Virtual Colonoscopy;region
growing;thresholding;geometric deformable;",
ABSTRACT="One of the most important stages of virtual colonoscopy is colon
segmentation, since an incorrect segmentation may lead to a misdiagnosis.
Geometric deformable models (GDM) are found as efficient and attractive
tools for structural based segmentation in particular to extract objects
with complicated topology. There are two parameters influencing the overall
performance of GDM algorithm; the distance between the initial contour and
the actual object’s contours and the stopping term which controls the
deformation. To overcome these limitations, a two-stage based segmentation
is utilized to extract the rough but precise initial contours at first.
Then, extracted boundaries are smoothed and fined using a modified GDM
algorithm by improving the stopping terms of the algorithm. The proposed
method considerably removes false contours obtained during the first stage.
The improvement of 6\% on the accuracy of the segmentation method in
comparison with region growing method is also achieved"
}

@INPROCEEDINGS{Ahma0711:Neural,
AUTHOR="Jamil Ahmad and Imran Shafi and Ismail Shah and Faisal Kashif",
TITLE="Neural Network Solution for Compensating Distortions of Time Frequency
Representations",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1575-1578",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Time Frequency Analysis, Clustering, High Resolution Time Frequency
Distributions, Bayesian Regularization, Localized Neural Networks,
Instantaneous Frequency,",
ABSTRACT="A Neural Network (NN) based realization to obtain energy concentration
along the Instantaneous Frequencies (IFs) of individual components present
in the signal is proposed by compensating linear and non linear distortions
present in Time Frequency Representations (TFRs). Blurry spectrograms and
highly concentrated Wigner Distributions (WDs) of various signals
constitute the training set. The input data is grouped according to some
underlying feature present in TFR image to have better generalization
ability of the trained NN. Blurry TFRs of multi component signals are then
given as test cases to the trained NN. Effectiveness of the approach is
established by comparing the information content in each input \& resultant
TFR."
}

@INPROCEEDINGS{Ahma0711:Performance,
AUTHOR="Mohammad Ahmad and Aykut Hocanin and Osman Kukrer",
TITLE="Performance of the {Frequency-Response-Shaped} {LMS} Algorithm in Impulsive
Noise",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="249-252",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Frequency-Response-Shaped LMS, Leaky-LMS, correlated noise, impulsive noise",
ABSTRACT="The performance of the Frequency-Response-Shaped Least Mean Square
(FRS-LMS) adaptive algorithm in estimating a sinusoidal signal in impulsive
and correlated noise is investigated. The algorithm does not require a
priori knowledge about the nominal Gaussian process and is able to adapt to
changes in the environment. The performance of the FRS-LMS is compared to
that of the Leaky-LMS algorithms in terms of Mean Square Error (MSE) and
convergence speed. The results indicate that while the FRS-LMS and the
Leaky LMS algorithms perform similarly in AWGN, the FRS-LMS provides
superior performance in impulsive and correlated noise environments. The
performance gain is due to the frequency shaping and outlier reduction
properties of the algorithm."
}

@INPROCEEDINGS{Ahma0711:Robust,
AUTHOR="Shakeel Ahmad and Raouf Hamzaoui and Marwan Akaidi",
TITLE="Robust Live Unicast Video Streaming with Rateless Codes",
BOOKTITLE="16th International Packet Video Workshop",
ADDRESS="Lausanne, Switzerland",
DAYS=12,
MONTH=nov,
YEAR=2007,
ABSTRACT="We consider live unicast video streaming over a packet erasure 
channel. To protect the transmitted data, previous solutions use forward
error correction (FEC) where the channel 
code rate is fixed in advance according to an estimation of the packet loss
rate. However, these solutions are inefficient under dynamic and
unpredictable channel conditions because of the mismatch between the
estimated code rate and the actual one. We introduce a new approach based
on rateless codes and receiver feedback. For every source block, the sender
keeps on 
transmitting the encoded symbols until it receives an acknowledgment from
the receiver indicating 
that the block was decoded successfully. Within this framework, we provide
an efficient algorithm to 
minimize bandwidth usage while ensuring successful decoding subject to an
upper bound on the packet loss rate.  
Experimental results showed that compared to traditional fixed-rate FEC,
our scheme provides significant bandwidth savings for the same playback
quality."
}

@INPROCEEDINGS{Ahma0712:Focus,
AUTHOR="Muhammad Bilal Ahmad",
TITLE="Focus Measure Operator using {3D} Gradient",
BOOKTITLE="International Conference on Machine Vision 2007",
ADDRESS="Islamabad, Pakistan",
DAYS=28,
MONTH=dec,
YEAR=2007,
KEYWORDS="Shape from focus; focus measure operator; 3D gradient",
ABSTRACT="The shape from focus (SFF) is used to reconstruct a three-dimensional (3D)
structure of objects from a sequence of two-dimensional (2D) images. The
basic idea of image focus is that objects at different distances from a
lens are focused at different distances. In SFF, focus measure operator is
applied on the sequence of images. From the analysis of defocused image, it
is observed that the focus measure operator should respond to high
frequency variations of image intensity and produce maximum values when the
image is perfectly focused. Therefore, an effective focus measure operator
should be a high pass filter. In literature, 2D gradient and other HPF
operators are used as focus measure operator. As the sequence of images can
be represented as 3D image volume, and the step size in the sequence of
input images is very small, we, therefore, present the idea of using 3D
gradient filter as focus measure operator for SFF. The better depth map
results obtained using 3D focus measure operators as compared to using 2D
focus measure operators are shown in the simulation results."
}

@INPROCEEDINGS{Ahme0000:Framework,
AUTHOR="Dewan Ahmed and Shervin Shirmohammadi",
TITLE="A Framework for Provisioning Overlay Network Based Multimedia Distribution
Services",
BOOKTITLE="ICME'07 - Multimedia Systems and Applications Track",
ADDRESS="Beijing, P.R. China",
DAYS=2,
MONTH=jul,
YEAR=2007,
ABSTRACT="In this paper, we present a graph-theoretic framework for provisioning
overlay network based multimedia distribution services to a diverse set of
receivers. Considering resource limitations and exploiting geographical
positions, it greedily constructs degree-constrained minimum-cost connected
graph to manipulate the topology to a significant extent by selecting mesh
neighbors and changing the metrics. Data delivery paths and forwarding
nodes are chosen using the dominating set. The minimal cardinality of the
dominating set reduces the system’s dependency on end-hosts. Simulation
is used to demonstrate that the framework is more robust and responsive to
tree partitions and suitable for multi-source multimedia applications."
}

@INPROCEEDINGS{Ahme0000:Inter,
AUTHOR="Sadia Ahmed and Huseyin Arslan",
TITLE="Inter-symbol Interference in High Data Rate Transmit Reference {UWB}
Transceivers",
BOOKTITLE="International Conference on Ultra-Wideband 2007",
ADDRESS="Marina Mandarin Singapore, Singapore",
DAYS=24,
MONTH=sep,
YEAR=2007,
ABSTRACT="Ultra Wideband (UWB) Systems take advantage of collecting energy from a
large number of multipaths. In
high data rate systems, the leakage of these paths among symbols may cause
severe inter-symbol interference
(ISI) and degrade performance. A few techniques were presented in the past
to improve non-coherent receiver
performance in the presence of ISI. In this paper, a new and simple
transmit reference (TR) signaling scheme
is proposed for high data rate systems. It is shown with semi-analytical
analysis and simulation that the new
scheme produces negligible ISI effect and impacts TR receiver performance
insignificantly."
}

@INPROCEEDINGS{Ahme0000:Intra,
AUTHOR="Mohiuddin Ahmed and Cem Saraydar and Michael Ames and Tamer ElBatt and Tim
Talty and Jijun Yin",
TITLE="Intra-vehicular Wireless Networks",
BOOKTITLE="Second IEEE Workshop on Automotive Networking and Applications",
ADDRESS="Washington, DC, USA",
DAYS=30,
MONTH=nov,
YEAR=2007,
ABSTRACT="Automotive wiring harnesses that provide the wiring infrastructure for
electrical and electronic sub-systems inside vehicles have grown in size
over the years and now pose significant engineering challenges: increased
weight / decreased fuel economy, increase in production steps, cost and
labor required for installing the harnesses in a vehicle, design complexity
and limitations as a result of increasing harness size, etc.. Wireless
communications provides an intriguing alternative. This paper investigates
the issue of replacing the current wired data links that run between
electrical control units (ECU) and sensors/switches in a vehicle with
wireless links. We present a wide range of engineering issues and discuss
potential solutions. We also provide recommendations with regard to future
wireless intra-vehicular networks, specifically a discussion on limitations
and opportunities, based on simulation results, for network operations over
an IEEE 802.15.4 stack."
}

@INPROCEEDINGS{Ahme0000:Observer,
AUTHOR="Salman Ahmed and Mohd Noh Karsiti and Jose Cruz",
TITLE="Observer Based Feedback Control Strategies for Collaborative Robots",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="108-112",
DAYS=25,
MONTH=nov,
YEAR=2007,
KEYWORDS="Leader-follower formation; Nonholonomic collaborative robots; Observer
feedback controller",
ABSTRACT="This paper presents observer based feedback control strategies for
nonholonomic collaborative robots.  The collaborative robot system uses the
leader-follower formation controller. The observer based feedback
strategies are presented for the leader robot. The control inputs for the
follower robot are derived based on input-output linearization techniques.
The system is modeled using Simulink and simulation results are presented.
From the simulation results, it can be seen that the error for observer 
based feedback controller converges rapidly to zero. Furthermore, the
observer based feedback controller results in a K-exponentially stable
system. The work presented here is an initial study concerning the design
of observer feedback controllers for nonholonomic collaborative robots."
}

@INPROCEEDINGS{Ahme0000:Optimistic,
AUTHOR="Ashraf Ahmed and Dhanapal Dominic",
TITLE="Optimistic Replication in Mobile Traffic Control",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="Data Management in mobile computing poses great challenges to the database
researchers. One of the important challenges is to provide a data
replication
solution, suitable for various applications in the mobile environment.
Because of this difficulty, this paper interested to address a solution
customized to one of most important areas in our live that is traffic
control area, because this area strongly demand solutions for managing and
maintaining data distributed between multiple sites. Our solution is based
on the use of optimistic replication, which is the best technique for
sharing data efficiently in mobile environment. The solution is applied by
using Microsoft SQLSERVER replication types: Snapshot replication, Merge
replication, and Transactional replication, and adaptation of some
activities of these techniques to ensure availability and consistency of
data."
}

@INPROCEEDINGS{Ahme0000:Partitioning,
AUTHOR="Waseem Ahmed and Adrus {Mohamad Tazuddin} and Wong {Ming Ming} and Liaw
{Tzy Renn} and Douglas Myers",
TITLE="Partitioning for a {Concept-Based} {SoC} Design to Address Product
Evolution",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="To address changes encountered during product evolution in SoCs, a concept
based design methodology based on UML 2.0 is presented in this paper. A
system specification given in the form of UML 2.0 sequence and class
diagrams is segregated into concepts with a Generic Adaptive Layer(GAL)
around them. GALs  offer generic adaptability to existing concepts and
change localization during product evolution. The major advantage of using
the presented methodology is an improvement in the development time of the
system during both the design and the maintenance phases. Experiences from
using three categories of concepts are presented."
}

@INPROCEEDINGS{Ahme0000:Performance,
AUTHOR="Walid Ahmed and Ajit Reddy and Qing Li and Eoin Carey",
TITLE="Performance Analysis of a Novel {Real-Time} {Closed-Loop} Technique for
{Non-Linearity} Correction of Power Amplifiers",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="Please be advised that abstract and full paper could not be uploaded on the
EDAS system before December 4th, 2006 due to administrative delays. Full
paper manuscript will be disclosed and uploaded before the end of December
2006. Your support and understanding are greatly appreciated.
Thank you."
}

@INPROCEEDINGS{Ahme0000:Supporting,
AUTHOR="Dewan Ahmed and Shervin Shirmohammadi and Jauvane Oliveira and Jimmy Bonney",
TITLE="Supporting {Large-Scale} Networked Virtual Environments",
BOOKTITLE="Conference on Virtual Environments, Human-Computer Interfaces and
Measurement Systems",
ADDRESS="Ostuni, Italy",
DAYS=25,
MONTH=jun,
YEAR=2007
}

@INPROCEEDINGS{Ahme0702:Map,
AUTHOR="Ahmed Ahmed and Hongchi Shi and Yi Shang",
TITLE="Map-based Adaptive Positioning in Wireless Sensor Networks",
BOOKTITLE="International Symposium on Wireless Pervasive Computing 2007",
ADDRESS="San Juan, Puerto Rico",
DAYS=5,
MONTH=feb,
YEAR=2007,
ABSTRACT="Localization in wireless sensor networks is crucial to both the
applications and the services. Due to the expected relatively long
lifetime of sensor networks, the topology is assumed to be
dynamically changing. In addition, sensor nodes, or at least
subset of them, can be mobile. This results in the need for
frequent localization, or at least doing it more than once. In
this paper, we present a distributed adaptive localization method
that we refer to as: Map-based Adaptive Positioning (MAP). The
main idea is to construct a relative local map at every node in
the network, consisting of the node itself and its immediate
neighbors, and merge the local maps together to form a global map.
We consider two algorithms that can be used to estimate the
relative local maps: multidimensional scaling (MDS) and
semidefinite programming (SDP). The performance of these
algorithms depend on two parameters: the size of the local map,
i.e., the number of nodes, and the average connectivity of the
node at the center of the local map and its 1-hop neighbors. We
use machine learning method to adaptively select the appropriate
algorithm to estimate the relative local maps. Simulation results
show that MAP outperforms both the distributed MDS and the
centralized SDP algorithms. The improvement is better for networks
with less uniform node deployment."
}

@INPROCEEDINGS{Ahme0703:Iterative,
AUTHOR="Sohail Ahmed and Soon Xin Ng and Lie-Liang Yang and Lajos Hanzo",
TITLE="Iterative Decoding and Soft Interference Cancellation in Fast Frequency
Hopping Multiuser Systems Employing Clipped Combining",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="Iterative decoding (ID) aided fast frequency hopping (FFH), $M$-ary
frequency shift keying (MFSK) using clipped combining in multiple
access (MA) channels is investigated.  All users' data are
convolutionally encoded and then the encoded bits are interleaved and
converted to $M$-ary symbols, which are transmitted using FFH-MFSK
modulation. The soft metrics to be passed from the demodulator to the
decoder are derived assuming a Rayleigh fading channel. We also
propose a novel multiuser detection (MUD) scheme which employs joint
soft decoding as well as successive interference cancellation (SIC),
the receiver exploiting the soft information fed back by the decoder
to the demodulator in order to cancel the interference imposed by
reliable symbols. Our simulation results show that the proposed scheme
is capable of combatting multiuser interference and outperforms the
conventional ID by about 3dB."
}

@INPROCEEDINGS{Ahme0703:RF2ID,
AUTHOR="Nova Ahmed and Rajnish Kumar and Umakishore Ramachandran and Robert French",
TITLE="{RF2ID:} A Reliable Middleware Framework for {RFID} Deployment",
BOOKTITLE="21st IEEE International Parallel \& Distributed Processing Symposium",
ADDRESS="Long Beach, California, USA",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="The reliability of RFID systems depends on a number of factors including:
RF interference, deployment environment, configuration of the readers, and
placement of readers and tags.  While RFID technology is improving rapidly,
a reliable deployment of this technology is still a significant challenge
impeding wide-spread adoption. This paper investigates system software
solutions for achieving a highly reliable deployment that mitigates all
sources of inherent unreliability in RFID technology. We have developed (1)
a virtual reader abstraction to improve the potentially error-prone nature
of data produced by the physical readers and antennas; and (2) a novel path
abstraction to capture the logical flow of information among virtual
readers as RFID-tagged objects move throughout the environment.  Utilizing
these abstractions, we have designed and implemented an RFID middleware,
RF2ID, to organize and support queries over data streams in an efficient
manner. Prototype implementation using both RFID readers and simulated
readers using an empirical model of RFID readers show that RF2ID is able to
provide high reliability and support path-based object detection."
}

@INPROCEEDINGS{Ahme0704:Direct,
AUTHOR="Sajid Ahmed and Muhammad Amin and Vincent Fusco and Tharmalingam Ratnarajah",
TITLE="Direct {BPSK} Demodulation by Polarization Rotation in the Presence of
Channel Noise",
BOOKTITLE="LAPC - Loughborough Antennas \& Propagation Conference",
ADDRESS="Burleigh Court Conference Centre, Loughborough University, United Kingdom",
DAYS=2,
MONTH=apr,
YEAR=2007,
ABSTRACT="In this paper, we study the bit-error-rate (BER) performance of a
novel method of signal detection whereby the signal is modulated by
polarization rotation. The method combines two oppositely sensed
circularly polarized signals to generate a linearly polarized wave
with a spatial tilt angle determined by the phase difference between
the two circularly polarized signals. The transmitted linearly
polarized wave passes through a flat faded channel where it can be
further tilted through an angle $\theta\_{ch}$ before it is detected
by a crossed dipole at the receiver. We also develop an algorithm to
estimate the tilt angle distortion to the linearly polarized signal
introduced by the channel. Simulation results show BER performance
of the proposed scheme for both cases when the distortion in the
tilt angle by the channel is $(i)$ accounted for, and, $(ii)$ not
accounted for at the receiver."
}

@INPROCEEDINGS{Ahme0705:Multivariate,
AUTHOR="Tarem Ahmed and Mark Coates and Anukool Lakhina",
TITLE="Multivariate Online Anomaly Detection Using Kernel Recursive Least Squares",
BOOKTITLE="IEEE INFOCOM 2007",
ADDRESS="Anchorage, Alaska, USA",
DAYS=6,
MONTH=may,
YEAR=2007,
ABSTRACT="High-speed backbones are continually affected by network anomalies
  generated by a wide range of sources, from malicious
  denial-of-service attacks and viruses to harmless large data
  transfers and accidental equipment failures. Different types of
  anomaly affect the network in different ways, and it is difficult to
  know \emph{a priori} how a potential anomaly will exhibit itself in
  traffic statistics. In this paper we describe an online, sequential,
  anomaly detection algorithm, suitable for use with multivariate
  data.  The proposed algorithm is based on the kernel version of the
  celebrated recursive least squares algorithm. It assumes no model
  for network traffic or anomalies, and constructs and adapts a
  dictionary of features that approximately spans the subspace of
  normal network behaviour. The algorithm raises an alarm immediately
  upon encountering a deviation from the norm. Through comparison with
  existing block-based off-line methods based upon Principal Component
  Analysis, we demonstrate that our online algorithm is equally
  effective but has much faster time-to-detection and lower
  computational complexity."
}

@INPROCEEDINGS{Ahme0706:Energy,
AUTHOR="Irfan Ahmed and Saad Munir and Jian Ma",
TITLE="Energy Efficient Cluster {ID} based Routing in Wireless Sensor Networks
{–} Analysis in Nakagami-m fading Channel Model",
BOOKTITLE="The 8th IEEE Symposium on a World of Wireless, Mobile and Multimedia
Networks (WoWMoM 2007)",
ADDRESS="Helsinki, Finland",
DAYS=18,
MONTH=jun,
YEAR=2007,
ABSTRACT="This paper presents a energy analysis of a new routing protocol CIDRSN
(Cluster ID based Routing in Sensor Networks) with closed form probability
of error and bit energy expression. CIDRSN takes the cluster ID as next hop
address instead of cluster-head ID in routing table and eliminate the
cluster formation phase and routing phase from being executed in each
round. Both cluster formation and routing phases are only executed during
the initialization of network, which reduces the energy consumption and
increases the network life to about 20\%. Robustness is increased by
multi-path routing. Simulation results show that CIDRSN outperforms the
preceding hierarchical routing protocols."
}

@INPROCEEDINGS{Ahme0707:Robust,
AUTHOR="Fawad Ahmed and Mohammed Yakoob Siyal",
TITLE="A Robust and Secure Signature Scheme for Video Authentication",
BOOKTITLE="ICME'07 - Multimedia Assurance Track",
ADDRESS="Beijing, P.R. China",
DAYS=2,
MONTH=jul,
YEAR=2007,
ABSTRACT="In this paper, we present a hash-based technique for video authentication.
Designing a good hashing technique for multimedia requires many issues to
be considered such as robustness, security and tamper detection with
precise localization. The work that we describe in this paper is a step
ahead in this direction that attempts to address these issues in a unified
framework. The hash of the video is generated using the features extracted
in the DCT domain. These features are then quantized such that the
quantized features remain same for a bounded distortion. To enforce
security, pixels of the luminance plane are directly modulated using a
secret key. We present experimental results to demonstrate the robustness,
fragility and security of our proposed scheme."
}

@INPROCEEDINGS{Ahme0709:Improving,
AUTHOR="Dewan Ahmed and Shervin Shirmohammadi and Jauvane Oliveira",
TITLE="Improving Gaming Experience in Zonal {MMOGs}",
BOOKTITLE="ACM Multimedia 2007 Short Papers-ApplicationsTrack",
ADDRESS="Augsburg, Germany",
DAYS=23,
MONTH=sep,
YEAR=2007,
KEYWORDS="MMOG; P2P group communication; area of interest management",
ABSTRACT="Synchronous communication is a primary concern for multi-user virtual
environments like Massively Multiplayer Online Games (MMOGs). Most of the
MMOGs offer discrete view for the avatars and follow logical zone layout
for easy state management. The avatar movement, from one logical zone to
another, causes reorganization at the P2P overlay structure. Its recurrent
nature along with unintelligent zone crossing approaches eventually hampers
synchronous communication. In this paper, we present performance
enhancement mechanisms to reduce P2P overlay reorganization penalties based
on avatars’ physical characteristics. Avatars’ unpredictable movement
around the zone boundaries also incur repeated connections and
disconnections either among the zone masters or among the multiple peers in
the overlay networks. Interest driven zone crossing, dynamic shared region
between adjacent zones, and clustering of the entities based on their
attributes significantly alleviates these problems and also provides
continuous view and seamless region crossing to players. The technical
contribution of this paper is to present the effectiveness of object
clustering mechanism and interest driven zone crossing with dynamic shared
region between each adjacent zones to enhance the gaming experience of MMOG
players or users of other types of networked virtual environments (VE)."
}

@INPROCEEDINGS{Ahme0709:Interference,
AUTHOR="Nabeel Ahmed and Suman Banerjee and Srinivasan Keshav and Arunesh Mishra
and Konstantina Papagiannaki and Vivek Shrivastava",
TITLE="Interference Mitigation in Wireless {LANs} using Speculative Scheduling",
BOOKTITLE="13th Annual International Conference on Mobile Computing and Networking",
ADDRESS="Montreal, Canada",
DAYS=10,
MONTH=sep,
YEAR=2007,
ABSTRACT="In the past few years, there have been an increasing number of
research ideas and industry attempts to maximize performance of
802.11-base enterprise wireless LANs through careful centralization.
In the control plane this includes centralized allocation of
channels and power levels, and in the data plane this even involves
time slotted architecture with centralized scheduling of traffic.
While centralization of some control plane tasks have been shown to
be feasible, centralization mechanisms on the data plane are
significantly harder to realize. To our knowledge, no prior research
proposal has implemented a real system with a centralized data plane
that handles  observed latency and jitter on control paths, asynchronous
behavior of clients, automatic selection of link rates, external sources
of
interference that may interfere with schedules, variable
transmission rates of different nodes, and arbitrary packet losses.
Without taking these into account, a centralized data plane
structures, no matter how sophisticated, is not likely to be
practical. In this paper, we present a comprehensive study of
various problems that arise in the implementation of a centralized
scheduler, drawing upon our experience with  Access Points (APs)
equipped with the Intel 2200 ABG wireless NIC. We present pragmatic
solutions to these problems and use these to motivate the design of
a new architecture for designing 802.11 based enterprise Wireless
LANs (WLANs) constructed through a dense deployment of low cost APs.
Our proposed architecture, called a Wireless Grid (or WiG), is
designed to provide significantly improved spatial re- use and
interference mitigation through centralized scheduling, that
eventually leads to higher throughputs for all clients. Through our
detailed experimentation on a large 40 node testbed, we demonstrate
that a well constructed centralized scheduling system provides a
very efficient design for an enterprise WLAN. We conclude this work
with a discussion of many other advantages of the WiG architecture,
including low-latency handoffs and improved capability for
performance debugging and intrusion detection within the enterprise
WLAN."
}

@INPROCEEDINGS{Ahme0710:Cluster,
AUTHOR="Shabbir Ahmed and Salil Kanhere",
TITLE="Cluster-based Forwarding in Delay Tolerant Public Transport Networks",
BOOKTITLE="The First IEEE LCN Workshop On User MObility and VEhicular Networks
(ON-MOVE)",
ADDRESS="Dublin, Ireland",
DAYS=15,
MONTH=oct,
YEAR=2007,
ABSTRACT="Packet forwarding in Public Transport Networks is particularly challenging
due to the high mobility, rapidly changing topology and intermittent
connectivity observed in these networks. Though clustering of nodes can aid
forwarding decision in these Delay Tolerant Networks (DTNs), the clustering
process is extremely costly in a large network. In this paper, we introduce
a generic efficient clustering method which is suitable for grouping the
nodes of large networks. We also demonstrated how encounter frequencies of
public transport networks can be fed to that clustering algorithm in order
to build clusters of nodes. And finally, our large scale extensive
simulation study on real bus traces shows the efficacy of clustering in
packet forwarding."
}

@INPROCEEDINGS{Ahme0710:Time,
AUTHOR="Zakir Ahmed and Vijaya Yajnanarayana and Nirmal Sancheti",
TITLE="A Time Domain Based Efficient Block Decision Algorithm for Audio Coders",
BOOKTITLE="7th International Symposium on Communications and Information Technologies",
ADDRESS="Sydney, Australia",
DAYS=16,
MONTH=oct,
YEAR=2007,
ABSTRACT="In typical audio coders the block decision is done either using time-domain
techniques like energy computation  or frequency domain techniques like
Temporal Noise Shaping (TNS) [1], [2]. The time-domain energy computation
based decisions are less effective for detecting many of the stringent
scenarios presented by test cases like castanets and fatboy. The frequency
domain based algorithms have better decision making capabilities, however
they are  inherently complex as they require the computation of the FFT,
additionally in case of TNS the computation of LPC (Linear Prediction
coding) in the frequency domain. An improved time-domain technique with
better block decision capability compared to TNS and with lesser
computational complexity is proposed in this paper."
}

@INPROCEEDINGS{Ahme0711:Blind,
AUTHOR="Djebbar {Ahmed Bouzidi} and Karim Abed-Meraim and Djebbari Ali",
TITLE="Blind Cannel Equalization and Carrier Frequency Offset Estimation For
{MC-CDMA} Systems Using Guard Interval Redundancy and Excess Codes",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="456-459",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="MC-CDMA, equalization, CFO, GEV, linesearch technique",
ABSTRACT="It is well known that multipath channel and carrier frequency offset
destroy the orthogonality between subcarriers in the downlink of
MC-CDMA and degrade the system performance. A good equalizer and CFO
estimators are acquired to improve the overall system performance.
In this paper, a new low complexity algorithm is proposed to
iteratively estimate the carrier frequency offset (CFO) and the
channel equalizer using only the guard interval (GI) redundancy, or
excess codes (EC) or both (GI) and (EC) without additional pilots.
After estimation of the CFO, we compensate it before applying a
novel equalization. Simulations illustrate and compare the
performance efficiency of these schemes in different scenarios."
}

@ARTICLE{Ahme0711:Holes,
AUTHOR="Nadeem Ahmed and Salil Kanhere and Sanjay Jha",
TITLE="The Holes Problem in Wireless Sensor Networks: A Survey",
JOURNAL="Mobile Computing and Communications Review",
DAYS=28,
MONTH=nov,
YEAR=2007,
ABSTRACT="Several anomalies can occur in wireless sensor networks that impair their
desired functionalities i.e. sensing and communication. Different kinds of
holes can form in such networks creating geographically correlated problem
areas such as coverage holes, routing holes, jamming holes, sink/black
holes and worm holes, etc. We detail in this paper different types of
holes, discuss their characteristics and study their effects on successful
working of a sensor network. We present state-of-the-art in research for
addressing the holes related problems in wireless sensor networks and
discuss the relative strengths and short-comings of the proposed solutions
for combating different kinds of holes. We conclude by highlighting future
research directions."
}

@INPROCEEDINGS{Ahme0711:Semi,
AUTHOR="Djebbar {Ahmed Bouzidi} and Karim Abed-Meraim and Djebbari Ali",
TITLE="{Semi-Blind} Equalization of Downlink {MC-CDMA} System",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="460-463",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="MC-CDMA, ISI, semi-blind, equalization, adaptive algorithm.",
ABSTRACT="It is known that multicarrier code division multiple access
(MC-CDMA) systems suffer from intersymbol interference (ISI) and
intercarrier interference (ICI). In this paper, we introduce new
semi-blind time domain equalization (TEQ) techniques for downlink
MC-CDMA systems. This equalization exploits the guard interval
redundancy (GI) together with the information given by a pilot
sequence in one hand and the spreading code matrix in other hand. We
propose in a second contribution an adaptive algorithm for the
estimation and tracking of the equalizer that has a faster
convergence rate. Extensive performance evaluation are given at the
end of this paper to assess the effectiveness of the proposed
methods in MC-CDMA."
}

@INPROCEEDINGS{Ahme0711:State,
AUTHOR="Dewan Ahmed and Shervin Shirmohammadi and Jauvane Oliveira",
TITLE="State Management in Large Scale Group Communication",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1259-1262",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Dominating set; group management; heuristic; overlay; state management",
ABSTRACT="Current state management practices heavily rely on centralized
architectures that pose scalability bottleneck and are expensive to adopt
and deploy. In this paper, large scale state management issues are
considered and addressed from design perspectives. The intra zonal
communication strategies presented in [18][19] assume that peer knows its
position in the global coordinate system. In this work, we drop that
assumption and approximate peer position through the relative end-to-end
delay with respect to landmarks. The technical analysis presented in [20]
shows that the protocol has higher diameter in terms of hop distance
compared to NICE [17], although it has lower diameter in terms of
end-to-end delay among the peers. To address that problem we present
multiphase mesh construction technique that requires further partitioning
of each region into several sub-regions. Both server-side and client-side
resources are effectively utilized in collaborative manner while respecting
their roles in the system."
}

@INPROCEEDINGS{Ahme0712:Best,
AUTHOR="Javed Ahmed and Muhammad Jafri",
TITLE="{Best-Match} Rectangle Adjustment Algorithm for Persistent and Precise
Correlation Tracking",
BOOKTITLE="International Conference on Machine Vision 2007",
ADDRESS="Islamabad, Pakistan",
DAYS=28,
MONTH=dec,
YEAR=2007,
ABSTRACT="Correlation tracking is performed by matching a template of the object with
every candidate region in a search window and locating the best-match
region. The template is initialized with the target manually, when it
appears in the video. The human operator is usually unable to extract a
good template of the target within a limited time period, while the target
is moving and manoeuvring in the streaming video. Thus, the extracted
template is usually larger or smaller than the object, or the object is
deviated from its centre. Furthermore, if the object is manoeuvring in the
video during a tracking session, it drifts away from the center of the
template with time even when the template was initialized correctly. The
incorrect template initialization and the template-drift severely
deteriorate the performance of a correlation tracker. We solve the two
problems by analyzing the temporally smoothed edge-enhanced template and
resizing/relocating the best-match rectangle (BMR) so that the object can
remain exactly at its centre. The adjusted BMR is then exploited to
generate a good template for the next frame to have a persistent and
precise tracking session. We present the real-world results that prove the
efficacy of the proposed algorithm."
}

@INPROCEEDINGS{Ahn0000:Low,
AUTHOR="Joon Tae Ahn and Hong-Seok Seo and Bong Je Park",
TITLE="Low Noise Fiber Raman Amplifiers using a Raman Ring Fiber Oscillator",
BOOKTITLE="ECOC 2007 - 33rd European Conference and Exhibition on Optical
Communication",
ADDRESS="Berlin, International Congress Center (ICC), Germany, Germany",
DAYS=16,
MONTH=sep,
YEAR=2007,
KEYWORDS="optical fiber amplifier; fiber Raman amplifier; discrete Raman amplifier;
Raman fiber oscillator; optical communication",
ABSTRACT="We propose two fiber Raman amplifier schemes based on Raman ring fiber
oscillator to reduce double Rayleigh scattering noise at high gains and
successfully demonstrate their low noise characteristics by measuring
bit-error-rate data at 10Gb/s."
}

@INPROCEEDINGS{Ahn0703:Link,
AUTHOR="Chang-Jun Ahn",
TITLE="Link Correlation based Transmit Sector Antenna Selection for Alamouti Coded
{OFDM}",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="In MIMO systems, the deployment of multiple antenna technique can
considerably enhance the system performance. However, this is considering
without a price. Since cost of RF is much higher than the antennas, there
is growing interest in techniques that use larger number of antennas than
the number of transmitter RF. These methods rely on selecting the optimal
transmitter antennas and connecting them to respective RF. In this case,
the feedback information (FBI) is required to select the optimal
transmitter antennas. However, transmission of the FBI through a feedback
channel is limited. Moreover, multiple antennas system requires an antenna
separation of 5-10 wavelength to keep the correlation coefficient below 0.7
for achieving the diversity gain. In this case, base station is required a
wide space to set the multiple antenna. To reduce these problems, in this
paper, we propose the link correlation based transmit sector antenna
selection for Alamouti coded OFDM without FBI."
}

@INPROCEEDINGS{Ahn0705:Hybrid,
AUTHOR="Seok-Ki Ahn and Seho Myung and Kyeong Cheol Yang",
TITLE="Hybrid {ARQ} for {LDPC-Coded} Systems",
BOOKTITLE="The 17th Joint Conference on Communication \& Information, 2007",
ADDRESS="Phoenix Park, Gangwon, Korea",
DAYS=2,
MONTH=may,
YEAR=2007,
KEYWORDS="Hybrid ARQ; incremental redundancy; low-density parity-check codes;",
ABSTRACT="In this paper, we propose an LDPC-coded hybrid ARQ scheme consisted of
incremental redundancy and retransmission of a part of the packets
transmitted and present a simple criterion for choosing between two methods
to support a desired throughput efficiently. Furthermore, we show that it
is possible to improve the throughput performance when employing multi-edge
type LDPC codes with the structure of Raptor codes."
}

@INPROCEEDINGS{Ahn0707:Enabling,
AUTHOR="Gail-Joon Ahn",
TITLE="Enabling {Role-Based} Delegation and Revocation on {Security-Enhanced}
Linux",
BOOKTITLE="12th IEEE Symposium on Computers and Communications",
ADDRESS="Aveiro, Portugal",
DAYS=1,
MONTH=jul,
YEAR=2007,
ABSTRACT="An increasing number of attacks experienced in
existing enterprise networks and applications created a huge
demand for operating system security mechanisms. As a consequence,
Security-Enhanced Linux (SELinux) has been proposed
by NSA and is being adopted by the industry at a fast rate.
More and more enterprises are planning to move their business
operations to such a secure computing environment, requiring
the features of delegation and revocation. In this paper we seek
to address the issue of how to leverage a role-based delegation in
SELinux while minimizing the modification of SELinux system
modules. Our approach is to utilize the flexible policy system
used in SELinux that allows for custom rules to be defined to
provide other access control requirements. We also demonstrate
the feasibility of our framework through a proof-of-concept
implementation."
}

@INPROCEEDINGS{Ahn0708:IEEE,
AUTHOR="Sanghyun Ahn and Yujin Lim and Jae-Hwoon Lee and Sangkeun Yoo and Hyoung
Jun Kim",
TITLE="{IEEE} {802.15.4} {기반의} {이기종} {무선} {센서}
{네트워크와} {IPv4} {기반} {외부} {망과의} {연동} {구조}",
BOOKTITLE="Summer Workshop on Computer Communications, 2007",
ADDRESS="Ramada Plaza Hotel, Jeju, Korea, Korea",
DAYS=23,
MONTH=aug,
YEAR=2007,
ABSTRACT="무선 센서 네트워크는 최말단의 독립망으로서 보다는 IP
기반의 유무선 LAN/MAN 등과 연결되어 BcN의 일부로서
동작하게 될 가능성이 높다. 지금까지의 무선 센서
네트워크 관련 연구에서는 센서 네트워크를 외부 망과
연동하는 방안에 대해서는 수행하지 않았으며, 따라서
본 논문에서는 ZigBee, 6LowPAN, TinyOS와 같은 IEEE 802.15.4
기반의 센서 네트워크들을 IPv4 기반의 외부 망과
연동하기 위한 네트워크 구조 및 연동 시나리오, 연동을
위한 필수 구성 요소인 게이트웨이의 기능 구조에
대해서 정의한다. 연동을 위한 게이트웨이 기능들은
HSNAL(Hybrid Sensor Network Adaptation Layer)에 포함되며, 기능
엔티티(Functional Entity)의 형태로 분류되어 정의되었다."
}

@INPROCEEDINGS{Ahn0708:무선,
AUTHOR="Sanghyun Ahn and Yujin Lim",
TITLE="{무선} {센서} {네트워크를} {위한} {플러딩} {오버레이}
{구조}",
BOOKTITLE="Summer Workshop on Computer Communications, 2007",
ADDRESS="Ramada Plaza Hotel, Jeju, Korea, Korea",
DAYS=23,
MONTH=aug,
YEAR=2007,
ABSTRACT="센서 네트워크에서 질의나 이벤트 데이터를 전송하는데
있어서 대부분 플러딩을 기반으로 동작한다.
블라인드(blind) 플러딩은 폭주(implosion) 문제와
겹침(overlap) 문제를 야기하며, 이로 인해 자원이 부족한
센서 네트워크의 수명이 감소되게 된다. 따라서 본
논문에서는 플러딩 오버헤드를 줄이기 위해 오버레이
네트워크 개념을 채택한 플러딩 오버레이 구조(Flooding
Overlay Structure; FOS)를 제안하며, 중앙형 FOS(Centralized FOS;
CFOS)와 분산형 FOS(Distributed FOS; DFOS) 두 종류의 FOS 방법을
제안한다. CFOS는 정적인 센서 네트워크에서 싱크가
포워딩 노드를 효과적으로 선택할 수 있도록 해주는
방법이며, DFOS는 동적인 센서 네트워크에 적합한
방식으로 센서 노드 각자가 브로드캐스트 패킷의 포워딩
참여 여부를 결정하는 방법이다. 제안한 FOS 기법들과
블라인드 플러딩에 대한 NS-2 기반의 시뮬레이션을
수행함으로써, 제안한 FOS 기법들이 여러 가지 성능
측면에서 블라인드 플러딩 보다 우월함을 보였다."
}

@INPROCEEDINGS{Aho0703:System,
AUTHOR="Kari Aho and Janne Kurjenniemi and Ville Haikola and Tapani Ristaniemi",
TITLE="System Level Performance of Multimedia Broadcast Multicast Services
{(MBMS)} with Macro Diversity",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Networking",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="The aim of this paper is to evaluate the system level performance of
Multimedia Broadcast Multicast Service (MBMS) in WCDMA networks. To enhance
coverage and data rates, especially at the cell borders, two macro
diversity concepts were
introduced in 3GPP release 6: soft and selective combining. Prior work on
the evaluation of MBMS with macro-diversity schemes has been restricted to
link-level studies or to very limited scenariors in system-level studies.
This paper examines the concepts in more detail with dynamic system-level
tool in which e.g. mobility of users and interactions of the radio resource
management functionalities are explicitly taken into account. The
evaluation of combining set size, data rates, thresholds and delays in the
combining procedures are especially emphasized. Considering
point-to-multipoint (p-t-m) mode of MBMS, the
studies indicated clear performance improvements to be gained with macro
diversity. In addition, the impact of delays in combining update was
observed to be rather small."
}

@INPROCEEDINGS{Ahre0702:Decentralized,
AUTHOR="Andreas Ahrens and Xinning Wei and Tobias Weber and Shiyang Deng",
TITLE="A novel decentralized {MIMO-OFDM} uplink detection scheme",
BOOKTITLE="International ITG - IEEE Workshop on Smart Antennas 2007",
ADDRESS="Wien, Austria",
DAYS=26,
MONTH=feb,
YEAR=2007,
ABSTRACT="Decentralised interference cancellation in multiuser MIMO-OFDM
systems can be considered as a promising approach in next
generation wireless systems. Considering the entirety of the
antennas of all mobile terminals at one end and the antennas of
the access points (APs) at the other end of the communication
link, state of the art interference cancellation is based on a
central unit (CU) where joint detection can be applied in the
uplink (UL) and joint transmission in the downlink (DL),
respectively. Unfortunately such setups require cost-intensive
optical fibers or point-to-point radio links in order to deliver
all the required information to the CU. Therefore decentralised,
cost-efficient solutions, which by-pass the CU, are of common
interest. In this contribution a novel decentralised uplink
detection scheme for multipoint-to-multipoint OFDM systems is
presented and evaluated under real channel conditions."
}

@INPROCEEDINGS{Ahre0706:Optimal,
AUTHOR="Andreas Ahrens and Christoph Lange and Volker Kuehn and Tobias Weber",
TITLE="Optimal Power Allocation in {SVD} Equalized Multicarrier Systems",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Multicarrier transmission is an established technique for radio
transmission systems and it can be considered as a promising
approach for next generation wireless systems. In channel situations with
high delay-spreads, OFDM requires large
guard interval lengths which decrease the spectral efficiency
significantly. Therefore, alternative multicarrier transmission
systems are of great practical interest, which guarantee a
reliable transmission without a guard interval. In multicarrier systems the
subcarriers are weighted in a quite
different way by the frequency selective channel, based on the
inherent structure of the multicarrier transmission system. If the
transmitter knows the channel, the subchannel's transmission
parameters such as transmit power or modulation alphabets can be
adapted. In this contribution, transmit power allocation schemes for BER
performance improvements in a wavelet-based multicarrier
transmission system with SVD equalization (Singular Value
Decomposition) are investigated under the constraints of a limited
total transmit power and a given data rate. Thereby the differences between
the optimal but highly complex solution and suboptimal but
complexity-reduced solutions are analyzed. Numerical results are obtained
by simulations assuming different time-variant channel characteristics,
with delays larger than the
multicarrier symbol duration."
}

@INPROCEEDINGS{Ahuj0708:Enhancing,
AUTHOR="Sandeep Ahuja and Srinivasan Ramasubramanian",
TITLE="Enhancing Robustness Under {Dual-Link} Failures",
BOOKTITLE="ICCCN'07 Optical networking Track",
ADDRESS="Honolulu, Hawaii, USA",
DAYS=13,
MONTH=aug,
YEAR=2007,
ABSTRACT="We show in this paper, that minimizing the product of path lengths results
in enhancing the robustness by minimizing the probability of connection
failure between a source and a destination given two links have failed in
the network independently in an arbitrary order. We consider the problem of
finding disjoint 
paths between two nodes with the minimum path length product. 
We formulate the problem as an Mixed Integer Quadratic Programming (MIQP).
We develop an iterative heuristic based on k-shortest path approach. We
demonstrate by extensive simulations that only a few iterations are
sufficient to obtain paths whose path length product is comparable to that
of optimal obtained by solv- 
ing the MIQP."
}

@INPROCEEDINGS{Ahum0710:Measured,
AUTHOR="Luciano Ahumada and Rodolfo Feick and Reinaldo Valenzuela and Cesar
Hermosilla",
TITLE="Measured Improvement of Indoor Coverage for Fixed Wireless Loops with
Multiple Antenna Receivers",
BOOKTITLE="7th International Symposium on Communications and Information Technologies",
ADDRESS="Sydney, Australia",
DAYS=16,
MONTH=oct,
YEAR=2007,
ABSTRACT="We present measured gains of spatial and angular diversity receivers for
fixed narrowband wireless links at 2.4GHz, in scenarios where indoor
service is provided from an outdoor base station. We tested the performance
of maximal ratio (MRC), equal gain (EGC) and selection (SC)
combiners, and compared them to angular selection diversity using directive
antennas. Spatial fading statistics were found to be adequately
described by means of Rayleigh distributions. Our empirical results show
that a MRC will result in around 10dB of diversity gain when 90\% of
the target coverage area must be served. The benefits of using a properly
aimed directive antenna or equivalently a steered array of closely
spaced antennas, was found to be within 1dB of that of a MRC, with the
advantage of requiring a smaller size array."
}

@INPROCEEDINGS{Ai0706:DRACo,
AUTHOR="Xin Ai and Vikram Srinivasan and Chen Khong Tham",
TITLE="{DRACo:} Distributed, Robust, Asynchronous Coverage in Wireless Sensor
Networks",
BOOKTITLE="Fourth Annual IEEE Communications Society Conference on Sensor, Mesh, and
Ad Hoc Communications and Networks",
ADDRESS="San Diego, CA, USA, USA",
DAYS=18,
MONTH=jun,
YEAR=2007
}

@INPROCEEDINGS{Aida0711:Control,
AUTHOR="Masaki Aida and Chisa Takano and Masayuki Murata and Makoto Imase",
TITLE="Control Plane Stability with Retrial Traffic and Comparison of Hard- and
{Soft-State} Protocols",
BOOKTITLE="IEEE Globecom 2007 Performance Modeling, QoS and Reliability Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="It has been recognized that in the current Internet it is important to
control 
not only congestion caused by overload of the data plane but also
congestion 
caused by overload of the control plane. 
In particular, it is important to avoid congestion from retrial traffic. 
In general, users reattempt to set up connections not only when
transmission 
systems are overloaded but also when processing systems in the network are
overloaded. 
The latter is caused by user psychology: an increase in the waiting time
for 
the processing to be completed tends to increase his or her reattempts. 
Thus, it is important to manage both transmission and processing resources
properly. 
In this paper, we introduce a model that takes account of both transmission
and 
processing systems, and we examine the behavior of retrial traffic. In
addition, 
we compare the system stability achieved by two different resource
management 
methods, the hard-state method and the soft-state method."
}

@INPROCEEDINGS{Aiel0000:Ultra,
AUTHOR="Roberto Aiello",
TITLE="{Ultra-High} Performance {Ultra-Wideband} Systems",
BOOKTITLE="International Conference on Ultra-Wideband 2007",
ADDRESS="Marina Mandarin Singapore, Singapore",
DAYS=24,
MONTH=sep,
YEAR=2007
}

@INPROCEEDINGS{Aiel0709:Fast,
AUTHOR="Marco Aiello and Andreozzi Francesco and Ezio Catanzariti and Francesco
Isgro and Matteo Santoro",
TITLE="Fast convergence for spectral clustering",
BOOKTITLE="International Conference on Image Analysis and Processing 2007",
ADDRESS="Modena, Italy",
DAYS=10,
MONTH=sep,
YEAR=2007,
ABSTRACT="Over the last years computer vision researchers have shown great
interest for the so called spectral clustering, where the data are
clustered analysing the first few eigenvectors (i.e., the ones
relative to the first eigenvalues) of a the Laplacian matrix, derived
directly from the data-set. Note that for the purpose of data
clustering the eigenvectors need not to be determined accurately.
When clustering (segmenting) images the
dimension of this matrix is large (e.g., an image as small as $100
\times 100$ results in a  $10000 \times 10000$ matrix), and standard
diagonalisation algorithms such Lanczos, necessary for determining the
eigenvectors, do require a certain number of iterations: typically in
the order of $\sqrt{n}$ step for $n \times n$ matrices, and may take
some iterations for getting close to the solutions. Here we report
the first attempt  using a recent diagonalisation algorithm (named
APL) borrowed 
from the nuclear physics literature, that, among other properties, has
the main advantage of obtaining in a small number of iteration steps
eigenvectors, that even if not accurate, are good enough for
performing a reasonable segmentation. In this sense we talk of fast
convergence of spectral clustering. 
The experimental results obtained support this claim, 
and open the way to further work exploiting further detail of the
algorithm not included in this study."
}

@INPROCEEDINGS{Ains0705:Initial,
AUTHOR="Alex Ainslie and Jennifer Thom-Santelli and Geri Gay",
TITLE="An Initial Exploration of Bluejackers’ Perceptions of Success",
BOOKTITLE="Pervasive 2007 Late Breaking Results and Posters",
ADDRESS="Toronto, Ontario, Canada",
DAYS=13,
MONTH=may,
YEAR=2007,
ABSTRACT="We present an initial exploration of bluejacking, the practice of
appropriating the contact exchange utility of mobile phones to send
unsolicited messages to collocated mobile devices using Bluetooth.  A
content analysis was conducted on 427 bluejacks from Bluejackq, an online
bluejacking community, to uncover the motivations of bluejackers. Results
suggest that location has a large impact on the both the frequency and the
content of messages sent. We then propose a classification of
bluejackers’  perceptions of success."
}

@INPROCEEDINGS{Aite0703:Softwareentwicklung,
AUTHOR="Erwin Aitenbichler and Max {Mühlhäuser}",
TITLE="Softwareentwicklung für Mundo Smart Environments",
BOOKTITLE="KiVS'07 Workshop 'Service-Oriented Architectures und Service-Oriented
Computing' (SOA/SOC)",
ADDRESS="Bern, Switzerland",
DAYS=1,
MONTH=mar,
YEAR=2007,
ABSTRACT="Das Mundo-Projekt an unserer Arbeitsgruppe befasst sich mit allgemeinen
Modellen und Architekturen für Ubiquitous Computing (UC)-Systeme. Dieser
Beitrag beschäftigt sich mit der systematisierten Entwicklung von
Anwendungen für Smart Environments. Dazu wurde im Mundo-Projekt eine Reihe
von Diensten und Werkzeugen entwickelt. Es werden Werkzeuge zur
Überwachung, Fehlersuche, Durchführung verteilter Tests, und zum Rapid
Prototyping beschrieben und wie diese in den Software-Entwicklungsprozess
eingebettet sind. Damit wird es möglich, Anwendungen für Smart
Environments systematisiert zu entwickeln."
}

@INPROCEEDINGS{AitI0702:Performance,
AUTHOR="Tarik Ait-Idir and Samir Saoudi",
TITLE="On the Performance of {SIC-MMSE} Turbo Equalization with Iterative Channel
Estimation for {UCCI-Limited} {MIMO-ISI} Systems",
BOOKTITLE="International Symposium on Wireless Pervasive Computing 2007",
ADDRESS="San Juan, Puerto Rico",
DAYS=5,
MONTH=feb,
YEAR=2007,
ABSTRACT="This paper focuses on the problem of turbo equalization of MIMO frequency
selective fading channels under the presence of unknown co-channel
interference (UCCI). We develop an approach where paths' gains computation,
UCCI plus noise covariance matrix estimation, signals equalization and
detection, and channel decoding are performed in an iterative fashion. A
computationally efficient method based on a MMSE criterion and successive
interference cancellation (SIC) is used for channel equalization. The
proposed receiver is validated through Monte-Carlo simulations."
}

@INPROCEEDINGS{Aitk0000:ATSC,
AUTHOR="Mark Aitken",
TITLE="{ATSC-M/H,} A Backwards Compatible Mobile and Handheld Standard",
BOOKTITLE="SMPTE Technical Conference and Exhibition",
ADDRESS="Brooklyn, New York, USA",
DAYS=23,
MONTH=oct,
YEAR=2007,
ABSTRACT="US Broadcasters now have placed in front of them the real possibility to
reinvent the typical television broadcast paradigm with the development of
a fully compatible Mobile/Handheld augmentations of the ATSC digital
television (DTV) standard.  This presents some challenges to an industry
that has effectively operated with the same system planning criteria for
half of a century. Broadcaster capabilities and technologies must be
designed to fit these very different needs in an intensely dynamic mobile
and portable environment. This is a sharp departure from today’s 30 foot
fixed reception television model to an audience in fixed (home)
surroundings.

This activity has brought new industry segments and participants to the
ATSC Standardization process. The new challenges are being met with
enthusiasm, and the US broadcast industry is just beginning to see the new
challenges as opportunities to compete.

This paper will discuss the standardization process underway in the US, the
nature of proposals in response to the ATSC RFP for a Mobile and Handheld
standard, and progress towards a Q1, 2009 target date. The results identify
new attributes that may be “keys to the future success” of several new
business paradigms based on leveraging new technologies and standards,
including some under development, in a variety of industry segments
including the ATSC."
}

@INPROCEEDINGS{Aiva0712:Scalable,
AUTHOR="Efthimia Aivaloglou and Anelia Mitseva and Harry Skianis and Stefanos
Gritzalis and Adrian Waller and Neeli Prasad",
TITLE="Scalable Security Management for Wireless Sensor Networks for Medical
Scenarios",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="1014-1018",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="In the context of ambient intelligence systems, the role of sensor networks
is to capture diverse types of information related to individuals,
equipment, buildings, and make it available for the provision of
sophisticated, unobtrusive, context-aware applications and services. The
security and integrity of the data and the communications in the overall
architecture is an essential requirement for the end applications and
services to be reliable and well accepted by the end-user. 
This paper presents a generic context-aware security, privacy and trust
framework providing adaptability, flexibility and scalability which
supports the customisation of real-world wireless sensor networks to a
diverse set of application spaces. Suitable scalable mechanisms are
identified to form a complete toolbox solution which fits the architecture
of Beyond 3G environments. The wireless hospital enhanced professional
communication application space serves as an example scenario for the
proposed framework, where each security module is designed to adapt
accordingly based on the context information available in each
communication in the data flow.

A.Outline
This extended abstract presents an example of wireless sensor networks in a
medical application space scenario, and the security requirements that
provided the motivation towards the proposed security solution. It includes
a short description of the novel scalable security, trust and privacy
framework with context- and user-role awareness, and of its scalable and
adaptable components. The full paper provides a detailed architecture
description of the security framework, the privacy mechanisms, the trust
establishment process, and the mechanisms for providing flexibility,
scalability and context-awareness. It also includes a description of the
configuration required for the security framework, and analysis of its
adaptability and context-awareness properties with respect to the scenario
communication flows. A review of related work, evaluation of the proposed
framework with suitable measures, conclusions and further work complete the
full paper.

B.The Medical Scenario 
The selected scenario of the wireless hospital enhanced professional
communication application space is referred to as “The backup shift
assistant scenario”. Wireless sensor networks are used to gather and
communicate context information in order for a physician to be able to
contact the next experienced colleague available in the hospital or at home
if a severe patient condition comes up that he cannot deal with. Through
the Wireless Sensor Network (WSN) application, the experienced colleague is
informed both of the condition of the patient, and of the location and mood
(e.g. stress level) of the physician on duty.

C.Security Requirements
The security and integrity of the data and the communications are essential
requirements for applications and services like the one of the example to
be reliable, while the protection of the privacy of the end users is
essential for their adoption. The general objective of this work is to
define how lightweight security services will be provided within the
overall network architecture, in a way that effectively covers the security
needs of such WSN scenarios. The basic security issues that need to be
addressed are the confidentiality and integrity of the data collected.
Controlled data disclosure, means for authentication and access control
need to be provided. Trust relationships must be defined, established and
maintained to serve as the basis for decisions on cooperation and
communication of data. The proposed security framework covers the following
complete set of WSN security requirements:
- For the security services, existing protocols are identified based on
their suitability according to the specific requirements. 
- For the privacy services, the focus is on a context-aware mechanism for
controlled information disclosure, while for ensuring pseudonymity and
anonymity, existing solutions are evaluated. 
- For the trust establishment, a novel adaptive mechanism is proposed for
adoption.

D.Proposed Novel Scalable Security Framework
The application space that each sensor network application is designated
influences the services that are provided to the end users, the contexts
and types of information to be captured, and the types of sensor nodes that
are utilised. Any security solution for WSNs needs to deal with diversity
in:
- The types of information collected and its security requirements, such as
privacy protection, integrity and freshness.
- The types of sensor networks utilized, such as body, object and
environment sensor networks.
- The computational capabilities and roles of the nodes in the network,
ranging from simple sensor nodes to cluster heads and gateways to B3G
networks.
This diversity imposes the need for security, privacy and trust policies as
well as privacy and anonymity preserving mechanisms which intelligently
adapt to the context of each communication. Adaptability, Flexibility,
Scalability and Context-awareness is the basic set of properties of the
proposed security framework, namely:
- Flexibility and Scalability – the framework is designed to be
reconfigurable in order to provide the best suitable levels of security,
trust and privacy functionalities for different node architectures,
hardware limitations, user requirements, and application spaces.
Essentially, different versions of the framework can be deployed for the
network components, providing varying levels of security functionality.
- Adaptability – ensuring that the system works at the best of its
capability, taking into account the tradeoff among device constraints
(varying with time), change in context (e.g. service or location) and
different users’ preferences. Essentially, the security protocols and
primitives that are used for each communication after the network
deployment are selected according to the context of the communication.
In order to ensure scalability and flexibility, a toolbox approach is
undertaken. This enables selection and configuration of appropriate
elements according to the role of the sensor node and application
requirements. The basic component of the framework is a cross-layer
Security Manager, which is designed to be flexible regarding the modules
that it contains. The security framework and each constituent element is
designed to be context-aware, given that context information is made
available by other network services like Service Discovery, Node Discovery
and Location Positioning, along with information available at the
application layer. 
Rules and mechanisms are defined for the Security Manager and the Agents in
order to perform adaptive and context-aware management for the security and
privacy services and to use the appropriate security primitives for the
current context situation. 
- Flexibility and context-awareness is ensured for the Security Agent by
allowing different Security Levels, which determine the mechanisms and
protocols that are used to provide authentication, encryption, message
freshness and integrity. 
- The Privacy Agent applies the appropriate privacy safeguard mechanisms by
evaluating the current anonymity level, the maximum traceability for a
given distance and other related context data against the Privacy Policies.

- Decisions on the cooperation between network nodes are based on their
trust status, determined by the Trust Agent according to the network
pre-configuration, and the outcomes of the trust establishment procedure
that is defined as part of the framework.

E.Application of the Security Framework to the Medical Scenario
Overall, this work transparently defines how the properties of flexibility,
adaptability and context-awareness are satisfied both in the overall
architecture and in each component. An example scenario serves to
demonstrate how the proposed framework can uniformly support, via proper
configuration, simple nodes, cluster heads and gateways to B3G networks. It
is shown how the security manager and its modules can be configured for
each node in the scenario in order to optimally fit its security needs.
Moreover, it is described how each module –security, privacy and trust
agent - adapt according to the context information available in each
communication in the data flow.
Based on the example, an analysis of the context-related inputs that the
security components need to receive, how they make the decisions on the
primitives to be used, and what protocols are applied, is performed.
In WSNs, very diverse context information could be considered, on one hand
directly related to the end-user and helping him; on the other hand for the
applications; for the environment; and for the privacy mechanisms to work
properly. In order to address the scalability requirement, the influence of
the complexity of the context attributes in the work of the policy agent as
part of the trust establishment, is evaluated in terms of response time vs
number of context attributes. Response time vs number of applicable rules
and evaluation of the memory requirements for different sets of rules is
provided in the full paper, to serve as a guideline when designing scalable
versions of the privacy agent.

F.Summary and Conclusion 
In this extended abstract, we present a sketch of the integration of
security, trust and privacy measures into the scalable framework covering
context-awareness, trust establishment and controlled information
disclosure. Further we describe: 
- An original scalable context-aware security framework for WSNs as a tool
for a flexible solution for a diverse set of application requirements.
- The context-aware privacy protection solution and its evaluation for the
complexity of the context for the system performance.
- An original trust establishment mechanism that is integrated into the
framework.
- The application of the solution to a wireless hospital use case, to
demonstrate how the core properties of the framework are provided."
}

@INPROCEEDINGS{Ajba0708:Evaluating,
AUTHOR="Ikhlas Ajbar and Dmitri Perkins",
TITLE="Evaluating Mobile Ad Hoc Networks: A Performance Index and Statistical
Model",
BOOKTITLE="ICCCN'07 Wireless ad-hoc and sensor networks Track",
ADDRESS="Honolulu, Hawaii, USA",
DAYS=13,
MONTH=aug,
YEAR=2007,
ABSTRACT="This work is concerned with definining a performance index that
can be used as an objective measure in the evaluation and comparison of ad
hoc
networking protocols. Specifically, we introduce a performance index that
aggregates
performance results from multiple response metrics into a single scalar
value
that quantifies overall system performance, leading to more objective
evaluations
and comparisons. Using a statistical-based experimental design and analysis
strategy, we
illustrate the advantages of the proposed performance index by comparing
two ad hoc
networking systems over a wide range of networking scenarios. Based on the
results
of this analysis, we develop an empirical model that characterizes the
relationship between the proposed performance index, four response metrics
(packet
delivery ratio, end-to-end delay, routing overhead, and jitter) and four
influential factors (node mobility, offered load, network size, and routing
protocol)."
}

@INPROCEEDINGS{Ajoo0000:WiMAX,
AUTHOR="Wafik Ajoor",
TITLE="{WiMAX:} The Broadband Wireless Access Technology Tutorial",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="As 3G systems get deployed worldwide, the development of competitive
technologies that promise additional capabilities and services at more
attractive costs is also underway. WiMAX is a major contender in this
arena. WiMAX has become an attractive solution as a broadband wireless
access technology to the Internet everywhere in recent years. But what is
WiMAX? The aim of this tutorial is to provide a detailed introduction to
the WIMAX technology based on the IEEE802.16 family standard along with its
business planning and deployment. Having attended this tutorial, the
audience gains insights into the WiMAX technology, its capabilities,
strengths, and limitations, future trends, and one would be able to
evaluate what such technology can do and what it cannot. The tutorial
outline is as follows:
(1) Introduction to WiMAX
(2) WiMAX Regulatory, World-Wide Spectrum Allocations, and Standardization
(3) WiMAX PHY Layer
(4) WiMAX MAC Layer
(5) WiMAX Enhanced Modes of Operation and Future Trends
(6) WiMAX Business Planning and Deployment Project

Intended Audience
Managers who are concerned with the system integration, network realization
and operation for profit of broadband wireless access networks. Engineers
and technicians who are interested in technical issues of broadband
wireless access networks to allow them to make sound engineering judgments"
}

@INPROCEEDINGS{Ajor0000:Critical,
AUTHOR="Hossein Ajorloo",
TITLE="Critical Transmission Range for Connectivity in {Ad-Hoc} Networks",
BOOKTITLE="The first International Conference on New Technologies, Mobility and
Security",
ADDRESS="PARIS, France",
DAYS=2,
MONTH=may,
YEAR=2007,
ABSTRACT="One of the challenging problems in the ad hoc networks is
how to determine the critical transmission range for each communicating
node to achieve a connected network with minimum power consumption
and communication interference. In this paper, an analytical approach
is proposed to determine this parameter based on the number of nodes,
physical dimensions of the network, and probability of connectivity. Our
proposed approach resulted in Cumulative Distribution Functions (CDF)
for the critical transmission range for various numbers of nodes."
}

@INPROCEEDINGS{Ajor0706:LPRE,
AUTHOR="Hossein Ajorloo",
TITLE="{LPRE:} Lost Speech Packet Recovery with Enhancement",
BOOKTITLE="ICC 2007 Multimedia Communications and Home Services Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="In the internet telephony, loss of IP packets causes instantaneous
discontinuities in the received speech. In this paper, we have focused on
finding an error resilient method for this problem. Our proposed method
creates artificial correlation between speech samples that pre-distorts the
speech signal. The receiver uses this correlation to reconstruct the lost
speech packets. An appropriate speech enhancement technique is designed
for the reduction of the processing error in the recovered speech caused by
the speech codecs. The SegSNR results show the superiority of our proposed
speech enhancement method over a recently proposed speech enhancement
technique."
}

@INPROCEEDINGS{Akab0704:Autonomous,
AUTHOR="Kazunori Akabane and Hiroyuki Shiba and Munehiro Matsui and Kazuhiro Uehara",
TITLE="An autonomous adaptive base station that supports multiple wireless network
systems",
BOOKTITLE="Second IEEE International Symposium on Dynamic Spectrum Access Networks
2007",
ADDRESS="Dublin, Ireland",
DAYS=18,
MONTH=apr,
YEAR=2007,
ABSTRACT="Various wireless systems are being developed to meet users’ needs, and
effective frequency use is urgently needed because of the rapid increase in
frequency demand that accompanies the increasing popularity of wireless
services. However, general base stations are making no effort to use
frequency effectively, and cooperation among wireless system base stations
is necessary for more effective frequency use. Base stations can cooperate
more efficiently if they are able to use multiple channels of many wireless
systems simultaneously. In this paper, we propose an autonomous adaptive
base station (AABS) that adapts to various wireless systems the way
software defined radio (SDR) base stations do. The AABS can autonomously
select and use the most suitable wireless system based on user traffic and
AABS’s hardware resources. AABS can also offer a communication
environment suitable for “multi-link communication”, because AABS can
use multiple channels of multiple wireless systems simultaneously. We
developed an AABS prototype so we could evaluate performance. Our
experimental and computer simulation results demonstrate that the prototype
performs effectively."
}

@INPROCEEDINGS{Akan0703:BIOlogically,
AUTHOR="Ozgur Akan and Baris Atakan",
TITLE="{BIOlogically-inspired} Spectrum Sharing in Cognitive Radio Networks",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="Cognitive radio is the promising radio technology, which aims to detect and
utilize the temporally unused spectrum bands by sensing its radio
environment in order to enhance spectrum utilization. However, these
objectives bring significant challenges and required functionalities such
as spectrum sensing, sharing, management and mobility for the realization
of Cognitive Radio Networks (CRN). In particular, fair spectrum sharing
problem in cognitive radio communication is one of the most important
problem which must be addressed in order to enhance the overall spectrum
utilization in dynamic spectrum access environments. In this paper, we
introduce a new BIOlogically-inspired Spectrum Sharing  (BIOSS) algorithm
which is based on the adaptive task allocation model in insect colonies.
Without need for any coordination among the  unlicensed users, BIOSS
enables each unlicensed user to distributively determine the appropriate
channel(s) over which it can communicate. Performance evaluations clearly
reveal that BIOSS achieves efficient dynamic spectrum sharing with high
spectrum utilization and without any coordination among the users and hence
yielding no spectrum handoff latency overhead due to coordination."
}

@INPROCEEDINGS{Akar0705:Packet,
AUTHOR="Nail Akar and Ezhan Karasan and Carla Raffaelli and Michele Savi",
TITLE="Packet Loss Analysis of Synchronous Buffer-less Optical Switch with Shared
Limited Range Wavelength Converters",
BOOKTITLE="2007 IEEE Workshop on High Performance Switching and Routing",
ADDRESS="Brooklyn, New York, USA",
DAYS=31,
MONTH=may,
YEAR=2007,
ABSTRACT="Application of synchronous optical switches in Optical Packet/Burst
switched networks is considered. The shared per node architectural concept,
where wavelength converters are shared among all input and output channels,
is applied for contention resolution in the wavelength domain. A
semi-analytical traffic model suitable to represent the different
contributions to packet loss is proposed and validated.
Full and limited range wavelength conversion capabilities are considered,
and loss results obtained to support switch design.
An approximated fully analytical approach for the limited range case is
also described and comparison with simulation results is presented to
assess the capability to capture the main aspects of packet loss behavior."
}

@INPROCEEDINGS{Akar0711:Performance,
AUTHOR="Nail Akar and Ezhan Karasan and Giovanni Muretto and Carla Raffaelli",
TITLE="Performance Analysis of an Optical Packet Switch Employing {Full/Limited}
Range Share Per Node Wavelength Conversion",
BOOKTITLE="IEEE Globecom 2007 Optical Networks and Systems Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="In this paper, we study an asynchronous optical packet switching node
equipped
with a number of limited range or full range wavelength converters shared
per node. The packet traffic is realistically modeled by a superposition of
a finite number of on-off sources as opposed to the traditional Poisson
model which ignores the limited number of ports on a switch. We both study
circular and non-circular limited range wavelength conversion schemes. 
In our simulations, we employ the far conversion policy where the optical
packet is switched onto the farthest available wavelength in the tuning
range, which is known to outperform the random conversion policy. We
propose an approximate analytical method based on block tridiagonal Markov
chains and fixed point iterations to solve for the blocking probabilities 
in share per node wavelength conversion systems. The method provides an
accurate approximation for full range systems and acceptable results for
limited range systems."
}

@INPROCEEDINGS{Akba0000:Automatic,
AUTHOR="Emre Akbas and Fatos {Yarman Vural}",
TITLE="Automatic Image Annotation by Ensemble of Visual Descriptors",
BOOKTITLE="2007 IEEE International Workshop on Semantic Learning Applications in
Multimedia",
ADDRESS="Minneapolis, USA",
DAYS=18,
MONTH=jun,
YEAR=2007,
ABSTRACT="Automatic image annotation systems available in the literature concatenate
color, texture and/or shape features in a single feature vector to learn a
set of high level semantic categories using a single learning machine. This
approach is quite naive to map the visual features to high level semantic
information concerning the categories. Concatenation of many features with
different visual properties and wide dynamical ranges may result in curse
of dimensionality and
redundancy problems. Additionally, it usually requires normalization which
may cause an undesirable distortion in the feature space.

An elegant way of reducing the effects of these problems is to design a
dedicated feature space for each image category, depending on its content,
and learn a range of visual properties of the whole image from a variety of
feature sets. For this purpose, a two-layer ensemble learning system,
called Supervised Annotation by Descriptor Ensemble (SADE), is proposed.
SADE, initially, extracts a variety of
low-level visual descriptors from the image. Each descriptor is, then, fed
to a separate learning machine in the first layer. Finally, the meta-layer
classifier is trained on the output of the first layer classifiers and the
images are annotated by using the decision of the meta-layer classifier.
This approach
not only avoids normalization, but also reduces the effects of dimensional
curse and redundancy. The proposed system outperforms a state-of-the-art
automatic image annotation system, in an equivalent experimental setup."
}

@INPROCEEDINGS{Akba0708:Processing,
AUTHOR="Reza Akbarinia and Esther Pacitti and Patrick Valduriez",
TITLE="Processing Top-k Queries in Distributed Hash Tables",
BOOKTITLE="Peer to peer computing",
ADDRESS="Rennes, France",
DAYS=28,
MONTH=aug,
YEAR=2007,
KEYWORDS="Top-k query, P2P systems, Distributed Hash Table",
ABSTRACT="Distributed Hash Tables (DHTs) provide a scalable solution for data sharing
in large scale distributed systems, e.g. P2P systems. However, they only
provide good support for exact-match queries, and it is hard to support
complex queries such as top-k queries. In this paper, we propose a family
of algorithms which deal with efficient processing of top-k queries in
DHTs. We evaluated the performance of our solution through implementation
over a 64-node cluster and simulation. Our performance evaluation shows
very good performance, in terms of communication cost and response time."
}

@INPROCEEDINGS{Akca0706:Sparsity,
AUTHOR="Mehmet Akcakaya and Vahid Tarokh",
TITLE="On Sparsity, Redundancy and Quality of Frame Representations",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="THIS PAPER IS ELIGIBLE FOR THE STUDENT PAPER AWARD 

We consider approximations of signals by the elements of a frame in a
complex vector space of dimension $N$ and formulate both the noiseless and
the noisy sparse representation problems. The noiseless representation
problem is to find sparse representations of a signal $\mathbf{r}$ given
that such representations exist. In this case, we explicitly construct a
frame, referred to as the Vandermonde frame, for which the noiseless sparse
representation problem can be solved uniquely using $O(N^2)$ operations, as
long as the number of non-zero coefficients in the sparse representation of
$\mathbf{r}$ is $\epsilon N$ for some $0 \le \epsilon \le 0.5$, thus
improving on a result of Candes and Tao \cite{Candes-Tao}.

The noisy sparse representation problem is to find sparse representations
of a signal $\mathbf{r}$ satisfying a distortion criterion.  In this case,
we establish a lower bound on the trade-off between the sparsity of the
representation, the underlying distortion and the redundancy of any given
frame."
}

@INPROCEEDINGS{Akdo0712:Line,
AUTHOR="Mustafa Akdogan and Etem {Köklükaya}",
TITLE="A Novel Line Code Achieving More Efficient and Effective Usage of Space
Segment Capacity on Communication Satellites",
BOOKTITLE="Mosharaka International Conference on Communications, Networking and
Information Technology",
ADDRESS="Amman, Jordan",
DAYS=6,
MONTH=dec,
YEAR=2007,
KEYWORDS="Line code, communication satellites, efficient usage of satellite space
segment capacity",
ABSTRACT="More efficient and effective usage of space segment capacity on
communication satellites whose cost is extremely high is an unavoidable
reality of today.
For this purpose, scientists and satellite communication researchers that
have never been more challenging that it is today do research and
developments to find new techniques especially concerning about modulation,
satellite access methods and line codes for the optimization.
In this context, the aim of this paper is to develop a novel line code
which uses lower space segment capacity and provides more efficient,
effective, quality and economical services to more users via satellites and
to show its superiority in comparison to the existing line codes.
Furthermore, the developed line code will be relatively simple and suitable
for use in practical communications systems. 
We claim that readers will keep this paper for future reference and lasting
value. Additionally, this paper will be indispensable reference tool
designed to help the readers learn the key points of design of new line
codes."
}

@INPROCEEDINGS{Akel0701:Relative,
AUTHOR="Jayasri Akella and Murat Yuksel and Shivkumar Kalyanaraman",
TITLE="A Relative Ad hoc Localization Scheme using Optical Wireless",
BOOKTITLE="The Second International Conference on COMmunication Systems softWAre and
middlewaRE",
ADDRESS="Banglaore, India",
DAYS=7,
MONTH=jan,
YEAR=2007,
ABSTRACT="Directional communications (eg: using directional antennas or
free-space-optics (FSO)) has the potential for dramatically
increasing capacity reuse in multi-hop wireless mesh and ad-hoc
networks. What is less appreciated is that directional
communications can also simplify network layer functions! In this
paper, we show how directionality (combined with ranging) can be
used to construct a scalable, fully distributed localization system
and assign ``relative'' coordinates to each node (without the need
for GPS) that can be used by highly scalable geographic routing
systems. We show that range and orientation-based localization
schemes (ROL) scale better than range-only or orientation-only
localization schemes (e.g. triangulation) for such applications. We
present simulations studying scalability, effect of errors (both
range and directionality) and compare performance with triangulation
methods. Finally, we discuss how such an ROL scheme can be realized
with optical wireless nodes, based upon our ongoing efforts to build
ad-hoc and meshed networks using both FSO and RF technologies."
}

@INPROCEEDINGS{Akel0706:Multi,
AUTHOR="Jayasri Akella and Murat Yuksel and Shivkumar Kalyanaraman",
TITLE="Multi-channel Communication in {Free-Space} Optical Networks for the
Last-mile",
BOOKTITLE="15th IEEE Workshop on Local and Metropolitan Area Networks",
ADDRESS="Princeton, NJ, USA",
PAGES="43-48",
DAYS=10,
MONTH=jun,
YEAR=2007,
KEYWORDS="Free Space Optical Networks, Optical Wireless, Last-mile, Broadband access",
ABSTRACT="Free-Space optical networks last-mile wireless broadband access
network, for example, in a Wireless Mesh Networks (WMNs) or wireless
backbone for metro/urban area networks. Traditional FSO links are single
channel links deployed between a single transmitter and receiver, and hence
they are vulnerable to link disruption due to blockage and/or adverse
weather conditions. A possible solution is to implement multiple parallel
FSO links
between a pair of nodes. With such multi-channel communication, we
can not only improve the link reliability due to redundancy, but can
also achieve higher aggregate bandwidths. On the other hand,
multi-channel links are susceptible to inter-channel interference,
causing a drop in the link capacity. In this paper, we study the
feasibility of using multi-channel FSO communication.

We study multi-element antennas in the context of free-space optical
communications with the objective to achieve higher aggregate
bandwidth. We study FSO communication between 2-dimensional array
antennas each with multiple transmitting and receiving elements,
unlike conventional single link systems. We model FSO communication
channel between the multi-element antenna system as a binary
asymmetric channel and model the inter-channel interference for such
channel as bit error rate and study the channel capacity. We show,
through simulations that such channel capacity can be increased
through array design (placement of transceivers on the array) and
further by orthogonally coding the signals from the multiple
antennas.

In particular, we study two array designs, one with uniform spatial
distribution of transceivers on the 2-dimensional array and the
other with spiral spatial distribution.  We model the inter-channel
interference using Gaussian approximation similar to multi-access
communication and derive the probability of bit error, for both
un-coded and orthogonally coded signals. Based on this error model,
we then obtain channel capacity for the binary asymmetric channel
for the two designs of the optical antenna. We present design
guidelines based on the link range, number of optical transceivers
(elements) and achievable aggregate bandwidth."
}

@INPROCEEDINGS{Akha0705:Implementation,
AUTHOR="Amir Nasser Akhavan and Ahmad Barati Marani",
TITLE="Implementation of Risk {Management-The} Case of Iranian Private Automation
Industry",
BOOKTITLE="International Conference on Management of Technology 2007",
ADDRESS="Miami Beach, Florida, USA",
DAYS=13,
MONTH=may,
YEAR=2007,
ABSTRACT="Risk management is systematic process of planning for identifying,
analyzing, responding to, and monitoring project risk. It involves
processes, tools, and techniques that will help the project manager
maxinize the probability and concequences of positive events and minimize
the probability and concequences of adverse events.
Most of cost over runs or schedules delays in projects, is because of risk
which have not been foreseen in projects initiation and planning phases or
macro-environment changes and when occur, can have sever effects on project
trio-objectives. To avoid schedules delays, a team in planning department
of PKEM COMPANY TOOK ACTION IN IDENTIFYING GENERAL RISKS AND DETERMINING
BEST ERSPONSE PLANS IN INDUSTRIAL AND automation projects.
This paper states the risk management process which is planned in PKEM
Company to help project managers in handeling and controlling their risks."
}

@INPROCEEDINGS{Akha0705:Legal,
AUTHOR="Amir Nasser Akhavan",
TITLE="The Legal Framework and the Role of Government in the Transfer of
Technology: The Case of Iran",
BOOKTITLE="International Conference on Management of Technology 2007",
ADDRESS="Miami Beach, Florida, USA",
DAYS=13,
MONTH=may,
YEAR=2007,
ABSTRACT="Governments play an important role in the transfer and development of
technology.The intention in this paper is to explore the role governments 
in general and Iran in particular in the transfer of technology from
Developed Countries. There are four parts. The first gives some general
information on the role of governments in this process. the second examines
the Iranaian government regulations on the transfer of technology.
Legislation and the regulation of technology transfer in some selected Dcs
are discussed in part three and part four derives some conclusion."
}

@INPROCEEDINGS{Akht0703:Iterative,
AUTHOR="Yosef Akhtman and Lajos Hanzo",
TITLE="Iterative Receiver Architectures for {MIMO-OFDM}",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="In this paper we propose a turbo-detected multi-antenna-multi-carrier
receiver scheme. Following the philosophy of the turbo processing, our
turbo MIMO-OFDM receiver comprises a succession of detection modules,
namely the channel estimator, the space-time detector and the decoder,
which iteratively exchange soft bit-related information and thus facilitate
a substantial improvement of the overall system performance. 
In this paper we analyse the achievable performance of the iterative system
proposed with the aim of documenting the various design trade-offs, such as
the achievable error-rate performance, the attainable data-rate as well as
the associated computational complexity.
Specifically, we report a virtually error-free performance for a rate-1/2
turbo-coded 8x8-QPSK-OFDM system, exhibiting an effective throughput of 8 *
2 * 1/2 = 8 bits/sec/Hz and having a pilot overhead of only 10\%, at SNR of
7.5dB and normalized Doppler frequency of 0.003, which corresponds to a
mobile terminal speed of about 65 km/h."
}

@INPROCEEDINGS{Akht0706:Advanced,
AUTHOR="Yosef Akhtman and Lajos Hanzo",
TITLE="Advanced Channel Estimation for {MIMO-OFDM} in Realistic Channel Conditions",
BOOKTITLE="ICC 2007 Signal Processing for Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="An advanced decision-directed channel estimation scheme is proposed, which
is suitable for employment in a wide range of multi-antenna multi-carrier
systems as well as for communications over the entire range of practical
channel conditions. In particular, we consider a MIMO-OFDM system operating
in a mobile wireless multipath channel, which exhibits frequency-selective
Rayleigh fading and is characterized by a time-variant power delay
profile.
Both the mean square error as well as the bit error rate performances
achieved by the proposed system are documented. Specifically, we report a
virtually error-free performance of a rate 1/2 turbo-coded 8x8-QPSK-OFDM
system, exhibiting an effective throughput of 8 * 2 * 1/2 = 8bits/sec/Hz,
while having a pilot overhead of only 10\%, at an SNR of 10dB and an
OFDM-symbol-normalized Doppler frequency of 0.003, which corresponds to the
mobile terminal speed of about 65 km/h."
}

@INPROCEEDINGS{Akht0711:Online,
AUTHOR="Muhammad Akhtar and Masahide Abe and Masayuki Kawamata and Muhammad Tufail",
TITLE="Online Acoustic Feedback Path Modeling in Multichannel (1x2x2) Active Noise
Control Systems",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="628-631",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Adaptive signal processing; multichannel active noise control; acoustic
feedback; online feedback-path modeling;",
ABSTRACT="This paper proposes a method for online feedback path modeling in
multichannel active noise control (ANC) systems. Previously we have
proposed a method for online feedback path molding for single-channel ANC
system. Here we modify and extend this method to multichannel ANC systems,
in particular, we consider a 1x2x2 system comprising one reference
microphone, two secondary loudspeakers and two error microphones. The
computational complexity of the proposed method is lower than the existing
methods. Computer simulations are used to demonstrate the effectiveness of
the proposed method. It is shown that proposed method gives improved
performance in generating acoustic-feedback-free reference signal, and
hence improving the overall performance of the ANC system."
}

@INPROCEEDINGS{Akim0000:160Gbs,
AUTHOR="Ryoichi Akimoto and Takasi Simoyama and Hidemi Tsuchida and Shu Namiki and
Lim Guan and Masanori Nagase and Teruo Mozume and Hiroshi Ishikawa and
Toshifumi Hasama",
TITLE="A 160Gb/s to 10Gb/s {DEMUX} operation by {Mach-Zehnder} Interferometric
Intersubband Ultrafast {All-Optical} Switch",
BOOKTITLE="ECOC 2007 - 33rd European Conference and Exhibition on Optical
Communication",
ADDRESS="Berlin, International Congress Center (ICC), Germany, Germany",
DAYS=16,
MONTH=sep,
YEAR=2007,
KEYWORDS="DEMUX, 160Gb/s, intersubband optical switch, cross-phase modulation",
ABSTRACT="Mach-Zehnder interferometric ultrafast optical switching module utilizing
novel TE cross-phase modulation caused by TM intersubband excitation in
InGaAs/AlAs/AlAsSb coupled quantum wells  was fabricated. A 160Gb/s to
10Gb/s DEMUX operation was demonstrated."
}

@INPROCEEDINGS{Akin0706:Training,
AUTHOR="Sami Akin and M. Cenk Gursoy",
TITLE="Training Optimization for {Gauss-Markov} Rayleigh Fading Channels",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="In this paper, pilot-assisted transmission over
Gauss-Markov Rayleigh fading channels is considered. A simple
scenario, where a single pilot signal is transmitted every T
symbols and T-1 data symbols are transmitted in between the
pilots, is studied. First, it is assumed that binary phase-shift
keying (BPSK) modulation is employed at the transmitter. With this
assumption, the training period, and data and training power
allocation are jointly optimized by maximizing an achievable rate
expression. Achievable rates and energy-per-bit requirements are
computed using the optimal training parameters. Secondly, a capacity
lower bound is obtained by considering the error in the estimate as
another source of additive Gaussian noise, and the training
parameters are optimized by maximizing this lower bound."
}

@INPROCEEDINGS{Akka0704:Coverage,
AUTHOR="Kemal Akkaya and Mohamed Younis",
TITLE="Coverage-aware and {Connectivity-Constrained} Actor Positioning in Wireless
Sensor and Actor Networks",
BOOKTITLE="26th IEEE International Performance Computing and Communications Conference",
ADDRESS="New Orleans, Louisiana, USA",
DAYS=11,
MONTH=apr,
YEAR=2007,
ABSTRACT="In addition to the miniaturized sensor nodes, Wireless Sensor and Actor
Networks (WSANs) employ significantly more capable actor nodes that can
perform application specific actions to deal with events detected and
reported by the sensors. Since these actions can be taken at any spot
within the monitored area, the actors should be carefully placed in order
to provide maximal coverage. In addition, the actors often coordinate among
themselves in order to arbitrate tasks and thus inter-actor connectivity is
usually a requirement. In this paper, we propose an actor positioning
mechanism which maximizes the coverage of actors without violating the
connectivity requirement. The approach applies repelling forces between
neighboring actors, similar to molecular particles in Physics, in order to
spread them in the region. However, the movement of each actor is
restricted in order to maintain the connectivity of the inter-actor
network. The performance of the approach is validated through simulations."
}

@INPROCEEDINGS{Akka0711:Introducing,
AUTHOR="Nadine {Akkari Adra} and Samir Tohme",
TITLE="Introducing Intelligent Vertical Handover in Next Generation Networks",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="728-731",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="vertical handover; handover management; network-initiated; user-initiated;",
ABSTRACT={The vision of next generation networks is an all-IP network supporting
heterogeneous access technologies such as WLAN, UMTS and WiMax for the
purpose of providing the mobile user with roaming capability across
different networks. To enable this type of mobility known as vertical
handover (HO), a special mobility management is proposed in order for the
handover to be performed with service continuity and minimum QoS
degradation. The proposed Intelligent Handover Management (IHOM) consists
of {"}guiding{"} the HO request to the best network capable of providing
the required QoS parameters. The processing of the HO is based on an
anticipated scenario where the HO decision parameters are compared to a
pre-defined threshold in order for the HO to be guided accordingly.}
}

@INPROCEEDINGS{Akku0711:Multi,
AUTHOR="Istemi Ekin Akkus and Oznur Ozkasap and Reha Civanlar",
TITLE="Multi-objective Optimization For {Peer-to-Peer} Multipoint Video
Conferencing",
BOOKTITLE="16th International Packet Video Workshop",
ADDRESS="Lausanne, Switzerland",
DAYS=12,
MONTH=nov,
YEAR=2007,
ABSTRACT="We present a multi-objective approach and corresponding formulations
for the optimal operation of a peer-to-peer multipoint video
conferencing system. The system aims end-points with low bandwidth
connections (i.e., single full-quality video in and out) and makes
use of layered video to achieve that each participant can view any
other participant's video at anytime. This may cause some of the
peers receive lower quality video. Moreover, since the peers may
have to forward the video they receive, this may cause larger delays
for the peers that receive the video after it is forwarded by
several peers. Objective formulations to determine the number of
lower quality video receiving peers and the delay experienced by the
peers are derived. A multi-objective optimization approach for
minimizing both simultaneously is described. An extension that
allows multiple video requests from the participants with sufficient
bandwidth is proposed. Formulations to minimize the number of lower
quality video receivers while maximizing the number of additional
video requests are presented. A multi-objective optimization
technique assigning importance weights to each of these objectives
and its sensitivity to changes in the weights are shown. The use of
multi-objective optimization techniques within a system is
demonstrated through example scenarios. The effects of our
optimization approach on the percentage of base quality receiving
peers are examined through simulations."
}

@INPROCEEDINGS{Akl0701:Grid,
AUTHOR="Robert Akl and Uttara Sawant",
TITLE="Grid-based Coordinated Routing in Wireless Sensor Networks",
BOOKTITLE="2007 IEEE Consumer Communications and Networking Conference - Wireless
Networking Track",
ADDRESS="Las Vegas, NV, USA",
DAYS=11,
MONTH=jan,
YEAR=2007,
ABSTRACT="This work explores grid-based coordinated routing in wireless sensor
networks and compares the energy available in the network over time for
different grid sizes.  A test area is divided into square-shaped grids of
certain length. Fully charged battery powered nodes are randomly placed in
the area with a fixed source and sink nodes. One node per grid is elected
as the coordinator which does the actual routing. The source node starts
flooding the network with every coordinator joining in the routing. Once
the flooding reaches the sink node, information is sent back to the source
by finding the back route to the source. This process is continued until a
node (coordinator) along that route runs out of energy. New coordinators
are elected to replace the depleted ones. The source node refloods the
network so that the sink can find a new back route to send information.
This entire process continues until the network is partitioned and the
connectivity between the source and the sink nodes is lost. We explore the
quality of service of wireless sensor networks, how the coordinator nodes
are elected, and the size of the grid area that will minimize the total
energy consumption and extend the lifetime of the network."
}

@INPROCEEDINGS{Akme0000:Pattern,
AUTHOR="Rini Akmeliawati and Ye Chow Kuang and Andreas Domingo",
TITLE="Pattern Matching for Automatic Sign Language Translation System using
{LabVIEW}",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="This paper introduces the process and the algorithms used in translating
Malaysian sign language. The Malaysian sign language is translated using
pattern-matching algorithm. The sign language translator is a vision-based
system where the image of the sign is captured by a camera, processed and
translated into English by the computer using LabVIEW. This sign language
translator is able to recognize alphabets (A-Z), numbers (0-9), finger
spelling, words (13 words) and sentences. Alphabets, numbers and fingers
are categorized under static signs while words and sentences are known as
dynamic signs where the signs involve motion. Static signs are recognised
by matching positions of each fingertip with the database while the
recognition of dynamic signs is performed by comparing the trajectory of
the motion. The accuracy for static sign is 97.79\% while the accuracy for
dynamic sign is 80.38\%"
}

@INPROCEEDINGS{Akon0701:Low,
AUTHOR="Mursalin Akon and Ajit Singh and Sherman Shen",
TITLE="Low Cost {Peer-to-Peer} Collaborative Caching for Clusters",
BOOKTITLE="2007 IEEE Consumer Communications and Networking Conference - Special
Sessions Track",
ADDRESS="Las Vegas, NV, USA",
DAYS=11,
MONTH=jan,
YEAR=2007,
ABSTRACT="Retrieving data from the memory of a remote computer is significantly
faster than retrieving data from a remote storage device. Therefore,
sharing caches among several computers can reduce the number of storage
device access. In this paper, we propose a new collaboration scheme among
clients in a computer cluster to share their caches with each other. The
collaboration is designed based on peer-to-peer computing model. The scheme
not only provides an easy to develop software architecture but also yields
a near optimal performance with reasonably low overheads. Simulations are
conducted to demonstrate the performance of the proposed scheme."
}

@INPROCEEDINGS{Akra0000:Evaluation,
AUTHOR="Attiya Akram and Ayesha Naureen and Farooq Ahamed and Rabia Riaz and
Ki-Hyung Kim",
TITLE="Evaluation of Hybrid Security System with Cluster Based key Management for
Wireless Sensor Networks",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="Security critical applications of Wireless Sensor
Networks stipulate more efficient and secure architectures for
Security. Hybrid Security system using both public and private
key cryptography along with cluster based key management can
be a step further in achieving more security and efficiency at a
lower cost. The paper analyzes and evaluates the Hybrid security
system with cluster based key Management for Wireless Sensor
Networks."
}

@TECHREPORT{Aksa0702:Security,
AUTHOR="Saltuk Aksahin",
TITLE="Security Implications of Converged Networks and Protecting Them, without
Compromising Efficiency",
TYPE="arXiv report",
INSTITUTION="arXiv",
NUMBER="cs.NI/0702110",
MONTH=feb,
YEAR=2007,
ABSTRACT="This dissertation has extensively looked into all aspects of VoIP
communications technology, and information presented in preceding chapters,
which build up a solid framework to discuss the conceptual design model,
and investigate features that could be incorporated for actual Projects,
with parameters that are tested on field values. The dissertation follows a
five-course model, for answering different questions, both tech-nical and
businesslike, around central issues, that have been crucial to explanation
of
the topic; starting with a general overview of VoIP tech-nology, analyzing
current VoIP encryption methods, identifying security threats, designing a
robust VoIP system based on particulars discussed in preceding chapters,
and finally, a VoIP simulation.",
URL="http://arXiv.org/abs/cs/0702110"
}

@INPROCEEDINGS{Aksa0709:Camera,
AUTHOR="Anil Aksay and Alptekin Temizel and Enis Çetin",
TITLE="Camera Tamper Detection Using Wavelet Analysis For Video Surveillance",
BOOKTITLE="IEEE International Conference on Advanced Video and Signal based
Surveillance",
ADDRESS="London, United Kingdom",
DAYS=5,
MONTH=sep,
YEAR=2007,
ABSTRACT="It is generally accepted that video surveillance system operators lose
their concentration after a short period of time and may miss important
events taking place. In addition, many surveillance systems are frequently
left unattended. Because of these reasons, automated analysis of the live
video feed and automatic detection of suspicious activity have recently
gained importance. To prevent capture of their images, criminals resort to
several techniques such as deliberately obscuring the camera view, covering
the lens with a foreign object, spraying or de-focusing the camera lens. In
this paper, we propose some computationally efficient wavelet domain
methods for rapid camera tamper detection and identify some real-life
problems and propose solutions to these."
}

@INPROCEEDINGS{Aktu0706:Statistical,
AUTHOR="Hasan Aktulga and Ioannis Kontoyiannis and Leszek Lyznik and Lukasz
Szpankowski and Ananth Grama and Wojciech Szpankowski",
TITLE="Statistical Dependence in Biological Sequences",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Understanding and quantifying the representation and amount
of information in organisms potentially holds the key to
fundamental advances in biology. In this paper,
we demonstrate the use of information-theoretic tools
to identify segments of biomolecules (e.g., DNA, RNA,
and aminoacid sequences) that are (statistically) correlated.
While many instances of such correlations have been empirically
observed, their biological interpretations are central topics
of active research. For example, statistical dependencies between
{\it exons} carrying genes and (noncoding) {\it introns} in a DNA
sequence, may indicate the presence of as-yet unknown error
correction mechanisms or structural scaffolds. Thus motivated,
we develop a precise and reliable methodology for identifying
and extracting structural dependencies. We use information-theoretic
tools to develop estimators for mutual information.
In particular, we present a simple threshold function that
can be used to quantify the level of statistical significance
for dependent biological segments. We demonstrate the use
of our tools in the context of alternate splicing in the
zmSRp32 gene in maize. Based on our experiments, we argue
that our approach is particularly well suited to problems
such as discovery of short tandem repeats, an application
of significant importance in genetic profiling."
}

@INPROCEEDINGS{Akuj0000:Application,
AUTHOR="Cajetan Akujuobi and Nana Ampah and Matthew Sadiku",
TITLE="Application of Wavelets and Self-similarity to Enterprise Network Intrusion
Detection and Prevention Systems",
BOOKTITLE="International Symposium of Consumer Electronics 2007",
ADDRESS="Dallas, Texas, USA",
DAYS=20,
MONTH=jun,
YEAR=2007,
ABSTRACT="Securing Enterprise networks has so far been considered under two broad
topics (i. e. Intrusion Detection Systems - IDS and Intrusion Prevention
Systems - IPS). So far, there is no algorithm, which guarantees absolute
protection for a given network from intruders. Most existing IDS and IPS
techniques introduce high false positive and false negative rates, which
need to be eliminated or reduced considerably. 

This paper will concentrate on network packets behavior leading to
network-based intrusion detection. It will employ anomaly detection as its
analysis strategy. In the field of signal analysis, the methods of wavelet
transform have gotten wide application because of its unique merit. The
wavelet idea will be used in this  paper to better enhance and improve the
novel security algorithm developed in this research project. 

The self-similarity property of real network traffic will be used together
with the signal detection abilities of wavelets in detecting attacks. The
technique used here will also try to reduce the effectiveness of
distributed attacks, which deny authorized users access to system
resources. Securing of all network security data, which is an important
limitation to existing IDS and IPS is ensured by this technique. The
results have been very successful."
}

@INPROCEEDINGS{Akuj0000:Application,
AUTHOR="Cajetan Akujuobi and Nana Ampah and Matthew Sadiku",
TITLE="Application of Signal Detection and Estimation Theory to Network Security.",
BOOKTITLE="International Symposium of Consumer Electronics 2007",
ADDRESS="Dallas, Texas, USA",
DAYS=20,
MONTH=jun,
YEAR=2007,
ABSTRACT="The need to use quantitative methods to detect intrusion is increasing due
to the high false positive and false negative rates of existing Intrusion
Detection Systems (IDS) and Intrusion Prevention Systems (IPS). Most
network security techniques employed by the IDS and IPS depend mainly on
packet behavior for detection. This work applies a quantitative approach
based on Maximum A Priori (MAP) detection rules with the hope of reducing
the high false positive and false negative rates. The entire system has
been represented by a mathematical model of a discrete binary communication
channel having two possible input messages and two possible output symbols.
The network under study is assumed to have only one entry point (sender)
for now, with a number of nodes (receivers). Also, all normal operational
packets are referred to as normal packets and any other packets are
referred to as abnormal packets. The analysis strategy used here is anomaly
detection. The developed algorithm initially calculates the a priori
probabilities for the normal and abnormal packets both at the sender and
entry ends. These values are used as threshold probabilities to be compared
with probabilities of future incoming packets. MATLAB was used in coding
the developed algorithm. This work will be expanded by modeling the entire
system as a continuous binary communication channel and also by considering
multiple entry points as future works, with the intension of improving the
results obtained so far."
}

@INPROCEEDINGS{Al0704:Requirements,
AUTHOR="Al Florence",
TITLE="Requirements Development and Management for Systems",
BOOKTITLE="1st Annual IEEE Systems Conference",
ADDRESS="Waikiki, Honolulu, Hawaii, USA",
DAYS=9,
MONTH=apr,
YEAR=2007,
ABSTRACT="NOTE:  This is for a 1/2 day tutorial

Some of the biggest challenges faced by system engineers are those of
requirements elicitation, analysis, specification (writing requirements),
verification and validation. In order for requirements to be implementable
and testable, they need to be properly defined and documented.
You may have the best of everything: best management, technical staff,
resources, budget, schedule, customer, and even Capability Maturity Model
Integration (CMMI®) Level 5 processes. But, if you do not have a good set
of well-defined requirements that are understood and agreed to by all
stakeholders, you are at grave risk. 
Effective practices for requirement’s development and management will
first be presented followed with the application of some of these practices
on real projects. The tutorial will also focus on satisfying requirements
related CMMI® process areas at the systems and allocated level.  
The tutorial will present: Motivation - why do we care? Nature of
Requirements – what are they? Creating Requirements – how do we define
them?  Challenges – what are some typical problems?  Requirements
Management – why manage them?  Requirements Measurements and Metrics –
why do we need them?  Requirements Independent Verification \&
Validation– what is it?
Real project examples will be presented on: the proper specification of
requirement, independent verification of requirements, independent
validation of requirement, and quantitative management on the specification
of requirements.
Attendees gain an understanding of requirements development and management,
on baselining requirements and controlling changes to those baselines, and
on the proper specification of requirements.  
The tutorial will address requirements types, gathering techniques,
specification of requirements, requirements allocation, requirements
volatility, requirements management, requirements validation and
verification (V\&V), and best practices and skills for requirements
analysis. 

Examples of tutorial content:

?
Motivation - Why do we care?
?	Motivation – Why do we care?
•	Requirements form the form foundation of all system development
•	If we don’t handle them properly, we incur significant risk
•	Many historical examples demonstrate this
•	Requirements will change over development period
•	Planning ahead will mitigate resulting extra work (and risk)

?	Nature of requirements - what are they? 
•	A condition or capability needed by a user to solve a problem or
achieve an objective.
•	A condition or capability that must be met or possessed by a system or
system component to satisfy a contract, standard, specification, or other
formally imposed documents.
•	A documented representation of a condition or capability as in (1) or
(2).

?	Context of requirements
•	All requirements are defined in context of a specific component (e.g.,
black box)
•	Which may consist of additional constituent components (e.g.,
subsystem, modules,...)
•	Hence there are multiple levels of requirements based on level of
component
•	System level, subsystem level, software/hardware level, component
level,
•	Component design (its architecture) consists of:
•	The requirements for behavior of each constituent component
•	The interrelationships between the components
•	Interaction of components produces the behavior of parent component 

Some types of requirements

?	Behavioral requirements - externally visible behaviors of an item (aka
functional specifications, functional  requirements)
?	Quality of construction requirements - qualitative attributes of an item,
such as maintainability and portability
?	Programmatic requirements - terms and conditions imposed as a part of a
contract exclusive of behavioral requirements (e.g., costs, schedules,
organizational structures) aka contractual 
?	Implementation requirements - aka implementation constraints, design
constraints – restrictions placed on developers that limit design space

Qualities of requirements 

?	IEEE Std 830-1993* defines nine qualities for requirements
specifications
»	Complete – All external behaviors are defined	
»	Unambiguous – Every requirement has one and only one interpretation
»	Correct – Every requirement stated is one that the system shall meet
»	Consistent – No subset of requirements conflict with each other
»	Verifiable – A cost-effective finite process exists to show that each
requirement has been successfully implemented
»	Modifiable – SRS structure and style are such that any changes to
requirements can be made easily, completely, and consistently while
retaining structure and style.
»	Modifiable – SRS structure and style are such that any changes to
requirements can be made easily, completely, and consistently while
retaining structure and style.
»	Traceable – Origin of each requirement is clear, and structure
facilitates referencing each requirement within lower-level documentation
»	Ranked for importance – Each requirement rated for criticality to
system, based on negative impact should requirement not be implemented
»	Ranked for stability – Each requirement rated for likelihood to
change, based on changing expectations or level of uncertainty in its
description"
}

@INPROCEEDINGS{Al0704:Statistical,
AUTHOR="Al Florence",
TITLE="Statistical Process Control Applied to the Requirements Specification
Process",
BOOKTITLE="1st Annual IEEE Systems Conference",
ADDRESS="Waikiki, Honolulu, Hawaii, USA",
DAYS=9,
MONTH=apr,
YEAR=2007,
ABSTRACT="Statistical process control (SPC) has been applied on manufacturing
processes very effectively for many years. Recently software organizations,
with higher process maturity levels, have been applying SPC to their
engineering development and management processes. Control charts are used
because they separate signal from noise, so when anomalies occur they can
be recognized. The intent is to better understand and monitor process
behavior and to bring it under control when required. This presentation,
applicable to 6 sigma and compliant with CMMI Level 4, is on the
application of SPC to the requirements specification (writing requirements)
process. Real project data are used to demonstrate the use of SPC using
control charts. An overview of control charts is presented followed by some
real project examples in applying SPC to defects discovered during the
requirements specification process. The presentation will demonstrate how
to properly specify requirements, how SPC is used to understand the
behavior of the requirements specification process, how to determine when
the process is unstable, how to analyze the reason for the instability and
how to correct the problem and prevent it from recurring. The presentation
will show that the use of rigorous statistics using control charts can
easily and effectively be used in a systems and software setting. Control
charts are one of many tools that can be used in applying statistical
process control to processes. According to the normal distribution, 99\% of
all normal random values lie within +/-3 standard deviations from the norm,
i.e., 3-sigma. If a process is mature and under statistical process
control, all events should lie within the upper and lower 3-sigma control
limits. If an event falls beyond the control limits the process is said to
be out of statistical process control. The reason for this anomaly should
to be investigated for cause and the process brought back under control.
Control charts are used because they separate signal from noise, so when
anomalies occur they can be recognized. They identify undesirable trends
and point out fixable problems and potential process improvements. Control
charts show the capability of the process, so achievable goals can be set.
They provide evidence of process stability, which justifies predicting
process performance.  One of the biggest challenges faced by software
engineers are those of requirement definition, analysis, validation, and
specification. In most cases they are ambiguous and inconsistent. You may
have the best of everything: best management, technical staff, resources,
budget, schedule, customer, and even Capability Maturity Model Integration
(CMMI®) Level 5 processes. But, if you do not have a good set of
well-defined requirements that are understood and agreed to by all
stakeholders, you are at grave risk. While re-developing legacy systems, a
Government agency reverse engineered the existing software requirements.
This author was assigned as a consultant to guide the teams in the proper
specification of requirements. He analyzed and validated the requirements
against the following critical attributes: completeness, clarity,
traceability, testability, consistency, unique identification, design free,
and use of the word “shall”. Examples will show some of the
requirements as initially specified by the Government, followed by this
author’s critique of the requirements against the critical attributes,
and finally their re-specification. The defects detected were than analyzed
using control charts to identify and correct root causes of problems the
keep them from recurring."
}

@INPROCEEDINGS{Al0704:Title,
AUTHOR="Al Florence",
TITLE="Title: Systems Level Configuration Management",
BOOKTITLE="1st Annual IEEE Systems Conference",
ADDRESS="Waikiki, Honolulu, Hawaii, USA",
DAYS=9,
MONTH=apr,
YEAR=2007,
ABSTRACT="NOTE: This is for a ½ day tutorial

Configuration Management (CM) can be dangerous if over applied or under
applied.  If over applied projects get mired in bureaucracy with burdensome
processes that deplete valuable resources preventing other important
projects activities from being accomplished.  We all know what happens if
under applied, projects very quickly get out of control.  
CM can and should be applied at the supplier as well at the acquisition
level.  Most CM activities are described for suppliers.  This tutorial will
proved insight into the application of CM principles to both the acquirer
and supplier. Although there are subtle differences in applying CM to
acquisition vs. supplier, CM is CM and supplier CM principles can be
adapted in an acquisition setting.  This tutorial provides an understanding
of the differences, similarities and touch points to/from supplier/acquirer
CM
This course, compliant with CMMI®, presents CM as applied at the systems
level to hardware, software, and facilities. It describes the CM
relationships and responsibilities between the acquirer, supplier,
programs, projects and subcontractors.  It focuses on: identification of
configuration items (CIs), baselining CIs, controlling changes to CIs,
conducting impact assessments on proposed changes, Configuration Control
Boards (CCBs), and CM status accounting.  Included are the definition and
application of Functional Configuration Audits (FCAs) and Physical
Configuration Audits (PCAs) on the configurations of deliverable products.
A CM overview and the importance of CM are first presented followed with
detailed descriptions of the application of CM.  The importance of, and
guidelines on, tailoring CM to the scope of an application will be covered.
 The course is supported with illustrations, lessons learned, and real
project examples. Attendees will have the opportunity to interact with each
other and with the presenter.  They will gain an understanding of adapting,
tailoring and optimally applying CM at the system level to hardware,
software, and facilities.  

The tutorial will provide details answers to: What is Configuration
Management? 
•	A discipline applying technical and administrative direction and
surveillance to:
–	Identifying and documenting system configurations and their physical,
functional, and performance characteristics 
–	Baselining those characteristics
–	Controlling changes to those baselined characteristic
–	Providing status on those characteristics
–	Conducting audits on those characteristics
•	The CM tasks that produce these results are:
–	Configuration Identification
–	Configuration Control
–	Configuration Status Accounting
–	Configuration Audits 

Why Configuration Management? 
•	CM ensures that the current configuration of items are known throughout
their lifecycle
•	CM ensures that changes to the configuration of evolving items are
correct, controlled, managed, and documented
•	CM helps manage complexity, interface dependencies, increases security,
and recovery from errors

Contents of course:
•	Introduction 
•	Configuration Management Concepts  
•	Configuration Management in Detail 
•	Tailoring Configuration Management 
•	Points to Remember
•	References / Suggested Reading
•	Questions / Answers / Discussion 
•	Contact Information

Provide students with an understanding of:
•	Configuration Management 
•	Importance of CM
•	Identification of Configuration Items 
•	Baselines
•	Controlling Changes to Baselines
•	Configuration Control Boards
•	Classes of Changes
•	Conducting Impact Assessments on Requested Changes
•	Configuration Status Accounting 
•	Configuration Management Audits
–	FCA
–	PCA
•	CM Roles and Responsibilities of Stakeholders
•	CM Relationships between Acquirer  and Supplier
•	CM Relationships between programs, projects and subcontractors 
•	Tailoring CM"
}

@INPROCEEDINGS{AlAb0000:Techniques,
AUTHOR="Ibrahim {Al Abdulmohsin}",
TITLE="Techniques and Algorithms for Access Control List Optimization",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="Access control lists are core features of today’s internetwork routers.
They serve several purposes, most notably in filtering network traffic and
securing critical networked resources. However, the addition of access
control lists increases packet latency due to the overhead of extra
computations involved. This paper presents simple techniques and algorithms
for optimizing access control lists that can reduce significantly expected
packet latencies without sacrificing security requirements. These
techniques and algorithms can be implemented either fully or partially,
both online and offline, based on the amount of overhead allowed. It also
outlines analytically and statistically where and why the greatest bulk of
optimization lies."
}

@INPROCEEDINGS{AlAb0711:Frequency,
AUTHOR="Khalfan Al-Abdouli and Saleh Al-Araji and Mahmoud Al-Qutayri and Arafat
Al-Dweik",
TITLE="Frequency Synthesizer using {TDTL} with Enhanced Performance",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="656-659",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Frequency; synthesizer, tanlock, loop",
ABSTRACT="An enhanced frequency synthesizer using a first order time delay tanlock
loop (TDTL) is proposed in this work. Two adaptation mechanisms are
introduced to improve the performance of the synthesizer. The first method
is used to compensate for the errors that resulted from the division
process within the loop. The other adaptation technique is targeted at
improving the locking performance of the loop. The later method is based on
sensing the frequency at an earlier stage so that the error signal can be
adapted for any frequency disturbance. The new developed synthesizer offers
rapid acquisition and improved tracking performance over a wide locking
range."
}

@INPROCEEDINGS{AlAd0712:Study,
AUTHOR="Maan Al-Adwany",
TITLE="A Study on Cell Capacity in {WCDMA} \& {TDMA} Systems",
BOOKTITLE="IEEE International Workshop on Radio-Frequency Integration Technology",
ADDRESS="Singapore, RASA Sentosa Resort, Singapore",
PAGES="261-264",
DAYS=9,
MONTH=dec,
YEAR=2007,
KEYWORDS="WCDMA; TDMA; capacity; simulation.",
ABSTRACT="Abstract: In this paper we have studied the possibility of increasing
mobile communication cell capacity through merging two communication
systems in one cell. We suppose that the two systems must have interference
immunity from each other, so they can work separately in the same cell and
hence the overall cell capacity would be the sum of the two systems’
users. The two candidates are: the TDMA system, and the WCDMA system. The
two basic baseband systems have been built and simulated using MATLAB. From
the simulation results, it is concluded that the two systems can work in
one cell to increase cell capacity; but with partially sacrificing in the
two systems’ BER."
}

@INPROCEEDINGS{Alai0707:Optimization,
AUTHOR="Mona Alaiwy and Fatema Alaiwy and Sami Habib",
TITLE="Optimization of Actors Placement within Wireless {Sensor-Actor} Networks",
BOOKTITLE="12th IEEE Symposium on Computers and Communications",
ADDRESS="Aveiro, Portugal",
DAYS=1,
MONTH=jul,
YEAR=2007,
ABSTRACT="Wireless sensor-actor networks (WSANs) refer to a group of sensors and
actors linked by wireless medium to perform distributed sensing and acting
tasks. The main communication paradigm in WSANs is based on the
sensor-actor coordination. Appropriate actions corresponding with the
sensed phenomenon cannot be performed unless an event’s information is
transmitted from sensors to actors. One of the main requirements of
sensor-actor communication in WSANs is the real-time requirement. Despite
the importance of real-time communications in WSANs, to date no significant
solution exists for this problem. This paper examines the placement of
actors with respect to a real-time communication constraint in the WSANs.
We have proposed a Genetic Algorithm (GA) with an objective function
consists of main term: the communication delay and two competitive terms:
cost and accuracy. Our simulation results show that our proposed search
technique provides cost effective and accurate solutions for the placement
of actors with WSAN when it is densely deployed sensors."
}

@INPROCEEDINGS{AlAm0000:Experimental,
AUTHOR="Abdullah {Al Amin} and Mitsuru Takenaka and Takuo Tanemura and Katsuhiro
Shimizu and Ryo Inohara and Kohsuke Nishimura and Masashi Usami and Yutaka
Takita and Yutaka Kai",
TITLE="Experimental Validation of Deflection Routing in a 3-Node Optical Burst
Core Network with 40Gb/s Edge Nodes",
BOOKTITLE="ECOC 2007 - 33rd European Conference and Exhibition on Optical
Communication",
ADDRESS="Berlin, International Congress Center (ICC), Germany, Germany",
DAYS=16,
MONTH=sep,
YEAR=2007,
KEYWORDS="Optical burst switching, deflection routing, edge node, frame loss ratio",
ABSTRACT="We demonstrate deflection routing for random burst collision in a 3-node
optical burst switching network testbed. Using a Ether-frame capable burst
edge node, layer 2 characterization was performed, with near-theoretical
low frame error at 40Gb/s."
}

@INPROCEEDINGS{Alam0701:Narrowcasting—,
AUTHOR="Sabbir Alam and Michael Cohen and Ashir Ahmed",
TITLE="Narrowcasting— Controlling Media Policy in {SIP} Multimedia Conferencing",
BOOKTITLE="2007 IEEE Consumer Communications and Networking Conference - Multimedia
Networking Track",
ADDRESS="Las Vegas, NV, USA",
DAYS=11,
MONTH=jan,
YEAR=2007,
ABSTRACT="Media and the vectors of its transmission is private information and should
be made available only to authorized participants in a conference. In a
traditional conference system, participants’ voices might by default
be shared with all others, but a participant might want to select a subset
of the conference members to send his/her media to or receive streams from.
We review the concept of narrowcasting, a technique for limiting such
information streams in a multimedia conference, and propose manipulation of
media policies in centralized conferencing systems in a SIP framework. This
system allows each participant to flexibly select another participant or
group of participants for media transmission using existing standard
protocol (SIP) for configuring fine-grained narrowcasting sessions."
}

@INPROCEEDINGS{Alam0701:Proposed,
AUTHOR="Muhammad Alam",
TITLE="Proposed Techniques to Dimension a {Push-To-Talk} over Cellular Server",
BOOKTITLE="2007 IEEE Consumer Communications and Networking Conference - Demonstration
Proposals",
ADDRESS="Las Vegas, NV, USA",
DAYS=11,
MONTH=jan,
YEAR=2007,
ABSTRACT="We propose relations to provide access priority to special PoC
(Push-to-talk over Cellular) sessions based on available Transmit/Receive
Units (TRU) and threshold level. A simple relation to control the PoC
session timer is proposed. Finally, the derivation of maximum number of
allowable simultaneous session is depicted using two state Markov models. A
PoC controller can benefit from these optimal methods of our work during
busy hour.  Work is at hand to fine-tune the models to test by simulating
an IP Multimedia Subsystem (IMS) environment with the proposed optimization
techniques in order to provide efficient PoC services to the IMS terminals.
(POSTER PRESENTATION)"
}

@INPROCEEDINGS{Alam0703:Analysis,
AUTHOR="Sadaf Alam and Jeremy Meredith and Jeffrey Vetter",
TITLE="Analysis of a Computational Biology Simulation Technique on Emerging
Processing Architectures",
BOOKTITLE="The Sixth IEEE International Workshop on High-Performance Computational
Biology",
ADDRESS="Long Beach, California, USA",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="Multi-paradigm, multi-threaded and multi-core computing devices available
today provide several orders of magnitude performance improvement over
mainstream microprocessors. These devices include the STI Cell Broadband
Engine, Graphical Processing Units (GPU) and the Cray
massively-multithreaded processors—available in desktop computing systems
as well as proposed for supercomputing platforms. The main challenge in
utilizing these powerful devices is their unique programming paradigms.
GPUs and the Cell systems require code developers to manage code and data
explicitly, while the Cray multithreaded architecture requires them to
generate a very large number of threads or independent tasks concurrently.
In this paper, we explain strategies for optimizing a molecular dynamics
(MD) calculation that is used in bio-molecular simulations on three
devices: Cell, GPU and MTA-2. We show that the Cray MTA-2 system requires
minimal code modification and does not outperform the microprocessor runs;
but it demonstrates an improved workload scaling behavior over the
microprocessor implementation. On the other hand, the substantial porting
and optimization efforts on the Cell and the GPU systems result in a 5x to
6x improvement, respectively, over a 2.2 GHz Opteron system."
}

@INPROCEEDINGS{Alam0703:Path,
AUTHOR="Sadaf Alam and Pratul Agarwal",
TITLE="On the path to enable multi-scale biomolecular simulations on Petaflop
supercomputer with multi-core processors",
BOOKTITLE="The Sixth IEEE International Workshop on High-Performance Computational
Biology",
ADDRESS="Long Beach, California, USA",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="Biological processes occurring inside cell involves multiple scales of time
and length; many popular theoretical and computational multi-scale
techniques utilize biomolecular simulations based on molecular dynamics.
Till recently, the computing power required for simulating the relevant
scales was even beyond the reach of fastest supercomputers. The
availability of petaflops-scale computing power in near future holds great
promise. Unfortunately, the bio-simulations software technology has not
kept up with the change in hardware. In particular, with the introduction
of multi-core processing technologies in systems with tens of thousands of
processing cores, it is unclear whether the existing biomolecular
simulation frameworks will be able to scale and to utilize these resources
effectively. While the multi-core processing systems provide higher
processing capabilities, their memory and IO subsystems are posing new
challenges to application and system software developers. In this study, we
characterize computation, communication and memory efficiencies of
bio-molecular simulations on the Cray XT3 system with dual-core Opteron
processors. We demonstrate that the application efficiencies using the
multi-core processors reduce with the increase of the simulated system
size. Further, we measure the communication overhead of using both cores in
the processor simultaneously and identify that the MPI communication
performance can be as low as 50\% as compared to the single-core execution
times. We conclude that not only the biomolecular simulations need to be
aware of the underlying multi-core hardware in order to achieve maximum
performance but also the system software needs to provide processor and
memory placement features in the high-end systems. Our results on a
stand-alone dual-core AMD system confirm that combinations of processor and
memory affinity schemes can result in over 10\% performance gains."
}

@INPROCEEDINGS{Alam0705:Haptic,
AUTHOR="Atif Alamri and Mohamad Eid and Rosa Iglesias and Abdulmotaleb {El Saddik}
and Shervin Shirmohammadi and Edward Lemaire",
TITLE="Haptic Exercises for Measuring Improvement of {Post-Stroke} Rehabilitation
Patients",
BOOKTITLE="Workshop on Medical Measurements and Applications",
ADDRESS="Warsaw, Poland",
DAYS=4,
MONTH=may,
YEAR=2007,
ABSTRACT="Rehabilitation exercises supervised by Occupational Therapists (OTs),
involve applying task-oriented forces to the injured/disabled area to
regain, for instance, strength and range of motion. Haptic interfaces have
shown clear benefits in imitating therapists’ exercises with the
possibilities of position, grasping angles and force capturing. In this
paper, we present two haptic-based virtual reality exercises for stroke
patients undergoing rehabilitation to recover all, or some, of their lost
hand functions. The two exercises, the squeeze ball exercise and the maze
exercise, were implemented using the CyberForce system. The squeeze ball
exercise helps patients recover the action of hand grasping whereas the
maze exercise aims at increasing the steadiness of the patient’s
movement. Our measurements of these exercises show that we can continuously
evaluate the patient’s improvement."
}

@INPROCEEDINGS{Alam0706:Near,
AUTHOR="Osamah Alamri and Jin Wang and Soon Xin Ng and Lie-Liang Yang and Lajos
Hanzo",
TITLE="{Near-Capacity} Transceiver Design Using {EXIT-Curve} Fitting:
{Three-Stage} Turbo Detection of Irregular Convolutional Coded Joint
{Sphere-Packing} Modulation and {Space-Time} Coding",
BOOKTITLE="ICC 2007 Wireless Communications Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="Conventional two-stage turbo-detected
schemes typically suffer from a Bit Error Rate (BER) floor, preventing
them from achieving infinitesimally low BER values, especially, when
the inner coding stage is of non-recursive nature. We circumvent this
deficiency by proposing a three-stage turbo-detected Sphere Packing
(SP) aided Space-Time Block Coding (STBC) STBC-SP scheme, where a
rate-1 recursive inner precoder is employed to avoid having a BER
floor. The convergence behaviour of this serially concatenated scheme
is investigated with the aid of 3D Extrinsic Information Transfer
(EXIT) Charts. Furthermore, the capacity of the STBC-SP scheme is
shown and an algorithm is proposed for calculating a tighter
upper bound on the maximum achievable bandwidth efficiency. The
proposed three-stage turbo-detected scheme operates within about
$1.0$~dB of the capacity and within $0.5$~dB of the maximum achievable
bandwidth efficiency limit."
}

@INPROCEEDINGS{Alam0707:Narrowcasting,
AUTHOR="Sabbir Alam and Michael Cohen and Ashir Ahmed",
TITLE="Narrowcasting: Implementation of Privacy Control in {SIP} Conferencing",
BOOKTITLE="ICME'07 - Multimedia Systems and Applications Track",
ADDRESS="Beijing, P.R. China",
DAYS=2,
MONTH=jul,
YEAR=2007,
ABSTRACT="In a traditional conferencing system, participants’ voices might
by default be shared with all others, but a participant might
want to select a subset of the conference members to send
his/her media to or receive streams from. In this article, we
implemented the concept of narrowcasting, a technique for
limiting such information streams in a multimedia conferences,
as a class of policies, prototyping a system using existing
standard session initiation protocol (SIP) methods for
controlling fine-grained narrowcasting sessions."
}

@INPROCEEDINGS{Alam0711:Serial,
AUTHOR="Tariq Alamri and Saleh Alshebeili and Mourad Barkat",
TITLE="Serial Acquisition of {DS-CDMA} Signals Using Smart Antennas and Adaptive
Thresholding Constant False Alarm Rate Processing",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="468-471",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Adaptive threshold; CFAR; code-division multiple-access (CDMA); pseudonoise
(PN); smart antennas.",
ABSTRACT="This paper proposes an adaptive pseudonoise (PN) code acquisition system
that adopts smart antennas and a cell averaging constant false alarm rate
(CA CFAR) processor to achieve reliable PN code acquisition in the presence
of fading and interference. Hence, the decision threshold is adjusted
according to the varying environment in order to improve the detection
performance. The performance of the proposed system has been assessed
theoretically by deriving closed form expressions for the probability of
detection and probability of false alarm. The mean acquisition time is also
obtained, and simulation results have been presented to verify the derived
theoretical analysis."
}

@INPROCEEDINGS{AlAn0000:Challenge,
AUTHOR="Mansour Al-Anazi",
TITLE="Challenge of Setting the electricity Tariff structure in Saudi Arabia",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="determining the required revenue (RR) for a regulated electricity firm is a
pivotal component of tariff setting. It reflects also the tariff level that
end-customer pays. There are several factors that should be established to
determine the RR for regulated entities. An essential factor is the allowed
rate of return. Electricity Cogeneration Regulatory Authority (ECRA) has
selected the most commonly used approach which reflects the appropriate
weights for the firm's cost of equity and debit. This approach is adopted
in what is known as the Weighted Average Cost of Capital (WAAC). A WACC was
calculated for each of the electricity industry major activities i.e.
generation, transmission, and distribution, for the Kingdom of Saudi
Arabia."
}

@INPROCEEDINGS{AlAn0000:Investigation,
AUTHOR="Kifah AlAnsari",
TITLE="Investigation of Atmospheric Gases Attenuation in {UAE}",
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="This paper presents the first results of atmospheric gases attenuation
statistics in the UAE (United Arab Emirates) for a period of 14 years
(1990-2003). Six sites have been considered for this study using
meteorological surface data (Abu Dhabi, Dubai, Sharjah, Al-Ain, Ras
Al-Khaimah and Al-Fujairah). Upper air (radiosondes) data were available at
one site only, Abu Dhabi airport, which has been considered for gases
attenuation calculations using Line-by-line method. Hourly averages of
slant path gases attenuation are obtained. Cumulative distributions are
provided as well."
}

@INPROCEEDINGS{Alan0703:Time,
AUTHOR="Nasser Alani and Noor Aldin and Laith Kharbully",
TITLE="{Time-Varying} Cellular Neural Networks Analog Realization",
BOOKTITLE="Asia Modelling Symposium 2007",
ADDRESS="Phuket, Thailand",
DAYS=27,
MONTH=mar,
YEAR=2007,
ABSTRACT="Abstract:
Due to the intimate relationship of Cellular Neural/Nonlinear Network (CNN)
paradigm with image processing, where the practical applications of the CNN
algorithms advanced recently of intelligent scanning/printing, adaptive
resolution enhancement, complex image analysis, and multimedia image
compression, this paper proposed a full details of the analogue design
methods and implementation of a programmable time-varying cellular neural
networks for optimization and image processing applications. We proposed
the CNN to be used for MPEG where  the first 4 steps, namely the color
transformation, the motion estimation, the discrete cosine transform, and
the quantization can be implemented on a CNN. These steps, especially
motion estimation, require a huge amount of computation, so they are very
time-consuming on traditional digital hardware, but can be speeded up due
to the highly parallel nature of the CNN.
The time-varying is hardware annealing which is a paralleled version of
fast mean-field annealing in analogue networks. It is highly efficient in
finding globally the optimal solutions for cellular neural networks, where
the network is of the lowest level of it's energy function. Such a
technique is proper for optimal choice of quantization.
The design and implementation of a programmable cellular neural network is
based on the application of CMOS amplifier with continuously programmable
gain is presented. The time-varying of CNN cell is embedded in the network
by varying the cell gain. Both the voltage-mode and current-mode are
implemented to have an idea of cost and speed in our implementation
decision. The adjustable amplifier gain that used for this function
combines an active input and a regulated cascade output. It offers a high
accuracy over an input current range. The analytical formulas for
determination the values of designable parameters as a transistor sizes and
component values are illustrated by an example.
For voltage-mod, the summing of output and input signals is therefore
realized by using multiple-input transconductance amplifier MiOTA. The
circuit consists of several NMOS two-transistor inputs connected in
parallel to the PMOS current mirror. If the gain of the current mirror is
equal to 1 then the output current Io is equal to the difference of the
input currents of odd number inputs (left-hand side of the circuit) and the
input currents of even number inputs (right-hand side of the circuit). In
each two transistor input structure, the lower transistor operates in
linear range and the upper one in the saturation range. It sinks an output
current, which is a linear function of the input voltage and has a
transconductance which is controlled by the bias voltage. The main block of
cell blocks diagram is the multiplier one that performs the annealing by
applying the neurone gain, which is assumed to be the same for all network
for simplicity of implementation. An OTA is used to achieve that, which
converts a differential input voltage (state voltage) to a differential
output current, converted to output voltage, and connected to the next
stage, while is the piecewise linear block. To achieve the nonlinear
transformation of the PWL function, a CMOS amplifier of a single input
differential output current is introduced.

For current-mod, the fundamental blocks scheme of cell circuit is the same
as that of voltage-mod. All the cell signals are expressed as current
quantities, which is the main benefits of using the current-mod analog
realization.  
The summing block in current-mode can be realized by a current node, at
which the collected signals will be the input current of integration block.
For a constant cell gain, the integration block can be realized by
cascading two current-current converters. Depending on the scaling factor S
and the aspect ratios W/L one can design the circuit amplifier. To overcome
the range of maximum current value, the size of transistors of integrator
block must be S times the size of transistors of other blocks. PWL block is
realized by cascading two current-current converters. Transistors size is
taken according to the calculation of transistors transconductance. The
upper and lower limits of the PWL output characteristic is confined within
? IQ. To get the required transformation the gain of the linear region must
be unity. The synapses weight consists of a number of current-current
converter are used to realize the feedback template parameters. Each one of
these parameters is realized by one current-current converter with an
aspect ratio of the devices of current-current converter depending on the
template parameter value."
}

@INPROCEEDINGS{Alan0710:Multicast,
AUTHOR="Olli Alanen",
TITLE="Multicast Polling and Efficient {VoIP} connections in {WiMAX} Networks",
BOOKTITLE="10th ACM-IEEE International Symposium on Modeling, Analysis and Simulation
of Wireless and Mobile Systems",
ADDRESS="Chania, Crete Island, Greece",
DAYS=22,
MONTH=oct,
YEAR=2007,
KEYWORDS="WiMAX, 802.16, Multicast polling, VoIP, QoS, NS-2",
ABSTRACT="IEEE 802.16 standard defines the wireless broadband access network
technology called WiMAX. WiMAX introduces several interesting advantages,
and one of them is the support for quality of service (QoS) at the MAC
layer. There are several
features that support the BS to achieve the QoS guarantees, and one of them
is multicast polling. The specification, however, does not define very
exactly how this optional technique should be used. We propose a solution
on how to use this feature on the base stations and also an addition to the
specification, to serve several delay requirements. To test the proposed
solution, we run several simulation scenarios in the NS-2 simulator.
Especially VoIP (Voice over IP) is
considered as an application, since its tight delay requirements indicate
well the positive effect of multicast polling."
}

@INPROCEEDINGS{AlAn0712:Wireless,
AUTHOR="Adnan Al-Anbuky and David Grant",
TITLE="Wireless Microclimate Sensor",
BOOKTITLE="The third International Conference on Intelligent Sensors, Sensor Networks
and Information Processing - 2007",
ADDRESS="Melbourne, Australia, Australia",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="the paper discusses the development of wireless microclimate sensor. The
sensor forms the generic component of a microclimate Wireless Sensor
Network (WSN). The network is based on IEEE 802.15.4 low power wireless
protocol supported by ZigBee stack. The key objective of the network is to
support remote monitoring and management of large orchards. The designed
sensor together with a locally developed cell modem facilitate the main
components for defining a microclimate wireless sensor network that could
be accessed remotely  

The developed sensor takes care of the critical environmental sensing for
the horticultural application needs. It also takes care of energy
management and self-replenishment. Preliminary results of the design sensor
reflect good performance in coverage of large horticultural fields at a
reasonably low cost.  Five Sunlight hours a day would keep the sensor
functional through its storage mechanism. The architecture allows for both
power and location awareness. Identification of the field areas that
require attention could be made through either light emission or embedded
location awareness algorithm.  Range of view for the frost alarm system
would be in the region of 500 meters. Initial testing reflects promising
results. 

Keywords;Wireless Sensor Network; Microclimate Sensor; Environmental
Sensing; Remote Monitoring; Energy Harvesting;  Intelligent Sensors."
}

@INPROCEEDINGS{Alas0703:Microarchitectural,
AUTHOR="Jesus Alastruey and Teresa Monreal and Victor {Viñals} and Mateo Valero",
TITLE="Microarchitectural Support for Speculative Register Renaming",
BOOKTITLE="21st IEEE International Parallel \& Distributed Processing Symposium",
ADDRESS="Long Beach, California, USA",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="This paper proposes and evaluates a new microarchitecture for out-of-order
processors that supports speculative renaming. We call speculative renaming
to the speculative omission of physical register allocation along with the
speculative early release of physical registers. These speculative renaming
policies may cause a register operand not to be kept in the Physical
Register File (PRF). Thus, we add a low-ported Auxiliary Register File
(XRF) located outside the processor core that keeps the values absent in
PRF and supplies them at higher latency. To support the location of
register operands being either in PRF or XRF, we use virtual registers. We
consider omission and release policies directed by hardware prediction.
Namely, we will use a single Last-Use Predictor that directs both
speculative omission and release. We call this mechanism SR-LUP
(Speculative Renaming based on Last-Use Prediction). Two Last-Use predictor
designs of incremental complexity and performance are analyzed. In a
256-ROB, 8-way processor with an 80int+80fp PRF, SR-LUP with an 11-port
256int+256fp XRF, speeds up computations up to 11.5\% and 29\% for INT and
FP SPEC2K benchmarks, respectively. For FP benchmarks, if the PRF limits
the clock frequency, a conventionally managed 128int+128fp PRF can be
replaced using SR-LUP by a 64int+64fp PRF backed up with a 10-port
224int+224fp XRF, showing 19\% IPS gain."
}

@INPROCEEDINGS{Alas0709:Intelligent,
AUTHOR="Rafe' Alasem",
TITLE="Intelligent Active Queue Management Predictive Controller using Neural
Networks",
BOOKTITLE="International Conference and Exhibition on Next Generation Mobile
Applications, Services, and Technologies",
ADDRESS="Cardiff, Wales, United Kingdom",
DAYS=12,
MONTH=sep,
YEAR=2007,
KEYWORDS="Congestion Control, Active Queue Management (AQM), Random Early Detection
(RED), Smith Predictor, Neural Networks.",
ABSTRACT="Network traffic congestion, due to increasing number of Internet services
with various quality of service (QoS) demands, has become the focus of
current research. New effective congestion control mechanism is needed in
order to satisfy these constraints. In this paper, a novel scheme of
adaptive neural network based Smith Predictor (SP) controller is  for
active queue management (NNAQM) is presented. Smith predictor used to
overcome the disadvantages influence of time delay when it becomes
significant in large TCP/IP networks. The Back-Propagation algorithm is
used to train weights of  the neural networks. Simulation results show that
the method can improve the robust performance of the control system."
}

@INPROCEEDINGS{Alat0705:Adaptive,
AUTHOR="Jamal Alattar",
TITLE="Adaptive Mobile Spot Diffusing Transmitter for an Indoor Optical Wireless
Channel",
BOOKTITLE="11th Conference on Optical Network Design and Modelling",
ADDRESS="Athens, Greece",
DAYS=29,
MONTH=may,
YEAR=2007,
ABSTRACT="Adaptive approach is used to adjust the transmit power of each beam from a
multi-beam optical transmitter which produces a single line of diffusing
spots on the ceiling in an indoor environment based on information about
the quality of the received signal due to each spot. The system assumes a
feedback link between the optical transceivers. Diversity detection to
combat the degrading effect of the background noise in the channel is
employed with a 7-detectors angle diversity receiver. Both the optical
transmitter and the multi-branch receiver are fully mobile. The performance
of the system is evaluated for two weakest links and compared against that
of a non-adaptive spot diffusing transmitter. Our results show a
considerable gain of 12.95 dB in SNR with the adaptive transmitter when the
separation distance between the transceivers is largest in the case of a
non mobile transmitter and a 6.85 dB increase in SNR for the mobile
transmitter compared to the non-adaptive transmitter's scenario."
}

@INPROCEEDINGS{Alat0706:Adaptive,
AUTHOR="Jamal Alattar",
TITLE="Adaptive Beam Clustering Optical Wireless System for An Indoor Channel",
BOOKTITLE="ICC 2007 Optical Networks and Systems Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="The separating distance between the transceivers is one of the main factors
that affect the quality of the received optical signal as the receiver
changes locations in an optical wireless (OW) system. A beam clustering
method was proposed to improve the indoor OW channel's performance by
combating the degrading effects of multipath reflections. The method
involved transmitting binary data bits over two other clusters of beams
aimed at walls in addition to the one aimed at the ceiling. In this work,
we investigate a novel approach to further improve the signal quality on
reception using a proposed adaptive transmitter composed of three spot
diffusing sub-transmitters aimed at the same three directions as in the
beam clustering method. The receiver communicates with the transmitter and
sends tap weights (for transmit powers) to be used by the sub-transmitters
which optimises the signal reception based on the initial received pulses
at different locations. Performance comparison with results of a non
adaptive transmitter system is presented in terms of signal-to-noise ratio
(SNR), delay spread (DS) and path loss distributions for two receiver
types: 1) a single detector wide field-of-view (FOV) receiver and 2) a
multi-detector angle diversity receiver. Our results show a significant
improvement achieved with an SNR gain of 18 dB compared with the
conventional diffuse system and a 6 dB SNR gain without transmitter
adaptability. Therefore, at the expense of moderate computations, the use
of an adaptive multi-beam clustering transmitter is promising and can
enhance the optical signal reception to suit user mobility requirements."
}

@INPROCEEDINGS{Alat0712:Impact,
AUTHOR="Mikko Alatossava and Harri Pennanen and Velli-Matti Holappa and Juha
Ylitalo",
TITLE="The Impact of Noise Threshold Setting on Estimated Radio Channel Parameters
and {BER}",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
PAGES="106-109",
DAYS=3,
MONTH=dec,
YEAR=2007,
ABSTRACT="Channel modeling, in general, is based on the measured
and analyzed channel parameters. However, the obtained
parameter values may depend significantly on the way we analyze
the measured radio channel data. In this paper the effect of
noise threshold setting on channel parameters is investigated.
Two different threshold selection criteria are compared: one with
a measured threshold and another which allows a maximum
of 20 dB dynamic range. Furthermore, the effect of threshold
setting to the bit error rate (BER) performance is examined. The
results with different noise thresholds show significant difference
especially in the BER performance.


I. INTRODUCTION

Technologies applied for future communication systems
depend on performance investigations, such as bit error rate
(BER) simulations. The accuracy of the link level simulations
is crucial in determining, e.g., the best possible transmission
technique. The validity of the simulation describing a realistic
link scenario, on the other hand, depends strongly on the
applied channel model in the simulator. This study aims at
investigating how heavily the performance results depend on
certain analysis methods employed already in the channel
modeling stage.
To our knowledge, the study approach of this paper including
the BER performance analysis, has not been presented
before. In [1], the authors find that the effect of using different
analytical and geometry-based channel models on the symbol
error rate is significant. However, in [1], the whole channel
model used in the simulations is replaced by another one. In
this study the aim is, instead of replacing the whole model,
to use IST-WINNER channel model (WiM) [2]-[3] and to vary
some parameters that depend on the method applied in noise
threshold setting. Furthermore, in [4] the author investigates
different analyzing methods with respect to fading depths.
Direct impact to BER was, however, not investigated.
This paper is organized as follows: First the measurement
setup is presented together with the equipment. Next, the noise
threshold setting methods are explained. Finally results are
shown and conclusions are drawn.


II. MEASUREMENT EQUIPMENT AND SETUP

Propsound CSTM, [5], was used to measure the radio
channel. This measurement was conducted using single-input
single-output (SISO) channel. The scenario was outdoor-to-indoor case in
urban micro cellular environment of the university of Oulu. Base station
(BS) was located in three different spots and the mobile indoor
antenna was mounted in a trolley and it was moved inside the
building in different floors and along different wall materials.


III. NOISE THRESHOLD SETTING

In this paper, two different threshold setting methods for declaring a
path as ”effective”, are considered. Only the ”effective” paths
is taken into account in the calculation of the channel model
parameters such as delay spread.
First method is applied in [6], where the analysis results are
extracted from the measured data after ignoring all the paths
whose power is at least 20 dB lower than the peak path’s
power in a certain CIR. This method is denoted as ”Peak”
method in the rest of the paper.This method is justified with
a fact that generally receivers do not benefit from multipath
components that have significantly less power than the peak
path’s power. In [7], the importance of a channel model’s accuracy is
emphasized. A model should always describe the channel more
accurately than the receiver is assumed to take advantage of.
If the dynamic range of the model is only 20 dB, a part of
the CIR which has an effect to the receiver might get lost.
Hence, another approach applied in this paper is to select
the threshold for effective paths 6 dB above the noise level
calculated with (1). In the following this method is denoted
as ”Noise” method.


IV. RESULTS

It can be noticed that RMS DS is significantly larger with the Noise
method. This is due to the fact that more paths are allowed
to be taken into account in each CIR and, therefore, larger
delays occur. 

No large differences can be seen in path loss analysis due to the fact that
paths below 20 dB do not contribute strongly in the received power.
However,
the path loss exponent is noticeably different between the two
cases. This is because the amount of paths observed
at the receiver in long distances compared to short distances
decreases relatively more in the Noise method than in the Peak
method and, hence, the received power variation is larger as
well.

The impact on the BER is especially interesting because this
has a direct impact on the performance simulations, which
gives guidelines to standardizations organizations. BERs are
extracted from two monte carlo simulation runs of a link level
performance simulator which applies, in turns, the channel
model parameters obtained with the two different modeling
methods. 2 dB difference in the error level of 10^(−2) is present in
favor of the Noise method. As the SNR increases, the difference between
the
methods increases as well. With more relatively strong paths,
the diversity of the channel can be more efficiently exploited
in the receiver. Since the number of paths is larger in the Noise method,
the decrease in the occurrence of the errors
and improvement in the system performance is clearer in the
Noise method than in the Peak method. 


V. CONCLUSION

In this paper, the results obtained from outdoor-to-indoor
measurements analyzed with two different methods of setting
the threshold, one applying 20 dB cut from the power of the
peak path and another which employs a cut at 6 dB from
the noise level, are presented. The results showed significant
variation in temporal domain parameters such as RMS delay
spread. The difference in BER performance was surprisingly
large which indicates that relatively small differences in radio
channel characterization and modeling methods can have
strong impact on link level performance simulation results. As
a conclusion we state that in order to create realistic channel
models, the dynamic range of the measured impulse responses
in the radio channel characterization have to match the dynamic
range of the radio channel model under development.


ACKNOWLEDGMENT

This work has been performed in the framework of the
IST project IST-4-027756 WINNER II, which is partly funded
by the European Union. The work of Mikko Alatossava was
supported by Tekniikan edistämissäätiö, Kaupallisten ja teknillisten
tieteiden tukisäätiö and Oulun yliopiston tukisäätiö.

REFERENCES

[1] C. Oestges, H. Özcelic, and E. Bonek, “On Practical Use of
Analytical
MIMO Channel Models,” in Proceedings of IEEE Antennas and Propagation
Society International Symposium, July, 2005, pp. 406–409.
[2] T. Jämsä, J. Meinilä, P. Ky¨osti, D. Laselva, H. El-Sallabi, J.
Salo,
C. Schneider, and D. Baum, “IST-2003-507581 WINNER D5.4. v.1.4,
Final Report on Link and System Level Channel Models,” IST-WINNER,
Tech. Rep., 2005.
[3] H. El-Sallabi, D. Baum, P. Zetterberg, P. Kyosti, T. Rautiainen, and
C. Schneider, “Wideband Spatial Channel Model for MIMO Systems at
5 GHz in Indoor and Outdoor Environments,” in Proceedings of 63th
Vehicular Technology Conference, April, 2006.
[4] F. D. Cardoso and L. M. Correia, “A Comparison Between Different
Approaches for Fading Evaluation in Wideband Mobile Communications,”
in Proceedings of the 57th IEEE Semiannual Vehicular Technology
Conference, April, 2003, vol. 2, pp. 1046–1050.
[5] L. Hentilä, P. Kyösti, J. Ylitalo, X. Zhao, J. Meinilä, and J.-P.
Nuutinen,
“Experimental Characterization of Multi-Dimensional Parameters at 2.45
GHz and 5.25 GHz Indoor Channels,” Proceedings of Wireless Personal
Multimedia Communications, September 2005.
[6] P. Kyösti, “IST-4-027756 WINNER II D1.1.1 v.1.0, WINNER II Interim
Channel Models,” IST-WINNER II, Tech. Rep., 2006.
[7] L. Correia, COST 259 Final Report, ”Wireless Flexiple
Communications”.
John Wiley \& Sons Ltd., 2001, 462 p.
[8] S. R. Saunders, Antennas and Propagation for Wireless Communication
Systems. John Wiley \& Sons, Ltd, 1999, 409 p."
}

@INPROCEEDINGS{AlAw0703:Mapping,
AUTHOR="Jasem Al-Awadhi",
TITLE="Mapping the land degradation hazard in Kuwait: using {GIS} and Delphi and
{AHP} methods",
BOOKTITLE="Asia Modelling Symposium 2007",
ADDRESS="Phuket, Thailand",
DAYS=27,
MONTH=mar,
YEAR=2007,
ABSTRACT="Land degradation indicators in Kuwait are identified in the form of soil
erosion by wind and water, soil deterioration, soil salinization and soil
contamination by oil. In the present study, an attempt was made to produce
a hazard map for land degradation by integrating a Landsat image of March
2001 and nine maps, presenting physical environment of Kuwait, in a
Geographic Information System (GIS). These maps, considered as criteria for
rating the degree of land degradation hazard, are: (1) surface sediment,
(2) drift potential sand, (3) topography, (4) soil, (5) vegetation, (6)
land-use, (7) iso-salinity contour, (8) natural drainage, (9) salinized
areas. Delphi, using expert knowledge acquisition techniques, and Analytic
Hierarchy Process (AHP) were applied to determine the relative
contributions of the above criteria to land degradation. 

All the maps were digitized, registered and geo-referenced in GIS software
(GeoMedia). Starting with a digital map of Kuwait, geo-referenced on a UTM
coordinate system, a 2x2 km grid was generated . Each of the grid cells,
being an area feature, represented a record in the underlying database
covering the area of the cell. Production of a map for land degradation
hazard in Kuwait was achieved by combining the reclassified raster layers
(maps presenting the triggering factors) and by applying GIS-suitability
developed model of land degradation as follow.
    PLDHZ = SUM(i=1-n)[0.41X1i+0.3X2i+0.15X3i+0.1X4i+.04X5i    (1)
where: 
PLDHZ = land degradation hazard degree 
n  = number of generated grid cells; equal to 4639
X1 = wind erosion factor 
X2 = water erosion factor
X3 = soil deterioration factor
X4 = salinity factor
X5 = soil pollution by oil factor
 

The resulting map indicates that very high, high, moderate and low degree
of land degradation hazard in Kuwait constitutes about 15, 36.6, 35 and
13.4\%, respectively."
}

@INPROCEEDINGS{Alaw0703:Power,
AUTHOR="Basel Alawieh and Chadi Assi and Wessam Ajib",
TITLE="A Power Control Scheme for Directional {MAC} protocols in {MANET}",
BOOKTITLE="IEEE Wireless Communications and Networking Conference 2007 - Phy / MAC",
ADDRESS="Hong Kong, Hong Kong",
DAYS=11,
MONTH=mar,
YEAR=2007,
ABSTRACT="Higher throughput gains and prolonged life time
can be achieved for mobile ad hoc networks (MANET) with
nodes equipped with Directional antennas. The employment of
directional antennas can enhance the spatial reuse by allowing
concurrent communications to occur within the same vicinity.
Another advantage of directional antennas is the higher gain
resulted from its directivity, which can be utilized to reduce
the transmission power during a directional transmission. In
order to maximally utilize the throughput and energy gains from
directional antennas, we propose in this paper a transmission
power control scheme for directional medium access protocol
(MAC) protocols. The proposed scheme can be integrated to
any directional MAC protocol that adopts a single channel
for transmission and reception of IEEE 802.11 frames. The
proposed power control scheme exploits the temporal directional
transmission power correlations that exist between the IEEE
802.11 frames (RTS/CTS/DATA/ACK) for successful communication
with consideration to directional operational access
problems such as hidden terminal problems, deafness and side
lobe interference. Simulation results for different topologies are
used to demonstrate the significant throughput and energy gains
that can be obtained under the investigated scheme."
}

@INPROCEEDINGS{Alaw0707:Delivering,
AUTHOR="Basel Alawieh and Hussein Mouftah",
TITLE="Delivering Multicast Services over {MPLS} Infrastructure",
BOOKTITLE="12th IEEE Symposium on Computers and Communications",
ADDRESS="Aveiro, Portugal",
DAYS=1,
MONTH=jul,
YEAR=2007,
ABSTRACT="The exponential growth in internet technology has challenged service
providers to provide multicast based services like broadcast TV, video on
demand and streaming music services over the broadband access
infrastructure to their end clients. In having Multi protocol Label
Switching (MPLS) as the core infrastructure protocol, providers are
motivated to keep this type of service reliable to their customers.  This
article presents a performance analysis for the transport of multicast
services across MPLS infrastructure networks. Multicast flows are carried
using Virtual Private LAN Services (VPLS) as transport media.  We further
investigate the performance and reliability of multicasting over VPLS and
compared with PIM interms of jitter and delay experimentally using our
Optical Networks Research Lab (ONRL) testbed."
}

@INPROCEEDINGS{Alaw0707:Modeling,
AUTHOR="Basel Alawieh and Chadi Assi",
TITLE="Modeling and Analysis of {Power-Aware} Ad hoc Networks with Directional
Antennas",
BOOKTITLE="12th IEEE Symposium on Computers and Communications",
ADDRESS="Aveiro, Portugal",
DAYS=1,
MONTH=jul,
YEAR=2007,
ABSTRACT="In this work, we study analytically the benefits of transmission
power control on throughput and energy consumption
in a uniformly distributed power-aware ad hoc networks
where nodes are equipped with directional antennas.
We construct an interference model for directional antenna
based on a honey grid model to calculate the maximum
interference. We further derive a directional collision
avoidance model and based on the integrated inteference/
collision model and Signal to Interference (SIR) requirements,
we present the maximum end-to-end throughput
under the maximum interference. We further investigate
the effect of collision on the energy consumption and propose
an energy consumption model that utilize all aspects
of energy wastage."
}

@INPROCEEDINGS{Alaw0708:Active,
AUTHOR="Khalid Alawfi",
TITLE="Active Queue Management Design and Development based on",
BOOKTITLE="International Workshop on Performance Modeling and Evaluation in Computer
and Telecommunication Networks (PMECT07)",
ADDRESS="Honolulu, Hawaii, USA",
DAYS=16,
MONTH=aug,
YEAR=2007,
KEYWORDS="Communication Networks, Congestion Control, Internet Traffic.",
ABSTRACT="Abstract- A congestion control mechanism is proposed, Correlation based
Random Early Detection, or CRED that exploits the fact that Internet
Traffic is often Long Range Dependent and Self Similar. It thus has a past
history that can be used to estimate the mean queue length in the not too
distant future. This enables CRED to detect the congestion degree status,
either increasing or decreasing, and react accordingly. It is demonstrated
that this can result in substantial performance gain when compared with
existing versions of RED. CRED shows lower delay with the same loss rate
and throughput and the mean queue length profile is more stable with light
or heavier congestion."
}

@INPROCEEDINGS{Alay0711:LSF,
AUTHOR="Faisal O. Alayyan and Yee {Hong Leung} and Abdelhak Zoubir",
TITLE="{LSF-CMA} Equalization Algorithm for {OFDM} System using {Zero-Padding}
Technique",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1475-1478",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="OFDM, CMA, MCMA, Adaptive blind equalization algorithm, GI-restoral
property.",
ABSTRACT="We introduce an adaptive channel equalization algorithm for orthogonal
frequency division multiplexing (OFDM)  employing high bandwidth-efficiency
quadratic amplitude modulation (QAM) signaling. Our approach uses the guard
band to yield a unique equalizer estimate through a least square fitting
(LSF) criterion. To refine the equalizer estimation, a combination of a LSF
and constant modulus algorithm (CMA) based equalizer  is proposed.  In
order to minimize the error of the overall structure,  a stochastic
gradient algorithm is implemented . It is shown that the proposed scheme is
superior and more robust in low signal to noise ratio (SNR) environments.
Simulation results demonstrate that using the combination scheme improves
adaptive channel equalization by increasing convergence rate and decreasing
the steady-state mean square error."
}

@INPROCEEDINGS{AlBa0704:Multi,
AUTHOR="Ayham Al-Banna and Joseph LoCicero and Donald Ucci",
TITLE="{Multi-Element} Adaptive Arrays for Interference Mitigation of Multiple
{Barker/CCK} signals in 802.11b {WLANs}",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="We analyze interference in the unlicensed ISM wireless band for IEEE 802.11
Barker-code spread and Complementary Code Keying spread Wireless Fidelity
signals and contrast the results to that of narrowband interferers. 
Multi-element adaptive antennas with tapped-delay-lines are used to
mitigate multiple interferers.  It is shown that the number of delay line
taps required to successfully mitigate the effect of multiple interferers
increases as the number of interferers and array elements increases."
}

@INPROCEEDINGS{AlBa0706:Capacity,
AUTHOR="Ali Al-Bashabsheh and Abbas Yongacoglu",
TITLE="On the Capacity Bounds of Undirected Networks",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="In this work we improve on the bounds presented in \cite{Li2004:1} for
network coding gain in the undirected case. A tightened bound for the
undirected multicast problem with three terminals is derived. An
interesting result shows that with fractional routing, routing throughput
can achieve at least \\%75 of the coding throughput. A tighter bound for
the general multicast problem with any number of terminals shows that
coding gain is strictly less than 2. Our derived bound depends on the
number of terminals in the multicast network and approaches 2 for
arbitrarily large number of terminals."
}

@INPROCEEDINGS{AlBa0712:Adaptive,
AUTHOR="Hussein Al-Bahadili and Ahmad {Rababa’a}",
TITLE="An Adaptive {Bit-Level} Text Compression Scheme Based on the {HCDC}
Algorithm",
BOOKTITLE="Mosharaka International Conference on Communications, Networking and
Information Technology",
ADDRESS="Amman, Jordan",
DAYS=6,
MONTH=dec,
YEAR=2007,
ABSTRACT="Abstract. In this paper we propose and evaluate the performance of a new
adaptive bit-level text compression scheme that is based on the HCDC
algorithm. The scheme consists of six steps some of which are repetitively
applied to achieve higher compression ratio. The repetition loops continue
until inflation detected and the accumulated compression ratio is the
multiplication of the compression ratios of the individual loops, therefore
we refer to the new scheme as HCDC(k), where k refers to the number of
repetition loops. In order to enhance the compression power of the HCDC(k)
scheme, a new adaptive encoding format is proposed in which a character is
encoded to binary according to its probability. This method of encoding
reduces the binary sequence entropy so that it grants higher compression
ratio. The scheme is implemented in C++ programming language and used to
compress a number of text files from standard corpora. The results obtained
demonstrate that the proposed scheme has higher compression power than many
widely used compression algorithms and it has a competitive performance
with respect to state-of-the-art programs. Finally, the results obtained
are discussed, conclusions are drawn, and recommendations for future works
are pointed out."
}

@INPROCEEDINGS{AlBa0712:Location,
AUTHOR="Hussein Al-Bahadili and Omar Al-Basheer and Amjad Al-Thaher",
TITLE="A Location Aided {Routing-Probabilistic} Algorithm for Flooding
Optimization in Mobile Ad Hoc Networks",
BOOKTITLE="Mosharaka International Conference on Communications, Networking and
Information Technology",
ADDRESS="Amman, Jordan",
DAYS=6,
MONTH=dec,
YEAR=2007,
ABSTRACT="In this paper we propose, and evaluate the performance of a new flooding
optimization algorithm, namely, the LAR-1P. It utilizes two well-known
flooding optimization algorithms, the location-aided routing scheme 1
(LAR-1) algorithm and the probabilistic algorithm. In this algorithm, when
receiving a broadcast message, a node within the requested zone
rebroadcasts the message with a pre-defined retransmission probability
(pt), and each node is allowed to rebroadcast received message only once.
In order to evaluate the performance of the new algorithm, a number of
simulations are performed using our mobile ad hoc network simulator
(MANSim). In these simulations, we investigate the effect of a number of
network parameters (e.g., node density, node average speed, and
retransmission probability, etc.) on some computed parameters (e.g., number
of retransmission, average duplicate reception, and reachability). The
results obtained are discussed and presented in tables and graphs. Finally,
conclusions are drawn and recommendations for future works are pointed out."
}

@INPROCEEDINGS{Albi0000:Architecture,
AUTHOR="Cristian Albina and Günther Hackl",
TITLE="Architecture optimization of a Finite Impulse Response Filter using
toggle-based power estimation",
BOOKTITLE="International Conference on Intelligent \& Advanced Systems 2007",
ADDRESS="Kuala Lumpur, Malaysia",
PAGES="41-44",
DAYS=25,
MONTH=nov,
YEAR=2007,
ABSTRACT="In this paper different methods of implementing finite impulse response
(FIR) filters are presented. The advantages and
disadvantages of several architectures and of the circuit modeling are
discussed using a standard toggle-based method for
the circuit power estimation, gate-level simulations and synthesis. . We
showed that we can achieve up to 60\% power
reduction from the beginning by carefully selecting the right architecture
and optimizing the VHDL code description of the
module. The analysis was made based on the unity delay model and not on the
physical extracted layout for a 150nm technology."
}

@INPROCEEDINGS{Albi0703:Structural,
AUTHOR="Fahd Albinali and Nigel Davies and Adrian Friday",
TITLE="Structural Learning of Activities from Sparse Datasets",
BOOKTITLE="5th Annual IEEE International Conference on Pervasive Computing and
Comunications",
ADDRESS="New York, USA",
DAYS=26,
MONTH=mar,
YEAR=2007,
ABSTRACT="A major challenge in pervasive computing is to develop systems that can
reliably recognize human activity patterns, such as bathing  from sensor
data. Typical sensor deployments generate sparse datasets with thousands of
sensor readings and  few instances of activities.  The imbalance between
the number of features  (i.e. sensors firing) and the classification
targets  (i.e. activities) complicates the learning process. In this paper,
we propose a novel framework for discovering relationships between sensor
signals and observed human activities from sparse datasets. The framework
builds on the use of Bayesian networks for modeling activities by
representing statistical dependencies between sensors. This allows us to
solve two key problems: firstly, how to automatically determine an
effective structure for a Bayesian network that recognizes a particular
activity without human intervention; and, secondly, we address the
pragmatic problem of sparse training data, where the data available to
train the activity recognizers is limited.  In our approach, we `learn' the
structure of the Bayesian networks automatically from the sensor data. We
optimize this process in 3 ways: firstly, we perform multicollinearity
analysis to focus on orthogonal sensor data with minimal redundancy.
Secondly, we propose Efron's bootstrapping to generate large training sets
that capture important features of an activity.  Finally, we find the best
Bayesian network that explains our data using a heuristic search that is
unbiased to the ordering between consecutive variables. We evaluate our
approach using a data set gathered from  MIT's PlaceLab. The inferred
networks correctly identify activities for 85\% of the time."
}

@INPROCEEDINGS{Albr0000:Restenosis,
AUTHOR="Peter Albrecht",
TITLE="The Restenosis Dilemma {–} Therapy Evolution from Angioplasty to
{Drug-Eluting} Stents",
BOOKTITLE="BMT 2007",
ADDRESS="Aachen, Germany",
DAYS=26,
MONTH=sep,
YEAR=2007,
KEYWORDS="Drug Eluting Stents - Implants",
ABSTRACT={Brief History of Stenting:In the first decade of use (1977-87),
interventional cardiologists gained experiences with angioplasty balloons.
Even if promising, further developments by the mid-80's led to miniaturized
devices like lasers, tiny {"}shavers{"}, rotational {"}polishers{"} The
First Stents:One such device was the stent -- a metal {"}mesh{"} mounted on
a balloon, later expanded inside the artery. In 1986, Puel and Sigwart
(France) inserted the first stent into a human coronary artery; in 1994 the
first stent was approved in the US. Over the next decade, several bare
metal stent generations were developed, being more flexible and easier to
deliver. Development of Drug-Eluting Stents:More and more, the solution
moved away from the purely mechanical devices of the 90's and toward
pharmacologic advances that were being made. The body's circulatory system
was used as a {"}highway{"} not only to deliver devices but also to deliver
medicines. Data gathered so far conclude that drug-eluting stents have been
extremely successful in reducing restenosis to single digits. A Glimpse to
the Future: Drug-eluting stents are still associated with subacute and late
thrombosis, and necessitate prolonged antiplatelet therapy. So novel
concepts for all three components - scaffolding, carrier, drug- are being
actively developed.}
}

@INPROCEEDINGS{AlDa0703:Semantic,
AUTHOR="David Al-Dabass",
TITLE="Semantic Mining Dynamics for Games Language Processing",
BOOKTITLE="Asia Modelling Symposium 2007",
ADDRESS="Phuket, Thailand",
DAYS=27,
MONTH=mar,
YEAR=2007,
ABSTRACT="This paper attempts to determine conditions for ‘recogniseability’ with
application to games language processing. In its broadest sense, a
biological reader of a string of characters has a ‘trial’ internal
model of the semantics of the lexical sequence being read. This internal
model generates its own lexical string which is compared with the observed
string. Errors between the two are fed back to the internal ‘semantic
generator’ to guide it to modify its lexical output closer to the
observed string. The process continues dynamically until convergence,
indicated by the observer ‘recognising’ the meaning of the seen string.
The theoretical foundations for this process are put forward and the
conditions for successful ‘observation’ using hybrid recurrent nets are
reviewed. Semantic mining architectures are formulated and consist of a
recurrent hybrid net hierarchy of multi-agents, extended such that the
composite behaviour of agents at any one level is determined by those of
the level immediately above."
}

@INPROCEEDINGS{AlDa0704:Secondary,
AUTHOR="Ashraf {Al Daoud} and Murat Alanyali and David Starobinski",
TITLE="Secondary Pricing of Spectrum in Cellular {CDMA} Networks",
BOOKTITLE="Second IEEE International Symposium on Dynamic Spectrum Access Networks
2007",
ADDRESS="Dublin, Ireland",
DAYS=18,
MONTH=apr,
YEAR=2007,
ABSTRACT="We consider secondary pricing of spectrum in wireless cellular
networks employing CDMA at the physical layer. We consider a
primary license holder who aims to lease its spectrum within a
certain geographic subregion of its own network. Such a
transaction has two contrasting economic implications for the
seller: On the one hand the seller obtains a revenue due to the
exercised price, or rent, of the region. On the other hand, the
seller incurs a cost due to (i) reduced spatial coverage of its
network and (ii) possible interference from the leased region into
the retained portion of its network. We formulate an optimization
problem with the objective of profit maximization, and
characterize its solutions based on a reduced load approximation.
The form of optimal prices suggests charging the buyer per
admitted call, in proportion with the interference it generates.
The charged amount balances the corresponding loss of revenue
incurred by the seller due to the influence of an admitted call.
We numerically argue that this pricing technique yields better
profit compared to simplistic techniques."
}

@INPROCEEDINGS{Alde0704:Study,
AUTHOR="Walid Aldeeb and Weidong Xiang and Paul Richardson",
TITLE="A Study on the Channel and {BER-SNR} Performance of Ultra Wide Band Systems
Applied in Commercial Vehicles",
BOOKTITLE="2007 IEEE Sarnoff Symposium",
ADDRESS="Princeton , NJ, USA",
DAYS=30,
MONTH=apr,
YEAR=2007,
ABSTRACT="The applications of ultra wideband (UWB) systems in commercial vehicles are
increasingly attracting attention recently. This paper aims to lay a solid
foundation for the use of UWB radio in vehicular environments by measuring
both intra-vehicle and inter-vehicle UWB channels. At first, a
comprehensive measurement campaign was conducted to gather a set of channel
impulse responses of UWB channels under several typical scenarios. The UWB
vehicular channel is analyzed and compared with the IEEE 802.15.3a indoor
model. Next, the bit error rate (BER) against signal to noise ratio (SNR)
curves of UWB systems applied in commercial vehicles are presented,
analyzed and compared to the performance of indoor UWB systems based on 
the IEEE 802.15.3a model."
}

@INPROCEEDINGS{AlDw0711:Dynamic,
AUTHOR="Arafat Al-Dweik and Ridha Hamila and Ziad Asghar",
TITLE="Dynamic Feedback Carrier Frequency Offset Estimator for {OFDM} Systems",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1043-1046",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="OFDM; carrier frequency offset; band-edge filters",
ABSTRACT="This paper presents an efficient dynamic feedback synchronization technique
for joint estimation of integer and fractional carrier frequency offsets in
orthogonal frequency division multiplexing (OFDM) systems. The proposed
technique has high accuracy, broad estimation range, and works effectively
over frequency-selective radio channels. A dynamic self-noise reduction
technique is introduced to enhance the estimation accuracy over a wide
range of signal-to-noise ratios by changing the synchronizer S-curve. The
S-curve switching process is performed according to a rough estimation of
the channel signal to noise ratio. Therfore, the proposed synchronizer is
blind since no effort is devoted to estimate the channel parameters."
}

@INPROCEEDINGS{Alek0706:Capacity,
AUTHOR="Marko Aleksic and Peyman Razaghi and Wei Yu",
TITLE="Capacity of a Class of {Modulo-Sum} Relay Channels",
BOOKTITLE="IEEE International Symposium on Information Theory 2007",
ADDRESS="Nice, France",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="This paper characterizes the capacity of a class of
modulo additive noise relay channels, in which the relay observes
a corrupted version of the noise and has a separate channel to
the destination. The capacity is shown to be strictly below the
cut-set bound in general and achievable using a quantize-andforward
strategy at the relay. This result confirms a conjecture
by Ahlswede and Han about the capacity of channels with rate
limited state information at the destination for this particular
class of channels."
}

@INPROCEEDINGS{Alen0000:Performance,
AUTHOR="Marcelo Alencar and Marcelo Carvalho",
TITLE="Performance Evaluation of Wireless Ad-hoc Networks with Multiple Antennas",
BOOKTITLE="The 10th International Symposium on Wireless Personal Multimedia
Communications",
ADDRESS="Jaipur, India, India",
DAYS=3,
MONTH=dec,
YEAR=2007
}

@INPROCEEDINGS{Ales0711:Non,
AUTHOR="Mahmoud Aleshams and Mohammad Kazem {Moravvej Farshi} and Mohammad Hossein
Sheikhi",
TITLE="Non-uniform Grating Effects On {Time-Dependent} Bistable Characteristics of
{QWS-DFB} Semiconductor Laser Amplifiers",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1115-1118",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Distributed feedback semiconductor laser amplifier; spatially chirped
grating; tapered grating; optical bistability; modulation period",
ABSTRACT="In this paper, using a proposed procedure we analyze temporal behavior of
bistable quarter wavelength shifted distributed feedback (QWS-DFB)
semiconductor laser amplifiers. This procedure utilizes a time-dependent
model based on the coupled-mode and carrier rate equations. In a QWS-DFB
laser amplifier, we find that this model yields the shapes of the
hysteresis curves which qualitatively agree with those based on the
steady-state model for long signal-modulation periods. On the other hand,
for short modulation periods the hysteresis shape changes dramatically and
new features such as closing down of the hysteresis curve becomes
prominent. However, the simulation results show that non-uniform gratings
improve the shape distortion of the bistable characteristics due to short
modulation periods a little.  The transfer matrix method (TMM) is utilized
for simulating all results."
}

@INPROCEEDINGS{Alex0703:Error,
AUTHOR="Angeliki Alexiou",
TITLE="Error Probability, Diversity and Coding Gain Considerations in {Space-Time}
Coded Systems with Linear Precoding",
BOOKTITLE="2007 IEEE International Workshop on Antenna Technology Small and Samrt
Antennas Metamaterials and Applications",
ADDRESS="Cambridge, United Kingdom",
DAYS=21,
MONTH=mar,
YEAR=2007,
ABSTRACT="In order to account for the performance degradation in Space-Time Block
Coded (STBC) systems in the presence of spatial correlation, linear
precoding has been proposed that allows for reconfigurable transmission
along the eigenvalues of the channel covariance matrix. In this paper a
generalized formulation of the linear precoder is first presented. Then,
the performance enhancements in terms of diversity, coding gain and error
probability when employing linear precoding are analytically assessed."
}

@INPROCEEDINGS{Alex0711:Results,
AUTHOR="George Alexandropoulos and Nikos Sagias and Fotis Lazarakis and Kostas
Berberidis",
TITLE="New Results on {SC} and {MRC} over Nakagami-m Fading Channels with
Arbitrary Correlation Matrix",
BOOKTITLE="IEEE Globecom 2007 Communication Theory Symposium",
ADDRESS="Washington, DC, USA",
DAYS=26,
MONTH=nov,
YEAR=2007,
ABSTRACT="By applying a simple approach based on transformations of Nakagami-$m$
random variables (RVs), union bounds for the multichannel Nakagami-$m$
fading model are presented. An orthogonal transformation of a set of
correlated Gaussian random variables (RVs) to another set is performed.
Using an efficient tridiagonalization method based on Householder matrices,
the inverse of the correlation matrix of the new set has a tridiagonal
form, managing to derive upper bound expressions for the joint Nakagami-$m$
probability density and cumulative distribution functions generated from
correlated Gaussian RVs. Our analysis considers an arbitrary correlation
structure, which includes as special cases the exponential, constant,
circular, and linear correlation structures. Based on the proposed
mathematical analysis, we obtain a tight union upper bound for the outage
performance of multibranch selection diversity, while exact analytical
expressions for the outage performance and average error probability of
multibranch maximal-ratio diversity receivers operating over identically
distributed and arbitrarily correlated Nakagami-$m$ fading channels are
derived. Our analysis is verified by comparisons of numerically evaluated
with extensive computer simulation results."
}

@INPROCEEDINGS{Alfa0703:Testing,
AUTHOR="Yasir Alfadhl and Xiaodong Chen and Clive Parini and Brian Collins",
TITLE="Design and Testing of a Compact {‘Semi-Smart’} Base Station Antenna in
Cellular Networks",
BOOKTITLE="2007 IEEE International Workshop on Antenna Technology Small and Samrt
Antennas Metamaterials and Applications",
ADDRESS="Cambridge, United Kingdom",
DAYS=21,
MONTH=mar,
YEAR=2007,
ABSTRACT="This paper presents a physical-level study on improving cellular-network
system capacity by using the concept of semi-smart antennas. Practical
implementation of the semi-smart antenna technology imposes several
technical and environmental requirements on the antenna design. Therefore,
novel cylindrically-conformal antenna array has been designed and tested.
The new design is simple, robust, light and small in size (low profile),
and most importantly, operates efficiently in providing dynamic radiation
coverage in the azimuth plane. In comparison to the typical smart-antenna
approach, semi-smart antenna technology has proven to be of much lower
complexity and has minimal impact on the cellular system architecture."
}

@INPROCEEDINGS{AlFa0711:Hybrid,
AUTHOR="Ali Al-Fayadh and Abir Hussain and Paulo Lisboa and Dhiya Al-Jumeily",
TITLE="A Hybrid Classified Vector Quantisation and Its Application to Image
Compression",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="125-128",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Classified vector quantisation, image compression, singular value
decomposition, DCT",
ABSTRACT="A novel image compression technique using Classified Vector Quantiser and
Singular Value Decomposition is presented for the efficient representation
of still images. The proposed method is called Hybrid Classified Vector
Quantisation. It involves a simple, but efficient, classifier based
gradient method in the spatial domain which employs only one threshold to
determine the class of the input image block, and uses three AC
coefficients of the Discrete Cosine Transform coefficients to determine the
orientation of the block without employing any threshold. Singular value
decomposition was used to generate the classified codebooks. The proposed
technique was benchmarked with the standard vector quantiser generated
using the k-means algorithm, and JPEG-2000. Simulation results indicated
that the proposed approach alleviates edge degradation and can reconstruct
good visual quality images with higher Peak Signal-to Noise-Ratio than the
benchmarked techniques."
}

@INPROCEEDINGS{Alfi0000:Robust,
AUTHOR="Mohammad Alfiad and Dirk {van den Borne} and Fabian Hauske and Antonio
Napoli and Ton Koonen and Huug {de Waardt}",
TITLE="Robust Detection of 10.7-Gb/s {DPSK} Using Joint Decision Maximum
Likelihood Sequence Estimation",
BOOKTITLE="ECOC 2007 - 33rd European Conference and Exhibition on Optical
Communication",
ADDRESS="Berlin, International Congress Center (ICC), Germany, Germany",
DAYS=16,
MONTH=sep,
YEAR=2007,
ABSTRACT="We experimentally apply Joint-Decision MLSE (JD-MLSE) detection to
10.7-Gbit/s DPSK. We demonstrate that a JD-MLSE using the constructive and
destructive components preserves the 3-dB OSNR advantage of DPSK over OOK
in dispersion-limited optical systems"
}

@INPROCEEDINGS{Alfo0000:Performance,
AUTHOR="Daniele Alfonso and Andrea Vitali and Fabrizio Rovati",
TITLE="Performance analysis of the Scalable Video Coding standard",
BOOKTITLE="16th International Packet Video Workshop",
ADDRESS="Lausanne, Switzerland",
DAYS=12,
MONTH=nov,
YEAR=2007,
ABSTRACT="The emerging Scalable Video Coding extends the H.264/AVC video coding
standard with new tools designed to efficiently support temporal, spatial
and SNR scalability. This paper gives a comprehensive overview of the new
features of the SVC standard, providing at the same time an evaluation of
their Rate-Distortion performance as well as of the computational
complexity."
}

@INPROCEEDINGS{Alfu0706:Geo,
AUTHOR="Omar {Al Ibrahim} and Ala Al-Fuqaha",
TITLE="{Geo-Encryption} Protocol For Mobile Networks",
BOOKTITLE="ICC 2007 Computer and Communications Network Security Symposium",
ADDRESS="Glasgow, Scotland, United Kingdom",
DAYS=24,
MONTH=jun,
YEAR=2007,
ABSTRACT="We propose a Geo-Encryption protocol which allows mobile nodes to exchange
movement parameters, so that a sender is able to geo-encrypt messages to a
moving decryption zone that contains a mobile node’s estimated location.
We also present methods for estimating the node’s movement parameters to
allow for Geo-Encryption.  Finally, we evaluate our model by measuring the
induced overhead to the network and its performance in terms of decryption
ratio."
}

@INPROCEEDINGS{Alfu0708:Service,
AUTHOR="Ala Al-Fuqaha",
TITLE="A Service Location Problem with {QoS} Constraints",
BOOKTITLE="IWCMC 2007 Mobile Computing Symposium",
ADDRESS="Honolulu, Hawaii, USA, USA",
DAYS=12,
MONTH=aug,
YEAR=2007,
ABSTRACT="In this paper, we present and discuss a novel service location problem that
satisfies user demand for services, by installing services on nodes in the
network, which can also meet quality of service (QoS) constraints of
throughput and delay defined by the user. Service location problems can
arise in various different networks, we specifically consider service
location in Cisco’s Application Oriented Networks (AON). Our goal is to
formulate and present the service location problem as an Integer Linear
Programming (ILP) problem and solve it optimally for networks with small
number of nodes. Our ILP and results meet “real-world” demands of
traffic splitting (due to link layer capacity) and service federation (to
incur minimal service installation cost)."
}

@INPROCEEDINGS{AlGa0000:"Spacecraft,
AUTHOR="Ahmed Al-Garni and Rihan {Irfan Ahmad} and Rajamani Doraiswami and Ayman
Kassem",
TITLE={{"}Spacecraft Attitude Control using Internal Model Principle{"}},
BOOKTITLE="Fourth GCC Industrial Electrical and Electronics Conference",
ADDRESS="Manama, Bahrain",
DAYS=11,
MONTH=nov,
YEAR=2007,
ABSTRACT="In this paper, we propose a design
methodology for the tracking of Spacecraft attitude. The
plant (spacecraft model) is a sixth order nonlinear multiinput-
multi-output system. The attitude tracking objective
is accomplished using Internal Model principle. Internal
model of reference and disturbance signal driven by the
tracking error is included in the controller. The augmented
system formed of the nonlinear plant and the internal
model is stabilized by output feedback, where the
derivative of the attitude is obtained from the attitude
measurement using a differentiator. Small gain theorem is
employed to determine the feedback gain of the nonlinear
plant. Computer simulation results are given to illustrate
the effectiveness of the proposed controller."
}

@INPROCEEDINGS{AlGh0710:FPGA,
AUTHOR="Ali {Al Ghouwayel}",
TITLE="On the {FPGA} Implementation of the Fourier Transform over Finite Fields
{GF(2^{m})}",
BOOKTITLE="7th International Symposium on Communications and Information Technologies",
ADDRESS="Sydney, Australia",
DAYS=16,
MONTH=oct,
YEAR=2007,
ABSTRACT="The hardware design and implementation of cyclotomic Fast Fourier
Transform (FFT) over finite fields GF(2^{m}) is described. By
reformulating the algorithm presented in {Fedorenko2}, we
introduce a hardware interpretation to design a highly parallel
and parameterized architecture of the cyclotomic FFT. Based on
four stages and modular structure of last stage, this architecture
can operate at different throughput rates. Compared to another
implemented algorithm {Wang} which operates at f\_{c} (the
system clock frequency), the proposed architecture allows to reach
a very high throughput rate which, for 256-point FFT, can get hold
of 8.5 f\_{c}. An FPGA implementation of the proposed
architecture is given where the critical path delay and the
hardware complexity are evaluated."
}

@INPROCEEDINGS{AlGh0711:Improving,
AUTHOR="Esa Al-Ghonaim and Adnan Al-Andalousi and Aiman El-Maleh",
TITLE="Improving {BER} performance of {LDPC} codes based on intermediate decoding
results",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="1547-1550",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="LDPC codes, BER performance, Belief Propagation iterative decoding",
ABSTRACT="The paper presents a novel approach to reduce the bit error rate (BER) in
iterative belief propagation (BF) decoding of low density parity check
(LDPC) codes. The behavior of the BF algorithm is first investigated as a
function of number of decoder iterations, and it is shown that typical
uncorrected error patterns can be classified into 3 categories:
oscillating, nearly-constant, or random-like, with a predominance of
oscillating patterns at high Signal-to-Noise (SNR) values. 
A proposed decoder modification is then introduced based on tracking the
number of failed parity check equations in the intermediate decoding
iterations, rather than relying on the final decoder output (after reaching
the maximum number of iterations). Simulation results with a rate ½
(1024,512) progressive edge-growth (PEG) LDPC code show that the proposed
modification can decrease the BER by as much as 10-to-40\%, particularly
for high SNR values."
}

@INPROCEEDINGS{Algh0711:Manual,
AUTHOR="Mansour Alghamdi and Yahya {Ould Mohamed Elhadj} and Mohamed Alkanhal",
TITLE="A Manual System to Segment and Transcribe Arabic Speech",
BOOKTITLE="2007 IEEE International Conference on Signal Processing and Communication",
ADDRESS="Dubai, UAE",
PAGES="233-236",
DAYS=23,
MONTH=nov,
YEAR=2007,
KEYWORDS="Arabic transcription; speech database; Corpus; Automatic Speech
Recognition; HMM",
ABSTRACT={In this paper, we present our first work in the {"}Computerized Teaching of
the Holly Quran{"} project, which aims to assist the memorization process
of the Noble Quran based-on the speech recognition techniques.
In order to build a high performance speech recognition system for this
purpose, accurate acoustic models are essentials. Since annotated speech
corpus of the Quranic sounds was not available yet, we tried to collect
speech data from reciters memorizing the Quran and then focusing