Search

Achieving community immunity against the coronavirus disease 2019 (COVID-19) depends on vaccinating the largest number of people within a specific period while taking all precautionary measures. To address this problem, this paper presents a smart parking system that will help the health crisis management committee to vaccinate the largest number of people with the minimum period of time while ensuring that all precautionary measures are followed, through a set of algorithms. These algorithms seek to ensure a uniform distribution of persons in parking. This paper proposes a novel complex system for smart parking and nine algorithms to address the NP-hard problem. The experimental results demonstrate the performance of the proposed algorithms in terms of gap and time. Applying these algorithms to smart cities to ensure precautionary measures against COVID-19 can help fight against this pandemic. [ABSTRACT FROM AUTHOR]

Academic research is crucial to the development of science and technology and is an important factor that affects national strength. When writing an academic research paper, a rhetorical structure is typically used to present the paper's ideas, but this task is quite difficult for junior researchers. To solve this problem, some studies have adopted text mining to assist with the writing, but the existing methods still require human intervention to generate sentences. Recently, due to the increasing maturity of deep learning technology and the ability to address the problem of automatic text generation, progress has been made in this area. The highly complex deep learning operations can correctly generate sequences and find correlations between sequences. When a user provides a few keywords and key sentences, the proposed algorithm can generate an introduction section for the user. The results show that the generated introduction is more coherent, clearer, and more fluent than existing summarization methods. In addition, the method proposed in this study improves the accuracy compared with traditional text extraction methods. The manuscript produced by this study has been evaluated to show that the study can produce a comprehensive introduction compared with previous studies. • The proposed framework can generate a comprehensive introduction based on users' brief inputs. • This paper demonstrates a three-testing-threshold approach to check the content quality. • The introduction generated through this method has less than 3% similarity to the original text by comparison. [ABSTRACT FROM AUTHOR]

The 5G technology will become a truly integrated technology. It's becoming the most famous technology because of its optimal system computing complex and transforming a group of individual network components. Adequate resources must be provided for the various devices that are typically on the same network. The various functions in the data system also require resource allocation to suit its needs. This will ensure that the various devices on that network perform different types of work effectively. It also represents the various device functionalites to ensure the estimated resources onetime manner. Only then will it be convenient to carry out a variety of jobs depending on their speed and selection. And its various data requirements vary according to the functionality of the various devices featured in this series segment dynamic configuration. In this paper a smart resource utilization scheme was proposed. Its main purpose is to better manage the off-the-shelf resources available here. And provide it where it is needed and streamline data delivery to users on the network. This ensures that all data goes to the users in the correct manner. The proposed method getting 49% energy consumption, 90% resource utilization, 92% resource reservation and 91% Quality of services. [ABSTRACT FROM AUTHOR]

Rhetorical sentence classification is an interesting approach for making extractive summaries but this technique still needs to be developed because the performance of automatic rhetorical sentence classification is still poor. Rhetorical sentences are sentences that contain rhetorical words or phrases. Rhetorical sentences not only appear in the contents of a paper but also in the title. In this study, features related to section class and title class that have been proposed in a previous research were further developed. Our method uses different techniques to reach automatic section class extraction for which we introduce new, format-based features. Furthermore, we propose automatic rhetoric phrase extraction from the title. The corpus we used was a collection of technical-experimental scientific papers. Our method uses the Support Vector Machine (SVM) algorithm and the Naïve Bayesian algorithm for classification. The four categories used were: Problem, Method, Data, and Result. It was hypothesized that these features would be able to improve classification accuracy compared to previous methods. The F-measure for these categories reached up to 14%. [ABSTRACT FROM AUTHOR]

