We propose a model for medium-term hydropower scheduling (MTHS) with variable head and uncertainty in inflow, reserve capacity, and energy price. With an increase of intermittent energy sources in the generation mix, it is expected that a flexible hydropower producer can obtain added profits by participating in other markets than just the energy market. To capture this added potential the hydropower system should be modeled with a higher level of details. In this context, we apply an algorithm based on stochastic dual dynamic programming (SDDP) to solve the nonconvex MTHS problem, and show that the use of Strengthened Benders (SB) cuts to represent the expected future profit (EFP) function provide accurate scheduling results for slightly nonconvex problems. A method to visualize the EFP function in a dynamic programming setting is provided, serving as a useful tool for a priori inspection of the EFP shape and its nonconvexity.

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.

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.

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.

The framework of product life cycle (PLC) cost analysis is one of the most important evaluation tools for a contemporary high-tech company in an increasingly competitive market environment. The PLC-purchasing strategy provides the framework for a procurement plan and examines the sourcing strategy of a firm. The marketing literature emphasizes that ongoing technological change and shortened life cycles are important elements in commercial organizations. From a strategic viewpoint, the vendor has an important position between supplier, buyer and manufacturer. The buyer seeks to procure the products from a set of vendors to take advantage of economies of scale and to exploit opportunities for strategic relationships. However, previous studies have seldom considered vendor selection (VS) based on PLC cost (VSPLCC) analysis. The purpose of this paper is to solve the VSPLCC problems considering the situation of a single-buyer-multiple-supplier. For this issue, a new VSPLCC procurement model and solution procedure are derived by this paper to minimize net cost, rejection rate, late delivery and PLC cost subject to vendor capacities and budget constraints. Moreover, a real case in Taiwan is provided to show how to solve the VSPLCC procurement problem.

The performance of lattice-Boltzmann solver implementations usually depends mainly on memory access patterns. Achieving high performance requires then complex code which handles careful data placement and ordering of memory transactions. In this work, we analyse the performance of an implementation based on a new approach called the data-oriented language, which allows the combining of complex memory access patterns with simple source code. As a use case, we present and provide the source code of a solver for D2Q9 lattice and show its performance on GTX Titan Xp GPU for dense and sparse geometries up to 4096 2 nodes. The obtained results are promising, around 1000 lines of code allowed us to achieve performance in the range of 0.6 to 0.7 of maximum theoretical memory bandwidth (over 2.5 and 5.0 GLUPS for double and single precision, respectively) for meshes of size above 1024 2 nodes, which is close to the current state-of-the-art. However, we also observed relatively high and sometimes difficult to predict overheads, especially for sparse data structures. The additional issue was also a rather long compilation, which extended the time of short simulations, and a lack of access to low-level optimisation mechanisms.

Today’s purchasing companies demand an advanced buyer equal of enactment from their supplier while the two parties maintain a respectful connection. Although the supplier selection (SC) product life cycle cost (SCPLCC) is an important consideration among corporations, SCPLCC problem has become associated with deciding how one supplier should be selected from possible alternatives. In this study, we applied two types of goal programming, multiobjective linear programming and revised multichoice goal programming to develop a PLCC-based concept to solve the SCPLCC problem and construct a decision-making tool for application to a case of supply chain management in a Taiwanese light-emitting diode company in the high-tech industry. Our study main contribution Company managers can easily use the two approaches of the SCPLCC model with different parameters to solve SCPLCC model problems. Finally, we comparing five models found RMCGP with weighted linear goal programming had an adequate effect for application to the PLCC concept for high-technology comapny; this cloud make company decision–makers focus on low PLCC and select better supplier.

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.

