Minimum Objective Research Articles

Research on Production Decision Modelling Based on Sequential Testing and Minimum Objective Planning

In this paper, the decision-making problem encountered by an enterprise in the production process is studied in depth by using the sequential test and the minimum objective planning method. The study begins with a sampling and testing model for spare parts, simplifies the model based on normal distribution, and applies the sequential test technique to reduce the number of necessary samples and effectively optimize the cost of sampling and testing. Immediately after that, we constructed a minimum objective planning model to model the production process of spare parts and finished products and their related costs in detail. We solved the optimal production cost for each of the six real production scenarios faced by the enterprise. The results show that our model can not only effectively reduce production costs, but also significantly improve decision-making efficiency.

Allocating New Slots in a Multi-Airport System Based on Capacity Expansion

Over time, the rapid expansion of civil aviation infrastructure has led to the establishment of multi-airport systems (MASs) or Metroplex, where airports situated in close proximity form interconnected networks. Given that individual airport capacities often fall short of meeting flight scheduling demands, devising effective multi-airport flight scheduling methods becomes imperative. This article introduces a novel MAS slot expansion configuration framework centered on coupling terminal areas. In contrast to conventional airport capacity slot expansion approaches, this framework demonstrates superior configurational efficacy within respective airport terminal environments. The model outlined in this research identifies the terminal control sector as the pivotal resource node within the interconnected terminal area, aiming to maximize the total expanded slots while minimizing the overall unfairness among airports within the terminal airspace. Employing the ε-constraint method facilitates the transformation of the minimization objective into solvable constraint conditions. Subsequently, leveraging Beijing Metroplex as a case study, the research devises benchmark, single-airport, multi-airport minimum, and multi-airport maximum scenarios to compare and analyze configuration outcomes in terms of key resource allocation impacts and coupled resource utilization efficiencies. Ultimately, employing the AirTOp fast-time simulation model validates each scenario, demonstrating that the proposed configuration method yields reduced delay levels and fewer conflicts in simulation environments.

Efficient Distortion-Free Neural Projector Deblurring in Dynamic Projection Mapping.

Dynamic Projection Mapping (DPM) necessitates geometric compensation of the projection image based on the position and orientation of moving objects. Additionally, the projector's shallow depth of field results in pronounced defocus blur even with minimal object movement. Achieving delay-free DPM with high image quality requires real-time implementation of geometric compensation and projector deblurring. To meet this demand, we propose a framework comprising two neural components: one for geometric compensation and another for projector deblurring. The former component warps the image by detecting the optical flow of each pixel in both the projection and captured images. The latter component performs real-time sharpening as needed. Ideally, our network's parameters should be trained on data acquired in an actual environment. However, training the network from scratch while executing DPM, which demands real-time image generation, is impractical. Therefore, the network must undergo pre-training. Unfortunately, there are no publicly available large real datasets for DPM due to the diverse image quality degradation patterns. To address this challenge, we propose a realistic synthetic data generation method that numerically models geometric distortion and defocus blur in real-world DPM. Through exhaustive experiments, we have confirmed that the model trained on the proposed dataset achieves projector deblurring in the presence of geometric distortions with a quality comparable to state-of-the-art methods.

Precision parameter estimation in Proton Exchange Membrane Fuel Cells using depth information enhanced Differential Evolution

Proton Exchange Membrane Fuel Cell (PEMFC) models require parameter tuning for their design and performance improvement. In this study, Depth Information-Based Differential Evolution (Di-DE) algorithm, a novel and efficient metaheuristic approach, is applied to the complex, nonlinear optimization problem of PEMFC parameter estimation. The Di-DE algorithm was tested on twelve PEMFCs (BCS 500 W PEMFC, Nedstack 600 W PS6 PEMFC, SR-12 500 W PEMFC, H-12 PEMFC, STD 250 W PEMFC, HORIZON 500 W PEMFC and four 250W PEMFC and two H-12 12W PEMFC) and showed excellent accuracy. The Di-DE algorithm is was compared with other advanced evolutionary algorithms like iwPSO, CLPSO, DNLPSO, SLPSO, SaDE, SHADE, JADE, QUATRE, LSA, QUATRE-EMS and C-QUATRE, which obtained a minimum objective function value of 0.0255 and an average runtime improvement of 98.8%. The optimized parameters of the proposed method yielded the Sum of Squared Errors (SSE) as low as 0.00002 in some cases, which indicates better precision and stability. Moreover, the voltage–current (V–I) and power–voltage (P–V) characteristics predicted by Di-DE were within 1% error relative to the experimental data for all tested PEMFCs. The results of this work highlight the potential of the Di-DE algorithm to enable more sophisticated modelling and optimization of PEMFCs, which in turn will help to broaden the use of PEMFCs in clean energy applications.

