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

Computer Sciences Commons™

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

2007

Discipline
Institution
Keyword
Publication
Publication Type
File Type

Articles 241 - 270 of 1355

Full-Text Articles in Computer Sciences

Preserving Privacy In Supply Chain Management: A Challenge For Next Generation Data Mining, Madhu Ahluwalia, Zhiyuan Chen, Arrya Gangopadhyay, Zhiling Guo Oct 2007

Preserving Privacy In Supply Chain Management: A Challenge For Next Generation Data Mining, Madhu Ahluwalia, Zhiyuan Chen, Arrya Gangopadhyay, Zhiling Guo

Research Collection School Of Computing and Information Systems

In this paper we identify a major area of research as a topic for next generation data mining. The research effort in the last decade on privacy preserving data mining has resulted in the development of numerous algorithms. However, most of the existing research has not been applied in any particular application context. Hence it is unclear whether the current algorithms are directly applicable in any particular problem context. In this paper we identify a significant application context that not only requires protection of privacy but also sophisticated data analysis. The area in question is supply chain management, arguably one …

Go to article

Analyzing Service Usage Patterns: Methodology And Simulation, Qianhui (Althea) Liang, Jen-Yao Chung Oct 2007

Analyzing Service Usage Patterns: Methodology And Simulation, Qianhui (Althea) Liang, Jen-Yao Chung

Research Collection School Of Computing and Information Systems

This paper proposes that service mining technology will power the construction of new business services via both intra- and inter-enterprise service assembly within the Service Oriented Architecture (SOA) framework. We investigate the methodologies of service mining at the component level of service usage. We also demonstrate how mining of service usage patterns is intended to be used to improve different aspects of service composition. Simulation experiments conducted for mining at the component level are analyzed. The processing details within a general service mining deployment are demonstrated.

Go to article

Npake+: A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords, Zhiguo Wan, Robert H. Deng, Feng Bao, Bart Preneel Oct 2007

Npake+: A Hierarchical Group Password-Authenticated Key Exchange Protocol Using Different Passwords, Zhiguo Wan, Robert H. Deng, Feng Bao, Bart Preneel

Research Collection School Of Computing and Information Systems

Although two-party password-authenticated key exchange (PAKE) protocols have been intensively studied in recent years, group PAKE protocols have received little attention. In this paper, we propose a hierarchical group PAKE protocol nPAKE+ protocol under the setting where each party shares an independent password with a trusted server. The nPAKE+ protocol is a novel combination of the hierarchical key tree structure and the password-based Diffie-Hellman exchange, and hence it achieves substantial gain in computation efficiency. In particular, the computation cost for each client in our protocol is only O(logn). Additionally, the hierarchical feature of nPAKE+ enables every subgroup obtains their own …

Go to article

Sketchwizard: Wizard Of Oz Prototyping Of Pen-Based User Interfaces, Richard C. Davis, T. Scott Saponas, Michael Shilman, James A. Landay Oct 2007

Sketchwizard: Wizard Of Oz Prototyping Of Pen-Based User Interfaces, Richard C. Davis, T. Scott Saponas, Michael Shilman, James A. Landay

Research Collection School Of Computing and Information Systems

SketchWizard allows designers to create Wizard of Oz prototypes of pen-based user interfaces in the early stages of design. In the past, designers have been inhibited from participating in the design of pen-based interfaces because of the inadequacy of paper prototypes and the difficulty of developing functional prototypes. In SketchWizard, designers and end users share a drawing canvas between two computers, allowing the designer to simulate the behavior of recognition or other technologies. Special editing features are provided to help designers respond quickly to end-user input. This paper describes the SketchWizard system and presents two evaluations of our approach. The …

Go to article

Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han Oct 2007

Gapprox: Mining Frequent Approximate Patterns From A Massive Network, Chen Chen, Xifeng Yan, Feida Zhu, Jiawei Han

Research Collection School Of Computing and Information Systems

Recently, there arise a large number of graphs with massive sizes and complex structures in many new applications, such as biological networks, social networks, and the Web, demanding powerful data mining methods. Due to inherent noise or data diversity, it is crucial to address the issue of approximation, if one wants to mine patterns that are potentially interesting with tolerable variations. In this paper, we investigate the problem of mining frequent approximate patterns from a massive network and propose a method called gApprox. gApprox not only finds approximate network patterns, which is the key for many knowledge discovery applications on …

