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.

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.

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.

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 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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Let a,b,c be positive integers such that a²+b²=c², 2|b,gcd(a,b)=1. In 1956, Jesmanowicz conjectured that for any positive integer w, the only solution of (aw)^x+(bw)^y=(cw)^z in positive integers is (x, y, z) = (2, 2, 2). In this paper, based on Gaussian integer ring, we show that Je$\acute{s}$manowicz' conjecture is true for any positive integer

The conformity assessment of products or a measured value with the given standards is carried out based on the global risk of producers and consumers calculation. A product may conform to specifications but be falsely rejected as non-conforming. This is about the producer's risk. If a product doesn't meet the requirements but is falsely accepted as conforming, that poses a risk to the consumer. The conventional approach to risk assessment, which yields only a single numerical value for the global risk of producers and consumers, is naturally extended, and utilized for assessing risk in measurement models with linear regression. The outcomes of the two-dimensional extension, along a moderate scale, are the parabolas with an opening upwards. Risk surfaces were obtained through three-dimensional extension over the area limited by the moderate scale and guard band axes. Four models with different ranges of tolerance intervals were used to test this innovative method of risk assessment in linear regression. The corresponding standard measurement uncertainties are determined by applying a simplified measurement model with the use of comprehensive data on the measurement performance and by determining measurement uncertainty derived from consideration of the functional relationship obtained by linear regression analysis. Models that utilize information from linear regression analysis to determine measurement uncertainty are biased towards risks at the edges of the moderate scale. Testing the model's performances with metrics related to the confusion matrix, such as the F1 score, further substantiated this assertion. The diagnostic odds ratio has been proven to be extremely effective in identifying the curve along the guard band axis, along which the global risks of producers and consumers are at their lowest.

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.

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.

The quality of dietary patterns can be optimized using a mathematical technique known as linear programming (LP). LP methods have rarely been applied to individual meals. The present LP models optimized the breakfast meal for those participants in the nationally representative National Health and Nutrition Examination Survey 2011-2014 who ate breakfast (n=11,565). The Nutrient Rich Food Index (NRF9.3) was a measure of diet quality. Breakfasts in the bottom tertile of NRF9.3 scores (T1) were LP-modeled to meet nutrient requirements without deviating too much from current eating habits. Separate LP models were run for children and for adults. The LP-modeled breakfasts resembled the existing ones in the top tertile of NRF9.3 scores (T3), but were more nutrient-rich. Favoring fruit, cereals, and dairy, the LP-modeled breakfasts had less meat, added sugars and fats but more whole fruit and 100% juices, more whole grains, and more milk and yogurt. LP modeling methods can build on existing dietary patterns to construct food-based dietary guidelines and identify individual meals and/or snacks that need improvement.

In this paper, we compare the performance between systems of ordinary and (Caputo) fractional differential equations depicting the susceptible-exposed-infectious-recovered (SEIR) models of diseases. In order to understand the origins of both approaches as mean-field approximations of integer and fractional stochastic processes, we introduce the fractional differential equations as approximations of some type of fractional nonlinear birth--death processes. Then, we examine validity of the two approaches against empirical courses of epidemics; we fit both of them to case counts of three measles epidemics that occurred during the pre-vaccination era in three different locations. While FDEs appear more flexible in fitting empirical data, our ODEs offered better fits to two out of three data sets. Important differences in transient dynamics between these modeling approaches are discussed.

During few last years, climate change including global warming which is attributed to human activities and also its long-term adverse effects on the planet’s functions have been identified as the most challenging discussion topics which have arisen many concerns and efforts to find the possible solutions. Since the warmth arising from Earth’s landscapes affects the world’s weather and climate patterns, we decided to study the changes in the Land Surface Temperature (LST) patterns in different seasons through non-linear methods. Here, we particularly want to estimate the non-integer dimension and fractal structure of the land surface temperature. For this study, the (LST) data has been obtained during the daytime by the Moderate Resolution Imaging Spectroradiometer (MODIS) on NASA’s Terra satellite. Depending on what time of the year data has been collected, temperatures change in different ranges. Since equatorial regions remain warm, and Antarctica and Greenland remain cold, and also because altitude affects temperature, we selected Riley County in the U.S. state of Kansas, which does not belong to any of this type locations and we are interested to observe the seasonal changes in temperature in this county. The results of the present study show that the Land Surface Temperature (LST) belongs to the class of fractal process with non-integer dimension.

In the paper, by the Faά di Bruno formula, several identities for the Bell polynomials of the second kind, and an inversion theorem, the authors simplify coefficients of two families of nonlinear ordinary differential equations for the generating function of the Catalan numbers and discover inverses of fifteen closely related lower triangular integer matrices.

This paper presents a two-stage ADC based on pseudo-differential operational transconductance amplifier (OTA), which is designed for the readout circuit of X-ray linear array sensor. This hybrid ADC employs an incremental sigma-delta ADC and a cyclic ADC, achieving a good trade-off between accuracy and conversion speed. The two stages share the same hardware to reduce power consumption and die area. A common-mood feedback module is used to suppress the influence of charge injection, and the effectiveness is demonstrated by detailed theoretical analysis. A test chip of 14-bit ADC is fabricated in 0.35μm CMOS technology. The measured root mean square (RMS) value of DNL is 0.254 LSB, and the maximum value of INL is -0.776/+1.56 LSB. The measured effective number of bits (ENOB) is 13.43 bits.

