Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Software Engineering (6)
- Programming Languages and Compilers (4)
- Social and Behavioral Sciences (4)
- Databases and Information Systems (3)
- American Politics (1)
-
- Applied Mathematics (1)
- Art and Design (1)
- Arts and Humanities (1)
- Biochemistry, Biophysics, and Structural Biology (1)
- Business (1)
- Cognitive Psychology (1)
- Communication (1)
- Communication Technology and New Media (1)
- Computer Engineering (1)
- Computer Law (1)
- Economics (1)
- Education (1)
- Educational Methods (1)
- Emergency and Disaster Management (1)
- Engineering (1)
- Family, Life Course, and Society (1)
- Higher Education (1)
- Information Security (1)
- Infrastructure (1)
- Intellectual Property Law (1)
- Internet Law (1)
- Law (1)
- Library and Information Science (1)
- Keyword
-
- Aspect-Oriented programming (2)
- Java 8 (2)
- Lambda expressions (2)
- Refactoring (2)
- Software evolution (2)
-
- Abrosoft Fantamorph (1)
- Affine feature extraction (1)
- Affine transformation (1)
- Anonymous Broadcast Encryption; Computer Security; Cryptography; Oblivious Storage; Privacy; Steganography (1)
- Aspect-oriented programming (1)
- Automorphism group (1)
- Bi-connectivity (1)
- Block Gaussian elimination (1)
- Broken pointcut detection (1)
- CUNY Games Conference (1)
- Communication (1)
- Computer Science (1)
- Cybersecurity (1)
- DOI model (1)
- Degree of interest model (1)
- Economics (1)
- Exponential Family (1)
- Game design (1)
- Games (1)
- Gaussian elimination (1)
- Governance (1)
- Graph Theory (1)
- Hosoya entropy (1)
- Hosoya polynomial (1)
- Hybrid learning (1)
- Publication
- Publication Type
Articles 1 - 19 of 19
Full-Text Articles in Computer Sciences
The Mathematics And Applications Behind Image Warping And Morphing, Tanvir Prince, Maria Malik, Ildefonso Salva, Ariel Mazor, Sakhr Aldaylam
The Mathematics And Applications Behind Image Warping And Morphing, Tanvir Prince, Maria Malik, Ildefonso Salva, Ariel Mazor, Sakhr Aldaylam
Publications and Research
This research is conducted in the summer of 2015 and is possible by the support of various agency, in particular, by the grant of Prof. Angulo Nieves and the New York City Research Initiative.
The purpose of this research is to reveal the mathematics and applications of the computer animation techniques of warping and morphing. A warp is a twist or distortion in the form of an object in an image while a morph is the smooth and gradual transformation of an object in one image into the object in another image. Linear algebra makes these computer animation techniques possible; …
Detecting Broken Pointcuts Using Structural Commonality And Degree Of Interest, Raffi T. Khatchadourian, Awais Rashd, Hidehiko Masuhara, Takuya Watanabe
Detecting Broken Pointcuts Using Structural Commonality And Degree Of Interest, Raffi T. Khatchadourian, Awais Rashd, Hidehiko Masuhara, Takuya Watanabe
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. Deciding which pointcuts have broken due to base-code changes is daunting, especially in large and complex systems. We present an automated approach that recommends pointcuts that are likely to require modification due to a certain base-code change and ones that do not. Our hypothesis is that join points selected by a pointcut exhibit common structural characteristics. Patterns describing such commonalities recommend pointcuts that have potentially broken to the developer. The approach …
Porting The Netbeans Java 8 Enhanced For Loop Lambda Expression Refactoring To Eclipse, Md Arefin, Raffi T. Khatchadourian
Porting The Netbeans Java 8 Enhanced For Loop Lambda Expression Refactoring To Eclipse, Md Arefin, Raffi T. Khatchadourian
Publications and Research
Java 8 is one of the largest upgrades to the popular language and framework in over a decade. However, the Eclipse IDE is missing several key refactorings that could help developers take advantage of new features in Java 8 more easily. In this paper, we discuss our ongoing work in porting the enhanced for loop to lambda expression refactoring from the NetBeans IDE to Eclipse. We also discuss future plans for new Java 8 refactorings not found in any current IDE.
Porting The Netbeans Java 8 Enhanced For Loop Lambda Expression Refactoring To Eclipse, Md Arefin, Raffi T. Khatchadourian
Porting The Netbeans Java 8 Enhanced For Loop Lambda Expression Refactoring To Eclipse, Md Arefin, Raffi T. Khatchadourian
Publications and Research
Java 8 is one of the largest upgrades to the popular language and framework in over a decade. However, the Eclipse IDE is missing several key refactorings that could help developers take advantage of new features in Java 8 more easily. In this paper, we discuss our ongoing work in porting the enhanced for loop to lambda expression refactoring from the NetBeans IDE to Eclipse. We also discuss future plans for new Java 8 refactorings not found in any current IDE.
Fraglight: Shedding Light On Broken Pointcuts In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Awais Rashid, Hidehiko Masuhara, Takuya Watanabe
Fraglight: Shedding Light On Broken Pointcuts In Evolving Aspect-Oriented Software, Raffi T. Khatchadourian, Awais Rashid, Hidehiko Masuhara, Takuya Watanabe
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. Deciding which pointcuts have broken due to base-code changes is daunting, especially in large and complex systems. We demonstrate an automated tool called FRAGLIGHT that recommends a set of pointcuts that are likely to require modification due to a certain base-code change. The underlying approach is rooted in harnessing unique and arbitrarily deep structural commonality between program elements corresponding to join points selected by a pointcut in a particular software version. …
Low-Rank Based Algorithms For Rectification, Repetition Detection And De-Noising In Urban Images, Juan Liu
Low-Rank Based Algorithms For Rectification, Repetition Detection And De-Noising In Urban Images, Juan Liu
Dissertations, Theses, and Capstone Projects
In this thesis, we aim to solve the problem of automatic image rectification and repeated patterns detection on 2D urban images, using novel low-rank based techniques. Repeated patterns (such as windows, tiles, balconies and doors) are prominent and significant features in urban scenes.
Detection of the periodic structures is useful in many applications such as photorealistic 3D reconstruction, 2D-to-3D alignment, facade parsing, city modeling, classification, navigation, visualization in 3D map environments, shape completion, cinematography and 3D games. However both of the image rectification and repeated patterns detection problems are challenging due to scene occlusions, varying illumination, pose variation and sensor …
Theory And Applications Of Outsider Anonymity In Broadcast Encryption, Irippuge Deshan Milinda Perera
Theory And Applications Of Outsider Anonymity In Broadcast Encryption, Irippuge Deshan Milinda Perera
Dissertations, Theses, and Capstone Projects
Broadcast Encryption (BE) allows efficient one-to-many secret communication of data over a broadcast channel. In the standard setting of BE, information about receivers is transmitted in the clear together with ciphertexts. This could be a serious violation of recipient privacy since the identities of the users authorized to access the secret content in certain broadcast scenarios are as sensitive as the content itself. Anonymous Broadcast Encryption (AnoBe) prevents this leakage of recipient identities from ciphertexts but at a cost of a linear lower bound (in the number of receivers) on the length of ciphertexts. A linear ciphertext length is a …
Using Python To Solve The Navier-Stokes Equations - Applications In The Preconditioned Iterative Methods, Jia Liu, Lina Wu, Xingang Fang
Using Python To Solve The Navier-Stokes Equations - Applications In The Preconditioned Iterative Methods, Jia Liu, Lina Wu, Xingang Fang
Publications and Research
This article describes a new numerical solver for the Navier-Stokes equations. The proposed solver is written in Python which is a newly developed language. The Python packages are built to solve the Navier-Stokes equations with existing libraries. We have created discretized coefficient matrices from systems of the Navier-Stokes equations by the finite difference method. In addition we focus on the preconditioned Krylov subspace iterative methods in the linearized systems. Numerical results of performances for the Preconditioned iterative methods are demonstrated. The comparison between Python and Matlab is discussed at the end of the paper.
Random Multipliers Numerically Stabilize Gaussian And Block Gaussian Elimination: Proofs And An Extension To Low-Rank Approximation, Victor Pan, Xiaodong Yan
Random Multipliers Numerically Stabilize Gaussian And Block Gaussian Elimination: Proofs And An Extension To Low-Rank Approximation, Victor Pan, Xiaodong Yan
Publications and Research
We study two applications of standard Gaussian random multipliers. At first we prove that with a probability close to 1 such a multiplier is expected to numerically stabilize Gaussian elimination with no pivoting as well as block Gaussian elimination. Then, by extending our analysis, we prove that such a multiplier is also expected to support low-rank approximation of a matrix without customary oversampling. Our test results are in good accordance with this formal study. The results remain similar when we replace Gaussian multipliers with random circulant or Toeplitz multipliers, which involve fewer random parameters and enable faster multiplication. We formally …
The Hosoya Entropy Of A Graph, Abbe Mowshowitz, Matthias Dehmer
The Hosoya Entropy Of A Graph, Abbe Mowshowitz, Matthias Dehmer
Publications and Research
This paper demonstrates properties of Hosoya entropy, a quantitative measure of graph complexity based on a decomposition of the vertices linked to partial Hosoya polynomials. Connections between the information content of a graph and Hosoya entropy are established, and the special case of Hosoya entropy of trees is investigated.
Identifying And Analyzing Rna Pseudoknots Based On Graph-Theoretical Properties Of Dual Graphs: A Partitioning Approach, Louis Petingi
Identifying And Analyzing Rna Pseudoknots Based On Graph-Theoretical Properties Of Dual Graphs: A Partitioning Approach, Louis Petingi
Publications and Research
In this paper we propose the study of properties of RNA secondary structures modeled as dual graphs, by partitioning these graphs into topological components denominated blocks. We give a full characterization of possible topological configurations of these blocks, and, in particular we show that an RNA secondary structure contains a pseudoknot if and only if its corresponding dual graph contains a block having a vertex of degree at least 3. Once a dual graph has been partitioned via computationally-efficient well-known graph-theoretical algorithms, this characterization allow us to identify these sub-topologies and physically isolate pseudoknots from RNA secondary structures and analyze …
Preconditioning For Matrix Computation, Xiaodong Yan
Preconditioning For Matrix Computation, Xiaodong Yan
Dissertations, Theses, and Capstone Projects
Preconditioning is a classical subject of numerical solution of linear systems of equations. The goal is to turn a linear system into another one which is easier to solve. The two central subjects of numerical matrix computations are LIN-SOLVE, that is, the solution of linear systems of equations and EIGEN-SOLVE, that is, the approximation of the eigenvalues and eigenvectors of a matrix. We focus on the former subject of LIN-SOLVE and show an application to EIGEN-SOLVE. We achieve our goal by applying randomized additive and multiplicative preconditioning. We facilitate the numerical solution by decreasing the condition of the coefficient matrix …
Quadratic Discriminant Analysis Revisited, Wenbo Cao
Quadratic Discriminant Analysis Revisited, Wenbo Cao
Dissertations, Theses, and Capstone Projects
In this thesis, we revisit quadratic discriminant analysis (QDA), a standard classification method. Specifically, we investigate the parameter estimation and dimension reduction problems for QDA.
Traditionally, the parameters of QDA are estimated generatively; that is the parameters are estimated by maximizing the joint likelihood of observations and their labels. In practice, classical QDA, though computationally efficient, often underperforms discriminative classifiers, such as SVM, Boosting methods, and logistic regression. Motivated by recent research on hybrid generative/discriminative learning, we propose to estimate the parameters of QDA by minimizing a convex combination of negative joint log-likelihood and negative conditional log-likelihood of observations and …
It-Enabled Coordination In Electronic Markets: An Experimental Investigation Of The Effects Of Social Communication On Group Buyers, Alexander Pelaez
It-Enabled Coordination In Electronic Markets: An Experimental Investigation Of The Effects Of Social Communication On Group Buyers, Alexander Pelaez
Dissertations, Theses, and Capstone Projects
Coordination, and the mechanisms by which coordination occurs, represents a significant area of study for economic research, and information technology. Technology enhances communication in both speed and quantity of information and when aligned with appropriate tasks can improve decision-making and task performance. Examining the effect of technology based coordination mechanisms on market platforms provides insight into outcomes as represented by buyer surplus and task completion as well as behaviors, such as network structure and emotional attitudes in economic experiments. Drawing on theory from economics and information systems, larger buyer groups should be able to obtain better prices and extract higher …
Theory Development And Pilot Testing Of A New Survey Instrument On Usability By Older Adults, Meriam Caboral-Stevens
Theory Development And Pilot Testing Of A New Survey Instrument On Usability By Older Adults, Meriam Caboral-Stevens
Dissertations, Theses, and Capstone Projects
An aging population and the use of technology are two pervasive phenomena that are burgeoning simultaneously. The confluence of these phenomena may present challenges for the older adults that could prevent a successful interface. Barriers and challenges can be addressed by examining the interface between older adults and technology. Usability is described as how well and how easily a user without formal training can interact effectively with the system. A review of the literature shows paucity in nursing theories on usability and the use of technology among older adults. This paper describes the development of a conceptual model - Use …
Tr-2015001: A Survey And Critique Of Facial Expression Synthesis In Sign Language Animation, Hernisa Kacorri
Tr-2015001: A Survey And Critique Of Facial Expression Synthesis In Sign Language Animation, Hernisa Kacorri
Computer Science Technical Reports
Sign language animations can lead to better accessibility of information and services for people who are deaf and have low literacy skills in spoken/written languages. Due to the distinct word-order, syntax, and lexicon of the sign language from the spoken/written language, many deaf people find it difficult to comprehend the text on a computer screen or captions on a television. Animated characters performing sign language in a comprehensible way could make this information accessible. Facial expressions and other non-manual components play an important role in the naturalness and understandability of these animations. Their coordination to the manual signs is crucial …
Object Oriented Programming, Praveen Khethavath
Object Oriented Programming, Praveen Khethavath
Open Educational Resources
Students write a program that reads data based on a provided banking scenario, work on inputs, and generate a report after the data is processed.
Framing The Question, "Who Governs The Internet?", Robert J. Domanski
Framing The Question, "Who Governs The Internet?", Robert J. Domanski
Publications and Research
There remains a widespread perception among both the public and elements of academia that the Internet is “ungovernable”. However, this idea, as well as the notion that the Internet has become some type of cyber-libertarian utopia, is wholly inaccurate. Governments may certainly encounter tremendous difficulty in attempting to regulate the Internet, but numerous types of authority have nevertheless become pervasive. So who, then, governs the Internet? This book will contend that the Internet is, in fact, being governed, that it is being governed by specific and identifiable networks of policy actors, and that an argument can be made as to …
Proceedings Of The 2nd Annual Cuny Games Festival, Robert O. Duncan, Joe Bisz, Francesco Crocco, Carlos Hernandez, Kathleen Offenholley, Maura A. Smale, Deborah Sturm, Cuny Games Network
Proceedings Of The 2nd Annual Cuny Games Festival, Robert O. Duncan, Joe Bisz, Francesco Crocco, Carlos Hernandez, Kathleen Offenholley, Maura A. Smale, Deborah Sturm, Cuny Games Network
Publications and Research
Proceedings of the CUNY Games Conference, held from January 16-17, 2015, at the CUNY Graduate Center and Borough of Manhattan Community College.
Health Games - Language and Composition - Design: Classroom Considerations - Games in the Physical Environment - Games and Behavioral Science - Play, Politics & Economics - Gaming Curricula, Disciplines & Programs - Gaming and History - Institutional Programming with Games - Philosophy and Roleplaying - Ed. Game Design: Strategy & Tactics - Repurposing Game Genres - Narrative, Storytelling & Games - Community & Social Justice - Extemporaneity - Personal & Social Transformation - Cognition, Design & Play …