Search

In this paper, we develop a new algorithm for pattern synthesis of large linear arrays. In our algorithm, the large linear array is divided into multiple disjoint nonuniformly-spaced subarrays and is only weighted at subarray level. Unlike the existing methods, the subarray synthesis is implemented in two stages. Firstly, the optimization of subarray partition and subarray weights are performed by using the K-means approach. Based on the determined subarray partition and subarray weights, the subarray element positions are further optimized by the iterative convex programming method. Compared with the state-of-the-art methods, the proposed algorithm can synthesize lower peak sidelobe level and yield smaller pattern matching error. Numerical results demonstrate the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Blockchain received a vast amount of attention in recent years and is still growing. The second generation of blockchain, such as Ethereum, allows execution of almost any program in EVM, making it a global protocol for distributed applications. The code deployment and each operation performed in EVM cost the network fee called gas, whose price varies and can be significant. That is why code optimization and well-chosen algorithms are crucial in programming on the blockchain. This paper evaluates the gas usage of several exact pattern matching algorithms on the EVM. We also propose an efficient implementation of the algorithms in the Solidity/YUL language. We evaluate the gas fees of all the algorithms for different parameters (such as pattern length, alphabet size, and text size). We show a significant gas fee and execution time reduction with up to 22-fold lower gas usage and 55-fold speed-up compared to StringUtils (a popular Solidity string library). [ABSTRACT FROM AUTHOR]

The primary objective of a depalletizing system is to automate the process of detecting and locating specific variable-shaped objects on a pallet, allowing a robotic system to accurately unstack them. Although many solutions exist for the problem in industrial and manufacturing settings, the application to small-scale scenarios such as retail vending machines and small warehouses has not received much attention so far. This paper presents a comparative analysis of four different computer vision algorithms for the depalletizing task, implemented on a Raspberry Pi 4, a very popular single-board computer with low computer power suitable for the IoT and edge computing. The algorithms evaluated include the following: pattern matching, scale-invariant feature transform, Oriented FAST and Rotated BRIEF, and Haar cascade classifier. Each technique is described and their implementations are outlined. Their evaluation is performed on the task of box detection and localization in the test images to assess their suitability in a depalletizing system. The performance of the algorithms is given in terms of accuracy, robustness to variability, computational speed, detection sensitivity, and resource consumption. The results reveal the strengths and limitations of each algorithm, providing valuable insights for selecting the most appropriate technique based on the specific requirements of a depalletizing system. [ABSTRACT FROM AUTHOR]

The recently proposed DEtection TRansformer (DETR) has established a fully end-to-end paradigm for object detection. However, DETR suffers from slow training convergence, which hinders its applicability to various detection tasks. We observe that DETR's slow convergence is largely attributed to the difficulty in matching object queries to relevant regions due to the unaligned semantics between object queries and encoded image features. With this observation, we design Semantic-Aligned-Matching DETR++ (SAM-DETR++) to accelerate DETR's convergence and improve detection performance. The core of SAM-DETR++ is a plug-and-play module that projects object queries and encoded image features into the same feature embedding space, where each object query can be easily matched to relevant regions with similar semantics. Besides, SAM-DETR++ searches for multiple representative keypoints and exploits their features for semantic-aligned matching with enhanced representation capacity. Furthermore, SAM-DETR++ can effectively fuse multi-scale features in a coarse-to-fine manner on the basis of the designed semantic-aligned matching. Extensive experiments show that the proposed SAM-DETR++ achieves superior convergence speed and competitive detection accuracy. Additionally, as a plug-and-play method, SAM-DETR++ can complement existing DETR convergence solutions with even better performance, achieving 44.8% AP with merely 12 training epochs and 49.1% AP with 50 training epochs on COCO val 2017 with ResNet-50. Codes are available at https://github.com/ZhangGongjie/SAM-DETR. [ABSTRACT FROM AUTHOR]

The instanceof pattern matching can improve the code quality and readability by removing the redundant typecasting and simplifying the design in different scenarios. However, existing works do not provide sufficient support for refactoring instanceof pattern matching. This paper first identifies several cases that cannot be well handled by existing IDEs. Based on these observations, we propose a novel approach called ReInstancer to refactor instanceof pattern matching automatically. ReInstancer conducts program analysis for multi‐branch statements to obtain pattern variables. After analyzing these patterns, the multi‐branch statements are optimized and finally refactored into switch statements or expressions. ReInstancer is evaluated by 20 real‐world projects with more than 7,700 instanceof pattern matching. The experimental results demonstrate that a total of 3,558 instanceof expressions and 228 multi‐branch statements are refactored within 10.8 s on average for each project. ReInstancer improves the code quality by reducing redundant typecasting, demonstrating its effectiveness. [ABSTRACT FROM AUTHOR]

Sentiment analysis is one of the core tasks in natural language processing, and its main goal is to identify and classify the sentiment tendencies contained in texts. Traditional sentiment analysis methods and shallow models often fail to capture the rich semantic information and contextual relationships in text, while increasing the network depth is prone to problems such as network degradation, which has some limitations in terms of accuracy and performance. Based on this foundation, a sentiment analysis model called BERT-Invos (Bidirectional Encoder Representations from Transformers (BERT)-based stacked involutions) is introduced. The model utilizes the dynamic pre-training language model BERT to encode text, enabling rich semantic features and contextual understanding. In addition, the model employs stacked involutions with varying dimensions to extract features and perceive local information, gradually learning different scales and hierarchical representations of the input text. Furthermore, the proposed method incorporates nonlinear activation functions such as ReLU6 and H-Swish to enhance the model's expression capability and performance, ultimately delivering classification results. In the experiment, a financial news sentiment dataset was utilized for model validation and comparison against other models. The results revealed that the model achieved an accuracy of 96.34% in sentiment analysis tasks, with precision, recall, and F1 score reaching 96.37%, 96.34%, and 96.34%, respectively. Additionally, the loss value could be minimized to 0.07 with stable convergence, thereby enhancing the accuracy of sentiment classification and reducing loss rates. This improvement facilitates better capturing of local patterns in text and addresses the issue of degradation in deep neural networks. Regarding the deep architecture of the proposed model, future work will focus on further exploring optimization techniques for model compression and deployment. [ABSTRACT FROM AUTHOR]

