Computer Sciences Commons^™

Tr-2012005: Randomized Matrix Computations, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2012015: Randomized Matrix Methods For Real And Complex Polynomial Root-Finding, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2012010: Explicit Generic Common Knowledge, Evangelia Antonakos

Computer Science Technical Reports

No abstract provided.

Tr-2012001: Algebraic Algorithms, Ioannis Z. Emiris, Victor Y. Pan, Elias P. Tsigaridas

Computer Science Technical Reports

No abstract provided.

Tr-2012002: Randomized Matrix Methods For Real And Complex Polynomial Root-Finding, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2012003: Root-Finding And Root-Refining For A Polynomial Equation, Victor Y. Pan

Computer Science Technical Reports

No abstract provided.

Tr-2012006: Randomized Matrix Computations Ii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2012008: Randomized Matrix Computations Iii, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2012009: Randomized Matrix Computations Iv, Victor Y. Pan, Guoliang Qian, Ai-Long Zheng

Computer Science Technical Reports

No abstract provided.

Tr-2012012: Condition Estimation By Means Of Power Method, Victor Y. Pan

Computer Science Technical Reports

No abstract provided.

Tr-2012016: More On The Power Of Randomized Matrix Multiplication I, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

An Assessment Of Strategies For Choosing Between Competitive Marketplaces, Tim Miller, Jinzhong Niu

Publications and Research

Traders that operate in markets with multiple competing marketplaces must often choose with which marketplace they will trade. These choices encourage marketplaces to seek competitive advantages against each other by adjusting various parameters, such as the price they charge, or how they match buyers and sellers. Traders can take advantage of this competition to improve utility. However, appropriate strategies must be used to decide with which marketplace a trader should shout. In this paper, we assess several different solutions to the problem of marketplace selection by running simulations of double auctions using the JCAT platform. The parameter spaces of these …

Tr-2012007: Solving Linear Systems Of Equations With Randomization, Augmentation And Aggregation Ii, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Tr-2012013: Condition Numbers Of Random Toeplitz And Circulant Matrices, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Tr-2012014: More On The Power Of Randomized Matrix Multiplication, Victor Y. Pan, Guoliang Qian

Computer Science Technical Reports

No abstract provided.

Mba: A Market-Based Approach To Data Allocation And Migration For Cloud Database, Tengjiao Wang, Ziyu Lin, Bishan Yang, Allen Huang, Dongqing Yang, Qi Zhang, Shiwei Tang, Jinzhong Niu

Publications and Research

With the coming shift to cloud computing, cloud database is emerging to provide database service over the Internet. In the cloud-based environment, data are distributed at internet scale and the system needs to handle a huge number of user queries simultaneously without delay. How data are distributed among the servers has a crucial impact on the query load distribution and the system response time. In this paper, we propose a market-based control method, called MBA, to achieve query load balance via reasonable data distribution. In MBA, database nodes are treated as traders in a market, and certain market rules are …

A Grey-Box Approach To Automated Mechanism Design, Jinzhong Niu, Kai Cai, Simon Parsons, Xin Yao, Maria Fasli

Publications and Research

This paper presents an approach to automated mechanism design in the domain of double auctions. We describe a novel parameterized space of double auctions, and then introduce an evolutionary search method that searches this space of parameters. The approach evaluates auction mechanisms using the framework of the TAC Market Design Game and relates the performance of the markets in that game to their constituent parts using reinforcement learning. Experiments show that the strongest mechanisms we found using this approach not only win the Market Design Game against known, strong opponents, but also exhibit desirable economic properties when they run in …

Beefmoves: Dissemination, Diversity, And Dynamics Of English Borrowings In A German Hip Hop Forum, Matt Garley, Julia Hockenmaier

Publications and Research

We investigate how novel English-derived words (anglicisms) are used in a German-language Internet hip hop forum, and what factors contribute to their uptake.

Cross-Talk: A Shared Parameter Space For Gesturally Extended Human/Machine Improvisation, William Brent, Adam James Wilson

Publications and Research

This paper describes Cross-talk, a piece of music and performance system for two instruments augmented with infrared motion-tracking capability, and an artificial software improviser. Cross-talk was commissioned by the Ammerman Center for Arts and Technology at Connecticut College, for the 13th Biennial Symposium on Arts and Technology. The work is part of an ongoing collaboration focused on developing integrated hardware and software performance systems to extend the timbral and expressive capabilities of traditional musical instruments and to generate musical structure in response to information retrieved from human performers in real-time. Artistic motivations and prior related work are presented here, along …

