Deep learning neural networks require an immense amount of computation, especially in the training phase of the network when networks with multiple layers of intermediate neurons need to be built. In this paper, we will focus on the PSO algorithm with the aim of significantly accelerating the DLNN training phase by taking advantage of the GPGPU architecture and the Apache Spark analytics engine for large-scale data processing tasks. PSO is a bio-inspired stochastic optimization method whose goal is to iteratively improve the solution to a (usually complex) problem by attempting to approximate a given objective. However, parallelizing an efficient PSO is not a straightforward process due to the complexity of the computations performed on the swarm of particles and the iterative execution of the algorithm until a solution close to the objective with minimal error is achieved. In the present work, two parallelizations of the PSO algorithm have been implemented , both designed for a distributed execution environment. The synchronous parallel PSO implementation ensures consistency at the cost of potential idle time due to global synchronization, while the asynchronous parallel PSO approach improves execution time by reducing the need for global synchronization, making it more suitable for large datasets and distributed environments such as Apache Spark. Both variants of PSO have been implemented to distribute the computational load supported by this algorithm –due to the costly fitness evaluation and updating of particle positions– across the different Spark cluster executor nodes to effectively achieve coarse-grained parallelism, resulting in a significant performance increase over current sequential variants of PSO.

In this study, based on a new quantum integral identity, the authors establish some quantum estimates of Hermite-Hadamard type inequalities for convex functions. These results generalize and improve some known results given in literatures.

The advancement of autonomous capabilities in maritime navigation has gained significant attention, with a trajectory moving from decision support systems to full autonomy. This push towards autonomy has led to extensive research focusing on collision avoidance, a critical aspect of safe navigation. Among the various possible approaches, Dynamic Programming is a promising tool for optimizing collision avoidance maneuvers. This paper presents a DP formulation for collision avoidance of autonomous vessels. We set up the problem framework, formulate it as a multi-stage decision process, define cost functions and constraints focusing on the actual requirements a marine maneuver must comply with, and propose a solution algorithm leveraging parallel computing. Additionally, we present a greedy approximation to reduce algorithm complexity. Through case studies, we demonstrate the effectiveness of the proposed approach in navigating complex scenarios, contributing to the future of autonomous maritime navigation. Through case studies, we show the efficacy of our approach in navigating complex scenarios.

Machine unlearning, the process of selectively forgetting or removing the influence of specific data points from a machine learning model, is increasingly important for privacy and compliance with regulations like the GDPR. This paper explores the concept of exact unlearning, focusing on its implementation in models trained using convex and non-convex functions. Convex functions, due to their well-behaved optimization landscapes, lend themselves to efficient unlearning through methods such as inverse optimization, duality-based approaches, and incremental learning. In contrast, non-convex functions, common in deep learning models, present more complex challenges due to their multiple local minima and high-dimensional parameter spaces. Techniques like checkpoint-based retraining, gradient inversion, and meta-learning are discussed as viable, though computationally expensive, methods for non-convex exact unlearning. The paper also highlights real-world applications in fields such as finance and healthcare, where exact unlearning can enhance privacy and security without compromising model performance. Finally, it outlines key challenges and future research directions, particularly the need for more efficient unlearning algorithms in non-convex settings and the development of secure, adversarial-resistant methods for sensitive data removal.

Feature selection is predominantly used in machine learning tasks, such as classification and regression. It selects a subset of features (relevant attributes of data points) from a larger set that contributes as optimally as possible to the informativeness of the model. There are exponentially many subsets of a given set, and thus, the exhaustive search is only practical for problems with at most a few dozen features. In the past, there have been attempts to reduce the search space using dynamic programming. However, models that consider similarity in pairs of features besides the quality of individual features do not provide the required optimal substructure. As a result, algorithms, which we will call suboptimal dynamic programming algorithms, find a solution that may deviate significantly from the optimal one. In this paper, we propose a dynamic programming algorithm with an iterative upgrade where the order of feature processing is inverted in each iteration. Such an alternating approach allows for improving the optimization function by using the score from the previous iteration to estimate the contribution of unprocessed features. The iterative process is proven to converge and terminate when the solution does not change in three successive iterations or when the number of iterations reaches the threshold. Results in more than 90 % of tests align with those of the exhaustive search, being competitive and often superior to the reference greedy approach. The validation was done by comparing the scores of output feature subsets and examining the accuracy of different classifiers learned on these features. In the context of feature selection, the proposed algorithm can be characterized as a filter method. However, we expect that the idea of alternating suboptimal optimization will soon be generalized to tasks beyond feature selection.

Advancements in computing technology have resulted in significant changes in education, healthcare, and manufacturing fields. Thus, personnel training in computer-related fields is directly related to national competitiveness. Therefore, the importance of programming education has been emphasized worldwide. Programming education has been conducted since the 1980s, however beginners often find programming tedious and difficult because of the cognitive burden of using text commands. Therefore, block-based programming environments, such as Scratch and Code.org, and beginner-oriented programming environments, such as Blockly and Pencil Code, have been de-veloped. However, they have limitations when transitioning from block to text-based programming. In this study, we conducted one semester of classes for 128 middle school, high school, and uni-versity students to determine whether an environment that allows using a text-based programming language in a block-based programming environment aids beginners’ understanding of program-ming instructions, command usage confidence, and programming usefulness. The results confirm that the usability of a block-based environment positively influences programming perception. This study is significant because it verifies the necessity and effectiveness of a block-based environment that employs a text-based programming language in programming education for beginners.

In this paper, we consider a class of bilevel programming problems (abbreviated as, BLPP). Exploiting the generalized approximate convexity assumptions, we investigate the relations among the solutions of approximate Minty (respectively, Stampacchia) type variational inequalities (abbreviated as, AMTVI (respectively, ASTVI)), and the local ϵ-quasi solutions of the BLPP. Moreover, by employing the generalized Knaster–Kuratowski–Mazurkiewicz (abbreviated as, KKM)-Fan’s lemma, we derive some existence results for the solutions of approximate variational inequalities (abbreviated as, AVI), namely, AMTVI and ASTVI. A non-trivial example is given to highlight the importance of the established results. To the best of our knowledge, there is no research paper available in the literature that establishes relationships between the AVI and the BLPP under the assumptions of generalized approximate convexity in terms of limiting subdifferentials.

Utilizing groundwater offers a promising solution to alleviate water stress in Ethiopia, providing a dependable and sustainable water source, particularly in regions with limited or unreliable surface water availability. However, effective decision-making regarding well drilling and placement is essential to maximize groundwater resource potential, enhancing agricultural productivity, reducing hunger, and bolstering food security in Ethiopia. This study concentrates on the development of two-stage stochastic mixed integer programming (SMIP) models to optimize well placement for sustainable agricultural irrigation, considering uncertain demand scenarios. Additionally, a deterministic mixed integer programming model is formulated for comparison with the two-stage SMIP. Experiments are conducted to explore various demand scenario distributions, revealing that the optimized total cost for the two-stage SMIP generally exceeds that of a deterministic setting, aligning with the two-stage SMIP's focus on long-term benefits. Moreover, slight differences are observed in well layouts under different assumption scenarios. The study also examines the impact of selected parameters, such as fixed construction costs, per-meter drilling costs, and demand scenarios. The out-of-sample performance shows that the stochastic model is more flexible and resilient, with 11% and 4% lower costs than deterministic cases 1 and 3, respectively. This flexibility provides a more robust long-term strategy for well placement and resource allocation in groundwater management.

The optimal structural design is imperative to minimize material consumption and reduce the environmental impact of construction. Given the complexity in the formulation of structural design problems, the process of optimization is commonly performed using artificial intelligence (AI) global optimization, such as Genetic Algorithm (GA). However, the integration of AI-based optimization together with visual programming (VP) in building information modeling (BIM) projects warrants further investigation. This study proposes a workflow by combining structure analysis, VP, BIM, and GA to optimize trusses. The methodology encompasses several steps including: (i) generation of parametric trusses in Dynamo VP; (ii) performing the finite element modeling (FEM) using Robot Structural Analysis (RSA); (iii) retrieving and evaluating the FEM results interchangeably between Dynamo and RSA; (iv) finding the best solution using GA; and (v) importing the optimized model into Revit, enabling the user to perform simulations and engineering analysis, such as life cycle assessment (LCA) and quantity surveying. The feasibility of the proposed workflow was tested on benchmark problems and compared with open literature. The outcomes of this study offer insight into the opportunities and limitations of combining VP, GA, FEA, and BIM for structural optimization applications, particularly to enhance structural efficiency and sustainability in construction.

In this paper, we present a full coverage path planning (CPP) algorithm for the marine surveys conducted in the convex polygon shaped search area. The survey is supposed to carry out by torpedo-type AUVs (autonomous underwater vehicles). Due to their nonholonomic mechanical characteristics, these vehicles have nonzero minimum turning radius. For any given polygon shaped search area, it can always be partitioned into one or more convex polygons. With this in mind, this paper proposes a novel search algorithm called CbSPSA (Calculation based Shortest Path Search Algorithm) for full coverage of any given convex polygon shaped search area. By aligning the search inter-tracks alongside the edge with the minimum height, we can guarantee the minimum number of the vehicle’s turns. In addition, the proposed method can guarantee the planned path is strictly located inside the polygon area without overlapped or crossed path lines, and also has the total path length as short as possible. Considering the vehicle’s nonzero minimum turning radius, we also propose a sort of smoothing algorithm to smooth the waypoint path searched by CbSPSA so as for the vehicle to exactly follow it. The smoothed path is also guaranteed to be strictly located inside the polygon. Numerical simulation analyses are also carried out to verify the effectiveness of the proposed schemes.

This study explores the properties and behavior of bi-close-to-convex functions, introducing new subclasses defined by their relationship with fractional differential operator and bi-univalent functions. Using the Faber polynomial technique, we derive upper bounds for the n^{th} coefficient of functions in these classes. We also investigate the erratic behavior of initial coefficients in bi-close-to-convex functions, as characterized by the (λ,q)-fractional differintegral operator. Furthermore, we address Fekete-Szegö problems and present notable findings from our investigation, contributing to the continued growth and refinement of geometric function theory, yielding new insights and practical uses.