• An innovative star identification algorithm is proposed for lost-in-space scenarios. • A unique approach is utilized, which involves singular values in the form of Gaussian mixture models to generate distinctive features. • The matching process involving candidate filtering, similarity comparison, and validation is proposed to enhance identification capabilities. This paper presents an innovative star identification algorithm specifically designed for lost-in-space scenarios in satellite missions. The algorithm introduces a unique approach by utilizing singular values to generate Gaussian mixture models as distinctive features for star identification. By employing a matching process involving candidate filtering, similarity comparison, and validation, the algorithm demonstrates remarkable performance in precisely identifying stars while minimizing false identifications even in demanding environmental conditions. Extensive simulations are conducted to evaluate the algorithm's effectiveness under various scenarios with positional error and the presence of false stars. The algorithm exhibits reliable and consistent performance, making it highly suitable for dynamic scenarios and contributing to the reduction of hardware burden in star sensor systems. Furthermore, the proposed algorithm offers prominent performance across varying field of view sizes, thereby enhancing its practicality and usability in a wide range of missions. [ABSTRACT FROM AUTHOR]

Information-Centric Networking (ICN) is the emerging next-generation internet paradigm. The Low Earth Orbit (LEO) satellite mega-constellation based on ICN can achieve seamless global coverage and provide excellent support for Internet of Things (IoT) services. Additionally, in-network caching, typically characteristic of ICN, plays a paramount role in network performance. Therefore, the in-network caching policy is one of the hotspot problems. Especially, compared to caching traditional internet content, in-networking caching IoT content is more challenging, since the IoT content lifetime is small and transient. In this paper, firstly, the framework of the LEO satellite mega-constellation Information-Centric Networking for IoT (LEO-SMC-ICN-IoT) is proposed. Then, introducing the concept of "viscosity", the proposed Caching Algorithm based on the Random Forest (CARF) policy of satellite nodes combines both content popularity prediction and satellite nodes location prediction, for achieving good cache matching between the satellite nodes and content. And using the matching rule, the Random Forest (RF) algorithm is adopted to predict the matching relationship among satellite nodes and content for guiding the deployment of caches. Especially, the content is cached in advance at the future satellite to maintain communication with the current ground segment at the time of satellite switchover. Additionally, the policy considers both the IoT content lifetime and the freshness. Finally, a simulation platform with LEO satellite mega-constellation based on ICN is developed in Network Simulator 3 (NS-3). The simulation results show that the proposed caching policy compared with the Leave Copy Everywhere (LCE), the opportunistic (OPP), the Leave Copy down (LCD), and the probabilistic algorithm which caches each content with probability 0.5 (prob 0.5) yield a significant performance improvement, such as the average number of hops, i.e., delay, cache hit rate, and throughput. [ABSTRACT FROM AUTHOR]

Therapy for personality disorder can be understood as a process of enhancing attachment security. This study tests the theory that individuals in a secure forensic mental health setting with a diagnosis of personality disorder who have undertaken psychological therapy will report secure patterns of attachment in their relationship with their therapist. It uses a novel pattern matching approach that assesses the behavioural, cognitive and affective markers of attachment security in a group of patients undergoing therapy. Eight behavioural, cognitive and affective characteristics of secure attachment were identified. Ten patients completed a semi-structured interview about their experiences in therapy and key relationships, and their responses were reviewed for evidence of these eight characteristics. Nine out of ten participants were judged to have demonstrated a pattern of six or more of the eight characteristics of secure attachment. This study supports the theory that treatment for this group of patients works by developing patient-therapist attachments. A focus on attachment issues should, therefore, be a core aspect of therapy. [ABSTRACT FROM AUTHOR]

Object-oriented micro-video background music recommendation is a complicated task where the matching degree between videos and background music is a major issue. However, music selections in user-generated content (UGC) are prone to selection bias caused by historical preferences of uploaders. Since historical preferences are not fully reliable and may reflect obsolete behaviors, over-reliance on them should be avoided as knowledge and interests dynamically evolve. In this article, we propose a Deconfounded Cross-Modal matching model to mitigate such bias. Specifically, uploaders' personal preferences of music genres are identified as confounders that spuriously correlate music embeddings and background music selections, causing the learned system to over-recommend music from majority groups. To resolve such confounders, backdoor adjustment is utilized to deconfound the spurious correlation between music embeddings and prediction scores. We further utilize Monte Carlo estimator with batch-level average as the approximations to avoid integrating the entire confounder space calculated by the adjustment. Furthermore, we design a teacher–student network to utilize the matching of music videos, which is professionally generated content (PGC) with specialized matching, to better recommend content-matching background music. The PGC data are modeled by a teacher network to guide the matching of uploader-selected UGC data of student network by Kullback–Leibler–based knowledge transfer. Extensive experiments on the TT-150k-genre dataset demonstrate the effectiveness of the proposed method. The code is publicly available on https://github.com/jing-1/DecCM [ABSTRACT FROM AUTHOR]

This article demonstrates a method using tools from the field of Natural Language Processing (NLP) to aid in analyzing theatrical texts and similar works. The method deploys pre-trained large language model neural networks to gather metadata for a text that is amenable to downstream statistical analyses surfacing patterns of interest in character dialogue. We specifically focus on Shakespeare's works, collecting metadata in the form of sentiment and emotion scores for each line of his plays. In addition to sentiment and emotion scores produced by NLP models, we also directly gather metadata such as genre, line length, and character gender. We show how these metadata may be used to illuminate a number of interesting patterns in Shakespearean character which may be difficult to detect from a direct reading of the texts. We use these metadata to expose statistically significant relationships in Shakespeare between character gender and the emotional content of that character's dialogue, controlling for genre. We also present here the publicly available dataset that we have compiled to perform these analyses. The data collects text from Shakespeare's plays along with a variety of metadata useful for this and other forms of analysis of Shakespeare's works. The methodology demonstrated here may be extended to other varieties of metadata provided by large NLP models. [ABSTRACT FROM AUTHOR]

