SoroushVahidi/scidocs huggingface dataset:
Adaptive hypertext navigation based on user goals and context
(1993)

Hypertext systems allow flexible access to topics of information, but this flexibility has disadvantages. Users often become lost or overwhelmed by choices. An adaptive hypertext system can overcome these disadvantages by recommending information to users based on their specific information needs and preferences. Simple associative matrices provide an effective way of capturing these user preferences. Because the matrices are easily updated, they support the kind of dynamic learning required in an adaptive system. HYPERFLEX, a prototype of an adaptive hypertext system that learns, is described. Informal studies with HYPERFLEX clarify the circumstances under which adaptive systems are likely to be useful, and suggest that HYPERFLEX can reduce time spent searching for information by up to 40%. Moreover, these benefits can be obtained with relatively little effort on the part of hypertext authors or users. The simple models underlying HYPERFLEX's performance may offer a general and useful alternative to more sophisticated modelling techniques. Conditions under which these models, and similar adaptation techniques, might be most useful are discussed.
Unfriending on Facebook: Friend Request and Online/Offline Behavior Analysis
(2011)

Objectives: Determine the role of the friend request in unfriending decisions. Find factors in unfriending decisions and find differences in the perception of online and offline behaviors that vary depending on the unfriending decision. Method: Survey research conducted online. 690 surveys about unfriending were analyzed using exploratory statistical techniques. Results: The research results show that the initiator of the friend request has more than their expected share of unfriends compared to those who receive the friend request. There are online and offline factors for unfriending decisions; the research identified six constructs to evaluate unfriending decisions. There are 4 components for online behaviors (unimportant/frequent posts, polarizing posts, inappropriate posts and everyday life posts) and 2 offline components (disliked behavior and changes in the relationship). Survey respondents who said they unfriend for online reasons were more likely to agree that the person posted too frequently about unimportant topics, polarizing topics, and inappropriate topics compared to those who unfriended for offline reasons.
Semantics of context-free languages
(1968)

“Meaning” may be assigned to a string in a context-free language by defining “attributes” of the symbols in a derivation tree for that string. The attributes can be defined by functions associated with each production in the grammar. This paper examines the implications of this process when some of the attributes are “synthesized”, i.e., defined solely in terms of attributes of thedescendants of the corresponding nonterminal symbol, while other attributes are “inherited”, i.e., defined in terms of attributes of theancestors of the nonterminal symbol. An algorithm is given which detects when such semantic rules could possibly lead to circular definition of some attributes. An example is given of a simple programming language defined with both inherited and synthesized attributes, and the method of definition is compared to other techniques for formal specification of semantics which have appeared in the literature.
TweetCred: A Real-time Web-based System for Assessing Credibility of Content on Twitter
(2014)

During large scale events, a large volume of content is posted on Twitter, but not all of this content is trustworthy. The presence of spam, advertisements, rumors and fake images reduces the value of information collected from Twitter, especially during sudden-onset crisis events where information from other sources is scarce. In this research work, we describe various facets of assessing the credibility of usergenerated content on Twitter during large scale events, and develop a novel real-time system to assess the credibility of tweets. Firstly, we develop a semi-supervised ranking model using SVM-rank for assessing credibility, based on training data obtained from six high-impact crisis events of 2013. An extensive set of forty-five features is used to determine the credibility score for each of the tweets. Secondly, we develop and deploy a system–TweetCred–in the form of a browser extension, a web application and an API at the link: http://twitdigest.iiitd.edu.in/TweetCred/. To the best of our knowledge, this is the first research work to develop a practical system for credibility on Twitter and evaluate it with real users. TweetCred was installed and used by 717 Twitter users within a span of three weeks. During this period, a credibility score was computed for more than 1.1 million unique tweets. Thirdly, we evaluated the real-time performance of TweetCred , observing that 84% of the credibility scores were displayed within 6 seconds. We report on the positive feedback that we received from the system’s users and the insights we gained into improving the system for future iterations.
Monte-Carlo Tree Search: A New Framework for Game AI
(2008)

Classic approaches to game AI require either a high quality of domain knowledge, or a long time to generate effective AI behaviour. These two characteristics hamper the goal of establishing challenging game AI. In this paper, we put forward Monte-Carlo Tree Search as a novel, unified framework to game AI. In the framework, randomized explorations of the search space are used to predict the most promising game actions. We will demonstrate that Monte-Carlo Tree Search can be applied effectively to (1) classic board-games, (2) modern board-games, and (3) video games.
Low-Cost Wideband and High-Gain Slotted Cavity Antenna Using High-Order Modes for Millimeter-Wave Application
(2015)

