SoroushVahidi/scidocs huggingface dataset:
A Comparative Study of Data Clustering Algorithms
(2013)

Data clustering is a process of partitioning data points into meaningful clusters such that a cluster holds similar data and different clusters hold dissimilar data. It is an unsupervised approach to classify data into different patterns. In general, the clustering algorithms can be classified into the following two categories: firstly, hard clustering, where a data object can belong to a single and distinct cluster and secondly, soft clustering, where a data object can belong to different clusters. In this report we have made a comparative study of three major data clustering algorithms highlighting their merits and demerits. These algorithms are: k-means, fuzzy c-means and K-NN clustering algorithm. Choosing an appropriate clustering algorithm for grouping the data takes various factors into account for illustration one is the size of data to be partitioned.
A low-Cost, Open-Source, BCI- VR Game Control Development Environment Prototype for Game Based Neurorehabilitation
(2018)

In this paper we present a low-cost and open-source brain-computer interface (BCI) virtual-reality (VR) Game Control Development Environment prototype, which we demonstrate using real-time signal processing of Electroencephalography (EEG) event-related desynchronization and synchronization changes (ERD/ERS) within the Precentral Gyrus (Motor Cortex), allowing a user to control a 3D object within a Virtual Reality Environment. This BCI-VR system prototype was functionally tested on multiple participants and demonstrated live before an audience during the 2017 ‘Hack the Brain’ at the Dublin Science Gallery. The availability of such an open-source, effective, BCI-VR Game Control Development Environment, at a level acceptable for industry experimentation, has the potential to open up this field to a much wider range of researchers and games developers and to assist the investigation of gaming experiences which both incorporate the specific control features available through BCI as a core element of the game play and the potential for its use in neurorehabilitation.
Self-esteem and perceived regard: how I see myself affects my relationship satisfaction.
(2009)

The authors explored the relations among self-esteem, perceived regard, and satisfaction in dating relationships. On the basis of the dependency regulation model (T. DeHart, B. Pelham, & S. Murray, 2004), the authors hypothesized that self-esteem would influence individuals' self-perceptions and views of how their partners perceive them (metaperception). They also hypothesized that perceived regard (self-perception minus metaperception) would predict relationship satisfaction. Regression analyses indicated that for moderate relationship-relevant traits (i.e., caring, loving), high self-esteem was associated with self-enhancement (idealization), whereas low self-esteem was associated with self-deprecation. For low relationship-relevant traits (i.e., quiet, reserved), both low and high self-esteem individuals self-enhanced. Hierarchical regression analyses indicated that self-esteem and perceived regard for moderate relationship-relevant traits predicted satisfaction. The authors discuss the implications of idealization, self-verification, and self-deprecation for the perceivers and their relationships.
A systematic survey on automated concurrency bug detection, exposing, avoidance, and fixing techniques
(2017)

Currently, concurrent programs are becoming increasingly widespread to meet the demands of the rapid development of multi-core hardware. However, it could be quite expensive and challenging to guarantee the correctness and efficiency of concurrent programs. In this paper, we provide a systematic review of the existing research on fighting against concurrency bugs, including automated concurrency bug exposing, detection, avoidance, and fixing. These four categories cover the different aspects of concurrency bug problems and are complementary to each other. For each category, we survey the motivation, key issues, solutions, and the current state of the art. In addition, we summarize the classical benchmarks widely used in previous empirical studies and the contribution of active research groups. Finally, some future research directions on concurrency bugs are recommended. We believe this survey would be useful for concurrency programmers and researchers.
[Skin signs in child abuse].
(2012)

Child abuse is far more prevalent today than is generally recognized. Up to 90% of victims suffer physical abuse that can be observed in signs on the skin. Dermatologists are particularly qualified to identify these signs and distinguish them from other conditions that can mimic abuse. This review covers the signs of child abuse that can be observed on the skin. We discuss clues that can help differentiate between lesions caused by abuse and those that are accidental, and we describe the skin conditions that mimic physical abuse.
Survey on 3D Hand Gesture Recognition
(2016)

Three-dimensional hand gesture recognition has attracted increasing research interests in computer vision, pattern recognition, and human-computer interaction. The emerging depth sensors greatly inspired various hand gesture recognition approaches and applications, which were severely limited in the 2D domain with conventional cameras. This paper presents a survey of some recent works on hand gesture recognition using 3D depth sensors. We first review the commercial depth sensors and public data sets that are widely used in this field. Then, we review the state-of-the-art research for 3D hand gesture recognition in four aspects: 1) 3D hand modeling; 2) static hand gesture recognition; 3) hand trajectory gesture recognition; and 4) continuous hand gesture recognition. While the emphasis is on 3D hand gesture recognition approaches, the related applications and typical systems are also briefly summarized for practitioners.
Model-Driven ERP Implementation
(2006)

