Search results

The progress of parallel computing in Information Retrieval (IR) is reviewed. In particular we stress the importance of the motivation in using parallel computing for text retrieval. We analyse parallel IR systems using a classification defined by Rasmussen and describe some parallel IR systems. We give a description of the retrieval models used in parallel information processing. We describe areas of research which we believe are needed.

The aim of the research is modelling and implementation of a client application that enables parallel search and retrieval of bibliographic records from multiple servers. The client application supports simultaneous communication over Z39.50 and SRW/SRU protocols. The application design is flexible and later addition of other communication protocols for search/retrieval is envisioned and supported.

Object‐oriented approach has been used for modelling and implementation of client application. CASE tool, Sybase PowerDesigner, supporting Unified Modelling Language (UML 2.0), was used for modelling. Java programming language and Eclipse environment were used for implementation.

The result of the research is a client application that enables parallel search and retrieval of multiple Z39.50 and SRW/SRU servers. Additionally, the application supports conversion from type‐1 query language, defined by Z39.50 standard, to CQL query language required for search/retrieval from SRW/SRU servers. The application was verified by performing parallel search and retrieval from several publicly accessible Z39.50 and SRW/SRU servers.

The application supports only the use of bib‐1 attribute set for type‐1 queries created according to Z39.50 standard. Hence, only such queries can be converted to CQL notation. The use of other attribute sets is not supported.

The client application is integrated into the BISIS software system, version 4. This enables the cataloguing of bibliographic records retrieved over Z39.50 and SRW/SRU protocol.

The contribution of this work is in client application architecture that enables parallel communication with multiple servers, which can use different communication protocols, Z39.50 or SRW/SRU. Search/retrieval from servers using some other protocol is also supported. This can be achieved by adding new classes that implement protocol specification, and classes for query transformation into notation required by that new protocol, if required.

The purpose of this study is to develop a new parallel metaheuristic algorithm for solving unconstrained continuous optimization problems.

The proposed method brings several metaheuristic algorithms together to form a coalition under Weighted Superposition Attraction-Repulsion Algorithm (WSAR) in a parallel computing environment. The proposed approach runs different single solution based metaheuristic algorithms in parallel and employs WSAR (which is a recently developed and proposed swarm intelligence based optimizer) as controller.

The proposed approach is tested against the latest well-known unconstrained continuous optimization problems (CEC2020). The obtained results are compared with some other optimization algorithms. The results of the comparison prove the efficiency of the proposed method.

This study aims to combine different metaheuristic algorithms in order to provide a satisfactory performance on solving the optimization problems by benefiting their diverse characteristics. In addition, the run time is shortened by parallel execution. The proposed approach can be applied to any type of optimization problems by its problem-independent structure.

This paper aims to describe the structure of an aligned Serbian-German literary corpus (SrpNemKor) contained in a digital library Bibliša. The goal of the research was to create a benchmark Serbian-German annotated corpus searchable with various query expansions.

The presented research is particularly focused on the enhancement of bilingual search queries in a full-text search of aligned SrpNemKor collection. The enhancement is based on using existing lexical resources such as Serbian morphological electronic dictionaries and the bilingual lexical database Termi.

For the purpose of this research, the lexical database Termi is enriched with a bilingual list of German-Serbian translated pairs of lexical units. The list of correct translation pairs was extracted from SrpNemKor, evaluated and integrated into Termi. Also, Serbian morphological e-dictionaries are updated with new entries extracted from the Serbian part of the corpus.

A bilingual search of SrpNemKor in Bibliša is available within the user-friendly platform. The enriched database Termi enables semantic enhancement and refinement of user’s search query based on synonyms both in Serbian and German at a very high level. Serbian morphological e-dictionaries facilitate the morphological expansion of search queries in Serbian, thereby enabling the analysis of concepts and concept structures by identifying terms assigned to the concept, and by establishing relations between terms in Serbian and German which makes Bibliša a valuable Web tool that can support research and analysis of SrpNemKor.

Aims to focus on research and findings relating to the Z‐server response times and the performance of Z39.50 for parallel searching.

This paper begins by briefly outlining the evolution of Z39.50 and the current trends, including the work of the JISC CC‐interop project. The research crux of the paper focuses on an investigation conducted with respect to testing Z39.50 server (Z‐server) response times in a broadcast (parallel) searching environment. Customised software was configured to broadcast a search to all test Z‐servers once an hour, for 11 weeks. The results were logged for analysis.

