Search

In most social choice settings, the participating agents express their preferences over the different alternatives in the form of linear orderings. While this clearly simplifies preference elicitation, it inevitably leads to poor performance with respect to optimizing a cardinal objective, such as the social welfare, since the values of the agents remain virtually unknown. This loss in performance because of lack of information is measured by the notion of distortion. A recent array of works put forward the agenda of designing mechanisms that learn the values of the agents for a small number of alternatives via queries, and use this limited extra information to make betterinformed decisions, thus improving distortion. Following this agenda, in this work we focus on a class of combinatorial problems that includes most well-known matching problems and several of their generalizations. For problems such as One-Sided Matching, Two-Sided Matching, General Graph Matching, and Short Cycle Packing, we design two-query mechanisms that achieve the best-possible worst-case distortion in terms of social welfare, and outperform the best-possible expected distortion achieved by randomized ordinal mechanisms. Our results extend to problems like k-Constrained Resource Allocation, General Graph k-Matching, and k-Clique Packing, when k is restricted to be any constant. [ABSTRACT FROM AUTHOR]

The search for patentability is a critical element in the patent process, and failure to find a certain relevant patent may result in costly legal consequences. This paper aims to review the studies that have been conducted in result to improve the significance efficacy of patent information retrieval, which is focused on creating techniques and methods for retrieving patent documents in response to a specific user query. The prior-art search is a crucial step in the patent retrieval process, the choice of pertinent search terms is essential to the task’s success. In this review, we develop prior-art queries derived from query patents using query expansion to pseudo relevance feedback in result of increase the retrievability of patents. The review of this literature lists numerous studies that have been done to enhance current information retrieval methods or use conventional methods at different phases of the patent retrieval task in order to achieve better results in the task. This research focuses solely on the literature on patent text and image retrieval. Given the different methods and frameworks available, as well as their limitations, there is a lot of room for further research in the field of patent retrieval techniques. [ABSTRACT FROM AUTHOR]

The study focuses on the transformation of the alimentary models of the imaginative Other. Based on the statistics of the Russian Internet queries, the authors identified a number of markers, determining the main alimentary models of the Other. They carried out a comparative analysis of the obtained in 2018-2019 (pre-Сovid-19) models with similar Post-Covid models for 2021-2022. The researchers' hypothesis is that the queries can reveal the attitude of the modern Russians to the Other, determine the criteria by which the images are formed and the factors, affecting their transformation. The study showed that interest in the Other’s food is unstable. The number of queries constantly fluctuates. Both external factors (geopolitical, etc.) and contact with the objects of foreign mass culture can influence the growth of interests. At the same time, all markers (and stereotypes) can be conditionally divided into two groups: stable (fixed for several years), and situational, determined by external factors. The long-term analysis allowed the authors to trace the increased relevance of a number of cannibalistic markers in the image of the Other, the main reason for which, according to the researchers, was the pandemic, and the subsequent decline of interest in them in 2022. We should also mention the growing interest in video content (mukbang) In our view, this interest may be indicative of the observer's desire to transcend cultural boundaries and interact more closely with the Other. It is also particularly curious that this interest is directed toward the most alert models of the Other.

Search engine queries are the starting point for studies in different fields, such as health or political science. These studies usually aim to make statements about social phenomena. However, the queries used in the studies are often created rather unsystematically and do not correspond to actual user behavior. Therefore, the evidential value of the studies must be questioned. We address this problem by developing an approach (query sampler) to sample queries from commercial search engines, using keyword research tools designed to support search engine marketing. This allows us to generate large numbers of queries related to a given topic and derive information on how often each keyword is searched for, that is, the query volume. We empirically test our approach with queries from two published studies, and the results show that the number of queries and total search volume could be considerably expanded. Our approach has a wide range of applications for studies that seek to draw conclusions about social phenomena using search engine queries. The approach can be applied flexibly to different topics and is relatively straightforward to implement, as we provide the code for querying Google Ads API. Limitations are that the approach needs to be tested with a broader range of topics and thoroughly checked for problems with topic drift and the role of close variants provided by keyword research tools.