This report discusses the application of approximate dynamic programming (ADP) and Krylov subspace methods in solving sequential decision-making problems in machine learning. ADP is used when dealing with large state spaces or when the exact dynamics are unknown. The paper explores various ADP methods such as temporal difference learning and least-squares policy evaluation. The authors also focus on the use of Krylov subspace methods for solving the Bellman equation in ADP. The report provides insights into linear approximation, stochastic algorithms, and the Arnoldi algorithm for orthonormal basis. Overall, the paper highlights the theoretical foundation provided by ADP and its connection with Krylov subspace methods, shedding light on their application in computer science.

Hybrid power plants have recently emerged as reliable and flexible electricity generation stations by combining multiple renewable energy sources, energy storage systems (ESS), and fossil-based output. However, the effective operation of the hybrid power plants to ensure continuous energy dispatch under challenging conditions is a complex task. This paper proposes a dispatch engine (DE) based on mixed-integer linear programming (MILP) for the planning and management of hybrid power plants. To maintain the committed electricity output, the dispatch engine will provide schedules for operation over extended time periods as well as monitor and reschedule the operation in real-time. Through precise prediction of the PV and wind power output, the proposed approach guarantees optimum scheduling. The precise prediction of the PV and wind power are achieved by employing a predictor of Feed-Forward Neural Network (FFNN) type. With such a dispatch engine, the operational cost of the hybrid power plants, and the use of diesel generators (DGs) are both minimized. A case study is carried out to assess the proposed dispatch engine feasibility. A real-time measurement data pertaining to load, wind, and PV power outputs is obtained from different locations in the Sultanate of Oman. The real-time data is utilized to predict the future output power from PV and the Wind farm over 24 hours. The predicted powers are then used in combination with a PV-Wind-DG-ESS-Grid hybrid plant to evaluate the performance of the proposed dispatch engine. The proposed approach is implemented and simulated using MATLAB. The results of the simulation reveal the proposed Feed-Forward Neural Network’s (FFNN) powerful forecasting abilities. In addition, the results demonstrate that adopting the proposed DE can minimize the use of DG units and reduce plant running expenses.

This article investigates robust optimality and duality for a class of nonsmooth multiobjective programming problems with vanishing constraints under data uncertainty (in short, UNMPVC) via convexificators. Using the properties of convexificators, we introduce generalized standard Abadie constraint qualification (in short, GS-ACQ) for the considered problem UNMPVC. Moreover, we introduce generalized robust version of nonsmooth stationary conditions, namely, weakly stationary point (in short, RW-Stationary), T-stationary point (in short, RT-Stationary), M-stationary point (in short, RM-Stationary) and S-stationary point (in short, RS-Stationary) for UNMPVC. By employing GS-ACQ, we establish that the RS-Stationary is the necessary first-order optimality condition for a local Pareto solution of UNMPVC. Moreover, under generalized convexity assumptions, we establish sufficient optimality criteria for UNMPVC. Furthermore, we formulate the Wolfe-type (in short, WRD) and Mond-Weir-type (in short, MWRD) robust dual models corresponding to the primal problem UNMPVC.

This article develops duality principles and related convex dual formulations suitable for the local optimization of non-convex primal formulations for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a Ginzburg-Landau type equation.

This article develops a duality principle and a related convex dual formulation suitable for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a model in non-linear elasticity.

The study shows that the volumes and surfaces of $n$-balls, $n$-simplices, and $n$-orthoplices are holomorphic functions of $n$, which makes those objects omnidimensional, that is well defined in any complex dimension. Applications of these formulas to the omnidimensional polytopes inscribed in and circumscribed about $n$-balls reveal previously unknown properties of these geometric objects. In particular, for $0 < n < 1$, the volumes of the omnidimensional polytopes are larger than those of circumscribing $n$-balls, and both their volumes and surfaces are smaller than those of inscribed $n$-balls. The surface of an $n$-simplex circumscribing unit diameter $n$-ball is spirally convergent to zero with real $n$ approaching negative infinity but first has a local maximum at $n=-3.5$. The surface of an $n$-orthoplex circumscribing unit diameter $n$-ball is spirally divergent with real $n$ approaching negative infinity but first has a local minimum at $n=-1.5$, where its real and imaginary parts are equal to each other; similarly, as its volume, where the similar local minimum occurs at $n=-3.5$. Reflection functions for volumes and surfaces of these polytopes inscribed in and circumscribed about $n$-balls are proposed. symmetries of products and quotients of volumes in complex dimensions $n$ and $-n$ and of surfaces in complex dimensions $n$ and $2-n$ are shown to be independent of the metric factor and the gamma function. Specific symmetries also hold between volumes and surfaces in dimensions $n = -1/2$ and $n = 1/2$.

The article presents a model for optimizing biomass supply chains using the linear programming framework integrated with a Geographic Information System. Based on the distance from a given type of biomass resource, its calorific value, price, and transportation costs, the model identifies the optimal source of biomass, allowing it to cover the demand for the required total energy value with the lowest possible costs. The case study includes the Połaniec power plant in southeastern Poland and potential sources of forest biomass and agricultural straw within 100 km of the plant. Unit costs of biomass varied depending on biomass availability and energy demands. For energy demand on the level of 1 PJ yearly, the lowest unit costs of biomass (4.08 €/MJ) were when all kinds of biomass were available, and the highest (5.47 €/MJ) was when only stacked wood was available. As energy demand increased, unit costs increased, and the ability to meet this demand with just one type of biomass decreased. The energy biomass sector can utilize the model to benefit both biomass producers and their final buyers.

Memristor has attracted a lot of interest due to its high processing speed, low power consumption and high integration ability, which is critical for electronic systems and memory-centric computing. However, the memristor programming circuit and strategy are still inflexible and complex, since the signal generator/collector and stimulate pulse must be carefully matched and designed based on memristor intrinsic characteristics without reconfigurable. Here, a simple and effective circuit only consists a parallel reference-resistor-and-NMOS is designed to program memristor with a more than 99% memristance precision. And the amplitude and width of stimulate pulse are fixed to ±4V and 5ms, respectively. In order to cope with the device variation, such as ±10% tolerance of transition voltage, an optimized programming strategy was proposed and demonstrated great robustness. Additionally, a set of reference resistors and NMOSs have been added to facilitate multi-level memristance operation without requiring any changes to the circuit structure. This program circuit was also employed to program memristor crossbar remains 99% precision. In the end, a memristor-based convolutional neural network which controlled by our optimized programming circuit was used for image recognition, and 89.36% accuracy can be achieved even under 15.8% memristance tolerance. This novel circuit demonstrates a simple and flexible strategy in memristor programming, providing a new way to control memristor crossbar for practical application.

This paper introduces the implementation of a genetic programming (GP)-based procedure to the automatic design and tuning of process controllers. The proposed approach makes a significant contribution to the field of artificial intelligence (AI) in control engineering. Unlike other controller design methods, the GP-based program handles the entire design in the time domain, including differential operations like derivatives and integrals, without the need for intermediate inverse Laplace transformation. This approach not only simplifies the design process but also ensures that all generated controllers are implementable in physical systems. Furthermore, GP’s functions set includes various mathematical operations beyond basic arithmetic operators, such as trigonometric, exponential, and logarithmic operators. The performance and validity of the resulting controllers generated by the proposed GP-based approach are evaluated by verifying whether the generator can replicate the structure and performance of those produced by traditional controller design methods and, in some cases, achieve even better results. As a result, the GP-based approach presents a promising solution for automating the controller design process and addressing control problems in various engineering applications.

Different organisms, cell types, and even similar cell lines can dramatically differ in resistance to genotoxic stress. This testifies to the wide opportunities for genetic and epigenetic regulation of stress resistance. These opportunities could be used to increas the effectiveness of cancer therapy, develop new varieties of plants and animals, and search for new pharmacological targets to enhance human radioresistance, for example, for -manned deep space expeditions. Based on the comparison of transcriptomic studies in cancer cells, in this review we propose that there is a high diversity of genetic mechanisms of development of genotoxic stress resistance. This review focused onpossibilities and limitations of the proposed regulation of the resistance of normal cells whole organisms to genotoxic and oxidative stress by overexpressing of stress-response genes. Moreover, the existing experimental data on the effect of such overexpression on the resistance of cells and organisms to various genotoxic agents has been analyzed and systematized. We suggest that the recent advances in the development of multiplex and highly customizable gene overexpression technology that utilizes the mutant Cas9 protein and the wealth of available data on gene functions and their signal networks open new opportunities for research in this field.

This paper presents a case study on using Emacs and Org-mode for literate programming in undergraduate data science courses. Over three academic terms, the author mandated these tools across courses in R, Python, C++, SQL, and more. Onboarding relied on simplified Emacs tutorials and starter configurations. Students gained proficiency after initial practice. Live coding sessions demonstrated the flexible instruction enabled by literate notebooks. Assignments and projects required documentation alongside functional code. Student feedback showed enthusiasm for learning a versatile IDE, despite some frustration with the learning curve. Skilled students highlighted efficiency gains in a unified environment. However, uneven adoption of documentation practices pointed to a need for better incorporation into grading. Additionally, some students found Emacs unintuitive, desiring more accessible options. This highlights a need to match tools to skills levels, potentially starting novices with graphical IDEs before introducing Emacs. Key takeaways include literate programming aids comprehension but requires rigorous onboarding and reinforcement; Emacs excels for advanced workflows but has a steep initial curve. With proper support, these tools show promise for data science education.

