% Please keep this file in reverse chronological order % Please follow the key format "LastNamesOfAllAuthors:venueYY" @article{VelosoAlmeidaMeiraBestavrosJin:ton06, author={Eveline Veloso and Virgilio Almeida and Wagner Meira and Azer Bestavros and Shudong Jin}, title={{A Hierarchical Characterization of a Live Streaming Media Workload}}, journal={IEEE/ACM Transactions on Networking}, volume = {14}, number = {1}, pages = {}, month = {February}, year = 2006, keywords={Streaming Media Characterization, Live Content Workloads, Internet Measurement, Networking, Web, Real-Time}, abstract={We present what we believe to be the first thorough characterization of {\em live} streaming media content delivered over the Internet. Our characterization of over 3.5 million requests spanning a 28-day period is done at three increasingly granular levels, corresponding to clients, sessions, and transfers. Our findings support two important conclusions. First, we show that the nature of interactions between users and objects is fundamentally different for live versus stored objects. Access to stored objects is {\em user driven}, whereas access to live objects is {\em object driven}. This reversal of active/passive roles of users and objects leads to interesting dualities. For instance, our analysis underscores a Zipf-like profile for user interest in a given object, which is in contrast to the classic Zipf-like popularity of objects for a given user. Also, our analysis reveals that transfer lengths are highly variable and that this variability is due to the stickiness of clients to a particular live object, as opposed to structural (size) properties of objects. Second, by contrasting two live streaming workloads from two radically different applications, we conjecture that some characteristics of live media access workloads are likely to be highly dependent on the nature of the live content being accessed. In our study, this dependence is clear from the strong temporal correlations observed in the traces, which we attribute to the synchronizing impact of live content on access characteristics. Based on our analyses, we present a model for live media workload generation that incorporates many of our findings, and which we implement in \sc{Gismo} \cite{JinBestavros:per01}.} } @article{JinBestavros:comnet:06, author={Shudong Jin and Azer Bestavros}, title={{Small-world Characteristics of Internet Topologies and Multicast Scaling}}, keywords={Internet Characterization, Internet Topology, Multicast}, url={http://www.cs.bu.edu/fac/best/res/papers/comnet06-smallworld.pdf}, journal = "{The Computer Networks Journal (COMNET): The International Journal of Computer and Telecommunications Networking}", month = {April}, year = 2006, number = {5}, volume = {50}, publisher = {{Elsevier}}, abstract={ Recent work has shown that the physical connectivity of the Internet exhibits small-world behavior. Characterizing such behavior is important not only for generating realistic Internet topology, but also for the proper evaluation of large-scale content delivery techniques. Along this line, this paper tries to explain how the small-world behavior arises in the Internet topologies and how it impacts the performance of multicast techniques. First, we attribute the small-world behavior to two possible causes—namely the variability of vertex degree and the preference for local connections for vertices. We have found that both factors contribute with different relative degrees to the small-world behavior of the autonomous system (AS) level and router level Internet topologies. For the AS level topology, we observe that the high variability of vertex degree is sufficient to cause the small-world behavior, but for the router level topology, the preference for local connectivity plays a more important role. Second, we propose better models to generate small-world Internet topologies. Our models incorporate both causes of small-world behavior, and generate graphs closely resemble real Internet graphs. Third, using simulation we demonstrate the importance of our work by studying the scaling behavior of multicast techniques. We show that multicast tree size largely depends on the network topology. If topology generators capture only the variability of vertex degree, they are likely to underestimate the benefit of multicast techniques. } } @article{GuirguisBestavrosMatta:comnet:05, author={Mina Guirguis and Azer Bestavros and Ibrahim Matta}, title={{Exogenous-Loss Aware Traffic Management in Overlay Networks: Toward Global Fairness}}, keywords={Internet Traffic Management, Overlay Networking, Real-Time Buffer Management}, url={http://www.cs.bu.edu/fac/best/res/papers/comnet05-xqm.pdf}, journal = "{The Computer Networks Journal (COMNET): The International Journal of Computer and Telecommunications Networking}", month = {}, year = 2005, number = {}, volume = {}, publisher = {{Elsevier}}, abstract={ For a given TCP flow, exogenous losses are those occurring on links other than the flow's bottleneck link. Exogenous losses are typically viewed as introducing undesirable "noise" into TCP's feedback control loop, leading to inefficient network utilization and potentially severe global unfairness. This has prompted much research on mechanisms for hiding such losses from end-points. In this paper, we show that low levels of exogenous losses are surprisingly beneficial in that they improve stability and convergence, without sacrificing efficiency. Based on this, we argue that exogenous-loss awareness should be taken into account in overlay traffic management techniques that aim to achieve global fairness. To that end, we propose an eXogenous-loss aware Queue Management (XQM) approach that actively accounts for and leverages exogenous losses on overlay paths. We envision the incorporation of XQM functionality in Overlay Traffic Managers (OTMs). We use an equation based approach to derive the quiescent loss rate for a connection based on the connection's profile and its global fair share. In contrast to other techniques, XQM ensures that a connection sees its quiescent loss rate, not only by complementing already existing exogenous losses, but also by actively hiding exogenous losses, if necessary, to achieve global fairness. We establish the advantages of exogenous-loss-aware OTMs using extensive simulations in which we contrast the performance of XQM to that of a host of traditional exogenous-loss unaware techniques. } } @article{BestavrosByersHarfoush:tpds05, author = {Azer Bestavros and John Byers and Khaled Harfoush}, title = {{Inference and Labeling of Metric-Induced Network Topologies}}, journal = {{IEEE Transactions on Parallel and Distributed Systems}}, publisher = {{IEEE Press}}, number = {10}, volume = {16}, month = {October}, year = {2005}, url = {http://www.cs.bu.edu/fac/best/res/papers/tpds05.pdf}, keywords={MassServer, Internet Measurement, Distributed Systems, Network Characterization}, abstract = { The development and deployment of distributed network-aware applications and services require the ability to compile and maintain a model of the underlying network resources with respect to one or more characteristic properties of interest. To be manageable, such models must be compact; and to be general-purpose, should enable a representation of properties along temporal, spatial, and measurement resolution dimensions. In this paper, we propose MINT -- a general framework for the construction of such metric-induced models using end-to-end measurements. We present the basic theoretical underpinnings of MINT for a broad class of performance metrics, and describe PERISCOPE, a Linux embodiment of MINT constructions. We instantiate MINT and PERISCOPE for a specific metric of interest -- namely, packet loss rates -- and present results of simulations and Internet measurements that confirm the effectiveness and robustness of our constructions over a wide range of network conditions. } } @inproceedings{OceanBestavrosKfoury:vee06, author = {Michael Ocean and Azer Bestavros and Assaf Kfoury}, title = {{snBench}: Programming and Virtualization Framework for Distributed Multitasking Sensor Networks}, booktitle = {Proceedings of the 2nd international conference on Virtual execution environments {(VEE 2006)} }, month = {June}, year = {2006}, isbn = {1-59593-332-6}, pages = {89 - 99}, location = {Ottawa, Ontario, Canada}, url={http://www.cs.bu.edu/fac/best/res/papers/vee06.pdf}, publisher = {ACM Press}, address = {New York, NY, USA}, abstract={} } @inproceedings{GuirguisBestavrosMatta:icc06, author={Mina Guirguis and Azer Bestavros and Ibrahim Matta}, title={{On the Impact of Low-Rate Attacks}}, keywords={Real-Time, Web, Internet, Network, Security}, url={http://www.cs.bu.edu/fac/best/res/papers/icc06.pdf}, booktitle={{Proceedings of ICC'2006: The IEEE International Conference on Communications}}, year=2006, month={June}, address={Istanbul, Turkey}, abstract={} } @inproceedings{SmaragdakisLaoutarisMattaBestavros:networking06, author={Georgios Smaragdakis and Nikolaos Laoutaris and Ibrahim Matta and Azer Bestavros and Ioannis Stavrakakis}, title={{A Feedback Control Approach to Mitigating Mistreatment in Distributed Caching Groups}}, keywords={Web Caching, Web, Internet, Network, Security, Distributed Systems, Game Theory}, url={http://www.cs.bu.edu/fac/best/res/papers/networking06.pdf}, booktitle={{Proceedings of IFIP Networking 2006}}, year=2006, month={May}, address={Coimbra, Portugal}, abstract={} } @inproceedings{LaoutarisSmaragdakisBestavrosStavrakakis:infocom06, author = {{Nikolaos Laoutaris and Georgios Smaragdakis and Azer Bestavros and Ioannis Stavrakakis}}, title = {{Mistreatment in Distributed Caching Groups: Causes and Implications}}, booktitle = {Proceedings of Infocom'06: The IEEE International Conference on Computer Communication}, address={Barcelona, Spain}, month={April}, year = {2006}, url = "http://www.cs.bu.edu/fac/best/res/papers/infocom06.pdf", keywords={Web Caching, Web, Internet, Network, Security, Distributed Systems, Game Theory}, abstract = { Although cooperation generally increases the amount of resources available to a community of nodes, thus improving individual and collective performance, it also allows for the appearance of potential mistreatment problems through the exposition of one node's resources to others. We study such concerns by considering a group of independent, rational, self-aware nodes that cooperate using on-line caching algorithms, where the exposed resource is the storage of each node. Motivated by content networking applications -- including web caching, CDNs, and P2P -- this paper extends our previous work on the off-line version of the problem, which was limited to object replication and was conducted under a game-theoretic framework. We identify and investigate two causes of mistreatment: (1) cache state interactions (due to the cooperative servicing of requests) and (2) the adoption of a common scheme for cache replacement/redirection/admission policies. Using analytic models, numerical solutions of these models, as well as simulation experiments, we show that on-line cooperation schemes using caching are fairly robust to mistreatment caused by state interactions. When this becomes possible, the interaction through the exchange of miss-streams has to be very intense, making it feasible for the mistreated nodes to detect and react to the exploitation. This robustness ceases to exist when nodes fetch and store objects in response to remote requests, i.e., when they operate as Level-2 caches (or proxies) for other nodes. Regarding mistreatment due to a common scheme, we show that this can easily take place when the ``outlier'' characteristics of some of the nodes get overlooked. This finding underscores the importance of allowing cooperative caching nodes the flexibility of choosing from a diverse set of schemes to fit the peculiarities of individual nodes. To that end, we outline an emulation-based framework for the development of mistreatment-resilient distributed selfish caching schemes. } } @inproceedings{LiChangKolliosBestavros:icde06, author = {Feifei Li and Ching Chang and George Kollios and Azer Bestavros}, title={{Characterizing and Exploiting Reference Locality in Data Stream Applications}}, booktitle = {Proceedings of IEEE ICDE'06: The International Conference on Data Engineering}, address = {Atlanta, Georgia}, month={April}, year=2006, url={http://www.cs.bu.edu/fac/best/res/papers/icde06.pdf}, abstract={ In this paper, we investigate a new approach to process queries in data stream applications. We show that reference locality characteristics of data streams could be exploited in the design of superior and flexible data stream query processing techniques. We identify two different causes of reference locality: popularity over long time scales and temporal correlations over shorter time scales. An elegant mathematical model is shown to precisely quantify the degree of those sources of locality. Furthermore, we analyze the impact of locality-awareness on achievable performance gains over traditional algorithms on applications such as MAX-subset approximate sliding window join and approximate count estimation. In a comprehensive experimental study, we compare several existing algorithms against our locality-aware algorithms over a number of real datasets. The results validate the usefulness and efficiency of our approach. } } @inproceedings{BestavrosBradleyKfouryMatta:icnp05, author={Azer Bestavros and Adam Bradley and Assaf Kfoury and Ibrahim Matta}, title= {{Typed Abstraction of Complex Network Compositions}}, Booktitle={{Proceedings of ICNP'05: The 13th IEEE International Conference on Network Protocols}}, address={Boston, MA}, month={November}, year=2005, url = "http://www.cs.bu.edu/fac/best/res/papers/icnp05.pdf", keywords={iBench, Protocol Verification, Internet and Web Protocol Composition, Security}, abstract={ The heterogeneity and open nature of network systems make analysis of compositions of components quite challenging, making the design and implementation of robust network services largely inaccessible to the average programmer. We propose the development of a novel type system and practical type spaces which reflect simplified representations of the results and conclusions which can be derived from complex compositional theories in more accessible ways, essentially allowing the system architect or programmer to be exposed only to the inputs and output of compositional analysis without having to be familiar with the ins and outs of its internals. Toward this end we present the TRAFFIC (Typed Representation and Analysis of Flows For Interoperability Checks) framework, a simple flow-composition and typing language with corresponding type system. We then discuss and demonstrate the expressive power of a type space for TRAFFIC derived from the network calculus, allowing us to reason about and infer such properties as data arrival, transit, and loss rates in large composite network applications. } } @inproceedings{WangGuBe05, author = {Wang, J. and E. Gu and M. Betke}, title = {Mosaic{S}hape: Stochastic Region Grouping with Shape Prior}, booktitle = {Proceedings of the IEEE Computer Society International Computer Vision and Pattern Recognition Conference (CVPR)}, address = {San Diego, CA}, year = 2005, month = Jun, pages = {902--908}, } @inproceedings{WaberMaBe05, author = {Waber, B. N. and J. J. Magee and M. Betke}, title = {Fast Head Tilt Detection for Human-Computer Interaction}, booktitle = {Proceedings of the ICCV Workshop on Human Computer Interaction, Lecture Notes in Computer Science}, address = {Beijing, China}, month = Oct, year = 2005, publisher = {Springer Verlag}, note = {10~pp.}, } @article{BetkeGuUr06, author = {Betke, M. and O. Gusyatin and M. Urinson}, title = {Symbol{D}esign: A User-centered Method to Design Pen-based Interfaces and Extend the Functionality of Pointer Input Devices}, journal = {Universal Access in the Information Society}, year = 2006, month = Mar, volume = 4, number = 3, pages = {223--236}, } @inproceedings{AthitsosWaScBe06, author = {Athitsos, V. and J. Wang and S. Sclaroff and M. Betke}, title = {Detecting Instances of Shape Classes That Exhibit Variable Structure}, booktitle = {To be published in the Proceedings of the 9th European Conference on Computer Vision (ECCV 2006), Lecture Notes in Computer Science}, address = {Graz, Austria}, month = May, year = 2006, publisher = {Springer Verlag}, note = {10~pp.}, } @inproceedings{ShugrinaBeCo06, author = {Shugrina, M. and M. Betke and J. Collomosse}, title = {Empathic Painting: Interactive stylization through observed emotional state}, booktitle ={Proceedings of the 4th International Symposium on Non-Photorealistic Animation and Rendering (NPAR 2006)}, address = {Annecy, France}, month = Jun, year = 2006, note = {8~pp.}, } @inproceedings{CastelliBeNe06, author = {Castelli, T. and M. Betke and C. Neidle}, title = {Facial Feature Tracking and Occlusion Recovery in {A}merican {S}ign {L}anguage}, editor = {A. Fred and A. Louren\c{c}o}, booktitle = {Pattern Recognition in Information Systems: Proceedings of the 6th International Workshop on Pattern Recogntion in Information Systems -- PRIS 2006}, address = {Paphos, Cyprus}, pages = {81--90}, month = May, year = 2006, publisher = {INSTICC Press}, } @inproceedings{BetkeRuShJiGiCh06, author = {Betke, M. and J. Ruel and G. C. Sharp and S. B. Jiang and D. P. Gierga and G. T. Y. Chen}, title = {Tracking and Prediction of Tumor Movement in the Abdomen}, editor = {A. Fred and A. Louren\c{c}o}, booktitle = {Pattern Recognition in Information Systems: Proceedings of the 6th International Workshop on Pattern Recogntion in Information Systems -- PRIS 2006}, address = {Paphos, Cyprus}, pages = {27--37}, month = May, year = 2006, publisher = {INSTICC Press}, } @inproceedings{LHKR06, author={Feifei Li and Marios Hadjieleftheriou and George Kollios and Leonid Reyzin}, title={Dynamic Authenticated Index Structures for Outsourced Databases}, booktitle={Twenty Fifth ACM SIGMOD International Conference on Management of Data}, year=2006, publisher={ACM}, dates={26--39~} # jun, } @inproceedings{RigaMedinaMattaX:sigcomm05, author = {Niky Riga and Alberto Medina and Ibrahim Matta and Craig Partridge and Jason Redi and Isidro Castineyra}, title = {{Transport Services for Energy Constrained Environments}}, booktitle={{Proceedings of ACM SIGCOMM'05}}, address={Philadelphia, PA}, keywords={}, month={August}, year=2005, note ="Work-in-progress Session", url = "http://www.cs.bu.edu/faculty/matta/Papers/sigcomm05.pdf", } @article{ByersConsidineItkisChengYeung:cc06, author = {John W. Byers and Jeffrey Considine and Gene Itkis and Mei-Chin Cheng and Alex Yeung}, title = {{Securing Bulk Content Almost for Free}}, journal = {{Computer Communications, Special Issue on Internet Security}}, publisher = {{Elsevier}}, number = {3}, volume = {29}, month = {February}, year = {2006}, url = {}, abstract = {} } @article{ByersKwonLubyMitzenmacher:ton06, author = {John W. Byers and Gu-In Kwon and Michael Luby and Michael Mitzenmacher}, title = {{Fine-Grained Layered Multicast using STAIR}}, journal = {{IEEE/ACM Transactions on Networking}}, publisher = {{IEEE Press}}, number = {}, volume = {}, month = {March}, year = {2006}, url = {}, abstract = {} } @inproceedings{DonnellyXi05, author = {Kevin Donnelly and Hongwei Xi}, title = {Combining higher-order abstract syntax with first-order abstract syntax in {ATS}}, booktitle = {MERLIN '05: Proceedings of the 3rd ACM SIGPLAN workshop on Mechanized reasoning about languages with variable binding}, year = {2005}, pages = {58--63}, location = {Tallinn, Estonia}, publisher = {ACM Press}, address = {New York, NY, USA}, } inproceedings{CPwTP-icfp05, author = "Chiyan Chen and Hongwei Xi", title = {{Combining Programming with Theorem Proving}}, booktitle = "Proceedings of the Tenth ACM SIGPLAN International Conference on Functional Programming", year = 2005, month = "September", address = "Tallinn, Estonia", pages = "66--77", } @inproceedings{ATS-frocos05, author = "Sa Cui and Kevin Donnelly and Hongwei Xi", title = {{ATS: A Language That Combines Programming with Theorem Proving}}, booktitle = "Proceedings of the 5th International Workshop on Frontiers of Combining Systems", year = 2005, month = "September", address = "Vienna, Austria", pages = "310-320", } @article{CSX-FI05, author = "Chiyan Chen and Rui Shi and Hongwei Xi", title = {{Implementing Typeful Program Transformations}}, journal = "Fundamenta Informaticae", year = 2005, volume = "69", number = "1-2", pages = "103-121", } @article{CX-JFP05, author = "Chiyan Chen and Hongwei Xi", title = {{Meta-Programming through Typeful Code Representation}}, journal = "Journal of Functional Programming", year = 2005, volume = "15", number = "6", pages = "797-835", } @InProceedings{west_rtas06, author = {Richard West and Gabriel Parmer}, title = {Application-Specific Service Technologies for Commodity Operating Systems in Real-Time Environments}, booktitle = {Proceedings of the IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2006}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, address = {San Jose, California}, month = {April}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{cuckoo_plc05, author = {Richard West and Gary Wong}, title = {Cuckoo: a Language for Implementing Memory- and Thread-safe System Services}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the International Conference on Programming Languages and Compilers}, OPTpages = {}, year = {2005}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {June}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @article{west_acm_tecs, author = {Richard West and Gabriel Parmer}, title = {Application-Specific Service Technologies for Commodity Operating Systems in Real-Time Environments}, journal = {ACM Transactions on Embedded Computing Systems}, year=2006 } @InProceedings{west_pdpta05, author = {Richard West and Gerald Fry}, title = {Comparison of k-ary n-cube and de Bruijn Overlays in QoS-constrained Multicast Applications}, OPTcrossref = {}, OPTkey = {}, booktitle = {Proceedings of the International Conference on Parallel and Distributed Computing and Applications (PDPTA)}, OPTpages = {}, year = {2005}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {June}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @inproceedings{Athitsos05pa, author="V. Athitsos and M. Hadjieleftheriou and G. Kollios and S. Sclaroff", title="Query-Sensitive Embeddings", booktitle="Proc.\ ACM Conf.\ on Management of Data (SIGMOD)", pages="706-717", month=jun, year="{2005}"} @inproceedings{Athitsos05pb, author="V. Athitsos and J. Alon and S. Sclaroff", title=" Efficient Nearest Neighbor Classification Using a Cascade of Approximate Similarity Measures", booktitle={Proc.\ IEEE Conf.\ on Computer Vision and Pattern Recognition (CVPR)}, volume = "1", pages = "486-493", month=jun, year="{2005}"} @inproceedings{Li05pa, author="T.P. Tian and R. Li and S. Sclaroff", title="Articualted Pose Estimation in a Learned Smooth Space of Feasible Solutions", booktitle="Proc.\ IEEE Workshop on Learning in Computer Vision and Pattern Recognition", pages = "50-57", month=jun, year="{2005}"} @inproceedings{Athitsos05pc, author="V. Athitsos and S. Sclaroff", title="Boosting Nearest Neighbor Classifiers for Multiclass Recognition", booktitle="Proc.\ IEEE Workshop on Learning in Computer Vision and Pattern Recognition", pages="45-52", month=jun, year="{2005}"} @inproceedings{Nunziati05p, author="W. Nunziati and S. Sclaroff and A. del Bimbo", title="An invariant representation for matching trajectories across uncalibrated video streams", booktitle="Video Processing, Retrieval, and Multimedia Systems (Proc.\ Conf.\ on Image and Video Retrieval (CIVR))", publisher={Springer Verlag}, series={LNCS}, pages="318-327", volume="3568", month=jul, year="{2005}"} @inproceedings{Nunziati05pa, author="W. Nunziati and J. Alon and S. Sclaroff and A. del Bimbo", title="View registration using interesting segments of planar trajectories", booktitle="Proc.\ IEEE Conf.\ on Advanced Video and Signal Based Surveillance (AVSS)", pages="75-80", month=sep, year="{2005}"} @inproceedings{Erdem05p, author="U.M. Erdem and S. Sclaroff", title="Look there! {P}redicting where to look for motion in an active camera network", booktitle="Proc.\ IEEE Conf.\ on Advanced Video and Signal Based Surveillance (AVSS)", pages="105-110", month=sep, year="{2005}"} @inproceedings{Yuan05pa, author = "Q.\ Yuan and A.\ Thangali and S.\ Sclaroff", title="Face identification by a cascade of rejection classifiers", booktitle="Proc.\ IEEE Workshop on Face Recognition Grand Challenge Experiments", pages="152-159", month=jun, year="{2005}"} @inproceedings{Alon05pa, author="J.\ Alon and V.\ Athitsos and S.\ Sclaroff", booktitle="Proc.\ International Conf.\ on Document Analysis and Recognition (ICDAR)", title="Online and Offline Character Recognition using Alignment to Prototypes", pages="839-845", month=aug, year="{2005}"} @inproceedings{Sclaroff05i, author="S.\ Sclaroff and M.\ Betke and G.\ Kollios and J.\ Alon and V.\ Athitsos and R.\ Li and J.\ Magee and T.-P.\ Tian", booktitle="Proc.\ International Conf.\ on Document Analysis and Recognition (ICDAR)", title="Tracking, Analysis, and Recognition of Human Gestures in Video", pages="806-810", month=aug, year="{2005}"} @inproceedings{Law05p, author="K.M. Law and S. Sclaroff", booktitle="Intelligent Robots and Computer Vision XXIII: Algorithms, Techniques, and Active Vision (Proc. of SPIE)", title="Foreground object segmentation from binocular stereo video", pages="C1-C8", month=nov, year="{2005}"} @inproceedings{Alon05pb, author="J.\ Alon and V.\ Athitsos and S.\ Sclaroff", booktitle="Hand and Gesture (Proc.\ IEEE Workshop on Human-Computer Interaction)", title="Accurate and efficient gesture spotting via pruning and subgesture reasoning", publisher={Springer Verlag}, series={LNCS}, pages="189-198", volume="3766", month=oct, year="{2005}"} @inproceedings{Papapetrou05p, author="P.\ Papapetrou and G.\ Kollios and S.\ Sclaroff and D.\ Gunopulos", booktitle="Proc. IEEE International Conf.\ on Data Mining (ICDM)", title="Discovering frequent arrangements of temporal intervals", pages="354-361", month=nov, year="{2005}"} @inproceedings{Athitsos05pd, author="V.\ Athitsos and J.B.\ Wang and M.\ Betke and S.\ Sclaroff", booktitle={EECV}, title="Detecting instances of shape classes that exhibit variable structure", month=may, pages="121-134", number="LNCS 3951", year="2006"} @inproceedings{Li05pb, author="R.\ Li and M.H.\ Yang and and S.\ Sclaroff", booktitle={EECV}, title="Monocular Tracking of 3D Human Motion with a Coordinated Mixture of Factor Analyzers", month=may, pages="137-150", number="LNCS 3952", year="2006"} @techreport{DORS06, author={Yevgeniy Dodis and Rafail Ostrovsky and Leonid Reyzin and Adam Smith}, title={Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data}, number= {2003/235}, institution= {Cryptology {ePrint} archive, \url{http://eprint.iacr.org}}, year=2006, note={Preliminary version in \textit{Advances in Cryptology---EUROCRYPT 2004}, volume 3027 of \textit{Lecture Notes in Computer Science}, Springer Verlag} } @inproceedings{DKRS06, author={Yevgeniy Dodis and Jonathan Katz and Leonid Reyzin and Adam Smith}, title={Robust Fuzzy Extractors and Authenticated Key Agreement from Close Secrets}, booktitle={Advances in Cryptology---CRYPTO~2006}, editor={Cynthia Dwork}, series={Lecture Notes in Computer Science}, year=2006, month={20--24~} # aug, publisher={Spring{\-}er-Ver{\-}lag} } @inproceedings{DRS04, author={Yevgeniy Dodis and Leonid Reyzin and Adam Smith}, title={Fuzzy Extractors: How to Generate Strong Keys from Biometrics and Other Noisy Data}, editor = {Christian Cachin and Jan Camenisch}, series={Lecture Notes in Computer Science}, publisher={Spring{\-}er-Ver{\-}lag}, booktitle = {Advances in Cryptology---EUROCRYPT 2004}, volume = 3027, year = {2004}, } @inproceedings{LMRS04, author={Anna Lysyanskaya and Silvio Micali and Leonid Reyzin and Hovav Shacham},title={Sequential Aggregate Signatures from Trapdoor Permutations}, pages={74--90}, editor = {Christian Cachin and Jan Camenisch}, series={Lecture Notes in Computer Science}, publisher={Spring{\-}er-Ver{\-}lag}, booktitle = {Advances in Cryptology---EUROCRYPT 2004}, volume = 3027, year = {2004}, } @inproceedings{DIRR05, author={Nenad Dedi{\'c} and Gene Itkis and Leonid Reyzin and Scott Russell}, title={Upper and Lower Bounds on Black-Box Steganography}, pages={227-244}, booktitle={First Theory of Cryptography Conference --- TCC 2005}, editor={Joe Kilian}, volume= 3378, series={Lecture Notes in Computer Science}, publisher={Spring{\-}er-Ver{\-}lag}, year=2005, month=feb#{~10--12}, } @inproceedings{HR04, author={Chun-Yuan Hsiao and Leonid Reyzin}, title={Finding Collisions on a Public Road, or Do Secure Hash Functions Need Secret Coins}, pages={92--105}, booktitle={Advances in Cryptology---CRYPTO~2004}, editor={Matt Franklin}, series={Lecture Notes in Computer Science}, publisher={Spring{\-}er-Ver{\-}lag}, volume=3152, year=2004, month={15--19~} # aug, } @techreport{Rey04, author = {Leonid Reyzin}, title = {{A Note On the Statistical Difference of Small Direct Products}}, institution = {CS Department, Boston University}, number = {BUCS-TR-2004-032}, month = {{September 21}}, year = {2004}, note = {Available from \texttt{http://www.cs.bu.edu/techreports/}}, } @misc{IMR05-SecChanFull, author = {Gene Itkis and Robert McNerney and Scott Russell}, title = {Intrusion-Resilient Secure Channels}, howpublished = {Cryptology ePrint Archive, Report 2005/114}, year = {2005}, note = {\texttt{http://eprint.iacr.org/2005/114}}, } @InProceedings{IMR05-SecChanExtAbs, author = {Gene Itkis and Robert McNerney and Scott Russell}, editor = {John Ioannidis and Angelos Keromytis and Moti Yung}, title = {Intrusion-Resilient Secure Channels}, booktitle = {Applied Cryptography and Network Security, Third International Conference, ACNS 2005, New York, NY, USA, June 7-10, 2005, Proceedings}, year = {2005}, pages = {238-253}, series = {Lecture Notes in Computer Science}, volume = {3531}, } @inproceedings{CHLMR05, author={Melissa Chase and Alexander Healy and Anna Lysyanskaya and Tal Malkin and Leonid Reyzin}, title={Mercurial Commitments with Applications to Zero-Knolwedge Sets}, pages={422--439}, editor = {Ronald Cramer}, booktitle = {Advances in Cryptology---EUROCRYPT 2005}, series={Lecture Notes in Computer Science}, publisher={Spring{\-}er-Ver{\-}lag}, year = {2005}, } @inproceedings{LakhinaCrovellaDiot:sigcomm05, author = "Anukool Lakhina and Mark Crovella and Christophe Diot", title = "Mining Anomalies Using Traffic Feature Distributions", booktitle = "Proceedings of ACM SIGCOMM 2005", month = "August", year = "2005", location = "Philadelphia, PA", catID1 = "IM", catID2 = "anomalies", extra1 = "Earlier (Full) Version, published as BUCS Technical Report BUCS-TR-2005-002", extra1url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/mining-anomalies-TR.pdf", abstract = "The increasing practicality of large-scale flow capture makes it possible to conceive of traffic analysis methods that detect and identify a large and diverse set of anomalies. However the challenge of effectively analyzing this massive data source for anomaly diagnosis is as yet unmet. We argue that the distributions of packet features (IP addresses and ports) observed in flow traces reveals both the presence and the structure of a wide range of anomalies. Using entropy as a summarization tool, we show that the analysis of feature distributions leads to significant advances on two fronts: (1) it enables highly sensitive detection of a wide range of anomalies, augmenting detections by volume-based methods, and (2) it enables automatic classification of anomalies via unsupervised learning. We show that using feature distributions, anomalies naturally fall into distinct and meaningful clusters. These clusters can be used to automatically classify anomalies and to uncover new anomaly types. We validate our claims on data from two backbone networks (Abilene and Geant) and conclude that feature distributions show promise as a key element of a fairly general network anomaly diagnosis framework." } @inproceedings{ChuaKolaczykCrovella:sigmetrics05, author = "David B. Chua and Eric D. Kolaczyk and Mark Crovella", title = "A Statistical Framework for Efficient Monitoring of End-to-End Network Properties", booktitle = "Proceedings of ACM SIGMETRICS (Poster Paper)", month = "June", year = 2005, location = "Banff, Canada", catID1 = "IM", catID2 = "graphestim", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/sigm05-end2end.pdf", extra1 = "Earlier (Full) Version, published as Technical Report at arXiv:cs.NI/0412037", extra1url = "http://arxiv.org/abs/cs.NI/0412037", abstract = "Network service providers and customers are often concerned with aggregate performance measures that span multiple network paths. Unfortunately, forming such network-wide measures can be difficult, due to the issues of scale involved. In particular, the number of paths grows too rapidly with the number of endpoints to make exhaustive measurement practical. As a result, it is of interest to explore the feasibility of methods that dramatically reduce the number of paths measured in such situations while maintaining acceptable accuracy. In previous work we have proposed a statistical framework for efficiently addressing this problem, in the context of additive metrics such as delay and loss rate, for which the per-path metric is a sum of per-link measures (possibly under appropriate transformation). The key to our method lies in the observation and exploitation of the fact that network paths show significant redundancy (sharing of common links). In this paper we make three contributions: (1) we generalize the framework to make it more immediately applicable to network measurements encountered in practice; (2) we demonstrate that the observed path redundancy upon which our method is based is robust to variation in key network conditions and characteristics, including the presence of link failures; and (3) we show how the framework may be applied to address three practical problems of interest to network providers and customers, using data from an operating network. In particular, we show how appropriate selection of small sets of path measurements can be used to accurately estimate network-wide averages of path delays, to reliably detect network anomalies, and to effectively make a choice between alternative sub-networks, as a customer choosing between two providers or two ingress points into a provider network." } @inproceedings{DonnetEtAl:sigmetrics05, author = "Benoit Donnet and Philippe Raoult and Timur Friedman and Mark Crovella", title = "Efficient Algorithms for Large-Scale Topology Discovery", booktitle = "Proceedings of ACM SIGMETRICS", year = 2005, location = "Banff, Canada", month="June", catID1="IM", catID2="trathome", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/sigm05-trathome.pdf", extra1 = "Earlier Version, published as Technical Report at arXiv:cs.NI/0411013", extra1url="http://arxiv.org/abs/cs.NI/0411013", abstract="There is a growing interest in discovery of internet topology at the interface level. A new generation of highly distributed measurement systems is currently being deployed. Unfortunately, the research community has not examined the problem of how to perform such measurements efficiently and in a network-friendly manner. In this paper we make two contributions toward that end. First, we show that standard topology discovery methods (e.g., skitter) are quite inefficient, repeatedly probing the same interfaces. This is a concern, because when scaled up, such methods will generate so much traffic that they will begin to resemble DDoS attacks. We measure two kinds of redundancy in probing (intra- and inter-monitor) and show that both kinds are important. We show that straightforward approaches to addressing these two kinds of redundancy must take opposite tacks, and are thus fundamentally in conflict. Our second contribution is to propose and evaluate Doubletree, an algorithm that reduces both types of redundancy simultaneously on routers and end systems. The key ideas are to exploit the tree-like structure of routes to and from a single point in order to guide when to stop probing, and to probe each path by starting near its midpoint. Our results show that Doubletree can reduce both types of measurement load on the network dramatically, while permitting discovery of nearly the same set of nodes and links. We then show how to enable efficient communication between monitors through the use of Bloom filters." } @inproceedings{SouleEtAl:sigmetrics05, author = "Augustin Soule and Anukool Lakhina and Nina Taft and Konstantina Papagiannaki and Kave Salamatian and Antonio Nucci and Mark Crovella and Christophe Diot", title = "Traffic Matrices: Balancing Measurements, Inference and Modeling", booktitle = "Proceedings of ACM SIGMETRICS", month = "June", year = 2005, location = "Banff, Canada", catID1 = "IM", catID2 = "graphestim", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/sigm05-trafficmatrices.pdf", abstract = "Traffic matrix estimation is well-studied, but in general has been treated as simply a statistical inference problem. In practice, however, network operators seeking traffic matrix information have a range of options available to them. Operators can measure traffic flows directly; they can perform partial flow measurement, and infer missing data using models; or they can perform no flow measurement and infer traffic matrices directly from link counts. The advent of practical flow measurement makes the study of these tradeoffs more important. In particular, an important question is whether judicious modeling, combined with partial flow measurement, can provide traffic matrix estimates that are signficantly better than previous methods at relatively low cost. In this paper we make a number of contributions toward answering this question. First, we provide a taxonomy of the kinds of models that may make use of partial flow measurement, based on the nature of the measurements used and the spatial, temporal, or spatio-temporal correlation exploited. We then evaluate estimation methods which use each kind of model. In the process we propose and evaluate new methods, and extensions to methods previously proposed. We show that, using such methods, small amounts of traffic flow measurements can have significant impacts on the accuracy of traffic matrix estimation, yielding results much better than previous approaches. We also show that different methods differ in their bias and variance properties, suggesting that different methods may be suited to different applications." } @inproceedings{DonnetEtAl:PAM05, author = "Benoit Donnet and Timur Friedman and Mark Crovella", title = "Improved Algorithms for Network Topology Discovery", booktitle = "Lecture Notes in Computer Science, Proceedings of Passive and Active Measurement Workshop (PAM2005)", month="Mar", year=2005, catID1="IM", catID2="trathome", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/pam05-tr-at-home.pdf", abstract="Topology discovery systems are starting to be introduced in the form of screen saver software that have the potential to be widely deployed. However, little consideration has been given as to how to perform large-scale topology discovery efficiently and in a network-friendly manner. In previous work, we have described how large numbers of traceroute monitors can coordinate their efforts to obtain a map of the network while reducing their impact on routers and end-systems. The key is for them to share information regarding the interfaces that they have discovered. However, such sharing introduces considerable communication overhead. In this paper, we show how we can improve the communication scaling properties through the use of Bloom filters for lossy compression of the interface list. Also, any system in which every monitor traces routes towards every destination has inherent scaling problems. We propose to divide up the monitors into clusters, each cluster focusing on a different destination list." } @inproceedings{ChuaKolaczykCrovella:Infocom05, author = "David B. Chua and Eric D. Kolaczyk and Mark Crovella", title = "Efficient Monitoring of End-to-End Network Properties", booktitle = "Proceedings of Infocom 2005", location = "Miami, FL", month = "Mar", year = 2005, catID1 = "IM", catID2 = "graphestim", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/infocom05-efficient-monitoring.pdf", abstract = "It is often desirable to monitor end-to-end properties, such as loss rates or packet delays, across an entire network. However, active end-to-end measurement in such settings does not scale well, and so complete network-wide measurement quickly becomes infeasible. More efficient measurement strategies are therefore needed. Previous work, examining this problem from a linear algebraic perspective, has shown that for exact recovery of complete end-to-end network properties, the number of paths that need to be monitored can be reduced to approximately the number of links in the network. In this paper we ask whether measurement strategies of even greater efficiency are possible. We recast the problem as one of statistical prediction and show that end-to-end network properties may be accurately predicted in many cases using a significantly smaller set of carefully chosen paths than needed for exact recovery. We formulate a general framework for the prediction problem, propose a simple class of predictors for standard quantities of interest (e.g., averages, totals, differences), and show that linear algebraic methods of subset selection may be used to make effective choice of which paths to measure. We explore the accuracy of the resulting methods both analytically and numerically, in the context of real network topologies of varying size. The feasibility of our methods derives from the low effective rank of routing matrices as encountered in practice, which appears to be a new observation of interest in its own right. The resulting framework, which is quite general, appears to hold promise for studying and improving the efficiency of monitoring of end-to-end-network properties." } @inproceedings{FonsecaCrovella:Infocom05, author = "Nahur Fonseca and Mark Crovella", title = "Bayesian Packet Loss Detection for {TCP}", booktitle = "Proceedings of Infocom 2005", location = "Miami, FL", month = "Mar", year = 2005, catID1 = "IM", catID2 = "methods", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/infocom05-tcpbayes.pdf", abstract = "One of TCP's critical tasks is to determine which packets are lost in the network, as a basis for control actions (flow control and packet retransmission). Modern TCP implementations use two mechanisms: timeout, and fast retransmit. Detection via timeout is necessarily a time-consuming operation; fast retransmit, while much quicker, is only effective for a small fraction of packet losses. In this paper we consider the problem of packet loss detection in TCP more generally. We concentrate on the fact that TCP's control actions are necessarily triggered by inference of packet loss, rather than conclusive knowledge. This suggests that one might analyze TCP's packet loss detection in a standard inferencing framework based on probability of detection and probability of false alarm. This paper makes two contributions to that end: First, we study an example of more general packet loss inference, namely optimal Bayesian packet loss detection based on round trip time. We show that for long-lived flows, it is frequently possible to achieve high detection probability and low false alarm probability based on measured round trip time. Second, we construct an analytic performance model that incorporates general packet loss inference into TCP. We show that for realistic detection and false alarm probabilities (as are achievable via our Bayesian detector) and for moderate packet loss rates, the use of more general packet loss inference in TCP can improve throughput by as much as 25%." } @article{FonsecaAlmeidaCrovella:cacm05, author = "Rodrigo Fonseca and Virg\'{\i}lio Almeida and Mark Crovella", title = "Locality in a Web of Streams", journal = "Communications of the ACM", volume = 48, number = 1, month = "Jan", year = 2005, pages = "82--88", catID1 = "IM", catID2 = "web", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/cacm-web-streams.pdf" } @inproceedings{GueyeZivianiCrovellaFdida:imc2004, author = "Bamba Gueye and Artur Ziviani and Mark Crovella and Serge Fdida", title = "Constraint-Based Geolocation of {Internet} Hosts", booktitle = "Proceedings of the ACM/SIGCOMM Internet Measurement Conference", month = "October", year = "2004", pages = "288--293", catID1 = "IM", catID2 = "location", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/imc04-geolocation-short.pdf", extra1 = "Full Version", extra1url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/imc04-geolocation-full.pdf", extra2 = "Full Version in French: Vers la Localisation Geographique d'Hotes dans l'Internet basee sur la Multilateration", extra2url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/cbg-geolocation-francais.pdf", abstract = "Geolocation of Internet hosts enables a diverse and interesting new class of location-aware applications. Previous measurement-based approaches use reference hosts, called landmarks, with a well-known geographic location to provide the location estimation of a target host. This leads to a discrete space of answers, limiting the number of possible location estimates to the number of adopted landmarks. In contrast, we propose Constraint-Based Geolocation~(CBG), which infers the geographic location of Internet hosts using multilateration with distance constraints. Multilateration refers to the process of estimating a position using a sufficient number of distances to some fixed points, thus establishing a continuous space of answers instead of a discrete one. However, to use multilateration in the Internet, the geographic distances from the landmarks to the target host have to be estimated based on delay measurements between these hosts. This is a challenging problem because the relationship between network delay and geographic distance in the Internet is perturbed by many factors, including queuing delays and the absence of great-circle paths between hosts. CBG accurately transforms delay measurements to geographic distance constraints, and then uses multilateration to infer the geolocation of the target host. Our experimental results show that CBG outperforms the previous measurement-based geolocation techniques. Moreover, in contrast to previous approaches, our method is able to assign a confidence region to each given location estimate. This allows a location-aware application to assess whether the location estimate is sufficiently accurate for its needs." } @inproceedings{LakhinaCrovellaDiot:imc2004, author = "Anukool Lakhina and Mark Crovella and Christophe Diot", title = "Characterization of Network-Wide Anomalies in Traffic Flows", booktitle = "Proceedings of the ACM/SIGCOMM Internet Measurement Conference", month = "October", year = "2004", pages = "201--206", catID1 = "IM", catID2 = "anomalies", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/imc04-characterizing-network-wide.pdf" } @inproceedings{BestavrosBradleyKfouryOcean:basenets05, author = {Azer Bestavros and Adam Bradley and Assaf Kfoury and Michael Ocean}, title = {{SNBENCH: A Development and Run-Time Platform for Rapid Deployment of Sensor Network Applications}}, booktitle = {Proceedings of the IEEE International Workshop on Broadband Advanced Sensor Networks (Basenets 2005)}, address={Boston, MA}, month={October}, year = {2005}, url = "http://www.cs.bu.edu/fac/best/res/papers/basenets05.pdf", keywords={Real-Time, Sensor Network, Distributed Systems}, abstract = { We envision the emergence of general-purpose, well-provisioned sensor networks---which we call ``Sensoria''---that are embedded in (or overlayed atop) physical spaces, and whose use is shared amongst autonomous users of that space for independent and possibly conflicting missions. Our conception of a Sensorium stands in sharp contrast to the commonly adopted view of an embedded sensor network as a special-purpose infrastructure that serves a well-defined, fixed mission. The usefulness of a Sensorium will not be measured by how highly optimized its various protocols are, or by how efficiently its limited resources are being used, but rather by how flexible and extensible it is in supporting a wide range of applications. To that end, in this paper, we overview and present a first-generation implementation of snBench: a programming environment and associated run-time system that support the entire life-cycle of programming sensing-oriented applications. The components of snBench are analogous to those commonly found in traditional, stand-alone general-purpose computing environments. SNAFU (SensorNet Applications as Functional Units) is a high-level strongly-typed functional language that supports stateful, temporal, and persistent computation. SNAFU is compiled into an intermediate, abstract representation of the processing graph, called a STEP (Sensorium Task Execution Plan). The STEP graph is then linked to available Sensorium eXecution Environments (SXEs). A Sensorium Service Dispatcher (SSD) decomposes the STEP graph into a linked execution plan, loading STEP sub-graphs to appropriate individual SXEs and binding those loaded sub-graphs together with appropriate network protocols. The SSD may load many such programs onto a Sensorium simultaneously, taking advantage of programs' shared computation and dependencies to make more efficient use of sensing, computation, network, and storage resources. } } @inproceedings{ZhangBestavrosGuirguisMattaWest:vee05, author = {Yuting Zhang and Azer Bestavros and Mina Guirguis and Ibrahim Matta and Richard West}, title = {{Friendly Virtual Machines: Leveraging a Feedback-Control Model for Application Adaptation}}, booktitle = {Proceedings of the 2005 ACM/USENIX Conference on Virtual Execution Environments}, address={Chicago, Illinois}, month={June}, year = {2005}, url = "http://www.cs.bu.edu/fac/best/res/papers/vee05.pdf", abstract = { With the increased use of ``Virtual Machines'' (VMs) as vehicles that isolate applications running on the same host, it is necessary to devise techniques that enable multiple VMs to share underlying resources both fairly and efficiently. To that end, one common approach is to deploy complex resource management techniques in the hosting infrastructure. Alternately, in this paper, we advocate the use of self-adaptation in the VMs themselves based on feedback about resource usage and availability. Consequently, we define a ``Friendly'' VM (FVM) to be a virtual machine that adjusts its demand for system resources, so that they are both efficiently and fairly allocated to competing FVMs. Such properties are ensured using one of many provably convergent control rules, such as AIMD. By adopting this distributed application-based approach to resource management, it is not necessary to make assumptions about the underlying resources nor about the requirements of FVMs competing for these resources. To demonstrate the elegance and simplicity of our approach, we present a prototype implementation of our FVM framework in User-Mode Linux (UML)---an implementation that consists of less than 500 lines of code changes to UML. We present an analytic, control-theoretic model of FVM adaptation, which establishes convergence and fairness properties. These properties are also backed up with experimental results using our prototype FVM implementation.} } @inproceedings{GuirguisBestavrosMattaZhang:infocom05, author = {Mina Guirguis and Azer Bestavros and Ibrahim Matta and Yuting Zhang}, title = {{Reduction of Quality (RoQ) Attacks on Internet End-Systems}}, booktitle = {Proceedings of Infocom'05: The IEEE International Conference on Computer Communication}, address={Miami, Florida}, month={March}, year = {2005}, url = "http://www.cs.bu.edu/fac/best/res/papers/infocom05-roq.pdf", abstract = { Current computing systems depend on adaptation mechanisms to ensure that they remain in quiescent operating regions. These regions are often defined using efficiency, fairness, and stability properties. To that end, traditional research works in scalable server architectures and protocols have focused on promoting these properties by proposing even more sophisticated adaptation mechanisms, without the proper attention to security implications. In this paper, we exemplify such security implications by exposing the vulnerabilities of admission control mechanisms that are widely deployed in Internet end systems to Reduction of Quality (RoQ) attacks. RoQ attacks target the transients of a system's adaptive behavior as opposed to its limited steady-state capacity. We show that a well orchestrated RoQ attack on an end-system admission control policy could introduce significant inefficiencies that could potentially deprive an Internet end-system from much of its capacity, or significantly reduce its service quality, while evading detection by consuming an unsuspicious, small fraction of that system's hijacked capacity. We develop a control theoretic model for assessing the impact of RoQ attacks on an end-system's admission controller. We quantify the damage inflicted by an attacker through deriving appropriate metrics. We validate our findings through real Internet experiments performed in our lab. } } @inproceedings{SharmaBestavrosMatta:infocom05, author = {Abhishek Sharma and Azer Bestavros and Ibrahim Matta}, title = {{dPAM: A Distributed Prefetching Protocol for Scalable Asynchronous Multicast in P2P Systems}}, month={March}, year = {2005}, booktitle = {Proceedings of Infocom'05: The IEEE International Conference on Computer Communication}, address={Miami, Florida}, url = "http://www.cs.bu.edu/fac/best/res/papers/infocom05-dpam.pdf", abstract = { We leverage the buffering capabilities of endsystems to achieve scalable, asynchronous delivery of streams in a peer-to-peer environment. Unlike existing cache-and-relay schemes, we propose a distributed prefetching protocol where peers prefetch and store portions of the streaming media ahead of their playout time, thus not only turning themselves to possible sources for other peers but their prefetched data can allow them to overcome the departure of their source-peer. This stands in sharp contrast to existing cache-and-relay schemes where the departure of the source-peer forces its peer children to go the original server, thus disrupting their service and increasing server and network load. Through mathematical analysis and simulations, we show the effectiveness of maintaining such asynchronous multicasts from several source-peers to other children peers, and the efficacy of prefetching in the face of peer departures. We confirm the scalability of our dPAM protocol as it is shown to significantly reduce server load. } } @inproceedings{GuirguisBestavrosMatta:icenco04, author = {Mina Guirguis and Azer Bestavros and Ibrahim Matta}, title = {{Routing Tradeoffs inside a d-dimensional Torus with applicability to CAN}}, booktitle = {Proceedings of the 1st International Computer Engineering Conference New Technologies for the Information Society (ICENCO'04)}, address={Cairo, Egypt}, url = "http://www.cs.bu.edu/fac/best/res/papers/icenco04.pdf", month={December}, year={2004}, abstract={ Overlay networks have evolved as powerful systems enabling the development of new applications ranging from simple file sharing applications to more complex applications for managing Internet traffic. Content Addressable Network (CAN) is one such network where nodes (peers) are organized in a d-dimensional torus. Nodes maintain state for their immediate neighbors and a request is routed inside the network through the neighbor that is closest to the destination. This process is repeated until the request reaches its destination. In this paper, we consider routing tradeoffs between space and time; Space in terms of state maintained at each node and time in terms of the average path length experienced as requests get routed inside the network. Our findings motivate the importance for nodes to maintain state, not just for their immediate neighbors, but also for a few Long Range Nodes (LRNs). These LRNs will allow longer jumps inside the space, reducing the average path length. We evaluate the effect of having these long jumps through comparing different setups that store the same amount of state. Based on this, we propose a new dynamical scheme where nodes update their LRNs in order to adapt to the nature of requests. This has significant implication when some nodes become popular in hot-spot zones. We validate our findings through simulations. } } @inproceedings{GuirguisBestavrosMatta:ccn04, author = {Mina Guirguis and Azer Bestavros and Ibrahim Matta}, title = {{Bandwidth Stealing via Link-targeted RoQ Attacks}}, booktitle = {Proceedings of CCN'04: IASTED International Conference on Communication and Computer Networks}, month={November}, year = {2004}, address={MIT, Cambridge, MA}, url = "http://www.cs.bu.edu/fac/best/res/papers/ccn04.pdf", abstract = { We present a scheme that enables a set of flows to acquire an unfair share of bandwidth by mounting an adversarial distributed Reduction of Quality (RoQ) attack on flows competing for that bandwidth. This adversarial behavior stands in sharp contrast to other network exploits, e.g., Denial-of- Service (DoS) attacks, whose aim is to simply take down a resource, or severely limit access to a service. The extent to which the scheme we expose is successful in slowing down competing flows determines the amount of "stolen bandwidth." We present two schemes for the construction of a RoQ attack stream that would evade detection, and thus would challenge counter-DoS techniques. Our results show the vulnerability of the Internet to the distributed nature of RoQ attacks, which could be mounted through a relatively small number of zombie clients, motivating the need for the development of counter measures. We validate our findings through simple analysis, simulations and real Internet experiments.} } @inproceedings{GuirguisBestavrosMattaRigaDiamantZhang:iscc04, author = {Mina Guirguis and Azer Bestavros and Ibrahim Matta and Niky Riga and Gali Diamant and Yuting Zhang}, title = {{Providing Soft Bandwidth Guarantees Using Elastic TCP-based Tunnels}}, booktitle = {Proceedings of ISCC'04: IEEE Symposium on Computer and Communications}, year = {2004}, address={Alexandria, Egypt}, url = "http://www.cs.bu.edu/fac/best/res/papers/iscc04.pdf", abstract = { The best-effort nature of the Internet poses a significant obstacle to the deployment of many applications that require guaranteed bandwidth. In this paper, we present a novel approach that enables two edge/border routers which we call Internet Traffic Managers (ITM) to use an adaptive number of TCP connections to set up a tunnel of desirable bandwidth between them. The number of TCP connections that comprise this tunnel is elastic in the sense that it increases/decreases in tandem with competing cross traffic to maintain a target bandwidth. An origin ITM would then schedule incoming packets from an application requiring guaranteed bandwidth over that elastic tunnel. Unlike many proposed solutions that aim to deliver soft QoS guarantees, our elastic-tunnel approach does not require any support from core routers (as with IntServ and DiffServ); it is scalable in the sense that core routers do not have to maintain per-flow state (as with IntServ); and it is readily deployable within a single ISP or across multiple ISPs. To evaluate our approach, we develop a flow-level controltheoretic model to study the transient behavior of established elastic TCP-based tunnels. The model captures the effect of cross-traffic connections on our bandwidth allocation policies. Through extensive simulations, we confirm the effectiveness of our approach in providing soft bandwidth guarantees. } } @inproceedings{MorcosMattaBestavros:sensys04, author = "Hany Morcos and Ibrahim Matta and Azer Bestavros", title = {{M2RC: Multiplicative-increase/additive-decrease Multipath Routing Control for Wireless Sensor Networks}}, booktitle = "{Proceedings of the Second ACM Conference on Embedded Networked Sensor Systems (ACM SenSys '04)}", month = "November", address = "Baltimore, Maryland", year = 2004, note = "Short Paper", url = "http://www.cs.bu.edu/fac/best/res/papers/sensys04.pdf", abstract = { Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSNs are deployed negatively affect the quality of the routing process. Therefore, routing protocols for WSNs should recognize and react to node failures and packet losses. Second, sensor nodes are battery-powered, which makes power a scarce resource. Routing protocols should optimize power consumption to prolong the lifetime of the WSN. In this paper, we present a new adaptive routing protocol for WSNs, we call it M2RC. M2RC has two phases: mesh establishment phase and data forwarding phase. In the first phase,M2RC establishes the routing state to enable multipath data forwarding. In the second phase, M2RC forwards data packets from the source to the sink. Targeting hop-by-hop reliability, an M2RC forwarding node waits for an acknowledgement (ACK) that its packets were correctly received at the next neighbor. Based on this feedback, an M2RC node applies multiplicative-increase/additive-decrease (MIAD) to control the number of neighbors targeted by its packet broadcast. We simulated M2RC in the ns-2 simulator and compared it to GRAB, Max-power, and Min-power routing schemes. Our simulations show that M2RC achieves the highest throughput with at least 10-30 percent less consumed power per delivered report in scenarios where a certain number of nodes unexpectedly fail. } } @inproceedings{DiamantVeytserMattaBestavrosGuirguisGuoZhangChen:camad04, author = {Gali Diamant and Leonid Veytser and Ibrahim Matta and Azer Bestavros and Mina Guirguis and Liang Guo and Yuting Zhang and Sean Chen}, title = {{itmBench: Generalized {API} for Internet Traffic Managers}}, booktitle = {Proceedings of the 10th IEEE Globecom Workshop on Computer-Aided Modeling, Analysis and Design of Communication Links and Networks (CAMAD'04)}, month = {{November}}, year = {2004}, address={Austin, Texas}, url = "http://www.cs.bu.edu/fac/best/res/papers/camad04.pdf", abstract = { Internet Traffic Managers (ITMs) are special machines placed at strategic places in the Internet. itmBench is an interface that allows users (e.g. network managers, service providers, or experimental researchers) to register different traffic control functionalities to run on one ITM or an overlay of ITMs. Thus itmBench offers a tool that is extensible and powerful yet easy to maintain. ITM traffic control applications could be developed either using a kernel API so they run in kernel space, or using a user-space API so they run in user space. We demonstrate the flexibility of itmBench by showing the implementation of both a kernel module that provides a differentiated network service, and a user-space module that provides an overlay routing service. Our itmBench Linux-based prototype is free software and can be obtained from http://www.cs.bu.edu/groups/itm/.} } @inproceedings{GuirguisBestavrosMatta:icnp04, author={Mina Guirguis and Azer Bestavros and Ibrahim Matta}, title= {{Exploiting the Transients of Adaptation for RoQ Attacks on Internet Resources}}, booktitle={{Proceedings of ICNP'04: The 12th IEEE International Conference on Network Protocols}}, address={Berlin, Germany}, keywords={Protocol Verification, Internet and Web Protocol Composition}, month={October}, year=2004, url = "http://www.cs.bu.edu/fac/best/res/papers/icnp04-roq.pdf", abstract={ We expose an unorthodox adversarial attack that exploits the transients of a system's adaptive behavior, as opposed to its limited steady-state capacity. We show that a well orchestrated attack could introduce significant inefficiencies that could potentially deprive a network element from much of its capacity, or significantly reduce its service quality, while evading detection by consuming an unsuspicious, small fraction of that element's hijacked capacity. This type of attack stands in sharp contrast to traditional brute-force, sustained high-rate DoS attacks, as well as recently proposed attacks that exploit specific protocol settings such as TCP timeouts. We exemplify what we term as Reduction of Quality (RoQ) attacks by exposing the vulnerabilities of common adaptation mechanisms. We develop control-theoretic models and associated metrics to quantify these vulnerabilities. We present numerical and simulation results, which we validate with observations from real Internet experiments. Our findings motivate the need for the development of adaptation mechanisms that are resilient to these new forms of attacks.} } @inproceedings{BradleyBestavrosKfoury:icnp04, author={Adam Bradley and Azer Bestavros and Assaf Kfoury}, title= {{A Typed Model for Encoding-Based Protocol Interoperability}}, booktitle={{Proceedings of ICNP'04: The 12th IEEE International Conference on Network Protocols}}, address={Berlin, Germany}, keywords={Protocol Verification, Internet and Web Protocol Composition}, month={October}, year=2004, url = "http://www.cs.bu.edu/fac/best/res/papers/icnp04-model.pdf", abstract={ Documentation of the HTTP protocol includes precise descriptions of the syntax of the protocol, but lacks similarly precise specification of the semantics of messages and message bodies. Semantics are stated in English prose; while this makes the document more intuitively accessible, it makes any sort of formal claims of correctness or interoperability difficult to derive from the specification itself. We propose "layered types", a formal description of the interpretive semantics of HTTP message bodies based upon the stacked type syntax. This model allows us to formally declare semantics for content-related HTTP headers and offers a precise way of characterizing interoperability between current and future protocol revisions and extensions. } } @inproceedings{ErramilliMattaBestavros:secon04, author = "Vijay Erramilli and Ibrahim Matta and Azer Bestavros", title = {{On the Interaction between Data Aggregation and Topology Control in Wireless Sensor Networks}}, booktitle = "{Proceedings of the First IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (IEEE SECON 2004)}", month = "October", address = "Santa Clara, CA", year = 2004, abstract = { Wireless sensor networks are characterized by limited energy resources. To conserve energy, application-specific aggregation (fusion) of data reports from multiple sensors can be beneficial in reducing the amount of data flowing over the network. Furthermore, controlling the topology by scheduling the activity of nodes between active and sleep modes has often been used to uniformly distribute the energy consumption among all nodes by de-synchronizing their activities. We present an integrated analytical model to study the joint performance of in-network aggregation and topology control. We define performance metrics that capture the tradeoffs among delay, energy, and fidelity of the aggregation. Our results indicate that to achieve high fidelity levels under medium to high event reporting load, shorter and fatter aggregation/routing trees (toward the sink) offer the best delay-energy tradeoff as long as topology control is well coordinated with routing. } } @inproceedings{SharmaBestavrosMatta:wcw04, author={Abhishek Sharma and Azer Bestavros and Ibrahim Matta}, title= {{Performance Evaluation of Distributed Prefetching for Asynchronous Multicast in P2P Networks}}, booktitle={{Proceedings of WCW'04: The 9th International Workshop on Web Caching And Content Distribution}}, address={Beijing, China}, keywords={P2P Networks, Caching, Prefetching, real-Time, Streaming Media Delivery}, month={October}, year=2004, url = "http://www.cs.bu.edu/fac/best/res/papers/wcw04.pdf", abstract={We consider the problem of delivering real-time, near real-time and stored streaming media to a large number of asynchronous clients. This problem has been studied in the context of asynchronous multicast and peer-to-peer content distribution. In this paper we eval- uate through extensive simulations the performance of the distributed prefetching protocol, dPAM, proposed for scalable, asynchronous multicast in P2P systems. We show that the prefetch-and-relay strategy of dPAM can reduce the server bandwidth requirement quite signifi- cantly, compared to the previously proposed cache-and-relay strategy, even when the group of clients downloading a stream changes quite fre- quently due to client departures.} } @inproceedings{SmaragdakisMattaBestavros:sanpa04, author={Georgios Smaragdakis and Ibrahim Matta and Azer Bestavros}, title= {{SEP: A Stable Election Protocol for clustered heteregeneous wireless sensor networks}}, booktitle={{Proceedings of SANPA'04: Second International Workshop on Sensor and Actor Network Protocols and Applications}}, address={Boston, MA}, keywords={Sensor Networks, Wireless Networking, Ad Hoc Networking}, month={August}, year=2004, url = "http://www.cs.bu.edu/fac/best/res/papers/sanpa04-sep.pdf", abstract={ We study the impact of heterogeneity of nodes, in terms of their energy, in wireless sensor networks that are hierarchically clustered. In these networks some of the nodes become cluster heads, aggregate the data of their cluster members and transmit it to the sink. We assume that a percentage of the population of sensor nodes is equipped with additional energy resources?this is a source of heterogeneity which may result from the initial setting or as the operation of the network evolves. We also assume that the sensors are randomly (uniformly) distributed and are not mobile, the coordinates of the sink and the dimensions of the sensor field are known. We show that the behavior of such sensor networks becomes very unstable once the first node dies, especially in the presence of node heterogeneity. Classical clustering protocols assume that all the nodes are equipped with the same amount of energy and as a result, they can not take full advantage of the presence of node heterogeneity. We propose SEP, a heterogeneous-aware protocol to prolong the time interval before the death of the first node (we refer to as stability period), which is crucial for many applications where the feedback from the sensor network must be reliable. SEP is based on weighted election probabilities of each node to become cluster head according to the remaining energy in each node. We show by simulation that SEP always prolongs the stability period compared to (and that the average throughput is greater than) the one obtained using current clustering protocols. We conclude by studying the sensitivity of our SEP protocol to heterogeneity parameters capturing energy imbalance in the network. We found that SEP yields longer stability region for higher values of extra energy brought by more powerful nodes.} } @inproceedings{RigaMattaBestavros:sanpa04, author={Niky Riga and Ibrahim Matta and Azer Bestavros}, title= {{DIP: Density Inference Protocol for wireless sensor networks and its application to density-unbiased statistics}}, booktitle={{Proceedings of SANPA'04: Second International Workshop on Sensor and Actor Network Protocols and Applications}}, address={Boston, MA}, keywords={Sensor Networks, Wireless Networking, Ad Hoc Networking}, month={August}, year=2004, url = "http://www.cs.bu.edu/fac/best/res/papers/sanpa04-dip.pdf", abstract={ Wireless sensor networks have recently emerged as enablers of important applications such as environmental, chemical and nuclear sensing systems. Such applications have sophisticated spatial-temporal semantics that set them aside from traditional wireless networks. For example, the computation of temperature averaged over the sensor field must take into account local densities. This is crucial since otherwise the estimated average temperature can be biased by over-sampling areas where a lot more sensors exist. Thus, we envision that a fundamental service that a wireless sensor network should provide is that of estimating local densities. In this paper, we propose a lightweight probabilistic density inference protocol, we call DIP, which allows each sensor node to implicitly estimate its neighborhood size without the explicit exchange of node identifiers as in existing density discovery schemes. The theoretical basis of DIP is a probabilistic analysis which yields the relationship between the number of sensor nodes contending in the neighborhood of a node and the level of contention measured by that node. Extensive simulations confirm the premise of DIP: it can provide statistically reliable and accurate estimates of local density at a very low energy cost and constant running time. We demonstrate how applications could be built on top of our DIP-based service by computing density-unbiased statistics from estimated local densities.} } @article{JinBestavros:comnet:05, author={Shudong Jin and Azer Bestavros}, title={{Small-world Characteristics of Internet Topologies and Multicast Scaling}}, keywords={Internet Characterization, Internet Topology, Multicast}, url={http://www.cs.bu.edu/fac/best/res/papers/comnet05.pdf}, journal = "{The Computer Networks Journal (COMNET): The International Journal of Computer and Telecommunications Networking}", month = {}, year = 2005, volume = {}, publisher = {{Elsevier}}, abstract={} } @article{MorcosMattaBestavros:sigbed05, author = "Hany Morcos and Ibrahim Matta and Azer Bestavros", title = {{M2RC: Multiplicative-increase/additive-decrease Multipath Routing Control for Wireless Sensor Networks}}, journal = "{ACM SIGBED Review, Special Issue on the Best of SenSys 2004}", month = "January", year = 2005, number = {1}, volume = {2}, publisher = {{ACM Press}}, url = {{http://www.cs.bu.edu/faculty/best/res/papers/sigbed05.pdf}}, abstract = { Routing protocols in wireless sensor networks (WSN) face two main challenges: first, the challenging environments in which WSNs are deployed negatively affect the quality of the routing process. Therefore, routing protocols for WSNs should recognize and react to node failures and packet losses. Second, sensor nodes are battery-powered, which makes power a scarce resource. Routing protocols should optimize power consumption to prolong the lifetime of the WSN. In this paper, we present a new adaptive routing protocol for WSNs, we call it M2RC. M2RC has two phases: mesh establishment phase and data forwarding phase. In the first phase,M2RC establishes the routing state to enable multipath data forwarding. In the second phase, M2RC forwards data packets from the source to the sink. Targeting hop-by-hop reliability, an M2RC forwarding node waits for an acknowledgement (ACK) that its packets were correctly received at the next neighbor. Based on this feedback, an M2RC node applies multiplicative-increase/additive-decrease (MIAD) to control the number of neighbors targeted by its packet broadcast. We simulated M2RC in the ns-2 simulator and compared it to GRAB, Max-power, and Min-power routing schemes. Our simulations show that M2RC achieves the highest throughput with at least 10-30 percent less consumed power per delivered report in scenarios where a certain number of nodes unexpectedly fail. } } @article{BestavrosBradleyKfouryMatta:ccr04, author = {Azer Bestavros and Adam Bradley and Assaf Kfoury and Ibrahim Matta}, title = {{Safe Compositional Specification of Networking Systems}}, journal = {{ACM SIGCOMM Computer Communication Review (CCR)}}, publisher = {{ACM Press}}, number = 3, volume = 34, month = {{July}}, year = {2004}, url = {http://www.cs.bu.edu/fac/best/res/papers/ccr04.pdf}, abstract = { The Science of Network Service Composition has clearly emerged as one of the grand themes driving many of our research questions in the networking field today [NeXtworking 2003]. This driving force stems from the rise of sophisticated applications and new networking paradigms. By ``service composition'' we mean that the performance and correctness properties local to the various constituent components of a service can be readily composed into global (end-to-end) properties without re-analyzing any of the constituent components in isolation, or as part of the whole composite service. The set of laws that would govern such composition is what will constitute that new science of composition. The combined heterogeneity and dynamic open nature of network systems makes composition quite challenging, and thus programming network services has been largely inaccessible to the average user. We identify (and outline) a research agenda in which we aim to develop a specification language that is expressive enough to describe different components of a network service, and that will include type hierarchies inspired by type systems in general programming languages that enable the safe composition of software components. We envision this new science of composition to be built upon several theories (e.g., control theory, game theory, network calculus, percolation theory, economics, queuing theory). In essence, different theories may provide different languages by which certain properties of system components can be expressed and composed into larger systems. We then seek to lift these lower-level specifications to a higher level by abstracting away details that are irrelevant for safe composition at the higher level, thus making theories scalable and useful to the average user. In this paper we focus on services built upon an overlay management architecture, and we use control theory and QoS theory as example theories from which we lift up compositional specifications.} } @incollection{GusyatinUrBe04, author = {O. Gusyatin and M. Urinson and M. Betke}, title = {A Method to Extend Functionality of Pointer Input Devices}, editor = {C. Stary and C. Stephanidis}, booktitle = {Proceedings of the 8th International ERCIM Workshop on User Interfaces for All, Revised Selected Papers, Lecture Notes in Computer Science 3196}, year = 2004, month = Jun, address = {Vienna, Austria}, publisher = {Springer Verlag}, pages = {426--439}, } @article{BetkeGuUr05, author = {M. Betke and O. Gusyatin and M. Urinson}, title = {Symbol{D}esign: A User-centered Method to Design Pen-based Interfaces and Extend the Functionality of Pointer Input Devices}, journal = {Universal Access in the Information Society}, note = {In print}, year = 2005, } @inproceedings{MageeScWaBe04, author ={Magee, J. J. and M. R. Scott and B. N. Waber and M. Betke}, title = {Eye{K}eys: A Real-time Vision Interface Based on Gaze Detection from a Low-grade Video Camera}, booktitle = {IEEE Workshop on Real-Time Vision for Human-Computer Interaction (RTV4HCI)}, address = {Washington, D.C.}, month = Jul, year = 2004, note = {8 pp.}, publisher = {IEEE Computer Society} } @incollection{MageeBeScWa05, author = {J. J. Magee and M. Betke and M. R. Scott and B. N. Waber}, title = {A Real-time Vision Interface Based on Gaze Detection -- {E}ye{K}eys}, booktitle ={Real-Time Vision for Human-Machine Interaction}, editor = {B. Kisacanin and V. Pavlovic and T. S. Huang}, publisher = {Springer Verlag}, year = 2005, note = {In press}, } @inproceedings{Yuan05p, author="Q. Yuan and S. Sclaroff and V. Athitsos", title="Automatic 2{D} Hand Tracking in Video Sequences", booktitle="Proc.\ IEEE Workshop on Applications of Computer Vision (WACV)", year="2005", pages="250-256"} @inproceedings{Li05p, author="R. Li and S. Sclaroff", title="Multi-scale 3{D} scene flow from binocular stereo sequences", booktitle="Proc.\ IEEE Motion Workshop", year="2005", pages="147-153"} @inproceedings{Tian05p, author="T.P. Tian and S. Sclaroff", title="Hand signals recognition from video using 3{D} motion capture archive", booktitle="Proc.\ IEEE Motion Workshop", year="2005", pages="189-194"} @inproceedings{Thangali05p, author="A. Thangali and S. Sclaroff", title="Periodic Motion Detection and Estimation via Space-Time Sampling", booktitle="Proc.\ IEEE Motion Workshop", year="2005", pages="176-182"} @inproceedings{Alon05p, author="J. Alon and V. Athitsos and S. Sclaroff", title="Simultaneous Localization and Recognition of Dynamic Hand Gestures", booktitle="Proc.\ IEEE Motion Workshop", year="{2005}", pages="254-260"} @inproceedings{Athitsos05p, author="V. Athitsos and J. Alon and S. Sclaroff and G. Kollios", title="Filtering Methods for Similarity-Based Multimedia Retrieval", booktitle="Proc.\ Seventh International Workshop of the EU Network of Excellence DELOS on AUdio-Visual Content and Information Visualization in Digital Libraries (AVIVDiLib)", pages="77-86", year="{2005}"} @inproceedings{Erdem04p, author="M. Erdem and S. Sclaroff", title="Optimal placement of cameras in floorplans to satisfy task requirements", booktitle="Proc.\ Workshop on Omnidirectional Vision, Camera Networks, and Non-classical Cameras (OMNIVIS)", pages = "30--41", year="{2004}"} @InProceedings{Athitsos04pa, author="V. Athitsos and J. Alon and S. Sclaroff and G. Kollios", title="BoostMap: A method for efficient approximate similarity rankings", booktitle={Proc.\ IEEE Conf.\ on Computer Vision and Pattern Recognition (CVPR)}, pages="II:268-275", year="{2004}"} @inproceedings{Buzan04p, author="D. Buzan and S. Sclaroff", title="Extraction and Clustering of Motion Trajectories in Video", booktitle={IEEE International Conference on Pattern Recognition}, pages="II:512-524", year="{2004}"} @inproceedings{LaCascia04p, author="M. La Cascia and L. Valenti and S. Sclaroff", title="Fully Automatic, Real-Time Detection of Facial Gestures from Generic Video", booktitle="Proc.\ IEEE Multimedia Signal Processing (MMSP)", year="2004"} @InProceedings{Gusyatin04, author="Oleg Gusyatin and Mikhail Urinson and Margrit Betke", title="A Method to Extend Functionality of Pointer Input Devices", booktitle="Proc. 8th ERCIM Workshop on User Interfaces for All", year="2004"} @InProceedings{Mamoulis04, author="Nikos Mamoulis and Huping Cao and George Kollios and Marios Hadjieleftheriou and Yufei Tao and David Cheung", title="Mining, Indexing, and Querying Historical Spatio-temporal Data", booktitle="{Proc. ACM International Conference on Knowledge Discovery and Data Mining (SIGKDD)}", year=2004} @InProceedings{Zhong03p, author="J. Zhong and S. Sclaroff", title="Segmenting foreground objects from a dynamic textured background via a robust {K}alman filter", booktitle={Proc.\ IEEE International Conf.\ on Computer Vision (ICCV)}, pages="44-50", year={2003}} @InProceedings{Isidoro03p, author="J. Isidoro and S. Sclaroff", title="Stochastic refinement of the visual hull to satisfy photometric and silhouette consistency constraints", booktitle={Proc.\ IEEE International Conf.\ on Computer Vision (ICCV)}, pages="1335-1342", year={2003}} @InProceedings{Isidoro02p, author = {J. Isidoro and S. Sclaroff}, title = "Stochastic mesh-based multiview reconstruction", booktitle = {Proc.~International Symposium on 3D Data Processing, Visualization, and Transmission}, pages = "568-577", month = "June", year = {2002} } @InProceedings{Siddiqui02p, author = {M. Siddiqui and S. Sclaroff}, title = "Surface reconstruction from multiple views using rational {B}-splines and knot insertion", booktitle = {Proc.~International Symposium on 3D Data Processing, Visualization, and Transmission}, pages = "372--378", month = "June", year = {2002} } @InProceedings{Alon03p, author = "J. Alon and S. Sclaroff and G. Kollios and V. Pavlovic", title = "Discovering clusters in motion time series data", booktitle={Proc.\ IEEE Conf.\ on Computer Vision and Pattern Recognition (CVPR)}, year="{2003}" } @InProceedings{Athitsos03p, author = "V. Athitsos and S. Sclaroff", title = "Estimating 3{D} Hand Pose from a cluttered image", booktitle={Proc.\ IEEE Conf.\ on Computer Vision and Pattern Recognition (CVPR)}, year={2003} } @InProceedings{Athitsos03pa, author="V. Athitsos and S. Sclaroff", title="Database indexing methods for 3{D} hand pose estimation", booktitle="Proc.\ 5th International Workshop on Gesture and Sign Language based Human-Computer Interaction", year="{2003}"} @inproceedings{CloudBeGi02, author = {Cloud, R. L. and M. Betke and J. Gips}, title = {Experiments with a Camera-Based Human-Computer Interface System}, booktitle = {7th ERCIM Workshop on User Interfaces for All}, year = 2002, month = Oct, pages = {103--110}, address = {Paris, France}, } @inproceedings{FagianiBeGi02, author = {Fagiani, C. and M. Betke and J. Gips}, title = {Evaluation of Tracking Methods for Human-Computer Interaction}, booktitle = {IEEE Workshop on Applications in Computer Vision}, year = 2002, month = Dec, address = {Orlando, Florida}, pages = {121--126}, } @inproceedings{LombardiBe02, author = {Lombardi, J. and M. Betke}, title = {A Camera-based Eyebrow Tracker for Hands-free Computer Control via a Binary Switch}, booktitle = {7th ERCIM Workshop on User Interfaces for All}, year = 2002, month = Oct, pages = {199--200}, address = {Paris, France}, } @inproceedings{CramptonBe02, author = {Crampton, S. and M. Betke}, title = {Finger Counter: A Human-Computer Interface}, booktitle = {7th ERCIM Workshop on User Interfaces for All}, year = 2002, month = Oct, pages = {195--195}, address = {Paris, France}, } @inproceedings{GipsDiBe02, author = {Gips, J. and P. DiMattia and M. Betke}, title = {Collaborative Development of New Access Technology and Communication Software}, booktitle = {Proceedings of the 10th Biennial Conference of the International Society for Augmentative and Alternative Communication (ISAAC 2002)}, year = 2002, month = Aug, address = {Odense, Denmark}, } @article{GraumanBeLoGiBr03, author = {Grauman, K. and M. Betke and J. Lombardi and J. Gips and G. R. Bradski}, title = {Communication via Eye Blinks and Eyebrow Raises: Video-Based Human-Computer Interfaces}, month = Nov, year = 2003, volume = 2, number = 4, pages = {359--373}, journal = {International Journal Universal Access in the Information Society}, } @inproceedings{CramptonBe03, author = {Crampton, S. and M. Betke}, title = {Counting Fingers in Real Time: A Webcam-Based Human-Computer Interface with Game Applications}, booktitle = {Universal Access in Human-Computer Interaction ({UA-HCI})}, year = 2003, month = Jun, pages = {1357--1361}, address = {Crete, Greece}, } @Article{tpds03, author = {Raj Krishnamurthy and Karsten Schwan and Richard West and Marcel Rosu}, title = {On Network Coprocessors for Scalable, Predictable Media Services}, journal = {IEEE Transactions on Parallel and Distributed Systems}, year = {2003}, OPTkey = {}, volume = {14}, number = {7}, pages = {655-670}, month = {July}, OPTnote = {}, OPTannote = {} } @InProceedings{rtss03, author = {Gerald Fry and Richard West}, title = {Adaptive Routing of QoS-constrained Media Streams over Scalable Overlay Topologies}, booktitle = {IEEE Real-Time Systems Symposium (work-in-progrss)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2003}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {December}, OPTorganization = {}, OPTpublisher = {}, note = {Full version in IEEE RTAS, May 2004}, OPTannote = {} } @InProceedings{fccm04, author = {Raj Krishnamurthy and Sudhakar Yalamanchili and Karsten Schwan and Richard West}, title = {ShareStreams: A Scalable Architecture and Hardware Support for High-Speed QoS Packet Schedulers}, booktitle = {Proceedings of the 12th IEEE Symposium on Field-Programmable Custom Computing Machines}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {April}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @inproceedings{BradleyBestavrosKfoury:icnp03, author={Adam Bradley and Azer Bestavros and Assaf Kfoury}, title= {{Systematic Verification of Safety Properties of Arbitrary Network Protocol Compositions Using CHAIN}}, booktitle={{Proceedings of ICNP'03: The 11th IEEE International Conference on Network Protocols}}, address={Atlanta, GA}, keywords={Protocol Verification, Internet and Web Protocol Composition}, month={November}, year=2003, url = "http://www.cs.bu.edu/fac/best/res/papers/icnp03.pdf", abstract={} } @inproceedings{JinBestavros:mascots03, author={Shudong Jin and Azer Bestavros}, title={{Small-world Characteristics of Internet Topologies and Multicast Scaling}}, keywords={Internet Characterization, Internet Topology, Multicast}, url={http://www.cs.bu.edu/fac/best/res/papers/mascots03.pdf}, booktitle={{Proceedings of Mascots'2003: The IEEE/ACM International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems}}, year=2003, month={October}, address={Orlando, FL}, abstract={} } @inproceedings{BestavrosJin:icdcs03, author={Azer Bestavros and Shudong Jin}, title={{OSMOSIS: Scalable Delivery of Real-Time Streaming Media in Ad-Hoc Overlay Networks}}, booktitle = {Proceedings of IEEE ICDCS'03 Workshop on Data Distribution in Real-Time Systems}, address={Providence, RI}, month={May}, year=2003, url={http://www.cs.bu.edu/fac/best/res/papers/icdcs03.pdf}, abstract={Ad-hoc overlay networks are increasingly used for sharing static bulk content but their promise for scaling the delivery of on-demand, real-time content is yet to be tapped. In this paper, we show that overlay networks could be used efficiently to distribute popular real-time streaming media on-demand to a large number of clients. We propose and evaluate OSMOSIS a cache-and-relay end-system multicast approach, whereby a client joining a multicast session caches the stream, and if needed, relays that stream to neighboring clients which may join the multicast session at some later time. OSMOSIS is fully distributed, scalable, and efficient in terms of network link costs. We present analytical and empirical results of our evaluation of OSMOSIS. Our analysis establishes OSMOSIS scalability characteristics under a variety of assumptions. Our simulations are over large, synthetic random networks, power-law degree networks, and small-world networks (all of which could well be representative of ad-hoc overlay topologies, as well as over large real router-level Internet maps.} } @inproceedings{HarfoushBestavrosByers:infocom03, author={Khaled Harfoush and Azer Bestavros and John Byers}, title={{Measuring Bottleneck Bandwidth of Targeted Path Segments}}, keywords={Beacon, Internet Measurement}, booktitle = {Proceedings of Infocom'03: The IEEE International Conference on Computer Communication}, address={San Fransisco, CA}, month={May}, year=2003, url={http://www.cs.bu.edu/fac/best/res/papers/infocom03.pdf}, abstract={} } @inproceedings{VelosoAlmeidaMeiraBestavrosJin:imw02, author={Eveline Veloso and Virgilio Almeida and Wagner Meira and Azer Bestavros and Shudong Jin}, title={{A Hierarchical Characterization of a Live Streaming Media Workload}}, keywords={Web Characterization, Internet Measurement, Networking}, month={November}, year=2002, address={Marseille, France}, url = {http://www.cs.bu.edu/faculty/best/res/papers/imw02.pdf}, booktitle={Proceedings of the ACM/Usenix Internet Measurment Workshop (IMW'02)}, abstract={We present what we believe to be the first thorough characterization of {\em live} streaming media content delivered over the Internet. Our characterization of over 3.5 million requests spanning a 28-day period is done at three increasingly granular levels, corresponding to clients, sessions, and transfers. Our findings support two important conclusions. First, we show that the nature of interactions between users and objects is fundamentally different for live versus stored objects. Access to stored objects is {\em user driven}, whereas access to live objects is {\em object driven}. This reversal of active/passive roles of users and objects leads to interesting dualities. For instance, our analysis underscores a Zipf-like profile for user interest in a given object, which is in contrast to the classic Zipf-like popularity of objects for a given user. Also, our analysis reveals that transfer lengths are highly variable and that this variability is due to the stickiness of clients to a particular live object, as opposed to structural (size) properties of objects. Second, by contrasting two live streaming workloads from two radically different applications, we conjecture that some characteristics of live media access workloads are likely to be highly dependent on the nature of the live content being accessed. In our study, this dependence is clear from the strong temporal correlations observed in the traces, which we attribute to the synchronizing impact of live content on access characteristics. Based on our analyses, we present a model for live media workload generation that incorporates many of our findings, and which we implement in \sc{Gismo} \cite{JinBestavros:per01}.} } @inproceedings{JinBestavros:ngc02, author={Shudong Jin and Azer Bestavros}, title={{Cache and Relay Streaming Media Delivery for Asynchronous Clients}}, booktitle={{Proceedings of the 4th International Workshop on Networked Group Communication}}, year=2002, month={October}, address={Boston, MA}, url = {http://www.cs.bu.edu/faculty/best/res/papers/ngc02.pdf}, keywords={Web Caching, Internet Protocols, End-system Multicast, Scalable Content Distribution}, abstract={We consider the problem of efficient delivery of popular streaming media to a large number of asynchronous clients. We propose a buffer-and-relay end system multicast approach, whereby a client joining a multicast session buffers the stream (either partially or entirely) and, if needed, relays that stream to neighboring clients which may join the multicast session at some later time. This buffer-and-relay approach is fully distributed, scalable, and efficient in terms of network link cost. In this paper we evaluate this approach under assumptions of (1) limited client bandwidth, and (2) limited client buffering capacity. When client bandwidth is limited, we show that while finding an optimal solution is NP-hard, a simple greedy algorithm performs surprisingly well in that it incurs network link costs that are very close to a theoretically-derived lower bound. When client buffering capacity is limited, we show that our greedy algorithm significantly reduces network link costs. We have evaluated our buffer-and-relay approach using simulation over large, synthetic random networks, power-law degree networks, and small-world networks, as well as over large real router-level Internet maps.} } @inproceedings{JinBestavros:sigmetrics02, author={Shudong Jin and Azer Bestavros}, title={{Scalability of Multicast Delivery for Non-sequential Streaming Access}}, booktitle = {{Proceedings of Sigmetrics'2002: The ACM International Conference on Measurement and Modeling of Computer Systems}}, year=2002, url={http://www.cs.bu.edu/fac/best/res/papers/sigmetrics02.pdf}, keywords={Internet, Characterization, Streaming Media, Multicast, Web, Real-Rime, Networking}, abstract={Multicast is considered a panacea for scalable streaming media delivery over the Internet. To enable asynchronous service over a multicast infrastructure, two categories of techniques have been proposed: stream merging and periodic broadcasting. The scalability of these techniques stems from the fact that for sequential streaming access, the required server bandwidth grows {\em logarithmically} with request arrival rates for stream merging techniques, and {\em logarithmically} with the inverse of start-up delay for periodic multicasting techniques. Recent studies raise doubts as to the appropriateness of the sequential access model (in which access to a stream proceeds uninterrupted from beginning to end). A non-sequential access model (allowing access to start at random points in the stream) is more accurate as it allows the modeling of partial access and client inter-activity. In this paper, we analytically and experimentally (re-)evaluate the scalability of multicast delivery under a non-sequential access model. We show that under such a realistic model, the required server bandwidth for any protocol providing immediate service grows at least as fast as the {\em square root} of the request arrival rate, and that the required server bandwidth for any protocol providing delayed service grows {\em linearly} with the inverse of the start-up delay. We also investigate the impact of limited client bandwidth on scalability. We present practical protocols, which provide immediate service to non-sequential requests (subject to limited client bandwidth), and which are near-optimal in that the required server bandwidth is very close to its lower bound.} } @inproceedings{JinBestavrosIyengar:icdcs02, author={Shudong Jin and Azer Bestavros and Arun Iyengar}, title={{Accelerating Internet Streaming Media Delivery using Network-Aware Partial Caching}}, booktitle = {Proceedings of ICDCS'2002: The IEEE International Conference on Distributed Computing Systems}, year=2002, url={http://www.cs.bu.edu/fac/best/res/papers/icdcs02.pdf}, keywords={Internet, Characterization, Streaming Media, Multicast, Web,Real-Rime}, abstract={Internet streaming applications are adversly affected by network conditions such as high packet loss rates and long delays. This paper aims at mitigating such effects by leveraging the availability of client-side caching proxies. We present a novel caching architecture (and associated cache management algorithms) that turn edge caches into accelerators of streaming media delivery. A salient feature of our caching algorithms is that they allow partial caching of streaming media objects and joint delivery of content from caches and origin servers. The caching algorithms we propose are both network-aware and stream-aware; they take into account the popularity of streaming media objects, their bit-rate requirements, and the available bandwidth between clients and servers. Using realistic models of Internet bandwidth (derived from proxy cache logs and measured over real Internet paths), we have conducted extensive simulations to evaluate the performance of various caching management alternatives. Our experiments demonstrate that network-aware caching algorithms can significantly reduce service delay and improve overall stream quality. Also, our experiments show that partial caching is particularly effective when bandwidth variability is not very high.} } @inproceedings{BestavrosByersHarfoush:infocom02, author={Azer Bestavros and John Byers and Khaled Harfoush}, title={{Inference and Labeling of Metric-Induced Network Topologies}}, keywords={Beacon, Internet Measurement}, booktitle = {Proceedings of Infocom'02: The IEEE International Conference on Computer Communication}, month={June}, address={New York, NY}, year=2002, url={http://www.cs.bu.edu/fac/best/res/papers/infocom02.pdf}, abstract={} } @inproceedings{vlachos02, author = "M. Vlachos and C. Domeniconi and D. Gunopulos and G. Kollios and N. Koudas", title = "Non-Linear Dimensionality Reduction Techniques for Classification and Visualization", booktitle = "Proc. of ACM SIGKDD", year = "2002" } @inproceedings{vlachos02b, author = "M. Vlachos and D. Gunopulos and G. Kollios", title = "Robust Similarity Measures for Mobile Object Trajectories", booktitle = "Proc. of MDDS", year = "2002" } @inproceedings{Pap02, author = "D. Papadopoulos and G. Kollios and D. Gunopulos and Vassilis Tsotras", title = "Indexing Mobile Objects on the Plane", booktitle = "Proc. of MDDS", year = "2002" } @inproceedings(KB03, author = "G.-I. Kwon and J. W. Byers", title = "Smooth Multirate Multicast Congestion Control", booktitle = "Proc. of IEEE INFOCOM", month = "April", year = "2003", address = "San Francisco, CA" ) @inproceedings(BCM03, author = "J. W. Byers and J. Considine and M. Mitzenmacher", title = "Simple Load Balancing for Distributed Hash Tables", booktitle = "Proc. of 2nd Int'l Workshop on Peer-to-Peer Systems (IPTPS)", month = "February", year = "2003", address = "Berkeley, CA", pages = "31--35" ) @inproceedings(BCMR02, author = "J. W. Byers and J. Considine and M. Mitzenmacher and S. Rost", title = "Informed Content Delivery Across Adaptive Overlay Networks", booktitle = "Proc. of ACM SIGCOMM", month = "August", year = "2002", address = "Pittsburgh, PA", pages = "47-60" ) @article{BHLMS02, author = "J.W. Byers and G. Horn and M. Luby and M. Mitzenmacher and W. Shaver", title = "{FLID-DL: Congestion Control for Layered Multicast}", journal = "IEEE Journal on Selected Areas in Communications", volume = "20(8)", pages = "1558--1570", month = "October", year = "2002" } @article{BHLMS02b, author = "J.W. Byers and M. Luby and M. Mitzenmacher", title = "A Digital Fountain Approach to Asynchronous Reliable Multicast", journal = "IEEE Journal on Selected Areas in Communications", volume = "20(8)", pages = "1528--1540", month = "October", year = "2002" } @article{GuoMatta:CN02, author={Liang Guo and Ibrahim Matta}, title= {{Search Space Reduction in {QoS} Routing}}, journal = "{Computer Networks}", volume = "41", number = "1", month = "January", year = "2003", url = "http://www.cs.bu.edu/faculty/matta/Papers/comnet02b.ps", abstract={} } @Article{KrunzMatta:comnet02, author = "Marwan Krunz and Ibrahim Matta", title = {{Analytical Investigation of the Bias Effect in Variance-Type Estimators for Inference of Long-Range Dependence}}, journal = "Computer Networks -- Special Issue on Advances in Modeling and Engineering of Long-Range Dependent Traffic", month = "October", volume = "40", number = "3", pages = "445-458", year = "2002", comment = "Accepted March 2002. Guest Editors: M. Devetsikiotis and N.L.S. da Fonseca", keywords= {Long-Range Dependence}, url = "http://www.cs.bu.edu/faculty/matta/Papers/comnet02.ps" } @article{JinGuoMattaBestavros:ton02, author={Shudong Jin and Liang Guo and Ibrahim Matta and Azer Bestavros}, title= {{A Spectrum of TCP-friendly Window-based Congestion Control Algorithms}}, journal={{IEEE/ACM Transactions on Networking}}, address={}, keywords={Congestion Control, TCP-friendliness, TCP-compatibility, Fairness, Transient Behavior}, volume = "11", number = "3", month = "June", year= "2003", comment = "Accepted May 2002 by Vern Paxon", url = "http://www.cs.bu.edu/faculty/matta/Papers/ton02.ps", abstract={} } @inproceedings{BarmanMatta:icnp02, author = "Dhiman Barman and Ibrahim Matta", title = {{Effectiveness of Loss Labeling in Improving TCP Performance in Wired/Wireless Networks}}, booktitle={{Proceedings of ICNP'2002: The 10th IEEE International Conference on Network Protocols}}, address={Paris, France}, keywords={}, month={November}, year=2002, url = "http://www.cs.bu.edu/faculty/matta/Papers/icnp02.ps", abstract={} } @inproceedings{LakhinaByersCrovellaMatta:imw02, author = "Anukool Lakhina and John Byers and Mark Crovella and Ibrahim Matta", title = {{On the Geographic Location of Internet Resources}}, booktitle = "{Proceedings of the Internet Measurement Workshop}", year = 2002, month = "November", address = "Marseille, France", url = "http://www.cs.bu.edu/faculty/matta/Papers/imw02.ps" } @InProceedings{Kriakov:edbt04, author="V. Kriakov and A. Delis and G. Kollios", title="Management of Highly Dynamic Multidimensional Data in a Cluster of Workstations", booktitle="Proc. of the 9th Conference on Extending Database Technology (EDBT)", url = "http://www.cs.bu.edu/fac/gkollios/Papers/edbt04.pdf", year="2004" } @InProceedings{Considine:icde04, author="J. Considine and F. Li and G. Kollios and J. Byers", title="Approximate Aggregation Techniques for Sensor Databases", booktitle="Proc. of the20th IEEE International Conference on Data Engineering (ICDE)", url = "http://www.cs.bu.edu/fac/gkollios/Papers/ICDE04-SNA.pdf", year="2004" } @InProceedings{Tao:icde04, author="Y. Tao and G. Kollios and J. Considine and F. Li and D. Papadias", title="Spatio-Temporal Aggregation Using Sketches", booktitle="Proc. of the20th IEEE International Conference on Data Engineering (ICDE)", url = "http://www.cs.ust.hk/%7Edimitris/PAPERS/ICDE04-TSk.pdf", year="2004" } @InProceedings{Hadjieleftheriou:sstd03, author="M. Hadjieleftheriou and G. Kollios and V. Tsotras and D. Gunopulos", title="On-Line Discovery of Dense Areas in Spatio-temporal Databases", booktitle="Proc. of the 8th International Symposium on Spatial and Temporal Databases (SSTD)", url = "http://www.cs.bu.edu/fac/gkollios/Papers/sstd03.pdf", year="2003"} @Article{Kollios:tkde03, author="G. Kollios and D. Gunopulos and N. Koudas and S. Berchtold", title="Efficient Biased Sampling for Approximate Clustering and Outlier Detection in Large Datasets", journal="{IEEE Transactions on Knowledge and Data Engineering}", volume = "15", number = "5", month = "September", year = "2003", url = "http://www.cs.bu.edu/fac/gkollios/Papers/113620.ps.gz" } @inproceedings{byers03geometry, author = "John W. Byers and Jeffrey Considine and Michael Mitzenmacher", title = "{Geometric Generalizations of the Power of Two Choices}", booktitle = {Proceedings of ACM SPAA 2004}, year = 2004, month = {June}, url = {http://www.cs.bu.edu/fac/byers/pubs/gg.ps} } @inproceedings{considine03case, author = "Jeffrey Considine and John W. Byers and Ketan Mayer-Patel", title = {A Case for Testbed Embedding Services}, booktitle = {Proceedings of HotNets-II}, year = 2003, month = {November}, url = {http://nms.lcs.mit.edu/HotNets-II/papers/embedding.pdf} } @inproceedings{ROMA, author = "G. Kwon and J. Byers", title = "{{ROMA}: Reliable Overlay Multicast with Loosely Coupled TCP Connections}", booktitle = "Proc. of IEEE INFOCOM", month = "March", year = "2004", address = "Hong Kong" } @InProceedings{I02-TE, author={Gene Itkis}, title={Cryptographic Tamper Evidence}, booktitle={10th ACM Conference on Computer and Communication Security}, year=2003, month=oct #{~27--30}, c-address={Washington, DC}, publisher={ACM}, note={Available from {\tt http://www.cs.bu.edu/fac/itkis/papers.html}}, url={{\tt URLhttp://www.cs.bu.edu/fac/itkis/papers.html}}, } @InProceedings{IX03, author={Gene Itkis and Peng Xie}, title={Generalized Key-Evolving Signatures, or How To Foil an Armed Adversary}, booktitle={1st {MiAn} International Conference on Applied Cryptography and Network Security}, year=2003, c-address={Kunming, China}, publisher={Springer Verlag}, note={Available from {\tt http://www.cs.bu.edu/fac/itkis/papers.html}}, } @inproceedings{MR04, author = {Silvio Micali and Leonid Reyzin}, title = {Physically Observable Cryptography (Extended Abstract)}, pages={278--296}, booktitle={First Theory of Cryptography Conference --- TCC 2004}, editor={Moni Naor}, volume= 2951, series={Lecture Notes in Computer Science}, publisher= {Springer Verlag}, year=2004, month=feb#{~19--21}, crossrefonly=1, c-address={Cambridge, MA}, note={Available from {\tt http://www.cs.bu.edu/fac/reyzin/research.html}}, } @inproceedings{TangCrovella:imc03, author = "Liying Tang and Mark Crovella", title = "Virtual Landmarks for the {Internet}", booktitle = "Proceedings of the ACM/SIGCOMM Internet Measurement Confer\ ence 2003", month = "October", year = "2003", location = "Miami Beach, Florida", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/imc03-coor\ ds.pdf" } @inproceedings{TangCrovella:pam2004, author = "Liying Tang and Mark Crovella", title = "Geometric Exploration of the Landmark Selection Problem", booktitle = "Lecture Notes in Computer Science 3015, Proceedings of Passive and Active Measurement Workshop (PAM2004)", month = "April", year = "2004", pages = "63--72", location = "Juan-les-Pins, France", url = "http://www.cs.bu.edu/faculty/crovella/paper-archive/pam04-geom\ -coords.pdf" } @article{DTPMjucs03, author = "Hongwei Xi", title = {{Dependently Typed Pattern Matching}}, journal = "Journal of Universal Computer Science", volume = "9", number = "8", year = "2003", pages = "851-872", } @inproceedings{ITPTpepm03, author = "Chiyan Chen and Hongwei Xi", title = {{Implementing Typeful Program Transformations}}, booktitle = "Proceedings of ACM SIGPLAN Workshop on Partial Evaluation and Semantics Based Program Manipulation", year = "2003", month = "June", address = "San Diego, CA", pages = "20--28", URL = "http://www.cs.bu.edu/~hwxi/academic/papers/pepm03.pdf" } @inproceedings{MPicfp03, author = "Chiyan Chen and Hongwei Xi", title = {{Meta-Programming through Typeful Code Representation}}, booktitle = "Proceedings of the Eighth ACM SIGPLAN International Conference on Functional Programming", year = 2003, month = "August", address = "Uppsala, Sweden", pages = "275--286", URL = "http://www.cs.bu.edu/~hwxi/academic/papers/icfp03.pdf" } @inproceedings{XiSEFM03, author = "Hongwei Xi", title = {{Facilitating Program Verification with Dependent Types}}, booktitle = "Proceedings of the International Conference on Software Engineering and Formal Methods", year = 2003, month = "September", address = "Brisbane, Australia", pages = "72--81", URL = "http://www.cs.bu.edu/~hwxi/academic/papers/sefm03.pdf" } @inproceedings{TahaEMSOFT03, author = "Walid Taha and Stephan Ellner and Hongwei Xi", title = {{Generating Imperative, Heap-Bounded Programs in a Functional Setting}}, booktitle = "Proceedings of the Third International Conference on Embedded Software", publisher = "Springer Verlag LNCS 2855", year = 2003, month = "October", address = "Philadelphia, PA", pages = "340--355", URL = "http://www.cs.bu.edu/~hwxi/academic/papers/emsoft03.pdf" } @inproceedings{XMLrep, author = "Dengping Zhu and Hongwei Xi", title = {{A Typeful and Tagless Representation for XML Documents}}, booktitle = "Proceedings of the First Asian Symposium on Programming Languages a nd Systems", publisher = "Springer Verlag LNCS 2895", year = "2003", month = "November", address = "Beijing, China", pages = "89-104", URL = "http://www.cs.bu.edu/~hwxi/academic/papers/aplas03.pdf" } @inproceedings{ATStypes03, author = "Hongwei Xi", title = {{Applied Type System (extended abstract)}}, booktitle = "post-workshop Proceedings of TYPES 2003", publisher = "Springer Verlag LNCS 3085", year = "2004", pages = "394--408", URL = "http://www.cs.bu.edu/~hwxi/academic/papers/types03.pdf" } @InProceedings{fry_west_rtas04, author = {Gerald Fry and Richard West}, title = {Adaptive Routing of {QoS}-constrained Media Streams over Scalable Overlay Topologies}, booktitle = {Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {May}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{fry_west_cic04, author = {Gerald Fry and Richard West}, title = {Dynamic Characteristics of k-ary n-cube Networks for Real-time Communication}, booktitle = {Proceedings of the 5th International Conference on Communications in Computing}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {June}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{vds_rtss04, author = {Yuting Zhang and Richard West and Xin Qi}, title = {A Virtual Deadline Scheduler for Window-Constrained Service Guarantees}, booktitle = {Proceedings of the 25th IEEE Real-Time Systems Symposium (RTSS)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {December}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{mvds_rtcsa04, author = {Yuting Zhang and Richard West}, title = {End-to-end Window-Constrained Scheduling for Real-Time Communication}, booktitle = {Proceedings of the 10th International Conference on Real-Time and Embedded Computing Systems and Applications (RTCSA'04)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {August}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{cluster04, author = {Xin Qi and Gabriel Parmer and Richard West}, title = {An Efficient End-host Architecture for Cluster Communication Services}, booktitle = {Proceedings of the IEEE International Conference on Cluster Computing (Cluster '04)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {September}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @InProceedings{ic04, author = {Gabriel Parmer and Richard West and Xin Qi and Gerald Fry and Yuting Zhang}, title = {An Internet-wide Distributed System for Data-stream Processing}, booktitle = {Proceedings of the 5th International Conference on Internet Computing (IC'04)}, OPTcrossref = {}, OPTkey = {}, OPTpages = {}, year = {2004}, OPTeditor = {}, OPTvolume = {}, OPTnumber = {}, OPTseries = {}, OPTaddress = {}, month = {June}, OPTorganization = {}, OPTpublisher = {}, OPTnote = {}, OPTannote = {} } @Article{west_dwcs04, author = {Richard West and Yuting Zhang and Karsten Schwan and Christian Poellabauer}, title = {Dynamic Window-Constrained Scheduling of Real-Time Streams in Media Servers}, journal = {IEEE Transactions on Computers}, year = {2004}, OPTkey = {}, volume = {53}, number = {6}, pages = {744-759}, month = {June}, OPTnote = {}, OPTannote = {} } @InProceedings{Hadjieleftheriou04, author="M. Hadjieleftheriou and V. Kriakov and Y. Tao and G. Kollios and A. Delis and V. Tsotras", title="Spatio-Temporal Data Services in a Shared-Nothing Environment", booktitle = "Proc. of the 16th International Conference on Scientific and Statistical Database Management (SSDBM)", month = "June", year = "2002" } @article{Kollios05a, author = {G. Kollios and D. Papadopoulos D. Gunopulos and V. Tsotras}, title = {Indexing Mobile Objects Using Dual Transformations}, month = "April", year = 2005, volume = 14, number = 2, pages = {238--256}, journal = {VLDB Journal} } @article{Vlachos05, author = {M. Vlachos and G. Kollios and D. Gunopulos}, title = {Elastic Translation Invariant Matching of Trajectories}, month = "February", year = 2005, volume = 58, number = 2, pages = {301--334}, journal = {Machine Learning Journal} } @inproceedings{padl05-zx, author = "Dengping Zhu and Hongwei Xi", title = {{Safe Programming with Pointers through Stateful Views}}, booktitle = "Proceedings of the 7th International Symposium on Practical Aspects of Declarative Languages", publisher = "Springer Verlag LNCS vol. 3350", year = "2005", month = "January", pages = "83--97", address = "Long Beach, CA", } @inproceedings{padl04-crx, author = "Chiyan Chen and Rui Shi and Hongwei Xi", title = {{A Typeful Approach to Object-Oriented Programming with Multiple Inheritance}}, booktitle = "Proceedings of the 6th International Symposium on Practical Aspects of Declarative Languages", publisher = "Springer Verlag LNCS vol. 3057", pages = "23--38", year = "2004", month = "June", address = "Dallas, TX", } @inproceedings{padl04-cdx, author = "Chiyan Chen and Dengping Zhu and Hongwei Xi", title = {{Implementing Cut Elimination: A Case Study of Simulating Dependent Types in Haskell}}, booktitle = "Proceedings of the 6th International Symposium on Practical Aspects of Declarative Languages", publisher = "Springer Verlag LNCS vol. 3057", year = "2004", month = "June", pages = "239--254", address = "Dallas, TX", } @TECHREPORT{Bak+Kfo:TR-2005a, AUTHOR = {Adam Bakewell and Assaf J. Kfoury}, TITLE = {Properties of a Rewrite System for Unification with Expansion Variables}, INSTITUTION = {Department of Computer Science, Boston University}, YEAR = 2005, MONTH = APR, TYPE = {Technical Report}, PDF = {http://cs-people.bu.edu/bake/uwev/propbun.pdf}, POSTSCRIPT = {http://cs-people.bu.edu/bake/uwev/propbun.ps.gz} } @TECHREPORT{Bak+Kfo:BUCS-TR-2004-0xx, AUTHOR = {Adam Bakewell and Assaf J. Kfoury}, TITLE = {Unification with Expansion Variables}, INSTITUTION = {Department of Computer Science, Boston University}, YEAR = 2004, MONTH = DEC, TYPE = {Technical Report}, PDF = {http://cs-people.bu.edu/bake/uwev/betau.pdf}, POSTSCRIPT = {http://cs-people.bu.edu/bake/uwev/betau.ps.gz} } @TECHREPORT{Bak+Car+Kfo+Wel:BUCS-TR-2005a, AUTHOR = {Adam Bakewell and S{\'e}bastien Carlier and A. J. Kfoury and J. B. Wells}, TITLE = {Inferring Intersection Typings that are Equivalent to Call-by-Name and Call-by-Value Evaluations}, INSTITUTION = {Department of Computer Science, Boston University}, YEAR = 2005, MONTH = APR, TYPE = {Technical Report}, PDF = {http://cs-people.bu.edu/bake/uwev/nameval.pdf}, POSTSCRIPT = {http://cs-people.bu.edu/bake/uwev/nameval.ps.gz} }