Computer Sciences Commons^™

What The 2007 Tac Market Design Game Tells Us About Effective Auction Mechanisms, Jinzhong Niu, Kai Cai, Simon Parsons, Peter Mcburney, Enrico Gerding

Publications and Research

This paper analyzes the entrants to the 2007 TAC Market Design Game. We present a classification of the entries to the competition, and use this classification to compare these entries. The paper also attempts to relate market dynamics to the auction rules adopted by these entries and their adaptive strategies via a set of post-tournament experiments. Based on this analysis, the paper speculates about the design of effective auction mechanisms, both in the setting of this competition and in the more general case.

Tr-2010004: Tracking Evidence, Sergei Artemov

Computer Science Technical Reports

No abstract provided.

Tr-2010006: Graph-Based Clustering And Its Application In Coreference Resolution, Zheng Chen

Computer Science Technical Reports

No abstract provided.

Arabic For Designers By Mourad Boutros, Saad D. Abulhab

Publications and Research

No abstract provided.

Nearest Neighbor Search With Strong Location Privacy, Stavros Papadopoulos, Spiridon Bakiras, Dimitris Papadias

Publications and Research

The tremendous growth of the Internet has significantly reduced the cost of obtaining and sharing information about individuals, raising many concerns about user privacy. Spatial queries pose an additional threat to privacy because the location of a query may be sufficient to reveal sensitive information about the querier. In this paper we focus on k nearest neighbor (kNN) queries and define the notion of strong location privacy, which renders a query indistinguishable from any location in the data space. We argue that previous work fails to support this property for arbitrary kNN search. Towards this end, we introduce methods that …

Automatic Readability Assessment, Lijun Feng

Dissertations, Theses, and Capstone Projects

We describe the development of an automatic tool to assess the readability of text documents. Our readability assessment tool predicts elementary school grade levels of texts with high accuracy. The tool is developed using supervised machine learning techniques on text corpora annotated with grade levels and other indicators of reading difficulty. Various independent variables or features are extracted from texts and used for automatic classification. We systematically explore different feature inventories and evaluate the grade-level prediction of the resulting classifiers. Our evaluation comprises well-known features at various linguistic levels from the existing literature, such as those based on language modeling, …

Acceleration Of Monte Carlo Value At Risk Estimation Using Graphics Processing Unit (Gpu), Wei Wu

Dissertations and Theses

"Value at Risk (VaR) is one of the most popular tools used to estimate the exposure to market risks, and it measures the worst expected loss at a given confidence level. Monte Carlo simulation is one of the best methods to calculate VaR and it is widely used in financial industry. Unfortunately, it is time consuming especially when the simulated samples and the number of assets in a portfolio are very large. The graphics processing unit (GPU) is a specialized multiprocessor which has highly parallel structure supporting more effective than general-purpose CPUs for a range of complex algorithms. In this …

A Multidimensional Strategy To Detect Polypharmacological Targets In The Absence Of Structural And Sequence Homology, Jacob D. Durrant, Rommie E. Amaro, Lei Xie, Michael D. Urbaniak, Michael A. J. Ferguson, Antti Haapalainen, Zhijun Chen, Anne Marie Di Guilmi, Frank Wunder, Philip E. Bourne, J. Andrew Mccammon

Publications and Research

Conventional drug design embraces the ‘‘one gene, one drug, one disease’’ philosophy. Polypharmacology, which focuses on multi-target drugs, has emerged as a new paradigm in drug discovery. The rational design of drugs that act via polypharmacological mechanisms can produce compounds that exhibit increased therapeutic potency and against which resistance is less likely to develop. Additionally, identifying multiple protein targets is also critical for side-effect prediction. One third of potential therapeutic compounds fail in clinical trials or are later removed from the market due to unacceptable side effects often caused by off-target binding. In the current work, we introduce a multidimensional …

Optimal Cryptographic Hardness Of Learning Monotone Functions, Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, Hoeteck Wee

Publications and Research

Over the years a range of positive algorithmic results have been obtained for learning various classes of monotone Boolean functions from uniformly distributed random examples. Prior to our work, however, the only negative result for learning monotone functions in this model has been an information-theoretic lower bound showing that certain super-polynomial-size monotone circuits cannot be learned to accuracy 1/2+w(log n/ p n) (Blum, Burch, and Langford, FOCS’98). This is in contrast with the situation for nonmonotone functions, where a wide range of cryptographic hardness results establish that various “simple” classes of polynomial-size circuits are not learnable by polynomial-time algorithms.

In …

Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid, Guoqing Harry Xu

Publications and Research

