Search

The importance of involving humans in the data science process has been widely discussed in the literature. However, studies lack details on how to involve humans in the process. Using a design science approach, this paper proposes and evaluates a human‐supervised data science framework in the context of local governments. Our findings suggest that the involvement of a stakeholder group, public managers in this case, in the process of data science project enhanced quality of data science outcomes. Public managers' detailed knowledge on both the data and context was beneficial for improving future data science infrastructure. In addition, the study suggests that local governments can harness the value of data‐driven approaches to policy and decision making through focalized investments in improving data and data science infrastructure, which includes culture and processes necessary to incorporate data science and analytics into the decision‐making process. [ABSTRACT FROM AUTHOR]

The semantic query problem is commonly called the semantic gap and is one of the significant problems in multimedia data retrieval. In this study, we focus on multimedia data retrieval by combining semantic information with data content to solve the semantic gap problem effectively. The main idea behind the combination of low-level content descriptors and the concept of multimedia data is to represent the content information with the semantic information by adding a low-level content descriptor as a new dimension to the index structure. This new dimension is represented by constructing an array index structure that uses a fuzzy clustering algorithm. Thus, a new high-dimensional index structure, named MM-FOOD, supporting querying of multimedia data, including fuzzy querying, is presented in this paper. This proposed index structure's construction and query algorithms are explained throughout this paper. Our experiments show that our indexing mechanism is considerably efficient compared to the basic indexing approach, which stores low-level content and semantic concept descriptors in separate structures when the data size is large. [ABSTRACT FROM AUTHOR]

Near-real-time precipitation retrieval plays an important role in the study of the evolutionary process of precipitation and the prevention of disasters caused by heavy precipitation. Compared with ground-based precipitation observations, the infrared precipitation estimations from geostationary satellites have great advantages in terms of geographical coverage and temporal resolution. However, precipitation retrieved from multispectral infrared data still faces challenges in terms of accuracy, especially in extreme cases. In this paper, we propose a new paradigm for satellite multispectral infrared data retrieval of precipitation and construct a new model called PrecipGradeNet. This model uses FY-4A L1 FDI data as the input, IMERG precipitation data as the training target, and improves the precipitation retrieval accuracy by grading the precipitation intensity through Res-UNet, a semantic segmentation network. To evaluate the precipitation retrieval of the model, we compare the retrieval results with the FY-4A L2 QPE operational product to the IMERG precipitation. IMERG is considered as the ground truth. We evaluate the precipitation retrieval from the precipitation fall area identification, the precipitation intensity interval discrimination, and the precipitation quantification. Experimental results show that PrecipGradeNet has better overall performance compared with the FY-4A QPE product in precipitation fall area identification with POD increased by 48% and CSI and HSS improved by 21% and 14%. PrecipGradeNet also has better performance in light precipitation with POD increased by 114% and CSI and HSS improved by 64% and 52%, and better overall precipitation quantification, with RMSE and CC improved by 16% and 15%. In addition, PrecipGradeNet avoids the overall bias in the low and extreme high precipitation cases. Therefore, the new paradigm proposed in this paper has the potential to improve the retrieval accuracy of satellite precipitation estimation products. This study suggests that the application of semantic segmentation methods may provide a new path to correct the intensity bias of the satellite-based precipitation products. [ABSTRACT FROM AUTHOR]

Purpose: This paper aims to explore the realm of literature about personalization of digital library services. This paper focuses on users' unique needs and will identify different types of personalized services. Therefore, this study has identified different types of services personalization in the context of digital academic libraries. Design/methodology/approach: In this research, the systematic review method has been used to obtain the relevant indicators of different types of personalization in the context of libraries. To explain basic indicators, a Delphi method has been used. The Delphi panel's members consisted of 15 experts (faculty members, researchers, professional users and software designers). A purposeful sampling and the Delphi fulfillment process were performed in three rounds. After collecting data, descriptive statistics (mean and standard deviation), inferential statistics (binomial distribution test) and the Kendall coordination coefficient were used to determine the consensus rate among experts. Findings: A total of 103 indicators were extracted for different types of personalization through a systematic literature review. Of these, 90 indicators were considered significant in the experts' view. Generally, content personalization, interactive personalization, collaborative personalization and information retrieval personalization are the main components of personalization types, each of which has its own indicators. Originality/value: This study has dealt with the issue of what is personalized in the context of digital academic library. The findings should be helpful and effective in the development of a holistic view on personalization of services in digital libraries. [ABSTRACT FROM AUTHOR]

This paper investigates the fact that construction projects, due to their specificity, are complex, temporary and dynamic. Over their course, participants change, successive construction works are done and new information becomes available. This carries over to difficulties in communication. In the literature, numerous studies note the fact that a network-based approach to the analysis and monitoring of communication as a part of complex construction projects is commendable. Relations between agents, knowledge and tasks in the context of communication within a construction project can be visualized in the form of a meta-network, and suitably developed structural measures can be used to analyze them. In this paper, the authors used meta-network theory to analyze relations between project participants, knowledge and tasks in the context of communication within a construction project, on the basis of the construction of a housing estate located in Katowice, Poland. Meta-network structural analysis allowed for a deeper understanding of these relations and the detection of essential information about the level of communication in the project under investigation, which was a basis for further discussion. The authors also stress the benefits from the approach presented and argue that it should be a starting point for effective management in the sphere of communication in construction companies. [ABSTRACT FROM AUTHOR]

Abstract Participating in research and teaching activities of universities, and then providing valuable information and policy suggestions are an important task of academic librarians. This paper demonstrates systematically in practice that how academic librarians can involve and contribute in the research activities of universities. Our demonstration is launched through comparative studies of research productivities and research impacts among universities. These universities are divided into two counterparts. One is the Chinese universities which aim to construct the world-class mathematics discipline, and the other is the university which already owns the world-class mathematics discipline. During these comparative studies, we demonstrate in practice that how to seek the research question, how to collect and process the data, how to design the research methods, how to analyze the data, and how to propose policy suggestions. Contributions of this paper are twofold. The first aspect is a systematic demonstration in practice. This demonstration shows to academic librarians that how to involve and contribute in the research activities of universities. The academic librarianship thus can be strengthened, as it provides a way for us academic librarians to promote our roles in teaching and research activities of universities. The second aspect is to gain insights in the research productivities and research impacts of Chinese universities which aim to construct the world-class mathematics discipline. During this process, we design a bibliometric indicator for evaluating the research impacts of universities based on academic papers, launch comparative studies with the university that already owns the world-class mathematics discipline, and propose policy suggestions for China to scientifically achieve its goal. This also provides references for other countries to launch similar studies. [ABSTRACT FROM AUTHOR]

