SoroushVahidi/scidocs huggingface dataset:
The FuzzyLog: A Partially Ordered Shared Log
(2018)

The FuzzyLog is a partially ordered shared log abstraction. Distributed applications can concurrently append to the partial order and play it back. FuzzyLog applications obtain the benefits of an underlying shared log – extracting strong consistency, durability, and failure atomicity in simple ways – without suffering from its drawbacks. By exposing a partial order, the FuzzyLog enables three key capabilities for applications: linear scaling for throughput and capacity (without sacrificing atomicity), weaker consistency guarantees, and tolerance to network partitions. We present Dapple, a distributed implementation of the FuzzyLog abstraction that stores the partial order compactly and supports efficient appends / playback via a new ordering protocol. We implement several data structures and applications over the FuzzyLog, including several map variants as well as a ZooKeeper implementation. Our evaluation shows that these applications are compact, fast, and flexible: they retain the simplicity (100s of lines of code) and strong semantics (durability and failure atomicity) of a shared log design while exploiting the partial order of the FuzzyLog for linear scalability, flexible consistency guarantees (e.g., causal+ consistency), and network partition tolerance. On a 6-node Dapple deployment, our FuzzyLogbased ZooKeeper supports 3M/sec single-key writes, and 150K/sec atomic cross-shard renames.
Predictors of Relationship Satisfaction in Online Romantic Relationships
(2006)

Based on traditional theories of interpersonal relationship development and on the hyperpersonal communication theory, this study examined predictors of relationship satisfaction for individuals involved in online romantic relationships. One hundredfourteen individuals (N1⁄4114) involved in online romantic relationships, and who had only engaged in computer-mediated communication (CMC) with their partners, completed an online questionnaire about their relationships. Intimacy, trust, and communication satisfaction were found to be the strongest predictors of relationship satisfaction for individuals involved in online romances. Additionally, perceptions of relationship variables differed depending on relationship length and time spent communicating. Implications for interpersonal and hyperpersonal communication theories, and future investigation of online relationships, are discussed.
Impact of Corpora Quality on Neural Machine Translation
(2018)

Large parallel corpora that are automatically obtained from the web, documents or elsewhere often exhibit many corrupted parts that are bound to negatively affect the quality of the systems and models that learn from these corpora. This paper describes frequent problems found in data and such data affects neural machine translation systems, as well as how to identify and deal with them. The solutions are summarised in a set of scripts that remove problematic sentences from input corpora.
Computed tomographic analysis of tooth-bearing alveolar bone for orthodontic miniscrew placement.
(2009)

INTRODUCTION
When monocortical orthodontic miniscrews are placed in interdental alveolar bone, the safe position of the miniscrew tip should be ensured. This study was designed to quantify the periradicular space in the tooth-bearing area to provide practical guidelines for miniscrew placement.


METHODS
Computerized tomographs of 30 maxillae and mandibles were taken from nonorthodontic adults with normal occlusion. Both mesiodistal interradicular distance and bone thickness over the narrowest interradicular space (safety depth) were measured at 2, 4, 6, and 8 mm from the cementoenamel junction.


RESULTS
Mesiodistal space greater than 3 mm was available at the 8-mm level in the maxillary anterior region, between the premolars, and between the second premolar and the first molar at 4 mm. In the mandible, sufficient mesiodistal space was found between the premolars, between the molars, and between the second premolar and the first molar at the 4-mm level. Safety depth greater than 4 mm was found in the maxillary and mandibular intermolar regions, and between the second premolar and the first molar in both arches.


CONCLUSIONS
Subapical placement is advocated in the anterior segment. Premolar areas appear reliable in both arches. Angulated placement in the intermolar area is suggested to use the sufficient safety depth in this area.
Block Chain Technologies & The Semantic Web : A Framework for Symbiotic Development
(2015)

The concept of peer-to-peer applications is not new, nor is the concept of distributed hash tables. What emerged in 2008 with the publication of the Bitcoin white paper was an incentive structure that unified these two software paradigms with a set of economic stimuli to motivate the creation of a dedicated computing network orders of magnitude more powerful than the world’s fastest supercomputers. The purpose of which is the maintenance of a massive distributed database known as the Bitcoin “block chain”. Apart from the digital currency it enables, block chain technology is a fascinating new computing paradigm with broad implications for the future development of the World Wide Web, and by extension, the further growth of Linked Data and the Semantic Web. This work is divided into two main sections, we first demonstrate how block chain technologies can contribute toward the realization of a more robust Semantic Web, and subsequently we provide a framework wherein the Semantic Web is utilized to ameliorate block chain technology itself.
A survey of remote optical photoplethysmographic imaging methods
(2015)

