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.

     

A genetic‐based neuro‐fuzzy controller for blind equalization of time‐varying channels

This paper presents a neuro‐fuzzy network (NFN) where all its parameters can be tuned simultaneously using genetic algorithms (GAs). The approach combines the merits of fuzzy logic theory, neural networks and GAs. The proposed NFN does not require a priori knowledge about the system and eliminates the need for complicated design steps such as manual tuning of input–output membership functions, and selection of fuzzy rule base. Although, only conventional GAs have been used, convergence results are very encouraging. A well‐known numerical example derived from literature is used to evaluate and compare the performance of the network with other equalizing approaches. Simulation results show that the proposed neuro‐fuzzy controller, all parameters of which have been tuned simultaneously using GAs, offers advantages over existing equalizers and has improved performance. From the perspective of application and implementation, this paper is very interesting as it provides a new method for performing blind equalization. The main contribution of this paper is the use of learning algorithms to train a feed‐forward neural network for M‐ary QAM and PSK signals. This paper also provides a platform for researchers of the area for further development. Copyright © 2008 John Wiley & Sons, Ltd.     

Multipartite entangled magnon states as quantum communication channels

We investigate the entanglement properties of the two magnon states and explicate conditions under which, the two magnon state becomes useful for several quantum communication protocols. We systematically study the temporal behaviour of concurrence to find out the effect of exchange interaction on entanglement. The two magnon state, which is potentially realizable in quantum dots using Heisenberg exchange interaction, is found to be suitable for carrying out deterministic teleportation of an arbitrary two qubit composite system. Further, conditions for which the channel capacity reaches “Holevo bound”, allowing four classical bits to be transmitted through two qubits are derived. Later, an unconventional protocol is given to demonstrate that this state can be used for sharing of a two qubit entangled state among two parties.     

Structural Studies of TeO2–SeO2–Na2O Glass System

Glass Physics and Chemistry - The growth of nanocrystalization in TeO2–SeO2–Na2O glasses is achieved by the conventional heat treatment method. The influence of Na2O concentration on...     

Grafting of a liquid crystal polymer on carbon fibers

Covalent grafting of mesogenic chains on carbon fiber surfaces was attempted as part of a study on composite materials containing liquid crystal polymer matrices. Grafting in these composite systems is viewed not only as a mechanism to achieve interfacial bonding but also as an approach to modify the interphase physical structure. The synthetic approach to grafting involved the in-situ polymerization of monomers in the presence of functionalized fibers in order to grow chains covalently attached to the fibers. The chemical mechanism may be viewed as the “transesterification of car boxy lated fibers” with acetylated monomers. The monomers used were pimelic acid, p-acetoxybenzoic acid and diacetoxy hydroquinone which are known to yield upon condensation a chemically aperiodic nematic polymer. Evidence for grafting was obtained from X-ray photoelectron spectroscopy (XPS) and scanning electron microscopy (SEM) analysis on fibers retrieved from composite samples. Interestingly, SEM micrographs of fractured composite specimens containing the mesogen-grafted fibers reveal excellent wetting and interfacial bonding of a liquid crystalline matrix on the carbon surfaces. Based on theoretical considerations for end-adsorbed macromolecules and the nematogenic nature of the grafted chains we infer that dense layers of adsorbed polymer may form at the interfaces studied. From a materials point of view the in situ growth of liquid crystal polymer chains on fibers may offer mechanisms to control composite properties through both bonding and molecular orientation in interfacial regions.     

Differential evolution with Gaussian mutation for combined heat and power economic dispatch

This paper presents differential evolution with Gaussian mutation to solve the complex non-smooth non-convex combined heat and power economic dispatch (CHPED) problem. Valve-point loading and prohibited operating zones of conventional thermal generators are taken into account. Differential evolution (DE) is a simple yet powerful global optimization technique. It exploits the differences of randomly sampled pairs of objective vectors for its mutation process. This mutation process is not suitable for complex multimodal optimization. This paper proposes Gaussian mutation in DE which improves search efficiency and guarantees a high probability of obtaining the global optimum without significantly impairing the simplicity of the structure of DE. The effectiveness of the proposed method has been verified on five test problems and three test systems. The results of the proposed approach are compared with those obtained by other evolutionary methods. It is found that the proposed differential evolution with Gaussian mutation-based approach is able to provide better solution.     

Two-stage database intrusion detection by combining multiple evidence and belief update

Insider threats have gained prominence and pose the most challenging threats to a database system. In this paper, we have proposed a new approach for detecting intrusive attacks in databases by fusion of information sources and use of belief update. In database intrusion detection, only intra-transactional features are not sufficient for detecting attackers within the organization as they are potentially familiar with the day-to-day work. Thus, the proposed system uses inter-transactional as well as intra-transactional features for intrusion detection. Moreover, we have also considered three different sensitivity levels of table attributes for keeping track of the malicious modification of the highly sensitive attributes more carefully. We have analyzed the performance of the proposed database intrusion detection system using stochastic models. Our system performs significantly better compared to two intrusion detection systems recently proposed in the literature.     

Color Subspaces as Photometric Invariants

Complex reflectance phenomena such as specular reflections confound many vision problems since they produce image ‘features’ that do not correspond directly to intrinsic surface properties such as shape and spectral reflectance. A common approach to mitigate these effects is to explore functions of an image that are invariant to these photometric events. In this paper we describe a class of such invariants that result from exploiting color information in images of dichromatic surfaces. These invariants are derived from illuminant-dependent ‘subspaces’ of RGB color space, and they enable the application of Lambertian-based vision techniques to a broad class of specular, non-Lambertian scenes. Using implementations of recent algorithms taken from the literature, we demonstrate the practical utility of these invariants for a wide variety of applications, including stereo, shape from shading, photometric stereo, material-based segmentation, and motion estimation.     

BLAST-SSAHA Hybridization for Credit Card Fraud Detection

A phenomenal growth in the number of credit card transactions, especially for online purchases, has recently led to a substantial rise in fraudulent activities. Implementation of efficient fraud detection systems has thus become imperative for all credit card issuing banks to minimize their losses. In real life, fraudulent transactions are interspersed with genuine transactions and simple pattern matching is not often sufficient to detect them accurately. Thus, there is a need for combining both anomaly detection as well as misuse detection techniques. In this paper, we propose to use two-stage sequence alignment in which a profile analyzer (PA) first determines the similarity of an incoming sequence of transactions on a given credit card with the genuine cardholder's past spending sequences. The unusual transactions traced by the profile analyzer are next passed on to a deviation analyzer (DA) for possible alignment with past fraudulent behavior. The final decision about the nature of a transaction is taken on the basis of the observations by these two analyzers. In order to achieve online response time for both PA and DA, we suggest a new approach for combining two sequence alignment algorithms BLAST and SSAHA.