A novel single-fed low-cost wideband and high-gain slotted cavity antenna based on substrate integrated waveguide (SIW) technology using high-order cavity modes is demonstrated in this paper. High-order resonant modes (TE130, TE310, TE330) inside the cavity are simply excited by a coaxial probe which is located at the center of the antenna. Energy is coupled out of the cavity by a 3 × 3 slot array etched on the top surface of the cavity. Two antennas with different polarizations are designed and tested. Measured results show that the linearly polarized prototype achieves an impedance bandwidth (|S11| <; -10 dB) of > 26% (28 to 36.6 GHz), and a 1-dB gain bandwidth of 14.1% (30.3 to 34.9 GHz). In addition, a measured maximum gain of 13.8 dBi and radiation efficiency of 92% are obtained. To generate circularly polarized radiation, a rotated dipole array is placed in front of the proposed linearly polarized antenna. Measured results show that the circularly polarized antenna exhibits a common bandwidth (10-dB return loss bandwidth, 3-dB axial ratio bandwidth, and 1-dB gain bandwidth) of 11%.
Medical Concept Embeddings via Labeled Background Corpora
(2016)

In recent years, we have seen an increasing amount of interest in low-dimensional vector representations of words. Among other things, these facilitate computing word similarity and relatedness scores. The most well-known example of algorithms to produce representations of this sort are the word2vec approaches. In this paper, we investigate a new model to induce such vector spaces for medical concepts, based on a joint objective that exploits not only word co-occurrences but also manually labeled documents, as available from sources such as PubMed. Our extensive experimental analysis shows that our embeddings lead to significantly higher correlations with human similarity and relatedness assessments than previous work. Due to the simplicity and versatility of vector representations, these findings suggest that our resource can easily be used as a drop-in replacement to improve any systems relying on medical concept similarity measures.
Exploring Ways To Mitigate Sensor-Based Smartphone Fingerprinting
(2015)

Modern smartphones contain motion sensors, such as accelerometers and gyroscopes. These sensors have many useful applications; however, they can also be used to uniquely identify a phone by measuring anomalies in the signals, which are a result from manufacturing imperfections. Such measurements can be conducted surreptitiously in the browser and can be used to track users across applications, websites, and visits. We analyze techniques to mitigate such device fingerprinting either by calibrating the sensors to eliminate the signal anomalies, or by adding noise that obfuscates the anomalies. To do this, we first develop a highly accurate fingerprinting mechanism that combines multiple motion sensors and makes use of (inaudible) audio stimulation to improve detection. We then collect measurements from a large collection of smartphones and evaluate the impact of calibration and obfuscation techniques on the classifier accuracy.
Yelp Dataset Challenge: Review Rating Prediction
(2016)

Review websites, such as TripAdvisor and Yelp, allow users to post online reviews for various businesses, products and services, and have been recently shown to have a significant influence on consumer shopping behaviour. An online review typically consists of free-form text and a star rating out of 5. The problem of predicting a user’s star rating for a product, given the user’s text review for that product, is called Review Rating Prediction and has lately become a popular, albeit hard, problem in machine learning. In this paper, we treat Review Rating Prediction as a multi-class classification problem, and build sixteen different prediction models by combining four feature extraction methods, (i) unigrams, (ii) bigrams, (iii) trigrams and (iv) Latent Semantic Indexing, with four machine learning algorithms, (i) logistic regression, (ii) Näıve Bayes classification, (iii) perceptrons, and (iv) linear Support Vector Classification. We analyse the performance of each of these sixteen models to come up with the best model for predicting the ratings from reviews. We use the dataset provided by Yelp for training and testing the models.
Prospects of encoding Java source code in XML
(2003)

Currently, the only standard format for representing Java source code is plain text-based. This paper explores the prospects of using Extensible Markup Language (XML) for this purpose. XML enables the leverage of tools and standards more powerful than those available for plain-text formats, while retaining broad accessibility. The paper outlines the potential benefits of future XML grammars that would allow for improved code structure and querying possibilities; code extensions, construction, and formatting; and referencing parts of code. It also introduces the concept of grammar levels and argues for the inclusion of several grammar levels into a common framework. It discusses conversions between grammars and some practical grammar design issues. Keywords—XML, Java, source code, parsing, code formatting
Semantic integration of UML class diagram with semantic validation on segments of mappings
(2018)

