SoroushVahidi/scidocs huggingface dataset:
LinkNBed: Multi-Graph Representation Learning with Entity Linkage
(2018)

Knowledge graphs have emerged as an important model for studying complex multirelational data. This has given rise to the construction of numerous large scale but incomplete knowledge graphs encoding information extracted from various resources. An effective and scalable approach to jointly learn over multiple graphs and eventually construct a unified graph is a crucial next step for the success of knowledge-based inference for many downstream applications. To this end, we propose LinkNBed, a deep relational learning framework that learns entity and relationship representations across multiple graphs. We identify entity linkage across graphs as a vital component to achieve our goal. We design a novel objective that leverage entity linkage and build an efficient multi-task training procedure. Experiments on link prediction and entity linkage demonstrate substantial improvements over the state-ofthe-art relational learning approaches.
Metacognition of the testing effect: guiding learners to predict the benefits of retrieval.
(2013)

If the mnemonic benefits of testing are to be widely realized in real-world learning circumstances, people must appreciate the value of testing and choose to utilize testing during self-guided learning. Yet metacognitive judgments do not appear to reflect the enhancement provided by testing Karpicke & Roediger (Science 319:966-968, 2008). In this article, we show that under judicious conditions, learners can indeed reveal an understanding of the beneficial effects of testing, as well as the interaction of that effect with delay (experiment 1). In that experiment, subjects made judgments of learning (JOLs) for previously studied or previously tested items in either a cue-only or a cue-target context, and either immediately or after a 1-day delay. When subjects made judgments in a cue-only context, their JOLs accurately reflected the effects of testing, both immediately and at a delay. To evaluate the potential of exposure to such conditions for promoting generalized appreciation of testing effects, three further experiments elicited global predictions about restudied and tested items across two study/test cycles (experiments 2, 3, and 4). The results indicated that learners' global naïve metacognitive beliefs increasingly reflect the beneficial effects of testing when learners experience these benefits with increasing external support. If queried under facilitative circumstances, learners appreciate the mnemonic enhancement that testing provides on both an item-by-item and global basis but generalize that knowledge to future learning only with considerable guidance.
White-box cryptography: practical protection on hostile hosts
(2016)