Traffic signs detection is an important and challenging task in intelligent driving perception system. This paper proposes an improved lightweight traffic signs detection framework based on YOLOv5. Firstly, the YOLOv5's backbone is replaced with ShuffleNet v2, which simplifies the calculation complexity and reduces the parameters of backbone network. Secondly, aiming at the problem of inconspicuous traffic sign characteristics in complex road environment, we use the CA attention mechanism in this paper to improve the saliency of the object. Finally, aiming at the large-scale difference between the traffic signs and the high proportion of small objects, we design the BCS-FPN to fuse multi-scale features and improve the representation ability of the small-scale objects. The TT-100K dataset is also analyzed and the dataset is collated. We test on the collated TT-100K dataset for the improved YOLOv5 in this paper. And the results show that compared with YOLOv5s, the mAP of our algorithm is equivalent to that of YOLOv5s, and the speed is improved by 20.8%. This paper also has carried on the experiment on embedded devices, experimental results show that our framework in computing power less embedded devices has a better effect. [ABSTRACT FROM AUTHOR]

This paper primarily investigates enhanced object detection techniques for indoor service mobile robots. Robot operating systems (ROS) supply rich sensor data, which boost the models' ability to generalize. However, the model's performance might be hindered by constraints in the processing power, memory capacity, and communication capabilities of robotic devices. To address these issues, this paper proposes an improved you only look once version 5 (YOLOv5)-Lite object detection algorithm based on efficient multi-scale attention and bounding box regression combined with ROS. The algorithm incorporates efficient multi-scale attention (EMA) into the traditional YOLOv5-Lite model and replaces the C3 module with a lightweight C3Ghost module to reduce computation and model size during the convolution process. To enhance bounding box localization accuracy, modified precision-defined intersection over union (MPDIoU) is employed to optimize the model, resulting in the ROS–YOLOv5–FleetEMA model. The results indicated that relative to the conventional YOLOv5-Lite model, the ROS–YOLOv5–FleetEMA model enhanced the mean average precision (mAP) by 2.7% post-training, reduced giga floating-point operations per second (GFLOPS) by 13.2%, and decreased the params by 15.1%. In light of these experimental findings, the model was incorporated into ROS, leading to the development of a ROS-based object detection platform that offers rapid and precise object detection capabilities. [ABSTRACT FROM AUTHOR]

The performance of the existing student classroom behavior detection model is affected by various aspects such as dataset, algorithm and height as well as the differences between different classrooms, and there are problems such as a single dataset, low accuracy and low efficiency. In order to improve the accuracy of student classroom behavior detection algorithm, this paper proposes a student classroom behavior detection method based on improved convolutional neural network algorithm. Firstly, the student behavior detection dataset is constructed, and the student classroom behavior detection technology scheme is designed; secondly, in order to improve the detection accuracy, the features are extracted by using the new jumping bi-directional paths, and the attention mechanism module is added at different positions to improve the path aggregation network; weekly, the embedding positions of the attention mechanism strategy are determined by analyzing multiple sets of experiments, and the proposed student classroom behavior detection algorithm's effectiveness and superiority. [ABSTRACT FROM AUTHOR]

Data anomaly detection in small hydropower stations is an important research area because it positively affects the reliability of optimal scheduling and subsequent analytical studies of small hydropower station clusters. Although many anomaly detection algorithms have been introduced in the data preprocessing stage in various research areas, there is still little research on effective and highly reliable anomaly detection systems for practical applications in small hydropower stations. Therefore, this paper proposes a real‐time data anomaly detection system for small hydropower clusters (RDADS‐SHC) considering multiple time series. It addresses the difficulties of timely detection, alerting, and management of real‐time data anomalies (errors, omissions, and so on) in existing small hydropower stations. It proposes a real‐time data anomaly detection algorithm for small hydropower stations integrated with the Z‐score and dynamic time warping, which can detect and process abnormal information more accurately and efficiently, thereby improving the stability and reliability of data sampling. The paper proposes a Keepalived‐based hot‐standby RDADS‐SHC deployment model with m (m ≥ 2) units. It can automatically remove and restart faulty services and switch to their standbys, which significantly improve the reliability of the proposed system, ensuring the safe and stable operation of related functional services. This paper can detect anomalous data more accurately, and the system is more stable and reliable in a cluster detection environment. The actual operation has shown that compared with existing anomaly detection systems, the architecture and algorithms proposed in this paper can detect anomalous data more accurately, and the system is more stable and reliable in the small hydropower cluster detection environment. It solves abnormal data management in small hydropower stations and provides reliable support for subsequent analysis and decision‐making. [ABSTRACT FROM AUTHOR]

