Federated Search Service for OAI-compliant, Open-Access Repositories in India

Many of the research institutions and universities across the world are facilitating open-access (OA) to their intellectual outputs through their respective OA institutional repositories (IRs) or through the centralized subject-based repositories. The registry of open access repositories (ROAR) lists more than 2850 such repositories across the world. The awareness about the benefits of OA to scholarly literature and OA publishing is picking up in India, too. As per the ROAR statistics, to date, there are more than 90 OA repositories in the country. India is doing particularly well in publishing open-access journals (OAJ). As per the directory of open-access journals (DOAJ), to date, India with 390 OAJs, is ranked 5th in the world in terms of numbers of OAJs being published. Much of the research done in India is reported in the journals published from India. These journals have limited readership and many of them are not being indexed by Web of Science, Scopus or other leading international abstracting and indexing databases. Consequently, research done in the country gets hidden not only from the fellow countrymen, but also from the international community. This situation can be easily overcome if all the researchers facilitate OA to their publications. One of the easiest ways to facilitate OA to scientific literature is through the institutional repositories. If every research institution and university in India set up an open-access IR and ensure that copies of the final accepted versions of all the research publications are uploaded in the IRs, then the research done in India will get far better visibility. The federation of metadata from all the distributed, interoperable OA repositories in the country will serve as a window to the research done across the country. Federation of metadata from the distributed OAI-compliant repositories can be easily achieved by setting up harvesting software like the PKP Harvester. In this paper, we share our experience in setting up a prototype metadata harvesting service using the PKP harvesting software for the OAI-compliant repositories in India.

Percolation and connectivity in AB random geometric graphs

Given two independent Poisson point processes Phi((1)), Phi((2)) in R-d, the AB Poisson Boolean model is the graph with the points of Phi((1)) as vertices and with edges between any pair of points for which the intersection of balls of radius 2r centered at these points contains at least one point of Phi((2)). This is a generalization of the AB percolation model on discrete lattices. We show the existence of percolation for all d >= 2 and derive bounds fora critical intensity. We also provide a characterization for this critical intensity when d = 2. To study the connectivity problem, we consider independent Poisson point processes of intensities n and tau n in the unit cube. The AB random geometric graph is defined as above but with balls of radius r. We derive a weak law result for the largest nearest-neighbor distance and almost-sure asymptotic bounds for the connectivity threshold.

Badly approximable numbers and vectors in Cantor-like sets

We show that a large class of Cantor-like sets of R-d, d >= 1, contains uncountably many badly approximable numbers, respectively badly approximable vectors, when d >= 2. An analogous result is also proved for subsets of R-d arising in the study of geodesic flows corresponding to (d+1)-dimensional manifolds of constant negative curvature and finite volume, generalizing the set of badly approximable numbers in R. Furthermore, we describe a condition on sets, which is fulfilled by a large class, ensuring a large intersection with these Cantor-like sets.

Nonuniform random geometric graphs with location-dependent radii

We propose a distribution-free approach to the study of random geometric graphs. The distribution of vertices follows a Poisson point process with intensity function n f(center dot), where n is an element of N, and f is a probability density function on R-d. A vertex located at x connects via directed edges to other vertices that are within a cut-off distance r(n)(x). We prove strong law results for (i) the critical cut-off function so that almost surely, the graph does not contain any node with out-degree zero for sufficiently large n and (ii) the maximum and minimum vertex degrees. We also provide a characterization of the cut-off function for which the number of nodes with out-degree zero converges in distribution to a Poisson random variable. We illustrate this result for a class of densities with compact support that have at most polynomial rates of decay to zero. Finally, we state a sufficient condition for an enhanced version of the above graph to be almost surely connected eventually.

Efficient external memory structures for range-aggregate queries

