Open Access. Powered by Scholars. Published by Universities.®
Programming Languages and Compilers Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Numerical Analysis and Scientific Computing (53)
- Software Engineering (22)
- Databases and Information Systems (13)
- Graphics and Human Computer Interfaces (10)
- Other Computer Sciences (9)
-
- Systems Architecture (9)
- Theory and Algorithms (9)
- Information Security (7)
- Engineering (5)
- OS and Networks (5)
- Social and Behavioral Sciences (4)
- Computer Engineering (3)
- Artificial Intelligence and Robotics (2)
- Business (2)
- Education (2)
- Library and Information Science (2)
- Operational Research (2)
- Operations Research, Systems Engineering and Industrial Engineering (2)
- Systems Engineering (2)
- Accessibility (1)
- Advertising and Promotion Management (1)
- Anthropology (1)
- Archival Science (1)
- Art Practice (1)
- Art and Design (1)
- Arts Management (1)
- Arts and Humanities (1)
- Institution
-
- University of Nebraska - Lincoln (49)
- Singapore Management University (10)
- University of Dayton (7)
- City University of New York (CUNY) (4)
- Nova Southeastern University (3)
-
- Portland State University (3)
- San Jose State University (3)
- California Polytechnic State University, San Luis Obispo (2)
- Old Dominion University (2)
- University of Texas at El Paso (2)
- Bryn Mawr College (1)
- Claremont Colleges (1)
- DePauw University (1)
- East Texas A&M University (1)
- James Madison University (1)
- The University of Akron (1)
- University of Arkansas, Fayetteville (1)
- University of Connecticut (1)
- Wayne State University (1)
- Keyword
-
- Computer Science (3)
- Programming (3)
- Aspect-Oriented programming (2)
- Computer science (2)
- Educational technology (2)
-
- Java 8 (2)
- Lambda expressions (2)
- Refactoring (2)
- Software (2)
- Software evolution (2)
- AOP (1)
- API (1)
- API understanding (1)
- Adaptive resonance theory (1)
- Addon (1)
- Algebraic data types (1)
- Analytical modeling (1)
- Apple (1)
- Application framework (1)
- Archives (1)
- Aspect coupling metrics (1)
- Aspect interference (1)
- Aspect-oriented programming (1)
- Assistive software (1)
- Behavior modelling (1)
- Blind (1)
- Bootstrap (1)
- Broken pointcut detection (1)
- CSS3 (1)
- Canary (1)
- Publication
-
- The R Journal (48)
- Research Collection School Of Computing and Information Systems (9)
- Computer Science Faculty Publications (5)
- Publications and Research (4)
- CCAC Theses and Dissertations (3)
-
- Master's Projects (3)
- Computer Science Faculty Publications and Presentations (2)
- Computer Science Working Papers (2)
- Departmental Technical Reports (CS) (2)
- CMC Senior Theses (1)
- Computational Modeling & Simulation Engineering Theses & Dissertations (1)
- Computer Engineering (1)
- Computer Science Faculty Research and Scholarship (1)
- Computer Science Faculty publications (1)
- Computer Science and Computer Engineering Undergraduate Honors Theses (1)
- Department of Physics and Astronomy - Faculty Scholarship (1)
- Dissertations and Theses (1)
- Engineering Management & Systems Engineering Theses & Dissertations (1)
- Honors Scholar Theses (1)
- Human Biology Open Access Pre-Prints (1)
- Research Collection Lee Kong Chian School Of Business (1)
- STAR Program Research Presentations (1)
- School of Computing: Dissertations, Theses, and Student Research (1)
- Velma K. Waters Library Faculty Publications (1)
- Williams Honors College, Honors Research Projects (1)
- Publication Type
Articles 61 - 90 of 94
Full-Text Articles in Programming Languages and Compilers
The Complex Multivariate Gaussian Distribution, Robin K.S. Hankin
The Complex Multivariate Gaussian Distribution, Robin K.S. Hankin
The R Journal
Here I introduce package cmvnorm, a complex generalization of the mvtnorm package. A complex generalization of the Gaussian process is suggested and numerical results presented using the package. An application in the context of approximating the Weierstrass-function using a complex Gaussian process is given.
Verifying Parameterized Timed Security Protocols, Li Li, Jun Sun, Yang Liu, Jin Song Dong
Verifying Parameterized Timed Security Protocols, Li Li, Jun Sun, Yang Liu, Jin Song Dong
Research Collection School Of Computing and Information Systems
Quantitative timing is often explicitly used in systems for better security, e.g., the credentials for automatic website logon often has limited lifetime. Verifying timing relevant security protocols in these systems is very challenging as timing adds another dimension of complexity compared with the untimed protocol verification. In our previous work, we proposed an approach to check the correctness of the timed authentication in security protocols with fixed timing constraints. However, a more difficult question persists, i.e., given a particular protocol design, whether the protocol has security flaws in its design or it can be configured secure with proper parameter values? …
Changes In R, R Core Team
Changes In R, R Core Team
The R Journal
CHANGES IN R 3.2.1
CHANGES IN R 3.2.0
CHANGES IN R 3.1.3
Changes On Cran, Kurt Hornik, Achim Zeileis
Changes On Cran, Kurt Hornik, Achim Zeileis
The R Journal
New packages in CRAN task views
New contributed packages
Other changes
R Foundation News, Kurt Hornik
R Foundation News, Kurt Hornik
The R Journal
Donations
New Supporting Institutions
New Supporting Members
Implementing Persistent O(1) Stacks And Queues In R, Shawn T. O'Neil
Implementing Persistent O(1) Stacks And Queues In R, Shawn T. O'Neil
The R Journal
True to their functional roots, most R functions are side-effect-free, and users expect datatypes to be persistent. However, these semantics complicate the creation of efficient and dynamic data structures. Here, we describe the implementation of stack and queue data structures satisfying these conditions in R, available in the CRAN package rstackdeque. Guided by important work in purely functional languages, we look at both partially- and fully-persistent versions of queues, comparing their performance characteristics. Finally, we illustrate the usefulness of such dynamic structures with examples of generating and solving mazes.
R As An Environment For Reproducible Analysis Of Dna Amplification Experiments, Stefan Rödiger, Michał Burdukiewicz, Konstantin Blagodatskikh, Michael Jahn, Peter Schierack
R As An Environment For Reproducible Analysis Of Dna Amplification Experiments, Stefan Rödiger, Michał Burdukiewicz, Konstantin Blagodatskikh, Michael Jahn, Peter Schierack
The R Journal
There is an ever-increasing number of applications, which use quantitative PCR (qPCR) or digital PCR (dPCR) to elicit fundamentals of biological processes. Moreover, quantitative isothermal amplification (qIA) methods have become more prominent in life sciences and point-of-care diagnostics. Additionally, the analysis of melting data is essential during many experiments. Several software packages have been developed for the analysis of such datasets. In most cases, the software is either distributed as closed source software or as monolithic block with little freedom to perform highly customized analysis procedures. We argue, among others, that R is an excellent foundation for reproducible and transparent …
Correspondence Analysis On Generalised Aggregated Lexical Tables (Ca-Galt) In The Factominer Package, Belchin Kostov, Mónica Bécue-Bertaut, François Husson
Correspondence Analysis On Generalised Aggregated Lexical Tables (Ca-Galt) In The Factominer Package, Belchin Kostov, Mónica Bécue-Bertaut, François Husson
The R Journal
Correspondence analysis on generalised aggregated lexical tables (CA-GALT) is a method that generalizes classical CA-ALT to the case of several quantitative, categorical and mixed variables. It aims to establish a typology of the external variables and a typology of the events from their mutual relationships. In order to do so, the influence of external variables on the lexical choices is untangled cancelling the associations among them, and to avoid the instability issued from multicollinearity, they are substituted by their principal components. The CaGalt function, implemented in the FactoMineR package, provides numerous numerical and graphical outputs. Confidence ellipses are also provided …
Sae: An R Package For Small Area Estimation, Isabel Molina, Yolanda Marhuenda
Sae: An R Package For Small Area Estimation, Isabel Molina, Yolanda Marhuenda
The R Journal
We describe the R package sae for small area estimation. This package can be used to obtain model-based estimates for small areas based on a variety of models at the area and unit levels, along with basic direct and indirect estimates. Mean squared errors are estimated by analytical approximations in simple models and applying bootstrap procedures in more complex models. We describe the package functions and show how to use them through examples.
The R Journal (June 2015) 7(1): Complete Issue, The R Foundation
The R Journal (June 2015) 7(1): Complete Issue, The R Foundation
The R Journal
Editorial, Bettina Grün
Contributed Research Articles
Peptides: A Package for Data Mining of Antimicrobial Peptides, Daniel Osorio, Paola Rondón-Villarreal, and Rodrigo Torres
fanplot: An R Package for Visualising Sequential Distributions, Guy J. Abel
sparkTable: Generating Graphical Tables for Websites and Documents with R, Alexander Kowarik, Bernhard Meindl, and Matthias Templ
rdrobust: An R Package for Robust Nonparametric Inference in Regression-Discontinuity Designs, Sebastian Calonico, Matias D. Cattaneo, and Rocío Titiunik
Frames2: A Package for Estimation in Dual Frame Surveys, Antonio Arcos, David Molina, Maria Giovanna Ranalli, and María del Mar Rueda
The Complex Multivariate Gaussian Distribution, Robin K. S. Hankin
sae: …
Frames2: A Package For Estimation In Dual Frame Surveys, Antonio Arcos, David Molina, Maria Giovanna Ranalli, Maria Del Mar Rueda
Frames2: A Package For Estimation In Dual Frame Surveys, Antonio Arcos, David Molina, Maria Giovanna Ranalli, Maria Del Mar Rueda
The R Journal
Data from complex survey designs require special consideration with regard to estimation of finite population parameters and corresponding variance estimation procedures, as a consequence of significant departures from the simple random sampling assumption. In the past decade a number of statistical software packages have been developed to facilitate the analysis of complex survey data. All these statistical software packages are able to treat samples selected from one sampling frame containing all population units. Dual frame surveys are very useful when it is not possible to guarantee a complete coverage of the target population and may result in considerable cost savings …
Introducing Faceted Exception Handling For Dynamic Information Flow, Sri Tej Narala
Introducing Faceted Exception Handling For Dynamic Information Flow, Sri Tej Narala
Master's Projects
JavaScript is most commonly used as a part of web browsers, especially client- side scripts interacting with the user. JavaScript is also the source of many security problems, which includes cross-site scripting attacks. The primary challenge is that code from untrusted sources run with full privileges on the client side, thus lead- ing to security breaches. This paper develops information flow controls with proper exception handling to prevent violations of data confidentiality and integrity.
Faceted values are a mechanism to handle dynamic information flow security in a way that overcomes the limitations caused by dynamic execution, but previous work has …
Adding Syntax Parameters To The Sweet.Js Macro Library For Javascript, Vimal Kumar
Adding Syntax Parameters To The Sweet.Js Macro Library For Javascript, Vimal Kumar
Master's Projects
Lisp and Scheme have demonstrated the power of macros to enable programmers to evolve and craft languages. A macro is a rule or pattern that specifies how a certain input sequence should be mapped to an output sequence according to some defined procedure. Using a macro system a programmer can introduce new syntactic elements to the programming language. Macros found in a program are expanded by a macro expander and allow a programmer to enable code reuse. Mozilla Sweet.JS provides a way for developers to enrich their JavaScript code by adding new syntax to the language through the use of …
Operational Semantics For Featherweight Lua, Hanshu Lin
Operational Semantics For Featherweight Lua, Hanshu Lin
Master's Projects
Lua is a small, embedded language to provide scripting in other languages. De- spite a clean, minimal syntax, it is still too complex for formal reasoning because of some syntactic sugar or specific syntax structures in Lua.
This thesis develops Featherweight Lua (FWLua), following the tradition of lan- guages like Featherweight Java[1] and Featherweight JavaScript[2]. The goal is to develop a core of language features that, while remaining simple enough for formal reasoning, also remain faithful to the central characteristics of the language. Specifi- cally for Lua, the core features that are essential for our modeling include:
∙ First-class functions …
Heuristic Collective Learning For Efficient And Robust Emergence Of Social Norms, Jianye Hao, Jun Sun, Dongping Huang, Yi Cai, Chao Yu
Heuristic Collective Learning For Efficient And Robust Emergence Of Social Norms, Jianye Hao, Jun Sun, Dongping Huang, Yi Cai, Chao Yu
Research Collection School Of Computing and Information Systems
In multiagent systems, social norms is a useful technique in regulating agents’ behaviors to achieve coordination or cooperation among agents. One important research question is to investigate how a desirable social norm can be evolved in a bottom-up manner through local interactions. In this paper, we propose two novel learning strategies under the collective learning framework: collective learning EV-l and collective learning EV-g, to efficiently facilitate the emergence of social norms. Experimental results show that both learning strategies can support the emergence of desirable social norms more efficiently in a much broader range of multiagent interaction scenarios than previous work, …
Wip, Armon Nayeraini
Wip, Armon Nayeraini
Computer Science and Computer Engineering Undergraduate Honors Theses
Games have been shown to be capable tools in teaching. Additionally, programming can be a hard skill to learn. The objective of this research was to create a game that helps student learn coding concepts by playing a video game. The result of our work is a fully functional game that introduces the beginning concepts of programming: sequential, conditional, iterative operations.
Compression Of Video Tracking And Bandwidth Balancing Routing In Wireless Multimedia Sensor Networks, Yin Wang, Jianjun Yang, Ju Shen, Bryson Payne, Juan Guo, Kun Hua
Compression Of Video Tracking And Bandwidth Balancing Routing In Wireless Multimedia Sensor Networks, Yin Wang, Jianjun Yang, Ju Shen, Bryson Payne, Juan Guo, Kun Hua
Computer Science Faculty Publications
There has been a tremendous growth in multimedia applications over wireless networks. Wireless Multimedia Sensor Networks(WMSNs) have become the premier choice in many research communities and industry. Many state-of-art applications, such as surveillance, traffic monitoring, and remote heath care are essentially video tracking and transmission in WMSNs. The transmission speed is constrained by the big file size of video data and fixed bandwidth allocation in constant routing paths. In this paper, we present a CamShift based algorithm to compress the tracking of videos. Then we propose a bandwidth balancing strategy in which each sensor node is able to dynamically select …
Locating Potential Aspect Interference Using Clustering Analysis, Brian Todd Bennett
Locating Potential Aspect Interference Using Clustering Analysis, Brian Todd Bennett
CCAC Theses and Dissertations
Software design continues to evolve from the structured programming paradigm of the 1970s and 1980s and the object-oriented programming (OOP) paradigm of the 1980s and 1990s. The functional decomposition design methodology used in these paradigms reduced the prominence of non-functional requirements, which resulted in scattered and tangled code to address non-functional elements. Aspect-oriented programming (AOP) allowed the removal of crosscutting concerns scattered throughout class code into single modules known as aspects. Aspectization resulted in increased modularity in class code, but introduced new types of problems that did not exist in OOP. One such problem was aspect interference, in which aspects …
Design, Programming, And User-Experience, Kaila G. Manca
Design, Programming, And User-Experience, Kaila G. Manca
Honors Scholar Theses
This thesis is a culmination of my individualized major in Human-Computer Interaction. As such, it showcases my knowledge of design, computer engineering, user-experience research, and puts into practice my background in psychology, com- munications, and neuroscience.
I provided full-service design and development for a web application to be used by the Digital Media and Design Department and their students.This process involved several iterations of user-experience research, testing, concepting, branding and strategy, ideation, and design. It lead to two products.
The first product is full-scale development and optimization of the web appli- cation.The web application adheres to best practices. It was …
Making Your Popcorn And Enjoying It Too, Sean Anderson, Adam C. Northam
Making Your Popcorn And Enjoying It Too, Sean Anderson, Adam C. Northam
Velma K. Waters Library Faculty Publications
No abstract provided.
Java Animated Software For Teaching The Frank-Wolfe Algorithm For Static Traffic Network Equilibrium, Zhi Li
Java Animated Software For Teaching The Frank-Wolfe Algorithm For Static Traffic Network Equilibrium, Zhi Li
Computational Modeling & Simulation Engineering Theses & Dissertations
The popular Frank-Wolfe (FW) algorithm for solving the network equilibrium problems plays an important role in transportation simulation. Not only has the basic Frank Wolfe algorithm been studied, but also other variations of the FW algorithm (such as Conjugate Frank Wolfe and Bi-Conjugate Frank Wolfe algorithms) have been extensively studied by the research communities.
In this work, the basic Frank Wolfe algorithm is re-visited for the purpose of developing a useful, user-friendly, and appealing Java computer animation for enhancing the teaching effectiveness of this fundamental transportation static network equilibrium algorithm. Since the shortest path (SP) algorithms (such as the well-known …
Leading Undergraduate Students To Big Data Generation, Jianjun Yang, Ju Shen
Leading Undergraduate Students To Big Data Generation, Jianjun Yang, Ju Shen
Computer Science Faculty Publications
People are facing a flood of data today. Data are being collected at unprecedented scale in many areas, such as networking, image processing, virtualization, scientific computation, and algorithms. The huge data nowadays are called Big Data. Big data is an all encompassing term for any collection of data sets so large and complex that it becomes difficult to process them using traditional data processing applications. In this article, the authors present a unique way which uses network simulator and tools of image processing to train students abilities to learn, analyze, manipulate, and apply Big Data. Thus they develop students hands-on …
Hole Detection And Shape-Free Representation And Double Landmarks Based Geographic Routing In Wireless Sensor Networks, Jianjun Yang, Zongming Fei, Ju Shen
Hole Detection And Shape-Free Representation And Double Landmarks Based Geographic Routing In Wireless Sensor Networks, Jianjun Yang, Zongming Fei, Ju Shen
Computer Science Faculty Publications
In wireless sensor networks, an important issue of geographic routing is “local minimum” problem, which is caused by a “hole” that blocks the greedy forwarding process. Existing geographic routing algorithms use perimeter routing strategies to find a long detour path when such a situation occurs. To avoid the long detour path, recent research focuses on detecting the hole in advance, then the nodes located on the boundary of the hole advertise the hole information to the nodes near the hole. Hence the long detour path can be avoided in future routing. We propose a heuristic hole detecting algorithm which identifies …
Privacycanary: Privacy-Aware Recommenders With Adaptive Input Obfuscation, Thivya Kandappu, Arik Friedman, Roksan Borelli, Vijay Sivaraman
Privacycanary: Privacy-Aware Recommenders With Adaptive Input Obfuscation, Thivya Kandappu, Arik Friedman, Roksan Borelli, Vijay Sivaraman
Research Collection School Of Computing and Information Systems
Recommender systems are widely used by online retailers to promote products and content that are most likely to be of interest to a specific customer. In such systems, users often implicitly or explicitly rate products they have consumed, and some form of collaborative filtering is used to find other users with similar tastes to whom the products can be recommended. While users can benefit from more targeted and relevant recommendations, they are also exposed to greater risks of privacy loss, which can lead to undesirable financial and social consequences. The use of obfuscation techniques to preserve the privacy of user …
Metalogic Notes, Saverio Perugini
Metalogic Notes, Saverio Perugini
Computer Science Working Papers
A collection of notes, formulas, theorems, postulates and terminology in symbolic logic, syntactic notions, semantic notions, linkages between syntax and semantics, soundness and completeness, quantified logic, first-order theories, Goedel's First Incompleteness Theorem and more.
Statistics Notes, Saverio Perugini
Statistics Notes, Saverio Perugini
Computer Science Working Papers
A collection of terms, definitions, formulas and explanations about statistics.
Injective Type Families For Haskell, Jan Stolarek, Simon Peyton Jones, Richard A. Eisenberg
Injective Type Families For Haskell, Jan Stolarek, Simon Peyton Jones, Richard A. Eisenberg
Computer Science Faculty Research and Scholarship
Haskell, as implemented by the Glasgow Haskell Compiler (GHC), allows expressive type-level programming. The most popular type- level programming extension is TypeFamilies, which allows users to write functions on types. Yet, using type functions can cripple type inference in certain situations. In particular, lack of injectivity in type functions means that GHC can never infer an instantiation of a type variable appearing only under type functions. In this paper, we describe a small modification to GHC that allows type functions to be annotated as injective. GHC naturally must check validity of the injectivity annotations. The algorithm to do so is …
A Predictive Modeling System: Early Identification Of Students At-Risk Enrolled In Online Learning Programs, Mary L. Fonti
A Predictive Modeling System: Early Identification Of Students At-Risk Enrolled In Online Learning Programs, Mary L. Fonti
CCAC Theses and Dissertations
Predictive statistical modeling shows promise in accurately predicting academic performance for students enrolled in online programs. This approach has proven effective in accurately identifying students who are at-risk enabling instructors to provide instructional intervention. While the potential benefits of statistical modeling is significant, implementations have proven to be complex, costly, and difficult to maintain. To address these issues, the purpose of this study is to develop a fully integrated, automated predictive modeling system (PMS) that is flexible, easy to use, and portable to identify students who are potentially at-risk for not succeeding in a course they are currently enrolled in. …
Math In The Dark: Tools For Expressing Mathematical Content By Visually Impaired Students, Patricia M. Mcdermott-Wells
Math In The Dark: Tools For Expressing Mathematical Content By Visually Impaired Students, Patricia M. Mcdermott-Wells
CCAC Theses and Dissertations
Blind and visually impaired students are under-represented in the science, technology, engineering, and mathematics disciplines of higher education and the workforce. This is due primarily to the difficulties they encounter in trying to succeed in mathematics courses. While there are sufficient tools available to create Braille content, including the special Nemeth Braille used in the U.S. for mathematics constructs, there are very few tools to allow a blind or visually impaired student to create his/her own mathematical content in a manner that sighted individuals can use. The software tools that are available are isolated, do not interface well with other …
The Future Of Ios Development: Evaluating The Swift Programming Language, Garrett Wells
The Future Of Ios Development: Evaluating The Swift Programming Language, Garrett Wells
CMC Senior Theses
Swift is a new programming language developed by Apple for creating iOS and Mac OS X applications. Intended to eventually replace Objective-C as Apple’s language of choice, Swift needs to convince developers to switch over to the new language. Apple has promised that Swift will be faster than Objective-C, as well as offer more modern language features, be very safe, and be easy to learn and use. In this thesis I test these claims by creating an iOS application entirely in Swift as well as benchmarking two different algorithms. I find that while Swift is faster than Objective-C, it does …