As an indispensable part of the vehicle environment perception task, road traffic marking detection plays a vital role in correctly understanding the current traffic situation. However, the existing traffic marking detection algorithms still have some limitations. Taking lane detection as an example, the current detection methods mainly focus on the location information detection of lane lines, and they only judge the overall attribute of each detected lane line instance, thus lacking more fine-grained dynamic detection of lane line attributes. In order to meet the needs of intelligent vehicles for the dynamic attribute detection of lane lines and more perfect road environment information in urban road environment, this paper constructs a fine-grained attribute detection method for lane lines, which uses pixel-level attribute sequence points to describe the complete attribute distribution of lane lines and then matches the detection results of the lane lines. Realizing the attribute judgment of different segment positions of lane instances is called the fine-grained attribute detection of lane lines (Lane-FGA). In addition, in view of the lack of annotation information in the current open-source lane data set, this paper constructs a lane data set with both lane instance information and fine-grained attribute information by combining manual annotation and intelligent annotation. At the same time, a cyclic iterative attribute inference algorithm is designed to solve the difficult problem of lane attribute labeling in areas without visual cues such as occlusion and damage. In the end, the average accuracy of the proposed algorithm reaches 97% on various types of lane attribute detection. [ABSTRACT FROM AUTHOR]

Efficient maritime search and rescue (SAR) is crucial for responding to maritime emergencies. In traditional SAR, fixed search path planning is inefficient and cannot prioritize high-probability regions, which has significant limitations. To solve the above problems, this paper proposes unmanned surface vehicles (USVs) path planning for maritime SAR based on POS-DQN so that USVs can perform SAR tasks reasonably and efficiently. Firstly, the search region is allocated as a whole using an improved task allocation algorithm so that the task region of each USV has priority and no duplication. Secondly, this paper considers the probability of success (POS) of the search environment and proposes a POS-DQN algorithm based on deep reinforcement learning. This algorithm can adapt to the complex and changing environment of SAR. It designs a probability weight reward function and trains USV agents to obtain the optimal search path. Finally, based on the simulation results, by considering the complete coverage of obstacle avoidance and collision avoidance, the search path using this algorithm can prioritize high-probability regions and improve the efficiency of SAR. [ABSTRACT FROM AUTHOR]

The efficient and accurate identification of traffic signs is crucial to the safety and reliability of active driving assistance and driverless vehicles. However, the accurate detection of traffic signs under extreme cases remains challenging. Aiming at the problems of missing detection and false detection in traffic sign recognition in fog traffic scenes, this paper proposes a recognition algorithm for traffic signs based on pix2pixHD+YOLOv5-T. Firstly, the defogging model is generated by training the pix2pixHD network to meet the advanced visual task. Secondly, in order to better match the defogging algorithm with the target detection algorithm, the algorithm YOLOv5-Transformer is proposed by introducing a transformer module into the backbone of YOLOv5. Finally, the defogging algorithm pix2pixHD is combined with the improved YOLOv5 detection algorithm to complete the recognition of traffic signs in foggy environments. Comparative experiments proved that the traffic sign recognition algorithm proposed in this paper can effectively reduce the impact of a foggy environment on traffic sign recognition. Compared with the YOLOv5-T and YOLOv5 algorithms in moderate fog environments, the overall improvement of this algorithm is achieved. The precision of traffic sign recognition of the algorithm in the fog traffic scene reached 78.5%, the recall rate was 72.2%, and mAP@0.5 was 82.8%. [ABSTRACT FROM AUTHOR]

