SoroushVahidi/scidocs huggingface dataset:
The Ontogenesis of Social Dominance : A Strategy-Based Evolutionary Perspective
(1999)

Social dominance results when members of a social group vary in their ability to acquire resources in the presence of others (i.e., compete). Traditional approaches to social dominance often emphasize coercive behavior, but nonetheless suggest that dominant individuals are socially central (e.g., watched, attractive social partners). These patterns, however, apply to humans only up to a certain age. This apparent discontinuity may give the false impression that social dominance is less relevant to human social organization than it is to animal social organization. This paper reintroduces the ethological concept of social dominance, but reinterprets it from a strategy-based perspective. That is, if social dominance is defined as differential ability to control resources—without reference to how this is done—then children evidently employ different strategies to compete with peers (e.g., coercive and prosocial). Furthermore, the type of strategy children employ and peers’ responses to it depend largely on the ages of the children. By adopting a strategy-based approach to social dominance and explicitly incorporating developmental processes and uniquely human capacities, human social dominance patterns appear to be more similar to primate patterns than commonly believed. Implications for social competence, peer relationships, and the development of the self are discussed.  1999
PaDNet: Pan-Density Crowd Counting
(2018)

Crowd counting in varying density scenes is a challenging problem in artificial intelligence (AI) and pattern recognition. Recently, deep convolutional neural networks (CNNs) are used to tackle this problem. However, the single-column CNN cannot achieve high accuracy and robustness in diverse density scenes. Meanwhile, multi-column CNNs lack effective way to accurately learn the features of different scales for estimating crowd density. To address these issues, we propose a novel pan-density level deep learning model, named as Pan-Density Network (PaDNet). Specifically, the PaDNet learns multi-scale features by three steps. First, several sub-networks are pre-trained on crowd images with different density-levels. Then, a Scale Reinforcement Net (SRN) is utilized to reinforce the scale features. Finally, a Fusion Net fuses all of the scale features to generate the final density map. Experiments on four crowd counting benchmark datasets, the ShanghaiTech, the UCF CC 50, the UCSD, and the UCF-QRNF, indicate that the PaDNet achieves the best performance and has high robustness in pan-density crowd counting compared with other state-of-the-art algorithms.
Offline handwritten signature verification — Literature review
(2017)

The area of Handwritten Signature Verification has been broadly researched in the last decades, but remains an open research problem. The objective of signature verification systems is to discriminate if a given signature is genuine (produced by the claimed individual), or a forgery (produced by an impostor). This has demonstrated to be a challenging task, in particular in the offline (static) scenario, that uses images of scanned signatures, where the dynamic information about the signing process is not available. Many advancements have been proposed in the literature in the last 5–10 years, most notably the application of Deep Learning methods to learn feature representations from signature images. In this paper, we present how the problem has been handled in the past few decades, analyze the recent advancements in the field, and the potential directions for future research.
Improving MQTT by Inclusion of Usage Control
(2017)

Due to the increasing pervasiveness of Internet of Things (IoT) and Internet of Everything (IoE) devices, securing both their communications and operations has become of capital importance. Among the several existing IoT protocols, Message Queue Telemetry Transport (MQTT) is a widely-used general purpose one, usable in both constrained and powerful devices, which coordinates data exchanges through a publish/subscribe approach. In this paper, we propose a methodology to increase the security of the MQTT protocol, by including Usage Control in its operative workflow. The inclusion of usage control enables a fine-grained dynamic control of the rights of subscribers to access data and data-streams over time, by monitoring mutable attributes related to the subscriber, the environment or data itself. We will present the architecture and workflow of MQTT enhanced through Usage Control, also presenting a real implementation on Raspberry Pi 3 for performance
A three-phase ZVS PWM DC/DC converter with asymmetrical duty cycle associated with a three-phase version of the hybridge rectifier
(2005)

This paper proposes the use of a three-phase version of the hybridge rectifier in the three-phase zero-voltage switch (ZVS) DC/DC converter with asymmetrical duty cycle. The use of this new rectifier improves the efficiency of the converter because only three diodes are responsible for the conduction losses in the secondary side. The current in the secondary side of the transformer is half the output current. In addition to this, all the advantages of the three-phase DC/DC converter, i.e., the increased frequency of the output and input currents, the improved distribution of the losses, as well as the soft commutation for a wide load range, are preserved. Therefore, the resulting topology is capable of achieving high efficiency and high power density at high power levels. The theoretical analysis, simulation, and experimental results obtained from a 6-kW prototype, and also a comparison of the efficiency of this converter with the full-bridge rectifier are presented.
Towards a Deeper Understanding of Adversarial Losses
(2019)