Scientific research plays an important role in the achievement of a sustainable society. However, grasping the trends in sustainability research is difficult because studies are not devised and conducted in a top-down manner with Sustainable Development Goals (SDGs). To understand the bottom-up research activities, we analyzed over 300,000 publications concerned with sustainability by using citation network analysis and natural language processing. The results suggest that sustainability science's diverse and dynamic changes have been occurring over the last few years; several new topics, such as nanocellulose and global health, have begun to attract widespread scientific attention. We further examined the relationship between sustainability research subjects and SDGs and found significant correspondence between the two. Moreover, we extracted SDG topics that were discussed following a convergent approach in academic studies, such as "inclusive society" and "early childhood development", by observing the convergence of terms in the citation network. These results are valuable for government officials, private companies, and academic researchers, empowering them to understand current academic progress along with research attention devoted to SDGs. [ABSTRACT FROM AUTHOR]

This paper discusses the importance of search engine optimization (SEO) for digital repositories. We first describe the importance of SEO in the academic environment. Online systems, such as institutional digital repositories, are established and used to disseminate scientific information. Next, we present a case study of our own institution's DSpace repository, performing several SEO tests and identifying the potential SEO issues through a group of three independent audit tools. In this case study, we attempt to resolve most of the SEO problems that appeared within our research and propose solutions to them. After making the necessary adjustments, we were able to improve the quality of SEO variables by more than 59% compared to the non-optimized state (a fresh installation of DSpace). Finally, we apply the same software audit tools to a sample of global institutional repositories also based on DSpace. In the discussion, we compare the SEO sample results with the average score of the semi-optimized DSpace repository (from the case study) and make conclusions. [ABSTRACT FROM AUTHOR]

Our research objective is to improve the Huffman coding efficiency by adjusting the data using a Poisson distribution, which avoids the undefined entropies too. The scientific value added by our paper consists in the fact of minimizing the average length of the code words, which is greater in the absence of applying the Poisson distribution. Huffman Coding is an error-free compression method, designed to remove the coding redundancy, by yielding the smallest number of code symbols per source symbol, which in practice can be represented by the intensity of an image or the output of a mapping operation. We shall use the images from the PASCAL Visual Object Classes (VOC) to evaluate our methods. In our work we use 10,102 randomly chosen images, such that half of them are for training, while the other half is for testing. The VOC data sets display significant variability regarding object size, orientation, pose, illumination, position and occlusion. The data sets are composed by 20 object classes, respectively: aeroplane, bicycle, bird, boat, bottle, bus, car, motorbike, train, sofa, table, chair, tv/monitor, potted plant, person, cat, cow, dog, horse and sheep. The descriptors of different objects can be compared to give a measurement of their similarity. Image similarity is an important concept in many applications. This paper is focused on the measure of similarity in the computer science domain, more specifically information retrieval and data mining. Our approach uses 64 descriptors for each image belonging to the training and test set, therefore the number of symbols is 64. The data of our information source are different from a finite memory source (Markov), where its output depends on a finite number of previous outputs. When dealing with large volumes of data, an effective approach to increase the Information Retrieval speed is based on using Neural Networks as an artificial intelligent technique. [ABSTRACT FROM AUTHOR]

Traditional Chinese medicine (TCM) is a summary of the diagnosis and treatment experience formed by the working people in the long-term struggle against diseases, so it is very important to protect the intangible cultural heritage of TCM. How to extract valuable knowledge accurately and conveniently from the massive medical records of TCM is one of the important issues in the current research on the development of TCM. Due to the large amount of data of TCM medical records, many feature attributes, and diverse patterns, the existing classification technology has high computational complexity, low mining efficiency, and poor universality. Therefore, this paper proposed to quantify the medical records of TCM and obtained the main symptoms according to the improved hierarchical clustering feature selection algorithm. This paper also proposed a support vector machine (SVM) classification method using improved particle swarm algorithm to classify TCM information, which not only improves the efficiency and accuracy of TCM information classification but also discovers the potential dialectical and symptom patterns in diagnosis and treatment, so that the intangible cultural heritage protection of TCM can be developed sustainably. This paper showed that the information acquisition accuracy of the improved algorithm was very high. Before the improved algorithm was used, the accuracy of information mining for TCM was 67.90% at the highest and 65.53% at the lowest, but after using the improved algorithm, the accuracy rate of information mining for TCM was 88.02% at the highest and 82.45% at the lowest. It can be seen that using the improved algorithm to mine TCM information can quickly process effective information. [ABSTRACT FROM AUTHOR]

A functional $k$ -batch code of dimension $s$ consists of $n$ servers storing linear combinations of $s$ linearly independent information bits. Any multiset request of size $k$ of linear combinations (or requests) of the information bits can be recovered by $k$ disjoint subsets of the servers. The goal under this paradigm is to find the minimum number of servers for given values of $s$ and $k$. A recent conjecture states that for any $k=2^{s-1}$ requests the optimal solution requires $2^{s}-1$ servers. This conjecture is verified for $s \leqslant 5$ but previous work could only show that codes with $n=2^{s}-1$ servers can support a solution for $k=2^{s-2} + 2^{s-4} + \left \lfloor{ \frac { 2^{s/2}}{\sqrt {24}} }\right \rfloor $ requests. This paper reduces this gap and shows the existence of codes for $k=\lfloor \frac {5}{6}2^{s-1} \rfloor - s$ requests with the same number of servers. Another construction in the paper provides a code with $n=2^{s+1}-2$ servers and $k=2^{s}$ requests, which is an optimal result. These constructions are mainly based on extended Simplex codes and equivalently provide constructions for parallel Random I/O (RIO) codes. [ABSTRACT FROM AUTHOR]

Aiming at the traditional ciphertext retrieval scheme in cloud environment, which generates file vectors and retrieval vectors based on statistical model, and does not consider the deep-seated semantic information of files and requests, this paper proposes a deep-seated semantic ciphertext retrieval model based on hybrid Cloud Architecture. The vector generation model is constructed through the private cloud federated learning neural network model, and the ciphertext data is stored through the public cloud. In addition, this paper proposes a secret inverted index table to store file vectors, so as to improve the efficiency of retrieval without ensuring that the retrieval information is not leaked in the retrieval process of public cloud. The analysis and experiments on real data sets show that this scheme is better than the current ciphertext retrieval schemes of the same type in terms of security and search efficiency. [ABSTRACT FROM AUTHOR]

