Query: SarcasmBot : An open-source sarcasm-generation module for chatbots

Relevant passages:
Building a Large Annotated Corpus of English: The Penn Treebank <=SEP=> In this paper, we review our experience with constructing one such large annotated corpus--the Penn Treebank, a corpus consisting of over 4.5 million words of American English. During the first three-year phase of the Penn Treebank Project (1989-1992), this corpus has been annotated for part-of-speech (POS) information. In addition, over half of it has been annotated for skeletal syntactic structure. Comments University of Pennsylvania Department of Computer and Information Science Technical Report No. MSCIS-93-87. This technical report is available at ScholarlyCommons: http://repository.upenn.edu/cis_reports/237 Building A Large Annotated Corpus of English: The Penn Treebank MS-CIS-93-87 LINC LAB 260 Mitchell P. Marcus Beatrice Santorini Mary Ann Marcinkiewicz University of Pennsylvania School of Engineering and Applied Science Computer and Information Science Department Philadelphia, PA 19104-6389

GUS, A Frame-Driven Dialog System <=SEP=> GUS is the first o f a series o f experimental computer systems that we intend to construct as part o f a program of research on language understanding. In large measure, these systems will fill the role o f periodic progress reports, summarizing what we have learned, assessing the mutual coherence o f the various lines o f investigation we have been following, and saggestin# where more emphasis is needed in future work. GUS (Genial Understander System) is intended to engage a sympathetic and highly cooperative human in an English dialog, directed towards a specific goal within a very restricted domain o f discourse. As a starting point, G US was restricted to the role o f a travel agent in a conversation with a client who wants to make a simple return trip to a single city in California. There is good reason for restricting the domain o f discourse for a computer system which is to engage in an English dialog. Specializing the subject matter that the system can talk about permiis it to achieve some measure o f realism without encompassing all the possibilities o f human knowledge or o f the English language. It also provides the user with specific motivation for participating in the conversation, thus narrowing the range o f expectations that GUS must have about the user's purposes. A system restricted in this way will be more able to guide the conversation within the boundaries o f its competence. 1. Motivation and Design Issues Within its limitations, ous is able to conduct a more-or-less realistic dialog. But the outward behavior of this first system is not what makes it interesting or significant. There are, after all, much more convenient ways to plan a trip and, unlike some other artificial intelligence programs, (;us does not offer services or furnish information that are otherwise difficult or impossible to obtain. The system is i nteresting because of the phenomena of natural dialog that it attempts to model tThis work was done by the language understander project at the Xerox Palo Alto Research center. Additional affiliations: D. A. Norman, University of California, San Diego; H. Thompso6, University of California, Berkeley; and T. Winograd, Stanford University. Artificial Intelligence 8 0977), 155-173 Copyright © 1977 by North-Holland Publishing Company 156 D . G . BOBI~OW ET AL. and because of the principles of program organization around which it was de, Signed. Among the hallmarks of natural dialogs are unexpected and seemingly unpredictable sequences of events. We describe some of the forms that these can take below. "We then go on to discuss the modular design which makes the system re!atively insensitive t o the vagaries of ordinary conversation. 1.1. Problems of natural dialog The simple dialog shown in Fig. 1 illustrates some of the language-understanding problems we attacked. (The parenthesized numbers are for reference in the text). The problems illustrated in this figure, and described in the paragraphs below, include allowing both the client and the system to take the initiative, understanding indirect answers to questions, resolving anaphora, understanding fragments of sentences offered as answers to questions, and interpreting the discourse in the light of known conversational patterns. 1.1.1. Mixed initiative A typical contribution to a dialog, in addition to its more obvious functions, conveys an expectation about how the other participant will respond. This is clearest in the ease of a question, but it is true of all dialog. If one of the participants has very particular expectations and states them strongly whenever he speaks, and ff the other always responds in such a way as to meet the expectations conveyed, then the initiative remains with the first participant throughout. The success of interactive computer systems can often be traced to the skill with which their designers were able to assure them such a dominating position in the interaction. In natural conversations between humans, however, each participant usually assumes the initiative from time to time. Either clear expectations are not stated or simply not honored. GUS attempts to retain the initiative, but not to the extent of jeopardizing the natural flow of the conversation. To this extent it is a mixed-initiative system (see Carbonell [5, 6]). This is exemplified in the dialogue at (1) where the client volunteers more information than GUS requested. In addition to his destination, the client gives the date on which he wants to travel. Line (3) illustrates a ease where the client takes control of the conversation. GUS had found a potentially acceptable flight and asked for the client's approval. Instead of either giving or denying it, the client replied with a question of his own. 1.1.2. Indirect answers It is by no means always clear what constitutes an answer to a question. Frequently the purported answer is at best only a basis on which to infer the information requested. For example, when ous asks "Whatt ime do you want to leave?" it is seeking information to constrain the selection of a flight, client's res onse t o • • P " . this question, a t (2), does constrain the flight selection, b u t only indirectly. In Artificial Intelligence8 (1977), 155--17a : -

