Query: The Intelligent surfer: Probabilistic Combination of Link and Content Information in PageRank

Relevant passages:
Authoritative Sources in a Hyperlinked Environment <=SEP=> The network structure of a hyperlinked environment can be a rich source of information about the content of the environment, provided we have effective means for understanding it. We develop a set of algorithmic tools for extracting information from the link structures of such environments, and report on experiments that demonstrate their effectiveness in a variety of context on the World Wide Web. The central issue we address within our framework is the distillation of broad search topics, through the discovery of “authorative” information sources on such topics. We propose and test an algorithmic formulation of the notion of authority, based on the relationship between a set of relevant authoritative pages and the set of “hub pages” that join them together in the link structure. Our formulation has connections to the eigenvectors of certain matrices associated with the link graph; these connections in turn motivate additional heuristrics for link-based analysis.

Efficient Computation of PageRank <=SEP=> This paper discusses efficient techniques for computing PageRank, a ranking metric for hypertext documents. We show that PageRank can be computed for very large subgraphs of the web (up to hundreds of millions of nodes) on machines with limited main memory. Running-time measurements on various memory configurations are presented for PageRank computation over the 24-million-page Stanford WebBase archive. We discuss several methods for analyzing the convergence of PageRank based on the induced ordering of the pages. We present convergence results helpful for determining the number of iterations necessary to achieve a useful PageRank assignment, both in the absence and presence of search queries.

The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity <=SEP=> We describe a joint probabilistic model for modeling the contents and inter-connectivity of document collections such as sets of web pages or research paper archives. The model is based on a probabilistic factor decomposition and allows identifying principal topics of the collection as well as authoritative documents within those topics. Furthermore, the relationships between topics is mapped out in order to build a predictive model of link content. Among the many applications of this approach are information retrieval and search, topic identification, query disambiguation, focused web crawling, web authoring, and bibliometric analysis.

The PageRank Citation Ranking: Bringing Order to the Web. <=SEP=> The importance of a Web page is an inherently subjective matter, which depends on the readers interests, knowledge and attitudes. But there is still much that can be said objectively about the relative importance of Web pages. This paper describes PageRank, a method for rating Web pages objectively and mechanically, e ectively measuring the human interest and attention devoted to them. We compare PageRank to an idealized random Web surfer. We show how to e ciently compute PageRank for large numbers of pages. And, we show how to apply PageRank to search and to user navigation.

The Anatomy of a Large-Scale Hypertextual Web Search Engine <=SEP=> In this paper, we present Google, a prototype of a large-scale search engine which makes heavy use of the structure present in hypertext. Google is designed to crawl and index the Web efficiently and produce much more satisfying search results than existing systems. The prototype with a full text and hyperlink database of at least 24 million pages is available at http://google.stanford.edu/ To engineer a search engine is a challenging task. Search engines index tens to hundreds of millions of web pages involving a comparable number of distinct terms. They answer tens of millions of queries every day. Despite the importance of large-scale search engines on the web, very little academic research has been done on them. Furthermore, due to rapid advance in technology and web proliferation, creating a web search engine today is very different from three years ago. This paper provides an in-depth description of our large-scale web search engine -the first such detailed public description we know of to date. Apart from the problems of scaling traditional search techniques to data of this magnitude, there are new technical challenges involved with using the additional information present in hypertext to produce better search results. This paper addresses this question of how to build a practical large-scale system which can exploit the additional information present in hypertext. Also we look at the problem of how to effectively deal with uncontrolled hypertext collections where anyone can publish anything they want.