There are many uncertainties and risks in residential electricity consumption during the economic development. Knowledge of the relationship between residential electricity consumption and its key determinant—income—are important to the sustainable development of electric power industry. Using panel data from 30 provinces for the 1995-2012 period, this study investigates how residential electricity consumption changes as incomes increase in China. Previous studies typically used linear or quadratic double-logarithmic models imposing ex ante restrictions on the indistinct relationship between residential electricity consumption and income. Contrary to those models, we employed a reduced piecewise linear model that is self-adaptive and highly flexible and circumvents the problem of “prior restrictions.” Robust tests of different segment specifications and regression methods are performed to ensure the conservatism of the research. The results provide strong evidence that the income elasticity was approximately one, and it remained stable throughout the estimation period. The income threshold at which residential electricity consumption automatically remains stable or slows has not been reached. To ensure the sustainable development of the electric power industry, introducing higher energy efficiency standards for electrical appliances and improving income levels are vital. And government should emphasize electricity conservation in industrial sector rather than in residential sector.

Prime period sequences can serve as the fundamental tool to construct arbitrary composite period sequences. This is a review study of prime period perfect Gaussian integer sequence (PGIS). When cyclic group {1,2,…,N−1} can be partitioned into k cosets, where N=kf+1 is an odd prime number, the construction of a degree-(k+1) PGIS can be derived from either matching the flat magnitude spectrum criterion or making the sequence with ideal periodic autocorrelation function (PACF). This is a systematic approach of prime period N=kf+1 PGIS construction, and is applied to construct PGISs with degrees 1, 2, 3 and 5. However, for degrees larger than 3, matching either the flat magnitude spectrum or achieving the ideal PACF encounters a great challenge of solving a system of nonlinear constraint equations. To deal with this problem, the correlation and convolution operations can be applied upon PGIS of lower degrees to generate new PGIS with degree-4 and other higher degrees, e.g., 6, 7, 10, 11, 12, 14, 20 and 21 in this paper. In this convolution based scheme, both degree and pattern of a PGIS vary and can be indeterminant, which is rather nonsystematic compared with the systematic approach. The combination of systematic and nonsystematic schemes contributes the great efficiency for constructing abundant PGISs with various degrees and patterns for the associated applications.

We talk about random when it is not possible to determine a pattern on the observed outcomes. A computer follows a sequence of fixed instructions to give any of its output, hence the difficulty of choosing numbers randomly from algorithmic approaches. However, some algorithms based on mathematical formulas like the Linear Congruential algorithm and the Lagged Fibonacci generator appear to produce "true" random sequences to anyone who does not know the secret initial input [1]. Up to now, we cannot rigorously answer the question on the randomness of prime numbers [2, page 1] and this highlights a connection between random number generator and the distribution of primes. From [3] and [4] one sees that it is quite naive to expect good random reproduction with prime numbers. We are, however, interested in the properties underlying the distribution of prime numbers, which emerge as sufficient or insufficient arguments to conclude a proof by contradiction which tends to show that prime numbers are not randomly distributed. To achieve this end, we use prime gap sequence variation. The algorithm that we produce makes possible to deduce, in the case of a binary choice, a uniform behavior in the individual consecutive occurrence of primes, and no uniformity trait when the occurrences are taken collectively.

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.

We suppose that a Cooper pair (CP) will experience a damping force exerted by the condensed matter. A Langevin equation of a CP in two dimensional condensed matter is established. Following a method similar to Nelson's stochastic mechanics, generalized Schr\"{o}dinger equation of a CP in condensed matter is derived. If the CPs move with a constant velocity, then the corresponding direct current (DC) electrical conductivity can be calculated. Therefore, a Drude like formula of resistivity of CPs is derived. We suppose that the damping coefficient of CPs in two dimensional cuprate superconductors is a linear function of temperature. Then the resistivity and scattering rate of CPs turn out to be also linear-in-temperature. The origin of linear-in-temperature resistivity and Planckian dissipation in cuprate superconductors may be the linear temperature dependence of the damping coefficient of CPs.

In this paper, we compile the fractional power series method and the Laplace transform to design a new algorithm for solving the fractional Volterra integro-differential equation. For that, we assume the Laplace power series (LPS) solution in terms of power q=1m,m∈Z+, where the fractional derivative of order α=qγ for which γ∈Z+. This assumption will help us to write the integral, the kernel, and the nonhomogeneous terms as a LPS with the same power. The recurrence relations for finding the series coefficients can be constructed using this form. To demonstrate the algorithm's accuracy, the residual error is defined and calculated for several values of the fractional derivative. Two strongly nonlinear examples are discussed to provide the efficiency of the algorithm. The algorithm gains powerful results for this kind of problem. Under Caputo meaning the obtained results are illustrated numerically, and graphically. Geometrically, the behavior of the solution declares that the changing of the fractional derivative parameter values' in their domain alters the style of the attained solution in a symmetrical meaning and fully coinciding to the ordinary derivative value'. From these simulations, the results report that the recommended novel algorithm is a straightforward, accurate, and superb tool to generate analytic-approximate solutions for Integral, and integro-differental equations of fractional order.

Abstract The modified Bessel function (MBF) of the first kind is a fundamental special function in mathematics with applications in a large number of areas. When the order of this function is integer, it has an integral representation which includes the exponential of the cosine function. Here we generalize this MBF to include a fractional parameter, such that the exponential in the previously mentioned integral is replaced by a Mittag-Leffler function. The necessity for this generalization arises from a problem of communication in networks. We find the power series representation of the fractional MBF of the first kind, as well as some differential properties. We give some examples of its utility in graph/networks analysis and mention some fundamental open problems for further investigation.

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.

Fresnel incoherent correlation holography (FINCH) is a well-established incoherent imaging technique. In FINCH, three self-interference holograms are recorded with calculated phase differences between the two interfering, differently modulated object waves and projected into a complex hologram. The object is reconstructed without the twin image and bias terms by a numerical Fresnel back propagation of the complex hologram. A modified approach to implement FINCH by a single camera shot by pre-calibrating the system involving recording of the point spread function library and reconstruction by a non-linear cross-correlation has been introduced recently. The expression of the imaging characteristics from the modulation functions in original FINCH and the modified approach by pre-calibration in spatial and polarization multiplexing schemes are reviewed. The study reveals that a reconstructing function completely independent of the function of the phase mask is required for the faithful expression of the characteristics of the modulating function in the image reconstruction. In polarization multiplexing method by cross-correlation, a partial expression was observed, while in spatial multiplexing method by cross-correlation, the imaging characteristics converged towards a uniform behavior.