Recent work has proposed various adversarial losses for training generative adversarial networks. Yet, it remains unclear what certain types of functions are valid adversarial loss functions, and how these loss functions perform against one another. In this paper, we aim to gain a deeper understanding of adversarial losses by decoupling the effects of their component functions and regularization terms. We first derive some necessary and sufficient conditions of the component functions such that the adversarial loss is a divergence-like measure between the data and the model distributions. In order to systematically compare different adversarial losses, we then propose DANTest—a new, simple framework based on discriminative adversarial networks. With this framework, we evaluate an extensive set of adversarial losses by combining different component functions and regularization approaches. This study leads to some new insights into the adversarial losses. For reproducibility, all source code is available at https: //github.com/salu133445/dan.
Grammatical error correction in non-native English
(2017)

Grammatical error correction (GEC) is the task of automatically correcting grammatical errors in written text. Previous research has mainly focussed on individual error types and current commercial proofreading tools only target limited error types. As sentences produced by learners may contain multiple errors of different types, a practical error correction system should be able to detect and correct all errors. In this thesis, we investigate GEC for learners of English as a Second Language (ESL). Specifically, we treat GEC as a translation task from incorrect into correct English, explore new models for developing end-to-end GEC systems for all error types, study system performance for each error type, and examine model generali-sation to different corpora. First, we apply Statistical Machine Translation (SMT) to GEC and prove that it can form the basis of a competitive all-errors GEC system. We implement an SMT-based GEC system which contributes to our winning system submitted to a shared task in 2014. Next, we propose a ranking model to re-rank correction candidates generated by an SMT-based GEC system. This model introduces new linguistic information and we show that it improves correction quality. Finally, we present the first study using Neural Machine Translation (NMT) for GEC. We demonstrate that NMT can be successfully applied to GEC and help capture new errors missed by an SMT-based GEC system. While we focus on GEC for English, our methods presented in this thesis can be easily applied to any language. Acknowledgements First and foremost, I owe a huge debt of gratitude to my supervisor, Ted Briscoe, who has patiently guided me through my PhD and always been very helpful, understanding and supportive. I cannot thank him enough for providing me with opportunities that helped me grow as a researcher and a critical thinker. I am immensely grateful to my examiners, Paula Buttery and Stephen Pulman, for their thorough reading of my thesis, their valuable comments and an enjoyable viva. My appreciation extends to my fellow members of the Natural Language and Information Processing research group, with whom I have always enjoyed discussing our work and other random things. My gratitude goes to Stephen Clark and Ann Copestake for giving me early feedback on my work as well as Christopher Bryant for generously reading my thesis draft. I would especially like to thank Mariano Felice for being not just a great colleague but also a dear friend. A special mention has …
Enhancing DataQuality in DataWarehouse Environments
(1998)

D ecisions by senior management lay the groundwork for lower corporate levels to develop policies and procedures for various corporate activities. However, the potential business contribution of these activities depends on the quality of the decisions and in turn on the quality of the data used to make them. Some inputs are judgmental, others are from transactional systems, and still others are from external sources, but all must have a level of quality appropriate for the decisions they will be part of. Although concern about the quality of one’s data is not new, what is fairly recent is using the same data for multiple purposes, which can be quite different from their original purposes. Users working with a particular data set come to know and internalize its deficiencies and idiosyncrasies. This knowledge is lost when data is made available to other parties, like when data needed for decision making is collected in repositories called data warehouses. Here, we offer a conceptual framework for enhancing data quality in data warehouse environments. We explore the factors that should be considered, such as the current level of data quality, the levels of quality needed by the relevant decision processes, and the potential benefits of projects designed to enhance data quality. Those responsible for data quality have to understand the importance of such factors, as well as the interaction among them. This understanding is mandatory in data warehousing environments characterized by multiple users with differing needs for data quality. For warehouses supporting a limited number of decision processes, awareness of these issues coupled with good judgment should suffice. For more complex situations, however, the number and diversity of trade-offs make reliance on judgment alone problematic. For such situations, we offer a methodology that Nothing is more likely to undermine the performance and business value of a data warehouse than inappropriate, misunderstood, or ignored data quality. Enhancing DataQuality in DataWarehouse Environments
Normative data stratified by age and education for two measures of verbal fluency: FAS and animal naming.
(1999)

Normative data stratified by three levels of age (16-59, 60-79, and 80-95 years) and three levels of education (0-8, 9-12, and 13-21 years) are presented for phonemic verbal fluency (FAS) and categorical verbal fluency (Animal Naming). The normative sample, aged 16 to 95 years, consisted of 1,300 cognitively intact individuals who resided in the community. Years of education ranged from 0 to 21. The total number of words in 1 minute for each of the letters F, A, and S was correlated r =.52 with the number of animal names generated in 1 minute. Regression analyses showed that FAS was more sensitive to the effects of education (18.6% of the variance) than age (11.0% of the variance). The opposite relationship occurred for Animal Naming, where age accounted for 23.4% of the variance and education accounted only for 13.6%. Gender accounted for less than 1% of variance for FAS and Animal Naming. The clinical utility of these norms is discussed.
Impact of carboplatin plus paclitaxel combined with endostar against A375 melanoma cells: An in vitro and in vivo analysis.
(2016)