Threat , Authoritarianism , and Selective Exposure to Information <=SEP=> We examined the hypothesis that threat alters the cognitive strategies used by high authoritarians in seeking out new political information from the environment. In a laboratory experiment, threat was manipulated through a “mortality salience” manipulation used in research on terror management theory (Pyszczynski, Solomon, & Greenberg, 2003). Subjects (N = 92) were then invited to read one of three editorial articles on the topic of capital punishment. We found that in the absence of threat, both low and high authoritarians were responsive to salient norms of evenhandedness in information selection, preferring exposure to a two-sided article that presents the merits of both sides of an issue to an article that selectively touts the benefits of the pro or con side of the issue. However, in the presence of threat, high but not low authoritarians became significantly more interested in exposure to an article containing uniformly pro-attitudinal arguments, and significantly less interested in a balanced, two-sided article. Finally, a path analysis indicated that selective exposure to attitude-congruent information led to more internally consistent policy attitudes and inhibited attitude change. Discussion focuses on the role of threat in conditioning the cognitive and attitudinal effects of authoritarianism.

Structural Architectures for a Deployable Wideband UHF Antenna <=SEP=> This paper explores concepts for a wideband deployable antenna suitable for small satellites. The general approach taken was to closely couple antenna theory and structural mechanics, to produce a deployable antenna that is considered efficient in both fields. Approaches that can be deployed using stored elastic strain energy have been favored over those that require powered actuators or environmental effects to enforce deployment. Two types of concepts were developed: thin shell structure and pantograph. These concepts cover four antenna topologies: crossed log periodic, conical log spiral, helical and quadrifilar helix. Of these, the conical log spiral antenna and the accompanying deployment concepts are determined to be the most promising approaches that warrant further study.

Adaptive Learning Hybrid Model for Solar Intensity Forecasting <=SEP=> Energy management is indispensable in the smart grid, which integrates more renewable energy resources, such as solar and wind. Because of the intermittent power generation from these resources, precise power forecasting has become crucial to achieve efficient energy management. In this paper, we propose a novel adaptive learning hybrid model (ALHM) for precise solar intensity forecasting based on meteorological data. We first present a time-varying multiple linear model (TMLM) to capture the linear and dynamic property of the data. We then construct simultaneous confidence bands for variable selection. Next, we apply the genetic algorithm back propagation neural network (GABP) to learn the nonlinear relationships in the data. We further propose ALHM by integrating TMLM, GABP, and the adaptive learning online hybrid algorithm. The proposed ALHM captures the linear, temporal, and nonlinear relationships in the data, and keeps improving the predicting performance adaptively online as more data are collected. Simulation results show that ALHM outperforms several benchmarks in both short-term and long-term solar intensity forecasting.

A Survey and Typology of Human Computation Games <=SEP=> Human computation games (HCGs) can be seen as a paradigm that makes use of human brain power to solve computational problems as a byproduct of game play. In recent years, HCGs are increasing in popularity within various application areas which aim to harvest human problem solving skills by seamlessly integrating computational tasks into games. Thus, a proper system of describing such games is necessary in order to obtain a better understanding of the current body of work and identify new opportunities for future research directions. As a starting point, in this paper, we review existing literature on HCGs and present a typology consisting of 12 dimensions based on the key features of HCGs. With this typology, all HCGs could be classified and compared in a systematic manner.

Gossip along the way : Order-Optimal Consensus through Randomized Path Averaging <=SEP=> Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust algorithms for distributed information processing over networks. However for many topologies that are realistic for wireless ad-hoc and sensor networks (like grids and random geometric graphs), the standard nearest-neighbor gossip converges very slowly. A recently proposed algorithm called geographic gossip improves gossip efficiency by a p n/ log n factor for random geometric graphs, by exploiting geographic information of node locations. In this paper we prove that a variation of geographic gossip that averages along routed paths, improves efficiency by an additional p n/ log n factor and is order optimal for grids and random geometric graphs. Our analysis provides some general techniques and can be used to provide bounds on the performance of randomized message passing algorithms operating over various graph topologies.