In recent years researchers have presented a number of new methods for recovering physiological parameters using just low-cost digital cameras and image processing. The ubiquity of digital cameras presents the possibility for many new, low-cost applications of vital sign monitoring. In this paper we present a review of the work on remote photoplethysmographic (PPG) imaging using digital cameras. This review specifically focuses on the state-of-the-art in PPG imaging where: 1) measures beyond pulse rate are evaluated, 2) non-ideal conditions (e.g., the presence of motion artifacts) are explored, and 3) use cases in relevant environments are demonstrated. We discuss gaps within the literature and future challenges for the research community. To aid in the continuing advancement of PPG imaging research, we are making available a website with the references collected for this review as well as information on available code and datasets of interest. It is our hope that this website will become a valuable resource for the PPG imaging community. The site can be found at: http://web.mit.edu/~djmcduff/www/ remote-physiology.html.
Non-contact, automated cardiac pulse measurements using video imaging and blind source separation.
(2010)

Remote measurements of the cardiac pulse can provide comfortable physiological assessment without electrodes. However, attempts so far are non-automated, susceptible to motion artifacts and typically expensive. In this paper, we introduce a new methodology that overcomes these problems. This novel approach can be applied to color video recordings of the human face and is based on automatic face tracking along with blind source separation of the color channels into independent components. Using Bland-Altman and correlation analysis, we compared the cardiac pulse rate extracted from videos recorded by a basic webcam to an FDA-approved finger blood volume pulse (BVP) sensor and achieved high accuracy and correlation even in the presence of movement artifacts. Furthermore, we applied this technique to perform heart rate measurements from three participants simultaneously. This is the first demonstration of a low-cost accurate video-based method for contact-free heart rate measurements that is automated, motion-tolerant and capable of performing concomitant measurements on more than one person at a time.
Mobile monitoring with wearable photoplethysmographic biosensors.
(2003)

earable biosensors (WBS) will permit continuous cardiovascular (CV) monitoring in a number of novel settings. Benefits may be realized in the diagnosis and treatment of a number of major diseases. WBS, in conjunction with appropriate alarm algorithms, can increase surveillance capabilities for CV catastrophe for high-risk subjects. WBS could also play a role in the treatment of chronic diseases, by providing information that enables precise titration of therapy or detecting lapses in patient compliance. WBS could play an important role in the wireless surveillance of people during hazardous operations (military, fire-fighting, etc.), or such sensors could be dispensed during a mass civilian casualty occurrence. Given that CV physio-logic parameters make up the " vital signs " that are the most important information in emergency medical situations, WBS might enable a wireless monitoring system for large numbers of at-risk subjects. This same approach may also have utility in monitoring the waiting room of today's overcrowded emergency departments. For hospital inpatients who require CV monitoring, current biosensor technology typically tethers patients in a tangle of cables, whereas wearable CV sensors could increase inpatient comfort and may even reduce the risk of tripping and falling, a perennial problem for hospital patients who are ill, medicated, and in an unfamiliar setting. On a daily basis, wearable CV sensors could detect a missed dose of medication by sensing untreated elevated blood pressure and could trigger an automated reminder for the patient to take the medication. Moreover, it is important for doctors to titrate the treatment of high blood pressure, since both insufficient therapy as well as excessive therapy (leading to abnormally low blood pressures) increase mortality. However, healthcare providers have only intermittent values of blood pressure on which to base therapy decisions; it is possible that continuous blood pressure monitoring would permit enhanced titration of therapy and reductions in mortality. Similarly, WBS would be able to log the physiologic signature of a patient's exercise efforts (manifested as changes in heart rate and blood pressure), permitting the patient and healthcare provider to assess compliance with a regimen proven to improve health outcomes. For patients with chronic cardiovascular disease, such as heart failure, home monitoring employing WBS may detect exacerbations in very early (and often easily treated) stages, long before the patient progresses to more dangerous levels that necessitate an emergency room visit and costly hospital admission. In this article we will address both technical and clinical …
An extended set of Haar-like features for rapid object detection
(2002)

Recently Viola et al. [5] have introduced a rapid object detection scheme based on a boosted cascade of simple features. In this paper we introduce a novel set of rotated haar-like features, which significantly enrich this basic set of simple haar-like features and which can also be calculated very efficiently. At a given hit rate our sample face detector shows off on average a 10% lower false alarm rate by means of using these additional rotated features. We also present a novel post optimization procedure for a given boosted cascade improving on average the false alarm rate further by 12.5%. Using both enhancements the number of false detections is only 24 at a hit rate of 82.3% on the CMU face set [7].
Recovering pulse rate during motion artifact with a multi-imager array for non-contact imaging photoplethysmography
(2014)