PURPOSE
The aim of the present study was to investigate the efficacy of carboplatin plus paclitaxel (CP) combined with endostar against A375 melanoma cells in vitro and in vivo.


METHODS
Effects on the cell viability and apoptosis induction were estimated with the Cell counting Kit-8 assay and Annexin V-FITC/Propidium Iodide staining. Fifty female BALB/c-nude mice with subcutaneous injection of A375 cells were randomized to be treated with normal saline, dacarbazine alone, dacarbazine plus endostar, carboplatin plus paclitaxel, and CP plus endostar. Tumor volume of mice was monitored after injection and survival time was adopted for survival analysis.


RESULTS
CP plus endostar significantly decreased the cell survival rate compared with CP (P<0.01). Combination of CP and endostar showed higher cytotoxicity to A375 cells in vitro than endostar plus dacarbazine (P<0.01). The percentage of apoptotic cells in A375 cells treated with CP plus endostar was appreciably higher when compared to CP group (P<0.05). The mean relative tumor size in CP group was definitely larger (p<0.05) than CP plus endostar group. In addition, the mean survival time in CP plus endostar group was notably elevated compared with the CP group (P<0.05).


CONCLUSIONS
Our data indicated that treatment with CP plus endostar significantly reduced cell growth and induced a high rate of apoptotic cells in the A375 melanoma cell line. CP and endostar exhibited synergistic anti-tumor activities in A375 melanoma cells in vitro. CP plus endostar suppressed the growth of xenograft tumors and prolonged the survival time of mice with xenograft tumors. Combination of CP and endostar may be a promising treatment for melanoma.
Heritability for Alzheimer's disease: the study of dementia in Swedish twins.
(1997)

BACKGROUND
Alzheimer's disease has been thought to have familial and sporadic forms, and several genetic defects have been identified that chiefly explain early-onset familial cases. In this study, our purpose was to detect all cases of dementia in an established twin registry and to estimate total extent of genetic contribution to liability to Alzheimer's disease.


METHODS
At the first stage, members of the registry were screened for dementia, using in-person or telephone mental status testing. At the second stage, those who screened positively and their partners were referred for clinical work-ups, including neuropsychological assessment, physician examination, laboratory tests, and neuroimaging. Clinical diagnoses were assigned at a multidisciplinary consensus conference. Probandwise concordance rates were examined by zygosity, and structural modeling was applied to the data to estimate genetic and environmental influences, using both single- and multiple-threshold models.


RESULTS
Sixty-five pairs were identified in which one or both was demented. The probandwise concordance rate for Alzheimer's disease among monozygotic pairs was 67%; the corresponding figure for dizygotic pairs was 22%. Heritability of liability to Alzheimer's disease was estimated to be .74; to any dementia, .43. The other variance is attributable to environmental influences.


CONCLUSIONS
Findings indicate a substantial genetic effect for these predominantly late-onset Alzheimer's disease cases. At the same time, structural modeling results and large intra-pair differences in age of onset suggest that environmental factors are also important in determining whether and when an individual may develop dementia.
SANE: System for Fine Grained Named Entity Typing on Textual Data
(2017)

Assignment of fine-grained types to named entities is gaining popularity as one of the major Information Extraction tasks due to its applications in several areas of Natural Language Processing. Existing systems use huge knowledge bases to improve the accuracy of the fine-grained types. We designed and developed SANE, a system that uses Wikipedia categories to fine grain the type of the named entities recognized in the textual data. The main contribution of this work is building a named entity typing system without the use of knowledge bases. Through our experiments, 1) we establish the usefulness of Wikipedia categories to Named Entity Typing and 2) we show that SANE’s performance is on par with the state-ofthe-art.
Algorithm 799: revolve: an implementation of checkpointing for the reverse or adjoint mode of computational differentiation
(2000)

In its basic form, the reverse mode of computational differentiation yields the gradient of a scalar-valued function at a cost that is a small multiple of the computational work needed to evaluate the function itself. However, the corresponding memory requirement is proportional to the run-time of the evaluation program. Therefore, the practical applicability of the reverse mode in its original formulation is limited despite the availability of ever larger memory systems. This observation leads to the development of checkpointing schedules to reduce the storage requirements. This article presents the function revolve, which generates checkpointing schedules that are provably optimal with regard to a primary and a secondary criterion. This routine is intended to be used as an explicit “controller” for running a time-dependent applications program.
Accumulation Bit-Width Scaling For Ultra-Low Precision Training Of Deep Networks
(2018)

