Search Results (37)

SimRank is a widely used metric for evaluating vertex similarity based on graph topology, with diverse applications such as large-scale graph mining and natural language processing. The objective of the single-source and top-k SimRank query problem is to retrieve the kvertices with the largest SimRank to the source vertex. However, existing algorithms suffer from inefficiency as they require computing SimRank for all vertices to retrieve the top-k results. To address this issue, we propose an algorithm named HitSimthat utilizes a branch and bound strategy for the single-source and top-k query. HitSim initially partitions vertices into distinct sets based on their shortest-meeting lengths to the source vertex. Subsequently, it computes an upper bound of SimRank for each set. If the upper bound of a set is no larger than the minimum value of the current top-k results, HitSim efficiently batch-prunes the unpromising vertices within the set. However, in scenarios where the graph becomes dense, certain sets with large upper bounds may contain numerous vertices with small SimRank, leading to redundant overhead when processing these vertices. To address this issue, we propose an optimized algorithm named HitSim-OPT that computes the upper bound of SimRank for each vertex instead of each set, resulting in a fine-grained and efficient pruning process. The experimental results conducted on six real-world datasets demonstrate the performance of our algorithms in efficiently addressing the single-source and top-k query problem. Full article

The steady increase in droughts worldwide has compelled many researchers to focus on water allocation. Multi-objective decision support for irrigation systems is a popular topic due to its relevance to the national economy and food supply. However, the majority of researchers have relied on conventional top-k designs for their decision support systems despite their limitations with regard to multi-objective systems. Thus, we propose applying a skyline query to the problem. As the input and output formats of skyline queries differ significantly from those of existing systems, we developed a new genetic algorithm and objective ranking. Qualitative and quantitative experiments using real-world data from Taiwan’s largest irrigated region demonstrate the effectiveness of the proposed approach. Full article

Query optimization is one of the key factors affecting the performance of database systems that aim to enact the query execution plan with minimum cost. Particularly in distributed database systems, due to the multiple copies of the data that are stored in different data nodes, resulting in the dramatic increase in the feasible query execution plans for a query statement. Because of the increasing volume of stored data, the cluster size of distributed databases also increases, resulting in poor performance of current query optimization algorithms. In this case, a dynamic perturbation-based artificial bee colony algorithm is proposed to solve the query optimization problem in distributed database systems. The improved artificial bee colony algorithm improves the global search capability by combining the selection, crossover, and mutation operators of the genetic algorithm to overcome the problem of falling into the local optimal solution easily. At the same time, the dynamic perturbation factor is introduced so that the algorithm parameters can be dynamically varied along with the process of iteration as well as the convergence degree of the whole population to improve the convergence efficiency of the algorithm. Finally, comparative experiments conducted to assess the average execution cost of Top-k query plans generated by the algorithms and the convergence speed of algorithms under the conditions of query statements in six different dimension sets. The results demonstrate that the Top-k query plans generated by the proposed method have a lower execution cost and a faster convergence speed, which can effectively improve the query efficiency. However, this method requires more execution time. Full article

Top-k graph similarity search on probabilistic graphs is widely used in various scenarios, such as symptom–disease diagnostics, community discovery, visual pattern recognition, and communication networks. The state-of-the-art method uses the chi-square statistics to speed up the process. The effectiveness of the chi-square statistics solution depends on the effectiveness of the sample observation and expectation. The existing method assumes that the labels in the data graphs are subject to uniform distribution and calculate the chi-square value based on this. In fact, however, the actual distribution of the labels does not meet the requirement of uniform distribution, resulting in a low quality of the returned results. To solve this problem, we propose a top-k similar subgraph search algorithm ChiSSA based on chi-square statistics. We propose two ways to calculate the expectation vector according to the actual distribution of labels in the graph, including the local expectation calculation method based on the vertex neighbors and the global expectation calculation method based on the label distribution of the whole graph. Furthermore, we propose two optimization strategies to improve the accuracy of query results and the efficiency of our algorithm. We conduct rich experiments on real datasets. The experimental results on real datasets show that our algorithm improves the quality and accuracy by an average of 1.66× and 1.68× in terms of time overhead, it improves by an average of 3.41×. Full article