Characterization of the temporal profile of the antinociceptive effects of an intravenous bolus of ketamine using the analgesia nociception index in no-anesthetized adult patients.

An effect-site target-controlled infusion (TCI) would allow a more precise titration of intravenous analgesics effect. The analgesia nociception index (ANI) continuously monitors the analgesia/nociception balance during general anesthesia. This study aims to derive a PKPD model of ketamine antinociceptive effect using the Domino PK parameter set and the ANI response data in awake patients without other drugs affecting the ANI response. Twenty awake adult patients were prospectively studied before general anesthesia. Patients received a single intravenous bolus of ketamine 0.1mg·kg- 1, and the subsequent ANI values were recorded. An effect compartment model incorporating the Domino PK parameter set was used to characterize the time lag between ketamine plasma concentrations and the ANI response. The model was parameterized with a single parameter Ke0. An Emax pharmacodynamic model was used to fit the ANI response data. Model parameters were estimated with NONMEM® 7.5. The minimum objective function value guided the model construction. After the ketamine administration, basal ANI values increased from 38.5 ± 4.95 to a maximum of 53.5 ± 4.95 with an observed time-to-peak effect of 1.83 ± 0.74min. Modeling analysis revealed hysteresis between predicted plasma concentrations from the Domino model and observed ANI data. Hysteresis was characterized, incorporating an estimated Keo of 0.238 (CI95% 0.20-0.28) min-1 to the described PK parameters set. The developed PKPD model, using Domino's PK parameters and the ANI response data, adequately characterized the temporal profile of ketamine's antinociceptive effect. The current estimated model parameters can be used to perform an effect-site TCI of ketamine for analgesic purposes.

Physics-informed neural networks approach for pollutant dispersion flow caused by magnetic dipole

Abstract Research on the liquid flow and distribution of waste discharge concentration over cylindrical surfaces might lead to the growth of efficient waste management and pollution controlling strategies. In view of this, the pollutant concentration and magnetic dipole impact on the liquid flow through the cylinder with a porous medium are explored in the present analysis. Moreover, Fourier’s and Fick’s laws are considered to explore heat transport features. The governing partial differential equations (PDEs) of the present study are converted into non-dimensional ordinary differential equations (ODEs) utilizing similarity variables. Also, the current study proposes a novel implementation of neural networks based on physics knowledge for the liquid flow past a cylinder. The self-updating weights and bias facilitate the network to satisfy the minimization objective function and provide accurate results. Additionally, the solution obtained by Runge Kutta Fehlberg's fourth-fifth order (RKF-45) method is utilized to validate the physics-informed neural network (PINN) results, presenting mean squared errors from 10-9 to 10-11. Furthermore, it is found that the increase in temperature relaxation time parameter decreases the Nusselt number gradually at the rate of 1 to 5%. An upsurge in the values of the pollutant external source parameter and the pollutant external source variation parameter decreases the concentration profile.

Traffic evolution in Software Defined Networks

Software Defined Networking (SDN) offers unprecedented traffic engineering possibilities due to optimal centralized decision making. However, network traffic evolves over time and changes the underlying optimization problem. Frequent application of the model to reflect traffic evolution causes flooding of control messages, traffic re-routing and synchronization problems. This paper addresses the problem of graceful traffic evolution in SDNs (Software Defined Networks) minimizing rule installations and modifications, optimizing the global objectives of minimization of Maximum Link Utilization (MLU) and minimization of the Maximum Switch Table Space Utilization (MSTU). The problem is formulated as multi-objective optimization using Mixed Integer Linear Programming (MILP). Proof of NP-Hardness is provided. Then, we re-formulate the problem as a single-objective problem and propose two greedy algorithms to solve the single-objective problem, namely MIRA-Im and MIRA-Im with Conflict Detection, and experiments are performed to show the effectiveness of the algorithms in comparison to previous state of the art proposals. Simulation results show significant improvements of MIRA-Im with Conflict Detection, especially in terms of number of installed rules (with a gain till 80% with the highest number of flows) and flow table space utilization (with a gain till 55% with the highest number of flows), compared to MIRA-Im and other algorithms available in the literature, while the other metrics are essentially stable.