Evaluation of games for teaching computer science <=SEP=> Well-designed educational games (both online and offline) can be a valuable way to engage students with a topic. However, games can also be a time-consuming distraction, so it is useful to be able to identify which are suitable. This paper provides guidelines for evaluating games, and applies them to identify promising games. We begin by defining what is meant by a game, ruling out simple animations or quizzes, and focusing on a more playful approach to education. Based on this definition, we have identified games that are available for teaching topics in computer science, and classified them. We have developed criteria for evaluating games based on existing research on educational games, combined with educational theory and considering them in the context of CS. The criteria developed cover the topics taught, how easy it is to install and run, how engaging the game is, and how much time students might invest to use the game. We find that although there are a number of worth-while games in the field of CS and most are free, the coverage of topics is very patchy, with most focused on programming concepts and binary numbers.

Detecting and Tracking The Real-time Hot Topics: A Study on Computational Neuroscience <=SEP=> In this study, following the idea of our previous paper (Wang, et al., 2013a), we improve the method to detect and track hot topics in a specific field by using the real-time article usage data. With the “usage count” data provided by Web of Science, we take the field of computational neuroscience as an example to make analysis. About 10 thousand articles in the field of Computational Neuroscience are queried in Web of Science, when the records, including the usage count data of each paper, have been harvested and updated weekly from October 19, 2015 to March 21, 2016. The hot topics are defined by the most frequently used keywords aggregated from the articles. The analysis reveals that hot topics in Computational Neuroscience are related to the key technologies, like “fmri”, “eeg”, “erp”, etc. Furthermore, using the weekly updated data, we track the dynamical changes of the topics. The characteristic of immediacy of usage data makes it possible to track the “heat” of hot topics timely and dynamically.

A probabilistic rating inference framework for mining user preferences from reviews <=SEP=> We propose a novel Probabilistic Rating infErence Framework, known as Pref, for mining user preferences from reviews and then mapping such preferences onto numerical rating scales. Pref applies existing linguistic processing techniques to extract opinion words and product features from reviews. It then estimates the sentimental orientations (SO) and strength of the opinion words using our proposed relative-frequency-based method. This method allows semantically similar words to have different SO, thereby addresses a major limitation of existing methods. Pref takes the intuitive relationships between class labels, which are scalar ratings, into consideration when assigning ratings to reviews. Empirical results validated the effectiveness of Pref against several related algorithms, and suggest that Pref can produce reasonably good results using a small training corpus. We also describe a useful application of Pref as a rating inference framework. Rating inference transforms user preferences described as natural language texts into numerical rating scales. This allows Collaborative Filtering (CF) algorithms, which operate mostly on databases of scalar ratings, to utilize textual reviews as an additional source of user preferences. We integrated Pref with a classical CF algorithm, and empirically demonstrated the advantages of using rating inference to augment ratings for CF.

Building Information Modeling and real world knowledge: A methodological approach to accurate semantic documentation for the built environment <=SEP=> Building Information Modeling is considered by the scientific literature as an emerging trend in the architectural documentation scenario, as it is basically a digital representation of physical and functional features of facilities, serving as a shared knowledge resource during their whole life cycle. BIM is actually a process (not a software, as someone indicated), in which different players act sharing data through digital models in a coordinated, consistent and always up to date workflow, in order to reach reliability and higher quality all over the construction process. This way BIM tools were originally meant to ease the design of new architectures, generated by parametric geometries connected through hierarchical relationships of “smart objects” (components self-aware of their identity and conscious of their interactions with each other). However, this approach can also be successfully applied to what already exists: TLS (Terrestrial Laser Scanning) or digital photogrammetry are supposed to be the first abstraction step in a methodology proposal intended as a scientific strategy in which BIM, relying on its own semantic splitting attitude and its topological structure, is explicitly used in representation of existing buildings belonging to the Cultural Heritage. Presenting some progresses in the development of a specific free Autodesk Revit plug-in, nicknamed GreenSpider after its capability to layout points in the digital domain as if they were nodes of an ideal cobweb, this paper examines how point clouds collected during high definition surveys can be processed with accuracy in a BIM environment, highlighting critical aspects and advantages deriving from the application of parametric techniques to the real world domain representation.

