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

Theory and Algorithms Commons

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

2,028 Full-Text Articles 3,286 Authors 740,465 Downloads 166 Institutions

All Articles in Theory and Algorithms

Faceted Search

2,028 full-text articles. Page 83 of 84.

Open Innovation In Platform Competition, Mei LIN 2010 Singapore Management University

Open Innovation In Platform Competition, Mei Lin

Research Collection School Of Computing and Information Systems

We examine the competition between a proprietary platform and an open platform,where each platform holds a two-sided market consisted of app developers and users.The open platform cultivates an innovative environment by inviting public efforts todevelop the platform itself and permitting distribution of apps outside of its own appmarket; the proprietary platform restricts apps sales solely within its app market. Weuse a game theoretic model to capture this competitive phenomenon and analyze theimpact of growth of the open source community on the platform competition. We foundthat growth of the open community mitigates the platform rivalry, and balances the developernetwork sizes on …


Memristics: Memristors, Again? – Part Ii, How To Transform Wired ‘Translations’ Between Crossbars Into Interactions?, Rudolf Kaehr 2010 ThinkArt Lab Glasgow

Memristics: Memristors, Again? – Part Ii, How To Transform Wired ‘Translations’ Between Crossbars Into Interactions?, Rudolf Kaehr

Rudolf Kaehr

The idea behind this patchwork of conceptual interventions is to show the possibility of a “buffer-free” modeling of the crossbar architecture for memristive systems on the base of a purely difference-theoretical approach. It is considered that on a nano-electronic level principles of interpretation appears as mechanisms of complementarity. The most basic conceptual approach to such a complementarity is introduced as an interchangeability of operators and operands of an operation. Therefore, the architecture of crossbars gets an interpretation as complementarity between crossbar functionality and “buffering” translation functionality. That is, the same matter functions as operator and at once, as operand – …


Memristics: Memristors, Again?, Rudolf Kaehr 2010 ThinkArt Lab Glasgow

Memristics: Memristors, Again?, Rudolf Kaehr

Rudolf Kaehr

This collection gives first and short critical reflections on the concepts of memristics, memristors and memristive systems and the history of similar movements with an own focus on a possible interplay between memory and computing functions, at once, at the same place and time, to achieve a new kind of complementarity between computation and memory on a single chip without retarding buffering conditions.


Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun LEE, Haewoon KWAK, Hosung PARK, Sue MOON 2010 Singapore Management University

Finding Influentials Based On The Temporal Order Of Information Adoption In Twitter, Changhyun Lee, Haewoon Kwak, Hosung Park, Sue Moon

Research Collection School Of Computing and Information Systems

Twitter offers an explicit mechanism to facilitate information diffusion and has emerged as a new medium for communication. Many approaches to find influentials have been proposed, but they do not consider the temporal order of information adoption. In this work, we propose a novel method to find influentials by considering both the link structure and the temporal order of information adoption in Twitter. Our method finds distinct influentials who are not discovered by other methods.


Frequency Diverse Array Radar: Signal Characterization And Measurement Accuracy, Steven H. Brady 2010 Air Force Institute of Technology

Frequency Diverse Array Radar: Signal Characterization And Measurement Accuracy, Steven H. Brady

Theses and Dissertations

Radar systems provide an important remote sensing capability, and are crucial to the layered sensing vision; a concept of operation that aims to apply the right number of the right types of sensors, in the right places, at the right times for superior battle space situational awareness. The layered sensing vision poses a range of technical challenges, including radar, that are yet to be addressed. To address the radar-specific design challenges, the research community responded with waveform diversity; a relatively new field of study which aims reduce the cost of remote sensing while improving performance. Early work suggests that the …


Handshaking Protocols And Jamming Mechanisms For Blind Rendezvous In A Dynamic Spectrum Access Environment, Aaron A. Gross 2010 Air Force Institute of Technology

Handshaking Protocols And Jamming Mechanisms For Blind Rendezvous In A Dynamic Spectrum Access Environment, Aaron A. Gross

Theses and Dissertations

