Search

The traditional mathematical models for solving the economic dispatch problem at the generation level primarily focus on minimizing overall operational costs while ensuring demand is met across various periods. However, contemporary power systems integrate a diverse mix of generators from both conventional and renewable energy sources, contributing to economically efficient energy production and playing a pivotal role in reducing greenhouse gas emissions. As the complexity of power systems increases, the scope of economic dispatch must expand to address demand across multiple regions, incorporating a range of objective functions that optimize energy resource utilization, reduce costs, and achieve superior economic and technical outcomes. This paper, therefore, proposes an advanced optimization model designed to determine the hourly power output of various generation units distributed across multiple areas within the power system. The model satisfies the dual objective functions and adheres to stringent technical constraints, effectively framing the problem as a nonlinear programming challenge. Furthermore, an in-depth analysis of the resulting and exchanged energy quantities demonstrates that the model guarantees the hourly demand. Significantly, the system's efficiency can be further enhanced by increasing the capacity of the interconnection links between areas, thereby generating additional savings that can be reinvested into expanding the links' capacity. Moreover, the multi-objective model excels not only in meeting the proposed objective functions but also in optimizing energy exchange across the system. This optimization is applicable to various types of energy, including thermal and renewable sources, even those characterized by uncertainty in their primary resources. The model's ability to effectively manage such uncertainties underscores its robustness, instilling confidence in its applicability and reliability across diverse energy scenarios. This adaptability makes the model a significant contribution to the field, offering a sophisticated tool for optimizing multi-area power systems in a way that balances economic, technical, and environmental considerations. [ABSTRACT FROM AUTHOR]

Abstract This paper investigates the flexural bearing behavior of reinforced concrete beams through experimental analysis and advanced machine learning predictive models. The primary problem centers around understanding how varying compositions of construction materials, particularly the inclusion of recycled aggregates and carbon fiber-reinforced polymer (CFRP), affect the structural performance of concrete beams. Eight beams, including those with natural aggregates, recycled aggregates, fly ash, and CFRP, were tested. The study employs state-of-the-art machine learning frameworks, including Random Forest Regressor (RFR), XGBoost (XGB), and LightGBM (LGBM). The formation of these models involved data acquisition from experiments, preprocessing of key input features (such as rebars area, cement portion, recycled and natural aggregate masses, silica fume, fly ash, compressive strength, and CFRP presence), model selection, and hyperparameter tuning using Pareto optimization. The models were then evaluated using performance metrics like Mean Squared Error (MSE), Mean Absolute Error (MAE), and coefficient of determination (R2). Outputs focus on load-induced deflection and mid-span displacement. With a dataset of 4851 samples, the optimized models demonstrated excellent performance. The experimental results revealed substantial enhancements in both compressive strength and load-bearing capacity, notably observed in beams incorporating 70% recycled aggregate and 10% silica fume. These beams exhibited a remarkable increase in compressive strength of up to 53.03% and a 7% boost in load-bearing capacity compared to those without recycled aggregate. By integrating experimental analysis with advanced computational techniques, this study advances the understanding of eco-friendly construction materials and their performance, shedding light on the intricate interactions between sustainable construction materials and the flexural bearing behavior of beams.

Abstract Background The aim was to investigate the noise and bias properties of quantitative 177Lu-SPECT with respect to the number of projection angles, and the number of subsets and iterations in the OS-EM reconstruction, for different total acquisition times. Methods Experimental SPECT acquisition of six spheres in a NEMA body phantom filled with 177Lu was performed, using medium-energy collimators and 120 projections with 180 s per projection. Bootstrapping was applied to generate data sets representing acquisitions with 20 to 120 projections for 10 min, 20 min, and 40 min, with 32 noise realizations per setting. Monte Carlo simulations were performed of 177Lu-DOTA-TATE in an anthropomorphic computer phantom with three tumours (2.8 mL to 40.0 mL). Projections representing 24 h and 168 h post administration were simulated, each with 32 noise realizations. Images were reconstructed using OS-EM with compensation for attenuation, scatter, and distance-dependent resolution. The number of subsets and iterations were varied within a constrained range of the product number of iterations $$\times$$ × number of projections $$\le 2400$$ ≤ 2400 . Volumes-of-interest were defined following the physical size of the spheres and tumours, the mean activity-concentrations estimated, and the absolute mean relative error and coefficient of variation (CV) over noise realizations calculated. Pareto fronts were established by analysis of CV versus mean relative error. Results Points at the Pareto fronts with low CV and high mean error resulted from using a low number of subsets, whilst points at the Pareto fronts associated with high CV but low mean error resulted from reconstructions with a high number of subsets. The number of projection angles had limited impact. Conclusions For accurate estimation of the 177Lu activity-concentration from SPECT images, the number of projection angles has limited importance, whilst the total acquisition time and the number of subsets and iterations are parameters of importance.

Credit purchase enables the manufacturers in the e-commerce environment to provide pre-sales service that consumers can experience first and pay later. This paper considers demand associated with price and green promotion service level and builds four decentralized game models to study two green promotion service allocation strategies and demand forecasting information sharing strategies in a dual-channel environment. The effects of the degree of dual-channel competition and free-riding on the perfect Bayesian Nash equilibrium are studied. The results show that the retailer should actively cooperate with the manufacturer and share private forecasting information if the coefficient of channel substitution is relatively high. Sharing information will aggravate double marginalization and hurt the retailer. In addition, the retailer's profit is positively influenced by the forecasting accuracy in four models. When the manufacturer invests in the green promotion service, the prediction accuracy hurts the manufacturer's profit without information sharing and there is a positive impact with information sharing. In particular, when a retailer provides service, we take the consumer's free-riding behavior into account, and we find that free-riding hurts both parties and the whole supply chain. In addition, the manufacturer's profit is irrelevant to the prediction accuracy without information sharing and positively influenced by the accuracy with information sharing. [ABSTRACT FROM AUTHOR]

Background: The aim was to investigate the noise and bias properties of quantitative 177Lu-SPECT with respect to the number of projection angles, and the number of subsets and iterations in the OS-EM reconstruction, for different total acquisition times. Methods: Experimental SPECT acquisition of six spheres in a NEMA body phantom filled with 177Lu was performed, using medium-energy collimators and 120 projections with 180 s per projection. Bootstrapping was applied to generate data sets representing acquisitions with 20 to 120 projections for 10 min, 20 min, and 40 min, with 32 noise realizations per setting. Monte Carlo simulations were performed of 177Lu-DOTA-TATE in an anthropomorphic computer phantom with three tumours (2.8 mL to 40.0 mL). Projections representing 24 h and 168 h post administration were simulated, each with 32 noise realizations. Images were reconstructed using OS-EM with compensation for attenuation, scatter, and distance-dependent resolution. The number of subsets and iterations were varied within a constrained range of the product number of iterations × number of projections ≤ 2400 . Volumes-of-interest were defined following the physical size of the spheres and tumours, the mean activity-concentrations estimated, and the absolute mean relative error and coefficient of variation (CV) over noise realizations calculated. Pareto fronts were established by analysis of CV versus mean relative error. Results: Points at the Pareto fronts with low CV and high mean error resulted from using a low number of subsets, whilst points at the Pareto fronts associated with high CV but low mean error resulted from reconstructions with a high number of subsets. The number of projection angles had limited impact. Conclusions: For accurate estimation of the 177Lu activity-concentration from SPECT images, the number of projection angles has limited importance, whilst the total acquisition time and the number of subsets and iterations are parameters of importance. [ABSTRACT FROM AUTHOR]

