Systems Architecture Commons^™

A Data-Descriptive Feedback Framework For Data Stream Management Systems, Rafael J. Fernández Moctezuma

Dissertations and Theses

Data Stream Management Systems (DSMSs) provide support for continuous query evaluation over data streams. Data streams provide processing challenges due to their unbounded nature and varying characteristics, such as rate and density fluctuations. DSMSs need to adapt stream processing to these changes within certain constraints, such as available computational resources and minimum latency requirements in producing results. The proposed research develops an inter-operator feedback framework, where opportunities for run-time adaptation of stream processing are expressed in terms of descriptions of substreams and actions applicable to the substreams, called feedback punctuations. Both the discovery of adaptation opportunities and the exploitation of …

On The Effect Of Heterogeneity On The Dynamics And Performance Of Dynamical Networks, Alireza Goudarzi

Dissertations and Theses

The high cost of processor fabrication plants and approaching physical limits have started a new wave research in alternative computing paradigms. As an alternative to the top-down manufactured silicon-based computers, research in computing using natural and physical system directly has recently gained a great deal of interest. A branch of this research promotes the idea that any physical system with sufficiently complex dynamics is able to perform computation. The power of networks in representing complex interactions between many parts make them a suitable choice for modeling physical systems. Many studies used networks with a homogeneous structure to describe the computational …

High Performance Geospatial Analysis On Emerging Parallel Architectures, Seth Warn

Graduate Theses and Dissertations

Geographic information systems (GIS) are performing increasingly sophisticated analyses on growing data sets. These analyses demand high performance. At the same time, modern computing platforms increasingly derive their performance from several forms of parallelism. This dissertation explores the available parallelism in several GIS-applied algorithms: viewshed calculation, image feature transform, and feature analysis. It presents implementations of these algorithms that exploit parallel processing to reduce execution time, and analyzes the effectiveness of the implementations in their use of parallel processing.

Consolidated Study On Query Expansion, Abhishek Biruduraju

UNLV Theses, Dissertations, Professional Papers, and Capstones

A typical day of million web users all over the world starts with a simple query. The quest for information on a particular topic drives them to search for it, and in the pursuit of their info the terms they supply for queries varies from person to person depending on the knowledge they have. With a vast collection of documents available on the web universe it is the onus of the retrieval system to return only those documents that are relevant and satisfy the user’s search requirements. The document mismatch problem is resolved by appending extra query terms to the …

Study Of Feature Selection Algorithms For Text-Categorization, Kandarp Dave

UNLV Theses, Dissertations, Professional Papers, and Capstones

This thesis will discuss feature selection algorithms for text-categorization. Feature selection algorithms are very important, as they can make-or-break a categorization engine. The feature selection algorithms that will be discussed in this thesis are Document Frequency, Information Gain, Chi Squared, Mutual Information, NGL (Ng-Goh-Low) coefficient, and GSS (Galavotti-Sebastiani-Simi) coefficient . The general idea of any feature selection algorithm is to determine importance of words using some measure that can keep informative words, and remove non-informative words, which can then help the text-categorization engine categorize a document, D , into some category, C . These feature selection methods are explained, implemented, …

Architecture For A Flexible And Scalable Simulation Engine, Robert C. Holcomb Jr.

Computational Modeling & Simulation Engineering Theses & Dissertations

Simulation is used by many different industries to gain insight on actions and decisions that may be too dangerous or costly to perform in reality. Although the use of computers to assist with modeling and simulation has been studied for quite a while, computer infrastructure, hardware, and capabilities are changing at a rapid pace. Computer software once written is difficult and costly to change, especially in order to take advantage of the advances in computer hardware. This thesis focuses on the design and implementation of a software simulation architecture that allows flexibility in the modeling conducted and scalability in the …

Online Assistance, Imran Khan

All Capstone Projects

From the introduction: "This project entitled Online Assistance is efficient and designed to do only one thing, facilitate communications between help desk staff and end users. The overriding design goal is to be as simple and frictionless for both users and help desk staff as is possible. It can leverage SQL server for membership and role based security or integrate with windows authentication and Active Directory groups.