For a nonzero normed linear space X‎, ‎we will define some different classes of fuzzy norms on X generated by linear and bounded linear functionals‎. ‎Also separate continuity of the elements of each class are investigated‎. ‎The aim of this research is to introduce a source of examples and counterexamples in the field of fuzzy normed spaces‎.

Observed ENSO statistics exhibits a non-gaussian behavior, which is indicative of the presence of nonlinear processes. In this paper we use the Recharge Oscillator model (ROM), a largely used Low-Order Model (LOM) of ENSO, as well as methodologies borrowed from the field of statistical mechanics to identify which aspects of the system may give rise to nonlinearities that are consistent with the observed ENSO statistics. In particular, we are interested in understanding whether the nonlinearities reside in the system dynamics or in the fast atmospheric forcing. Our results indicate that one important dynamical nonlinearity often introduced in the ROM cannot justify a non-gaussian system behavior, while the nonlinearity in the atmospheric forcing can instead produce a statistics similar to the observed. The implications of the non-Gaussian character of ENSO statistics for the frequency of extreme El Nino events is then examined.

In this paper, using the two integers that describe the stationary 2-dimensional wave and the charge quantization along with the balance between the Lorentz force and electrical force, we succeed in deriving the fractional quantum Hall effect and the integer quantum Hall effect; we find that the latter exists as a special case of the former. Moreover, using the derived expression describing the fractional quantum Hall effect, a relationship between the plateau in the resistivity of the sample and the applied magnetic field is obtained. The findings of this model agree well with experimental measurements. Because the two integers that describe the stationary 2-dimensional wave and the charge quantization along with the force balance have concrete physical meanings in this work, we could provide a clear picture of the origin of both the integer quantum Hall effect and the fractional quantum Hall effect.

Linear-width is a well-regarded width parameter in graph theory. The constructs of linear loose tangle and linear tangle present obstacles to attaining linear-width. In this succinct paper, our primary focus will be the exploration of maximal linear loose tangles.

Crop production is a major livelihood activity of smallholders in Ethiopia. However, it is often characterized by low performance. In an effort to improve crop production, a series of agricultural extension programs have been running in Ethiopia since the 1950s. Nevertheless, the performance of agriculture is still low. In this study, it is argued that the limited attention given to cropland allocation methodologies is one of the major causes of low performance of crop production and increased environmental degradation. This study used linear programming to examine the role and impacts of cropland allocation methods on performance of crop production. The data for this study was drawn from household survey of 75 randomly selected households combined with focus-grouped discussion, key informant interview, and secondary data. In the current conventional cropland allocation, households were not able to meet their household consumption. The average profitability of farms under current practice was found significantly below than estimated optimal level of profit that could be realized using linear programming. In addition, it uncovered that low performance of crop production (in terms of meeting household consumption demand and profitability) is the primary cause that limited the effort of households to participate in environmental and natural resource management. This study suggests the use of linear programming-based cropland allocation to enhance the profit performance of smallholder crop production, meeting household consumption requirement, and thereby promote sustainable utilization of natural and environmental resources.

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.

This study focuses on one of the most famous open problems in mathematics, namely the Collatz conjecture. The Collatz conjecture or 3x + 1 Problem is perhaps today's most enigmatic unsolved mathematical problem. It is named after Lothar Collatz, who rst proposed it in 1937. It may be stated as as follow: Take any positive integer n. If n is even then divide it by 2, else do \triple plus one" and get 3n + 1. The conjecture is that this process will eventually reach the number 1, regardless of which positive integer is chosen initially. In this paper, we present a simple proof for the Collatz conjecture.

This paper investigates the problem of a relativistic Dirac half-integer spin free particle tunneling through a rectangular quantum-mechanical barrier. If the energy difference between the barrier and the particle is positive, and the barrier width is large enough, there is proof that the tunneling may be superluminal. For first spinor components of particle and antiparticle states, the tunneling is always superluminal regardless the barrier width. Conversely, the second spinor components of particle and antiparticle states may be either subluminal or superluminal depending on the barrier width. These results derive from studying the tunneling time in terms of phase time. For the first spinor components of particle and antiparticle states, it is always negative while for the second spinor components of particle and antiparticle states, it is always positive, whatever the height and width of the barrier. In total, the tunneling time always remains positive for particle states while it becomes negative for antiparticle ones. Furthermore, the phase time tends to zero, increasing the potential barrier both for particle and antiparticle states. This agrees with the interpretation of quantum tunneling that the Heisenberg uncertainty principle provides. This study’s results are innovative with respect to those available in the literature. Moreover, they show that the superluminal behaviour of particles occurs in those processes with high-energy confinement.

As known all physical properties of solids are described well by the system of quantum linear harmonic oscillators. It is shown in the present paper that the system consisting of classical linear harmonic oscillators having temperature dependent masses or (and) frequencies has the same partition function as the system consisting of quantum linear harmonic oscillators having temperature independent masses and frequencies while the means of the square displacements of the positions of the oscillators from their mean positions for the system consisting of classical linear harmonic oscillators having: the temperature dependent masses; temperature dependent frequencies; and temperature dependent masses and frequencies differ from each other and from that of the system consisting of quantum linear harmonic oscillators, and hence, the system consisting of classical linear harmonic oscillators describes well the thermodynamic properties of the system consisting of quantum linear harmonic oscillators and solids.

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.