The increasing availability of large geological datasets together with modern methods of data analysis facilitate a data science approach to geology in which inferences are drawn from geological data using automated methods based on statistics and machine learning. Such methods offer the potential for faster and less subjective interpretations of geological data than are possible from a human interpreter, but translating the understanding of a trained geologist to an algorithm is not straightforward. In this paper, we present automated workflows for detecting geological folds from map data using both unsupervised and supervised machine learning. For the unsupervised case, we use regular expression matching to identify map patterns suggestive of folds along lines crossing the map. We then use the hdbscan clustering algorithm to cluster these possible fold identifications into a smaller number of distinct folds, the number of which is not known a priori. For the supervised learning case, we use synthetic models of folds to train a convolutional neural network to identify folds using map and topographic data. We test both methods on synthetic and real datasets. [ABSTRACT FROM AUTHOR]

Side‐scan sonar is a lightweight acoustic sensor that is frequently deployed on autonomous underwater vehicles (AUVs) to provide high‐resolution seafloor images. However, using side‐scan images to perform simultaneous localization and mapping (SLAM) remains a challenge when there is a lack of 3D bathymetric information and discriminant features in the side‐scan images. To tackle this, the authors propose a feature‐based SLAM framework using side‐scan sonar, which is able to automatically detect and robustly match keypoints between paired side‐scan images. The authors then use the detected correspondences as constraints to optimise the AUV pose trajectory. The proposed method is evaluated on real data collected by a Hugin AUV, using as a ground truth reference both manually‐annotated keypoints and a 3D bathymetry mesh from multibeam echosounder (MBES). Experimental results demonstrate that this approach is able to reduce drifts from the dead‐reckoning system. The framework is made publicly available for the benefit of the community. [ABSTRACT FROM AUTHOR]

As a knowledge representation method, knowledge graph is widely used in intelligent question answering systems and recommendation systems. At present, the research on knowledge graph mainly focuses on information query and retrieval based on knowledge graph. In some domain knowledge graphs, specific subgraph structures (patterns) have specific physical meanings. Aiming at this problem, this paper proposes a method and framework of knowledge graph pattern mining based on gat. Firstly, the patterns with specific physical meaning were transformed into subgraph structures containing topological structures and entity attributes. Secondly, the subgraph structure of the pattern is regarded as the query graph, and the knowledge graph is regarded as the data graph, so that the problem is transformed into an approximate subgraph matching problem. Then, the improved relational graph attention network is used to fuse the adaptive edge deletion mechanism to realize the approximate subgraph matching of subgraph structure and attribute, so as to obtain the best matching subgraph. The proposed method is trained in an end-to-end manner. The approximate subgraph matching is realized on the existing data set, and the research work of key pattern mining of complex geological structure knowledge graph is carried out. [ABSTRACT FROM AUTHOR]

In natural environments, head movements are required to search for objects outside the field of view (FoV). Here we investigate the power of a salient target in an extended visual search array to facilitate faster detection once this item comes into the FoV by a head movement. We conducted two virtual reality experiments using spatially clustered sets of stimuli to observe target detection and head and eye movements during visual search. Participants completed search tasks with three conditions: (1) target in the initial FoV, (2) head movement needed to bring the target into the FoV, (3) same as condition 2 but the periphery was initially hidden and appeared after the head movement had brought the location of the target set into the FoV. We measured search time until participants found a more salient (O) or less salient (T) target among distractors (L). On average O's were found faster than T's. Gaze analysis showed that saliency facilitation occurred due to the target guiding the search only if it was within the initial FoV. When targets required a head movement to enter the FoV, participants followed the same search strategy as in trials without a visible target in the periphery. Moreover, faster search times for salient targets were only caused by the time required to find the target once the target set was reached. This suggests that the effect of stimulus saliency differs between visual search on fixed displays and when we are actively searching through an extended visual field. [ABSTRACT FROM AUTHOR]

Purpose: Wiswesser Line Notation (WLN) is a old line notation for encoding chemical compounds for storage and processing by computers. Whilst the notation itself has long since been surpassed by SMILES and InChI, distribution of WLN during its active years was extensive. In the context of modernising chemical data, we present a comprehensive WLN parser developed using the OpenBabel toolkit, capable of translating WLN strings into various formats supported by the library. Furthermore, we have devised a specialised Finite State Machine l, constructed from the rules of WLN, enabling the recognition and extraction of chemical strings out of large bodies of text. Available open-access WLN data with corresponding SMILES or InChI notation is rare, however ChEMBL, ChemSpider and PubChem all contain WLN records which were used for conversion scoring. Our investigation revealed a notable proportion of inaccuracies within the database entries, and we have taken steps to rectify these errors whenever feasible. Scientific contribution: Tools for both the extraction and conversion of WLN from chemical documents have been successfully developed. Both the Deterministic Finite Automaton (DFA) and parser handle the majority of WLN rules officially endorsed in the three major WLN manuals, with the parser showing a clear jump in accuracy and chemical coverage over previous submissions. The GitHub repository can be found here: https://github.com/Mblakey/wiswesser. [ABSTRACT FROM AUTHOR]