We present external memory data structures for efficiently answering range-aggregate queries. The range-aggregate problem is defined as follows: Given a set of weighted points in R-d, compute the aggregate of the weights of the points that lie inside a d-dimensional orthogonal query rectangle. The aggregates we consider in this paper include COUNT, sum, and MAX. First, we develop a structure for answering two-dimensional range-COUNT queries that uses O(N/B) disk blocks and answers a query in O(log(B) N) I/Os, where N is the number of input points and B is the disk block size. The structure can be extended to obtain a near-linear-size structure for answering range-sum queries using O(log(B) N) I/Os, and a linear-size structure for answering range-MAX queries in O(log(B)(2) N) I/Os. Our structures can be made dynamic and extended to higher dimensions. (C) 2012 Elsevier B.V. All rights reserved.

Comparison of North American universities with and without medical schools and their technology transfer initiatives

Empirical research available on technology transfer initiatives is either North American or European. Literature over the last two decades shows various research objectives such as identifying the variables to be measured and statistical methods to be used in the context of studying university based technology transfer initiatives. AUTM survey data from years 1996 to 2008 provides insightful patterns about the North American technology transfer initiatives, we use this data in our paper. This paper has three sections namely, a comparison of North American Universities with (n=1129) and without Medical Schools (n=786), an analysis of the top 75th percentile of these samples and a DEA analysis of these samples. We use 20 variables. Researchers have attempted to classify university based technology transfer initiative variables into multi-stages, namely, disclosures, patents and license agreements. Using the same approach, however with minor variations, three stages are defined in this paper. The first stage is to do with inputs from R&D expenditure and outputs namely, invention disclosures. The second stage is to do with invention disclosures being the input and patents issued being the output. The third stage is to do with patents issued as an input and technology transfers as outcomes.

Corporate social responsibilities of Indian public sector enterprises-a case study of Bharat Heavy Electricals Limited (BHEL)