Due to the heterogeneity of program language and natural language query, it is difficult to identify the semantic relationship between them, which leads to the low efficiency of code recommendation. In order to solve the problems of the above code recommendation technology, a code recommendation method based on joint embedded attention network (JEAN) is proposed in this paper. The method uses GRU Network to embed code snippets and describe queries into vector representation, which solves the problem of heterogeneous code snippets and natural language queries. The Attention mechanism is then used to distribute totally different weights to different components of every mode of the code snippet. The reason for the Attention mechanism is that different components of every mode of the code snippet contribute differently to the semantic vector of the final code snippet, making it interpretable. Finally, two commonly used evaluation indexes of information retrieval, SuccessRate@k and MRR, are used for experimental comparison with other baseline models. The experimental results show that the code recommendation method based on joint embedded attention network proposed in this paper can effectively recommend appropriate code snippets according to the needs of developers, and its performance is better than other baseline methods. [ABSTRACT FROM AUTHOR]

Implementation of ocean observation sensors are booming in recent years for encouraging research among coastal areas all over the world. This results in a copious amount of big data which makes it difficult for traditional data processing applications to manage them. The complexity in ocean observing community is heterogeneity and interpretation, which directs to a high-end information retrieval system. World Wide Web Consortium (W3C) spreads the usage of Semantic Web (SW) that provide easier way to search, reuse, combine and share information by integrating the data into a single platform. The use of semantic web in big data management helps to increase end-users ability for self-management of data from various sources, to handle the concepts and relationships of a domain and to manage the terminologies while connecting data from a varied data sources. This paper focuses on integrating big data with semantic web technology by developing a knowledge base system through ontology to solve the problem of heterogeneity in ocean observing communities. Ontology refers to a set of machine-readable controlled vocabularies which interprets big data by combining the data concepts with ontology classes. The proposed data model upgrades the information system in terms of improvising data analysis, discovery, retrieval and decision making. In addition to that, this paper also evaluates the quality of proposed ontology and found to be 39.28% improved in completeness, 45.29% reduced in structural complexity, 11% and 37.7% decreased in conciseness and correctness, respectively. [ABSTRACT FROM AUTHOR]

Outsourcing data to the cloud offers various advantages, such as improved reliability, enhanced flexibility, accelerated deployment, and so on. However, data security concerns arise due to potential threats such as malicious attacks and internal misuse of privileges, resulting in data leakage. Data encryption is a recognized solution to address these issues and ensure data confidentiality even in the event of a breach. However, encrypted data presents challenges for common operations like access control and range queries. To address these challenges, this paper proposes Secure Multi-dimensional Data Retrieval with Access Control and Range Search in the Cloud (SMDR). In this paper, we propose SMDR policy, which supports both access control and range queries. The design of the SMDR policy cleverly utilizes the minimum and maximum points of buckets, enabling the SMDR policy is highly appropriate for supporting range queries on multi-dimensional data. Additionally, we have made modifications to Ciphertext Policy-Attribute Based Encryption (CP-ABE) to enable effective integration with the SMDR policy, and then constructed a secure index using the SMDR policy and CP-ABE. By utilizing the secure index, access control and range queries can be effectively supported over the encrypted multi-dimensional data. To evaluate the efficiency of SMDR, extensive experiments have been conducted. The experimental results demonstrate the effectiveness and suitability of SMDR in handling encrypted multi-dimensional data. Additionally, we provide a detailed security analysis of SMDR. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of maximizing the effectiveness of the ranking produced by information retrieval or recommender systems and at the same time maximizing two fairnesses, that of the group and that of the individual. The context of this paper is therefore that of access to information carried out by users, who aim to satisfy their own information needs, to documents produced by authors and curators who aim to be exposed in a fair manner, i.e. without discriminating between groups nor individuals. The paper describes a general method based on the spectral decomposition of mixtures of symmetric matrices, each of which represents a variable to be maximized, and experiments conducted with the use of a test collection. The method described in this paper has explained if and how the trade-offs between effectiveness, group fairness and individual fairness manifest themselves. The experimental results show that maintaining an acceptable level of effectiveness and fairness at the same time is feasible and (b) the trade-offs exist but the order of magnitude of the variations depends on the measure of effectiveness used and therefore by what the user's model of access to information is as well as on the fairness measures and therefore on how authors or editors should be exposed. • Modern information access systems should balance fairness and effectiveness. • A single eigensystem achieves simultaneous maximization. • Fairness, effectiveness, and access measures are crucial in trade-offs. [ABSTRACT FROM AUTHOR]

The retrieval of important information from a dataset requires applying a special data mining technique known as data clustering (DC). DC classifies similar objects into a groups of similar characteristics. Clustering involves grouping the data around k-cluster centres that typically are selected randomly. Recently, the issues behind DC have called for a search for an alternative solution. Recently, a nature-based optimization algorithm named Black Hole Algorithm (BHA) was developed to address the several well-known optimization problems. The BHA is a metaheuristic (population-based) that mimics the event around the natural phenomena of black holes, whereby an individual star represents the potential solutions revolving around the solution space. The original BHA algorithm showed better performance compared to other algorithms when applied to a benchmark dataset, despite its poor exploration capability. Hence, this paper presents a multi-population version of BHA as a generalization of the BHA called MBHA wherein the performance of the algorithm is not dependent on the best-found solution but a set of generated best solutions. The method formulated was subjected to testing using a set of nine widespread and popular benchmark test functions. The ensuing experimental outcomes indicated the highly precise results generated by the method compared to BHA and comparable algorithms in the study, as well as excellent robustness. Furthermore, the proposed MBHA achieved a high rate of convergence on six real datasets (collected from the UCL machine learning lab), making it suitable for DC problems. Lastly, the evaluations conclusively indicated the appropriateness of the proposed algorithm to resolve DC issues. [ABSTRACT FROM AUTHOR]