Fast Robust Logistic Regression for Large Sparse Datasets with Binary Outputs <=SEP=> Although popular and extremely well established in mainstream statistical data analysis, logistic regression is strangely absent in the field of data mining. There are two possible explanations of this phenomenon. First, there might be an assumption that any tool which can only produce linear classification boundaries is likely to be trumped by more modern nonlinear tools. Second, there is a legitimate fear that logistic regression cannot practically scale up to the massive dataset sizes to which modern data mining tools are This paper consists of an empirical examination of the first assumption, and surveys, implements and compares techniques by which logistic regression can be scaled to data with millions of attributes and records. Our results, on a large life sciences dataset, indicate that logistic regression can perform surprisingly well, both statistically and computationally, when compared with an array of more recent classification algorithms.

TnT -- A Statistical Part-of-Speech Tagger <=SEP=> Trigrams'n'Tags (TnT) is an efficient statistical part-of-speech tagger. Contrary to claims found elsewhere in the literature, we argue that a tagger based on Markov models performs at least as well as other current approaches, including the Maximum Entropy framework. A recent comparison has even shown that TnT performs significantly better for the tested corpora. We describe the basic model of TnT, the techniques used for smoothing and for handling unknown words. Furthermore, we present evaluations on two corpora.

Discriminative Training Methods for Hidden Markov Models: Theory and Experiments with Perceptron Algorithms <=SEP=> We describe new algorithms for training tagging models, as an alternative to maximum-entropy models or conditional random elds (CRFs). The algorithms rely on Viterbi decoding of training examples, combined with simple additive updates. We describe theory justifying the algorithms through a modi cation of the proof of convergence of the perceptron algorithm for classi cation problems. We give experimental results on part-of-speech tagging and base noun phrase chunking, in both cases showing improvements over results for a maximum-entropy tagger.

A review of ontologies for describing scholarly and scientific documents <=SEP=> Several ontologies have been created in the last years for the semantic annotation of scholarly publications and scientific documents. This rich variety of ontologies makes it difficult for those willing to annotate their documents to know which ones they should select for such activity. This paper presents a classification and description of these state-of-the-art ontologies, together with the rationale behind the different approaches. Finally, we provide an example of how some of these ontologies can be used for the annotation of a scientific document.

Gratitude and depressive symptoms: the role of positive reframing and positive emotion. <=SEP=> Eight studies (N=2,973) tested the theory that gratitude is related to fewer depressive symptoms through positive reframing and positive emotion. Study 1 found a direct path between gratitude and depressive symptoms. Studies 2-5 demonstrated that positive reframing mediated the relationship between gratitude and depressive symptoms. Studies 6-7 showed that positive emotion mediated the relationship between gratitude and depressive symptoms. Study 8 found that positive reframing and positive emotion simultaneously mediated the relationship between gratitude and depressive symptoms. In sum, these eight studies demonstrate that gratitude is related to fewer depressive symptoms, with positive reframing and positive emotion serving as mechanisms that account for this relationship.

A hybrid SoC interconnect with dynamic TDMA-based transaction-less buses and on-chip networks <=SEP=> The two dominant architectural choices for implementing efficient communication fabrics for SoC's have been transaction-based buses and packet-based networks-on-chip (NoC). Both implementations have some inherent disadvantages - the former resulting from poor scalability and the transactional character of their operation, and the latter from inconsistent access times and deterioration of performance at high injection rates. In this paper, we propose a transaction-less, time-division-based bus architecture, which dynamically allocates timeslots on-the-fly - the dTDMA bus. This architecture addresses the contention issues of current bus architectures, while avoiding the multi-hop overhead of NoC's. It is compared to traditional bus architectures and NoC's and shown to outperform both for configurations with fewer than 10 PE's. In order to exploit the advantages of the dTDMA bus for smaller configurations, and the scalability of NoC's, we propose a new hybrid SoC interconnect combining the two, showing significant improvement in both latency and power consumption.

Chemical structure recognition and prediction: A machine learning technique <=SEP=> A chemical structure recognition system designed to identify and predict hand-drawn chemical diagrams is presented. Although the proposed system is primarily intended to help chemists complete their chemical structure drawings and predict and complete the chemical structure, it is also envisioned to be utilized as a learning aid in chemistry education on a student's touchscreen device or on a teacher's smart board. The proposed system continuously provides the user with real-time feedback about the most relevant combinations to complete the chemical compound. A constantly updated list of prioritized candidate structures is displayed to the user. If the user is an expert, he or she will be allowed to contribute to the learning process of the proposed system. The proposed system deploys two trainable Bayesian networks, one at its input and another one at its output. Between the two networks, the classification of hand- drawn chemical structure is done using morphological image processing, LDA and PCA, incorporating therefore both image- based and feature-based techniques. This incorporation contributes considerably to the increased performance of the proposed system by enabling it to efficiently recognize messy drawings and noisy sketches like those containing over-traced strokes. Performance comparison with existing state of the art techniques proved the system to be outperforming in terms of recognition accuracy.

