Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Publication Year
- Publication
- Publication Type
Articles 61 - 90 of 136
Full-Text Articles in Computer Engineering
Low Energy Smart Phone For The Homeless, Sean Kinzer, Daniel Marks
Low Energy Smart Phone For The Homeless, Sean Kinzer, Daniel Marks
Computer Science and Engineering Senior Theses
For our senior design project, we conducted research on the Android mobile operating system, looking for ways to improve it for the homeless. The problem with the current system is that it is designed for wealthier consumers, while less fortunate consumers such as the homeless have different requirements for them. In our researched, we attemepted to reconfigure the android operating system so that it would be more tailored to the homeless. We first researched what features the homeless value in a mobile device. We then determined how we could improve the battery life at a user configuration level based on …
Streetconnect, Kelsey Dedoshka, Kaitlin Kirasich, Katie Le
Streetconnect, Kelsey Dedoshka, Kaitlin Kirasich, Katie Le
Computer Science and Engineering Senior Theses
An estimated 2.5 million youth ages 16-24 experience homelessness in the U.S. each year. These youth are disproportionately affected by sexual health issues, including HIV,STIs, teen pregnancy and teen dating violence. For youth, mobile phones are increasingly one of the main ways that they connect to the people and resources around them. Additionally, mobile apps via tech tablet are becoming a major tool for many healthcare providers in the U.S. Healthcare providers can play a critical role in providing appropriate care to homeless youth, and linking them to other health services. Research suggests that linking healthcare with other services needed …
Text To Learn: A Digital Training System For Global Social Enterprises, Melissa Bica, Elizabeth Donahue
Text To Learn: A Digital Training System For Global Social Enterprises, Melissa Bica, Elizabeth Donahue
Computer Science and Engineering Senior Theses
Text to Learn is a training tool made with Social Enterprises in mind that uses SMS to distribute training materials and to test users on their learning. Our goal is to give social enterprises a way to train employees and customers digitally and remotely. We will create an online dashboard, using RapidSMS and a cloud storage service, for social enterprises to upload and send training materials, manage users, and create SMS-based quizzes to assess users progress.
Arsenic Detection Project: Electronics, Anthony Clemetson, John Barth
Arsenic Detection Project: Electronics, Anthony Clemetson, John Barth
Interdisciplinary Design Senior Theses
This project is a collaboration with a team of bioengineers to adapt the functionality of laboratory equipment onto a platform which could be used in the field to determine the concentration levels of toxins in ground water. To this end, using a set of printed electrodes, a device was designed and fabricated with the constraints of field use in mind: low power, low cost, with a mobile user interface. An Android phone served as the mobile user interface, and also as the power supply for the circuit and microcontroller that performed the test. This circuit applied a stimulus voltage across …
Mobile Game Application: The Magictale, Lu Cao, Albert Chang, Yetian Mao
Mobile Game Application: The Magictale, Lu Cao, Albert Chang, Yetian Mao
Computer Science and Engineering Senior Theses
Many smartphone games today consist of players making simple and repetitive actions with their fingers to play the game. Compared to traditional PC Role Playing games (RPG), current mobile games do not provide the same fictional aspects and complex components. Players creativity is almost non-existent in most simple mobile application games. To address this issue, we propose to create a IOS mobile application game which combines the complex components of traditional PC RPGs and touch screen actions of mobile games.
Resilient Families Project Web Application, Stephanie Servi, Patrick Neill
Resilient Families Project Web Application, Stephanie Servi, Patrick Neill
Computer Science and Engineering Senior Theses
In order to help The Resilient Families Project, a stress management course for at-risk families, we have created an online application to allow users to take stress examinations more frequently, and to record their thoughts and interactions pertaining to the project. In this paper, we document our thought process, design rationale and any other relevant information to the web application for the Resilient Families Project.
Divy: A Website For Facilitating The Sharing And Purchasing Of Digital Content, Aidan Crosbie, Lauren Falzarano, Nicole Pal
Divy: A Website For Facilitating The Sharing And Purchasing Of Digital Content, Aidan Crosbie, Lauren Falzarano, Nicole Pal
Computer Science and Engineering Senior Theses
For our senior design project, we designed and built software that allows people to easily sell and share digital content with others. Our system was implemented as a website where users may upload any kind of digital content of their own creation, and specify the price for which other users can download it. A user can upload up to three gigabytes of data for free; however, if they wish to charge money for downloads, our site will take a percentage of the downloads/downloads sale price. A number of technologies were used in order to accomplish this, including PHP, HTML5, CSS, …
Fpga Acceleration Of The Phylogenetic Likelihood Function For Bayesian Mcmc Inference Methods, Stephanie Zierke, Jason D. Bakos
Fpga Acceleration Of The Phylogenetic Likelihood Function For Bayesian Mcmc Inference Methods, Stephanie Zierke, Jason D. Bakos
Faculty Publications
Background
Likelihood (ML)-based phylogenetic inference has become a popular method for estimating the evolutionary relationships among species based on genomic sequence data. This method is used in applications such as RAxML, GARLI, MrBayes, PAML, and PAUP. The Phylogenetic Likelihood Function (PLF) is an important kernel computation for this method. The PLF consists of a loop with no conditional behavior or dependencies between iterations. As such it contains a high potential for exploiting parallelism using micro-architectural techniques. In this paper, we describe a technique for mapping the PLF and supporting logic onto a Field Programmable Gate Array (FPGA)-based co-processor. By leveraging …
High-Performance Heterogeneous Computing With The Convey Hc-1, Jason D. Bakos
High-Performance Heterogeneous Computing With The Convey Hc-1, Jason D. Bakos
Faculty Publications
Unlike other socket-based reconfigurable coprocessors, the Convey HC-1 contains nearly 40 field-programmable gate arrays, scatter-gather memory modules, a high-capacity crossbar switch, and a fully coherent memory system.
Integrated Circuit Implementation For A Gan Hfet Driver Circuit, Bo Wang, Jason D. Bakos, Antonello Monti
Integrated Circuit Implementation For A Gan Hfet Driver Circuit, Bo Wang, Jason D. Bakos, Antonello Monti
Faculty Publications
This paper presents the design and implementation of a new integrated circuit (IC) that is suitable for driving the new generation of high-frequency GaN HFETs. The circuit, based upon a resonant switching transition technique, is first briefly described and then discussed in detail, focusing on the design process practical considerations. A new level-shifter topology, used to generate the zero and negative gate-source voltages required to switch the GaN HFET, is introduced and analyzed. The experimental measurements included in this paper report the results of tests carried out on an IC designed and fabricated as part of the multiproject die in …
Exploiting Matrix Symmetry To Improve Fpgaaccelerated Conjugate Gradient, Jason D. Bakos, Krishna K. Nagar
Exploiting Matrix Symmetry To Improve Fpgaaccelerated Conjugate Gradient, Jason D. Bakos, Krishna K. Nagar
Faculty Publications
In this paper we describe a new approach for accelerating the Conjugate Gradient (CG) method using an FPGA co-processor. As in previous approaches, our co-processor performs a double-precision sparse matrix-vector multiplication. However, our implementation doubles the amount of computation per unit of input data by exploiting the symmetry of the input matrix and computing the upper and lower triangle of the input matrix in parallel. Using a Virtex-2 Pro 100 FPGA, we have achieved an observed computational throughput of 1155 MFLOPS.
Agents And Service-Oriented Computing For Autonomic Computing: A Research Agenda, Frances M.T. Brazier, Jeffrey O. Kephart, H. Van Dyke Parunak, Michael N. Huhns
Agents And Service-Oriented Computing For Autonomic Computing: A Research Agenda, Frances M.T. Brazier, Jeffrey O. Kephart, H. Van Dyke Parunak, Michael N. Huhns
Faculty Publications
Autonomic computing is the solution proposed to cope with the complexity of today's computing environments. Self-management, an important element of autonomic computing, is also characteristic of single and multiagent systems, as well as systems based on service-oriented architectures. Combining these technologies can be profitable for all - in particular, for the development of autonomic computing systems.
A Special-Purpose Architecture For Solving The Breakpoint Median Problem, Jason D. Bakos, Panormitis E. Elenis
A Special-Purpose Architecture For Solving The Breakpoint Median Problem, Jason D. Bakos, Panormitis E. Elenis
Faculty Publications
In this paper, we describe the design for a co-processor for whole-genome phylogenetic reconstruction. Our current design performs a parallelized breakpoint median computation, which is an expensive component of the overall application. When implemented on a field-programmable gate array (FPGA), our hardware breakpoint median achieves a maximum speedup of 1005times over software. When the coprocessor is used to accelerate the entire reconstruction procedure, we achieve a maximum application speedup of 417times. The results in this paper suggest that FPGA-based acceleration is a promising approach for computationally expensive phylogenetic problems, in spite of the fact that the involved algorithms are based …
Evaluating Shape Correspondence For Statistical Shape Analysis: A Benchmark Study, Brent C. Munsell, Pahal Dalal, Song Wang
Evaluating Shape Correspondence For Statistical Shape Analysis: A Benchmark Study, Brent C. Munsell, Pahal Dalal, Song Wang
Faculty Publications
This paper introduces a new benchmark study to evaluate the performance of landmark-based shape correspondence used for statistical shape analysis. Different from previous shape-correspondence evaluation methods, the proposed benchmark first generates a large set of synthetic shape instances by randomly sampling a given statistical shape model that defines a ground-truth shape space. We then run a test shape-correspondence algorithm on these synthetic shape instances to identify a set of corresponded landmarks. According to the identified corresponded landmarks, we construct a new statistical shape model, which defines a new shape space. We finally compare this new shape space against the ground-truth …
Globally Optimal Grouping For Symmetric Closed Boundaries By Combining Boundary And Region Information, Joachim S. Stahl, Song Wang
Globally Optimal Grouping For Symmetric Closed Boundaries By Combining Boundary And Region Information, Joachim S. Stahl, Song Wang
Faculty Publications
Many natural and man-made structures have a boundary that shows a certain level of bilateral symmetry, a property that plays an important role in both human and computer vision. In this paper, we present a new grouping method for detecting closed boundaries with symmetry. We first construct a new type of grouping token in the form of symmetric trapezoids by pairing line segments detected from the image. A closed boundary can then be achieved by connecting some trapezoids with a sequence of gap-filling quadrilaterals. For such a closed boundary, we define a unified grouping cost function in a ratio form: …
Web-Scale Workflow: Integrating Distributed Services, M. Brian Blake, Michael N. Huhns
Web-Scale Workflow: Integrating Distributed Services, M. Brian Blake, Michael N. Huhns
Faculty Publications
Modular applications, components, and services are all ways of describing the product of an organization's efforts to embody its capabilities in autonomous software modules. In fact, the integration of services using well-established workflow paradigms could amplify an organization's capabilities with the creation of a full-blown, inter-organizational system of systems. This is the essence of Web-scale workflows. Considering the recent popularity and acceptance of service-oriented technologies, the application of such distributed systems is only limited by imagination, but it's also important to understand existing research challenges and their implications to various Web-scale workflow domains.
Edge Grouping Combining Boundary And Region Information, Joachim S. Stahl, Song Wang
Edge Grouping Combining Boundary And Region Information, Joachim S. Stahl, Song Wang
Faculty Publications
This paper introduces a new edge-grouping method to detect perceptually salient structures in noisy images. Specifically, we define a new grouping cost function in a ratio form, where the numerator measures the boundary proximity of the resulting structure and the denominator measures the area of the resulting structure. This area term introduces a preference towards detecting larger-size structures and, therefore, makes the resulting edge grouping more robust to image noise. To find the optimal edge grouping with the minimum grouping cost, we develop a special graph model with two different kinds of edges and then reduce the grouping problem to …
Lightweight Error Correction Coding For System-Level Interconnects, Jason D. Bakos, Donald M. Chiarulli, Steven P. Levitan
Lightweight Error Correction Coding For System-Level Interconnects, Jason D. Bakos, Donald M. Chiarulli, Steven P. Levitan
Faculty Publications
"Lightweight hierarchical error control coding (LHECC)" is a new class of nonlinear block codes that is designed to increase noise immunity and decrease error rate for high-performance chip-to-chip and on-chip interconnects. LHECC is designed such that its corresponding encoder and decoder logic may be tightly integrated into compact, high-speed, and low-latency I/O interfaces. LHECC operates over a new channel technology called multi-bit differential signaling (MBDS). MBDS channels utilize a physical-layer channel code called "N choose M (nCm)" encoding, where each channel is restricted to a symbol set such that half of the bits in each symbol are set to one. …
Jamming Sensor Networks: Attack And Defense Strategies, Wenyuan Xu, Wade Trappe, Yanyong Zhang
Jamming Sensor Networks: Attack And Defense Strategies, Wenyuan Xu, Wade Trappe, Yanyong Zhang
Faculty Publications
Wireless sensor networks are built upon a shared medium that makes it easy for adversaries to conduct radio interference, or jamming, attacks that effectively cause a denial of service of either transmission or reception functionalities. These attacks can easily be accomplished by an adversary by either bypassing MAC-layer protocols or emitting a radio signal targeted at jamming a particular channel. In this article we survey different jamming attacks that may be employed against a sensor network. In order to cope with the problem of jamming, we discuss a two-phase strategy involving the diagnosis of the attack, followed by a suitable …
A Reconfigurable Distributed Computing Fabric Exploiting Multilevel Parallelism, Charles L. Cathey, Jason D. Bakos, Duncan A. Buell
A Reconfigurable Distributed Computing Fabric Exploiting Multilevel Parallelism, Charles L. Cathey, Jason D. Bakos, Duncan A. Buell
Faculty Publications
This paper presents a novel reconfigurable data flow processing architecture that promises high performance by explicitly targeting both fine- and course-grained parallelism. This architecture is based on multiple FPGAs organized in a scalable direct network that is substantially more interconnect-efficient than currently used crossbar technology. In addition, we discuss several ancillary issues and propose solutions required to support this architecture and achieve maximal performance for general-purpose applications; these include supporting IP, mapping techniques, and routing policies that enable greater flexibility for architectural evolution and code portability.
Convergence Of Ipsec In Presence Of Resets, Chin-Tser Huang, Mohamed G. Gouda, E.N. Elnozahy
Convergence Of Ipsec In Presence Of Resets, Chin-Tser Huang, Mohamed G. Gouda, E.N. Elnozahy
Faculty Publications
IPsec is the current security standard for the Internet Protocol IP. According to this standard, a selected computer pair (p, q) in the Internet can be designated a “security association”. This designation guarantees that all sent IP messages whose original source is computer p and whose ultimate destination is computer q cannot be replayed in the future (by an adversary between p and q) and still be received by computer q as fresh messages from p. This guarantee is provided by adding increasing sequence numbers to all IP messages sent from p to q. Thus, p needs to always remember …
Concurrent Multiple- Issue Negotiation For Internet-Based Services, Jiangbo Dang, Michael N. Huhns
Concurrent Multiple- Issue Negotiation For Internet-Based Services, Jiangbo Dang, Michael N. Huhns
Faculty Publications
Negotiation is a technique for reaching a mutually beneficial agreement among autonomous entities. In an Internet-based services context, multiple entities are negotiating simultaneously. The concurrent negotiation protocol extends existing negotiation protocols, letting both service requestors and service providers manage several negotiation processes in parallel. Colored Petri nets, which have greater expressive power than finite state machines and offer support for concurrency, represent the negotiation protocol and facilitate the analysis of desirable properties.
Salient Closed Boundary Extraction With Ratio Contour, Song Wang, Toshiro Kubota, Jeffrey Mark Siskind, Jun Wang
Salient Closed Boundary Extraction With Ratio Contour, Song Wang, Toshiro Kubota, Jeffrey Mark Siskind, Jun Wang
Faculty Publications
We present ratio contour, a novel graph-based method for extracting salient closed boundaries from noisy images. This method operates on a set of boundary fragments that are produced by edge detection. Boundary extraction identifies a subset of these fragments and connects them sequentially to form a closed boundary with the largest saliency. We encode the Gestalt laws of proximity and continuity in a novel boundary-saliency measure based on the relative gap length and average curvature when connecting fragments to form a closed boundary. This new measure attempts to remove a possible bias toward short boundaries. We present a polynomial-time algorithm …
Research Directions For Service-Oriented Multiagent Systems, Michael N. Huhns, Munindar P. Singh, Mark Burstein, Keith Decker, Edmund Durfee, Tim Finin, Les Gasser, Hrishikesh Goradia, Nick Jennings, Kiran Lakkaraju, Hideyuki Nakashima, H. Van Dyke Parunak, Jeffrey S. Rosenschein, Alicia Ruvinsky, Gita Sukthankar, Samarth Swarup, Katia Sycara, Milind Tambe, Tom Wagner, Laura Zavala, Mas Research Roadmap Project
Research Directions For Service-Oriented Multiagent Systems, Michael N. Huhns, Munindar P. Singh, Mark Burstein, Keith Decker, Edmund Durfee, Tim Finin, Les Gasser, Hrishikesh Goradia, Nick Jennings, Kiran Lakkaraju, Hideyuki Nakashima, H. Van Dyke Parunak, Jeffrey S. Rosenschein, Alicia Ruvinsky, Gita Sukthankar, Samarth Swarup, Katia Sycara, Milind Tambe, Tom Wagner, Laura Zavala, Mas Research Roadmap Project
Faculty Publications
Today's service-oriented systems realize many ideas from the research conducted a decade or so ago in multiagent systems. Because these two fields are so deeply connected, further advances in multiagent systems could feed into tomorrow's successful service-oriented computing approaches. This article describes a 15-year roadmap for service-oriented multiagent system research.
A Semantic Web Services Architecture, Mark Burstein, Christoph Bussler, Michal Zaremba, Tim Finn, Michael N. Huhns, Massimo Paolucci, Amit P. Sheth, Stuart Williams
A Semantic Web Services Architecture, Mark Burstein, Christoph Bussler, Michal Zaremba, Tim Finn, Michael N. Huhns, Massimo Paolucci, Amit P. Sheth, Stuart Williams
Faculty Publications
The semantic Web services initiative architecture (SWSA) committee has created a set of architectural and protocol abstractions that serve as a foundation for semantic Web service technologies. This article summarizes the committee's findings, emphasizing its review of requirements gathered from several different environments. We also identify the scope and potential requirements for a semantic Web services architecture.
Service-Oriented Computing: Key Concepts And Principles, Michael N. Huhns, Munindar P. Singh
Service-Oriented Computing: Key Concepts And Principles, Michael N. Huhns, Munindar P. Singh
Faculty Publications
Traditional approaches to software development - the ones embodied in CASE tools and modeling frameworks - are appropriate for building individual software components, but they are not designed to face the challenges of open environments. Service-oriented computing provides a way to create a new architecture that reflects components' trends toward autonomy and heterogeneity. We thus emphasize SOC concepts instead of how to deploy Web services in accord with current standards. To begin the series, we describe the key concepts and abstractions of SOC and the elements of a corresponding engineering methodology.
Multiagent Systems With Workflows, José M. Vidal, Paul A. Buhler, Christian Stahl
Multiagent Systems With Workflows, José M. Vidal, Paul A. Buhler, Christian Stahl
Faculty Publications
Industry and researchers have two different visions for the future of Web services. Industry wants to capitalize on Web service technology to automate business processes via centralized workflow enactment. Researchers are interested in the dynamic composition of Web services. We show how these two visions are points in a continuum and discuss a possible path for bridging the gap between them.
Image Segmentation With Ratio Cut, Song Wang, Jeffrey Mark Siskind
Image Segmentation With Ratio Cut, Song Wang, Jeffrey Mark Siskind
Faculty Publications
This paper proposes a new cost function, cut ratio, for segmenting images using graph-based methods. The cut ratio is defined as the ratio of the corresponding sums of two different weights of edges along the cut boundary and models the mean affinity between the segments separated by the boundary per unit boundary length. This new cost function allows the image perimeter to be segmented, guarantees that the segments produced by bipartitioning are connected, and does not introduce a size, shape, smoothness, or boundary-length bias. The latter allows it to produce segmentations where boundaries are aligned with image edges. Furthermore, the …
Identity Management, Duncan A. Buell, Ravi Sandhu
Identity Management, Duncan A. Buell, Ravi Sandhu
Faculty Publications
No abstract provided.
The Sentient Web, Michael N. Huhns
The Sentient Web, Michael N. Huhns
Faculty Publications
In a startling revelation, a team of university scientists has reported that a network of computers has become conscious and sentient, and is beginning to assume control of online information system. In spite of the ominous tone typically chosen for dramatic effect, a sentient Web would be more helpful and much easier for people to use. An agent is an active, persistent software component that perceives, reasons, and acts, and whose actions include communication. Agents inherently take intentional actions based on sensory information and memories of past actions. All agents have necessary communication ability, but they do not necessarily possess …