Space-based measurements, such as the Greenhouse gases Observing SATellite (GOSAT) and the TROPOspheric Monitoring Instrument (TROPOMI) aboard the Sentinel-5 Precursor satellite, provide global observations of the column-averaged CH4 concentration (XCH4). Due to the irregular observations and data gaps in the retrievals, studies on the spatial and temporal variations of regional atmospheric CH4 concentrations are limited. In this paper, we mapped XCH4 data over monsoon Asia using GOSAT and TROPOMI observations from April 2009 to December 2021 and analyzed the spatial and temporal pattern of atmospheric CH4 variations and emissions. The results show that atmospheric CH4 concentrations over monsoon Asia have long-term increases with an annual growth rate of roughly 8.4 ppb. The spatial and temporal trends of XCH4 data are significantly correlated with anthropogenic CH4 emissions from the bottom-up emission inventory of EDGAR. The spatial pattern of gridded XCH4 temporal variations in China presents a basically consistent distribution with the Heihe–Tengchong Line, which is mainly related to the difference in anthropogenic emissions in the eastern and western areas. Using the mapping of XCH4 data from 2019 to 2021, this study further revealed the response of atmospheric CH4 concentrations to anthropogenic emissions in different urban agglomerations. For the urban agglomerations, the triangle of Central China (TCC), the Chengdu–Chongqing City Group (CCG), and the Yangtze River Delta (YRD) show higher CH4 concentrations and emissions than the Beijing–Tianjin–Hebei region and nearby areas (BTH). The results reveal the spatial and temporal distribution of CH4 concentrations and quantify the differences between urban agglomerations, which will support further studies on the drivers of methane emissions. [ABSTRACT FROM AUTHOR]

With the passage of time and advancement of modern technology, new work methods and ideas are introduced and applied regularly in the field of topography and, by association, cadastre. The entirety of cadastral works rely on topographical methods for the obtaining of information necessary for the documentation of real estate such as parcels and constructions. It is within any country’s interest to not only have a national-level registry in which real estate is systematically documented but to also regularly update it. This paper aims to introduce new technological concepts of data retrieval and processing in the process of execution of cadastre and land registry works, integrating Smart technology, namely GNSS and UAV technology, into the efforts of the National Program of Cadastre and Land Book for the systematic registration of real estate. This area in which these efforts have been made is located in Ialomița county, Muntenia, Romania, namely the Territorial Administrative Unit of Albești (Albești, Bataluri and Marisilieni villages). Since the beginning of this project, the National Agency for Cadastre and Real Estate Advertising has taken care of all necessary steps (legislative and operational measures) to accelerate the systematic registration works and to contribute to the conclusion of contracts for cadastral sectors. [ABSTRACT FROM AUTHOR]

There are different ways of dividing psychology into subdisciplines. The purpose of the present paper is to explore one specific metaperspective on psychological science, seen as having three main branches: person psychology, population psychology, and mechanism psychology, linked to three different levels of research. Person-level research focuses on psychological phenomena as experienced and enacted by individual persons in their interaction with other persons and other parts of the environment, and in their development over time. Population-level research focuses on populations of individuals, frequencies of various psychological phenomena in a population, risk factors, and population-level effects of various psychological interventions. Mechanism-level research focuses on psychological functioning as explained in terms of neurophysiological mechanisms and information processes at a sub-personal level. It is argued that the failure to differentiate clearly between research questions at these three levels lead to questionable research practices. Most notably, a failure to differentiate clearly between the population level and the person level leads to problem-method mismatches in the form of researchers trying to answer questions about persons by research on populations. Also, because of a failure to differentiate between the person level and the mechanism level, explanations in terms of sub-personal mechanisms are too often seen as providing answers about what occurs at the person level, thereby failing to study persons as intentional agents in interaction with other persons and other parts of the environment. It is argued that a clear differentiation between three levels of psychological science - population, person, and mechanism - may contribute to an increased clarity in these matters and may thereby contribute to the development and maturation of psychological science. [ABSTRACT FROM AUTHOR]

The paper reports a longitudinal analysis of the topical and methodological development of Library and Information Science (LIS). Its focus is on the effects of researchers' disciplines on these developments. The study extends an earlier cross‐sectional study (Vakkari et al., Journal of the Association for Information Science and Technology, 2022a, 73, 1706–1722) by a coordinated dataset representing a content analysis of articles published in 31 scholarly LIS journals in 1995, 2005, and 2015. It is novel in its coverage of authors' disciplines, topical and methodological aspects in a coordinated dataset spanning two decades thus allowing trend analysis. The findings include a shrinking trend in the share of LIS from 67 to 36% while Computer Science, and Business and Economics increase their share from 9 and 6% to 21 and 16%, respectively. The earlier cross‐sectional study (Vakkari et al., Journal of the Association for Information Science and Technology, 2022a, 73, 1706–1722) for the year 2015 identified three topical clusters of LIS research, focusing on topical subfields, methodologies, and contributing disciplines. Correspondence analysis confirms their existence already in 1995 and traces their development through the decades. The contributing disciplines infuse their concepts, research questions, and approaches to LIS and may also subsume vital parts of LIS in their own structures of knowledge production. [ABSTRACT FROM AUTHOR]

Many scientific texts are produced in Persian and available in scientific information databases through the Web. In this paper, FarsAcademic, a test collection of Persian scientific texts, has been built to implement information retrieval models among academic search comprising 102238 documents and 61 topics. While constructing FarsAcademic, we have tried to resolve the problems specific to information retrieval (IR) and natural language processing (NLP) in Persian scientific texts. Domain experts were employed to create queries within their research area, and user relevance and topical relevance were applied to improve the precision of relevance judgment of documents. Further, to improve retrieval performance in Persian scientific texts, automated query expansion was applied using one of the relevant feedback techniques, the Local Context Analysis algorithm. The result showed that query expansion techniques outperformed other information retrieval models in the Persian scientific texts retrieval task. Eventually, FarsAcademic became the only one that has been free of charge for Iranian information retrieval scholars to implement and evaluate different information retrieval models and algorithms on Persian scientific text and academic search. [ABSTRACT FROM AUTHOR]

Objective: In 2002, the National Library of Medicine (NLM) introduced semi-automated indexing of Medline using the Medical Text Indexer (MTI). In 2021, NLM announced that it would fully automate its indexing in Medline with an improved MTI by mid-2022. This pilot study examines indexing using a sample of records in Medline from 2000, and how an early, public version of MTI's outputs compares to records created by human indexers. Methods: This pilot study examines twenty Medline records from 2000, a year before the MTI was introduced as a MeSH term recommender. We identified twenty higher- and lower-impact biomedical journals based on Journal Impact Factor (JIF) and examined the indexing of papers by feeding their PubMed records into the Interactive MTI tool. Results: In the sample, we found key differences between automated and human-indexed Medline records: MTI assigned more terms and used them more accurately for citations in the higher JIF group, and MTI tended to rank the Male check tag more highly than the Female check tag and to omit Aged check tags. Sometimes MTI chose more specific terms than human indexers but was inconsistent in applying specificity principles. Conclusion: NLM's transition to fully automated indexing of the biomedical literature could introduce or perpetuate inconsistencies and biases in Medline. Librarians and searchers should assess changes to index terms, and their impact on PubMed's mapping features for a range of topics. Future research should evaluate automated indexing as it pertains to finding clinical information effectively, and in performing systematic searches. [ABSTRACT FROM AUTHOR]

