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

Physical Sciences and Mathematics Commons

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

Articles 1 - 9 of 9

Full-Text Articles in Physical Sciences and Mathematics

Ssrn As An Initial Revolution In Academic Knowledge Aggregation And Dissemination, David Bray, Sascha Vitzthum, Benn Konsynski Jan 2010

Ssrn As An Initial Revolution In Academic Knowledge Aggregation And Dissemination, David Bray, Sascha Vitzthum, Benn Konsynski

Sascha Vitzthum

Within this paper we consider our results of using the Social Science Research Network (SSRN) over a period of 18 months to distribute our working papers to the research community. Our experiences have been quite positive, with SSRN serving as a platform both to inform our colleagues about our research as well as inform us about related research (through email and telephoned conversations of colleagues who discovered our paper on SSRN). We then discuss potential future directions for SSRN to consider, and how SSRN might well represent an initial revolution in 21st century academic knowledge aggregation and dissemination. Our paper …


Towards Self-Organizing, Smart Business Networks: Let’S Create ‘Life’ From Inert Information, David Bray, Benn Konsynski Nov 2008

Towards Self-Organizing, Smart Business Networks: Let’S Create ‘Life’ From Inert Information, David Bray, Benn Konsynski

David A. Bray

We review three different theories that can inform how researchers can determine the performance of smart business networks, to include: (1) the Theory of Evolution, (2) the Knowledge-Based Theory of the Firm, and (3) research insights into computers and cognition. We suggest that each of these theories demonstrate that to be generally perceived as smart, an organism needs to be self-organizing, communicative, and tool-making. Consequentially, to determine the performance of a smart business network, we suggest that researchers need to determine the degree to which it is self-organizing, communicative, and tool-making. We then relate these findings to the Internet and …


Spatio-Temporal Efficiency In A Taxi Dispatch System, Darshan Santani, Rajesh Krishna Balan, C. Jason Woodard Sep 2008

Spatio-Temporal Efficiency In A Taxi Dispatch System, Darshan Santani, Rajesh Krishna Balan, C. Jason Woodard

C. Jason Woodard

In this paper, we present an empirical analysis of the GPS-enabled taxi dispatch system used by the world’s second largest land transportation company. We first summarize the collective dynamics of the more than 6,000 taxicabs in this fleet. Next, we propose a simple method for evaluating the efficiency of the system over a given period of time and geographic zone. Our method yields valuable insights into system performance—in particular, revealing significant inefficiencies that should command the attention of the fleet operator. For example, despite the state of the art dispatching system employed by the company, we find imbalances in supply …


On Searching Compressed String Collections Cache-Obliviously, Ankur Gupta, Paolo Ferragina, Roberto Grossi, Rahul Shah, Jeffrey Vitter Apr 2008

On Searching Compressed String Collections Cache-Obliviously, Ankur Gupta, Paolo Ferragina, Roberto Grossi, Rahul Shah, Jeffrey Vitter

Ankur Gupta

Current data structures for searching large string collections either fail to achieve minimum space or cause too many cache misses. In this paper we discuss some edge linearizations of the classic trie data structure that are simultaneously cache-friendly and compressed. We provide new insights on front coding [24], introduce other novel linearizations, and study how close their space occupancy is to the information-theoretic minimum. The moral is that they are not just heuristics. Our second contribution is a novel dictionary encoding scheme that builds upon such linearizations and achieves nearly optimal space, offers competitive I/O-search time, and is also conscious …


Constant-Time Query Processing, Vijayshankar Raman, Garret Swart, Lin Qiao, Frederick Reiss, Vijay Dialani, Donald Kossmann, Inderpal Narang, Richard Sidle Apr 2008

Constant-Time Query Processing, Vijayshankar Raman, Garret Swart, Lin Qiao, Frederick Reiss, Vijay Dialani, Donald Kossmann, Inderpal Narang, Richard Sidle

Vijay Dialani

Query performance in current systems depends significantly on tuning: how well the query matches the available indexes, materialized views etc. Even in a well tuned system, there are always some queries that take much longer than others. This frustrates users who increasingly want consistent response times to ad hoc queries. We argue that query processors should instead aim for constant response times for all queries, with no assumption about tuning. We present Blink, our first attempt at this goal, that runs every query as a table scan over a fully denormalized database, with hash group-by done along the way. …


Nearly Tight Bounds On The Encoding Length Of The Burrows-Wheeler Transform., Roberto Grossi, Ankur Gupta, Jeffery Vitter Dec 2007

Nearly Tight Bounds On The Encoding Length Of The Burrows-Wheeler Transform., Roberto Grossi, Ankur Gupta, Jeffery Vitter

Ankur Gupta

In this paper, we present a nearly tight analysis of the encoding length of the Burrows-Wheeler Transform (BWT) that is motivated by the text indexing setting. For a text T of n symbols drawn from an alphabet Σ, our encoding scheme achieves bounds in terms of the hth-order empirical entropy Hh of the text, and takes linear time for encoding and decoding. We also describe a lower bound on the encoding length of the BWT that constructs an infinite (non-trivial) class of texts that are among the hardest to compress using the BWT. We then show that our upper …


Rounds, Levels, And Waves: The Early Evolution Of Gameplay Segmentation, Jose Zagal, Clara Fernandez-Vara, Michael Mateas Dec 2007

Rounds, Levels, And Waves: The Early Evolution Of Gameplay Segmentation, Jose Zagal, Clara Fernandez-Vara, Michael Mateas

Jose P Zagal

This article explores the early evolution of the structure and management of gameplay in videogames. We introduce the notion of gameplay segmentation to capture the role that design elements like level, boss, and wave play in videogames, and identify three modes of segmentation. Temporal segmentation limits, synchronizes and/or coordinates player activity over time. Spatial segmentation breaks the game’s virtual space into sub-locations. Challenge segmentation presents the player with a sequence of self-contained challenges. We describe each mode, and additional sub-modes, by analyzing vintage arcade games. Our analyses illustrate how these games represent a “primordial soup” in which many current game …


Association-Based Image Retrieval, Arun D. Kulkarni, H. Gunturu, S. Datla Dec 2007

Association-Based Image Retrieval, Arun D. Kulkarni, H. Gunturu, S. Datla

Arun Kulkarni

No abstract provided.


Association-Based Image Retrieval, Arun D. Kulkarni, Harikrisha Gunturu, Srikanth Datla Dec 2007

Association-Based Image Retrieval, Arun D. Kulkarni, Harikrisha Gunturu, Srikanth Datla

Arun Kulkarni

 With advances in the computer technology and the World Wide Web there has been an explosion in the amount and complexity of multimedia data that are generated, stored, transmitted, analyzed, and accessed. In order to extract useful information from this huge amount of data, many content-based image retrieval (CBIR) systems have been developed in the last decade. A typical CBIR system captures image features that represent image properties such as color, texture, or shape of objects in the query image and try to retrieve images from the database with similar features. Recent advances in CBIR systems include relevance feedback based …