In recent years, the rise of advanced artificial intelligence technologies has had a profound impact on many fields, including education and research. One such technology is ChatGPT, a powerful large language model developed by OpenAI. This technology offers exciting opportunities for students and educators, including personalized feedback, increased accessibility, interactive conversations, lesson preparation, evaluation, and new ways to teach complex concepts. However, ChatGPT poses different threats to the traditional education and research system, including the possibility of cheating on online exams, human-like text generation, diminished critical thinking skills, and difficulties in evaluating information generated by ChatGPT. This study explores potential opportunities and threats that ChatGPT poses to overall education from the perspective of students and educators. Furthermore, for programming learning, we explore how ChatGPT helps students improve their programming skills. To demonstrate this, we conducted different coding-related experiments with ChatGPT, including code generation from problem descriptions, pseudocode generation of algorithms from texts, and code correction. We also verified the generated codes with an online judge system to evaluate their accuracy.

University course scheduling (UCS) is one of the most important and time-consuming issues that all educational institutions face yearly. Most of the existing techniques to model and solve UCS problems have applied approximate methods, which are different in terms of efficiency, performance, and optimization speed. Accordingly, this research aims to apply an exact optimization method to provide an optimal solution to the course scheduling problem. In other words, in this research, an integer programming model is presented to solve the USC problem. In this model, hard and soft constraints include the facilities of classrooms, courses of different levels and compression of students' curriculum, courses outside the faculty and planning for them, and the limited time allocated to the professors. The objective is to maximize the weighted sum of allocating available times to professors based on their preferences in all periods. To evaluate the presented model's feasibility, it is implemented using the GAMS software. Finally, the presented model is solved in a larger dimension using a real data set from a college in China and compared with the current program in the same college. The obtained results show that considering the mathematical model's constraints and objective function, the faculty courses' timetable is reduced from 4 days a week to 3 working days. Moreover, master courses are planned in two days, and the courses in the educational groups do not interfere with each other. Furthermore, by implementing the proposed model for the real case study, the maximum teaching hours of the professors are significantly reduced. The results demonstrate the efficiency of the proposed model and solution method in terms of optimization speed and solution accuracy.

Few switching transitions in high power and medium voltage application of Power converters are desirable. The selective harmonics elimination (SHE) pulse width modulation offers a better quality waveform with lower switching transitions and hence lower switching losses. The SHE is a pre-programmed modulation technique where certain amounts of lower order harmonics are removed and fundamental voltage is controlled. After Fourier analysis of output waveform, a set of nonlinear transcendental equations is obtained which exhibits, multiple, unique or no solution in different range of modulation index (MI). In this paper, an iterative method based on the Jacobian estimate is proposed to solve a highly non-linear set of SHE equations. The proposed technique is easy in implementation and can solve a large number of such equations as computation of the Jacobian matrix in the subsequent iteration is estimated from the previous values. Moreover, the proposed method also removes the singularity problem, especially for large SHE equations. High accuracy in the initial guess is also not essential for this method and can converge to the solution with any random initial guess. The computational and simulation results are given to validate the concept. The hardware result is provided to confirm the computational and simulation results.

This study analyses the short-run hydro generation scheduling for the wind power differences from the contracted schedule. The approach for construction of the joint short-run marginal cost curve for the hydro-wind coordinated generation is proposed and applied on the real example. This joint short-run marginal cost (SRMC) curve is important for its participation in the energy markets and for economic feasibility assessment of such coordination. The approach credibly describes the short-run marginal costs which this coordination bears in “real life”. The approach is based on the duality framework of a convex programming and as a novelty combines the shadow price of risk mitigation capability and the water shadow price. The proposed approach is formulated as a stochastic linear program and tested on the case of the Vinodol hydropower system and the wind farm Vrataruša in Croatia. The result of the case study is a family of 24 joint short-run marginal cost curves.

A real-time two-way direct load control (TWDLC) of central air-conditioning chillers in wide area is proposed to provide demand response. The proposed TWDLC scheme is designed to optimize the load shedding ratio of every customer under control to ensure the target load to be shed is met at every scheduling period. In order to overcome the load reduction uncertainties of TWDLC, an innovative solution is proposed by applying a certain degree of loosening on the constraint of the actual shed load. Fuzzy linear programming is utilized to solve the optimization problem with fuzzy constraints. The proposed fuzzy linear programming problem is solved by delicately transforming it into a regular liner programming problem. A selection scheme used to obtain the feasible candidates set for load shedding at every sampling interval of TWDLC is also designed along with the fuzzy linear programming.

We present a generalized state-space model formulation particularly motivated by an online scheduling perspective. Through these proposed generalizations, we enable a natural way to handle routinely encountered disturbances and a rich set of corresponding counter-decisions. Thereby, greatly simplifying and extending the possible application of mathematical programming based online scheduling solutions to diverse application settings.

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 issue of equipment layout in multi-floor satellites consists of two primary parts: allocating the equipment to the satellite's layers and placing the equipment in each layer individually. In reviewing the past literature in this field, firstly, the issue of assigning equipment to layers is observed in a few articles and next in the layout part, the non-overlapping constraint has always been a challenge, particularly for components that do not have a circular cross-section. In addition to presenting a heuristic method for allocating equipment to different layers of the satellite, this article presents a robust flexible programming model (RFPM) for the placement of equipment at different layers, taking into account the inherent flexibility of the equipment in placement and the subject of uncertainty. This model is based on the existing uncertainty between the distances of cuboid equipment which has not been addressed in any of the previous research, and by comparing its outputs with cases from past studies, it demonstrates a significantly higher efficiency in placing the equipment and meeting the limit of non-overlapping constraints between the equipment. Finally, it would be possible to reduce the design time in the conceptual and preparatory stages, as well as the satellite's overall size, while still satisfying other constraints like stability and thermal limitations, moments of inertia and centre of gravity.

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.

The airport ground handling services (AGHS) equipment supplier selection problem involves a safety guarantee on the part of the AGHS company that carries out the daily work. AGHS company can prevent aircraft damage and delays in airlines schedules, and ensure reliable and high-quality ground handling service. In our research, we developed an AGHS equipment supplier selection model based on the analytic hierarchy process and an AHP weighted fuzzy linear programming approach, and we solved the AGHS equipment supplier’s selection problem. The main objective of this article is to create an AHP and AHP-FLP decision model in order to help the AGHS company authorities select the best AGHS equipment supplier. The practical application in AGHS equipment supplier selection decisions can be interpreted as demonstrating that the proposed model provides knowledge and practical value for the AGHS industry.

