Programming Languages and Compilers Commons^™

Cuda Web Api Remote Execution Of Cuda Kernels Using Web Services, Massimo J. Becker

Master's Theses

Massively parallel programming is an increasingly growing field with the recent introduction of general purpose GPU computing. Modern graphics processors from NVIDIA and AMD have massively parallel architectures that can be used for such applications as 3D rendering, financial analysis, physics simulations, and biomedical analysis. These massively parallel systems are exposed to programmers through in- terfaces such as NVIDIAs CUDA, OpenCL, and Microsofts C++ AMP. These frame- works expose functionality using primarily either C or C++. In order to use these massively parallel frameworks, programs being implemented must be run on machines equipped with massively parallel hardware. These requirements limit …

Pointcut Rejuvenation: Recovering Pointcut Expressions In Evolving Aspect-Oriented Software, Raffi Khatchadourian, Phil Greenwood, Awais Rashid, 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. In this paper, 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. To illustrate that the motivation behind our proposal is well founded, …

Node Filtering And Face Routing For Sensor Network, Umang Amatya

College of Engineering: Graduate Celebration Programs

Main Contributions

•Efficient Algorithms for identifying Redundant Sensor Nodes

•New Technique for Filtering Redundant Nodes in Sensor Network

•Reliable Algorithm for Message Routing - Forwarding

•User Friendly Prototype Implementation in Java

•Results of Experimental Investigation

Extending Java For Android Programming, Yoonsik Cheon

Departmental Technical Reports (CS)

Android is one of the most popular platforms for developing mobile applications. However, its framework relies on programming conventions and styles to implement framework-specific concepts like activities and intents, causing problems such as reliability, readability, understandability, and maintainability. We propose to extend Java to support Android framework concepts explicitly as built-in language features. Our extension called Android Java will allow Android programmers to express these concepts in a more reliable, natural, and succinct way.

Health Nexus: A Serious Game Prototype For Prevention And Treatment Of Obesity And Diabetes, Joseph C. Miller

Computational Modeling & Simulation Engineering Theses & Dissertations

Electronic games are a prevalent phenomenon of American culture and entertainment. Serious games are video games that take advantage of games' intrinsic entertaining and challenging characteristics for serious purposes, such as education, training, advertisement, and political campaigns. A significant number of serious games have been developed for a variety of diverse purposes. The last few years have witnessed the inception and growth of motion sensing technologies for games, including Nintendo Wii, Sony PlayStation Move, and Microsoft Kinect. These motion sensing technologies usually require game players' physical body movement in order to perform and achieve in the games, such as playing …

Programming In A Socially Networked World: The Evolution Of The Social Programmer, Christoph Treude, Fernando Figueira Filho, Brendan Cleary, Margaret-Anne Storey

Research Collection School Of Computing and Information Systems

Social media has changed how software developers collaborate, how they coordinate their work, and where they find information. Social media sites, such as the Question and Answer (Q&A) portal Stack Overflow, fill archives with millions of entries that contribute to what we know about software development, covering a wide range of topics. For today’s software developers, reusable code snippets, introductory usage examples, and pertinent libraries are often just a web search away. In this position paper, we discuss the opportunities and challenges for software developers that rely on web content curated by the crowd, and we envision the future of …

Formal Modeling And Validation Of Stateflow Diagrams, Chunqing Chen, Jun Sun, Yang Liu, Jin Song Dong, Manchun Zheng

Research Collection School Of Computing and Information Systems

Stateflow is an industrial tool for modeling and simulating control systems in model-based development. In this paper, we present our latest work on automatic verification of Stateflow using model-checking techniques. We propose an approach to systematically translate Stateflow diagrams to a formal modeling language called CSP# by precisely following Stateflow’s execution semantics, which is described by examples. A translator is developed inside the Process Analysis Toolkit (PAT) model checker to automate this process with the support of various Stateflow advanced modeling features. Formal analysis can be conducted on the transformed CSP# with PAT’s simulation and model-checking power. Using our approach, …

How Is M&S Interoperability Different From Other Interoperability Domains?, Andreas Tolk, Saikou Y. Diallo, Jose J. Padilla, Charles D. Turnitsa

Computational Modeling & Simulation Engineering Faculty Publications

During every standard workshop or event, the examples of working interoperability solutions are used to motivate for 'plug and play' standards for M&S as well, like standardized batteries for electronics, or the use of XML to exchange data between heterogeneous systems. While these are successful applications of standards, they are off the mark regarding M&S interoperability. The challenge of M&S is that the product that needs to be made interoperable is not the service or the system alone, but the model behind it as well. The paper shows that the alignment of conceptualizations is the real problem that is not …

Patterns As Objects In Grace, Andrew P. Black, Michael Homer, James Noble, David J. Pearce, Kim B. Bruce

Computer Science Faculty Publications and Presentations

Object orientation and pattern matching are often seen as conflicting approaches to program design. Object oriented programs place type-dependent behaviour inside objects and invoke it via dynamic dispatch, while pattern matching programs place type-dependent behaviour outside data structures and invoke it via multiway conditionals (case statements). Grace is a new, dynamic, object-oriented language designed to support teaching: to this end, Grace needs to support both styles. In this paper we explain how this conflict can be resolved gracefully: by modelling patterns and cases as partial functions, reifying those functions as first-class objects, and then building up complex patterns from simpler …

