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

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.

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

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

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.

Our natural language approach concerns syntactic analysis using a dedicated Javascript library - wink-nlp - and semantic analysis based on Prolog programming language, facilitated by another Javascript library - tau-prolog - that allows defining logical programs, declaring rules and checking for goals inside Javascript language. Firstly, our program splits the original text into sentences, than into tokens and identifies each part of the sentence, dynamically maps entities into Prolog rules, then check the spelling accordingly to the Definite Clause Grammar (DCG) by querying the pre-defined program for initial goals (the sentence itself). Basically, we let the parser infer its own rules from the syntactic point of view, then check the grammar from a semantic perspective against the DCG inside the same work flow or pipeline of steps.The provided article combine the usage of wink-nlp and tau-prolog packages for natural language processing (NLP) and understanding (NLU), demonstrates the need of a supplementary logic layer based on beta reductions and provide a method to convert lambda abstractions into arrow Javascript functions.

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

The purpose of this study was to examine the impact of fructose consumption during the peri-pubertal period on the later onset of metabolic syndrome in rats. Additionally, the study sought to explore the potential of moderate-intensity physical training as a non-pharmacological approach to mitigate the fructose effects. Male rats, 30 days old, received 10% fructose, and were submitted to concomitant moderate-intensity training until 60 days old. They were divided into 4 groups: sedentary control (SC), sedentary fructose (SF), trained control (TC), and trained fructose (TF). Fructose consumption mainly affected adult animals, resulting in glucose intolerance, increased periepididymal fat, and increased total cholesterol, triglycerides, and insulin levels. Furthermore, these rats exhibited reduced sympathetic nerve activity. The moderate running led to a decrease in periepididymal and retroperitoneal adipose tissue, as well as a reduction in total cholesterol and improved glucose tolerance. Peri-pubertal rats that received combination treatments exhibited lower levels of glucose and insulin during an intraperitoneal glucose tolerance test. The results indicate that 10% fructose supplementation during peripuberty predisposes to metabolic syndrome in adulthood. However, simultaneous moderate-intensity exercise training attenuates these effects and induces positive changes in glycemic homeostasis, lipid metabolism, and autonomic nervous system activity.

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

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.

RBF networks are used in a variety of real-world applications such as medical data or signal processing problems. The success of these parametric models lies in the successful adaptation of their parameters using efficient computational techniques. In the current work, a method of adjusting the parameters of these networks using Grammatical Evolution is presented. Grammatical Evolution will be used to successfully discover the most promising range of parameter values and then the training of the parameter set will be achieved using a Genetic Algorithm. The new method was applied to a wide range of data fitting and classification problems, and the results were more than promising.

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.

Routing a person through a traffic network presents a tension between selecting a fixed route that is easy to navigate and selecting an aggressively adaptive route that minimizes the expected travel time. We propose to create non-aggressive adaptive routes in the middle-ground seeking the best of both these extremes. Specifically, these routes still adapt to changing traffic conditions, however we limit the number of adjustments made in the route. This improves the user experience, by providing a continuum of options between saving travel time and minimizing navigation. We design strategies to model single and multiple route adjustments, and investigate enumerative techniques to solve these models. To alleviate the intractability with handling real-life traffic data, we develop efficient algorithms with easily computable lower and upper bounds. We finally present computational experiments highlighting the benefits of limited adaptability in terms of reducing the expected travel time.

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.

Aiming at the decision-making problem in the anti-torpedo hydroacoustic countermeasure scenarios, this paper proposes an intelligent adversarial strategy based on the game theory. By discretizing the strategy space of both sides, a matrix game model is established with the payoff characterized by the capture probability of attacking torpedo. An improved simplex algorithm is developed to get the mixed-strategy Nash equilibrium of the game model, by which preferred avoiding strategies can be obtained to minimize the risk of being captured by the attacking torpedo. Considering the urgent stage when the sonar equipment detects the torpedo without identification of its attacking direction, the proposed intelligent strategy provides an probabilistic overview on the countermeasure scenarios, which could improve the success capability of surface warships for the anti-torpedo cases.