Pointcut fragility is a well-documented problem in Aspect-Oriented Programming; changes to the base-code can lead to join points incorrectly falling in or out of the scope of pointcuts. We present an automated approach that limits fragility problems by providing mechanical assistance in pointcut maintenance. The approach is based on harnessing arbitrarily deep structural commonalities between program elements corresponding to join points selected by a pointcut. The extracted patterns are then applied to later versions to offer suggestions of new join points that may require inclusion. We demonstrate the usefulness of our technique by rejuvenating pointcuts in multiple versions of several …

Contributing Factors To Pointcut Fragility, Phil Greenwood, Awais Rashid, Raffi Khatchadourian

Publications and Research

Pointcut fragility is a well-documented problem of Aspect-Oriented Programming with changes to the base-code causing join points to incorrectly fall in or out of scope. In order to combat this problem a tool was developed that provides mechanical assistance to pointcut maintenance. This tool relied on the deep structural commonalities between program elements to detect when pointcut fragility occurs. During the assessment of this tool a number of common practices were uncovered that were employed both in the aspect and base-code that contributed to or prevented pointcut fragility. This paper documents the practices uncovered and describes how they can affect …

Quantum Computing: Selected Internet Resources For Librarians, Researchers, And The Casually Curious, Jill Cirasella

Publications and Research

This article is an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing news.

Tr-2009006: Intelligent Players, Sergei Artemov

Computer Science Technical Reports

No abstract provided.

Tr-2009002: Cartesian Closed Categories For The Logic Of Proofs, Florian Lengyel

Computer Science Technical Reports

No abstract provided.

Tr-2009010: Randomized Preconditioning Versus Pivoting, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2009001: Bisc: A Binary Itemset Support Counting Approach Towards Efficient Frequent Itemset Mining, Jinlin Chen, Keli Xiao

Computer Science Technical Reports

No abstract provided.

Tr-2009003: On Proof Realization On Modal Logic, Ren-June Wang

Computer Science Technical Reports

No abstract provided.

Tr-2009005: Visual Analytics: A Multi-Faceted Overview, Ilknur Icke, Elizabeth Sklar

Computer Science Technical Reports

No abstract provided.

Tr-2009007: History Tree Descriptors Of Grayscale Images, Gabor T. Herman, T. Yung Kong, Lucas M. Oliveira

Computer Science Technical Reports

No abstract provided.

Tr-2009008: Randomized Preprocessing Of Homogeneous Linear Systems Of Equations, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Tr-2009009: Solving Linear Systems With Randomized Augmentation, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Tr-2009013: Generalized Gillespie Stochastic Simulation Algorithm And Chemical Master Equation Using Timing Machinery, Ellis D. Cooper, Florian Lengyel

Computer Science Technical Reports

No abstract provided.

Tr-2009014: Randomized Preprocessing Of Homogeneous Linear Systems, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Tr-2009015: Knowledge-Based Rational Decisions And Nash Paths, Sergei Artemov

Computer Science Technical Reports

No abstract provided.

Tr-2009004: An Investigation Report On Auction Mechanism Design, Jinzhong Niu, Simon Parsons

Computer Science Technical Reports

No abstract provided.

Tr-2009011: Knowledge-Based Rational Decisions, Sergei Artemov

Computer Science Technical Reports

No abstract provided.

Tr-2009012: Rational Decisions In Non-Probabilistic Settings, Sergei Artemov

Computer Science Technical Reports

No abstract provided.

Tr-2009016: On The Effectiveness Of Projection Methods For Convex Feasibility Problems With Linear Inequality Constraints, Yair Censor, Wei Chen, Patrick L. Combettes, Ran Davidi, Gabor T. Herman

Computer Science Technical Reports

No abstract provided.

Lattice Operators And Topologies, Eva Cogan

Publications and Research

Working within a complete (not necessarily atomic) Boolean algebra, we use a sublattice to define a topology on that algebra. Our operators generalize complement on a lattice which in turn abstracts the set theoretic operator. Less restricted than those of Banaschewski and Samuel, the operators exhibit some surprising behaviors. We consider properties of such lattices and their interrelations. Many of these properties are abstractions and generalizations of topological spaces. The approach is similar to that of Bachman and Cohen. It is in the spirit of Alexandroff, Frolík, and Nöbeling, although the setting is more general. Proceeding in this manner, we …

Flocking In The Time-Dissonance Plane, Adam James Wilson

Publications and Research

This paper describes a technique for the sonification of an idealized model of the flocking behavior of birds, fish, and insects. Flocking agents are represented by pitches that move through time to produce chords of variable dissonance. The objective of each agent is to move toward more consonant chord formations with other agents. The output of the sonification is intended to provide material for use in musical composition.