9,333 results
Search Results
2. Impact of learning effect modelling in flowshop scheduling with makespan minimisation based on the Nawaz-Enscore-Ham algorithm.
- Author
-
Paredes-Astudillo, Yenny Alexandra, Botta-Genoulaz, Valérie, and Montoya-Torres, Jairo R.
- Subjects
SIMULATED annealing ,PRODUCTION scheduling ,SCHEDULING ,ALGORITHMS ,SCHOOL schedules - Abstract
Inspired by real-life applications, mainly in hand-intensive manufacturing, the incorporation of learning effects into scheduling problems has garnered attention in recent years. This paper deals with the flowshop scheduling problem with a learning effect, when minimising the makespan. Four approaches to model the learning effect, well-known in the literature, are considered. Mathematical models are providing for each case. A solver allows us to find the optimal solution in small problem instances, while a Simulated Annealing algorithm is proposed to deal with large problem instances. In the latter, the initial solution is obtained using the well-known Nawaz-Enscore-Ham algorithm, and two local search operators are evaluated. Computational experiments are carried out using benchmark datasets from the literature. The Simulated Annealing algorithm shows a better result for learning approaches with fast learning effects as compared to slow learning effects. Finally, for industrial decision makers, some insights about how the learning effect model might affect the makespan minimisation flowshop scheduling problem are presented. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
3. Recursive decomposition/aggregation algorithms for performance metrics calculation in multi-level assembly/disassembly production systems with exponential reliability machines.
- Author
-
Bai, Yishu and Zhang, Liang
- Subjects
RELIABILITY in engineering ,MANUFACTURING processes ,VIRTUAL machine systems ,ALGORITHMS ,MACHINERY - Abstract
Developing accurate and computationally efficient algorithms for system performance metrics calculation is critical to implementing effective control and optimization in manufacturing system operations. In this paper, we propose a recursive decomposition/aggregation-based method for calculating the performance metrics of assembly/disassembly systems with multiple merge/split operations and sub-assemblies. It is assumed that the machines follow the exponential reliability model and the buffers are of finite capacity. To achieve this, we first consider assembly systems with multiple component lines merging at a single assembly operation. By decomposing the system into a set of virtual serial lines, we derive an analytical procedure to approximate the starvation and blockage probabilities of the merge operation, which are used to recursively update the parameters of the virtual serial lines. Then, the performance metrics of the original assembly system are approximated based on the corresponding machines and buffers in these virtual serial lines. Next, we extend the algorithm to assembly/disassembly systems with multiple merge/split operations and sub-assemblies. This is accomplished by identifying the so-called assembly/disassembly units formed based on the virtual serial lines and applying the calculations derived earlier recursively. Simulation experiments are carried out to justify the convergence, computational efficiency, and approximation accuracy of the proposed algorithms. An industrial case study is presented to demonstrate the theoretical methods in practical applications. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
4. 100 Years of the Ubiquitous Traffic Lights: An All-Round Review.
- Author
-
Kulkarni, Ashish R., Kumar, Narendra, and Ramachandra Rao, K.
- Subjects
AUTONOMOUS vehicles ,TRAFFIC signs & signals ,TRAVEL delays & cancellations ,RESEARCH personnel ,TRAFFIC engineering - Abstract
Three-colour four-way traffic light completed 100 years in 2020. Even though the traffic light in the form of Semaphore arms has been in use in London since 1868, electric traffic lights came into existence in 1912 and the standard three-colour four-way light in 1920. Research is continuously being carried out to develop better algorithms to improve safety, reduce travel delays, and optimize road capacity. Hence a review of the evolution of traffic lights is warranted. This paper presents an all-round review using a six-prong approach. Timeline of the evolution of the literature in the last 100 years, the evolution of hardware, algorithms, traffic control schemes, standards and the pedestrian lights and count down timer are the six areas in which the review is carried out. A timeline of the different keywords related to the various algorithms in use is presented. This article delves into the thinking and meticulous approach of early researchers and practitioners of the field while dwelling on the past. They laid the rock-solid foundation of today's research. Also, future research areas like connected vehicles and automated vehicles are pointed out, and a summary of the findings is presented at the end. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
5. A concise guide to scheduling with learning and deteriorating effects.
- Author
-
Pei, Jun, Zhou, Ya, Yan, Ping, and Pardalos, Panos M.
- Subjects
TECHNOLOGICAL innovations ,EVIDENCE gaps ,SCHEDULING ,MANUFACTURING processes ,CRITICAL analysis - Abstract
In practical manufacturing systems, the job processing time usually varies with the performance change of manufacturing resources, among which the learning and deteriorating effects are typical characteristics. Due to the interests from both academic exploration and industrial innovation, the research on scheduling problems with these effects is abundant and diverse. However, some studied problems need to be strengthened in combination with realistic production scenarios. This paper provides a concise guide to scheduling problems with these effects, giving a comprehensive review and critical hints for future research. A novel classification scheme is designed based on four levels of different domains, i.e. effects, processing ways, processing time functions, and manufacturing environments. Based on this scheme, the scheduling problems are first distinguished into three categories: learning effects, deteriorating effects, and combined effects. In each category, models are then refined along three lines: general processing way, batch scheduling, and group scheduling. Combined with the attributes of actual processing time functions and manufacturing environments, the evolvement of related scheduling models and a critical analysis on the proposed algorithms are well analysed. Afterwards, the research gaps are revealed and the research directions are indicated from the perspectives of practical applications, time functions, and designed algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
6. Revisit the scheduling problem with assignable or generalized due dates to minimize total weighted late work.
- Author
-
Chen, Rubing, Gao, Yuan, Geng, Zhichao, and Yuan, Jinjiang
- Subjects
POLYNOMIAL time algorithms ,NP-hard problems ,SCHEDULING ,ALGORITHMS ,WORKING hours - Abstract
We revisit the single-machine scheduling for minimising the total weighted late work with assignable due dates (ADD-scheduling) and generalised due dates (GDD-scheduling). In particular, we consider the following three problems: (i) the GDD-scheduling problem for minimising the total weighted late work, (ii) the ADD-scheduling problem for minimising the total weighted late work, and (iii) the ADD-scheduling problem for minimising the total late work. In the literature, the above three problems are proved to be NP-hard, but their exact complexity (unary NP-hardness or pseudo-polynomial-time solvability) are unknown. In this paper, we address these open problems by showing that the first two problems are unary NP-hard and the third problem admits pseudo-polynomial-time algorithms. For the third problem, we also present a 2-approximation solution and a fully polynomial-time approximation scheme. Computational experiments show that our algorithms and solutions are efficient. When the jobs have identical processing times, we further present more efficient polynomial-time algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
7. Predicting Money Laundering Using Machine Learning and Artificial Neural Networks Algorithms in Banks.
- Author
-
Lokanan, Mark E.
- Subjects
ARTIFICIAL neural networks ,MONEY laundering ,MACHINE learning ,ALGORITHMS ,RANDOM forest algorithms - Abstract
This paper aims to build a machine learning and a neural network model to detect the probability of money laundering in banks. The paper's data came from a simulation of actual transactions flagged for money laundering in Middle Eastern banks. The main findings highlight that criminal networks mainly use the integration stage to integrate money into the financial system. Fraudsters prefer to launder funds in the early hours, morning followed by the business day's afternoon time intervals. Additionally, the Naïve Bayes and Random Forest classifiers were identified as the two best-performing models to predict bank money laundering transactions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
8. A hybrid column-generation and genetic algorithm approach for solving large-scale multimission selective maintenance problems in serial K-out-of-n:G systems.
- Author
-
O'Neil, Ryan, Diallo, Claver, Khatab, Abdelhakim, and Aghezzaf, El-Houssain
- Subjects
GENETIC algorithms ,MATHEMATICAL programming ,NONLINEAR programming ,METAHEURISTIC algorithms ,ALGORITHMS - Abstract
This paper introduces a solution method for the multimission selective maintenance problem (SMP) that combines column-generation (CG) and genetic algorithms (GAs). The multimission SMP is an optimisation problem that arises when a system performs a sequence of missions separated by breaks of finite duration. During these finite breaks, only a subset of possible maintenance actions can be performed due to resource limitations. The problem is in deciding what actions to perform during each break duration such that the system meets or exceeds a minimum target reliability for all missions. The resulting optimisation problems are usually modelled as mixed integer nonlinear mathematical programmes, which are hard to solve. They are usually solved using metaheuristics. We propose a solution method based on CG framework in which the subproblems are solved using a GA. By integrating the GA within the classical CG framework, high-quality solutions can be obtained very quickly. The proposed solution method is capable of solving systems composed of both parallel and k-out-of-n:G subsystems. This hybrid CG algorithm is shown to obtain near optimal solutions and outperform other metaheuristic solution methods; it is also shown to be capable of solving large-scale systems composed of many subsystems and hundreds of components in a reasonable amount of time. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
9. Approximate model and algorithms for precast supply chain scheduling problem with time-dependent transportation times.
- Author
-
Xiong, Fuli, Chen, Siyuan, Ma, Zongfang, and Li, Linlin
- Subjects
SUPPLY chain disruptions ,GREEDY algorithms ,HEURISTIC programming ,ALGORITHMS ,DYNAMIC programming ,TARDINESS - Abstract
This paper focuses on the precast supply chain scheduling problem with time-dependent transportation time to minimise the total weighted tardiness (PSCSP_TDT |TWT). In the problem, an order sequence and several job sequences are to be determined simultaneously. At first, through in-depth analysis of problem structure and real data from a precast manufacturer, we approximate the problem into a three-stage order scheduling problem by combining the seven production stages into one differentiation stage, and then explore some useful properties of the schedules for the approximate problem. Subsequently, to solve the small instances for the PSCSP_TDT |TWT, we propose an approximate model-based hybrid dynamic programming and heuristic (AMHDPH) and obtain a lower bound as a by-product of the algorithm. For dealing with medium-or large instances, with considering the complexity of the problem, we propose four approximate model-based hybrid iterated greedy (AMHIG) algorithms by integration of constructive heuristics, structural properties of solutions, an iterated greedy, and a correction heuristic. Comprehensive computational results show that the AMHDPH generates tight lower bounds for small instances and solves the most of small instances to optimality within 60 seconds. Whereas the best AMHIG generates feasible solutions with an average optimality gap below 5 percent for around 70 percent instances. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
10. Scientific papers and artificial intelligence. Brave new world?
- Author
-
Nexøe, Jørgen
- Subjects
COMPUTERS ,MANUSCRIPTS ,ARTIFICIAL intelligence ,MACHINE learning ,DATA analysis ,MEDICAL literature ,MEDICAL research ,ALGORITHMS - Published
- 2023
- Full Text
- View/download PDF
11. Delayed impulsive stabilisation of discrete-time systems: a periodic event-triggering algorithm.
- Author
-
Zhang, Kexue and Braverman, Elena
- Subjects
DISCRETE-time systems ,ALGORITHMS - Abstract
This paper studies the problem of event-triggered impulsive control for discrete-time systems. A novel periodic event-triggering scheme with two tunable parameters is presented to determine the moments of updating impulsive control signals which are called event times. Sufficient conditions are established to guarantee asymptotic stability of the resulting impulsive systems. It is worth mentioning that the event times are different from the impulse times, that is, the control signals are updated at each event time but the actuator performs the impulsive control tasks at a later time due to time delays. The effectiveness of our theoretical result with the proposed scheme is illustrated by three examples. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
12. Comparative Performance Study of DVR Using Adaptive LMS Filtering-Based Algorithms.
- Author
-
Kassarwani, Neelam, Ohri, Jyoti, and Singh, Alka
- Subjects
FILTERS & filtration ,PERFORMANCE theory ,ADAPTIVE control systems ,ALGORITHMS ,COMPARATIVE studies - Abstract
In the distribution system, voltage sags and swell have adverse effects on sensitive and critical loads. Dynamic Voltage Restorer (DVR) play a vital role to mitigate voltage sags and swell through its organized control when connected in series with the system. Various conventional control schemes have been reported for the control of DVR. The performance of DVR with these schemes has been successful in the mitigation of voltage sags/swell, but drawbacks, such as undershoot, and overshoot during sag dynamics are observed in the regulated load terminal voltage. These drawbacks may cause malfunctioning of the equipment connected and hence their elimination is indispensable. With this inspiration, a novel Adaline filter-based adaptive control scheme using learning-rate parameter-based Least-Mean-Square algorithm has been proposed. This scheme has the capability to overcome the drawbacks with the conventional control schemes thus improving the performance of DVR. In this paper, the performance of DVR using proposed algorithm is compared with that using synchronous reference frame (SRF)-based conventional control scheme. The performance is studied and validated through simulation results under different voltage sag and swell conditions in MATLAB software using Sim Power System toolboxes. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
13. SPCTRE: sparsity-constrained fully-digital reservoir computing architecture on FPGA.
- Author
-
Abe, Yuki, Nishida, Kohei, Ando, Kota, and Asai, Tetsuya
- Subjects
ARCHITECTURAL design ,ARTIFICIAL intelligence ,PARALLEL processing ,PARALLEL programming ,ALGORITHMS - Abstract
This paper proposes an unconventional architecture and algorithm for implementing reservoir computing on FPGA. An architecture-oriented algorithm with improved throughput and architecture designed to reduce memory and hardware resource requirements are presented. The proposed architecture exhibits good performance in terms of benchmarks for reservoir computing. A prediction accelerator for reservoir computing that operates on 55.45 mW at 450 K fps with <3000 LEs is realized by implementing the architecture on FPGA. The proposed approach presents a novel FPGA implementation of reservoir computing focussing on both algorithms and architecture that may serve as a basis for applications of AI at network edge. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
14. A robust false discovery rate controlling procedure using the empirical likelihood with a fast algorithm.
- Author
-
Park, Hoyoung and Park, Junyong
- Subjects
FALSE discovery rate ,GAUSSIAN distribution ,ROBUST control ,ALGORITHMS ,PARAMETRIC modeling - Abstract
This paper introduces a robust procedure for controlling the false discovery rate utilizing empirical likelihood. Traditional approaches assume a normal or parametric distribution as the null distribution. However, it may be challenging to constrain the null distribution within specific parametric models. We focus on the cases where the null distribution may not precisely follow a normal distribution. Multiple testing procedures based on exact normality can lead to misleading outcomes. To address this issue, we adopt the empirical likelihood to estimate the null distribution. Additionally, we introduce the concept of a pilot distribution to establish constraints on the null distribution, which aids in estimating the empirical null distribution. We present a fast algorithm and provide theoretical justification for its efficiency. Furthermore, simulation studies demonstrate that our method outperforms existing approaches in controlling the false discovery rate. We also include examples involving gene expression data and compare the performance of different methods. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
15. A dynamic simultaneous algorithm for solving split equality fixed point problems.
- Author
-
Dong, Qiao-Li, Liu, Lulu, and Gibali, Aviv
- Subjects
ALGORITHMS - Abstract
Our study in this paper is focused on the split equality fixed-point problem with firmly quasi-non-expansive operators in infinite-dimensional Hilbert spaces. A self-adaptive simultaneous scheme is introduced, and its weak convergence is established under mild and standard assumptions. The new proposed scheme generalizes and extends some related works in the literature, and its simple structure makes it easy for implementation and numerical testing. Primary experiments presented in this paper, in finite- and infinite-dimensional spaces, emphasize their practical advantages over existing results. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
16. 'I'm not bad, I'm just ... drawn that way': media and algorithmic systems logics in the Italian Google Images construction of (cr)immigrants' communities.
- Author
-
Ieracitano, Francesca, Vigneri, Francesco, and Comunello, Francesca
- Abstract
The paper aims at creating a bridge between media and migration studies and critical algorithm studies. By adopting a media ecological approach and a mutual shaping of technology and society perspective, in this paper, we explore the factors that lead, especially in Italy, to discriminant and stigmatizing image search results, related to specific groups of immigrants living in the country. We performed a content analysis of Google-Images search results with regard to the largest immigrant communities hosted in France, Germany, Italy, and the United Kingdom. Results show that the depiction of Romanian, Albanian, Moroccan, and Algerian immigrant communities on Google.it is flattened on a univocal stigmatized representation that shows them as criminals, which is not the case in other countries. Most of these stigmatizing images derive from local online newspapers, which questions the interplay between newsmaking choices and routines, and algorithms logics. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
17. Multi-objective optimisation of high-speed rail profile with small radius curve based on NSGA-II Algorithm.
- Author
-
Li, Guofang, Li, Xing, Li, Meng, Na, Tong, Wu, Shaopei, and Ding, Wangcai
- Subjects
MECHANICAL wear ,THEORY of distributions (Functional analysis) ,ALGORITHMS ,PARETO optimum ,HIGH speed trains ,MATHEMATICAL models ,RADIUS (Geometry) - Abstract
The multi-objective optimisation of high-speed rail profile with small radius curve is studied in the paper. A multi-objective mathematical model for rail profile optimisation of high-speed railway is established. The CN60 rail profile is parameterised into a series of generalised functions of design variables. In order to guarantee the smoothness of the rail profile and meet the maximum grinding depth of rail in China, the constraints are employed. The wheel-rail vertical clearance and equivalent conicity of wheelset are taken as objective functions, and a rail wear prediction programme is compiled. Contact line method is employed to complete the detection algorithm of wheel-rail contact points. Finally, NSGA-II Algorithm is adopted to solve the Pareto-optimal front of the optimisation model. A set of solutions are retrieved from the Pareto optimal front solution as the optimised profile. The optimised rail profile and the original rail profile are matched with the LMA wheel profile (a certain worn type of wheel profiles for EMU in China) respectively. It is testified that the rail profile could effectively reduce the rail wear and improve curving performance. The new method proposed in this paper can provide some reference for the optimisation design of high-speed rail profile with small radius curve. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
18. Data feminism and border ethics: power, invisibility and indeterminacy.
- Author
-
Turculet, Georgiana
- Subjects
FEMINISM ,HUMAN mechanics ,DIGITIZATION - Abstract
Human activities are being increasingly regulated by means of technologies. Smart borders regulating human movement are no exception. I argue that the process of digitization – including through AI, Big Data and algorithmic processing – falls short of respecting (fundamental) rights to the extent to which it ignores what I term to be the problem of indeterminacy. While adopting a data feminist approach in this paper, assuming that data is the 'new oil', that is power, I begin theorizing indeterminacy from the imminent risks of datafication as a new instrument of oppression perpetuating injustice and widening inequality gaps. I conclude that technologies regulating human activities must stand ethical scrutiny, especially if they can and do result in (human) rights violations. Unlike the oil being extracted from the ground, data is de facto extracted from people endowed with agency, autonomy, rights and contexts – all which ought to be respected and protected. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
19. Efficient path planning for automated guided vehicles using A* (Astar) algorithm incorporating turning costs in search heuristic.
- Author
-
Fransen, Karlijn and van Eekelen, Joost
- Subjects
AUTOMATED guided vehicle systems ,AUTOMATED planning & scheduling ,HEURISTIC ,TRAVEL time (Traffic engineering) ,ALGORITHMS ,COST - Abstract
The path planned for an automated guided vehicle in, for example, a production facility is often the lowest-cost path in a (weighted) geometric graph. The weights in the graph may represent a distance or travel time. Sometimes turning costs are taken into account; turns (and decelerations before and accelerations after turning) take time, so it is desirable to minimise turns in the path. Several well-known algorithms can be used to find the lowest-cost path in a geometric graph. In this paper, we focus on the A ∗ algorithm, which uses an (internal) search heuristic to find the lowest-cost path. In the current literature, generally, either turning costs are not taken into account in the heuristic or the heuristic can only be used for specific graph structures. We propose an improved heuristic for the A ∗ algorithm that can be used to find the lowest-cost path in a geometric graph with turning costs. Our heuristic is proven to be monotone and admissible. Moreover, our heuristic provides a higher lower bound estimate for the actual costs compared to other heuristics found in the literature, causing the lowest-cost path to be found faster (i.e. with less iterations). We validate this through an extensive comparative study. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
20. A two-stage stochastic programming model for collaborative asset protection routing problem enhanced with machine learning: a learning-based matheuristic algorithm.
- Author
-
Nikzad, Erfaneh and Bashiri, Mahdi
- Subjects
STOCHASTIC programming ,ASSET protection ,STOCHASTIC models ,MACHINE learning ,ARTIFICIAL neural networks ,ALGORITHMS - Abstract
In this paper, a two-stage stochastic mathematical model is developed for an asset protection routing problem under a wildfire. The main aim of this study is to reduce the negative impact of a wildfire. Some parameters, such as travel and service times, obtaining profit by protecting an asset, and upper bounds of time windows, are considered as stochastic parameters. Generating proper scenarios for uncertain parameters has a large impact on the accuracy of the obtained solutions. Therefore, artificial neural networks are employed to extract possible scenarios according to previous actual wildfire events. The problem cannot be solved by exact solvers for large instances, so two matheuristic algorithms are proposed in this study to solve the problem in a reasonable time. In the first algorithm, a set of feasible routes is generated based on a heuristic approach, then a route-based mathematical model is used to obtain the final solution. Also, another matheuristic algorithm based on adaptive large neighbourhood search (ALNS) is proposed. In this algorithm, routing decisions are determined using the ALNS algorithm while other decisions are achieved by solving an intermediate mathematical model. The numerical analysis confirms the efficiency of both proposed algorithms; however, the first algorithm performs more efficiently. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
21. An improved model and exact algorithm using local branching for the inventory-routing problem with time windows.
- Author
-
Demantova, Bruno E., Scarpin, Cassius T., Coelho, Leandro C., and Darvish, Maryam
- Subjects
ALGORITHMS ,VEHICLE routing problem ,AUTHORSHIP ,ROUTING algorithms - Abstract
The Inventory-Routing Problem (IRP) deals with the joint optimisation of inventory and the associated routing decisions. The IRP with time windows (IRPTW) considers time windows for the deliveries to the customers. Due to its importance and several real-world applications, in this paper, we develop an intricate solution algorithm for this problem. A combination of tools ranging from established groups of valid inequalities, pre-processing techniques, local search procedures, and a local branching algorithm is utilised to solve the IRPTW efficiently. We compare the performance of our algorithm on a benchmark set of instances and show how our solution algorithm provides promising results against a competing algorithm from the literature. Moreover, the results of our study provide an overview of the performance of several already proposed techniques and their integration in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
22. Dynamic resource levelling in projects under uncertainty.
- Author
-
Li, Hongbo, Zhang, Xianchao, Sun, Jinshuai, and Dong, Xuebing
- Subjects
DYNAMIC programming ,MARKOV processes ,SCHEDULING ,PROJECT management ,METAHEURISTIC algorithms ,ALGORITHMS ,DISTRIBUTED algorithms ,DECODING algorithms - Abstract
In the resource levelling problem (RLP) under uncertainty, existing studies focus on obtaining an open-loop activity list that is not updated during project execution. In project management practice, it is also necessary to address more situations, such as activity overlaps and resource breakdowns. In this paper, we extend the uncertain RLP by proposing a resource levelling problem with multiple uncertainties (RLP-MU) that simultaneously considers uncertainties in activity durations, activity overlaps and resource availabilities. We formulate the RLP-MU as a Markov decision process model. Aimed at levelling resource usage by dynamically scheduling activities at each decision point based on the observed information, we develop a hybrid open–closed-loop approximate dynamic programming algorithm (HOC-ADP). In the HOC-ADP, we devise a closed-loop rollout policy to approximate the cost-to-go function and use the concept of the average project to avoid time-consuming simulation. A greedy-decoding-based estimation of distributed algorithm is also devised to construct an open-loop policy that is embedded in the HOC-ADP to further improve it. We additionally develop a simulation algorithm to evaluate the resource levelling performance of the HOC-ADP. Computational experiments on a benchmark dataset consisting of 540 problem instances are conducted to analyze the performance of the HOC-ADP, and the impact of various factors on resource levelling are investigated. The comparison experimental results indicate that our HOC-ADP outperforms the state-of-the-art meta-heuristics. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
23. Lp minimisation in sparse array beamforming using semidefinite relaxation.
- Author
-
Agarwal, Kanika, Rai, Chandra Shekhar, and Yadav, Rajni
- Subjects
BEAMFORMING ,WASTE minimization ,ALGORITHMS - Abstract
The paper considers the design of sparse arrays in the interference active environment to minimise the system complexity and achieve reduced hardware cost. For this, we propose a sparse array design methodology to attain maximum signal-to-interference plus noise ratio (MaxSINR) in the presence of interfering signals. We formulate the optimisation problem as a real-valued quadratically constrained quadratic program (QCQP) with the non-convex $\textstyle\ell_p$ ℓ p norm to promote sparsity, which is iteratively controlled in the proposed approach. We employ the semidefinite relaxation (SDR) technique and the principle of the majorization-minimisation (MM) algorithm to solve the non-convex QCQP problem. The efficacy of the proposed algorithm is demonstrated through the simulation results. The sparse array obtained through the proposed method performs well when compared with the reweighted $\textstyle\ell_1$ ℓ 1 algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
24. A two-stage robust hub location problem with accelerated Benders decomposition algorithm.
- Author
-
Rahmati, Reza, Bashiri, Mahdi, Nikzad, Erfaneh, and Siadat, Ali
- Subjects
LOCATION problems (Programming) ,ALGORITHMS ,NUMERICAL analysis ,PROBLEM solving ,UNCERTAIN systems - Abstract
In this paper, a two-stage robust optimisation is presented for an uncapacitated hub location problem in which demand is uncertain and the level of conservatism is controlled by an uncertainty budget. In the first stage, locations for establishing hub facilities were determined, and allocation decisions were made in the second stage. An accelerated Benders decomposition algorithm was used to solve the problem. Computational experiments showed better results in terms of number of iterations and computation time for Benders decomposition with Pareto-optimal cuts in comparison with the classical Benders decomposition algorithm. According to numerical analysis, it was concluded that increasing the uncertainty budget also increased total costs for more established hubs. To determine the uncertainty budget in an appropriate manner, a new expected aggregate function was introduced. The numerical studies demonstrated the usefulness of the proposed method in defining the appropriate uncertainty budget in the presence of uncertainty. [ABSTRACT FROM AUTHOR]
- Published
- 2022
- Full Text
- View/download PDF
25. Composite rating method: Application to European basketball leagues.
- Author
-
Ambrutis, Andrius and Povilaitis, Mantas
- Subjects
PREDICTION models ,TEAM sports ,COLLECTIVE efficacy ,SPORTS events ,CONCEPTUAL structures ,BASKETBALL ,ATHLETIC ability ,FORECASTING ,ALGORITHMS - Abstract
This paper introduces the Composite Rating Method (CRM), a novel approach for the integrated evaluation of basketball player and team performances across multiple leagues. Utilizing data from Euroleague, EuroCup, and Basketball Champions League, the presented method provides comprehensive and accurate rankings, including accounting for actions not included in personal statistics. Drawing inspiration from established methodologies such as ELO, PER, Offensive and Defensive ratings, CRM offers a balanced assessment of player and team capabilities. The paper delineates the data collection and preprocessing procedures, details the algorithmic framework of CRM, and showcases its predictive capacity. By presenting a well-rounded approach to ranking, this paper aims to contribute to the advancement of performance evaluation methods in basketball and sports in general. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
26. A Reduced Switch Count Multilevel Inverter for PV Standalone System using Modified JAYA Algorithm.
- Author
-
Mohanty, Rupali, Chatterjee, Debasish, Suman, Swati, and Anand, Mukul
- Subjects
PARTICLE swarm optimization ,ELECTRIC inverters ,PHOTOVOLTAIC power systems ,ALGORITHMS - Abstract
This paper introduces a hybrid multilevel inverter (MLI) with reduced switch count, which can generate higher output voltage level with minimum number of DC input sources. The operation of this proposed MLI is carried out with unequal DC sources to achieve the desired output voltage level. The reduced MLI output voltage is set to minimal total harmonic distortion (THD) with the help of modified JAYA (MJAYA) algorithm. A JAYA algorithm with improved steps by adopting an accelerating parameter has been proposed in this research work to obtain a faster convergence of the objective function. The MJAYA algorithm has provided the suitable switching angles for the proposed three-phase 15-level MLI and reduced the output voltage THD to 2.23%, which satisfies the standard set by IEEE-519. To prove the efficiency of this proposed modified algorithm, the comparative analysis is carried out through MATLAB program and Simulink tool using common JAYA and modified particle swarm optimisation algorithms. The performance and productivity of the proposed MLI have been investigated through simulation and experimental setups. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
27. Branch-and-price-and-cut algorithm for the capacitated single allocation hub location routeing problem.
- Author
-
Wu, Yuehui, Qureshi, Ali Gul, Yamada, Tadashi, and Yu, Shanchuan
- Subjects
ALGORITHMS ,PROBLEM solving ,PRICES - Abstract
The paper focuses on a variant of hub location routeing problem arising in the design of intra-city express service networks, named as capacitated single allocation hub location routeing problem, in which each non-hub node should be served by exactly one hub, and both hub capacity and vehicle capacity are considered. A new mixed-integer programming formulation for the problem is provided, and a solution algorithm is developed on the basis of the column generation scheme to exactly solve the problem for the first time. The pricing subproblem is solved by a bidirectional labelling algorithm, and the master problem is strengthened by valid inequalities. Numerical experiments are conducted on the instances generated from the Australian Post dataset to test the performance of the model and the developed algorithm. Computational results prove that the algorithm outperforms the CPLEX and is able to provide optimal solutions for instances with up to 35 non-hub nodes and high-quality solutions for instances with 40 non-hub nodes within reasonable computational time, which indicates the feasibility and efficiency of the model and algorithm proposed. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
28. A new nonmonotone line search method for nonsmooth nonconvex optimization.
- Author
-
Akbari, Z.
- Subjects
NONSMOOTH optimization ,MONOTONE operators ,ALGORITHMS - Abstract
In this paper, we develop a nonmonotone line search strategy for minimization of the locally Lipschitz functions. First, the descent direction (DD) is defined based on ∂ϵf(⋅) where ϵ>0 . Next, we introduce a minimization algorithm to find a step length along the DD satisfying the nonsmooth nonmonotone Armijo condition. Choosing an adequate step length is the main purpose of the classic nonmonotone line search methods for a given DD, while in this paper both a search direction and step length are simultaneously computed. The global convergence of the minimization algorithm is proved by some assumptions on the DD. Finally, the proposed algorithm is implemented in the MATLAB environment and compared with another existing nonsmooth algorithm on some nonconvex nonsmooth optimization test problems. The efficiency of the proposed algorithm is shown by numerical results in solving some small-scale and large-scale nonsmooth optimization test problems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
29. Trace maximization algorithm for the approximate tensor diagonalization.
- Author
-
Begović Kovač, Erna and Perković, Ana
- Subjects
EXPECTATION-maximization algorithms ,ALGORITHMS ,LEAST squares - Abstract
In this paper, we develop a Jacobi-type algorithm for the approximate diagonalization of tensors of order $ d\geq 3 $ d ≥ 3 via tensor trace maximization. For a general tensor, this is an alternating least squares algorithm and the rotation matrices are chosen in each mode one-by-one to maximize the tensor trace. On the other hand, for symmetric tensors, we discuss a structure-preserving variant of this algorithm where in each iteration the same rotation is applied in all modes. We show that both versions of the algorithm converge to the stationary points of the corresponding objective functions. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
30. An AES Implementation with Improved PDL Based PUF Key Generator for IoT Devices.
- Author
-
Boke, Amol K., Nakhate, Sangeeta, and Rajawat, Arvind
- Subjects
INTERNET of things ,PHYSICAL mobility ,CRYPTOGRAPHY ,PUBLIC key cryptography ,ALGORITHMS - Abstract
In recent days, cryptographic algorithm hardware is the need of IoT devices. However, limited resources demand an efficient approach towards designing the said cryptographic algorithm hardware. This paper introduces the PUF (Physical Unclonable Function) based approach to design the key generator used in cryptographic algorithm hardware to minimize the area and power consumption. A customizable key generation unit has been introduced in the form of a Standard Synchronization Unit (SSU) to match the desired key size requirements. The results were generated with PUF based designs from literature and compared with the proposed PDL (Programmable Delay Logic) PUF. All parameters considered, a proposed PDL PUF key generator is an efficient option that can be integrated with an Advanced Encryption System (AES) as the key generator. The modified AES design result was compared with the literature's results on the Xilinx Virtex XC7VX690T platform. The modified AES is an efficient solution with 12.10% less area consumption and a 44.51% increase in throughput. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
31. Contexts and dimensions of algorithm literacies: Parents' algorithm literacies amidst the datafication of parenthood.
- Author
-
Das, Ranjana
- Subjects
PROTOCOL analysis (Cognition) ,PARENTHOOD ,PARENTS ,DIGITAL literacy ,ALGORITHMS ,MEDIA literacy - Abstract
In this paper, I present contextualizing factors, dimensions, and key markers of algorithm literacies, paying attention to the context of parenting and parenthood amidst datafication. Analyzing data from "think-aloud" interviews with 30 parents of children aged between 0 and 18, across England, I draw upon media and digital literacies scholarship to focus, first, in this paper, on the competencies, conversations, and events which contextualize parents' literacies with algorithmic interfaces. Next, I draw out four dimensions of parents' algorithm literacies including algorithm awareness, technical competencies, critical capacities, and championing their and their children's best interests, identifying practical markers for each dimension. I reflect on the broader implications of these for parenting and parenthood in datafied societies, and note that algorithm literacies are, forever, a work in progress, in fluidity and flux across the diverse courses of parenting journeys, deeply contextualized in the resources and restraints that parents encounter in their daily lives. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
32. Machine learning techniques for emotion detection and sentiment analysis: current state, challenges, and future directions.
- Author
-
Alslaity, Alaa and Orji, Rita
- Subjects
SENTIMENT analysis ,DEEP learning ,RESEARCH evaluation ,USER interfaces ,MACHINE learning ,TREATMENT effectiveness ,BEHAVIORAL objectives (Education) ,COMPARATIVE studies ,COMMUNICATION ,FACTOR analysis ,RESEARCH funding ,EMOTIONS ,THEMATIC analysis ,BEHAVIOR modification ,ALGORITHMS - Abstract
Emotion detection and Sentiment analysis techniques are used to understand polarity or emotions expressed by people in many cases, especially during interactive systems use. Recognizing users' emotions is an important topic for human–computer interaction. Computers that recognize emotions would provide more natural interactions. Also, emotion detection helps design human-centred systems that provide adaptable behaviour change interventions based on users' emotions. The growing capability of machine learning to analyze big data and extract emotions therein has led to a surge in research in this domain. With this increased attention, it becomes essential to investigate this research area and provide a comprehensive review of the current state. In this paper, we conduct a systematic review of 123 papers on machine learning-based emotion detection to investigate research trends along many themes, including machine learning approaches, application domain, data, evaluation, and outcome. The results demonstrate: 1) increasing interest in this domain, 2) supervised machine learning (namely, SVM and Naïve Bayes) are the most popular algorithms, 3) Text datasets in the English language are the most common data source, and 4) most research use Accuracy to evaluate performance. Based on the findings, we suggest future directions and recommendations for developing human-centred systems. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
33. Alkaline: A Simplified Post-Quantum Encryption Algorithm for Classroom Use.
- Author
-
Holden, Joshua
- Subjects
ABSTRACT algebra ,CRYPTOGRAPHY ,LINEAR algebra ,CLASSROOMS ,ALGORITHMS ,DATA encryption ,TEACHING methods ,PUBLIC key cryptography - Abstract
This paper describes Alkaline, a size-reduced version of Kyber, which has recently been announced as a prototype NIST standard for post-quantum public-key cryptography. While not as simple as RSA, I believe that Alkaline can be used in an undergraduate classroom to effectively teach the techniques and principles behind Kyber and post-quantum cryptography in general. Classroom experiences with individual concepts used in Alkaline support this belief. In addition to cryptography, linear algebra and abstract algebra classes would be good candidates for the use of Alkaline. A few exercises suitable for use in these classes are included. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
34. Justice by Algorithm: The Limits of AI in Criminal Sentencing.
- Author
-
Taylor, Isaac
- Subjects
CRIMINAL sentencing ,ARTIFICIAL intelligence ,CRIMINAL justice system ,RESPONSIBILITY ,ALGORITHMS ,PUNISHMENT - Abstract
Criminal justice systems have traditionally relied heavily on human decision-making, but new technologies are increasingly supplementing the human role in this sector. This paper considers what general limits need to be placed on the use of algorithms in sentencing decisions. It argues that, even once we can build algorithms that equal human decision-making capacities, strict constraints need to be placed on how they are designed and developed. The act of condemnation is a valuable element of criminal sentencing, and using algorithms in sentencing – even in an advisory role – threatens to undermine this value. The paper argues that a principle of "meaningful public control" should be met in all sentencing decisions if they are to retain their condemnatory status. This principle requires that agents who have standing to act on behalf of the wider political community retain moral responsibility for all sentencing decisions. While this principle does not rule out the use of algorithms, it does require limits on how they are constructed. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
35. Practical perspectives on symplectic accelerated optimization.
- Author
-
Duruisseaux, Valentin and Leok, Melvin
- Subjects
OPTIMIZATION algorithms ,NUMERICAL integration ,GEOMETRIC approach ,HAMILTONIAN systems ,ALGORITHMS - Abstract
Geometric numerical integration has recently been exploited to design symplectic accelerated optimization algorithms by simulating the Bregman Lagrangian and Hamiltonian systems from the variational framework introduced by Wibisono et al. In this paper, we discuss practical considerations which can significantly boost the computational performance of these optimization algorithms and considerably simplify the tuning process. In particular, we investigate how momentum restarting schemes ameliorate computational efficiency and robustness by reducing the undesirable effect of oscillations and ease the tuning process by making time-adaptivity superfluous. We also discuss how temporal looping helps avoiding instability issues caused by numerical precision, without harming the computational efficiency of the algorithms. Finally, we compare the efficiency and robustness of different geometric integration techniques and study the effects of the different parameters in the algorithms to inform and simplify tuning in practice. From this paper emerge symplectic accelerated optimization algorithms whose computational efficiency, stability and robustness have been improved, and which are now much simpler to use and tune for practical applications. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
36. A probabilistic linguistic thermodynamic method based on the water-filling algorithm and regret theory for emergency decision making.
- Author
-
Xue, Wenting, Xu, Zeshui, and Lu, Wuhui
- Subjects
ALGORITHMS ,COMPARATIVE method - Abstract
Since thermodynamics can describe the energy of matter and its form of storage or transformation in the system, it is introduced to resolve the uncertain decision-making problems. The paper proposes the thermodynamic decision-making method which considers both the quantity and quality of the probabilistic linguistic decision information. The analogies for thermodynamical indicators: energy, exergy and entropy are developed under the probabilistic linguistic circumstance. The probabilistic linguistic thermodynamic method combines the regret theory which captures decision makers' regret-aversion and the objective weight of criterion obtained by the water-filling algorithm. The proposed method is applied to select the optimal solution to respond to the floods in Chongqing, China. The self-comparison is conducted to verify the effectiveness of the objective weight obtained by the water-filling algorithm and regret theory in the probabilistic linguistic thermodynamic method. The reliability and feasibility of the proposed method are verified by comparative analysis with other decision-making methods by some simulation experiments and non-parametric tests. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
37. A Multi-Level Multi-Objective Integer Quadratic Programming Problem Under Pentagonal Neutrosophic Environment.
- Author
-
Bekhit, N. M., Emam, O. E., and Elhamid, Laila Abd
- Subjects
QUADRATIC programming ,INTEGER programming ,LINEAR programming ,MEMBERSHIP functions (Fuzzy logic) ,ALGORITHMS - Abstract
The aim of this paper is to propose an algorithm to solve and enhance a multi-level multi-objective integer quadratic programming problem (MLMOIQPP) under a single-valued Pentagonal Neutrosophic environment applied to the objective functions. The suggested solution takes advantage of multi-objective optimization in addition to the fuzzy approach as well as the branch and bound technique, which is implemented at each decision level to develop a generalized maximization-minimization model for obtaining the integer satisfactory solution after applying the score and accuracy function in the first phase of the solution methodology to singlevalued Pentagonal Neutrosophic parameters to be converted into an equal crisp form. An illustrative example is demonstrated to validate the proposed solution algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
38. Parents' understandings of social media algorithms in children's lives in England: Misunderstandings, parked understandings, transactional understandings and proactive understandings amidst datafication.
- Author
-
Das, Ranjana
- Subjects
PARENT attitudes ,SOCIAL media ,PARENTS ,FAMILY communication ,PROTOCOL analysis (Cognition) ,ALGORITHMS ,AGING parents ,HEALTH literacy - Abstract
In this paper, I ask how parents understand and make sense of their children's relationships with social media algorithms. Drawing upon 30 think-aloud interviews with parents raising children aged 0 to 18 in England, in this paper, I pay attention to parents' understandings of and consequent approaches to platform algorithms in relation to their children's lives. I locate this work within user-centric research on people's understandings of algorithms, and research about parents' perspectives on data and datafication in relation to sharenting. Through my data, I draw out four modes – misunderstandings, parked understandings, transactional understandings and pro-active understandings. I suggest that parents' often flawed understandings of their children's myriad interfaces with algorithms deserve scrutiny not through a lens of blame or individualised parental (ir) responsibility but within cross-cutting contexts of parenting cultures and families' diverse contextual resources and restraints. I conclude by highlighting attention to parents' approaches to algorithms in children's lives as critical to parents' data and algorithm literacies. Prior State of Knowledge: Parents in diverse contexts try to understand and support their children's digital lives, and also often share content about their children on a variety of platforms. Prior research has shed significant light on the datafication of childhood. Novel Contributions: This study investigates parents' diverse understandings of algorithms underlying social media platforms and the ways in which they approach algorithms in their children's lives. Practical Implications: Parents' knowledge about algorithms and datafication is uneven. Policymakers need to better support adult media literacies, including data and algorithm literacies. Schools' communication to families and carers could also become key vehicles to raise awareness about datafication. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
39. Optimal tuning of interval type-2 fuzzy controllers for nonlinear servo systems using Slime Mould Algorithm.
- Author
-
Precup, Radu-Emil, David, Radu-Codrut, Roman, Raul-Cristian, Szedlak-Stinean, Alexandra-Iulia, and Petriu, Emil M.
- Subjects
MYXOMYCETES ,NONLINEAR systems ,ALGORITHMS ,METAHEURISTIC algorithms - Abstract
This paper presents a novel application of the metaheuristic Slime Mould Algorithm (SMA) to the optimal tuning of interval type-2 fuzzy controllers. Inserting the information feedback model F1 in SMA leads to a new version of the metaheuristic algorithm, further referred to as SMAF1. The paper discusses implementation details specific to interval type-2 fuzzy controllers for the position control of processes modelled by nonlinear servo systems with an integral component and dead zone plus saturation nonlinearity. The linear PI controllers are tuned on the basis of the Extended Symmetrical Optimum method using only one tuning parameter and next fuzzified to result in interval type-2 fuzzy controllers. The optimisation requires the minimisation of a discrete-time objective function expressed as the sum of time multiplied by squared control errors, and the vector variable is the parameter vector of the Mamdani PI fuzzy controller. Experimental results conclusively illustrate the superiority of SMAF1 and SMA in comparison with other metaheuristic algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2023
- Full Text
- View/download PDF
40. A new relaxed method for the split feasibility problem in Hilbert spaces.
- Author
-
Yu, Hai and Wang, Fenghui
- Subjects
ALGORITHMS - Abstract
In this paper, we introduce a new relaxed method for solving the split feasibility problem in Hilbert spaces. In our method, the projection to the halfspace is replaced by the one to the intersection of two halfspaces. We give convergence of the sequence generated by our method under some suitable assumptions. Finally, we give a numerical example for illustrating the efficiency and implementation of our algorithms in comparison with existing algorithms in the literature. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
41. Bio-Metric Based Colour-Image-Encryption using Multi-Chaotic Dynamical Systems and SHA-256 Hash Algorithm.
- Author
-
Rahul, B., Kuppusamy, K., and Senthilrajan, A.
- Subjects
IMAGE encryption ,DYNAMICAL systems ,ALGORITHMS ,PIXELS - Abstract
This paper proposes a user-biometric-based image encryption using chaotic dynamical systems, SHA-256 hash function, and zigzag transformation. Three chaotic systems, namely, the Henon map, logistic map, and Lorenz system, are used to apply the chaotic properties to the encryption system. The hash value of the user biometric image is used to generate the initial value of the Henon map. The initial values for the logistic map and Lorenz system are generated from the hash value of the plain image. SHA-256 hash algorithm generates the hash values of the biometric and plain images. The plain image is scrambled using the two-dimensional chaotic values generated by the Henon map first. Next, the first scrambled image's pixels are XORed with the one-dimensional chaotic values generated from the logistic map and produce the second scrambled image. Finally, take the second scrambled image's pixels, and XOR them with the three-dimensional chaotic values generated from the Lorenz system and create the final encrypted image. The robustness and flexibility of the encryption system are analyzed using various security and performance analyses. The experiment results are compared with the existing algorithms to prove the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
42. An automatic calibration algorithm for endoscopic structured light sensors in cylindrical environment.
- Author
-
Alzuhiri, Mohand, Li, Zi, Li, Jiaoyang, Rao, Adithya, and Deng, Yiming
- Subjects
PIPELINE inspection ,CALIBRATION ,NONDESTRUCTIVE testing ,DETECTORS ,ALGORITHMS ,ACQUISITION of data - Abstract
Structured light sensing systems, as one of the most common optical-based nondestructive evaluation techniques, have been widely applied for inline pipeline inspection. The sensor can be inserted inside the pipe to generate 3D visualisation and evaluate the cracks in the materials. The precise calibration of the camera-projector measurement system is of great significance to ensure the measurement accuracy of the 3D sensing system. Conventional calibration methods for structured light sensors involve complicated and time-consuming procedures and are easily affected by ambient light. The paper presents a novel algorithm to automatically calibrate the projection module and estimate the stereo parameters between the camera and the projector. The calibration algorithm exploits the cylindrical nature of the inspected pipe to create a set of geometric constraints and automatically calibrate the sensor without the need for reference calibration points. Experimental and simulation results showed that the algorithm could successfully estimate the projector's intrinsic and extrinsic parameters by simply acquiring the data inside a cylindrical pipe with a known diameter. The proposed algorithm highly reduces the data collection time for the calibration (only 53 s), improves the accuracy, and simplifies the calibration process. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
43. Lamb mode and damage identification using small-sample dictionary algorithm.
- Author
-
Li, Juanjuan
- Subjects
ENCYCLOPEDIAS & dictionaries ,LAMB waves ,LAMBS ,WAVE packets ,ALGORITHMS ,IDENTIFICATION - Abstract
In this paper, Lamb mode identification method based on small-sample dictionary algorithm is proposed and applied for the separation of specific Lamb modes, the reconstruction of Lamb waves upon propagating a certain distance and damage identification. This approach includes the creation of small-sample dictionary and querying procession in a dictionary. Firstly, Lamb wave signals upon propagating at a series of distances are simulated, and signal features, {mode, distance, time of flight (Tof), wavelet energy}, are extracted to create a dictionary; secondly, Tof of the received signal is extracted, and then Lamb modes are identified by searching the dictionary; finally, energy parameters are estimated to reconstruct wavepackets. The feasibility of this algorithm is validated in AAA laminate, and the results are presented. In a 2D-simulation model of a pitch-catch configuration, A
0 and S0 modes can be identified and reconstructed effectively when the direct waves and the reflected waves are synchronously received, with the propagation distance of 0.3 m and 0.5 m, respectively. In addition, a Lamb-wave-based delamination location is conducted in three-dimensional AAA laminate. The experimental results show that the delamination can be located relatively by combining the identified damage-scattered S0 waves and the probability-based diagnostic imaging. [ABSTRACT FROM AUTHOR]- Published
- 2024
- Full Text
- View/download PDF
44. A review of spark erosion machining efficiency, characterization and optimization techniques for ceramic composites.
- Author
-
Selvarajan, L., Venkataramanan, K, Perumal, K.P. Srinivasa, Yunus, Mohammed, Alfattani, Rami, and Aravindhan, A.
- Subjects
MATHEMATICAL optimization ,GREY relational analysis ,ELECTROCHEMICAL cutting ,MATERIALS science ,LITERATURE reviews ,RESPONSE surfaces (Statistics) - Abstract
The domain of material science has made great strides in recent years, especially in the fields of metallurgy and ceramic materials and the production of highly trustworthy, cost-effective and economically useful components for use in many industries. For the production of contours and intricate forms in conductive materials, Electrical Discharge Machining (EDM) is by far the most versatile and cost-effective alternative to standard machining processes. In-depth discussion and analysis of the following topics may be found throughout this review paper study. Surface topography and machining properties are investigated in this literature review to determine the impact of mechanical, chemical, electrochemical, and thermal material removal techniques. Different characteristics of dielectric mediums are also covered. Non-conductive and conductive ceramic composite performance characteristics, surfacetexture, mechanical and electrical qualities and geometrical tolerances are investigated as a function of electrode material. Through the perspective of composite materials, a variety of electrical discharge devices' performance metrics and properties are compared and contrasted. The performance metrics and characteristics of a wide variety of electrical discharge machines are compared and contrasted in light of the composite materials in order to identify their distinguishing characteristics. EDM research is being conducted on a variety of sophisticated conductive materials, to explore their unpredictable effects on EDM and their specialized applications. Methods for optimizing the study of composite material and their effects on EDM's numerous aspects include Design of Experiments, Analysis of Variance (ANOVA), Response Surface Methodology, Taguchi with Grey Relational Analysis, and so on. X-ray Diffraction (XRD) and Energy-Dispersive X-ray analysis (EDAX) are used to study the topography of a variety of composite materials and the latest optimization strategies are also investigated using a variety of algorithms. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
45. The importance of effectiveness versus transparency and stakeholder involvement in citizens' perception of public sector algorithms.
- Author
-
König, Pascal D., Felfeli, Julia, Achtziger, Anja, and Wenzelburger, Georg
- Subjects
PUBLIC opinion ,CITIZENS ,PUBLIC sector ,ALGORITHMS - Abstract
This paper sheds light on how much citizens value different features of public sector algorithms, specifically whether they prioritize effectiveness over transparency and stakeholder involvement in algorithm design or instead see effectiveness as less important. It does so with choice-based conjoint designs that present variants of algorithms used in policing and health care to respondents from representative German samples. Two studies with overall more than 3000 participants show that people are ready to trade away transparency and stakeholder involvement for small effectiveness gains. Citizens thus seem unlikely to demand accountable algorithms even in sensitive areas like policing and health care. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
46. Insider employee-led cyber fraud (IECF) in Indian banks: from identification to sustainable mitigation planning.
- Author
-
Roy, Neha Chhabra and Prabhakaran, Sreeleakha
- Subjects
BANKING laws ,FRAUD prevention ,CORRUPTION ,ORGANIZATIONAL behavior ,RISK assessment ,DATA security ,RANDOM forest algorithms ,COMPUTERS ,FOCUS groups ,DATA security failures ,INTERVIEWING ,DEBT ,QUESTIONNAIRES ,ARTIFICIAL intelligence ,LOGISTIC regression analysis ,IDENTITY theft ,SECURITY systems ,FINANCIAL stress ,RESEARCH methodology ,CONCEPTUAL structures ,JOB stress ,ARTIFICIAL neural networks ,MACHINE learning ,ALGORITHMS - Abstract
This paper explores the different insider employee-led cyber frauds (IECF) based on the recent large-scale fraud events of prominent Indian banking institutions. Examining the different types of fraud and appropriate control measures will protect the banking industry from fraudsters. In this study, we identify and classify Cyber Fraud (CF), map the severity of the fraud on a scale of priority, test the mitigation effectiveness, and propose optimal mitigation measures. The identification and classification of CF losses were based on a literature review and focus group discussions with risk and vigilance officers and cyber cell experts. The CF was analyzed using secondary data. We predicted and prioritized CF based on machine learning-derived Random Forest (RF). An efficient fraud mitigation model was developed based on an offender-victim-centric approach. Mitigation is advised both before and after fraud occurs. Through the findings of this research, banks and fraud investigators can prevent CF by detecting it quickly and controlling it on time. This study proposes a structured, sustainable CF mitigation plan that protects banks, employees, regulators, customers, and the economy, thus saving time, resources, and money. Further, these mitigation measures will improve the reputation of the Indian banking industry and ensure its survival. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
47. Lithium battery model parameter identification based on the GA-LM algorithm.
- Author
-
Zhao, Jinhui, Qian, Xinxin, Jiang, Bing, and Wang, Biao
- Subjects
PARAMETER identification ,LITHIUM cells ,GENETIC algorithms ,STANDARD deviations ,ELECTRIC batteries ,ALGORITHMS ,HYBRID power - Abstract
The accuracy of lithium battery model parameters is the key to lithium battery state estimation. The offline parameter identification method for lithium batteries requires the nonlinear fitting of the voltage rebound curve of the hybrid pulse discharge experiment. The genetic algorithm has a strong global search ability, but it is easy to fall into local solutions. The Levenberg-Marquardt algorithm has a strong local optimization ability, but the algorithm cannot converge when the prior value is unknown. Given the above problems, this paper proposes a parameter identification method based on the Genetic-Levenberg-Marquardt (GA-LM) algorithm, which takes the sum of the squared model voltage errors as the objective function, and predicts the initial value of the parameter vector through the GA, providing the LM algorithm with prior value. In the case of unknown prior values, the GA-LM algorithm can achieve high-precision nonlinear optimization. Finally, the simulation test under the conditions of constant current discharge and hybrid pulse power discharge. The mean absolute error, mean relative error, and root mean square error of the model voltage in the two working conditions are 7.23 mV, 0.20%, 9.61 mV, and 13.37 mV, 0.37%, 15.44 mV, which shows that the algorithm has high accuracy. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
48. A three-stub waveguide impedance matching algorithm based on equivalent circuit analysis.
- Author
-
Zhou, Danfeng, Rasool, Nouman, Tang, Zhengming, Zhu, Huacheng, and Hong, Tao
- Subjects
IMPEDANCE matching ,WAVEGUIDES ,STANDING waves ,REFLECTANCE ,ALGORITHMS ,DIELECTRIC waveguides - Abstract
Three-stub waveguide is a common impedance matching device, which is widely used in microwave impedance matching system. In this paper, an impedance matching algorithm for three-stub waveguide with large stubs is proposed based on the equivalent circuit analysis method, which can be used to realize continuous real-time impedance matching. First, the equivalent circuit of a single stub is established by using series and parallel reactance, and the equivalent circuit of three-stub waveguide is further established by cascading three single-stub models. Then, the two-port scattering parameters of three-stub waveguide, the load impedance and the impedance of three-stub waveguide are derived. In the matching process, by using the currently detected reflection coefficient and two-port scattering parameters, the terminal load impedance is calculated, and the optimal insertion depths of the stubs are finally determined by using the impedance of three-stub waveguide with different stub depths. This algorithm can reduce the voltage standing wave ratio, and can be easily redesigned for other waveguides. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
49. Exploring the Potential of Artificial Intelligence in Adolescent Suicide Prevention: Current Applications, Challenges, and Future Directions.
- Author
-
Li, Xiaoming, Chen, Fenglan, and Ma, Lijun
- Subjects
SUICIDE risk factors ,STATISTICAL models ,SOCIAL media ,ADOLESCENT health ,DIFFUSION of innovations ,SUICIDAL ideation ,PREDICTION models ,ARTIFICIAL intelligence ,SUICIDE ,PATIENT monitoring ,ALGORITHMS ,ADOLESCENCE - Abstract
The global surge in adolescent suicide necessitates the development of innovative and efficacious preventive measures. Traditionally, various approaches have been used, but with limited success. However, with the rapid advancements in artificial intelligence (AI), new possibilities have emerged. This paper reviews the potentials and challenges of integrating AI into suicide prevention strategies, focusing on adolescents. Method: This narrative review assesses the impact of AI on suicide prevention strategies, the strategies and cases of AI applications in adolescent suicide prevention, as well as the challenges faced. Through searches on the PubMed, web of science, PsycINFO, and EMBASE databases, 19 relevant articles were included in the review. Results: AI has significantly improved risk assessment and predictive modeling for identifying suicidal behavior. It has enabled the analysis of textual data through natural language processing and fostered novel intervention strategies. Although AI applications, such as chatbots and monitoring systems, show promise, they must navigate challenges like data privacy and ethical considerations. The research underscores the potential of AI to enhance future suicide prevention efforts through personalized interventions and integration with emerging technologies. Conclusion: AI possesses transformative potential for adolescent suicide prevention by offering targeted and adaptive solutions, while they also raise crucial ethical and practical considerations. Looking forward, AI can play a critical role in mitigating adolescent suicide rates, marking a new frontier in mental health care. [ABSTRACT FROM AUTHOR]
- Published
- 2024
- Full Text
- View/download PDF
50. Regulating algorithms in the digital market: a revisit of Indonesian competition law and policy.
- Author
-
Wahyuningtyas, Sih Yuliana
- Subjects
COMPUTER algorithms ,UNFAIR competition ,ANTITRUST law ,ELECTRONIC commerce ,CARTELS ,PRICE discrimination - Abstract
Although the use of algorithms has become increasingly prominent in the digital market, such algorithms are often opaque and prone to risks of making biased decisions. Algorithms could also be used to harm competition, such as by facilitating cartels. Such developments make it necessary to examine the readiness of existing competition law to tackle cases involving algorithms. This paper focuses on analysing Indonesian competition law to address the following issues: (1) how current Indonesian competition law deals with algorithms-related cases; (2) which indicators could detect anti-competitive algorithms; and (3) which competition policy approach could be considered in Indonesia to tackle the problem resulted from the use of algorithms. [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.