Businesses often interact with users via web-browsers and applications on mobile devices, and host services on cloud servers they may not own. Such highly-exposed environments employ white-box cryptography (WBC) for security protection. WBC operates on a security model far different from the traditional black-box model. The modern business world includes large commercial segments in which end-users are directly exposed to business application software hosted on web browsers, mobile phones, web-connected tablets, and an increasing number of other devices: the `internet of things' (IoT). Software applications and their communication activities now dominate much of the commercial world, and there have been countless hacks on such software, and on devices hosting it, with targets as diverse as mobile phones, web browser applications, vehicles, and even refrigerators! The business advantages of deploying computational power near the user encourage software migration to exposed network end-points, but this increasing exposure provides an ever growing attack surface. Here, we discuss goals and challenges of white-box cryptography and emerging approaches in a continual attempt to stay at least one step ahead of the attackers. We list some WBC techniques, both traditional and recent, indicating how they might be incorporated into a WBC AES implementation.
The pursuit of happiness: time, money, and social connection.
(2010)

Does thinking about time, rather than money, influence how effectively individuals pursue personal happiness? Laboratory and field experiments revealed that implicitly activating the construct of time motivates individuals to spend more time with friends and family and less time working-behaviors that are associated with greater happiness. In contrast, implicitly activating money motivates individuals to work more and socialize less, which (although productive) does not increase happiness. Implications for the relative roles of time versus money in the pursuit of happiness are discussed.
Fragile online relationship: a first look at unfollow dynamics in twitter
(2011)

We analyze the dynamics of the behavior known as 'unfollow' in Twitter. We collected daily snapshots of the online relationships of 1.2 million Korean-speaking users for 51 days as well as all of their tweets. We found that Twitter users frequently unfollow. We then discover the major factors, including the reciprocity of the relationships, the duration of a relationship, the followees' informativeness, and the overlap of the relationships, which affect the decision to unfollow. We conduct interview with 22 Korean respondents to supplement the quantitative results.
 They unfollowed those who left many tweets within a short time, created tweets about uninteresting topics, or tweeted about the mundane details of their lives. To the best of our knowledge, this work is the first systematic study of the unfollow behavior in Twitter.
The role of emotion in computer-mediated communication: A review
(2008)

It has been argued that the communication of emotions is more difficult in computer-mediated communication (CMC) than in face-to-face (F2F) communication. The aim of this paper is to review the empirical evidence in order to gain insight in whether emotions are communicated differently in these different modes of communication. We review two types of studies: (1) studies that explicitly examine discrete emotions and emotion expressions, and (2) studies that examine emotions more implicitly, namely as self-disclosure or emotional styles. Our conclusion is that there is no indication that CMC is a less emotional or less personally involving medium than F2F. On the contrary, emotional communication online and offline is surprisingly similar, and if differences are found they show more frequent and explicit emotion communication in CMC than in F2F. 2007 Elsevier Ltd. All rights reserved.
Initial construction and validation of the Pathological Narcissism Inventory.
(2009)

The construct of narcissism is inconsistently defined across clinical theory, social-personality psychology, and psychiatric diagnosis. Two problems were identified that impede integration of research and clinical findings regarding narcissistic personality pathology: (a) ambiguity regarding the assessment of pathological narcissism vs. normal narcissism and (b) insufficient scope of existing narcissism measures. Four studies are presented documenting the initial derivation and validation of the Pathological Narcissism Inventory (PNI). The PNI is a 52-item self-report measure assessing 7 dimensions of pathological narcissism spanning problems with narcissistic grandiosity (Entitlement Rage, Exploitativeness, Grandiose Fantasy, Self-sacrificing Self-enhancement) and narcissistic vulnerability (Contingent Self-esteem, Hiding the Self, Devaluing). The PNI structure was validated via confirmatory factor analysis. The PNI correlated negatively with self-esteem and empathy, and positively with shame, interpersonal distress, aggression, and borderline personality organization. Grandiose PNI scales were associated with vindictive, domineering, intrusive, and overly-nurturant interpersonal problems, and vulnerable PNI scales were associated with cold, socially avoidant, and exploitable interpersonal problems. In a small clinical sample, PNI scales exhibited significant associations with parasuicidal behavior, suicide attempts, homicidal ideation, and several aspects of psychotherapy utilization.
COPSS-lite: Lightweight ICN Based Pub/Sub for IoT Environments
(2017)

Information Centric Networking (ICN) is a new networking paradigm that treats content as the first class entity. It provides content to users without regards to the current location or source of the content. The publish/subscribe (pub/sub) systems have gained popularity in Internet. Pub/sub systems dismisses the need for users to request every content of their interest. Instead, the content is supplied to the interested users (subscribers) as and when it is published. CCN/NDN are popular ICN proposals widely accepted in the ICN community however, they do not provide an efficient pub/sub mechanism. COPSS enhances CCN/NDN with an efficient pub/sub capability. Internet of Things (IoT) is a growing topic of interest in both Academia and Industry. The current designs for IoT relies on IP. However, the IoT devices are constrained in their available resources and IP is heavy for their operation.We observed that IoT’s are information centric in nature and hence ICN is a more suitable candidate to support IoT environments. Although NDN and COPSS work well for the Internet, their current full fledged implementations cannot be used by the resource constrained IoT devices. CCN-lite is a light weight, inter-operable version of the CCNx protocol for supporting the IoT devices. However, CCN-lite like its ancestors lacks the support for an efficient pub/sub mechanism. In this paper, we developed COPSS-lite, an efficient and light weight implementation of pub/sub for IoT. COPSS-lite is developed to enhance CCN-lite and also support multi-hop connection by incorporating the famous RPL protocol for low power and lossy networks. We provide a preliminary evaluation to show proof of operability with real world sensor devices in IoT lab. Our results show that COPSS-lite is compact, operates on all platforms that support CCN-lite and we observe significant performance benefits with COPSS-lite in IoT environments.
Parsing English with a Link Grammar
(1995)

We develop a formal grammatical system called a link grammar, show how English grammar can be encoded in such a system, and give algorithms for efficiently parsing with a link grammar. Although the expressive power of link grammars is equivalent to that of context free grammars, encoding natural language grammars appears to be much easier with the new system. We have written a program for general link parsing and written a link grammar for the English language. The performance of this preliminary system – both in the breadth of English phenomena that it captures and in the computational resources used – indicates that the approach may have practical uses as well as linguistic significance. Our program is written in C and may be obtained through the internet. c 1991 Daniel Sleator and Davy Temperley * School of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213, sleator@cs.cmu.edu. y Music Department, Columbia University, New York, NY 10027, dt3@cunixa.cc.columbia.edu. Research supported in part by the National Science Foundation under grant CCR-8658139, Olin Corporation, and R. R. Donnelley and Sons. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of Olin Corporation, R. R. Donnelley and Sons, or the NSF.
Robust Physical-World Attacks on Machine Learning Models
(2017)

Deep neural network-based classifiers are known to be vulnerable to adversarial examples that can fool them into misclassifying their input through the addition of small-magnitude perturbations. However, recent studies have demonstrated that such adversarial examples are not very effective in the physical world—they either completely fail to cause misclassification or only work in restricted cases where a relatively complex image is perturbed and printed on paper. In this paper we propose a new attack algorithm—Robust Physical Perturbations (RP2)— that generates perturbations by taking images under different conditions into account. Our algorithm can create spatiallyconstrained perturbations that mimic vandalism or art to reduce the likelihood of detection by a casual observer. We show that adversarial examples generated by RP2 achieve high success rates under various conditions for real road sign recognition by using an evaluation methodology that captures physical world conditions. We physically realized and evaluated two attacks, one that causes a Stop sign to be misclassified as a Speed Limit sign in 100% of the testing conditions, and one that causes a Right Turn sign to be misclassified as either a Stop or Added Lane sign in 100% of the testing conditions.
Sociable driving agents to maintain driver's attention in autonomous driving
(2017)

Recently, many studies have been conducted on increasing the automation level in cars to achieve safer and more efficient transportation. The increased automation level creates room for the drivers to shift their attention to non-driving related activities. However, there are cases that cannot be handled by automation where a driver should take over the control. This pilot study investigates a paradigm for keeping the drivers' situation-awareness active during autonomous driving by utilizing a social robot system, NAMIDA. NAMIDA is an interface consisting of three sociable driving agents that can interact with the driver through eye-gaze behaviors. We analyzed the effectiveness of NAMIDA on maintaining the drivers' attention to the road, by evaluating the response time of the drivers to a critical situation on the road. An experiment consisting of a take over scenario was conducted in a dynamic driving simulator. The results showed that existence of NAMIDA significantly reduced the response time of the drivers. However, surprisingly, NAMIDA without eye-gaze behaviors was more effective in reducing the response time than NAMIDA with eye-gaze behaviors. Additionally, the results revealed better subjective impressions for NAMIDA with eye-gaze behaviors behaviors.
Correlating driver gaze with the road scene for driver assistance systems
(2005)

A driver assistance system (DAS) should support the driver by monitoring road and vehicle events and presenting relevant and timely information to the driver. It is impossible to know what a driver is thinking, but we can monitor the driver’s gaze direction and compare it with the position of information in the driver’s viewfield to make inferences. In this way, not only do we monitor the driver’s actions, we monitor the driver’s observations as well. In this paper we present the automated detection and recognition of road signs, combined with the monitoring of the driver’s response. We present a complete system that reads speed signs in real-time, compares the driver’s gaze, and provides immediate feedback if it appears the sign has been missed by t ©
Robust method for road sign detection and recognition
(1996)

This paper describes a method for detecting and recognizing road signs in gray-level and color images acquired by a single camera mounted on a moving vehicle. The method works in three stages. First, the search for the road sign is reduced to a suitable region of the image by using some a priori knowledge on the scene or color clues (when available). Secondly, a geometrical analysis of the edges extracted from the image is carried out, which generates candidates to be circular and triangular signs. Thirdly, a recognition stage tests by cross-correlation techniques each candidate which, if validated, is classi ed according to the data-base of signs. An extensive experimentation has shown that the method is robust against low-level noise corrupting edge detection and contour following, and works for images of cluttered urban streets as well as country roads and highways. A further improvement on the detection and recognition scheme has been obtained by means of temporal integration based on Kalman ltering methods of the extracted information. The proposed approach can be very helpful for the development of a system for driving assistance.
Face recognition: A literature survey
(2003)

As one of the most successful applications of image analysis and understanding, face recognition has recently received significant attention, especially during the past several years. At least two reasons account for this trend: the first is the wide range of commercial and law enforcement applications, and the second is the availability of feasible technologies after 30 years of research. Even though current machine recognition systems have reached a certain level of maturity, their success is limited by the conditions imposed by many real applications. For example, recognition of face images acquired in an outdoor environment with changes in illumination and/or pose remains a largely unsolved problem. In other words, current systems are still far away from the capability of the human perception system.This paper provides an up-to-date critical survey of still- and video-based face recognition research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights into the studies of machine recognition of faces. To provide a comprehensive survey, we not only categorize existing recognition techniques but also present detailed descriptions of representative methods within each category. In addition, relevant topics such as psychophysical studies, system evaluation, and issues of illumination and pose variation are covered.
Fast Radial Symmetry for Detecting Points of Interest
(2003)

A new transform is presented that utilizes local radial symmetry to highlight points of interest within a scene. Its lowcomputational complexity and fast runtimes makes this method well-suited for real-time vision applications. The performance of the transform is demonstrated on a wide variety of images and compared with leading techniques from the literature. Both as a facial feature detector and as a generic region of interest detector the new transform is seen to offer equal or superior performance to contemporary techniques at a relatively low-computational cost. A real-time implementation of the transform is presented running at over 60 frames per second on a standard Pentium III PC.
Vision-based eye-gaze tracking for human computer interface
(1999)

Eye-gaze is an input mode which has the potential of an efficient computer interface. Eye movement has been the focus of research in this area. Non-intrusive eyegaze tracking that allows slight head movement is addressed in this paper. A small 2D mark is employed as a reference to compensate for this movement. The iris center has been chosen for purposes of measuring eye movement. The gaze point is estimated after acquiring the eye movement data. Preliminary experimental results are given through a screen pointing application.
An Empirical Exploration of Curriculum Learning for Neural Machine Translation
(2018)

Machine translation systems based on deep neural networks are expensive to train. Curriculum learning aims to address this issue by choosing the order in which samples are presented during training to help train better models faster. We adopt a probabilistic view of curriculum learning, which lets us flexibly evaluate the impact of curricula design, and perform an extensive exploration on a German-English translation task. Results show that it is possible to improve convergence time at no loss in translation quality. However, results are highly sensitive to the choice of sample difficulty criteria, curriculum schedule and other hyperparameters.
Algorithms for Lipschitz Learning on Graphs
(2015)

We develop fast algorithms for solving regression problems on graphs where one is given the value of a function at some vertices, and must find its smoothest possible extension to all vertices. The extension we compute is the absolutely minimal Lipschitz extension, and is the limit for large p of p-Laplacian regularization. We present an algorithm that computes a minimal Lipschitz extension in expected linear time, and an algorithm that computes an absolutely minimal Lipschitz extension in expected time Õ(mn). The latter algorithm has variants that seem to run much faster in practice. These extensions are particularly amenable to regularization: we can perform l0-regularization on the given values in polynomial time and l1-regularization on the initial function values and on graph edge weights in time Õ(m). Our definitions and algorithms naturally extend to directed graphs.
Tanzer group IIB constricted ear repair with helical advancement and superior auricular artery chondrocutaneous flap.
(2012)

Constricted ear deformity was first described by Tanzer and classified it into 3 groups according to the degree of constriction. The group IIB deformity involves the helix, scapha, and antihelical fold. The height of the ear is sharply reduced, and the soft tissue envelope is not sufficient to close the cartilage framework after expansion and reshaping.This study describes expanding the cartilage and increasing the height by advancing the helical root superiorly and repairing the skin-cartilage defect with a superior auricular artery chondrocutaneous flap in Tanzer group IIB constricted ear deformity.Six ears of 6 patients were treated with this technique during the past 3 years. All patients were satisfied with the appearance of their corrected ears, and the increase in height was maintained through the follow-up period.The described technique does not have the disadvantages and possible complications of harvesting a costal cartilage graft. Moving and fixing the root of helix to a more superior position provide the auricle with additional length. The superior auricular artery chondrocutaneous flap not only provides adequate soft tissue for primary closure of the anterior portion of the auricle but also aids in repairing the cartilage defect resulting from the superior advancement of the helix as well.
Hand Gesture Recognition using Sign Language
(2017)

Sign Language is mostly used by deaf and dumb people. In order to improve the man machine interaction, sign language can be used as a way for communicating with machines. Most of the applications which enable sign language processing are using data gloves and other devices for interacting with computers. This restricts the freedom of users. So to avoid this, this system we capture live video stream through normal webcam and pass it as input and process this video to detect human gestures . These gestures can be signs represented in any sign language like American Sign Language (ASL), Indian Sign Language(ISL) etc. By processing these signs, this system can make an efficient system for searching using signs. In future this method of searching can be implemented in many areas such as railway station for searching the details of any trains, etc. Searching uses signs can play a major role in searching technique because the latest existing technique of searching is based on voice. But this may not work properly because each person has a different pronunciation. This system can overcome the drawbacks of the current available searching technique and thus can make every person under an umbrella of searching.