During terminal guidance, the attack platform is provided with a high‐resolution image of the target area through the application of synthetic aperture radar. Additionally, the stealth trajectory with low observability can significantly impact mission success. This paper considers both the performance of missile‐borne synthetic aperture radar imaging and stealth performance as influencing factors for terminal trajectory optimization, which is modelled as a constrained multi‐objective optimization problem. The application of the pseudospectral method in the solution of optimal control problems has led to the proposal of the hybrid genetic algorithm pseudospectral optimization framework. The problem is decomposed into several single‐objective optimal control problems, which can generate a specific initial population for the genetic algorithm to obtain a set of Pareto‐optimal solutions. Finally, the numerical simulations demonstrate the effectiveness of the proposed optimization approach compared with the benchmark scheme. [ABSTRACT FROM AUTHOR]

Most species of Keratella possess dome-shaped, dorsal plates comprising a network of polyhedral units (facets), delineated by slightly raised ridges. The arrangement of facets define a species' facet pattern (FP), with the resulting structure resembling a geodesic dome. Researchers have sorted species into categories based on their FPs, but those have not been analyzed. Additionally, while a strong lorica has been suggested to protect Keratella from predatory attack or other actions causing blunt force trauma (BFT), we know little of how that occurs. Thus, in our study we tested two hypotheses. (1) There is support for categorizing Keratella species into unique groupings based on their FPs. (2) FPs provide resistance to physical stresses. To test that hypothesis we used the structural analysis software SkyCiv©. Our results indicate support for four FP categories. Additionally, the SkyCiv analysis provided preliminary 'proof-of-concept' that Keratella FPs have a functional significance: i.e., adding or subtracting facets in our model was followed by a change in predicted structural reliability. We posit that FPs are adaptations protecting Keratella from fractures to the lorica that may result from BFT incurred during predatory attack by copepods or while caught within the branchial chambers of daphnids. [ABSTRACT FROM AUTHOR]

Despite many advantages of distributed generation (DG), it can have adverse effects on the network protection coordination by raising the short-circuit level of buses. This issue can often be resolved by incorporating fault current limiters (FCLs) that are properly located and sized in the network. We propose an efficient method to simultaneously attain the optimal location and size of DG and FCL units for protection coordination of overcurrent relays and cost reduction in a distribution network. The proposed method involves three stages. First, two separate objective functions are derived, representing the operation times of relays and the network costs associated with the installation of DGs and FCLs and system losses. The Strength Pareto Evolutionary Algorithm 2 (SPEA-2) is then used for finding a Pareto-optimal solution set for the interrelated multiobjective problem at hand. Finally, the k-means clustering method is utilized to group the best solutions. In contrast to the conventional weighted sum (WS) method, the proposed method is more computationally efficient while being capable of treating complex networks with non-convex Pareto front solutions. These features are demonstrated by implementing the proposed approach in the 14-bus IEEE test grid and comparing the results with those obtained using the conventional WS method. [ABSTRACT FROM AUTHOR]

The threat posed by Alzheimer's disease (AD) to human health has grown significantly. However, the precise diagnosis and classification of AD stages remain a challenge. Neuroimaging methods such as structural magnetic resonance imaging (sMRI) and fluorodeoxyglucose positron emission tomography (FDG-PET) have been used to diagnose and categorize AD. However, feature selection approaches that are frequently used to extract additional data from multimodal imaging are prone to errors. This paper suggests using a static pulse-coupled neural network and a Laplacian pyramid to combine sMRI and FDG-PET data. After that, the fused images are used to train the Mobile Vision Transformer (MViT), optimized with Pareto-Optimal Quantum Dynamic Optimization for Neural Architecture Search, while the fused images are augmented to avoid overfitting and then classify unfused MRI and FDG-PET images obtained from the AD Neuroimaging Initiative (ADNI) and Open Access Series of Imaging Studies (OASIS) datasets into various stages of AD. The architectural hyperparameters of MViT are optimized using Quantum Dynamic Optimization, which ensures a Pareto-optimal solution. The Peak Signal-to-Noise Ratio (PSNR), the Mean Squared Error (MSE), and the Structured Similarity Indexing Method (SSIM) are used to measure the quality of the fused image. We found that the fused image was consistent in all metrics, having 0.64 SIMM, 35.60 PSNR, and 0.21 MSE for the FDG-PET image. In the classification of AD vs. cognitive normal (CN), AD vs. mild cognitive impairment (MCI), and CN vs. MCI, the precision of the proposed method is 94.73%, 92.98% and 89.36%, respectively. The sensitivity is 90. 70%, 90. 70%, and 90. 91% while the specificity is 100%, 100%, and 85. 71%, respectively, in the ADNI MRI test data.

Abstract During terminal guidance, the attack platform is provided with a high‐resolution image of the target area through the application of synthetic aperture radar. Additionally, the stealth trajectory with low observability can significantly impact mission success. This paper considers both the performance of missile‐borne synthetic aperture radar imaging and stealth performance as influencing factors for terminal trajectory optimization, which is modelled as a constrained multi‐objective optimization problem. The application of the pseudospectral method in the solution of optimal control problems has led to the proposal of the hybrid genetic algorithm pseudospectral optimization framework. The problem is decomposed into several single‐objective optimal control problems, which can generate a specific initial population for the genetic algorithm to obtain a set of Pareto‐optimal solutions. Finally, the numerical simulations demonstrate the effectiveness of the proposed optimization approach compared with the benchmark scheme.

Rural areas, with their vast land and abundant resources, are ripe for the development of distributed energy systems. A two-stage dispatch optimization model has been proposed for a virtual power plant (VPP) in this paper, with the aim of maximizing operational revenue, minimizing costs for villagers, and reducing carbon emissions. This model leverages a benefit allocation strategy based on Pareto optimization, ensuring a balanced approach to conflicting objectives such as financial gain, risk management, and environmental impact. The effectiveness of various allocation strategies is evaluated using the Ideal Point method, which assesses options based on their proximity to an ideal outcome across three critical dimensions: risk, benefit, and carbon emission reduction. This method provides an assessment of each strategy’s impact, ensuring that the chosen strategy is holistic. Case study results have shown that the proposed two-stage model, when combined with the Ideal Point-Pareto optimization method, can effectively utilize dispersed resources in rural areas to enhance operational efficiency and reduce carbon emissions from energy consumption processes. Additionally, with a 47% reduction in computational volume compared to traditional scalar and particle swarm optimization algorithms.

