scispace - formally typeset
Search or ask a question
Institution

Narula Institute of Technology

About: Narula Institute of Technology is a based out in . It is known for research contribution in the topics: Quantum dot cellular automaton & Cognitive radio. The organization has 288 authors who have published 490 publications receiving 2258 citations. The organization is also known as: NiT.


Papers
More filters
Journal ArticleDOI
TL;DR: In this article, the energy values for the first 14 states of helium arising out of two electrons having equal azimuthal quantum number are calculated by using Ritz variational method.
Abstract: Highly precise energy values for the first 14 ${^{3}P}^{e}$ bound states of helium arising out of two electrons having equal azimuthal quantum number are being calculated by using Ritz variational method. The present calculated upper bound energies are lowest yet obtained. Resonance energies and widths for a wide range of resonance states $({^{3}P}^{e})$ of helium below $N=3--5$ ionization threshold of ${\text{He}}^{+}$ have also been evaluated by using stabilization method. The present resonance parameters for the region below $N=3--5$ ionization threshold of ${\text{He}}^{+}$ are in excellent agreement with the few available accurate theoretical results. Moreover in the present paper, the resonance parameters of ${^{3}P}^{e}$ resonance states below $N=6$ and 7 ionization thresholds of ${\text{He}}^{+}$ are also reported.

27 citations

Journal ArticleDOI
TL;DR: Kernel clustering of only object data, X = { x1, ...,xn } ⊂ Rp, is focused on and Sammon's nonlinear projection method is proposed to get a crude visual representation of the data in the kernel space.
Abstract: In the recent past, different kernelized versions of c-means (hard and fuzzy) clustering algorithms have been proposed. Here, we focus on kernel clustering of only object data, X = { x1, ...,xn } ⊂ Rp. We first raise a basic question: Should we really cluster any given object data in the kernel space? The answer is NO! Here are our line of arguments: 1) The objective of any clustering algorithm is to find natural subgroups in X, where the subgroups are defined by a measure of similarity between the vectors in X. 2) If we transform the data X into Y in another space by a nonlinear transformation and try to find clusters in Y, then such clusters can be useful if and only if Y helps us to find the same clusters that are present in X because that is our objective. 3) If Y maintains the same structure/topology as that of X, then the use of Y may not give any advantage. 4) On the other hand, if Y changes the structure (i.e., imposes a new structure) on the data and that change makes the extraction of the desired clusters present in X easier, then clustering of Y is useful. 5) But when Y imposes new (nonexistent) structures, the clustering algorithm may find very strange clusters with no relation to the actual clusters present in X. 6) Thus, when we try to cluster in a transformed space, the issue is to know if it could help us to find the clusters present in X. To get any benefit from kernel clustering (or clustering in any other transformed space), we need to answer this question first; otherwise, we may find completely irrelevant clusters without knowing it and thereby making kernel clustering useless. 7) This issue is a philosophical one and is neither dependent on the choice of clustering algorithm nor on the particular transformation (kernel function) used. 8) Except for 2-D/3-D data, we do not know of any way to answer the question in 6) and for 2-D/3-D data, since we can look at the data, we do not need kernel clustering. Therefore, there is no benefit from kernel clustering. We demonstrate and justify our claims using both synthetic and real datasets with visual assessment as well as with normalized mutual information, adjusted Rand index, and cluster instability. We propose to use Sammon's nonlinear projection method to get a crude visual representation of the data in the kernel space. We discuss the issue of how to choose appropriate parameters of the kernel function, but we could not provide a solution to this problem. Finally, we discuss how the kernel parameters and the algorithmic parameters interact.

27 citations