The results of applying drilling engineering tools in planned deviated and horizontal wells of oil and gas condensate fields have been examined. The basis for the implementation of a comprehensive approach was the information obtained from drilling horizontal wells in the West and East Siberia, Volga-Ural region, and Iraqi Kurdistan. A synthetic model is considered as an example of the data, incorporating geomechanical and geological properties. As a result of the conducted audit of the geomechanical model and drilling process, the methodologies used were further developed to obtain optimal drilling fluid densities, aiming to prevent cavity formation on well walls, hydraulic fractures, and other related issues. The implementation of the Python programming language was introduced in the stages of geomechanical model preparation, resulting in a time acceleration of up to 20%. During the pre-drilling stage, technological operations were synchronized with the geomechanical model, increasing the involvement of process participants through the synchronization of knowledge areas. The interrelation between drilling technology, drilling parameters, properties of flushing fluids, and rock stability analysis was established, ensuring a 5% increase in construction speed (through NPT reduction and modification of existing tools and technological operations) and accident-free drilling of complex deviated and horizontal wells, provided that the recommended drilling parameters are followed.

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

This paper discusses about the quantum energy levels of muonic hydrogen considering only Coulomb interaction. The computational analysis in this paper will help the reader get a good understanding of how different a muonic hydrogen is from its electronic counterparts. Energy eigenvalues are calculated by numerical method and the probability density distribution of muon around the nucleus is plotted for different quantum states using special functions. The code is written in python. A comparative study of emission spectra between the muonic hydrogen and hydrogen has also been discussed.

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.

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

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

Alum sludge is a byproduct of water treatment plants and its use as a soil stabilizer has gained increasing attention due to its economic and environmental benefits. Its application has been shown to improve the strength and stability of soil, making it suitable for various engineering applications. However, to go beyond just measuring the effects of alum sludge as a soil stabilizer, this paper explores the use of artificial intelligence (AI) methods to predict the California bearing ratio (CBR) of soils stabilized with alum sludge. Three AI methods, including two black box methods (artificial neural network and support vector machines) and one grey box method (genetic programming), were used to predict CBR based on a database with nine input parameters. The results showed that all three AI models were able to predict CBR with good accuracy, with coefficient of determination (R2) values ranging from 0.94 to 0.99 and mean absolute error (MAE) values ranging from 0.30 to 0.51. In a novel approach, the genetic programming method was used to produce an equation to estimate CBR, which included seven inputs and accurately predicted CBR. The analysis of sensitivity and importance of parameters showed that the number of hammer blows for compaction was the most important parameter, while the parameters for maximum dry density of soil and mixture were the least important. This study suggests that AI methods can effectively predict the performance of alum sludge as a soil stabilizer, and the proposed equation using genetic programming can be a useful tool for predicting CBR.

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.

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

To assist Java programming learning of novice students, we have developed the web-based Java programming learning assistant system (JPLAS). JPLAS provides several types of exercise problems to cultivate code reading/writing skills at various levels. In JPLAS, the code writing problem (CWP) asks a student to write a source code that will pass the test code given in the assignment where the correctness is verified by running them on JUnit. In this paper, to reduce the teacher load at marking process, we present the answer code validation program that verifies all the source codes from a lot of students for each assignment at a time and reports the number of passing tests for each source code in the CSV file. Besides, to test a source code with various input data, we implement the test data generation algorithm that identifies the data type, generates a new data, and replaces it for each test data in the test code. Furthermore, to verify the correctness of the implemented procedure in the source code, we introduce the intermediate state testing in the test code. For evaluations, we applied the proposal to source codes and test codes in a Java programming course in Okayama university, Japan, and confirmed the validity and effectiveness.

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.