Introduction: The institutional ethics committees (IECs) raise queries following protocol reviews. The quality of these queries would be a useful metric to assess how well the IEC executes its fundamental role of protecting participants. Methods: Queries received after the initial review and replies sent by a single research department were evaluated. A content analysis was done to identify the domains and categories of queries. We categorized these queries as administrative, ethics related, and scientific. The impact of each query in improving the science or safeguarding the rights and safety of research participants (ethics) was evaluated by two authors of this manuscript: one affiliated and the other nonaffiliated to the institute. Kappa statistics were used to evaluate for agreement between the two. Results: A total of 13 studies (investigator-initiated studies [IISs]: 7 and pharmaceutical industry-sponsored studies [PSSs]: 6) formed the final sample size for analysis. The total number of queries was 364 (IIS: 106 and PSS: 258; P < 0.001). With regard to the categories, we found n = 42 (11.54%) to be irrelevant at that stage of the review process; n = 51 (14.01%) were about information already available which the IEC had missed; n = 67 (18.41%) queries where the IEC needed paraphrasing; n = 50 (13.74%) were entirely relevant with the need for further clarification; and n = 154 (42.31%) had been missed by the investigator during the initial submission. The overall agreement between the affiliated and unaffiliated investigators was just 12.9% (P < 0.001). Conclusions: We found that approximately 25% of the queries raised by the IEC were redundant. It is our opinion that this redundancy could have been channeled into greater focus on scientific and ethical aspects of the protocol. Ongoing dialog between investigators and ethics committees may help address this. Perspectives between the affiliated and the unaffiliated investigators with regard to the relevance of queries were grossly different. [ABSTRACT FROM AUTHOR]

Much geospatial information is stored in relational databases. Relational databases provide a reliable method for managing large amounts of data while offering a combination of system performance and ease of implementation. Users interacting with these systems perform queries to them with the primary objective of retrieving information. These queries are nothing more than natural language questions about the world and how people relate to it. This article discusses the main topics related to Geographic Information Systems and their most popular tools worldwide. Relevant aspects about Database Management Systems are also explained and a comparison between Relational and NoSQL is established. In addition, the main types of queries are discussed, as well as the language in which they are made and some examples of them are shown. [ABSTRACT FROM AUTHOR]

On 12 November 1675, the physician and philosopher, John Locke (1632- 1704), sailed for France without his commonplace books, the notebooks on which he had come to rely. For the next three and a half years, he assiduously recorded in journals things that he saw, heard, thought and read. What effects, if any, did this switch have on his note-taking and thinking? I suggest that Locke embraced the new options presented by the journal form in which notes were not necessarily tied to textual excerpts. Unlike the commonplace book, the journal demanded the dating of entries; and its portability encouraged the noting of on-the-spot observation, testimony, conversation, and trains of thought. On this basis, Locke pursued his inquiries under the rubric of Baconian natural history, adding 'Queries' to both excerpts and empirical observations, taking case histories of his patients, and venturing into new philosophical topics connected with An Essay Concerning Human Understanding (1690). The journal offered the freedom to make a note on any topic on any page; but this meant that Locke had to overlook the distinction between subjects he classified as either 'Physica' (medicine and science) or 'Ethica' (politics and religion) and entered in separate commonplace books. He regarded this as a temporary situation, setting up each journal with marginal heads/titles, cross-references and indexes that linked them to the commonplace books at home. On his return, he transferred selected material from the journals to the appropriate commonplace books. After appreciating the flexibility of the journal in France, Locke consolidated his existing database and retained his well-tried method of searching it. [ABSTRACT FROM AUTHOR]

Background: People living with dementia or other cognitive decline and their caregivers (PLWD) increasingly rely on the web to find information about their condition and available resources and services. The recent advancements in large language models (LLMs), such as ChatGPT, provide a new alternative to the more traditional web search engines, such as Google. Objective: This study compared the quality of the results of ChatGPT and Google for a collection of PLWD-related queries. Methods: A set of 30 informational and 30 service delivery (transactional) PLWD-related queries were selected and submitted to both Google and ChatGPT. Three domain experts assessed the results for their currency of information, reliability of the source, objectivity, relevance to the query, and similarity of their response. The readability of the results was also analyzed. Interrater reliability coefficients were calculated for all outcomes. Results: Google had superior currency and higher reliability. ChatGPT results were evaluated as more objective. ChatGPT had a significantly higher response relevance, while Google often drew upon sources that were referral services for dementia care or service providers themselves. The readability was low for both platforms, especially for ChatGPT (mean grade level 12.17, SD 1.94) compared to Google (mean grade level 9.86, SD 3.47). The similarity between the content of ChatGPT and Google responses was rated as high for 13 (21.7%) responses, medium for 16 (26.7%) responses, and low for 31 (51.6%) responses. Conclusions: Both Google and ChatGPT have strengths and weaknesses. ChatGPT rarely includes the source of a result. Google more often provides a date for and a known reliable source of the response compared to ChatGPT, whereas ChatGPT supplies more relevant responses to queries. The results of ChatGPT may be out of date and often do not specify a validity time stamp. Google sometimes returns results based on commercial entities. The readability scores for both indicate that responses are often not appropriate for persons with low health literacy skills. In the future, the addition of both the source and the date of health-related information and availability in other languages may increase the value of these platforms for both nonmedical and medical professionals. [ABSTRACT FROM AUTHOR]

