Site-wide links

Computing & Information Sciences

Discovering new, innovative methods and research opportunities in solving complex present-day and future computing challenges.

Gottlieb presents an early case study of his mobile augmented reality game Jewish Time Jump: New York design on the ARIS platform for the iPhone and iPad (iOS). The game is set on-location in Washington Square Park in New York city. Players in 5th-7th grade... READ MORE
With the growing popularity of mobile devices that have sophisticated localization capability, it becomes more convenient and tempting to give away location data in exchange for recognition and status in the social networks. Geosocial networks, as an example, offer the ability to notify a user... READ MORE
Analysis of eyetracking data can serve as an alternative method of evaluation when assessing the quality of computer-synthesized animations of American Sign Language (ASL), technology which can make information accessible to people who are deaf or hard-of-hearing, who may have lower levels of written language... READ MORE
My thoughts on the future of education in system administration. READ MORE
American Sign Language (ASL) is a visual gestural language which is used by many people who are deaf or hard-of-hearing. In this paper, we design a visual recognition system based on action recognition techniques to recognize individual ASL signs. Specifically, we focus on recognition of... READ MORE
Computer-based sign language recognition from video is a challenging problem because of the spatiotemporal complexities inherent in sign production and the variations within and across signers. However, linguistic information can help constrain sign recognition to make it a more feasible classification problem. We have... READ MORE
We investigate a method for selecting recordings of human face and head movements from a sign language corpus to serve as a basis for generating animations of novel sentences of American Sign Language (ASL). Drawing from a collection of recordings that have been categorized into... READ MORE
Animations of sign language can increase the accessibility of information for people who are deaf or hard of hearing (DHH), but prior work has demonstrated that accurate non-manual expressions (NMEs), consisting of face and head movements, are necessary to produce linguistically accurate animations that are... READ MORE
Recent advancements in the accuracy of Automated Speech Recognition (ASR) technologies have made them a potential candidate for the task of captioning. However, the presence of errors in the output may present challenges in their use in a fully automatic system. In this research, we... READ MORE
The percentage of the worldwide population with some form of disability is rising, and computing technologies, if accessible, could facilitate full participation in society for these users. However, the issue of equal access to technology is rarely included in curricula for computing students. While prior... READ MORE
The goal of this covert channel is to prove the feasibility of using encrypted HTTPS traffic to carry a covert channel. The encryption key is not needed because the original HTTPS payload is not decrypted. The covert message will be appended to the HTTPS data... READ MORE
A subliminal covert channel establishes a nearly undetectable communication session within a pre-established data stream between two separate entities. This document explains how HTTP can be utilized to facilitate a covert channel over both local and wide area networks. The Hypertext Transfer Protocol (HTTP) accounts... READ MORE
As the demand for skilled computer security professionals continues to increase, curricula at colleges and universities must continually evolve to meet current industry needs. Incorporating Metasploit module development into these curricula increases the value of the education received by the graduate and makes them a... READ MORE
The Ramsey number R(C4, Km) is the smallest n such that any graph on n vertices contains a cycle of length four or an independent set of order m. With the help of computer algorithms we obtain the exact values of the Ramsey numbers R(C4,... READ MORE
For graphs G1, G2, G3, the three-color Ramsey number R(G1, G2, G3) is the smallest integer n such that if we arbitrarily color the edges of the complete graph of order n with 3 colors, then it contains a monochromatic copy of Gi in color... READ MORE
We study a new problem for cubic graphs: bipartization of a cubic graph Q by deleting sufficiently large independent set I. It can be expressed as follows: Given a connected n-vertex tripartite cubic graph Q = (V, E) with independence number α(Q), does Q contain... READ MORE
Let ∆s = R(K3, Ks) − R(K3, Ks−1), where R(G, H) is the Ramsey number of graphs G and H defined as the smallest n such that any edge coloring of Kn with two colors contains G in the first color or H in the... READ MORE
In “Exploring a High-Capacity Covert Channel for the Android Operating System” [1], a covert channel for communicating between different applications on the Android operating system was introduced and evaluated. This covert... READ MORE