Go to article

Om-Based Video Shot Retrieval By One-To-One Matching, Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao Oct 2007

Om-Based Video Shot Retrieval By One-To-One Matching, Yuxin Peng, Chong-Wah Ngo, Jianguo Xiao

Research Collection School Of Computing and Information Systems

This paper proposes a new approach for shot-based retrieval by optimal matching (OM), which provides an effective mechanism for the similarity measure and ranking of shots by one-to-one matching. In the proposed approach, a weighted bipartite graph is constructed to model the color similarity between two shots. Then OM based on Kuhn-Munkres algorithm is employed to compute the maximum weight of a constructed bipartite graph as the shot similarity value by one-to-one matching among frames. To improve the speed efficiency of OM, two improved algorithms are also proposed: bipartite graph construction based on subshots and bipartite graph construction based on …

Go to article

I Tube, You Tube, Everybody Tubes: Analyzing The World’S Largest User Generated Content Video System, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue. Moon Oct 2007

I Tube, You Tube, Everybody Tubes: Analyzing The World’S Largest User Generated Content Video System, Meeyoung Cha, Haewoon Kwak, Pablo Rodriguez, Yong-Yeol Ahn, Sue. Moon

Research Collection School Of Computing and Information Systems

User Generated Content (UGC) is re-shaping the way people watch video and TV, with millions of video producers and consumers. In particular, UGC sites are creating new viewing patterns and social interactions, empowering users to be more creative, and developing new business opportunities. To better understand the impact of UGC systems, we have analyzed YouTube, the world's largest UGC VoD system. Based on a large amount of data collected, we provide an in-depth study of YouTube and other similar UGC systems. In particular, we study the popularity life-cycle of videos, the intrinsic statistical properties of requests and their relationship with …

Go to article

Follow The Leader? Price Change Timing In Internet-Based Selling, R. J. Kauffman, Charles A. Wood Oct 2007

Follow The Leader? Price Change Timing In Internet-Based Selling, R. J. Kauffman, Charles A. Wood

Research Collection School Of Computing and Information Systems

Internet technologies should lessen information asymmetry, prompting competitive price reactions, but this does not seem to be happening in Internet-based selling. We study empirical regularities of price change timing for music CD vendors and booksellers to assess several theoretical explanations. Our sample includes 123, 680 daily prices for 169 products and 53 firms. Bertrand competition is insufficient to explain our observation that sellers do not shift prices this way. Tacitly collusive responses to competitors' price changes are observed rather than price changes solely in response to demand or cost shifts as would be expected with Bertrand competition. We find evidence …

Go to article

Option-Based Risk Management: A Field Study Of Sequential Information Technology Investment Decisions, Michel Benaroch, Mark Jeffery, Robert John Kauffman, Sandeep Shah Oct 2007

Option-Based Risk Management: A Field Study Of Sequential Information Technology Investment Decisions, Michel Benaroch, Mark Jeffery, Robert John Kauffman, Sandeep Shah

Research Collection School Of Computing and Information Systems

This field study research evaluates the viability of applying an option-based risk management (OBRiM) framework, and its accompanying theoretical perspective and methodology, to real-world sequential information technology (IT) investment problems. These problems involve alternative investment structures that bear different risk profiles for the firm, and also may improve the payoffs of the associated projects and the organization's performance. We sought to surface the costs, benefits, and risks associated with a complex sequential investment setting that has the key features that OBRiM treats. We combine traditional, purchased real options that subsequently create strategic flexibility for the decision maker, with implicit or …

Go to article

An Adaptive And Non-Linear Technique For Enhancement Of High Contrast Images, Saibabu Arigela Oct 2007

An Adaptive And Non-Linear Technique For Enhancement Of High Contrast Images, Saibabu Arigela

Electrical & Computer Engineering Theses & Dissertations

In night time surveillance, there is a possibility of having extremely bright and dark regions in some image frames of a video sequence. Neither the object details in the low intensity areas nor in the high intensity areas can be clearly interpreted. Several image processing techniques have been developed to retrieve meaningful information under low lighting conditions. The algorithm based on integrated neighborhood dependency of pixel characteristics, and that based on the illuminance reflectance model perform well for improving the visual quality of digital images captured under extremely low and nonuniform lighting conditions. But these techniques cannot perform well in …

Go to article