The notion of a "query" occurred in legal, medical, theological and scientific writings during the early modern period. Whereas the "questionary" (from c. 1400s) sought replies from within a doctrine (such as Galenic medicine), in the 1600s the query posed open-ended inquiries, seeking empirical information from travellers, explorers and others. During the 1660s in Britain, three versions of the query (and lists of queries) emerged. Distinctions need to be made between queries seeking information via observation and those asking for experimentation, and between those aiming to keep theory to one side and those that framed theoretical conjectures. My examples are drawn from the work of the Royal Society of London (founded 1660) and from some of its leading members, especially Robert Boyle, Robert Hooke and Isaac Newton. [ABSTRACT FROM AUTHOR]

Recently, the compacted de Bruijn graph (cDBG) of complete genome sequences was successfully used in read mapping due to its ability to deal with the repetitions in genomes. However, current approaches are not flexible enough to fit frequently building the graphs with different $k$ k -mer lengths. Instead of building the graph directly, how can we build the compacted de Bruijin graph of longer $k$ k -mer based on the one of short $k$ k -mer? In this article, we present StLiter, a novel algorithm to build the compacted de Bruijn graph either directly from genome sequences or indirectly based on the graph of a short $k$ k -mer. For 100 simulated human genomes, StLiter can construct the graph of $k$ k -mer length 15-18 in 2.5-3.2 hours with maximal ∼70GB memory in the case of without considering the reverese complements of the reference genomes. And it costs 4.5-5.9 hours when considering the reverse complements. In experiments, we compared StLiter with TwoPaCo, the state-of-art method for building the graph, on 4 datasets. For $k$ k -mer length 15-18, StLiter can build the graph 5-9 times faster than TwoPaCo using less maximal memory cost. For $k$ k -mer length larger than 18, given the graph of a short $({\mathrm{k}}$ (k - ${\mathrm{x}})$ x) -mer, such as ${\mathrm{x}}$ x = 1-2, compared with TwoPaCo building the graph directly, StLiter can also build the graph more efficiently. The source codes of StLiter can be downloaded from web site https://github.com/BioLab-cz/StLiter. [ABSTRACT FROM AUTHOR]

In the Group Testing problem, the objective is to learn a subset K of some much larger domain N , using the shortest-possible sequence of queries Q. A feedback to a query provides some information about the intersection between the query and subset K. Several specific feedbacks have been studied in the literature, often proving different formulas for the estimate of the query complexity of the problem, defined as the shortest length of queries' sequence solving Group Testing problem with specific feedback. In this paper we study what are the properties of the feedback that influence the query complexity of Group Testing and what is their measurable impact. We propose a generic framework that covers a vast majority of relevant settings considered in the literature, which depends on two fundamental parameters of the feedback: input capacity α and output expressiveness β. They upper bound the logarithm of the size of the feedback function domain and image, respectively. To justify the value of the framework, we prove upper bounds on query complexity of non-adaptive, deterministic Group Testing under some "efficient" feedbacks, for minimum, maximum and general expressiveness, and complement them with a lower bound on all feedbacks with given parameters α , β. Our upper bounds also hold if the feedback function could get an input twisted by a malicious adversary, in case the intersection of a query and the hidden set is bigger than the feedback capacity α. We also show that slight change in the feedback function may result in substantial worsening of the query complexity. Additionally, we analyze explicitly constructed randomized counterparts of the deterministic results. Our results provide some insights to what are the most useful bits of information an output-restricted feedback could provide, and open a number of challenging research directions. [ABSTRACT FROM AUTHOR]