The widespread adoption of cloud infrastructures has revolutionized data storage and access. However, it has also raised concerns regarding the privacy of sensitive data. To address these concerns, encryption techniques have been widely used. However, traditional encryption schemes limit the efficient search and retrieval of encrypted data. To tackle this challenge, innovative approaches have emerged, such as the utilization of Homomorphic Encryption (HE) in Searchable Encryption (SE) schemes. This paper provides a comprehensive analysis of the advancements in HE-based privacy-preserving techniques, focusing on their application in SE. The main contributions of this work include the identification and classification of existing SE schemes that utilize HE, a comprehensive analysis of the types of HE used in SE, an examination of how HE shapes the search process structure and enables additional functionalities, and the identification of promising directions for future research in HE-based SE. The findings reveal the increasing usage of HE in SE schemes, particularly Partially Homomorphic Encryption. The popularity of this type of HE schemes, especially Paillier's cryptosystem, can be attributed to its simplicity, proven security properties, and widespread availability in open-source libraries. The analysis also highlights the prevalence of index-based SE schemes using HE, the support for ranked search and multi-keyword queries, and the need for further exploration in functionalities such as verifiability and the ability to authorize and revoke users. Future research directions include exploring the usage of other encryption schemes alongside HE, addressing omissions in functionalities like fuzzy keyword search, and leveraging recent advancements in Fully Homomorphic Encryption schemes. [ABSTRACT FROM AUTHOR]

Objective: From medicine via radio to telemedicine, personalized medical care at sea has improved significantly over the years. Currently, very little research has been conducted on telemedicine services and tools at sea. This study aims to review real-time case studies of seafarers' personalized treatment via telemedical devices published in medical journals. Methods: A literature search was conducted using three libraries such as PubMed (Medline), Cumulative Index to Nursing and Allied Health Literature (CINAHL), BioMed Central, and Google Scholar. The Medical Subject Headings (MeSH) were used for information retrieval and document selection was conducted based on the guidelines of preferred reporting items for systematic reviews and meta-analyses (PRISMA) 2020 flowchart. Selected articles were subjected to quality checks using the Newcastle–Ottawa scale (NOS). Results: The literature search produced 785 papers and documents. The selection was conducted in three stages such as selection, screening, and inclusion. After applying predefined inclusion and exclusion criteria, only three articles on real-time medical assistance with telemedical tools were identified. It is reported that medical attention is delivered to seafarers in real time thanks to advancements in telemedicine, satellite technology, and video conferencing. Conclusions: By improving the quality of medical care and reducing response times for medical emergencies at sea, lives have been saved. There are still several gaps despite these advancements. Medical assistance at sea should therefore be improved to address many of the still unsolved issues. [ABSTRACT FROM AUTHOR]

Recommendation system, or recommender system, is widely used in online Web applications like e-commerce Web sites and movie review Web sites. Sequential recommender put more emphasis upon user's short-term preference through exploiting information from its recent history. By incorporating the user short-term preference into the recommendation, the algorithm achieves a higher accuracy, which proves that a more accurate user portrait or representation boosts the performance to a great extent. Intuitionally, we seek to improve the current item representation modeling via incorporating the item trend information. Most of the recommendation models neglect the importance of the ever-changing item popularity. To this end, this paper introduces a novel sequential recommendation approach dubbed TRec. TRec learns the item trend information from the implicit user interaction history and incorporates the item trend information into the subsequent item recommendation tasks. After that, a self-attention mechanism is used for better representation. We also investigate alternative ways to model the proposed item trend representation; we evaluate two variant models which leverage the power of gated graph neural network upon the item trend representation modeling to boost the representation ability. We conduct extensive experiments with seven baseline methods on four benchmark datasets. The empirical results show that our proposed approach outperforms the state-of-the-art models as high as 18.2%. The experiment result displays the effectiveness in item trend information learning while with low computational complexity as well. Our study demonstrates the importance of item trend information in recommendation system. [ABSTRACT FROM AUTHOR]

Metaheuristic applications for information retrieval research are limited in spite of the importance of this problem domain. Ranking the retrieved documents based on their importance is a vital issue for the scientific and industrial communities. This paper proposes a novel variable neighborhood search (VNS) algorithm with adaptation based on an objective function for the learning to rank (LTR) problem. VNS is a global optimum metaheuristic algorithm that has been engaged to evolve the optimal solutions for heuristic problems based on exploring better neighbor solutions from the current one. The changes from the current to the next optimal solution are made during the perturbation stage to identify the global optimal solutions. The exploration procedure has been made through various mutation step sizes, whereas the exploitation process has been done by checking the quality of the evolved solutions using the fitness function. This research proposes a novel version of VNS based on four random probability distributions with gradient ascent. In addition to using the traditional random generator with gradient ascent for modifying the mutated genes of the neighborhood candidate solution in the following evolving iteration. This novel method in LTR is called gradient variable neighborhood (GVN). In the experiments, we utilized Microsoft Bing search (MSLR-WEB30K), Yahoo, and TREC Million Queries Competitions in 2008 and 2007 (LETOR 4) datasets. From the findings of the results, we can deduce that the GVN method outperformed recent studies on LTR methods. [ABSTRACT FROM AUTHOR]

Tagging can be regarded as the action of connecting relevant user-defined keywords to an item, indirectly improving the quality of the information retrieval services that rely on tags as data sources. Tag recommendation dramatically enhances the quality of tags by assisting users in tagging. Although there exist many studies on tag recommendation for textual content, few of them consider two characteristics in real applications, i.e., the long-tail distribution of tags and the topic-tag correlation. In this paper, we propose a Topic-Guided Tag Recommendation (TGTR) model to recommend tags by jointly incorporating dynamic neural topic. Specifically, TGTR first generates dynamic neural topic that would indicate the tags by a neural topic generator. Then, a sequence encoder is used to distill indicative features from the post. To effectively leverage the topic and alleviate the data imbalance, we design a multi-tag topical attention mechanism to get a tag-specific post representation for each tag with the help of dynamic neural topic. These three modules are seamlessly joined together via an end-to-end multi-task learning model, which is helpful for the three parts to enhance each other and balance the effects of topics and tags. Extensive experiments have been conducted on four real-world datasets and demonstrate that our model outperforms the state-of-the-art approaches by a large margin, especially on tail-tags. The code, data and hyper-parameter settings are publicly released for reproducibility. [ABSTRACT FROM AUTHOR]

