SoroushVahidi/scidocs huggingface dataset:
The academic social network
(2014)

By means of their academic publications, authors form a social network. Instead of sharing casual thoughts and photos (as in Facebook), authors select co-authors and reference papers written by other authors. Thanks to various efforts (such as Microsoft Academic Search and DBLP), the data necessary for analyzing the academic social network is becoming more available on the Internet. What type of information and queries would be useful for users to discover, beyond the search queries already available from services such as Google Scholar? In this paper, we explore this question by defining a variety of ranking metrics on different entities—authors, publication venues, and institutions. We go beyond traditional metrics such as paper counts, citations, and h-index. Specifically, we define metrics such as influence, connections, and exposure for authors. An author gains influence by receiving more citations, but also citations from influential authors. An author increases his or her connections by co-authoring with other authors, and especially from other authors with high connections. An author receives exposure by publishing in selective venues where publications have received high citations in the past, and the selectivity of these venues also depends on the influence of the authors who publish there. We discuss the computation aspects of these metrics, and the similarity between different metrics. With additional information of author-institution relationships, we are able to study institution rankings based on the corresponding authors’ rankings for each type of metric as well as different domains. We are prepared to demonstrate these ideas with a web site ( http://pubstat.org ) built from millions of publications and authors.
Beamspace channel estimation for millimeter-wave massive MIMO systems with lens antenna array
(2016)

By employing the lens antenna array, beamspace MIMO can utilize beam selection to reduce the number of required RF chains in mmWave massive MIMO systems without obvious performance loss. However, to achieve the capacity-approaching performance, beam selection requires the accurate information of beamspace channel of large size, which is challenging, especially when the number of RF chains is limited. To solve this problem, in this paper we propose a reliable support detection (SD)-based channel estimation scheme. Specifically, we propose to decompose the total beamspace channel estimation problem into a series of sub-problems, each of which only considers one sparse channel component. For each channel component, we first reliably detect its support by utilizing the structural characteristics of mmWave beamspace channel. Then, the influence of this channel component is removed from the total beamspace channel estimation problem. After the supports of all channel components have been detected, the nonzero elements of the sparse beamspace channel can be estimated with low pilot overhead. Simulation results show that the proposed SD-based channel estimation outperforms conventional schemes and enjoys satisfying accuracy, even in the low SNR region.
The Use of Wearable Inertial Motion Sensors in Human Lower Limb Biomechanics Studies: A Systematic Review
(2010)

Wearable motion sensors consisting of accelerometers, gyroscopes and magnetic sensors are readily available nowadays. The small size and low production costs of motion sensors make them a very good tool for human motions analysis. However, data processing and accuracy of the collected data are important issues for research purposes. In this paper, we aim to review the literature related to usage of inertial sensors in human lower limb biomechanics studies. A systematic search was done in the following search engines: ISI Web of Knowledge, Medline, SportDiscus and IEEE Xplore. Thirty nine full papers and conference abstracts with related topics were included in this review. The type of sensor involved, data collection methods, study design, validation methods and its applications were reviewed.
An empirical study on the impact of static typing on software maintainability
(2013)

Static type systems play an essential role in contemporary programming languages. Despite their importance, whether static type systems impact human software development capabilities remains open. One frequently mentioned argument in favor of static type systems is that they improve the maintainability of software systems—an often-used claim for which there is little empirical evidence. This paper describes an experiment that tests whether static type systems improve the maintainability of software systems, in terms of understanding undocumented code, fixing type errors, and fixing semantic errors. The results show rigorous empirical evidence that static types are indeed beneficial to these activities, except when fixing semantic errors. We further conduct an exploratory analysis of the data in order to understand possible reasons for the effect of type systems on the three kinds of tasks used in this experiment. From the exploratory analysis, we conclude that developers using a dynamic type system tend to look at different files more frequently when doing programming tasks—which is a potential reason for the observed differences in time.
A 12.77-MHz 31 ppm/°C On-Chip RC Relaxation Oscillator With Digital Compensation Technique
(2016)

The design of a 12.77-MHz on-chip RC relaxation oscillator with digital compensation technique is presented. To maintain the frequency stability versus temperature and supply voltage variations, loop delay tuning by a digital feedback loop is developed in this system. In order to generate an on-chip reference for digital calibration, a replica comparator is added. The on-chip relaxation oscillator is fabricated in 0.18-μm CMOS process. The measured output frequency variation is 31 ppm/°C across -30 to 120 °C temperature range after compensation. The frequency variation over the supply voltage from 0.6 V to 1.1 V is ±0.5%/V. The measured total power consumption is 56.2 μW at 0.9-V supply voltage when the digital compensation blocks are enabled. After digital compensation, the compensation blocks can be shutdown for power saving, and the main oscillator consumes only 12.8 μW.
Learning Deep Face Representation
(2014)

Face representation is a crucial step of face recognition systems. An optimal face representation should be discriminative, robust, compact, and very easyto-implement. While numerous hand-crafted and learning-based representations have been proposed, considerable room for improvement is still present. In this paper, we present a very easy-to-implement deep learning framework for face representation. Our method bases on a new structure of deep network (called Pyramid CNN). The proposed Pyramid CNN adopts a greedy-filter-and-down-sample operation, which enables the training procedure to be very fast and computationefficient. In addition, the structure of Pyramid CNN can naturally incorporate feature sharing across multi-scale face representations, increasing the discriminative ability of resulting representation. Our basic network is capable of achieving high recognition accuracy (85.8% on LFW benchmark) with only 8 dimension representation. When extended to feature-sharing Pyramid CNN, our system achieves the state-of-the-art performance (97.3%) on LFW benchmark. We also introduce a new benchmark of realistic face images on social network and validate our proposed representation has a good ability of generalization.
On the minimum node degree and connectivity of a wireless multihop network
(2002)

This paper investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity. Both topology attributes depend on the spatial distribution of the nodes and their transmission range. Using typical modeling assumptions :--- :a random uniform distribution of the nodes and a simple link model :--- :we derive an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network. Equivalently, if the maximum r0 of the nodes is given, we can find out how many nodes are needed to cover a certain area with a k--connected network. We also investigate these questions by various simulations and thereby verify our analytical expressions. Finally, the impact of mobility is discussed.The results of this paper are of practical value for researchers in this area, e.g., if they set the parameters in a network--level simulation of a mobile ad hoc network or if they design a wireless sensor network.
Imagination-Based Decision Making with Physical Models in Deep Neural Networks
(2016)

Decision-making is challenging in continuous settings where complex sequences of events determine rewards, even when these event sequences are largely observable. In particular, traditional trial-and-error learning strategies may have a hard time associating continuous actions with their reward because of the size of the state space and the complexity of the reward function. Given a model of the world, a different strategy is to use imagination to exploit the knowledge embedded in that model. In this regime, the system directly optimizes the decision for each episode based on predictions from the model. We extend deep learning methods that have been previously used for model-free learning and apply them towards a model-based approach in which an expert is consulted multiple times in the agents’ imagination before it takes an action in the world. We show preliminary results on a difficult physical reasoning task where our model-based approach outperforms a model-free baseline, even when using an inaccurate expert.
Help seeking behavior and the Internet: A national survey
(2006)

Health-related websites have the potential to powerfully influence the attitudes and behavior of consumers. Access to reliable disease information online has been linked to reduced anxiety, increased feelings of self-efficacy, and decreases in utilization of ambulatory care. Studies report that Internet health information seekers are more likely to have health concerns; adult seekers are more likely to rate themselves as having poor health status and adolescent seekers are more likely to demonstrate clinical impairment or depressive symptomatology compared to non-seekers. Although more and more Americans are using the Internet for healthcare information, little is known about how this information affects their health behaviors. The current study extends the literature by examining characteristics associated with help seeking, either from a healthcare provider or from peers, as a direct result of health information found online. Medical care seekers appear to be using the Internet to enhance their medical care; they report using the information online to diagnose a problem and feel more comfortable about their health provider's advice given the information found on the Internet. Support seekers tend to be of slightly lower income compared to non-support seekers. They are also significantly more likely to have searched for information about a loved one's medical or health condition, signaling that many of these consumers may be caretakers.
What is the function of the claustrum?
(2005)

The claustrum is a thin, irregular, sheet-like neuronal structure hidden beneath the inner surface of the neocortex in the general region of the insula. Its function is enigmatic. Its anatomy is quite remarkable in that it receives input from almost all regions of cortex and projects back to almost all regions of cortex. We here briefly summarize what is known about the claustrum, speculate on its possible relationship to the processes that give rise to integrated conscious percepts, propose mechanisms that enable information to travel widely within the claustrum and discuss experiments to address these questions.
Distinct mechanisms regulate slow-muscle development
(2001)

Vertebrate muscle development begins with the patterning of the paraxial mesoderm by inductive signals from midline tissues [1, 2]. Subsequent myotome growth occurs by the addition of new muscle fibers. We show that in zebrafish new slow-muscle fibers are first added at the end of the segmentation period in growth zones near the dorsal and ventral extremes of the myotome, and this muscle growth continues into larval life. In marine teleosts, this mechanism of growth has been termed stratified hyperplasia [3]. We have tested whether these added fibers require an embryonic architecture of muscle fibers to support their development and whether their fate is regulated by the same mechanisms that regulate embryonic muscle fates. Although Hedgehog signaling is required for the specification of adaxial-derived slow-muscle fibers in the embryo [4, 5], we show that in the absence of Hh signaling, stratified hyperplastic growth of slow muscle occurs at the correct time and place, despite the complete absence of embryonic slow-muscle fibers to serve as a scaffold for addition of these new slow-muscle fibers. We conclude that slow-muscle-stratified hyperplasia begins after the segmentation period during embryonic development and continues during the larval period. Furthermore, the mechanisms specifying the identity of these new slow-muscle fibers are different from those specifying the identity of adaxial-derived embryonic slow-muscle fibers. We propose that the independence of early, embryonic patterning mechanisms from later patterning mechanisms may be necessary for growth.
A practical approach for computing the diameter of a point set
(2001)

We present an approximation algorithm for computing the diameter of a point-set in $d$-dimensions. The new algorithm is sensitive to the “hardness” of computing the diameter of the given input, and for most inputs it is able to compute the {\em exact} diameter extremely fast. The new algorithm is simple, robust, has good empirical performance, and can be implemented quickly. As such, it seems to be the algorithm of choice in practice for computing/approximating the diameter.
A Trigraph Based Centrality Approach Towards Text Summarization
(2018)

As the electronic documents are increasing due to the revolution of information there is an urgent need for summarizing the text documents. From the previous works we observed that there is no generalized graph model for text summarization and low order ngrams could not preserve the contextual meaning. This paper focuses on an extractive based graphical approach for text summarization, based on trigrams and graph based centrality measure. Trigraph is generated and the centrality of the connected trigraph is taken to extract the important trigrams. A mapping is done between the original words and the trigrams to regain the link between the words. And after comparing the centrality from the graph, the summary is extracted. The ROUGE-SU4 F-measure obtained for the proposed approach is 0.036 which is significantly better than the previous approaches.
State of the Art in Example-based Texture Synthesis
(2009)

Recent years have witnessed significant progress in example-based texture synthesis algorithms. Given an example texture, these methods produce a larger texture that is tailored to the user’s needs. In this state-of-the-art report, we aim to achieve three goals: (1) provide a tutorial that is easy to follow for readers who are not already familiar with the subject, (2) make a comprehensive survey and comparisons of different methods, and (3) sketch a vision for future work that can help motivate and guide readers that are interested in texture synthesis research. We cover fundamental algorithms as well as extensions and applications of texture synthesis.
The back squat: A proposed assessment of functional deficits and technical factors that limit performance.
(2014)

Fundamental movement competency is essential for participation in physical activity and for mitigating the risk of injury, which are both key elements of health throughout life. The squat movement pattern is arguably one of the most primal and critical fundamental movements necessary to improve sport performance, to reduce injury risk and to support lifelong physical activity. Based on current evidence, this first (1 of 2) report deconstructs the technical performance of the back squat as a foundation training exercise and presents a novel dynamic screening tool that incorporates identification techniques for functional deficits that limit squat performance and injury resilience. The follow-up report will outline targeted corrective methodology for each of the functional deficits presented in the assessment tool.
Bioinformatics Curriculum Guidelines: Toward a Definition of Core Competencies
(2014)

1 School of Electrical Engineering and Computer Science, Ohio University, Athens, Ohio, United States of America, 2 Bioinformatics and Research Computing, Whitehead Institute, Cambridge, Massachusetts, United States of America, 3 Department of Biological Sciences and School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, United States of America, 4 European Molecular Biology Laboratory, European Bioinformatics Institute, Wellcome Trust Genome Campus, Hinxton, Cambridge, United Kingdom, 5 School of Informatics and Computing, Indiana University, Bloomington, Indiana, United States of America, 6 School of Computer Science and Engineering, The University of New South Wales, Sydney, New South Wales, Australia, 7 The Genome Analysis Centre, Norwich Research Park, Norwich, United Kingdom
A Mixed Filtering Approach for Track Condition Monitoring Using Accelerometers on the Axle Box and Bogie
(2012)

This paper describes a method of estimating irregularities in railway tracks using acceleration data measured from high-speed trains. Track irregularities are the main causes of the vibration of high-speed trains and thus should be carefully monitored to maintain the stability and ride quality of the trains. A mixed filtering approach is proposed for stable displacement estimation and waveband classification of the irregularities in the measured acceleration. Accelerometers are mounted on the axle box and the bogie of a high-speed train to measure the acceleration in the lateral and vertical directions. The estimated results are compared with those of a commercial track geometry measurement system. Finally, the performance of the proposed approach and the relationship between the mounted location of the accelerometers and the estimated track irregularities are discussed.
A Semantic Web Services Architecture
(2005)

Formed in February 2003, the Semantic Web Services Initiative Architecture (SWSA) committee’s mission is to develop the necessary abstractions for an architecture that supports Semantic Web services. The resultant framework builds on the W3C Web Services Architecture working group report (and is motivated in part by Tim Berners-Lee’s vision for the Semantic Web1). Other groups developing Semantic Web services frameworks contributed to the discussions, including the Web Ontology Language for Services (OWL-S) consortium, the Web Service Modeling Ontology (WSMO; www.wsmo. org) group at the Digital Enterprise Research Institute (DERI), and the Managing End-to-End Operations-Semantics (METEOR-S; http://lsdis.cs.uga.edu/projects/meteor-s/) group at the University of Georgia.2,3 In this article, we describe the protocols exchanged between the interacting entities or agents that interpret and reason with semantic descriptions in the deployment of Semantic Web services. We focus specifically on those capabilities that extend the potential range of Web services; we also discuss security, reliability, and a flexible means of recovery from the problems that can occur in open and evolving environments. The SWSA architectural framework attempts to address five classes of Semantic Web agent requirements — dynamic service discovery, service engagement, service process enactment and management, community support services, and quality of service (QoS) — which we cover in detail here as well.
An Improved Algorithm for Harris Corner Detection
(2009)

Corner points are formed from two or more edges and edges usually define the boundary between two different objects or parts of the same objects. In this novel we discuss the theory of the Harris corner detection and indicate its disadvantage. Then it proposes an improved algorithm of Harris detection algorithm based on the neighboring point eliminating method. It reduces the time of the detection, and makes the corners distributing more homogenous so that avoids too many corners stay together. Experimental results show that the algorithm can detect corner more equality distributing, and can be used in some fact applications such as image registration well. Key words-Corner point; Harris corner; neighboring point; homogenous distributing 1. Introduce Corner point is a maximum curvature point of the two-dimensional image brightness change or the edge of sharp curves in a image, which haves widely used in such as the camera calibration, virtual scene reconstruction, motion estimation, image registration and more computer vision tasks. These points keep important features of image and can also be effective in reducing the amount of data information, allow real-time processing possible. Now, there are two corner detection methods: based on the image edge method and based on the image gray scale method. The former always need to encode the image edge, which is heavily dependent on image segmentation and edge extraction, have large difficulty and calculate, and if the detected area haves some change, it will lead to the failure of the operation, therefore, this method is not used widely. The latter method detect corner by calculating the curvature and gradient, it avoid these disadvantage. In currently, it haves Moravec operator, Harris operator, Susan operator and so on. Experimental shows that Harris corner detection method haves the best result in above mentioned. But in fact applications, Harris algorithm must to give a proper threshold T, and the algorithm based on the provided threshold to detect the ideal corner. T always depend on the image, specifically it is difficult to determine under the different colors. And it gets the ideal T after user blind set T more times. In addition, the points which have the larger eigenvalues are concentrated in some regions cause the detect corners are non-uniform distribution; and if T dropped, even though the overall distribution of the corner towards reasonable, but it also leads to the points close together, have the clustering phenomenon, it will affect the later analysis and processing. 2. Harris Corner Detection Algorithm 2.1 Detection Theory Harris corner detection algorithm is based on the point feature extraction of signal. It makes the window ω (usually rectangular area) to move infinitesimal displacement to any direction, and the variation of gray can be defined as: − = + + 2 , , , , ] [ v u v y u x v u y x I I w E + + = v u v u y x O yY xX w , 2 2 2 , )] , ( [ 2 2 2 By Cxy Ax + + = T y x M y x ) , ( ) , ( = (1) Where X and Y are one-order gray-level gradient, they can be got by convolution with 978-1-4244-4131-0/09/$25.00 ©2009 IEEE