Genetic Programming (GP) is a powerful Machine Learning (ML) algorithm that can produce readable white-box models. Although successfully used for solving an array of problems in different scientific areas, GP is still not well known in Remote Sensing. The M3GP algorithm, a variant of the standard GP algorithm, performs Feature Construction by evolving hyper-features from the original ones. In this work, we use the M3GP algorithm on several sets of satellite images over different countries to create hyper-feature from satellite bands to improve the classification of land cover types. We add the evolved hyper-features to the reference datasets and observe a significant improvement of the performance of three state-of-the-art ML algorithms (Decision Trees, Random Forests and XGBoost) on multiclass classifications and no significant effect on the binary classifications. We show that adding the M3GP hyper-features to the reference datasets brings better results than adding the well-known spectral indices NDVI, NDWI and NBR. We also compare the performance of the M3GP hyper-features in the binary classification problems with those created by other Feature Construction methods like FFX and EFS.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we looked at the duality of resource allocation problems. First, we chose a real world optimization problem and looked at its solution with linear programming. Then, we restudied this problem with a quantum algorithm in order to understand whether if there is a speedup of the solution. The improvement in computation is analysed and some interesting results are reported.

In this paper, the concept of fuzzy locally convex spaces generated by a family of fuzzy seminorms is introduced. We prove that a Minkowski functional of zero neighborhoods generates a seminorm and finally deduce that the topology generated by the family of seminorms coincides with that of the Minkowski functional.

This paper is regarding design and program an Micro-controller Arduino Uno board by using Arduino software to work as a photo-sensor(Active) single axial solar tracker system(SASTS). A solar panel, two photo-resistors (LDR) in two sides (north/south) of the photo-voltaic(PV) and a servo motor are connected to the Uno board, which is running a code that prepared by Arduino software IDE in advanced then it works as a tracking system. Here, the LDRs send the signal of presence or absence of the light to the board and based on that sent signal the Uno reflects a new signal to the servo motor to rotate and finds the light source. Lastly, the photo-sensor single axis tracker is made while Continuously, the system tries to face the panel to the sun and whilst changing the irradiance intensity it starts searching to find the angle of highest irradiance. Based on results that are extracted from the data, the tracker system significantly boosts the output efficiency of the solar panel. By using the Micro-controller Uno board, LDRs, servo motor and special designed mechanical base, the tracking system is constructed, based on acquired data the influence of the STS on the increasing the solar panel efficiency is more obvious. Significantly, the tracker system rises the efficiency of the PV .

Vulnerability is the big issue of the small inland urban centers exposed to the risk of depopulation. In the climate and in the context of an increasing seismic risk in the center-northern part of Italy, seismic vulnerability can become the determinant cause of the final abandonment of a small town. In some Italian regions, as well as Emilia Romagna, municipalities are implementing seismic vulnerability reduction policies based on the Emergency Limit Condition that has become a basic reference for ordinary land planning. This study proposes a valuation planning approach to the seismic vulnerability reduction carried out within the general planning framework concerning the Faentina Union, a group of five small towns located in the south-western part of the Province of Ravenna, Italy. The approach consists of three main stages: knowledge – the typological, constructive and technological description of the buildings specifically concerning their vulnerability degree; interpretation – the analyses aimed to outline a range of hypotheses about the damages in case of seism; planning – identifying the works intended to definitely reduce the vulnerability of the buildings. This stage includes a cost modelling tools aimed at outlining the trade-off between the extension and the intensity of the vulnerability reduction works, given the budget.

Students in their first year of computer science (CS1) at universities typically struggle to grasp programming concepts. This paper covers research using a Java programming language-guided visual execution environment (VEE) to teach CS1 students about programming concepts. The topics covered include input and output, conditionals, loops, functions, arrays, recursion, and files, all of which are covered in an introductory programming course. The VEE walks beginner programmers through the fundamentals of programming, utilizing visual metaphors to explain and direct interactive Java tasks. The primary goal of this study is to determine whether a cohort of 105 CS1 students from four different groups who are enrolled in two universities—one in Madrid, Spain, and the other in Galway, Ireland—can advance their programming abilities under the guidance of the VEE. Second, does the improvement vary depending on the programming concept? The findings demonstrate that students' programming knowledge has greatly increased. This improvement is significant for all programming concepts, while it is more pronounced for some topics than others, such as operators, conditionals, and loops. Additionally, it demonstrates that students had little prior understanding of files and recursion. The most well-known concept to them was the sequence concept.

The focus of this paper is on analyzing the role and the choice of parameters in sociophysics diffusion models, by leveraging the potentialities of sociophysics from a mathematical programming perspective. We first present a generalised version of Galam’s opinion diffusion model (see, e.g. , ). For a given selection of the coefficients in our model, this proposal yields the original Galam’s model. The generalised model suggests guidelines for possible alternative selection of its parameters that allow to foster diffusion. Examples of the parameters selection process as steered by numerical optimisation, taking into account various objectives, are provided.

This proposal advocates using energy states as fundamental units for quantum computer programming. Each programming unit is conceptualized as an energy state, manifested as an essence-unit. The essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach allows recording various forms of matter on quantum computers in essence-units representing their energy states. Recording energy states is achieved through the creation of four distinct coherent potentials facilitated by quantum dots or crystals. It is crucial to note that these energy states, embodied in essence-units, cannot be subdivided. The study examines the intricate relationship between similarity, fractals, and uniqueness in quantum dot operations, elucidating their profound implications for information transfer efficiency. Normalized entropy quantifies the charge localization in quantum dot impurities in systems exhibiting distortions. Utilizing N-level recording and entropy-fractal dimension equivalence enables this paper to elucidate the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology represents a significant departure from the current state of quantum computing, offering unprecedented potential for overcoming previously intractable challenges.

This research work focused on the risks we are faced with on our day to day activities, either directly or indirectly, which can gradually accumulates and results to communal crisis, religious crisis, socio-economic agitations and tribal crises. Nasarawa Eggon Local Government Area of Nasarawa State was used as case study and a well structure close–ended questionnaire was used for data collection as it relates to Controlled Self Risk Assessment (CSRA) and linear programming technique was used to analyze. The results proved that many of this processes were neglected in these communities, making them to be prone to incessant communal crisis. The study recommend that Government should strongly, as a matter of urgency address the unemployment rate, distribution of political position, schools, primary health care and equip security personnel with the modern technology facilities, which happen to record the highest risk level.

Obesity is a complex chronic disease characterized by excess of body fat. It represents a significant public health problem due to the health-related risk factors. There are growing evidences showing that maternal obesity can program the offspring, which influence neonatal phenotype and predispose offspring to a higher prevalence of metabolic disorders such as obesity. This increased risk may also be epigenetically transmitted across generations. Thus, there is an urgent need to find effective reprogramming approaches in order to resume normal fetal development. Polyphenols are bioactive compounds found in fruits and vegetables that exert their anti-obesity effect through its powerful anti-oxidant and anti-inflammatory activities. Polyphenols supplementation has been proven to counteract the deleterious effects of maternal obesity programming on offspring. Indeed, some polyphenols can cross the placenta and protect the fetal predisposition against obesity. The present review summarizes the effects of dietary polyphenols on obesity-induced maternal reprogramming as an offspring anti-obesity approach.

In this article, we consider a class of nonsmooth interval-valued multiobjective semi-infinite programming problems with vanishing constraints (in short, NIMSIPVC). We introduce the VC-Abadie constraint qualification (in short, VC-ACQ) for NIMSIPVC and employ it to establish Karush-Kuhn-Tucker (in short, KKT)-type necessary optimality conditions. Related to NIMSIPVC, we formulate interval-valued vector Lagrange type dual and scalarized Lagrange type dual problems. Subsequently, we establish weak, strong, and converse duality results relating NIMSIPVC and corresponding dual problems. In addition, we introduce the notions of saddle points for interval-valued vector Lagrangian and scalarized Lagrangian of NIMSIPVC. Moreover, we establish the saddle point optimality criteria for NIMSIPVC. Various non-trivial examples are provided to demonstrate the validity of established results. To the best of our knowledge, optimality conditions, Lagrange type duality, and saddle point optimality criteria for NIMSIPVC have not been investigated yet via Clarke subdifferentials.

In the paper is described the control electronics for an industrial pneumatic – hydraulic system based on a low-cost PLC. The developed system is a hydraulic pulse system and it generates series of high pressure hydraulic pulses (max. 200 bar). We describe requirements, an overall concept of the embedded control system, user interface, security features and network connectivity. In the description of the software solution we describe implementation of hierarchical ordered program threads (multithreaded program) and main control state machine. At the conclusion, we describe the calibration method of the system and calibration curves and we present the schematic diagram and a photo of a functional prototype of the system.

Recent advancements in Intelligent Tutoring Systems (ITS), driven by Artificial Intelligence (AI), have attracted substantial research interest, particularly in the domain of computer programming education. Given the diversity in learners' backgrounds, cognitive abilities, and learning paces, the development of personalized tutoring strategies to support effective attainment of learning objectives has become a critical challenge. This paper introduces PerFuSIT (Personalized Fuzzy Logic Strategies for Intelligent Tutoring of Programming), an innovative fuzzy logic-based module designed to select the most appropriate tutoring strategy from five available options, based on individual learner characteristics. The available strategies include revisiting previous content, progressing to the next topic, providing supplementary materials, assigning additional exercises, or advising the learner to take a break. PerFuSIT's decision-making process incorporates a range of learner-specific parameters, such as performance metrics, error types, indicators of carelessness, frequency of help requests, and the time required to complete tasks. Embedded within the traditional ITS framework, PerFuSIT introduces a sophisticated reasoning mechanism for dynamically determining the optimal instructional approach. Experimental evaluations demonstrate that PerFuSIT significantly enhances learner performance and improves the overall efficacy of interactions with the ITS. The findings highlight the potential of fuzzy logic to optimize adaptive tutoring strategies by customizing instruction to individual learners' strengths and weaknesses, thereby providing more effective and personalized educational support in programming instruction.

