Query String Research Articles

How mature is requirements engineering for AI-based systems? A systematic mapping study on practices, challenges, and future research directions

AbstractArtificial intelligence (AI) permeates all fields of life, which resulted in new challenges in requirements engineering for artificial intelligence (RE4AI), e.g., the difficulty in specifying and validating requirements for AI or considering new quality requirements due to emerging ethical implications. It is currently unclear if existing RE methods are sufficient or if new ones are needed to address these challenges. Therefore, our goal is to provide a comprehensive overview of RE4AI to researchers and practitioners. What has been achieved so far, i.e., what practices are available, and what research gaps and challenges still need to be addressed? To achieve this, we conducted a systematic mapping study combining query string search and extensive snowballing. The extracted data was aggregated, and results were synthesized using thematic analysis. Our selection process led to the inclusion of 126 primary studies. Existing RE4AI research focuses mainly on requirements analysis and elicitation, with most practices applied in these areas. Furthermore, we identified requirements specification, explainability, and the gap between machine learning engineers and end-users as the most prevalent challenges, along with a few others. Additionally, we proposed seven potential research directions to address these challenges. Practitioners can use our results to identify and select suitable RE methods for working on their AI-based systems, while researchers can build on the identified gaps and research directions to push the field forward.

Factors Associated With Turnover Intention Among Healthcare Providers in Saudi Arabia: A Comprehensive Review.

Turnover has a negative impact and can harm businesses, specifically the organizational structure and service delivery. The purpose of this review is to provide policymakers, healthcare administrators, and stakeholders in Saudi Arabia with approaches and strategies for reducing turnover and improving provider retention by synthesizing existing literature and identifying the key variables influencing turnover intention. This study conducted a comprehensive literature review to explore numerous variables associated with medical professional turnover intentions in Saudi Arabia from 2016 to 2024. The librarian assisted with the creation of the query string. The literature search was carried out using PubMed, Web of Science, and Google Scholar. By utilizing the key terms turnover AND healthcare providers ANDhealthcare facilities AND Saudi*. The authors separately examined and evaluated the risk of bias in each study using Joanna Briggs Institute (JBI) tools. The findings of this review show that all studies were executed using a cross-sectional design, and five studies were published in 2022. According to this review, ten studies were carried out in hospital settings. Ten studies examined elements associated with work. Moreover, five studies were associated with external variables, followed by five studies linked to personal factors. The most common factors for turnoverwere satisfaction, stress, and work. Turnover-related factors can have an impact on the long-term sustainability of the healthcare system. This review provides crucial information on the factors related toturnover, using the growing body of research in the Saudi context.

Performance of ChatGPT Across Different Versions in Medical Licensing Examinations Worldwide: Systematic Review and Meta-Analysis.

Over the past 2 years, researchers have used various medical licensing examinations to test whether ChatGPT (OpenAI) possesses accurate medical knowledge. The performance of each version of ChatGPT on the medical licensing examination in multiple environments showed remarkable differences. At this stage, there is still a lack of a comprehensive understanding of the variability in ChatGPT's performance on different medical licensing examinations. In this study, we reviewed all studies on ChatGPT performance in medical licensing examinations up to March 2024. This review aims to contribute to the evolving discourse on artificial intelligence (AI) in medical education by providing a comprehensive analysis of the performance of ChatGPT in various environments. The insights gained from this systematic review will guide educators, policymakers, and technical experts to effectively and judiciously use AI in medical education. We searched the literature published between January 1, 2022, and March 29, 2024, by searching query strings in Web of Science, PubMed, and Scopus. Two authors screened the literature according to the inclusion and exclusion criteria, extracted data, and independently assessed the quality of the literature concerning Quality Assessment of Diagnostic Accuracy Studies-2. We conducted both qualitative and quantitative analyses. A total of 45 studies on the performance of different versions of ChatGPT in medical licensing examinations were included in this study. GPT-4 achieved an overall accuracy rate of 81% (95% CI 78-84; P<.01), significantly surpassing the 58% (95% CI 53-63; P<.01) accuracy rate of GPT-3.5. GPT-4 passed the medical examinations in 26 of 29 cases, outperforming the average scores of medical students in 13 of 17 cases. Translating the examination questions into English improved GPT-3.5's performance but did not affect GPT-4. GPT-3.5 showed no difference in performance between examinations from English-speaking and non-English-speaking countries (P=.72), but GPT-4 performed better on examinations from English-speaking countries significantly (P=.02). Any type of prompt could significantly improve GPT-3.5's (P=.03) and GPT-4's (P<.01) performance. GPT-3.5 performed better on short-text questions than on long-text questions. The difficulty of the questions affected the performance of GPT-3.5 and GPT-4. In image-based multiple-choice questions (MCQs), ChatGPT's accuracy rate ranges from 13.1% to 100%. ChatGPT performed significantly worse on open-ended questions than on MCQs. GPT-4 demonstrates considerable potential for future use in medical education. However, due to its insufficient accuracy, inconsistent performance, and the challenges posed by differing medical policies and knowledge across countries, GPT-4 is not yet suitable for use in medical education. PROSPERO CRD42024506687; https://www.crd.york.ac.uk/prospero/display_record.php?RecordID=506687.

