We use logfiles from two web servers (public and internal), two corresponding search engines, and two user populations (public and staff) to examine differences in behaviour across users and sites. We observe similar overall characteristics to other browsing and searching logs, but differences in behaviour between staff and the public and between external and internal sites. Staff familiarity w...

To facilitate ordinary people to search medical information, we have built an intelligent medical Web search engine called iMed. iMed uses medical knowledge and an interactive questionnaire to find multiple diseases serving as queries. The search results of these queries are combined together and returned to the searcher in a traditional sequential order. Nevertheless, searchers still frequentl...

We analyze the transitions from external search, searching on web search engines, to internal search, searching on websites. We categorize 295,571 search episodes composed of a query submitted to web search engines and the subsequent queries submitted to a single website search by the same users. There are a total of 1,136,390 queries from all searches, of which 295,571 are external search quer...

protection systems have vital role in network reliability in short circuit mode and proper operating for relays. current transformer often in transient and saturation under short circuit mode causes mal-operation of relays which will have undesirable effects. therefore, proper and quick identification of current transformer saturation is so important. in this paper, an artificial neural network...

We present a system called Galaxy that assists financial services companies in supervising electronic communications, searching electronic information archives to conduct internal investigations, and responding to legal discovery requests. Galaxy’s supervision component enables companies to implement electronic information screens, identify suspicious text patterns in electronic communications,...

When balanced binary search trees are made partially persistent using the node-copying method [5], the possibility of searching efficiently for information in the past is added to the system. The operations of updating the present version and searching in the present as well as in the past are asymptotically as efficient as in the corresponding normal (non-persistent) binary search tree. In dat...