A key enabling technology for DC collection systems in offshore wind farms is a suitable wind turbine DC/DC converter. However, there is no consensus regarding the topology, design, or operating frequency of this converter. This paper presents an optimization and comparison of four DC/DC converter topologies, including 1-phase, 3-phase, unidirectional, and bidirectional converters. The converters are compared in terms of their reliability, volume, weight and losses at switching frequencies ranging from 500 Hz to 5 kHz. The medium frequency transformer for each converter is designed using multi-objective optimization, and the overall converter volume calculation takes into account the insulation requirements and physical configuration of the components. The results show that if only unidirectional operation is required, the 1-phase single active bridge is the preferred option due to its high reliability, small size and low losses with an optimal operating frequency of up to 2.5 kHz. For bidirectional systems, the 1-phase and 3-phase dual active bridge topologies have a similar efficiency and optimal operating frequency of 1 kHz. Despite its higher volume, the 3-phase version is the preferred option due to its higher reliability and lower device stresses, provided there is enough available space.

This paper presents an approach for reducing the memory requirements of periodically executed dataflow applications, while minimizing the period when deployed on a many-core target. Often, implementations of dataflow applications suffer from data duplication if identical data has to be processed by multiple actors. In fact, multi-cast (also called fork) actors can produce huge memory overheads when storing and communicating copies of the same data. As a remedy, so-called Multi-Reader Buffers (MRBs) can be utilized to forward identical data to multiple actors in a First In First Out (FIFO) manner while storing each data item only once by sharing. However, using MRBs may increase the achievable period due to contention when accessing the shared data. This paper proposes a novel multi-objective design space exploration approach that selectively replaces multi-cast actors with MRBs and explores actor and FIFO channel mappings to find trade-offs between the objectives of period, memory footprint, and core cost. In distinction to the state-of-the-art, our approach considers (i) memory-size constraints for on-chip memories, (ii) hierarchical memories to implement the buffers, e.g., tile-local memories, (iii) supports heterogeneous many-core platforms, i.e., core-type dependent actor execution times, and (iv) optimizes the buffer placement and overall scheduling to minimize the execution period by proposing a novel combined actor and communication scheduling heuristic for period minimization called Communication-Aware Periodic Scheduling on Heterogeneous Many-core Systems (CAPS-HMS). Our results show that the explored Pareto fronts improve a hypervolume indicator over a reference approach by up to 66 % for small to mid-size applications and 90 % for large applications. Moreover, selectively replacing multi-cast actors with corresponding MRBs proves to be always superior to never or always replacing them. Finally, it is shown that the quality of the explored Pareto fronts does not degrade when replacing the efficient scheduling heuristic CAPS-HMS by an Integer Linear Program (ILP) solver that requires orders of magnitude higher solver times and thus cannot be applied to large scale dataflow network problems.

The traditional mathematical models for solving the economic dispatch problem at the generation level primarily focus on minimizing overall operational costs while ensuring demand is met across various periods. However, contemporary power systems integrate a diverse mix of generators from both conventional and renewable energy sources, contributing to economically efficient energy production and playing a pivotal role in reducing greenhouse gas emissions. As the complexity of power systems increases, the scope of economic dispatch must expand to address demand across multiple regions, incorporating a range of objective functions that optimize energy resource utilization, reduce costs, and achieve superior economic and technical outcomes. This paper, therefore, proposes an advanced optimization model designed to determine the hourly power output of various generation units distributed across multiple areas within the power system. The model satisfies the dual objective functions and adheres to stringent technical constraints, effectively framing the problem as a nonlinear programming challenge. Furthermore, an in-depth analysis of the resulting and exchanged energy quantities demonstrates that the model guarantees the hourly demand. Significantly, the system’s efficiency can be further enhanced by increasing the capacity of the interconnection links between areas, thereby generating additional savings that can be reinvested into expanding the links’ capacity. Moreover, the multi-objective model excels not only in meeting the proposed objective functions but also in optimizing energy exchange across the system. This optimization is applicable to various types of energy, including thermal and renewable sources, even those characterized by uncertainty in their primary resources. The model’s ability to effectively manage such uncertainties underscores its robustness, instilling confidence in its applicability and reliability across diverse energy scenarios. This adaptability makes the model a significant contribution to the field, offering a sophisticated tool for optimizing multi-area power systems in a way that balances economic, technical, and environmental considerations.

Grinding has been extensively applied to meet the urgent need for tight tolerance and high productivity in manufacturing industries. However, grinding parameter settings and process control still depend on skilled workers' engineering experience. The process stability in complicated non-uniform wear can't be guaranteed. Moreover, it is impossible to obtain energy-saved grinding strategies. Intelligent monitoring methods are well-recognized to help conquer present trial–error processing deficiencies. However, discrete manufacturing companies have to face increasing difficulties to identify the monitored big data and make credible decisions directly. A decision-making expert system driven by monitored power data (EconG©) is thus developed. EconG© provides a 4-level database structure to efficiently manage multi-source heterogeneous data. Signal conditioning, peaks-valleys feature exaction, and compression approaches are proposed for reducing the storage volume of real-time monitored data. The data size has been reduced to 6.5% of the source. A mathematical comparison model based on the power feature is embedded to diagnose burns, which has been validated by the 16th and 55th surface grinding results. Mapping relation model from inputs, signals to outputs has been built by the power feature-extended artificial neural network algorithm. Prediction accuracy is improved by introducing adaptive control and dynamic changes in material removal. EconG© breaks a single analysis based on grinding parameters. Energy-saved grinding strategies could be intelligently acquired through the presented Pareto optimization method. In the future, a broader and deeper implementation of EconG© will guild manufacturers to respond quickly to explosive demands on intellectualization, sustainability, and flexibility in the arrived 4th industrial revolution. [ABSTRACT FROM AUTHOR]

In this study, the inductor optimization design is performed by applying the Pareto optimization technique. As environmental problems emerge, the electric vehicle market is expanding, and accordingly, volume reduction and high efficiency of the onboard charger (OBC) are required. An OBC consists of a PFC stage and a DC/DC stage. The inductor is a major component in a converter and affects the volume and efficiency of the entire converter system. However, reducing the volume of the inductor leads to an increase in loss due to an increase in the change in flux density. Therefore, it is important to derive a suitable design for the target between the two parameters in the trade-off of loss and volume. This paper introduces the optimal design algorithm for boosting inductors of PFC converters in terms of volume and loss. Volume and loss are difficult to compare with each other, making it difficult to set weights. Therefore, Pareto optimization was applied which can be selected according to the needs and purposes of the decision-maker, without weighting as an optimization method. Through a series of procedures of applying Pareto optimization to the inductor design, several optimal inductor designs can be derived. At this time, the optimal designs become a set of designs in which the loss does not decrease without an increase in volume, or the volume does not decrease without an increase in loss. A designer can select a design with an appropriate volume and loss that meets the purpose of the design or preference. Therefore, through the proposed method, the inductor can be flexibly designed according to the target of the application. The proposed algorithm is applied to the interleaved totem-pole bridgeless boost PFC converter, to review its effectiveness. As a result, several inductor designs are derived in the search space, and various optimal designs are visualized through the Pareto Frontier. This facilitates comparative analysis of various inductor designs and helps designers select reasonable inductors. The validity was verified by selecting one of the obtained optimal inductor designs and driving the experiment with the resulting inductor. [ABSTRACT FROM AUTHOR]