Most Z‐servers responded rapidly. “Network congestion” and local online public catalogue usage were not found to influence Z‐server performance significantly. Response time issues encountered by implementers may be the result of non‐response by the Z‐server and how Z‐client software deals with this. The influence of “quick and dirty” Z39.50 implementations is also identified as a potential cause of slow broadcast searching.

The paper indicates various areas for further research, including setting shorter time‐outs and greater end‐user behavioural research to ascertain user requirements in this area. The influence more complex searches, such as Boolean, have on response times and suboptimal Z39.50 implementations are also emphasised for further study.

This paper informs the library and information science (LIS) research community and has practical implications for those establishing Z39.50 based distributed systems, as well as those in the web services community.

The paper challenges popular LIS opinion that Z39.50 is inherently sluggish and thus unsuitable for the demands of the modern user.

The purpose of this paper is to present a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations. In this problem, each product is produced by assembling a set of several different parts. At first, the parts are processed in a flexible job shop system, and then at the second stage, the parts are assembled and products are produced.

As the problem is non-deterministic polynomial-time-hard, a new hybrid particle swarm optimization and parallel variable neighborhood search (HPSOPVNS) algorithm is proposed. In this hybrid algorithm, particle swarm optimization (PSO) algorithm is used for global exploration of search space and parallel variable neighborhood search (PVNS) algorithm for local search at vicinity of solutions obtained in each iteration. For parameter tuning of the metaheuristic algorithms, Taguchi approach is used. Also, a statistical test is proposed to compare the ability of metaheuristics at finding the best solution in the medium and large sizes.

Numerical experiments are used to evaluate and validate the performance and effectiveness of HPSOPVNS algorithm with hybrid particle swarm optimization with a variable neighborhood search (HPSOVNS) algorithm, PSO algorithm and hybrid genetic algorithm and Tabu search (HGATS). The computational results show that the HPSOPVNS algorithm achieves better performance than competing algorithms.

Scheduling of manufacturing parts and planning of assembly operations are two steps in production systems that have been studied independently. However, with regard to many manufacturing industries having assembly lines after manufacturing stage, it is necessary to deal with a combination of these problems that is considered in this paper.

This paper proposed a mathematical model and a new hybrid algorithm for flexible job shop scheduling problem with assembly operations.

Studies the impact of search cost and prior knowledge on consumer search at different price points in a market price distribution for telecommunications products. In an experiment it is found that buyers search differently on premium price products than they do on moderate and low price products, and that this behavior depends on the search costs of the purchase situation and the knowledge of the buyer involved. The results suggest a number of implications for marketers on the role of premium priced brands, ranging from product line pricing strategy to information communication strategy.

The purpose of this paper is to describe the work of the Office of Scientific and Technical Information (OSTI) in the US Department of Energy Office of Science and OSTI's development of the powerful search engine, WorldWideScience.org. With tools such as Science.gov and WorldWideScience.org, the patron gains access to multiple, geographically dispersed deep web databases and can search all of the constituent sources with a single query.

The paper is both historical and descriptive.

That WorldWideScience.org fills a unique niche in discovering scientific material in an information landscape that includes search engines such as Google and Google Scholar.

This is one of the few papers to describe in depth the important work being done by the US Office of Scientific and Technical Information in the field of search and discovery.

Some issues related to effective parallel implementation of the combined finite‐discrete element approach on PC clusters are discussed. Attention is focused on the interprocessor communications. Three communication schemes suitable for different problems are presented. The worker‐to‐manager scheme is simple to implement. The neighbour‐to‐neighbour scheme is sophisticated with regard to programming, and requires extra memory space, but has good overall performance for larger problems. The mixed worker‐manager scheme can balance the difficulty in programming and the overall communication performance. The effects of subdomain buffer zone on communications are also demonstrated by numerical examples.

The World Wide Web offers different systems to retrieve information about published books in the form of online catalogues of libraries and popular online bookstores, and subscription‐based bibliographic databases. The paper determines the usefulness of bibliographic information offered by such systems. For the quantitative evaluation, random tests with titles of known books were executed. The quality of the resulting output was evaluated on the basis of a set of criteria.