Context: Software product lines (SPLs) have reached a considerable level of adoption in the software industry. The most commonly used models for managing the variability of SPLs are feature models (FMs). The analysis of FMs is an error-prone, tedious task, and it is not feasible to accomplish this task manually with large-scale FMs. In recent years, much effort has been devoted to developing reasoning algorithms for FMs. Aim: To synthesize the evidence on the use of reasoning algorithms for feature modeling. Method: We conducted a systematic mapping study, including six research questions. This study included 66 papers published from 2010 to 2020. Results: We found that most algorithms were used in the domain stage (70%). The most commonly used technologies were transformations (18%). As for the origins of the proposals, they were mainly rooted in academia (76%). The FODA model continued to be the most frequently used representation for feature modeling (70%). A large majority of the papers presented some empirical validation process (90%). Conclusion: We were able to respond to the RQs. The FODA model is consolidated as a reference within SPLs to manage variability. Responses to RQ2 and RQ6 require further review. [ABSTRACT FROM AUTHOR]

Sensor-based agriculture monitoring systems have limited outcomes on the detection or counting of vegetables from agriculture fields due to the utilization of either conventional color transformations or machine learning-based methods. To overcome these limitations, this research is aimed at proposing an IoT-based smart agriculture monitoring system with multiple algorithms such as detection, quantification, ripeness checking, and detection of infected vegetables. This paper presents smart agriculture monitoring systems for Internet of Things (IoT) applications. The CHT has been applied to detect and quantify vegetables from the agriculture field. Using color thresholding and color segmentation techniques, defected vegetables have also been detected. A machine learning method-convolutional neural network (CNN) has been used for the development and implementation of all algorithms. A comparison between traditional methods and CNN has been simulated in MATLAB to find out the optimal method for its implementation in this agricultural monitoring system. Compared to the traditional methods, the CNN is the optimal method in this research work which performed better over the previously developed algorithms with an accuracy of more than 90%. As an example (case study), a tomato field in Chittagong, Bangladesh, was chosen where a camera-mounted mobile robot captured images from the agriculture field for which the proposed IoT-based smart monitoring system was developed. This system will benefit farmers through the digitally monitored output at an agriculture field in Bangladesh as well as in Malaysia. Since this proposed smart IoT-based system is still driven by bulky, costly, and limited powered sensors, in a future work, for the required power of sensors, this research work is aimed at the design and development of an energy harvester (hybrid) (HEH) based on ultralow power electronics circuits to generate the required power of sensors. Implementation of multiple algorithms using CNN, circular Hough transformation (CHT), color thresholding, and color segmentation methods for the detection, quantification, ripeness checking, and detection of infected crops. [ABSTRACT FROM AUTHOR]

In 2018, the position paper 'Imaging the adult with congenital heart disease: a multimodality imaging approach' was published. The paper highlights, in the first part, the different imaging modalities applied in adult congenital heart disease patients. In the second part, these modalities are discussed more detailed for moderate to complex anatomical defects. Because of the length of the paper, simple lesions were not touched on. However, imaging modalities to use for simple shunt lesions are still poorly known. One is looking for structured recommendations on which they can rely when dealing with an (undiscovered) shunt lesion. This information is lacking for the initial diagnostic process, during repair and at follow-up. Therefore, this paper will focus on atrial septal defect, ventricular septal defect, and persistent arterial duct. Pre-, intra-, and post-procedural imaging techniques will be systematically discussed. This position paper will offer algorithms that might help at a glance. The document is prepared for general cardiologists, trainees, medical students, imagers/technicians to select the most appropriate imaging modality and to detect the requested information for each specific lesion. It might serve as reference to which researchers could refer when setting up a (imaging) study. [ABSTRACT FROM AUTHOR]