Refinery planning optimization is a challenging problem as regards handling the nonconvex bilinearity mainly due to pooling operations in processes such as crude oil distillation and product blending. This work investigates the performance of several representative piecewise-linear (or piecewise-affine) relaxation schemes (referred to as McCormick, bm, nf5, nf6t, and de (which is a new approach proposed based on eigenvector decomposition) that mainly give rise to mixed-integer optimization programs to convexify a bilinear term using predetermined univariate partitioning for instances of uniform and non-uniform partition sizes. Computational results show that applying these schemes give improved relaxation tightness than only applying convex and concave envelopes as estimators. Uniform partition sizes typically perform better in terms of relaxation solution quality and convergence behavior. It is also seen that there is a limit on the number of partitions that contributes to relaxation tightness, which does not necessarily correspond to a larger number of partitions, while a direct relation between relaxation size and tightness does not always hold for non-uniform partition sizes.

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

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.

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.

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.

Using the PLCC advantages generates revenue and lowers costs more than might be anticipated. It ensures better decisions by using a more perfect and practical assessment of revenues and costs. Although the supplier selection (SC) product life cycle cost (SCPLCC) is an important consideration among corporations, SCPLCC problem has become associated with deciding how one supplier should be selected from possible alternatives. In this study, we applied two types of goal programming, multiobjective linear programming and revised multichoice goal programming to develop a PLCC-based concept to solve the SCPLCC problem and construct a decision-making tool for application to a case of supply chain management in a Taiwanese light-emitting diode company in the high-tech industry. Our study main contribution Company managers can easily use the two approaches of the SCPLCC model with different parameters to solve SCPLCC model problems. Finally, we comparing five models found RMCGP with weighted linear goal programming had an adequate effect for application to the PLCC concept for high-technology company; this cloud make company decision–makers focus on low PLCC and select better supplier.

Supplier selection (SC) product life cycle cost (SCPLCC) is an important consideration among corporations, SCPLCC problem has become associated with deciding how one supplier should be selected from possible alternatives. In this study, we applied two types of goal programming, multiobjective linear programming and revised multichoice goal programming to develop a PLCC-based concept to solve the SCPLCC problem and construct a decision-making tool for application to a case of supply chain management in a Taiwanese light-emitting diode company in the high-tech industry. Our study main contribution Company managers can easily use the two approaches of the SCPLCC model with different parameters to solve SCPLCC model problems. Finally, we comparing five models found RMCGP with weighted linear goal programming had an adequate effect for application to the PLCC concept for high-technology company; this cloud makes company decision–makers focus on low PLCC and select a better supplier in sustainable supply chains goal.

The study focuses on the application of R programming language towards marine geological research with a case study of Mariana Trench. Due to its logical and straightforward syntax, multi-functional standard libraries, R is especially attractive to the geologists for the scientific computing. Using R libraries, the unevenness of various factors affecting Mariana Trench geomorphic structure has been studied. These include sediment thickness, slope steepness, angle aspect, depth at the basement and magmatism of the nearby areas. Methods includes using following R libraries: {ggplot2} for regression analysis, Kernel density curves, compositional charts; {ggalt} for Dumbbell charts for data comparison by tectonic plates, ranking dot plots for correlation analysis; {vcd} for mosaic plots, silhouette plots for compositional similarities among the bathymetric profiles, association plots; {car} for ANOVA. Bathymetric GIS data processing was dome in QGIS and LaTeX. The innovativeness of the work consists in the multi-disciplinary approach combining GIS analysis and statistical methods of R which contributes towards studies of ocean trenches, aimed at geospatial analysis of big data.

The web ecosystem is rapidly evolving with changing business and functional models. Cloud platforms are available in a SaaS, PaaS and IaaS model designed around commoditized Linux based servers. 10 billion users will be online and accessing the web and its various content. The industry has seen a convergence around IP based technology. Additionally, Linux based designs allow for a system wide profiling of application characteristics. The customer is an OEM who provides Linux based servers for telecom solutions. The end customer will develop business applications on the server. Customers are interested in a latency profiling mechanism which helps them to understand how the application behaves at run time. The latency profiler is supposed to find the code path which makes an application block on I/O, and other synchronization primitives. This will allow the customer to understand the performance bottleneck and tune the system and application parameters.

Supplier selection (SC) continues to be a crucial component in manufacturing procurement. Using the PLCC advantages generates revenue and lowers costs more than might be anticipated. Supplier selection (SC) product life cycle cost (SCPLCC) is an important consideration among corporations, SCPLCC problem has become associated with deciding how one supplier should be selected from possible alternatives. Past literature on this topic is limited. We try to close this gap in knowledge. In this study, we attempt to apply two types of goal programming, multiobjective linear programming and revised multichoice goal programming to develop a PLCC-based concept to solve the SCPLCC problem and construct a decision-making tool for application to a case of supply chain management in a Taiwanese light-emitting diode company in the high-tech industry. Our study main contribution Company managers can easily use the two approaches of the SCPLCC model with different parameters to solve SCPLCC model problems. Finally, we are comparing five models found RMCGP with weighted linear goal programming had an adequate effect for application to the PLCC concept for high-technology Company; this cloud makes company decision–makers focus on low PLCC and select a better supplier in sustainable supply chains development.

The heterogeneous structure implies that a few nodes may be crucial in maintaining network structural and functional properties. Identifying these crucial nodes correctly and quickly is a primary issue as contemporarily may face the mushrooming of large-scale datasets. Besides, the ‘weight issue’ is always ignored in this field which edge weight may play a positive/negative role in contributing to the node importance in different weighted networks. This paper provides a novel algorithm, Weighted Expectation Algorithm (WEA), which aims to ensure accuracy and speed of computation by taking advantage of dynamic programming to better handle the task of large-scale networks. Additionally, the weight issue that edge weights may contribute differently is addressed by a simply quantitative definition. Two standard experiments show WEA can maintain the network structure in connectivity well (by the lowest average robustness 0.192) and identify the node importance better in the spreading function test of spreading dynamics (by the highest average Kendall’s tau-b 0.678). In addition, the time complexities of different algo-rithms are evaluated, and their time-consuming are tested, proving that WEA consumes a rela-tively short time.

One of the most important subjects of hydraulic engineering is the reliable estimation of the transverse distribution in rectangular channel of bed and wall shear stresses. This study makes use of the Tsallis entropy, Genetic Programming (GP) and (ANFIS) methods to assess the shear stress distribution (SSD) in rectangular channel. To evaluate the results of the Tsallis entropy, GP and ANFIS models, laboratory observations were used in which shear stress was measured using an optimized Preston tube. This is then used to measure the SSD in various aspect ratios in the rectangular channel. To investigate the shear stress percentage, 10 data series with a total of 112 different data for were used. The results of the sensitivity analysis show that the most influential parameter for the SSD in smooth rectangular channel is the dimensionless parameter B/H, Where the transverse co-ordinate is B, and the flow depth is H. With the parameters (b/B), (B/H) for the bed and (z/H), (B/H) for the wall as inputs, the modeling of the GP was better than the other one. Based on the analysis, it can be concluded that the use of GP and ANFIS algorithms is more effective in estimating shear stress in smooth rectangular channels than the Tsallis entropy-based equations.

The article’s goal is to overview challenges and problems on the way from the state of the art CUDA accelerated neural networks code to multi-GPU code. For this purpose, the authors describe the journey of porting the existing in the GitHub, fully-featured CUDA accelerated Darknet engine to OpenCL. The article presents lessons learned and the techniques that were put in place to make this port happen. There are few other implementations on the GitHub that leverage the OpenCL standard, and a few have tried to port Darknet as well. Darknet is a well known convolutional neural network (CNN) framework. The authors of this article investigated all aspects of the porting and achieved the fully-featured Darknet engine on OpenCL. The effort was focused not only on the classification with the use of YOLO1, YOLO2, and YOLO3 CNN models. They also covered other aspects, such as training neural networks, and benchmarks to look for the weak points in the implementation. The GPU computing code substantially improves Darknet computing time compared to the standard CPU version by using underused hardware in existing systems. If the system is OpenCL-based, then it is practically hardware independent. In this article, the authors report comparisons of the computation and training performance compared to the existing CUDA-based Darknet engine in the various computers, including single board computers, and, different CNN use-cases. The authors found that the OpenCL version could perform as fast as the CUDA version in the compute aspect, but it is slower in memory transfer between RAM (CPU memory) and VRAM (GPU memory). It depends on the quality of OpenCL implementation only. Moreover, loosening hardware requirements by the OpenCL Darknet can boost applications of DNN, especially in the energy-sensitive applications of Artificial Intelligence (AI) and Machine Learning (ML).

A novel software engineering platform called the Dynamic Nuchwezi Architecture Platform (DNAP) is introduced, specified and its novelties explained. The unique features of this platform are explained and several new concepts and abstractions upon which its implementation, usage, and analysis are hinged also elaborately discussed. The motivations for this new approach to building especially tools used in data engineering are spelled out and the platform is contrasted against other existing technologies of a similar kind. Finally, it is shown what known limitations DNAP suffers, as well as what room for further research and improvement there is in this field.

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.

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

The airport ground handling service (AGHS) equipment vendor selection (AGHSEVS) problem is critical for ramp work safety management, because AGHS equipment malfunctions affect airport ramp work safety. Appropriate vendor selection can prevent aircraft damage and delays in airlines schedules, and ensure reliable and high-quality ground handling service. The AGHSEVS problem is a time-consuming and complex process that requires professional knowledge and experience to make judgments. Specifically, AGHSEVS is a multi-criteria decision-making (MCDM) problem. Previous research has seldom integrated MCDM methods with linear and goal programming to solve the AGHSEVS problem. The objective of this study was to develop a new system evaluation model for AGHSEVS by considering both qualitative and quantitative methods. We test the proposed approach on an AGHS company in Taiwan.

Augmented and Virtual Reality have been experiencing a rapidly growth in recent years, but there is not still a deep knowledge on their capabilities and where they could be explored. In that sense, this paper presents a study on the accuracy and repeatability of the Microsoft's HoloLens 2 (Augmented Reality device) and HTC Vive (Virtual Reality device) using an OptiTrack system as ground truth. For the HoloLens 2, the method used was hand tracking, while in HTC Vive, the object tracked was the system's hand controller. A series of tests in different scenarios and situations were performed to explore what could influence the measures. The HTC Vive obtained results in the millimetre scale, while the HoloLens 2 revealed not so accurate measures (around 2 centimetres). Although the difference can seem to be considerable, the fact that HoloLens 2 was tracking the user's hand and not an inherit controller made a huge impact. The results were considered a significant step for the on going project of developing a human-robot interface to program by demonstration an industrial robot using Extended Reality, which shows great potential to succeed based on this data.

This paper answers the need to plan a cost-minimizing charging schedule for electric buses and proposes a three-stage procedure, which is oriented around the participation of electric buses aggregator in a day-ahead energy auction. First, optimization models are provided to determine charging availability expressed as minimum and maximum hourly energy requirements taking into account detailed, minutely characteristics and constraints of the charging equipment and the buses. Next, the auction model is formulated by considering aggregated bids submitted by the electric buses aggregator once the charging availability is determined. Hence, the day-ahead prices reflect the optimal schedules of auction participants, and the bus aggregator is safe against peak-hour charging. Finally, hourly auction-based schedules are disaggregated into optimal minutely charging schedules. Mixed-integer linear programming models are formulated for aggregation-disaggregation stages investigated in this paper, while the variables and constraints introduced into the auction model are linear. The proposed methodology has been verified on a recently published case study of a real-world bus service operated on The Ohio State University campus. We show that the auction-based charging of all 22 buses outperforms as-soon-as-possible schedules by 7% to even 28% of daily cost savings. Using the aggregated bids, buses can flexibly shift charges between high- and low-price periods while preserving constraints of the charging equipment and timetables.

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.

1) Background: Fetal Growth Restriction (FGR) has been associated with adverse perinatal outcomes and epigenetic modifications that impact gene expression leading to permanent changes of fetal metabolic pathways and thereby influence development of disease in childhood and adult life. Both clinical and experimental studies showed that maternal nutrition during pregnancy is critical since malnutrition adversely affects fetal growth and physiology. In this study, we investigated the result of maternal food restriction on liver protein expression in Wistar male newborn pups. (2) Materials & methods: Pups born to food restricted mothers were subdivided to FGR and non-FGR groups. Livers of control, FGR and non-FGR groups were analyzed using quantitative proteomics. (3) Results: In total 6665 proteins were profiled. Of these, 451 and 751 were differentially expressed in FGR and non-FGR vs. control respectively, whereas 229 were common between the two groups. Bioinformatics analysis of the differentially expressed proteins (DEPs) in FGR vs. control revealed: induction of the super-pathway of cholesterol biosynthesis and inhibition of thyroid hormone metabolism, fatty acid beta oxidation and apelin liver signaling pathway. In the DEPs of non-FGR vs. control groups there was inhibition of thyroid hormone metabolism, fatty acid beta oxidation and apelin liver signaling pathway as well. (4) Conclusion: This study demonstrates the impact of prenatal food restriction on the proteomic liver profile of FGR and non-FGR offspring underlying the importance of both prenatal adversities and birth weight on liver dependent postnatal disease.