Graph Convolutional Networks With Argument-Aware Pooling for Event Detection <=SEP=> The current neural network models for event detection have only considered the sequential representation of sentences. Syntactic representations have not been explored in this area although they provide an effective mechanism to directly link words to their informative context for event detection in the sentences. In this work, we investigate a convolutional neural network based on dependency trees to perform event detection. We propose a novel pooling method that relies on entity mentions to aggregate the convolution vectors. The extensive experiments demonstrate the benefits of the dependencybased convolutional neural networks and the entity mentionbased pooling method for event detection. We achieve the state-of-the-art performance on widely used datasets with both perfect and predicted entity mentions.

Exploring the comparative salience of restaurant attributes: A conjoint analysis approach <=SEP=> This study explores how travelers select a restaurant for dining out, given that restaurant customers consider diverse attributes in making a selection. By applying a conjoint analysis, an exploratory multiplecase study is conducted for three restaurants in New York City. Findings from Study 1 (an overall travelers group) and Study 2 (two different country-of-residence groups: foreign and domestic travelers) show that food, value, atmosphere, and service are considered as substantially important criteria in selecting restaurants, in that order. However, results from Study 3 examining different restaurant types (lowpriced food stand, low-priced indoor, and high-priced indoor) reveal that the food attribute is the most important factor, regardless of restaurant types, whereas the other attributes’ rankings vary. Results from ypes of restaurants and travelers

Integrality and Separability of Input Devices <=SEP=> Current input device taxonomies and other frameworks typically emphasize the mechanical structure of input devices. We suggest that selecting an appropriate input device for an interactive task requires looking beyond the physical structure of devices to the deeper perceptual structure of the task, the device, and the interrelationship between the perceptual structure of the task and the control properties of the device. We affirm that perception is key to understanding performance of multidimensional input devices on multidimensional tasks. We have therefore extended the theory of processing of percetual structure to graphical interactive tasks and to the control structure of input devices. This allows us to predict task and device combinations that lead to better performance and hypothesize that performance is improved when the perceptual structure of the task matches the control structure of the device. We conducted an experiment in which subjects performed two tasks with different perceptual structures, using two input devices with correspondingly different control structures, a three-dimensional tracker and a mouse. We analyzed both speed and accuracy, as well as the trajectories generated by subjects as they used the unconstrained three-dimensional tracker to perform each task. The result support our hypothesis and confirm the importance of matching the perceptual structure of the task and the control structure of the input device.

Ocular symptom detection using smartphones <=SEP=> It is often said that "the eyes are the windows to the soul". Although this usually metaphorically refers to a person's emotional state, there is literal truth in this statement with reference to a person's biological state. The eyes are dynamic and sensitive organs that are connected to the rest of the body via the circulatory and nervous systems. This means that diseases originating from an organ within the body can indirectly affect the eyes. Although the eyes may not be the origin for many such diseases, they are visible to external observers, making them an accessible point of diagnosis. For instance, broken blood vessels in the sclera could indicate a blood clotting disorder or a vitamin K deficiency. Instead of "windows to the soul", the eyes are "sensors to the body" that can be monitored to screen for certain diseases.

7 Toward a Universal Underspecified Semantic Representation <=SEP=> We define Canonical Form Minimal Recursion Semantics (CF-MRS) and prove that all the well-formed MRS structures generated by the MRS semantic composition algorithm are in this form. We prove that the qeq relationships are equivalent to outscoping relations when MRS structures are in this form. This result fills the gap between some underspecification formalisms and motivates defining a Canonical Form Underspecified Representation (CF-UR) which brings those underspecification formalisms together.