Successive-addition-of-digits-of-a-number(SADN) refers to the process of adding up the digits of an integer number until a single digit is obtained. Concept of SADN has been occasionally identified but seldom employed in extensive mathematical applications. This paper discusses SADN and its properties in terms of addition, subtraction and multiplication. Further, the paper applies the multiplication-property of SADN to understand the distribution of prime numbers. For this purpose the paper introduces three series of numbers -S1, S3 and S5 series- into which all odd numbers can be placed, depending on their SADN and the rationale of such classification. Extending the analysis the paper explains how composite numbers of the S1 and S5 series can be derived. Based on this discussion it concludes that even as the concept of SADN is rather simple in its formulation and appears as an obvious truism but a profound analysis of the properties of SADN in terms of fundamental mathematical functions reveals that SADN holds a noteworthy position in number theory and may have significant implications for unfolding complex mathematical questions like understanding the distribution of prime numbers and Goldbach-problem.

The study examines n-balls, regular n-simplices, and n-orthoplices in real dimensions using novel recurrence relations that removed indefiniteness present in known formulas. They show that in the negative, integer dimensions volumes of n-balls are zero if n is even, positive if n = -4k - 1, and negative if n = -4k - 3, for natural k. Volumes and surfaces of n-cubes inscribed in n-balls in negative dimensions are complex, wherein for negative, integer dimensions they are associated with integral powers of the imaginary unit. The relations are continuous for n Î ℝ and show that the constant of π is absent for 0 ≤ n < 2. For n < -1 self-dual n-simplices are undefined in the negative, integer dimensions, and their volumes and surfaces are imaginary in the negative, fractional ones, and divergent with decreasing n. In negative, integer dimensions n-orthoplices reduce to the empty set, and their real volumes and imaginary surfaces are divergent in negative, fractional ones with decreasing n. Out of three regular, convex polytopes present in all natural dimensions, only n-orthoplices, n-cubes (and n-balls) are defined in the negative, integer dimensions.

A family of linear singularly perturbed Cauchy problems is studied. The equations defining the problem combine both partial differential operators together with the action of linear fractional transforms. The exotic geometry of the problem in the Borel plane, involving both sectorial regions and strip-like sets, gives rise to asymptotic results relating the analytic solution and the formal one through Gevrey asymptotic expansions. The main results lean on the appearance of domains in the complex plane which remain intimately related to Lambert W function, which turns out to be crucial in the construction of the analytic solutions. On the way, an accurate description of the deformation of the integration paths defining the analytic solutions and the knowledge of Lambert W function are needed in order to provide the asymptotic behavior of the solution near the origin, regarding the perturbation parameter. Such deformation varies depending on the analytic solution considered, which lies in two families with different geometric features.

Harnessing Quantum Energy States for Unprecedented Computing Capabilities In this proposal, we advocate for the use of energy states as fundamental units of quantum computer programming. Each unit of programming is conceptualized as an energy state, manifested as an essence-unit. An essence-unit, defined as the minimal form encapsulating complete uniqueness or specificity, serves as the cornerstone of this paradigm. This approach enables the recording of various forms of matter on quantum computers in essence-units, portraying their energy states. The recording of energy states is achieved through the creation of four distinct coherent potentials, facilitated by quantum dots or crystals. Crucially, these energy states embodied in essence-units resist subdivision. The study explores the intricate relationship among similarity, fractals, and uniqueness in quantum dot operations, revealing their profound implications for information transfer efficiency. Normalized entropy characterizes charge localized in quantum dot impurities in systems that have distortions. Through the utilization of N-level recording and entropy-fractal dimension equivalence, the paper elucidates the potential of quantum dots in reducing transmission time and modeling complex systems. The proposed methodology signifies a paradigm shift in quantum computing, presenting unparalleled possibilities for tackling hitherto insurmountable challenges.

This work intends to present a study on relations between a Lie algebra called dispersion operators algebra, linear canonical transformation and a phase space representation of quantum mechanics that we have introduced and studied in previous works. The paper begins with a brief recall of our previous works followed by the description of the dispersion operators algebra which is performed in the framework of the phase space representation. Then, linear canonical transformations are introduced and linked with this algebra. A multidimensional generalization of the obtained results is given.

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 the paper, the authors present an explicit form for a family of inhomogeneous linear ordinary differential equations, find a more significant expression for all derivatives of a function related to the solution to the family of inhomogeneous linear ordinary differential equations in terms of the Lerch transcendent, establish an explicit formula for computing all derivatives of the solution to the family of inhomogeneous linear ordinary differential equations, acquire the absolute monotonicity, complete monotonicity, the Bernstein function property of several functions related to the solution to the family of inhomogeneous linear ordinary differential equations, discover a diagonal recurrence relation of the Stirling numbers of the first kind, and derive an inequality for bounding the logarithmic function.

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.

Quantum computing has attracted significant interest in the optimization community because it potentially can solve classes of optimization problems faster than conventional supercomputers. Several researchers proposed quantum computing methods, especially Quantum Interior Point Methods (QIPMs), to solve convex optimization problems, such as Linear Optimization, Semidefinite Optimization, and Second-order Cone Optimization problems. Most of them have applied a Quantum Linear System Algorithm at each iteration to compute a Newton step. However, using quantum linear solvers in QIPMs comes with many challenges, such as having ill-conditioned systems and the considerable error of quantum solvers. This paper investigates how one can efficiently use quantum linear solvers in QIPMs. Accordingly, an Inexact Infeasible Quantum Interior Point Method is developed to solve linear optimization problems. We also discuss how we can get an exact solution by Iterative Refinement without excessive time of quantum solvers. Finally, computational results with a QISKIT implementation of our QIPM using quantum simulators are analyzed.

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.

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.

