16,334 research outputs found

    URL Recommender using Parallel Processing

    Get PDF
    The main purpose of this project is to section similar news and articles from a vast variety of news articles. Let’s say, you want to read about latest news related to particular topic like sports. Usually, user goes to a particular website and goes through some news but he won’t be able to cover all the news coverage in a single website. So, he would be going through some other news website to checking it out and this continues. Also, some news websites might be containing some old news and the user might be going through that. To solve this, I have developed a web application where in user can see all the latest news from different websites in a single place. Users are given choice to select the news websites from which they want to view the latest news. The articles which we get from news websites are very random and we will be applying the DBSCAN algorithm and place the news articles in the cluster form for each specific topic for user to view. If the user wants to see sports, he will be provided with sports news section. And this process of extracting random news articles and forming news clusters are done at run time and at all times we will get the latest news as we will be extracting the data from web at run time. This is an effective way to watch all news at single place. And in turn this can be used as articles (URL) recommender as the user has to just go through the specific cluster which interests him and not visit all news websites to find articles. This way the user does not have to visit different sites to view all latest news. This idea can be expanded to not just news articles but also in other areas like collecting statistics of financial information etc. As the processing is done at runtime, the performance has to be improved. To improve the performance, the distributed data mining is used and multiple servers are being used which communicate with each other

    Accessing Linearly Polarized Gluon Distribution in J/ψJ/\psi Production at the Electron-Ion Collider

    Full text link
    We calculate the cos 2ϕcos~2 \phi asymmetry in J/ψJ/\psi production in electron-proton collision for the kinematics of the planned electron-ion collider (EIC). This directly probes the Weisz\"acker-Williams (WW) type linearly polarized gluon distribution. Assuming generalized factorization, we calculate the asymmetry at next-to-leading-order (NLO) when the energy fraction of the J/ψJ/\psi satisfies z<1z<1 and the dominating subprocess is γ+gc+cˉ+g\gamma^* +g \rightarrow c + {\bar c}+g. We use non-relativistic QCD based color singlet model for J/ψJ/\psi production. We investigate the small xx region which will be accessible at the EIC. We present the upper bound of the asymmetry, as well as estimate it using a (i) Gaussian type parametrization for the TMDs and (ii) McLerran-Venugopalan model at small xx. We find small but sizable asymmetry in all the three cases.Comment: Version to appear in Phys. Rev.

    Tobacco and Intra Ocular Pressure

    Get PDF
    Glaucoma is an optic nerve disorder caused by raised intraocular pressure. Among many drugs and agents causing glaucoma, tobacco has been found to be one of the important agents. It is important for the clinical practitioners as well as the general population to be aware of the ill effects of tobacco on ocular circulation and intra ocular pressure

    Super-Fast 3-Ruling Sets

    Get PDF
    A tt-ruling set of a graph G=(V,E)G = (V, E) is a vertex-subset SVS \subseteq V that is independent and satisfies the property that every vertex vVv \in V is at a distance of at most tt from some vertex in SS. A \textit{maximal independent set (MIS)} is a 1-ruling set. The problem of computing an MIS on a network is a fundamental problem in distributed algorithms and the fastest algorithm for this problem is the O(logn)O(\log n)-round algorithm due to Luby (SICOMP 1986) and Alon et al. (J. Algorithms 1986) from more than 25 years ago. Since then the problem has resisted all efforts to yield to a sub-logarithmic algorithm. There has been recent progress on this problem, most importantly an O(logΔlogn)O(\log \Delta \cdot \sqrt{\log n})-round algorithm on graphs with nn vertices and maximum degree Δ\Delta, due to Barenboim et al. (Barenboim, Elkin, Pettie, and Schneider, April 2012, arxiv 1202.1983; to appear FOCS 2012). We approach the MIS problem from a different angle and ask if O(1)-ruling sets can be computed much more efficiently than an MIS? As an answer to this question, we show how to compute a 2-ruling set of an nn-vertex graph in O((logn)3/4)O((\log n)^{3/4}) rounds. We also show that the above result can be improved for special classes of graphs such as graphs with high girth, trees, and graphs of bounded arboricity. Our main technique involves randomized sparsification that rapidly reduces the graph degree while ensuring that every deleted vertex is close to some vertex that remains. This technique may have further applications in other contexts, e.g., in designing sub-logarithmic distributed approximation algorithms. Our results raise intriguing questions about how quickly an MIS (or 1-ruling sets) can be computed, given that 2-ruling sets can be computed in sub-logarithmic rounds

    Applications of quantum cryptographic switch: Various tasks related to controlled quantum communication can be performed using Bell states and permutation of particles

    Full text link
    Recently, several aspects of controlled quantum communication (e.g., bidirectional controlled state teleportation, controlled quantum secure direct communication, controlled quantum dialogue, etc.) have been studied using nn-qubit (n3n\geq3) entanglement. Specially, a large number of schemes for bidirectional controlled state teleportation are proposed using mm-qubit entanglement (m{5,6,7}m\in\{5,6,7\}). Here, we propose a set of protocols to illustrate that it is possible to realize all these tasks related to controlled quantum communication using only Bell states and permutation of particles (PoP). As the generation and maintenance of a Bell state is much easier than a multi-partite entanglement, the proposed strategy has a clear advantage over the existing proposals. Further, it is shown that all the schemes proposed here may be viewed as applications of the concept of quantum cryptographic switch which was recently introduced by some of us. The performances of the proposed protocols as subjected to the amplitude damping and phase damping noise on the channels are also discussed.Comment: 12 pages, 3 figure
    corecore