In this paper, we present an extended version of the Hadi-Vencheh model for multiple criteria ABC inventory classification. The proposed model is a nonlinear weighted product model (WPM) which determines a common set of weights for all the items. Our proposed nonlinear WPM incorporates multiple criteria with different measure units, without converting the performance of each inventory item in terms of each criterion into a normalized attribute value, thereby providing an improvement over the model proposed by Hadi-Vencheh. Our study mainly includes various criteria for ABC classification, and demonstrates an efficient algorithm for solving nonlinear programming problems in which the feasible solution set does not have to be convex. The algorithm presented in this study improves the solution efficiency of the Canonical Coordinates Method (CCM) algorithm substantially when applied to large scale, nonlinear programming problems. The modified algorithm was tested to compare our proposed model results to the results derived using the Hadi-Vencheh model and demonstrate the algorithm's efficacy. The practical implications of the study are to develop an efficient nonlinear optimization solver by optimizing the quality of existing solutions, thus improving time and space efficiency.

Election Algorithm (EA) is a powerful metaheuristics model motivated by phenomena of the socio-political mechanism of the presidential election conducted in many countries. EA is selected as a topic of discussion due to its capability and robustness to carry out complex problems in the random-2SAT logic program. This paper utilizes a hybridized EA assimilated with the Hopfield neural network (HNN) in carrying out random logic program (HNN-R2SATEA). The efficiency of the proposed method was compared with the existing traditional exhaustive search (HNN-R2SATES) model and the recently introduced HNN-R2SATICA model. From the result obtained, clearly proven that based on our proposed hybrid model outperformed other existing model based on the Global Minima Ratio (ZM), Mean Absolute Error (MAE), Bayesian Information Criterion (BIC) and Execution Time (ET). The expected outcome portrays that the EA algorithm outperformed the other two algorithms in doing random-kSAT logic program. The results proved the robustness, effectiveness, and compatibility of the HNN-R2SATEA model.

Management of demand and capacity for airport operation is important. The effect of capacity setting on slot adjustment, maximum adjustment and flight delay has been extensively investigated and discussed in previous slot adjustment models. But its effect on characteristics of flight waves has not been studied deeply. At present, in order to resolve the problem that Linear Integer Programming (LIP) is limited in slot allocation due to its fast dimension growth and large memory consumption, the general practice is to optimize the slot application according to data-splitting technology. However, the relationship among data splitting method, capacity setting and characteristics of slot wave has not been investigated in detail, which limits the application of LIP in slot allocation. Through the detailed analysis and testing, we found that the waveform and amplitude of slot wave can be controlled and designed by appropriate virtual capacity settings, while the number of capacity constraints and the computing time is reduced by adopting appropriate data feeding method. Our research also provides clues for further research on the construction of the flight waves for airlines operating at specific airports in order to establish direct or indirect connectivity, and increase hit rate by using our approaches.

In this paper we investigate the optimal investment strategy for a defined contribution (DC) pension plan during the decumulation phrase which is risk-averse and pays close attention to inflation risk. The plan aims to maximize the expected constant relative risk aversion (CRRA) utility from the terminal wealth by investing the wealth in a financial market consisting of an inflation-indexed bond, an ordinary zero coupon bond and a risk-free asset. We derive the optimal investment strategy in closed-form using the dynamic programming approach by solving the corresponding Hamilton-Jacobi-Bellman (HJB) equation. Our theoretical and numerical results reveal that under some rational assumptions, an inflation-indexed bond do has significant advantage to hedge inflation risk.

In the field of robotics education, introductory courses would ideally utilize heavy industrial arms for hands-on learning. This would provide students with valuable experience in joint programming, which involves direct control of each joint motor in the arm to accomplish desired path planning and differential movements. This practice requires consideration of the physical dynamics of the arm. However, the use of heavy industrial arms has several drawbacks. They are large and expensive, require specialized maintenance, can pose safety risks, and they typically do not allow for direct control of the joint motors. One solution is to use a small, lightweight, toy-like arm. While these are cost-effective and provide direct access to the joint motors without posing safety risks, their lightweight construction means they exhibit minimal dynamic behavior, which limits their educational value. Another solution involves a robotic arm simulator that uses a virtual arm. However, a virtual arm doesn't offer the same level of hands-on engagement and excitement as a physical arm. We propose a hybrid solution that combines a small physical arm with a virtual arm. This approach provides students with the experience of working with an industrial arm, but without the associated difficulties. We demonstrate how this approach successfully improved the completion rate of joint programming assignments, offering a promising solution for practical robotics education.

This paper addresses the optimal stochastic allocation of Distributed Energy Resources in distribution Networks. Typically, uncertain problems are analyzed in multi-stage formulations including case generation routines, resulting in computationally exhaustive programs. In this article, two probabilistic approaches are proposed resulting in a single-stage, convex, stochastic optimal power flow problem: The Range-Probability Optimization (RPO) and Value-Probability Optimization (VPO). The RPO maximizes probabilities within a range of uncertainty, whilst the VPO optimizes the values of the random variables and maximizes their probabilities. Random variables are modeled with hourly measurements fitted to the logistic distribution. These formulations were tested on two systems and compared against the deterministic case built from expected values. Results indicate that assuming deterministic conditions ends in highly underestimated losses. The RPO showed that by including a ±10 % uncertainty, the losses can be increased up to 40 % with up to −72 % photovoltaic capacity, depending on the system, whereas the VPO resulted in up to 85 % increases in power losses despite PV installations, with 20 % greater probabilities in average. By implementing any of the proposed approaches, it was possible to obtain more probable upper envelopes in the objective, avoiding case generation stages and heuristic methods.

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.

Pediatric obstructive sleep apnea (OSA) has significant negative effects on health and behavior in childhood including depression, failure to thrive, neurocognitive impairment, and behavioral issues. It is strongly associated with an increased risk for chronic adult disease such as obesity and diabetes, accelerated atherosclerosis, and endothelial dysfunction. Accumulating evidence suggests that adult-onset non-communicable diseases may originate from early life through a process by which an insult applied at a critical developmental window causes long-term effects on the structure or function of an organism. Recently, much attention has been paid to the role of epigenetic mechanisms in the pathogenesis of adult disease susceptibility. Epigenetic mechanisms that influence adaptive variability include histone modifications, non-coding RNAs, and DNA methylation. This review will highlight what is currently known about the phenotypic associations of epigenetic modifications in pediatric OSA and will emphasize the importance of epigenetic changes as both modulators of chronic disease and potential therapeutic targets.