Bibliometric Review of Optimization and Image Processing of Positron Emission Tomography (PET) Imaging System between 1981-2022.

PET scan stands as a valuable diagnostic tool in nuclear medicine, enabling the observation of metabolic and physiological changes at a molecular level. However, PET scans have a number of drawbacks, such as poor spatial resolution, noisy images, scattered radiation, artifacts, and radiation exposure. These challenges demonstrate the need for optimization in image processing techniques. Our objective is to identify the evolving trends and impacts of publication in this field, as well as the most productive and influential countries, institutions, authors, themes, and articles. A bibliometric study was conducted using a comprehensive query string such as "positron emission tomography" AND "image processing" AND optimization to retrieve 1,783 publications from 1981 to 2022 found in the Scopus database related to this field of study. The findings revealed that the most influential country, institution, and authors are from the USA, and the most prevalent theme is TOF PET image reconstruction. The increasing trend in publication in the field of optimization of image processing in PET scans would address the challenges in PET scan by reducing radiation exposure, faster scanning speed, as well as enhancing lesion identification.

Monitoring Volcanic Plumes and Clouds Using Remote Sensing: A Systematic Review

Volcanic clouds pose significant threats to air traffic, human health, and economic activity, making early detection and monitoring crucial. Accurate determination of eruptive source parameters is crucial for forecasting and implementing preventive measures. This review article aims to identify the most common remote sensing methods for monitoring volcanic clouds. To achieve this, we conducted a systematic literature review of scientific articles indexed in the Web of Science database published between 2010 and 2022, using multiple query strings across all fields. The articles were reviewed based on research topics, remote sensing methods, practical applications, case studies, and outcomes using the Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) guidelines. Our study found that satellite-based remote sensing approaches are the most cost-efficient and accessible, allowing for the monitoring of volcanic clouds at various spatial scales. Brightness temperature difference is the most commonly used method for detecting volcanic clouds at a specified temperature threshold. Approaches that apply machine learning techniques help overcome the limitations of traditional methods. Despite the constraints imposed by spatial and temporal resolution and optical limitations of sensors, multiplatform approaches can overcome these limitations and improve accuracy. This study explores various techniques for monitoring volcanic clouds, identifies research gaps, and lays the foundation for future research.

Fast, parallel, and cache-friendly suffix array construction

PurposeString indexes such as the suffix array (sa) and the closely related longest common prefix (lcp) array are fundamental objects in bioinformatics and have a wide variety of applications. Despite their importance in practice, few scalable parallel algorithms for constructing these are known, and the existing algorithms can be highly non-trivial to implement and parallelize.MethodsIn this paper we present caps-sa, a simple and scalable parallel algorithm for constructing these string indexes inspired by samplesort and utilizing an LCP-informed mergesort. Due to its design, caps-sa has excellent memory-locality and thus incurs fewer cache misses and achieves strong performance on modern multicore systems with deep cache hierarchies.ResultsWe show that despite its simple design, caps-sa outperforms existing state-of-the-art parallel sa and lcp-array construction algorithms on modern hardware. Finally, motivated by applications in modern aligners where the query strings have bounded lengths, we introduce the notion of a bounded-context sa and show that caps-sa can easily be extended to exploit this structure to obtain further speedups. We make our code publicly available at https://github.com/jamshed/CaPS-SA.