Parallel Sorting On A Spatial Computer, Max Orhai, Andrew P. Black

Computer Science Faculty Publications and Presentations

We describe a parallel sort for a spatial computer that requires minimal communication. We show simulations of the sort in 1 and 2 dimensions.

Presentation slides are located below in the Additional Files

The Basic Scheme For The Evaluation Of Functional Logic Programs, Arthur Peters

Dissertations and Theses

Functional logic languages provide a powerful programming paradigm combining the features of functional languages and logic languages. However, current implementations of functional logic languages are complex, slow, or both. This thesis presents a scheme, called the Basic Scheme, for compiling and executing functional logic languages based on non-deterministic graph rewriting. This thesis also describes the implementation and optimization of a prototype of the Basic Scheme. The prototype is simple and performs well compared to other current implementations.

A Hybridized Lagrangian Relaxation And Simulated Annealing Method For The Course Timetabling Problem, Aldy Gunawan, Kim Leng Poh

Research Collection School Of Computing and Information Systems

This paper describes a timetabling problem at universities, where a master course timetable is given extrinsically and conflicts due to students' course enrollment do not need to be considered. A solver for the problem, which integrates both teacher assignment and course scheduling, is described. An initial solution is obtained by a mathematical programming approach based on Lagrangian relaxation. This solution is further improved by a simulated annealing algorithm. The proposed method has been tested on instances from a university in Indonesia, as well as on several randomly generated datasets, and the corresponding computational results are reported.

Fusion Of Visual And Thermal Images Using Genetic Algorithms, Sertan Erkanli, Jiang Li, Ender Oguslu, Shangce Gao (Ed.)

Electrical & Computer Engineering Faculty Publications

No abstract provided.

Using The Google Visualisation Api With R, Markus Gesmann, Diego De Castillo

The R Journal

The googleVis package provides an interface between R and the Google Visualisation API to create interactive charts which can be embedded into web pages. The best known of these charts is probably the Motion Chart, popularised by Hans Rosling in his TED talks. With the googleVis package users can easily create web pages with interactive charts based on R data frames and display them either via the local R HTTPhelp server or within their own sites.

Nonparametric Goodness-Of-Fit Tests For Discrete Null Distributions, Taylor B. Arnold, John W. Emerson

The R Journal

Methodology extending nonparametric goodness-of-fit tests to discrete null distributions has existed for several decades. However, modern statistical software has generally failed to provide this methodology to users. We offer a revision of R’s ks.test() function and a new cvm.test() function that fill this need in the R language for two of the most popular nonparametric goodness-of-fit tests. This paper describes these contributions and provides examples of their usage. Particular attention is given to various numerical issues that arise in their implementation.

Implementing The Compendium Concept With Sweave And Docstrip, Michael Lundholm

The R Journal

This article suggests an implementation of the compendium concept by combining Sweave and the LATEX literate programming environment DOCSTRIP.

Content-Based Social Network Analysis Of Mailing Lists, Angela Bohn, Ingo Feinerer, Kurt Hornik, Patrick Mair

The R Journal

Social Network Analysis (SNA) provides tools to examine relationships between people. Text Mining (TM) allows capturing the text they produce in Web 2.0 applications, for example, however it neglects their social structure. This paper applies an approach to combine the two methods named “content-based SNA”. Using the R mailing lists, R-help and R-devel, we show how this combination can be used to describe people’s interests and to find out if authors who have similar interests actually communicate. We find that the expected positive relationship between sharing interests and communicating gets stronger as the centrality scores of authors in the communication …

Grapher: A Multiplatform Gui For Drawing Customizable Graphs In R, Maxime Hervé

The R Journal

This article presents GrapheR, a Graphical User Interface allowing the user to draw customizable and high-quality graphs without knowing any R commands. Six kinds of graph are available: histograms, box-and-whisker plots, bar plots, pie charts, curves and scatter plots. The complete process is described with the examples of a bar plot and a scatter plot illustrating the legendary puzzle of African and European swallows’ migrations.

Ckmeans.1d.Dp: Optimal K-Means Clustering In One Dimension By Dynamic Programming, Haizhou Wang, Mingzhou Song

The R Journal

The heuristic k-means algorithm, widely used for cluster analysis, does not guarantee optimality. We developed a dynamic programming algorithm for optimal one-dimensional clustering. The algorithm is implemented as an R package called Ckmeans.1d.dp. We demonstrate its ad vantage in optimality and runtime over the standard iterative k-means algorithm.

Watch Your Spelling!, Kurt Hornik, Duncan Murdoch

The R Journal

We discuss the facilities in base R for spell checking via Aspell, Hunspell or Ispell, which are useful in particular for conveniently checking the spelling of natural language texts in package Rd files and vignettes. Spell checking performance is illustrated using the Rd files in package stats. This example clearly indicates the need for a domain-specific statistical dictionary. We analyze the results of spell checking all Rd files in all CRAN packages and show how these can be employed for building such a dictionary.