Software Engineering occurs as a consequence of a process called “System Engineering”. Instead of concentrate solely on software, system-engineering focuses on a variety of elements like Analyzing, Designing and organizing these elements into …

Automatic Content Generation For Video Self Modeling, Ju Shen, Anusha Raghunathan, Sen-Ching S. Cheung, Ravi R. Patel

Computer Science Faculty Publications

Video self modeling (VSM) is a behavioral intervention technique in which a learner models a target behavior by watching a video of him or herself. Its effectiveness in rehabilitation and education has been repeatedly demonstrated but technical challenges remain in creating video contents that depict previously unseen behaviors. In this paper, we propose a novel system that re-renders new talking-head sequences suitable to be used for VSM treatment of patients with voice disorder. After the raw footage is captured, a new speech track is either synthesized using text-to-speech or selected based on voice similarity from a database of clean speeches. …

Automated Detection Of Likely Design Flaws In Layered Architectures, Aditya Budi, - Lucia, David Lo, Lingxiao Jiang, Shaowei Wang

Research Collection School Of Computing and Information Systems

Layered architecture prescribes a good principle for separating concerns to make systems more maintainable. One example of such layered architectures is the separation of classes into three groups: Boundary, Control, and Entity, which are referred to as the three analysis class stereotypes in UML. Classes of different stereotypes are interacting with one another, when properly designed, the overall interaction would be maintainable, flexible, and robust. On the other hand, poor design would result in less maintainable system that is prone to errors. In many software projects, the stereotypes of classes are often missing, thus detection of design flaws becomes non-trivial. …

A Theoretical Model Of Multi-Agent Quantum Computing, F. Matthew Mihelic

Faculty Publications

The best design for practical quantum computing is one that emulates the multi-agent quantum logic function of natural biological systems. Such systems are theorized to be based upon a quantum gate formed by a nucleic acid Szilard engine (NASE) that converts Shannon entropy of encountered molecules into useful work of nucleic acid geometric reconfiguration. This theoretical mechanism is logically and thermodynamically reversible in this special case because it is literally constructed out of the (nucleic acid) information necessary for its function, thereby allowing the nucleic acid Szilard engine to function reversibly because, since the information by which it functions exists …

Using Service Responsibility Tables To Supplement Uml In Analyzing E-Service Systems, Xin Tan, Steven Alter, Keng Siau

Research Collection School Of Computing and Information Systems

This paper proposes using Service Responsibility Tables (SRTs) as a tool in analyzing e-service systems. First it discusses difficulties and deficiencies of using formal modeling languages such as UML in analyzing e-service systems. It proposes using SRTs as an informal language and lightweight analytical tool to be used by business professionals in analyzing e-service systems. SRTs are based on a service value chain framework but do not rely on abstract concepts and constructs, and therefore can be used by business professionals to supplement UML. We suggest a set of heuristics for transforming SRTs into two key UML diagrams, thereby illustrating …

Hardware Acceleration Of Inference Computing: The Numenta Htm Algorithm, Dan Hammerstrom

Systems Science Friday Noon Seminar Series

In this presentation I will describe the latest version of the Numenta HTM Cortical Learning Algorithm and why it is interesting for doing research into radical new computer architectures. Then I will discuss the hardware acceleration research we are doing, and briefly look at some preliminary applications development.

War Fighting In Cyberspace: Evolving Force Presentation And Command And Control, M. Bodine Birdwell, Robert F. Mills

Faculty Publications

The Department of Defense (DOD) is endeavoring to define war fighting in the global cyberspace domain. Creation of US Cyber Command (USCYBERCOM), a subunified functional combatant command (FCC) under US Strategic Command (USSTRATCOM), is a huge step in integrating and coordinating the defense, protection, and operation of DOD networks; however, this step does not mean that USCYBERCOM will perform or manage all cyberspace functions. In fact the vast majority of cyberspace functions conducted by the services and combatant commands (COCOM), although vital for maintaining access to the domain in support of their operations, are not of an active war-fighting nature. …

Evaluation Of Classical Inter-Process Communication Problems In Parallel Programming Languages, Arunesh Joshi

Master's Projects