Ecological Interfaces For Improving Mobile Robot Teleoperation, Michael A. Goodrich, Curtis W. Nielsen, Robert W. Ricks Oct 2007

Ecological Interfaces For Improving Mobile Robot Teleoperation, Michael A. Goodrich, Curtis W. Nielsen, Robert W. Ricks

Faculty Publications

Navigation is an essential element of many remote robot operations including search and rescue, reconnaissance, and space exploration. Previous reports on using remote mobile robots suggest that navigation is difficult due to poor situation awareness. It has been recommended by experts in human–robot interaction that interfaces between humans and robots provide more spatial information and better situational context in order to improve an operator’s situation awareness. This paper presents an ecological interface paradigm that combines video, map, and robotpose information into a 3-D mixed-reality display. The ecological paradigm is validated in planar worlds by comparing it against the standard interface …

Go to article

Psoda: Better Tasting And Less Filling Than Paup, Hyrum Carroll, Mark J. Clement, Mark Ebbert, Quinn O. Snell Oct 2007

Psoda: Better Tasting And Less Filling Than Paup, Hyrum Carroll, Mark J. Clement, Mark Ebbert, Quinn O. Snell

Faculty Publications

PSODA is an open-source phylogenetic search application that implements traditional parsimony and likelihood search techniques as well as advanced search algorithms. PSODA is compatible with PAUP and the search algorithms are competitive with those in PAUP. PSODA also adds a basic scripting language to the PAUP block, making it possible to easily create advanced meta-searches. Additionally, PSODA provides a user-friendly GUI with real-time graphing visualizations and phylogeny viewer, and a multiple sequence alignment algorithm PSODA is freely available from the PSODA web site: http://csl.cs.byu.edu/psoda.

Go to article

Psodascript: Applying Advanced Language Constructs To Open-Source Phylogenetic Search, Hyrum Carroll, Mark J. Clement, Jonathan Krein, Quinn O. Snell, Adam R. Teichert Oct 2007

Psodascript: Applying Advanced Language Constructs To Open-Source Phylogenetic Search, Hyrum Carroll, Mark J. Clement, Jonathan Krein, Quinn O. Snell, Adam R. Teichert

Faculty Publications

Due to the immensity of phylogenetic tree space for large data sets, researches must rely on heuristic searches to infer reasonable phylogenies. By designing meta-searches which appropriately combine a variety of heuristics and parameter settings, researchers can significantly improve the performance of heuristic searches. Advanced language constructs in the open-source PSODA project—including variables, mathematical and logical expressions, conditional statements, and user-defined commands—give researchers a better framework for the exploration and exploitation of phylogenetic meta-search algorithms. PSODA’s approach to scripting meta-search algorithms is unique among open-source packages and addresses several limitations of other phylogenetic applications.

Go to article

Using Parsimony To Guide Maximum Likelihood Searches, Hyrum Carroll, Mark J. Clement, Timothy O'Connor, Quinn O. Snell, Kenneth Sundberg Oct 2007

Using Parsimony To Guide Maximum Likelihood Searches, Hyrum Carroll, Mark J. Clement, Timothy O'Connor, Quinn O. Snell, Kenneth Sundberg

Faculty Publications

The performance of maximum likelihood searches can be boosted by using the most parsimonious tree as a starting point for the search. The time spent in performing the parsimony search to find this starting tree is insignificant compared to the time spent in the maximum likelihood search, leading to an overall gain in search time. These parsimony boosted maximum likelihood searches lead to topologies with scores statisitically similar to the unboosted searches, but in less time.

Go to article

Masthead Sep 2007

Masthead

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

Blacklistable Anonymous Credentials: Blocking Misbehaving Users Without Ttps (Extended Version), Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith Sep 2007

Blacklistable Anonymous Credentials: Blocking Misbehaving Users Without Ttps (Extended Version), Patrick P. Tsang, Man Ho Au, Apu Kapadia, Sean W. Smith

Computer Science Technical Reports

Several credential systems have been proposed in which users can authenticate to services anonymously. Since anonymity can give users the license to misbehave, some variants allow the selective deanonymization (or linking) of misbehaving users upon a complaint to a trusted third party (TTP). The ability of the TTP to revoke a user's privacy at any time, however, is too strong a punishment for misbehavior. To limit the scope of deanonymization, systems such as ``e-cash'' have been proposed in which users are deanonymized under only certain types of well-defined misbehavior such as ``double spending.'' While useful in some applications, it is …

