检索结果-内蒙古大学图书馆

Chapter 11: Rank-Join Algorithms for search computing

1st SeCo workshop on search computing challenges and directions

作者： Ilyas, Ihab F. Martinenghi, Davide Tagliasacchi, Marco Univ Waterloo Waterloo ON N2L 3G1 Canada Politecn Milan Milan Italy

ISBN: (纸本)9783642123092

Joins represent the basic functional operations of complex query plans in a search computing system, as discussed in the previous chapter. In this chapter we provide further insight on this matter, by focusing on algorithms that deal with joining ranked results produced by search services. We cast this problem as a generalization of the traditional rank aggregation problem, i.e., combining several ranked lists of objects to produce a single consensus ranking. Rank-join algorithms, also called top-k join algorithms, aim at determining the best overall results without accessing all the objects. The rank-join problem has been dealt with in the literature by extending rank aggregation algorithms to the case of join in the setting of relational databases. However, previous approaches to top-k queries did not consider some of the distinctive features of search engines on the Web. Indeed, as pointed out in the previous chapter, joins in this context differ from the traditional relational setting for a number of aspects: services can be accessed according to limited patterns, i.e. some inputs need to be provided;accessing services is costly, since they are typically remote;the output is returned in pages of results and typically according to some ranking criterion;multiple search services can be used to answer the same query;users can interact with the system in order to refine their search criteria. This chapter analyzes the challenges that need to be tackled in the design of rank-join algorithms within the context of search computing.

关键词： rank-join top-k query optimization

来源：评论

学校读者我要写书评

暂无评论

Group communication in real-time computing systems: Issues and directions 7

Group communication in real-time computing systems: Issues a...

引用

7th IEEE workshop on Future trends of Distributed computing Systems, FTDCS 1999

作者： Kim, K.H. Kane University of California IrvineCA92697 United States

ISBN: (纸本)076950468X

Group communication in real-time computing systems has been a subject of research for almost two decades but it is not yet a mature technological field. The purpose of this paper is to review the main goals of developing group communication protocols and establish a practical framework of protocols toward meeting the goals. As a part of this, an attempt is made to clarify the relationship between group communication protocols and fault tolerance. Remaining major research issues and promising directions for solution search are also discussed. © 1999 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Chapter 12: Panta Rhei: Flexible Execution Engine for search computing Queries

引用

1st SeCo workshop on search computing challenges and directions

作者： Braga, Daniele Ceri, Stefano Corcoglioniti, Francesco Grossniklaus, Michael Politecn Milan Dipartimento Elettron & Informat I-20133 Milan Italy

ISBN: (纸本)9783642123092

The efficient execution of data-intensive computations over services is a challenging task: data are retrieved from remote sources and therefore are not available in the query engine until after the execution of these calls, but the system must be inherently efficient thereafter, by guaranteering that data is immediately cached and processed efficiently, according to the best query plan. In this chapter, we present a flexible execution model for search computing queries, named Panta Rhei. The proposed execution engine paradigm adopts the producer/consumer model and supports both data-driven and event-driven synchronization, and their interplay. Query plans are modeled as directed graphs, whose nodes are processing units and whose edges are either control or data flows. While control flows synchronize service calls and unit execution, data flows transfer data between units that process data flows to produce query results. We present the specification of Panta Rhei by formally defining the units for data production, consumption, manipulation, and caching, as well as the control and data flows. Finally, we discuss how a query plan is expressed in terms of a query execution plan.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Integrated Bio-search: challenges and trends for the integration, search and comprehensive processing of biological information

引用

BMC BIOINFORMATICS 2014年第Sup1期15卷 1-15页

作者： Masseroli, Marco Mons, Barend Bongcam-Rudloff, Erik Ceri, Stefano Kel, Alexander Rechenmann, Francois Lisacek, Frederique Romano, Paolo Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy Leiden Univ Med Ctr NL-2333 ZA Leiden Netherlands Netherlands Bioinformat Ctr NL-6500 HB Nijmegen Netherlands Swedish Univ Agr Sci SLU Global Bioinformat Ctr Dept Anim Breeding & Genet S-75124 Uppsala Sweden Uppsala Univ Dept Immunol Genet & Pathol S-75108 Uppsala Sweden GeneXplain GmbH D-38302 Wolfenbuttel Germany Inst Chem Biol & Fundamental Med SBRAS Novosibirsk 630090 Russia Inria Grenoble Rhone Alpes F-38334 Saint Ismier France SIB Swiss Inst Bioinformat Proteome Informat Grp CH-1211 Geneva 4 Switzerland Univ Geneva Biol Sect CH-1211 Geneva 4 Switzerland IRCCS AOU San Martino IST I-16132 Genoa Italy