The purpose of this study is to ascertain whether implementation difficulty can be used in slot allocation model as a new mechanism for slightly weakening grandfather right. According to which, a linear integer programming model is designed to compare and analyze displacement, implementation difficulty and priority with different weights. Test results show that the implementation difficulty can be significantly reduced without causing excessive displacement and disruption of existing priorities, by weight setting while declared capacity is cleared. In addition to this, whether the movements are listed in order of descending priority or not have great impact on displacement and implementation difficulty within slot allocation model. Capacity is surely a key factor affecting displacement and implementation difficulties. This study contributes to propose a new mechanism for slightly weakening grandfather right, which can help decision makers to upgrade slot allocation policies.

Ultra-wideband wavelength division multiplexed networks enable operators to use more effectively the bandwidth offered by a single fiber pair and thus make significant savings, both in operational and capital expenditures. The main objective of this study is to minimize optical node resources, such as transponders, multiplexers and wavelength selective switches, needed to provide and maintain high quality of network services, in ultra-wideband wavelength division multiplexed networks, at low cost. A model based on integer programming is proposed, which includes a detailed description of optical network nodal resources. The developed optimization tools are used to study the ultra-wideband wavelength division multiplexed network performance when compared with the traditional C-band wavelength division multiplexed networks. The analysis is carried out for realistic networks of different dimensions and traffic demand sets.