Proposed as a response to the increasing global need for environmental protection, a green port balances economic vibrancy and environmental protection. However, because exhaust emissions (e.g., CO2 or sulfide) are difficult to monitor in and around ports, data on such emissions are often incomplete, which hinders research on this topic. To remedy this problem, this study aimed to formulate a method for collecting CO2 emissions data at their source; this method was applied to collect real-world operating data from a large container-handling company in Taiwan. Specifically, to account for undesirable outputs, we formulated a method that combines (1) data envelopment analysis based on a modified slack-based measure and (2) a multichoice goal programming approach. We found that rubber-tired gantry cranes are the greenest and should be used. Our findings aid port managers in selecting port equipment that best balances between environmental protection and profitability.

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.

With the existence of several programming languages such as C/C++, Java, C#, LISP, Prolog, Python, Simula, F#, Go, Haskell, Scala, Ruby, Dart, Swift, Groovy etc. and diverse paradigms like structured, object-oriented, list, aspect-oriented, service-oriented, web, mobile and logic programming, there is a need to perform an exhaustive comparative analysis of diverse compilers and environments before making a choice of implementation technology in software engineering. Optimization of compilers helps to reduce execution time by making use of high speed processor registers, thereby, eliminating redundant computation. This paper reports some series of performance analysis done with some popular programming languages including Java, C++, Python and PHP. Programs involving recursive and iterative functions like factorial of large numbers and binary search of large arrays were run on the various platforms with the execution time recorded in milliseconds and represented in a chart. This can aid in making a selection of the appropriate language to use for a given application domain.

This study identifies the optimal management policy of a given energy storage system (ESS) installed in a grid-connected wind farm for maximizing the monetary benefits and provides guidelines for defining the economic value of the ESS under the optimal management policy and selecting the optimal size of the ESS based on the economic value. Considering stochastic models for wind power and electricity price, we develop a finite-horizon periodic-review Markov decision process (MDP) model to seek the optimal management policy. We also use a simple optimization model to find the optimal storage capacity and charging/discharging capacity of the ESS. By applying our analytic approach to a real-world grid-connected wind farm located in South Korea, we verify the usefulness of this study. Our numerical study shows that the economic value of the ESS is highly dependent on the management policy, wind electricity variability, and the electricity price variability. Thus, the optimal size of ESS should be carefully determined based on the locational characteristics and management policy even with limited investments. Furthermore, this study provides a meaningful policy implication on how much a subsidy the government should provide for installing ESS in a wind farm.

Health services research is a multidisciplinary discipline that aims to improve population health by studying healthcare services' organization, delivery, and financing. Over time, the field has worked to define its boundaries and establish a set of core research topics and methods addressing population wellbeing, access, quality, and cost. Although the influence of health technology is significant, our literature survey on health services research showed that SCs in general—containing their management, cost, and policy—had received little attention. Importantly, our assessment also showed that the system’s readiness to handle supply policy and supply device deficiencies like those encountered during pandemic was hardly ever mentioned. Reduced open areas and water bodies, deteriorating infrastructure, and changes in the biological morphology all affect cities’ uncontrollable and unplanned growth. Urban amenities, facilities, and healthcare services were unevenly distributed due to this unchecked urban population development. In light of this, this research suggests two reliable models for site selection issues for one of Hong Kong’s main hospitals. Levels of uncertainty, infeasibility tolerance, and reliability are taken into consideration. Then, two categories of uncertainty—symmetric and bound-ed—were examined. As a result, the challenge of scheduling in uncertainty has been considered, and potential solutions have been presented using a specified probability distribution function. The paper concludes by introducing the specific justice and health problems and outlining four typical strategies. In order to ensure that medications and other healthcare supplies are produced, distributed, and given to patients, a vast network of systems, components, and procedures must be effectively managed. This research contributes in this regard. Also, its grantee fairness in health systems and the populations health locally, nationally, and globally. It highlights health inequity, advances the measurement of health inequity, and promotes public dialogues on health inequity.

Since the 1990’s, studies and pilot tests have been conducted to reduce traffic, accidents, and pollution due to urban freight transport (UFT). These ended up in several policies, regulations, and restrictions for UFT, such as low emission zones, delivery time windows, and vehicle size and weight restrictions. However, issues in UFT under regulatory measures still persevere. This study introduces an optimization framework for deriving an optimal combination of various types of vehicles with different capacities for vehicle replacement in UFT. This framework allows an understanding of how an urban freight company with a limited budget efficiently satisfies its freight demand within an urban area in the presence of regulatory measures by urban administrators. The introduced formulation, which is a mixed-integer linear programming, will assist the operator in choosing the best investment strategy for introducing new vehicles of certain types and sizes, for operation in different zones, into its fleet while gaining economic benefits and having a positive impact on the liveability of the urban area. Furthermore, a sensitivity analysis is performed to consider the effects of specific uncertain parameters on the total cost. The numerical results show that the share of electric vehicles in the fleet increases, and they are more competitive than diesel vehicles.

Currently, most middleware application developers have two choices when designing or implementing API services: They can either stick with REST or explore the emerging GraphQL technology. Although REST is widely considered the standard method for API development, GraphQL is believed to overcome the main drawbacks of REST, especially data fetching issues. Yet, doubts remain as there are no experimental studies with convincing results to evaluate the performance of the two services. In this paper, we propose a research methodology to evaluate the performance of REST and GraphQL API services, which includes two main contributions. The first contribution is that the performance evaluation of the two services is conducted in the real operation of a massive and intensively accessible management information system. The second contribution is the fair and independent performance evaluation results obtained for both API services. The performance evaluation was studied using basic measures of QoS, including response time, throughput, CPU load, and memory usage. The results show that REST is still faster in response time and throughput, while GraphQL is very efficient in resource utilization, i.e., CPU load and memory utilization. Therefore, GraphQL is the right choice when data requirements change frequently and resource utilization is the most important consideration. REST is used when some data is frequently accessed called by multiple requests.

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

The need for the most accurate and flexible system of revenue collection from internal sources has become a matter of extreme urgency and importance in e-governance. This need underscores the eagerness on the part of the Government to look for a new principle and policy of revenue collection or to become aggressive and innovative in the mode of collecting revenue from existing sources using the present system. The Boards of some Governments in Africa, even up to the moment are facing a lot of setbacks in performing their tasks due to the manual system of revenue collection from the public. This can be improved through an effective collection of revenue using the most accurate and flexible system. Tax is usually collected in the form of specific sales tax, general sales tax, corporate income tax, individual income tax, property tax and inheritance tax. Problems such as high cost of collection, fraud, underpayment, leakage in revenue, poor access to information, poor tracking of defaulters is at the increase. As a result of this, there is need to computerize the revenue collection system. Computerized systems have proven to introduce massive efficiencies and quick collection of revenue from the public. This research work demonstrates how to design and implement an automated system of revenue collection and how to maintain a secured database for collected tax information. This research delves into the study of how machine learning algorithms and Software-defined Networks improve the security of such automated systems.

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

