This thesis investigates ways to reduce or eliminate the necessity of user input to learning-based personal email spam filters. Personal spam filters have been shown in previous studies to yield superior effectiveness, at the cost of requiring extensive user training which may be burdensome or impossible. This work describes new approaches to solve the problem of building a personal spam filter that requires minimal user feedback. An initial study investigates how well a personal filter can learn from different sources of data, as opposed to user’s messages. Our initial studies show that inter-user training yields substantially inferior results to intra-user training using the best known methods. Moreover, contrary to previous literature, it is found that transfer learning degrades the performance of spam filters when the source of training and test sets belong to two different users or different times. We also adapt and modify a graph-based semi-supervising learning algorithm to build a filter that can classify an entire inbox trained on twenty or fewer user judgments. Our experiments show that this approach compares well with previous techniques when trained on as few as two training examples. We also present the toolkit we developed to perform privacy-preserving user studies on spam filters. This toolkit allows researchers to evaluate any spam filter that conforms to a standard interface defined by TREC, on real users’ email boxes. Researchers have access only to the TREC-style result file, and not to any content of a user’s email stream. To eliminate the necessity of feedback from the user, we build a personal autonomous filter that learns exclusively on the result of a global spam filter. Our laboratory experiments show that learning filters with no user input can substantially improve the results of open-source and industry-leading commercial filters that employ no user-specific training. We use our toolkit to validate the performance of the autonomous filter in a user study.

