Open Access. Powered by Scholars. Published by Universities.®

Computer Engineering Commons

Open Access. Powered by Scholars. Published by Universities.®

Articles 1 - 14 of 14

Full-Text Articles in Computer Engineering

Anonymous Query Processing In Road Networks, Kyriakos Mouratidis, Man Lung Yiu Dec 2010

Anonymous Query Processing In Road Networks, Kyriakos Mouratidis, Man Lung Yiu

Kyriakos MOURATIDIS

The increasing availability of location-aware mobile devices has given rise to a flurry of location-based services (LBSs). Due to the nature of spatial queries, an LBS needs the user position in order to process her requests. On the other hand, revealing exact user locations to a (potentially untrusted) LBS may pinpoint their identities and breach their privacy. To address this issue, spatial anonymity techniques obfuscate user locations, forwarding to the LBS a sufficiently large region instead. Existing methods explicitly target processing in the euclidean space and do not apply when proximity to the users is defined according to network distance ...


On-Line Discovery Of Hot Motion Paths, Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos Sellis Dec 2010

On-Line Discovery Of Hot Motion Paths, Dimitris Sacharidis, Kostas Patroumpas, Manolis Terrovitis, Verena Kantere, Michalis Potamias, Kyriakos Mouratidis, Timos Sellis

Kyriakos MOURATIDIS

We consider an environment of numerous moving objects, equipped with location-sensing devices and capable of communicating with a central coordinator. In this setting, we investigate the problem of maintaining hot motion paths, i.e., routes frequently followed by multiple objects over the recent past. Motion paths approximate portions of objects' movement within a tolerance margin that depends on the uncertainty inherent in positional measurements. Discovery of hot motion paths is important to applications requiring classification/profiling based on monitored movement patterns, such as targeted advertising, resource allocation, etc. To achieve this goal, we delegate part of the path extraction process ...


Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias Dec 2010

Continuous Monitoring Of Spatial Queries In Wireless Broadcast Environments, Kyriakos Mouratidis, Spiridon Bakiras, Dimitris Papadias

Kyriakos MOURATIDIS

Wireless data broadcast is a promising technique for information dissemination that leverages the computational capabilities of the mobile devices in order to enhance the scalability of the system. Under this environment, the data are continuously broadcast by the server, interleaved with some indexing information for query processing. Clients may then tune in the broadcast channel and process their queries locally without contacting the server. Previous work on spatial query processing for wireless broadcast systems has only considered snapshot queries over static data. In this paper, we propose an air indexing framework that 1) outperforms the existing (i.e., snapshot) techniques ...


Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis Dec 2010

Optimal Matching Between Spatial Datasets Under Capacity Constraints, Hou U Leong, Kyriakos Mouratidis, Man Lung Yiu, Nikos Mamoulis

Kyriakos MOURATIDIS

Consider a set of customers (e.g., WiFi receivers) and a set of service providers (e.g., wireless access points), where each provider has a capacity and the quality of service offered to its customers is anti-proportional to their distance. The capacity constrained assignment (CCA) is a matching between the two sets such that (i) each customer is assigned to at most one provider, (ii) every provider serves no more customers than its capacity, (iii) the maximum possible number of customers are served, and (iv) the sum of Euclidean distances within the assigned provider-customer pairs is minimized. Although max-flow algorithms ...


Continuous Spatial Assignment Of Moving Users, Leong Hou U, Kyriakos Mouratidis, Nikos Mamoulis Dec 2010

Continuous Spatial Assignment Of Moving Users, Leong Hou U, Kyriakos Mouratidis, Nikos Mamoulis

Kyriakos MOURATIDIS

Consider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations ...


Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis Dec 2010

Shortest Path Computation On Air Indexes, Georgios Kellaris, Kyriakos Mouratidis

Kyriakos MOURATIDIS

Shortest path computation is one of the most common queries in location-based services that involve transportation net- works. Motivated by scalability challenges faced in the mo- bile network industry, we propose adopting the wireless broad- cast model for such location-dependent applications. In this model the data are continuously transmitted on the air, while clients listen to the broadcast and process their queries locally. Although spatial problems have been considered in this environment, there exists no study on shortest path queries in road networks. We develop the rst framework to compute shortest paths on the air, and demonstrate the practicality and ...


Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu Dec 2010

Preference Queries In Large Multi-Cost Transportation Networks, Kyriakos Mouratidis, Yimin Lin, Man Lung Yiu