Today, computer programming is an essential pillar in the education of individuals. Even though technological evolution has eased the massive need for computer programming, a systematic lit-erature review shows some problems remain with teaching computer programing. To address such issues, in this paper we propose an adapted theory, a method, and a model for teaching some knowledge objects associated with the concepts of variables, expressions, comparisons, loops, and functions in programming fundamentals in computer sciences. The main contribution of this study comprises the extension of the concept of didactic transposition to improve teaching in context; in this paper, the idea is called didactic transposition in extensa sensu. The proposal involves the development of a linguistic corpus based on syllabi, textbooks, reference manuals, and a survey applied to experts in teaching programming fundamentals based on seventy-eight universities worldwide. An adapted theory, a method, and a model for teaching programming fundamentals using computational linguistics are produced. In addition, a template is created for designing teaching practices in this regard. The proposal generates an important alternative for the devel-opment of teaching strategies where the conditions of the context are addressed as a priority; ad-ditionally, several aspects are considered for elaborating teaching strategies using computational linguistic techniques from written documents.

The article presents a new scalable iterative method for linear programming called the “apex method”. The key feature of this method is constructing a path close to optimal on the surface of the feasible region from a certain starting point to the exact solution of linear programming problem. The optimal path refers to a path of minimum length according to the Euclidean metric. The apex method is based on the predictor-corrector framework and proceeds in two stages: quest (predictor) and target (corrector). The quest stage calculates a rough initial approximation of linear programming problem. The target stage refines the initial approximation with a given precision. The main operation used in the apex method is an operation that calculates the pseudoprojection, which is a generalization of the metric projection to a convex closed set. This operation is used both in the quest stage and in the target stage. A parallel algorithm using a Fejér mapping to compute the pseudoprojection is presented. An analytical estimation of the parallelism degree of this algorithm is obtained. Also, an algorithm implementing the target stage is given. The convergence of this algorithm is proven. An experimental study of the scalability of the apex method on a cluster computing system is described. The results of applying the apex method to solve problems from the Netlib-LP repository are presented.

In this work, an algorithm for the scheduling of household appliances to reduce the energy cost and the peak-power consumption is proposed. The system architecture of a home energy management system (HEMS) is presented to operate the appliances. The dynamics of thermal and non-thermal appliances is represented into state-space model to formulate the scheduling task into a mixed-integer-linear-programming (MILP) optimization problem. Model predictive control (MPC) strategy is used to operate the appliances in real-time. The HEMS schedules the appliances in a dynamic manner without any a priori knowledge of the load-consumption pattern. At the same time, HEMS responds to the real-time electricity market and the external environmental conditions (solar radiation, ambient temperature etc). Simulation results exhibit the benefits of proposed HEMS by showing the reduction of up to 47% in electricity cost and up to 48% in peak power consumption.

Quantum computers are machines that are designed to use quantum mechanics in order to improve upon classical computers by running quantum algorithms. One of the main applications of quantum computing is solving optimization problems. For addressing optimization problems, we can use linear programming. Linear programming is a method to obtain the best possible outcome in a special case of mathematical programming. Application areas of this problem consist of resource allocation, production scheduling, parameter estimation, etc. In our study, we look at quantum speedup ratios of HHL Algorithm for different scenarios of linear programming. In a first scenario we look quantum speedup ratio (S(N)) as a function of phase transition and the ratio (κ) between the greatest and smallest eigenvalues of the matrix in linear equation system. As a second scenario, we investigate the changes in S(N) as a function of κ and s, which is the coefficient for defining the matrix as s-sparse.

Some refinements and reverses of the Fejer's inequality for convex functions are given.

This study presents review of 7580 papers in 13 academic journals, published from January 2015 to January 2020. After a detailed analysis of all papers, 46 papers were further selected showing research on a student population aged between 6 and 15 years old. In order for the paper to be included in the research, the condition was that the paper deals with teaching at least one of the following content areas: programming languages, game design, computer thinking (CT), algorithmic thinking and robotics programming. This study shows the representation of the listed content area in reviewed papers for the specified time period as well as a detailed analysis of the selected papers. Available data about study, participants and education level, country (first author), learning domain, teaching tools, research questions, hypothesis, pre/post-test results, interviews, control groups, course duration, research design, previous experience, project or grant and re-search purpose in detected papers were analysed. In addition, impact of studying some of the listed content areas on student learning performance, motivation, attitude and perception were investigated.

Photogrammetry involves aerial photography of the earth’s surface and subsequently processing the images to provide a more accurate depiction of the area (Orthophotography). It’s used by the Spanish Instituto Geográfico Nacional to update road cartography but requires a significant amount of manual labor due to the need to perform visual inspection of all tiled images. Deep Learning techniques (artificial neural networks with more than one hidden layer) can perform road detection but it is still unclear how to find the optimal network architecture. Our system applies grammar guided genetic programming to the search of deep neural network architectures. In this kind of evolutive algorithm all the population individuals (here candidate network architectures) are constrained to rules specified by a grammar that defines valid and useful structural patterns to guide the search process. Grammar used includes well-known complex structures (e.g. Inception-like modules) combined with a custom designed mutation operator (dynamically links the mutation probability to structural diversity). Pilot results show that the system is able to design models for road detection that obtain test accuracies similar to that reached by state of the art models when evaluated over a dataset from the Spanish National Aerial Orthophotography Plan.

As the demands in reliability and high-degree of automation in industrial applications are increasing exponentially, the current Industry 4.0 trend lies in migrating towards smarter technologies that increase flexibility and provide autonomous operation. To tackle this, manufacturers shifted towards Real-Time Ethernet communication which supports autonomous operation, faster sensor/actuator configuration and high degree of determinism. Nevertheless, the uninterrupted operating principle of legacy industrial systems as well as the system complexity and heterogeneity constitutes the transition to Real-Time Ethernet very challenging. This article proposes a novel method allowing to automate the generation of executable code for Real-Time Ethernet architectures based on high-level programming models. The method is based on a programming model and modular code artifacts for the hardware architecture, employing Real-Time Ethernet communication. Through an tool-supported algorithm the high-level model is linked to the architecture's communication primitives and interfaces. The tool-support reduces significantly the development and debugging effort for Real-Time Ethernet applications and increases the application reliability, since the generated code is based on verified programming models. Additionally, the tool creates dedicated files, which allow automated industrial network configuration without any human intervention. Finally, by embedding firewall policies into the code generation process, the method guarantees cyber-resilience for the Real-Time Ethernet architecture. We demonstrate the proposed method in Programmable Logic Controllers (PLCs) of a Public Power Corporation's Hydroelectric Power Plant, which control the temperature and rotor speed of a power generator. The results demonstrate the method's ability to generate rapidly trustworthy and fault-tolerant code for the autonomous plant operation. The hurdles in time and effort for developing, configuring and debugging Real-Time Ethernet applications can be minimized through a high-level programming model that allows automated generation of executable code that is reusable for similar applications. Such time and effort reduction may pave the way towards the Industry 4.0 area.

Studies have shown that in many practical applications, data interpolation by splines leads to better approximation and higher computational efficiency as compared to data interpolation by a single polynomial. Data interpolation by splines can be significantly improved if knots are allowed to be free rather than at a priori fixed locations such as data points. In practical applications, the smallest possible curvature is often desired. Therefore, optimal splines are determined by minimizing a derivative of continuously differentiable functions comprising the spline of the required order. The problem of obtaining an optimal spline is tantamount to minimizing derivatives of a nonlinear differentiable function over a Banach space on a compact set. While the problem of data interpolation by quadratic splines has been accomplished analytically, interpolation by splines of higher orders or in higher dimensions is challenging. In this paper, to overcome difficulties associated with the complexity of the interpolation problem, the interval over which data points are defined, is discretized and continuous derivatives are substituted by their discrete counterparts. It is shown that as the mesh of the discretization approaches zero, a resulting near-optimal spline approaches an optimal spline. Splines with the desired accuracy can be obtained by choosing an appropriate mesh of the discretization. By using cubic splines as an example, numerical results demonstrate that the linear programming (LP) formulation, resulting from the discretization of the interpolation problem, can be solved by linear solvers with high computational efficiency and resulting splines provide a good approximation to the optimal splines.

This paper proposes a model based on gene expression programming for predicting discharge coefficient of triangular labyrinth weirs. The parameters influencing discharge coefficient prediction were first examined and presented as crest height ratio to the head over the crest of the weir (p/y), crest length of water to channel width (L/W), crest length of water to the head over the crest of the weir (L/y), Froude number (F=V/√(gy)) and vertex angle () dimensionless parameters. Different models were then presented using sensitivity analysis in order to examine each of the dimensionless parameters presented in this study. In addition, an equation was presented through the use of nonlinear regression (NLR) for the purpose of comparison with GEP. The results of the studies conducted by using different statistical indexes indicated that GEP is more capable than NLR. This is to the extent that GEP predicts the discharge coefficient with an average relative error of approximately 2.5% in such a manner that the predicted values have less than 5% relative error in the worst model.

This paper introduces an application of R programming language for geostatistical data processing with a case study of the Mariana Trench, Pacific Ocean. The formation of the Mariana Trench, the deepest among all hadal oceanic depth trenches, is caused by complex and diverse geomorphic factors affecting its development. Mariana Trench crosses four tectonic plates: Mariana, Caroline, Pacific and Philippine. The impact of the geographic location and geological factors on its geomorphology has been studied by methods of statistical analysis and data visualization using R libraries. The methodology includes following steps. Firstly, vector thematic data were processed in QGIS: tectonics, bathymetry, geomorphology and geology. Secondly, 25 cross-section profiles were drawn across the trench. The length of each profile is 1000-km. The attribute information has been derived from each profile and stored in a table containing coordinates, depths and thematic information. Finally, this table was processed by methods of the statistical analysis on R. The programming codes and graphical results are presented. The results include geospatial comparative analysis and estimated effects of the data distribution by tectonic plates: slope angle, igneous volcanic areas and depths. The innovativeness of this paper consists in a cross-disciplinary approach combining GIS, statistical analysis and R programming.