This paper considers a two-way relay network, where two source nodes exchange messages through several relays in the presence of an eavesdropper, and the channel state information (CSI) of the eavesdropper is imperfectly known. The amplify-and-forward relay protocol is used and the relay beamforming weights are designed. The model is built up to minimize the total relay transmit power while guaranteeing the quality of service at users and preventing the eavesdropper from decoding the signals. Due to the imperfect CSI, a semi-infinite programming problem is obtained. An algorithm is proposed to solve the problem, and the iterative points are updated through the linesearch technique, where the feasibility are preserved during iterations. The optimality property is analyzed. The obtained subproblems are quadratic constrained quadratic programming problems, either with less than $4$ constraints or with only one variable, which are solved optimally. Simulation results demonstrate the importance of the proposed model, and imply that the proposed algorithm is efficient and converges very fast, where more than 85% of the problems are solved optimally.

Microbes are the most prevalent and widely-distributed life form on planet Earth. They are also cognitive organisms with memory and superior problem-solving skills that use quantum phase transitions during their remarkably-effective gathering and dissemination of information. This narrative review explores the biological ramifications of human holobionts physically embodying the human microbiome and connecting to the Internet of Microbes (IOM) beyond our body. Within the review, we consider: 1) the ways in which our microbial co-partners exerted control over our ancestors and continue to influence our current human generation, 2) how they mold virtually every key aspect of our life and even remain with our body in death and 3) how inward-looking contemplative tools such as meditation and embodied cognition provide an ideal opportunity to connect to the microbial information super highway and tap the full range of human holobiont capacities.

The (numerical) solution of Ordinary Differential Equations (ODEs) problems is of paramount relevance, ODEs system being an ubiquitous mathematical formulation of many physical phenomena (such as those involved in fluid dynamics, chemistry, biology, evolutionary-anthropology, ...): almost every dynamici phenomenon can be modeled by means of an ODEs system. The present paper is the first manifesto of FOODIE, a library aimed to numerically solve ODEs problems by means of a clear, concise and efficient abstract interface. FOODIE, meaning Fortran Object oriented Ordinary Differential Equations integration library, has manifolds aims: to provide a set to built-in numerical schemes that are accurate, robust, validated and efficient and to allow easy application of these schemes to (almost) all ODEs problems by means of an effective Abstract Calculus Pattern. The key idea is to allow the same solver-implementation to be applied to all ODEs problems thus avoiding the re-implementation of the ODEs solver for each different ODEs problem: code re-usability is consequently maximized, FOODIE being a general robust framework. Besides, the same framework also allows rapid development of new ODEs solvers due to the high abstraction level of the library itself. The present paper is the first announcement of FOODIE project: the current implementation is extensively discussed and its capabilities are proved by means of tests and examples.

Wind power is one of the most important sources of renewable energy available today. A large part of the wind energy cost is due to the cost of maintaining wind power equipment. When a wind turbine component fails to function, it might need to be replaced under the less than ideal circumstances. This is known as corrective maintenance. To minimize unnecessary costs, a more active maintenance policy based on the life expectancy of the key components is preferred. Optimal scheduling of preventive maintenance activities requires advanced mathematical modeling. In this paper, an optimal preventive maintenance algorithm is designed using the renewal-reward theorem. In the multi-component setting, our approach involves a new idea of virtual maintenance which allows us to treat each replacement event as a renewal event even if some components are not replaced by new ones. The proposed optimization algorithm is applied to a four-component model of a wind turbine and the optimal maintenance plans are computed for various initial conditions. The modeling results showed clearly the benefit of PM planning compared to pure CM strategy (about 30% lower maintenance cost).

Liquid crystal elastomers (LCEs) are shape morphing materials whose large and reversible shape transformation results from the coupling between the mobile anisotropic properties of liquid crystal (LC) units and the rubber elastic of polymer networks. Their shape changing behaviors under the stimuli are largely directed by LC orientations, and therefore various strategies have been developed to spatially modulate the LC alignments. But most of the methods suffer from complex fabrication technologies or intrinsic limitations in applicability. To address this issue, programmable complex shape changes in some types of LCEs, such as polysiloxane side-chain LCEs or thiol-acrylate main-chain LCEs, etc, have been achieved by using a mechanical alignment programming process coupled with two-step crosslinking. Here, we report a polysiloxane main-chain LCE with programmable 2D and 3D shape changing performances achieved by mechanically programming the polydomain LCE between the two crosslinking steps. The resulting LCEs exhibited reversible thermal induced shape transformation between the initial and programmed shapes due to the two-way memory between the first network structure and the second network structure. Our work would be potential for expanding the applications of LCE materials in actuators, soft robotics and smart structures where arbitrary and easily programmed shape morphings are needed.

The best business relationships are built as relationships between people and organizations that work together to achieve common goals. In the current digital era, B2B collaboration relationships are essential for business success. The response time to customer requests can be a key factor in maintaining these relationships and obtaining a competitive advantage. The use of VBA automation for repetitive tasks can help speed up this process, but it is important that computer operators have medium knowledge about using VBA macros. This work deals with issues related to improving response times to requests received by email, using a macro program for repetitive tasks. The empirical study was conducted on an average of 50 daily emails for order confirmation, with an average writing time of 68 s per email, resulting in a potential reduction in working time for the operator of approximately 1 h/day, only for order confirmation. The results show a significant improvement in working time for computer operators, using VBA buttons for repetitive tasks.

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.

The is a sequential article to an initial review suggesting that Microbiome First medical approaches to human health and wellness could both aid the fight against noncommunicable diseases and conditions (NCDs) and help to usher in sustainable healthcare. This current review article specifically focuses on public health programs and initiatives and what has been termed by medical journals as a catastrophic record of recent failures. Included in the review is a discussion of the four priority behavioral modifications (food choices, cessation of two drugs of abuse, and exercise) advocated by the World Health Organization as the way to stop the ongoing NCD epidemic. The lack of public health focus on the majority of cells and genes in the human superorganism, the microbiome, is highlighted as is the “regulatory gap” failure to protect humans, particularly the young, from a series of mass population toxic exposures (e.g., asbestos, trichloroethylene, dioxin, polychlorinated biphenyls, triclosan, bisphenol A and other plasticizers, polyfluorinated compounds, herbicides, food emulsifiers, high fructose corn syrup, certain nanoparticles, endocrine disruptors, obesogens). The combination of early life toxicity for the microbiome and connected human physiological systems (e.g., immune, neurological), plus a lack of attention to the importance of microbial rebiosis has facilitated rather than suppressed, the NCD epidemic. This review article concludes with a call to place the microbiome first and foremost in public health initiatives as a way to both rescue public health effectiveness and reduce the human suffering connected to co-morbid NCDs.