Recently, attention has focused on the software development, specially by different teams that are geographically distant to support collaborative work. Management, description and modeling in such collaborative approach are through several tools and techniques based on UML models. It is now supported by a large number of tools. Most of these systems have the ability to compare different UML models, assist developers, designers and also provide operations for the merging and integration, to produce a coherent model. The contribution in this article is both to integrate a set of UML class diagrams using mappings that are result of alignment and assist designers and developers in the integration. In addition, we will present a detail integration of UML models with the validation of mappings between them. Such validation helps to achieve correct, consistent and coherent integrated model.
On partial least squares in head pose estimation: How to simultaneously deal with misalignment
(2012)

Head pose estimation is a critical problem in many computer vision applications. These include human computer interaction, video surveillance, face and expression recognition. In most prior work on heads pose estimation, the positions of the faces on which the pose is to be estimated are specified manually. Therefore, the results are reported without studying the effect of misalignment. We propose a method based on partial least squares (PLS) regression to estimate pose and solve the alignment problem simultaneously. The contributions of this paper are two-fold: 1) we show that the kernel version of PLS (kPLS) achieves better than state-of-the-art results on the estimation problem and 2) we develop a technique to reduce misalignment based on the learned PLS factors.
Reinforcement Learning and Approximate Dynamic Programming for Feedback Control
(2012)

reinforcement learning and approximate dynamic programming for feedback control are a good way to achieve details about operating certainproducts. Many products that you buy can be obtained using instruction manuals. These user guides are clearlybuilt to give step-by-step information about how you ought to go ahead in operating certain equipments. Ahandbook is really a user's guide to operating the equipments. Should you loose your best guide or even the productwould not provide an instructions, you can easily obtain one on the net. You can search for the manual of yourchoice online. Here, it is possible to work with google to browse through the available user guide and find the mainone you'll need. On the net, you'll be able to discover the manual that you might want with great ease andsimplicity
Toward a Rational Choice Process Theory of Internet Scamming: The Offender's Perspective
(2014)

Internet fraud scam is a crime enabled by the Internet to swindle Internet users. The global costs of these scams are in the billions of US dollars. Existing research suggests that scammers maximize their economic gain. Although this is a plausible explanation, since the idea of the scam is to fool people to send money, this explanation alone, cannot explain why individuals become Internet scammers. An equally important, albeit unexplored riddle, is the question of what strategies Internet scammers adopt to perform the act. As a first step to address these gaps, we interviewed five Internet scammers in order to develop a rational choice process theory of Internet scammers’ behavior. The initial results suggest that an interplay of socioeconomic and dynamic thinking processes explains why individuals drift into Internet scamming. Once an individual drifts into Internet scamming, a successful scam involves two processes: persuasive strategy and advance fee strategy.
Catfish Binary Particle Swarm Optimization for Feature Selection
(2011)

The feature selection process constitutes a commonly encountered problem of global combinatorial optimization. This process reduces the number of features by removing irrelevant, noisy, and redundant data, thus resulting in acceptable classification accuracy. Feature selection is a preprocessing technique with great importance in the fields of data analysis and information retrieval processing, pattern classification, and data mining applications. This paper presents a novel optimization algorithm called catfish binary particle swarm optimization (CatfishBPSO), in which the so-called catfish effect is applied to improve the performance of binary particle swarm optimization (BPSO). This effect is the result of the introduction of new particles into the search space (“catfish particles”), which replace particles with the worst fitness by the initialized at extreme points of the search space when the fitness of the global best particle has not improved for a number of consecutive iterations. In this study, the K-nearest neighbor (K-NN) method with leave-oneout cross-validation (LOOCV) was used to evaluate the quality of the solutions. CatfishBPSO was applied and compared to six classification problems taken from the literature. Experimental results show that CatfishBPSO simplifies the feature selection process effectively, and either obtains higher classification accuracy or uses fewer features than other feature selection methods.
Powering 3 Dimensional Microrobots : Power Density Limitations ∗
(1998)

Many types of electrostatic and electromagnetic microactuators have been developed. It is important to understand the fundamental performance limitations of these actuators for use in micro-robotic systems. The most important consideration for micro mobile robots is the effective power density of the actuator. As inertia and gravitional forces become less significant for small robots, typical metrics for macro-robots, such as torque-to-weight ratio, are not appropriate. A very significant problem with micro-actuators for robotics is the need for efficient transmissions to obtain large forces and torques at low speeds from inherently high speed low force actuators.
FPGA based Time-to-Digital Converter
(2011)