Enterprise Resource Planning (ERP) implementations are very complex. To obtain a fair level of understanding of the system, it is then necessary to model the supported business processes. However, the problem is the accuracy of the mapping between this model and the actual technical implementation. A solution is to make use of the OMG’s Model-Driven Architecture (MDA) framework. In fact, this framework lets the developer model his system at a high abstraction level and allows the MDA tool to generate the implementation details. This paper presents our results in applying the MDA framework to ERP implementation based on a high level model of the business processes. Then, we show how our prototype is structured and implemented in the IBM/Rational XDE environment
A General Divide and Conquer Approach for Process Mining
(2013)

Operational processes leave trails in the information systems supporting them. Such event data are the starting point for process mining – an emerging scientific discipline relating modeled and observed behavior. The relevance of process mining is increasing as more and more event data become available. The increasing volume of such data (“Big Data”) provides both opportunities and challenges for process mining. In this paper we focus on two particular types of process mining: process discovery (learning a process model from example behavior recorded in an event log) and conformance checking (diagnosing and quantifying discrepancies between observed behavior and modeled behavior). These tasks become challenging when there are hundreds or even thousands of different activities and millions of cases. Typically, process mining algorithms are linear in the number of cases and exponential in the number of different activities. This paper proposes a very general divide-and-conquer approach that decomposes the event log based on a partitioning of activities. Unlike existing approaches, this paper does not assume a particular process representation (e.g., Petri nets or BPMN) and allows for various decomposition strategies (e.g., SESEor passage-based decomposition). Moreover, the generic divide-andconquer approach reveals the core requirements for decomposing process discovery and conformance checking problems.
Survey of Consistent Network Updates
(2016)

Computer networks have become a critical infrastructure. As such, networks should not only meet strict requirements in terms of correctness, availability, and performance, but they should also be very flexible and support fast updates, e.g., due to a change in the security policy, increasing traffic, or failures. In this paper, we present a structured survey of mechanisms and protocols to update computer networks in a fast and consistent manner. In particular, we identify and discuss the different desirable consistency properties that should be provided throughout a network update, the algorithmic techniques which are needed to meet these consistency properties, and the implications on the speed and costs at which updates can be performed. We also explain the relationship between consistent network update problems and classic algorithmic optimization ones. While our survey is mainly motivated by the advent of Software-Defined Networks (SDNs) and their primary need for correct and efficient update techniques, the fundamental underlying problems are not new, and we provide a historical perspective of the subject as well. CCS Concepts: rGeneral and reference → Surveys and overviews; rNetworks → Network algorithms; rComputer systems organization→ Distributed architectures;
Supervised Bilingual Lexicon Induction with Multiple Monolingual Signals
(2013)

Prior research into learning translations from source and target language monolingual texts has treated the task as an unsupervised learning problem. Although many techniques take advantage of a seed bilingual lexicon, this work is the first to use that data for supervised learning to combine a diverse set of signals derived from a pair of monolingual corpora into a single discriminative model. Even in a low resource machine translation setting, where induced translations have the potential to improve performance substantially, it is reasonable to assume access to some amount of data to perform this kind of optimization. Our work shows that only a few hundred translation pairs are needed to achieve strong performance on the bilingual lexicon induction task, and our approach yields an average relative gain in accuracy of nearly 50% over an unsupervised baseline. Large gains in accuracy hold for all 22 languages (low and high resource) that we investigate.
HEVC/H.265 vs. VP9 state-of-the-art video coding comparison for HD and UHD applications
(2017)

High Efficiency Video Coding (HEVC) and VP9 are the latest state-of-the-art high-efficiency video coding standards. Both standards aim to decrease the bit-rate while improving the compression efficiency. HEVC/H.265 video standard was collaboratively developed by ITU-T and ISO/IEC with up to 50% bit-rate reduction as compared to its predecessor H.264/AVC. On the other hand, VP9 is an open source video standard developed by Google. While maintaining the same video quality, VP9 has achieved 50% bit-rate reduction as compared to its predecessor VP8. This research paper focuses on the comparison of HEVC and VP9 based on both subjective as well as objective assessments. First, detailed differences in design and specification of the two standards are discussed. Later experiment results are provided, which compare the coding efficiency of both standards on various high-definition 720p, 1090p, and 2160p sample test bench videos. According to our experimental results, it has been empirically proved that HEVC/H.265 outperforms VP9 in bit-rate savings.
The Narrative Advantage : Gender and the Language of Crowdfunding
(2015)