The paper [[10]] considers an assignment problem and some modifications which can be converted to routing, distribution, or scheduling problems. This special issue of I Algorithms i is dedicated to recent developments of scheduling algorithms and new applications. References 1 Werner F., Burtseva L., Sotskov Y. Special Issue on Algorithms for Scheduling Problems. For this problem, a hybrid metaheuristic algorithm is presented which combines a genetic algorithm with a so-called spotted hyena optimization algorithm. [Extracted from the article]

Complex systems in the real world often can be modeled as network structures, and community discovery algorithms for complex networks enable researchers to understand the internal structure and implicit information of networks. Existing community discovery algorithms are usually designed for single-layer networks or single-interaction relationships and do not consider the attribute information of nodes. However, many real-world networks consist of multiple types of nodes and edges, and there may be rich semantic information on nodes and edges. The methods for single-layer networks cannot effectively tackle multi-layer information, multi-relationship information, and attribute information. This paper proposes a community discovery algorithm based on multi-relationship embedding. The proposed algorithm first models the nodes in the network to obtain the embedding matrix for each node relationship type and generates the node embedding matrix for each specific relationship type in the network by node encoder. The node embedding matrix is provided as input for aggregating the node embedding matrix of each specific relationship type using a Graph Convolutional Network (GCN) to obtain the final node embedding matrix. This strategy allows capturing of rich structural and attributes information in multi-relational networks. Experiments were conducted on different datasets with baselines, and the results show that the proposed algorithm obtains significant performance improvement in community discovery, node clustering, and similarity search tasks, and compared to the baseline with the best performance, the proposed algorithm achieves an average improvement of 3.1% on Macro-F1 and 4.7% on Micro-F1, which proves the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a “dying” paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing “offspring”. Practically, this might be used to trace the successive published milestones of a research field. [ABSTRACT FROM AUTHOR]

This special issue of Software Tools for Technology Transfer comprises extended versions of selected papers from the 26th edition of the International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS 2020). The focus of this conference series is tools and algorithms for the rigorous analysis of software and hardware systems, and the papers in this special cover the spectrum of current work in this field. [ABSTRACT FROM AUTHOR]

The article focuses on the research flaws in the study "The Harmful Effects of Algorithms in Grades 1-4," by Constance Kamii and Ann Dominick. The research explained the benefits of "no algorithms" experience in mastering arithmetic, where the authors theorized that the approach improved the ability of children to master mental math techniques and disadvantages of standard addition algorithm. The flaws proved that standard algorithms are essential in solving arithmetic problems in simple ways.

This paper proposes a cutting head optimization method based on meshing the spatial position of the picks. According to the expanded shape of the spatial mesh composed of four adjacent picks on the plane, a standard mesh shape analysis method can be established with mesh skewness, mesh symmetry, and mesh area ratio as the indicators. The traversal algorithm is used to calculate the theoretical meshing rate, pick rotation coefficient, and the variation of cutting load for the longitudinal cutting head with 2, 3, and 4 helices. The results show that the 3-helix longitudinal cutting head has better performance. By using the traversal result with maximum theoretical meshing rate as the design parameter, the longitudinal cutting head CH51 with 51 picks was designed and analyzed. The prediction model of pick consumption is established based on cutting speed, direct rock cutting volume of each pick, pick rotation coefficient, uniaxial compressive strength, and CERCHAR abrasivity index. And the rock with normal distribution characteristics of Uniaxial Compressive Strength is used for the specific energy calculating. The artificial rock wall cutting test results show that the reduction in height loss suppresses the increase in pick equivalent loss caused by the increase in mass loss, and the pick consumption in this test is only 0.037–0.054 picks/m3. In addition, the correlation between the actual pick consumption and the prediction model, and the correlation between the actual cutting specific energy and the theoretical calculation value are also analyzed. The research results show that the pick arrangement design method based on meshing pick tip spatial position can effectively reduce pick consumption and improve the rock cutting performance. [ABSTRACT FROM AUTHOR]