Kyriakos MOURATIDIS

Research on spatial network databases has so far considered that there is a single cost value associated with each road segment of the network. In most real-world situations, however, there may exist multiple cost types involved in transportation decision making. For example, the different costs of a road segment could be its Euclidean length, the driving time, the walking time, possible toll fee, etc. The relative significance of these cost types may vary from user to user. In this paper we consider such multi-cost transportation networks (MCN), where each edge (road segment) is associated with multiple cost values. We formulate ...


Adaptive Checkpointing For Master-Worker Style Parallelism (Extended Abstract), Gene D. Cooperman, Jason Ansel, Xiaoqin Ma Dec 2010

Adaptive Checkpointing For Master-Worker Style Parallelism (Extended Abstract), Gene D. Cooperman, Jason Ansel, Xiaoqin Ma

Gene D. Cooperman

No abstract provided.


Dmtcp: Transparent Checkpointing For Cluster Computations And The Desktop, Jason Ansel, Kapil Arya, Gene D. Cooperman Dec 2010

Dmtcp: Transparent Checkpointing For Cluster Computations And The Desktop, Jason Ansel, Kapil Arya, Gene D. Cooperman

Gene D. Cooperman

DMTCP (Distributed MultiThreaded CheckPointing) is a transparent user-level checkpointing package for distributed applications. Checkpointing and restart is demonstrated for a wide range of over 20 well known applications, including MATLAB, Python, TightVNC, MPICH2, OpenMPI, and runCMS. RunCMS runs as a 680 MB image in memory that includes 540 dynamic libraries, and is used for the CMS experiment of the Large Hadron Collider at CERN. DMTCP transparently checkpoints general cluster computations consisting of many nodes, processes, and threads; as well as typical desktop applications. On 128 distributed cores (32 nodes), checkpoint and restart times are typically 2 seconds, with negligible run-time ...


The Kerf Toolkit For Intrusion Analysis, Javed A. Aslam, Sergey Bratus, David Kotz, Ron Peterson, Brett Tofel, Daniela Rus Nov 2010

The Kerf Toolkit For Intrusion Analysis, Javed A. Aslam, Sergey Bratus, David Kotz, Ron Peterson, Brett Tofel, Daniela Rus

Javed A. Aslam

To aid system administrators with post-attack intrusion analysis, the Kerf toolkit provides an integrated front end and powerful correlation and data-representation tools, all in one package.


Safe Inter-Domain Routing Under Diverse Commercial Agreements, Yong Liao, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Oct 2010

Safe Inter-Domain Routing Under Diverse Commercial Agreements, Yong Liao, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Lixin Gao

Commercial agreements drive the routing policies used in today's Internet. The two most extensively studied commercial agreements are transit and peering; however, they are only two of many diverse and continuously evolving commercial agreements that ISPs enter into. So far, the only known practical safe and robust routing policy is Gao and Rexford's policy guideline, which is applicable to transit and peering agreements only. It is, therefore, of importance to identify routing policies that are safe and robust and at the same time capable of accommodating the diverse commercial agreements existing in the Internet. In particular, this paper ...


On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang Oct 2010

On The Feasibility And Efficacy Of Protection Routing In Ip Networks, Kin-Wah (Eric) Kwong, Lixin Gao, Roch A. Guérin, Zhi-Li Zhang

Lixin Gao

With network components increasingly reliable, routing is playing an ever greater role in determining network reliability. This has spurred much activity in improving routing stability and reaction to failures, and rekindled interest in centralized routing solutions, at least within a single routing domain. Centralizing decisions eliminates uncertainty and many inconsistencies, and offers added flexibility in computing routes that meet different criteria. However, it also introduces new challenges; especially in reacting to failures where centralization can increase latency. This paper leverages the flexibility afforded by centralized routing to address these challenges. Specifically, we explore when and how standby backup forwarding options ...


Fast Energy Loss Computation And Fuzzy-Based Shunt Capacitor Insertion, Philadelphia University May 2010

Fast Energy Loss Computation And Fuzzy-Based Shunt Capacitor Insertion, Philadelphia University

Philadelphia University, Jordan

No abstract provided.


Embedded Systems As Datacenters, Robert Iannucci Dec 2009

Embedded Systems As Datacenters, Robert Iannucci

Robert A Iannucci

No abstract provided.