Alpine Merino Sheep is a novel breed reared from Australian Merino Sheep as the father and Gansu Alpine Fine-Wool Sheep as the mother, living all year in cold and arid alpine areas with exceptional wool quality and meat performance. Body weight is an important economic trait of the Alpine Merino Sheep, but there is limited research on identifying the genes associated with live weight in the 14th month for improving the accuracy of the genomic prediction of this trait. Therefore, this study’s sample comprised 1310 Alpine Merino Sheep ewes, and the Fine Wool Sheep 50K Panel was used for genome-wide association study (GWAS) analysis to identify candidate genes. Moreover, the trial population (1310 ewes) in this study was randomly divided into two groups. One group was used as the population for GWAS analysis and screened for the most significant top 5%, top 10%, top 15%, and top 20% SNPs to obtain prior marker information. The other group was used to estimate the genetic parameters based on the weight assigned by heritability combined with different prior marker information. The aim of this study was to compare the accuracy of genomic breeding value estimation when combined with prior marker information from GWAS analysis with the optimal linear unbiased prediction method for genome selection (GBLUP) for the breeding value of target traits. Finally, the accuracy was evaluated using the five-fold cross-validation method. This research provides theoretical and technical support to improve the accuracy of sheep genome selection and better guide breeding. The results demonstrated that eight candidate genes were associated with GWAS analysis, and the gene function query and literature search results suggested that FAM184B, NCAPG, MACF1, ANKRD44, DCAF16, FUK, LCORL, and SYN3 were candidate genes affecting live weight in the 14th month (WT), which regulated the growth of muscle and bone in sheep. In genome selection analysis, the heritability of GBLUP to calculate the WT was 0.335–0.374, the accuracy after five-fold cross-verification was 0.154–0.190, and after assigning different weights to the top 5%, top 10%, top 15%, and top 20% of the GWAS results in accordance with previous information to construct the G matrix, the accuracy of the WT in the GBLUP model was improved by 2.59–7.79%. Full article

The Domain Name System (DNS) is a fundamental component of the internet, responsible for resolving domain names into IP addresses. DNS servers are typically categorized into four types: recursive resolvers, root name servers, Top-Level Domain (TLD) name servers, and authoritative name servers. The latter three types of servers store actual records, while recursive resolvers do not store any real data and are only responsible for querying the other three types of servers and responding to clients. Recursive resolvers typically maintain a caching system to speed up response times, but these caching systems have the drawbacks of a low real-time performance, a poor accuracy, and many security and privacy issues. In this paper, we propose a caching system based on a consortium blockchain, namely DNS-BC, which uses the synchronization mechanism of the consortium blockchain to achieve a high real-time performance, uses the immutable mechanism of the consortium blockchain and our designed credibility management system to achieve up to a 100% accuracy, and has been combined with encrypted transmission protocols to solve common security and privacy issues. At the same time, this caching system can greatly reduce the traffic that name servers need to handle, thereby protecting them from Denial-of-Service (DoS) attacks. To further accelerate the data transmission speed, we have designed a new encrypted DNS protocol called DNS over KCP (DoK). The DoK protocol is based on the KCP protocol, which is a fast and reliable transmission protocol, and its latency can reach one-third of that of TCP when the network environment deteriorates. In our experiments, the transmission time of this protocol is about a quarter of that of the widely used encrypted protocols DNS over TLS (DoT) and DNS over HTTPS (DoH). Full article

Babesia infection is a tick-borne protozoan disease associated with significant veterinary, economic, and medical importance. This infection affects many hosts, ranging from wild to domestic animals and including man. All vertebrates serve as potential carriers due to the huge diversity of the species. Babesiosis has been associated with severe economic loss in livestock production, especially in cattle farming, and is also a major public health concern in man, which could be fatal. The infection is usually opportunistic, ranging from asymptomatic to symptomatic, usually in immunocompromised subjects or under conditions of stressful management. This study was designed to uncover trends in relation to publication growth and further explore research output regarding babesiosis from data indexed in the WoS. The WoS is the only platform used to map publications on Babesia infection. The search term “babesiosis” or “Babesia infection” was used to extract articles published across the study period from 1982 to 2022. The inclusion criteria were restricted to only articles for the analysis. The results from the search query showed that a total of 3763 articles were published during the study period with an average of 91.70 ± 43.87 articles annually and an average total citation (n = 1874.8). An annual growth rate of 2.5% was recorded during the study period. The year 2021 had the highest number of published articles (n = 193, 5.1%) and citations (n = 7039). The analysis of the most relevant keywords and titles showed that infection (n = 606, 16.1%), babesiosis (n = 444, 11.7%), and Babesia (n = 1302, 16%) were the most relevant keyword plus (ID), author keyword (DE), and title, respectively. The common conceptual framework analysis through K-means clustering showed two clusters comprising 4 and 41 elements, respectively. The United States of America is the top-performing country in terms of article production (n = 707, 20.8%) and the leading funder for babesiosis research, with two of its agencies ranked at the top. These are the Department of Health and Human Services (n = 254, 6.7%) and the National Institute of Health (n= 238,6.3%). Igarashi I. is the top-performing author (n = 231, 6.1%), while Veterinary Parasitology is ranked the top journal (n = 393, 10.4%) in terms of babesiosis publications. Overall, an increase in publications was observed in the study period, with significant output from developed nations. Full article