Computed tomography (CT)-guided thermal ablation is an emerging treatment method for lung tumors. Ablation needle path planning in preoperative diagnosis is of critical importance. In this work, we proposed an automatic needle path-planning method for thermal lung tumor ablation. First, based on the improved cube mapping algorithm, binary classification was performed on the surface of the bounding box of the patient's CT image to obtain a feasible puncture area that satisfied all hard constraints. Then, for different clinical soft constraint conditions, corresponding grayscale constraint maps were generated, respectively, and the multi-objective optimization problem was solved by combining Pareto optimization and weighted product algorithms. Finally, several optimal puncture paths were planned within the feasible puncture area obtained for the clinicians to choose. The proposed method was evaluated with 18 tumors of varying sizes (482.79 mm3 to 9313.81 mm3) and the automatically planned paths were compared and evaluated with manually planned puncture paths by two clinicians. The results showed that over 82% of the paths (74 of 90) were considered reasonable, with clinician A finding the automated planning path superior in 7 of 18 cases, and clinician B in 9 cases. Additionally, the time efficiency of the algorithm (35 s) was much higher than that of manual planning. The proposed method is expected to aid clinicians in preoperative path planning for thermal ablation of lung tumors. By providing a valuable reference for the puncture path during preoperative diagnosis, it may reduce the clinicians' workload and enhance the objectivity and rationality of the planning process, which in turn improves the effectiveness of treatment. [ABSTRACT FROM AUTHOR]

This paper presents the placement and sizing of energy hubs (EHs) in electricity, gas, and heating networks. EH is a coordinator framework for various power sources, storage devices, and responsive loads. For simultaneous modeling of economic, operation, reliability, and flexibility indices, the proposed scheme is expressed as a three-objective optimization in the form of Pareto optimization based on the sum of weighted functions. The objective functions of this problem respectively minimize the planning cost of EHs (equal to the total cost of construction of hubs and their expected operating cost), the expected energy loss of the mentioned networks, and the expected energy not-supplied (EENS) of these networks in the case of an N − 1 event. The problem is constrained by power flow equations and operation and reliability constraints of these network together with the EH planning and operation model, and flexibility constraints of the EHs. Then, to achieve unique optimal solution in the shortest possible time, a linear approximation model is extracted for the proposed scheme. Moreover, scenario-based stochastic programming (SBSP) is employed to model uncertainties of load, energy cost, renewable power, and accessibility of the mentioned network equipment. Finally, the obtained numerical results indicate the capability of the proposed scheme in enhancing the economic and flexibility situation of EHs and improving the reliability and operation status of energy networks along with achieving optimal planning and operation for EHs.

One of the most difficult aspects of scheduling operations on virtual machines in a multi-cloud environment is determining a near-optimal permutation. This task requires assigning various computing jobs with competing objectives to a collection of virtual machines. A significant number of NP-hard problem optimization methods employ multi-objective algorithms. As a result, one of the most successful criteria for discovering the best Pareto solutions is Pareto dominance. In this study, the Pareto front is calculated using a novel multi-objective minimum weight approach. In particular, we use particle swarm optimization (PSO) to expand the FR-MOS multi-objective scheduling algorithm by using fuzzy resource management to maximize variety and obtain optimal Pareto convergence. The competing objectives include reliability, cost, utilization of resources, risk probability, and time makespan. Most of the previous studies provide numerous symmetry or equivalent solutions as trade-offs for different objectives, and selecting the optimum solution remains an issue. We propose a novel decision-making strategy named minimum weight optimization (MWO). Multi-objective algorithms use this method to select a set of permutations that provide the best trade-off between competing objectives. MWO is a suitable choice for attaining all optimal solutions, where both the needs of consumers and the interests of service providers are taken into consideration. (MWO) aims to find the best solution by comparing alternative weights, narrowing the search for an optimal solution through iterative refinement. We compare our proposed method to five distinct decision-making procedures using common scientific workflows with competing objectives: Pareto dominance, multi-criteria decision-making (MCDM), linear normalization I, linear normalization II, and weighted aggregated sum product assessment (WASPAS). MWO outperforms these strategies according to the results of this study. [ABSTRACT FROM AUTHOR]

This paper develops a multi-objective optimization model for national high-speed railway network planning. Three objectives are proposed from the macro, meso, and micro perspectives, and these three objectives are considered simultaneously. Using real data, case studies are conducted to optimize China's "four east–west and four north–south railway lines" network, which includes Beijing, Shanghai, Wuhan, Guangzhou, and Zhengzhou as main hubs. The results show that, on the one hand, the optimization model reduces the overlap between long-distance passengers and short-distance passengers on the high-speed railway line, facilitates the travel of passengers, and improves the line service capability; on the other hand, optimization of the network shortens the travel time of the passengers, reduces the cost of the railway, and improves the operation efficiency of the high-speed railway line network. The results show that the total travel time of all high-speed railway passengers in the optimization model is reduced by 18.4%, while the benefit rate of the operator increased by 21.99%. [ABSTRACT FROM AUTHOR]

Electric retail rate design is relevant to utilities, customers, and regulators as retail rates impact the utility's revenue as well as the customers' electricity bills. In California, regulators approve rate proposals by privately owned vertical integrated utilities. Approval, however, is subject to compliance with multiple, potentially conflicting objectives such as economic or environmental objectives. Additionally, retail rates are price signals that affect how customers use electricity services. When utility customers change their usage, they also impact the ratemaking objectives to which rates have been designed. This suggests a feedback loop, which is particularly pronounced with prosumers, as they can systematically optimize their interactions with the electricity system. Prevalent ratemaking methods may not deliver retail rates that are optimal for multiple objectives when customers are prosumers. We propose a novel ratemaking method that formalizes the problem of designing retail rates as a multi-criteria optimization problem and accounts for prosumer reactions through a simulation-based optimization approach. Through a fictive case study, we found that the resulting Pareto frontiers are useful in recognizing and balancing tradeoffs among conflicting ratemaking objectives. Additionally, our results indicate that prevailing retail rates in California are not Pareto optimal.