Byers Peninsula (62°34’-62°40’S-60°54’61°13’W), 60 km2 in size, is considered one of the largest ice-free areas in Antarctica. Since 2006, the Spanish Polar Program has taken part in a large number of environmental studies involving effects of climate changes, limnology and microbiology, live cycles, but not albedo. Surface albedo is one of the key physical parameters in the surface energy budget of polar regions. Most of Antarctica is covered by ice sheets; only about 0.44% of the area is permanently ice-free. However, in maritime Antarctica, the ice-free areas, corresponding to small islands, peninsulas, and coastal beaches, account for about 3% of the territory. To incorporate the contribution of these areas into global albedo models, it is necessary to relate the soil properties of the ice-free areas to the surface albedo response. Also, mapping soil properties and albedo have and special interest in these ice-free areas. Image classification using machine learning methods trained with georeferenced soil data could be useful for mapping soil properties and albedo in multispectral optical satellite images. A shallow neural network implemented using the Keras Python module was used to define and train models of soil properties using 15 explanatory variables corresponding to bands and spectral indices of a Sentinel image and a population of 49 soil samples taken from the top 5 centimeters of the soil profile. The soil samples were analyzed in the laboratory and a spectral library in the Vis-Nir range (350-2500 nm) was created. The albedo of the samples was integrated from the ADS spectra. At the same time, a linear regression model of albedo using the soil properties as explanatory variables was performed. The R2 fit of this new model was about 0.82 and the error of estimation was 4.1. The model was extended to the entire Byers Peninsula using the ML soil property models as explanatory variables. The RMSE of the extended models increased up to 8.2. We think that the main cause of this increase (2.6 points) is related to the error propagation, phenomenon due to the use of models as explanatory variables. However, another important part of the error increase could be due, among other reasons, to the use of an image that, although corrected, is not completely free of clouds.

We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

A numerical application of linear-molecule symmetry properties, described by the D_∞h point group, is formulated in terms of lower-order symmetry groups D_nh with finite n. Character tables and irreducible representation transformation matrices are presented for D_nh groups with arbitrary n-values. These groups are subsequently used in the construction of symmetry-adapted ro-vibrational basis functions for solving the Schrödinger equations of linear molecules as part of the variational nuclear motion program TROVE. The TROVE symmetrisation procedure is based on a set of "reduced" vibrational eigenvalue problems with simplified Hamiltonians. The solutions of these eigenvalue problems have now been extended to include the classification of basis-set functions using ℓ, the eigenvalue (in units of ℏ) of the vibrational angular momentum operator ${\widehat{L}}_z$ . This facilitates the symmetry adaptation of the basis set functions in terms of the irreducible representations of D_nh. ¹²C₂H₂ is used as an example of a linear molecule of D_∞h point group symmetry to illustrate the symmetrisation procedure.

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.

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.

While the simple model of the total atmospheric carbon sink effect as a linear function of concentration has provided excellent prediction results, several problems remained to be investigated and solved. The most obvious open issue is the correct treatment of land use change emssions. It turns out that the model improves by mostly neglecting them after 1959. This effectively implies that land use change emissions have been constant and small since then. The key investigation starts with the observation, that the total carbon sink has a short term component which be explained by temperature changes commonly known as El Nin˜o. The apparent paradox is analysed and explained, why contrary to the short term changes no temperature caused trend can be detected in the model, despite the fact that several contributing processes exhibit temperature dependency. The result of this analysis leads to the model extension, where the total effect of sinks and natural emissions are a linear function of concentration and temperature. This model not only explains current measurements but also paleo climate from ice-core time series.

Oscillons, fundamental to various physical domains, are examined in-depth in this paper. From Josephson junctions in superconducting circuits to classical and quantum field theories, oscillators reveal profound insights into diverse phenomena. The study primarily focuses on oscillons, distinctive field configurations with enduring localization, establishing intriguing connections with well-known models like the Sine-Gordon breather. Surprising parallels in the weak coupling limit illuminate the rich dynamics of oscillators. A semi-classical quantization method, discretizing the field into spatially homogeneous regions, exposes stability angles, providing insights into the quantum nature of oscillons. The application of this quantization framework to specific cases, including the Sine-Gordon breather, showcases its versatility. The results offer a comprehensive perspective on the quantization of oscillons, unraveling the intricate interplay between classical and quantum dynamics. In conclusion, this paper provides a profound exploration of quantum oscillators, unveiling novel connections and presenting a rigorous quantization framework. The gained insights contribute significantly to the broader understanding of oscillatory systems and their pivotal role in diverse physical phenomena.

The core of risk aggregation in the Solvency II Standard Formula is the so-called square root formula. We argue that it should be seen as a means for the aggregation of different risks to an overall risk rather than being associated with variance-covariance based risk analysis. Considering the Solvency II Standard Formula from the viewpoint of linear geometry, we immediately find that it defines a norm and therefore provides a homogeneous and sub-additive tool for risk aggregation. Hence Euler's Principle for the reallocation of risk capital applies and yields explicit formulas for capital allocation in the framework given by the Solvency II Standard Formula. This gives rise to the definition of diversification functions, which we define as monotone, subadditive, and homogeneous functions on a convex cone. Diversification functions constitute a class of models for the study of the aggregation of risk, and diversification. The aggregation of risk measures using a diversification function preserves the respective properties of these risk measures. Examples of diversification functions are given by seminorms, which are monotone on the convex cone of non-negative vectors. Each L^p norm has this property, and any scalar product given by a non-negative positive semidefinite matrix does as well. In particular, the Standard Formula is a diversification function and hence a risk measure that preserves homogeneity, subadditivity, and convexity.