This study focuses on the decisions of picking, inventory, ripening, delivering, and selling mangoes in a harvesting season. Demand, supply, and prices are uncertain, and their probability density functions are fitted based on actual trading data collected from the largest spot market in Taiwan. A stochastic programming model is formulated to minimize the expected cost under the considerations of labor, storage space, shelf life, and transportation restrictions. We implement the sample-average approximation to obtain a high-quality solution of the stochastic program. The analysis compares deterministic and stochastic solutions to assess the uncertain effect on the harvest decisions. Finally, the optimal harvest schedule of each mango type is suggested based on the stochastic program solution.

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.

The problem of scheduling is an area that has attracted a lot of attention from researchers for many years. Its goal is to optimize resources in the system. The assigning task to the lecturer is an example of the timetabling problem, a class of scheduling. This study introduces a mathematical model to assign fixed tasks (the time and required skills to be fixed) to university lecturers. Our model is capable of generating a calendar that maximizes faculty expectations. The formulated problem is in the form of a multi-objective problem that optimal makes decisions require the trade-off presence of trade-offs between two or more conflicting objectives. To solve this, we use the Compromise Programming approach to multi-objective programming. We then proposed the new version of the Genetic Algorithm to solve the introduced model. Finally, the model and algorithm tested with real scheduling data collected at the Computing Fundamental Department, FPT University, Hanoi, Vietnam.

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.

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.