Simple Summary: This paper introduces a new method for cleaning impaired speech by combining Pareto-optimized deep learning with Non-negative Matrix Factorization (NMF). The approach effectively reduces noise in impaired speech while preserving the desired speech quality. The method involves calculating the spectrogram of a noisy voice clip, determining a noise threshold, computing a noise-to-signal mask, and smoothing it to avoid abrupt transitions. Using a Pareto-optimized NMF, the modified spectrogram is decomposed into basis functions and weights, allowing for reconstruction of the clean speech spectrogram. The final result is a noise-reduced waveform achieved by inverting the clean speech spectrogram. Experimental results validate the method's effectiveness in cleaning alaryngeal speech signals, indicating its potential for real-world applications. The problem of cleaning impaired speech is crucial for various applications such as speech recognition, telecommunication, and assistive technologies. In this paper, we propose a novel approach that combines Pareto-optimized deep learning with non-negative matrix factorization (NMF) to effectively reduce noise in impaired speech signals while preserving the quality of the desired speech. Our method begins by calculating the spectrogram of a noisy voice clip and extracting frequency statistics. A threshold is then determined based on the desired noise sensitivity, and a noise-to-signal mask is computed. This mask is smoothed to avoid abrupt transitions in noise levels, and the modified spectrogram is obtained by applying the smoothed mask to the signal spectrogram. We then employ a Pareto-optimized NMF to decompose the modified spectrogram into basis functions and corresponding weights, which are used to reconstruct the clean speech spectrogram. The final noise-reduced waveform is obtained by inverting the clean speech spectrogram. Our proposed method achieves a balance between various objectives, such as noise suppression, speech quality preservation, and computational efficiency, by leveraging Pareto optimization in the deep learning model. The experimental results demonstrate the effectiveness of our approach in cleaning alaryngeal speech signals, making it a promising solution for various real-world applications. [ABSTRACT FROM AUTHOR]

Multi-objective task graph scheduling is a well-known NP-hard problem that plays a significant role in heterogeneous distributed systems. The solution to the problem is expected to optimize all scheduling objectives. Pretty large state-of-the-art algorithms exist in the literature that mostly apply different metaheuristics for solving the problem. This study proposes a new hybrid algorithm comprising an improved multi-objective differential evolution algorithm (DE) and Pareto-front neighborhood search to solve the problem. The novelty of the proposed hybrid method is achieved by improving DE and hybridizing it with the neighborhood search method. The proposed method improves the performance of differential evolution by applying appropriate solution representation as well as effective selection, crossover, and mutation operators. Likewise, the neighborhood search algorithm is applied to improve the extracted Pareto-front and speed up the evolution process. The effectiveness and performance of the developed method are assessed over well-known test problems collected from the related literature. Meanwhile, the values of spacing and hyper-volume metrics are calculated. Moreover, the Wilcoxon signed method is applied to carry out pairwise statistical tests over the obtained results. The obtained results for the makespan, reliability, and flow-time of 50, 18, and 41, respectively, by the proposed hybrid algorithm in the study confirmed that the developed algorithm outperforms all proposed methods considering the performance and quality of objective values. [ABSTRACT FROM AUTHOR]

Alzheimer's disease (AD) is a neurological condition that gradually weakens the brain and impairs cognition and memory. Multimodal imaging techniques have become increasingly important in the diagnosis of AD because they can help monitor disease progression over time by providing a more complete picture of the changes in the brain that occur over time in AD. Medical image fusion is crucial in that it combines data from various image modalities into a single, better-understood output. The present study explores the feasibility of employing Pareto optimized deep learning methodologies to integrate Magnetic Resonance Imaging (MRI) and Positron Emission Tomography (PET) images through the utilization of pre-existing models, namely the Visual Geometry Group (VGG) 11, VGG16, and VGG19 architectures. Morphological operations are carried out on MRI and PET images using Analyze 14.0 software and after which PET images are manipulated for the desired angle of alignment with MRI image using GNU Image Manipulation Program (GIMP). To enhance the network's performance, transposed convolution layer is incorporated into the previously extracted feature maps before image fusion. This process generates feature maps and fusion weights that facilitate the fusion process. This investigation concerns the assessment of the efficacy of three VGG models in capturing significant features from the MRI and PET data. The hyperparameters of the models are tuned using Pareto optimization. The models' performance is evaluated on the ADNI dataset utilizing the Structure Similarity Index Method (SSIM), Peak Signal-to-Noise Ratio (PSNR), Mean-Square Error (MSE), and Entropy (E). Experimental results show that VGG19 outperforms VGG16 and VGG11 with an average of 0.668, 0.802, and 0.664 SSIM for CN, AD, and MCI stages from ADNI (MRI modality) respectively. Likewise, an average of 0.669, 0.815, and 0.660 SSIM for CN, AD, and MCI stages from ADNI (PET modality) respectively. [ABSTRACT FROM AUTHOR]

This paper is poised to inform educators, policy makers and software developers about the untapped potential of PWAs in creating engaging, effective, and personalized learning experiences in the field of programming education. We aim to address a significant gap in the current understanding of the potential advantages and underutilisation of Progressive Web Applications (PWAs) within the education sector, specifically for programming education. Despite the evident lack of recognition of PWAs in this arena, we present an innovative approach through the Framework for Gamification in Programming Education (FGPE). This framework takes advantage of the ubiquity and ease of use of PWAs, integrating it with a Pareto optimized gamified programming exercise selection model ensuring personalized adaptive learning experiences by dynamically adjusting the complexity, content, and feedback of gamified exercises in response to the learners' ongoing progress and performance. This study examines the mobile user experience of the FGPE PLE in different countries, namely Poland and Lithuania, providing novel insights into its applicability and efficiency. Our results demonstrate that combining advanced adaptive algorithms with the convenience of mobile technology has the potential to revolutionize programming education. The FGPE+ course group outperformed the Moodle group in terms of the average perceived knowledge (M = 4.11, SD = 0.51). [ABSTRACT FROM AUTHOR]

This paper studies the problem of scheduling $ n $ jobs on a single machine to minimize total completion time and maximum cost, simultaneously. Each job is associated with a positional deadline that indicates the largest ordinal number of this job in any feasible schedule. The jobs have agreeable release and processing times, meaning that jobs with larger release times also have larger processing times. The agreeability assumption is reasonable since both the single-criterion problems (without positional deadline constraints) of minimizing total completion time and maximum lateness on a single machine with arbitrary release and processing times are strongly NP-hard. An $ O(n^3) $-time Pareto optimal algorithm is presented. The previously known algorithms only solve two special cases of the agreeability assumption: either the case of equal release times in $ O(n^4) $ time, or the case of equal processing times (without positional deadline constraints) in $ O(n^3) $ time.

The paper presents an evaluation of a Pareto-optimized FaceNet model with data preprocessing techniques to improve the accuracy of face recognition in the era of mask-wearing. The COVID-19 pandemic has led to an increase in mask-wearing, which poses a challenge for face recognition systems. The proposed model uses Pareto optimization to balance accuracy and computation time, and data preprocessing techniques to address the issue of masked faces. The evaluation results demonstrate that the model achieves high accuracy on both masked and unmasked faces, outperforming existing models in the literature. The findings of this study have implications for improving the performance of face recognition systems in real-world scenarios where mask-wearing is prevalent. The results of this study show that the Pareto optimization allowed improving the overall accuracy over the 94% achieved by the original FaceNet variant, which also performed similarly to the ArcFace model during testing. Furthermore, a Pareto-optimized model no longer has a limitation of the model size and is much smaller and more efficient version than the original FaceNet and derivatives, helping to reduce its inference time and making it more practical for use in real-life applications. [ABSTRACT FROM AUTHOR]