A Trie-Based Authentication Scheme for Approximate String Queries

A Trie-Based Authentication Scheme for Approximate String Queries

A corpus-based real-time text classification and tagging approach for social data

With the rapid accumulation of large amounts of user-generated content through social media, social data reuse and integration have gained increasing attention recently. This has made it almost obsolete for software applications to collect, store, and work with their own data stored on local servers. While, with the provision of Application Programming Interfaces from the leading social networking sites, data acquisition and integration has become possible, the meaningful usage of such unstructured, non-uniform, and incoherent data collections needs special procedures of data summarization, understanding, and visualization. One particular aspect in this regard that needs special attention is the procedures for data (text snippets in the form of social media posts) categorization and concept tagging to filter out the relevant and most suitable data for the particular audience and for the particular purpose. In this regard, we propose a corpus-based approach for searching and successively categorizing and tagging the social data with relevant concepts in real time. The proposed approach is capable of addressing the semantical and morphological similarities, as well as domain-specific vocabularies of query strings and tagged concepts. We demonstrate the feasibility and application of our proposed approach in a web-based tool that allows searching Facebook posts and provides search results together with a concept map for further navigation, filtering, and refining of search results. The tool has been evaluated by performing multiple search queries, and resultant concept maps and annotated texts are analyzed in terms of their precision. The approach is thereby found effective in achieving its stated goal of classifying text snippets in real time.

Finding maximal exact matches in graphs

