1,849 results
Search Results
2. Investigators from Midwest Orthopaedics at Rush Target Machine Learning (Paper 19: Evidence-based Machine Learning Algorithm To Predict Failure Following Cartilage Preservation Procedures In the Knee).
- Abstract
Keywords: Chicago; State:Illinois; United States; North and Central America; Algorithms; Cyborgs; Emerging Technologies; Health and Medicine; Machine Learning EN Chicago State:Illinois United States North and Central America Algorithms Cyborgs Emerging Technologies Health and Medicine Machine Learning 380 380 1 05/22/23 20230526 NES 230526 2023 MAY 28 (NewsRx) -- By a News Reporter-Staff News Editor at Medical Devices & Surgical Technology Week -- Fresh data on Machine Learning are presented in a new report. Machine learning algorithms may be used to compare the risk of failure of specific patient-procedure combinations in the treatment of cartilage defects of the knee. [Extracted from the article]
- Published
- 2023
3. Data on Diabetic Ketoacidosis Published by a Researcher at University of New Mexico (Evaluation of Computer-Based Insulin Infusion Algorithm Compared With a Paper-Based Protocol in the Treatment of Diabetic Ketoacidosis).
- Abstract
Keywords: Acid-Base Imbalance; Algorithms; Computers; Diabetes Complications; Diabetes Mellitus; Diabetic Ketoacidosis; Glucose Metabolism Disorders; Health and Medicine; Hospitals; Nutritional and Metabolic Diseases and Conditions; Peptide Hormones; Peptide Proteins; Proinsulin EN Acid-Base Imbalance Algorithms Computers Diabetes Complications Diabetes Mellitus Diabetic Ketoacidosis Glucose Metabolism Disorders Health and Medicine Hospitals Nutritional and Metabolic Diseases and Conditions Peptide Hormones Peptide Proteins Proinsulin 53 53 1 04/17/23 20230420 NES 230420 2023 APR 17 (NewsRx) -- By a News Reporter-Staff News Editor at Diabetes Week -- New study results on diabetic ketoacidosis have been published. Acid-Base Imbalance, Algorithms, Computers, Diabetes Complications, Diabetes Mellitus, Diabetic Ketoacidosis, Glucose Metabolism Disorders, Health and Medicine, Hospitals, Nutritional and Metabolic Diseases and Conditions, Peptide Hormones, Peptide Proteins, Proinsulin. [Extracted from the article]
- Published
- 2023
4. Research on Intrahepatic Cholestasis Published by Researchers at Birmingham Women's and Children's NHS Foundation Trust (Opinion paper on the diagnosis and treatment of progressive familial intrahepatic cholestasis).
- Subjects
RESEARCH personnel ,CHOLESTASIS ,CONSCIOUSNESS raising ,DIGESTIVE system diseases ,BILIOUS diseases & biliousness - Abstract
A recent report from researchers at Birmingham Women's and Children's NHS Foundation Trust discusses the diagnosis and treatment of progressive familial intrahepatic cholestasis (PFIC), a rare liver disorder that primarily affects children. The researchers aimed to provide recommendations for the management of PFIC in clinical practice. They developed an algorithm for the diagnosis and treatment of children with suspected PFIC, which includes the use of licensed inhibitors of ileal bile acid transporters as the first-line treatment. The authors hope that these recommendations will help standardize the management of PFIC and raise awareness of current developments in the field. [Extracted from the article]
- Published
- 2024
5. New paper explores Insilico Medicine's generative AI drug design platform Chemistry42.
- Published
- 2023
6. FDA Releases Two Discussion Papers to Spur Conversation about Artificial Intelligence and Machine Learning in Drug Development and Manufacturing.
- Subjects
ARTIFICIAL intelligence ,MACHINE learning ,DRUG factories ,DRUG development ,RECOMBINANT proteins - Abstract
The regulatory uses are real: In 2021, more than 100 drug and biologic applications submitted to the FDA included AI/ML components. Keywords: Algorithms; Artificial Intelligence; Bioengineering; Biologics; Biotechnology; Cybersecurity; Cyborgs; Drug Development; Drug Manufacturing; Drugs and Therapies; Emerging Technologies; FDA; Genetic Engineering; Genetically-Engineered Proteins; Government Agencies Offices and Entities; Health and Medicine; Machine Learning; Office of the FDA Commissioner; Public Health; Technology; U.S. Food and Drug Administration EN Algorithms Artificial Intelligence Bioengineering Biologics Biotechnology Cybersecurity Cyborgs Drug Development Drug Manufacturing Drugs and Therapies Emerging Technologies FDA Genetic Engineering Genetically-Engineered Proteins Government Agencies Offices and Entities Health and Medicine Machine Learning Office of the FDA Commissioner Public Health Technology U.S. Food and Drug Administration 497 497 1 05/22/23 20230523 NES 230523 2023 MAY 22 (NewsRx) -- By a News Reporter-Staff News Editor at Clinical Trials Week -- By: Patrizia Cavazzoni, M.D., Director of the Center for Drug Evaluation and Research Artificial intelligence (AI) and machine learning (ML) are no longer futuristic concepts; they are now part of how we live and work. [Extracted from the article]
- Published
- 2023
7. 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
8. Taming Algorithmic Priority Inversion in Mission-Critical Perception Pipelines.
- Author
-
Liu, Shengzhong, Yao, Shuochao, Fu, Xinzhe, Tabish, Rohan, Yu, Simon, Bansal, Ayoosh, Yun, Heechul, Sha, Lui, and Abdelzaher, Tarek
- Subjects
ALGORITHMS ,SYSTEMS design ,CYBER physical systems ,COMPUTER scheduling ,ARTIFICIAL intelligence ,ARTIFICIAL neural networks ,FIRST in, first out (Queuing theory) - Abstract
The paper discusses algorithmic priority inversion in mission-critical machine inference pipelines used in modern neural-network-based perception subsystems and describes a solution to mitigate its effect. In general, priority inversion occurs in computing systems when computations that are "less important" are performed together with or ahead of those that are "more important." Significant priority inversion occurs in existing machine inference pipelines when they do not differentiate between critical and less critical data. We describe a framework to resolve this problem and demonstrate that it improves a perception system's ability to react to critical inputs, while at the same time reducing platform cost. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
9. Findings in Fibromyalgia Reported from Federal University of Rio Grande do Norte [Spectrochemical approach combined with symptoms data to diagnose fibromyalgia through paper spray ionization mass spectrometry (PSI-MS) and multivariate...].
- Subjects
FIBROMYALGIA ,MASS spectrometry ,FISHER discriminant analysis ,SYMPTOMS ,DIAGNOSIS ,NEUROMUSCULAR diseases - Abstract
Algorithms, Diagnostics and Screening, Emerging Technologies, Fibromyalgia, Health and Medicine, Linear Discriminant Analysis, Machine Learning, Muscular Diseases and Conditions, Musculoskeletal Diseases and Conditions, Neuromuscular Diseases and Conditions, Rheumatic Diseases and Conditions Keywords: Algorithms; Diagnostics and Screening; Emerging Technologies; Fibromyalgia; Health and Medicine; Linear Discriminant Analysis; Machine Learning; Muscular Diseases and Conditions; Musculoskeletal Diseases and Conditions; Neuromuscular Diseases and Conditions; Rheumatic Diseases and Conditions EN Algorithms Diagnostics and Screening Emerging Technologies Fibromyalgia Health and Medicine Linear Discriminant Analysis Machine Learning Muscular Diseases and Conditions Musculoskeletal Diseases and Conditions Neuromuscular Diseases and Conditions Rheumatic Diseases and Conditions 158 158 1 04/10/23 20230413 NES 230413 2023 APR 13 (NewsRx) -- By a News Reporter-Staff News Editor at Hematology Week -- Research findings on fibromyalgia are discussed in a new report. [Extracted from the article]
- Published
- 2023
10. Improving Refugees' Integration with Online Resource Allocation: Technical Perspective.
- Author
-
Freund, Daniel
- Subjects
REFUGEE resettlement ,RESOURCE allocation ,ALGORITHMS ,EMPLOYMENT - Abstract
The article discusses a research paper that applies online resource allocation algorithms to refugee resettlement, aiming to improve refugees' integration into local communities and employment prospects. By utilizing concepts from algorithm design, such as balancing resource utilization and maintaining capacity for future refugees, the authors were able to enhance the employability metric for resettlement agencies like the Hebrew Immigrant Aid Society (HIAS) by approximately 10%. This research not only addresses critical societal issues but also highlights the potential of algorithms to positively impact real-world outcomes for vulnerable populations, encouraging collaboration between algorithm designers and practitioners on important societal problems.
- Published
- 2024
- Full Text
- View/download PDF
11. Opening the Door to SSD Algorithmics.
- Author
-
Sitaraman, Ramesh K.
- Subjects
ALGORITHMS ,SOLID state drives ,EVOLUTIONARY computation - Abstract
The article addresses the topic of algorithm design in the solid-state drive (SSD) model of computation, noting its limitations as well as its benefits. The author references an accompanying paper which addresses one shortcoming in particular -- the phenomenon of "write amplification" -- by proposing a more accurate theoretical model of SSDs that incorporates read, write and erase operations.
- Published
- 2023
- Full Text
- View/download PDF
12. Resolution of the Burrows-Wheeler Transform Conjecture.
- Author
-
Kempa, Dominik and Kociumaka, Tomasz
- Subjects
COMPUTER programming ,COMPUTERS in lexicography ,ALGORITHMS ,DATA structures ,COMPUTER science - Abstract
The Burrows-Wheeler Transform (BWT) is an invertible text transformation that permutes symbols of a text according to the lexicographical order of its suffixes. BWT is the main component of popular lossless compression programs (such as bzip2) as well as recent powerful compressed indexes (such as the r-index
7 ), central in modern bioinformatics. The compressibility of BWT is quantified by the number r of equal-letter runs in the output. Despite the practical significance of BWT, no nontrivial upper bound on r is known. By contrast, the sizes of nearly all other known compression methods have been shown to be either always within a polylog n factor (where n is the length of the text) from z, the size of Lempel--Ziv (LZ77) parsing of the text, or much larger in the worst case (by an nε factor for ε > 0). In this paper, we show that r = O (z log² n) holds for every text. This result has numerous implications for text indexing and data compression; in particular: (1) it proves that many results related to BWT automatically apply to methods based on LZ77, for example, it is possible to obtain functionality of the suffix tree in O (z polylog n) space; (2) it shows that many text processing tasks can be solved in the optimal time assuming the text is compressible using LZ77 by a sufficiently large polylog n factor; and (3) it implies the first nontrivial relation between the number of runs in the BWT of the text and of its reverse. In addition, we provide an O (z polylog n)-time algorithm converting the LZ77 parsing into the run-length compressed BWT. To achieve this, we develop several new data structures and techniques of independent interest. In particular, we define compressed string synchronizing sets (generalizing the recently introduced powerful technique of string synchronizing sets11) and show how to efficiently construct them. Next, we propose a new variant of wavelet trees for sequences of long strings, establish a nontrivial bound on their size, and describe efficient construction algorithms. Finally, we develop new indexes that can be constructed directly from the LZ77 parsing and efficiently support pattern matching queries on text substrings. [ABSTRACT FROM AUTHOR]- Published
- 2022
- Full Text
- View/download PDF
13. Evaluating individual heterogeneity in mental health research: an overview of clustering methods and guidelines for applications (Updated June 20, 2024).
- Subjects
PSYCHIATRIC research ,DEEP learning ,HETEROGENEITY ,MENTAL illness - Abstract
This article discusses the use of clustering models or cluster analyses in mental health research and psychology to explore individual heterogeneity. It highlights the lack of guidance on model choice, analytical framework, and reporting requirements in this field. The paper provides an introduction to major algorithms, such as kernel methods and deep learning, and discusses methods for pre-clustering data processing, clustering evaluation, and validation. The article also presents a rapid review of publications in psychology and psychiatry journals, pointing out issues such as a lack of diversity in algorithm choice and reproducibility. Overall, this comprehensive paper offers researchers advanced tools and guidelines to use clustering methods efficiently, robustly, and transparently in mental health and other health application areas. [Extracted from the article]
- Published
- 2024
14. Multi-Itinerary Optimization as Cloud Service.
- Author
-
Cristian, Alexandru, Marshall, Luke, Negrea, Mihai, Stoichescu, Flavius, Cao, Peiwei, and Menache, Ishai
- Subjects
CLOUD computing ,TRAFFIC flow ,ALGORITHMS ,TRAVELING salesman problem ,TRAVEL time (Traffic engineering) - Abstract
In this paper, we describe multi-itinerary optimization (MIO)--a novel Bing Maps service that automates the process of building itineraries for multiple agents while optimizing their routes to minimize travel time or distance. MIO can be used by organizations with a fleet of vehicles and drivers, mobile salesforce, or a team of personnel in the field, to maximize workforce efficiency. It supports a variety of constraints, such as service time windows, duration, priority, pickup and delivery dependencies, and vehicle capacity. MIO also considers traffic conditions between locations, resulting in algorithmic challenges at multiple levels (e.g., calculating time-dependent travel-time distance matrices at scale and scheduling services for multiple agents). To support an end-to-end cloud service with turnaround times of a few seconds, our algorithm design targets a sweet spot between accuracy and performance. Toward that end, we build a scalable approach based on the ALNS metaheuristic. Our experiments show that accounting for traffic significantly improves solution quality: MIO finds efficient routes that avoid late arrivals, whereas traffic-agnostic approaches result in a 15% increase in the combined travel time and the lateness of an arrival. Furthermore, our approach generates itineraries with substantially higher quality than a cutting-edge heuristic (LKH), with faster running times for large instances. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
15. Initial preference algorithm of industrial project portfolio.
- Author
-
Cihan, Ercan Emin, Alabaş-Uslu, Çiğdem, and Kabak, Özgür
- Subjects
ALGORITHMS ,NUMBER systems - Abstract
Purpose: This paper aims to develop an algorithm to pretest an industrial portfolio on a new scale. Portfolios include complex and uncertain projects at the front-end phase. The study, therefore, proposes a procedure that helps decision-makers to handle various complex projects and defines a common scale applicable to various kinds of industrial projects. Design/methodology/approach: Decision-makers can employ the preference algorithm to reach a common understanding. To this end, the current paper posits the organization of criteria in various project sets. A sexagesimal scale is developed based on project complexity and its ability to achieve broad impact, both these factors being gauged on a five-point scale of user-friendly numberings. Findings: The proposed algorithm shows the equivalence of industrial projects in different fields. Also, the algorithm articulates the status in terms of uncertainty, complexity, risk, and value of projects. The connections between decision-makers and criteria operate on the basis of the foreseen complexity, risk, and value. It can be said that this study exemplifies and visualizes the portfolio and criteria relationship. Research limitations/implications: The procedure covers contingency exercises at the front-end phase of a portfolio and supports decisions. However, updated information can change support positions. Originality/value: The paper presents original scoring guidance for portfolio complexity on a new scale. The scaling and scoring are adjustable and calibrated using the proposed sexagesimal system. It presents an original classification of project risk and value. The main contribution is the presented algorithm which can be used to pretest industrial portfolios composed of projects that vary in both size and context. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
16. Grounding system impedance influence on the surge arrester frequency-dependent model parameters using PSO-GWO algorithm.
- Author
-
Khodsuz, Masume and Mashayekhi, Valiollah
- Subjects
OPTIMIZATION algorithms ,PARTICLE swarm optimization ,PARAMETER estimation ,ALGORITHMS ,ELECTRIC impedance - Abstract
Purpose: This paper aims to focus on the inclusion of the frequency behavior of grounding system effect on surge arrester (SA) model parameters' estimation. Design/methodology/approach: The grounding system impedance and its frequency behavior are the factors that have influence on the SA performance. Up to now, the grounding system impedance effect and the frequency behavior of the soil parameters have not been studied for the estimation of the parameters of the SA frequency-dependent model. In this paper, the grounding system's influence on the SA dynamic model has been simulated for rod- and counterpoise-shaped electrodes. Particle swarm optimization with a grey wolf optimization algorithm has been implemented as an optimization algorithm to adjust the parameters of the SA dynamic model. Findings: The results show that the frequency behavior of the grounding impedance and soil electrical parameters can impress the optimum parameters of the SA frequency-dependent model and should be considered for more reliable results. Also, the results evidence that the proposed optimization method provides more accurate results compared to other optimization methods. Originality/value: To the best of the authors' knowledge, this work is one of the first attempts to investigate the effect of frequency grounding system on SA frequency-dependent model parameters. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
17. Asynchronous network-based model and algorithm for sentiment analysis of online public opinions.
- Author
-
Li, Chong, Qu, Yuling, and Zhu, Xinping
- Subjects
SENTIMENT analysis ,PUBLIC opinion ,ONLINE algorithms ,VIRTUAL communities ,PUBLIC administration ,ALGORITHMS ,GOVERNMENT agencies - Abstract
Purpose: A novel asynchronous network-based model is proposed in this paper for the sentiment analysis of online public opinions. This new model provides a new approach to analyze the evolution characteristics of online public opinion sentiments in complex environment. Design/methodology/approach: Firstly, a new sentiment analysis model is proposed based on the asynchronous network theory. Then the graphical evaluation and review technique is employed and extended to design the model-based sentiment analysis algorithms. Finally, simulations and real-world case studies are given to show the effectiveness of the proposed model. Findings: The dynamics of online public opinion sentiments are determined by both personal preferences to certain topics and the complex interactive influences of environmental factors. The application of appropriate quantitative models can improve the prediction of public opinion sentiment. Practical implications: The proposed model-based algorithms provide simple but effective ways to explore the complex dynamics of online public opinions. Case studies highlight the role of government agencies in shaping sentiments of public opinions on social topics. Originality/value: This paper proposes a new asynchronous network model for the dynamic sentiment analysis of online public opinions. It extends the previous static models and provides a new way to extract opinion evolution patterns in complex environment. Applications of the proposed model provide some new insights into the online public opinion management. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
18. A parallel compact Marine Predators Algorithm applied in time series prediction of Backpropagation neural network (BNN) and engineering optimization.
- Author
-
Pan, Jeng-Shyang, Zhang, Zhen, Chu, Shu-Chuan, Zhang, Si-Qi, and Wu, Jimmy Ming-Tai
- Subjects
- *
ALGORITHMS , *ENGINEERING , *COMMUNICATION strategies - Abstract
This study introduces a novel approach for integrating a compact mechanism into the Marine Predator Algorithm (MPA), subsequently proposing innovative parallel and communication strategies. The synergistic combination of these methodologies substantially augments the global search efficiency and accelerates the convergence rate of the original MPA. The paper culminates in presenting an enhanced version of the Marine Predator Algorithm, termed PCMPA, which leverages compact parallel technology. The performance of PCMPA, alongside a range of comparative algorithms, is rigorously evaluated using the CEC2013 benchmark test functions. These comparative algorithms encompass recent variants of MPA, PSO, DE, and other newly developed algorithms. Evaluation results reveal that PCMPA outperforms its counterparts in a more extensive array of test functions. To corroborate PCMPA's efficacy in real-world scenarios, the algorithm is applied to parameter optimization in Backpropagation neural network (BNN) and targeted engineering optimization challenges. This application demonstrates that PCMPA consistently achieves enhanced performance in practical implementations. • The study presents a novel variant of the Marine Predators Algorithm, dubbed PCMPA. • The paper benchmarks PCMPA against other Marine Predators Algorithm variants and other Algorithms. • The research applies PCMPA to optimize parameters of BNNs and to tackle engineering optimization challenges. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
19. Quantum-Proof Secrets.
- Author
-
HOUSTON-EDWARDS, KELSEY
- Subjects
QUANTUM computers ,CRYPTOGRAPHY ,QUANTUM cryptography ,COMPUTER systems ,ALGORITHMS - Abstract
This article discusses the urgent need to develop post-quantum cryptography in order to protect data from being compromised by future quantum computers. Public-key cryptography, which is currently used to secure information, would become ineffective if a quantum computer were able to break it. The National Institute of Standards and Technology (NIST) has launched a contest to find alternative cryptographic algorithms that are resistant to quantum attacks, and 26 algorithms have been selected for further testing. Lattice-based cryptography has emerged as a promising approach, but NIST is exploring other options to avoid relying solely on one type of algorithm. The transition to post-quantum cryptography will require time and upgrades to computer systems and protocols. [Extracted from the article]
- Published
- 2024
- Full Text
- View/download PDF
20. Optimal shape design of a class of permanent magnet motors in a multiple-objectives context.
- Author
-
Di Barba, Paolo, Mognaschi, Maria Evelina, Petkovska, Lidija, and Cvetkovski, Goga Vladimir
- Subjects
PERMANENT magnet motors ,DIFFERENTIAL evolution ,ALGORITHMS ,PERMANENT magnets ,FINITE element method ,ELECTRIC motors ,STRUCTURAL optimization - Abstract
Purpose: This paper aims to deal with the optimal shape design of a class of permanent magnet motors by minimizing multiple objectives according to an original interpretation of Pareto optimality. The proposed method solves a many-objective problems characterized by five objective functions and five design variables with evolution strategy algorithms, classically used for single- and multi-objective (two objective functions) optimization problems. Design/methodology/approach: Two approaches are proposed in the paper: the All-Objectives (AO) and the Many-Objectives (MO) optimization approach. The former is based on a single-objective optimization of a preference function, i.e. a normalized weighted sum. In contrast, in the MO a multi-objective optimization algorithm is applied to the minimization of a weight-free preference function and simultaneously to a maximization of the distance of the current solution from the prototype. The optimizations are based on an equivalent circuit model of the Permanent Magnet (PM) motor, but the results are assessed by means of finite element analyses (FEAs). Findings: An extensive study of the solutions obtained by means of the different optimization approaches is provided by means of post-processing analyses. Both the approaches find non-dominated solutions with respect to the prototype that are substantially improving the initial solution. The points of strength along with the weakness points of each solution with respect to the prototype are analysed in depth. Practical implications: The paper gives a good guide to the designers of electric motors, focussed on a shape design optimization. Originality/value: Considering simultaneously five objective functions in an automated optimal design procedure is challenging. The proposed approach, based on a well-known and established optimization algorithm, but exploiting a new concept of degree of conflict, can lead to new results in the field of automated optimal design in a many-objective context. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
21. Screening Smarter, Not Harder: A Comparative Analysis of Machine Learning Screening Algorithms and Heuristic Stopping Criteria for Systematic Reviews in Educational Research (Updated June 20, 2024).
- Subjects
MACHINE learning ,EDUCATIONAL psychologists ,HEURISTIC algorithms ,LANGUAGE models ,EDUCATION research ,NATURAL language processing - Abstract
A preprint abstract discusses the use of machine learning algorithms and heuristic stopping criteria to improve the efficiency of systematic reviews in education and educational psychology. The study conducted a retrospective screening simulation using 27 systematic reviews and found that active learning algorithms reduced screening workload by an average of 50% and saved an estimated 1.64 days of time. The Random Forests algorithm with Sentence Bidirectional Encoder Representations from Transformers performed the best. Additionally, the study found that heuristic stopping rules could retrieve 95% of relevant abstracts, with the most significant gains achieved by stopping the screening process after classifying 7% of irrelevant papers. The performance of the heuristic stopping criteria depended on the active learning algorithm used, the length, and the proportion of relevant papers in the database. This research provides empirical evidence on the effectiveness of machine learning screening algorithms for abstract screening in systematic reviews in education and educational psychology. [Extracted from the article]
- Published
- 2024
22. Event-Triggered Optimized Control for Nonlinear Delayed Stochastic Systems.
- Author
-
Zhang, Guoping and Zhu, Quanxin
- Subjects
STOCHASTIC systems ,ADAPTIVE fuzzy control ,FUZZY logic ,ALGORITHMS ,DYNAMIC programming ,FUZZY systems - Abstract
This paper is concerned with the problem of event-triggered optimized control for uncertain nonlinear Itô-type stochastic systems with time-delay and unknown dynamic. By using fuzzy logic systems to approximate two unknown nonlinear functions with the delayed state and current state, respectively. The adaptive identifier is constructed to determine the stochastic system, and the optimized control is designed by using the identifier and adaptive dynamic programming (ADP) of actor-critic architecture. Almost all of the works are concentrated on ADP-based optimal control and it will inevitably cause the complexity of computation and requirements of persistence excitation (PE) assumption. In this paper, the ADP algorithm is obtained based on the negative gradient of a simple positive function (equivalent to the HJB equation), and so the proposed optimal control is simple and can release the PE assumption. Moreover, the event-triggered control approach is proposed to reduce computing burden and communication resources. Furthermore, we prove that the states of system and FLSs parameter errors are semi-globally uniformly ultimately bounded (SGUUB) in mean square via the adaptive identifier and the Lyapunov direct method as well as identifier-actor-critic architecture-based ADP algorithm. Finally, the effectiveness of the proposed method is illustrated through two numerical examples. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
23. FPGA Implementation of Reconfigurable CORDIC Algorithm and a Memristive Chaotic System With Transcendental Nonlinearities.
- Author
-
Mohamed, Sara M., Sayed, Wafaa S., Radwan, Ahmed G., and Said, Lobna A.
- Subjects
TRANSCENDENTAL functions ,MATHEMATICAL functions ,FIELD programmable gate arrays ,ALGORITHMS - Abstract
Coordinate Rotation Digital Computer (CORDIC) is a robust iterative algorithm that computes many transcendental mathematical functions. This paper proposes a reconfigurable CORDIC hardware design and FPGA realization that includes all possible configurations of the CORDIC algorithm. The proposed architecture is introduced in two approaches: multiplier-less and single multiplier approaches, each with its advantages. Compared to recent related works, the proposed implementation overpasses them in the included number of configurations. Additionally, it demonstrates efficient hardware utilization and suitability for potential applications. Furthermore, the proposed design is applied to a memristive chaotic system with different transcendental functions computed using the proposed reconfigurable block. The memristive system design is realized on the Artix-7 FPGA board, yielding throughputs of 0.4483 and 0.3972 Gbit/s for the two approaches of reconfigurable CORDIC. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
24. On Sampled Metrics for Item Recommendation.
- Author
-
Krichene, Walid and Rendle, Steffen
- Subjects
RECOMMENDER systems ,INFORMATION filtering systems ,INTERNET ,ALGORITHMS ,SOFTWARE measurement - Abstract
Recommender systems personalize content by recommending items to users. Item recommendation algorithms are evaluated by metrics that compare the positions of truly relevant items among the recommended items. To speed up the computation of metrics, recent work often uses sampled metrics where only a smaller set of random items and the relevant items are ranked. This paper investigates such sampled metrics in more detail and shows that they are inconsistent with their exact counterpart, in the sense that they do not persist relative statements, for example, recommender A is better than B, not even in expectation. Moreover, the smaller the sample size, the less difference there is between metrics, and for very small sample size, all metrics collapse to the AUC metric. We show that it is possible to improve the quality of the sampled metrics by applying a correction, obtained by minimizing different criteria. We conclude with an empirical evaluation of the naive sampled metrics and their corrected variants. To summarize, our work suggests that sampling should be avoided for metric calculation, however if an experimental study needs to sample, the proposed corrections can improve the quality of the estimate. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. Analyzing the Impact of Memristor Variability on Crossbar Implementation of Regression Algorithms With Smart Weight Update Pulsing Techniques.
- Author
-
Afshari, Sahra, Musisi-Nkambwe, Mirembe, and Sanchez Esqueda, Ivan Sanchez
- Subjects
ALGORITHMS ,MEMRISTORS ,COMPUTER architecture ,MATHEMATICAL models ,INTEGRATING circuits - Abstract
This paper presents an extensive study of linear and logistic regression algorithms implemented with 1T1R memristor crossbars arrays. Using a sophisticated simulation platform that wraps circuit-level simulations of 1T1R crossbars and physics-based models of RRAM (memristors), we elucidate the impact of device variability on algorithm accuracy, convergence rate and precision. Moreover, a smart pulsing strategy is proposed for practical implementation of synaptic weight updates that can accelerate training in real crossbar architectures. Stochastic multi-variable linear regression shows robustness to memristor variability in terms of prediction accuracy but reveals impact on convergence rate and precision. Similarly, the stochastic logistic regression crossbar implementation reveals immunity to memristor variability as determined by negligible effects on image classification accuracy but indicates an impact on training performance manifested as reduced convergence rate and degraded precision. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
26. Research Results from Sichuan University of Science and Engineering Update Knowledge of Science and Technology (Age-appropriate design of smart senior care product APP interface based on deep learning).
- Subjects
DEEP learning ,LIFE sciences ,ENGINEERING ,MOBILE apps ,REPORTERS & reporting - Abstract
A study conducted by researchers at Sichuan University of Science and Engineering in China explores the design of smart senior care (SSC) product app interfaces for the elderly. The researchers use deep learning (DL) technology to optimize the app interface design, taking into consideration the cognitive characteristics and habits of the elderly. The study finds that the proposed model based on the deep-Q-network (DQN) algorithm significantly improves the user experience and satisfaction of the elderly, enhancing their ability to utilize smart products and improve their quality of life. The research provides valuable insights for further research and practice in related fields. [Extracted from the article]
- Published
- 2024
27. A hybrid data driven framework considering feature extraction for battery state of health estimation and remaining useful life prediction.
- Subjects
REMAINING useful life ,FEATURE extraction ,OPTIMIZATION algorithms ,STATISTICAL learning ,INFORMATION technology - Abstract
A paper published in the journal Green Energy and Intelligent Transportation proposes a hybrid data-driven framework for battery state of health (SOH) estimation and remaining useful life (RUL) prediction. The framework combines the Variational Mode Decomposition (VMD) method, the improved Sparrow Search Algorithm (ISSA), and the Multi-Kernel Support Vector Regression (MKSVR) model. The researchers use eight features obtained through feature extraction and apply VMD to stabilize the capacity data. They also use an elite chaotic opposition-learning strategy and adaptive weights to optimize the SSA algorithm and improve prediction accuracy. Experimental verification using a dataset from NASA shows that the VMD-ISSA-MKSVR framework has the smallest errors in SOH estimation and RUL prediction, demonstrating high accuracy and stability. [Extracted from the article]
- Published
- 2024
28. A New Full Chaos Coupled Mapping Lattice and Its Application in Privacy Image Encryption.
- Author
-
Wang, Xingyuan and Liu, Pengbo
- Subjects
IMAGE encryption ,PRIVACY ,DYNAMICAL systems ,HEURISTIC algorithms ,CRYPTOGRAPHY ,ALGORITHMS - Abstract
Since chaotic cryptography has a long-term problem of dynamic degradation, this paper presents proof that chaotic systems resist dynamic degradation through theoretical analysis. Based on this proof, a novel one-dimensional two-parameter with a wide-range system mixed coupled map lattice model (TWMCML) is given. The evaluation of TWMCML shows that the system has the characteristics of strong chaos, high sensitivity, broader parameter ranges and wider chaos range, which helps to enhance the security of chaotic sequences. Based on the excellent performance of TWMCML, it is applied to the newly proposed encryption algorithm. The algorithm realizes double protection of private images under the premise of ensuring efficiency and safety. First, the important information of the image is extracted by edge detection technology. Then the important area is scrambled by the three-dimensional bit-level coupled XOR method. Finally, the global image is more fully confused by the dynamic index diffusion formula. The simulation experiment verified the effectiveness of the algorithm for grayscale and color images. Security tests show that the application of TWMCML makes the encryption algorithm have a better ability to overcome conventional attacks. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
29. Finite-/Fixed-Time Synchronization of Memristor Chaotic Systems and Image Encryption Application.
- Author
-
Wang, Leimin, Jiang, Shan, Ge, Ming-Feng, Hu, Cheng, and Hu, Junhao
- Subjects
SLIDING mode control ,CHAOS synchronization ,IMAGE encryption ,IMAGING systems ,LYAPUNOV stability ,ALGORITHMS - Abstract
In this paper, a unified framework is proposed to address the synchronization problem of memristor chaotic systems (MCSs) via the sliding-mode control method. By employing the presented unified framework, the finite-time and fixed-time synchronization of MCSs can be realized simultaneously. On the one hand, based on the Lyapunov stability and sliding-mode control theories, the finite-/fixed-time synchronization results are obtained. It is proved that the trajectories of error states come near and get to the designed sliding-mode surface, stay on it accordingly and approach the origin in a finite/fixed time. On the other hand, we develop an image encryption algorithm as well as its implementation process to show the application of the synchronization. Finally, the theoretical results and the corresponding image encryption application are carried out by numerical simulations and statistical performances. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
30. Fault Modeling and Efficient Testing of Memristor-Based Memory.
- Author
-
Liu, Peng, You, Zhiqiang, Wu, Jigang, Liu, Bosheng, Han, Yinhe, and Chakrabarty, Krishnendu
- Subjects
BRIDGE defects ,MEMORY testing ,ALGORITHMS ,DISCRETE Fourier transforms ,OPTICAL disks ,MEMRISTORS - Abstract
Memristor-based memory technology is one of the emerging memory technologies, which is a potential candidate to replace traditional memories. Efficient test solutions are required to enable the quality and reliability of such products. In previous works, fault models are caused by open, short and bridge defects and parametric variations during the fabrication. However, these fault models cannot describe the bridge defects that cause the state of the faulty cell to an undefined state. In this paper, we analyze the different effects of bridge defects and aggregate their faulty behavior into new fault models, undefined coupling fault and dynamic undefined coupling fault. In addition, an enhanced March algorithm is designed to detect all the modeled faults. In one resistor crossbar with $N$ memristors, the enhanced March algorithm requires $8N$ write and $7N$ read operations with negligible hardware overhead. To reduce the test time, a March RC algorithm is proposed based on read operations with new reference currents, which requires $4N+2$ write and $6N$ read operations. Analytical results show that the proposed test algorithms can detect all the modeled faults outperforming all the previous methods. Subsequently, a Design-for-Testability scheme is proposed to implement March RC algorithm with a little area overhead. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
31. The Impact of Device Uniformity on Functionality of Analog Passively-Integrated Memristive Circuits.
- Author
-
Fahimi, Z., Mahmoodi, M. R., Klachko, M., Nili, H., and Strukov, D. B.
- Subjects
UNIFORMITY ,MEMRISTORS ,COMPUTER systems ,ANALOG circuits ,ALGORITHMS ,NEUROMORPHICS - Abstract
Passively-integrated memristors are the most prospective candidates for designing high-speed, energy-efficient, and compact neuromorphic circuits. Despite all the promising properties, experimental demonstrations of passive memristive crossbars have been limited to circuits with few thousands of devices until now, which stems from the strict uniformity requirements on the IV characteristics of memristors. This paper expands upon this vital challenge and investigates how uniformity impacts the computing accuracy of analog memristive circuits, focusing on neuromorphic applications. Specifically, the paper explores the tradeoffs between computing accuracy, crossbar size, switching threshold variations, and target precision. All-embracing simulations of matrix multipliers and deep neural networks on CIFAR-10 and ImageNet datasets have been carried out to evaluate the role of uniformity on the accuracy of computing systems. Further, we study three post-fabrication methods that increase the accuracy of nonuniform 0T1R neuromorphic circuits: hardware-aware training, improved tuning algorithm, and switching threshold modification. The application of these techniques allows us to implement advanced deep neural networks with almost no accuracy drop, using current state-of-the-art analog 0T1R technology. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
32. A Smoothed LASSO-Based DNN Sparsification Technique.
- Author
-
Koneru, Basava Naga Girish, Chandrachoodan, Nitin, and Vasudevan, Vinita
- Subjects
ERROR functions ,ALGORITHMS ,APPROXIMATION algorithms ,SMOOTHNESS of functions ,COST functions - Abstract
Deep Neural Networks (DNNs) are increasingly being used in a variety of applications. However, DNNs have huge computational and memory requirements. One way to reduce these requirements is to sparsify DNNs by using smoothed LASSO (Least Absolute Shrinkage and Selection Operator) functions. In this paper, we show that irrespective of error profile, the sparsity values obtained using various smoothed LASSO functions are similar, provided the maximum error of these functions with respect to the LASSO function is the same. We also propose a layer-wise DNN pruning algorithm, where the layers are pruned based on their individual allocated accuracy loss budget, determined by estimates of the reduction in number of multiply-accumulate operations (in convolutional layers) and weights (in fully connected layers). Further, the structured LASSO variants in both convolutional and fully connected layers are explored within the smoothed LASSO framework and the tradeoffs involved are discussed. The efficacy of proposed algorithm in enhancing the sparsity within the allowed degradation in DNN accuracy and results obtained on structured LASSO variants are shown on MNIST, SVHN, CIFAR-10, and Imagenette datasets and on larger networks such as ResNet-50 and Mobilenet. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
33. University of Florence Researcher Broadens Understanding of Artificial Intelligence (A Comprehensive Review of Fault Diagnosis and Prognosis Techniques in High Voltage and Medium Voltage Electrical Power Lines).
- Subjects
ELECTRIC power ,ARTIFICIAL intelligence ,ELECTRIC lines ,HIGH voltages ,FAULT diagnosis ,DIAGNOSIS methods - Abstract
A new report from the University of Florence in Italy provides an extensive review of monitoring methods for electrical power lines, with a focus on high-voltage and medium-voltage systems. The objective of these techniques is to prevent catastrophic failures by detecting partial damage or deterioration of components and allowing for organized maintenance operations. The paper discusses the coordination of protection devices and the implementation of artificial intelligence algorithms to improve the reliability of the network. It also highlights diagnostic techniques, protection devices, and prognostic methods, emphasizing the role of artificial intelligence and offering guidelines for choosing between different approaches. [Extracted from the article]
- Published
- 2023
34. Novel approach to stability analysis of DC drive with parameter uncertainty and perturbation in feedback system.
- Author
-
Gopi, Pasala
- Subjects
PSYCHOLOGICAL feedback ,ALGORITHMS - Abstract
Purpose: The purpose of this study is to analyze direct current (DC) drive stability, including parameter uncertainty and perturbation in the feedback loop, by computing disk margins. Design/methodology/approach: Although the closed-loop stability analysis of a DC drive has been presented well in the referenced papers, the effect of parameter uncertainty and perturbation in the feedback loop has not yet been discussed well. In this study, the conventional and disk-based stability margins were measured and compared for the nominal parameters of the DC drive. Subsequently, the smallest disk-based margins that destabilize the feedback loop for a given perturbation are computed and compared with normal disk margins. Findings: The disk-based margin offered by the DC drive controlled by the JAYA-PID controller is disk gain margins (DGM) = 8.41 dB and disk phase margin (DPM) = 48.410 and the smallest disk-based margin offered is DGM = 1.51 dB and DPM = 9.950. In addition, the effect of the modeled uncertainty on the disk stability margins was analyzed, and it was observed that the maximum allowable parameter uncertainty with the JAYA controller was 73% of its nominal parameters. The simulation results were validated using an experimental testbed. Originality/value: This research work is not published anywhere else. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
35. User value identification based on an improved consumer value segmentation algorithm.
- Author
-
Qi, Jianfang, Li, Yue, Jin, Haibin, Feng, Jianying, and Mu, Weisong
- Subjects
CONSUMERS ,ALGORITHMS ,MARKETING ,TARGET marketing ,MARKET segmentation - Abstract
Purpose: The purpose of this study is to propose a new consumer value segmentation method for low-dimensional dense market datasets to quickly detect and cluster the most profitable customers for the enterprises. Design/methodology/approach: In this study, the comprehensive segmentation bases (CSB) with richer meanings were obtained by introducing the weighted recency-frequency-monetary (RFM) model into the common segmentation bases (SB). Further, a new market segmentation method, the CSB-MBK algorithm was proposed by integrating the CSB model and the mini-batch k-means (MBK) clustering algorithm. Findings: The results show that our proposed CSB model can reflect consumers' contributions to a market, as well as improve the clustering performance. Moreover, the proposed CSB-MBK algorithm is demonstrably superior to the SB-MBK, CSB-KMA and CSB-Chameleon algorithms with respect to the Silhouette Coefficient (SC), the Calinski-Harabasz (CH) Index , the average running time and superior to the SB-MBK, RFM-MBK and WRFM-MBK algorithms in terms of the inter-market value and characteristic differentiation. Practical implications: This paper provides a tool for decision-makers and marketers to segment a market quickly, which can help them grasp consumers' activity, loyalty, purchasing power and other characteristics in a target market timely and achieve the precision marketing. Originality/value: This study is the first to introduce the CSB-MBK algorithm for identifying valuable customers through the comprehensive consideration of the clustering quality, consumer value and segmentation speed. Moreover, the CSB-MBK algorithm can be considered for applications in other markets. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
36. Tidy Towers: A tale of two towers.
- Author
-
Shasha, Dennis
- Subjects
ALGORITHMS ,BLOCKS (Toys) ,STRATEGY games - Abstract
The author presents a set of puzzles involving tidy towers, a colored block stacking puzzle. First, several scenarios related to the puzzle are presented and solved. Lastly, the author presents two puzzles and information is provided for readers to submit their solutions.
- Published
- 2023
- Full Text
- View/download PDF
37. Constructing Higher-Dimensional Digital Chaotic Systems via Loop-State Contraction Algorithm.
- Author
-
Wang, Qianxue, Yu, Simin, Guyeux, Christophe, and Wang, Wei
- Subjects
PROBLEM solving ,ALGORITHMS ,TIME series analysis ,COMPACT spaces (Topology) - Abstract
This paper aims to refine and expand the theoretical and application framework of higher-dimensional digital chaotic system (HDDCS). Topological mixing for HDDCS is strictly proved theoretically at first. Topological mixing implies Devaney’s definition of chaos in a compact space, but not vice versa. Therefore, the proof of topological mixing promotes the theoretical research of HDDCS. Then, a general design method for constructing HDDCS via loop-state contraction algorithm is given. The construction of the iterative function uncontrolled by random sequences (hereafter called iterative function) is the starting point of this research. On this basis, this paper put forward a general design method to solve the construction problem of HDDCS, and several examples illustrate the effectiveness and feasibility of this method. The adjacency matrix corresponding to the designed HDDCS is used to construct the chaotic Echo State Network (ESN) for predicting Mackey-Glass time series. Compared with other ESNs, the chaotic ESN has better prediction performance and is able to accurately predict a much longer period of time. [ABSTRACT FROM AUTHOR]
- Published
- 2021
- Full Text
- View/download PDF
38. Dynamic Deadband Event-Triggered Strategy for Distributed Adaptive Consensus Control With Applications to Circuit Systems.
- Author
-
Xu, Yong, Sun, Jian, Pan, Ya-Jun, and Wu, Zheng-Guang
- Subjects
MULTIAGENT systems ,SELF-tuning controllers ,DATA transmission systems ,DATA reduction ,ADAPTIVE control systems ,ALGORITHMS - Abstract
This paper focuses on the distributed consensus seeking of multi-agent systems (MASs) with discrete-time control updating and intermittent communications among agents. Compared with existing linearly coupled protocols, a nonlinear coupled Zeno-free event-triggered controller is first proposed, which is further to project the static and dynamic triggering mechanisms exploited by using the deadband control method. Then, the node-based nonlinear coupled adaptive event-triggered controller with online self-tuning of time-varying coupling weight and its corresponding to static and dynamic deadband-based event-triggered mechanisms are designed, respectively. The exploited adaptive event-triggered controller does not rely on any global information of interaction structure and is implemented in a fully distributed fashion. In addition, two dynamic proposals not only cover existing static strategies as special cases, but also show that the minimal inter-execution time of dynamic one is not smaller than that of static one. Theoretical analysis shows that the proposed static and dynamic deadband-based event-triggered mechanisms can not only ensure the average consensus with Zeno-freeness, but also achieve the data reduction of communication and control. Finally, the proposed algorithms applied to circuit implementation are corroborated to prove its practical merits and validity. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
39. Beijing Institute of Technology Researcher Provides Details of New Studies and Findings in the Area of Movement Disorders (Deep learning in the assessment of movement disorders in Parkinson's disease).
- Subjects
CENTRAL nervous system diseases ,BASAL ganglia diseases ,NEUROLOGICAL disorders ,PARKINSONIAN disorders ,PARKINSON'S disease ,MOVEMENT disorders - Abstract
Researchers from the Beijing Institute of Technology in China have proposed a new method for assessing and diagnosing movement disorders in Parkinson's disease using deep learning algorithms. The method involves using the Kinect algorithm to capture and analyze human skeletal points, and then applying a dynamic time regularization algorithm for movement disorder assessment. The researchers found that their algorithm performed better than existing methods, with an error close to 0.03s when compared to a gold-standard motion capture system. This research provides a valuable and feasible approach for assessing Parkinson's dyskinesia. [Extracted from the article]
- Published
- 2024
40. A time two-grid algorithm for two-dimensional nonlinear time-fractional partial integro-differential equations.
- Author
-
Mei, Yusha, Cui, Mingrong, and Zeng, Fanhai
- Subjects
- *
INTEGRO-differential equations , *ALGORITHMS , *FINITE difference method , *NONLINEAR systems , *GRIDS (Cartography) - Abstract
In this paper, a temporal second order two-grid difference scheme is proposed for the two-dimensional nonlinear time-fractional partial integro-differential equations with a weakly singular kernel. The first-order backward difference and L 1 formula are used in the temporal direction to estimate the first level of time, the L 2 − 1 σ formula and L 1 -type formula are used in the temporal direction for later time steps, and the central difference formula is used in the spatial directions. To improve the computational efficiency of nonlinear system, an efficient time two-grid algorithm is proposed. This algorithm firstly solves a nonlinear system on the coarse grid, and then the Lagrangian linear interpolation is applied on the coarse grid to estimate the function values on the fine grid. The stability and convergence of the two-grid difference scheme are analyzed by the energy method. The convergence order of the two-grid difference scheme is O (τ F 2 + τ C 4 + h x 2 + h y 2) , where τ F and τ C are the time step sizes of fine grid and coarse grid respectively, while h x and h y are the space step sizes. Numerical experiments show that the accuracy of the theoretical analysis and the efficiency of the two-grid algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Researchers at Hamad Bin Khalifa University Zero in on Machine Learning (EEG Signal Processing for Medical Diagnosis, Healthcare, and Monitoring: A Comprehensive Review).
- Subjects
SIGNAL processing ,DIAGNOSIS ,MACHINE learning ,RESEARCH personnel ,DIGITAL signal processing ,CLINICAL trials monitoring - Abstract
A recent study conducted by researchers at Hamad Bin Khalifa University in Doha, Qatar, focuses on the use of machine learning and digital signal processing to improve the analysis of electroencephalogram (EEG) signals for medical diagnosis. EEG is a safe and common test that records electrical signals from the brain and has various applications in diagnosing conditions such as epilepsy, Alzheimer's, brain tumors, sleep disorders, and stroke. The study provides a comprehensive review of recent approaches for EEG preprocessing, feature extraction, and diagnosis of brain disorders, aiming to identify reliable algorithms for improving the accuracy of automatic diagnostic systems. The research concludes that the paper can be a valuable resource for researchers and practitioners in the field, offering insights into recent developments and future research directions. [Extracted from the article]
- Published
- 2024
42. Guiding principles to address bias in healthcare algorithms.
- Subjects
ALGORITHMIC bias ,RACE discrimination ,INSTITUTIONAL racism ,DISCRIMINATION in medical care ,RACIAL inequality ,HEALTH equity - Abstract
A paper published in JAMA Network Open discusses the issue of bias in healthcare algorithms and provides guiding principles to address this problem. The paper supports the Biden Administration's Executive Order on advancing racial equity and preventing discrimination. The technical expert panel, supported by various healthcare organizations, developed a conceptual framework to address structural racism and discrimination in algorithms. The paper emphasizes the importance of understanding and mitigating algorithmic bias to promote health equity. [Extracted from the article]
- Published
- 2024
43. Distributed mirror descent algorithm over unbalanced digraphs based on gradient weighting technique.
- Author
-
Shi, Chong-Xiao and Yang, Guang-Hong
- Subjects
- *
DISTRIBUTED algorithms , *ALGORITHMS , *COST functions , *TIME perspective , *MIRRORS - Abstract
This paper studies the mirror descent algorithm for distributed optimization, where the underlying digraph is assumed to be weight-unbalanced. Within this framework, a novel distributed mirror descent algorithm based on gradient weighting technique is developed. Theoretically, different from the existing works, which prove that the function value corresponding to the estimates converge to the optimal value of the optimization problem, this paper proves that (1) the proposed algorithm can achieve exact convergence of the estimates to the solution of the optimization problem; and (2) the algorithm has a convergence rate O (1 T) with a given time horizon T. Further, taking into account the fact that the cost functions in many significant optimization problems are dynamic, the distributed online optimization based on the proposed algorithm is studied. Especially, it is shown that the individual regret of the proposed algorithm is bounded by O (T). Finally, the theoretical results are verified through some simulation examples. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
44. Specification transformation method for functional program generation based on partition-recursion refinement rule.
- Author
-
Zuo, Zhengkang, Zeng, Zhicheng, Su, Wei, Huang, Qing, Ke, Yuhan, Liu, Zengxin, Wang, Changjing, and Liang, Wei
- Subjects
- *
MULTIPLICATION , *POLYNOMIALS , *PROTOTYPES , *ALGORITHMS , *COMPUTER software - Abstract
Implementations that follow the functional programming paradigm are being used in more and more domains. As functional programming paradigm has mathematical reference transparency, refinement to functional programs contributes to improving the reliability of the transformation process and simplifying the refinement steps. However, it is a challenge to generate functional programs from specifications. Most existing transformation methods refine specifications into abstract algorithm-level programs based on loop invariants rather than functional programs. This paper proposes a novel functional program generation method based on the partition-recursion refinement rule. It establishes a novel program refinement framework based on functional theory for the first time. This is the first study to regard the whole program refinement process as a composition of abstract functions. This paper designs a recurrence-based algorithm design language (Radl+) and implements a software prototype to map Radl+ algorithms into executable Haskell programs. To prove the feasibility and efficiency of this method, this paper transforms the polynomial multiplication problem from a specification into an executable Haskell program. This case shows that compared with existing approaches, the proposed method can simplify the transformation steps and reduce the number of lines of generated code from 38 to 10. • Novel refinement framework provides a new approach to generating a functional program. • The composition of abstract functions explains the program refinement process. • Substitution rule and Recursion rule have none of the side effects. • Software prototype transforms the polynomial multiplication problem into Haskell program. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
45. Comparison of population-based algorithms for parameter identification for induction machine modeling.
- Author
-
Benninger, Moritz, Liebschner, Marcus, and Kreischer, Christian
- Subjects
PARTICLE swarm optimization ,PARAMETER identification ,INDUCTION machinery ,INDUCTION motors ,OPTIMIZATION algorithms ,DIFFERENTIAL evolution ,SQUIRREL cage motors ,ALGORITHMS - Abstract
Purpose: Monitoring and diagnosis of fault cases for squirrel cage induction motors can be implemented using the multiple coupled circuit model. However, the identification of the associated model parameters for a specific machine is problematic. Up to now, the main options are measurement and test procedures or the use of finite element method analyses. However, these approaches are very costly and not suitable for use in an industrial application. The purpose of this paper is a practical parameter identification based on optimization methods and a comparison of different algorithms for this task. Design/methodology/approach: Population-based metaheuristics are used to determine the parameters for the multiple coupled circuit model. For this purpose, a search space for the required parameters is defined without an elaborate analytical approach. Subsequently, a genetic algorithm, the differential evolution algorithm and particle swarm optimization are tested and compared. The algorithms use the weighted mean squared error (MSE) between the real measured data of stator currents as well as speed and the simulation results of the model as a fitness function. Findings: The results of the parameter identification show that the applied methodology generally works and all three optimization algorithms fulfill the task. The differential evolution algorithm performs best, with a weighted MSE of 2.62, the lowest error after 1,000 simulations. In addition, this algorithm achieves the lowest overall error of all algorithms after only 740 simulations. The determined parameters do not completely match the parameters of the real machine, but still result in a very good reproduction of the dynamic behavior of the induction motor with squirrel cage. Originality/value: The value of the presented method lies in the application of condition-based maintenance of electric drives in the industry, which is performed based on the multiple coupled circuit model. With a parameterized model, various healthy as well as faulty states can be calculated and thus, in the future, monitoring and diagnosis of faults of the respective motor can be performed. Essential for this, however, are the parameters adapted to the respective machine. With the described method, an automated parameter identification can be realized without great effort as a basis for an intelligent and condition-oriented maintenance. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
46. An integrated enabling technology interfacing multiple space/time methods/algorithms/domains with model reduction for first-order systems.
- Author
-
Tae, David and Tamma, Kumar K.
- Subjects
ALGEBRAIC equations ,NUMERICAL analysis ,ALGORITHMS ,PROPER orthogonal decomposition ,DIFFERENTIAL equations ,REDUCED-order models - Abstract
Purpose: The purpose of this study is to further advance the multiple space/time subdomain framework with model reduction. Existing linear multistep (LMS) methods that are second-order time accurate, and useful for practical applications, have a significant limitation. They do not account for separable controllable numerical dissipation of the primary variables. Furthermore, they have little or no significant choices of altogether different algorithms that can be integrated in a single analysis to mitigate numerical oscillations that may occur. In lieu of such limitations, under the generalized single-step single-solve (GS4) umbrella, several of the deficiencies are circumvented. Design/methodology/approach: The GS4 framework encompasses a wide variety of LMS schemes that are all second-order time accurate and offers controllable numerical dissipation. Unlike existing state-of-art, the present framework permits implicit–implicit and implicit–explicit coupling of algorithms via differential algebraic equations (DAE). As further advancement, this study embeds proper orthogonal decomposition (POD) to further reduce model sizes. This study also uses an iterative convergence check in acquiring sufficient snapshot data to adequately capture the physics to prescribed accuracy requirements. Simple linear/nonlinear transient numerical examples are presented to provide proof of concept. Findings: The present DAE-GS4-POD framework has the flexibility of using different spatial methods and different time integration algorithms in altogether different subdomains in conjunction with the POD to advance and improve the computational efficiency. Originality/value: The novelty of this paper is the addition of reduced order modeling features, how it applies to the previous DAE-GS4 framework and the improvement of the computational efficiency. The proposed framework/tool kit provides all the needed flexibility, robustness and adaptability for engineering computations. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
47. Low-Complexity and Low-Latency SVC Decoding Architecture Using Modified MAP-SP Algorithm.
- Author
-
Hong, Seungwoo, Kam, Dongyun, Yun, Sangbu, Choe, Jeongwon, Lee, Namyoon, and Lee, Youngjoo
- Subjects
DECODING algorithms ,ALGORITHMS ,STATIC VAR compensators ,COMPUTER architecture ,PARALLEL processing - Abstract
The compressive sensing (CS) based sparse vector coding (SVC) method is one of the promising ways for the next-generation ultra-reliable and low-latency communications. In this paper, we present advanced algorithm-hardware co-optimization schemes for realizing a cost-effective SVC decoding architecture. The previous maximum a posteriori subspace pursuit (MAP-SP) algorithm is newly modified to relax the computational overheads by applying novel residual forwarding and LLR approximation schemes. A fully-pipelined parallel hardware is also developed to support the modified decoding algorithm, reducing the overall processing latency, especially at the support identification step. In addition, an advanced least-square-problem solver is presented by utilizing the parallel Cholesky decomposer design, further reducing the decoding latency with parallel updates of support values. The implementation results from a 22nm FinFET technology showed that the fully-optimized design is 9.6 times faster while improving the area efficiency by 12 times compared to the baseline realization. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
48. Advanced AI and Machine Learning Techniques and Algorithms in Cancer Research.
- Subjects
MACHINE learning ,ARTIFICIAL intelligence ,CANCER research ,TECHNOLOGICAL innovations - Abstract
This article discusses the integration of Artificial Intelligence (AI) and Machine Learning (ML) technologies in cancer research. It highlights how these technologies are transforming the diagnosis, treatment, and prevention of cancer by providing sophisticated analytical capabilities. The paper explores the mathematical foundations and practical implementations of AI and ML techniques in various aspects of cancer research, including detection, diagnosis, prognosis, and personalized treatment strategies. It also reviews influential algorithms such as Support Vector Machines (SVM), Convolutional Neural Networks (CNNs), and clustering techniques, and their roles in improving diagnostic accuracy and treatment efficacy. Please note that this preprint has not been peer-reviewed. [Extracted from the article]
- Published
- 2024
49. Forecasting annual foreign tourist arrivals to China by incorporating firefly algorithm into fractional non-homogenous discrete Grey model.
- Author
-
Tang, Xiaozhong, Xie, Naiming, and Hu, Aqin
- Subjects
INBOUND tourism ,FORECASTING ,TOURISTS ,ALGORITHMS ,PRIVATE sector - Abstract
Purpose: Accurate foreign tourist arrivals forecasting can help public and private sectors to formulate scientific tourism planning and improve the allocation efficiency of tourism resources. This paper aims to address the problem of low prediction accuracy of Chinese inbound tourism demand caused by the lack of valid historical data. Design/methodology/approach: A novel hybrid Chinese inbound tourism demand forecasting model combining fractional non-homogenous discrete grey model and firefly algorithm is constructed. In the proposed model, all adjustable parameters of the fractional non-homogenous discrete grey model are optimized simultaneously by the firefly algorithm. Findings: The data sets of annual foreign tourist arrivals to China are used to verify the validity of the proposed model. Experimental results show that the proposed method is effective and can be used as a useful predictor for the prediction of Chinese inbound tourism demand. Originality/value: The method proposed in this paper is effective and can be used as a feasible approach for forecasting the development trend of Chinese inbound tourism. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
50. Ontology alignment evaluation for online assessment of e-learners: a new e-learning management system.
- Author
-
B.R., Rajakumar, Yenduri, Gokul, Vyas, Sumit, and D., Binu
- Subjects
SEQUENTIAL pattern mining ,ONTOLOGY ,DIGITAL learning ,LEARNING Management System ,HIERARCHICAL clustering (Cluster analysis) ,MATHEMATICAL optimization - Abstract
Purpose: This paper aims to propose a new assessment system module for handling the comprehensive answers written through the answer interface. Design/methodology/approach: The working principle is under three major phases: Preliminary semantic processing: In the pre-processing work, the keywords are extracted for each answer given by the course instructor. In fact, this answer is actually considered as the key to evaluating the answers written by the e-learners. Keyword and semantic processing of e-learners for hierarchical clustering-based ontology construction: For each answer given by each student, the keywords and the semantic information are extracted and clustered (hierarchical clustering) using a new improved rider optimization algorithm known as Rider with Randomized Overtaker Update (RR-OU). Ontology matching evaluation: Once the ontology structures are completed, a new alignment procedure is used to find out the similarity between two different documents. Moreover, the objects defined in this work focuses on "how exactly the matching process is done for evaluating the document." Finally, the e-learners are classified based on their grades. Findings: On observing the outcomes, the proposed model shows less relative mean squared error measure when weights were (0.5, 0, 0.5), and it was 71.78% and 16.92% better than the error values attained for (0, 0.5, 0.5) and (0.5, 0.5, 0). On examining the outcomes, the values of error attained for (1, 0, 0) were found to be lower than the values when weights were (0, 0, 1) and (0, 1, 0). Here, the mean absolute error (MAE) measure for weight (1, 0, 0) was 33.99% and 51.52% better than the MAE value for weights (0, 0, 1) and (0, 1, 0). On analyzing the overall error analysis, the mean absolute percentage error of the implemented RR-OU model was 3.74% and 56.53% better than k-means and collaborative filtering + Onto + sequential pattern mining models, respectively. Originality/value: This paper adopts the latest optimization algorithm called RR-OU for proposing a new assessment system module for handling the comprehensive answers written through the answer interface. To the best of the authors' knowledge, this is the first work that uses RR-OU-based optimization for developing a new ontology alignment-based online assessment of e-learners. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.