This paper studies the problem of scheduling n jobs on a single machine to minimize total completion time and maximum cost, simultaneously. Each job is associated with a positional deadline that indicates the largest ordinal number of this job in any feasible schedule. The jobs have agreeable release and processing times, meaning that jobs with larger release times also have larger processing times. The agreeability assumption is reasonable since both the single-criterion problems (without positional deadline constraints) of minimizing total completion time and maximum lateness on a single machine with arbitrary release and processing times are strongly NP-hard. An O (n 3) -time Pareto optimal algorithm is presented. The previously known algorithms only solve two special cases of the agreeability assumption: either the case of equal release times in O (n 4) time, or the case of equal processing times (without positional deadline constraints) in O (n 3) time. [ABSTRACT FROM AUTHOR]

One of the most difficult components of stroke therapy is regaining hand mobility. This research describes a preliminary approach to robot-assisted hand motion therapy. Our objectives were twofold: First, we used machine learning approaches to determine and describe hand motion patterns in healthy people. Surface electrodes were used to collect electromyographic (EMG) data from the forearm's flexion and extension muscles. The time and frequency characteristics were used as parameters in machine learning algorithms to recognize seven hand gestures and track rehabilitation progress. Eight EMG sensors were used to capture each contraction of the arm muscles during one of the seven actions. Feature selection was performed using the Pareto front. Our system was able to reconstruct the kinematics of hand/finger movement and simulate the behaviour of every motion pattern. Analysis has revealed that gesture categories substantially overlap in the feature space. The correlation of the computed joint trajectories based on EMG and the monitored hand movement was 0.96 on average. Moreover, statistical research conducted on various machine learning setups revealed a 92% accuracy in measuring the precision of finger motion patterns. [ABSTRACT FROM AUTHOR]

Multiparametric indices offer a more comprehensive approach to voice quality assessment by taking into account multiple acoustic parameters. Artificial intelligence technology can be utilized in healthcare to evaluate data and optimize decision-making processes. Mobile devices provide new opportunities for remote speech monitoring, allowing the use of basic mobile devices as screening tools for the early identification and treatment of voice disorders. However, it is necessary to demonstrate equivalence between mobile device signals and gold standard microphone preamplifiers. Despite the increased use and availability of technology, there is still a lack of understanding of the impact of physiological, speech/language, and cultural factors on voice assessment. Challenges to research include accounting for organic speech-related covariables, such as differences in conversing voice sound pressure level (SPL) and fundamental frequency (f0), recognizing the link between sensory and experimental acoustic outcomes, and obtaining a large dataset to understand regular variation between and within voice-disordered individuals. Our study investigated the use of cellphones to estimate the Acoustic Voice Quality Index (AVQI) in a typical clinical setting using a Pareto-optimized approach in the signal processing path. We found that there was a strong correlation between AVQI results obtained from different smartphones and a studio microphone, with no significant differences in mean AVQI scores between different smartphones. The diagnostic accuracy of different smartphones was comparable to that of a professional microphone, with optimal AVQI cut-off values that can effectively distinguish between normal and pathological voice for each smartphone used in the study. All devices met the proposed 0.8 AUC threshold and demonstrated an acceptable Youden index value. [ABSTRACT FROM AUTHOR]

With the development of ecological economics, energy-saving green energy chain management has been a wide concern of academia and industries. However, the relatively high cost of green investment makes manufacturers face the problem of financial constraints. On this basis, because the green level information of products is proprietary to manufacturers, manufacturers will lie about the green level of products in order to improve their profits out of the principle of profit maximization. As a result, banks cannot obtain the true green level of products, reducing the benefits of the green energy-efficient supply chain system and making the market of green products volatile. In view of this, blockchain technology is introduced in this paper to improve customer's product green level sensitivity and obtain lower green credit interest rates from banks. In this paper, a green supply chain financing model based on blockchain technology was constructed under the condition of green information misreporting, and it is compared with the benchmark without blockchain technology. Research shows that the adoption of blockchain can achieve Pareto improvement of green supply chain members. In addition, manufacturers have an incentive to adopt blockchain if the cost of blockchain investment falls below a certain threshold, and consumer green sensitivity increases below that threshold. We compared the profits of green manufacturers with those of retailers and the total emissions of manufacturers. The results show that: (1) When the financing intensity exceeds a certain value, there is an optimal coverage of green financing to ensure that the profit target of manufacturers, the profit target of retailers and the emission reduction target are achieved simultaneously. (2) The adoption of blockchain can achieve Pareto improvement of green energy supply chain members. The actual data of green transformation of Jinyuan New Technology Company were cited. Through calculation, it was found that green transformation can reduce the emissions of enterprises. When the financing intensity is in a certain range, the profits of manufacturers and retailers can be maximized, and the emission reduction degree is the highest. Thus, the practicability and reliability of this model were proved. (3) Manufacturers have an incentive to adopt blockchain if the cost of blockchain investment falls below a certain threshold, and consumer green sensitivity increases below that threshold. The research results of this paper provide solutions for enterprises with limited funds for green transformation and provide a theoretical basis for the government to formulate emission reduction incentive mechanism. [ABSTRACT FROM AUTHOR]

Improving motion accuracy with energy saving in industrial machines is essential to reduce production costs and meet the demand for precise products. Industrial motion planning is one of the effective methods used to save energy and enhance the production efficiency. This study proposes optimal motion planning by simultaneous path and velocity optimization to achieve the trade-off between time and energy consumption. The multi-objective optimization model for minimizing time and energy consumption is solved by the non-dominated sorting genetic algorithm II. Harmonic motion is introduced to the jerk-limited acceleration profile to attain smooth changes in the jerk profile and increase motion accuracy. The proposed method can be used for machine operations such as milling, laser cutting, inspection, gluing, and polishing. To validate the effectiveness of the proposed approach, simulation and experiments are carried out using a two-axis feed drive system, and the motion accuracy is compared to that of jerk-limited acceleration profile. Experimental results reveal that the best trade-off trajectory of the proposed approach achieves respectively 13.9% and 3.5% of time reduction and energy saving. The mean tracking error is reduced by 16.2% and 14.9% for the x and y axes, respectively, compared to the jerk-limited acceleration profile. [ABSTRACT FROM AUTHOR]

In this study, the inductor optimization design is performed by applying the Pareto optimization technique. As environmental problems emerge, the electric vehicle market is expanding, and accordingly, volume reduction and high efficiency of the onboard charger (OBC) are required. An OBC consists of a PFC stage and a DC/DC stage. The inductor is a major component in a converter and affects the volume and efficiency of the entire converter system. However, reducing the volume of the inductor leads to an increase in loss due to an increase in the change in flux density. Therefore, it is important to derive a suitable design for the target between the two parameters in the trade-off of loss and volume. This paper introduces the optimal design algorithm for boosting inductors of PFC converters in terms of volume and loss. Volume and loss are difficult to compare with each other, making it difficult to set weights. Therefore, Pareto optimization was applied which can be selected according to the needs and purposes of the decision-maker, without weighting as an optimization method. Through a series of procedures of applying Pareto optimization to the inductor design, several optimal inductor designs can be derived. At this time, the optimal designs become a set of designs in which the loss does not decrease without an increase in volume, or the volume does not decrease without an increase in loss. A designer can select a design with an appropriate volume and loss that meets the purpose of the design or preference. Therefore, through the proposed method, the inductor can be flexibly designed according to the target of the application. The proposed algorithm is applied to the interleaved totem-pole bridgeless boost PFC converter, to review its effectiveness. As a result, several inductor designs are derived in the search space, and various optimal designs are visualized through the Pareto Frontier. This facilitates comparative analysis of various inductor designs and helps designers select reasonable inductors. The validity was verified by selecting one of the obtained optimal inductor designs and driving the experiment with the resulting inductor.