BackgroundWe study the problem of finding maximal exact matches (MEMs) between a query string Q and a labeled graph G. MEMs are an important class of seeds, often used in seed-chain-extend type of practical alignment methods because of their strong connections to classical metrics. A principled way to speed up chaining is to limit the number of MEMs by considering only MEMs of length at least κ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\kappa$$\\end{document} (κ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\kappa$$\\end{document}-MEMs). However, on arbitrary input graphs, the problem of finding MEMs cannot be solved in truly sub-quadratic time under SETH (Equi et al., TALG 2023) even on acyclic graphs.ResultsIn this paper we show an O(n·L·dL-1+m+Mκ,L)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$O(n\\cdot L \\cdot d^{L-1} + m + M_{\\kappa ,L})$$\\end{document}-time algorithm finding all κ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\kappa$$\\end{document}-MEMs between Q and G spanning exactly L nodes in G, where n is the total length of node labels, d is the maximum degree of a node in G, m=|Q|\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$m = |Q|$$\\end{document}, and Mκ,L\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$M_{\\kappa ,L}$$\\end{document} is the number of output MEMs. We use this algorithm to develop a κ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\kappa$$\\end{document}-MEM finding solution on indexable Elastic Founder Graphs (Equi et al., Algorithmica 2022) running in time O(nH2+m+Mκ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$O(nH^2 + m + M_\\kappa )$$\\end{document}, where H is the maximum number of nodes in a block, and Mκ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$M_\\kappa$$\\end{document} is the total number of κ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\kappa$$\\end{document}-MEMs. Our results generalize to the analysis of multiple query strings (MEMs between G and any of the strings). Additionally, we provide some experimental results showing that the number of graph MEMs is an order of magnitude smaller than the number of string MEMs of the corresponding concatenated collection.ConclusionsWe show that seed-chain-extend type of alignment methods can be implemented on top of indexable Elastic Founder Graphs by providing an efficient way to produce the seeds between a set of queries and the graph. The code is available in https://github.com/algbio/efg-mems.

Joint Representation Learning for Retrieval and Annotation of Genomic Interval Sets.

As available genomic interval data increase in scale, we require fast systems to search them. A common approach is simple string matching to compare a search term to metadata, but this is limited by incomplete or inaccurate annotations. An alternative is to compare data directly through genomic region overlap analysis, but this approach leads to challenges like sparsity, high dimensionality, and computational expense. We require novel methods to quickly and flexibly query large, messy genomic interval databases. Here, we develop a genomic interval search system using representation learning. We train numerical embeddings for a collection of region sets simultaneously with their metadata labels, capturing similarity between region sets and their metadata in a low-dimensional space. Using these learned co-embeddings, we develop a system that solves three related information retrieval tasks using embedding distance computations: retrieving region sets related to a user query string, suggesting new labels for database region sets, and retrieving database region sets similar to a query region set. We evaluate these use cases and show that jointly learned representations of region sets and metadata are a promising approach for fast, flexible, and accurate genomic region information retrieval.

Pattern Masking for Dictionary Matching: Theory and Practice

Data masking is a common technique for sanitizing sensitive data maintained in database systems which is becoming increasingly important in various application areas, such as in record linkage of personal data. This work formalizes the Pattern Masking for Dictionary Matching (PMDM) problem: given a dictionary D\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {D}$$\\end{document} of d strings, each of length ℓ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\ell $$\\end{document}, a query string q of length ℓ\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\ell $$\\end{document}, and a positive integer z, we are asked to compute a smallest set K⊆{1,…,ℓ}\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$K\\subseteq \\{1,\\ldots ,\\ell \\}$$\\end{document}, so that if q[i] is replaced by a wildcard for all i∈K\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$i\\in K$$\\end{document}, then q matches at least z strings from D\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {D}$$\\end{document}. Solving PMDM allows providing data utility guarantees as opposed to existing approaches. We first show, through a reduction from the well-known k-Clique problem, that a decision version of the PMDM problem is NP-complete, even for binary strings. We thus approach the problem from a more practical perspective. We show a combinatorial O((dℓ)|K|/3+dℓ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}((d\\ell )^{|K|/3}+d\\ell )$$\\end{document}-time and O(dℓ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}(d\\ell )$$\\end{document}-space algorithm for PMDM for |K|=O(1)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$|K|=\\mathscr {O}(1)$$\\end{document}. In fact, we show that we cannot hope for a faster combinatorial algorithm, unless the combinatorial k-Clique hypothesis fails (Abboud et al. in SIAM J Comput 47:2527–2555, 2018; Lincoln et al., in: 29th ACM-SIAM Symposium on Discrete Algorithms (SODA), 2018). Our combinatorial algorithm, executed with small |K|, is the backbone of a greedy heuristic that we propose. Our experiments on real-world and synthetic datasets show that our heuristic finds nearly-optimal solutions in practice and is also very efficient. We also generalize this algorithm for the problem of masking multiple query strings simultaneously so that every string has at least z matches in D\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {D}$$\\end{document}. PMDM can be viewed as a generalization of the decision version of the dictionary matching with mismatches problem: by querying a PMDM data structure with string q and z=1\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$z=1$$\\end{document}, one obtains the minimal number of mismatches of q with any string from D\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {D}$$\\end{document}. The query time or space of all known data structures for the more restricted problem of dictionary matching with at most k mismatches incurs some exponential factor with respect to k. A simple exact algorithm for PMDM runs in time O(2ℓd)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}(2^\\ell d)$$\\end{document}. We present a data structure for PMDM that answers queries over D\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {D}$$\\end{document} in time O(2ℓ/2(2ℓ/2+τ)ℓ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}(2^{\\ell /2}(2^{\\ell /2}+\ au )\\ell )$$\\end{document} and requires space O(2ℓd2/τ2+2ℓ/2d)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}(2^{\\ell }d^2/\ au ^2+2^{\\ell /2}d)$$\\end{document}, for any parameter τ∈[1,d]\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\ au \\in [1,d]$$\\end{document}. We complement our results by showing a two-way polynomial-time reduction between PMDM and the Minimum Union problem [Chlamtáč et al., ACM-SIAM Symposium on Discrete Algorithms (SODA) 2017]. This gives a polynomial-time O(d1/4+ϵ)\\documentclass[12pt]{minimal} \\usepackage{amsmath} \\usepackage{wasysym} \\usepackage{amsfonts} \\usepackage{amssymb} \\usepackage{amsbsy} \\usepackage{mathrsfs} \\usepackage{upgreek} \\setlength{\\oddsidemargin}{-69pt} \\begin{document}$$\\mathscr {O}(d^{1/4+\\epsilon })$$\\end{document}-approximation algorithm for PMDM, which is tight under a plausible complexity conjecture. This is an extended version of a paper that was presented at International Symposium on Algorithms and Computation (ISAAC) 2021.

