<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns="http://www.w3.org/2005/Atom">
<title>Theses (Electrical Engineering and Computer Science)</title>
<link href="http://hdl.handle.net/1957/8163" rel="alternate"/>
<subtitle/>
<id>http://hdl.handle.net/1957/8163</id>
<updated>2013-05-20T06:24:28Z</updated>
<dc:date>2013-05-20T06:24:28Z</dc:date>
<entry>
<title>Helping end-user programmers help themselves : the idea garden approach</title>
<link href="http://hdl.handle.net/1957/38561" rel="alternate"/>
<author>
<name>Cao, Chen</name>
</author>
<id>http://hdl.handle.net/1957/38561</id>
<updated>2013-05-13T18:20:57Z</updated>
<published>2013-04-24T00:00:00Z</published>
<summary type="text">Helping end-user programmers help themselves : the idea garden approach
Cao, Chen
End-user programmers face many barriers in programming. Research has seen many programming environments that attempted to lower or remove the barriers but despite these efforts, empirical studies continue to report barriers users face. To investigate this issue, we took a theory-informed approach. Using theories from design, creativity, and problem solving as a lens, we examined end-user programmers' programming obstacles to derive design implications. Synthesizing the implications, we proposed an Idea Garden approach for creating problem-solving support in existing end-user programming environments aimed at helping users help themselves. This approach focuses on delivering problem-solving strategies and programming knowledge in the context of users' work to help them overcome barriers. We developed a proof-of-concept prototype of an Idea Garden for the CoScripter environment. Results from empirical studies of the prototype were encouraging: not only was the Idea Garden able to help users overcome barriers, learn relevant programming and strategies, but such learning persisted with users so that they were able to apply it toward problem-solving new tasks without further help from the Idea Garden. We conclude by providing recommendations to researchers who are interested in developing an Idea Garden for their end-user programming environments.
Graduation date: 2013
</summary>
<dc:date>2013-04-24T00:00:00Z</dc:date>
</entry>
<entry>
<title>Improved stability in ACTFEL devices</title>
<link href="http://hdl.handle.net/1957/38548" rel="alternate"/>
<author>
<name>Khormaei, Iranpour</name>
</author>
<id>http://hdl.handle.net/1957/38548</id>
<updated>2013-05-13T15:54:23Z</updated>
<published>1989-06-23T00:00:00Z</published>
<summary type="text">Improved stability in ACTFEL devices
Khormaei, Iranpour
The stability of ZnS:Mn AC thin film Electroluminescence (ACEFEL)&#13;
devices as demonstrated by the brightness-voltage (BV)&#13;
characteristics is discussed. Two procedures for improvement of the&#13;
stability are demonstrated. The first method is the addition of a&#13;
CaS buffer layer to one or both interfaces of the ZnS active phosphor&#13;
layer. The second method for improving the stability involves a&#13;
vacuum anneal followed by an oxygen exposure. The oxygen exposure is&#13;
accomplished by heat treatment of the ZnS surface in air or an oxygen&#13;
plasma prior to the deposition of the second insulator.&#13;
A model for the observed instability is proposed in which&#13;
accumulation of positive charge near the ZnS insulator interfaces&#13;
gives rise to the observed increase in the BV threshold voltage with&#13;
aging for the control sample. The positive interface charge is&#13;
attributed to sulfur vacancies which are positively ionized donors.&#13;
The improved device stability is attributed to a reduction in the&#13;
sulfur vacancy concentration in the ZnS concomitant with the addition&#13;
of a CaS buffer layer or oxygen exposure of the ZnS surface.
Graduation date: 1990
</summary>
<dc:date>1989-06-23T00:00:00Z</dc:date>
</entry>
<entry>
<title>A time-multiplexed switched-capacitor circuit for neural network applications</title>
<link href="http://hdl.handle.net/1957/38547" rel="alternate"/>
<author>
<name>Hansen, James Edward, 1962-</name>
</author>
<id>http://hdl.handle.net/1957/38547</id>
<updated>2013-05-13T15:47:36Z</updated>
<published>1989-06-30T00:00:00Z</published>
<summary type="text">A time-multiplexed switched-capacitor circuit for neural network applications
Hansen, James Edward, 1962-
Analog computation in the form of neural networks is currently&#13;
receiving much attention. Existing algorithms cannot be easily&#13;
implemented in hardware because of the large number of neurons needed&#13;
and the number of connections necessary between them. These problems&#13;
have motivated development of alternatives to a conventional&#13;
implementation. Hence, a time-multiplexed switched-capacitor&#13;
computational block with some neural network characteristics has been&#13;
developed. The goal of this work is not to exactly model biological&#13;
neuron qualities but rather to emulate their primary characteristics to the&#13;
extent necessary to solve some types of problems not suited to digital&#13;
processing.
Graduation date: 1990
</summary>
<dc:date>1989-06-30T00:00:00Z</dc:date>
</entry>
<entry>
<title>Active learning of constraints for semi-supervised clustering</title>
<link href="http://hdl.handle.net/1957/38533" rel="alternate"/>
<author>
<name>Xiong, Sicheng</name>
</author>
<id>http://hdl.handle.net/1957/38533</id>
<updated>2013-05-09T17:42:24Z</updated>
<published>2013-04-25T00:00:00Z</published>
<summary type="text">Active learning of constraints for semi-supervised clustering
Xiong, Sicheng
Semi-supervised clustering aims to improve clustering performance by considering user supervision in the form of pairwise constraints. In this paper, we study the active learning problem of selecting pairwise must-link and cannot-link constraints for semisupervised clustering. We consider active learning in an iterative manner where in each iteration queries are selected based on the current clustering solution and the existing constraint set. We apply a general framework that builds on the concept of neighborhood, where neighborhoods contain "labeled examples" of different clusters according to the pairwise constraints. Our active learning method expands the neighborhoods by selecting informative points and querying their relationship with the neighborhoods. Under this framework, we build on the classic uncertainty-based principle and present a novel approach for computing the uncertainty associated with each data point. We further introduce a selection criterion that trades-off the amount of uncertainty of each data point with the expected number of queries (the cost) required to resolve this uncertainty. This allows us to select queries that have the highest information rate. We evaluate the proposed method on the benchmark datasets and the results demonstrate consistent and substantial improvements over the current state-of-the-art.
Graduation date: 2013
</summary>
<dc:date>2013-04-25T00:00:00Z</dc:date>
</entry>
</feed>