Blind frequency rendezvous is an important process for bootstrapping communications between radios without the use of pre-existing infrastructure or common control channel in a Dynamic Spectrum Access (DSA) environment. In this process, radios attempt to arrive in the same frequency channel and recognize each other’s presence in changing, under-utilized spectrum. This paper refines existing blind rendezvous techniques by introducing a handshaking algorithm for setting up communications once two radios have arrived in the same frequency channel. It then investigates the effect of different jamming techniques on blind rendezvous algorithms that utilize this handshake. The handshake performance is measured by determining …


Evolutionary Artificial Neural Network Weight Tuning To Optimize Decision Making For An Abstract Game, Corey M. Miller 2010 Air Force Institute of Technology

Evolutionary Artificial Neural Network Weight Tuning To Optimize Decision Making For An Abstract Game, Corey M. Miller

Theses and Dissertations

Abstract strategy games present a deterministic perfect information environment with which to test the strategic capabilities of artificial intelligence systems. With no unknowns or random elements, only the competitors’ performances impact the results. This thesis takes one such game, Lines of Action, and attempts to develop a competitive heuristic. Due to the complexity of Lines of Action, artificial neural networks are utilized to model the relative values of board states. An application, pLoGANN (Parallel Lines of Action with Genetic Algorithm and Neural Networks), is developed to train the weights of this neural network by implementing a genetic algorithm over a …


Effects Of Channel Mismatches On Beamforming And Signal Detection, Christopher I. Allen 2010 Air Force Institute of Technology

Effects Of Channel Mismatches On Beamforming And Signal Detection, Christopher I. Allen

Theses and Dissertations

Tuner gain measurements of a multichannel receiver are reported. A linear regression model is used to characterize the gain, as a function of channel number, tuner set-on frequency, and intermediate frequency. Residual errors of this model are characterized by a t distribution. Very strong autocorrelation of tuner gain at various frequencies is noted. Tuner performance from one channel to the next is diverse; several defects at specific frequencies are noted. The Wilcoxon signed rank test is used to test normality of tuner gain among devices; normality is rejected. Antenna directivity and phase pattern measurements are also reported. An antenna element …


On The Complexity Of Scheduling University Courses, April L. Lovelace 2010 California Polytechnic State University, San Luis Obispo

On The Complexity Of Scheduling University Courses, April L. Lovelace

Master's Theses

It has often been said that the problem of creating timetables for scheduling university courses is hard, even as hard as solving an NP-Complete problem. There are many papers in the literature that make this assertion but rarely are precise problem definitions provided and no papers were found which offered proofs that the university course scheduling problem being discussed is NP-Complete.

This thesis defines a scheduling problem that has realistic constraints. It schedules professors to sections of courses they are willing to teach at times when they are available without overloading them. Both decision and optimization versions are precisely defined. …


K-Anonymity In The Presence Of External Databases, Dimitris SACHARIDIS, Kyriakos MOURATIDIS, Dimitris Papadias 2010 Singapore Management University

K-Anonymity In The Presence Of External Databases, Dimitris Sacharidis, Kyriakos Mouratidis, Dimitris Papadias

Research Collection School Of Computing and Information Systems

The concept of k-anonymity has received considerable attention due to the need of several organizations to release microdata without revealing the identity of individuals. Although all previous k-anonymity techniques assume the existence of a public database (PD) that can be used to breach privacy, none utilizes PD during the anonymization process. Specifically, existing generalization algorithms create anonymous tables using only the microdata table (MT) to be published, independently of the external knowledge available. This omission leads to high information loss. Motivated by this observation we first introduce the concept of k-join-anonymity (KJA), which permits more effective generalization to reduce the …


Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian TAN, Mun-Choon CHAN, Wendong XIAO, Peng-Yong KONG, Chen-Khong THAM 2010 Singapore Management University

Information-Quality Aware Routing In Event-Driven Sensor Networks, Hwee Xian Tan, Mun-Choon Chan, Wendong Xiao, Peng-Yong Kong, Chen-Khong Tham

Research Collection School Of Computing and Information Systems

Upon the occurrence of a phenomenon of interest in a wireless sensor network, multiple sensors may be activated, leading to data implosion and redundancy. Data aggregation and/or fusion techniques exploit spatio-temporal correlation among sensory data to reduce traffic load and mitigate congestion. However, this is often at the expense of loss in Information Quality (IQ) of data that is collected at the fusion center. In this work, we address the problem of finding the least-cost routing tree that satisfies a given IQ constraint. We note that the optimal least-cost routing solution is a variation of the classical NP-hard Steiner tree …