On account of prevalence of mobile devices, a variety of mobile-based services have been conducted recently. In this situation, it is possible to serve the information that fits to users' requests according to the users' context using mobile devices. Therefore, it is necessary to research data mining techniques with mobile devices. Therefore, we researched information retrieval system in mobile environment. We applied semantic data mining method with context information ontology. These techniques of semantic information retrieval can provide the information according to users' context information such as location, weather, user preference etc. exactly and rapidly anytime and anyplace. In modern society, it is essential to develop mobile information retrieval system which is efficient to users. Also, the system can provide users' current location and the location information with Google map APIs in mobile devices. Therefore, in this paper, we researched semantic data mining technique with context information ontology using mobile techniques. And we compared and evaluated our proposed model and the existing model in three areas and showed our proposed model has higher performance. [ABSTRACT FROM AUTHOR]

Image reconstruction is an interesting yet challenging optimization problem that has several potential applications. The task is to reconstruct an image using a fixed number of transparent polygons. Traditional gradient-based algorithms cannot be applied to the problem since the optimization objective has no explicit expression and cannot be represented by computational graphs. Metaheuristic search algorithms are powerful optimization techniques for solving complex optimization problems, especially in the context of incomplete information or limited computational capability. In this paper, we developed a novel metaheuristic search algorithm named progressive learning hill climbing (ProHC) for image reconstruction. Instead of placing all the polygons on a blank canvas at once, ProHC starts from one polygon and gradually adds new polygons to the canvas until reaching the number limit. Furthermore, an energy-map-based initialization operator was designed to facilitate the generation of new solutions. To assess the performance of the proposed algorithm, we constructed a benchmark problem set containing four different types of images. The experimental results demonstrated that ProHC was able to produce visually pleasing reconstructions of the benchmark images. Moreover, the time consumed by ProHC was much shorter than that of the existing approach. [ABSTRACT FROM AUTHOR]

Sensor fusion is a technique that combines information from multiple sensors in order to improve the accuracy and reliability of the data being collected. In the context of teleoperation control of an anthropomorphic robotic arm, sensor fusion technology can be used to enhance the precise control of anthropomorphic robotic arms by combining data from multiple sensors, such as cameras, data gloves, force sensors, etc. By fusing and processing this sensing information, it can enable real-time control of anthropomorphic robotic arms and dexterous hands, replicating the motion of human manipulators. In this paper, we present a sensor fusion-based teleoperation control system for the anthropomorphic robotic arm and dexterous hand, which utilizes a filter to fuse data from multiple sensors in real-time. As such, the real-time perceived human arms motion posture information is analyzed and processed, and wireless communication is used to intelligently and flexibly control the anthropomorphic robotic arm and dexterous hand. Finally, the user is able to manage the anthropomorphic operation function in a stable and reliable manner. We also discussed the implementation and experimental evaluation of the system, showing that it is able to achieve improved performance and stability compared to traditional teleoperation control methods. [ABSTRACT FROM AUTHOR]

Query, expressing the user need and requirement, has an important role, in an information retrieval system, for reaching a high accuracy search. In this paper, we present an overview of the different refinement operations that the query may undergo, in the sake to enhance performance of an information retrieval system, such as: automatic query formulation through words prevision, query reformulation, query expansion, and query optimization. [ABSTRACT FROM AUTHOR]

Background: Drug-drug interaction (DDI) information retrieval (IR) is an important natural language process (NLP) task from the PubMed literature. For the first time, active learning (AL) is studied in DDI IR analysis. DDI IR analysis from PubMed abstracts faces the challenges of relatively small positive DDI samples among overwhelmingly large negative samples. Random negative sampling and positive sampling are purposely designed to improve the efficiency of AL analysis. The consistency of random negative sampling and positive sampling is shown in the paper. Results: PubMed abstracts are divided into two pools. Screened pool contains all abstracts that pass the DDI keywords query in PubMed, while unscreened pool includes all the other abstracts. At a prespecified recall rate of 0.95, DDI IR analysis precision is evaluated and compared. In screened pool IR analysis using supporting vector machine (SVM), similarity sampling plus uncertainty sampling improves the precision over uncertainty sampling, from 0.89 to 0.92 respectively. In the unscreened pool IR analysis, the integrated random negative sampling, positive sampling, and similarity sampling improve the precision over uncertainty sampling along, from 0.72 to 0.81 respectively. When we change the SVM to a deep learning method, all sampling schemes consistently improve DDI AL analysis in both screened pool and unscreened pool. Deep learning has significant improvement of precision over SVM, 0.96 vs. 0.92 in screened pool, and 0.90 vs. 0.81 in the unscreened pool, respectively. Conclusions: By integrating various sampling schemes and deep learning algorithms into AL, the DDI IR analysis from literature is significantly improved. The random negative sampling and positive sampling are highly effective methods in improving AL analysis where the positive and negative samples are extremely imbalanced. [ABSTRACT FROM AUTHOR]

Approximate string matching (ASM) has a number of applications in many disciplines, ranging from information retrieval to gene matching. Conventional solution to this problem is based on the dynamic programming-based strategy having quadratic space and time complexity. The complexity of the conventional solution makes it impractical to search queries from the huge sequences having billions of characters. Therefore, many studies have been proposed that improves on the space and time requirement of the basic solution which includes heuristic, filtration, and index-based solutions. These existing solutions obtain the better performance by compromising on the completeness of the search. In this paper, we proposed the linear space algorithm for the approximate string matching problem while retaining the time complexity of conventional solution. The proposed method works in linear space without omitting any regions in the given text; hence, it finds all the possible matches. Conventional dynamic programming solution is modified in such a way that storage of complete trace back table is avoided by keeping only running count of each edit operation in the memory. A variety of laws and facts are discovered in classical dynamic programming table in that regard. We also presented the parallel approach to the proffered algorithm to improve the running time of the algorithm. The algorithm is evaluated on the CUDA-enabled GPUs. DNA sequences of sizes between 250 and 970 MBP are used for evaluation. Moreover, experiments are also performed by using natural language text to highlight the broader applicability of the proposed algorithm. Results show the substantial superiority of the algorithm in terms of performance and scalability compared to the state-of-the-art algorithms. [ABSTRACT FROM AUTHOR]

