Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- University of Nebraska - Lincoln (716)
- Singapore Management University (413)
- City University of New York (CUNY) (92)
- Old Dominion University (47)
- Chapman University (39)
-
- Portland State University (36)
- Syracuse University (27)
- San Jose State University (26)
- California Polytechnic State University, San Luis Obispo (24)
- University of Arkansas, Fayetteville (22)
- University of Dayton (22)
- Bryn Mawr College (19)
- Loyola University Chicago (16)
- Air Force Institute of Technology (15)
- University of Malaya (13)
- University of South Alabama (13)
- American University in Cairo (11)
- University of Nevada, Las Vegas (11)
- California State University, San Bernardino (10)
- Purdue University (10)
- Sacred Heart University (10)
- University of Texas at El Paso (10)
- The University of Akron (9)
- Brigham Young University (7)
- Embry-Riddle Aeronautical University (7)
- St. Mary's University (7)
- Claremont Colleges (6)
- Southern Methodist University (6)
- Technological University Dublin (6)
- University of Nebraska at Omaha (6)
- Keyword
-
- Java (43)
- Programming (37)
- Programming languages (33)
- Software engineering (29)
- Python (27)
-
- Refactoring (26)
- Computer science (22)
- Model Check (22)
- Deep learning (19)
- Programming languages (Electronic computers) (13)
- Java 8 (12)
- Static analysis (12)
- Large language models (11)
- Machine Learning (11)
- Software (11)
- Computer software -- Development (10)
- Empirical study (10)
- Imperative programs (10)
- Linear Temporal Logic (10)
- Machine learning (10)
- Software Engineering (10)
- Compilers (9)
- Computer Science (9)
- Empirical studies (9)
- Haskell (9)
- Scala (9)
- C++ (8)
- Computational thinking (8)
- Computer programming (8)
- Default methods (8)
- Publication Year
- Publication
-
- The R Journal (708)
- Research Collection School Of Computing and Information Systems (379)
- Publications and Research (58)
- Open Educational Resources (26)
- Computer Science Faculty Publications and Presentations (24)
-
- Master's Projects (22)
- Theses and Dissertations (22)
- Computer Science Faculty Publications (20)
- Dissertations and Theses Collection (Open Access) (20)
- Computer Science Faculty Research and Scholarship (19)
- Electrical & Computer Engineering Theses & Dissertations (19)
- Journal of Computer Science Integration (17)
- Master's Theses (16)
- Computer Science: Faculty Publications and Other Works (15)
- Northeast Parallel Architecture Center (15)
- Mathematics, Physics, and Computer Science Faculty Articles and Research (13)
- Student Works (2000-2009) (13)
- Dissertations and Theses (12)
- Computer Science Theses & Dissertations (10)
- Computer Science and Computer Engineering Undergraduate Honors Theses (10)
- Departmental Technical Reports (CS) (10)
- Graduate Theses and Dissertations (10)
- School of Computer Science & Engineering Faculty Publications (10)
- Archived Theses and Dissertations (9)
- Faculty Publications (9)
- Williams Honors College, Honors Research Projects (9)
- College of Engineering and Computer Science - Former Departments, Centers, Institutes and Projects (7)
- Honors Theses (7)
- Dissertations and Theses Collection (6)
- Electronic Theses, Projects, and Dissertations (6)
- Publication Type
- File Type
Articles 661 - 690 of 1844
Full-Text Articles in Computer Sciences
Sieve: Helping Developers Sift Wheat From Chaff Via Cross-Platform Analysis, Agus Sulistya, Gede A. A. P. Prana, David Lo, Christoph Treude
Sieve: Helping Developers Sift Wheat From Chaff Via Cross-Platform Analysis, Agus Sulistya, Gede A. A. P. Prana, David Lo, Christoph Treude
Research Collection School Of Computing and Information Systems
Software developers have benefited from various sources of knowledge such as forums, question-and-answer sites, and social media platforms to help them in various tasks. Extracting software-related knowledge from different platforms involves many challenges. In this paper, we propose an approach to improve the effectiveness of knowledge extraction tasks by performing cross-platform analysis. Our approach is based on transfer representation learning and word embedding, leveraging information extracted from a source platform which contains rich domain-related content. The information extracted is then used to solve tasks in another platform (considered as target platform) with less domain-related content. We first build a word …
Rplidar A2 Accuracy, Ramiro O. Garcia
Rplidar A2 Accuracy, Ramiro O. Garcia
STAR Program Research Presentations
Traffic is not only a source of frustration but also a leading cause of death for people under 35 years of age. Recent research has focused on how driver assistance technology can be used to mitigate traffic fatalities and create more enjoyable commutes. In addition, self-driving vehicles can reduce fuel consumption the amount by 5% and increases the number of cars on the highway. To achieve this we need to research reliable sensors. This summer I research Rplidar A2 sensor which hopefully will be responsible for recording distance to the preceding car and helping prevent Insider Attacks or Misbehaviors of …
Preference Learning And Similarity Learning Perspectives On Personalized Recommendation, Duy Dung Le
Preference Learning And Similarity Learning Perspectives On Personalized Recommendation, Duy Dung Le
Dissertations and Theses Collection (Open Access)
Personalized recommendation, whose objective is to generate a limited list of items (e.g., products on Amazon, movies on Netflix, or pins on Pinterest, etc.) for each user, has gained extensive attention from both researchers and practitioners in the last decade. The necessity of personalized recommendation is driven by the explosion of available options online, which makes it difficult, if not downright impossible, for each user to investigate every option. Product and service providers rely on recommendation algorithms to identify manageable number of the most likely or preferred options to be presented to each user. Also, due to the limited screen …
Exploiting Approximation, Caching And Specialization To Accelerate Vision Sensing Applications, Nguyen Loc Huynh
Exploiting Approximation, Caching And Specialization To Accelerate Vision Sensing Applications, Nguyen Loc Huynh
Dissertations and Theses Collection (Open Access)
Over the past few years, deep learning has emerged as state-of-the-art solutions for many challenging computer vision tasks such as face recognition, object detection, etc. Despite of its outstanding performance, deep neural networks (DNNs) are computational intensive, which prevent them to be widely adopted on billions of mobile and embedded devices with scarce resources. To address that limitation, we
focus on building systems and optimization algorithms to accelerate those models, making them more computational-efficient.
First, this thesis explores the computational capabilities of different existing processors (or co-processors) on modern mobile devices. It recognizes that by leveraging the mobile Graphics Processing …
A Case Study On Automated Fuzz Target Generation For Large Codebases, Matthew Kelly, Christoph Treude, Alex Murray
A Case Study On Automated Fuzz Target Generation For Large Codebases, Matthew Kelly, Christoph Treude, Alex Murray
Research Collection School Of Computing and Information Systems
Fuzz Testing is a largely automated testing technique that provides random and unexpected input to a program in attempt to trigger failure conditions. Much of the research conducted thus far into Fuzz Testing has focused on developing improvements to available Fuzz Testing tools and frameworks in order to improve efficiency. In this paper however, we instead look at a way in which we can reduce the amount of developer time required to integrate Fuzz Testing to help maintain an existing codebase. We accomplish this with a new technique for automatically generating Fuzz Targets, the modified versions of programs on which …
A Machine Learning Model For Clustering Securities, Vanessa Torres, Travis Deason, Michael Landrum, Nibhrat Lohria
A Machine Learning Model For Clustering Securities, Vanessa Torres, Travis Deason, Michael Landrum, Nibhrat Lohria
SMU Data Science Review
In this paper, we evaluate the self-declared industry classifications and industry relationships between companies listed on either the Nasdaq or the New York Stock Exchange (NYSE) markets. Large corporations typically operate in multiple industries simultaneously; however, for investment purposes they are classified as belonging to a single industry. This simple classification obscures the actual industries within which a company operates, and, therefore, the investment risks of that company.
By using Natural Language Processing (NLP) techniques on Security and Exchange Commission (SEC) filings, we obtained self-defined industry classifications per company. Using clustering techniques such as Hierarchical Agglomerative and k-means clustering we …
Successful Shot Locations And Shot Types Used In Ncaa Men’S Division I Basketball, Olivia D. Perrin
Successful Shot Locations And Shot Types Used In Ncaa Men’S Division I Basketball, Olivia D. Perrin
All NMU Master's Theses
The primary purpose of the current study was to investigate the effect of court location (distance and angle from basket) and shot types used on shot success in NCAA Men’s DI basketball during the 2017-18 season. A secondary purpose was to further expand the analysis based on two additional factors: player position (guard, forward, or center) and team ranking. All statistical analyses were completed in RStudio and three binomial logistic regression analyses were performed to evaluate factors that influence shot success; one for all two and three point shot attempts, one for only two point attempts, and one for only …
Multiagent Decision Making And Learning In Urban Environments, Akshat Kumar
Multiagent Decision Making And Learning In Urban Environments, Akshat Kumar
Research Collection School Of Computing and Information Systems
Our increasingly interconnected urban environments provide several opportunities to deploy intelligent agents—from self-driving cars, ships to aerial drones—that promise to radically improve productivity and safety. Achieving coordination among agents in such urban settings presents several algorithmic challenges—ability to scale to thousands of agents, addressing uncertainty, and partial observability in the environment. In addition, accurate domain models need to be learned from data that is often noisy and available only at an aggregate level. In this paper, I will overview some of our recent contributions towards developing planning and reinforcement learning strategies to address several such challenges present in largescale urban …
A Survey On Bluetooth 5.0 And Mesh: New Milestones Of Iot, Juenjie Yin, Zheng Yang, Hao Cao, Tongtong Liu, Zimu Zhou, Chenshu Wu
A Survey On Bluetooth 5.0 And Mesh: New Milestones Of Iot, Juenjie Yin, Zheng Yang, Hao Cao, Tongtong Liu, Zimu Zhou, Chenshu Wu
Research Collection School Of Computing and Information Systems
No abstract provided.
Safe Automated Refactoring For Intelligent Parallelization Of Java 8 Streams, Raffi Khatchadourian, Yiming Tang, Mehdi Bagherzadeh, Syed Ahmed
Safe Automated Refactoring For Intelligent Parallelization Of Java 8 Streams, Raffi Khatchadourian, Yiming Tang, Mehdi Bagherzadeh, Syed Ahmed
Publications and Research
Streaming APIs are becoming more pervasive in mainstream Object-Oriented programming languages and platforms. For example, the Stream API introduced in Java 8 allows for functional-like, MapReduce-style operations in processing both finite, e.g., collections, and infinite data structures. However, using this API efficiently involves subtle considerations such as determining when it is best for stream operations to run in parallel, when running operations in parallel can be less efficient, and when it is safe to run in parallel due to possible lambda expression side-effects. Also, streams may not run all operations in parallel depending on particular collectors used in reductions. In …
Tests As Maintainable Assets Via Auto-Generated Spies: A Case Study Involving The Scala Collections Library's Iterator Trait, Konstantin Läufer, John O'Sullivan, George K. Thiruvathukal
Tests As Maintainable Assets Via Auto-Generated Spies: A Case Study Involving The Scala Collections Library's Iterator Trait, Konstantin Läufer, John O'Sullivan, George K. Thiruvathukal
Computer Science: Faculty Publications and Other Works
In testing stateful abstractions, it is often necessary to record interactions, such as method invocations, and express assertions over these interactions. Following the Test Spy design pattern, we can reify such interactions programmatically through additional mutable state. Alternatively, a mocking framework, such as Mockito, can automatically generate test spies that allow us to record the interactions and express our expectations in a declarative domain-specific language. According to our study of the test code for Scala’s Iterator trait, the latter approach can lead to a significant reduction of test code complexity in terms of metrics such as code size (in some …
Practical And Effective Sandboxing For Linux Containers, Zhiyuan Wan, David Lo, Xin Xia, Liang Cai
Practical And Effective Sandboxing For Linux Containers, Zhiyuan Wan, David Lo, Xin Xia, Liang Cai
Research Collection School Of Computing and Information Systems
A container is a group of processes isolated from other groups via distinct kernel namespaces and resource allocation quota. Attacks against containers often leverage kernel exploits through the system call interface. In this paper, we present an approach that mines sandboxes and enables fine-grained sandbox enforcement for containers. We first explore the behavior of a container by running test cases and monitor the accessed system calls including types and arguments during testing. We then characterize the types and arguments of system call invocations and translate them into sandbox rules for the container. The mined sandbox restricts the container’s access to …
Lightweight And Efficient Neural Natural Language Processing With Quaternion Networks, Yi Tay, Aston Zhang, Anh Tuan Luu, Jinfeng Rao, Shuai Zhang, Shuohang Wang, Jie Fu, Siu Cheung Hui
Lightweight And Efficient Neural Natural Language Processing With Quaternion Networks, Yi Tay, Aston Zhang, Anh Tuan Luu, Jinfeng Rao, Shuai Zhang, Shuohang Wang, Jie Fu, Siu Cheung Hui
SCIS Student Publications
Many state-of-the-art neural models for NLP are heavily parameterized and thus memory inefficient. This paper proposes a series of lightweight and memory efficient neural architectures for a potpourri of natural language processing (NLP) tasks. To this end, our models exploit computation using Quaternion algebra and hypercomplex spaces, enabling not only expressive inter-component interactions but also significantly (75%) reduced parameter size due to lesser degrees of freedom in the Hamilton product. We propose Quaternion variants of models, giving rise to new architectures such as the Quaternion attention Model and Quaternion Transformer. Extensive experiments on a battery of NLP tasks demonstrates the …
Improving 3d Printed Prosthetics With Sensors And Motors, Rachel Zarin
Improving 3d Printed Prosthetics With Sensors And Motors, Rachel Zarin
Honors Projects
A 3D printed hand and arm prosthetic was created from the idea of adding bionic elements while keeping the cost low. It was designed based on existing models, desired functions, and materials available. A tilt sensor keeps the hand level, two motors move the wrist in two different directions, a limit switch signals the fingers to open and close, and another motor helps open and close the fingers. All sensors and motors were built on a circuit board, programmed using an Arduino, and powered by a battery. Other supporting materials include metal brackets, screws, guitar strings, elastic bands, small clamps, …
Developing 5gl Concepts From User Interactions, David Stuckless Meyer
Developing 5gl Concepts From User Interactions, David Stuckless Meyer
Masters Theses
In the fulfilling of the contracts generated in Test Driven Development, a developer could be said to act as a constraint solver, similar to those used by a 5th Generation Language(5GL). This thesis presents the hypothesis that 5GL linguistic mechanics, such as facts, rules and goals, will be emergent in the communications of developer pairs performing Test Driven Development, validating that 5GL syntax is congruent with the ways that practitioners communicate. Along the way, nomenclatures and linguistic patterns may be observed that could inform the design of future 5GL languages.
On True Language Understanding, Seng-Beng Ho, Zhaoxia Wang
On True Language Understanding, Seng-Beng Ho, Zhaoxia Wang
Research Collection School Of Computing and Information Systems
Despite the relative successes of natural language processing in providing some useful interfaces for users, natural language understanding is a much more difficult issue. Natural language processing was one of the main topics of AI for as long as computers were put to the task of generating intelligent behavior, and a number of systems that were created since the inception of AI have also been characterized as being capable of natural language understanding. However, in the existing domain of natural language processing and understanding, a definition and consensus of what it means for a system to “truly” understand language do …
Resource Constrained Deep Reinforcement Learning, Abhinav Bhatia, Pradeep Varakantham, Akshat Kumar
Resource Constrained Deep Reinforcement Learning, Abhinav Bhatia, Pradeep Varakantham, Akshat Kumar
Research Collection School Of Computing and Information Systems
In urban environments, resources have to be constantly matched to the “right” locations where customer demand is present. For instance, ambulances have to be matched to base stations regularly so as to reduce response time for emergency incidents in ERS (Emergency Response Systems); vehicles (cars, bikes among others) have to be matched to docking stations to reduce lost demand in shared mobility systems. Such problems are challenging owing to the demand uncertainty, combinatorial action spaces and constraints on allocation of resources (e.g., total resources, minimum and maximum number of resources at locations and regions). Existing systems typically employ myopic and …
Semantic Patches For Java Program Transformation (Artifact), Hong Jin Kang, Thung Ferdian, Julia Lawall, Gilles Muller, Lingxiao Jiang, David Lo
Semantic Patches For Java Program Transformation (Artifact), Hong Jin Kang, Thung Ferdian, Julia Lawall, Gilles Muller, Lingxiao Jiang, David Lo
Research Collection School Of Computing and Information Systems
The program transformation tool Coccinelle is designed for making changes that is required in many locations within a software project. It has been shown to be useful for C code and has been been adopted for use in the Linux kernel by many developers. Over 6000 commits mentioning the use of Coccinelle have been made in the Linux kernel. Our artifact, Coccinelle4J, is an extension to Coccinelle in order for it to apply program transformations to Java source code. This artifact accompanies our experience report “Semantic Patches for Java Program Transformation”, in which we show a case study of applying …
Bincor: An R Package For Estimating The Correlation Between Two Unevenly Spaced Time Series, Josue M. Polanco-Martinez, Martin A. Medina-Elizalde, Maria Fernanda Sanchez Goni, Manfred Mudelsee
Bincor: An R Package For Estimating The Correlation Between Two Unevenly Spaced Time Series, Josue M. Polanco-Martinez, Martin A. Medina-Elizalde, Maria Fernanda Sanchez Goni, Manfred Mudelsee
The R Journal
This paper presents a computational program named BINCOR (BINned CORrelation) for estimating the correlation between two unevenly spaced time series. This program is also applicable to the situation of two evenly spaced time series not on the same time grid. BINCOR is based on a novel estimation approach proposed by Mudelsee (2010) for estimating the correlation between two climate time series with different timescales. The idea is that autocorrelation (e.g. an AR1 process) means that memory enables values obtained on different time points to be correlated. Binned correlation is performed by resampling the time series under study into time bins …
Changes On Cran, Kurt Hornik, Uwe Ligges, Achim Zeileis
Changes On Cran, Kurt Hornik, Uwe Ligges, Achim Zeileis
The R Journal
In the past 8 months, 1524 new packages were added to the CRAN package repository. 71 packages were unarchived and 302 were archived. The following shows the growth of the number of active packages in the CRAN package repository:
R Foundation News, Torsten Hothorn
R Foundation News, Torsten Hothorn
The R Journal
Membership fees and donations received between 2019-01-07 and 2019-09-04
Ciuupi: An R Package For Computing Confidence Intervals That Utilize Uncertain Prior Information, Mainzer Kabaila, Paul Kabaila
Ciuupi: An R Package For Computing Confidence Intervals That Utilize Uncertain Prior Information, Mainzer Kabaila, Paul Kabaila
The R Journal
We have created the R package ciuupi to compute confidence intervals that utilize uncertain prior information in linear regression. Unlike post-model-selection confidence intervals, the confidence interval that utilizes uncertain prior information (CIUUPI) implemented in this package has, to an excellent approximation, coverage probability throughout the parameter space that is very close to the desired minimum coverage probability. Furthermore, when the uncertain prior information is correct, the CIUUPI is, on average, shorter than the standard confidence interval constructed using the full linear regression model. In this paper we provide motivating examples of scenarios where the CIUUPI may be used. We then …
R Package For Geometric Shadow Calculations In An Urban Environment, Michael Dorman, Evyatar Erell, Adi Vulkan, Itai Kloog
R Package For Geometric Shadow Calculations In An Urban Environment, Michael Dorman, Evyatar Erell, Adi Vulkan, Itai Kloog
The R Journal
This paper introduces the shadow package for R. The package provides functions for shadow-related calculations in the urban environment, namely shadow height, shadow footprint and Sky View Factor (SVF) calculations, as well as a wrapper function to estimate solar radiation while taking shadow effects into account. All functions operate on a layer of polygons with a height attribute, also known as “extruded polygons” or 2.5D vector data. Such data are associated with accuracy limitations in representing urban environments. However, unlike 3D models, polygonal layers of building outlines along with their height are abundantly available and their processing does not require …
Indoor Positioning And Fingerprinting: The R Package Ipft, Emilio Sansano, Raúl Montoliu, Óscar Belmonte, Joaquín Torres-Sospedra
Indoor Positioning And Fingerprinting: The R Package Ipft, Emilio Sansano, Raúl Montoliu, Óscar Belmonte, Joaquín Torres-Sospedra
The R Journal
Methods based on Received Signal Strength Indicator (RSSI) fingerprinting are in the forefront among several techniques being proposed for indoor positioning. This paper introduces the R package ipft, which provides algorithms and utility functions for indoor positioning using fingerprinting techniques. These functions are designed for manipulation of RSSI fingerprint data sets, estimation of positions, comparison of the performance of different positioning models, and graphical visualization of data. Well-known machine learning algorithms are implemented in this package to perform analysis and estimations over RSSI data sets. The paper provides a description of these algorithms and functions, as well as examples of …
Time-Series Clustering In R Using The Dtwclust Package, Alexis Sardá-Espinosa
Time-Series Clustering In R Using The Dtwclust Package, Alexis Sardá-Espinosa
The R Journal
Most clustering strategies have not changed considerably since their initial definition. The common improvements are either related to the distance measure used to assess dissimilarity, or the function used to calculate prototypes. Time-series clustering is no exception, with the Dynamic Time Warping distance being particularly popular in that context. This distance is computationally expensive, so many related optimizations have been developed over the years. Since no single clustering algorithm can be said to perform best on all datasets, different strategies must be tested and compared, so a common infrastructure can be advantageous. In this manuscript, a general overview of shape-based …
Editorial, Norm Matloff
Editorial, Norm Matloff
The R Journal
On behalf of the Editorial Board, I am pleased to present Volume 10, Issue 1 of the R Journal. This issue contains 36 contributed articles. The majority of which cover new or newly enhanced packages on CRAN.
Optimization Routines For Enforcing One-To-One Matches In Record Linkage Problems, Diego Moretti, Luca Valentino, Tiziana Tuoto
Optimization Routines For Enforcing One-To-One Matches In Record Linkage Problems, Diego Moretti, Luca Valentino, Tiziana Tuoto
The R Journal
Record linkage aims at quickly and accurately identifying if two records represent the same real world entity. In many applications, we are interested in restricting the linkage results to "1 to 1" links, that is a single record does not appear more than once in the output. This can be dealt with the transport algorithm. The optimization problem, however, grows quadratically in the size of the input, quickly becoming untreatable for cases with a few thousand records. This paper compares different solutions, provided by some R packages for linear programming solvers. The comparison is done in terms of memory usage …
Robustgasp: Robust Gaussian Stochastic Process Emulation In R, Mengyang Gu, Jesus Palomo, James O. Berger
Robustgasp: Robust Gaussian Stochastic Process Emulation In R, Mengyang Gu, Jesus Palomo, James O. Berger
The R Journal
Gaussian stochastic process (GaSP) emulation is a powerful tool for approximating computationally intensive computer models. However, estimation of parameters in the GaSP emulator is a challenging task. No closed-form estimator is available and many numerical problems arise with standard estimates, e.g., the maximum likelihood estimator. In this package, we implement a marginal posterior mode estimator, for special priors and parameterizations. This estimation method that meets the robust parameter estimation criteria was discussed in Gu et al. (2018); mathematical reasons are provided therein to explain why robust parameter estimation can greatly improve predictive performance of the emulator. In addition, inert inputs …
Mixedsde: A Package To Fit Mixed Stochastic Differential Equations, Charlotte Dion, Simone Hermann, Adeline Samson
Mixedsde: A Package To Fit Mixed Stochastic Differential Equations, Charlotte Dion, Simone Hermann, Adeline Samson
The R Journal
Stochastic differential equations (SDEs) are useful to model continuous stochastic processes. When (independent) repeated temporal data are available, variability between the trajectories can be modeled by introducing random effects in the drift of the SDEs. These models are useful to analyze neuronal data, crack length data, pharmacokinetics, financial data, to cite some applications among other. The R package focuses on the estimation of SDEs with linear random effects in the drift. The goal is to estimate the common density of the random effects from repeated discrete observations of the SDE. The package mixedsde proposes three estimation methods: a Bayesian parametric, …
Atable: Create Tables For Clinical Trial Reports, Armin Ströbel
Atable: Create Tables For Clinical Trial Reports, Armin Ströbel
The R Journal
Examining distributions of variables is the first step in the analysis of a clinical trial before more specific modelling can begin. Reporting these results to stakeholders of the trial is an essential part of a statistician’s work. The atable package facilitates these steps by offering easy-to-use but still flexible functions.