Simple Summary: Long Interspersed Element-1 (LINE-1 or L1) is an autonomous transposable element, meaning that its DNA sequences are able to replicate themselves throughout the human genome. This activity may lead to genomic instability and is associated with several different diseases. Additionally, L1s are also capable of replicating other non-autonomous sequences, thereby increasing their disruptive impact. Although there are different tools available that may be used for L1 detection, the heuristics involved affect their accuracy. L1PD (LINE-1 Pattern Detection) uses a novel pattern-matching approach to detect L1s in human genomes, using a fixed set of k-mer probes of length 50 that were generated using the human reference genome GRCh38. This research aims to improve L1PD by using longer probes and testing whether this leads to better results. Additionally, experiments were performed to test the effectiveness of L1PD in detecting L1s in other species, such as dogs, horses, and cows. The results showed that longer probes did improve precision and recall of L1s, not only in humans but in the other species as well. Long Interspersed Element-1 (LINE-1 or L1) is an autonomous transposable element that accounts for 17% of the human genome. Strong correlations between abnormal L1 expression and diseases, particularly cancer, have been documented by numerous studies. L1PD (LINE-1 Pattern Detection) had been previously created to detect L1s by using a fixed pre-determined set of 50-mer probes and a pattern-matching algorithm. L1PD uses a novel seed-and-pattern-match strategy as opposed to the well-known seed-and-extend strategy employed by other tools. This study discusses an improved version of L1PD that shows how increasing the size of the k-mer probes from 50 to 75 or to 100 yields better results, as evidenced by experiments showing higher precision and recall when compared to the 50-mers. The probe-generation process was updated and the corresponding software is now shared so that users may generate probes for other reference genomes (with certain limitations). Additionally, L1PD was applied to other non-human genomes, such as dogs, horses, and cows, to further validate the pattern-matching strategy. The improved version of L1PD proves to be an efficient and promising approach for L1 detection. [ABSTRACT FROM AUTHOR]

To reduce harmonic components, balance system impedance, and stabilize driving voltage, an additional matching circuit is required for ultrasonic motors (USMs) driver. However, the performance of inductor or capacitor matching can be seriously weakened with changes in driving frequency. Therefore, this paper presents a simple and effective LC matching method against driving frequency adjustment for USMs. First, the driving scheme of the USM is proposed and the electromechanical coupling model is analyzed. Subsequently, the output characteristics of the full-bridge inverter are derived theoretically when the driving frequency deviates from the mechanical resonant frequency. Then, the impedance circular transform method is proposed, which can intuitively analyze the effect of matching parameters on the voltage amplitude. A matching objective function is established that can consider both the voltage stabilization and harmonic suppression. The matching parameters are solved using random weight particle swarm optimization. Simulations and experiments demonstrate that within the operating frequency of the USM, the proposed matching method can effectively prevent overvoltage and suppress harmonic components. Furthermore, compared with the existing resonant matching method, the proposed matching method can realize more stable driving capability at different frequencies. The proposed method could be useful for USMs' variable-frequency driver design. [ABSTRACT FROM AUTHOR]

The geometry of 4-string contact interaction of closed string field theory is characterized using machine learning. We obtain Strebel quadratic differentials on 4-punctured spheres as a neural network by performing unsupervised learning with a custom-built loss function. This allows us to solve for local coordinates and compute their associated mapping radii numerically. We also train a neural network distinguishing vertex from Feynman region. As a check, 4-tachyon contact term in the tachyon potential is computed and a good agreement with the results in the literature is observed. We argue that our algorithm is manifestly independent of number of punctures and scaling it to characterize the geometry of n-string contact interaction is feasible. [ABSTRACT FROM AUTHOR]

Two recent lower bounds on the compressibility of repetitive sequences, δ ≤ γ , have received much attention. It has been shown that a length-n string S over an alphabet of size σ can be represented within the optimal O (δ log n log σ δ log n ) space, and further, that within that space one can find all the occ occurrences in S of any length-m pattern in time O (m log n + o c c log ϵ n) for any constant ϵ > 0 . Instead, the near-optimal search time O (m + (o c c + 1) log ϵ n) has been achieved only within O (γ log n γ) space. Both results are based on considerably different locally consistent parsing techniques. The question of whether the better search time could be supported within the δ -optimal space remained open. In this paper, we prove that both techniques can indeed be combined to obtain the best of both worlds: O (m + (o c c + 1) log ϵ n) search time within O (δ log n log σ δ log n ) space. Moreover, the number of occurrences can be computed in O (m + log 2 + ϵ n) time within O (δ log n log σ δ log n ) space. We also show that an extra sublogarithmic factor on top of this space enables optimal O (m + o c c) search time, whereas an extra logarithmic factor enables optimal O(m) counting time. [ABSTRACT FROM AUTHOR]

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. [ABSTRACT FROM AUTHOR]

A beam string structure is an efficient hybrid system comprising beams, cables, and struts. This study proposes an active beam string structure that adapts to external loading for deflection control, achieved by replacing passive struts with telescopic ones. An optimization-based model is created to minimize deflection, with the maximum deflection of beams serving as the optimization objective. A deflection control framework is constructed by using a hybrid genetic algorithm and back-propagation neural network. The former combines the strengths of the genetic and gradient descent algorithms, and the latter trains a prediction network applying mechanical responses, resulting in quick output of control schemes. To assess the control framework's performance, a scaled model is designed and fabricated, including a measuring system for deflection and stress, an actuating system with telescopic struts, and a PC-based decision-making system. Experimental and numerical studies are carried out for the model. The control schemes using the hybrid genetic algorithm and back-propagation neural network successfully reduced the deflection responses by at least 80% in simulations and experiments. The results validate the accuracy of the algorithm and reliability of the network, further demonstrating the effectiveness of the control framework. In addition, the deflection control process also optimizes the internal forces of the beam, with a maximum decline rate of stress response approaching 60%. [ABSTRACT FROM AUTHOR]

The pattern matching is one of the essential tasks in streaming time-series data mining. Its purpose is to identify all sliding windows in streaming time-series whose Euclidean Distances with predefined patterns are smaller than a threshold pre-determined. The pattern can be high-dimensional data and the streaming time-series is frequently updated. Thus, the brute-force method, which involves calculating Euclidean Distances between each sliding window and all patterns, is not effective in practical applications. This paper develops a lower bound-basedmethod that can perform pattern matching in less time while guaranteeing the same results as brute-force method. The proposed method achieves speedup without any sacrifice in matching accuracy. The block vector is utilized to calculate the lower bound of Euclidean Distance. Our proposal can safely eliminate many expensive Euclidean Distance calculations between patterns and sliding window; thus, the efficiency of pattern matching can be improved. Besides, we present an approach that can obtain the block vectors on-the-fly in the streaming scenarios to improve efficiency further. The experimental study in synthetic and real-life data sets verifies the efficiency and advantage of the proposals over the state-of-the-art. [ABSTRACT FROM AUTHOR]