Kinetic parameters of SO2 adsorption on unburned carbons from lignite fly ash and activated carbons based on hard coal dust were determined. The model studies were performed using the linear and non-linear regression method for the following models: pseudo first and second-order, intraparticle diffusion, and chemisorption on a heterogeneous surface. The quality of the fitting of a given model to empirical data was assessed based on: R2, R, Δq, SSE, ARE, χ2, HYBRID, MPSD, EABS, and SNE. It was clearly shown that it is the linear regression that more accurately reflects the behaviour of the adsorption system, which is consistent with the first-order kinetic reaction – for activated carbons (SO2+Ar) or chemisorption on a heterogeneous surface – for unburned carbons (SO2+Ar and SO2+Ar+H2O(g)+O2) and activated carbons (SO2+Ar+H2O(g)+O2). Importantly, usually, each of the approaches (linear/non-linear) indicated a different mechanism of the studied phenomenon. A certain universality of the χ2 and HYBRID functions has been proved, the minimization of which repeatedly led to the lowest SNE values for the indicated models. Fitting data by any of the non-linear equations based on the R or R2 functions only, cannot be treated as evidence/prerequisite of the existence of a given adsorption mechanism.

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.

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.

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.

Given a quasi-definite linear functional u in the linear space of polynomials with complex coefficients let us consider the corresponding sequence of monic orthogonal polynomials (SMOP in short) (Pn)n≥0. For the Christoffel transformation u˜=(x−c)u with SMOP (P˜n)n≥0, we are interested to study the relation between u˜ and u(1)˜, where u(1) is the linear functional for the associated orthogonal polynomials of the first kind (Pn(1))n≥0 and u(1)˜=(x−c)u(1) is its Christoffel transformation. This problem is also studied for the Geronimus transformations.

We write the mutual information between an input speech utterance and its reconstruction by a Code-Excited Linear Prediction (CELP) codec in terms of the mutual information between the input speech and the contributions due to the short term predictor, the adaptive codebook, and the fixed codebook. We then show that a recently introduced quantity, the log ratio of entropy powers, can be used to estimate these mutual informations in terms of bits/sample. A key result is that for many common distributions and for Gaussian autoregressive processes, the entropy powers in the ratio can be replaced by the corresponding minimum mean squared errors. We provide examples of estimating CELP codec performance using the new results and compare to the performance of the AMR codec and other CELP codecs. Similar to rate distortion theory, this method only needs the input source model and the appropriate distortion measure.

Considering the fault "N-1" checksum and the power flow, the single-phase power flow model is further transformed into a three-phase power flow model, and the asymmetry of the three-phase power flow is measured by the three-phase unbalance factor. The calculation model is linearized by the second-order cone relaxation and the Big-M method. At the same time, the load response and distribution network reconstruction are used to improve the reliability of the power supply network to cope with the power failure. The relationship between power supply capability and power flow constraints, main transformer capacity and distributed power parameters is analyzed by IEEE 33-node three-phase power distribution system. The feasibility of the proposed model and the accuracy of the second-order cone relaxation are verified by numerical examples, which provides a technical reference for distribution network planning.

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.

Let $n \geq 2$ be a fixed integer and $\mathcal{A}$ be a $C^*$-algebra. A permuting $ n $-linear map $ \mathcal{G} : \mathcal{A} ^{n} \rightarrow \mathcal{A} $ is known to be symmetric generalized $n$-derivation if there exists a symmetric $n$-derivation $ \mathfrak{D} : \mathcal{A} ^{n} \rightarrow \mathcal{A} $ such that $ \mathcal{G} \left(x_{1}, x_{2}, \ldots, x_{i} x_{i}^{\prime}, \ldots, x_{n}\right)= \mathcal{G} \left(x_{1}, x_{2}, \ldots, x_{i}, \ldots, x_{n}\right) x_{i}^{\prime}+x_{i} \mathfrak{D} (x_{1}, x_{2},\ldots, x_{i}^{\prime}, \ldots, x_{n})$ holds for all $x_{i}, x_{i}^{\prime} \in \mathcal{A} $. In this paper, we investigate the structure of $C^*$-algebras involving generalized linear $n$-derivations. Moreover, we describe the forms of traces of linear $n$-derivations satisfying certain functional identity.

Routing quantum information among different nodes in a network is a fundamental prerequisite for a quantum internet. While single-qubit routing has been largely addressed, many-qubit routing protocols have not been intensively investigated so far. Building on the many-excitation transfer protocol in Ref. , we apply the perturbative transfer scheme to a two-excitation routing protocol on a network where multiple two-receivers block are coupled to a linear chain. We address both the case of switchable and permanent couplings between the receivers and the chain. We find that the protocol allows for efficient two-excitation routing on a fermionic network, although for a spin-12 network only a limited region of the network is suitable for high-quality routing.

In this paper, we present a relapse based demonstrating way to deal with investigate various arrangement MTC information. A commonplace use of this displaying approach incorporates three stages: first, define a model that approximates the connection between quality articulation and trial factors, with boundaries consolidated to address the exploration premium; second, utilize least-squares and assessing condition methods to gauge boundaries and their relating standard blunders; third, register test insights, P-qualities and NFD as proportions of factual criticalness. The benefits of this methodology are as per the following. To begin with, it tends to the exploration interest in a particular, precise way, and maximally uses all the information and other important data. Second, it represents both orderly and irregular varieties related with the information, and the consequences of such examination give not just quality explicit data applicable to the exploration objective, yet additionally its dependability, in this way helping agents to settle on better choices for subsequent investigations. Third, this methodology is truly adaptable, and can undoubtedly be stretched out to different sorts of MTC considers or other microarray explores by detailing various models dependent on the test plan of the investigations.

