A modern Hindu concept of inter-religious dialogue

Dialogue has become a fashionable word in the theological circles for quite some time now. However, there is a need to review what has been achieved so far. If it is significant, we should then review how much religious tension has been reduced so far. If it is not much, why has there been no progress. In this note I will deal with the issues relating to Hindu-Christian dialogue. I am using Christianity only as a reference point, and the issues raised do have a wider context as well. As far as Hindu-Christian dialogue is concerned, I am of the opinion that there has been hardly any progress all these years. Many academics and theologians have been involved in the exercise so far. The whole literature, over a long period of time, seems to follow a familiar pattern – a discussion on the theory of the dialogue, what should be included in a dialogue, who should and should not be involved in a dialogue, and ends with a lament that there is so very little progress. The problem, according to me, is that the dialogue does not even consider a need to discuss what is the basic difference between Hinduism and Christianity, and an inquiry into whether these come in the way of communal harmony. A dialogue is really not necessary if we are to discuss only what is similar between the two systems. ..

A New Class of Supersymmetric Theories

We construct a class of quantum mechanical theories which are invariant under fermionic transformations similar to supersymmetry transformations. The generators of the transformations in this case, however, satisfy a BRST-like algebra.Comment: 9 page

Non-blocking Priority Queue based on Skiplists with Relaxed Semantics

Priority queues are data structures that store information in an orderly fashion. They are of tremendous importance because they are an integral part of many applications, like Dijkstra’s shortest path algorithm, MST algorithms, priority schedulers, and so on. Since priority queues by nature have high contention on the delete_min operation, the design of an efficient priority queue should involve an intelligent choice of the data structure as well as relaxation bounds on the data structure. Lock-free data structures provide higher scalability as well as progress guarantee than a lock-based data structure. That is another factor to be considered in the priority queue design. We present a relaxed non-blocking priority queue based on skiplists. We address all the design issues mentioned above in our priority queue. Use of skiplists allows multiple threads to concurrently access different parts of the skiplist quickly, whereas relaxing the priority queue delete_min operation distributes contention over the skiplist instead of just at the front. Furthermore, a non-blocking implementation guarantees that the system will make progress even when some process fails. Our priority queue is internally composed of several priority queues, one for each thread and one shared priority queue common to all threads. Each thread selects the best value from its local priority queue and the shared priority queue and returns the value. In case a thread is unable to delete an item, it tries to spy items from other threads\u27 local priority queues. We experimentally and theoretically show the correctness of our data structure. We also compare the performance of our data structure with other variations like priority queues based on coarse-grained skiplists for both relaxed and non-relaxed semantics