Computed tomography (CT)-guided thermal ablation is an emerging treatment method for lung tumors. Ablation needle path planning in preoperative diagnosis is of critical importance. In this work, we proposed an automatic needle path-planning method for thermal lung tumor ablation. First, based on the improved cube mapping algorithm, binary classification was performed on the surface of the bounding box of the patient’s CT image to obtain a feasible puncture area that satisfied all hard constraints. Then, for different clinical soft constraint conditions, corresponding grayscale constraint maps were generated, respectively, and the multi-objective optimization problem was solved by combining Pareto optimization and weighted product algorithms. Finally, several optimal puncture paths were planned within the feasible puncture area obtained for the clinicians to choose. The proposed method was evaluated with 18 tumors of varying sizes (482.79 mm3 to 9313.81 mm3) and the automatically planned paths were compared and evaluated with manually planned puncture paths by two clinicians. The results showed that over 82% of the paths (74 of 90) were considered reasonable, with clinician A finding the automated planning path superior in 7 of 18 cases, and clinician B in 9 cases. Additionally, the time efficiency of the algorithm (35 s) was much higher than that of manual planning. The proposed method is expected to aid clinicians in preoperative path planning for thermal ablation of lung tumors. By providing a valuable reference for the puncture path during preoperative diagnosis, it may reduce the clinicians’ workload and enhance the objectivity and rationality of the planning process, which in turn improves the effectiveness of treatment.

The aim of this paper is to select a depth controller for innovative biomimetic underwater vehicle drives. In the process of optimizing depth controller settings, two classical controllers were used, i.e., the proportional–integral–derivative (PID) and the sliding mode controllers (SM). The parameters of the regulators' settings were obtained as a result of optimization by three methods of the selected quality indicators in terms of the properties of the control signal. The starting point for the analysis was simulations conducted in the MATLAB environment for the three optimization methods on three types of indicators for three different desired depth values. The article describes the methods and quality indicators in detail. The paper presents the results of the fitness function obtained during the optimization. Moreover, the time courses of the vehicle position relative to the desired depth, the side fin deflection angles, the calculated parameters of the control signals, and the observations and conclusions formulated in the research were presented. [ABSTRACT FROM AUTHOR]

The research introduces a unique deep-learning-based technique for remote rehabilitative analysis of image-captured human movements and postures. We present a ploninomial Pareto-optimized deep-learning architecture for processing inverse kinematics for sorting out and rearranging human skeleton joints generated by RGB-based two-dimensional (2D) skeleton recognition algorithms, with the goal of producing a full 3D model as a final result. The suggested method extracts the entire humanoid character motion curve, which is then connected to a three-dimensional (3D) mesh for real-time preview. Our method maintains high joint mapping accuracy with smooth motion frames while ensuring anthropometric regularity, producing a mean average precision (mAP) of 0.950 for the task of predicting the joint position of a single subject. Furthermore, the suggested system, trained on the MoVi dataset, enables a seamless evaluation of posture in a 3D environment, allowing participants to be examined from numerous perspectives using a single recorded camera feed. The results of evaluation on our own self-collected dataset of human posture videos and cross-validation on the benchmark MPII and KIMORE datasets are presented. [ABSTRACT FROM AUTHOR]

This paper studies the Pareto scheduling problem of minimizing total weighted completion time and maximum cost on a single machine. It is known that the problem is strongly NP-hard. Algorithms with running time $ O(n^3) $ are presented for the following cases: arbitrary processing times, equal release dates and equal weights; equal processing times, arbitrary release dates and equal weights; equal processing times, equal release dates and arbitrary weights.

Understanding microplastics' (MPs') transport and settling behaviors in aquatic environments is crucial for devising effective management strategies. This study contributes a novel modeling framework to develop accurate and interpretable drag and velocity models for MPs using machine learning techniques. It achieves faster model creation and improved accuracy than traditional methods like theoretical analysis and data fitting. The framework demonstrates high predictive accuracy across different MP types (1D, 2D, 3D, and mixed), with a coefficient of determination CD = 0.86–0.95 for the drag models and CD = 0.92–0.95 for the velocity models. Compared with best-performing empirical approaches, the new drag models exhibit an average reduction in root mean square error (RMSE) by 59% and mean absolute error (MAE) by 62%. Similarly, the velocity models show a mean decrease in RMSE and MAE by 27% and 25%, respectively. Moreover, the framework outperforms commonly used symbolic regression methods, reducing errors by 18%–27%. The sensitivity analysis reveals that the relative density difference and the dimensionless diameter are essential for predicting the settling of all MP types, while the effective shape parameters vary across different MP categories. By providing accurate predictions of MPs' settling dynamics, this study offers insights for developing targeted mitigation strategies to reduce MPs' environmental impacts. [Display omitted] • An intelligent framework for developing accurate and interpretable models for MPs. • Enhanced MPs' drag and velocity prediction with 59% and 27% RMSE reduction. • 1111 datasets of MPs with varying shapes, sizes, and densities for model evaluation. [ABSTRACT FROM AUTHOR]

One of the most difficult aspects of scheduling operations on virtual machines in a multi-cloud environment is determining a near-optimal permutation. This task requires assigning various computing jobs with competing objectives to a collection of virtual machines. A significant number of NP-hard problem optimization methods employ multi-objective algorithms. As a result, one of the most successful criteria for discovering the best Pareto solutions is Pareto dominance. In this study, the Pareto front is calculated using a novel multi-objective minimum weight approach. In particular, we use particle swarm optimization (PSO) to expand the FR-MOS multi-objective scheduling algorithm by using fuzzy resource management to maximize variety and obtain optimal Pareto convergence. The competing objectives include reliability, cost, utilization of resources, risk probability, and time makespan. Most of the previous studies provide numerous symmetry or equivalent solutions as trade-offs for different objectives, and selecting the optimum solution remains an issue. We propose a novel decision-making strategy named minimum weight optimization (MWO). Multi-objective algorithms use this method to select a set of permutations that provide the best trade-off between competing objectives. MWO is a suitable choice for attaining all optimal solutions, where both the needs of consumers and the interests of service providers are taken into consideration. (MWO) aims to find the best solution by comparing alternative weights, narrowing the search for an optimal solution through iterative refinement. We compare our proposed method to five distinct decision-making procedures using common scientific workflows with competing objectives: Pareto dominance, multi-criteria decision-making (MCDM), linear normalization I, linear normalization II, and weighted aggregated sum product assessment (WASPAS). MWO outperforms these strategies according to the results of this study.