This paper presents a novel approach for accelerating the top-k heavy hitters query in data streams using Field Programmable Gate Arrays (FPGAs). Current hardware acceleration approaches rely on the direct and strict mapping of software algorithms into hardware, limiting their performance and practicality due to the lack of hardware optimizations at an algorithmic level. The presented approach optimizes a well-known software algorithm by carefully relaxing some of its requirements to allow for the design of a practical and scalable hardware accelerator that outperforms current state-of-the-art accelerators while maintaining near-perfect accuracy. This paper details the design and implementation of an optimized FPGA accelerator specifically tailored for computing the top-k heavy hitters query in data streams. The presented accelerator is entirely specified at the C language level and is easily reproducible with High-Level Synthesis (HLS) tools. Implementation on Intel Arria 10 and Stratix 10 FPGAs using Intel HLS compiler showed promising results—outperforming prior state-of-the-art accelerators in terms of throughput and features. Full article

The newly FDA-approved drug, Axitinib, is an effective therapy against RTKs, but it possesses severe adverse effects like hypertension, stomatitis, and dose-dependent toxicity. In order to ameliorate Axitinib’s downsides, the current study is expedited to search for energetically stable and optimized pharmacophore features of 14 curcumin (1,7-bis(4-hydroxy-3-methoxyphenyl)hepta-1,6-diene-3,5-dione) derivatives. The rationale behind the selection of curcumin derivatives is their reported anti-angiogenic and anti-cancer properties. Furthermore, they possessed a low molecular weight and a low toxicity profile. In the current investigation, the pharmacophore model-based drug design, facilitates the filtering of curcumin derivatives as VEGFR2 interfacial inhibitors. Initially, the Axitinib scaffold was used to build a pharmacophore query model against which curcumin derivatives were screened. Then, top hits from pharmacophore virtual screening were subjected to in-depth computational studies such as molecular docking, density functional theory (DFT) studies, molecular dynamics (MD) simulations, and ADMET property prediction. The findings of the current investigation revealed the substantial chemical reactivity of the compounds. Specifically, compounds S8, S11, and S14 produced potential molecular interactions against all four selected protein kinases. Docking scores of −41.48 and −29.88 kJ/mol for compounds S8 against VEGFR1 and VEGFR3, respectively, were excellent. Whereas compounds S11 and S14 demonstrated the highest inhibitory potential against ERBB and VEGFR2, with docking scores of −37.92 and −38.5 kJ/mol against ERBB and −41.2 and −46.5 kJ/mol against VEGFR-2, respectively. The results of the molecular docking studies were further correlated with the molecular dynamics simulation studies. Moreover, HYDE energy was calculated through SeeSAR analysis, and the safety profile of the compounds was predicted through ADME studies. Full article

As multimedia technology has advanced in recent years, the use of enormous image libraries has dramatically expanded. In applications for image processing, image retrieval has emerged as a crucial technique. Content-based face image retrieval is a well-established technology in many real-world applications, such as social media, where dependable retrieval capabilities are required to enable quick search among large numbers of images. Humans frequently use faces to recognize and identify individuals. Face recognition from official or personal photos is becoming increasingly popular as it can aid crime detectives in identifying victims and criminals. Furthermore, a large number of images requires a large amount of storage, and the process of image comparison and matching, consequently, takes longer. Hence, the query speed and low storage consumption of hash-based image retrieval techniques have garnered a considerable amount of interest. The main contribution of this work is to try to overcome the challenge of performance improvement in image retrieval by using locality-sensitive hashing (LSH) for retrieving top-matched face images from large-scale databases. We use face soft biometrics as a search input and propose an effective LSH-based method to replace standard face soft biometrics with their corresponding hash codes for searching a large-scale face database and retrieving the top-k of the matching face images with higher accuracy in less time. The experimental results, using the Labeled Faces in the Wild (LFW) database together with the corresponding database of attributes (LFW-attributes), show that our proposed method using LSH face soft biometrics (Soft BioHash) improves the performance of face image database search and retrieval and also outperforms the LSH hard face biometrics method (Hard BioHash). Full article