Real-time scheduling for two-stage assembly flowshop with dynamic job arrivals by deep reinforcement learning

Assembly flowshops differ from flowshops because their jobs have several components that are manufactured in the processing stage and then joined together in the assembly stage. Real-time scheduling of two-stage assembly flowshops is of great significance for many discrete manufacturing companies in customized order fulfilment. Therefore, we study two-stage assembly flowshop scheduling problem with the objective of total tardiness minimization considering dynamic job arrivals using deep reinforcement learning (DRL). First, an architecture of DRL-based real-time scheduling is proposed. Second, we establish a DRL-based real-time scheduling model by designing proper state space, action space and reward function. A scheduling agent is constructed and trained through the proximal policy optimization (PPO) using interactive simulation data. The experimental results show that the trained scheduling agent can learn to choose the appropriate dispatching rules efficiently so as to make a real-time scheduling quickly and effectively. The PPO algorithm outperforms six dispatching rules, genetic algorithm and two DRL algorithms (i.e., DDQN and DDPG) in terms of solution quality and computing speed. The proposed approach is highly applicable to many practical scheduling situations that requires real-time and quick decisions.

A seismic-risk-based bi-objective stochastic optimization framework for the pre-disaster allocation of earthquake search and rescue units

Accurately predicting earthquakes' time, location and size is nearly impossible with today’s technology. Severe earthquakes require prompt and effective mobilization of available resources, as the speed of intervention has a direct impact on the number of people rescued alive. This, in turn, calls for a strategic pre-disaster allocation of search and rescue (SAR) units, both teams and equipment, to make the deployment of resources as quick and equitable as possible. In this paper, a seismic risk-based framework is introduced that takes into account distance-based contingencies between cities. This framework is then integrated into a mixed-integer non-linear programming (MINLP) problem for the allocation of SAR units under uncertainty. The two minimization objectives considered are the expected maximum deployment time of different SAR units and the expected mean absolute deviation of the fulfillment rates. We recover the best vulnerability-adjusted routes for each size-location scenario as input to the optimization model using the dynamic programming (DP) approach as part of the broader area of reinforcement learning (RL). The results of the hypothetical example indicate that the comprehensive model is feasible in various risk scenarios and can be used to make allocation-deployment decisions under uncertainty. The results of the sensitivity analysis verify that the model behaves reasonably against changes in selected parameters, namely the number of allowed facilities and weights of individual objectives. Under the assumption that the two objectives are equally important, the model achieves a total deviation of %3.5 from the objectives with an expected maximum dispatch time of 1.1327 hours and an expected mean absolute deviation of 0.01.

Bi-level task planning strategy for blended-wing-body underwater gliders

ABSTRACT This study focuses on the task planning problem of the blended-wing-body underwater glider (BWBUG), which must autonomously navigate through a sequence of underwater visitation points while ensuring safety and economy. Firstly, the task planning problem of the BWBUG is analysed, with attention given to operational space and task requirements. Subsequently, a bi-level planning framework that incorporates both the bottom-level and top-level planners is proposed. The bottom-level planner optimises the glide path between any two visit points by considering safety and glide angle constraints, with the objective of minimising energy usage. The top-level planner focuses on the task constraints and optimises the global visitation path of the BWBUG to achieve the objective of global energy minimisation. Simulations demonstrate the effectiveness of the bi-level based task planning strategy proposed in this study. The solution algorithms are highly competitive, capable of planning rational global visitation paths for the BWBUG.

Fully automated radiotherapy treatment planning: A scan to plan challenge