Cloud contamination is a common issue that severely reduces the quality of optical satellite images in remote sensing fields. With the rapid development of deep learning technology, cloud contamination is expected to be addressed. In this paper, we propose Denoising Diffusion Probabilistic Model-Cloud Removal (DDPM-CR), a novel cloud removal network that can effectively remove both thin and thick clouds in optical image scenes. Our network leverages the denoising diffusion probabilistic model (DDPM) architecture to integrate both clouded optical and auxiliary SAR images as input to extract DDPM features, providing significant information for missing information retrieval. Additionally, we propose a cloud removal head adopting the DDPM features with an attention mechanism at multiple scales to remove clouds. To achieve better network performance, we propose a cloud-oriented loss that considers both high- and low-frequency image information as well as cloud regions in the training procedure. Our ablation and comparative experiments demonstrate that the DDPM-CR network outperforms other methods under various cloud conditions, achieving better visual effects and accuracy metrics (MAE = 0.0229, RMSE = 0.0268, PSNR = 31.7712, and SSIM = 0.9033). These results suggest that the DDPM-CR network is a promising solution for retrieving missing information in either thin or thick cloud-covered regions, especially when using auxiliary information such as SAR data. [ABSTRACT FROM AUTHOR]

Main path analysis is a popular method for extracting the scientific backbone from the citation network of a research domain. Existing approaches ignored the semantic relationships between the citing and cited publications, resulting in several adverse issues, in terms of coherence of main paths and coverage of significant studies. This paper advocated the semantic main path network analysis approach to alleviate these issues based on citation function analysis. A wide variety of SciBERT‐based deep learning models were designed for identifying citation functions. Semantic citation networks were built by either including important citations, for example, extension, motivation, usage and similarity, or excluding incidental citations like background and future work. Semantic main path network was built by merging the top‐K main paths extracted from various time slices of semantic citation network. In addition, a three‐way framework was proposed for the quantitative evaluation of main path analysis results. Both qualitative and quantitative analysis on three research areas of computational linguistics demonstrated that, compared to semantics‐agnostic counterparts, different types of semantic main path networks provide complementary views of scientific knowledge flows. Combining them together, we obtained a more precise and comprehensive picture of domain evolution and uncover more coherent development pathways between scientific ideas. [ABSTRACT FROM AUTHOR]

This research proposes a new approach to improve information retrieval systems based on a multinomial naive Bayes classifier (MNBC), Bayesian networks (BNs), and a multi-terminology which includes MeSH thesaurus (Medical Subject Headings) and SNOMED CT (Systematized Nomenclature of Medicine of Clinical Terms). Our approach, which is entitled improving semantic information retrieval (IMSIR), extracts and disambiguates concepts and retrieves documents. Relevant concepts of ambiguous terms were selected using probability measures and biomedical terminologies. Concepts are also extracted using an MNBC. The UMLS (Unified Medical Language System) thesaurus was then used to filter and rank concepts. Finally, we exploited a Bayesian network to match documents and queries using a conceptual representation. Our main contribution in this paper is to combine a supervised method (MNBC) and an unsupervised method (BN) to extract concepts from documents and queries. We also propose filtering the extracted concepts in order to keep relevant ones. Experiments of IMSIR using the two corpora, the OHSUMED corpus and the Clinical Trial (CT) corpus, were interesting because their results outperformed those of the baseline: the P@50 improvement rate was +36.5% over the baseline when the CT corpus was used. [ABSTRACT FROM AUTHOR]

Quantifying the dissimilarity of two texts is an important aspect of a number of natural language processing tasks, including semantic information retrieval, topic classification, and document clustering. In this paper, we compared the properties and performance of different dissimilarity measures D using three different representations of texts—vocabularies, word frequency distributions, and vector embeddings—and three simple tasks—clustering texts by author, subject, and time period. Using the Project Gutenberg database, we found that the generalised Jensen–Shannon divergence applied to word frequencies performed strongly across all tasks, that D's based on vector embedding representations led to stronger performance for smaller texts, and that the optimal choice of approach was ultimately task-dependent. We also investigated, both analytically and numerically, the behaviour of the different D's when the two texts varied in length by a factor h. We demonstrated that the (natural) estimator of the Jaccard distance between vocabularies was inconsistent and computed explicitly the h-dependency of the bias of the estimator of the generalised Jensen–Shannon divergence applied to word frequencies. We also found numerically that the Jensen–Shannon divergence and embedding-based approaches were robust to changes in h, while the Jaccard distance was not. [ABSTRACT FROM AUTHOR]

In this paper, we present a new perspective of single server private information retrieval (PIR) schemes by using the notion of linear error-correcting codes. Many of the known single server schemes are based on taking linear combinations between database elements and the query elements. Using the theory of linear codes, we develop a generic framework that formalizes all such PIR schemes. This generic framework provides an appropriate setup to analyze the security of such PIR schemes. In fact, we describe some known PIR schemes with respect to this code-based framework, and present the weaknesses of the broken PIR schemes in a unified point of view. [ABSTRACT FROM AUTHOR]

The current practice of users searching for different types of geo-resources in a geographic area and wishing to identify the most convenient routes for visiting the most relevant ones, requires the iterative formulation of several queries: first to identify the more interesting resources and then to select the best route to visit them. In order to simplify this process, in this paper a novel functionality for a geographic information retrieval (GIR) system is proposed, which retrieves and ranks several routes for visiting a number of relevant georeferenced resources as a result of a single query, named flexible trip-planning query. An original retrieval model is defined to identify the relevant resources and to rank the most convenient routes by taking into account personal user preferences. To this end, a graph-based algorithm is defined, exploiting prioritized aggregation to optimize the routes' identification and ranking. The proposed algorithm is applied in the proof-of-concept of a Smart cOmmunity-based Geographic infoRmation rEtrievAl SysTem (SO-GREAT) designed to strengthen local communities: it collects and manages open data from regional authorities describing categories of authoritative territorial resources and services, such as schools, hospitals, etc., and from volunteered geographic services (VGSs) created by citizens to offer services in their neighbourhood. [ABSTRACT FROM AUTHOR]

