4,168 research outputs found
CDM potential of wind power projects in India
No full textSo far, the cumulative installed capacity of wind power projects in India is far below their gross potential (È 15%) despite very high level of policy support, tax benefits, long term financing schemes etc, for more than 10 years etc. One of the major barriers is the high costs of investments in these systems. The Clean Development Mechanism (CDM) of the Kyoto Protocol provides industrialized countries with an incentive to invest in emission reduction projects in developing countries to achieve a reduction in CO2 emissions at lowest cost that also promotes sustainable development in the host country. Wind power projects could be of interest under the CDM because they directly displace greenhouse gas emissions while contributing to sustainable rural development, if developed correctly. Our estimates indicate that there is a vast theoretical potential of CO2 mitigation by the use of wind energy in India. The annual CER potential of wind power in India could theoretically reach 86 million tonnes. Under more realistic assumptions about diffusion of wind power projects based on past experiences with the government-run programmes, annual CER volumes by 2012 could reach 41 to 67 million and 78 to 83 million by 2020. The projections based on the past diffusion trend indicate that in India, even with highly favorable assumptions, the dissemination of wind power projects is not likely to reach its maximum estimated potential in another 15 years. CDM could help to achieve the maximum utilization potential more rapidly as compared to the current diffusion trend if supportive policies are introduced. --
Tensor tomography using V-line transforms with vertices restricted to a circle
No full textIn this article, we study the problem of recovering symmetric m-tensor fields (including vector fields) supported in a unit disk D from a set of generalized V-line transforms, namely longitudinal, transverse, and mixed V-line transforms, and their integral moments. We work in a circular geometric setup, where the V-lines have vertices on a circle, and the axis of symmetry is orthogonal to the circle. We present two approaches to recover a symmetric m-tensor field from the combination of longitudinal, transverse, and mixed V-line transforms. With the help of these inversion results, we are able to give an explicit kernel description for these transforms. We also derive inversion algorithms to reconstruct a symmetric m-tensor field from its first (m+1) integral moment longitudinal/transverse V-line transforms
Exact Exponential Algorithms for Clustering Problems
No full textIn this paper we initiate a systematic study of exact algorithms for some of the well known clustering problems, namely k-MEDIAN and k-MEANS. In k-MEDIAN, the input consists of a set X of n points belonging to a metric space, and the task is to select a subset C ⊆ X of k points as centers, such that the sum of the distances of every point to its nearest center is minimized. In k-MEANS, the objective is to minimize the sum of squares of the distances instead. It is easy to design an algorithm running in time max_{k ≤ n} {n choose k} n^(1) = ^*(2ⁿ) (here, ^*(⋅) notation hides polynomial factors in n). In this paper we design first non-trivial exact algorithms for these problems. In particular, we obtain an ^*((1.89)ⁿ) time exact algorithm for k-MEDIAN that works for any value of k. Our algorithm is quite general in that it does not use any properties of the underlying (metric) space - it does not even require the distances to satisfy the triangle inequality. In particular, the same algorithm also works for k-Means. We complement this result by showing that the running time of our algorithm is asymptotically optimal, up to the base of the exponent. That is, unless the Exponential Time Hypothesis fails, there is no algorithm for these problems running in time 2^o(n)⋅n^(1).
Finally, we consider the "facility location" or "supplier" versions of these clustering problems, where, in addition to the set X we are additionally given a set of m candidate centers (or facilities) F, and objective is to find a subset of k centers from F. The goal is still to minimize the k-Median/k-Means/k-Center objective. For these versions we give a (2ⁿ (mn)^(1)) time algorithms using subset convolution. We complement this result by showing that, under the Set Cover Conjecture, the "supplier" versions of these problems do not admit an exact algorithm running in time 2^{(1-ε) n} (mn)^(1)
CDM potential of SPV pumps in India
No full textSo far, the cumulative number of renewable energy systems such as Solar Photovoltaic (SPV) irrigation pumps in the agriculture sector in India is far below their theoretical potential despite government subsidy programmes. One of the major barriers are the high costs of investments in these systems. The Clean Development Mechanism (CDM) provides industrialized countries with an incentive to invest in emission reduction projects in developing countries to achieve a reduction in CO2 emissions at lowest cost that also promotes sustainable development in the host country. Solar Photovoltaic (SPV) irrigation pumps could be of interest under the CDM because they directly displace greenhouse gas emissions while contributing to sustainable rural development. However, there is only one SPV project under the CDM so far. --Clean Development Mechanism,Agriculture,Renewable Energy,CO2 Emissions,Solar Photovoltaic Pumps,India
A C++-embedded Domain-Specific Language for programming the MORA soft processor array
No full textMORA is a novel platform for high-level FPGA programming of streaming vector and matrix operations, aimed at multimedia applications. It consists of soft array of pipelined low-complexity SIMD processors-in-memory (PIM). We present a Domain-Specific Language (DSL) for high-level programming of the MORA soft processor array. The DSL is embedded in C++, providing designers with a familiar language framework and the ability to compile designs using a standard compiler for functional testing before generating the FPGA bitstream using the MORA toolchain. The paper discusses the MORA-C++ DSL and the compilation route into the assembly for the MORA machine and provides examples to illustrate the programming model and performance
BEACH 2008, proceedings of the 8th International Conference on Beauty, Charm and Hyperons in Hadronic Interactions, University of South Carolina, Columbia, SC (USA) 22-28 June 2008
No full textMeasurement of the CKM matrix element |V(ub)| with B ---> rho e nu decays
No full textWe present a measurement of the branching fraction for the rare decays B-->rhoenu and extract a value for the magnitude of V-ub, one of the smallest elements of the Cabibbo-Kobayashi-Maskawa quark-mixing matrix. The results are given for five different calculations of form factors used to parametrize the hadronic current in semileptonic decays. Using a sample of 55x10(6) B (B) over bar meson pairs recorded with the BABAR detector at the PEP-II e(+)e(-) storage ring, we obtain B(B-0-->rho(-)e(+)nu)=(3.29+/-0.42+/-0.47+/-0.55)x10(-4) and \V-ub\=(3.64+/-0.22+/-0.25(-0.56)(+0.39))x10(-3), where the uncertainties are statistical, systematic, and theoretical, respectively
Nucleon Structure Functions from ν_µ-Fe Interactions and a Study of the Valence Quark Distribution
No full textData were taken in 1979-80 by the CCFRR high energy neutrino experiment at Fermilab. A total of 150,000 neutrino and 23,000 antineutrino charged current events in the approximate energy range 25 < Ev < 250 GeV are measured and analyzed. The structure functions F2 and xF3 are extracted for three assumptions about σL/σT: R = 0., R = 0.1 and R = a QCD based expression. Systematic errors are estimated and their significance is discussed. Comparisons or the X and Q2 behaviour or the structure functions with results from other experiments are made.
We find that statistical errors currently dominate our knowledge of the valence quark distribution, which is studied in this thesis. xF3 from different experiments has, within errors and apart from level differences, the same dependence on x and Q2, except for the HPWF results. The CDHS F2 shows a clear fall-off at low-x from the CCFRR and EMC results, again apart from level differences which are calculable from cross-sections.
The result for the the GLS rule is found to be 2.83 ± .15 ± .09 ± .10 where the first error is statistical, the second is an overall level error and the third covers the rest of the systematic errors. QCD studies of xF3 to leading and second order have been done. The QCD evolution of xF3, which is independent of R and the strange sea, does not depend on the gluon distribution and fits yield
ʌLO = 88+163-78 +113-70MeV
The systematic errors are smaller than the statistical errors. Second order fits give somewhat different values of ʌ, although αs (at Q20 = 12.6 GeV2) is not so different.
A fit using the better determined F2 in place of xF3 for x > 0.4 i.e., q = 0 in that region, gives
ʌLO = 266+114-104 +85-79MeV
Again, the statistical errors are larger than the systematic errors. An attempt to measure R was made and the measurements are described. Utilizing the inequality q(x) ≥ 0 we find that in the region x > .4 R is less than 0.55 at the 90% confidence level.</p
Detection of ionizing radiations by studying ceramic tiles materials using thermoluminescence technique
No full text- …
