ResearchGate and Google Scholar: how much do they differ in publications,citations and different metrics and why?

ResearchGate has emerged as a popular professional network for scientists and researchers in a very short span. Similar to Google Scholar, the ResearchGate indexing uses an automatic crawling algorithm that extracts bibliographic data, citations, and other information about scholarly articles from various sources. However, it has been observed that the two platforms often show different publication and citation data for the same institutions, journals, and authors. While several previous studies analysed different aspects of ResearchGate and Google Scholar, the quantum of differences in publications, citations, and metrics between the two and the probable reasons for the same are not explored much. This article, therefore, attempts to bridge this research gap by analysing and measuring the differences in publications, citations, and different metrics of the two platforms for a large data set of highly cited authors. The results indicate that there are significantly high differences in publications and citations for the same authors captured by the two platforms, with Google Scholar having higher counts for a vast majority of the cases. The different metrics computed by the two platforms also differ in their values, showing different degrees of correlation. The coverage policy, indexing errors, author attribution mechanism, and strategy to deal with predatory publishing are found to be the main probable reasons for the differences in the two platforms.

     

Estimating and reducing the memory requirements of signal processing codes for embedded systems

Most embedded systems have limited amount of memory. In contrast, the memory requirements of the digital signal processing (DSP) and video processing codes (in nested loops, in particular) running on embedded systems is significant. This paper addresses the problem of estimating and reducing the amount of memory needed for transfers of data in embedded systems. First, the problem of estimating the region associated with a statement or the set of elements referenced by a statement during the execution of nested loops is analyzed. For a fixed execution ordering, a quantitative analysis of the number of elements referenced is presented; exact expressions for uniformly generated references and a close upper and lower bound for nonuniformly generated references are derived. Second, in addition to presenting an algorithm that computes the total memory required, this paper also discusses the effect of transformations (that change the execution ordering) on the lifetimes of array variables, i.e., the time between the first and last accesses to a given array location. The term maximum window size is introduced, and quantitative expressions are derived to compute the maximum window size. A detailed analysis of the effect of unimodular transformations on data locality, including the calculation of the maximum window size, is presented.     

Effects of chloroquine treatment on antioxidant enzymes in rat liver and kidney

The effect of chloroquine (CHQ) administration on antioxidant enzymes in rat liver and kidney was studied. Male Sprague-Dawley rats were administered 20 mg/kg CHQ once a week for 4 weeks (chronic treatment) or a single dose at 10 or 20 mg/kg (acute treatment). Antioxidant enzyme activities were determined in cytosolic fractions of liver and kidney, whereas reduced glutathione (GSH) and malondialdehyde (MDA) were determined in tissue samples. Results indicate minimal effects of acute CHQ treatment, whereas chronic treatment with CHQ differentially affected antioxidant enzymes in the two organs. Superoxide dismutase activity was increased nearly twofold, while activities of selenium glutathione peroxidase (GPX), catalase, and NAD (P) H: quinone oxidoreductase were decreased in livers of CHQ-treated rats compared to controls. No significant effects of CHQ on glutathione reductase, GSH, and MDA levels were seen in the liver. Fewer effects of CHQ were observed in the kidney where a decrease in GPX activity and an increase in MDA levels was seen. Lowering of antioxidant enzymes activities in the liver by CHQ could render the organ more susceptible to subsequent oxidative stress; while increased MDA production after CHQ treatment in the kidney indicate that the organ is being subjected to oxidative stress. This could have implications for prolonged chloroquine intake.     

Prediction of thermal expansion coefficients of plain weave fabric composites

Three plain weave fabric composite analysis models are presented for the prediction of the on-axes thermal expansion coefficients. These are two-dimensional models in the sense that the actual strand cross-sectional geometry, strand undulation and the presence of a gap between the adjacent strands are taken into account. In the first two models, termed refined models, the representative unit cell is discretised into slices and elements and analysed. In the third method, a closed-form solution is presented. In this case, the representative unit cell is idealised as a crossply laminate and analysed. The relative merits and demerits of the models are also discussed. The predicted results are compared with the experimental values. A good correlation is observed.     

Reliability models for computer systems: An overview including dataflow graphs

The reliability of a system is the probability that the system will perform its intended mission under given conditions. This paper provides an overview of the approaches to reliability modelling and identifies their strengths and weaknesses. The models discussed include structure models, simple stochastic models and decomposable stochastic models. Ignoring time-dependence, structure models give reliability as a function of the topological structure of the system. Simple stochastic models make direct use of the properties of underlying stochastic processes, while decomposable models consider more complex systems and analyse them through subsystems. Petri nets and dataflow graphs facilitate the analysis of complex systems by providing a convenient framework for reliability analysis.     

Efficient computation of unique input/output sequences in finitestate machines

This paper makes two contributions toward computing unique input/output (UIO) sequences in finite-state machines. Our first contribution is to compute all UIO sequences of minimal lengths in a finite-state machine. Our second contribution is to present a generally efficient algorithm to compute a UIO sequence for each state, if it exists. We begin by defining a path vector, vector perturbation, and UIO tree. The perturbation process allows us to construct the complete UIO tree for a machine. Each sequence of input/output from the initial vector of a UIO tree to a singleton vector represents a UIO sequence. Next, we define the idea of an inference rule that allows us to infer UIO sequences of a number of states from the UIO sequence of some state. That is, for a large class of machines, it is possible to compute UIO sequences for all possible states from a small set of initial UIOs. We give a modified depth-first algorithm, called the hybrid approach, that computes a partial UIO tree, called an essential subtree, from which UIO sequences of all possible states can be inferred. Using the concept of projection machines, we show that sometimes it is unnecessary to construct even a partial subtree. We prove that if a machine remains strongly connected after deleting all the converging transitions, then all of the states have UIO sequences. To demonstrate the effectiveness of our approach, we develop a tool to perform experiments using both small and large machines     

Gradient Boundary Detection for Time Series Snapshot Construction in Sensor Networks

In many applications of sensor networks, the sink needs to keep track of the history of sensed data of a monitored region for scientific analysis or supporting historical queries. We call these historical data a time series of value distributions or snapshots. Obviously, to build the time series snapshots by requiring all of the sensors to transmit their data to the sink periodically is not energy efficient. In this paper, we introduce the idea of gradient boundary and propose the gradient boundary detection (GBD) algorithm to construct these time series snapshots of a monitored region. In GBD, a monitored region is partitioned into a set of subregions and all sensed data in one subregion are within a predefined value range, namely, the gradient interval. Sensors located on the boundaries of the subregions are required to transmit the data to the sink and, then, the sink recovers all subregions to construct snapshots of the monitored area. In this process, only the boundary sensors transmit their data and, therefore, energy consumption is greatly reduced. The simulation results show that GBD is able to build snapshots with a comparable accuracy and has up to 40 percent energy savings compared with the existing approaches for large gradient intervals.