The high level of public accountability attached to Public Sector Enterprises as a result of public ownership makes them socially responsible. The Committee of Public Undertakings in 1992 examined the issue relating to social obligations of Central Public Sector Enterprises and observed that ``being part of the `State', every Public Sector enterprise has a moral responsibility to play an active role in discharging the social obligations endowed on a welfare state, subject to the financial health of the enterprise''. It issued the Corporate Social Responsibility Guidelines in 2010 where all Central Public Enterprises, through a Board Resolution, are mandated to create a CSR budget as a specified percentage of net profit of the previous year. This paper examines the CSR activities of the biggest engineering public sector organization in India, Bharath Heavy Electricals Limited. The objectives are twofold, one, to develop a case study of the organization about the funds allocated and utilized for various CSR activities, and two, to examine its status with regard to other organizations, the 2010 guidelines, and the local socio-economic development. Secondary data analysis results show three interesting trends. One, it reveals increasing organizational social orientation with the formal guidelines in place. Two, Firms can no longer continue to exploit environmental resources and escape from their responsibilities by acting separate entities regardless of the interest of the society and Three the thrust of CSR in public sector is on inclusive growth, sustainable development and capacity building with due attention to the socio-economic needs of the neglected and marginalized sections of the society.

Apparatus and method for heat-run test on high-power PWM converters with low energy expenditure

Before installation, a voltage source converter is usually subjected to heat-run test to verify its thermal design and performance under load. For heat-run test, the converter needs to be operated at rated voltage and rated current for a substantial length of time. Hence, such tests consume huge amount of energy in case of high-power converters. Also, the capacities of the source and loads available in the research and development (R&D) centre or the production facility could be inadequate to conduct such tests. This paper proposes a method to conduct heat-run tests on high-power, pulse width modulated (PWM) converters with low energy consumption. The experimental set-up consists of the converter under test and another converter (of similar or higher rating), both connected in parallel on the ac side and open on the dc side. Vector-control or synchronous reference frame control is employed to control the converters such that one draws certain amount of reactive power and the other supplies the same; only the system losses are drawn from the mains. The performance of the controller is validated through simulation and experiments. Experimental results, pertaining to heat-run tests on a high-power PWM converter, are presented at power levels of 25 kVA to 150 kVA.

Small strong epsilon nets

Let P be a set of n points in R-d. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than dn/d+1 points of P. We call a point x a strong centerpoint for a family of objects C if x is an element of P is contained in every object C is an element of C that contains more than a constant fraction of points of P. A strong centerpoint does not exist even for halfspaces in R-2. We prove that a strong centerpoint exists for axis-parallel boxes in Rd and give exact bounds. We then extend this to small strong epsilon-nets in the plane. Let epsilon(S)(i) represent the smallest real number in 0, 1] such that there exists an epsilon(S)(i)-net of size i with respect to S. We prove upper and lower bounds for epsilon(S)(i) where S is the family of axis-parallel rectangles, halfspaces and disks. (C) 2014 Elsevier B.V. All rights reserved.

On strong centerpoints

Let P be a set of n points in R-d and F be a family of geometric objects. We call a point x is an element of P a strong centerpoint of P w.r.t..F if x is contained in all F is an element of F that contains more than cn points of P, where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations. We also prove the existence of strong centerpoints for abstract set systems with bounded intersection. (C) 2014 Elsevier B.V. All rights reserved.

GLOBAL REGISTRATION OF MULTIPLE POINT CLOUDS USING SEMIDEFINITE PROGRAMMING

Consider N points in R-d and M local coordinate systems that are related through unknown rigid transforms. For each point, we are given (possibly noisy) measurements of its local coordinates in some of the coordinate systems. Alternatively, for each coordinate system, we observe the coordinates of a subset of the points. The problem of estimating the global coordinates of the N points (up to a rigid transform) from such measurements comes up in distributed approaches to molecular conformation and sensor network localization, and also in computer vision and graphics. The least-squares formulation of this problem, although nonconvex, has a well-known closed-form solution when M = 2 (based on the singular value decomposition (SVD)). However, no closed-form solution is known for M >= 3. In this paper, we demonstrate how the least-squares formulation can be relaxed into a convex program, namely, a semidefinite program (SDP). By setting up connections between the uniqueness of this SDP and results from rigidity theory, we prove conditions for exact and stable recovery for the SDP relaxation. In particular, we prove that the SDP relaxation can guarantee recovery under more adversarial conditions compared to earlier proposed spectral relaxations, and we derive error bounds for the registration error incurred by the SDP relaxation. We also present results of numerical experiments on simulated data to confirm the theoretical findings. We empirically demonstrate that (a) unlike the spectral relaxation, the relaxation gap is mostly zero for the SDP (i.e., we are able to solve the original nonconvex least-squares problem) up to a certain noise threshold, and (b) the SDP performs significantly better than spectral and manifold-optimization methods, particularly at large noise levels.

Exploring Technology Evolution Using Patent Classification: A Case of Cochlear Implant Technology Patents

Understanding technology evolution through periodic landscaping is an important stage of strategic planning in R&D Management. In fields like that of healthcare, where the initial R&D investment is huge and good medical product serve patients better, these activities become crucial. Approximately five percentage of the world population has hearing disabilities. Current hearing aid products meet less than ten percent of the global needs. Patent data and classifications on cochlear implants from 1977-2010, show the landscapes and evolution in the area of such implant. We attempt to highlight emergence and disappearance of patent classes over period of time showing variations in cochlear implant technologies. A network analysis technique is used to explore and capture technology evolution in patent classes showing what emerged or disappeared over time. Dominant classes are identified. The sporadic influence of university research in cochlear implants is also discussed.

Unique Covering Problems with Geometric Sets

The Exact Cover problem takes a universe U of n elements, a family F of m subsets of U and a positive integer k, and decides whether there exists a subfamily(set cover) F' of size at most k such that each element is covered by exactly one set. The Unique Cover problem also takes the same input and decides whether there is a subfamily F' subset of F such that at least k of the elements F' covers are covered uniquely(by exactly one set). Both these problems are known to be NP-complete. In the parameterized setting, when parameterized by k, Exact Cover is W1]-hard. While Unique Cover is FPT under the same parameter, it is known to not admit a polynomial kernel under standard complexity-theoretic assumptions. In this paper, we investigate these two problems under the assumption that every set satisfies a given geometric property Pi. Specifically, we consider the universe to be a set of n points in a real space R-d, d being a positive integer. When d = 2 we consider the problem when. requires all sets to be unit squares or lines. When d > 2, we consider the problem where. requires all sets to be hyperplanes in R-d. These special versions of the problems are also known to be NP-complete. When parameterizing by k, the Unique Cover problem has a polynomial size kernel for all the above geometric versions. The Exact Cover problem turns out to be W1]-hard for squares, but FPT for lines and hyperplanes. Further, we also consider the Unique Set Cover problem, which takes the same input and decides whether there is a set cover which covers at least k elements uniquely. To the best of our knowledge, this is a new problem, and we show that it is NP-complete (even for the case of lines). In fact, the problem turns out to be W1]-hard in the abstract setting, when parameterized by k. However, when we restrict ourselves to the lines and hyperplanes versions, we obtain FPT algorithms.

Phytomedicinal importance of Saraca asoca (Ashoka): an exciting past, an emerging present and a promising future

Since the dawn of civilization, natural resources have remained the mainstay of various remedial approaches of humans vis-a-vis a large number of illnesses. Saraca asoca (Roxb.) de Wilde (Saraca indica L.) belonging to the family Caesalpiniaceae has been regarded as a universal panacea in old Indian Ayurvedic texts and has especially been used to manage gynaecological complications and infections besides treating haemmorhagic dysentery, uterine pain, bacterial infections, skin problems, tumours, worm infestations, cardiac and circulatory problems. Almost all parts of the plant are considered pharmacologically valuable. Extensive folkloric practices and ethnobotanical applications of this plant have even lead to the availability of several commercial S. asoca formulations recommended for different indications though adulteration of these remains a pressing concern. Though a wealth of knowledge on this plant is available in both the classical and modern literature, extensive research on its phytomedicinal worth using state-of-the-art tools and methodologies is lacking. Recent reports on bioprospecting of S. asoca endophytic fungi for industrial bioproducts and useful pharmacologically relevant metabolites provide a silver lining to uncover single molecular bio-effectors from its endophytes. Here, we describe socio-ethnobotanical usage, present the current pharmacological status and discuss potential bottlenecks in harnessing the proclaimed phytomedicinal worth of this prescribed Ayurvedic medicinal plant. Finally, we also look into the possible future of the drug discovery and pharmaceutical R&D efforts directed at exploring its pharma legacy.

Anuario Argentino de Derecho Canónico, 2007, Vol. XIV (número completo)

Contenido: La anorexia y la bulimia como causas psicopatológicas de nulidad matrimonial / C. Baccioli – El acuerdo de 1957 / R. Bosca – Algunas consideraciones acerca de las presunciones jurídicas : aportes de la filosofía del derecho canónico / A. D. Busso – Los nuevos movimientos eclesiales y su encuadramiento canónico en la Iglesia particular / M. D. Colombo – Las relaciones diplomáticas entre el gobierno argentino y la Santa Sede : notas históricas sobre un posible concordato (1853-1892) / J. G. Durán – Abusos sexuales cometidos por clérigos y admisión al Orden Sagrado ¿un problema de homosexualidad? / R. D. Medina – Obispos y sexualidad : los cánones de Elvira como instrumento de disciplinamiento social / S. Panzram – Requisitos de prueba, la exigencia de un mínimo de prueba y la notoriedad en el derecho procesal medieval (siglos IX-XII) / M. Schmoeckel – Algunas consideraciones alrededor del canon 221 / H. A. von Ustinov – Notas – Documentos – Sentencias – Actualidad – Recensiones