This paper proposes a smart grid distributed security architecture based on blockchain technology and SDN cluster structure, referred to as ClusterBlock model, which combines the advantages of two emerging technologies, blockchain and SDN. The blockchain technology allows for distributed peer-to-peer networks, where the network can ensure the trusted interaction of untrusted nodes in the network. At the same time, this article adopts the design of an SDN controller distributed cluster to avoid single point of failure and balance the load between equipment and the controller. A cluster head was selected in each SDN cluster, and it was used as a blockchain node to construct an SDN cluster head blockchain. By combining blockchain technology, the security and privacy of the SDN communication network can be enhanced. At the same time, this paper designs a distributed control strategy and network attack detection algorithm based on blockchain consensus and introduces the Jaccard similarity coefficient to detect the network attacks. Finally, this paper evaluates the ClusterBlock model and the existing model based on the OpenFlow protocol through simulation experiments and compares the security performance. The evaluation results show that the ClusterBlock model has more stable bandwidth and stronger security performance in the face of DDoS attacks of the same scale. [ABSTRACT FROM AUTHOR]

Many complex physical systems exhibit a rich variety of discrete behavioural modes. Often, the system complexity limits the applicability of standard modelling tools. Hence, understanding the underlying physics of different behaviours and distinguishing between them is challenging. Although traditional machine learning techniques could predict and classify behaviour well, typically they do not provide any meaningful insight into the underlying physics of the system. In this paper we present a novel method for extracting physically meaningful clusters of discrete behaviour from limited experimental observations. This method obtains a set of physically plausible functions that both facilitate behavioural clustering and aid in system understanding. We demonstrate the approach on the V-shaped falling paper system, a new falling paper type system that exhibits four distinct behavioural modes depending on a few morphological parameters. Using just 49 experimental observations, the method discovered a set of candidate functions that distinguish behaviours with an error of 2.04%, while also aiding insight into the physical phenomena driving each behaviour. [ABSTRACT FROM AUTHOR]

This paper proposes an innovative image encryption algorithm that leverages partial face recognition and DNA diffusion, building upon advancements in chaotic image encryption and face recognition technologies. The key is generated using the secure SHA-512 algorithm, while the chaotic sequence for the encryption algorithm is derived from the Chen system. This paper begins by employing facial recognition technology to identify and focus on specific facial regions within an image. Subsequently, DNA diffusion is applied to encrypt the recognized face segment via a diffusion-scrambling encryption process. Following this, the entire image undergoes diffusion utilizing the devised diffusion rules. Finally, a uniform scrambling operation based on Fisher-Yeats is performed on the entire image. The experimental results and safety analysis show that the information entropy can exceed 7.9973, the average correlation can be less than 0.0023, the pixel number change rate can reach 99.6052%, and the unified average change intensity can reach 33.4644%, all of which are very close to the ideal values. [ABSTRACT FROM AUTHOR]

The Parker-Oldenburg method, as a classical frequency-domain algorithm, has been widely used in Moho topographic inversion. The method has two indispensable hyperparameters, which are the Moho density contrast and the average Moho depth. Accurate hyperparameters are important prerequisites for inversion of fine Moho topography. However, limited by the nonlinear terms, the hyperparameters estimated by previous methods have obvious deviations. For this reason, this paper proposes a new method to improve the existing ParkerOldenburg method by taking advantage of the invasive weed optimization algorithm in estimating hyperparameters. The synthetic test results of the new method show that, compared with the trial and error method and the linear regression method, the new method estimates the hyperparameters more accurately, and the computational efficiency performs excellently, which lays the foundation for the inversion of more accurate Moho topography. In practice, the method is applied to the Moho topographic inversion in the South China Sea. With the constraints of available seismic data, the crust-mantle density contrast and the average Moho depth in the South China Sea are determined to be 0.535 g/cm3 and 21.63 km, respectively, and the Moho topography of the South China Sea is inverted based on this. The results of the Moho topography show that the Moho depth in the study area ranges from 5.7 km to 32.3 km, with more obvious undulations. Among them, the shallowest part of the Moho topography is mainly located in the southern part of the Southwestern sub-basin and the southern part of the Manila Trench, with a depth of about 6 km. Compared with the CRUST 1.0 model and the model calculated by the improved Bott's method, the RMS between the Moho model and the seismic point difference in this paper is smaller, which proves that the method in this paper has some advantages in Moho topographic inversion. [ABSTRACT FROM AUTHOR]