Routing, scheduling and channel assignment in Wireless Mesh Networks: Optimization models and algorithms <=SEP=> Wireless Mesh networks (WMNs) can partially replace the wired backbone of traditional wireless access networks and, similarly, they require to carefully plan radio resource assignment in order to provide the same quality guarantees to traffic flows. In this paper we study the radio resource assignment optimization problem in Wireless Mesh Networks assuming a time division multiple access (TDMA) scheme, a dynamic power control able to vary emitted power slot-by-slot, and a rate adaptation mechanism that sets transmission rates according to the signalto-interference-and-noise ratio (SINR). The proposed optimization framework includes routing, scheduling and channel assignment. Quality requirements of traffic demands are expressed in terms of minimum bandwidth and modeled with constraints defining the number of information units (packets) that must be delivered per frame. We consider an alternative problem formulation where decision variables represent compatible sets of links active in the same slot and channel, called configurations. We propose a two phases solution approach where a set of configurations is first selected to meet traffic requirements along the best available paths, and then configurations are assigned to channels according to device characteristics and constraints. The optimization goal is to minimize the number of used slots, which is directly related to the global resource allocation efficiency. We provide a lower bound of the optimal solution solving the continuous relaxation of problem formulation. Moreover, we propose a heuristic approach to determine practical integer solutions (upper bound). Since configuration variables are exponentially many, our solution approaches are based on the Column Generation technique. In order to assess the effectiveness of the proposed algorithms we show the numerical results obtained on a set of realistic-size randomly generated instances.

MIMO radar: an idea whose time has come <=SEP=> It has recently been shown that multiple-input multiple-output (MIMO) antenna systems have the potential to improve dramatically the performance of communication systems over single antenna systems. Unlike beamforming, which presumes a high correlation between signals either transmitted or received by an array, the MIMO concept exploits the independence between signals at the array elements. In conventional radar, target scintillations are regarded as a nuisance parameter that degrades radar performance. The novelty of MIMO radar is that it takes the opposite view; namely, it capitalizes on target scintillations to improve the radar's performance. We introduce the MIMO concept for radar. The MIMO radar system under consideration consists of a transmit array with widely-spaced elements such that each views a different aspect of the target. The array at the receiver is a conventional array used for direction finding (DF). The system performance analysis is carried out in terms of the Cramer-Rao bound of the mean-square error in estimating the target direction. It is shown that MIMO radar leads to significant performance improvement in DF accuracy.

Implementation of multiport dc-dc converter-based Solid State Transformer in smart grid system <=SEP=> A solid-state transformer (SST) would be at least as efficient as a conventional version but would provide other benefits as well, particularly as renewable power sources become more widely used. Among its more notable strong points are on-demand reactive power support for the grid, better power quality, current limiting, management of distributed storage devices and a dc bus. Most of the nation's power grid currently operates one way - power flows from the utility to the consumer - and traditional transformers simply change voltage from one level to another. But smart transformers, based on power semiconductor switches, are more versatile. Not only can they change voltage levels, but also can effectively control the power flow in both directions. The development of a Solid State Transformer (SST) that incorporates a DC-DC multiport converter to integrate both photovoltaic (PV) power generation and battery energy storage is presented in this paper. The DC-DC stage is based on a quad active-bridge (QAB) converter which not only provides isolation for the load, but also for the PV and storage. The AC-DC stage is implemented with a pulse-width-modulated (PWM) single phase rectifier. A novel technique that complements the SISO controller by taking into account the cross coupling characteristics of the QAB converter is also presented herein. Cascaded SISO controllers are designed for the AC-DC stage. The QAB demanded power is calculated at the QAB controls and then fed into the rectifier controls in order to minimize the effect of the interaction between the two SST stages. The dynamic performance of the designed control loops based on the proposed control strategies are verified through extensive simulation of the SST average and switching models.

