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.

     

Channel Allocation with MIMO in Cognitive Radio Network

Wireless Personal Communications - The bulk volume and diverse data generated by Smart grid applications require use of Cognitive Radio (CR) technology for efficient handling. The CR technology...     

A Bluetooth Based Sensor Network for Civil Infrastructure Health Monitoring

Communicating with sensors has long been limited either to wired connections or to proprietary wireless communication protocols. Using a ubiquitous and inexpensive wireless communication technology to create Sensor Area Networks (SANs) will accelerate the extensive deployment of sensor technology. Bluetooth, an emerging, worldwide standard for inexpensive, local wireless communication is a viable choice for SANs because of its inherent support for some of the important requirements – low power, small form factor, low cost and sufficient communication range. In this paper we outline an approach, centered on the Bluetooth technology, to support a sensor network composed of fixed wireless sensors for health monitoring of highways, bridges and other civil infrastructures. We present a topology formation scheme that not only takes into account the traffic generated by different sensors but also the associated link strengths, buffer capacities and energy availability. The algorithm makes no particular assumptions as to the placement of nodes, and not all nodes need to be in radio proximity of each other. The output is a tree shaped scatternet rooted at the sensor hub (data logger) that is balanced in terms of traffic carried on each of the links. We also analyze the scheduling, routing and healing aspects of the resulting sensor-net topology.     

Fermi–Bose Correspondence and Bose–Einstein Condensation in the Two-Dimensional Ideal Gas

The ideal uniform two-dimensional (2D) Fermi and Bose gases are considered both in the thermodynamic limit and the finite case. We derive May's Theorem, viz. the correspondence between the internal energies of the Fermi and Bose gases in the thermodynamic limit. This results in both gases having the same heat capacity. However, as we shall show, the thermodynamic limit is never truly reached in two dimensions and so it is essential to consider finite-size effects. We show in an elementary manner that for the finite 2D Bose gas, a pseudo-Bose–Einstein condensate forms at low temperatures, incompatible with May's Theorem. The two gases now have different heat capacities, dependent on the system size and tending to the same expression in the thermodynamic limit.     

Changes in Δ5- and Δ7-sterols during germination and seedling development ofCucurbita maximaduring germination and seedling development ofCucurbita maxima

While seeds ofCucurbita maxima contain both Δ⁵- and Δ⁷-sterols, the former, which have been described earlier, now have been found to disappear during germination. This suggests that a function exists for the Δ⁵-compounds only in the early part of the life cycle ofC. maxima, unlike most of the other higher plants studied. In contrast to the Δ⁵-sterols, the level of Δ⁷-sterols increased during germination as well as during seedling development and maturation. The period of transition between germination and seedling development appeared to be of special importance in terms of sterol changes. This period represented a surge of sterol biosynthesis with an ontogenetic shift in sterol composition from approximately equal amounts of 24α- and 24β-ethyl stereochemistry to a predominance of the former. The sterol composition of the mature plants included only about 5% of the 24β-ethylsterols. The configurational relationships were demonstrated by high resolution¹H-NMR. The sterols of the mature plants were: 25(27)-dehydrochondrillasterol, 24β-ethyl-25(27)-dehydrolathosterol, avenasterol, spinasterol, 22-dihydrospinasterol and 24ξ-methyllathosterol. Based on the changes which occurred in the relative amounts of the Δ⁷-sterols, it did not appear that the Δ⁵-components were being converted to their Δ⁷-analogs. A portion of this work was presented at the meeting of the American Oil Chemists' Society in May, 1985 in Philadelphia.     

Parallel depth first search. Part II. Analysis