The algorithm described in this paper inherits the concepts of layered fusion, insertion, and set from four convex hull-based heuristic algorithms. It summarizes relevant definitions and theorems, proposes valuable research hypotheses, combines grouping and insertion, and innovatively introduces the practice of "grouped insertion."

In this paper, a distributed algorithm is proposed to solve a consensus convex optimization problem. It is a Jacobi-proximal alternating direction method of multipliers with a damping parameter $\gamma$ in the iteration of multiplier. Compared with existing algorithms, it has the following nice properties: (1) The restriction on proximal matrix is relaxed substantively, thus alleviating the weight of the proximal term. Therefore, the algorithm has a faster convergence speed. (2) The convergence analysis of the algorithm is established for any damping parameter $\gamma\in(0,2]$, which is larger ones in the literature. In addition, some numerical experiments and an application to a logistic regression problem are provided to validate the effectiveness and the characteristics of the proposed algorithm.

In this work, several inequalities of Popoviciu type for h-MN-convex functions are proved, where M and N are denote to Arithmetic, Geometric and Harmonic means and h is a non-negative superadditive or subadditive function.

The feasibility of recovering bioactive antioxidants from Phyllantus emblica leaves using ethanol -water mixture (0 – 100%) and heat-assisted extraction technology (HAE-T) was investigated in this present study. To this effect, the process parameter of operating temperature (OT: 30 -50 oC), solid -to-liquid ratio (S:L: 1:20 - 1:60 g/mL) and extraction time (ET: 45 - 180 min) were investigated on the extract total phenolic content (TPC, mg GAE/g d.w), yield (EY, %) and antioxidant activity (μM AAE/g d.w) by employing the Box-Behnken experimental design (BBD) available in response surface methodology (RSM). Multi-objective process optimization using the desirability function algorithm to determine set of process variables that simultaneously optimize process responses of TPC, EY and AA was also investigated. The recovery process was thereafter modeled with BBD-RSM and multi gene genetic programming (MGGP) algorithm and model reliability assessment via Monte Carlo simulation were conducted for the best performing set of models for predicting TPC, EY and AA values. The HPLC characterization of the recovered extract was carried out to ascertain the phenolic compound constituents of the Phyllantus emblica leaf extract. The 50% ethanol solution was found to be the best for the optimal extraction of antioxidants from Phyllantus emblica leaves. The HAE-T was suitable for recovering bioactive extract from Phyllantus emblica leaves and investigated process parameters have impacts on the recovery process. The process parameters that simultaneously gave the optimum EY of 21.6565%, TPC of 67.116 mg GAE/g and AA of 3.68583 µM AAE/g were OT of 41.61 oC, S:L of 1:60 g/mL and ET of 180 min. The HPLC extract profiling revealed that the bioactive constituents present in the recovered extract were betulinic acid, gallic acid, chlorogenic acid, caffeic acid, ellagic acid, and ferulic acid. Both the developed BBD-RSM and evolved MGGP-based models predicted the observed process response of TPC, EY and AA satisfactorily with BBD-RSM models marginally better in their predictions. The reliability results showed that the BBD-RSM models predicted TPC, EY and AA values with high certainty of 99.985%, 97.569% and 98.661%, respectively.

The connectivity level of last-generation vehicles is constantly on the rise. The combined use of Vehicle-To-Everything (V2X) connectivity and autonomous driving can provide remarkable benefits through the optimization of the route and speed trajectory. In this framework, this paper focuses on vehicle eco-driving optimization in a connected environment. The virtual test rig of a premium segment passenger car was used for generating the simulation scenarios. The benefits, in terms of energy and time savings, that the introduction of V2X communication, integrated with cloud computing, can have in a real-world scenario were assessed. The Reference Scenario is a pre-defined Real Driving Emissions (RDE) compliant route, while the simulation scenarios were generated by assuming two different penetration levels of V2X technologies. The associated energy minimization problem is formulated and solved by means of a global optimization algorithm, i.e., Dynamic Programming (DP). The optimization framework includes information coming from the surrounding environment, e.g., traffic lights state, speed limits, distance to travel, etc. The simulations show that introducing a smart infrastructure along with optimizing the vehicle speed in a real-world route can potentially reduce the required energy by 54% while shortening the travel time by 38%. Finally, a sensitivity analysis is performed on the bi-objective optimization cost function to find a set of Pareto optimal solutions, between energy and travel time minimization.

In this paper, we propose a method to find all efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector. The set of all efficient solutions of an IMOLP problem can completely supply information to the decision makers in finding their most preferred solutions but, up to now, not all efficient solutions of an IMOLP problem can be found by known methods. A numerical example is given to illustrate the working of the proposed method.

The study sought to investigate the effect of Multi-choice Goal programming in project Portfolio Analysis, using Lagos State Project Portfolio from between 2017-2021 as a study case. Specifically, the objectives examined the effectiveness of multi-choice goal programming in analyzing the project Portfolio of Lagos State Government and investigated the possible lapses in the use of Multi-choice Goal programming in analyzing the project Portfolio of Lagos State Government. Data were gathered from the State financial Statements and analyzed using Lingo-17 Software. Based on the analysis, the study discovered that the goals formulated can be optimally and minimally attained as the positive deviational and negative deviational variables depict zero. This indicates that the cost incurred on the project portfolio was absolutely minimized during the period and at the same time; Lagos State Government derived the most preferred benefits from it. The study therefore concluded that the State minimized the project costs and at the same time maximized benefits while meeting its overall objectives.

The Vehicle Routing Problem (VRP) and its variants are found in many fields, especially logistics. In this study, we introduced an adaptive method to a complex VRP. It combines multi-objective optimization and several forms of VRPs with practical requirements for an urban shipment system. The optimizer needs to consider terrain and traffic conditions. The proposed model also considers customers' expectations, shipper considerations as goals, and the common goal like transportation cost. We offered compromise programming to approach the multi-objective problem by decomposing the original multi-objective problem into a minimized distance-based problem. We designed a hybrid version of the Genetic algorithm with the Local Search algorithm to solve the proposed problem. We evaluate the effectiveness of the proposed algorithm with the Tabu Search algorithm, the original Genetic algorithm on the tested dataset. The results show that our method is an effective decision-making tool for the multi-objective VRP and an effective solver for the new variation of VRP.

We study the efficient computation of power indices for weighted voting games with precoalitions amongst subsets of players (reflecting, e.g., ideological proximity) using the paradigm of dynamic programming. Starting from the state-of-the-art algorithms for computing the Banzhaf and Shapley-Shubik indices for weighted voting games we present a framework for fast algorithms for the three most common power indices with precoalitions, i.e. the Owen index, the Banzhaf-Owen index and the Symmetric Coalitional Banzhaf index, and point out why our new algorithms are applicable for large numbers of players. We discuss implementations of our algorithms for the three power indices with precoalitions in C++ and review computing times as well as storage requirements.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (Cc) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, Cc was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e0). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate Cc such as Oedometer test. This study presents a novel prediction model for Cc of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate Cc based on LL, PL, and e0. The performance of developed GEP-based model was evaluated through coefficient of determination (R2), root mean squared error (RMSE), and mean average error (MAE). High R2 and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R2, RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining Cc of fine-grained soils.

Dislocation is one of the major challenges in unmanned aerial vehicle (UAV) image stitching. In this paper, we propose a new dynamic programming for seamlessly stitching UAV images using optical flow. Our solution consists of two steps: Firstly, an image-matching algorithm is used to correct the images so that they are in the same coordinate system. Secondly, a new dynamic programming algorithm is develop based on the concept of a stereo dual-channel energy accumulation using optical flow. A new energy aggregation and traversal strategy is adopted in our solution, which can find a more optimal seam line for adjacent image stitching. Our algorithm overcomes the theoretical limitation of the classical Duplaquet algorithm. Experiments show that the algorithm can effectively solve the dislocation problem in UAV image stitching. Beyond that, our solution is also direction-independent, which has more adaptability and robustness for UAV images.

In this paper we obtain some inequalities of Hermite-Hadamard type for composite convex functions. Applications for AG, AH-convex functions, GA, GG, GH-convex functions and HA, HG, HH-convex function are given. Applications for p, r-convex and LogExp functions are presented as well.

Model-based image reconstruction has brought improvements in terms of contrast and spatial resolution to imaging applications such as magnetic resonance imaging and emission computed tomography. However, their use for pulse-echo techniques like ultrasound imaging is limited by the fact that model-based algorithms assume a finite grid of possible locations of scatterers in a medium -- which does not reflect the continuous nature of real world objects and creates a problem known as off-grid deviation. To cope with this problem, we present a method of dictionary expansion and constrained reconstruction that approximates the continuous manifold of all possible scatterer locations within a region of interest. The expanded dictionary is created using a highly coherent sampling of the region of interest, followed by a rank reduction procedure based on a truncated singular value decomposition. We develop a greedy algorithm, based on the Orthogonal Matching Pursuit (OMP), that uses a correlation-based non-convex constraint set that allows for the division of the region of interest into cells of any size. To evaluate the performance of the method, we present results of 2-dimensional ultrasound image reconstructions with simulated data in a nondestructive testing application. Our method succeeds in the reconstructions of sparse images from noisy measurements, providing higher accuracy than previous approaches based on regular discrete models.

Experimental and epidemiological evidence has shown that modifications of the intrauterine environment can have deleterious consequences for individuals, expressed as an increased risk of suffering non-communicable pathologies in adult life, which is known as the hypothesis of the early origin of diseases or programming fetal. On the other hand, changes in gene expression patterns through epigenetic modifications can be the basis for long-term maintenance of the effects of fetal programming. In this sense, epigenetics comprises the study of intrauterine disturbances, which develop diseases in the adult, including Celiac Disease (CD). In addition, early feeding practices could influence the risk of CD development, such as breastfeeding timing and duration and age at gluten introduction in the diet. Gluten acts as a trigger for CD in genetically predisposed subjects, although approximately 30% of the world population has HLA DQ2 or DQ8, the prevalence of the disease is only 1-3%. It is not known what factors act to modify the risk of disease in genetically at risk subjects. Taking into account all these considerations, the aim of the current review is to elucidate the role of early programming and the effect of early nutrition on the development and progression of CD.

