Recent Submissions

  • Learning implicit user interest hierarchy for context in personalization 

    Kim, Hyoung-Rae; Chan, Philip K. (2002-10-05)
    To provide a more robust context for personalization, we desire to extract a continuum of general (long-term) to specific (short-term) interests of a user. Our proposed approach is to learn a user interest hierarchy (UIH) ...
  • An algorithm applicable to clearing combinatorial exchanges 

    Silaghi, Marius-Calin (2002-09-16)
    It is important to approach negotiations in a way that ensures privacy. So far, research has focused on securely solving restricted classes of negotiation techniques, mainly the (M+1)-st-price auctions. Here we show how ...
  • Minimizing N-points interpolation curvature, heuristics for solutions using arcs and lines 

    Vishen, Rahul; Silaghi, Marius Cӑlin (2013-02-11)
    Knowing a set of points on a curve, the interpolation problem is to hypothesize the location of the intermediary ones. A large set of interpolation techniques are known. We address the problem of generating a path with ...
  • Black box software testing instructor's manual: foundations in software testing, bug advocacy, and test design courses 

    Fiedler, Rebecca L.; Kaner, Cem; Hoffman, Douglas (2012-09-24)
    We prepared this manual for instructors interested in using BBST materials in their own classes. It explains how to acquire your own copies of course materials; acquaints you with other resources for teaching software ...
  • A swarm-based model for increasing impulse shopping in supermarkets 

    Usmani, Zeehan-ul-hassan (2009-04-22)
    In today's supermarket multi-billion dollar industry, impulse shopping accounts for 2 out of 3 purchases. The phenomenon is so prominent that some consider high levels of it to be a disorder in the same group as Pyromania ...
  • The peer-reviewing game 

    Silaghi, Marius Cӑlin; Yokoo, Makoto (2008-11-08)
    We model a family of peer-reviewing processes as game-theoretic problems. The model helps to understand elements of existing peer-reviewing procedures, and to predict the impact of new mechanisms. The peer-reviewing for ...
  • Personalized web search by using learned user profiles in re-ranking 

    Hu, Jia (2008-04-30)
    Search engines return results mainly based on the submitted query; however, the same query could be in different contexts because individual users have different interests. To improve the relevance of search results, we ...
  • Machine learning for host-based anomaly detection 

    Tandon, Gaurav (2008-04-23)
    Anomaly detection techniques complement signature based methods for intrusion detection. Machine learning approaches are applied to anomaly detection for automated learning and detection. Traditional host-based anomaly ...
  • Type inference, type improvement, and type simplification in a language with user-defined polymorphic relational operators 

    Nagy, Lajos Pal (2008-10-10)
    The overarching goal of the current thesis is to pave the road towards a comprehensive solution to the decades old problem of integrating databases and programming languages. For this purpose, we propose a record calculus ...
  • Malicious mobile code related experiments with an extensible network simulator 

    Ondi, Attila (2007-10-12)
    The automated spread of worms such as Code-Red, SQL/Slammer, and Nimda have caused costly problems to computers connected to the Internet. Even users whose machines were not vulnerable to these threats suffered a loss of ...
  • Spatio-temporal anomaly detection for mobile devices 

    Tandon, Gaurav; Chan, Philip K. (2007-08-03)
    With the increase in popularity of mobile devices, there has been a significant rise in mobile related security problems. The biggest threat for a mobile subscriber is lost or stolen device, which can lead to confidential ...
  • Detecting anomalies by weighted rules 

    Tandon, Gaurav; Chan, Philip K. (2007-01-19)
    Anomaly detection focuses on modeling the normal behavior and identifying significant deviations, which could be novel attacks. The previously proposed LERAD algorithm can efficiently learn a succinct set of comprehensible ...
  • N-Version programming for the detection of zero-day exploits 

    Nagy, Lajos; Ford, Richard; Allen, William (2006-02-04)
    Using N-Version programming techniques to increase software reliability is a well-explored field. In this paper, we extend the concept to the detection of new security vulnerabilities. Using our own N-Version arbiter, ...
  • Dynamic branch & bound, an optimization counterpart for dynamic backtracking 

    Silaghi, Marius Cӑlin (2006-04-28)
    Here we show how the idea of dynamic backtracking can be applied to branch and bound optimization. This is done by exploiting the concept of valued nogood. However, simple replacement of nogoods with valued nogoods does ...
  • Culprit detection on incremental tractable qualitative temporal reasoning problems 

    Launay, Florent Marie; Mitra, Debasis (2006-04-26)
    This thesis is a confluence of three problems in constraint reasoning: qualitative temporal reasoning (QTR), incremental reasoning, and explanation generation. We first address a set of algorithms to solve the QTR for point ...
  • Zero-knowledge proofs for mix-nets of secret shares 

    Silaghi, Marius Cӑlin (2005-03-07)
    Mix-nets can be used to shuffle vectors of shared secrets. This operation can be an important building block for solving combinatorial problems where constraints are secret to different participants. A main contribution ...
  • Trajectory boundary modeling of time series for anomaly detection 

    Mahoney, Matthew V.; Chan, Philip K. (2005-03-23)
    We address the problem of online detection of unanticipated modes of mechanical failure given a small set of time series under normal conditions, with the requirement that the anomaly detection model be manually verifiable ...
  • Implicit indicators for interesting web pages 

    Kim, Hyoung-Rae; Chan, Philip K. (2005-02-17)
    A user's interest in a web page can be estimated by unobtrusively (implicitly) observing his or her behaviour rather than asking for feedback directly (explicitly). Implicit methods are naturally less accurate than explicit ...
  • Keyword spotting using normalization of posterior probability confidence measures 

    Vargiya, Rachna Vijay (2005-04-09)
    Keyword spotting techniques deal with recognition of predefined vocabulary keywords from a voice stream. This research uses HMM based keyword spotting algorithms for this purpose. The three most important components of a ...
  • Mindshare: a collaborative peer-to-peer system for small groups 

    Farrington, Gareth Charles (2005-04-19)
    We present Mindshare, a system for small group collaboration using Peer to Peer networking technology. This paper details the motivation behind its design, how it benefits users and details of its construction and operation. ...

View more