In this paper, we analyse the genome sequence of COVID-19 on a information point of view, and we compare that with past and present genomes. We use the powerful tool of joint complexity in order to quantify the similarities measured between the various potential parent genomes. The tool has a computing complexity of several orders of magnitude below the classic Smith–Waterman algorithm and would allow it to be used on a larger scale. [ABSTRACT FROM AUTHOR]

Voice interaction is a user-friendly interaction method for Mandarin Chinese. Voice perception has been widely implemented on smart devices for Mandarin voice interaction. However, previous studies gave little attention to how language features, such as the text type and text length affect the voice perception experience. Moreover, how the device type influences Mandarin voice perception is unclear, as the device type has been shown to have a significant effect on other interaction methods, such as interactions with keyboard entry and screen displays. Thus, the aim of this study was to investigate the effects of the text type, text length, and device type on the voice perception experience. This study invited seventy-two participants (36 females and 36 males) for an empirical experiment. Three text types, i.e., classical Chinese text, professional text, and daily text, three text lengths, namely, short (i.e., 10 characters), medium (i.e., 20 characters), and long (i.e., 30 characters), and two device types, i.e., mobile phones and smartwatches, were considered. Four measurements were used to evaluate the voice perception experience, namely, performance (i.e., self-reported performance and correct ratio), the satisfaction rating, mental workload, and skin conductance. The results indicate that the text type, text length, and device type had significant effects on the four measurements. Specifically, the voice perception experience was best for daily text and worst for classical Chinese text, shorter text led to a better voice perception experience, and users of smartwatches had a better voice perception experience than mobile phones. Furthermore, the design implications for improving the voice perception experience that consider the text type, text length, and device type were discussed. [ABSTRACT FROM AUTHOR]

The goal of visual place recognition (VPR) is to determine the location of a query image by identifying its place in a collection of image databases. Visual sensor technologies are crucial for visual place recognition as they allow for precise identification and location of query images within a database. Global descriptor-based VPR methods face the challenge of accurately capturing the local specific regions within a scene; consequently, it leads to an increasing probability of confusion during localization in such scenarios. To tackle feature extraction and feature matching challenges in VPR, we propose a modified patch-NetVLAD strategy that includes two new modules: a context-aware patch descriptor and a context-aware patch matching mechanism. Firstly, we propose a context-driven patch feature descriptor to overcome the limitations of global and local descriptors in visual place recognition. This descriptor aggregates features from each patch's surrounding neighborhood. Secondly, we introduce a context-driven feature matching mechanism that utilizes cluster and saliency context-driven weighting rules to assign higher weights to patches that are less similar to densely populated or locally similar regions for improved localization performance. We further incorporate both of these modules into the patch-NetVLAD framework, resulting in a new approach called contextual patch-NetVLAD. Experimental results are provided to show that our proposed approach outperforms other state-of-the-art methods to achieve a Recall@10 score of 99.82 on P i t t s b u r g h 30 k , 99.82 on FMDataset, and 97.68 on our benchmark dataset. [ABSTRACT FROM AUTHOR]

Motivated by DNA storage systems, this work presents the DNA reconstruction problem, in which a length-n string, is passing through the DNA-storage channel, which introduces deletion, insertion and substitution errors. This channel generates multiple noisy copies of the transmitted string which are called traces. A DNA reconstruction algorithm is a mapping which receives t traces as an input and produces an estimation of the original string. The goal in the DNA reconstruction problem is to minimize the edit distance between the original string and the algorithm's estimation. In this work, we present several new algorithms for this problem. Our algorithms look globally on the entire sequence of the traces and use dynamic programming algorithms, which are used for the shortest common supersequence and the longest common subsequence problems, in order to decode the original string. Our algorithms do not require any limitations on the input and the number of traces, and more than that, they perform well even for error probabilities as high as 0.27. The algorithms have been tested on simulated data, on data from previous DNA storage experiments, and on a new synthesized dataset, and are shown to outperform previous algorithms in reconstruction accuracy. [ABSTRACT FROM AUTHOR]

Alzheimer's disease (AD) is a complex neurodegenerative disorder with both genetic and non-genetic causes. Animal research models are available for a multitude of diseases and conditions affecting the central nervous system (CNS), and large-scale CNS gene expression data exist for many of these. Although there are several models specifically for AD, each recapitulates different aspects of the human disease. In this study we evaluate over 500 animal models to identify those with CNS gene expression patterns matching human AD datasets. Approaches included a hypergeometric based scoring system that rewards congruent gene expression patterns but penalizes discordant gene expression patterns. The top two models identified were APP/PS1 transgenic mice expressing mutant APP and PSEN1, and mice carrying a GFAP mutation that is causative of Alexander disease, a primary disorder of astrocytes in the CNS. The APP/PS1 and GFAP models both matched over 500 genes moving in the same direction as in human AD, and both had elevated GFAP expression and were highly congruent with one another. Also scoring highly were the 5XFAD model (with five mutations in APP and PSEN1) and mice carrying CK-p25, APP, and MAPT mutations. Animals with the APOE3 and 4 mutations combined with traumatic brain injury ranked highly. Bulbectomized rats scored high, suggesting anosmia could be causative of AD-like gene expression. Other matching models included the SOD1G93A strain and knockouts for SNORD116 (Prader-Willi mutation), GRID2, INSM1, XBP1, and CSTB. Many top models demonstrated increased expression of GFAP, and results were similar across multiple human AD datasets. Heatmap and Uniform Manifold Approximation Plot results were consistent with hypergeometric ranking. Finally, some gene manipulation models, including for TYROBP and ATG7, were identified with reversed AD patterns, suggesting possible neuroprotective effects. This study provides insight for the pathobiology of AD and the potential utility of available animal models. [ABSTRACT FROM AUTHOR]