Systematic review protocol for complications following surgical decompression of degenerative cervical myelopathy.

Degenerative Cervical Myelopathy (DCM) is one of the most common degenerative disorders of cervical spine and sources of cord dysfunction in adults. It usually manifests with neurologic presentations such as loss of dexterity and gait issues. Treatment for moderate and severe cases of DCM is surgical decompression of the region. There are many approaches available for surgical intervention which could be categorized into anterior and posterior based on the side of neck where operation takes place. Additionally, for certain cases the hybridized anterior-posterior combined surgery is indicated. While there are many technical differences between these approaches with each having its own advantages, the complications and safety profiles of them are not fully disclosed. This protocol aims to systematically search for current reports on complications of surgical decompression methods of DCM and pool them for robust evidence generation. Search will be carried out in PubMed, Scopus, and Cochrane databases for retrospective and prospective surgical series, cohorts, or trials being performed for DCM with at least a sample size of 20 patients. Query strings will be designed to capture reports with details of complications with no year limit. Studies not being original (e.g., review articles, case reports, etc.), not in English, having patients younger than 18-years-old, and not reporting at least one complication will be excluded. Two independent reviewers will review the titles and abstracts for first round of screening. Full text of retrieved studies from previous round will be screened again by the same reviewers. In case of discrepancy, the third senior reviewer will be consulted. Eligible studies will then be examined for data extraction where data will be recorded into standardized form. Cumulative incidence and 95% confidence intervals of complication will be then pooled based on generalized linear mixed models with consideration of approach of surgery as subgroups. Heterogeneity tests will be performed for assessment of risk of bias. This systematic review is aimed at providing practical information for spine surgeons on the rates of complications of different surgical approaches of DCM decompression. Proper decision-making regarding the surgical approach in addition to informing patients could be facilitated through results of this investigation.

Impact of Varicocele Repair on Assisted Reproductive Technique Outcomes in Infertile Men: A Systematic Review and Meta-Analysis.

In this systematic review and meta-analysis, we investigated assisted reproductive technology (ART) success in infertile men with clinical varicocele and abnormal semen parameters who underwent varicocele repair (VR) before the ART procedure as compared to those who did not. A comprehensive search of the Scopus, PubMed, Embase, and Cochrane Library databases was conducted using a specific query string to identify studies examining the impact of VR on ART outcomes, including fertilization rate, clinical pregnancy, pregnancy loss, and live-birth rate, until October 2023. Outcomes were analyzed based on the type of ART. Studies on VR in infertile men with non-obstructive azoospermia and those who underwent ART only due to female factor infertility were excluded from the study. Out of 1,554 articles reviewed, only 9 met the inclusion criteria for the study. All the included articles were observational studies. The variability in study quality in the included literature resulted in a moderate overall risk of bias. Data analysis showed that for intrauterine insemination, there was no difference in the clinical pregnancy rate (odds ratio [OR] 1.01, 95% confidence interval [CI]: 0.42, 2.45; p=0.97). However, for intracytoplasmic sperm injection (ICSI), men with VR showed a significant improvement in fertilization rate (mean difference 10.9, 95% CI: 5.94, 15.89; p<0.01), clinical pregnancy rate (OR 1.38, 95% CI: 1.07, 1.78; p=0.01) and live-birth rate (OR 2.07, 95% CI: 1.45, 2.97; p<0.01), compared to men who did not undergo VR. The findings of this systematic review and meta-analysis suggest that VR has a positive impact on pregnancy and live birth rates after ICSI. However, biases like small sample sizes and heterogeneous populations highlight the need for larger, well-designed prospective studies to validate these findings.

Knowledge spillovers and entrepreneurial ecosystem: A systematic literature review