Go to article

Front Matter Sep 2007

Front Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

Back Matter Sep 2007

Back Matter

Journal of Digital Forensics, Security and Law

No abstract provided.

Go to article

Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth Sep 2007

Realizing The Relationship Web: Morphing Information Access On The Web From Today's Document- And Entity-Centric Paradigm To A Relationship-Centric Paradigm, Amit P. Sheth

Kno.e.sis Publications

No abstract provided.

Go to article

Limitations And Extensions Of The Wolf-Phc Algorithm, Philip R. Cook Sep 2007

Limitations And Extensions Of The Wolf-Phc Algorithm, Philip R. Cook

Theses and Dissertations

Policy Hill Climbing (PHC) is a reinforcement learning algorithm that extends Q-learning to learn probabilistic policies for multi-agent games. WoLF-PHC extends PHC with the "win or learn fast" principle. A proof that PHC will diverge in self-play when playing Shapley's game is given, and WoLF-PHC is shown empirically to diverge as well. Various WoLF-PHC based modifications were created, evaluated, and compared in an attempt to obtain convergence to the single shot Nash equilibrium when playing Shapley's game in self-play without using more information than WoLF-PHC uses. Partial Commitment WoLF-PHC (PCWoLF-PHC), which performs best on Shapley's game, is tested on other …

Go to article

Using A Mini-Uav To Support Wilderness Search And Rescue: Practices For Human-Robot Teaming, Julie A. Adams, Brian G. Buss, Joseph L. Cooper, Michael A. Goodrich, Curtis Humphrey, Ron Zeeman Sep 2007

Using A Mini-Uav To Support Wilderness Search And Rescue: Practices For Human-Robot Teaming, Julie A. Adams, Brian G. Buss, Joseph L. Cooper, Michael A. Goodrich, Curtis Humphrey, Ron Zeeman

Faculty Publications

Wilderness Search and Rescue can benefit from aerial imagery of the search area. Mini Unmanned Aerial Vehicles can potentially provide such imagery, provided that the autonomy, search algorithms, and operator control unit are designed to support coordinated human-robot search teams. Using results from formal analyses of the WiSAR problem domain, we summarize and discuss information flow requirements for WiSAR with an eye toward the efficient use of mUAVs to support search. We then identify and discuss three different operational paradigms for performing field searches, and identify influences that affect which human-robot team paradigm is best. Since the likely location of …

Go to article

Parallel Pso Using Mapreduce, Andrew Mcnabb, Christopher K. Monson, Kevin Seppi Sep 2007

Parallel Pso Using Mapreduce, Andrew Mcnabb, Christopher K. Monson, Kevin Seppi

Faculty Publications

In optimization problems involving large amounts of data, such as web content, commercial transaction information, or bioinformatics data, individual function evaluations may take minutes or even hours. Particle Swarm Optimization (PSO) must be parallelized for such functions. However, large-scale parallel programs must communicate efficiently, balance work across all processors, and address problems such as failed nodes. We present MapReduce Particle Swarm Optimization (MRPSO), a PSO implementation based on the MapReduce parallel programming model. We describe MapReduce and show how PSO can be naturally expressed in this model, without explicitly addressing any of the details of parallelization. We present a benchmark …

Go to article

A Utile Function Optimizer, James Carroll, Christopher K. Monson, Kevin Seppi Sep 2007

A Utile Function Optimizer, James Carroll, Christopher K. Monson, Kevin Seppi

Faculty Publications

We recast the problem of unconstrained continuous evolutionary optimization as inference in a fixed graphical model. This approach allows us to address several pervasive issues in optimization, including the traditionally difficult problem of selecting an algorithm that is most appropriate for a given task. This is accomplished by placing a prior distribution over the expected class of functions, then employing inference and intuitively defined utilities and costs to transform the evolutionary optimization problem into one of active sampling. This allows us to pose an approach to optimization that is optimal for each expressly stated function class. The resulting solution methodology …

Go to article

Blueprint For Iteratively Hardening Power Grids Employing Unified Power Flow Controllers, William M. Siever, Ann K. Miller, Daniel R. Tauritz Sep 2007

Blueprint For Iteratively Hardening Power Grids Employing Unified Power Flow Controllers, William M. Siever, Ann K. Miller, Daniel R. Tauritz

Electrical and Computer Engineering Faculty Research & Creative Works