The report details out programming approach for automating warehouse using Answer Set Programming.

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

One of the non-linear phenomena that affect high bandwidth and long reach communication systems is the non-linear phenomenon called four-wave mixing (FWM). Unfortunately, the simulation of such systems aiming to obtain their design parameter limitations require more time as the number of channels increases. In this paper, we propose a new high-performance computational model to obtain optimal design parameters in a multi san Dense Wavelength Division Multiplexing (DWDM) system, limited by FWM and the intrinsic Amplified Spontaneous Emission (ASE) noise of optical amplifiers employed in each segment. The simulation in this work provides a complete optical design characterization and compares the efficiency and speed improvement of the proposed parallelization model versus a previous sequential model. Additionally, an analysis of the computational complexity of parallel model is presented, where two parallel implementations are used. First, Open Multi−Processing (OpenMP), based on the use of a central, multi-core processing unit is used and secondly the Compute Unified Device Arquitecture (CUDA), which is based on the use of graphics processing unit. Results show that parallelism improves to up to 40 times the performance of the simulation when nested parallelization with CUDA is used, over de sequential method and up to 6 times compared with the implementation with OpenMP using 12 processors. Within our parallel implementation, it is possible to simulate with an increased number of channels, that was unpractical in the sequential simulation.

Introducing children to sustainable and healthy school meals can promote a long-term dietary shift to lower climate impact and improve population health. The aim of the OPTIMAT study was to optimize meals for minimum deviation from the current food supply while reducing greenhouse gases and ensuring nutritional adequacy without increasing cost. Optimized menus were tested in four primary schools in Sweden and effects on daily food consumption and waste evaluated. Pupils received their usual menu plan for three weeks and then the isocaloric optimized menu plan for another three weeks. Nutritional recommendations for a school lunch and a maximum of 500 grams of CO2eq/meal were applied as constraints during linear programming. Pulses, Cereals, Meat and Eggs increased, while Fats and Oils, Dairy, Sauces and Seasonings decreased. The amount of ruminant meat was reduced in favor of other meat products. The new menu was 28% lower in greenhouse gas emissions and slightly less costly than the original. No significant changes in mean food consumption or plate waste were found in interrupted time series analysis between the two periods. This pragmatic approach for combining linear optimization with meal planning could accelerate sustainable development of the meal sector in Sweden and abroad.