Information Extraction: Techniques and Challenges <=SEP=> This volume takes a broad view of information extraction as any method for ltering information from large volumes of text. This includes the retrieval of documents from collections and the tagging of particular terms in text. In this paper we shall use a narrower de nition: the identi cation of instances of a particular class of events or relationships in a natural language text, and the extraction of the relevant arguments of the event or relationship. Information extraction therefore involves the creation of a structured representation (such as a data base) of selected information drawn from the text. The idea of reducing the information in a document to a tabular structure is not new. Its feasibility for sublanguage texts was suggested by Zellig Harris in the 1950's, and an early implementation for medical texts was done at New York University by Naomi Sager[20]. However, the speci c notion of information extraction described here has received wide currency over the last decade through the series of Message Understanding Conferences [1, 2, 3, 4, 14]. We shall discuss these Conferences in more detail a bit later, and shall use simpli ed versions of extraction tasks from these Conferences as examples throughout this paper. Figure 1 shows a simpli ed example from one of the earlier MUC's, involving terrorist events (MUC-3) [1]. For each terrorist event, the system had to determine the type of attack (bombing, arson, etc.), the date, location, perpetrator (if stated), targets, and e ects on targets. Other examples of extraction tasks are international joint ventures (where the arguments included the partners, the new venture, its product or service, etc.) and executive succession (indicating who was hired or red by which company for which position). Information extraction is a more limited task than \full text understanding". In full text understanding, we aspire to represent in a explicit fashion all the information in a text. In contrast, in information extraction we delimit in advance, as part of the speci cation of the task, the semantic range of the output: the relations we will represent, and the allowable llers in each slot of a relation.

Deployable Helical Antennas for CubeSats <=SEP=> This paper explores the behavior of a self-deploying helical pantograph antenna for CubeSats. The helical pantograph concept is described along with concepts for attachment to the satellite bus. Finite element folding simulations of a pantograph consisting of eight helices are presented and compared to compaction force experiments done on a prototype antenna. Reflection coefficient tests are also presented, demonstrating the operating frequency range of the prototype antenna. The helical pantograph is shown to be a promising alternative to current small satellite antenna solutions.

Knowledge Extraction from Structured Engineering Drawings <=SEP=> As a typical type of structured documents, table drawings are widely used in engineering fields. Knowledge extraction of such structured documents plays an important role in automatic interpretation systems. In this paper, we propose a new knowledge extraction method based on automatically analyzing drawing layout and extracting physical or logical structures from the given engineering table drawings. Then based on the automatic interpretation results, we further propose normalization method to integrate varied types of engineering tables with other engineering drawings and extract implied domain knowledge.

Mapping distributed brain function and networks with diffuse optical tomography. <=SEP=> Mapping of human brain function has revolutionized systems neuroscience. However, traditional functional neuroimaging by positron emission tomography or functional magnetic resonance imaging cannot be used when applications require portability, or are contraindicated because of ionizing radiation (positron emission tomography) or implanted metal (functional magnetic resonance imaging). Optical neuroimaging offers a non-invasive alternative that is radiation free and compatible with implanted metal and electronic devices (for example, pacemakers). However, optical imaging technology has heretofore lacked the combination of spatial resolution and wide field of view sufficient to map distributed brain functions. Here, we present a high-density diffuse optical tomography imaging array that can map higher-order, distributed brain function. The system was tested by imaging four hierarchical language tasks and multiple resting-state networks including the dorsal attention and default mode networks. Finally, we imaged brain function in patients with Parkinson's disease and implanted deep brain stimulators that preclude functional magnetic resonance imaging.

Public Goods and Ethnic Divisions <=SEP=> We present a model that links heterogeneity of preferences across ethnic groups in a city to the amount and type of public good the city supplies. We test the implications of the model with three related data sets: U. S. cities, U. S. metropolitan areas, and U. S. urban counties. Results show that the shares of spending on productive public goods -education, roads, sewers and trash pickup -in U. S. cities (metro areas/urban counties) are inversely related to the city’s (metro area’s/county’s) ethnic fragmentation, even after controlling for other socioeconomic and demographic determinants. We conclude that ethnic conflict is an important determinant of local public finances.

