AbstractProgressive mesh simplification (PM) algorithm aims to generate simplified mesh at any resolution for the input high‐precision mesh, and only needs to be optimized or fitted once. Most of the existing PM algorithms are obtained based on heuristic mesh simplification algorithms, which leads to redundant storage space and poor practice‐ability of the algorithm. In this article, a progressive mesh simplification algorithm based on neural implicit representation (NePM) is proposed, and NePM transforms algorithm process into an implicit continuous optimization problem through neural network and probabilistic model. NePM uses Gaussian mixture model to model high‐precision mesh and samples the probabilistic model to obtain simplified meshes at different resolutions. In addition, the simplified mesh is optimized through multi‐level neural network, preserving characteristics of the input high‐precision mesh. Thus, the algorithm in this work lowers the memory usage of the PM and improves the practicability of the algorithm while ensuring the accuracy.

AbstractThe monocular vision system is a crucial branch of machine vision research widely used in multiple industries as a research hotspot in the field of vision. Although the monocular vision system is of simple structure and cost‐effectiveness, its positioning accuracy is insufficient in some industries. This article researched the robot arm positioning method via monocular vision. First, we built a vision system model and designed the style of a cooperative target for target positioning. Second, a target feature screening method based on conditions is composed for the existence of interference. Furthermore, combining the principle of pose estimation on the PNP (Perspective‐n‐Point) problem with the results of the visual system calibration to realize the positioning of the target. Finally, complete the construction of the experimental platform and design accuracy evaluation experiments and positioning experiments. The experimental results show that the location measurement error range of the system in this article is below 4 mm, and the measurement error of the rotation angle is below 2. The system can adapt to the requirements of general industrial use.

AbstractRecently, large pretrained language models (PLMs) have led a revolution in the information retrieval community. In most PLMs‐based retrieval frameworks, the ranking performance broadly depends on the model structure and the semantic complexity of the input text. Sequence‐to‐sequence generative models for question answering or text generation have proven to be competitive, so we wonder whether these models can improve ranking effectiveness by enhancing input semantics. This article introduces SE‐BERT, a semantically enhanced bidirectional encoder representation from transformers (BERT) based ranking framework that captures more semantic information by modifying the input text. SE‐BERT utilizes a pretrained generative language model to summarize both sides of the candidate passage and concatenate them into a new input sequence, allowing BERT to acquire more semantic information within the constraints of the input sequence's length. Experimental results from two Text Retrieval Conference datasets demonstrate that our approach's effectiveness increasing as the length of the input text increases.

AbstractThis article describes experiments on speech segmentation using long short‐term memory recurrent neural networks. The main part of the paper deals with multi‐lingual and cross‐lingual segmentation, that is, it is performed on a language different from the one on which the model was trained. The experimental data involves large Czech, English, German, and Russian speech corpora designated for speech synthesis. For optimal multi‐lingual modeling, a compact phonetic alphabet was proposed by sharing and clustering phones of particular languages. Many experiments were performed exploring various experimental conditions and data combinations. We proposed a simple procedure that iteratively adapts the inaccurate default model to the new voice/language. The segmentation accuracy was evaluated by comparison with reference segmentation created by a well‐tuned hidden Markov model‐based framework with additional manual corrections. The resulting segmentation was also employed in a unit selection text‐to‐speech system. The generated speech quality was compared with the reference segmentation by a preference listening test.

AbstractArtificial intelligence and deep learning have aided ocular disease through experiments including automatic illness recognition from images of the iris, fundus, or retina. Automated diagnosis systems (ADSs) provide services for the benefit of humanity and are essential in the early detection of harmful diseases. In fact, early detection is essential to avoid total blindness. In real life, several diagnostic tests such as visual ocular tonometry, retinal exam, and acuity test are performed, but they are conclusively time demanding and stressful for the patient. To consume time and detect the retinal disease earlier, an efficient prediction method is designed. In this proposed model, the first process is data collection that consists of a retinal disease dataset for testing and training. The second process is pre‐processing, which executes image resizing and noise filter for feature extraction. The third step is feature extraction, which extracts the image's form, size, color, and texture for classification with CNN based on Inception‐ResNet V2. The classification process is done by using the SVM with the extracted features. The prediction of diseases is classified such as normal, cataract, glaucoma, and retinal disease. The suggested model's performance is assessed using performance indicators such as accuracy, error, sensitivity, precision, and so forth. The suggested model's accuracy, error, sensitivity, and precision are 0.96, 0.962, 0.964, and 0.04, respectively, higher than existing techniques such as VGG16, Mobilenet V1, ResNet, and AlexNet. Thus, the proposed model instantly predicts retinal disease.