In this study, we set out to examine the role of language in the success of online fundraising—a new form of entrepreneurial project financing. In particular, we evaluate the influence of linguistic content on fundraising outcomes, above and beyond type of product or service offered. Online fundraising settings pose an interesting empirical puzzle: women are systematically more successful than men, an outcome contrary to offline gender inequality. We propose that this outcome is partially explained by linguistic differences between men and women in terms of language they use, and we test this mechanism using data from the online crowdfunding platform Indiegogo. The results support our theory, suggesting a link between micro-level linguistic choices and macro level outcomes: the institution of crowdfunding may reduce gender inequalities in the fundraising arena by benefitting the communication style of women.
Low voltage sub-nanosecond pulsed current driver IC for high-resolution LIDAR applications
(2018)

This paper introduces a new low voltage sub-nanosecond monolithic pulsed current driver for light detection and ranging (LIDAR) applications. Unique architecture based on a controlled current source and Vernier activation sequence, combined with a monolithic implementation that allows operation with low input voltage levels, high-resolution pulse width and sub-nanosecond rise and fall times. An on-chip low voltage pulsed driver sub-nanosecond prototype has been implemented in a TS 0.18-μm 5V-gated power management process. It incorporates an integrated wide range sesnseFET based current sensor and a rail-to-rail comparator for current regulation. To characterize the avalanche capabilities of the integrated lateral MOSFET power devices required for the driver IC, a separate line of investigation has been carried out. Several lateral diffused MOS (LDMOS) power devices have been custom designed and experimentally evaluated for a life-cycle performance characterization. Post-layout analysis of the power driver IC is in a good agreement with the theoretical predictions. For a 5V input voltage, rise and fall times of the laser pulse light output are on the order of hundreds of picoseconds, with currents up to 5A. To validate the concept of high-resolution pulse width generation and short fall time, a discrete prototype has been constructed and experimentally tested.
Semi-Paired Discrete Hashing: Learning Latent Hash Codes for Semi-Paired Cross-View Retrieval
(2017)

Due to the significant reduction in computational cost and storage, hashing techniques have gained increasing interests in facilitating large-scale cross-view retrieval tasks. Most cross-view hashing methods are developed by assuming that data from different views are well paired, e.g., text-image pairs. In real-world applications, however, this fully-paired multiview setting may not be practical. The more practical yet challenging semi-paired cross-view retrieval problem, where pairwise correspondences are only partially provided, has less been studied. In this paper, we propose an unsupervised hashing method for semi-paired cross-view retrieval, dubbed semi-paired discrete hashing (SPDH). In specific, SPDH explores the underlying structure of the constructed common latent subspace, where both paired and unpaired samples are well aligned. To effectively preserve the similarities of semi-paired data in the latent subspace, we construct the cross-view similarity graph with the help of anchor data pairs. SPDH jointly learns the latent features and hash codes with a factorization-based coding scheme. For the formulated objective function, we devise an efficient alternating optimization algorithm, where the key binary code learning problem is solved in a bit-by-bit manner with each bit generated with a closed-form solution. The proposed method is extensively evaluated on four benchmark datasets with both fully-paired and semi-paired settings and the results demonstrate the superiority of SPDH over several other state-of-the-art methods in term of both accuracy and scalability.
Exploration and apprenticeship learning in reinforcement learning
(2005)

We consider reinforcement learning in systems with unknown dynamics. Algorithms such as E3 (Kearns and Singh, 2002) learn near-optimal policies by using "exploration policies" to drive the system towards poorly modeled states, so as to encourage exploration. But this makes these algorithms impractical for many systems; for example, on an autonomous helicopter, overly aggressive exploration may well result in a crash. In this paper, we consider the apprenticeship learning setting in which a teacher demonstration of the task is available. We show that, given the initial demonstration, no explicit exploration is necessary, and we can attain near-optimal performance (compared to the teacher) simply by repeatedly executing "exploitation policies" that try to maximize rewards. In finite-state MDPs, our algorithm scales polynomially in the number of states; in continuous-state linear dynamical systems, it scales polynomially in the dimension of the state. These results are proved using a martingale construction over relative losses.
Simple, Accurate, and Robust Nonparametric Blind Super-Resolution
(2015)

