BACKGROUND: The overall survival of patients with advanced and refractory oesophageal squamous cell carcinoma, mostly aged 65 years and older, is poor. Treatment with PD-1 antibodies showed improved progression-free survival and overall survival. We assessed the safety and efficacy of combined nivolumab and ipilimumab therapy in this population. METHODS: This multicentre, open-label, phase 2 trial done in 32 sites in Germany included patients aged 65 years and older with oesophageal squamous cell carcinoma and disease progression or recurrence following first-line therapy. Patients were treated with nivolumab (240 mg fixed dose once every 2 weeks, intravenously) in the safety run-in phase and continued with nivolumab and ipilimumab (nivolumab 240 mg fixed dose once every 2 weeks and ipilimumab 1 mg/kg once every 6 weeks, intravenously). The primary endpoint was overall survival, which was compared with a historical cohort receiving standard chemotherapy in the intention-to-treat population. This study is registered with ClinicalTrials.gov, NCT03416244. FINDINGS: Between March 2, 2018, and Aug 20, 2020, we screened 75 patients with advanced oesophageal squamous cell carcinoma. We enrolled 66 patients (50 [76%] men and 16 [24%] women; median age 70·5 years [IQR 67·0-76·0]), 44 (67%) of whom received combined nivolumab and ipilimumab therapy and 22 (33%) received nivolumab alone. Median overall survival time at the prespecified data cutoff was 7·2 months (95% CI 5·7-12·4) and significantly higher than in a historical cohort receiving standard chemotherapy (p=0·0063). The most common treatment-related adverse events were fatigue (12 [29%] of 42), nausea (11 [26%]), and diarrhoea (ten [24%]). Grade 3-5 treatment-related adverse events occurred in 13 (20%) of 66 patients. Treatment-related death occurred in one patient with bronchiolitis obliterans while on nivolumab and ipilimumab treatment. INTERPRETATION: Patients aged at least 65 years, with advanced oesophageal squamous cell carcinoma might benefit from combined nivolumab and ipilimumab therapy in second-line treatment. FUNDING: Bristol Myers Squibb.

The Webis MS MARCO Anchor Text 2022 dataset enriches Version 1 and 2 of the document collection of MS MARCO with anchor text extracted from six Common Crawl snapshots. The six Common Crawl snapshots cover the years 2016 to 2021 (between 1.7-3.4 billion documents each). We sampled 1,000 anchor texts for documents with more than 1,000 anchor texts at random and all anchor texts for documents with less than 1,000 anchor texts (this sampling yields that all anchor text is included for 94% of the documents in Version 1 and 97% of documents for Version 2). Overall, the MS MARCO Anchor Text 2022 dataset enriches 1,703,834 documents for Version 1 and 4,821,244 documents for Version 2 with anchor text. Cleaned versions of the MS MARCO Anchor Text 2022 dataset are available in ir_datasets, Zenodo and Hugging Face. The raw dataset with additional information and all metadata for the extracted anchor texts (roughly 100GB) is available on Hugging Face and files.webis.de. The details of the construction of the Webis MS MARCO Anchor Text 2022 dataset are described in the associated paper. If you use this dataset, please cite @InProceedingsfroebe:2022a, address = Berlin Heidelberg New York, author = Maik Fr``obe and Sebastian G''unther and Maximilian Probst and Martin Potthast and Matthias Hagen, booktitle = Advances in Information Retrieval. 44th European Conference on IR Research (ECIR 2022), editor = Matthias Hagen and Suzan Verberne and Craig Macdonald and Christin Seifert and Krisztian Balog and Kjetil Norvrag and Vinay Setty, month = apr, publisher = Springer, series = Lecture Notes in Computer Science, site = Stavanger, Norway, title = The Power of Anchor Text in the Neural Retrieval Era, year = 2022

The mean time between failures (MTBF) of HPC systems is rapidly reducing, and that current failure recovery mechanisms e.g., checkpoint-restart, will no longer be able to recover the systems from failures. Early failure detection is a new class of failure recovery methods that can be beneficial for HPC systems with short MTBF. System logs (syslogs) are invaluable source of information which give us a deep insight about system behavior, and make the early failure detection possible. Beside normal information, syslogs contain sensitive data which might endanger users’ privacy. Even though analyzing various syslogs is necessary for creating a general failure detection/prediction method, privacy concerns discourage system administrators to publish syslogs. Herein, we ensure user privacy via de-identifying syslogs, and then turning the applied constraint for addressing users’ privacy into an advantage for system behavior analysis. Results indicate significant reduction in required storage space and 3 times shorter processing time.

In this paper we study the correlation of node failures in time and space. Our study is based on measurements of a production high performance computer over an 8-month time period. We draw possible types of correlations between node failures and show that, in many cases, there are direct correlations between observed node failures. The significance of such a study is twofold: achieving a clearer understanding of correlations between node failures and enabling failure detection as early as possible. The results of this study are aimed at helping the system administrators minimize (or even prevent) the destructive effects of correlated node failures.