Compact Printed Wide-Slot UWB Antenna With 3.5/5.5-GHz Dual Band-Notched Characteristics <=SEP=> A novel compact wide-slot ultrawideband (UWB) antenna with dual band-notched characteristics is presented. The antenna consists of an inverted U-shaped slot on the ground plane and a radiation patch similar to the slot that is fed by a 50-Ω microstrip line. By etching a C-shaped slot on the radiation patch and extruding an L-shaped stub from the ground plane, dual band-notched properties in the WiMAX (3.4-3.69 GHz) and WLAN (5.15-5.825 GHz) are achieved. The proposed antenna has a compact size of 20×27 mm2 and operates from 2.89 to 11.52 GHz. Furthermore, nearly omnidirectional radiation patterns and constant gain are obtained in the working band.

Connecting and separating mind-sets: culture as situated cognition. <=SEP=> UNLABELLED
People perceive meaningful wholes and later separate out constituent parts (D. Navon, 1977). Yet there are cross-national differences in whether a focal target or integrated whole is first perceived. Rather than construe these differences as fixed, the proposed culture-as-situated-cognition model explains these differences as due to whether a collective or individual mind-set is cued at the moment of observation. Eight studies demonstrated that when cultural mind-set and task demands are congruent, easier tasks are accomplished more quickly and more difficult or time-constrained tasks are accomplished more accurately (


STUDY 1
Koreans, Korean Americans; STUDY 2: Hong Kong Chinese; STUDY 3: European- and Asian-heritage Americans; STUDY 4: Americans;


STUDY
5 Hong Kong Chinese; STUDY 6: Americans; STUDY 7: Norwegians; STUDY 8: African-, European-, and Asian-heritage Americans). Meta-analyses (d = .34) demonstrated homogeneous effects across geographic place (East-West), racial-ethnic group, task, and sensory mode-differences are cued in the moment. Contrast and separation are salient individual mind-set procedures, resulting in focus on a single target or main point. Assimilation and connection are salient collective mind-set procedures, resulting in focus on multiplicity and integration.

