Papers by Rajendra Prasath
International Journal of Thermal Sciences, 2010
Page 1. AbstractThe fundamental aim of extended expansion concept is to achieve higher work done... more Page 1. AbstractThe fundamental aim of extended expansion concept is to achieve higher work done which in turn leads to higher thermal efficiency. This concept is compatible with the application of turbocharger and LHR engine. ...
Distributed processes with message passing strategy, communicate among themselves by exchanging p... more Distributed processes with message passing strategy, communicate among themselves by exchanging pieces of information to perform exclusive access to achieve the tasks in a distributed fashion. In this paper, we consider sorting and prefix computation problems with n elements distributed over a number of communication processors in a distributed system. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of elements at intermediate processors. Also all processors do not necessarily perform the disjoint comparison exchange operations and the proposed algorithm works with the identity of processors. The proposed algorithms are based on token based message passing strategy for distributed sorting and prefix computation problems on static ad hoc mobile networks. These algorithms could possibly be extended to dynamic ad hoc mobile networks.
In this paper, we consider sorting problem with n elements distributed over a number of processin... more In this paper, we consider sorting problem with n elements distributed over a number of processing entities in a distributed system. We have derived an alternative, efficient algorithm with the worst case lower bound of (n − 1) rounds for distributed sorting on a line network, where n is the number of processors. The proposed distributed sorting algorithm improves the performance of each processor without creating copies of (n − 2) elements at intermediate processors and reduces the execution time of Sasaki's time−optimal algorithm [A.Sasaki, A time-optimal distributed sorting algorithm on a line network, Inform. Process. Lett., 83(2002) pp. 21-26]. Also all processors do not necessarily perform the disjoint comparison-exchange operations and simulation results show that the proposed algorithm results in better execution time with the identity of processors. This algorithm could also be extended for sorting the distributed elements on the linear embedding obtained from a general network.
We envisage retrieval in textual case-based reasoning (TCBR) as an instance of abductive reasonin... more We envisage retrieval in textual case-based reasoning (TCBR) as an instance of abductive reasoning. The two main subtasks underlying abductive reasoning are ‘hypotheses generation’ where plausible case hypotheses are generated, and ‘hypothesis testing’ where the best hypothesis is selected among these in sequel. The central idea behind the presented two-stage retrieval model for TCBR is that recall relies on lexical equality of features in the cases while recognition requires mining higher order semantic relations among features. The proposed account of recognition relies on a special representation called random indexing, and applies a method that simultaneously performs an implicit dimension reduction and discovers higher order relations among features based on their meanings that can be learned incrementally. Hence, similarity assessment in recall is computationally less expensive and is applied on the whole case base while in recognition a computationally more expensive method is employed but only on the case hypotheses pool generated by recall. It is shown that the two-stage model gives promising results.
Case Based Reasoning(CBR), an artificial intelligence technique, solves new problem by reusing so... more Case Based Reasoning(CBR), an artificial intelligence technique, solves new problem by reusing solutions of previously solved similar cases. In conventional CBR, cases are represented in terms of structured attribute-value pairs. Acquisition of cases, either from domain experts or through manually crafting attribute-value pairs from incident reports, constitutes the main reason why CBR systems have not been more common in industries. Manual case generation is a laborious, costlier and time consuming task. Textual CBR (TCBR) is an emerging line that aims to apply CBR techniques on cases represented as textual descriptions. Similarity of cases is based on the similarity between their constituting features. Conventional CBR benefits from employing domain specific knowledge for similarity assessment. Correspondingly, TCBR needs to involve higher-order relationships between features, hence domain specific knowledge. In addition, the term order has also been contended to influence the similarity assessment. This paper presents an account where features and cases are represented using a distributed representation paradigm that captures higher-order relations among features as well as term order information.
This paper presents a potential seed selection algorithm for web crawlers using a gain - share sc... more This paper presents a potential seed selection algorithm for web crawlers using a gain - share scoring approach. Initially we consider a set of arbitrarily chosen tourism queries. Each query is given to the selected N commercial Search Engines (SEs); top m search results for each SE are obtained, and each of these m results is manually evaluated and assigned a relevance score. For each of m results, a gain - share score is computed using their hyperlinks structure across N ranked lists. Gain score of each link present in each of m results and a portion of the gain score is propagated to the share score of each of m results. This updated share scores of each of m results determine the potential set of seed URLs for web crawling. Experimental results on tourism related web data illustrate the effectiveness of the proposed seed selection algorithm.
Uploads
Papers by Rajendra Prasath