The fast pace development of the Internet and the Coronavirus Disease (COVID-19) pandemic have impacted considerably on the educative sector; encouraging the constant transformation of the teaching-learning strategies and more in technological areas as Educational Software Engineering. Web programming, a fundamental topic in Software Engineering and Cloud-based applications, deals with various critical challenges in education, such as learning continuous emerging technological tools, plagiarism detection, generating innovative learning environments, among others. Continual change and more with the current digitization becomes a challenge for teachers and students who cannot depend on traditional educational methods. The article presents a sustainable teaching-learning methodology for web programming courses in Engineering Education using a project-based integrated approach adaptable to the continuous web technological advances. The methodology has been developed and improved for 9 years, 15 groups, and 3 different universities. Our results demonstrate that the methodology is 100% adaptable with new technologies that might arise; it also presents the advantages of avoiding plagiarism in the best case and a personalized induction for every specific student in the learning process.

In this paper we deal with the resolution of a fuzzy multiobjective programming problem using the level sets optimization. We compare it to other optimization strategies studied until now and we propose an algorithm to identify possible Pareto efficient optimal solutions.

Efficient alternatives in energy production and consumption are constantly investigated by increasingly strict policies. In this way, the pollutant emissions that contribute to the greenhouse effect reduce and sustainability of the electricity sector increase. With more than a third of the world's energy consumption, buildings have great potential to contribute these sustainability goals. Additionally, with growing incentives in the Distributed Generation (DG) and Electric Vehicle (EV) industry, it is believed that Smart Buildings (SBs) can be a key in the field of residential energy sustainability in the future. In this work, an energy management system in SBs are developed to reduce the power demanded of a residential building. In order to balance the demand and power provided by the grid, microgrids such as Battery Energy Storage System (BESS), EVs and Photovoltaic Generation panels (PV) are used. Here, a Mixed Binary Linear Programming formulation (MBLP) is proposed to optimize the charge and discharge scheduling of EVs and also BESS. In order to show the efficiency of the model, a case study involving three scenarios and an economic analysis is considered. The results point a 65% reduction in peak load consumption supplied by grid and a 28.4% reduction in electricity consumption costs.

Appropriate estimation of soil settlement is of significant importance since it directly influences the performance of building and infrastructures that are built on soil. In particular, the settlement of fine-grained soils is critical because of low permeability and continuous settlement with time. Coefficient of consolidation (C_c) is a key parameter to estimate settlement of fine-grained soil layers. However, estimation of this parameter is time consuming, needs skilled technicians, and specific equipment. In this study, C_c was estimated using several soil parameters such as liquid limit (LL), plastic limit (PL), and initial void ratio (e₀). Estimating such parameters in laboratory is straight forward and needs substantially less time and cost compared to conventional tests to estimate C_c such as oedometer test. This study presents a novel prediction model for C_c of fine-grained soils using gene-expression programming (GEP). GEP is a biologically inspired technique capable of offering closed-form solution for the optimal solution. A database consisted of 108 different data points was used to develop the model. A closed-form equation solution was derived to estimate C_c based on LL, PL, and e₀. The performance of developed GEP-based model was evaluated through coefficient of determination (R²), root mean squared error (RMSE), and mean average error (MAE). High R² and low error values indicated the descent performance of the model. Furthermore, the model was evaluated using the additional performance measures and met all the suggested criteria. Furthermore, the model had a better performance in terms of R², RMSE, and MAE compared to most of existing models. It is expected that the developed model will decrease the time and cost associate with determining C_c of fine-grained soils.Keywords: evolutionary model, gene-expression programming (GEP), prediction, soil compression index, estimation, soil engineering, soil informatics, civil engineering, machine learning, data science, big data, soft computing, deep learning, forecasting, subject classification codes, construction informatics, computational intelligence (CI), artificial intelligence (AI), estimation

Electric vehicles can effectively make use of the time-of-use electricity price to reduce the charging cost, meanwhile using the grid power to preheat the battery before departure is particularly important for improving the vehicle mileage and reducing the use cost.In this paper, a dynamic programming algorithm is used to optimize the battery AC charging-preheating strategy to minimize the total cost of battery charging and preheating, with the charging current and battery preheating power consumption as the control variables. The cost difference between the optimized control strategy and the conventional preheating strategy was analyzed under different ambient temperatures (-20℃~ 0℃) and different target travel time (7:00 ~ 12:00). The simulation results show that the optimized control strategy makes the battery SOC and temperature reach the set value at the user's target departure time, and the total cost of the grid is the lowest. Compared with the conventional preheating strategy, the optimized control strategy can utilize the power grid energy in the valley price area, reduce the opening time of water heating PTC in the flat and the peak price zones, and the cost utilization rate can reach 18.41% ~ 73.96%, and the cost-saving effect is significant.

There is great potential for reducing greenhouse gas emissions (GHGE) from public sector meals. This paper aimed to develop a strategy for reducing GHGE in the Swedish school food supply without compromising nutritional adequacy, affordability, and cultural acceptability. Amounts, prices and GHGE-values for all foods and drinks supplied to three schools over one year were gathered. The amounts were optimized by linear programming. Four nutritionally adequate models were developed: Model 1 minimized GHGE while constraining relative deviation (RD) from observed food supply; Model 2 minimized total RD while imposing stepwise GHGE reductions; Model 3 additionally constrained RD for individual foods to an upper and lower limit; and Model 4 further controlled how ratios between food groups could deviate. Models 1 and 2 reduced GHGE by up to 95% but omitted entire food categories or increased the supply of some individual foods by more than 800% and were deemed unfeasible. Model 3 reduced GHGE by up to 60%, excluded no foods, avoided high RDs of individual foods, but resulted in large changes in food group ratios. Model 4 limited changes in food group ratios but resulted in a higher number of foods deviating from the observed supply and limited the potential of reducing GHGE. Cost was reduced in almost all solutions. An omnivorous, nutritionally adequate, and affordable school food supply, with considerably lower GHGE is achievable with moderate changes to the observed food supply. Trade-offs will always have to be made between achieving GHGE reductions and preserving similarity to the current supply.

In this paper we obtain some inequalities of Hermite-Hadamard type for composite convex functions. Applications for AG, AH-h-convex functions, GA, GG, GH-h-convex functions and HA, HG, HH-h-convex function are given.

In the article, by applied the concept of strongly convex function and one known identity, we establish several Ostrowski type inequalities involving conformable fractional integrals. As applications, some new error estimations for the midpoint formula are provided as well.

This paper offers an integrated approach for correlated storage assignment strategy (CSAS) to optimize travel distance by considering item correlation, picking frequency, zoning, and slot constraints to improve operational efficiency in distribution centers. We simplify the mixed integer non-linear programming (MINLP) model and incorporate integrated heuristic procedures for faster convergence. We introduce positive and negative centroid deviations as techniques to guide the model convergence and explore different scenarios. In the second stage of item assignment, we prioritize items within zones using a ranking formula that is optimal for both single-item and multiple-item orders. By analyzing the distribution of correlated item across zones and the impact of their picking frequency on optimizing travel distance, we propose an improved CSAS that minimize travel distance by strategically placing items based on their proximity to the depot. Our model reduces trips in distant zones by prioritizing larger average order sizes, while maximizing trips for frequently ordered smaller lists in closer zones. This method significantly reduces travel distance by minimizing the need for pickers in distant zones to frequently travel to the depot. Simulation results show reductions of up to 36.75% for fitted data and 33.59% for recent data.

Financial statements depict the condition of a company and need to be analyzed and evaluated to assess its performance. This research aims to analyze financial statements to describe the financial condition, measure business development over time, and evaluate the achievement of the com-pany's objectives. An optimization analysis of financial ratios is performed using the Weighted Goal Programming (WGP) model, which addresses multiple objectives by applying weights based on their priorities. The Analytical Hierarchy Process was used to determine the priority weights of deviation variables from each financial ratio target. Financial ratios were selected based on their impact on profit using factor analysis. The constructed WGP model aims to minimize deviations in Return on Assets, Operating Ratios, Operating Income Ratio, Total Assets Turnover, and Current Ratio. Computational calculations to solve the WGP model are per-formed using Python, with pseudocode provided. A case study on a company in the garment and textile sector was conducted and found that the Operating Ratio, Return on Assets, Operating Income Ratio, and Current Ratio still need improvement by developing strategies to achieve the targets. Sensitivity analysis was also employed to assess the resilience of the model in response to alterations in data.

In real-life scenario, there are many mathematical tools to handle the incomplete and imprecise data. One of them is the fuzzy approach. This article aims to contribute to the literature of fuzzy multi-objective dynamic programming issues involving the fuzzy objective functions. The piecewise quadratic fuzzy numbers characterize these fuzzy parameters. Some basic notions in the problem under the α-pareto optimal solution concept is redefined and analyzed to study the stability of the problem. Furthermore, a technique, named as enhancing decomposition approach, is presented for achieving a subset for the parametric space that contains the sameα-pareto optimal solution. For a better understanding and comprehension of the suggested concept, a numerical example is provided.

Accumulating evidences demonstrate that the host genome's epigenetic modificationsare essential for living organisms to adapt extreme conditions.DNA methylation, covalent modifications of histone, andinter-association of non-coding RNAs facilitate the cellular manifestation ofepigenetic changes in the genome. Out of various factors involved in the epigenetic programming of the host, miRNA (microRNA) and LncRNA (Long non-coding RNA) are new generationnon-coding molecules that influence a variety of cellular processes like immunity, cellular differentiation, and tumor development. During tumor development, temporal changes in miRNA/LncRNA rheostat influence sterile inflammatory responses accompanied by the changes in the carcinogenic signalling in the host. At the cellular level, this is manifested by the up-regulation of Inflammasome and inflammatory pathways, which promotes cancer-related inflammation. In view of this, we discuss the potential of lncRNA and miRNA directed interventions in regulating inflammation and tumor development in the host.

