154,990 results
Search Results
2. Risikoadaptierte Prostatakarzinomfrüherkennung 2.0 – Positionspapier der Deutschen Gesellschaft für Urologie 2024.
- Author
-
Michel, Maurice Stephan, Gschwend, Jürgen E., Wullich, Bernd, Krege, Susanne, Bolenz, Christian, Merseburger, Axel S., Krabbe, Laura-Maria, Schultz-Lampel, Daniela, König, Frank, Haferkamp, Axel, and Hadaschik, Boris
- Subjects
MORTALITY prevention ,RISK assessment ,BIOPSY ,PROSTATE-specific antigen ,EARLY detection of cancer ,PROSTATE tumors ,MAGNETIC resonance imaging ,ALGORITHMS - Abstract
Copyright of Die Urologie is the property of Springer Nature 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
3. Ethische Aspekte im Rahmen von extrakorporalen Herz-Kreislauf-Unterstützungssystemen (ECLS): Konsensuspapier der DGK, DGTHG und DGAI.
- Author
-
Dutzmann, Jochen, Grahn, Hanno, Boeken, Udo, Jung, Christian, Michalsen, Andrej, Duttge, Gunnar, Muellenbach, Ralf, Schulze, P. Christian, Eckardt, Lars, Trummer, Georg, and Michels, Guido
- Subjects
EXTRACORPOREAL membrane oxygenation ,DECISION making ,RESUSCITATION ,LIFE support systems in critical care ,INFORMED consent (Medical law) ,CARDIAC arrest ,CARDIAC pacemakers ,ALGORITHMS - Abstract
Copyright of Die Anaesthesiologie is the property of Springer Nature 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
4. 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
5. 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
6. 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
7. 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
8. 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
9. Guest editorial: AI for computational audition—sound and music processing.
- Author
-
Li, Zijin, Wang, Wenwu, Zhang, Kejun, and Zhu, Mengyao
- Subjects
ARTIFICIAL intelligence ,INTERDISCIPLINARY research ,TRANSVERSAL lines ,ALGORITHMS - Abstract
Nowadays, the application of artificial intelligence (AI) algorithms and techniques is ubiquitous and transversal. Fields that take advantage of AI advances include sound and music processing. The advances in interdisciplinary research potentially yield new insights that may further advance the AI methods in this field. This special issue aims to report recent progress and spur new research lines in AI-driven sound and music processing, especially within interdisciplinary research scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
10. 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
11. 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
12. Improved lightweight YOLOv5 based on ShuffleNet and its application on traffic signs detection.
- Author
-
Liu, Liwei, Wang, Lei, and Ma, Zhuang
- Subjects
TRAFFIC monitoring ,TRAFFIC signs & signals ,SPEED ,ALGORITHMS - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
13. Improved Convolutional Neural Network Algorithm for Student Behavior Detection in the Classroom.
- Author
-
Yihua Liu and Weirong Wang
- Subjects
CONVOLUTIONAL neural networks ,PSYCHOLOGY of students ,FEATURE extraction ,BISPECIFIC antibodies ,ALGORITHMS ,HUMAN fingerprints - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
14. A Study of an Anomaly Detection System for Small Hydropower Data considering Multivariate Time Series.
- Author
-
Yang, Bo, Lyu, Zhongliang, Wei, Hua, and Wei, Chun
- Subjects
WATER power ,DATA management ,TIME series analysis ,RELIABILITY in engineering ,ALGORITHMS - Abstract
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]
- Published
- 2024
- Full Text
- View/download PDF
15. 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
16. Multi-Level Image Segmentation Combining Chaotic Initialized Chimp Optimization Algorithm and Cauchy Mutation.
- Author
-
Li, Shujing, Li, Zhangfei, Cheng, Wenhui, Qi, Chenyang, and Li, Linguo
- Subjects
OPTIMIZATION algorithms ,THRESHOLDING algorithms ,DIAGNOSTIC imaging ,ALGORITHMS ,UNIFORMITY ,IMAGE segmentation - Abstract
To enhance the diversity and distribution uniformity of initial population, as well as to avoid local extrema in the Chimp Optimization Algorithm (CHOA), this paper improves the CHOA based on chaos initialization and Cauchy mutation. First, Sin chaos is introduced to improve the random population initialization scheme of the CHOA, which not only guarantees the diversity of the population, but also enhances the distribution uniformity of the initial population. Next, Cauchy mutation is added to optimize the global search ability of the CHOA in the process of position (threshold) updating to avoid the CHOA falling into local optima. Finally, an improved CHOA was formed through the combination of chaos initialization and Cauchy mutation (CICMCHOA), then taking fuzzy Kapur as the objective function, this paper applied CICMCHOA to natural and medical image segmentation, and compared it with four algorithms, including the improved Satin Bowerbird optimizer (ISBO), Cuckoo Search (ICS), etc. The experimental results deriving from visual and specific indicators demonstrate that CICMCHOA delivers superior segmentation effects in image segmentation. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. 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
18. 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
19. 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
20. 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
21. 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
22. 基于多目标优化的联邦学习进化.
- 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
23. 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
24. 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
25. 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
26. 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
27. 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
28. 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
29. Deep Learning Algorithms for Traffic Forecasting: A Comprehensive Review and Comparison with Classical Ones.
- Author
-
Afandizadeh, Shahriar, Abdolahi, Saeid, Mirzahossein, Hamid, and Li, Ruimin
- Subjects
MACHINE learning ,TRAFFIC estimation ,TRANSPORTATION management system ,DEEP learning ,INTELLIGENT transportation systems ,ALGORITHMS ,FORECASTING ,TRAFFIC safety - Abstract
Accurate and timely forecasting of critical components is pivotal in intelligent transportation systems and traffic management, crucially mitigating congestion and enhancing safety. This paper aims to comprehensively review deep learning algorithms and classical models employed in traffic forecasting. Spanning diverse traffic datasets, the study encompasses various scenarios, offering a nuanced understanding of traffic forecasting methods. Reviewing 111 seminal research works since the 1980s, encompassing both deep learning and classical models, the paper begins by detailing the data sources utilized in transportation systems. Subsequently, it delves into the theoretical underpinnings of prevalent deep learning algorithms and classical models prevalent in traffic forecasting. Furthermore, it investigates the application of these algorithms and models in forecasting key traffic characteristics, informed by their utility in transport and traffic analyses. Finally, the study elucidates the merits and drawbacks of proposed models through applied research in traffic forecasting. Findings indicate that while deep learning algorithms and classic models serve as valuable tools, their suitability varies across contexts, necessitating careful consideration in future studies. The study underscores research opportunities in road traffic forecasting, providing a comprehensive guide for future endeavors in this domain. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. Harmonics reduction and power quality improvement in distributed power flow controller by SVPWM and MGWO technique.
- Author
-
Bandopadhyay, Subhasis, Bandyopadhyay, Atanu, Mondal, Ashoke, and Sadhu, Pradip kumar
- Subjects
ELECTRICAL load ,VECTOR spaces ,VOLTAGE ,ALGORITHMS - Abstract
The Distributed power flow controller can be considered as advance power flow controller which is combination of series and shunt compensator without DC link. In this paper Space vector Pulse width Modulation employs in Distributed power flow Controller for Harmonics Reduction and power quality improvement. A new technique SVPWM adopted which reduces the harmonics and the same time improves power quality and increase transient stability. In this paper a new technique of Multi objective Grey wolf algorithm used to optimize the controller parameter of DPFC. For the design of PI controller GWO algorithm can be used for better optimistic performance of DPFC. As a result of that power quality and voltage profile improves drastically and the same time harmonics also reduced remarkable level of 4.62% of Voltage THD and 1.8% of current THD. The simulation result and hardware model Prove the feasibility of proposed Configuration. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Reinforcement Machine Learning for Sparse Array Antenna Optimization with PPO.
- Author
-
Mohammad-Ali-Nezhad, Sajad and Kassem, Mohammad H.
- Subjects
ANTENNA arrays ,ANTENNAS (Electronics) ,TELECOMMUNICATION systems ,MACHINE learning ,ALGORITHMS - Abstract
This paper focuses on optimizing the radiation pattern of sparse array antennas using reinforcement learning, with many algorithms. The paper aims to leverage Proximal Policy Optimization’s (PPO’s) advantages in optimization and its effectiveness in handling stochastic transitions and rewards to achieve a reduced number of elements while maintaining desired signal performance and minimizing unnecessary side lobe signals. By removing a few of the antennas using reinforcement learning and PPO optimization, the same results as a complete array have been obtained. The anticipated outcomes of this research hold the promise of significantly enhancing the effectiveness and utility of sparse array antennas in communication systems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Determining Critical Cascading Effects of Flooding Events on Transportation Infrastructure Using Data Mining Algorithms.
- Author
-
Assaad, Rayan H., Mohammadi, Mohsen, and Assaf, Ghiwa
- Subjects
INFRASTRUCTURE (Economics) ,DATA mining ,ASSOCIATION rule mining ,FLOOD warning systems ,CLUSTER analysis (Statistics) ,ALGORITHMS - Abstract
Transportation infrastructures and operations can be severely impacted during flood events, leading to significant disruptions to the flow of goods and services. Although numerous studies have evaluated the direct impacts of flood events on the performance of transportation infrastructures, the indirect impacts or cascading effects have been rarely assessed. Hence, this paper examines the cascading effects of floods on transportation infrastructure using data mining algorithms. First, 33 effects of flood events on transportation infrastructure have been identified based on data collected for multiple flood events in New York and New Jersey. Second, association rule mining analysis was implemented to identify the key co-occurrences between flooding and the different events. Third, network analysis was conducted to quantify the co-occurrences or key combinations among the events. Fourth, cluster analysis was used to group or prioritize the cascading effects and co-occurring events into highly connected clusters to identify the most critical ones based on two scenarios: (1) without consideration of co-occurrences (Scenario 1); and (2) with consideration of co-occurrences (Scenario 2). The findings provided insights that while some cascading impacts could be individually critical/frequent (under Scenario 1), other cascading impacts could also result due to a combination of different effects that might not be perceived to be critical on the individual level but rather become critical when combined with other cascading events (under Scenario 2). The outcomes of this paper demonstrate the importance of considering the co-occurrences between the events and cascading effects, rather than analyzing them in isolation. This study adds to the body of knowledge by offering an analytical approach that could be used to identify and prioritize critical cascading effects of flood events on the operations and performance of transportation infrastructures. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Predictive power control strategy without grid voltage sensors of the Vienna rectifier.
- Author
-
Yang, Tao, Chen, Lan, and Miao, Yiru
- Subjects
SOFT power (Social sciences) ,VOLTAGE ,PROBLEM solving ,DETECTORS ,ELECTRIC current rectifiers ,ALGORITHMS ,PULSE width modulation transformers - Abstract
This paper proposes a predictive power control strategy for the three‐phase, six‐switch Vienna rectifier without grid voltage sensors to reduce the hardware cost and complexity of a high‐power PWM rectifier system. Firstly, an algorithm for calculating the AC‐side voltage in the αβ coordinate system is derived according to the operating principle of the Vienna rectifier, and a voltage observer is constructed by combining a second‐order low‐pass filter to estimate the grid voltage. Secondly, a soft start method is designed to solve the problem that the rectifier is prone to inrush current when it is started. Furthermore, the control method of grid voltage sensorless is combined with predictive power control with good dynamic characteristics and simple parameter settings to form the control strategy proposed in this paper. Finally, simulation analysis and experimental verification are carried out on the proposed control strategy. Simulation and experimental results show that the grid voltage estimation has high accuracy, a good surge current suppression effect, unit power factor operation, low input current harmonic content, and good dynamic and steady‐state performance. Therefore, the correctness and effectiveness of the strategy proposed in this paper are verified. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. A Distorted-Image Quality Assessment Algorithm Based on a Sparse Structure and Subjective Perception.
- Author
-
Yang, Yang, Liu, Chang, Wu, Hui, and Yu, Dingguo
- Subjects
PEARSON correlation (Statistics) ,COMPUTATIONAL complexity ,PERCEIVED quality ,IMAGING systems ,ALGORITHMS - Abstract
Most image quality assessment (IQA) algorithms based on sparse representation primarily focus on amplitude information, often overlooking the structural composition of images. However, structural composition is closely linked to perceived image quality, a connection that existing methods do not adequately address. To fill this gap, this paper proposes a novel distorted-image quality assessment algorithm based on a sparse structure and subjective perception (IQA-SSSP). This algorithm evaluates the quality of distorted images by measuring the sparse structure similarity between a reference and distorted images. The proposed method has several advantages. First, the sparse structure algorithm operates with reduced computational complexity, leading to faster processing speeds, which makes it suitable for practical applications. Additionally, it efficiently handles large-scale data, further enhancing the assessment process. Experimental results validate the effectiveness of the algorithm, showing that it achieves a high correlation with human visual perception, as reflected in both objective and subjective evaluations. Specifically, the algorithm yielded a Pearson correlation coefficient of 0.929 and a mean squared error of 8.003, demonstrating its robustness and efficiency. By addressing the limitations of existing IQA methods and introducing a more holistic approach, this paper offers new perspectives on IQA. The proposed algorithm not only provides reliable quality assessment results but also closely aligns with human visual experience, thereby enhancing both the objectivity and accuracy of image quality evaluations. This research offers significant theoretical support for the advancement of sparse representation in IQA. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
35. A Fast Algorithm for 3D Focusing Inversion of Magnetic Data and Its Application in Geothermal Exploration.
- Author
-
Dai, Weiming, Jia, Hongfa, Jiang, Niande, Liu, Yanhong, Zhou, Weihui, Zhu, Zhiying, and Zhou, Shuai
- Subjects
CONJUGATE gradient methods ,MATRIX effect ,ALGORITHMS ,GEOTHERMAL resources - Abstract
This paper presents a fast focusing inversion algorithm of magnetic data based on the conjugate gradient method, which can be used to describe the underground target geologic body efficiently and clearly. The proposed method realizes an effect similar to matrix compression by changing the computation order, calculating the inner product of vectors and equivalent expansion of expressions. Model tests show that this strategy successfully reduces the computation time of a single iteration of the conjugate gradient method, so the three-dimensional magnetic data inversion is realized under a certain number of iterations. In this paper, the detailed calculation steps of the proposed inversion method are given, and the effectiveness and high efficiency of the proposed fast focusing inversion method are verified by three theoretical model tests and a set of measured data. Finally, the fast focus inversion algorithm is applied to the magnetic data of Gonghe Basin, Qinghai Province, to describe the spatial distribution range of deep hot dry rock, which provides a direction for the continuous exploration of geothermal resources in this area. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
36. Pre-Processing Event Logs by Chaotic Filtering Approaches Based on the Direct Following Relationship.
- Author
-
Lv, Tengzi, Gong, Xiugang, Gong, Na, and Li, Kaiyu
- Subjects
PROCESS mining ,SAWLOGS ,ALGORITHMS - Abstract
Process discovery aims to discover process models from event logs to describe actual business processes. The quality of event logs has an impact on the quality of process models, so preprocessing methods can be used to improve the quality of event logs. Chaotic activities may exist in real business scenarios, and the occurrence of chaotic activities is independent of other activities in the process and can occur at any location in the event log at any frequency. Therefore, chaotic activities seriously affect the model quality of process discovery. Filtering chaotic activities in event logs can effectively improve the quality of event logs and thus improve the quality of process models. The traditional chaotic activity filtering algorithm makes it difficult to balance accuracy and time performance. Therefore, a direct method for filtering chaotic activities is proposed in this paper. By analyzing the relationship between activities, chaotic activities are identified in the log according to the characteristics of chaotic activities and the direct following relationship of activities as the judgment condition, and the filtering of chaotic activities in the event log is realized. In addition, this paper proposes an indirect chaotic activity filtering method, which identifies and filters chaotic activities in the log by analyzing the influence of the existence of different activities on the overall chaos degree of the log. The proposed method is compared with the traditional chaotic activity filtering method on several simulation/real data sets, and the accuracy and running time between the multi-group event logs and the process models generated before and after chaotic activity filtering are analyzed, further verifying the effectiveness and feasibility of the proposed method. By summarizing the experimental results, it is found that the accuracy of the proposed chaotic activity filtering methods is greater than that of the frequency-based filtering method and is close to that of the entropy-based chaotic activity filtering methods. Moreover, compared with other filtering methods used in the experiment, the chaotic activity filtering method proposed in this paper can improve the efficiency by 23.4% on average for simulation logs, and by 84.25% on average for real event logs. It is concluded that compared with other filtering methods, the proposed chaotic activity filtering methods have higher accuracy and can effectively improve the time performance of chaotic activity filtering. Therefore, the chaotic activity filtering method proposed in this paper can balance the accuracy and time performance, and can ensure the integrity of the filtered event log to a certain extent. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
37. UWB-Based Human-Following System with Obstacle and Crevasse Avoidance for Polar-Exploration Robots.
- Author
-
Kwon, Ji-Wook, Lee, Hyoujun, Lee, Jongdeuk, Lee, Na-Hyun, Kim, Jong Chan, Uhm, Taeyoung, and Choi, Young-Ho
- Subjects
EXTREME environments ,ROBOTS ,EXPLORERS ,ALGORITHMS ,SUCCESS - Abstract
This paper introduces a UWB-based human-following system for polar-exploration robots, integrating obstacle and crevasse avoidance functions to enhance the safety and efficiency of explorers in extreme environments. The proposed system determines the relative position of the explorer using UWB anchors and tags. It also utilizes real-time local obstacle mapping and path-planning algorithms to find safe paths that avoid collisions with obstacles. Simulation and real-world experiments confirm that the proposed system operates effectively in polar environments, reducing the operational burden on explorers and increasing mission success rates. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
38. Pointer Meter Reading Method Based on YOLOv8 and Improved LinkNet.
- Author
-
Lu, Xiaohu, Zhu, Shisong, and Lu, Bibo
- Subjects
FEATURE extraction ,ROTATIONAL motion ,ANGLES ,READING ,ALGORITHMS - Abstract
In order to improve the reading efficiency of pointer meter, this paper proposes a reading method based on LinkNet. Firstly, the meter dial area is detected using YOLOv8. Subsequently, the detected images are fed into the improved LinkNet segmentation network. In this network, we replace traditional convolution with partial convolution, which reduces the number of model parameters while ensuring accuracy is not affected. Remove one pair of encoding and decoding modules to further compress the model size. In the feature fusion part of the model, the CBAM (Convolutional Block Attention Module) attention module is added and the direct summing operation is replaced by the AFF (Attention Feature Fusion) module, which enhances the feature extraction capability of the model for the segmented target. In the subsequent rotation correction section, this paper effectively addresses the issue of inaccurate prediction by CNN networks for axisymmetric images within the 0–360° range, by dividing the rotation angle prediction into classification and regression steps. It ensures that the final reading part receives the correct angle of image input, thereby improving the accuracy of the overall reading algorithm. The final experimental results indicate that our proposed reading method has a mean absolute error of 0.20 and a frame rate of 15. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
39. 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
40. Improvement and Fusion of D*Lite Algorithm and Dynamic Window Approach for Path Planning in Complex Environments.
- Author
-
Gao, Yang, Han, Qidong, Feng, Shuo, Wang, Zhen, Meng, Teng, and Yang, Jingshuai
- Subjects
MOBILE robots ,AUTONOMOUS robots ,COST functions ,SCHEDULING ,ALGORITHMS ,POTENTIAL field method (Robotics) - Abstract
Effective path planning is crucial for autonomous mobile robots navigating complex environments. The "global–local" coupled path planning algorithm exhibits superior global planning capabilities and local adaptability. However, these algorithms often fail to fully realize their potential due to low efficiency and excessive constraints. To address these issues, this study introduces a simpler and more effective integration strategy. Specifically, this paper proposes using a bi-layer map and a feasible domain strategy to organically combine the D*Lite algorithm with the Dynamic Window Approach (DWA). The bi-layer map effectively reduces the number of nodes in global planning, enhancing the efficiency of the D*Lite algorithm. The feasible domain strategy decreases constraints, allowing the local algorithm DWA to utilize its local planning capabilities fully. Moreover, the cost functions of both the D*Lite algorithm and DWA have been refined, enabling the fused algorithm to cope with more complex environments. This paper conducts simulation experiments across various settings and compares our method with A_DWA, another "global–local" coupled approach, which combines A* and DWA. D_DWA significantly outperforms A_DWA in complex environments, despite a 7.43% increase in path length. It reduces the traversal of risk areas by 71.95%, accumulative risk by 80.34%, global planning time by 26.98%, and time cost by 35.61%. Additionally, D_DWA outperforms the A_Q algorithm, a coupled approach validated in real-world environments, which combines A* and Q-learning, achieving reductions of 1.34% in path length, 67.14% in traversal risk area, 78.70% in cumulative risk, 34.85% in global planning time, and 37.63% in total time cost. The results demonstrate the superiority of our proposed algorithm in complex scenarios. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. 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
42. 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
43. 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
44. A Survey on Emerging Blockchain Technology Platforms for Securing the Internet of Things.
- Author
-
Kareem, Yunus, Djenouri, Djamel, and Ghadafi, Essam
- Subjects
DATA transmission systems ,INTERNET of things ,INTERNET security ,ALGORITHMS ,PROBLEM solving - Abstract
The adoption of blockchain platforms to bolster the security of Internet of Things (IoT) systems has attracted significant attention in recent years. Currently, there is a lack of comprehensive and systematic survey papers in the literature addressing these platforms. This paper discusses six of the most popular emerging blockchain platforms adopted by IoT systems and analyses their usage in state-of-the-art works to solve security problems. The platform was compared in terms of security features and other requirements. Findings from the study reveal that most blockchain components contribute directly or indirectly to IoT security. Blockchain platform components such as cryptography, consensus mechanism, and hashing are common ways that security is achieved in all blockchain platform for IoT. Technologies like Interplanetary File System (IPFS) and Transport Layer Security (TLS) can further enhance data and communication security when used alongside blockchain. To enhance the applicability of blockchain in resource-constrained IoT environments, future research should focus on refining cryptographic algorithms and consensus mechanisms to optimise performance and security. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. 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
46. 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
47. Satellite Autonomous Mission Planning Based on Improved Monte Carlo Tree Search.
- Author
-
Li, Zichao, Li, You, and Luo, Rongzheng
- Subjects
ALGORITHMS ,TREES ,SPEED ,CRITICS ,ACTORS ,ANT algorithms - Abstract
This paper improves the timeliness of satellite mission planning to cope with the rapid response to changes. In this paper, satellite mission planning is investigated. Firstly, the satellite dynamics model and mission planning model are established, and an improved Monte Carlo tree (Improved-MCTS) algorithm is proposed, which utilizes the Monte Carlo tree search in combination with the state uncertainty network (State-UN) to reduce the time of exploring the nodes (At the MCTS selection stage, the exploration of nodes specifically refers to the algorithm needing to decide whether to choose nodes that have already been visited (exploitation) or nodes that have not been visited yet (exploration)). The results show that this algorithm performs better in terms of profit (in this paper, the observation task is given a weight of 0–1, and each planned task will receive a profit; that is, a profit will be assigned at the initial moment) and convergence speed compared to the ant colony algorithm (ACO) and the asynchronous advantage actor critic (A3C). [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. 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
49. 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
50. 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
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.