Search Constraints

Start Over
Filtering by: Resource Type Conference Proceeding Remove constraint Resource Type: Conference Proceeding

Search Results

  • Fast feature-based video segmentation and annotation

    Resource Type:
    Conference Proceeding
    Creator:
    Whitehead, Anthony D.
    Abstract:
    we present a method of segmenting video to detect cuts with accuracy equal to or better than both histogram and other feature based methods. As well, the method is faster than other feature based methods. By utilizing feature tracking on corners, rather than lines, we are able to reliably detect features such as cuts, fades and salient frames. Experimental evidence shows that the method is able to withstand high motion situations better than existing methods. Initial implementations using full sized video frames are able to achieve processing rates of 10-30 frames per second depending on the level of motion and number of features being tracked; this includes the time to generate the MPEG decompressed frames.
    Date Created:
    2003-01-01

  • Distributed storage in disruption tolerant network

    Resource Type:
    Conference Proceeding
    Creator:
    Nayak, Amiya, Du, Jingzhe, and Kranakis, Evangelos
    Abstract:
    We describe a novel Distributed Storage protocol in Disruption (Delay) Tolerant Networks (DTN). Since DTNs can not guarantee the connectivity of the network all the time, distributed data storage and look up has to be performed in a store-and-forward way. In this work, we define local distributed location regions which are called cells to facilitate the data storage and look up process. Nodes in a cell have high probability of moving within their cells. Our protocol resorts to storing data items in cells which have hierarchical structure to reduce routing information storage at nodes. Multiple copies of a data item may be stored at nodes to counter the adverse impact of the nature of DTNs. The cells are relatively stable regions and as a result, data exchange overheads among nodes are reduced. Through experimentation, we show that the proposed distributed storage protocol achieves higher successful data storage ratios with lower delays and limited data item exchange requirements than other protocols in the literature.
    Date Created:
    2010-08-27

  • On the role of the input power constraint in the beamforming optimality range in TIMO channels

    Resource Type:
    Conference Proceeding
    Creator:
    Yanikomeroglu, Halim and Al-Ahmadi, Saad
    Date Created:
    2009-10-19

  • Object-level recombination of commodity applications

    Resource Type:
    Conference Proceeding
    Creator:
    Foster, Blair and Somayaji, Anil
    Abstract:
    This paper presents ObjRecombGA, a genetic algorithm framework for recombining related programs at the object file level. A genetic algorithm guides the selection of object files, while a robust link resolver allows working program binaries to be produced from the object files derived from two ancestor programs. Tests on compiled C programs, including a simple web browser and a well-known 3D video game, show that functional program variants can be created that exhibit key features of both ancestor programs. This work illustrates the feasibility of applying evolutionary techniques directly to commodity applications. Copyright 2010 ACM.
    Date Created:
    2010-08-27

  • Multiple password interference in text passwords and click-based graphical passwords

    Resource Type:
    Conference Proceeding
    Creator:
    Van Oorschot, Paul C., Biddle, Robert, Forget, Alain, Chiasson, Sonia, and Stobert, Elizabeth
    Abstract:
    The underlying issues relating to the usability and security of multiple passwords are largely unexplored. However, we know that people generally have difficulty remembering multiple passwords. This reduces security since users reuse the same password for different systems or reveal other passwords as they try to log in. We report on a laboratory study comparing recall of multiple text passwords with recall of multiple click-based graphical passwords. In a one-hour session (short-term), we found that participants in the graphical password condition coped significantly better than those in the text password condition. In particular, they made fewer errors when recalling their passwords, did not resort to creating passwords directly related to account names, and did not use similar passwords across multiple accounts. After two weeks, participants in the two conditions had recall success rates that were not statistically different from each other, but those with text passwords made more recall errors than participants with graphical passwords. In our study, click-based graphical passwords were significantly less susceptible to multiple password interference in the short-term, while having comparable usability to text passwords in most other respects. Copyright 2009 ACM.
    Date Created:
    2009-12-01

  • Facebooking in "face": Complex identities meet simple databases

    Resource Type:
    Conference Proceeding
    Creator:
    Brubaker, Jed R., Handel, Mark, Yarosh, Svetlana, Bivens, Rena, Haimson, Oliver L., and Lingel, Jessa
    Abstract:
    Online systems often struggle to account for the complicated self-presentation and disclosure needs of those with complex identities or specialized anonymity. Using the lenses of gender, recovery, and performance, our proposed panel explores the tensions that emerge when the richness and complexity of individual personalities and subjectivities run up against design norms that imagine identity as simplistic or one-dimensional. These models of identity not only limit the ways individuals can express their own identities, but also establish norms for other users about what to expect, causing further issues when the inevitable dislocations do occur. We discuss the challenges in translating identity into these systems, and how this is further marred by technical requirements and normative logics that structure cultures and practices of databases, algorithms and computer programming.
    Date Created:
    2015-01-01

  • Hacking with Multi-touch for Java (MT4j)

    Resource Type:
    Conference Proceeding
    Creator:
    Noble, James, Marshall, Stuart, Anslow, Craig, and Biddle, Robert
    Abstract:
    Developing applications for touch devices is hard. Developing touch based applications for multi-user input is harder. The Multi-Touch for Java (MT4j) toolkit supports developing touch based applications for multiple users. In this paper, we outline our experience using MT4j for developing a number of software applications to support developers working in co-located teams. Our experience using the toolkit will help developers to understand the nuances of the toolkit and design issues that can be applied to other toolkits for developing multi-user touch based applications.
    Date Created:
    2016-10-21

  • Anomaly detection using weak estimators

    Resource Type:
    Conference Proceeding
    Creator:
    Oommen, B. John, Zhan, Justin, and Crisostomo, Johanna
    Abstract:
    Anomaly detection involves identifying observations that deviate from the normal behavior of a system. One of the ways to achieve this is by identifying the phenomena that characterize "normal" observations. Subsequently, based on the characteristics of data learned from the normal observations, new observations are classified as being either normal or not. Most state-of-the-art approaches, especially those which belong to the family parameterized statistical schemes, work under the assumption that the underlying distributions of the observations are stationary. That is, they assume that the distributions that are learned during the training (or learning) phase, though unknown, are not time-varying. They further assume that the same distributions are relevant even as new observations are encountered. Although such a " stationarity" assumption is relevant for many applications, there are some anomaly detection problems where stationarity cannot be assumed. For example, in network monitoring, the patterns which are learned to represent normal behavior may change over time due to several factors such as network infrastructure expansion, new services, growth of user population, etc. Similarly, in meteorology, identifying anomalous temperature patterns involves taking into account seasonal changes of normal observations. Detecting anomalies or outliers under these circumstances introduces several challenges. Indeed, the ability to adapt to changes in non-stationary environments is necessary so that anomalous observations can be identified even with changes in what would otherwise be classified as normal behavior. In this paper, we proposed to apply weak estimation theory for anomaly detection in dynamic environments. In particular, we apply this theory to detect anomaly activities in system calls. Our experimental results demonstrate that our proposal is both feasible and effective for the detection of such anomalous activities.
    Date Created:
    2012-09-22