In the manufacturing industry, orders are typically scheduled and delivered through batches, and the probability of machine failure under high-load operation is high. On this basis, we focus on a single machine batch scheduling problem with a maintenance interval (SMBSP-MI). The studied problem is expressed by three-field representation as 1|B,MI|\sum{F_j+\mu}m, and the optimization objective is to minimize total flow time and delivery costs. Firstly, 1|B,MI|\sum{F_j+\mu}m is proved to be NP-hard by Turing reduction. Secondly, shortest processing time (SPT) order is shown the optimal scheduling of SMBSP-MI, and a dynamic programming algorithm based on SPT (DPA-SPT) with the time complexity of O(n^3T_1) is proposed. A small-scale example is designed to verify the feasibility of DPA-SPT. Finally, DPA-SPT is approximated to a fully-polynomial dynamic programming approximation algorithm based on SPT (FDPAA-SPT) by intervals partitioning technique. The proposed FDPAA-SPT runs in O(\frac{n^5}{\varepsilon^2})\ time with the approximation (1+\varepsilon).

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.

The ASCE-EWRI reference evapotranspiration (ETo) equation is recommended as a standardized method for reference crop ETo estimation. However, various climate data as input variables to the standardized ETo method are considered limiting factors in most cases and restrict the ETo estimation. This paper assessed the potential of different machine learning (ML) models for ETo estimation using limited meteorological data. The ML models used to estimate daily ETo included Gene Expression Programming (GEP), Support Vector Machine (SVM), Multiple Linear Regression (LR), and Random Forest (RF). Three input combinations of daily maximum and minimum temperature (Tmax and Tmin), wind speed (W) with Tmax and Tmin, and solar radiation (Rs) with Tmax and Tmin were considered using meteorological data during 2003–2016 from six weather stations in the Red River Valley. To understand the performance of the applied models with the various combinations, station, and yearly based tests were assessed with local and spatial approaches. Considering the local and spatial approaches analysis, the LR and RF models illustrated the lowest rate of improvement compared to GEP and SVM. The spatial RF and SVM approaches showed the lowest and highest values of the scatter index as 0.333 and 0.457, respectively. As a result, the radiation-based combination and the RF model showed the best performance with higher accuracy for all stations either locally or spatially, and the spatial SVM and GEP illustrated the lowest performance among models and approaches.

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.