Establishing an effective evaluation model to analyze the actual environmental level of the multi-indicator systems is an urgent challenge. However, due to the complexity of the environmental system, the factors that determine the practical system are usually interrelated. To solve this problem, many methods have been proposed and verified. However, the disadvantage of unreasonable weight determination and only single-indicator assessment limits the practical application of these analysis methods. Here, we established an optimized entropy weight model and integrate it with the fuzzy comprehensive evaluation (FCE) method to quantify the complex environmental system. By introducing the linear programming method into the entropy weight solution, we can obtain high accuracy weight values and strong resistance to extreme data. Theoretical and simulation results demonstrate that our method can enhance the precision of weight calculation and evaluation results for multi-factor systems. Our work develops an effective method to quantify the complex environment system comprehensively and is significant to real applications of evaluation method.

In engineering practice, one can often encounter issues related to optimization where the goal is to minimize material consumption, minimize stresses or deflections of the structure. In most cases, these issues are addressed with finite element analysis software and simple optimization algorithms. However, in the case of optimization of certain structures, it is not co straightforward. An example of such constructions are bubble deck ceilings, where in order to reduce the dead weight, air cavities are used, which are regularly arranged over the entire surface of the ceiling. In the case of these slabs, the flexural stiffness is not constant in all its cross-sections, which means that the use of structural finite elements (plate or shell) for static calculations is not possible, and therefore the optimization process becomes more difficult. The paper presents a minimization procedure of the weight of bubble deck slabs using numerical homogenization and sequential quadratic programming with constraints. Homogenization allows to determine the effective stiffnesses of the floor, which in the next step are sequentially corrected by changing the geometrical parameters of the floor and voids in order to achieve the assumed deflection. The presented procedure allows to minimize the use of material in a quick and effective way by automatically determining the optimal parameters describing the geometry of the bubble deck floor cross-section.

This paper presents a cascade predictive control structure based on the field-oriented control (FOC) in the dq rotor reference frame for the synchronous reluctance machine (SynRM). The constant d-axis current control strategy was used and thus, the electromagnetic torque was directly controlled by the q-axis current. Because the model of the two axes currents from the inner loop is a coupled non-linear multivariable one, to non-interaction linear control the two currents, their decoupling was achieved through feedforward components. Following the decoupling, two independent monovariable linear systems resulted for the two currents dynamics that were controlled using model predictive control (MPC) algorithms, considering their ability to automatically handle the state bounds. The most important bounds for SynRM are the limits imposed on currents and voltages, which in the dq plane correspond to a circular limit. To avoid computational effort, linear limitations were adopted through polygonal approximations, resulting in rectangular regions in the dq plane. For the outer loop that controls the angular speed with a constrained MPC algorithm, as plant was considered the q-axis current closed loop dynamics and the torque linear equation. To evaluate the performances of the proposed cascade predictive control structure, a simulation study using MPC controllers versus PI ones was conducted.

Since the release of ChatGPT, numerous studies have highlighted the remarkable performance of ChatGPT, which often rivals or even surpasses human capabilities in various tasks and domains. However, this paper presents a contrasting perspective by demonstrating an instance where human performance excels in typical tasks suited for ChatGPT, specifically in the domain of computer programming. We utilize the IEEExtreme Challenge competition as a benchmark — a prestigious, annual international programming contest encompassing a wide range of problems with different complexities. To conduct a thorough evaluation, we selected and executed a diverse set of 102 challenges, drawn from five distinct IEEExtreme editions, using three major programming languages: Python, Java, and C++. Our empirical analysis provides evidence that contrary to popular belief, human programmers maintain a competitive edge over ChatGPT in certain aspects of problem-solving within the programming context. In fact, we found that the average score obtained by ChatGPT on the set of IEEExtreme programming problems is 3.9 to 5.8 times lower than the average human score, depending on the programming language. This paper elaborates on these findings, offering critical insights into the limitations and potential areas of improvement for AI-based language models like ChatGPT.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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