Guided Image Filtering <=SEP=> In this paper, we propose a novel explicit image filter called guided filter. Derived from a local linear model, the guided filter computes the filtering output by considering the content of a guidance image, which can be the input image itself or another different image. The guided filter can be used as an edge-preserving smoothing operator like the popular bilateral filter [1], but it has better behaviors near edges. The guided filter is also a more generic concept beyond smoothing: It can transfer the structures of the guidance image to the filtering output, enabling new filtering applications like dehazing and guided feathering. Moreover, the guided filter naturally has a fast and nonapproximate linear time algorithm, regardless of the kernel size and the intensity range. Currently, it is one of the fastest edge-preserving filters. Experiments show that the guided filter is both effective and efficient in a great variety of computer vision and computer graphics applications, including edge-aware smoothing, detail enhancement, HDR compression, image matting/feathering, dehazing, joint upsampling, etc.

Self-organization patterns in wasp and open source communities <=SEP=> In this paper, we conducted a comparative study of how social organization takes place in a wasp colony and OSS developer communities. Both these systems display similar global organization patterns, such as hierarchies and clear labor divisions. As our analysis shows, both systems also define interacting agent networks with similar common features that reflect limited information sharing among agents. As far as we know, this is the first research study analyzing the patterns and functional significance of these systems' weighted-interaction networks. By illuminating the extent to which self-organization is responsible for patterns such as hierarchical structure, we can gain insight into the origins of organization in OSS communities.

Representing Attitude : Euler Angles , Unit Quaternions , and Rotation Vectors <=SEP=> We present the three main mathematical constructs used to represent the attitude of a rigid body in threedimensional space. These are (1) the rotation matrix, (2) a triple of Euler angles, and (3) the unit quaternion. To these we add a fourth, the rotation vector, which has many of the benefits of both Euler angles and quaternions, but neither the singularities of the former, nor the quadratic constraint of the latter. There are several other subsidiary representations, such as Cayley-Klein parameters and the axis-angle representation, whose relations to the three main representations are also described. Our exposition is catered to those who seek a thorough and unified reference on the whole subject; detailed derivations of some results are not presented. Keywords–Euler angles, quaternion, Euler-Rodrigues parameters, Cayley-Klein parameters, rotation matrix, direction cosine matrix, transformation matrix, Cardan angles, Tait-Bryan angles, nautical angles, rotation vector, orientation, attitude, roll, pitch, yaw, bank, heading, spin, nutation, precession, Slerp

Enhanced belief propagation decoding of polar codes through concatenation <=SEP=> The bit-channels of finite-length polar codes are not fully polarized, and a proportion of such bit-channels are neither completely “noiseless” nor completely “noisy”. By using an outer low-density parity-check code for these intermediate channels, we show how the performance of belief propagation (BP) decoding of the overall concatenated polar code can be improved. A simple example reports an improvement in Eb /N0 of 0.3 dB with respect to the conventional BP decoder.