Neuroscientists can leverage technological advances to image neural tissue across a range of different scales, potentially forming the basis for the next generation of brain atlases and circuit reconstructions at submicron resolution, using Electron Microscopy and X-ray Microtomography modalities. However, there is variability in data collection, annotation, and storage approaches, which limits effective comparative and secondary analysis. There has been great progress in standardizing interfaces for large-scale spatial image data, but more work is needed to standardize annotations, especially metadata associated with neuroanatomical entities. Standardization will enable validation, sharing, and replication, greatly amplifying investment throughout the connectomics community. We share key design considerations and a usecase developed for metadata for a recent large-scale dataset. [ABSTRACT FROM AUTHOR]

A query is a syntax or command used in a database system to access and display data. Queries can be used to make data interact with each other. To display query results in the database, of course, requires execution time which is usually denoted in seconds. Execution time is directly proportional to the amount of data to be displayed and the level of complexity of the database. To speed up query execution time, the term database optimization is known. One of the database optimization methods is to use the b-tree indexing technique the database. This study aims to compare the execution time of databases that have not been indexed or that have been indexed with data objects in the MySQL database MPN-Info application at the Jakarta Palmerah Tax Office (KPP Pratama Jakarta Palmerah). This application was developed to supervise taxpayers which is used in almost all tax service offices throughout Indonesia. The data used is active employee status taxpayer data registered until 2020 with the reporting of Annual Personal Income Tax Returns in 2019 and 2020. The study uses an experimental method by applying a select query, then the execution time is recorded well for unindexed and indexed databases. The gradient method will be used for compare the results of the two. The results obtained are after taking the population of taxpayers registered employees up to year In 2020 at KPP Pratama Jakarta Palmerah, 31,238 data were compared with the annual reporting data, the average execution time before indexing was 255.585 seconds and the average time after indexing was 1.341 seconds and the gradient value before indexing was 0.0211 and after indexing was 0.0001. This proves that the indexing technique has a significant impact in accelerating the query execution process. Keywords: [ABSTRACT FROM AUTHOR]

Neuroscientists can leverage technological advances to image neural tissue across a range of different scales, potentially forming the basis for the next generation of brain atlases and circuit reconstructions at submicron resolution, using Electron Microscopy and X-ray Microtomography modalities. However, there is variability in data collection, annotation, and storage approaches, which limits effective comparative and secondary analysis. There has been great progress in standardizing interfaces for large-scale spatial image data, but more work is needed to standardize annotations, especially metadata associated with neuroanatomical entities. Standardization will enable validation, sharing, and replication, greatly amplifying investment throughout the connectomics community. We share key design considerations and a usecase developed for metadata for a recent large-scale dataset.

