A Competence Approach to ICT Knowledge in Relation to Occupation: A Study of Indian Universities

Information and Communication Technology ICT has affected every facet of student faculty and researcher s life In Higher education system of India there is extensive involvement of ICT in colleges and universities To encourage the ICT based teaching and learning methodologies in Indian universities government had taken many rigorous steps on time The vision of Indian Prime minister is to empower every resident either urban or rural have to access the digital services knowledge and information through ICT Therefore researcher felt to investigate the ICT knowledge among students teachers and research scholars those are studying in Indian universities Many of universities either government or private are supporting the utilization of various ICT based teaching and learning practice This study describes the ICT knowledge between students and faculty in relation to their occupatio

Performance of free space optical communication using M-array receivers at atmospheric conditions

Abstract: In free space optical (FSO) communication links, atmospheric parameters including absorption, scattering and turbulence have significant impacts on the quality of laser beams propagating through the atmosphere. Absorption and/or scattering, due to atmospheric particles result in optical losses, whereas turbulence contributes to the intensity scintillation that can severely impair the operation of FSO communications systems. In this paper, using a modified model we analyze the atmospheric effects on the signal-to-noise ratio (SNR) and the bit error rate (BER) of an FSO system. We show that there is an improvement in BER when using M-array receivers instead of one a single receiver

Efficient Entanglement Measure for Graph States

In this paper, we study the multipartite entanglement properties of graph states up to seven qubits. Our analysis shows that the generalized concurrence measure is more efficient than geometric entanglement measure for measuring entanglement quantity in the multi-qubit graph states.Comment: 10 pages, 4 table

An Intelligent Approach To Discrete Sampling Of Parametric Curves

In graphics and animation applications, two of the problems are: (1) representation of an analytic curve by a discrete set of sampled points and (2) determining the similarity between two parametric curves. It is necessary to measure the accuracy of approximation and to have a metric to calculate the disparity between two parametric curves. Both of these problems have been associated with the reparameterization of the curves with respect to arc length. One of the methods uses Gaussian Quadrature to determine the arc length parameterization [Guenter and Parent 1990], while another interesting technique is a simple approximation method [Fritsch and Nielson 1990]. There are various ways to compute the similarity between two curves. For 2D Cartesian curves, max norm yields a satisfactory distance metric. For parametric curves, Euclidean norm is frequently used. Arc length is reasonable parameterization, but explicit arc length parameterization is not easy to compute for arbitrary parametric curves. We give a new technique for discretizing parametric curves. These sampled points can be used to approximate curves, determine arc length parameterization, and similarity between them. This technique is accurate, robust and simpler to implement. Comparisons of the previous methods with the new one is presented

Blended Root Finding Algorithm Outperforms Bisection and Regula Falsi Algorithms

Finding the roots of an equation is a fundamental problem in various fields, including numerical computing, social and physical sciences. Numerical techniques are used when an analytic solution is not available. There is not a single algorithm that works best for every function. We designed and implemented a new algorithm that is a dynamic blend of the bisection and regula falsi algorithms. The implementation results validate that the new algorithm outperforms both bisection and regula falsi algorithms. It is also observed that the new algorithm outperforms the secant algorithm and the Newton-Raphson algorithm because the new algorithm requires fewer computational iterations and is guaranteed to find a root. The theoretical and empirical evidence shows that the average computational complexity of the new algorithm is considerably less than that of the classical algorithms