This paper reviews the low-resilience problem in many cities, poor designs of cities to cope with disasters, and the need for tolerance of urban constructions. It explores answers concerning the question of how shall we build cities resiliently? The method of this applied research is a multiphase process that considers all physical and socioeconomic elements of a city. It introduces six indicator groups of urban management (M), economy (E), built environments (U), Infrastructures (I), natural environments (N), and health protection (H). The groups include 55 indicators as variables in the mathematical calculations in this paper. This paper builds a mathematical model to maximize the profitability of resilient buildings by optimizing investments in the required projects. The projects will upgrade the firmness and tolerance of cities against nature-based and human-made dangers and risks. There is a linear programming in 55 variables to select optimal solutions from fifty-five factorial alternatives. Then, the programming will develop into non-linear programming. The unique innovation of this paper is its linear programming interpretation by non-linear to give optimal solutions for the problem. Applying the Lagrange function in the Kuhn-Tucker conditions proves the accuracy of the hypothesis that post-COVID urbanization requires maximum resilience. Only in this way, the urban economies will be free of risks. Outcomes in this paper will assist in the pre-planning, design, and building of built environments everywhere resilient and sustainable.

Demand response flexible loads can provide fast regulation and ancillary services as reserve capacity in power systems. This paper proposes a joint optimization dispatch control strategy for source-load system with stochastic renewable power injection and flexible thermostatically controlled loads (TCLs) and plug-in electric vehicles (PEVs). Specifically, the optimization model is characterized by a chance constraint look-ahead programming to maximal the social welfare of both units and load agents. By solving the chance constraint optimization with sample average approximation (SAA) method, the optimal power scheduling for units and TCL/PEV agents can be obtained. Secondly, two demand response control algorithms for TCLs and PEVs are proposed respectively based on the aggregate control models of the load agents. The TCLs are controlled by its temperature setpoints and PEVs are controlled by its charging power such that the DR control objective can be fulfilled. The effectiveness of the proposed dispatch and control algorithm has been demonstrated by the simulation studies on a modified IEEE 39 bus system with a wind farm, a photovoltaic power station, two TCL agents and two PEV agents.

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.

A growing body of research has identified fetal risk factors associated with adult diseases that form the basis for the Developmental Origins of Health and Disease (DOHaD) hypothesis. This theory proposes a critical developmental period during which the fetus is highly susceptible to specific environmental influences that significantly impact health from short to long term. Maternal stress and T2DM during pregnancy are among these influences, likely leading to fetal overexposure to glucocorticoids and suggesting a shared pathway between maternal dysregulated HPA axis and fetal environmental insults. Studies demonstrate that prenatal glucocorticoid exposure alters fetal HPA axis function, affecting brain function, tissue glucocorticoid availability, and fetal growth in utero. These programmed changes, such as altered HPA axis function and reduced fetal growth, contribute to metabolic disorders persisting into adulthood. T2DM is preceded by a prediabetic state, often asymptomatic, which shares similar pathophysiological complications with T2DM, including HPA axis dysregulation observed in animals. Therefore, investigating prediabetes during pregnancy alongside maternal HPA axis function and its effects on fetal outcomes is crucial, as these areas remain understudied. This review aims to synthesize existing literature on pre-existing T2DM during pregnancy, its links to fetal programming via HPA axis changes, and possible links to pregestational prediabetes.

This study explores optimizing Synthetic Aperture Radar (SAR) satellite constellation scheduling for multi-imaging missions in densely targeted areas using an in-house developed Modified Dynamic Programming (MDP) algorithm. By employing Mixed-Integer Linear Programming (MILP) to define the mission planning problem, the research aims to maximize observation of high-value targets within restricted planning horizons. Numerical simulations, covering a wide range of target numbers and satellite configurations, reveal the MDP algorithm’s superior mission allocation efficiency, enhanced success rates, and reduced revisit times, compared to the Greedy algorithm. The findings underscore the MDP algorithm’s improved operational efficiency and planning robustness for complex imaging tasks, demonstrating significant advancements over traditional approaches.

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

Municipal Solid Waste Management (MSWM) struggles with significant policy and operational challenges, particularly concerning recyclables collection routes and fleet composition. Within the European Union, phasing out traditional fuel-based vocational vehicles, like garbage trucks, in favor of zero-emission alternatives is mandatory to achieve sustainable development objectives. Integrating electric solid waste collection vehicles into municipal fleets presents challenges due to differences in range, capacity, and noise levels. The emission is even more crucial in the systems where recyclables are collected separately, which requires a greater number of trips to be performed. This study addresses MSWM’s strategic aspect by minimizing the total cost of replacing waste collection vehicles while meeting emission constraints. The Fleet Transition Problem (FTP) was formulated and solved using a MARKAL-based approach. The objective of the FTP and a mixed integer linear program used to solve it is minimizing the overall cost of fleet modernization throughout a multi-phase planning horizon so that the sustainable transition of the fleet can be assured. Computational experiments affirmed the model’s effectiveness in strategizing fleet transition. This research outlines a multi-period model for transitioning to a zero-emission fleet and demonstrates the FTP’s potential for strategic decision-making. Notably, the study observes a consistent reduction in permissible emissions across the planning horizon.

The migration from MATLAB to Python (M-to-PY) has gained significant traction in recent computational research. While MATLAB has long served as a linchpin in myriad scientific endeavors, there's an emerging trend to rejuvenate these projects using Python's extensive AI tools and libraries. This study presents a semi-automated process for M-to-PY conversion, using a detailed case study of an image skeletonization project comprising fifteen MATLAB files and a 1404-image dataset. Skeletonization is foundational for ongoing 3D motion detection research using AI transformers, predominantly developed in Python. The utilization of ChatGPT-4, acting as an AI co-programmer, is pivotal in this conversion. By leveraging the public OpenAI API, we developed an M-to-PY converter prototype, evaluated its efficacy using test cases from the Bard bot, and subsequently employed the converted code in an AI application. The dual contributions encompass a well-tested M-to-PY converter and a Skeleton App capable of sketching and skeletonizing any given image, enriching the AI toolset. This study accentuates how AI resources, like ChatGPT-4, can simplify code transitions, opening doors for innovative AI implementations using primarily MATLAB-coded scientific research.

