Search Engines In Order Research Articles

Web accessibility awareness in search engine results

The enormous amount of information available on the Internet requires the use of search engines in order to find specific information. As far as web accessibility is concerned, search engines contain two kinds of barriers: on the one hand, the interfaces for making queries and accessing results are not always accessible; on the other hand, web accessibility is not taken into account in information retrieval (IR) processes. Consequently, in addition to interface problems, accessing the items in the list of results tends to be an unsatisfactory experience for people with disabilities. Some groups of users cannot take advantage of the services provided by search engines, as the results are not useful due to their accessibility restrictions. The goal of this paper is to propose the integration of web accessibility measurement into information retrieval processes. Firstly, quantitative accessibility metrics are defined in order to accurately measure the accessibility level of web pages. Secondly, a model to integrate these metrics within IR processes is proposed. Finally, a prototype search engine which re-ranks results according to their accessibility level based on the proposed model is described.

Is Google the answer? A study into usability of search engines

PurposeThe purpose of this paper is to discuss the importance of usability and overall user satisfaction when comparing performance of different search engines.Design/methodology/approachThe study described in this paper starts from an investigation of existing methodologies for evaluating search engines in order to find out what are the most important factors for users to decide which system to use when searching the World Wide Web.FindingsThis study confirmed that usability and popularity are closely linked. This study has shown that no one‐search engine holds the key to ultimate search results. Just as there is cultural, political and geographical differences in the world's population, there are a number of search engines to fit the individual needs of every net citizen. Whereas results, precision, recall and reliability are the factors which participants prize highly, regardless of all other aspects. It was found that the speed of search engine results has become a high priority to participants.Research limitations/implicationsNumber of participants was limited and although some questions were confusing to some individuals, a majority of questionnaires were completed in a satisfactory fashion.Originality/valueThis paper describes a usability study involving different search engines looking at links between popularity and usability.

Models of Return to Work for Musculoskeletal Disorders

Musculoskeletal pain disorders are the most prevalent, costly, disabling, and commonly researched conditions in the workplace, yet the development of overarching conceptual models of return to work (RTW) in these conditions has been lagging. A critical review of the literature was performed using multiple medical and health search engines in order to provide an evaluation of the evolution and the state of the art of health and disability models with a focus on specific models of RTW. The main tenets, implications for diagnosis, treatment, and disability compensation, are the key perspectives analyzed for the following specific models of RTW: biomedical, psychosocial, forensic, ecological/case management, biopsychosocial, and two more recent models developed by the Institute of Medicine and the World Health Organization, respectively. Future development of models that are truly transdisciplinary, and address temporal and multidimensional aspects of occupational disability, remains a goal.

A New Filtering Algorithm for Duplicate Document Based on Concept Analysis

Data bases and web pages contain currently a huge number of duplicate document. It is then fundamental to have a filter which can be embedded, for instance, within an information retrieval system like a search engine in order to prohibit the redundant documents references to appear on the screen as a reply to the user's query. This filter can save the user time and increases his satisfaction. In this study, we propose a new algorithm based on concept analysis principle, which can act as a filter for duplicate document. It can be applied on a collection of documents or databases and reduce their storage spaces by eliminating redundant documents without loosing knowledge. Our experiments show that this algorithm increases the precision of the information retrieval system and improves its performance.

Dynamics of a macroscopic model characterizing mutualism of search engines and web sites

We present a model to describe the mutualism relationship between search engines and web sites. In the model, search engines and web sites benefit from each other while the search engines are derived products of the web sites and cannot survive independently. Our goal is to show strategies for the search engines to survive in the internet market. From mathematical analysis of the model, we show that mutualism does not always result in survival. We show various conditions under which the search engines would tend to extinction, persist or grow explosively. Then by the conditions, we deduce a series of strategies for the search engines to survive in the internet market. We present conditions under which the initial number of consumers of the search engines has little contribution to their persistence, which is in agreement with the results in previous works. Furthermore, we show novel conditions under which the initial value plays an important role in the persistence of the search engines and deduce new strategies. We also give suggestions for the web sites to cooperate with the search engines in order to form a win–win situation.

Optimal robot scheduling for Web search engines

A robot is deployed by a Web search engine in order to maintain the currency of its data base of Web pages. This paper studies robot scheduling policies that minimize the fractions ri of time pages spend out-of-date, assuming independent Poisson page-change processes, and a general distribution for the page access time X. We show that, if X is decreased in the increasing convex ordering sense, then ri is decreased for all i under any scheduling policy, and that, in order to minimize expected total obsolescence time of any page, the accesses to that page should be as evenly spaced in time as possible. We then investigate the problem of scheduling to minimize the cost function ∑ciri, where the ci are given weights proportional to the page-change rates μi. We give a tight bound on the performance of such a policy and prove that the optimal frequency at which the robot should access page i is proportional to ln(hi)−1, where hi:=Ee. Note that this reduces to being proportional to μi when X is a constant, but not, as one might expect, when X has a general distribution. Next, we evaluate randomized accessing policies whereby the choices of page access are determined by independent random samples from the distribution {fi}. We show that when the weights ci in the cost function are proportional to μi, the minimum cost is achieved when fi is proportional to (hi)−1−1. Finally, we present and analyze a heuristic policy that is especially suited to the asymptotic regime of large data bases. © 1998 John Wiley & Sons, Ltd.