Efforts to reduce the numerical precision of computations in deep learning training have yielded systems that aggressively quantize weights and activations, yet employ wide high-precision accumulators for partial sums in inner-product operations to preserve the quality of convergence. The absence of any framework to analyze the precision requirements of partial sum accumulations results in conservative design choices. This imposes an upper-bound on the reduction of complexity of multiply-accumulate units. We present a statistical approach to analyze the impact of reduced accumulation precision on deep learning training. Observing that a bad choice for accumulation precision results in loss of information that manifests itself as a reduction in variance in an ensemble of partial sums, we derive a set of equations that relate this variance to the length of accumulation and the minimum number of bits needed for accumulation. We apply our analysis to three benchmark networks: CIFAR-10 ResNet 32, ImageNet ResNet 18 and ImageNet AlexNet. In each case, with accumulation precision set in accordance with our proposed equations, the networks successfully converge to the single precision floating-point baseline. We also show that reducing accumulation precision further degrades the quality of the trained network, proving that our equations produce tight bounds. Overall this analysis enables precise tailoring of computation hardware to the application, yielding areaand power-optimal systems.
Sorry, I only speak natural language: a pattern-based, data-driven and guided approach to mapping natural language queries to SPARQL
(2015)

We present a new interface based on natural language to support users in specifying their queries with respect to RDF datasets. The approach relies on a number of predefined patterns that uniquely determine a type of SPARQL query. The approach is incremental and assisted in that it guides a user step by step in specifying a query by incrementally parsing the input and providing suggestions for completion at every stage. The methodology to specify the patterns is informed by empirical distributions of SPARQL query types as found in standard query logs. So far, we have implemented the approach using two patterns only as proof-of-concept. The coverage of the pattern library will be extended in the future. We will also provide an evaluation of the approach on the well-known QALD dataset.
Recent and Emerging Topics in Wireless Industrial Communications: A Selection
(2008)

In this paper we discuss a selection of promising and interesting research areas in the design of protocols and systems for wireless industrial communications. We have selected topics that have either emerged as hot topics in the industrial communications community in the last few years (like wireless sensor networks), or which could be worthwhile research topics in the next few years (for example cooperative diversity techniques for error control, cognitive radio/opportunistic spectrum access for mitigation of external interferences).
Nano-Power Wireless Wake-Up Receiver With Serial Peripheral Interface
(2011)

We designed, implemented, tested and measured an ultra low power Wake Up Receiver (WUR), intended for use in Wireless Body Area Networks (WBAN). Gaussian On-Off Keying (GOOK) and Pulse Width Modulation (PWM) are used to modulate and encode, respectively, the preamble signal. The receiver incorporates a decoder to enable Serial Peripheral Interface (SPI). WUR was also comprehensively tested for power consumption and robustness to RF interference from wireless devices commonly found in the vicinity of persons utilising WBAN technology. Our results and comparative evaluation demonstrate that the achieved listening power of 270nW for the Wake Up Receiver is significantly lower power consumption than for the other state-of-the-art. The proposed preamble detection scheme can significantly reduce false wake ups due to other wireless devices in a WBAN. Additionally, SPI significantly reduces the overall power consumption for packet reception and decoding.
Performance Evaluation and Comparative Analysis of SubCarrier Modulation Wake-up Radio Systems for Energy-Efficient Wireless Sensor Networks
(2013)

Energy-efficient communication is one of the main concerns of wireless sensor networks nowadays. A commonly employed approach for achieving energy efficiency has been the use of duty-cycled operation of the radio, where the node's transceiver is turned off and on regularly, listening to the radio channel for possible incoming communication during its on-state. Nonetheless, such a paradigm performs poorly for scenarios of low or bursty traffic because of unnecessary activations of the radio transceiver. As an alternative technology, Wake-up Radio (WuR) systems present a promising energy-efficient network operation, where target devices are only activated in an on-demand fashion by means of a special radio signal and a WuR receiver. In this paper, we analyze a novel wake-up radio approach that integrates both data communication and wake-up functionalities into one platform, providing a reconfigurable radio operation. Through physical experiments, we characterize the delay, current consumption and overall operational range performance of this approach under different transmit power levels. We also present an actual single-hop WuR application scenario, as well as demonstrate the first true multi-hop capabilities of a WuR platform and simulate its performance in a multi-hop scenario. Finally, by thorough qualitative comparisons to the most relevant WuR proposals in the literature, we state that the proposed WuR system stands out as a strong candidate for any application requiring energy-efficient wireless sensor node communications.