Showing papers by "Prafulla Kumar Behera published in 2015"
TL;DR: In this paper, the authors presented the physics potential of the ICAL detector as obtained from realistic detector simulations and gave the expected physics reach of the detector with 10 years of runtime.
Abstract: The upcoming 50 kt magnetized iron calorimeter (ICAL) detector at the India-based Neutrino Observatory (INO) is designed to study the atmospheric neutrinos and antineutrinos separately over a wide range of energies and path lengths. The primary focus of this experiment is to explore the Earth matter effects by observing the energy and zenith angle dependence of the atmospheric neutrinos in the multi-GeV range. This study will be crucial to address some of the outstanding issues in neutrino oscillation physics, including the fundamental issue of neutrino mass hierarchy. In this document, we present the physics potential of the detector as obtained from realistic detector simulations. We describe the simulation framework, the neutrino interactions in the detector, and the expected response of the detector to particles traversing it. The ICAL detector can determine the energy and direction of the muons to a high precision, and in addition, its sensitivity to multi-GeV hadrons increases its physics reach substantially. Its charge identification capability, and hence its ability to distinguish neutrinos from antineutrinos, makes it an efficient detector for determining the neutrino mass hierarchy. In this report, we outline the analyses carried out for the determination of neutrino mass hierarchy and precision measurements of atmospheric neutrino mixing parameters at ICAL, and give the expected physics reach of the detector with 10 years of runtime. We also explore the potential of ICAL for probing new physics scenarios like CPT violation and the presence of magnetic monopoles.
151 citations
TL;DR: In this article, a search for high-mass resonances decaying into tau(+)tau(-) final states using proton-proton collisions at root s = 7 TeV produced by the Large Hadron Collider is presented.
58 citations
TL;DR: A survey was undertaken to different rice ecologies to collect, identify and conserve the weed species as herbarium specimens in coastal districts of Orissa to find out the number of weed species in upland followed by irrigated, semi deep water and deep water.
Abstract: A survey was undertaken to different rice ecologies to collect, identify and conserve the weed species as herbarium specimens in coastal districts of Orissa. In this programme, 201 angiosperm taxa and 3 pteridophytes under 146 genera belonging to 56 families were collected, identified and documented. Poaceae was the dominant family followed by Fabaceae and Cyperaceae. Families are arranged according to modified Bentham and Hooker’s system of classification in the enumeration. Genus and species were arranged alphabetically under each family and genus. The number of weed species was more in upland followed by irrigated, semi deep water and deep water.Conservation strategies are also highlighted in this paper.
4 citations
4 citations
TL;DR: Since clustering technique is used for group processing of information, group signature techniques is being applied here for secured data processing.
Abstract: Due to the growth in prominence of Web, there is a need for proficient system administration. Network visibility becomes very crucial for traffic engineering and network management. A large number of users demands varied information at a given time. By identifying the users that demand same type of information and clustering them into different groups, the Internet accessibility and resource utilization can be improved. The most popular solutions for network management are Deep Packet Inspection algorithm, In-Depth Packet Inspection algorithm and some related statistical classification technologies. All these solutions depend on the availability of a training set. Supervised (classification) and unsupervised (clustering) algorithms are used for identification of the network traffic. Network traffic analysis always depends on various parameters such as the data to be searched, the time of searching, available bandwidth, number of accessing users, architecture of the network system, etc. For simplicity, the type of data and the data rate was considered for this implementation. Due to clustering, automatic identification of the classes of traffic was achieved. Since clustering technique is used for group processing of information, group signature techniques is being applied here for secured data processing.
3 citations
01 Jan 2015
TL;DR: An DG traversal dynamic slicing algorithm for dynamic slicing of object-oriented programs in presence of inheritance is proposed, which can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering, maintenance etc.
Abstract: This paper proposes an DG traversal dynamic slicing algorithm for dynamic slicing of object-oriented programs in presence of inheritance, which can facilitate various software engineering activities like program comprehension, testing, debugging, reverse engineering, maintenance etc This paper creates an intermediate program representation called dynamic graph to represent the execution trace of an object-oriented program Then the proposed slicing algorithm is applied on the intermediate representation to compute the dynamic slice The advantage of this approach is that, the intermediate program representation is small, hence needs less memory to store and the proposed algorithm is space efficient as well as time efficient and computes precise dynamic slices