A networked control system (NCS) is a feedback control system that has its control loop physically connected via real-time communication networks. To meet the demands of `teleautomation', modularity, integrated diagnostics, quick maintenance and decentralization of control, NCSs have received remarkable attention worldwide during the past decade. Yet despite their distinct advantages, NCSs are suffering from network-induced constraints such as time delays and packet dropouts, which may degrade system performance. Therefore, the network-induced constraints should be incorporated into the control design and related studies.<p> For the problem of state estimation in a network environment, we present the strategy of simultaneous input and state estimation to compensate for the effects of unknown input missing. A sub-optimal algorithm is proposed, and the stability properties are proven by analyzing the solution of a Riccati-like equation.<p> Despite its importance, system identification in a network environment has been studied poorly before. To identify the parameters of a system in a network environment, we modify the classical Kalman filter to obtain an algorithm that is capable of handling missing output data caused by the network medium. Convergence properties of the algorithm are established under the stochastic framework.<p> We further develop an adaptive control scheme for networked systems. By employing the proposed output estimator and parameter estimator, the designed adaptive control can track the expected signal. Rigorous convergence analysis of the scheme is performed under the stochastic framework as well.

Estimating the state of a system from noisy measurements is a problem which arises in a variety of scientific and industrial areas which include signal processing, communications, statistics and econometrics. Recursive filtering is one way to achieve this by incorporating noisy observations as they become available with prior knowledge of the system model. Bayesian methods provide a general framework for dynamic state estimation problems. The central idea behind this recursive Bayesian estimation is computing the probability density function of the state vector of the system conditioned on the measurements. However, the optimal solution to this problem is often intractable because it requires high-dimensional integration. Although we can use the Kalman lter in the case of a linear state space model with Gaussian noise, this method is not optimum for a non-linear and non-Gaussian system model. There are many new methods of filtering for the general case. The main emphasis of this thesis is on one such recently developed filter, the particle lter [2,3,6]. In this thesis, a detailed introduction to particle filters is provided as well as some guidelines for the efficient implementation of the particle lter. The application of particle lters to various communication channels like detection of symbols over the channels, capacity calculation of the channel are discussed.

A novel power-saving and small-area digital output cell is proposed in the first topic of this thesis. The new output cell dramatically reduces the output power consumption by filtering pre-defined spikes, which have been considered as one of the major power dissipation sources of the whole chip, with little sacrifice of speed or delay. The bound of the spikes to be removed can be pre-defined either dynamically by digital selection signals or permanently by fuses to be burned. The maximum operating clock is 200 MHz given a 10 pF off-chip load based on testing result of the testkey chip with an almost 28 % power reduction at all PVT corners. The second topic presents a design of a 19-T (19 transistors) full adder with high impedance circuit and conflict circuit. The transistor count is dramatically reduced such that the power dissipation as well as the area on chip is very small .

In principle, general approaches to optimal nonlinear filtering can be described in a unified way from the recursive Bayesian approach. The central idea to this recur- sive Bayesian estimation is to determine the probability density function of the state vector of the nonlinear systems conditioned on the available measurements. However, the optimal exact solution to this Bayesian filtering problem is intractable since it requires an infinite dimensional process. For practical nonlinear filtering applications approximate solutions are required. Recently efficient and accurate approximate non- linear filters as alternatives to the extended Kalman filter are proposed for recursive nonlinear estimation of the states and parameters of dynamical systems. First, as sampling-based nonlinear filters, the sigma point filters, the unscented Kalman fil- ter and the divided difference filter are investigated. Secondly, a direct numerical nonlinear filter is introduced where the state conditional probability density is calcu- lated by applying fast numerical solvers to the Fokker-Planck equation in continuous- discrete system models. As simulation-based nonlinear filters, a universally effective algorithm, called the sequential Monte Carlo filter, that recursively utilizes a set of weighted samples to approximate the distributions of the state variables or param- eters, is investigated for dealing with nonlinear and non-Gaussian systems. Recentparticle filtering algorithms, which are developed independently in various engineer- ing fields, are investigated in a unified way. Furthermore, a new type of particle filter is proposed by integrating the divided difference filter with a particle filtering framework, leading to the divided difference particle filter. Sub-optimality of the ap- proximate nonlinear filters due to unknown system uncertainties can be compensated by using an adaptive filtering method that estimates both the state and system error statistics. For accurate identification of the time-varying parameters of dynamic sys- tems, new adaptive nonlinear filters that integrate the presented nonlinear filtering algorithms with noise estimation algorithms are derived. For qualitative and quantitative performance analysis among the proposed non- linear filters, systematic methods for measuring the nonlinearities, biasness, and op- timality of the proposed nonlinear filters are introduced. The proposed nonlinear optimal and sub-optimal filtering algorithms with applications to spacecraft orbit es- timation and autonomous navigation are investigated. Simulation results indicate that the advantages of the proposed nonlinear filters make these attractive alterna- tives to the extended Kalman filter.

Thesis (Ph. D.)--University of Washington, 2001. / Vita. Includes bibliographical references (leaves 131-139).

Thesis (Ph. D.)--University of Texas at Austin, 2003. / Vita. Includes bibliographical references. Available also from UMI Company.

Thesis (M.S. in Mechanical Engineering)--Naval Postgraduate School, June 2004. / Thesis advisor(s): Isaac I. Kaminer. Includes bibliographical references (p. 69). Also available online.

Thesis (M.S. in Electrical Engineering)--Naval Postgraduate School, June 2003. / Thesis advisor(s): Hal A. Titus. Includes bibliographical references (p. 89-90). Also available online.

In this thesis, I propose a method for establishing a personalized recommendation system for re-ranking web search results and recommending web contents. The method is based on personal reading interest which can be reflected by the user’s dwell time on each document or webpage. I acquire document-level dwell times via a customized web browser, or a mobile device. To obtain better precision, I also explore the possibility of tracking gaze position and facial expression, from which I can determine the attractiveness of different parts of a document. Inspired by idea of Google Knowledge Graph, I also establish a graph-based ontology to maintain a user profile to describe the user’s personal reading interest. Each node in the graph is a concept, which represents the user’s potential interest on this concept. I also use the dwell time to measure concept-level interest, which can be inferred from document-level user dwell times. The graph is generated based on the Wikipedia. According to the estimated concept-level user interest, my algorithm can estimate a user’s potential dwell time over a new document, based on which personalized webpage re-ranking can be carried out. I compare the rankings produced by my algorithm with rankings generated by popular commercial search engines and a recently proposed personalized ranking algorithm. The results clearly show the superiority of my method. I also use my personalized recommendation framework in other applications. A good example is personalized document summarization. The same knowledge graph is employed to estimate the weight of every word in a document; combining with a traditional document summarization algorithm which focused on text mining, I could generate a personalized summary which emphasize the user’s interest in the document. To deal with images and videos, I present a new image search and ranking algorithm for retrieving unannotated images by collaboratively mining online search results, which consists of online images and text search results. The online image search results are leveraged as reference examples to perform content-based image search over unannotated images. The online text search results are used to estimate individual reference images’ relevance to the search query as not all the online image search results are closely related to the query. Overall, the key contribution of my method lies in its ability to deal with unreliable online image search results through jointly mining visual and textual aspects of online search results. Through such collaborative mining, my algorithm infers the relevance of an online search result image to a text query. Once I estimate a query relevance score for each online image search result, I can selectively use query specific online search result images as reference examples for retrieving and ranking unannotated images. To explore the performance of my algorithm, I tested it both on a standard public image datasets and several modestly sized personal photo collections. I also compared the performance of my method with that of two peer methods. The results are very positive, which indicate that my algorithm is superior to existing content-based image search algorithms for retrieving and ranking unannotated images. Overall, the main advantage of my algorithm comes from its collaborative mining over online search results both in the visual and the textual domains. / published_or_final_version / Computer Science / Doctoral / Doctor of Philosophy