Photoplethysmography relies on characteristic changes in the optical absorption of tissue due to pulsatile (arterial) blood flow in peripheral vasculature. Sensors for observing the photoplethysmographic effect have traditionally required contact with the skin surface. Recent advances in non-contact imaging photoplethysmography have demonstrated that measures of cardiopulmonary system state, such as pulse rate, pulse rate variability, and respiration rate, can be obtained from a participant by imaging their face under relatively motionless conditions. A critical limitation in this method that must be resolved is the inability to recover these measures under conditions of head motion artifact. To investigate the adequacy of channel space dimensionality for the use of blind source separation in this context, nine synchronized, visible spectrum imagers positioned in a semicircular array centered on the imaged participant were used for data acquisition in a controlled lighting environment. Three-lead electrocardiogram and finger-tip reflectance photoplethysmogram were also recorded as ground truth signals. Controlled head motion artifact trial conditions were compared to trials in which the participant remained stationary, with and without the aid of a chinrest. Bootstrapped means of one-minute, non-overlapping trial segments show that, for situations involving little to no head motion, a single imager is sufficient for recovering pulse rate with an average absolute error of less than two beats per minute. However, error in the recovered pulse rate measurement for the single imager can be as high as twenty-two beats per minute when head motion artifact is severe. This increase in measurement error during motion artifact was mitigated by increasing the dimensionality of the imager channel space with multiple imagers in the array prior to applying blind source separation. In contrast to single-imager results, the multi-imager channel space resulted in an absolute error in the recovered pulse rate measurement that is comparable with pulse rate measured via fingertip reflectance photoplethysmography. These results demonstrate that non-contact, imaging photoplethysmography can be accurate in the presence of head motion artifact when a multi-imager array is implemented to increase the dimensionality of the decomposed channel space.
Inverse Risk-Sensitive Reinforcement Learning
(2017)

We address the problem of inverse reinforcement learning in Markov decision processes where the agent is risk-sensitive. We derive a risk-sensitive reinforcement learning algorithm with convergence guarantees that employs convex risk metrics and models of human decisionmaking deriving from behavioral economics. The risk-sensitive reinforcement learning algorithm provides the theoretical underpinning for a gradient-based inverse reinforcement learning algorithm that minimizes a loss function defined on observed behavior of a risk-sensitive agent. We demonstrate the performance of the proposed technique on two examples: (i) the canonical Grid World example and (ii) a Markov decision process modeling ride-sharing passengers’ decisions given price changes. In the latter, we use pricing and travel time data from a ride-sharing company to construct the transition probabilities and rewards of the Markov decision process.
Minimization of symbolic automata
(2014)

Symbolic Automata extend classical automata by using symbolic alphabets instead of finite ones. Most of the classical automata algorithms rely on the alphabet being finite, and generalizing them to the symbolic setting is not a trivial task. In this paper we study the problem of minimizing symbolic automata. We formally define and prove the basic properties of minimality in the symbolic setting, and lift classical minimization algorithms (Huffman-Moore's and Hopcroft's algorithms) to symbolic automata. While Hopcroft's algorithm is the fastest known algorithm for DFA minimization, we show how, in the presence of symbolic alphabets, it can incur an exponential blowup. To address this issue, we introduce a new algorithm that fully benefits from the symbolic representation of the alphabet and does not suffer from the exponential blowup. We provide comprehensive performance evaluation of all the algorithms over large benchmarks and against existing state-of-the-art implementations. The experiments show how the new symbolic algorithm is faster than previous implementations.
An Empirical Evaluation of True Online TD({\lambda})
(2015)

The true online TD(λ) algorithm has recently been proposed (van Seijen and Sutton, 2014) as a universal replacement for the popular TD(λ) algorithm, in temporal-difference learning and reinforcement learning. True online TD(λ) has better theoretical properties than conventional TD(λ), and the expectation is that it also results in faster learning. In this paper, we put this hypothesis to the test. Specifically, we compare the performance of true online TD(λ) with that of TD(λ) on challenging examples, random Markov reward processes, and a real-world myoelectric prosthetic arm. We use linear function approximation with tabular, binary, and non-binary features. We assess the algorithms along three dimensions: computational cost, learning speed, and ease of use. Our results confirm the strength of true online TD(λ): 1) for sparse feature vectors, the computational overhead with respect to TD(λ) is minimal; for non-sparse features the computation time is at most twice that of TD(λ), 2) across all domains/representations the learning speed of true online TD(λ) is often better, but never worse than that of TD(λ), and 3) true online TD(λ) is easier to use, because it does not require choosing between trace types, and it is generally more stable with respect to the step-size. Overall, our results suggest that true online TD(λ) should be the first choice when looking for an efficient, general-purpose TD method.
Cause related marketing campaigns and consumer purchase intentions : The mediating role of brand awareness and corporate image
(2010)