The following series of Articles about a contextual system-theory, with focus on biological systems, shall give a guideline of how to explore complex systems. It is written not only for scientists, and therefore I will try to describe part of the way of understanding as an intuitive approach. This approach will also help scientists to get a deeper understanding of complexity. Some definitions and rules may seem at first simple and obvious. If practiced in a multidimensional complex system, one will see the difficulties. Even without mathematization or computer modeling the multidimensional sub space, which we try to describe phenomenologically for approaching the understanding of this Subsystem, will need a lot of training. Easily we get lost in the multidimensional world. Some of the chapters here and in the following publications of this series are written for specialists, but it will always come back to the essence of a phenomenological description. Concepts like Symbolic programming, Object oriented modeling, simulation and optimizing as well as experimental and mathematical approaches are the described tools to unpuzzle a complex scenario.

Configuration techniques have been used in several fields, such as the design of business process models. Sometimes these models depend on the data dependencies, being easier to describe "what" has to be done instead of "how". Configuration models enable to use a declarative representation of business processes, deciding the most appropriate work-flow in each case. Unfortunately, data dependencies among the activities and how they can affect the correct execution of the process, has been overlooked in the declarative specifications and configurable systems found in the literature. In order to find the best process configuration for optimizing the execution time of processes according to data dependencies, we propose the use of Constraint Programming paradigm with the aim of obtaining an adaptable imperative model in function of the data dependencies of the activities described declarative.

A heat pump with thermal storage system is a system that operates a heat pump during night-time using inexpensive electricity; during this time, the generated thermal energy is stored in a thermal storage tank. The stored thermal energy is used by the heat pump during daytime. Based on a model of a dual latent heat storage tank and a heat pump, this study conducts control simulations using both conventional and advanced methods for heating in a building. Conventional methods include the thermal storage priority method and the heat pump priority method, while advanced approaches include the region control method and the dynamic programming method. The heating load required for an office building is identified using TRNSYS, used for simulations of various control methods. The thermal storage priority method shows a low coefficient of performance (COP), while the heat pump priority method leads to high electricity costs due to the low use of thermal storage. In contrast, electricity costs are lower for the region control method, which operates using the optimal part load ratio of the heat pump, and for dynamic programming, which operates the system by following the minimum cost path. According to simulation results for the winter season, the electricity costs using the dynamic programming method are 17% and 9% lower than those of the heat pump priority and thermal storage priority methods, respectively. The region control method shows results similar to the dynamic programming method with respect to electricity costs. In conclusion, advanced control methods are proven to have advantages over conventional methods in terms of power consumption and electricity costs.

Biodiversity conservation questions human practices towards biodiversity and, therefore, largely conflicts with ordinary societal aspirations. Decisions on the location of protected areas, one of the most convincing conservation tools, reflect such a competitive endeavor. Operations Research (OR) brings a set of analytical models and tools capable of resolving the conflicting interests between ecology and economy. Recent technological advances have boosted the size and variety of data available to planners, thus challenging conventional approaches bounded on optimized solutions. New models and methods are requested to use such a massive amount of data in integrative schemes addressing a large variety of concerns. Here, we provide an overview on the past, present and future challenges that characterize spatial conservation models supported by OR. By enlarging the spatial, temporal, taxonomic and societal horizons of biodiversity conservation planners navigate around multiple bio-socioeconomic equilibria and are able to decide on cost-effective strategies to improve biodiversity persistence.

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.

The goal of this paper is to propose a dual version of the direct cosine simplex algorithm (DDCA) for general linear problems. Unlike the two-phase and the big-M methods, our technique does not involve artificial variables. Our technique solves the dual Klee-Minty problem in two iterations and solves the dual Clausen’s problem in four iterations. The utility of the proposed method is evident from the extensive computational results on test problems adapted from NETLIB. Preliminary results indicate that this dual direct cosine simplex algorithm (DDCA) reduces the number of iterations of two-phase method.