High-resolution Time-to-Digital converter (TDC) is one of the crucial blocks in Highenergy nuclear physics time of flight experiments. The contemporary time interval measurement techniques rely on employing methods like Time-to-Amplitude Conversion, Vernier method, Delay Locked Loops (DLL), Tapped Delay Lines (TDL), Differential Delay Lines (DDL) etc. Recently, FPGA based TDC designs with merits of low cost, fast development cycle and re-programmability are reported [1]. The TDC implementation in FPGA have design challenges and issues like, lack of direct control over the propagation delays, unpredictable Place & Route (P&R) delays and delay variations due to Process, Voltage & Temperature (PVT) variations. In the TDC design presented here, the resolution below the minimum gate delay is achieved by employing differential (Vernier oscillator) technique. The predictable P&R is achieved by manual P&R of the critical elements and avoiding the use of digital synthesis tools. Further, in order to compensate for the delay variations due to PVT, a calibration methodology is developed and implemented. By implementing the design in a Flash-based FPGA, the low power design objective is achieved.
Looking good: factors affecting the likelihood of having cosmetic surgery
(2007)

The present study examined various factors associated with the likelihood of having cosmetic surgery in a community sample of Austrian participants. One-hundred and sixty-eight women and 151 men completed a questionnaire measuring how likely they were to consider common cosmetic procedures. The results showed that women were more likely than men to consider most cosmetic procedures. Path analysis revealed that personal experience of having had cosmetic surgery was a significant predictor of future likelihood, while media exposure (viewing advertisements or television programs, or reading articles about cosmetic surgery) mediated the influence of vicarious experience and sex. These results are discussed in relation to previous work examining the factors associated with the likelihood of having cosmetic surgery.
A Case for NOW (Networks of Workstations) - Abstract
(1994)

In this paper, we argue that because of recent technology advances, networks of workstations (NOWs) are poised to become the primary computing infrastructure for science and engineering, from low end interactive computing to demanding sequential and parallel applications. We identify three opportunities for NOWs that will benefit endusers: dramatically improving virtual memory and file system performance by using the aggregate DRAM of a NOW as a giant cache for disk; achieving cheap, highly available, and scalable file storage by using redundant arrays of workstation disks, using the LAN as the I/O backplane; and finally, multiple CPUs for parallel computing. We describe the technical challenges in exploiting these opportunities – namely, efficient communication hardware and software, global coordination of multiple workstation operating systems, and enterprise-scale network file systems. We are currently building a 100-node NOW prototype to demonstrate that practical solutions exist to these technical challenges.
Discriminative Embeddings of Latent Variable Models for Structured Data
(2016)

Kernel classifiers and regressors designed for structured data, such as sequences, trees and graphs, have significantly advanced a number of interdisciplinary areas such as computational biology and drug design. Typically, kernels are designed beforehand for a data type which either exploit statistics of the structures or make use of probabilistic generative models, and then a discriminative classifier is learned based on the kernels via convex optimization. However, such an elegant two-stage approach also limited kernel methods from scaling up to millions of data points, and exploiting discriminative information to learn feature representations. We propose, structure2vec, an effective and scalable approach for structured data representation based on the idea of embedding latent variable models into feature spaces, and learning such feature spaces using discriminative information. Interestingly, structure2vec extracts features by performing a sequence of function mappings in a way similar to graphical model inference procedures, such as mean field and belief propagation. In applications involving millions of data points, we showed that structure2vec runs 2 times faster, produces models which are 10, 000 times smaller, while at the same time achieving the state-of-the-art predictive performance.
GUITAR: Piecing Together Android App GUIs from Memory Images
(2015)

An Android app's graphical user interface (GUI) displays rich semantic and contextual information about the smartphone's owner and app's execution. Such information provides vital clues to the investigation of crimes in both cyber and physical spaces. In real-world digital forensics however, once an electronic device becomes evidence most manual interactions with it are prohibited by criminal investigation protocols. Hence investigators must resort to "image-and-analyze" memory forensics (instead of browsing through the subject phone) to recover the apps' GUIs. Unfortunately, GUI reconstruction is still largely impossible with state-of-the-art memory forensics techniques, which tend to focus only on individual in-memory data structures. An Android GUI, however, displays diverse visual elements each built from numerous data structure instances. Furthermore, whenever an app is sent to the background, its GUI structure will be explicitly deallocated and disintegrated by the Android framework. In this paper, we present GUITAR, an app-independent technique which automatically reassembles and redraws all apps' GUIs from the multitude of GUI data elements found in a smartphone's memory image. To do so, GUITAR involves the reconstruction of (1) GUI tree topology, (2) drawing operation mapping, and (3) runtime environment for redrawing. Our evaluation shows that GUITAR is highly accurate (80-95% similar to original screenshots) at reconstructing GUIs from memory images taken from a variety of Android apps on popular phones. Moreover, GUITAR is robust in reconstructing meaningful GUIs even when facing GUI data loss.