Urban rail transit is an essential part of the urban public transportation system. The reasonable spatial data visualization of urban rail transit stations can provide a more intuitive way for the majority of travelers to arrange travel plans and find destinations. The map service of rail transit stations generated by data visualization has gradually become indispensable information guidance in the rail transit system. The existing map service icons block each other when the scale changes, and new stations cannot be displayed dynamically when users drag the map. This paper uses filtering and sorting methods to dynamically query and visualize the relatively more important transportation stations within the users’ visible range, so as to solve the above problems and provide people with better transportation services. Our method introduces three constraints: spatial diversity, time-sharing passenger flow analysis and whether it is a transit station, and calculates the scores of constraint relationships of feature objects to evaluate stations. On the basis of the skyline query, the scores of feature objects are combined and sorted to obtain an ordered object set of the most interesting k points(top-k POIs), and the rail transit stations are dynamically retrieved and visualized. Before sorting POIs, we filter out POIs that need to be fitted, so that only the k most representative POIs in the currently visible range are displayed. When the map scale changes, the displayed POIs are updated. Finally, through the statistics of efficiency calculation of this method under different scales and centers, combined with users’ evaluations, it was proved that our method could better display critical information and improve user experience. Full article

The development of robotic applications necessitates the availability of useful, adaptable, and accessible programming frameworks. Robotic, IoT, and sensor-based systems open up new possibilities for the development of innovative applications, taking advantage of existing and new technologies. Despite much progress, the development of these applications remains a complex, time-consuming, and demanding activity. Development of these applications requires wide utilization of software components. In this paper, we propose a platform that efficiently searches and recommends code components for reuse. To locate and rank the source code snippets, our approach uses a machine learning approach to train the schema. Our platform uses trained schema to rank code snippets in the top k results. This platform facilitates the process of reuse by recommending suitable components for a given query. The platform provides a user-friendly interface where developers can enter queries (specifications) for code search. The evaluation shows that our platform effectively ranks the source code snippets and outperforms existing baselines. A survey is also conducted to affirm the viability of the proposed methodology. Full article

We study a new type of path inference query against urban-scale video databases. Given a vehicle image query, our goal is to recover its historical trajectory from the footprints captured by surveillance cameras deployed across the road network. The problem is challenging because visual matching inherently suffers from object occlusion, low camera resolution, varying illumination conditions, and viewing angles. Furthermore, with limited computation resources, only a fraction of video frames can be ingested and indexed, causing severe data sparsity issues for visual matching. To support efficient and accurate trajectory recovery, we develop a select-and-refine framework in a heterogeneous hardware environment with both CPUs and GPUs. We construct a proximity graph from the top-k visually similar frames and propose holistic scoring functions based on visual and spatial-temporal coherence. To avoid enumerating all the paths, we also propose a coarse-grained scoring function with monotonic property to reduce search space. Finally, the derived path is refined by examining raw video frames to fill the missing cameras. For performance evaluation, we construct two largest-scale video databases generated from cameras deployed upon real road networks. Experimental results validate the efficiency and accuracy of our proposed trajectory recovery framework. Full article

Knowledge base question answering (KBQA) aims to provide answers to natural language questions from information in the knowledge base. Although many methods perform well when dealing with simple questions, there are still two challenges for complex questions: huge search space and information missing from the query graphs’ structure. To solve these problems, we propose a novel KBQA method based on a graph convolutional network and optimized search space. When generating the query graph, we rank the query graphs by both their semantic and structural similarities with the question. Then, we just use the top k for the next step. In this process, we specifically extract the structure information of the query graphs by a graph convolutional network while extracting semantic information by a pre-trained model. Thus, we can enhance the method’s ability to understand complex questions. We also introduce a constraint function to optimize the search space. Furthermore, we use the beam search algorithm to reduce the search space further. Experiments on the WebQuestionsSP dataset demonstrate that our method outperforms some baseline methods, showing that the structural information of the query graph has a significant impact on the KBQA task. Full article

Recently, studies on secure database outsourcing have been highlighted for the cloud computing environment. A few secure Top-k query processing algorithms have been proposed in the encrypted database. However, the previous algorithms can support either security or efficiency. Therefore, we propose a new Top-k query processing algorithm using a homomorphic cryptosystem, which can support both security and efficiency. For security, we propose new secure and efficient protocols based on arithmetic operations. To obtain a high level of efficiency, we also propose a parallel Top-k query processing algorithm using an encrypted random value pool. Through our performance analysis, the proposed Top-k algorithms present about 1.5∼7.1 times better performance with regard to a query processing time, compared with the existing algorithms. Full article