The purpose of this research is to investigate the kind of relationship between Cause Related Marketing (CRM) campaigns, brand awareness and corporate image as possible antecedents of consumer purchase intentions in the less developed country of Pakistan. An initial conceptualization was developed from mainstream literature to be validated through empirical research. The conceptualization was then tested with primary quantitative survey data collected from 203 students studying in different universities of Rawalpindi and Islamabad. Correlation and regression analysis were used to test the key hypothesis derived from literature positing brand awareness and corporate image as mediating the relationship between CRM and consumer purchase intentions. The findings indicate that consumer purchase intentions are influenced by the cause related marketing campaigns. Furthermore it was observed that the brand awareness and corporate image partially mediate the impact of CRM campaigns on consumer purchase intentions. The data was gathered from universities situated in Rawalpindi and Islamabad only. Hence, future research could extend these findings to other cities in Pakistan to test their generalizability. Further research can be carried out through data collection from those people who actually participated in cause related marketing campaigns to identify the original behavior of customers instead of their purchase intentions. This research and the claims made are limited to the FMCG industry. The key implications cause related marketing of these findings for marketing managers lend support for the use of campaigns in Pakistan. The findings also suggest some measures which can be taken in to consideration in order to enhance brand awareness and to improve corporate image as both variables mediate the impact of CRM campaigns on consumer purchase intentions. The study contributes to cause related marketing literature by indicating a mediating role of brand awareness and corporate image on CRM campaigns and consumer purchase intentions. This mediating role was ignored in previous studies. Moreover, it contributes to close the gap of empirical research in this field, which exists particularly due to the diverse attitude of customers in less developed countries such as Pakistan.
Loosecut: Interactive image segmentation with loosely bounded boxes
(2017)

One popular approach to interactively segment an object of interest from an image is to annotate a bounding box that covers the object, followed by a binary labeling. However, the existing algorithms for such interactive image segmentation prefer a bounding box that tightly encloses the object. This increases the annotation burden, and prevents these algorithms from utilizing automatically detected bounding boxes. In this paper, we develop a new LooseCut algorithm that can handle cases where the bounding box only loosely covers the object. We propose a new Markov Random Fields (MRF) model for segmentation with loosely bounded boxes, including an additional energy term to encourage consistent labeling of similar-appearance pixels and a global similarity constraint to better distinguish the foreground and background. This MRF model is then solved by an iterated max-flow algorithm. We evaluate LooseCut in three public image datasets, and show its better performance against several state-of-the-art methods when increasing the bounding-box size.
Morphological Smoothing and Extrapolation of Word Embeddings
(2016)

Languages with rich inflectional morphology exhibit lexical data sparsity, since the word used to express a given concept will vary with the syntactic context. For instance, each count noun in Czech has 12 forms (where English uses only singular and plural). Even in large corpora, we are unlikely to observe all inflections of a given lemma. This reduces the vocabulary coverage of methods that induce continuous representations for words from distributional corpus information. We solve this problem by exploiting existing morphological resources that can enumerate a word’s component morphemes. We present a latentvariable Gaussian graphical model that allows us to extrapolate continuous representations for words not observed in the training corpus, as well as smoothing the representations provided for the observed words. The latent variables represent embeddings of morphemes, which combine to create embeddings of words. Over several languages and training sizes, our model improves the embeddings for words, when evaluated on an analogy task, skip-gram predictive accuracy, and word similarity.
K-Automorphism: A General Framework For Privacy Preserving Network Publication
(2009)

The growing popularity of social networks has generated interesting data management and data mining problems. An important concern in the release of these data for study is their privacy, since social networks usually contain personal information. Simply removing all identifiable personal information (such as names and social security number) before releasing the data is insufficient. It is easy for an attacker to identify the target by performing different structural queries. In this paper we propose k-automorphism to protect against multiple structural attacks and develop an algorithm (called KM) that ensures k-automorphism. We also discuss an extension of KM to handle “dynamic” releases of the data. Extensive experiments show that the algorithm performs well in terms of protection it provides.