154,192 results
Search Results
2. 39‐3: Invited Paper: Kirameki Display: Technical Approaches to Represent Real Texture with Light Fields.
- Author
-
Sumi, Naoki, Edo, Keiko, Shibazaki, Minoru, and Hagino, Shuji
- Subjects
MATERIALS texture ,DESIGN software ,SOFTWARE architecture ,ALGORITHMS - Abstract
We have developed a "Kirameki display" that can represent a real texture of materials. ("Kirameki" means a shining/glittering sense in Japanese.) In addition, we have investigated an improvement of "texture representation" by optimization of both an optical design and a software algorithm. Lastly, we discuss the future technical fields for texture representation on displays. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. Special Issue: "2022 and 2023 Selected Papers from Algorithms' Editorial Board Members".
- Author
-
Werner, Frank
- Subjects
EDITORIAL boards ,ALGORITHMS ,OPTIMIZATION algorithms ,DIFFERENTIAL evolution ,QUADRATIC assignment problem ,MACHINE learning ,TABU search algorithm - Abstract
This document is a special issue of the journal Algorithms, featuring selected papers from the journal's editorial board members from 2022 and 2023. The issue includes 16 research papers covering a range of topics such as game theory, fault detection in cellular networks, optimization algorithms, machine learning, cryptocurrency trading, and more. Each paper presents its own unique research findings and methodologies. The issue aims to showcase the diverse research interests and expertise of the journal's editorial board members. [Extracted from the article]
- Published
- 2024
- Full Text
- View/download PDF
4. Socio‐technical issues in the platform‐mediated gig economy: A systematic literature review: An Annual Review of Information Science and Technology (ARIST) paper.
- Author
-
Dedema, Meredith and Rosenbaum, Howard
- Subjects
INFORMATION science ,TECHNOLOGY ,CORPORATE culture ,ALGORITHMS ,ECONOMICS - Abstract
The gig economy and gig work have grown quickly in recent years and have drawn much attention from researchers in different fields. Because the platform mediated gig economy is a relatively new phenomenon, studies have produced a range of interesting findings; of interest here are the socio‐technical issues that this work has surfaced. This systematic literature review (SLR) provides a snapshot of a range of socio‐technical issues raised in the last 12 years of literature focused on the platform mediated gig economy. Based on a sample of 515 papers gathered from nine databases in multiple disciplines, 132 were coded that specifically studied the gig economy, gig work, and gig workers. Three main socio‐technical themes were identified: (1) the digital workplace, which includes information infrastructure and digital labor that are related to the nature of gig work and the user agency; (2) algorithmic management, which includes platform governance, performance management, information asymmetry, power asymmetry, and system manipulation, relying on a diverse set of technological tools including algorithms and big data analytics; (3) ethical design, as a relevant value set that gig workers expect from the platform, which includes trust, fairness, equality, privacy, and transparency. A social informatics perspective is used to rethink the relationship between gig workers and platforms, extract the socio‐technical issues noted in prior research, and discuss the underexplored aspects of the platform mediated gig economy. The results draw attention to understudied yet critically important socio‐technical issues in the gig economy that suggest short‐ and long‐term opportunities for future research directions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. Full wave function cloning for improving convergence of the multiconfigurational Ehrenfest method: Tests in the zero-temperature spin-boson model regime.
- Author
-
Brook, Ryan, Symonds, Christopher, and Shalashilin, Dmitrii V.
- Subjects
QUANTUM theory ,TEST methods ,ALGORITHMS - Abstract
In this paper, we report a new algorithm for creating an adaptive basis set in the Multiconfigurational Ehrenfest (MCE) method, which is termed Full Cloning (FC), and test it together with the existing Multiple Cloning (MC) using the spin-boson model at zero-temperature as a benchmark. The zero-temperature spin-boson regime is a common hurdle in the development of methods that seek to model quantum dynamics. Two versions of MCE exist. We demonstrate that MC is vital for the convergence of MCE version 2 (MCEv2). The first version (MCEv1) converges much better than MCEv2, but FC improves its convergence in a few cases where it is hard to converge it with the help of a reasonably small size of the basis set. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
6. Optimization of Texture Rendering of 3D Building Model Based on Vertex Importance.
- Author
-
Shen, Wenfei, Huo, Liang, Shen, Tao, Zhang, Miao, and Li, Yucai
- Subjects
TEXTURE mapping ,DATA modeling ,CURVATURE ,ALGORITHMS - Abstract
In 3D building models, a large number of texture maps with different sizes increase the number of model data loading and drawing batches, which greatly reduces the drawing efficiency of the model. Therefore, this paper proposes a texture set mapping method based on vertex importance. Firstly, based on the 2D space boxing algorithm, the texture maps are merged and a series of Mipmap texture maps are generated, and then the vertex curvature, texture variability and location information of each vertex are calculated, normalized, and weighted to get the importance of each vertex, and then finally, different Mipmap-level textures are remapped according to the importance of the vertices. The experiment proves that the algorithm in this paper can reduce the amount of texture data on the one hand, and avoid the rendering pressure brought by the still large amount of data after merging on the other hand, so as to improve the rendering efficiency of the model. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
7. Discussion paper: implications for the further development of the successfully in emergency medicine implemented AUD2IT-algorithm.
- Author
-
Przestrzelski, Christopher, Jakob, Antonina, Jakob, Clemens, and Hoffmann, Felix R.
- Subjects
DOCUMENTATION ,CURRICULUM ,HUMAN services programs ,EMERGENCY medicine ,EXPERIENCE ,MEDICAL records ,ELECTRONIC publications ,ALGORITHMS ,PATIENTS' attitudes - Abstract
The AUD2IT-algorithm is a tool to structure the data, which is collected during an emergency treatment. The goal is on the one hand to structure the documentation of the data and on the other hand to give a standardised data structure for the report during handover of an emergency patient. AUD2IT-algorithm was developed to provide residents a documentation aid, which helps to structure the medical reports without getting lost in unimportant details or forgetting important information. The sequence of anamnesis, clinical examination, considering a differential diagnosis, technical diagnostics, interpretation and therapy is rather an academic classification than a description of the real workflow. In a real setting, most of these steps take place simultaneously. Therefore, the application of the AUD2IT-algorithm should also be carried out according to the real processes. A big advantage of the AUD2IT-algorithm is that it can be used as a structure for the entire treatment process and also is entirely usable as a handover protocol within this process to make sure, that the existing state of knowledge is ensured at each point of a team-timeout. PR-E-(AUD2IT)-algorithm makes it possible to document a treatment process that, in principle, does not have to be limited to the field of emergency medicine. Also, in the outpatient treatment the PR-E-(AUD2IT)-algorithm could be used and further developed. One example could be the preparation and allocation of needed resources at the general practitioner. The algorithm is a standardised tool that can be used by healthcare professionals of any level of training. It gives the user a sense of security in their daily work. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. Millimeter-Wave Radar-Based Identity Recognition Algorithm Built on Multimodal Fusion.
- Author
-
Guo, Jian, Wei, Jingpeng, Xiang, Yashan, and Han, Chong
- Subjects
FEATURE extraction ,HEART rate monitors ,ALGORITHMS ,SIGNAL-to-noise ratio - Abstract
Millimeter-wave radar-based identification technology has a wide range of applications in persistent identity verification, covering areas such as security production, healthcare, and personalized smart consumption systems. It has received extensive attention from the academic community due to its advantages of being non-invasive, environmentally insensitive and privacy-preserving. Existing identification algorithms mainly rely on a single signal, such as breathing or heartbeat. The reliability and accuracy of these algorithms are limited due to the high similarity of breathing patterns and the low signal-to-noise ratio of heartbeat signals. To address the above issues, this paper proposes an algorithm for multimodal fusion for identity recognition. This algorithm extracts and fuses features derived from phase signals, respiratory signals, and heartbeat signals for identity recognition purposes. The spatial features of signals with different modes are first extracted by the residual network (ResNet), after which these features are fused with a spatial-channel attention fusion module. On this basis, the temporal features are further extracted with a time series-based self-attention mechanism. Finally, the feature vectors of the user's vital sign modality are obtained to perform identity recognition. This method makes full use of the correlation and complementarity between different modal signals to improve the accuracy and reliability of identification. Simulation experiments show that the algorithm identity recognition proposed in this paper achieves an accuracy of 94.26% on a 20-subject self-test dataset, which is much higher than that of the traditional algorithm, which is about 85%. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. A Multi-Metric Model for analyzing and comparing extractive text summarization approaches and algorithms on scientific papers.
- Author
-
DURSUN, Mehmet Ali and SERTTAŞ, Soydan
- Subjects
TEXT summarization ,EDUCATION research ,ALGORITHMS ,AUTOMATIC summarization ,STATISTICS - Abstract
In today's world, where data and information are increasingly proliferating, text summarization and technologies play a critical role in making large amounts of text data more accessible and meaningful. In business, the news industry, academic research, and many other fields, text summarization helps make quick decisions, access information faster, and manage resources more effectively. Additionally, text summarization research is conducted to further improve these technologies and develop new methods and algorithms to provide better summarization of texts. Therefore, text summarization and research in this field are of great importance in the information age. In this study, a new operating model for text summarization that can be applied to different algorithms is proposed and evaluated. Sixteen summarization algorithms covering six approaches (statistical, graph-based, content-based, pointer-based, position-based, and user-oriented) were implemented and tested on 50 different full-text article datasets. Four evaluation criteria (BLEU, Rouge-N, Rouge-L, METEOR) were used to assess the similarity between the generated summaries and the original summaries. The performance of the algorithms within each approach was averaged and the overall best-performing algorithm was selected. This best algorithm was subjected to further analysis through Topic Modelling and Keyword Extraction to identify key topics and keywords within the summarised text. The proposed model provides a standardized workflow for developing and thoroughly testing summarization algorithms across datasets and evaluation metrics to determine the most appropriate summarization approach. This study demonstrates the effectiveness of the model on a variety of algorithm types and text sources. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
10. Performance Evaluation of the Extractive Methods in Automatic Text Summarization Using Medical Papers.
- Author
-
Kus, Anil and Aci, Cigdem Inan
- Subjects
PERFORMANCE evaluation ,TEXT summarization ,MEDICAL sciences ,ALGORITHMS ,SEMANTICS - Abstract
Copyright of Gazi Journal of Engineering Sciences (GJES) / Gazi Mühendislik Bilimleri Dergisi is the property of Gazi Journal of Engineering Sciences and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2023
- Full Text
- View/download PDF
11. Special issue "Discrete optimization: Theory, algorithms and new applications".
- Author
-
Werner, Frank
- Subjects
MATHEMATICAL optimization ,METAHEURISTIC algorithms ,ONLINE algorithms ,LINEAR matrix inequalities ,ALGORITHMS ,ROBUST stability analysis ,NONLINEAR integral equations - Abstract
This document is an editorial for a special issue of the journal AIMS Mathematics on the topic of discrete optimization. The issue includes 21 papers covering a range of subjects, including molecular trees, network systems, variational inequality problems, scheduling, image restoration, spectral clustering, integral equations, convex functions, graph products, optimization algorithms, air quality prediction, humanitarian planning, inertial methods, neural networks, transportation problems, emotion identification, fixed-point problems, structural engineering design, single machine scheduling, and ensemble learning. The papers present new theoretical results, algorithms, and applications in these areas. The guest editor expresses gratitude to the journal staff and reviewers and hopes that readers will find inspiration for their own research. [Extracted from the article]
- Published
- 2024
- Full Text
- View/download PDF
12. A review on over-sampling techniques in classification of multi-class imbalanced datasets: insights for medical problems.
- Author
-
Yuxuan Yang, Khorshidi, Hadi Akbarzadeh, and Aickelin, Uwe
- Subjects
DATABASE management ,PREDICTION models ,MEDICAL informatics ,STATISTICAL sampling ,ARTIFICIAL intelligence ,RESEARCH bias ,MACHINE learning ,ALGORITHMS - Abstract
There has been growing attention to multi-class classification problems, particularly those challenges of imbalanced class distributions. To address these challenges, various strategies, including data-level re-sampling treatment and ensemble methods, have been introduced to bolster the performance of predictive models and Artificial Intelligence (AI) algorithms in scenarios where excessive level of imbalance is present. While most research and algorithm development have been focused on binary classification problems, in health informatics there is an increased interest in the field to address the problem of multi-class classification in imbalanced datasets. Multi-class imbalance problems bring forth more complex challenges, as a delicate approach is required to generate synthetic data and simultaneously maintain the relationship between the multiple classes. The aim of this review paper is to examine over-sampling methods tailored for medical and other datasets with multi-class imbalance. Out of 2,076 peer-reviewed papers identified through searches, 197 eligible papers were chosen and thoroughly reviewed for inclusion, narrowing to 37 studies being selected for in-depth analysis. These studies are categorised into four categories: metric, adaptive, structure-based, and hybrid approaches. The most significant finding is the emerging trend toward hybrid resampling methods that combine the strengths of various techniques to effectively address the problem of imbalanced data. This paper provides an extensive analysis of each selected study, discusses their findings, and outlines directions for future research. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. Lane Attribute Classification Based on Fine-Grained Description.
- Author
-
He, Zhonghe, Gong, Pengfei, Ye, Hongcheng, and Gan, Zizheng
- Subjects
TRAFFIC monitoring ,ROAD markings ,PROBLEM solving ,ANNOTATIONS ,ALGORITHMS ,INTELLIGENT transportation systems - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
14. Target Detection on Water Surfaces Using Fusion of Camera and LiDAR Based Information.
- Author
-
Li, Yongguo, Wang, Yuanrong, Xie, Jia, Xu, Caiyin, and Zhang, Kun
- Subjects
LIDAR ,AUTONOMOUS vehicles ,WATER use ,DETECTORS ,ALGORITHMS - Abstract
To address the challenges of missed detections in water surface target detection using solely visual algorithms in unmanned surface vehicle (USV) perception, this paper proposes a method based on the fusion of visual and LiDAR point-cloud projection for water surface target detection. Firstly, the visual recognition component employs an improved YOLOv7 algorithm based on a self-built dataset for the detection of water surface targets. This algorithm modifies the original YOLOv7 architecture to a Slim-Neck structure, addressing the problem of excessive redundant information during feature extraction in the original YOLOv7 network model. Simultaneously, this modification simplifies the computational burden of the detector, reduces inference time, and maintains accuracy. Secondly, to tackle the issue of sample imbalance in the self-built dataset, slide loss function is introduced. Finally, this paper replaces the original Complete Intersection over Union (CIoU) loss function with the Minimum Point Distance Intersection over Union (MPDIoU) loss function in the YOLOv7 algorithm, which accelerates model learning and enhances robustness. To mitigate the problem of missed recognitions caused by complex water surface conditions in purely visual algorithms, this paper further adopts the fusion of LiDAR and camera data, projecting the three-dimensional point-cloud data from LiDAR onto a two-dimensional pixel plane. This significantly reduces the rate of missed detections for water surface targets. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. USVs Path Planning for Maritime Search and Rescue Based on POS-DQN: Probability of Success-Deep Q-Network.
- Author
-
Liu, Lu, Shan, Qihe, and Xu, Qi
- Subjects
DEEP reinforcement learning ,RESCUE work ,AUTONOMOUS vehicles ,PROBLEM solving ,ALGORITHMS - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
16. Research on a Recognition Algorithm for Traffic Signs in Foggy Environments Based on Image Defogging and Transformer.
- Author
-
Liu, Zhaohui, Yan, Jun, and Zhang, Jinzhao
- Subjects
TRAFFIC signs & signals ,TRAFFIC monitoring ,ALGORITHMS ,AUTONOMOUS vehicles - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
17. Online Social Network Information Source Identification Algorithm Based on Multi-Attribute Topological Clustering.
- Author
-
Dong, Ming, Lu, Yujuan, Tan, Zhenhua, and Zhang, Bin
- Subjects
ONLINE social networks ,INFORMATION resources ,INFORMATION networks ,INFORMATION dissemination ,ALGORITHMS ,IDENTIFICATION - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
18. Privacy-Preserving Federated Deep Learning Diagnostic Method for Multi-Stage Diseases.
- Author
-
Jinbo Yang, Hai Huang, Lailai Yin, Jiaxing Qu, and Wanjuan Xie
- Subjects
ARTIFICIAL neural networks ,MACHINE learning ,INTEGRATED circuits ,DATA privacy ,ALGORITHMS ,NATURAL languages ,DEEP learning - Abstract
Diagnosing multi-stage diseases typically requires doctors to consider multiple data sources, including clinical symptoms, physical signs, biochemical test results, imaging findings, pathological examination data, and even genetic data. When applying machine learning modeling to predict and diagnose multi-stage diseases, several challenges need to be addressed. Firstly, the model needs to handle multimodal data, as the data used by doctors for diagnosis includes image data, natural language data, and structured data. Secondly, privacy of patients' data needs to be protected, as these data contain the most sensitive and private information. Lastly, considering the practicality of the model, the computational requirements should not be too high. To address these challenges, this paper proposes a privacy-preserving federated deep learning diagnostic method for multi-stage diseases. This method improves the forward and backward propagation processes of deep neural network modeling algorithms and introduces a homomorphic encryption step to design a federated modeling algorithm without the need for an arbiter. It also utilizes dedicated integrated circuits to implement the hardware Paillier algorithm, providing accelerated support for homomorphic encryption in modeling. Finally, this paper designs and conducts experiments to evaluate the proposed solution. The experimental results show that in privacy-preserving federated deep learning diagnostic modeling, the method in this paper achieves the same modeling performance as ordinary modeling without privacy protection, and has higher modeling speed compared to similar algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. 基于多目标优化的联邦学习进化.
- Author
-
胡智勇, 于千城, 王之赐, and 张丽丝
- Subjects
FEDERATED learning ,ALGORITHMS ,PRIVACY - Abstract
Copyright of Application Research of Computers / Jisuanji Yingyong Yanjiu is the property of Application Research of Computers Edition and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
- Published
- 2024
- Full Text
- View/download PDF
20. Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits.
- Author
-
Limaye, Nutan, Srinivasan, Srikanth, and Tavenas, Sébastien
- Subjects
ALGEBRA ,POLYNOMIALS ,CIRCUIT complexity ,ALGORITHMS ,DIRECTED acyclic graphs ,LOGIC circuits - Abstract
An Algebraic Circuit for a multivariate polynomial P is a computational model for constructing the polynomial P using only additions and multiplications. It is a syntactic model of computation, as opposed to the Boolean Circuit model, and hence lower bounds for this model are widely expected to be easier to prove than lower bounds for Boolean circuits. Despite this, we do not have superpolynomial lower bounds against general algebraic circuits of depth 3 (except over constant-sized finite fields) and depth 4 (over any field other than F
2 ), while constant-depth Boolean circuit lower bounds have been known since the early 1980s. In this paper, we prove the first superpolynomial lower bounds against algebraic circuits of all constant depths over all fields of characteristic 0. We also observe that our super-polynomial lower bound for constant-depth circuits implies the first deterministic sub-exponential time algorithm for solving the Polynomial Identity Testing (PIT) problem for all small-depth circuits using the known connection between algebraic hardness and randomness. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
21. A modified memetic algorithm with multi-operation precise joint movement neighbourhood structure for the assembly job shop scheduling problem.
- Author
-
Ba, Zhiyong, Yuan, Yiping, and Liu, Jinduo
- Subjects
PRODUCTION scheduling ,RANGE of motion of joints ,NEIGHBORHOODS ,ADAPTIVE control systems ,ALGORITHMS - Abstract
This paper presents an adaptive memetic algorithm based on a new neighbourhood structure (AMA) for solving the assembly job shop scheduling problem, with the aim of minimising the maximum completion time (makespan). To utilise the knowledge of problem, a theoretical analysis is conducted to explore the criteria for feasible and effective movement of operations under assembly constraints, and a multi-operation precise joint movement neighbourhood structure is proposed accordingly. In the AMA, to ensure the feasibility of solutions during the evolution process, a feasible encoding mechanism based on the constraint degree of operations is designed, a greedy active decoding method as well as feasible crossover operation based on independent operation chains are designed specifically for this encoding method. To avoid premature convergence of the population, a population update operator with diversity adaptive control is proposed. Finally, by comparing the results with five state-of-the-art algorithms, the superiority of AMA in terms of solution quality and stability is verified, particularly with the update of known optimal solutions for 11 instances. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
22. The Space Complexity of Consensus from Swap.
- Author
-
Ovens, Sean
- Subjects
ALGORITHMS ,GENERALIZATION - Abstract
Nearly thirty years ago, it was shown that \(\Omega (\sqrt {n})\) read/write registers are needed to solve randomized wait-free consensus among n processes. This lower bound was improved to n registers in 2018, which exactly matches known algorithms. The \(\Omega (\sqrt {n})\) space complexity lower bound actually applies to a class of objects called historyless objects, which includes registers, test-and-set objects, and readable swap objects. However, every known n-process obstruction-free consensus algorithm from historyless objects uses Ω (n) objects. In this paper, we give the first Ω (n) space complexity lower bounds on consensus algorithms for two kinds of historyless objects. First, we show that any obstruction-free consensus algorithm from swap objects uses at least n-1 objects. More generally, we prove that any obstruction-free k-set agreement algorithm from swap objects uses at least \(\lceil \frac{n}{k}\rceil - 1\) objects. The k-set agreement problem is a generalization of consensus in which processes agree on no more than k different output values. This is the first non-constant lower bound on the space complexity of solving k-set agreement with swap objects when k > 1. We also present an obstruction-free k-set agreement algorithm from n-k swap objects, which exactly matches our lower bound when k=1. Second, we show that any obstruction-free binary consensus algorithm from readable swap objects with domain size b uses at least \(\frac{n-2}{3b+1}\) objects. When b is a constant, this asymptotically matches the best known obstruction-free consensus algorithms from readable swap objects with unbounded domains. Since any historyless object can be simulated by a readable swap object with the same domain, our results imply that any obstruction-free consensus algorithm from historyless objects with domain size b uses at least \(\frac{n-2}{3b+1}\) objects. For b = 2, we show a slightly better lower bound of n-2. There is an obstruction-free binary consensus algorithm using 2n-1 readable swap objects with domain size 2, asymptotically matching our lower bound. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
23. A review paper of optimal resource allocation algorithm in cloud environment.
- Author
-
Patadiya, Namrata and Bhatt, Nirav
- Subjects
RESOURCE allocation ,LITERATURE reviews ,SERVICE level agreements ,ALGORITHMS ,ELECTRONIC data processing ,CLOUD computing - Abstract
Cloud computing has become a popular approach for processing data and running computationally expensive services on a pay-as-you-go basis. Due to the ever-increasing requirement for cloud-based apps, appropriately allocating resources according to user requests while meeting service-level agreements between customers and service providers has become increasingly complex. An efficient and versatile resource allocation method is required to properly deploy these assets and meet user needs. The technique of distributing resources has become more arduous as user demand has increased. One of the key areas of research experts is how to design optimal solutions for this approach. In this paper, a literature review on proposed dynamic resource allocation approaches is introduced. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
24. Research on Denoising Algorithm of Composite Thermal Wave Detection Image Based on Improved Total Variation.
- Author
-
Shen, Xuehui and Huang, Qingjiu
- Subjects
IMAGE denoising ,IMAGE intensifiers ,COMPUTER vision ,ALGORITHMS ,HOUGH transforms ,INFORMATION filtering ,RECOMMENDER systems - Abstract
How to improve the high resolution and remove the noise of composite infrared thermal wave detection image have become important research topics in machine vision. Therefore, this paper proposes a composite image enhancement algorithm based on edge adaptive total variation of direction. Using the improved adaptive directional total variation model to construct the guidance image of the guidance filter can provide better structural information for the guidance filter and conduct the guidance filter. This process is iterated to eliminate noise and ladder effect. Experimental results show that this algorithm is superior to other advanced methods in objective evaluation index and subjective vision. The algorithm proposed in this paper can not only effectively eliminate noise and ladder effect, but also highlight image details and structure information, which proves the effectiveness of this algorithm. Discover the cutting-edge algorithm for high-resolution improvement and noise elimination in infrared thermal wave detection images. Our innovative composite image enhancement technique, based on edge adaptive total variation, outperforms traditional methods. The improved directional model provides better structural information, optimizing the guidance filter process. Experimental results reveal its superiority in objective evaluation and subjective vision. This algorithm effectively eliminates noise and ladder effect while highlighting image details, validating its remarkable effectiveness. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
25. Efficient and Effective Academic Expert Finding on Heterogeneous Graphs through (k, P)-Core based Embedding.
- Author
-
YUXIANG WANG, JUN LIU, XIAOLIANG XU, XIANGYU KE, TIANXING WU, and XIAOXUAN GOU
- Subjects
COMMUNITIES ,SEMANTICS ,ALGORITHMS - Abstract
Expert finding is crucial for a wealth of applications in both academia and industry. Given a user query and trove of academic papers, expert finding aims at retrieving the most relevant experts for the query, from the academic papers. Existing studies focus on embedding-based solutions that consider academic papers’ textual semantic similarities to a query via document representation and extract the top-n experts from the most similar papers. Beyond implicit textual semantics, however, papers’ explicit relationships (e.g., co-authorship) in a heterogeneous graph (e.g., DBLP) are critical for expert finding, because they help improve the representation quality. Despite their importance, the explicit relationships of papers generally have been ignored in the literature. In this article, we study expert finding on heterogeneous graphs by considering both the explicit relationships and implicit textual semantics of papers in one model. Specifically, we define the cohesive (k, P)-core community of papers w.r.t. a meta-path P (i.e., relationship) and propose a (k, P)-core based document embedding model to enhance the representation quality. Based on this, we design a proximity graph-based index (PGIndex) of papers and present a threshold algorithm (TA)-based method to efficiently extract top-n experts from papers returned by PG-Index. We further optimize our approach in two ways: (1) we boost effectiveness by considering the (k, P)-core community of experts and the diversity of experts’ research interests, to achieve high-quality expert representation from paper representation; and (2) we streamline expert finding, going from “extract top-n experts from top-m (m > n) semantically similar papers” to “directly return top-n experts”. The process of returning a large number of top-m papers as intermediate data is avoided, thereby improving the efficiency. Extensive experiments using real-world datasets demonstrate our approach’s superiority. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
26. Blinded by "algo economicus": Reflecting on the assumptions of algorithmic management research to move forward.
- Author
-
Lamers, Laura, Meijerink, Jeroen, and Rettagliata, Giorgio
- Subjects
PERSONNEL management ,REFLECTION (Philosophy) ,MEDICAL research ,MATHEMATICAL models ,ECONOMIC impact ,CONCEPTUAL structures ,ONTOLOGIES (Information retrieval) ,THEORY ,ALGORITHMS ,MANAGEMENT ,ECONOMICS - Abstract
This paper reflects on the paradigmatic assumptions and ideologies that have shaped algorithmic management research. We identify two sets of assumptions: one about the "ontology of algorithms" (which holds that human resource management [HRM] algorithms are non‐human entities with material agency) and one about the "ontology of management" that HRM algorithms afford (which understands algorithmic management as a form of control for maximizing economic/shareholder value). We explain how these core assumptions underpin existing research of HRM algorithms, causing blind spots that hinder new ways of understanding and studying algorithmic management. After identifying and unpacking the assumptions and blind spots, we offer avenues to overcome these blind spots, allowing for future research based on new ideological assumption grounds that will help move algorithmic management scholarship further in significant ways. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. A simple one-electron expression for electron rotational factors.
- Author
-
Qiu, Tian, Bhati, Mansi, Tao, Zhen, Bian, Xuezhi, Rawlinson, Jonathan, Littlejohn, Robert G., and Subotnik, Joseph E.
- Subjects
ELECTRONS ,ALGORITHMS ,WISHES ,MATRICES (Mathematics) - Abstract
Within the context of fewest-switch surface hopping (FSSH) dynamics, one often wishes to remove the angular component of the derivative coupling between states J and K . In a previous set of papers, Shu et al. [J. Phys. Chem. Lett. 11, 1135–1140 (2020)] posited one approach for such a removal based on direct projection, while we isolated a second approach by constructing and differentiating a rotationally invariant basis. Unfortunately, neither approach was able to demonstrate a one-electron operator O ̂ whose matrix element J O ̂ K was the angular component of the derivative coupling. Here, we show that a one-electron operator can, in fact, be constructed efficiently in a semi-local fashion. The present results yield physical insight into designing new surface hopping algorithms and are of immediate use for FSSH calculations. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. Minimising total weighted completion time for semi-online single machine scheduling with known arrivals and bounded processing times.
- Author
-
Nouinou, Hajar, Arbaoui, Taha, and Yalaoui, Alice
- Subjects
SCHEDULING ,MACHINERY ,ALGORITHMS - Abstract
This paper addresses the semi-online scheduling problem of minimising the total weighted completion time on a single machine, where a combination of information on jobs release dates and processing times is considered. In this study, jobs can only arrive at known future times and a lower bound on jobs processing times is known in advance. A new semi-online algorithm is presented and is shown to be the best possible for the considered problem. In order to make this statement, a new lower bound on the competitive ratio of any semi-online algorithm for the problem is developed and, using competitive analysis, the proposed semi-online algorithm is shown to have a competitive ratio that matches the lower bound. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm.
- Author
-
Paredes-Astudillo, Yenny Alexandra, Botta-Genoulaz, Valérie, and Montoya-Torres, Jairo R.
- Subjects
SIMULATED annealing ,PRODUCTION scheduling ,SCHEDULING ,ALGORITHMS ,SCHOOL schedules - Abstract
Inspired by real-life applications, mainly in hand-intensive manufacturing, the incorporation of learning effects into scheduling problems has garnered attention in recent years. This paper deals with the flowshop scheduling problem with a learning effect, when minimising the makespan. Four approaches to model the learning effect, well-known in the literature, are considered. Mathematical models are providing for each case. A solver allows us to find the optimal solution in small problem instances, while a Simulated Annealing algorithm is proposed to deal with large problem instances. In the latter, the initial solution is obtained using the well-known Nawaz-Enscore-Ham algorithm, and two local search operators are evaluated. Computational experiments are carried out using benchmark datasets from the literature. The Simulated Annealing algorithm shows a better result for learning approaches with fast learning effects as compared to slow learning effects. Finally, for industrial decision makers, some insights about how the learning effect model might affect the makespan minimisation flowshop scheduling problem are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Digitalized Control Algorithm of Bridgeless Totem-Pole PFC with a Simple Control Structure Based on the Phase Angle.
- Author
-
Lee, Gi-Young, Park, Hae-Chan, Ji, Min-Woo, and Kim, Rae-Young
- Subjects
ELECTRIC current rectifiers ,ELECTRONIC paper ,PHASE-locked loops ,ALGORITHMS ,ANGLES ,VOLTAGE - Abstract
Compared to the conventional boost power factor correction (PFC) converter, a totem-pole bridgeless PFC has high efficiency because it does not have an input diode rectifier stage, but a current spike may occur when the polarity of the grid voltage changes. This paper proposes a digital control algorithm for bridgeless totem-pole PFC with a simple control structure based on the phase angle of grid voltage. The proposed algorithm has a PI-based double-loop control structure and performs DC-link voltage and input inductor current control. Rectifying switches operate based on the proposed rectification algorithm using phase angle information calculated through a single-phase phase-locked loop (PLL) to prevent current spikes. The feed-forward duty ratio value is calculated according to the polarity of the grid voltage and added to the double-loop controller to perform appropriate power factor control. The performance and feasibility of the proposed control algorithm are verified through a 3 kW hardware prototype. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
31. A multi-channel spatial information feature based human pose estimation algorithm.
- Author
-
Xie, Yinghong, Hao, Yan, Han, Xiaowei, Gao, Qiang, and Yin, Biao
- Subjects
COMPUTER vision ,FIX-point estimation ,HUMAN body ,ALGORITHMS ,HUMAN beings - Abstract
Human pose estimation is an important task in computer vision, which can provide key point detection of human body and obtain bone information. At present, human pose estimation is mainly utilized for detection of large targets, and there is no solution for detection of small targets. This paper proposes a multi-channel spatial information feature based human pose (MCSF-Pose) estimation algorithm to address the issue of medium and small targets inaccurate detection of human key points in scenarios involving occlusion and multiple poses. The MCSF-Pose network is a bottom-up regression network. Firstly, an UP-Focus module is designed to expand the feature information while reducing parameter computation during the up-sampling process. Then, the channel segmentation strategy is adopted to cut the features, and the feature information of multiple dimensions is retained through different convolutional groups, which reduces the parameter lightweight network model and makes up for the loss of the feature information associated with the depth of the network. Finally, the three-layer PANet structure is designed to reduce the complexity of the model. With the aid of the structure, it also to improve the detection accuracy and anti-interference ability of human key points. The experimental results indicate that the proposed algorithm outperforms YOLO-Pose and other human pose estimation algorithms on COCO2017 and MPII human pose datasets. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Evaluation and Improvement of a CALIPSO-Based Algorithm for Cloud Base Height in China.
- Author
-
Li, Ruolin and Ma, Xiaoyan
- Subjects
CLOUD computing ,LIDAR ,ALGORITHMS ,AEROSOLS ,ALTITUDES ,TROPOSPHERIC aerosols - Abstract
Clouds are crucial in regulating the Earth's energy budget. Global cloud top heights have been easily retrieved from satellite measurements, but there are few methods for determining cloud base height (CBH) from satellite measurements. The Cloud Base Altitude Spatial Extrapolator (CBASE) algorithm was proposed to derive the height of the lower-troposphere liquid cloud base by using the Cloud-Aerosol Lidar with Orthogonal polarization cloud aerosol LiDAR (CALIOP) profiles and weather observations at airports from aviation routine and special weather report (METARs and SPECIs, called METAR) observation data in the United States. A modification to the CBASE algorithm over China (CNMETAR-CBASE) is presented in this paper. In this paper, the ability of the CBASE algorithm to calculate CBH in China is evaluated, and METAR observations over China (CNMETAR) were then used to modify the CBASE algorithm. The results including CNMETAR observation data in China can better retrieve CBH over China compared with the results using the original CBASE algorithm, and the accuracy of the global CBH results has been improved. Overestimations of CBH with the original algorithm range from 500 to 800 m in China, which have been reduced to about 300 m with an improved algorithm. The deviations calculated by the algorithm also have a significant reduction, from 480 m (CBASE) to 420 m (CNMETAR-CBASE). In conclusion, the modified CBASE algorithm not only calculates the CBH more accurately in China but also improves the results of the global CBH retrieved from satellites. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. End-to-End Autonomous Driving Decision Method Based on Improved TD3 Algorithm in Complex Scenarios.
- Author
-
Xu, Tao, Meng, Zhiwei, Lu, Weike, and Tong, Zhongwen
- Subjects
DECISION making ,ALGORITHMS ,CRITICS ,CAMERAS ,SPEED - Abstract
The ability to make informed decisions in complex scenarios is crucial for intelligent automotive systems. Traditional expert rules and other methods often fall short in complex contexts. Recently, reinforcement learning has garnered significant attention due to its superior decision-making capabilities. However, there exists the phenomenon of inaccurate target network estimation, which limits its decision-making ability in complex scenarios. This paper mainly focuses on the study of the underestimation phenomenon, and proposes an end-to-end autonomous driving decision-making method based on an improved TD3 algorithm. This method employs a forward camera to capture data. By introducing a new critic network to form a triple-critic structure and combining it with the target maximization operation, the underestimation problem in the TD3 algorithm is solved. Subsequently, the multi-timestep averaging method is used to address the policy instability caused by the new single critic. In addition, this paper uses Carla platform to construct multi-vehicle unprotected left turn and congested lane-center driving scenarios and verifies the algorithm. The results demonstrate that our method surpasses baseline DDPG and TD3 algorithms in aspects such as convergence speed, estimation accuracy, and policy stability. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. An improved weighted KNN fingerprint positioning algorithm.
- Author
-
Chen, Bohang, Ma, Jun, Zhang, Lingfei, Xiong, Zhuang, Fan, Jinyu, and Lan, Haiming
- Subjects
KALMAN filtering ,FINGERPRINT databases ,ACQUISITION of data ,ALGORITHMS ,HUMAN fingerprints - Abstract
Aiming at the received signal strength index (RSSI) in wireless positioning system, an improved weighted KNN fingerprint positioning algorithm is proposed in this paper. The algorithm pre-processes fingerprint data in offline stage that including eliminating outliers and Kalman filtering first, in order to improve the accuracy of data acquisition. Secondly, the fingerprint data is partitioned by using RSSI to attenuate obstacles such as walls. Then, points with significant RSSI differences in each region are selected as regional feature points, and the distance between RSSI of test points and feature points in each region is calculated respectively to determine the region in which the test points are located. Geometric method is used to analyse and define the correlation degree, and KNN is re-weighted to achieve accurate positioning in the region. Finally, experiments were carried out in the indoor environment to complete the establishment of the fingerprint database. Compared with the existing NN, KNN and WKNN, the experimental analysis results show that the accumulated error and average error are better than the traditional algorithm with the increase of measurement points, which has reference value for the complex environment positioning technology. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
35. FOE-NER: fish disease event extraction algorithm based on pseudo trigger words and event element data enhancement.
- Author
-
Fu, Qingcai, Zhang, Sijia, Zhang, Zhenglong, An, Zongshi, Li, Zhenglin, Wang, Yihan, and Liu, Jianing
- Subjects
FISH diseases ,NOISE ,AQUACULTURE ,ALGORITHMS ,CLASSIFICATION - Abstract
In response to the challenges of accurately identifying event triggers and elements in long texts related to aquaculture, existing models struggle to differentiate between elements and triggers, as well as effectively recognize complete entity texts. To tackle this issue, this study proposes an algorithm for extracting fish disease events based on pseudo triggers and augmented event element data. The method starts by constructing pseudo samples using the original dataset. Two types of noise datasets are then generated: a trigger noise dataset constructed based on fish disease triggers and an entity noise dataset with varying levels of entity noise constructed based on fish disease entities. Next, three parallel neural networks are deployed to extract sample features from these datasets. The fish disease event extraction for the source dataset employs multi-label classification. For the trigger noise dataset, the sample features are activated using the sigmoid function, and the MRSE loss is utilized for optimization of this branch. For the entity noise dataset, the sample features are activated using the Relu function, and the XOR loss is used for optimization. Finally, the losses from the three branches are combined with weighted summation to obtain the fusion loss. The experimental results on the fish disease dataset used in this paper show that the proposed algorithm achieves an average accuracy of 78.71%, 78.95%, and 79.43% on F1, recall, and precision, respectively, which is a maximum improvement of 11.201%, 11.849%, and 12.421% in accuracy with respect to the baseline model on F1, recall, and precision, respectively. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. A novel similarity algorithm for triangular cloud models based on exponential closeness and cloud drop variance.
- Author
-
Yang, Jianjun, Han, Jiahao, Wan, Qilin, Xing, Shanshan, and Shi, Hongbo
- Subjects
VALUE engineering ,ALGORITHMS ,CLASSIFICATION algorithms ,MODEL theory ,MICROGRIDS ,SECURITY systems - Abstract
Cloud model similarity algorithm is an important part of cloud modelling theory. Most of the existing cloud model similarity algorithms suffer from poor discriminability, poor classification, unstable results, and low time efficiency. In this paper, a new similarity algorithm is proposed that considers the triangular cloud model distance and shape. First, according to the D T distance formula, a new exponential closeness measure is defined, with which the distance similarity of cloud models is characterized. Then, the shape similarity is calculated according to the variance of the cloud model cloud drops. Finally, the two similarities are synthesized to define a similarity algorithm for determining the distance from the D T distance formula and shape based on the triangular cloud model (DD
T STCM). In this paper, discriminability, stability, efficiency and theoretical interpretability are taken as the evaluation indices. Equipment security system capability evaluation experiment, cloud model differentiation simulation experiment and time series classification accuracy experiment are set up to verify the effectiveness of the algorithm in terms of the four above aspects. The experimental results show that DDT STCM has good differentiation and excellent classification effects. In the classification experiment for the time series, the average classification accuracy of DDT STCM reaches 91.78%, which is at least 2.78% higher than those of the other seven commonly used algorithms. The CPU running efficiency of DDT STCM is also extremely high, and the average CPU running time of group training is always on the order of milliseconds, which effectively reduces the time cost. Finally, a case study is conducted to analyse a risk assessment problem for China's island microgrid industry, and the evaluation results based on DDT STCM are in line with human cognition and have good value for engineering applications. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
37. Small target detection algorithm based on multi-branch stacking and new sampling transition module.
- Author
-
Lin, Qingyao, Wang, Rugang, Wang, Yuanyuan, and Zhou, Feng
- Subjects
PIXELS ,ALGORITHMS ,SAMPLING (Process) ,TRACKING algorithms - Abstract
Aiming at the problem that the SSD algorithm does not fully extract the feature information contained in each feature layer, as well as the feature information is easily lost during the sampling process, which makes the feature expression ineffective and leads to insufficient performance in small target detection. In this paper, AMT-SSD is proposed, a small target detection algorithm that incorporates the multi-branch stacking and new sampling transition module of the attention mechanism. In this algorithm, the composite attention mechanism is utilized to improve the correlation of features of the samples to be detected in terms of spatial and channels, and the efficiency of the algorithm; secondly, multi-branch stacking module is used to extract multi-size features for each feature layer, and different sizes of convolution kernels are utilized in parallel to fully extract their features and improve the expression of features; meanwhile, during the sampling process, the problem of missing features is solved by applying inverse subpixel convolution in the new sampling transition module. Experimentally, the AMT-SSD algorithm achieves 84.6% and 53.4% mAP metrics on the PASCAL VOC dataset and MS COCO dataset, respectively. This indicates that the AMT-SSD algorithm can effectively extract feature information that is beneficial to detection samples, and also performs well in reducing feature loss, which is effective for the algorithm to improve the algorithm on small targets. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. IRBEVF-Q: Optimization of Image–Radar Fusion Algorithm Based on Bird's Eye View Features.
- Author
-
Cai, Ganlin, Chen, Feng, and Guo, Ente
- Subjects
OBJECT recognition (Computer vision) ,ALGORITHMS ,VIDEO coding ,AUTONOMOUS vehicles ,CAMERAS ,PROBLEM solving - Abstract
In autonomous driving, the fusion of multiple sensors is considered essential to improve the accuracy and safety of 3D object detection. Currently, a fusion scheme combining low-cost cameras with highly robust radars can counteract the performance degradation caused by harsh environments. In this paper, we propose the IRBEVF-Q model, which mainly consists of BEV (Bird's Eye View) fusion coding module and an object decoder module.The BEV fusion coding module solves the problem of unified representation of different modal information by fusing the image and radar features through 3D spatial reference points as a medium. The query in the object decoder, as a core component, plays an important role in detection. In this paper, Heat Map-Guided Query Initialization (HGQI) and Dynamic Position Encoding (DPE) are proposed in query construction to increase the a priori information of the query. The Auxiliary Noise Query (ANQ) then helps to stabilize the matching. The experimental results demonstrate that the proposed fusion model IRBEVF-Q achieves an NDS of 0.575 and a mAP of 0.476 on the nuScenes test set. Compared to recent state-of-the-art methods, our model shows significant advantages, thus indicating that our approach contributes to improving detection accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. Image inpainting algorithm based on double curvature-driven diffusion model with P-Laplace operator.
- Author
-
Xiao, Lifang and Wu, Jianhao
- Subjects
INPAINTING ,PARTIAL differential equations ,ALGORITHMS - Abstract
The method of partial differential equations for image inpainting achieves better repair results and is economically feasible with fast repair time. Addresses the inability of Curvature-Driven Diffusion (CDD) models to repair complex textures or edges when the input image is affected by severe noise or distortion, resulting in discontinuous repair features, blurred detail textures, and an inability to deal with the consistency of global image content, In this paper, we have the CDD model of P-Laplace operator term to image inpainting. In this method, the P-Laplace operator is firstly introduced into the diffusion term of CDD model to regulate the diffusion speed; then the improved CDD model is discretized, and the known information around the broken region is divided into two weighted average iterations to get the inpainting image; finally, the final inpainting image is obtained by weighted averaging the two image inpainting images according to the distancing. Experiments show that the model restoration results in this paper are more rational in terms of texture structure and outperform other models in terms of visualization and objective data. Comparing the inpainting images with 150, 1000 and 100 iterations respectively, Total Variation(TV) model and the CDD model inpainting algorithm always has inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well, TV model and the CDD model inpainting algorithm always have inpainting traces in details, and TV model can't meet the visual connectivity, but the algorithm in this paper can remove the inpainting traces well. Of the images used for testing, the highest PSNR reached 38.7982, SSIM reached 0.9407, and FSIM reached 0.9781, the algorithm not only inpainting the effect and, but also has fewer iterations. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
40. Effect of optical pulse shaping and adaptive equalization on the performance of 100G DP-QPSK WDM system.
- Author
-
Sharma, Neeraj
- Subjects
QUADRATURE phase shift keying ,BACK propagation ,LIGHT filters ,ALGORITHMS - Abstract
Dual polarization quadrature phase shifting keying (DP-QPSK) modulation format along with coherent receiver helps in increasing the data carrying capability of existing optical networks without any major change in existing transmission infrastructure. The various linear and nonlinear fiber effects, frequency and phase errors are corrected in electrical domain at the receiver end with digital back propagation algorithms (DBP) instead of in-line compensation. In such a case the selection of optimum values of system parameters make the task easier for DBP algorithms. This paper highlights the importance of finding optimum operating point of continuous modulus algorithm (CMA) for better adaptive equalization (AE). The paper also discusses the optical pulse shaping using Gaussian optical band-pass filter to improve the spectral characteristics of DP-QPSK signal. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Applying Machine Learning in Marketing: An Analysis Using the NMF and k-Means Algorithms.
- Author
-
Gallego, Victor, Lingan, Jessica, Freixes, Alfons, Juan, Angel A., and Osorio, Celia
- Subjects
K-means clustering ,MACHINE learning ,ARTIFICIAL intelligence ,ADVERTISING effectiveness ,DATABASES - Abstract
The integration of machine learning (ML) techniques into marketing strategies has become increasingly relevant in modern business. Utilizing scientific manuscripts indexed in the Scopus database, this article explores how this integration is being carried out. Initially, a focused search is undertaken for academic articles containing both the terms "machine learning" and "marketing" in their titles, which yields a pool of papers. These papers have been processed using the Supabase platform. The process has included steps like text refinement and feature extraction. In addition, our study uses two key ML methodologies: topic modeling through NMF and a comparative analysis utilizing the k-means clustering algorithm. Through this analysis, three distinct clusters emerged, thus clarifying how ML techniques are influencing marketing strategies, from enhancing customer segmentation practices to optimizing the effectiveness of advertising campaigns. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. Trace Extraction and Repair of the F Layer from Pictorial Ionograms.
- Author
-
Wang, Jiayi, Qiao, Lei, Yan, Chunxiao, Qiu, Zhaoyang, and Wang, Kejie
- Subjects
PARAMETER identification ,ALGORITHMS ,NOISE ,PICTURES - Abstract
Publicly available ionograms are often in the form of pictures. This paper proposes a novel algorithm for extracting and repairing the F layer traces from pictorial ionograms. Extensive efforts have been invested in ionogram autoscaling and critical parameter identification to improve the efficiency of scaling algorithms. To obtain the parameters of the F layer automatically, it is necessary to accurately extract the F layer trace. However, research on F layer trace extraction with repair is relatively limited. The method employed in this study makes full use of the characteristics of different types of echoes on the ionograms, and the procedure includes noise preprocessing, coupling noise processing, and trace repair. To enhance the applicability of the repair, two different automatic filling algorithms are adopted to repair the F layer trace. The aim of this paper is to present an adaptive algorithm to automatically extract and repair F layer traces from different pictorial ionograms. The results of Hainan Fuke ionograms illustrate the reliability of the F layer trace extraction and trace repair. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Research on Additive Manufacturing Path Planning of a Six-Degree-of-Freedom Manipulator.
- Author
-
Han, Xingguo, Liu, Xuan, Wu, Gaofei, Song, Xiaohui, and Cui, Lixiu
- Subjects
PRODUCTION planning ,ALGORITHMS - Abstract
The research on additive manufacturing (AM) path planning mainly focuses on the traditional three-axis AM path planning and five-degree-of-freedom (DOF) AM path planning, while there is less research on six-DOF AM path planning. In the traditional AM path planning algorithm, the filling path is discontinuous and there is long straight-line printing in a certain direction, which can easily lead to warpage deformation. Therefore, in this work, the six-DOF manipulator is taken as the main object to build an AM platform, and the mechanism of AM path planning of the manipulator is studied. The path planning algorithm combining the contour offset filling method and Hilbert curve filling is optimized by using a cubic uniform B-spline curve, and an AM path planning algorithm suitable for a six-DOF manipulator is obtained. A continuous printing path can be generated by this algorithm. It reduces the existence of long straight-line printing in a certain direction, thereby reducing the warpage deformation of the model and improving the molding quality of the model. The traditional three-axis AM device and the six-DOF AM platform were used to print two kinds of models. By comparing the printing time, the six-DOF AM platform was 43.70% and 37.94% shorter than the traditional three-axis AM device. The same model was printed on a six-DOF AM platform by using the parallel scanning filling method, the path planning algorithm combining contour offset and Hilbert curve, and the method proposed in this paper. Through experimental verification, the average warpage deformation of the model printed by the method proposed in this paper was reduced by 37.81% and 13.79%, respectively, compared with the other two methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
44. Research on Unmanned Vehicle Path Planning Based on the Fusion of an Improved Rapidly Exploring Random Tree Algorithm and an Improved Dynamic Window Approach Algorithm.
- Author
-
Wang, Shuang, Li, Gang, and Liu, Boju
- Subjects
AUTONOMOUS vehicles ,STATISTICAL sampling ,ALGORITHMS - Abstract
Aiming at the problem that the traditional rapidly exploring random tree (RRT) algorithm only considers the global path of unmanned vehicles in a static environment, which has the limitation of not being able to avoid unknown dynamic obstacles in real time, and that the traditional dynamic window approach (DWA) algorithm is prone to fall into a local optimum during local path planning, this paper proposes a path planning method for unmanned vehicles that integrates improved RRT and DWA algorithms. The RRT algorithm is improved by introducing strategies such as target-biased random sampling, adaptive step size, and adaptive radius node screening, which enhance the efficiency and safety of path planning. The global path key points generated by the improved RRT algorithm are used as the subtarget points of the DWA algorithm, and the DWA algorithm is optimized through the design of an adaptive evaluation function weighting method based on real-time obstacle distances to achieve more reasonable local path planning. Through simulation experiments, the fusion algorithm shows promising results in a variety of typical static and dynamic mixed driving scenarios, can effectively plan a path that meets the driving requirements of an unmanned vehicle, avoids unknown dynamic obstacles, and shows higher path optimization efficiency and driving stability in complex environments, which provides strong support for an unmanned vehicle's path planning in complex environments. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. Hybrid A*-Based Valley Path Planning Algorithm for Aircraft.
- Author
-
Xue, Tao, Cao, Yueyao, Zhao, Yunmei, Ai, Jianliang, and Dong, Yiqun
- Subjects
DIGITAL maps ,DIGITAL mapping ,ALGORITHMS - Abstract
This paper presents a valley path planning algorithm based on the Hybrid A* algorithm. This algorithm is aimed at finding the valley path for aircraft considering dynamics constraints and terrain limitations. The preliminaries involve the establishment of a 3D workspace based on digital elevation map (DEM) data and addressing methods of valley detection. Following this comprehensive groundwork, the Hybrid A*-based algorithm, employed to determine the valley path within the 3D workspace while accommodating dynamic constraints and terrain limitations, is then introduced. In the experimental test, to validate the effectiveness of the algorithm proposed in this paper, we tested the performance of the proposed algorithm and other three baseline algorithms based on four optimization objectives in three workspaces. The simulated results indicate that the algorithm proposed in this paper can effectively find the valley path while considering dynamic constraints and terrain limitations. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Simultaneous localization and mapping (SLAM)-based robot localization and navigation algorithm.
- Author
-
Qiao, Junfu, Guo, Jinqin, and Li, Yongwei
- Subjects
NAVIGATION ,ROBOTS ,KALMAN filtering ,ALGORITHMS - Abstract
This research paper presents a comprehensive study of the simultaneous localization and mapping (SLAM) algorithm for robot localization and navigation in unknown environments. The SLAM algorithm is a widely used approach for building a map of an environment and estimating the robot's position within it, which is especially useful in dynamic and unstructured environments. The paper discusses various SLAM techniques, including the Kalman filter (KF) and GraphSLAM algorithms, and their use in probabilistic estimation of the robot's position and orientation. The paper also explores different path-planning techniques that can be used with the map created by the SLAM algorithm to generate collision-free paths for the robot to navigate toward its goal. The paper also discusses recent advances in deep learning-based SLAM algorithms and their applications in indoor navigation with ORB and RGB-D cameras. The research concludes that SLAM-based robot localization and navigation algorithms are a promising approach for robots navigating in unstructured environments and present various opportunities for future research. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Research on User Default Prediction Algorithm Based on Adjusted Homogenous and Heterogeneous Ensemble Learning.
- Author
-
Lu, Yao, Wang, Kui, Sun, Hui, Qu, Hanwen, Chen, Jiajia, Liu, Wei, and Chang, Chenjie
- Subjects
DEFAULT (Finance) ,FORECASTING ,FEATURE selection ,ALGORITHMS ,CREDIT risk ,ECONOMETRIC models ,MACHINE learning ,GREEN technology - Abstract
In the field of risk assessment, the traditional econometric models are generally used to assess credit risk. And with the introduction of the "dual-carbon" goals to promote the development of a low-carbon economy, the scale of green credit in China has rapidly expanded. But with the advent of the big data era, due to the poor interpretability of a traditional single machine learning model, it is difficult to capture nonlinear relationships, and there are shortcomings in prediction accuracy and robustness. This paper selects the adjusted ensemble learning model based on the homogeneous and heterogeneous factors for user default prediction, which can efficiently process large quantities of high-dimensional data. This article adjusts each model to adapt to the task and innovatively compares various models. In this paper, the missing value filling method, feature selection, and ensemble model are studied and discussed, and the optimal ensemble model is obtained. When comparing the predictions of single models and ensemble models, the accuracy, sensitivity, specificity, F1-Score, Kappa, and MCC of Categorical Features Gradient Boosting (CatBoost) and Random undersampling Boosting (RUSBoost) all reach 100%. The experimental results prove that the algorithm based on adjusted homogeneous and heterogeneous ensemble learning can predict the user default efficiently and accurately. This paper also provides some references for establishing a risk assessment index system. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. Developing a Platform Using Petri Nets and GPenSIM for Simulation of Multiprocessor Scheduling Algorithms.
- Author
-
Dirdal, Daniel Osmundsen, Vo, Danny, Feng, Yuming, and Davidrajuh, Reggie
- Subjects
MULTIPROCESSORS ,PETRI nets ,ALGORITHMS ,COMPUTER systems ,SCHEDULING ,TURNAROUND time ,PSYCHOLOGICAL feedback - Abstract
Efficient multiprocessor scheduling is pivotal in optimizing the performance of parallel computing systems. This paper leverages the power of Petri nets and the tool GPenSIM to model and simulate a variety of multiprocessor scheduling algorithms (the basic algorithms such as first come first serve, shortest job first, and round robin, and more sophisticated schedulers like multi-level feedback queue and Linux's completely fair scheduler). This paper presents the evaluation of three crucial performance metrics in multiprocessor scheduling (such as turnaround time, response time, and throughput) under various scheduling algorithms. However, the primary focus of the paper is to develop a robust simulation platform consisting of Petri Modules to facilitate the dynamic representation of concurrent processes, enabling us to explore the real-time interactions and dependencies in a multiprocessor environment; more advanced and newer schedulers can be tested with the simulation platform presented in this paper. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. HeMoDU: High-Efficiency Multi-Object Detection Algorithm for Unmanned Aerial Vehicles on Urban Roads.
- Author
-
Shi, Hanyi, Wang, Ningzhi, Xu, Xinyao, Qian, Yue, Zeng, Lingbin, and Zhu, Yi
- Subjects
OBJECT recognition (Computer vision) ,ALGORITHMS ,DEEP learning ,TRAFFIC monitoring - Abstract
Unmanned aerial vehicle (UAV)-based object detection methods are widely used in traffic detection due to their high flexibility and extensive coverage. In recent years, with the increasing complexity of the urban road environment, UAV object detection algorithms based on deep learning have gradually become a research hotspot. However, how to further improve algorithmic efficiency in response to the numerous and rapidly changing road elements, and thus achieve high-speed and accurate road object detection, remains a challenging issue. Given this context, this paper proposes the high-efficiency multi-object detection algorithm for UAVs (HeMoDU). HeMoDU reconstructs a state-of-the-art, deep-learning-based object detection model and optimizes several aspects to improve computational efficiency and detection accuracy. To validate the performance of HeMoDU in urban road environments, this paper uses the public urban road datasets VisDrone2019 and UA-DETRAC for evaluation. The experimental results show that the HeMoDU model effectively improves the speed and accuracy of UAV object detection. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. LOD2-Level+ Low-Rise Building Model Extraction Method for Oblique Photography Data Using U-NET and a Multi-Decision RANSAC Segmentation Algorithm.
- Author
-
He, Yufeng, Wu, Xiaobian, Pan, Weibin, Chen, Hui, Zhou, Songshan, Lei, Shaohua, Gong, Xiaoran, Xu, Hanzeyu, and Sheng, Yehua
- Subjects
ARCHITECTURAL details ,DIGITAL elevation models ,POINT cloud ,PHOTOGRAPHY ,ALGORITHMS - Abstract
Oblique photography is a regional digital surface model generation technique that can be widely used for building 3D model construction. However, due to the lack of geometric and semantic information about the building, these models make it difficult to differentiate more detailed components in the building, such as roofs and balconies. This paper proposes a deep learning-based method (U-NET) for constructing 3D models of low-rise buildings that address the issues. The method ensures complete geometric and semantic information and conforms to the LOD2 level. First, digital orthophotos are used to perform building extraction based on U-NET, and then a contour optimization method based on the main direction of the building and the center of gravity of the contour is used to obtain the regular building contour. Second, the pure building point cloud model representing a single building is extracted from the whole point cloud scene based on the acquired building contour. Finally, the multi-decision RANSAC algorithm is used to segment the building detail point cloud and construct a triangular mesh of building components, followed by a triangular mesh fusion and splicing method to achieve monolithic building components. The paper presents experimental evidence that the building contour extraction algorithm can achieve a 90.3% success rate and that the resulting single building 3D model contains LOD2 building components, which contain detailed geometric and semantic information. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.