With the recent rise in internet usage, the volume of crucial, private, and confidential data traveling online has increased. Attackers have made attempts to break into the network due to weaknesses in the security mechanisms, gaining access to sensitive data that could disrupt the operation of the systems and jeopardize the confidentiality of the data. Intrusion detection systems, a key component of cybersecurity, were used to defend against these potential threats. Numerous review papers have examined various intrusion detection system (IDS) approaches for networks, many of which focused primarily on the anomaly-based IDS while paying less attention to the signature and hybrid-based approaches. Additionally, a lot of these studies took a non-systematic approach, comparing existing techniques, without taking into account the in-depth analytical synthesis of methodologies and results of the approaches to provide a thorough grasp of state-of-the-art. In order to provide a thorough assessment of the current status of Network IDS, this work provides an in-depth insight into what is attainable in the research of Anomaly, Signature, and Hybrid-Based methods by adhering to the principles of Preferred Reporting Items for Systematic Reviews and Meta-Analyses and guidelines for Software Engineering Domain. We discovered unexplored study topics and unsolved research issues based on the study's findings. We end by highlighting potential, high impact future research areas in order to improve the IDS model. [ABSTRACT FROM AUTHOR]

Fully homomorphic encryption (FHE) cryptographic systems enable limitless computations over encrypted data, providing solutions to many of today's data security problems. While effective FHE platforms can address modern data security concerns in unsecure environments, the extended execution time for these platforms hinders their broader application. This project aims to enhance FHE systems through an efficient parallel framework, specifically building upon the existing torus FHE (TFHE) system chillotti2016faster. The TFHE system was chosen for its superior bootstrapping computations and precise results for countless Boolean gate evaluations, such as AND and XOR. Our first approach was to expand upon the gate operations within the current system, shifting towards algebraic circuits, and using graphics processing units (GPUs) to manage cryptographic operations in parallel. Then, we implemented this GPU-parallel FHE framework into a needed genomic data operation, specifically string search. We utilized popular string distance metrics (hamming distance, edit distance, set maximal matches) to ascertain the disparities between multiple genomic sequences in a secure context with all data and operations occurring under encryption. Our experimental data revealed that our GPU implementation vastly outperforms the former method, providing a 20-fold speedup for any 32-bit Boolean operation and a 14.5-fold increase for multiplications.This paper introduces unique enhancements to existing FHE cryptographic systems using GPUs and additional algorithms to quicken fundamental computations. Looking ahead, the presented framework can be further developed to accommodate more complex, real-world applications. [ABSTRACT FROM AUTHOR]

Wind power systems are a promising form of energy supply. At present, most of the studies focuses on the performance of individual components such as wind rotors or generators, and the overall output effect of wind power system is determined by the characteristics of wind rotor and generator and their combined characteristics. However, the evaluation of the overall output characteristics of the system is rarely considered. In order to investigate the overall output of the system quickly, a performance matching method of wind rotor and generator based on energy transfer is proposed in this paper. Based on the series operating characteristics of the wind power system model, the energy transformation process of the wind rotor, generator and the whole system are unified described by energy transfer. On the premise that the performance of wind rotor and generator is known, the transfer function model of each component is established, and on this basis, the transfer function model of the overall system is obtained. Then, the overall output effect of the system is analyzed and evaluated by this system transfer function model. The performance of the model is analyzed and compared by using a vertical axis wind power system coupling test bench and MATLAB/Simulink software. The results show that the error between the system output based on the theoretical model and the wind tunnel test is less than 6.5%, and the trend of the simulation and the test curve of the system output is consistent. Therefore, this method can be used to quickly predict the overall output performance of the wind turbine and generator on the premise that the performance of each component is known, without the need to connect each component to a wind power system for testing. [ABSTRACT FROM AUTHOR]

Motivation Annotations of biochemical models provide details of chemical species, documentation of chemical reactions, and other essential information. Unfortunately, the vast majority of biochemical models have few, if any, annotations, or the annotations provide insufficient detail to understand the limitations of the model. The quality and quantity of annotations can be improved by developing tools that recommend annotations. For example, recommender tools have been developed for annotations of genes. Although annotating genes is conceptually similar to annotating biochemical models, there are important technical differences that make it difficult to directly apply this prior work. Results We present AMAS , a system that predicts annotations for elements of models represented in the Systems Biology Markup Language (SBML) community standard. We provide a general framework for predicting model annotations for a query element based on a database of annotated reference elements and a match score function that calculates the similarity between the query element and reference elements. The framework is instantiated to specific element types (e.g. species, reactions) by specifying the reference database (e.g. ChEBI for species) and the match score function (e.g. string similarity). We analyze the computational efficiency and prediction quality of AMAS for species and reactions in BiGG and BioModels and find that it has subsecond response times and accuracy between 80% and 95% depending on specifics of what is predicted. We have incorporated AMAS into an open-source, pip-installable Python package that can run as a command-line tool that predicts and adds annotations to species and reactions to an SBML model. Availability and implementation Our project is hosted at https://github.com/sys-bio/AMAS , where we provide examples, documentation, and source code files. Our source code is licensed under the MIT open-source license. [ABSTRACT FROM AUTHOR]

Neural architecture search can be used to find convolutional neural architectures that are precise and robust while enjoying enough speed for industrial image processing applications. In this paper, our goal is to achieve optimal convolutional neural networks (CNNs) for multiple‐templates matching for applications such as licence plates detection (LPD). We perform an iterative local neural architecture search for the models with minimum validation error as well as low computational cost from our search space of about 32 billion models. We describe the findings of the experience and discuss the specifications of the final optimal architectures. About 20‐times error reduction and 6‐times computational complexity reduction is achieved over our engineered neural architecture after about 500 neural architecture evaluation (in about 10 h). The typical speed of our final model is comparable to classic template matching algorithms while performing more robust and multiple‐template matching with different scales. [ABSTRACT FROM AUTHOR]