This paper proposes a simple, accurate, and robust approach to single image nonparametric blind Super-Resolution (SR). This task is formulated as a functional to be minimized with respect to both an intermediate super-resolved image and a nonparametric blur-kernel. The proposed approach includes a convolution consistency constraint which uses a non-blind learning-based SR result to better guide the estimation process. Another key component is the unnatural bi-l0-l2-norm regularization imposed on the super-resolved, sharp image and the blur-kernel, which is shown to be quite beneficial for estimating the blur-kernel accurately. The numerical optimization is implemented by coupling the splitting augmented Lagrangian and the conjugate gradient (CG). Using the pre-estimated blur-kernel, we finally reconstruct the SR image by a very simple non-blind SR method that uses a natural image prior. The proposed approach is demonstrated to achieve better performance than the recent method by Michaeli and Irani [2] in both terms of the kernel estimation accuracy and image SR quality.
The Role of the Gut Microbiota in Childhood Obesity.
(2016)

BACKGROUND
Childhood and adolescent obesity has reached epidemic proportions worldwide. The pathogenesis of obesity is complex and multifactorial, in which genetic and environmental contributions seem important. The gut microbiota is increasingly documented to be involved in the dysmetabolism associated with obesity.


METHODS
We conducted a systematic search for literature available before October 2015 in the PubMed and Scopus databases, focusing on the interplay between the gut microbiota, childhood obesity, and metabolism.


RESULTS
The review discusses the potential role of the bacterial component of the human gut microbiota in childhood and adolescent-onset obesity, with a special focus on the factors involved in the early development of the gut bacterial ecosystem, and how modulation of this microbial community might serve as a basis for new therapeutic strategies in combating childhood obesity. A vast number of variables are influencing the gut microbial ecology (e.g., the host genetics, delivery method, diet, age, environment, and the use of pre-, pro-, and antibiotics); but the exact physiological processes behind these relationships need to be clarified.


CONCLUSIONS
Exploring the role of the gut microbiota in the development of childhood obesity may potentially reveal new strategies for obesity prevention and treatment.
Determination of the plan of the A Famosa Fortress , Malaysia
(2009)

The “A Famosa Fortress” is one of the oldest partially extant European buildings in Malaysia. It was built in 1511 by the Portuguese and went through several architectural developments and changes before being largely destroyed during the British occupation in 1824. With the subsequent overbuilding of the site by Melaka city today, it is impossible to fully reconstruct this fortress in its physical context. In this paper, we focus on determining the fortress layout based on various textual descriptions and old drawings and plans in preparation to building a detailed 3-D digital model. We have identified several important issues arising from the lack of any authoritative documentation. Such plans as exist not only differ in their depiction of the fort, but also use various ancient measurement systems. The paper gives examples of these problems and shows how a verifiable conjectural layout has been constructed. This is then compared against such archaeological evidence as is currently available. We are not aware of any previously published attempt to verify the consistency, similarity and integrity of the documentary data.
Learning effective Gait features using LSTM
(2016)

Human gait is an important biometric feature for person identification in surveillance videos because it can be collected at a distance without subject cooperation. Most existing gait recognition methods are based on Gait Energy Image (GEI). Although the spatial information in one gait sequence can be well represented by GEI, the temporal information is lost. To solve this problem, we propose a new feature learning method for gait recognition. Not only can the learned feature preserve temporal information in a gait sequence, but it can also be applied to cross-view gait recognition. Heatmaps extracted by a convolutional neutral network (CNN) based pose estimate method are used to describe the gait information in one frame. To model a gait sequence, the LSTM recurrent neural network is naturally adopted. Our LSTM model can be trained with unlabeled data, where the identity of the subject in a gait sequence is unknown. When labeled data are available, our LSTM works as a frame to frame view transformation model (VTM). Experiments on a gait benchmark demonstrate the efficacy of our method.
Supervised Representation Learning for Audio Scene Classification
(2017)

This paper investigates the use of supervised feature learning approaches for extracting relevant and discriminative features from acoustic scene recordings. Owing to the recent release of open datasets for acoustic scene classification problems, representation learning techniques can now be envisioned for solving the problem of feature extraction. This paper makes a step toward this goal by first introducing a supervised nonnegative matrix factorization SNMF. Our goal through this SNMF is to induce the matrix decomposition to carry out discriminative information in addition to the usual generative ones. We achieve this objective by augmenting the nonnegative matrix factorization optimization problem with a novel loss function related to class labels of each column of the matrix to decompose. While the scale of the datasets available is still small compared to those available in computer vision, we have studied models based on convolutional neural networks. We have analyzed the performances of these models on the DCASE-16 dataset and a corrected version of the LITIS Rouen one. Our experiments show that despite the small-scale setting, supervised feature learning is favorably competitive compared to the current state-of-the-art features. We also point out that for smaller scale dataset, SNMF is indeed slightly less prone to overfitting than convolutional neural networks. While the performances of these learned features are interesting per se, a deeper analysis of their behavior in the acoustic scene problem context raises open and difficult questions that we believe, need to be addressed for further performance breakthroughs.