Given several nonnegative matrices with a single pattern of allocation among their zero/nonzero elements, the average matrix should have the same pattern, too. This is the first tenet of the pattern-multiplicative average (PMA) concept, while the second one suggests the multiplicative (or geometric) nature of averaging. The original concept of PMA was motivated by the practice of matrix population models as a tool to assess the population viability from long-term monitoring data. The task has reduced to searching for an approximate solution to an overdetermined system of polynomial equations for unknown elements of the average matrix (G), hence to a nonlinear constrained minimization problem for the matrix norm. Former practical solutions faced certain technical problems, which required sophisticated algorithms but returned acceptable estimates. Fresh idea to use the eigenvalue approximation ensues also from the basic equation of averaging, which determines the exact value of λ1(G), the dominant eigenvalue of matrix G, too, and the corre-sponding eigenvector. These are bound by the well-known linear equations, which reduce the task to a standard problem of linear programing (LP). The LP approach is realized for 13 fixed-pattern matrices gained in a case study of Androsace albana, an alpine short-lived perennial, monitored on permanent plots during 14 years. A standard software routine reveals the unique exact solution, rather than an approximate one, to the PMA problem, which turns the LP approach into ‘’the best of versatile optimization tools”. The exact solution turns out to be peculiar in reaching zero bounds for certain nonnegative entries of G, which deserves a modified problem formulation separating the lower bounds from zero.

In recent years, distributed generation technology has developed rapidly. Renewable energy, represented by wind energy and solar energy, has been widely studied and utilized. In order to give full play to the advantages of Distributed Generation (DG) and meet the challenges after power grid access, Active Distribution Network (ADN) is considered as the future development direction of traditional distribution network because of its ability of active management. Nowadays, multi-scenario analysis is widely used in the research of optimal allocation of distributed power supply in active distribution network. Aiming at the problems that may arise when using multi-scenario analysis to plan DG with uncertainties in large-scale scenarios, a scenario reduction method based on improved clustering algorithm is proposed. The validity of the scene reduction method is tested, and the feasibility of the method is verified. At present, there are few studies on the optimal allocation of DG in ADN under fault state. In this paper, comprehensive safety indicators are introduced. Considering the timing characteristics of DG and the influence of active management mode, a bi-level programming model is established, which aims at minimizing the investment of annual life cycle and the removal of active power. The bi-level model is a complex mixed integer non-linear programming model. A hybrid algorithm combining cuckoo search algorithm and primal dual interior point method is used to solve the model. Finally, through the simulation of the IEEE-33 node system, the superiority of the scenario reduction method and the comprehensive security index used in this paper to optimize the configuration of DG in ADN is verified.

The independent set, IS, on a graph $G=(V,E)$ is $V^{*}\subseteq V$ such that no two vertices in $V^{*}$ have an edge between them. The MIS problem on G seeks to identify an IS with maximum cardinality, i.e. MIS. $V^{*}\subseteq V$ is a vertex cover, i.e. VC of $G=(V,E)$ if every $e\in E$ is incident upon at least one vertex in $V^{*}$ . $V^{*}\subseteq V$ is dominating set, DS, of $G=(V,E)$ if $\forall v\in V$ either $v\in V^{*}$ or $\exists u\in V^{*}$ and $(u,v)\in E$ . The MVC problem on G seeks to identify a vertex cover with minimum cardinality, i.e. MVC. Likewise, MCV seeks a connected vertex cover, i.e. VC which forms one component in G, with minimum cardinality, i.e. MCV. A connected DS, CDS, is a DS that forms a connected component in G. The problems MDS and MCD seek to identify a DS and a connected DS i.e. CDS respectively with minimum cardinalities. MIS, MVC, MDS, MCV and MCD on a general graph are known to be NP-complete. Polynomial time algorithms are known for bipartite graphs, chordal graphs, cycle graphs, comparability graphs, claw-free graphs, interval graphs and circular arc graphs for some of these problems. We introduce a novel graph class, layered graph, where each layer refers to a subgraph containing at most some k vertices. Inter layer edges are restricted to the vertices in adjacent layers. We show that if $k=\Theta (log\mid V\mid )$ then MIS, MVC and MDS can be computed in polynomial time and if $k=O\left({(log\mid V\mid )}^{\alpha }\right)$ , where $\alpha <1$ , then MCV and MCD can be computed in polynomial time. If $k=\Theta \left({(log\mid V\mid )}^{1+ϵ}\right)$ , for $ϵ>0$ , then MIS, MVC and MDS require quasi-polynomial time. If $k=\Theta (log\mid V\mid )$ then MCV, MCD require quasi-polynomial time. Layered graphs do have constraints such as bipartiteness, planarity and acyclicity.

Micro-grids’ operations offer local reliability; in the event of faults or low voltage/frequency events on the utility side, micro-grids can disconnect from the main grid and operate autonomously while providing the continued supply of power to local customers. With the ever-increasing penetration of renewable generation, however, the operations of micro-grids become increasingly complicated because of the associated fluctuations of voltages. As a result, transformer taps are adjusted frequently, thereby leading to the fast degradation of expensive tap-changer transformers. In the islanding mode, the difficulties also come from the drop of voltage and frequency upon disconnecting from the main grid. To appropriately model the above, the nonlinear AC power flow constraints are necessary. Computationally, the discrete nature of tap-changer operations and the stochasticity caused by renewables add two layers of difficulty on top of a complicated AC-OPF problem. To resolve the above computational difficulties, the main principles of the recently-developed "l1-proximal" Surrogate Lagrangian Relaxation are extended. Testing results based on 9-bus system demonstrate the efficiency of the method to obtain the exact feasible solutions for micro-grid operations thereby avoiding approximations inherent to existing methods, while demonstrating that through the optimization, 1. the number of tap changes is drastically reduced, and 2. the method is capable of handling networks with meshed topologies.

This review paper gives Excel functions for highly precise Colebrook’s pipe flow friction approximations developed by users. All shown codes are implemented as User Defined Functions – UDFs written in Visual Basic for Applications – VBA, a common programming language for MS Excel spreadsheet solver. Accuracy of the friction factor computed using nine to date the most accurate explicit approximations is compared with the sufficiently accurate solution obtained through an iterative scheme which gives satisfying results after sufficient number of iterations. The codes are given for the presented approximations, for the used iterative scheme and for the Colebrook equation expressed through the Lambert W-function (including its cognate Wright ω-function). The developed code for the principal branch of the Lambert W-function has additional and more general application for solving different problems from variety branches of engineering and physics. The approach from this review paper automates computational processes and speeds up manual tasks.

