Now showing items 1-19 of 19

• #### Climbing depth-bounded discrepancy search for solving hybrid flow shop problems ﻿

(Inderscience Publishers, 2007)
This paper investigates how to adapt some discrepancy-based search methods to solve Hybrid Flow Shop (HFS) problems in which each stage consists of several identical machines operating in parallel. The objective is ...
• #### Comprehensive lower bounds on sequential prediction ﻿

(European Signal Processing Conference, EUSIPCO, 2014)
We study the problem of sequential prediction of real-valued sequences under the squared error loss function. While refraining from any statistical and structural assumptions on the underlying sequence, we introduce a ...
• #### Enhancements to threshold based range estimation for ultra-wideband systems ﻿

(IEEE Computer Society, 2014)
Ultra-wideband (UWB) signals have very high time resolution, which makes them a very good candidate for range estimation based wireless positioning. Although the accuracy is the major concern for range estimation, it is ...
• #### Fundamental limits and improved algorithms for linear least-squares wireless position estimation ﻿

(John Wiley & Sons, 2010-09-22)
In this paper, theoretical lower bounds on performance of linear least-squares (LLS) position estimators are obtained, and performance differences between LLS and nonlinear least-squares (NLS) position estimators are ...
• #### Improved position estimation using hybrid TW-TOA and TDOA in cooperative networks ﻿

(Institute of Electrical and Electronics Engineers, 2012-04-13)
This paper addresses the problem of positioning multiple target nodes in a cooperative wireless sensor network in the presence of unknown turn-around times. In this type of cooperative networks, two different reference ...
• #### Minimum maximum-degree publish-subscribe overlay network design ﻿

(2011)
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scalability and efficiency, it is important to ...
• #### On erasure correction coding for streaming ﻿

(2012)
We consider packet erasure correction coding for a streaming system where specific information needs to be decoded by specific deadlines, in order to ensure uninterrupted playback at the receiver. In our previous work [1], ...
• #### Online bicriteria load balancing using object reallocation ﻿

(Institute of Electrical and Electronics Engineers, 2009-03)
We study the bicriteria load balancing problem on two independent parameters under the allowance of object reallocation. The scenario is a system of $M$ distributed file servers located in a cluster, and we propose three ...
• #### Optimal jammer placement in wireless localization networks ﻿

(Institute of Electrical and Electronics Engineers Inc., 2015)
The optimal jammer placement problem is proposed for a wireless localization network, where the aim is to degrade the accuracy of locating target nodes as much as possible. In particular, the optimal location of a jammer ...
• #### Optimal jamming of wireless localization systems ﻿

(Institute of Electrical and Electronics Engineers Inc., 2015)
In this study, optimal jamming of wireless localization systems is investigated. Two optimal power allocation schemes are proposed for jammer nodes in the presence of total and peak power constraints. In the first scheme, ...
• #### Performance analysis of cross ambiguity function-Direction finding technique in multipath environments ﻿

(2008)
In this paper, recently proposed Cross Ambiguity Function Direction Finding (CAF-DF) array signal processing technique, which make use of the cross ambiguity function calculation, is compared with the MUltiple SIgnal ...
• #### Positioning algorithms for cooperative networks in the presence of an unknown turn-around time ﻿

(2011)
This paper addresses the problem of single node positioning in cooperative network using hybrid two-way time-of-arrival and time-difference-of-arrival where, the turn-around time at the target node is unknown. Considering ...
• #### Resilient PI and PD controllers for a class of unstable MIMO plants with I/O delays ﻿

(2006)
Recently (Gündeş et al., 2006) obtained stabilizing PID controllers for a class of MIMO unstable plants with time delays in the input and output channels (I/O delays). Using this approach, for plants with one unstable pole, ...
• #### Stability analysis of switched systems using Lyapunov-Krasovskii functionals ﻿

(2011)
Piecewise Lyapunov-Razumikhin functions are previously used for obtaining a lower bound for the dwell time of the switched time delay systems under the assumption that each candidate system is delay dependently stable. In ...
• #### Switched PD-like controllers for first order unstable systems with time delay ﻿

(2009)
A new method is proposed for the design of PD-like (first order stable) controllers for switched first order unstable systems with time delays. For this purpose, a dwell-time based stability condition of Yan and Özbay ...
• #### Theoretical limits and a practical estimator for joint estimation of respiration and heartbeat rates using UWB impulse radio ﻿

(2007)
In this paper, Cramer-Rao lower bounds are derived fo r joint estimation of respiration and heartbeat rates via impulse radio ultra-wideband signals. Generic models are employed for displacement functions due to respiration ...
• #### Tight bounds for the identical parallel machine-schedulingproblem: part II ﻿

(Wiley-Blackwell Publishing, 2008)
A companion paper introduces new lower bounds and heuristics for the problem of minimizing makespan onidentical parallel machines. The objective of this paper is threefold. First, we describe further enhancementsof previously ...
• #### Ultra-wideband range estimation: Theoretical limits and practical algorithms ﻿

(2008)
The high time resolution of ultra-wideband (UWB) signals enables wireless devices to perform accurate range estimation. In order to realize UWB systems with accurate ranging capabilities, both theoretical limits on range ...
• #### An upper bound on the capacity of non-binary deletion channels ﻿

(IEEE, 2013)
We derive an upper bound on the capacity of non-binary deletion channels. Although binary deletion channels have received significant attention over the years, and many upper and lower bounds on their capacity have been ...