Unmanned Aerial Vehicles are useful tools for many applications. However, autonomous path planning for Unmanned Aerial Vehicles in unfamiliar environments is a challenging problem when facing a series of problems such as poor consistency, high influence by the native controller of the Unmanned Aerial Vehicles. In this paper, we investigate reinforcement learning-based autonomous local path planning methods for Unmanned Aerial Vehicles with high autonomous decision-making capability and locally high portability. We propose an autonomous local path planning algorithm based on the TD3 strategy to solve the problem of local obstacle avoidance and path planning in unfamiliar environments using autonomous decision-making of Unmanned Aerial Vehicles. The simulation results on Gazebo show that our method can effectively realize the autonomous local path planning task for Unmanned Aerial Vehicles, the success rate of path planning with our method can reach 93% under the interference of no obstacles, and 92% in the environment with obstacles. Finally, our method can be used for autonomous path planning of Unmanned Aerial Vehicles in unfamiliar environments. [ABSTRACT FROM AUTHOR]

This paper explores citation-based metrics, how they differ in ranking papers and authors, and why. We initially take as example three main metrics that we believe significant; the standard citation count, the more and more popular h-index, and a variation we propose of PageRank applied to papers (called PaperRank), that is appealing as it mirrors proven and successful algorithms for ranking web pages. As part of analyzing them, we develop generally applicable techniques and metrics for qualitatively and quantitatively analyzing indexes that evaluate content and people, as well as for understanding the causes of their different behaviors. Finally, we extend the analysis to other popular indexes, to show whether the choice of the index has a significant effect in how papers and authors are ranked. We put the techniques at work on a dataset of over 260 K ACM papers, and discovered that the difference in ranking results is indeed very significant (even when restricting to citation-based indexes), with half of the top-ranked papers differing in a typical 20-element long search result page for papers on a given topic, and with the top researcher being ranked differently over half of the times in an average job posting with 100 applicants. [ABSTRACT FROM AUTHOR]

Objective: This study compared the aerosol and splatter diameter and count numbers produced by a dental mouth prop with a suction holder device and a saliva ejector during ultrasonic scaling in a clinical setting. Methodology: Fluorescein dye was placed in the dental equipment irrigation reservoirs with a mannequin, and an ultrasonic scaler was employed. The procedures were performed three times per device. The upper and bottom board papers were placed on the laboratory platform. All processes used an ultrasonic scaler to generate aerosol and splatter. A dental mouth prop with a suction holder and a saliva ejector were also tested. Photographic analysis was used to examine the fluorescein samples, followed by image processing in Python and assessment of the diameter and count number. For device comparison, statistics were used with an independent t-test. Result: When using the dental mouth prop with a suction holder, the scaler produced aerosol particles that were maintained on the upper board paper (mean ± SD: 1080 ± 662 µm) compared to on the bottom board paper (1230 ± 1020 µm). When the saliva ejector was used, it was found that the diameter of the aerosol on the upper board paper was 900 ± 580 µm, and the diameter on the bottom board paper was 1000 ± 756 µm. Conclusion: There was a significant difference in the aerosol and splatter particle diameter and count number between the dental mouth prop with a suction holder and saliva ejector (p < 0.05). Furthermore, the results revealed that there was a statistically significant difference between the two groups on the upper and bottom board papers. [ABSTRACT FROM AUTHOR]