Many efforts exist to design and implement approaches and tools for data capture, integration and analysis in the life sciences. challenges are not only the heterogeneity, size and distribution of information sources, but also the danger of producing too many solutions for the same problem. Methodological, technological, infrastructural and social aspects appear to be essential for the development of a new generation of best practices and tools. In this paper, we analyse and discuss these aspects from different perspectives, by extending some of the ideas that arose during the NETTAB 2012 workshop, making reference especially to the European context. First, relevance of using data and software models for the management and analysis of biological data is stressed. Second, some of the most relevant community achievements of the recent years, which should be taken as a starting point for future efforts in this research domain, are presented. Third, some of the main outstanding issues, challenges and trends are analysed. The challenges related to the tendency to fund and create large scale international research infrastructures and public-private partnerships in order to address the complex challenges of data intensive science are especially discussed. The needs and opportunities of Genomic computing (the integration, search and display of genomic information at a very specific level, e.g. at the level of a single DNA region) are then considered. In the current data and network-driven era, social aspects can become crucial bottlenecks. How these may best be tackled to unleash the technical abilities for effective data integration and validation efforts is then discussed. Especially the apparent lack of incentives for already overwhelmed researchers appears to be a limitation for sharing information and knowledge with other scientists. We point out as well how the bioinformatics market is growing at an unprecedented speed due to the impact that new powerful in silico ana

关键词： Unify Modeling Language Resource Description Framework Text Mining Research Infrastructure Gene Interaction Network

来源：评论

学校读者我要写书评

暂无评论

Interaction in information retrieval: trends over time

引用

JOURNAL OF THE AMERICAN SOCIETY FOR INFORMATION SCIENCE 1999年第12期50卷 1067-1082页

作者： Savage-Knepshield, PA Belkin, NJ Rutgers State Univ Dept Psychol New Brunswick NJ 08093 USA AT&T Bell Labs Lucent Technol Holmdel NJ 07748 USA Rutgers State Univ Sch Commun Informat & Lib Studies New Brunswick NJ 08903 USA

This review examines a sample of interactive information retrieval (IR) systems within the framework of a design challenge set forth by John Bennett in 1971. Bennett directed his challenge to a group of information scientists who attended The User interface for Interactive search of Bibliographic Data Bases workshop. During the workshop, participants exchanged their insights and experiences on various aspects of user interface requirements for interactive IR systems and discussed system design features that could result in the design of more effective user interfaces for information retrieval. The main goals of this review are to characterize interactive IR design trends over time, examine the extent to which IR systems have responded to Bennett's design challenge, and to suggest potential future research directions and challenges.

关键词： Computer System Design History Information Retrieval Information Seeking Information Systems Interaction Man Machine Systems Research Trend Analysis Users (Information)

来源：评论

学校读者我要写书评

暂无评论

Chapter 13: Liquid Queries and Liquid Results in search computing

引用

1st SeCo workshop on search computing challenges and directions

作者： Bozzon, Alessandro Brambilla, Marco Ceri, Stefano Fraternali, Piero Manolescu, Ioana Politecn Milan Dipartimento Elettron & Informat Piazza Leonardo da Vinci 32 I-20133 Milan Italy Univ Paris 11 Saclay Ile France INRIA LRI Paris France

ISBN: (纸本)9783642123092

Liquid queries are a flexible tool for information seeking, based on the progressive exploration of the search space;they produce "fluid" results which dynamically adapt to the shape of the query, as a liquid adapts to its container. The liquid query paradigm relies on the SeCo service mart and multidomain query execution concepts: an expert user selects a priori the service marts relevant to the information seeking task at hand and the connections necessary to join them, and publishes such a definition in the SeCo back-end. The Liquid Query client-side interface consumes the application definition created by the expert and dynamically builds a query interface for the end-user. Such interface allows one to supply keywords to query the pre-configured service marts and offers controls for exploring the combinations computed by the SeCo execution engine. The interaction commands are based on a tabular representation of results and comprise: reordering, clustering, addition or deletion of attributes, addition of extra service marts to the query for specific items in the result set or for the entire result set, request of more results from all services or from selected ones, expansion of details on selected items, and more. The Liquid Query is equipped with multiple data visualization options suited to render multi-domain results and can be instrumented with indicators showing the quality of the result set.

关键词： user interfaces exploratory search search computing

来源：评论

学校读者我要写书评

暂无评论

NWsearch 2015 - International workshop on novel web search interfaces and systems 15

NWSearch 2015 - International workshop on novel web search i...

引用

24th ACM International Conference on Information and Knowledge Management, CIKM 2015

作者： Rafiei, Davood Tanaka, Katsumi Department of Computing Science University of Alberta Edmonton Canada Department of Social Informatics Kyoto University Kyoto Japan

ISBN: (纸本)9781450337946