Ackad Uses Power Computers To Solve Problems, Aldemaro Romero Jr.

Publications and Research

No abstract provided.

Geometric Graph Theory And Wireless Sensor Networks, Deniz Sarioz

Dissertations, Theses, and Capstone Projects

In this work, we apply geometric and combinatorial methods to explore a variety of problems motivated by wireless sensor networks. Imagine sensors capable of communicating along straight lines except through obstacles like buildings or barriers, such that the communication network topology of the sensors is their visibility graph. Using a standard distributed algorithm, the sensors can build common knowledge of their network topology.

We first study the following inverse visibility problem: What positions of sensors and obstacles define the computed visibility graph, with fewest obstacles? This is the problem of finding a minimum obstacle representation of a graph. This minimum …

Multimedia Content-Based Indexing And Recognition In Digital Libraries, Steven Medina

Dissertations and Theses

"Recognition of digital media is more prevalent in today’s computer culture than ever before. The advent of low cost storage has created a seemingly infinite amount of metadata on the internet, as well as on local machines throughout the world. It is more important than ever to have the capability of quickly and accurately filtering this metadata to find a desired result. Data can be searched using various criteria. For example, text data is searched by analyzing the contents of the text itself. One might execute a search using a method as simple as looking for the ASCII file name, …

Parallel Trie-Based Frequent Itemset Mining On Graphics Processors, Jay Junjie Yao

Dissertations and Theses

No abstract provided.

Developing A Comprehensive Software Toolkit For Creating Digital Mosaic Artwork, Dmitry Bosikov

Dissertations and Theses

No abstract provided.

Rapid Decoding Of Digital Data Streams Using Field Programmable Gate Arrays, Andrew Hernandez

Dissertations and Theses

No abstract provided.

Context Awareness And Discovery For Helping The Blind, Martin Goldberg

Dissertations and Theses

No abstract provided.

Re-Engineering Ccny's Business Process Of The Non-Tax Levy Disbursements Requisitions, Ferguson Rodley

Dissertations and Theses

No abstract provided.

The Niddk Central Repository At 8 Years—Ambition, Revision, Use And Impact, Charles F. Turner, Huaqin Pan, Gregg W. Silk, Mary-Anne Ardini, Vesselina Bakalov, Stephanie Bryant, Susanna Cantor, Kung-Yen Chang, Michael Delatte, Paul Eggers, Laxminarayana Ganapathi, Sujatha Lakshmikanthan, Joshua Levy, Sheping Li, Joseph Pratt, Norma Pugh, Ying Qin, Rebekah Rasooly, Helen Ray, Jean E. Richardson, Amanda Flynn Riley, Susan M. Rogers, Charlotte Scheper, Sylvia Tan, Stacie White, Philip C. Cooley

Publications and Research

The National Institute of Diabetes and Digestive and Kidney Diseases (NIDDK) Central Repository makes data and biospecimens from NIDDK-funded research available to the broader scientific community. It thereby facilitates: the testing of new hypotheses without new data or biospecimen collection; pooling data across several studies to increase statistical power; and informative genetic analyses using the Repository’s well-curated phenotypic data. This article describes the initial database plan for the Repository and its revision using a simpler model. Among the lessons learned were the trade-offs between the complexity of a database design and the costs in time and money of implementation; the …

Formalizing Reusable Aspect-Oriented Concurrency Control, Neelam Soundarajan, Derek Bronish, Raffi Khatchadourian

Publications and Research

Java and its library provide powerful concurrency control mechanisms. However, their use can lead to similar synchronization code scattered across multiple classes, synchronization and functional code being tangled together, and similar code being duplicated in many applications. Aspect-oriented (AO) programming makes it possible to address these problems. However, the specific behavior of systems built using AO techniques can be challenging to comprehend. We propose a specification approach to precisely express such systems' critical concurrency and synchronization properties. We illustrate the method with a simple example.

Automated Auction Mechanism Design With Competing Markets, Jinzhong Niu

Publications and Research

Resource allocation is a major issue in multiple areas of computer science. Despite the wide range of resource types across these areas, for example real commodities in e-commerce and computing resources in distributed computing, auctions are commonly used in solving the optimization problems involved in these areas, since well designed auctions achieve desirable economic outcomes.

Auctions are markets with strict regulations governing the information available to traders in the market and the possible actions they can take. Auction mechanism design aims to manipulate the rules of an auction in order to achieve specific goals. Economists traditionally use mathematical methods, mainly …