A Framework For Dynamizing Succinct Data Structures, Ankur Gupta, Wing K. Hon, Rahul Shah, Jeffery S. Vitter 2010 Butler University

A Framework For Dynamizing Succinct Data Structures, Ankur Gupta, Wing K. Hon, Rahul Shah, Jeffery S. Vitter

Ankur Gupta

We present a framework to dynamize succinct data structures, to encourage their use over non-succinct versions in a wide variety of important application areas. Our framework can dynamize most stateof-the-art succinct data structures for dictionaries, ordinal trees, labeled trees, and text collections.


Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson 2010 Butler University

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

Jonathan P. Sorenson

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.


Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson 2010 Butler University

Modular Exponentiation Via The Explicit Chinese Remainder Theorem, Daniel J. Bernstein, Jonathan P. Sorenson

Jonathan P. Sorenson

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.


The Pseudosquares Prime Sieve, Jonathan P. Sorenson 2010 Butler University

The Pseudosquares Prime Sieve, Jonathan P. Sorenson

Jonathan P. Sorenson

We present the pseudosquares prime sieve, which finds all primes up to n.


Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson 2010 Butler University

Fast Bounds On The Distribution Of Smooth Numbers, Scott T. Parsell, Jonathan P. Sorenson

Jonathan P. Sorenson

In this paper we present improvements to Bernstein’s algorithm, which finds rigorous upper and lower bounds for (x, y).


Genetic Algorithms For The Extended Gcd Problem, Jonathan P. Sorenson 2010 Butler University

Genetic Algorithms For The Extended Gcd Problem, Jonathan P. Sorenson

Jonathan P. Sorenson

We present several genetic algorithms for solving the extended greatest common divisor problem. After defining the problem and discussing previous work, we will state our results.


Design Of A Software Framework Prototype For Scientific Model Interoperability, Eric Fritzinger, Sohei Okamoto 2010 University of Nevada Reno

Design Of A Software Framework Prototype For Scientific Model Interoperability, Eric Fritzinger, Sohei Okamoto

2010 Annual Nevada NSF EPSCoR Climate Change Conference

19 PowerPoint slides Session 2: Infrastructure Convener: Sergiu Dascalu, UNR Abstract: -What are models? -Mathematical models used to describe a system -E.g. Atmospheric, Oceanic, Ecological, etc… -Algorithmic calculations which take input and produce estimated results -Weather forecasting, global warming predictions, sea level estimations, etc… -Models are invaluable


Segmentation Of Thermographic Images Of Hands Using A Genetic Algorithm, Payel Ghosh, Judith Gold, Melanie Mitchell 2010 Portland State University

Segmentation Of Thermographic Images Of Hands Using A Genetic Algorithm, Payel Ghosh, Judith Gold, Melanie Mitchell

Computer Science Faculty Publications and Presentations

This paper presents a new technique for segmenting thermographic images using a genetic algorithm (GA). The individuals of the GA also known as chromosomes consist of a sequence of parameters of a level set function. Each chromosome represents a unique segmenting contour. An initial population of segmenting contours is generated based on the learned variation of the level set parameters from training images. Each segmenting contour (an individual) is evaluated for its fitness based on the texture of the region it encloses. The fittest individuals are allowed to propagate to future generations of the GA run using selection, crossover and …


A Randomized Sublinear Time Parallel Gcd Algorithm For The Erew Pram, Jonathan P. Sorenson 2010 Butler University

A Randomized Sublinear Time Parallel Gcd Algorithm For The Erew Pram, Jonathan P. Sorenson

Jonathan P. Sorenson

We present a randomized parallel algorithm that computes the greatest common divisor of two integers of n bits in length with probability 1−o(1) that takes O(n log logn/ logn) time using O(n6 + ) processors for any > 0 on the EREW PRAM parallel model of computation. The algorithm either gives a correct answer or reports failure. We believe this to be the first randomized sublinear time algorithm on the EREW PRAM for this problem.


Digital Commons powered by bepress