In this work, an improved moth-flame optimization algorithm is proposed to alleviate the problems of premature convergence and convergence to local minima. From the perspective of diversity, an inertia weight of diversity feedback control is introduced in the moth-flame optimization to balance the algorithm's exploitation and global search abilities. Furthermore, a small probability mutation after the position update stage is added to improve the optimization performance. The performance of the proposed algorithm is extensively evaluated on a suite of CEC'2014 series benchmark functions and four constrained engineering optimization problems. The results of the proposed algorithm are compared with the ones of other improved algorithms presented in literatures. It is observed that the proposed method has a superior performance to improve the convergence ability of the algorithm. In addition, the proposed algorithm assists in escaping the local minima. [ABSTRACT FROM AUTHOR]

This paper focuses on the problem of information source identification in online social networks (OSNs). By analyzing the research situation of source identification problems and challenges (such as the randomness of the information dissemination process and complexity of the underlying network topology), this paper studies the problem of multiple source diffusion and proposes a source identification algorithm based on multi-attribute topological clustering (MaTC). The basic idea of the algorithm is to decompose the multi-source problems into a series of single-source problems by using clustering partitioning to improve accuracy and efficiency. Firstly, it estimates the number of source nodes, which is also the number of network partitions, then characterizes the combination of multiple attribute structures as an attribute index of topological clustering, performs an analysis of the distribution of real source nodes in each partition to evaluate the accuracy of the clustering partition, and finally uses Jordan centrality within each partition for single-source identification. Through comparative experiments, it is verified that the proposed MaTC algorithm is superior to the comparison algorithms in evaluating indicators. [ABSTRACT FROM AUTHOR]

In response to the challenges posed by small objects in remote sensing images, such as low resolution, complex backgrounds, and severe occlusions, this paper proposes a lightweight improved model based on YOLOv8n. During the detection of small objects, the feature fusion part of the YOLOv8n algorithm retrieves relatively fewer features of small objects from the backbone network compared to large objects, resulting in low detection accuracy for small objects. To address this issue, firstly, this paper adds a dedicated small object detection layer in the feature fusion network to better integrate the features of small objects into the feature fusion part of the model. Secondly, the SSFF module is introduced to facilitate multi-scale feature fusion, enabling the model to capture more gradient paths and further improve accuracy while reducing model parameters. Finally, the HPANet structure is proposed, replacing the Path Aggregation Network with HPANet. Compared to the original YOLOv8n algorithm, the recognition accuracy of mAP@0.5 on the VisDrone data set and the AI-TOD data set has increased by 14.3% and 17.9%, respectively, while the recognition accuracy of mAP@0.5:0.95 has increased by 17.1% and 19.8%, respectively. The proposed method reduces the parameter count by 33% and the model size by 31.7% compared to the original model. Experimental results demonstrate that the proposed method can quickly and accurately identify small objects in complex backgrounds. [ABSTRACT FROM AUTHOR]

The optimization of the cutting path of the sample can effectively reduce the cutting time, thereby improving the production efficiency of numerical control processing. This paper comprehensively considers the impact of the cutting order and the position of the knife entry point on the cutting path, converts the cutting path problem into a type of traveling salesman problem (TSP), and proposes an improved genetic-particle swarm optimization algorithm. The selection mechanism of the algorithm combines the elitist retention strategy and roulette wheel selection method to accelerate the search for the optimal solution; the mutation strategy designs a linear decreasing mutation rate, which enhances the global search ability; at the same time, introduces the ant colony optimization algorithm to process the fitness function, adjusts the population evolution difference, and speeds up the optimization process. Through this hybrid algorithm, the cutting order of the sample can be quickly optimized, and the nearest neighbor algorithm is used to determine the position of the knife entry point. Tests are conducted on clothing patterning charts and standard examples. Compared with several commonly used algorithms, experimental results verify the feasibility and effectiveness of this algorithm. [ABSTRACT FROM AUTHOR]