A stable electricity supply is vital for modern society. However, many parts of our power transmission grid are operating near their operational limits. Such stressed systems are vulnerable to cascading failures, where a few small faults can induce a cascade of failures potentially leading to a major blackout The unified power flow controller (UPFC), the most powerful highspeed, semi-conductor based power flow device, can be used as a theoretical model to study how these devices can be used to improve power grid resilience. The blueprint presented here can be used to iteratively identify critical weaknesses in power grids and to …

Go to article

Yasir: A Low-Latency, High-Integrity Security Retrofit For Legacy Scada Systems, Patrick P. Tsang, Sean W. Smith Sep 2007

Yasir: A Low-Latency, High-Integrity Security Retrofit For Legacy Scada Systems, Patrick P. Tsang, Sean W. Smith

Computer Science Technical Reports

We construct a bump-in-the-wire (BITW) solution that retrofits security into time-critical communications over bandwidth-limited serial links between devices in Supervisory Control And Data Acquisition (SCADA) systems. Previous BITW solutions fail to provide the necessary security within timing constraints; the previous solution that does provide the necessary security is not BITW. At a comparable hardware cost, our BITW solution provides sufficient security, and yet incurs minimal end-to-end communication latency. A microcontroller prototype of our solution is under development.

Go to article

Lighting And Optical Tools For Image Forensics, Micah Kimo Johnson Sep 2007

Lighting And Optical Tools For Image Forensics, Micah Kimo Johnson

Dartmouth College Ph.D Dissertations

We present new forensic tools that are capable of detecting traces of tampering in digital images without the use of watermarks or specialized hardware. These tools operate under the assumption that images contain natural properties from a variety of sources, including the world, the lens, and the sensor. These properties may be disturbed by digital tampering and by measuring them we can expose the forgery. In this context, we present the following forensic tools: (1) illuminant direction, (2) specularity, (3) lighting environment, and (4) chromatic aberration. The common theme of these tools is that they exploit lighting or optical properties …

Go to article

Modelling Computational Requirements Of Mobile Robotic Systems Using Zones And Processing Windows, Ala' Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor Sep 2007

Modelling Computational Requirements Of Mobile Robotic Systems Using Zones And Processing Windows, Ala' Qadi, Steve Goddard, Jiangyang Huang, Shane Farritor

School of Computing: Technical Reports

Mobile robotic systems must sense constraints imposed by a dynamically changing environment and predictably react to those changes in real-time. Complexity arises in mobile robotic systems because the computing platform travels through the environment with which the system is interacting. These systems have spatio-temporal requirements in the sense that correct behavior is defined in terms of both space and time. The focus of this paper is mobile robotic platforms that must sense their environment and avoid obstacles as they navigate from one point to another. We present a design and analysis methodology for these platforms that integrates spatio-temporal attributes with …

Go to article

Student Rights Advocate And Author To Speak, Teresa A. Sherman Sep 2007

Student Rights Advocate And Author To Speak, Teresa A. Sherman

News and Events (Discontinued Series)

No abstract provided.

Go to article

Unfolding Restricted Convex Caps, Joseph O'Rourke Sep 2007

Unfolding Restricted Convex Caps, Joseph O'Rourke

Computer Science: Faculty Publications

This paper details an algorithm for unfolding a class of convex polyhedra, where each polyhedron in the class consists of a convex cap over a rectangular base, with several restrictions: the cap’s faces are quadrilaterals, with vertices over an underlying integer lattice, and such that the cap convexity is "radially monotone," a type of smoothness constraint. Extensions of Cauchy’s arm lemma are used in the proof of non-overlap.

Go to article

Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart Sep 2007

Description Logic Programs: Normal Forms, Pascal Hitzler, Andreas Eberhart

Computer Science and Engineering Faculty Publications

The relationship and possible interplay between different knowledge representation and reasoning paradigms is a fundamental topic in artificial intelligence. For expressive knowledge representation for the Semantic Web, two different paradigms - namely Description Logics (DLs) and Logic Programming - are the two most successful approaches. A study of their exact relationships is thus paramount. An intersection of OWL with (function-free non-disjunctive) Datalog, called DLP (for Description Logic Programs), has been described in [1,2]. We provide normal forms for DLP in Description Logic syntax and in Datalog syntax, thus providing a bridge for the researcher and user who is familiar with …

Go to article

First Prev Next Last