The paper proposes TOPSIS method for solving multi-objective multi-level programming problem (MO-MLPP) with fuzzy parameters via fuzzy goal programming (FGP). At first, - cut method is used to transform the fuzzily described MO-MLPP into deterministic MO-MLPP. Then, for specific , we construct the membership functions of distance functions from positive ideal solution (PIS) and negative ideal solution (NIS) of all level decision makers (DMs). Thereafter, FGP based multi-objective decision model is established for each level DM for obtaining individual optimal solution. A possible relaxation on decisions for all DMs is taken into account for satisfactory solution. Subsequently, two FGP models are developed and compromise optimal solutions are found by minimizing the sum of negative deviational variables. To recognize the better compromise optimal solution, the concept of distance functions is utilized. Finally, a novel algorithm for MO-MLPP involving fuzzy parameters is provided and an illustrative example is solved to verify the proposed procedure.

Learning programming is a complex and challenging task for many students. It in-volves both understanding theoretical concepts and acquiring practical skills. Hence, analyzing learners’ data from online learning environments alone fails to capture the full breadth of stu-dents’ actions if part of their learning process takes place elsewhere. Moreover, existing studies on learning analytics applied to programming education have mainly relied on frequency analysis to classify students according to their approach to programming or to predict academic achieve-ment. However, frequency analysis provides limited insights into the individual time-related characteristics of the learning process. The current study examines students’ strategies when learning programming, combining data from the learning management system and from an au-tomated assessment tool. To gain an in-depth understanding of students’ learning process as well as of the types of learners, we used learning analytics methods that account for the temporal order of learning actions. Our results show that students have special preferences for specific learning resources when learning programming, namely slides that support search, and copy and paste. We also found that videos are relatively less consumed by students, especially while working on programming assignments. Lastly, students resort to course forums to seek help only when they struggle.

The complexity of Mixed-Integer Linear Programs (MILPs) increases with the number of nodes in energy system models. An increasing complexity constitutes a high computational load that can limit the scale of the energy system model. Especially in microgrid optimisation problems with multiple buildings and energy systems with a number of rival supply, distribution and storage technologies, methods are sought to reduce this complexity. In this paper, we present a new 2-Level Approach to MILP energy system models that determine the system design through a combination of continuous and discrete decisions. On the first level, data reduction methods are used to determine the discrete design decisions in a simplified solution space. Those decisions are then fixed, and on the second level the full dataset is used to extract the exact scaling of the chosen technologies. The performance of the new 2-Level Approach is evaluated for a case study of an urban energy system with six buildings and an island system based on a high share of renewable energy technologies. The results of the studies show a high accuracy with respect to the total annual costs, chosen system structure, installed capacities and peak load with the 2-Level Approach compared to the results of a single level optimization. The computational load is thereby reduced by more than one order of magnitude, while a significantly higher accuracy is reached in comparison to the common time series aggregation approach.

In this paper we establish several Hermite-Hadamard type integral inequalities for trigonometrically rho-convex functions. Applications for special means are provided as well.

In this study, we introduce a new class of bi-univalent functions using q-Janowski Function. We derive the Fekete-Szegö functional problems for functions in this new subclass, as well as estimates for the Taylor-Maclaurin coefficients |α2| and |α3|. Furthermore, a collection of fresh outcomes are3 presented by customizing the parameters employed in our initial discoveries.

In this paper, we present a complete, flexible and safe convex-optimization-based method to solve speed planning problems over a fixed path for autonomous driving in both static and dynamic environments. Our contributions are five fold. First, we summarize the most common constraints raised in various autonomous driving scenarios as the requirements for speed planner developments and metrics to measure the capacity of existing speed planners roughly for autonomous driving. Second, we introduce a more general, flexible and complete speed planning mathematical model including all the summarized constraints compared to the state-of-the-art speed planners, which addresses limitations of existing methods and is able to provide smooth, safety-guaranteed, dynamic-feasible, and time-efficient speed profiles. Third, we emphasize comfort while guaranteeing fundamental motion safety without sacrificing the mobility of cars by treating the comfort box constraint as a semi-hard constraint in optimization via slack variables and penalty functions, which distinguishes our method from existing ones. Fourth, we demonstrate that our problem preserves convexity with the added constraints, thus global optimality of solutions is guaranteed. Fifth, we showcase how our formulation can be used in various autonomous driving scenarios by providing several challenging case studies in both static and dynamic environments. A range of numerical experiments and challenging realistic speed planning case studies have depicted that the proposed method outperforms existing speed planners for autonomous driving in terms of constraint type covered, optimality, safety, mobility and flexibility.

We have developed circular defects in 2-dimensional photonic crystal lasers that allow current injection for interconnected optical communications. However, when cleaving the sample to measure the output light, the output light intensity changes due to the cleaving position. In a previous study, we discovered through simulation that this effect could be eliminated and that a higher optical output might be obtained by applying a convex edge structure. In this paper, we develop the fabrication technology for this structure, fabricate samples, and measure the output light experimentally. Room-temperature continuous-wave laser oscillations using this structure are observed. The laser threshold is similar to well-lasing samples with normal cleavage edge faces. We are assured that these results contribute to future work such as accurate manufacturing and improving the end-face configuration to obtain higher outputs.

In Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. [J. Optim. Theory Appl. 2023, 196, 1036–1055.] and Yu et al. [Mathematics, 2023, 11, 2000] provided two deterministic global optimization algorithms having high computational complexity for this purpose. Since satisfactory estimations of covering functionals will be sufficient in Zong’s program, we propose a stochastic global optimization algorithm based on CUDA and provide an error estimation for the algorithm. The accuracy of our algorithm is tested by comparing numerical and exact values of covering functionals of convex bodies including the Euclidean unit disc, the three-dimensional Euclidean unit ball, the regular tetrahedron, and the regular octahedron. We also present estimations of covering functionals for the regular dodecahedron and the regular icosahedron.

In the framework of a multiplicative metric space. We have discuss some Properties of convex structures in pseudo multiplicative metric space and have applied these properties toiobtain alfixed point results in complete pseudo. It would be interesting to prove some further results in such metric spaces with completeness property.

In this work, we establish some new Hermite-Hadamard type inequalities for convex functions via conformable fractional integral. Moreover, we show that through the conformable fractional integral we can find some new Hermite-Hadamard type inequalities for convex functions via the classical integrals.

This article develops duality principles applicable to originally non-convex primal variational formulations. More specifically, as a first application, we establish a convex dual approximate variational formulation for a non-linear Kirchhoff-Love plate model. The results are obtained through basic tools of functional analysis, calculus of variations, duality and optimization theory in infinite dimensional spaces. We emphasize such a convex dual approximate formulation obtained may be applied to a large class of similar models in the calculus of variations. Finally, in the last section, we present a duality principle and respective convex dual formulation for a Ginzburg-Landau type equation.

In this study we introduce the new classes $\mathcal{M}_{\alpha}(\sin)$ and $\mathcal{M}_{\alpha}(\cos)$ of $\alpha$-convex functions associated with sine and cosine functions. Also, we obtain the initial coefficient bounds for the first five coefficients of the functions that belong to these classes. Further, we determine the upper bound of Zalcman functional for the class $\mathcal{M}_{\alpha}(\cos)$ for the case $n=3$, showing that the Zalcman conjecture holds for this value. Moreover, the problem of the Fekete-Szeg\H{o} functional estimate for these classes is studied.

Abstract—The static and fatigue analysis of plates with holes, made of 2D woven roving composites, is conducted. The parametrization of convex holes is proposed. Experimental results of specimens without holes and with different shapes of notches are discussed. The fatigue behaviour is considered with the use of the low cycle fatigue method. The analysis is supplemented by the numerical finite element modeling. The present work is an extension of the results discussed in the literature. The finite element modeling of plates with holes is presented in details in Ref [1-3] including also the problems of the accuracy. The experimental results and the form of specimens are shown in Ref [4]. Two parametrical description of static and fatigue behaviour of plates with holes characterizes the goal and the novelty of the paper. The fuzzy approach is employed to reduce the number of experimental data [5].

The Needleman-Wunsch process is a classic tool in bioinformatics, being a dynamic programming algorithm that performs a pairwise alignment of two input biological sequences, either protein or nucleic acid. A distance matrix between the tokens used in the sequences is also required as input. The distance matrix is used to generate a positional pairwise similarity matrix between the input sequences, which is in turn used to generate a dynamic programming matrix. The best path through the dynamic programming matrix is navigated using a traceback procedure that maximises similarity, inserting gaps as necessary. Needleman-Wunsch can align both nucleic acids or proteins, which use alphabets of size 4 and 20 tokens respectively. It can also be applied to any other kind of sequence where distance matrices can be specified. Here, we apply it to chains of Pousseur’s Scambi electronic music fragments, of which there are 32, and which Pousseur categorised by their sonic properties, thus permitting the consecutive construction of distance, similarity and dynamic programming matrices. Traceback through the dynamic programming matrix thus produces contrapuntal duet compositions in which two Scambi chains are played in the maximally euphonious manner, providing also an illustration of the principles of biological sequence alignment in sound.

Designing the future energy supply in accordance with ambitious climate change mitigation goals is a challenging issue. Common tools for planning and calculating future investments in renewable and sustainable technologies are often linear energy system models based on cost optimisation. However, input data and the underlying assumptions of future developments are subject to uncertainties that negatively affect the robustness of results. This paper introduces a quadratic programming approach to modifying linear, bottom-up energy system optimisation models in order to take cost uncertainties into account. This is accomplished by implementing specific investment costs as a function of the installed capacity of each technology. In contrast to established approaches like stochastic programming or Monte Carlo Simulation, the computation time of the quadratic programming approach is only slightly higher than that of linear programming. The model’s outcomes were found to show a wider range as well as a more robust allocation of the considered technologies than the linear model equivalent.