Mucosal irritation caused by cusps of upper and lower teeth represents a source of persistent, low grade mechanical trauma. This type of trauma can initiate and/or perpetuate oral lichen planus in a few susceptible patients. Here, we report a rare case of bilateral white linear striations in the buccal mucosa of a young patient, associated with sharp cusps. Oral lesions demonstrated a unique cuspal signature highlighting the causal role of subtle mucosal trauma in the genesis of reticular-oral lichen planus. Lesions appeared to be exacerbated by significant psychological distress experienced by the patient. Although the Koebner phenomenon is well reported in the cutaneous lichen planus literature, such presentations are relatively rare in the oral cavity. This report emphasizes the potential role of low-grade cuspal trauma/irritation in conjunction with psychological distress in the genesis of oral lichen planus.

The article is devoted to issues related to the propagation and transformation of vortexes in the optical range of frequency. Within the framework of the traditional and modified model of slowly varying envelope approximation (SVEA), the process of converting vortex beams of the optical domain into vortex beams of the terahertz radio range based on nonlinear generation of a difference frequency in a medium with a second-order susceptibility is considered. The modified SVEA splits a slowly varying amplitude into two factors, which makes it possible to more accurately describe the three-wave mixing process. The theoretical substantiation of the rule of vortex beams topological charges conversion is given – the topological charge of the output radio-vortex beam is equal to the difference between the topological charges of the input optical vortex beams. A numerical simulation model of the processes under consideration has been implemented and analyzed.

Gradual disability worsening in Multiple Sclerosis (MS) is indicative of confirmed progression that mostly involves progression independent of relapse activity (PIRA) and is associated with neurodegeneration. Insights from pathology reveal grey matter involvement (neocortex, hippocampus, spinal cord, and deep grey matter structures) and microglia activation in early stages of MS. Cortical lesions result in thinning and atrophy and are considered accurate predictors of disability progression and cognitive decline.Neuroimaging biomarkers, such as high-resolution 7T MR images and TSPO-PET, have been examined for the detection of cortical pathology linked to cognitive deficits and thus progression, but are limited in clinical practice due to availability, time constraints, and cost.Electroencephalography (EEG) emerges as a non-invasive, cost-effective tool that reflects cortical activity in MS. Its potential in monitoring cognitive impairment is explored by focusing on nonlinear EEG analysis. The MuST PREDICT^TM project aims to extract linear and nonlinear EEG features, investigating their role in predicting disease progression and optimizing treatment. The study employs retrospective, cross-sectional, and prospective designs, utilizing EEGs from various MS forms, cognitive assessments, serum/cerebrospinal fluid biomarkers and neuroimaging. The methodology involves time-based and spectral feature extraction, employing artificial intelligence classifiers and brain criticality-based approaches.The conceptual framework of an innovative modality is herein presented, that would EEG for early MS progression detection. Standardization of the methodology could lead to the creation of a digital tool for better prognostication and treatment strategy optimization.

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.

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

Byers Peninsula is considered one of the largest ice-free areas in Maritime Antarctica. Since 2006, the Spanish Polar Program has taken part in a large number of environmental studies involving effects of climate changes in lives cycles, limnology and microbiology. Soils from maritime Antarctica are generally weakly developed and have chemical, physical and morphological characteristics strongly influenced by the parent material. However, biological activity during the short Antarctic summer promotes intense transference of nutrients and organic matter in areas occupied by different species of birds and marine mammals. To mapping and monitoring those areas with high biological occupation, could be very useful to have models of edaphic properties prepared from satellite images. In this approach, Deep Learning and Linear Regression models of soil properties and spectral indexes as explicative variables were performed. We training models of soil properties closely related to biological activity such as Dissolved Organic Carbon (DOC) and the iron fraction associated with organic matter (Fe). We tested the best approach to model the spatial distribution of DOC, Fe and pH by training models of Linear Regression and Deep Learning over Sentinel2 and WorldView2 images. The most robust models were used to track possible areas with ornithogenic soils as well as areas of the Byers Peninsula that could support the highest biological development.

Time series forecasting has been a challenging area in the field of Artificial Intel-ligence. Various approaches such as linear Neural Networks, Recurrent Linear Neural Networks, Convolutional Neural Networks and recently Transformers have been attempted for the time series forecasting domain. Although, Trans-former-based architectures have been outstanding in the Natural Language Pro-cessing domain, especially in autoregressive language modeling, the initial at-tempts to use transformers in the time series arena have met with mixed success. One of the recent papers demonstrated that modeling the multi-variate time se-ries problem as independent channels on a transformer architecture produced lower mean square and mean absolute errors on benchmarks, however, another recent paper claimed that a simple linear neural network out-performs previous approaches including transformer-based designs. We investigate this paradox in detail comparing the linear Neural Network and Transformer based designs, provide insights to why a certain approach may be better for a particular type of problem. We also improve upon the recently proposed simple linear Neural Network based architecture by using dual pipelines with batch normalization and reversible instance normalization. Our enhanced architecture outperforms all existing architectures for time series forecasting on majority of the popular benchmarks.

With the use of linear regression modeling, this study sought to forecast and analyze rainfall patterns in Ethiopia. The dataset included historical rainfall data as well as pertinent independent variables. The R-squared score and mean squared error (MSE) were used to assess the effectiveness of the linear regression model. The results showed that the model's ability to forecast and analyze rainfall patterns was not very good. Only around 5.3% of the variance in rainfall could be explained by the chosen independent variables, according to the R-squared score of 0.053. This low number indicated that there was little correlation between the selected variables and rainfall, and that a sizable percentage of the variation in the dependent variable was not captured by the model. The model's accuracy in forecasting rainfall was shown to be quite low by the MSE error, with significant squared discrepancies between the expected and actual amounts. These results support the notion that the linear regression model as it is now designed is not appropriate for studying or forecasting Ethiopia's rainfall patterns. Alternative modeling approaches, the inclusion of other pertinent factors, and the assurance of the availability of high-quality data that faithfully captures the intricate dynamics of rainfall in the area all require more investigation.