AbstractText classification (TC) is a very crucial task in this century of high‐volume text datasets. Feature selection (FS) is one of the most important stages in TC studies. In the literature, numerous feature selection methods are recommended for TC. In the TC domain, filter‐based FS methods are commonly utilized to select a more informative feature subsets. Each method uses a scoring system that is based on its algorithm to order the features. The classification process is then carried out by choosing the top‐N features. However, each method's feature order is distinct from the others. Each method selects by giving the qualities that are critical to its algorithm a high score, but it does not select by giving the features that are unimportant a low value. In this paper, we proposed a novel filter‐based FS method namely, brilliant probabilistic feature selector (BPFS), to assign a fair score and select informative features. While the BPFS method selects unique features, it also aims to select sparse features by assigning higher scores than common features. Extensive experimental studies using three effective classifiers decision tree (DT), support vector machines (SVM), and multinomial naive bayes (MNB) on four widely used datasets named Reuters‐21,578, 20Newsgroup, Enron1, and Polarity with different characteristics demonstrate the success of the BPFS method. For feature dimensions, 20, 50, 100, 200, 500, and 1000 dimensions were used. The experimental results on different benchmark datasets show that the BPFS method is more successful than the well‐known and recent FS methods according to Micro‐F1 and Macro‐F1 scores.

AbstractBurnout is a state of exhaustion that results from prolonged, excessive workplace stress. This can be examined with the biological explications of burnout and physical consequences and classified against prolonged vigorous activities. The research aims to classify burnout people's brain images against prolonged emotional activities using ontology analysis of treatment and prevention and intermediate layers formation based on a speculative sense model. In this segment, the Ontology analysis of Treatment and prevention and intermediate layers formation based on a hypothetical sense model is employed for burnout people's classification analysis. The methodology is performed in the platform of ontology creation and performs the classification analysis. The calculation analysis found the result, and the brain images were classified. The classification analysis of burnout people's brain images, separation of prolonged vigorous activities, and the ontology creation for treatment and prevention against burnout people's brain images were obtained. The analysis received the result, and the results of the precision, recall, storage, computation time, specificity, and classification of burnout people's brain images were obtained. Furthermore, all these Ontology analysis of Treatment and prevention and intermediate layers formation based on a hypothetical sense model had the prediction sensitivity (SN) over 50% and specificity (SP) over 90%. The Classification of Burnout People's Brain performance comparison shows that the proposed system is much more successful than existing methods, especially on a scoring accuracy of 98%.

AbstractPersistent homology is a computationally intensive and yet extremely powerful tool for Topological Data Analysis. Applying the tool on potentially infinite sequence of data objects is a challenging task. For this reason, persistent homology and data stream mining have long been two important but disjoint areas of data science. The first computational model, that was recently introduced to bridge the gap between the two areas, is useful for detecting steady or gradual changes in data streams, such as certain genomic modifications during the evolution of species. However, that model is not suitable for applications that encounter abrupt changes of extremely short duration. This paper presents another model for computing persistent homology on streaming data that addresses the shortcoming of the previous work. The model is validated on the important real‐world application of network anomaly detection. It is shown that in addition to detecting the occurrence of anomalies or attacks in computer networks, the proposed model is able to visually identify several types of traffic. Moreover, the model can accurately detect abrupt changes of extremely short as well as longer duration in the network traffic. These capabilities are not achievable by the previous model or by traditional data mining techniques.

AbstractWith the surge of searching and reading online health‐based articles, maintaining the quality and credibility of online health‐based articles has become crucial. The circulation of deceptive health information on numerous social media sites can mislead people and can potentially cause adverse effects on people's health. To address these problems, this work uses deep learning approaches to automate the assessment and scoring of online health‐related articles' credibility. The paper proposed an Attention‐based Recurrent Multichannel Convolutional Neural Network (ARMCNN) model. The proposed model incorporates a BiLSTM layer, a multichannel CNN layer, and an attention layer and predicts the credibility of online health information. To perform a reliable evaluation of the presented model, we utilize the health articles reviewed by the experts, compiled in a labeled dataset termed “Pubhealth,” which consists of thousands of health articles. The results are evaluated using five performance measures, accuracy, precision, recall, f1‐score, and area under the ROC curve (AUC). Furthermore, we extensively compared the proposed model with different deep learning and machine learning models such as Long short‐term memory (LSTM), Bidirectional LSTM, CNN (Convolutional neural network), and RNN‐CNN. The experimental results showed that the proposed model produced state‐of‐the‐art performance on the used dataset by achieving an accuracy of 0.88, precision of 0.92, recall of 0.87, f1‐score of 0.90, and AUC of 0.94. Further, the proposed model yielded better performance than other benchmarked techniques for the credibility assessment of online health articles.