An investigation to study the feasibility of on-line bibliographic information retrieval system using an APP

This thesis was submitted for the degree of Doctor of Philosophy and was awarded by Brunel University.This thesis reports an investigation on the feasibility study of a searching mechanism using an APP suitable for an on-line bibliographic retrieval, operation, especially for retrospective searches. From the study of the searching methods used in the conventional systems it is seen that elaborate file- and data- structures are introduced to improve the response time of the system. These consequently lead to software and hardware redundancies. To mask these complexities of the system an expensive computer with higher capabilities and more powerful instruction set is commonly used. Thus the service of the systen becomes cost-ineffective. On the other hand the primitive operations of a searching mechanism, such as, association, domain selection, intersection and unions, are the intrinsic features of an associative parallel processor. Therefore it is important to establish the feasibility of an APP as a cost-effective searching mechanise. In this thesis a searching mechanism using an 'ON-THE-FLY' searching technique has been proposed. The parallel search unit uses a Byte-oriented VRL-APP for efficient character string processing. At the time of undertaking this work the specification for neither the retrieval systems nor the BO-VRL APP's were well established; hence a two-phase investigation was originated. In the Phase I of the work a bottom up approach was adopted to derive a formal and precise specification for the BO-VRL-APP. During the Phase II of the work a top-down approach was opted for the implementation of the searching mechanism. An experimental research vehicle has been developed to establish the feasibility of an APP as a cost-effective searching mechanism. Although rigorous proof of the feasibility has not been obtained, the thesis establishes that the APP is well suited for on-line bibligraphic information retrieval operations where substring searches including boolean selection and threshold weights are efficiently supported

Analytical Design of Feature based Ranking

AbstractIn this paper, a new method is introduced to calculate the ranking of a Web-page in a Search Engine. We have considered inbound and outbound Web-page links, Session time spent in the Web-page, Relevancy of the Web-page with the searching string and Web Traffic for the Web-page as decisive factors. These factors are measured dynamically and generate a numeric value, termed as Decisive Factor (DF). These Decisive Factors are calculated by newly introduced mathematical equations. Finally, all Decisive Factors are integrated to find the final ranking of the particular Web-pages. Since the access to a Web-page is often unpredictable, this type of Web-page ranking of dynamic nature is highly desirable to obtain more efficient and accurate Web-page ranking

Priority based K-Erlang Distribution Method in Cloud Computing

Abstract — In this paper, we have proposed a priority based service time distribution method using Erlang Distribution for K-phases. The process of entering into the cloud is typically based on the priority of the service and form a queue. Each user needs to wait until the current user is being served if priority of the service is same, as per the First Come First Served policy. If the server is busy, then the user request has to be waited in the queue until the current user receives the result of the prescribed tasks. We have considered a priority class refers to a collection of all customers having the same priority. We introduce M/E K/1 model for a priority based single server and M/EK/2 model for priority based two servers in each class in cloud computing scenario to reduce overall mean queue length and waiting time. We have considered a single server and two server retrial queueing systems in which We considered a single server and two server queues with three classes of customers