Nephrons are the basic filtering units of the kidneys. Progression of chronic kidney disease (CKD) destroys nephrons permanently. Although there are many computing schemes suggested in recent years to identify CKD stages, no computing method has been suggested for identifying the nephron loss within kidney regions during CKD progression. In this paper, a novel pattern matching-based computation scheme is proposed to detect nephron loss in the kidney regions during CKD progression. We consider image registration (IR) with different transforms and a structural similarity index algorithm (SSIM) to match patterns of ultrasound images of kidney regions to identify the nephron loss. Simulation results show that the proposed scheme based on IR and SSIM algorithms detects almost 34% and 51% and almost 35% and 56% of the nephron damage in the cortex and medulla relative to a normal kidney, respectively. We extend the pattern matching scheme to identify CKD stages, as well. The proposed scheme based on IR and the SSIM algorithm can identify CKD stage with accuracy of 96% and 88%, respectively. The prediction accuracy of the proposed scheme for identifying CKD stage is comparable to that of the gray level co-occurrence matrix-based method, which is the best among the existing computing methods. However, the proposed scheme has advantages over the preexisting scheme, such as: the proposed method can be used to identify both CKD stage and the nephron loss in different kidney regions, and it identifies CKD stage without using a classifier. Therefore, the proposed pattern matching-based computing method is a better alternative to existing computing schemes for CKD stage identification. [ABSTRACT FROM AUTHOR]

Background: Pan-genome graphs are gaining importance in the field of bioinformatics as data structures to represent and jointly analyze multiple genomes. Compacted de Bruijn graphs are inherently suited for this purpose, as their graph topology naturally reveals similarity and divergence within the pan-genome. Most state-of-the-art pan-genome graphs are represented explicitly in terms of nodes and edges. Recently, an alternative, implicit graph representation was proposed that builds directly upon the unidirectional FM-index. As such, a memory-efficient graph data structure is obtained that inherits the FM-index' backward search functionality. However, this representation suffers from a number of shortcomings in terms of functionality and algorithmic performance. Results: We present a data structure for a pan-genome, compacted de Bruijn graph that aims to address these shortcomings. It is built on the bidirectional FM-index, extending the ability of its unidirectional counterpart to navigate and search the graph in both directions. All basic graph navigation steps can be performed in constant time. Based on these features, we implement subgraph visualization as well as lossless approximate pattern matching to the graph using search schemes. We demonstrate that we can retrieve all occurrences corresponding to a read within a certain edit distance in a very efficient manner. Through a case study, we show the potential of exploiting the information embedded in the graph's topology through visualization and sequence alignment. Conclusions: We propose a memory-efficient representation of the pan-genome graph that supports subgraph visualization and lossless approximate pattern matching of reads against the graph using search schemes. The C++ source code of our software, called Nexus, is available at https://github.com/biointec/nexus under AGPL-3.0 license. [ABSTRACT FROM AUTHOR]

Spherical images have the advantage of recording full scenes using only one camera exposure and have been becoming an important data source for 3D reconstruction. However, geometric distortions inevitably exist due to the spherical camera imaging model. Thus, this study proposes a reliable feature matching algorithm for spherical images via the combination of local geometric rectification and CNN (convolutional neural network) learned descriptor. First, image patches around keypoints are reprojected to their corresponding tangent planes based on a spherical camera imaging model, which uses scale and orientation data from the keypoints to achieve both rotation and scale invariance. Second, feature descriptors are then calculated from the rectified image patches by using a pre-trained separate detector and descriptor learning network, which improves the discriminability by exploiting the high representation learning ability of the CNN. Finally, after classical feature matching with the ratio test and cross check, refined matches are obtained based on an essential matrix-based epipolar geometry constraint for outlier removal. By using three real spherical images and an incremental structure from motion (SfM) engine, the proposed algorithm is verified and compared in terms of feature matching and image orientation. The experiment results demonstrate that the geometric distortions can be efficiently reduced from rectified image patches, and the increased ratio of the match numbers ranges from 26.8% to 73.9%. For SfM-based spherical image orientation, the proposed algorithm provides reliable feature matches to achieve complete reconstruction with comparative accuracy. [ABSTRACT FROM AUTHOR]

With the recent increase in internet usage, the number of important, sensitive, confidential individual and corporate data passing through internet has increasingly grown. With gaps in the security systems, attackers have attempted to intrude the network, thereby gaining access to essential and confidential information, which may cause harm to the operation of the systems, and also affect the confidentiality of the data. To counter these possible attacks, intrusion detection systems (IDSs), which is an essential branch of cybersecurity, were employed to monitor and analyze network traffic thereby detects and reports malicious activities. A large number of review papers have covered different approaches for intrusion detection in networks, most of which follow a non-systematic approach, merely made a comparison of the existing techniques without reflecting an in-depth analytical synthesis of the methodologies and performances of the approaches to give a complete understanding of the state of IDS. Nonetheless, many of these reviews investigated more about the anomaly-based IDS with more emphasis on deep-learning models, while signature, hybrid-based (signature + anomaly-based) have received minimal focus. Hence, by adhering to the principles of Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA), this work reviewed existing contributions on anomaly-, signature-, and hybrid-based approaches to provide a comprehensive overview of network IDS's state of the art. The articles were retrieved from seven databases (ScienceDirect, SpringerNature, IEEE, MDPI, Hindawi, PeerJ, and Taylor & Francis) which cut across various reputable journals and conference Proceedings. Among the 776 pieces of the literature identified, 71 were selected for analysis and synthesis to answer the research questions. Based on the research findings, we identified unexplored study areas and unresolved research challenges. In order to create a better IDS model, we conclude by presenting promising, high-impact future research areas. [ABSTRACT FROM AUTHOR]