We present a proof-of-concept implementation of Myers bit-vector algorithm for approximate string matching in hardware. In terms of bit-vector operations, the algorithm is accelerated by using the massive parallel computing capabilities of a field programmable gate array (FPGA). The system is realized on an embedded platform with a high computational and energy efficiency. Compared to the fastest software implementation running on the embedded processor, the hardware achieves an overall speed-up of approximately 2 and a speed-up of approximately 8 considering the computation only.

Interactive lenses have proven to be useful for many visualization applications where exploratory analysis is a primary task. Up to now, interaction with lenses is mostly limited to single-user, single-function lenses operated by mouse, keyboard and traditional parameter menus. To overcome these limitations, we propose MultiLens, touch-enabled magic lenses for fluently manipulating functions, parameters, and combinations of lenses on interactive surfaces. We contribute a novel multi-touch menu technique for magic lenses using a widget-based approach with a drag-snap slider for relative parameter adjustment. We also propose a continuous gesture set for rapidly changing lenses and their primary parameters in one seamless phrase. In addition, by supporting the combination of various lens functions, we create a generic multi-purpose lens tool. We illustrate our approach by investigating and implementing the concepts for the field of graph exploration. The prototype was evaluated in a user study with 22 participants comparing it to traditional parameter menus operated with both mouse and touch.

Complex data analytics that involve data mining often comprise not only a single algorithm but also further data processing steps, for example, to restrict the search space or to filter the result. We demonstrate graph mining with Gradoop, the first scalable system supporting declarative analytical programs composed from multiple graph operations. We use a business intelligence example including frequent subgraph mining to highlight the analytical capabilities enabled by such programs. The results can be visualized and, to show its ease of use, the program can be modified on visitors request. Gradoop is built on top of state-of-the-art big data technology and out-of-the-box horizontally scalable. Its source code is publicly available and designed for easy extensibility. We offer to the graph mining community, to apply Gradoop in large scale use cases and to contribute further algorithms.

In a project called Ä Library of a Billion Words" we needed an implementation of the CTS protocol that is capable of handling a text collection containing at least 1 billion words. Because the existing solutions did not work for this scale or were still in development I started an implementation of the CTS protocol using methods that MySQL provides. Last year we published a paper that introduced a prototype with the core functionalities without being compliant with the specifications of CTS (Tiepmar et al., 2013). The purpose of this paper is to describe and evaluate the MySQL based implementation now that it is fulfilling the specifications version 5.0 rc.1 and mark it as finished and ready to use. Further information, online instances of CTS for all described datasets and binaries can be accessed via the projects website.

Abstract argumentation frameworks are by now a major research area in knowledge representation and reasoning. Various aspects of AFs have been extensively studied over the last 25 years. Contributing to understanding the expressive power of AFs, researchers found lower and upper bounds for the maximal number of extensions, that is, acceptable points of view, in AFs. One of the classical and most important concepts in AFs are so-called complete extensions. Surprisingly, the exact bound for the maximal number of complete extensions in an AF has not yet been formally established, although there is a reasonable conjecture tracing back at least to 2015. Recently the notion of modularization was introduced and it was shown that this concept plays a key role for the understanding of relations between semantics as well as intrinsic properties. In this paper, we will use this property to give a formal proof of the conjecture regarding complete semantics.

Wikidata, now a decade old, is the largest public knowledge graph, with data on more than 100 million concepts contributed by over 560,000 editors. It is widely used in applications and research. At its launch in late 2012, however, it was little more than a hopeful new Wikimedia project, with no content, almost no community, and a severely restricted platform. Seven years earlier still, in 2005, it was merely a rough idea of a few PhD students, a conceptual nucleus that had yet to pick up many important influences from others to turn into what is now called Wikidata. In this paper, we try to recount this remarkable journey, and we review what has been accomplished, what has been given up on, and what is yet left to do for the future.

This study aimed to understand the perception of drought among farmers, in order to support decision-making in the water allocation process. This study was carried out in the Tabuleiro de Russas irrigated perimeter, in northeast Brazil, over the drought period of 2012–2018. Two analyses were conducted: (i) drought characterization, using the Standardized Precipitation Index (SPI) based on drought duration and frequency criteria; and (ii) analysis of farmers’ perceptions of drought via selection of explanatory variables using the Random Forest (RF) and the Decision Tree (DT) methods. The 2012–2018 drought period was defined as a meteorological phenomenon by local farmers; however, an SPI evaluation indicated that the drought was of a hydrological nature. According to the RF analysis, four of the nine study variables were more statistically important than the others in influencing farmers’ perception of drought: number of cultivated land plots, farmer’s age, years of experience in the agriculture sector, and education level. These results were confirmed using DT analysis. Understanding the relationship between these variables and farmers’ perception of drought could aid in the development of an adaptation strategy to water deficit scenarios. Farmers’ perception can be beneficial in reducing conflicts, adopting proactive management practices, and developing a holistic and efficient early warning drought system.