The purpose of this study was to synthesize the literature that has been established on the interrelationship of “knowledge spillovers and entrepreneurial ecosystem” through a systematic literature review. The query strings generated 85 articles, of which 51 were selected for final review. The analysis was performed using MySLR software that uses the Latent Dirichlet Allocation (LDA) method, and the effectiveness was measured through the perplexity score and coherence value of the topics. The results reveal that although a plethora of literature is available on these two topics individually, the mutual relationship between these two concepts is understudied. A stronger research interest was observed after 2018 which indicates the infancy of the topic as a whole, which is yet to be explored and empirically tested, specifically in developing economies. Most of the research was focused on the role of universities, innovation, geographic dynamics and policies with respect to entrepreneurial ecosystems. Results reveal the disparity of knowledge spillovers with regard to other contributors; significantly lesser attention was paid to its role in relation to the entrepreneurial ecosystem. Along with critical analysis and synthesis of literature, future directions have also been presented in the paper.

Development and Validation of an Automated Tool to Retrieve and Curate Faculty Publications of Academic Departments.

Introduction Academic departments need to monitor their faculty's academic productivity for various purposes, such as reporting to the medical school dean, assessing the allocation of non-clinical research time, evaluating for rank promotion, and reporting to the Accreditation Council for Graduate Medical Education (ACGME). Our objective was to develop and validate a simple method that automatically generates query strings to identify and process distinct department faculty publications listed in PubMed and Scopus. Methods We created a macro-enabled Excel workbook (Microsoft, Redmond, WA)to automate the retrieval of faculty publications from the PubMed and Scopus bibliometric databases (available at https://bit.ly/get-pubs). Where the returned reference includes the digital object identifier (doi), a link is provided in the workbook. Duplicate publications are removed automatically, and false attributions are managed. Results At the University of Miami, between 2020 and 2021, there were 143 anesthesiology faculty-authored publications with a PubMed identifier (PMID), 95.8% identified by the query and 4.2% missed. At Vanderbilt University Medical Center, between 2019 and 2021, there were 760 anesthesiology faculty-authored publications with a PMID, 94.3% identified by the query and 5.7% missed. Recall, precision, and the F1 score were all above 93% at both medical centers. Conclusions We developed a highly accurate, simple, transportable, scalable method to identify publications in PubMed and Scopus authored by anesthesiology faculty. Manual checking and faculty feedback are required because not all names can be disambiguated, and some references are missed. This process can greatly reduce the burden of curating a list of faculty publications. The methodology applies to other academic departments that track faculty publications.

Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails

The string matching problem on a node-labeled graph G=(V,E) asks whether a given pattern string P equals the concatenation of node labels of some path in G. This is a basic primitive in various problems in bioinformatics, graph databases, or networks, and it was recently proven that solving it in time O(|E|1−ϵ|P|) or O(|E||P|1−ϵ) is hard under OVH, the Orthogonal Vectors Hypothesis, and thus under SETH, the Strong Exponential Time Hypothesis (Equi et al., 2019 [11]). We consider its indexed version, where the graph is indexed to support string queries. We show that, under OVH, no polynomial-time index of the graph performed in time O(|E|α) can support querying P in time O(|P|+|E|δ|P|β), with either δ<1 or β<1.We present our techniques as a general framework, introducing the notion of linear independent-components (lic) reduction, from which we derive our result. This allows us to also translate the quadratic conditional lower bound of Backurs and Indyk (2015) [48] for the problem of matching a query string inside a text, under edit distance, into an analogous tight quadratic lower bound for its indexed version. This improves the recent result of Cohen-Addad, Feuilloley and Starikovskaya (2019) [49], with a slightly different boundary condition. We also apply our technique to obtain the first quadratic indexing lower bounds for Fréchet distance and rooted unlabeled subtree-isomorphism queries.

Impact of SARS-CoV-2 Infection in Children with Asthma and Impact of COVID-19 Vaccination: Current Evidence and Review of the Literature.

The clinical aspects of SARS-CoV-2 infection, as well as the COVID-19 vaccines' safety, efficacy and effectiveness in pediatric patients with asthma, are crucial to adapting clinical management in this fragile population and for prevention strategies. The aim of this narrative review was to evaluate the impact of SARS-CoV-2 infection in children with asthma and the impact of COVID-19 vaccination. Systematic research using the principal medical databases was conducted using specific search query strings from the early spreading of COVID-19 globally until March 2023; further relevant data were drawn from the main national and supranational institutions. No significant differences in SARS-CoV-2 incidence and morbidity were found in asthmatic pediatric patients compared to non-asthmatic ones; however, subjects with uncontrolled asthma were found to be at increased risk of developing a serious disease during SARS-CoV-2 infection. Regarding COVID-19 vaccines, accumulating data support their safety, efficacy and effectiveness on asthmatic children regardless of asthma severity. Further cohort-based studies are needed as the evidence of new epidemic waves caused by new viral variants makes the current knowledge outdated.