Evaluation is a Dynamic Process : Moving Beyond Dual System Models <=SEP=> Over the past few decades, dual attitude ⁄ process ⁄ system models have emerged as the dominant framework for understanding a wide range of psychological phenomena. Most of these models characterize the unconscious and conscious mind as being built from discrete processes or systems: one that is reflexive, automatic, fast, affective, associative, and primitive, and a second that is deliberative, controlled, slow, cognitive, propositional, and more uniquely human. Although these models serve as a useful heuristic for characterizing the human mind, recent developments in social and cognitive neuroscience suggest that the human evaluative system, like most of cognition, is widely distributed and highly dynamic. Integrating these advances with current attitude theories, we review how the recently proposed Iterative Reprocessing Model can account for apparent dual systems as well as discrepancies between traditional dual system models and recent research revealing the dynamic nature of evaluation. Furthermore, we describe important implications this dynamical system approach has for various social psychological domains. For nearly a century, psychologists have sought to understand the unconscious and conscious processes that allow people to evaluate their surroundings (Allport, 1935; Freud, 1930). Building on a model of the human mind rooted in classic Greek philosophy (Annas, 2001), many contemporary psychologists have characterized the mind as possessing discrete processes or systems: one that is evolutionarily older, reflexive, automatic, fast, affective, associative, and the other that is more uniquely human, deliberative, controlled, slow, cognitive, and propositional (see Figure 1). These dual process or system models have been highly influential throughout psychology for the past three decades (Chaiken & Trope, 1999). Indeed, a dual system model of the human mind permeates research in a wide range of psychological domains, such as attitudes and persuasion (Chaiken, 1980; Fazio, 1990; Gawronski & Bodenhausen, 2006; Petty & Cacioppo, 1986; Rydell & McConnell, 2006; Wilson, Samuel, & Schooler, 2000), stereotypes and prejudice (Crandall & Eshleman, 2003; Devine, 1989; Gaertner & Dovidio, 1986; Pettigrew & Meertens, 1995), person perception (Brewer, 1988; Fiske & Neuberg, 1990; Macrae & Bodenhausen, 2000), self-regulation (Baumeister & Heatherton, 1996; Freud, 1930; Hofmann, Friese, & Strack, 2009; Strack & Deutsch, 2004), moral cognition (Greene, Sommerville, Nystrom, Darley, & Cohen, 2001; Haidt, 2001), learning and memory (Smith & DeCoster, 2000; Sun, 2002), and decision-making (Kahneman, 2003; Sloman, 1996). Although dual system models provide generative frameworks for understanding a wide range of psychological phenomenon, recent developments in social and affective neuroscience suggest that the human evaluative system, like most of cognition, is widely distributed and highly dynamic (e.g., Ferguson & Wojnowicz, 2011; Freeman & Ambady, Social and Personality Psychology Compass 6/6 (2012): 438–454, 10.1111/j.1751-9004.2012.00438.x a 2012 Blackwell Publishing Ltd 2011; Scherer, 2009). Integrating these advances with current attitude theories, we review how the recently proposed Iterative Reprocessing Model (Cunningham & Zelazo, 2007; Cunningham, Zelazo, Packer, & Van Bavel, 2007) can account for apparent dual systems as well as discrepancies between traditional dual system models and recent research revealing the dynamic nature of evaluation. The model also address why the nature of evaluative processing differs across people (e.g., Cunningham, Raye, & Johnson, 2005; Park, Van Bavel, Vasey, & Thayer, forthcoming). Although we focus primarily on dual models of attitudes and evaluation due to space constraints, we believe the premises of our dynamic model can be generalized to other domains where dual system models of typically invoked (Chaiken & Trope, 1999), including social cognition, self-regulation, prejudice and stereotyping, and moral cognition. Therefore, we very briefly discuss the implications of our model for these other domains in the final section of this paper and encourage interested readers to read our more extensive treatment of these issues in the domain of stereotypes and prejudice (Cunningham & Van Bavel, 2009a; Van Bavel & Cunningham, 2011) and emotion (Cunningham & Van Bavel, 2009b; Kirkland & Cunningham, 2011, forthcoming). Attitudes and evaluation Attitudes are one of the most central constructs in social psychology, yet there has been considerable debate regarding the most fundamental aspects of attitudes (Fazio, 2007; Schwarz & Bohner, 2001). Allport (1935) defined an attitude as ‘‘a mental and neural state of readiness, organized through experience, exerting a directive or dynamic influence upon the individual’s response to all objects and situations with which it is related’’ (p. 810). Throughout the history of attitude research, theorists and researchers have attempted to provide a complete yet parsimonious definition of this construct. Wellknown examples include the one-component perspective (Thurstone, 1928), the tripartite model (Affective, Behavior, Cognition; Katz & Stotland, 1959; Rosenberg & Hovland, 1960), and more recently, a host of dual attitudes (e.g., Greenwald & Banaji, 1995; Rydell & McConnell, 2006; Wilson et al., 2000) and dual process models (e.g., Chaiken, 1980; Fazio, 1990; Gawronski & Bodenhausen, 2006; Petty & Cacioppo, 1986). It is widely assumed that attitudes are stored associations between objects and their evaluations, which can be accessed from memory very quickly with little conscious effort Figure 1 Illustrative example of the process and content of a dual system model (cited in Kahneman, 2003, p. 698). Evaluation is a Dynamic Process 439 a 2012 Blackwell Publishing Ltd Social and Personality Psychology Compass 6/6 (2012): 438–454, 10.1111/j.1751-9004.2012.00438.x (Fazio, 2001; Fazio, Sanbonmatsu, Powell, & Kardes, 1986; but see Schwarz, 2007). For example, people categorize positive and negative words more quickly when these words are preceded by a similarly valenced stimuli, suggesting that attitudes are automatically activated by the mere presence of the attitude object in the environment (Fazio et al., 1986). Moreover, people may have access to evaluative information about stimuli prior to their semantic content (Bargh, Litt, Pratto, & Spielman, 1989; but see Storbeck & Clore, 2007). Such research has led to the conclusion that the initial evaluative classification of stimuli as good or bad can be activated automatically and guide the perceiver’s interpretation of his or her environment (Houston & Fazio, 1989; Smith, Fazio, & Cejka, 1996). Dual attitudes and dual process models of attitudes The recent development of a wide variety of implicit attitude measures (Petty, Fazio, & Briñol, 2009; Wittenbrink & Schwarz, 2007), including measures of human physiology (Cunningham, Packer, Kesek, & Van Bavel, 2009), has fueled an explosion of research on dual attitude ⁄process ⁄ system models of attitudes and evaluations (see Table 1). Most of these models infer dual process architecture from observable dissociations between implicit and explicit measures of behavior (e.g., Dovidio, Kawakami, & Gaertner, 2002; McConnell & Leibold, 2001; Rydell & McConnell, 2006). Although many dual models generally share a common set of assumptions about the human mind, the specific features of each model differ. Therefore, we propose a rough taxonomy to characterize different classes of these models. ‘‘Dual attitudes models’’ tend to dichotomize the representations of attitudes into distinct automatic versus controlled constructs (Greenwald & Banaji, 1995; Rydell & McConnell, 2006; Wilson et al., 2000). In contrast, ‘‘dual process models’’ tend to dichotomize the processing of attitudinal representations into automatic versus controlled processes. There is considerable debate over whether these two types of processes are independent or communicate with one another (i.e., information from one system is available to the other system) (Fazio, 1990; Gawronski & Bodenhausen, 2006; Gilbert, Pelham, & Krull, 1988; Petty, Brinol, & DeMarree, 2007). In the latter case, interdependent dual process models have generally been proposed to operate in a corrective fashion, such that ‘‘controlled’’ processes can influence otherwise ‘‘automatic’’ responses (e.g., Wegener & Petty, 1997). Although dual attitudes models likely require dual processes to integrate different attitudinal representations into evaluations and behaviors, dual process models are less likely to require the assumption of dual attitude representations (e.g., Fazio, 1990). For the purpose of clarity, we use ‘‘dual system models’’ to capture models that assume dual attitudes and processes that do not interact (e.g., Rydell & McConnell, 2006; Wilson et al., 2000). There are, of course, many ways to hook up a dual system (see Gilbert, 1999 for a discussion). A complete discussion of all possible dual models and interconnections between these systems is beyond the scope of this article. Therefore, we focus on several core premises that many models have in common. Likewise, we focus on the core premises from our own model – rather than an exhaustive discussion (e.g., Cunningham et al., 2007) – in order to communicate key similarities and differences between dual models and our proposed dynamic model. Furthermore, we recognize that dual models and our proposed dynamic model do not exhaust all types of models of attitudes and evaluation – some extant models do include more than two processes (e.g., Beer, Knight, & D’Esposito, 2006; Conrey, Sherman, Gawronski, Hugenberg, & Groom, 2005) and many allow for interactive processes that operate in a post hoc, corrective fashion (e.g., Chen & Chaiken, 1999; Gawronski & 440 Evaluation is a Dynamic Process a 2012 Blackwell Publishing Ltd Social and Personality Psychology Compass 6/6 (2012):

Clues for detecting irony in user-generated contents: oh...!! it's "so easy" ;-) <=SEP=> We investigate the accuracy of a set of surface patterns in identifying ironic sentences in comments submitted by users to an on-line newspaper. The initial focus is on identifying irony in sentences containing positive predicates since these sentences are more exposed to irony, making their true polarity harder to recognize. We show that it is possible to find ironic sentences with relatively high precision (from 45% to 85%) by exploring certain oral or gestural clues in user comments, such as emoticons, onomatopoeic expressions for laughter, heavy punctuation marks, quotation marks and positive interjections. We also demonstrate that clues based on deeper linguistic information are relatively inefficient in capturing irony in user-generated content, which points to the need for exploring additional types of oral clues.

Novel compact spider microstrip antenna with new Defected Ground Structure <=SEP=> Two novel Defected Ground Structures (DGS) were first proposed, which have better results than that of the dumbbell (published shape). Using the general model of DGS, its equivalent parameters were extracted. The two new proposed shapes of DGS were then used to design a novel compact spider microstrip antenna to minimize its area. The size of the developed antenna was reduced to about 90.5% of that of the conventional one. This antenna with two different novel shapes of DGS was designed and simulated by using the ready-made software package Zeland-IE3D. Finally, it was fabricated by using thin film and photolithographic technique and measured by using vector network analyzer. Good agreements were found between the simulated and measured results.

Fraud Detection From Taxis' Driving Behaviors <=SEP=> Taxi is a major transportation in the urban area, offering great benefits and convenience to our daily life. However, one of the major business fraud in taxis is the charging fraud, specifically overcharging for the actual distance. In practice, it is hard for us to always monitor taxis and detect such fraud. Due to the Global Positioning System (GPS) embedded in taxis, we can collect the GPS reports from the taxis' locations, and thus, it is possible for us to retrieve their traces. Intuitively, we can utilize such information to construct taxis' trajectories, compute the actual service distance on the city map, and detect fraudulent behaviors. However, in practice, due to the extremely limited reports, notable location errors, complex city map, and road networks, our task to detect taxi fraud faces significant challenges, and the previous methods cannot work well. In this paper, we have a critical and interesting observation that fraudulent taxis always play a secret trick, i.e., modifying the taximeter to a smaller scale. As a result, it not only makes the service distance larger but also makes the reported taxi speed larger. Fortunately, the speed information collected from the GPS reports is accurate. Hence, we utilize the speed information to design a system, which is called the Speed-based Fraud Detection System (SFDS), to model taxi behaviors and detect taxi fraud. Our method is robust to the location errors and independent of the map information and road networks. At the same time, the experiments on real-life data sets confirm that our method has better accuracy, scalability, and more efficient computation, compared with the previous related methods. Finally, interesting findings of our work and discussions on potential issues are provided in this paper for future city transportation and human behavior research.

Implementation of Running Average Background Subtraction Algorithm in FPGA for Image Processing Applications <=SEP=> In this paper a new background subtraction algorithm was developed to detect moving objects from a stable system in which visual surveillance plays a major role. Initially it was implemented in MATLAB. Among all existing algorithms running average algorithm was choosen because of low computational complexity which is the major parameter of time in VLSI. The concept of the background subtraction is to subtract the current image with respect to the reference image and compare it with to the certain threshold values. We propose a new real time background subtraction algorithm which was implemented with verilog hdl in order to detect moving objects accurately. Our method involves three important modules background modelling; adaptive threshold estimation and finally fore ground extraction. Compared to all existing algorithms our method having low power consumption and low resource utilization. Here we have written the

Analyzing Neighborhoods of Falsifying Traces in Cyber-Physical Systems <=SEP=> We study the problem of analyzing falsifying traces of cyber-physical systems. Specifically, given a system model and an input which is a counterexample to a property of interest, we wish to understand which parts of the inputs are "responsible" for the counterexample as a whole. Whereas this problem is well known to be hard to solve precisely, we provide an approach based on learning from repeated simulations of the system under test.
 Our approach generalizes the classic concept of "one-at-a-time" sensitivity analysis used in the risk and decision analysis community to understand how inputs to a system influence a property in question. Specifically, we pose the problem as one of finding a neighborhood of inputs that contains the falsifying counterexample in question, such that each point in this neighborhood corresponds to a falsifying input with a high probability. We use ideas from statistical hypothesis testing to infer and validate such neighborhoods from repeated simulations of the system under test. This approach not only helps to understand the sensitivity of these counterexamples to various parts of the inputs, but also generalizes or widens the given counterexample by returning a neighborhood of counterexamples around it.
 We demonstrate our approach on a series of increasingly complex examples from automotive and closed loop medical device domains. We also compare our approach against related techniques based on regression and machine learning.

Adhesive capsulitis: sonographic changes in the rotator cuff interval with arthroscopic correlation <=SEP=> To evaluate the sonographic findings of the rotator interval in patients with clinical evidence of adhesive capsulitis immediately prior to arthroscopy. We prospectively compared 30 patients with clinically diagnosed adhesive capsulitis (20 females, 10 males, mean age 50 years) with a control population of 10 normal volunteers and 100 patients with a clinical suspicion of rotator cuff tears. Grey-scale and colour Doppler sonography of the rotator interval were used. Twenty-six patients (87%) demonstrated hypoechoic echotexture and increased vascularity within the rotator interval, all of whom had had symptoms for less than 1 year. Three patients had hypoechoic echotexture but no increase in vascularity, and one patient had a normal sonographic appearance. All patients were shown to have fibrovascular inflammatory soft-tissue changes in the rotator interval at arthroscopy commensurate with adhesive capsulitis. None of the volunteers or the patients with a clinical diagnosis of rotator cuff tear showed such changes. Sonography can provide an early accurate diagnosis of adhesive capsulitis by assessing the rotator interval for hypoechoic vascular soft tissue.

Unsupervised learning of models for object recognition <=SEP=> A method is presented to learn object class models from unlab eled and unsegmented cluttered scenes for the purpose of visual object recognition. The variabili ty across a class of objects is modeled in a principled way, treating objects as flexible constellatio ns f rigid parts (features). Variability is represented by a joint probability density function (pdf) o n the shape of the constellation and the output of part detectors. Corresponding “constellation mo dels” can be learned in a completely unsupervised fashion. In a first stage, the learning method a utomatically identifies distinctive parts in the training set by applying a clustering algorithm to pat terns selected by an interest operator. It then learns the statistical shape model using expectation m aximization. Mixtures of constellation models can be defined and applied to “discover” object catego ri s in an unsupervised manner. The method achieves very good classification results on human fa ces, cars, leaves, handwritten letters, and cartoon characters.

Latent factor models with additive and hierarchically-smoothed user preferences <=SEP=> Items in recommender systems are usually associated with annotated attributes: for e.g., brand and price for products; agency for news articles, etc. Such attributes are highly informative and must be exploited for accurate recommendation. While learning a user preference model over these attributes can result in an interpretable recommender system and can hands the cold start problem, it suffers from two major drawbacks: data sparsity and the inability to model random effects. On the other hand, latent-factor collaborative filtering models have shown great promise in recommender systems; however, its performance on rare items is poor. In this paper we propose a novel model LFUM, which provides the advantages of both of the above models. We learn user preferences (over the attributes) using a personalized Bayesian hierarchical model that uses a combination(additive model) of a globally learned preference model along with user-specific preferences. To combat data-sparsity, we smooth these preferences over the item-taxonomy using an efficient forward-filtering and backward-smoothing inference algorithm. Our inference algorithms can handle both discrete attributes (e.g., item brands) and continuous attributes (e.g., item prices). We combine the user preferences with the latent-factor models and train the resulting collaborative filtering system end-to-end using the successful BPR ranking algorithm. In our extensive experimental analysis, we show that our proposed model outperforms several commonly used baselines and we carry out an ablation study showing the benefits of each component of our model.

Finger Vein Recognition With Anatomy Structure Analysis <=SEP=> Finger vein recognition has received a lot of attention recently and is viewed as a promising biometric trait. In related methods, vein pattern-based methods explore intrinsic finger vein recognition, but their performance remains unsatisfactory owing to defective vein networks and weak matching. One important reason may be the neglect of deep analysis of the vein anatomy structure. By comprehensively exploring the anatomy structure and imaging characteristic of vein patterns, this paper proposes a novel finger vein recognition framework, including an anatomy structure analysis-based vein extraction algorithm and an integration matching strategy. Specifically, the vein pattern is extracted from the orientation map-guided curvature based on the valley- or half valley-shaped cross-sectional profile. In addition, the extracted vein pattern is further thinned and refined to obtain a reliable vein network. In addition to the vein network, the relatively clear vein branches in the image are mined from the vein pattern, referred to as the vein backbone. In matching, the vein backbone is used in vein network calibration to overcome finger displacements. The similarity of two calibrated vein networks is measured by the proposed elastic matching and further recomputed by integrating the overlap degree of corresponding vein backbones. Extensive experiments on two public finger vein databases verify the effectiveness of the proposed framework.

A Novel Global Path Planning Method for Mobile Robots Based on Teaching-Learning-Based Optimization <=SEP=> The Teaching-Learning-Based Optimization (TLBO) algorithm has been proposed in recent years. It is a new swarm intelligence optimization algorithm simulating the teaching-learning phenomenon of a classroom. In this paper, a novel global path planning method for mobile robots is presented, which is based on an improved TLBO algorithm called Nonlinear Inertia Weighted Teaching-Learning-Based Optimization (NIWTLBO) algorithm in our previous work. Firstly, the NIWTLBO algorithm is introduced. Then, a new map model of the path between start-point and goal-point is built by coordinate system transformation. Lastly, utilizing the NIWTLBO algorithm, the objective function of the path is optimized; thus, a global optimal path is obtained. The simulation experiment results show that the proposed method has a faster convergence rate and higher accuracy in searching for the path than the basic TLBO and some other algorithms as well, and it can effectively solve the optimization problem for mobile robot global path planning.

Large Scale Distributed Data Science from scratch using Apache Spark 2.0 <=SEP=> Apache Spark is an open-source cluster computing framework. It has emerged as the next generation big data processing engine, overtaking Hadoop MapReduce which helped ignite the big data revolution. Spark maintains MapReduce’s linear scalability and fault tolerance, but extends it in a few important ways: it is much faster (100 times faster for certain applications), much easier to program in due to its rich APIs in Python, Java, Scala, SQL and R (MapReduce has 2 core calls) , and its core data abstraction, the distributed data frame. In addition, it goes far beyond batch applications to support a variety of compute-intensive tasks, including interactive queries, streaming, machine learning, and graph processing. With massive amounts of computational power, deep learning has been shown to produce state-of-the-art results on various tasks in different fields like computer vision, automatic speech recognition, natural language processing and online advertising targeting. Thanks to the open-source frameworks, e.g. Torch, Theano, Caffe, MxNet, Keras and TensorFlow, we can build deep learning model in a much easier way. Among all these framework, TensorFlow is probably the most popular open source deep learning library. TensorFlow 1.0 was released recently, which provide a more stable, flexible and powerful computation tool for numerical computation using data flow graphs. Keras is a highlevel neural networks library, written in Python and capable of running on top of either TensorFlow or Theano. It was developed with a focus on enabling fast experimentation. This tutorial will provide an accessible introduction to large-scale distributed machine learning and data mining, and to Spark and its potential to revolutionize academic and commercial data science practices. It is divided into three parts: the first part will cover fundamental Spark concepts, including Spark Core, functional programming ala map-reduce, data frames, the Spark Shell, Spark Streaming, Spark SQL, MLlib, and more; the second part will focus on hands-on algorithmic design and development with Spark (developing algorithms from scratch such as decision tree learning, association rule mining (aPriori), graph processing algorithms such as pagerank/shortest path, gradient descent algorithms such as support vectors machines and matrix factorization. Industrial applications and deployments of Spark will also be presented.; the third part will introduce deep learning concepts, how to implement a deep learning model through TensorFlow, Keras and run the model on Spark. Example code will be made available in python (pySpark) notebooks.