Background: To advance research with clinical data, it is essential to make access to the available data as fast and easy as possible for researchers, which is especially challenging for data from different source systems within and across institutions. Over the years, many research repositories and data standards have been created. One of these is the Fast Healthcare Interoperability Resources (FHIR) standard, used by the German Medical Informatics Initiative (MII) to harmonize and standardize data across university hospitals in Germany. One of the first steps to make these data available is to allow researchers to create feasibility queries to determine the data availability for a specific research question. Given the heterogeneity of different query languages to access different data across and even within standards such as FHIR (eg, CQL and FHIR Search), creating an intermediate query syntax for feasibility queries reduces the complexity of query translation and improves interoperability across different research repositories and query languages., Objective: This study describes the creation and implementation of an intermediate query syntax for feasibility queries and how it integrates into the federated German health research portal (Forschungsdatenportal Gesundheit) and the MII., Methods: We analyzed the requirements for feasibility queries and the feasibility tools that are currently available in research repositories. Based on this analysis, we developed an intermediate query syntax that can be easily translated into different research repository-specific query languages., Results: The resulting Clinical Cohort Definition Language (CCDL) for feasibility queries combines inclusion criteria in a conjunctive normal form and exclusion criteria in a disjunctive normal form, allowing for additional filters like time or numerical restrictions. The inclusion and exclusion results are combined via an expression to specify feasibility queries. We defined a JSON schema for the CCDL, generated an ontology, and demonstrated the use and translatability of the CCDL across multiple studies and real-world use cases., Conclusions: We developed and evaluated a structured query syntax for feasibility queries and demonstrated its use in a real-world example as part of a research platform across 39 German university hospitals., (© Lorenz Rosenau, Julian Gruendner, Alexander Kiel, Thomas Köhler, Bastian Schaffer, Raphael W Majeed. Originally published in JMIR Medical Informatics (https://medinform.jmir.org).)

The ever-growing usage of knowledge graphs (KGs) positions named entity disambiguation (NED) at the heart of designing accurate KG-driven systems such as query answering systems (QAS). According to the current research, most studies dealing with NED on KGs involve long texts, which is not the case of short text fragments, identified by their limited contexts. The accuracy of QASs strongly depends on the management of such short text. This limitation motivates this paper, which studies the NED problem on KGs, involving only short texts. First, we propose a NED approach including the following steps: (i) context expansion using WordNet to measure its similarity to the resource context. (ii) Exploiting coherence between entities in queries that contain more than one entity, such as "Is Michelle Obama the wife of Barack Obama?". (iii) Taking into account the relations between words to calculate their similarity with the properties of a resource. (iv) the use of syntactic features. The NED solution approach is compared to state-of-the-art approaches using five datasets. The experimental results show that our approach outperforms these systems by 27% in the F-measure. A system called Welink, implementing our proposal, is available on GitHub, and it is also accessible via a REST API. [ABSTRACT FROM AUTHOR]

Time-evolving web and social network graphs are modeled as a set of pages/individuals (nodes) and their arcs (links/relationships) that change over time. Due to their popularity, they have become increasingly massive in terms of their number of nodes, arcs, and lifetimes. However, these graphs are extremely sparse throughout their lifetimes. For example, it is estimated that Facebook has over a billion vertices, yet at any point in time, it has far less than 0.001% of all possible relationships. The space required to store these large sparse graphs may not fit in most main memories using underlying representations such as a series of adjacency matrices or adjacency lists. We propose building a compressed data structure that has a compressed binary tree corresponding to each row of each adjacency matrix of the time-evolving graph.We do not explicitly construct the adjacency matrix, and our algorithms take the time-evolving arc list representation as input for its construction.Our compressed structure allows for directed and undirected graphs, faster arc and neighborhood queries, as well as the ability for arcs and frames to be added and removed directly from the compressed structure (streaming operations). We use publicly available network data sets such as Flickr, Yahoo!, and Wikipedia in our experiments and show that our new technique performs as well or better than our benchmarks on all datasets in terms of compression size and other vital metrics. [ABSTRACT FROM AUTHOR]

From past decade, the advancement in the field of RDF data management poses many challenges to researchers. Processing large volumes of RDF data is very difficult task in the cloud. The RDF data actually contains complex graphs along with large number of schemas. Distributing the RDF data with traditional approaches or partitioning them with conventional mechanism leads to faulty distribution as well as generated large number of join operations. To address the above issues, this paper developed architecture for distributed query processing using the adaptive hash partitioning approach along with hash join operation. This paper also developed an algorithm for executing the query by minimizing the joins. This paper presented an evaluation of the proposed model with other standard model. The experimental results proved that the proposed method had faster response time compared to the other standard models. [ABSTRACT FROM AUTHOR]

This article describes an approach to the collection and preprocessing of data received from mobile phones for the purpose of their further processing by data mining methods, in particular using neural networks. This is a comprehensive work that was carried out using graph theory methods; parallel computing, set theory, databases, fuzzy logic methods and neural networks, mobile application design methods. The most important results of this work, which are presented in this article, are developed methods for accelerating data processing in relational and NoSQL databases, the architecture of a system for monitoring the status of patients with Parkinson's disease using mobile technologies; modules for a mobile phone for collecting patient status data; and modules based on neural networks for classifying the status of patients with Parkinson's disease. [ABSTRACT FROM AUTHOR]

A cluster of pneumonia cases of unknown aetiology was reported from Wuhan, Hubei province of China on 31st December, 2019. The World Health Organisation (WHO) declared the outbreak a Public Health Emergency of International Concern (PHEIC) on 30th January, 2020. Thereafter, it has spread through China and reached the level of a pandemic expanding to 210 countries with 77.9M confirmed cases and 1.71M deaths as per Corona virus Disease (COVID-19) situation report issued by WHO based on data received upto 23rd December, 2020. A number of questions remain unanswered regarding pathogen-associated variables for amplification dynamics, host environment and agent interaction. This short communication makes an effort to compile the information gathered from published articles of renowned journals and newsletters to explore the epidemiological characteristics of COVID-19. Hereby in this article, authors have tried to assemble the epidemiological lacunae created by the novel characteristics of the SARS-CoV-2 (Severe Acute Respiratory Syndrome-Corona Virus-2) which presently pose a rather puzzling transmission dynamics of COVID-19 that still remain unanswered.

The main element of extended reality (XR) environments is behavior-rich 3D content consisting of objects that act and interact with one another as well as with users. Such actions and interactions constitute the evolution of the content over time. Multiple application domains of XR, e.g., education, training, marketing, merchandising, and design, could benefit from the analysis of 3D content changes based on general or domain knowledge comprehensible to average users or domain experts. Such analysis can be intended, in particular, to monitor, comprehend, examine, and control XR environments as well as users' skills, experience, interests and preferences, and XR objects' features. However, it is difficult to achieve as long as XR environments are developed with methods and tools that focus on programming and 3D modeling rather than expressing domain knowledge accompanying content users and objects, and their behavior. The main contribution of this paper is an approach to creating explorable knowledge-based XR environments with semantic annotations. The approach combines description logics with aspect-oriented programming, which enables knowledge representation in an arbitrary domain as well as transformation of available environments with minimal users' effort. We have implemented the approach using well-established development tools and exemplify it with an explorable immersive car showroom. The approach enables efficient creation of explorable XR environments and knowledge acquisition from XR. [ABSTRACT FROM AUTHOR]

Skyline queries are important in many application domains. In this paper, we propose a novel structure Skyline Diagram, which given a set of points, partitions the plane into a set of regions, referred to as skyline polyominos. All query points in the same skyline polyomino have the same skyline query results. Similar to $k$ k th-order Voronoi diagram commonly used to facilitate $k$ k nearest neighbor ($k$ k NN) queries, skyline diagram can be used to facilitate skyline queries and many other applications. However, it may be computationally expensive to build the skyline diagram. By exploiting some interesting properties of skyline, we present several efficient algorithms for building the diagram with respect to three kinds of skyline queries, quadrant, global, and dynamic skylines. In addition, we propose an approximate skyline diagram which can significantly reduce the space cost. Experimental results on both real and synthetic datasets show that our algorithms are efficient and scalable. [ABSTRACT FROM AUTHOR]

Data about rabbit meat production are provided from the web site of Food and Agriculture Organization of the United Nations. The mentioned information for the studied three Balkan countries (Bulgaria, Romania and Greece) has been extracted and organized in a created relational database. Different parameter queries have been used for visualization of certain subsets from the indicated database. Subsequently, they have been processed and evaluated. The article presents comparative analysis of the rabbit meat production in these Balkan countries for the period 1984-2018. Hierarchical cluster analysis has also been applied to the considered data. The grouping of the investigated indicator is discussed. The obtained results showed that the rabbit meat production in Romania increased significantly for 1984-1990. The same process was observed in Bulgaria and Greece during 1987-1997 and 1988-1993, respectively. The values of this indicator for Greece and Bulgaria are quite higher in comparison with those ones in Romania for 2006-2018. A decreasing tendency in the rabbit meat production in the listed three countries was established for the last five years of the time interval. [ABSTRACT FROM AUTHOR]

This study investigates how a search interface that displays users' ultimate query (i.e. users' current search goal) can cope with the age-related decrease of fluid abilities and support older users' search behaviours. 30 young and 18 older adults completed 9 search problems with a regular web browser or with the experimental search interface. Results showed that older adults spent longer time on the search engine result pages, they needed more time to reformulate, and they had more difficulties exploring the search paths elaborated. Age-differences also appeared as soon as the beginning of the search. The support tool helped older users reformulate their queries more rapidly and elaborate more flexible search strategies at the beginning of the activity. Indeed, older adults who interacted with the support tool switched to the processing of a new search path more rapidly instead of exploiting their initial query (i.e. they visited fewer websites for the initial query produced and reformulated a query instead of keeping on conducting a deeper investigation of the search results provided in the search engine result page). Implications of these findings for the design of effective support tools for older users are discussed. [ABSTRACT FROM AUTHOR]

Small biopsies and cytology specimens have become increasingly important for clinical trials and biomarker testing. Thus, institutions must ensure that adequate lesional material meeting the specifications for a multitude of different protocols is available. This can be achieved using rapid on-site evaluation (ROSE). The aim of the present study was to determine the recent clinical trial biopsy characteristics and study the feedback on these collections at our institution. Clinical trial biopsies performed at our institution and trial feedback (including "queries") were analyzed from the 2017 to 2019. The query data were reviewed in detail, in addition to any protocol modifications related to biopsy requirements and study protocol changes. A total of 698 biopsy collections were performed for clinical trial purposes for 95 trials, with most requiring biopsies at >1 time point (63.2%), for phase I or II trials (92.6%), and for specific tumor types (67.4%). Only 18 of the trials (18.9%) requiring fresh tissue biopsies provided feedback. The feedback included data from 90 cases (12.9%), of which 27 (30.0%) had queries regarding insufficient (n = 10; 37.0%) or borderline (n = 17; 63.0%) tumor tissue. Only 1 (3.7%) of these had had ROSE by cytology. ROSE was performed in accordance with institutional guidelines (45.3%), as required by the study (1.1%), or because of trial modification (5.3%). The present investigation has shown the high volume of clinical trial biopsies managed at our academic cancer center. Feedback from the trials was low at 18.9% and frequently involved suboptimal cases without ROSE used at acquisition. This has led to more widespread adoption of ROSE to mitigate insufficient biopsy specimens and repeat procedures. The high volume of clinical trial biopsies and variability in trial needs necessitates a collaborative multidisciplinary network, including cytology services, to facilitate these important biopsies for patients with cancer. • This investigation shows the recent high volume of clinical trial biopsies managed at an academic cancer center. • Although feedback from trials was limited, the communication frequently involved suboptimal cases without rapid on-site evaluation (ROSE) by cytopathology at acquisition, which has led to more widespread adoption of ROSE to mitigate insufficient biopsies and repeat procedures. • The high volume of clinical trial biopsies and variability in trial needs necessitates a collaborative multi-disciplinary network, including cytology services, to facilitate these important biopsies for cancer patients. [ABSTRACT FROM AUTHOR]

This study analyzes the phenomenon of digital voice search queries against the background of the fluid and changing balance in the orality–literacy osmosis of different historical eras. In attempting to theoretically conceptualize the unique oral characteristics of this new digital feature, this article argues that as the result of technological considerations, voice querying manifests an attempt to discipline oral words – to pronounce them while thinking of their written form. The article also considers the oxymoron of 'looking up' information through spoken words; the effect of an interface that stresses the use of the oral words as an event; the devocalization of queries, as they transform into a written form; and the implications of browsing the Internet through oral word searches, especially for young children. It concludes that the integration of these oral features can be explained by the affordances of digital media on the one hand and the 'revival' of intuitive preprint features attempting to ease the cognitive demands of print culture on the other hand. [ABSTRACT FROM AUTHOR]

In his "Méthode nouvelle," an anonymous article in the Bibliothèque universelle of 1686, John Locke described his way of collecting excerpts in notebooks and retrieving relevant entries. The well‐known practice of entering textual passages in commonplace books sits uneasily with Locke's criticism of received opinion and authority. Is it possible that he used any of these notes to think with? I suggest that the conditions for this were provided by Locke's interactions with some of his notes, including those which recorded observations, testimonies and experiments. As well as labelling excerpts and other notes with topical Titles, Locke sometimes added precise bibliographical citations, transferred material across notebooks, interpolated his own signed reflections and queries, and (eventually) dated entries. [ABSTRACT FROM AUTHOR]

This work was supported in part by the National Natural Science Fund of China under Grant 61233011, Grant 61374006, Grant 61473086, Grant 61463008, Grant 61703100, Grant 61773118, and Grant 61773117, in part by the Major Program of National Natural Science Foundation of China under Grant 11190015, in part by the Natural Science Foundation of Jiangsu under Grant BK20131300 and Grant BK20170692, in part by the Innovation Fund of Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education, Nanjing University of Science and Technology, under Grant JYB201601, in part by the Innovation Fund of Key Laboratory of Measurement and Control of Complex Systems of Engineering, Southeast University, under Grant MCCSE2017B01, and in part by the Fundamental Research Funds for the Central Universities under Grant 2242016k30009.