SoroushVahidi/scidocs huggingface dataset:
Using the random forest classifier to assess and predict student learning of Software Engineering Teamwork
(2016)

The overall goal of our Software Engineering Teamwork Assessment and Prediction (SETAP) project is to develop effective machine-learning-based methods for assessment and early prediction of student learning effectiveness in software engineering teamwork. Specifically, we use the Random Forest (RF) machine learning (ML) method to predict the effectiveness of software engineering teamwork learning based on data collected during student team project development. These data include over 100 objective and quantitative Team Activity Measures (TAM) obtained from monitoring and measuring activities of student teams during the creation of their final class project in our joint software engineering classes which ran concurrently at San Francisco State University (SFSU), Fulda University (Fulda) and Florida Atlantic University (FAU). In this paper we provide the first RF analysis results done at SFSU on our full data set covering four years of our joint SE classes. These data include 74 student teams with over 380 students, totaling over 30000 discrete data points. These data are grouped into 11 time intervals, each measuring important phases of project development during the class (e.g. early requirement gathering and design, development, testing and delivery). We briefly elaborate on the methods of data collection and describe the data itself. We then show prediction results of the RF analysis applied to this full data set. Results show that we are able to detect student teams who are bound to fail or need attention in early class time with good (about 70%) accuracy. Moreover, the variable importance analysis shows that the features (TAM measures) with high predictive power make intuitive sense, such as late delivery/late responses, time used to help each other, and surprisingly statistics on commit messages to the code repository, etc. In summary, we believe we demonstrate the viability of using ML on objective and quantitative team activity measures to predict student learning of software engineering teamwork, and point to easy-to-measure factors that can be used to guide educators and software engineering managers to implement early intervention for teams bound to fail. Details about the project and the complete ML training database are downloadable from the project web site.
A self biased operational amplifier at ultra low power supply voltage
(2009)

This paper discusses the design of a self-biased folded cascode operational amplifier at an ultra low power supply voltage. The proposed design is first of its kind at 0.5 V where self-biasing techniques are used to reduce power and area overheads. The self-biasing scheme in this design is developed by using a current mirror for low voltage operation. This design is implemented in a 90 nm CMOS technology using Cadence General Purpose Design Kit (GPDK).
The Business Model as a Tool of Improving Value Creation in Complex Private Service System-Case : Value Network of Electric Mobility
(2011)

This paper shows how the concept of business model can be used as an analysis tool when attempting to understand and describe the complexity of the value creation of a developing industry, namely electric mobility. The business model concept is applied as a theoretical framework in action research based and facilitated workshops with nine case companies operating in the field of electric mobility. The concept turned out to be a promising tool in creating a better understanding of the value creation in electric mobility, and thus being a potential framework for the development work for the actors in that field. The concept can help companies to improve cooperation with other players by being a common terminology.
Exact robot navigation using artificial potential functions
(1992)

We present a new methodology for exact robot motion planning and control that unifies the purely kinematic path planning problem with the lower level feedback controller design. Complete information about the freespace and goal is encoded in the form of a special artificial potential function a navigation function that connects the kinematic planning problem with the dynamic execution problem in a provably correct fashion. The navigation function automatically gives rise to a bounded-torque feedback controller for the robot's actuators that guarantees collision-free motion and convergence to the destination from almost all initial free configurations. Since navigation functions exist for any robot and obstacle course, our methodology is completely general in principle. However, this paper is mainly concerned with certain constructive techniques for a particular class of motion planning problems. Specifically, we present a formula for navigation functions that guide a point-mass robot in a generalized sphere world. The simplest member of this family is a space obtained by puncturing a disc by an arbitrary number of smaller disjoint discs representing obstacles. The other spaces are obtained from this model by a suitable coordinate transformation that we show how to build. Our constructions exploit these coordinate transformations to adapt a navigation function on the model space to its more geometrically complicated (but topologically equivalent) instances. The formula that we present admits sphere-worlds of arbitrary dimension and is directly applicable to configuration spaces whose forbidden regions can be modeled by such generalized discs. We have implemented these navigation functions on planar scenarios, and simulation results are provided throughout the paper. Disciplines Robotics Comments Copyright 1992 IEEE. Reprinted from IEEE Transactions on Robotics and Automation, Volume 8, Issue 5, October 1992, pages 501-518. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of the University of Pennsylvania's products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org. By choosing to view this document, you agree to all provisions of the copyright laws protecting it. NOTE: At the time of publication, Daniel Koditschek was affiliated with the University of Michigan. Currently, he is a faculty member at the School of Engineering of the University of Pennsylvania. This journal article is available at ScholarlyCommons: http://repository.upenn.edu/ese_papers/323
AmbiguityVis: Visualization of Ambiguity in Graph Layouts
(2016)