Held for the first time in conjunction with the ACM International Conference on Information and Knowledge Management (CIKM), NWsearch 2015 aims to bring together researchers, developers and practitioners who are interested in pushing the search boundary on the Web and exploring more novel forms of searches, interfaces, task formulations, and result organizations and presentations. In particular, the workshop seeks to identify some of the problems and challenges facing the development of such tools and interfaces and to flourish new ideas and findings that can shape or influence future research directions and developments. The workshop organizers solicited contributions that would fall within the large spectrum of human-computer interaction in one extreme and system production and development in the other extreme.

关键词： Human computer interaction

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Imperialist Competitive-Gravitational Attraction search Algorithm to Optimize Cloud Service Composition

A Hybrid Imperialist Competitive-Gravitational Attraction Se...

引用

IEEE 2nd workshop on Memetic computing (MC)

作者： Jula, Amin Othman, Zalinda Sundararajan, Elankovan Univ Kebangsaan Malaysia Fac Informat Sci & Technol Ctr Artificial Intelligence Data Min & Optimizat Res Grp Ukm Bangi 43600 Selangor Malaysia Univ Kebangsaan Malaysia Sch Informat Technol Ind Computing Programme Fac Informat Sci & Technol Ukm Bangi 43600 Selangor Malaysia

ISBN: (纸本)9781467358910

Service composition is among the most important challenges that cloud providers have ever faced. Optimization of QoS attributes when composing simple atomic services to obtain a complex service can be considered to be an NP-hard problem, which could be solved properly by using Hybrid optimization algorithms. In this research, the hybridization of an improved Gravitational Attraction search (as a local search algorithm) with an Imperialist Competitive Algorithm has led us to introduce and apply a new memetic algorithm for gaining optimal or near optimal response time and execution fees simultaneously, for cloud computing service composition. Using a roulette wheel selection algorithm to make well-advised and non-blind decisions to choose the number of countries in each empire that should be selected to apply a local search to has assisted the hybrid algorithm at achieving better solutions. Introducing a new equation to calculate the QoS eligibility of the solutions that were generated based on the normalization of the response time and execution fee has also led us to compute the results fairly and in a scientifically based manner.

关键词： cloud computing service composition imperialist competitive search gravitational attraction search QoS attributes

来源：评论

学校读者我要写书评

暂无评论

Self-configuring applications for heterogeneous systems: Program composition and optimization using cognitive techniques

引用

PROCEEDINGS OF THE IEEE 2008年第5期96卷 849-862页

作者： Hall, Mary W. Gil, Yolanda Lucas, Robert F. Univ So Calif Inst Informat Sci Marina Del Rey CA 90292 USA

This paper describes several challenges facing programmers of future edge computing systems, the diverse many-core devices that will soon exemplify commodity mainstream systems. To call attention to programming challenges ahead, this paper focuses on the most complex of such architectures: integrated, power-conserving systems, inherently parallel and heterogeneous, with distributed address spaces. When programming such complex systems, new concerns arise: computation partitioning across functional units, data movement and synchronization, managing a diversity of programming models for different devices, and reusing existing legacy and library software. We observe that many of these challenges are also faced in programming applications for large-scale heterogeneous distributed computing environments, and current solutions as well as future research directions in distributed computing can be adapted to commodity computing environments. optimization decisions are inherently complex due to large search spaces of possible solutions and the difficulty of predicting performance on increasingly complex architectures. Cognitive techniques are well suited for managing systems of such complexity, citing recent trends of using cognitive techniques for code mapping and optimization support. Combining these, we describe a fundamentally new programming paradigm for complex heterogeneous systems, where programmers design self-configuring applications and the system automates optimization decisions and manages the allocation of heterogeneous resources.

关键词： computer architectures distributed computing learning systems multicore architectures optimizing compilers self-configuring applications

来源：评论

学校读者我要写书评

暂无评论

Is search-based Unit Test Generation Research Stuck in a Local Optimum? 10

Is Search-based Unit Test Generation Research Stuck in a Loc...

引用

IEEE/ACM 10th International workshop on search-Based Software Testing (SBST)

作者： Rojas, Jose Miguel Fraser, Gordon Univ Sheffield Dept Comp Sci Sheffield S Yorkshire England

ISBN: (纸本)9781538627891

Research in search-based unit test generation has seen steady development in recent years. new techniques and tools have been developed, and empirical evidence has been collected on the wide-ranging capabilities of search-based algorithms for unit test generation, and for many related software engineering practices. But why are developers not generating all their tests automatically yet in practice? In this paper, we argue that there may be deceiving local optima in the research landscape on search-based unit test generation, and we outline specific challenges and opportunities to escape these local optima.

关键词： Tools Software Software testing search problems Software engineering Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：