Background and PurposeOver the past decade, tools for automation of various sub-tasks in radiotherapy planning have been introduced, such as auto-contouring and auto-planning. The purpose of this study was to benchmark what degree of automation is possible. Materials and MethodsA challenge to perform automated treatment planning for prostate and prostate bed radiotherapy was set up. Participants were provided with simulation CTs and a treatment prescription and were asked to use automated tools to produce a deliverable radiotherapy treatment plan with as little human intervention as possible. Plans were scored for their adherence to the protocol when assessed using consensus expert contours. ResultsThirteen entries were received. The top submission adhered to 81.8% of the minimum objectives across all cases using the consensus contour, meeting all objectives in one of the ten cases. The same system met 89.5% of objectives when assessed with their own auto-contours, meeting all objectives in four of the ten cases. The majority of systems used in the challenge had regulatory clearance (Auto-contouring: 82.5%, Auto-planning: 77%). Despite the ‘hard’ rule that participants should not check or edit contours or plans, 69% reported looking at their results before submission. ConclusionsAutomation of the full planning workflow from simulation CT to deliverable treatment plan is possible for prostate and prostate bed radiotherapy. While many generated plans were found to require none or minor adjustment to be regarded as clinically acceptable, the result indicated there is still a lack of trust in such systems preventing full automation.

Multi-Objective Portfolio Optimization Using Hybrid Ant Colony Optimization and Compromise Programming

The increasing complexity of stock trading requires effective portfolio management to optimize returns while minimizing risks. Portfolio selection is critical in determining the most suitable combination of stocks, aiming to maximize expected returns and minimize risk within a given investment limit. This study constructs a mathematical model for portfolio optimization using six different stocks, incorporating constraints such as expected return, risk, and available investment. Given the multi-objective nature of the problem, a hybrid approach is proposed, combining Compromise Programming (CP), Nadir Compromise Programming (NCP), and Ant Colony Optimization (ACO) to address both minimization and maximization objectives. The ACO algorithm is applied to minimize deviation variables, which serve as the fitness function in the optimization process. The results demonstrate the effectiveness of the hybrid method in selecting portfolios that achieve minimal deviation, providing an optimal balance between risk and return. This research offers valuable insights for investors by illustrating the trade-offs between risk and reward in stock selection, contributing to more informed decision-making in portfolio management.

Adaptive Clustering and Scheduling for UAV-Enabled Data Aggregation

Using unmanned aerial vehicles (UAVs) is an effective way to gather data from Internet of Things (IoT) devices. To reduce data gathering time and redundancy, thereby enabling the timely response of state-of-the-art systems, one can partition a network into clusters and perform aggregation within each cluster. Existing works solved the UAV trajectory planning problem, in which the energy consumption and/or flight time of the UAV is the minimization objective. The aggregation scheduling within each cluster was neglected, and they assumed that data must be ready when the UAV arrives at the cluster heads (CHs). This paper addresses the minimum time aggregation scheduling problem in duty-cycled networks with a single UAV. We propose an adaptive clustering method that takes into account the trajectory and speed of the UAV. The transmission schedule of IoT devices and the UAV departure times are jointly computed so that (1) the UAV flies continuously throughout the shortest path among the CHs to minimize the hovering time and energy consumption, and (2) data are aggregated at each CH right before the UAV arrival, to maximize the data freshness. Intensive simulation shows that the proposed scheme reduces up to 35% of the aggregation delay compared to other benchmarking methods.

A fuzzy-PID controller for load frequency control of a two-area power system using a hybrid algorithm

This paper presents the use of a new hybrid optimization approach known as particle swarm optimization and grey wolf optimizer (PSO-GWO) for improving frequency stability load frequency control (LFC) in tow-area power systems. The approach consists in optimizing the fuzzy proportional-integral-derivative (fuzzy-PID) controller parameters with meta-heuristic hybrid algorithm: PSO-GWO. This technique allows to have dynamic responses with the least possible frequency deviation in very short response times. The approach proposes to controls the tie-line power and the frequency deviation in the considered two-area power systems under variable perturbation in load and changing of system parameters in order to evaluate its effectiveness. The suggested hybrid algorithm-based fuzzy-PID controller is compared with various widely used control methods in the literature such as PID controller and algorithms such as PSO and GWO in order to evaluate its effectiveness and its robustness. Through the simulations carried out on MATLAB/Simulink, the proposed PSO-GWO fuzzy-PID and the objective function exhibit improved performance, achieving minimal objective values. The proposed technique proved to be quite powerful tool in the resolution of problems related to electrical power systems, particularly in load frequency control.

The ESMO Tumour-Agnostic Classifier and Screener (ETAC-S): a tool for assessing tumour-agnostic potential of molecularly guided therapies and for steering drug development