Node-link diagrams provide an intuitive way to explore networks and have inspired a large number of automated graph layout strategies that optimize aesthetic criteria. However, any particular drawing approach cannot fully satisfy all these criteria simultaneously, producing drawings with visual ambiguities that can impede the understanding of network structure. To bring attention to these potentially problematic areas present in the drawing, this paper presents a technique that highlights common types of visual ambiguities: ambiguous spatial relationships between nodes and edges, visual overlap between community structures, and ambiguity in edge bundling and metanodes. Metrics, including newly proposed metrics for abnormal edge lengths, visual overlap in community structures and node/edge aggregation, are proposed to quantify areas of ambiguity in the drawing. These metrics and others are then displayed using a heatmap-based visualization that provides visual feedback to developers of graph drawing and visualization approaches, allowing them to quickly identify misleading areas. The novel metrics and the heatmap-based visualization allow a user to explore ambiguities in graph layouts from multiple perspectives in order to make reasonable graph layout choices. The effectiveness of the technique is demonstrated through case studies and expert reviews.
Definition Extraction with LSTM Recurrent Neural Networks
(2016)

Definition extraction is the task to identify definitional sentences automatically from unstructured text. The task can be used in the aspects of ontology generation, relation extraction and question answering. Previous methods use handcraft features generated from the dependency structure of a sentence. During this process, only part of the dependency structure is used to extract features, thus causing information loss. We model definition extraction as a supervised sequence classification task and propose a new way to automatically generate sentence features using a Long Short-Term Memory neural network model. Our method directly learns features from raw sentences and corresponding part-ofspeech sequence, which makes full use of the whole sentence. We experiment on the Wikipedia benchmark dataset and obtain 91.2% on F1 score which outperforms the current state-of-the-art methods by 5.8%. We also show the effectiveness of our method in dealing with other languages by testing on a Chinese dataset and obtaining 85.7% on F1 score.
Path Planning with Phased Array SLAM and Voronoi Tessellation
(2006)

Autonomous vehicles must often navigate environments that are at least partially unknown. They are faced with the tasks of creating a coordinate system to localize themselves on, identify the positions of obstacles, and chart safe paths through the environment. This process is known as Simultaneous Localization and Mapping, or SLAM. SLAM has traditionally been executed using measurements of distance to features in the environment. We propose an angle based methodology using a single phased array antenna and DSP.aimed to reduce this requirement to a single path for each data type. Additionally, our method makes use of rudimentary echo-location to discover reflective obstacles. Finally, our method uses Voronoi Tessellation for path planning.
Word-Formation in English
(2003)

published by the press syndicate of the university of cambridge A catalogue record for this book is available from the British Library Library of Congress Cataloguing in Publication data Plag, Ingo. Word-formation in English / Ingo Plag. p. cm. – (Cambridge textbooks in linguistics) Includes bibliographical references (p.) and indexes. Contents Preface page xi Abbreviations and notational conventions xiii Introduction 1 1 Basic concepts 4 1.1 What is a word? 4 1.2 Studying word-formation 9 1.3 Inflection and derivation 14 1.4 Summary 17 Further reading 18 Exercises 18 2 Studying complex words 20 2.1 Identifying morphemes 20 2.1.1 The morpheme as the minimal linguistic sign 20 2.1.2 Problems with the morpheme: the mapping of form and meaning 22 2.2 Allomorphy 27 2.3 Establishing word-formation rules 30 2.4 Multiple affixation 38 2.5 Summary 41 Further reading 41 Exercises 41
Securing SMS Based One Time Password Technique from Man in the Middle Attack
(2014)