It is generally believed for the past several years that parallel programming is the future of computing technology due to its incredible speed and vastly superior performance as compared to classic linear programming. However, how sure are we that this is the case? Despite its aforesaid average superiority, usually parallel-program implementations run in single-processor machines, making the parallelism almost virtual. In this case, does parallel programming still remain superior?
The purpose of this document is to research and analyze the performance, in both storage and speed, of three parallel-programming language libraries: OpenMP, OpenMPI and PThreads, along with a few other …

User Monitor & Feedback Mechanism For Social Scientific Study On Laptop Energy Reduction, Namrata Buddhadev

Master's Projects

The dawn of the laptop era presents new challenges to the computing research community. Performance is no longer the end all be all of computing research because a new, significant requirement has cropped up: reducing the power consumption and improving battery usage. The key restriction to mobility is the constant need to be near a power outlet to recharge the laptop battery. Thus, extending battery life without compromising performance is a pressing concern.
A research named as "iGreen" was proposed to stimulate power consumption awareness and behavioral change among laptop users via interactive energy-usage feedback with college students as the …

An Architecture For Improving Timeliness And Relevance Of Cyber Incident Notifications, James L. Miller

Theses and Dissertations

This research proposes a communications architecture to deliver timely and relevant cyber incident notifications to dependent mission stakeholders. This architecture, modeled in Unified Modeling Language (UML), eschews the traditional method of pushing notifications via message as dictated in Air Force Instruction 33-138. It instead shifts to a pull or publish and subscribe method of making notifications. Shifting this paradigm improves the notification process by empowering mission owners to identify those resources on which they depend for mission accomplishment, provides a direct conduit between providing and dependent mission owners for notifications when an incident occurs, and provides a shared representation for …

Scalable Correct Memory Ordering Via Relativistic Programming, Josh Triplett, Philip William Howard, Paul E. Mckenney, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We propose and document a new concurrent programming model, relativistic programming. This model allows readers to run concurrently with writers, without blocking or using expensive synchronization. Relativistic programming builds on existing synchronization primitives that allow writers to wait for current readers to finish with minimal reader overhead. Our methodology models data structures as graphs, and reader algorithms as traversals of these graphs; from this foundation we show how writers can implement arbitrarily strong ordering guarantees for the visibility of their writes, up to and including total ordering.

Generalized Construction Of Scalable Concurrent Data Structures Via Relativistic Programming, Josh Triplett, Paul E. Mckenney, Philip W. Howard, Jonathan Walpole

Computer Science Faculty Publications and Presentations

We present relativistic programming, a concurrent programming model based on shared addressing, which supports efficient, scalable operation on either uniform shared-memory or distributed shared- memory systems. Relativistic programming provides a strong causal ordering property, allowing a series of read operations to appear as an atomic transaction that occurs entirely between two ordered write operations. This preserves the simple immutable-memory programming model available via mutual exclusion or transactional memory. Furthermore, relativistic programming provides joint-access parallelism, allowing readers to run concurrently with a writer on the same data. We demonstrate a generalized construction technique for concurrent data structures based on relativistic programming, …

A Comparison Of Relativistic And Reader-Writer Locking Approaches To Shared Data Access, Philip William Howard, Josh Triplett, Jonathan Walpole

Computer Science Faculty Publications and Presentations

This paper explores the relationship between reader-writer locking and relativistic programming approaches to managing accesses to shared data. It demonstrates that by placing certain restrictions on writers, relativistic programming allows more concurrency than reader-writer locking while still providing the same isolation guarantees. Relativistic programming also allows for a straightforward model for reasoning about the correctness of programs that allow concurrent read-write accesses.

Executable Architecture Research At Old Dominion University, Andreas Tolk, Johnny J. Garcia, Edwin A. Shuman

Computational Modeling & Simulation Engineering Faculty Publications

Executable Architectures allow the evaluation of system architectures not only regarding their static, but also their dynamic behavior. However, the systems engineering community do not agree on a common formal specification of executable architectures. To close this gap and identify necessary elements of an executable architecture, a modeling language, and a modeling formalism is topic of ongoing PhD research. In addition, systems are generally defined and applied in an operational context to provide capabilities and enable missions. To maximize the benefits of executable architectures, a second PhD effort introduces the idea of creating an executable context in addition to the …