This study investigates the suitability of the timestamp approach algorithm for predicting blood pressure (BP) using wearable and comfortable devices, showcasing its accuracy even with low-frequency sampled signals. Developed within the SINTEC European project, the algorithm utilizes Electrocardiogram (ECG) and Photoplethysmogram (PPG) sensors, demonstrating promising results in both laboratory and hospital settings. The research emphasizes the algorithm’s potential to transform continuous and non-invasive BP monitoring through wearable technology, offering frequent measurements with minimal discomfort. While the study shows promise, further exploration is needed, focusing on optimizing machine learning coefficients for long-term monitoring applications and addressing potential changes over time. Technological improvements, including the implementation of edge computing algorithms, hold the key to enhancing BP accuracy, denoising techniques, and integrating alarm systems for future wearable solutions. This study emphasizes the adaptability of the algorithm for diverse healthcare environments, paving the way for broader applications in convenient and reliable BP monitoring.

Background: As long-lived organisms, urban trees often encounter development and redevelopment activities in close proximity during their lifespans. These activities can damage tree roots, often through methods like root severing during trenching or excavation. Methods: In 2017, we simulated trenching damage on mature Quercus virginiana Mill. trees at three different distances from the base (3x, 6x, and 12x the stem diameter). After five years, we revisited these trees to assess root regrowth based on the cut root's cross-sectional area (CSA) and distance from the base. Results: We observed regrowth in all but 38 (6.7%) of the 557 cut roots revisited. The lack of regrowth in some roots was not associated with our original treatments, the CSA of the roots at the time of trenching, or distance between the cut root end and the trunk (minimum P-value = 0.841). On average, the observed CSA of the regrowth was 22.2% of the original root's CSA. Only our original trenching treatments significantly predicted the level of regrowth observed five years after pruning (P-value = 0.024). Discoloration due to root pruning was minimal. Conclusion: In summary, our findings indicate that root systems require many years to recover from trenching damage. Increasing the distance between trenching activities and trees may have a minor effect on root regrowth but primarily helps reduce initial stress on the tree.

The particulars of stimulus-response experiments done on dynamic biosystems clearly limit what one can learn and validate about their structural interconnectivity (topology), even when collected kinetic output data are perfect (noise-free). As always, available access ports and other data limitations rule. For linear systems, exponential modes, visible and hidden, play an important role in understanding data limitations, embodied in what we call dynamical signatures in the data. We show here how to circumscribe and analyze modal response data in compartmentalizing model structures – so that modal analysis can be used constructively in systems biology model building – for nonlinear (NL) as well as linear biosystems. We do this by developing and exploiting the modal basis for dynamical signatures in hypothetical (perfect) input-output data associated with a structural model – one that includes inputs and outputs explicitly – and for NL as well as linear biosystems. The methodology establishes model dimensionality (size, complexity) from particular data sets; helps select among multiple candidate models (model distinguishability); helps in designing new experiments to extract “hidden” structure; and helps to simplify (reduce) models to their essentials. For NL biosystems, results are not as comprehensive, similarly informative about their dominant dynamical properties, and unified with linear models on invariant 2-dimensional manifolds in phase space. Some automation of these highly technical aspects of biomodeling is also introduced.

This work presents a control scheme to control the grid-connected single-phase photovoltaic (PV) system. The considered system has four 250W solar panels, a non-inverting buck-boost DC-DC converter, and DC-AC inverter with LCL filter. The control system aims to track and operate at the maximum power point (MPP) of PV panels, regulate the voltage of DC link, and supply the grid with a unity power factor. To well achieve these goals, the proposed control system consists of three parts, that are MPP tracking controller module with a fuzzy-based modified incremental conductance (INC) algorithm, a DC-link voltage regulator with a hybrid fuzzy proportional-integral (PI) controller, and a Current Controller module using the linear quadratic regulator (LQR) for grid-connected power. Based on fuzzy control and LQR, this work introduces a full control solution for grid-connected single-phase PV systems. The key novelty of this research is to analyze and prove that the newly proposed method is more successful in numerous aspects by comparing and evaluating the previous and present control methods. The designed control system settles quickly, which is critical for output stability. In addition, as compared to backstepping approach used in our past study, the LQR technique is more resistant to sudden changes and disturbances. Furthermore, backstepping method produces the larger overshoot, which has a detrimental impact on efficiency. Simulation findings under various weather conditions were compared to theoretical ones to indicate that the system can deal with variations in weather parameters.

Epidermal growth factor receptor (EGFR) is a receptor tyrosine kinase that instigates several signaling cascades, including the NF-kB signaling pathway, to induce cell differentiation and proliferation. Overexpression and mutations of EGFR are found in up to 30% of solid tumors and correlate with a poor prognosis. Although it is known that EGFR-mediated NF-kB activation is involved in tumor development, the signaling axis is not well elucidated. Here, we found that PKP2 and the LUBAC complex were required for EGFR-mediated NF-kB activation. Upon EGF stimulation, EGFR recruited PKP2 to the plasma membrane, and PKP2 bridged HOIP, the catalytic E3 ubiquitin ligase in the LUBAC, to the EGFR complex. The recruitment activated the LUBAC complex and the linear ubiquitination of NEMO, leading to IkB phosphorylation and subsequent NF-kB activation. Furthermore, EGF-induced linear ubiquitination was critical for tumor cell proliferation and tumor development. Knockout of HOIP impaired EGF-induced NF-kB activity and reduced cell proliferation. HOIP knockout also abrogated the growth of A431 epidermal xenograft tumors in nude mice by more than 70%. More importantly, the HOIP inhibitor, HOIPIN-8, inhibited EGFR-mediated NF-kB activation and cell proliferation of A431, MCF-7, and MDA-MB-231 cancer cells. Overall, our study reveals a novel linear ubiquitination signaling axis of EGFR, and perturbation of HOIP E3 ubiquitin ligase activity is potential targeted cancer therapy.