Cooperative Localization for Autonomous Underwater Vehicles <=SEP=> Self-localization of an underwater vehicle is particularly challenging due to the absence of Global Positioning System (GPS) reception or features at known positions that could otherwise have been used for position computation. Thus Autonomous Underwater Vehicle (AUV) applications typically require the pre-deployment of a set of beacons. This thesis examines the scenario in which the members of a group of AUVs exchange navigation information with one another so as to improve their individual position estimates. We describe how the underwater environment poses unique challenges to vehicle navigation not encountered in other environments in which robots operate and how cooperation can improve the performance of self-localization. As intra-vehicle communication is crucial to cooperation, we also address the constraints of the communication channel and the effect that these constraints have on the design of cooperation strategies. The classical approaches to underwater self-localization of a single vehicle, as well as more recently developed techniques are presented. We then examine how methods used for cooperating land-vehicles can be transferred to the underwater domain. An algorithm for distributed self-localization, which is designed to take the specific characteristics of the environment into account, is proposed. We also address how correlated position estimates of cooperating vehicles can lead to overconfidence in individual position estimates. Finally, key to any successful cooperative navigation strategy is the incorporation of the relative positioning between vehicles. The performance of localization algorithms with different geometries is analyzed and a distributed algorithm for the dynamic positioning of vehicles, which serve as dedicated navigation beacons for a fleet of AUVs, is proposed. Thesis Supervisor: John J. Leonard Title: Professor of Mechanical and Ocean Engineering Massachusetts Institute of Technology Acknowledgments This thesis would not have been possible without the help and support of many friends and colleagues who made the last five years at MIT an exceptionally fulfilling experience. I would like to thank my advisor John Leonard who strongly supported me ever since our first email exchange in 2003. He guided me all the way through the application process, research, thesis and finding a post doc position. His broad range of research interests enabled me to find a thesis subject that exactly matched my interest. And I very much appreciated him allowing me to take a significant amount of time to pursue other projects as well as travel. I would also like to thank my other committee members: Henrik Schmidt for his continued support and great company during several research cruises, and Hanu Singh and Arjuna Balasuriya for their helpful suggestions during my thesis writing. Many thanks to David Battle who helped me through my first steps with Autonomous Underwater Vehicles and was a great mate to have around. Many of the experiments presented in this thesis would not have been possible without the support of Andrew Patrikalakis. The results owe a lot to his countless hours of coding assistance and his efforts to ensure that the kayaks would be ready when needed. They were also made possible by Joe Curcio, the builder of the kayaks, and the support of Jacques Leedekerken and Kevin Cockrell. The last years would not have been the same without the many great people I met at MIT. Most important was Matt Walter who convinced me in August 2003 that MIT is not only an interesting place, but that it can be very friendly as well. Throughout the years we shared many great personal and academic experiences. I wish him all the best, wherever life may take him. Patrycja unfortunately left our lab, but made up for it by taking me on a very memorable trip across the country. I wish Alec, Emma, Albert, Tom, Olivier and Aisha all the best for their remaining time and life beyond. Iuliu was always a welcome distraction in the United States and abroad and a great help with all hardware questions. I was glad to join Carrick, Marty and David on a number of exciting research and conference trips, as well as their advisor Daniela Rus. In the last months I was also very fortunate to meet a new group of people. First, I am very thankful to Maurice for carrying on what I started I cannot imagine somebody better suited for it and also Been, Georgios, Hordur and Rob. I would also like to thank the many people of the SEA 2007 cruise, particularly the B watch and Julian, Jamie, Heather, Chris, Toby and Jane. One of the most exciting things during my time at MIT was that I was not only able to pursue my thesis topic but also two other projects. First, the flood warning project introduced me to Elizabeth Basha. We shared many joyful moments as well as blood, sweat and tears in the Central American wilderness. I hope that the end of my PhD only marks the beginning of that partnership. Second, the harbor porpoise tag project led by Stacy DeRuiter was a great design challenge. It also provided an opportunity to reach into other areas of ocean sciences by contributing to marine biology research. Her dedication along with the support from Mark Johnson, Peter Tyack and Tom Hurst ensured the project’s success. The exciting results and the process leading up to them rewarded me with a better experience at MIT than I could have ever hoped for. I would like to thank John Leonard for letting me take this scenic route. The path that led me to MIT would not have been possible without the support from people in the early stages of my engineering career who I would like to thank here: Raimund Eich for patiently answering my first electrical engineering questions; my best friends Jan Horn, Daniel Steffensky, Alexander Zimmer and Ulf Radenz for helping me through my university time in Germany; and John Peatman, Ludger Becks and Uwe Zimmer for their academic guidance. Finally, I would like to thank my parents for their continued support and especially Melissa Pitotti for her encouragement not only to start the work at this institution but also to finish it when the time had come. This work was funded by Office of Naval Research grants N00014-97-1-0202, N00014-05-1-0255, N00014-02-C-0210, N00014-07-1-1102 and the ASAP MURI program led by Naomi Leonard of Princeton University. “One degree is not a large distance. On a compass it is scarcely the thickness of a fingernail. But in certain conditions, one degree can be a very large distance. Enough to unmake a man.” The Mysterious Geographic Explorations of Jasper Morello, c © 3D Films, Australia 2005 Meinen Eltern & meinem Bruder

Multiview Image Completion with Space Structure Propagation <=SEP=> We present a multiview image completion method that provides geometric consistency among different views by propagating space structures. Since a user specifies the region to be completed in one of multiview photographs casually taken in a scene, the proposed method enables us to complete the set of photographs with geometric consistency by creating or removing structures on the specified region. The proposed method incorporates photographs to estimate dense depth maps. We initially complete color as well as depth from a view, and then facilitate two stages of structure propagation and structure-guided completion. Structure propagation optimizes space topology in the scene across photographs, while structure-guide completion enhances, and completes local image structure of both depth and color in multiple photographs with structural coherence by searching nearest neighbor fields in relevant views. We demonstrate the effectiveness of the proposed method in completing multiview images.