We describe how clinical researchers can exploit the Android cell phone as an economic platform for the gathering of data from clinical trial participants. The aim was to provide a solution with the shortest possible learning curve for researchers who are comfortable with setting up web pages. The additional requirement is that they extend their skills to the installation of a local webserver on the cell phone and then use four simple PHP templates to construct the clinical research data collection and processing forms. Data so collected is automatically written to local csv files on the cell phone. These csv phones can be retrieved from the device by the researcher simply by plugging the cell phone into their desktop PC and accessing the cell phone memory in just the same way as they would a USB memory stick. The results are presented as a list of recommended Android Apps along with settings that have proved to provide a stable combination likely to be easily used by clinical research participants. We have made a limited ‘user trial’ of this approach with satisfactory feedback received. We have concluded that this approach will reward researchers with a solution that is user friendly, will provide transcription free data and that is more than cost competitive with the conventional error prone/poor compliance ‘paper based participant form – researcher transcription’ cycle.

In the present research, we will develop some integral inequalities of Hermite Hadamard type for differentiable η-convex function. Moreover, our results include several new and known results as special cases.

The paper's main goal is to introduce a novel type of interpolative convex contraction and build up some fresh findings for it using the interpolative convex contractions' progressive approach. We have established certain conclusions using orbitally S-complete and Suzuki type contractions in F-metric spaces. My research aims to examine the fixed point method's efficacy in solving fractional differential equation with boundary conditions.

Maternal obesity and over/undernutrition can have a long-lasting impact on offspring health during critical periods in the first 1000 days of life. Children born to mothers with obesity have reduced immune responses to stimuli which increase susceptibility to infections. Recently, maternal western-style diets (WSD), high in fat and simple sugars, have been associated with skewing neonatal immune cell development, and recent evidence suggests that dysregulation of innate immunity in early life has long-term consequences on metabolic diseases and behavioral disorders in later life. Several factors contribute to abnormal innate immune tolerance or trained immunity, including changes in gut microbiota, metabolites, and epigenetic modifications. Critical knowledge gaps remain regarding the mechanisms whereby these factors impact fetal and postnatal immune cell development, especially in precursor stem cells in bone marrow and fetal liver. Components of the maternal microbiota that are transferred from mothers consuming a WSD to their offspring are understudied and identifying cause and effect on neonatal innate and adaptive immune development needs to be refined. Tools including single-cell RNA-sequencing, epigenetic analysis, and spatial location of specific immune cells in liver and bone marrow are critical for understanding immune system programming. Considering the vital role of immune function plays in offspring health, it will be important to understand how maternal diets can control developmental programming of innate and adaptive immunity.

This study's main target was to analyze and design rectangular edges supported two ways solid slabs by using ES EN 1992-1-1:2015. Slab design is often carried out either manually or with the use of design and analytic software. The researcher sees that some software cannot accept some countries' standard codes. For example, currently in Ethiopia analysis and design of two-way solid slab is done using readily available Excel sheet template. But working with this might have many problems, firstly the structure that is already analyzed by SAP or SAFE or any other international software application that uses international codes but which cannot design structure using ES EN 1992; for instant euro codes and designed by excel sheet can create failure and uneconomical analysis and design result. In this paper, the slab is designed and analyzed based on the chosen concrete grade, chosen reinforcement bar diameter, chosen steel grade for design and analysis of slabs calculations like load, moment, shear, and deflection checking using the moment coefficient method for analysis and design and Microsoft Visual Basic 2010 for coding. All input values are given by the International Standard units and are also used to represent output values. Using manual calculations delays time and mostly the result is not correct. But using this Computer program can increase computation accuracy and save time. The procedure the researcher followed is, first the manual calculation has been done and then SADSE2021 has been done. The result is that both are 99.9% identical, and the disadvantage of this method is that it cannot be used to determine the detailed drawing.

Scheduling and optimization have a central place in the research area of computing because it is increasingly important to achieve fully automated production processes to adjust manufacturing systems to the requirements of Industry 4.0. In this paper, we demonstrate how an automated wet-etch scheduling problem for a semiconductor industry can be solved by constraint answer set programming (CASP) and, its solver called clingcon. The considered scheduling problem includes a robot for lot transfers between the baths. CASP is a hybrid approach in automated reasoning that combines different research areas such as answer set programming, Constraint Processing and Satisfiability Modulo Theories. For a long time, exact methods such as constraint programming have displayed difficulties in solving real large-scale problem instances. Currently, the performance of state-of-the-art constrains solvers is comparatively better than a decade ago, and some complex combinatorial problems can be optimally solved. These theoretical and technical achievements open new horizons for declarative programming applications such as logistics. A successful solution to this problem is achieved and we found that in most cases tested, CASP is faster and obtains in most cases similar makespan values than solutions based on mixed integer linear programming and constraint paradigms.

In this paper, a new full-Newton step feasible interior point method for convex quadratic programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative variable weight vector and use the algebraic equivalent transformation for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is obtained. Finally, some numerical results are presented to demonstrate the practical performance of the proposed algorithm.

Integrating large-scale wind energy in modern power systems is demanding more efficient mathematical models to properly address classical assumptions in power system problems. In particular, there are two main assumptions in power system problems with wind integration that have not been adequately studied yet; First, non-linear AC power flow equations have been linearized in most of the literature. Such simplifications can lead to inaccurate power flow calculations that may result in other technical issues. Second, wind power uncertainties are inevitable and have been mostly modelled using the traditional uncertainty modelling approaches, that may not be suitable for large-scale wind power integration. In this paper, we address both challenges: we present a tight second-order conic relaxation (SOCR) for optimal power flow (OPF) problem, and simultaneously, implement the new effective budget of uncertainty approach for uncertainty modelling that determines the maximum wind power admissibility first and then addresses the uncertainty in the model. To the best of our knowledge, this is the first study that proposes an effective robust second-order conic programming (ERSOCP) model that simultaneously addresses the issues of power flow linearization and wind power uncertainty with the new paradigm on the budget of uncertainty approach. Our numerical results show the merit of the proposed model against traditional linearized power flow equations as well as traditional uncertainty modelling approaches.

This article develops duality principles and numerical results for a large class of non-convex variational models. The main results are based on fundamental tools of convex analysis, duality theory and calculus of variations. More specifically the approach is established for a class of non-convex functionals similar as those found in some models in phase transition. Finally, in some sections we present concerning numerical examples and the respective softwares.

Optimal planning and design of microgrids is a priority for electrification of off-grid areas. Indeed, according to one of the Sustainable Development Goals (SDG) 7, the UN recommends universal access to electricity for all but, at the lowest cost. To achieve this goal, several optimization methods with different strategies have been proposed in the literature. This paper proposes a microgrid installation and planning model based on a combination of several techniques. Python 3.10, the programming language, has been used in conjunction with machine learning techniques such as unsupervised learning based on K-means clustering and deterministic optimization methods based on mixed linear programming. These methods were complemented by the open-source spatial method for optimal electrification planning: onsset. The results obtained enabled us to simulate the model obtained, with a cluster considered as a case study, based on the elbow and k-means clustering method; then, in a second phase, to size the microgrid with a capacity of 40 kW, by optimizing all the resources available on the site: the example of the various resources in the case of Togo was considered (solar, wind, hydropower). This study therefore highlighted the optimal resources obtained by integrating battery systems by the optimization model formulated on the basis of the various technology costs, such as investment, maintenance and operating costs, based on the technical limits of the various technologies. For the optimum results obtained, solar systems account for 80% of the maximum load considered, compared with 7.5% for wind systems and 12.5% for battery systems. Next, an optimal microgrid connection model was proposed, based on the constraints of a voltage stability limit estimated at 10% of the maximum voltage drop. The substation capacity limit was also taken into account. The results obtained from the case studied enabled us again, to present selective results for load nodes in relation to the substation node. And finally, the spatial technology planning tool made it possible to obtain results on the different strategies for the various technologies required for the electrification planning study of the Togo case. The various results obtained from the different techniques provide the leads needed for a feasibility study for optimal electrification of off-grid areas, using microgrid systems.

A new generation of nano-technologies is expanding solid propulsion capabilities and increasing their relevance for versatile and manoeuvrable micro-satellites with safe high-performance propulsion. We propose the innovative concept, connected with application of new synergistic effect of the energetic materials performance enhancement and reaction zones programming for the next generation small satellite multimode solid propulsion system. The main idea of suggested concept is manipulating by the self-organized wave patterns excitation phenomenon, by the properties of the energetic materials reaction zones and by localization of the energy release areas. This synergistic effect can be provided through application of the functionalized carbon-based nanostructured metamaterials as a nano-additives along with simultaneous manipulating by their properties through the electrostatic field. Mentioned effect will be controlled through predictive programming both by the spatial structure and physics-chemical properties of the functionalized carbon-based nano-additives and through the electromagnetic control of the self-organized wave pattern excitation and micro- and nano- scale oscillatory networks in the energetic material reaction zones. Suggested new concept makes it possible to increase the energetic material regression rate and increase the thrust of the solid propulsion system with minimal additional energy consumption.

Positive invariant set is an important concept of dynamic systems. The purpose of this paper is to study the sufficient and necessary conditions that the set of ellipsoids and the Lorenz cone are positive invariant sets of discrete time systems. By means of nonlinear programming and induced norm, the problem of positive invariance is formulated as an optimization problem, and the equivalent dual form optimization is also presented using the dual optimization method. Our results provide more alternative methods for determining the positive invariance of quadratic form convex sets from the point of view of optimization and dual optimization. The effectiveness of this method is demonstrated by numerical examples.

In the present research, we will develop some integral inequalities of Hermite Hadamard type for differentiable η- convex function. Moreover, our results include several new and known results as special cases.