This paper develops a multi-objective optimization model for national high-speed railway network planning. Three objectives are proposed from the macro, meso, and micro perspectives, and these three objectives are considered simultaneously. Using real data, case studies are conducted to optimize China’s “four east–west and four north–south railway lines” network, which includes Beijing, Shanghai, Wuhan, Guangzhou, and Zhengzhou as main hubs. The results show that, on the one hand, the optimization model reduces the overlap between long-distance passengers and short-distance passengers on the high-speed railway line, facilitates the travel of passengers, and improves the line service capability; on the other hand, optimization of the network shortens the travel time of the passengers, reduces the cost of the railway, and improves the operation efficiency of the high-speed railway line network. The results show that the total travel time of all high-speed railway passengers in the optimization model is reduced by 18.4%, while the benefit rate of the operator increased by 21.99%.

Evolutionary multiobjective algorithms have become a popular choice to tackle the clustering problem. On the one hand, the simultaneous optimization of complementary clustering criteria offers an increased robustness to changes in data characteristics. On the other hand, the evolutionary search is able to approximate the Pareto optimal front and deliver a set of trade-offs between these criteria in a single algorithm execution. Decision making is the concluding stage of the pipeline, having as its goal the selection of a single, final solution from the set of candidate trade-offs produced. This is a complex task for which a definitive answer does not seem to be available, as the underlying assumptions of existing techniques may not hold for all applications. In this paper, we investigate an alternative approach to address this challenge: posing it as a learning problem. The key idea is to build a model that, given a proper characterization of solutions and their context (defined by the full approximation solution set and the specific clustering task at hand), is able to estimate quality and facilitate the identification of the best choice. To evaluate the suitability of this approach, we conduct a series of experiments over diverse synthetic and real-world datasets, including comparisons against a range of representative decision-making strategies from the literature. Our proposal exhibits greater flexibility in dealing with problems of varying characteristics, consistently outperforming the reference methods considered. This study demonstrates that it is possible to learn from the decision-making process in example settings and generalize the acquired knowledge to new scenarios.

Precision livestock farming promises substantial advantages in terms of animal welfare, product quality and reducing methane emissions, but requires continuous and reliable data on the animal's behavior. While systems suitable for use within the barn exist, grazing over long distances poses challenges. Here, we address this issue by proposing an ultra low-power Edge AI device, minimizing data transmission requirements and potentially improving accuracy as compared to classification-based solutions. Namely, we propose cow behavior distribution regression with Recurrent Neural Networks (RNNs), dubbed TinyCowNet, to estimate mixed-label sample spaces. Without quantization, the random search to minimize resources and maximize accuracy shows networks requiring a memory of 76kB on average and offering an accuracy up to 95.7%. These are implementable on a wide range of low-power Micro Controller Units (MCU) and Field Programmable Gate Arrays (FPGA). Furthermore, our proposed post-training full-integer quantization for RNNs combined with power estimation on 45nm CMOS using experimental literature shows a TinyCowNet occupying a memory around $\approx 2$ kB, having a hypothetical power consumption on the order of 200nW, delivering an accuracy of 95.2% and a Matthews correlation coefficient of 0.86. This work paves the way for the future creation of low-cost, highly accurate cow behavior estimation devices with long battery life that reduce the entry barriers currently hindering precision livestock farming outside the barn.

There have been numerous attempts at solving the optimal camera placement problem across multiple applications. Exact linear programming-based, as well as, heuristic combinatorial optimization methods were shown to be successful in providing optimal or near-optimal solutions to this problem. Working over a discrete space model is the general practice when solving the camera placement problem. However, discretized environments often limit the methods’ usage only to small-scale datasets due to resource and time constraints that grow exponentially with the number of 3D points collected from the discrete space. We propose a multi-resolution approach that enables the usage of existing optimization algorithms on large real-world problems modelled using high resolution 3D grids. Our method works by grouping together the given discrete set of possible camera locations into clusters of points, multiple times, resulting in multiple resolution levels. Camera placement optimization is repeated for all resolution levels while propagating the optimized solution from low to high resolutions. Our experiments on both simulated and real data with grids of varying sizes show that using our multi-resolution approach, existing camera placement optimization methods can be used even on high resolution grids consisting of hundreds of thousands of points. Our results also show that the strategy of grouping points together by exploiting underlying 3D geometry to optimize camera poses is not only significantly faster than optimizing on the entire set of samples but, it also provides better camera coverage.

The optimal capacitor allocation problem is suggested in this article. This study purposes to maximize the voltage stability, minimize the power losses, and consolidate the annual net savings. Calculating the optimal locations and sizes of fixed and switched capacitors is done in two steps. The first step is using the fuzzy expert rules in calculating the most candidate buses for capacitor allocation. While the second step is using a nondominated sorting genetic algorithm II (NSGA-II) in determining the list of Pareto optimal solutions and then applying a fuzzy decision maker to pick the most compromise. To emphasize the effectiveness of the proposed method, radial distribution systems are proposed; IEEE 33-bus system and the actual Portuguese IEEE 94-bus system. To demonstrate the strength and applicability of this method, a multiobjective water cycle algorithm (MOWCA), multiobjective grey wolf optimizer (MOGWO), and other optimizers used in the published papers are used. From simulation and analysis, the proposed NSGA-II outperforms other optimizers considered for comparison in achieving the maximum percentages of minimization in a real power loss of 32.369% and 31.1011% for the 33-bus system and 25.6296% and 25.3027% for the 94-bus system, the maximum percentages of minimization in a reactive power loss of 31.7916% and 30.4948% for 33-bus system and 25.9457% and 25.8001% for the 94-bus system, the maximum annual net savings of 23,612 $ and 23,131 $ for the 33-bus system for fixed and switched capacitors, respectively, and boosting the total voltage stability, which show its superior ability to give high-grade solutions.

We present a novel algorithm that allows us to gain detailed insight into the effects of sparsity in linear and nonlinear optimization. Sparsity is of great importance in many scientific areas such as image and signal processing, medical imaging, compressed sensing, and machine learning, as it ensures robustness against noisy data and yields models that are easier to interpret due to the small number of relevant terms. It is common practice to enforce sparsity by adding the $\ell _1$ ℓ 1 -norm as a penalty term. In order to gain a better understanding and to allow for an informed model selection, we directly solve the corresponding multiobjective optimization problem (MOP) that arises when minimizing the main objective and the $\ell _1$ ℓ 1 -norm simultaneously. As this MOP is in general non-convex for nonlinear objectives, the penalty method will fail to provide all optimal compromises. To avoid this issue, we present a continuation method specifically tailored to MOPs with two objective functions one of which is the $\ell _1$ ℓ 1 -norm. Our method can be seen as a generalization of homotopy methods for linear regression problems to the nonlinear case. Several numerical examples – including neural network training – demonstrate our theoretical findings and the additional insight gained by this multiobjective approach. [ABSTRACT FROM AUTHOR]