Global trends in COVID-19 Alzheimer's related research: a bibliometric analysis.

The COVID-19 pandemic has significantly impacted public health, putting people with Alzheimer's disease at significant risk. This study used bibliometric analysis method to conduct in-depth research on the relationship between COVID-19 and Alzheimer's disease, as well as to predict its development trends. The Web of Science Core Collection was searched for relevant literature on Alzheimer's and Coronavirus-19 during 2019-2023. We used a search query string in our advanced search. Using Microsoft Excel 2021 and VOSviewer software, a statistical analysis of primary high-yield authors, research institutions, countries, and journals was performed. Knowledge networks, collaboration maps, hotspots, and regional trends were analyzed using VOSviewer and CiteSpace. During 2020-2023, 866 academic studies were published in international journals. United States, Italy, and the United Kingdom rank top three in the survey; in terms of productivity, the top three schools were Harvard Medical School, the University of Padua, and the University of Oxford; Bonanni, Laura, from Gabriele d'Annunzio University (Italy), Tedeschi, Gioacchino from the University of Campania Luigi Vanvitelli (Italy), Vanacore, Nicola from Natl Ctr Dis Prevent and Health Promot (Italy), Reddy, P. Hemachandra from Texas Tech University (USA), and El Haj, Mohamad from University of Nantes (France) were the authors who published the most articles; The Journal of Alzheimer's Disease is the journals with the most published articles; "COVID-19," "Alzheimer's disease," "neurodegenerative diseases," "cognitive impairment," "neuroinflammation," "quality of life," and "neurological complications" have been the focus of attention in the last 3 years. The disease caused by the COVID-19 virus infection related to Alzheimer's disease has attracted significant attention worldwide. The major hot topics in 2020 were: "Alzheimer' disease," COVID-19," risk factors," care," and "Parkinson's disease." During the 2 years 2021 and 2022, researchers were also interested in "neurodegenerative diseases," "cognitive impairment," and "quality of life," which require further investigation.

Question Answering System Approaches: A Review

Data is increasing in volume day by day, this data can be processed and classified into various categories. Users all over the internet ask tons of questions to which they want precise answers. The Question Answering system is the best solution in such scenarios. Traditional approach mainly focuses on providing the documents which include the keywords related to the query asked by the users. While the question answering approach provides a better alternative by further refining the results, it not only returns the related documents but also retrieves the most relevant answer from the available corpus of data. Converting the questions asked by the users into an appropriate query string, classifying the question, retrieving the documents and extracting the valid answer are the main steps involved in this system.

Strategies for Recruiting Migrants to Participate in a Sexual Health Survey: Methods, Results, and Lessons.

In this article, we describe the approaches taken to recruit adult migrants living in Australia for a sexual health and blood-borne virus survey (paper and online) and present data detailing the outcomes of these approaches. The purpose was to offer guidance to redress the under-representation of migrants in public health research. Methods of recruitment included directly contacting people in individual/organizational networks, social media posts/advertising, promotion on websites, and face-to-face recruitment at public events/venues. Search query strings were used to provide information about an online referral source, and project officers kept records of activities and outcomes. Descriptive statistical analyses were used to determine respondent demographic characteristics, proportions recruited to complete the paper and online surveys, and sources of referral. Logistic regression analyses were run to predict online participation according to demographic characteristics. The total sample comprised 1454 African and Asian migrants, with 59% identifying as female. Most respondents (72%) were recruited to complete the paper version of the survey. Face-to-face invitations resulted in the highest number of completions. Facebook advertising did not recruit large numbers of respondents. Same-sex attraction and age (40–49 years) were statistically significant predictors of online completion. We encourage more researchers to build the evidence base on ways to produce research that reflects the needs and perspectives of minority populations who often bear the greatest burden of disease.