This paper presents the analysis of a parallel formulation of depth-first search. At the heart of this parallel formulation is a dynamic work-distribution scheme that divides the work between different processors. The effectiveness of the parallel formulation is strongly influenced by the work-distribution scheme and the target architecture. We introduce the concept of isoefficiency function to characterize the effectiveness of different architectures and work-distribution schemes. Many researchers considered the ring architecture to be quite suitable for parallel depth-first search. Our analytical and experimental results show that hypercube and shared-memory architectures are significantly better. The analysis of previously known work-distribution schemes motivated the design of substantially improved schemes for ring and shared-memory architectures. In particular, we present a work-distribution algorithm that guarantees close to optimal performance on a shared-memory/-network-with-message-combining architecture (e.g. RP3). Much of the analysis presented in this paper is applicable to other parallel algorithms in which work is dynamically shared between different processors (e.g., parallel divide-and-conquer algorithms). The concept of isoefficiency is useful in characterizing the scalability of a variety of parallel algorithms.This work was supported by Army Research Office Grant No. DAAG29-84-K-0060 to the Artificial Intelligence Laboratory, and Office of Naval Research Grant N00014-86-K-0763 to the Computer Science Department at the University of Texas at Austin.     

Modeling drop breakage using the full energy spectrum and a specific realization of turbulence anisotropy

The assumption of homogeneous isotropic turbulence when modeling drop breakage in industrially relevant geometries is questionable. We describe the development of an anisotropic breakage model, where the anisotropy is introduced via the inclusion of a perturbed turbulence spectrum. The selection of the perturbed spectrum is itself motivated by our previous large-eddy simulations of high-pressure homogenizers. The model redistributes energy from small to large scales, and assumes that the anisotropic part of the Reynolds stresses is confined to the energy-containing range. The second-order structure function arising from the perturbed spectrum is used in the standard framework of Coulaloglou and Tavlarides to calculate breakage frequency. While the base model exhibits non-monotonic behavior (by predicting a maximum value for a certain drop size), the effect of anisotropy is shown to increase breakage frequency in length scales larger than this peak, thereby reducing non-monotonicity. This effect is more pronounced for small turbulence Reynolds numbers.     

Replication-Based Fault Tolerance for MPI Applications

As computational clusters increase in size, their mean time to failure reduces drastically. Typically, checkpointing is used to minimize the loss of computation. Most checkpointing techniques, however, require central storage for storing checkpoints. This results in a bottleneck and severely limits the scalability of checkpointing, while also proving to be too expensive for dedicated checkpointing networks and storage systems. We propose a scalable replication-based MPI checkpointing facility. Our reference implementation is based on LAM/MPI; however, it is directly applicable to any MPI implementation. We extend the existing state of fault-tolerant MPI with asynchronous replication, eliminating the need for central or network storage. We evaluate centralized storage, a Sun-X4500-based solution, an EMC storage area network (SAN), and the Ibrix commercial parallel file system and show that they are not scalable, particularly after 64 CPUs. We demonstrate the low overhead of our checkpointing and replication scheme with the NAS Parallel Benchmarks and the High-Performance LINPACK benchmark with tests up to 256 nodes while demonstrating that checkpointing and replication can be achieved with a much lower overhead than that provided by current techniques. Finally, we show that the monetary cost of our solution is as low as 25 percent of that of a typical SAN/parallel-file-system-equipped storage system.     

Automata for Epistemic Temporal Logic with Synchronous Communication

We suggest that developing automata theoretic foundations is relevant for knowledge theory, so that we study not only what is known by agents, but also the mechanisms by which such knowledge is arrived at. We define a class of epistemic automata, in which agents’ local states are annotated with abstract knowledge assertions about others. These are finite state agents who communicate synchronously with each other and information exchange is ‘perfect’. We show that the class of recognizable languages has good closure properties, leading to a Kleene-type theorem using what we call regular knowledge expressions. These automata model distributed causal knowledge in the following way: each agent in the system has a partial knowledge of the temporal evolution of the system, and every time agents synchronize, they update each other’s knowledge, resulting in a more up-to-date view of the system state. Hence we show that these automata can be used to solve the satisfiability problem for a natural epistemic temporal logic for local properties. Finally, we characterize the class of languages recognized by epistemic automata as the regular consistent languages studied in concurrency theory.