Advances in precision oncology led to approval of tumour-agnostic molecularly guided treatment options (MGTOs). The minimum requirements for claiming tumour-agnostic potential remain elusive. The European Society for Medical Oncology (ESMO) Precision Medicine Working Group (PMWG) coordinated a project to optimise tumour-agnostic drug development. International experts examined and summarised the publicly available data used for regulatory assessment of the tumour-agnostic indications approved by the US Food and Drug Administration and/or the European Medicines Agency as of December 2023. Different scenarios of minimum objective response rate (ORR), number of tumour types investigated, and number of evaluable patients per tumour type were assessed for developing a screening tool for tumour-agnostic potential. This tool was tested using the tumour-agnostic indications approved during the first half of 2024. A taxonomy for MGTOs and a framework for tumour-agnostic drug development were conceptualised. Each tumour-agnostic indication had data establishing objective response in at least one out of five patients (ORR ≥ 20%) in two-thirds (≥4) of the investigated tumour types, with at least five evaluable patients in each tumour type. These minimum requirements were met by tested indications and may serve as a screening tool for tumour-agnostic potential, requiring further validation. We propose a conceptual taxonomy classifying MGTOs based on the therapeutic effect obtained by targeting a driver molecular aberration across tumours and its modulation by tumour-specific biology: tumour-agnostic, tumour-modulated, or tumour-restricted. The presence of biology-informed mechanistic rationale, early regulatory advice, and adequate trial design demonstrating signs of biology-driven tumour-agnostic activity, followed by confirmatory evidence, should be the principles for tumour-agnostic drug development. The ESMO Tumour-Agnostic Classifier (ETAC) focuses on the interplay of targeted driver molecular aberration and tumour-specific biology modulating the therapeutic effect of MGTOs. We propose minimum requirements to screen for tumour-agnostic potential (ETAC-S) as part of tumour-agnostic drug development. Definition of ETAC cut-offs is warranted.

Human V4 size predicts crowding distance.

Visual recognition is limited by both object size (acuity) and spacing. The spacing limit, called "crowding", is the failure to recognize an object in the presence of other objects. Here, we take advantage of individual differences in crowding behavior to investigate its biological basis. Crowding distance, the minimum object spacing needed for recognition, varies 2-fold among healthy adults. We test the conjecture that this variation in psychophysical crowding distance is due to variation in cortical map size. To test this, we made paired measurements of brain and behavior in 50 observers. We used psychophysics to measure crowding distance and calculate λ, the number of letters that fit into each observer's visual field without crowding. In the same observers, we used fMRI to measure the surface area A (mm^2) of retinotopic maps V1, V2, V3, and V4. Across observers, λ is proportional to the surface area of V4 but is uncorrelated with the surface area of V1 to V3. The proportional relationship of λ to area of V4 indicates conservation of cortical crowding distance across individuals: letters can be recognized if they are spaced by at least 1.4 mm on the V4 map, irrespective of map size and psychophysical crowding distance. We conclude that the size of V4 predicts the spacing limit of visual perception.

Optimization Analysis of Smart Energy Systems in the Fresh Supply Chain Based on Differential Games

The energy issue has gradually become a major focus of strategic competition among major nations in the contemporary world. Achieving a balance between energy, cost, and ecology is crucial, particularly in specific contexts. As one of the critical factors influencing global climate, carbon emissions have consistently been a green indicator of concern for countries worldwide. This paper addresses optimizing energy costs in the cold chain transportation of the fresh supply chain to obtain a model with low carbon emissions and transportation costs. Initially, the paper explores the equilibrium between energy and cost optimization using the theoretical framework of differential games in game theory. Building upon this, an intelligent energy system is proposed, and a basic model for constructing a smart grid is provided based on commonly used electric power. Using this as the foundational concept, a game model is constructed, considering the conflicting objectives of cost minimization, time efficiency, and energy conservation in addressing the primary issue of energy savings in the fresh supply chain, specifically the transportation path optimization problem. Compared to traditional models, the model presented in this paper reduces the scheduling of two refrigerated trucks. By optimizing this model, the transportation path's length is shortened by 5.50%, the carbon emission is decreased by 8.9%, and the model's overall cost is reduced by 4.94%. This study presents a game model that may efficiently optimize the fresh product transportation chain, reducing carbon emissions and expenses. The model has certain practical applications and serves as a guide.