Effectiveness and Adoption of a Drawing-to-Learn Study Tool for Recall and Problem Solving: Minute Sketches with Folded Lists <=SEP=> Drawing by learners can be an effective way to develop memory and generate visual models for higher-order skills in biology, but students are often reluctant to adopt drawing as a study method. We designed a nonclassroom intervention that instructed introductory biology college students in a drawing method, minute sketches in folded lists (MSFL), and allowed them to self-assess their recall and problem solving, first in a simple recall task involving non-European alphabets and later using unfamiliar biology content. In two preliminary ex situ experiments, students had greater recall on the simple learning task, non-European alphabets with associated phonetic sounds, using MSFL in comparison with a preferred method, visual review (VR). In the intervention, students studying using MSFL and VR had ∼50-80% greater recall of content studied with MSFL and, in a subset of trials, better performance on problem-solving tasks on biology content. Eight months after beginning the intervention, participants had shifted self-reported use of drawing from 2% to 20% of study time. For a small subset of participants, MSFL had become a preferred study method, and 70% of participants reported continued use of MSFL. This brief, low-cost intervention resulted in enduring changes in study behavior.

A Temporal Sequence Learning for Action Recognition and Prediction <=SEP=> In this work1, we present a method to represent a video with a sequence of words, and learn the temporal sequencing of such words as the key information for predicting and recognizing human actions. We leverage core concepts from the Natural Language Processing (NLP) literature used in sentence classification to solve the problems of action prediction and action recognition. Each frame is converted into a word that is represented as a vector using the Bag of Visual Words (BoW) encoding method. The words are then combined into a sentence to represent the video, as a sentence. The sequence of words in different actions are learned with a simple but effective Temporal Convolutional Neural Network (T-CNN) that captures the temporal sequencing of information in a video sentence. We demonstrate that a key characteristic of the proposed method is its low-latency, i.e. its ability to predict an action accurately with a partial sequence (sentence). Experiments on two datasets, UCF101 and HMDB51 show that the method on average reaches 95% of its accuracy within half the video frames. Results, also demonstrate that our method achieves compatible state-of-the-art performance in action recognition (i.e. at the completion of the sentence) in addition to action prediction.

Deep Memory Networks for Attitude Identification <=SEP=> We consider the task of identifying attitudes towards a given set of entities from text. Conventionally, this task is decomposed into two separate subtasks: target detection that identifies whether each entity is mentioned in the text, either explicitly or implicitly, and polarity classification that classifies the exact sentiment towards an identified entity (the target) into positive, negative, or neutral.
 Instead, we show that attitude identification can be solved with an end-to-end machine learning architecture, in which the two subtasks are interleaved by a deep memory network. In this way, signals produced in target detection provide clues for polarity classification, and reversely, the predicted polarity provides feedback to the identification of targets. Moreover, the treatments for the set of targets also influence each other -- the learned representations may share the same semantics for some targets but vary for others. The proposed deep memory network, the AttNet, outperforms methods that do not consider the interactions between the subtasks or those among the targets, including conventional machine learning methods and the state-of-the-art deep learning models.

Vulnerability of Deep Reinforcement Learning to Policy Induction Attacks <=SEP=> Deep learning classifiers are known to be inherently vulnerable to manipulation by intentionally perturbed inputs, named adversarial examples. In this work, we establish that reinforcement learning techniques based on Deep Q-Networks (DQNs) are also vulnerable to adversarial input perturbations, and verify the transferability of adversarial examples across different DQN models. Furthermore, we present a novel class of attacks based on this vulnerability that enable policy manipulation and induction in the learning process of DQNs. We propose an attack mechanism that exploits the transferability of adversarial examples to implement policy induction attacks on DQNs, and demonstrate its efficacy and impact through experimental study of a game-learning scenario.