Proceedings ArticleDOI
01 Feb 2014
TL;DR: An observer based dynamic reputation estimation technique for detection of selfish nodes where a group of independent roving observer nodes were introduced in the network to monitor the behavior of volunteer nodes as forwarder and receiver and to identify whether a node has any group-bias.
Abstract: Aftermath of disaster causes severe destruction/damage to physical infrastructures. As a result, communication infrastructure gets disrupted for weeks. In such situations, smart-phone based adhoc opportunistic networks may be set up with the smart-phones carried by the relief workers (also referred as nodes) to communicate the situational information from different affected corners to some remote monitoring station. In such scenario, some malicious nodes may try to intercept and manipulate the sensitive situational data with the intention of corruption and fraud. One way of preventing such corruption is to devise an automated mechanism to detect and avoid the malicious nodes during data communication process. Reputation of nodes may be used as a measure to detect malicious nodes where reputation is estimated based on their degree of cooperation with other nodes in the network during data communication. In this paper, we propose an observer based dynamic reputation estimation technique for detection of selfish nodes where a group of independent roving observer nodes were introduced in the network to monitor the behavior of volunteer nodes as forwarder and receiver and to identify whether a node has any group-bias. Observers estimate the reputation of nodes based on their interaction patterns and group-biasness and periodically publishes global node reputation matrix based on which volunteer nodes may select an unselfish forwarder node during their data communication. The performance of the proposed scheme was evaluated on ONE simulator [19].

25 citations

Journal ArticleDOI
TL;DR: In this paper, a physics-based Quantum-Modified CLassical Drift-Diffusion (QMCLDD) non-linear mathematical model has been developed for design and characterisation of GaN/AlGaN asymmetrical superlattice pin based single-pole single-throw (SPST) and singlepole multi-throw(SPMT) switches for sub-MM wave communication systems.
Abstract: A physics-based Quantum-Modified CLassical Drift–Diffusion (QMCLDD) non-linear mathematical model has been developed for design and characterisation of GaN/AlGaN asymmetrical superlattice pin based single-pole single-throw (SPST) and single-pole multi-throw (SPMT) switches for sub-MM wave communication systems The simulator has incorporated several important physical phenomena that arise in superlattice structure, including quantum confinement effects, generation-recombination and tunnelling generation of carriers as well as scattering limited carrier mobility and velocity in GaN/AlGaN structure In order to reduce the dislocation density and in turn the series resistance in GaN/AlGaN heterostructure, thin AlN nucleation layer and a buffer layer are considered in the simulation It is observed that the RF series resistance of the pin device, operating around 02 THz frequency regime, reduces in case of proposed superlattice structure The advantages of super-lattice pin diode over the conventional Si devices are the faster reverse recovery time (~ 9 vs 35 ns) and lowering of forward RF series resistances (039 vs 120 Ω) This study also reveals that SPST and SPMT switches made up with super-lattice devices are characterized by low insertion loss (~ 013 and 015 dB, respectively) and high isolation (~ 654 and 825 dB, respectively) A good agreement between theory and experiment establishes the superiority of the present model over the others A comparative analysis of Si and GaN/AlGaN super-lattice pin SPST and SPMT switches establishes the potential of the later for its application in high-frequency THz-communication In addition to this, a detailed thermal modelling of the device has also been done to make the analysis more realistic The junction temperature of the designed GaN/AlGaN superlattice pin switch will be as high as 377 K, which is quite moderate compared to its flat profile counterpart To the best of authors’ knowledge, this is the first ever report on QMCLDD non-linear modelling of pin SPST and SPMT switches (series-shunt combination) at THz-arena

24 citations

Journal ArticleDOI
TL;DR: A fuzzy goal programming approach with the use of genetic algorithm (GA) for proper deployment of patrol manpower to various road-segment areas in urban environment in different shifts of a time period to deterring violation of traffic rules and thereby reducing the accident rates in a traffic control planning horizon is demonstrated.
Abstract: This article demonstrates a fuzzy goal programming (FGP) approach with the use of genetic algorithm (GA) for proper deployment of patrol manpower to various road-segment areas in urban environment in different shifts of a time period to deterring violation of traffic rules and thereby reducing the accident rates in a traffic control planning horizon. To expound the potential use of the approach, a case example of the city Kolkata, West Bengal, INDIA, is solved.

24 citations


Authors

Showing all 288 results

Network Information
Related Institutions (5)
National Institute of Technology, Rourkela
10.7K papers, 150.1K citations

80% related

Indian Institute of Technology Guwahati
17.1K papers, 257.3K citations

79% related

Jadavpur University
27.6K papers, 422K citations

78% related

Anna University
19.9K papers, 312.6K citations

78% related

Indian Institute of Technology Roorkee
21.4K papers, 419.9K citations

78% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202233
202142
202076
201939
201828
201736