Security of financial transactions in E-Commerce is difficult to implement and there is a risk that user’s confidential data over the internet may be accessed by hackers. Unfortunately, interacting with an online service such as a banking web application often requires certain degree of technical sophistication that not all Internet users possess. For the last couple of year such naive users have been increasingly targeted by phishing attacks that are launched by miscreants who are aiming to make an easy profit by means of illegal financial transactions. In this paper, we have proposed an idea for securing e-commerce transaction from phishing attack. An approach already exists where phishing attack is prevented using one time password which is sent on user’s registered mobile via SMS for authentication. But this method can be counter attacked by “Man in the Middle”. In our paper, a new idea is proposed which is more secure compared to the existing online payment system using OTP. In this mechanism OTP is combined with the secure key and is then passed through RSA algorithm to generate the Transaction password. A Copy of this password is maintained at the server side and is being generated at the user side using a mobile application; so that it is not transferred over the insecure network leading to a fraudulent transaction. Keywords—Phishing, Replay attack, MITM attack, RSA, Random Generator.
Contingencies of self-worth.
(2001)

Research on self-esteem has focused almost exclusively on level of trait self-esteem to the neglect of other potentially more important aspects such as the contingencies on which self-esteem is based. Over a century ago, W. James (1890) argued that self-esteem rises and falls around its typical level in response to successes and failures in domains on which one has staked self-worth. We present a model of global self-esteem that builds on James' insights and emphasizes contingencies of self-worth. This model can help to (a) point the way to understanding how self-esteem is implicated in affect, cognition, and self-regulation of behavior; (b) suggest how and when self-esteem is implicated in social problems; (c) resolve debates about the nature and functioning of self-esteem; (d) resolve paradoxes in related literatures, such as why people who are stigmatized do not necessarily have low self-esteem and why self-esteem does not decline with age; and (e) suggest how self-esteem is causally related to depression. In addition, this perspective raises questions about how contingencies of self-worth are acquired and how they change, whether they are primarily a resource or a vulnerability, and whether some people have noncontingent self-esteem.
A cognitive-affective system theory of personality: reconceptualizing situations, dispositions, dynamics, and invariance in personality structure.
(1995)

A theory was proposed to reconcile paradoxical findings on the invariance of personality and the variability of behavior across situations. For this purpose, individuals were assumed to differ in (a) the accessibility of cognitive-affective mediating units (such as encodings, expectancies and beliefs, affects, and goals) and (b) the organization of relationships through which these units interact with each other and with psychological features of situations. The theory accounts for individual differences in predictable patterns of variability across situations (e.g., if A then she X, but if B then she Y), as well as for overall average levels of behavior, as essential expressions or behavioral signatures of the same underlying personality system. Situations, personality dispositions, dynamics, and structure were reconceptualized from this perspective.
AIVAT: A New Variance Reduction Technique for Agent Evaluation in Imperfect Information Games
(2017)

Evaluating agent performance when outcomes are stochastic and agents use randomized strategies can be challenging when there is limited data available. The variance of sampled outcomes may make the simple approach of Monte Carlo sampling inadequate. This is the case for agents playing heads-up no-limit Texas hold’em poker, where manmachine competitions typically involve multiple days of consistent play by multiple players, but still can (and sometimes did) result in statistically insignificant conclusions. In this paper, we introduce AIVAT, a low variance, provably unbiased value assessment tool that exploits an arbitrary heuristic estimate of state value, as well as the explicit strategy of a subset of the agents. Unlike existing techniques which reduce the variance from chance events, or only consider game ending actions, AIVAT reduces the variance both from choices by nature and by players with a known strategy. The resulting estimator produces results that significantly outperform previous state of the art techniques. It was able to reduce the standard deviation of a Texas hold’em poker man-machine match by 85% and consequently requires 44 times fewer games to draw the same statistical conclusion. AIVAT enabled the first statistically significant AI victory against professional poker players in no-limit hold’em. Furthermore, the technique was powerful enough to produce statistically significant results versus individual players, not just an aggregate pool of the players. We also used AIVAT to analyze a short series of AI vs human poker tournaments, producing statistical significant results with as few as 28 matches.
Methods of suicide: international suicide patterns derived from the WHO mortality database.
(2008)

OBJECTIVE
Accurate information about preferred suicide methods is important for devising strategies and programmes for suicide prevention. Our knowledge of the methods used and their variation across countries and world regions is still limited. The aim of this study was to provide the first comprehensive overview of international patterns of suicide methods.


METHODS
Data encoded according to the International Classification of Diseases (10th revision) were derived from the WHO mortality database. The classification was used to differentiate suicide methods. Correspondence analysis was used to identify typical patterns of suicide methods in different countries by providing a summary of cross-tabulated data.