The skyrocketing growth in the number of Internet of Things (IoT) devices will certainly pose a huge traffic demand for fifth-generation (5G) wireless networks and beyond. In-band full-duplex (IBFD), which is theoretically expected to double the spectral efficiency of a half-duplex (HD) wireless channel and to connect more devices, has been considered as a promising technology to accelerate the development of IoT. To exploit the full potential of IBFD, the key challenge is how to handle network interference (including self-interference, co-channel interference and multiuser interference) more effectively. In this paper, we propose a simple yet efficient user grouping method, where a base station (BS) serves strong downlink users and weak uplink users and vice versa in different frequency bands, mitigating severe network interference. We aim to maximize a minimum rate among all users subject to bandwidth and power constraints, which is formulated as a highly nonconvex optimization problem. By leveraging inner approximation framework, we develop a very efficient iterative algorithm to solve this problem, which guarantees at least a local optimal solution. Numerical results are provided to show not only the benefit of using full-duplex raido at BS, but also the advantage of the proposed user grouping method.

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.

Abstract: Safety issues related to the electrification of more electric aircraft (MEA) need to be addressed because of the increasing complexity of aircraft electrical power systems and the growing number of safety-critical sub-systems that need to be powered. Managing the energy storage systems and the flexibility in the load-side plays an important role in preserving the system’s safety when facing an energy shortage. This paper presents a system-level centralized operation management strategy based on model predictive control (MPC) for MEA to schedule battery systems and exploit flexibility in the demand-side while satisfying time-varying operational requirements. The proposed online control strategy aims to maintain energy storage (ES) and prolong the battery life cycle, while minimizing load shedding, with fewer switching activities to improve devices lifetime and to avoid unnecessary transients. Using a mixed-integer linear programming (MILP) formulation, different objective functions are proposed to realize the control targets, with soft constraints improving the robustness of the model. Besides, an evaluation framework is proposed to analyze the effects of various objective functions and the prediction horizon on system performance, which provides the designers and users of MEA and other complex systems with new insights into operation management problem formulation.

Carbon footprint mitigation actions have become a key issue for companies involved in urban freight transport. The electrification of the delivery fleets is one of the crucial sustainable actions carried out. To this end, it is necessary to explore several fleet renewal strategies over a finite planning horizon evaluating different types of electric powertrains for light commercial vehicles. The primary goal of this purpose-built analysis is to assist and boost the fleet managers' decisions when transitioning to alternative-fuelled vans, intending to maximize cost savings and reduce greenhouse gas emissions inventory. The model presented in this work is a Multi-Objective Linear Programming hybrid analysis taking into account the vehicle and energy supply infrastructure costs and the emissions reported in each inventory scope following the Greenhouse Gas Protocol sustainability guidelines. From this perspective, the conducted research offers a novel approximation to fleet management problems enabling a break-down cost analysis and an evaluation of the annual emissions company report. The comprehensive numerical simulations carried out over different study scenarios in Spain demonstrate that the optimization approach does not only show effective fleet renewal strategies but also identifies critical factors that impact the fleet's competitiveness, offering valuable insights for fleet managers and policymakers to meet carbon footprint reductions in a cost-effectively way.

Building electric energy is characterized by a significant increase of its uses (e.g. vehicle charging), a rapidly declining cost of all related data collection and a proliferation of smart grid concepts, including diverse and flexible electricity pricing schemes. Not surprisingly, an increased number of approaches have been proposed for its modeling and forecasting. In this work, we place our emphasis on three forecasting related issues. First, on the forecasting explainability, i.e. the ability to understand and explain to the user what shapes the forecast. To this extent we rely on concepts and approaches that are inherently explainable, such as the evolutionary approach of genetic programming (GP) and its associated symbolic expressions, as well as the so-called SHAP (SHapley Additive eXplanations) values, which is a well established model agnostic approach for explainability, especially in terms of feature importance. Second, we investigate the impact of the training timeframe on the forecasting accuracy; this is driven by the realization that a fast training would allow for faster deployment of forecasting in real life solutions. And third, we explore the concept of counterfactual analysis on actionable features, i.e. features that the user can really act upon and which therefore present an inherent advantage when it comes to decision support. We have found that SHAP values can provide important insights into the model explainability. As for GP models, we have found comparable and in some cases superior accuracy when compared to its neural-network and time-series counterparts but a rather questionable potential to produce crisp and insightful symbolic expressions, allowing a better insight into the model performance. We have also found, and report here on an important potential especially for practical, decision support, solutions of counterfactuals built on actionable features and short training timeframes.

Adverse childhood experiences are known to program children for disrupted biological cycles, premature aging, microbiome dysbiosis, immune-inflammatory misregulation, and chronic disease multimorbidity. To date, the microbiome has not been a major focus of deprogramming efforts despite its emerging role in every aspect of ACE-related dysbiosis and dysfunction. This article examines: 1) the utility of incorporating microorganism-based, anti-aging approaches to combat ACE-programmed chronic diseases (also known as noncommunicable diseases and conditions, NCDs) and 2) microbiome regulation of core systems biology cycles that affect NCD comorbid risk. In this review microbiota influence over three key cyclic rhythms (circadian cycles, the sleep cycle, and the lifespan/longevity cycle) as well as tissue inflammation and oxidative stress are discussed as an opportunity to deprogram ACE-driven chronic disorders. Microbiota, particularly those in the gut, have been shown to affect host-microbe interactions regulating the circadian clock, sleep quality, as well as immune function/senescence and regulation of tissue inflammation. The microimmunosome is one of several systems biology targets of gut microbiota regulation. Furthermore, correcting misregulated inflammation and increased oxidative stress is key to protecting telomere length and lifespan/longevity and extending what has become known as the healthspan. This review article concludes that to reverse the tragedy of ACE-programmed NCDs and premature aging, managing the human holobiont microbiome should become a routine part of healthcare and preventative medicine across the life course.

In this work, the Pumped Storage Unit (PSU) is proposed to be integrated with wind-thermal generation system owned by a company whose aim is to maximize its profit through optimal self-scheduling of its units by finding the best bidding strategy in day-ahead energy market. The mathematical formulation of the scenario based unit-commitment and coordinated trading problem is formulated as a stochastic mixed integer linear program. The formulation takes into account several uncertain parameters; such as the wind power generation, energy market prices, and imbalances up/down prices. The expected total profit obtained from energy trading with and without coordinating pumped storage system (PSS) with thermal-wind generation system were compared, and a significant improvement in profit resulted from coordination was observed. Furthermore, coordination between PSS and wind-thermal generation improve the conditional value at risk (CVaR) which monitors the biding risk level.

Inspired by the reflective and deliberative control mechanisms used in cognitive architectures such as SOAR and Sigma, we propose an alternative decision mechanism driven by architectural appraisals allowing robots to overcome impasses. The presented work builds on and improves on our previous work on a generally applicable decision mechanism with roots in the Standard Model of the Mind and the Generalized Cognitive Hour-glass Model. The proposed decision mechanism provides automatic context-dependent switching between exploration-oriented, goal-oriented, and backtracking behavior, allowing a robot to overcome impasses. A simulation study of two applications utilizing the proposed decision mechanism is presented demonstrating the applicability of the proposed decision mechanism.