Traffic-Related Air Pollution and Childhood Asthma—Are the Risks Appropriately Mitigated in Australia?

Childhood asthma is a major health issue in Australia, and traffic emissions play a causative role. Two urban planning policies that impact children’s exposure to traffic emissions are considered in terms of the potential health risks to children in a Melbourne suburb with high truck volumes and hospital attendances for childhood asthma. Firstly, the health impact assessment component of the state planning approval of a major road project, and secondly, local government placement of childcare centres and schools in relation to freight routes. Three sources of air quality monitoring data were examined: (i) a Victorian EPA reference site; (ii) a site with planning approval for development into a childcare centre; and (iii) five sites within the boundary of the West Gate Tunnel Project, an AUD 10 billion road and tunnel project. The Australian Urban Research Infrastructure Network data was utilised to assess distances of childcare centres and schools from major truck routes. A range of cconcentration–response functions for childhood asthma (0–18 years) from international systematic meta-analyses and a smaller Australian cross-sectional study were applied to comparative elevations in fine particulate matter (PM2.5) and nitrogen dioxide (NO2) concentrations between the EPA reference monitor (used for project risk assessment) and local roadside data. It was found that comparative elevations in NO2 concentrations were associated with the following risk increases: developing asthma 13%, active asthma 12%, and lifetime asthma 9%. Overall, 41% of childcare centres (n = 51) and 36% of schools (n = 22) were ≤150 m to a high-density truck route. Truck emissions likely make a substantial contribution to childhood asthma outcomes in the project area. This study exemplifies how current practices may not be commensurate with guiding policy objectives of harm minimisation and equitable protection.

Integration of MILP and discrete-event simulation for flow shop scheduling using Benders cuts

Optimization-based scheduling in the chemical industry is highly beneficial but also highly difficult due to its combinatorial complexity. Different modeling and optimization techniques exist, each with individual strengths. We propose Benders decomposition to integrate mixed-integer linear programming (MILP) and discrete-event simulation (DES) to solve flow shop scheduling problems with makespan minimization objective. The basic idea is to generate valid Benders cuts based on sensitivity information of the DES sub problem, which can be found in the critical paths of DES solutions. For scaled literature flow shops, our approach requires at least an order of magnitude fewer iterations than a genetic algorithm and provides optimality gap information. For a real-world case study, our approach finds good solutions very quickly, making it a powerful alternative to established methods. We conclude that the Benders-DES algorithm is a promising approach to combine rigorous MILP optimization capabilities with high-fidelity DES modeling capabilities.

Deepbet: Fast brain extraction of T1-weighted MRI using Convolutional Neural Networks

Background:Brain extraction in magnetic resonance imaging (MRI) data is an important segmentation step in many neuroimaging preprocessing pipelines. Image segmentation is one of the research fields in which deep learning had the biggest impact in recent years. Consequently, traditional brain extraction methods are now being replaced by deep learning-based methods. Method:Here, we used a unique dataset compilation comprising 7837 T1-weighted (T1w) MR images from 191 different OpenNeuro datasets in combination with advanced deep learning methods to build a fast, high-precision brain extraction tool called deepbet. Results:deepbet sets a novel state-of-the-art performance during cross-dataset validation with a median Dice score (DSC) of 99.0 on unseen datasets, outperforming the current best performing deep learning (DSC=97.9) and classic (DSC=96.5) methods. While current methods are more sensitive to outliers, deepbet achieves a Dice score of >97.4 across all 7837 images from 191 different datasets. This robustness was additionally tested in 5 external datasets, which included challenging clinical MR images. During visual exploration of each method’s output which resulted in the lowest Dice score, major errors could be found for all of the tested tools except deepbet. Finally, deepbet uses a compute efficient variant of the UNet architecture, which accelerates brain extraction by a factor of ≈10 compared to current methods, enabling the processing of one image in ≈2 s on low level hardware. Conclusions:In conclusion, deepbet demonstrates superior performance and reliability in brain extraction across a wide range of T1w MR images of adults, outperforming existing top tools. Its high minimal Dice score and minimal objective errors, even in challenging conditions, validate deepbet as a highly dependable tool for accurate brain extraction. deepbet can be conveniently installed via “pip install deepbet” and is publicly accessible at https://github.com/wwu-mmll/deepbet.