In this paper, we generalize the problems of finding simple polygons with the minimum area, maximum perimeter and maximum number of vertices so that they contain a given set of points and their angles are bounded by $\alpha+\pi$ where $\alpha$ ($0\leq\alpha\leq \pi$) is a parameter. We also consider the maximum angle of each possible simple polygon crossing a given set of points, and derive an upper bound for the minimum of these angles. The correspondence between the problems of finding simple polygons with the minimum area and maximum number of vertices is investigated from a theoretical perspective. We formulate the three generalized problems as nonlinear programming models, and then present a Genetic Algorithm to solve them. Finally, the computed solutions are evaluated on several datasets and the results are compared with those from the optimal approach.

Widely used in hydraulics, the Colebrook equation for flow friction relates implicitly to the input parameters; the Reynolds number, Re and the relative roughness of inner pipe surface, ε/D with the output unknown parameter; the flow friction factor, λ; λ=f(λ, Re, ε/D). In this paper, a few explicit approximations to the Colebrook equation; λ≈f(Re, ε/D), are generated using the ability of artificial intelligence to make inner patterns to connect input and output parameters in explicit way not knowing their nature or the physical law that connects them, but only knowing raw numbers, {Re, ε/D}→{λ}. The fact that the used genetic programming tool does not know the structure of the Colebrook equation which is based on computationally expensive logarithmic law, is used to obtain better structure of the approximations which is less demanding for calculation but also enough accurate. All generated approximations are with low computational cost because they contain a limited number of logarithmic forms used although for normalization of input parameters or for acceleration, but they are also sufficiently accurate. The relative error regarding the friction factor λ, in best case is up to 0.13% with only two logarithmic forms used. As the second logarithm can be accurately approximated by the Padé approximation, practically the same error is obtained also using only one logarithm.

In this paper, a two-stage stochastic programming modelling is proposed to design a multi-period, multistage, and single-commodity integrated forward/reverse logistics network design problem under uncertainty. The problem involves both strategic and tactical decision levels. The first stage deals with strategic decisions, which are the number, capacity, and location of forward and reverse facilities. At the second stage tactical decisions such as base stock level as an inventory policy is determined. The generic introduced model consists of suppliers, manufactures, and distribution centers in forward logistic and collection centers, remanufactures, redistribution, and disposal centers in reverse logistic. The strength of proposed model is its applicability to various industries. The problem is formulated as a mixed-integer linear programming model and is solved by using Benders’ Decomposition (BD) approach. In order to accelerate the Benders’ decomposition, a number of valid inequalities are added to the master problem. The proposed accelerated BD is evaluated through small-, medium-, and large-sized test problems. Numerical results reveal that proposed solution algorithm increases convergence of lower bound and upper bound of BD and is able to reach an acceptable optimality gap in a convenient CPU time.

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

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.

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.

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.

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.

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.

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.

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.

Remaining service life (RSL) of pavement, as a sign of future pavement performance, has always received growing attention from pavement engineers. The RSL describes the time from the moment of pavement inspection until such a time when a major repair or reconstruction is required. The conventional approach to determining RSL involves using non-destructive tests. These tests, in addition to being costly, interfere with traffic flow and compromise users' safety. In this paper, surface distresses of pavement have been used to estimate the pavement’s RSL in order to eliminate the aforementioned problems and challenges. To implement the proposed theory, 105 flexible pavement segments were taken from Shahrood-Damghan Highway (Highway 44) in Iran. For each pavement segment, the type, severity, and extent of surface damage and pavement condition index (PCI) were determined. The pavement RSL was then estimated using non-destructive tests include Falling Weight Deflectometer (FWD) and Ground Penetrating Radar (GPR). After completing the dataset, the modeling was conducted to predict RSL using three techniques include Support Vector Regression (SVR), Support Vector Regression Optimized by Fruit Fly Optimization Algorithm (SVR-FOA), and Gene Expression Programming (GEP). All three techniques estimated the RSL of the pavement by selecting the PCI as input. The Correlation Coefficient (CC), Nash-Sutcliffe efficiency (NSE), Scattered Index (SI), and Willmott’s Index of agreement (WI) criteria were used to examine the performance of the three techniques adopted in this study. In the end, it was found that GEP with values of 0.874, 0.598, 0.601, and 0.807 for CC, SI, NSE, and WI criteria, respectively, had the highest accuracy in predicting the RSL of pavement.

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.