Electrical energy demand increase does evolve rapidly due to several socioeconomic factors such as industrialization, population growth, urbanization and of course the evolution of modern technologies in this 4th industrial revolution era. Such rapid increase in energy demand introduces a huge challenge in power system. Such has paved way for network operators to seek for alternative energy resources other than the conventional fossil fuel system. Hence, the penetration of renewable energy into the electricity supply mix has evolved rapidly in the past three decades. However, the grid system has to be well planned ahead to accommodate such increase in energy demand in the long run. Transmission Network Expansion Planning (TNEP) is a well ordered and profitable expansion of power facilities that meets the expected electric energy demand with an allowable degree of reliability. This paper proposes a TNEP model that minimises the network reinforcements, operational costs and costs of renewable energy penetrations, while satisfying the increase in demand. The problem is formulated as a mixed integer linear programming (MILP) problem. The developed model has been tested in several IEEE test systems in multi-period scenarios. The paper also carried out a detailed derivation of the new non-negative variables in terms of the power flow magnitudes, the bus voltage phase angles and the lines’ phase angles for proper mixed integer variables’ decomposition techniques. Moreover, this paper tends to provide additional recommendation in terms of which particular year (within 20 years of planning period) can the network operators install new line(s), new corridor(s) and/or additional generation capacity to the respective existing power networks. Such is achieved by running incremental periods simulations from base year through the planning horizon. The results show the efficacy of the developed model in solving the TNEP problem with a reduced and acceptable computation time even for large power grid system.

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.

In the implementation of thermal enhanced oil recovery (TEOR) techniques, the temperature impact on relative permeability in oil - water systems is of special concern. Hence, developing a fast and reliable tool to model the temperature effect on two-phase oil - water relative permeability is still a major challenge for precise studying and evaluation of TEOR processes. To reach the goal of this work, two promising soft-computing algorithms, namely Group Method of Data Handling (GMDH) and Gene Expression Programming (GEP) were employed to develop reliable, accurate, simple and quick to use paradigms to predict the temperature dependency of relative permeability in oil - water systems (K_rw and K_ro). To do so, a large database encompassing wide-ranging temperatures and fluids/rock parameters, including oil and water viscosities, absolute permeability and water saturation, was considered to establish these correlations. Statistical results and graphical analyses disclosed the high degree of accuracy for the proposed correlations in emulating the experimental results. In addition, GEP based correlations were found to be the most consistent with root mean square error (RMSE) values of 0.0284 and 0.0636 for K_rw and K_ro, respectively. Lastly, the comparison of the performances of our correlations against those of the preexisting ones indicated the large superiority of the introduced correlations compared to previously published methods. The findings of this study can help for better understanding and studying the temperature dependency of oil - water relative permeability in thermal enhanced oil recovery processes.

A method for calibrating models of agricultural production and resource use presented by Howitt [1] for policy analysis is proposed to leverage multidisciplinary agricultural research at the National Center for Alluvial Aquifer Research (NCAAR). An illustrative example for Sunflower County, MS is presented to show how plot-level research can be extended to draw systemic region or basin wide implications. A hypothetical improvement in yields for dryland soybean varieties is incorporated to the model and shown to have a positive impact on aquifer outcomes and producer profits. The example illustrates that a change in one practice-crop combination can have system-wide impacts as evidenced by the change in acreages for all crops and practices.

While paresthesia-based spinal cord stimulation (SCS) has been proven effective to treat chronic neuropathic pain, initial benefits may lead to the development of “Failed SCS Syndrome’ (FSCSS) defined as decrease over time related to Loss of Efficacy (LoE) with or without Loss of Coverage (LoC). Development of technologies associating new paresthesia-free stimulation waveforms and implanted pulse generator adapters provide opportunities to manage patients with LoE. The main goal of our study was to investigate salvage procedures, through neu-rostimulation adapters, in patients already implanted with SCS and experienced LoE. We retro-spectively analyzed a cohort of patients who were offered new SCS programs/waveforms through an implanted adapter between 2018 and 2021. Patients were evaluated before, and at 1, 3, 6 and 12-month follow-up. Outcomes included pain intensity rating with Visual Analog Scale (VAS), pain/coverage mappings and stimulation preferences. Last follow-up evaluations (N=27) showed significant improvement in VAS (p = 0.0001), ODI (p = 0.021) and Quality of Life (p=0.023). In the 11/27 patients with LoC, SCS efficacy on pain intensity (36.89%) was accompa-nied by paresthesia coverage recovery (55.57%) and pain surface decrease (47.01%). At 12-month follow-up, 81.3% preferred to keep tonic stimulation in their waveform portfolio. SCS conver-sion using adapters appears promising as a salvage solution, with an emphasis on paresthesia recapturing enabled by spatial retargeting. In light of these results, adapters could be integrated to SCS rescue algorithms or should be considered in SCS rescue.

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.

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

Low Power Wide Area Networks (LPWAN) enable a growing number of Internet-of-Things (IoT) applications with large geographical coverage, low bit-rate, and long lifetime requirements. LoRa (Long Range) is a well-known LPWAN technology that uses a proprietary Chirp Spread Spectrum (CSS) physical layer, while the upper layers are defined by an open standard - LoRaWAN. In this paper, we propose a simple yet effective method to improve the Quality-of-Service (QoS) of LoRa networks by fine-tuning specific radio parameters. Through a Mixed Integer Linear Programming (MILP) problem formulation, we find optimal settings for the Spreading Factor (SF) and Carrier Frequency (CF) radio parameters, considering the network traffic specifications as a whole, to improve the Data Extraction Rate (DER) and to reduce the packet collision rate and the energy consumption in LoRa networks. The effectiveness of the optimization procedure is demonstrated by simulations, using LoRaSim for different network scales. In relation to the traditional LoRa radio parameter assignment policies, our solution leads to an average increase of 6% in DER, and a number of collisions 13 times smaller. In comparison to networks with dynamic radio parameter assignment policies, there is an increase of 5%, 2.8%, and 2% of DER, and a number of collisions 11, 7.8 and 2.5 times smaller than equal-distribution, Tiurlikova's (SoTa), and random distribution, respectively. Regarding the network energy consumption metric, the proposed optimization obtained an average consumption similar to Tiurlikova's, and 2.8 times lower than the equal-distribution and random dynamic allocation policies. Furthermore, we approach the practical aspects of how to implement and integrate the optimization mechanism proposed in LoRa, guaranteeing backward compatibility with the standard protocol.