Cloud computing has emerged as a promising platform that grants users direct yet shared access to computing resources and services without worrying about the internal complex infrastructure. However, secure data storage and data retrieval is the basic characteristics. Therefore, this paper proposes a novel double keys adapted elliptic curve cryptography (DKECC) and log normalized Gaussian sigmoid adaptive neuro‐fuzzy interference system (LGS‐ANFIS) based secure resource allocation system in decentralized cloud storage. Initially, the input data undergoes data fragmentation. After that, encryption is carried out using DKECC algorithm. Next, hash code generation using Pearson hash function is done. Then, resource availability is estimated via logistic sine chaotic mapping indulged rock hyraxes swarm optimization technique. Afterwards, data is checked for deduplication. Finally, resource allocation through LGS‐ANFIS takes place. The experimental outcomes demonstrated better results compared to baseline techniques. The modelling process showed that the suggested safe resource allocation model achieves the total security level of 96.27% while also having shorter reaction times (3018 ms), greater throughputs (1258), reduced load balancing (0.355874), and reduced latency (4372 ms). [ABSTRACT FROM AUTHOR]

Controllable synthesis of high‐performance materials with low‐cost is critical for the development of functional devices. Herein, a series of sequence‐controlled low‐dispersity oligomers with acid–base chromotropic capability via simple copolymerization between N‐substituted maleimides (NMI) and methyldiallylamine (MDAA) are synthesized. The structure and molecular weight of the oligomers are characterized. Owing to the presence of strong electrophilic carbonyl oxygen and imine nitrogen, a rapid‐responsive color switching system is achieved. This change is attributed to the acid/base‐triggered isomerization between enolate state and the enol or keto tautomer via intramolecular proton transfer. More importantly, the color of P(MDAA/NMI) is regulated by the variation of the substituent group of the N‐substituted maleimide. A new type of rewritable paper based on the designed N‐substituted maleimide oligomers is fabricated by a simple spin‐coating process, on which images with high resolution can be acid‐printed and base‐erased for over ten cycles. The writing and erasure times can be as short as 10 s and the legible time can be more than 90 days under ambient conditions. The as‐formed rewritable paper with excellent rewriting performances is low‐cost and easy for large‐scale production and may find more advanced potential applications in memory devices, rewritable labels, an sensors. [ABSTRACT FROM AUTHOR]

Information retrieval is an important field that aims to provide a relevant document to a user information need, expressed through a query. Arabic is a challenging language that gained much attention recently in the information retrieval domain. To overcome the problems related to its complexity, many studies and techniques have been presented, most of them were conducted to solve the stemming problem. This paper presents an overview of the Arabic information retrieval process, including various text processing techniques, ranking approaches, evaluation measures, and some important information retrieval models. The paper finally presents some recent related studies and approaches in different Arabic information retrieval fields. [ABSTRACT FROM AUTHOR]

The introduction of electronic medical records has created vast opportunities in relation to data storage, visibility and extraction. In Allied Health the collection, storage, display and reporting of service statistics is a key opportunity to utilise the capabilities of the electronic medical record to reduce clinician time completing data entry, improve accuracy and visibility of available data and maximise opportunities to view and utilise service statistic information in clinical and operational decision making. This case study describes service statistic capture and extraction for a speech pathology department, pre- and post- the introduction of a digital dashboard. A new Allied Health digital dashboard was created via clinicians and informaticians working collaboratively to define service delivery elements for data extraction and design dashboard functionality. Descriptive comparison of data capture pre- and post- dashboard implementation was undertaken. The integration of service statistic information into a digital dashboard was found to support service statistic reporting, improve ease of access, and provide greater visibility and timeliness of service information. What is known about the topic? Service statistic data capturing and reporting systems used prior to the digital medical record required additional clinician entry processes, and lacked visibility, transparency and timeliness of reporting. What does this paper add? This paper describes a case study of the use of an electronic dashboard linked to the Electronic Medical Record to capture and report service statistics. What are the implications for practitioners? A real-time service statistic dashboard can remove a significant burden of manual reporting for staff, and help improve the transparency, visibility and timeliness of data availability for staff and managers. [ABSTRACT FROM AUTHOR]

Retrieving mathematical expressions from scientific documents is a challenging task as mathematical expressions or formulae are quite different from the traditional text. Mathematical expressions are highly symbolic and complex. Moreover, the structure of a mathematical formula conveys a semantic meaning which cannot be overlooked. This paper proposes a scientific document retrieval system based on mathematical formula query. The paper explores the concept of Structure Encoded String (SES), which has been employed for mathematical expressions to capture the relations among the formula structures. A pattern based trie indexing scheme has been proposed for faster retrieval. The Jaro-Winkler Similarity has been adopted for matching and ranking. Experiments are conducted, results are reported using standard evaluation measures and compared with similar existing systems. [ABSTRACT FROM AUTHOR]

Modeling information seeking behavior was started in the early 1980s pioneered by Wilson. More than 70 models in the last four decades on information seeking behavior have emerged. The models delineate the concepts from cognate subjects such as psychology and sociology. The authors made an analytical study of these models and identified many concepts of library and information science (LIS); from information processing and retrieval, reference service case studies and the evaluation experiments of information retrieval systems intrinsically are hidden in these models that have not been explicitly expounded as part of information seeking traits. The Chain Indexing devised by Ranganathan has an inclusive concept into information seeking with the phrase "Sought Link" to select the relevant subject heading(s) derived from the document(s) for indexing and to assign as the sought term(s) in the subject catalogue. Lancaster in the evaluation of MEDLARS identified phrases; serendipity and novelty ratio in response to users queries to the system. The paper after an in depth study of these ideas and with an analytical review of the models implies many of the classical concepts from LIS are implicit-in information seeking patterns of users. The paper conjures up to investigate them in the models of information seeking behavior as pragmatic rather only on user perceptions. [ABSTRACT FROM AUTHOR]

In order to improve the effect of personnel archives information management under the background of Industry 4.0, this paper conducts in-depth research on retrieval technology. Aiming at the shortcomings and deficiencies of the existing sorting methods, this paper introduces the basic principle of information retrieval, the retrieval process, and retrieval model and proposes a relevance ranking algorithm based on the user vector calculation method and the record vector calculation method. The algorithm solves the query structure sorting problem of information retrieval, optimizes the retrieval process, and improves the efficiency of information acquisition. Under the guidance of the concept of Industry 4.0, this paper constructs the digital management model of personnel archives information. The experimental results show that the digital management model of personnel archives proposed in this paper has certain effects. [ABSTRACT FROM AUTHOR]