At present, the learning-based down-sampling method has achieved good result by using the loss of subsequent tasks to optimize the process of sampling points selection. However, for the current methods there still has two problems, on the one hand, the sampled points may not be in the original point cloud, and the sampled generated points of the sample need to be matched with the original point cloud (re-matching problem), on the other hand, the number of points obtained after matching may be insufficient for the sampling demand, which need to be supplemented by Farthest Point Sampling, nearest neighbor point, or other methods (re-supplement problem). In order to solve the above problems of re-matching and re-supplement in the learning-based sampling method, we propose a new sampling network which based on high score selection strategy. In our method, LSTM (Long Short Term Memory) is used as the feature extraction method to obtain the relational weight which relative to the subsequent tasks. The attention mechanism is used to select the high score points. The experimental results show that the performances of our network (We dubbed it as LA-Net) are better than other sampling methods and achieve the state-of-the-art in the unified benchmark. Detailed ablation studies have also been carried out, which provably affirm the advantage of each component we proposed. Finally, the methods in this paper are applied to a real backbone network to optimize its performance, and real robot grasping experiments are designed to realize automatic robot grasping of multi-target objects in real scenes. [ABSTRACT FROM AUTHOR]

Drawing on the epistemology of logic literature on anti-exceptionalism about logic, we set out to investigate the following metaphilosophical questions empirically: Is philosophy special? Are its methods (dis)continuous with science? More specifically, we test the following metaphilosophical hypotheses empirically: philosophical deductivism, philosophical inductivism, and philosophical abductivism. Using indicator words to classify arguments by type (namely, deductive, inductive, and abductive arguments), we searched through a large corpus of philosophical texts mined from the JSTOR database (N = 435,703) to find patterns of argumentation. The results of our quantitative, corpus-based study suggest that deductive arguments are significantly more common than abductive arguments and inductive arguments in philosophical texts overall, but they are gradually and steadily giving way to non-deductive (i.e. inductive and abductive) arguments in academic philosophy. [ABSTRACT FROM AUTHOR]

This paper introduces a two-stage approach that automatically generates 3D CAD models from 2D orthographic drawings. First, a pattern-matching algorithm is proposed to reconstruct a network of 3D edges by matching 2D edge features extracted from the multiple views of the 2D drawing. Second, starting from the resulting 3D wireframe and generated graph, a loop detection algorithm allows identifying possible loops of faces. Then, a clustering algorithm recognizes the faces from the set of detected loops. The reconstruction ends while trimming and stitching the faces to get a watertight ready-to-use 3D CAD model. This approach has been validated on a public dataset composed of several thousands of 3D shapes, and it achieved 99.59% of well-reconstructed models in F-score. • A rule-based approach to automatically reconstruct 3D CAD models from 2D drawings. • A pattern-matching algorithm to generate 3D wireframes from 2D drawings. • A loop detection algorithm using co-planarity criterion to reduce the search space. • A clustering algorithm to identify the faces from a set of 3D loops in a wireframe. [ABSTRACT FROM AUTHOR]

Generative adversarial imitation learning (GAIL) regards imitation learning (IL) as a distribution matching problem between the state–action distributions of the expert policy and the learned policy. In this paper, we focus on the generalization and computational properties of policy classes. We prove that the generalization can be guaranteed in GAIL when the class of policies is well controlled. With the capability of policy generalization, we introduce distributional reinforcement learning (RL) into GAIL and propose the greedy distributional soft gradient (GDSG) algorithm to solve GAIL. The main advantages of GDSG can be summarized as: (1) Q-value overestimation, a crucial factor leading to the instability of GAIL with off-policy training, can be alleviated by distributional RL. (2) By considering the maximum entropy objective, the policy can be improved in terms of performance and sample efficiency through sufficient exploration. Moreover, GDSG attains a sublinear convergence rate to a stationary solution. Comprehensive experimental verification in MuJoCo environments shows that GDSG can mimic expert demonstrations better than previous GAIL variants. • Prove the generalization property for policy classes of GAIL. • Demonstrate the reasonableness of reproducing kernel functions in computation. • Introduce distributional RL into GAIL and propose GDSG. • Relieve training imbalance between policy and discriminator; enhance GAIL stability. • GDSG converges to a stationary solution with a sublinear rate. [ABSTRACT FROM AUTHOR]

The Non‐Volatile Random Access Memory (NVRAM) is recently identified as the most upcoming main memory technology in Embedded and Internet of Things (IoT) systems due to its appealing qualities like zero static power consumption and great memory cell density. On the other hand, most NVRAMs have low write endurance due to workload‐induced write variance, leading to more write activity at a few blocks of memory than the other blocks. Improving the endurance of NVRAM on embedded architectures is very critical due to the limited constraints of Embedded architectures. The main goal of this paper is to address the complexity of NVRAM designs, with a focus on embedded boards, and to create a prototype that enhances NVRAM endurance using a compression technique. Furthermore, this framework is not particular to a single NVRAM device. An Instruction Per Cycle based Dynamic Pattern Compression (IPC_DPC) model is developed to address NVRAM's high write latency and low endurance. The primary goal of the proposed IPC_DPC model is to minimize the energy utilization and latency of heavy workloads during the execution by pre‐determining the workload's instruction cycles. The IPC_DPC model initially divides the Low IPC and High IPC workloads and then compresses the workloads dynamically based on their IPC values compared to the threshold factor. As a result, IPC_DPC improves the compression ratio and reduces the write latencies associated with traditional compressors, significantly reducing the write activity and improving the lifetime of NVRAM. We implemented the proposed IPC_DPC model using GEM5 with a Raspberry Pi board and took IoMT, MiBench, and EEMBC benchmarks for evaluation. Compared to FPC, BDI, FNW, and DFPC models, the proposed IPC_DPC model is shown to be more efficient in terms of compression ratio (56.05%) and energy reduction (17%). [ABSTRACT FROM AUTHOR]

The objective is to find a Cellular Automata (CA) rule that can generate "loop patterns". A loop pattern is given by ones on a zero background showing loops. In order to find out how loop patterns can be locally defined, tentative loop patterns are generated by a genetic algorithm in a preliminary stage. A set of local matching tiles is designed and checked whether they can produce the aimed loop patterns by the genetic algorithm. After having approved a certain set of tiles, a probabilistic CA rule is designed in a methodical way. Templates are derived from the tiles, which then are used in the CA rule for matching. In order to drive the evolution to the desired patterns, noise is injected if the templates do not match or other constraints are not fulfilled. Simulations illustrate that loops and connected loops can be evolved by the CA rule. [ABSTRACT FROM AUTHOR]