FINDINGS
Poisoning by pesticide was common in many Asian countries and in Latin America; poisoning by drugs was common in both Nordic countries and the United Kingdom. Hanging was the preferred method of suicide in eastern Europe, as was firearm suicide in the United States and jumping from a high place in cities and urban societies such as Hong Kong Special Administrative Region, China. Correspondence analysis demonstrated a polarization between pesticide suicide and firearm suicide at the expense of traditional methods, such as hanging and jumping from a high place, which lay in between.


CONCLUSION
This analysis showed that pesticide suicide and firearm suicide replaced traditional methods in many countries. The observed suicide pattern depended upon the availability of the methods used, in particular the availability of technical means. The present evidence indicates that restricting access to the means of suicide is more urgent and more technically feasible than ever.
Active Contour Models for Extracting Ground and Forest Canopy Curves from Discrete Laser Altimeter Data
(2013)

The importance of finding efficient ways of quantifying terrestrial carbon stocks at a global scale has increased due to the concerns about global climate change. Exchange of carbon between forests and the atmosphere is a vital component of the global carbon cycle (Nelson et al. 2003). Recent advances in remote sensing technology have facilitated rapid and inexpensive measurements of topography over large areas (Zhang et al. 2003).
Managing Complexity in Aircraft Design Using Design Structure Matrix
(2011)

Modern aerospace systems have reached a level of complexity that requires systematic methods for their design. The development of products in aircraft industry involves numerous engineers from different disciplines working on independent components. Routine activities consume a significant part of aircraft development time. To be competitive, aircraft industry needs to manage complexity and readjust the ratio of innovative versus routine work. Thus, the main objective is to develop an approach that can manage complexity in engineering design, reduce the design cycle time, and reduce the product development cost. The design structure matrix (DSM) is a simple tool to perform both analysis and management of complex systems. It enables the user to model, visualize, and analyze the dependencies among the functional group of any system and derive suggestions for the improvement or synthesis of a system. This article illustrates with a case study how DSM can be used to manage complexity in aircraft design process. The result of implementing the DSM approach for Light Combat Aircraft (Navy) at Hindustan Aeronautics Limited, India, (in aircraft design) show primary benefits of 75% reduction in routine activities, 33% reduction in design cycle time, 50% reduction in rework cost, and 30% reduction in product and process development cost of aircraft.
Sub-event detection from tweets
(2017)

Social media plays an important role in communication between people in recent times. This includes information about news and events that are currently happening. Most of the research on event detection concentrates on identifying events from social media information. These models assume an event to be a single entity and treat it as such during the detection process. This assumption ignores that the composition of an event changes as new information is made available on social media. To capture the change in information over time, we extend an already existing Event Detection at Onset algorithm to study the evolution of an event over time. We introduce the concept of an event life cycle model that tracks various key events in the evolution of an event. The proposed unsupervised sub-event detection method uses a threshold-based approach to identify relationships between sub-events over time. These related events are mapped to an event life cycle to identify sub-events. We evaluate the proposed sub-event detection approach on a large-scale Twitter corpus.
Asynchronous Complex Analytics in a Distributed Dataflow Architecture
(2015)

Scalable distributed dataflow systems have recently experienced widespread adoption, with commodity dataflow engines such as Hadoop and Spark, and even commodity SQL engines routinely supporting increasingly sophisticated analytics tasks (e.g., support vector machines, logistic regression, collaborative filtering). However, these systems’ synchronous (often Bulk Synchronous Parallel) dataflow execution model is at odds with an increasingly important trend in the machine learning community: the use of asynchrony via shared, mutable state (i.e., data races) in convex programming tasks, which has—in a single-node context—delivered noteworthy empirical performance gains and inspired new research into asynchronous algorithms. In this work, we attempt to bridge this gap by evaluating the use of lightweight, asynchronous state transfer within a commodity dataflow engine. Specifically, we investigate the use of asynchronous sideways information passing (ASIP) that presents single-stage parallel iterators with a Volcano-like intra-operator iterator that can be used for asynchronous information passing. We port two synchronous convex programming algorithms, stochastic gradient descent and the alternating direction method of multipliers (ADMM), to use ASIPs. We evaluate an implementation of ASIPs within on Apache Spark that exhibits considerable speedups as well as a rich set of performance trade-offs in the use of these asynchronous algorithms.