Problem solving is one of the most important components of the human cognition that affects for ages the progress of the human society. Mathematical modelling is a special type of problem solving concerning problems related to science or everyday life situations. The present study is a review of the author’s earlier works on problem solving and mathematical modelling from the scope of Education. Its real goal is that it presents in a systematic way and in a few pages only the results of many years research on the subject. This helps the reader to get a comprehensive idea about a very important topic belonging to the core of Mathematics Education, which is very useful to those wanting to study deeper the subject and get directions for further research in the area.

In this article, many experimental similarities between electromagnetic fields (which are applied in systems of electrons, atoms, and liquids) and strong interaction fields (which are applied in systems of quarks, nucleons, and nuclei) are reviewed. The currently accepted theories describing electromagnetic fields differ fundamentally from those describing strong fields. Therefore, the many similarities are quite surprising, and some are not adequately explained even today. Several such unexplained similarities are listed among the top open problems in particle physics, such as the “EMC effect,” the “proton spin crisis,” and the “strong CP problem.” This paper highlights, for the first time, the underlying common characteristics of these problems, potentially offering valuable contribution to future explanations.

We solve the problem of Apollonius by applying the Lorentz transformation within the frame- work of special relativity to go to a frame of simultaneity, where the solutions are the circum- center. We transform back to get the solutions in a general frame. We show that the solutions in a general frame are the foci of the ellipse going through the centers of the given 3 circles.

The Fuzzy Transportation Problem (FTP) represents a significant extension of the Classical Transportation Problem (TP) by introducing uncertainly and imprecision into the parameters involved. Various algorithms have been proposed to solve the FTP, including fuzzy linear programming, metaheuristic algorithms and fuzzy mathematical programming techniques combined with Artificial Neural Networks. This paper presents the application of Trigonometric Acceleration Coefficients-PSO (TrigAc-PSO), a variation of the Classical Particle Swarm optimization algorithm, which is an innovative algorithm originally developed for solving the TP. TrigAC-PSO, has demonstrated remarkable success in optimizing various problem domains in crisp environments.

Generative artificial intelligence tools are flourishing across various sciences, particularly in the educational domain. ChatGPT, with its versions 3.5 and 4.0, stands out for its multilingual capabilities, catering to both students and educators. This research aimed to evaluate the performance differences between these versions, and importantly, to compare the accuracy of ChatGPT's responses in English versus Arabic. In our study, we presented ChatGPT with 39 chemistry problems related to 6th-7th grade curriculum, including twenty-five open questions and fourteen multiple-choice questions. Each response was categorized as accurate, partially accurate, or inaccurate. Our analysis, focused on trends across versions and languages, revealed significant enhancements in version 4.0, particularly in its ability to process Arabic. However, despite these improvements, our findings indicate that responses in English consistently outperformed those in Arabic in terms of accuracy. In light of this discrepancy, we suggest that ChatGPT either incorporates additional Arabic databases into its training regimen or develops a code that adopts the following strategy to ensure more accurate responses in science education: questions should first be translated from Arabic to English, addressed, and then retranslated into Arabic before being presented to the user. This approach takes advantage of the greater accuracy of responses in English to benefit Arabic-speaking users, and it may also improve outcomes for speakers of other languages who experience less precise answers in the fields of chemistry or science education.

This paper aims to outline the effectiveness of modern universal gate quantum computers when utilizing different configurations to solve the B-SAT(Boolean Satisfiability) problem. The quantum computing experiments are performed using Grover’s Search algorithm to find a valid solution. The experiments are performed under different variations to demonstrate their effects on the results. Changing the number of shots, qubit mapping, and using a different quantum processor are all among the experimental variables. The study also branches into a dedicated experiment highlighting a peculiar behavior that IBM quantum processors exhibit when running circuits with a certain number of shots.

Preventive Maintenance (PM) is a periodic maintenance strategy, which has great results for devices in extending their life, increasing productivity, and most importantly, help avoid unexpected breakdowns and their costly consequence. A preventive maintenance scheduling (PMS) is determining the time for carrying out PM, and it represents a sensitive issue in terms of impact on production if the time for the PM process is not optimally distributed. In this study, hybrid heuristic methods were used to solve the PMS problem, as genetic algorithm and Tabu research were adopted. The optimal solution was reached in a short time compared to previous studies in which optimal methods were used, integer programming and nonlinear integer programming. Also, sensitivity analysis was applied to measure the robustness and strength of the method used, where an optimal solution was obtained for all experiments and in record time. This method can be used for power plants in privet or public sectors, to generate an optimal PMS, to save money, and to avoid water or electricity cuts.

Proposed article deals with analyses on trends of problem-solving robotic applications in manu-facturing, especially in transportations and manipulations. Intelligent agent-based manufacturing systems with robotic agents are observed. Intelligent core of such units must be able to propose the plan of problem-solving in form of strategy. The logical model of adaptive strategies planning for intelligent robotic system is described in form of predicates with presentation of data processing on base of set theory descriptions. Dynamic structure of workspace and possible change of goals are considered as reasons for functional strategies adaptation. Proposed formal descriptions are sup-ported by model of mobile robotic platform, acting in warehouse.

The development of artificial intelligence systems assumes that a machine can independently generate an algorithm of actions or a control system to solve the tasks. To do this, the machine must have a formal description of the problem and possess computational methods for solving it. The article deals with the problem of optimal control, which is the main task in the development of control systems, insofar as all systems being developed must be optimal from the point of view of a certain criterion. However, there are certain difficulties in implementing the resulting optimal control modes. The paper considers an extended formulation of the optimal control problem, which implies the creation of such systems that would have the necessary properties for its practical implementation. To solve it, an adaptive synthesized optimal control approach based on the use of numerical methods of machine learning is proposed. The method moves the control object, optimally changing the position of the stable equilibrium point in the presence of some initial position uncertainty. As a result, from all possible synthesized controls, he chooses one that is less sensitive to changes in the initial states. As an example, the optimal control problem of quadcopter with complex phase constraints is considered. To solve this problem? according to the proposed approach, the control synthesis problem is firstly solved to obtain a stable equilibrium point in the state space by a machine learning method of symbolic regression. After that optimal positions of the stable equilibrium point are searched according to source functional from the optimal control problem by particle swarm optimization algorithm. It is shown that such approach allows generating the control system automatically by computer basing on the formal statement of the problem and then directly implementing it onboard as far as they have already had a stabilization system inserted.

This paper proposes an interpretable geometry solution based on the formal language set of text and diagram. Geometry problems are solved by machines, which still poses challenges in natural language processing and computer vision. Significant progress promotes existing methods in the extraction of geometric formal languages. However, the neglect of the graph structure information in the formal language and the lack of further refinement of the extracted language set can lead to the poor effect of the theorem prediction and affect the accuracy in problem solving. In this paper, the formal language graph is constructed by the extracted formal language set and used to theorem prediction by graph convolutional network. So as to better extract the relationship set of diagram elements, an improved diagram parser was proposed. The test results indicate that the improved method has good results in solving the problem with interpretability geometry.

The minimum dominating tree (MDT) problem consists of finding a minimum weight sub-graph from an undirected graph, such that each vertex not in this sub-graph is adjacent to at least one of the vertices in it, and the sub-graph is connected without any ring structures. This paper presents a Dual Neighborhoods Search (DNS) algorithm for solving the MDT problem, which integrates several distinguishing features, such as two neighborhoods collaboratively working for optimizing the objective function, a fast neighborhood evaluation method to boost the searching effectiveness, and several diversification techniques to help the searching process jump out of the local optimum trap thus obtaining better solutions. DNS improves the previous best-known results for 4 public benchmark instances while providing competitive results for the remaining ones. Several ingredients of DNS are investigated to demonstrate the importance of the proposed ideas and techniques.

In this paper, a new multi parameter iterative algorithm is proposed to address the PageRank problem based on the multi-splitting iteration method described by Gu et al . The proposed method in each iteration needs to solve two linear subsystems by splitting the coefficient matrix, therefore, we consider inner and outer iteration to find the approximate solutions of these linear subsystems. It can be shown that the iterative sequence generated by the multi parameter iterative algorithm finally converges to the PageRank vector when the parameters satisfy the certain conditions. Numerical experiments show that the proposed algorithm has better convergence and numerical stability than the existing algorithms.

Wicked problems, such as climate change, systemic poverty, and healthcare inequalities, rep- resent the most pressing and intractable challenges facing society today. We propose a novel approach that leverages complex systems theory as a comprehensive framework for understanding and tackling these challenges. By applying concepts such as state space analysis, attractors, and nonlinear dynamics, we offer a sophisticated toolkit for mapping the intricate web of interactions defining wicked problems and exploring potential interventions. Our approach moves beyond tradi- tional reductionist methods, embracing the inherent complexity and dynamism of these issues. We demonstrate how this framework can lead to more nuanced, adaptive, and effective strategies for addressing persistent societal problems. Despite the prevalence of wicked problems and the avail- ability of complex systems theory, practical applications of this approach remain uncommon. This paper aims to bridge this gap, illustrating the potential of complex systems theory to transform our engagement with intractable problems and pave the way for more robust, holistic solutions. By synthesizing insights from mathematics, physics, and social sciences, we present a transdisci- plinary approach that promises to revolutionize how we conceptualize and address society’s most challenging issues.

Backgrounds: The field of Artificial Intelligence (AI) has seen a major shift in recent years due to the development of new Machine Learning (ML) models such as Generative Pre-trained Transformer (GPT) and AI which are progressively becoming part our everyday lives. GPT has achieved previously unheard-of levels of accuracy in most computerized language processing tasks and their chat-based variations. Aim: The aim of this study was to investigate the problem-solving abilities of ChatGPT using two sets of verbal insight problems, with a known performance level established by a sample of human participants. Material and Methods: A total of 30 problems labelled as “practice problems” and “transfer problems”, as listed by Ansburg and Dominowski (2000), were administered to ChatGPT. The answers provided by ChatGPT received a score of "0" for each problem answered incorrectly and a score of "1" for each correct response, as per the correct solution specified in Ansburg and Dominowski's (2000) study. The highest score that could be attributed to both the practice and transfer problems was 15 out of 15. In order to compare ChatGPT performance to the performance to that of human subjects, the solution rate for each problem (based on a sample of 20 subjects) was used, as indicated by Ansburg and Dominowski (2000). Results: The study highlighted that ChatGPT can be trained in out-of-the-box thinking and demonstrated potential in solving verbal insight problems. The global performance of ChatGPT equalled the most probable outcome for the human sample in both practice problems and transfer problems as well as upon their combination. Additionally, ChatGPT answer combinations were among the 5% of most probable outcomes for the human sample both when considering practice problems and pooled problem sets. These findings demonstrate that ChatGPT performance on both set of problems was in line with the mean rate of success of human subjects, indicating that it performed reasonably well. Conclusions: The use of transformer architecture and self-attention in ChatGPT may have helped to prioritize inputs while predicting, contributing to its potential in verbal insight problem-solving. ChatGPT has shown potential in solving insight problems, thus highlighting the importance of incorporating AI in psychological research. However, it is acknowledged that open challenges still exist. Indeed, further research is needed to fully understand the capabilities and limitations of AI in insight problem-solving.

Research has shown that hands-on projects promote stem education, namely, via problem-solving. CanSat, literally 'satellite in a can', is a stem educational project promoted by the European Space Agency. This paper addresses this issue by researching this STEM project, which demonstrates how problem-solving can be achieved in secondary-level students within the framework of the CanSat. We use qualitative techniques of data collection and analysis. The results showed that students use sophisticated thinking strategies to process information within this interdisciplinary project: (a) cognitive testing, cognitive organization, cognitive regulation, and monitoring, in addition to computer language and physical–mathematical calculations, are cognitive and metacognitive behavior strategies revealed in the CanSat; (b) problem-solving was suggested as a specific model, where students’ higher cognitive and metacognitive ordering processes deepen in project development; (c) computational, lateral, or divergent and convergent thinking were detected as thinking types of students associated with and mobilized in the course of problem-solving, The findings of this research have practical implications for STEM education in space science. Hands-on projects using problem-solving are an essential strategy to promote STEM education. Additionally, they are a starting point to promote meaningful learning and new thinking types.

There is a long standing ‘two times problem’ in that a satisfactory reconciliation between the time of physics and that of psychology has not been realized. A partial solution to the past/present/future phenomenon has been successfully given by the Hartle information gathering and processing system (IGUS) view. That model IGUS robot is enhanced here for the entire ‘two times problem’ to deal with not only the temporal experiences of the flow of time but also those of manifest time. A dualistic robot is proposed which has a veridical system of temporal experiences that are compatible with various spacetime cosmologies. It also has an illusory system of corresponding temporal experiences. This dualistic IGUS robot was made possible by discovering temporal experience within the brain that correspond to those of physics. The dualistic theory suggests that the veridical system, as a result of evolution, begets the illusory system to enhance behavioral adaptation. Thus, there is just one fundamental physical time which the brain does, indeed, possess and then enhances with illusory counterparts. Therefore, there should no longer be a need to reify illusory temporal experiences as modern spacetime cosmologies tend to do. Physical time already resides within human time.

The present work concerns with presenting an explicit formula for new shifted wavelet (NSW) functions. Wavelet functions have many applications and advantages in both applied and theoretical fields. They are formulated with different orthogonal polynomials to construct new techniques for treating some problems in sciences, and engineering. A new important differentiation property of NSW in terms of NSW themselves is obtained and proved in this paper. Then it is utilized together with the state parameterization technique to find solution of optimal control problem (OCP) approximately. The suggested method converts the OCP into a quadratic programming problem, which can be easily determined on computer. As a result, the approximate solution closes with the exact solution even with a small number of NSW utilized in estimation. The error bound estimation for the proposed method is also discussed. Some test numerical examples are solved to demonstrate the applicability of the suggested method. For comparison, the exact known solutions against the obtained approximate results are listed in Tables.

In the intricate landscape of software development, the distinction between average and exceptional outcomes often hinges on the approach taken by the engineers involved. This paper explores the core aspects that characterize responsible and professional software engineering, emphasizing the importance of stakeholder engagement, innovative problem-solving, and adherence to standards and best practices. Through detailed real-life examples, we illustrate how professional engineers ensure the creation of robust, efficient, and adaptable software solutions. Additionally, the paper delves into advanced strategies for enhancing database security, including the implementation of Sealed Secrets in Kubernetes environments, continuous improvement, and future enhancements. The goal is to provide a comprehensive understanding of professional software engineering practices and their impact on delivering superior value to projects and organizations.

Complex problem-solving (CPS) tasks have become an increasingly popular tool for understand-ing and assessing cognitive ability. These tasks have been repeatedly shown to be predictors of academic and workplace success above and beyond traditional measures of general intelligence and fluid intelligence. To date, there has been little exploration of the underlying mechanisms that drive this additional predictive utility. In this study, we examined the role of a variety of non-cognitive personality and investment traits that could drive performance on CPS tasks. Adult participants (n = 152) were recruited via M-Turk and completed a battery of personality and in-vestment trait measures, a measure of general mental ability, and a 61-trial microworlds-style CPS task. Generalised linear mixed-effects models revealed a wide variety of personality and in-vestment traits influenced task performance above and beyond general mental ability. Specifical-ly, two clusters of traits emerged as important determinants of performance: one cluster that in-fluenced the capacity to deal with the introduction of system randomness (Conscientiousness and Extraversion) and one cluster that influenced the capacity to deal with the introduction of system delays (NFC, Learning Goal Orientation, and Intellect). These findings suggest that CPS tasks do capture more than just general mental ability and may be good predictors of academic and workplace success because they tap into both cognitive ability and the motivation and willingness to engage in cognitive exploration and mental effort.

Cutting and packing problems have been studied for decades and are of concern for a wide variety of industries to reduce costs and material utilization. This paper addresses the one-dimensional cutting stock problem, focusing on minimizing total stock usage. Procedures that address this problem include linear programming methods and metaheuristics. However, linear programming methods are limited to low-complexity instances, while most metaheuristics require extensive parameter tuning. In this paper, we develop a Petri-net model to construct cutting patterns. Using the reachability tree of the Petri net, the filtered beam search algorithm is implemented to find the best solution. Our algorithm is compared with the Least Lost Algorithm and the Generate & Solve algorithm over five datasets of instances. These algorithms share some characteristics with ours and have proven to be effective and efficient. Experimental results demonstrate that our algorithm effectively finds optimal solutions for both low and high-complexity instances. These findings confirm that Petri nets are suitable for modeling and solving the one-dimensional cutting stock problem.

To address the problem that it is easy to form coverage blind areas when wireless sensor networks are randomly deployed, an improved coverage optimization algorithm based on improved Salpa swarm Intelligent algorithm (ATSSA) is proposed for wireless sensor networks. Firstly, the pop-ulation is initialized using tent chaotic sequence to enhance the optimization ability of the algo-rithm. Secondly, the T-distribution mutation is added to the update formula of the leaders for improving the ability to jump out of the local optimal value. Finally, an adaptive formula for updating the position of the follower is proposed, which not only guarantees the local searching ability of the algorithm in the late iteration period, but also improves the global searching ability of the algorithm in the early iteration period. The experimental results show that ATSSA algorithm can improve the coverage of the wireless sensor networks and reduce deployment costs com-pared with other algorithms, when it is used in the wireless sensor networks.

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.

The connected vertex cover (CVC) problem is a variant of the vertex cover problem, which has many important applications, such as wireless network design, routing and wavelength assignment problem, etc. A good algorithm for the problem can help us improve engineering efficiency, cost savings and resources in industrial applications. In this work, we present an efficient algorithm GRASP-CVC (Greedy Randomized Adaptive Search Procedure for Connected Vertex Cover) for CVC in general graphs. The algorithm has two main phases, i.e., construction phase and local search phase. To construct a high quality feasible initial solution, we design a greedy function and a restricted candidate list in the construction phase. The configuration checking strategy is adopted to decrease the cycling problem in the local search phase. The experimental results demonstrate that GRASP-CVC is competitive with the other competitive algorithm, which validate the effectivity and efficiency of our GRASP-CVC solver.

The Fading Affect Bias (FAB) occurs in autobiographical memory when unpleasant emotions fade faster than pleasant emotions and the phenomenon appears to be a form of emotion regulation. As emotion regulation is positively related to problem-solving, the current study examined FAB in the context of problem-solving. In-person and online studies asked participants to provide basic demographics, describe their problem-solving abilities, and rate various healthy and unhealthy variables including emotional intelligence and positive problem-solving attitudes. Participants also completed an autobiographical event memory form for which they recalled and described 2 pleasant and 2 unpleasant problem-solving and non-problem-solving events and rated the initial and current affect and rehearsals for those events. We found a robust FAB effect that was larger for problem-solving events than for non-problem-solving events in Study 1 but not in Study 2. We also found that FAB was positively related to healthy variables, such as grit, and negatively related to unhealthy variables, such as depression. Moreover, many of these negative relations were inverted at high levels of positive problem-solving attitudes, and these complex interactions were partially mediated by talking rehearsals and thinking rehearsals.

The presented work shows that a force (electromagnetic or gravitational) field surrounding any material body is not limitless, but has the external and internal boundaries (radii). Understanding the fact of the existence of the field boundaries allows us to solve the problem of infinities that exists in electrodynamics. It is shown that there are two different electrostatic potentials: with the dimension of speed and with the dimension of the square of speed.

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.

The development of transport infrastructure is a key element of economic growth, social connectivity, and sustainable development. Many countries have historically underinvested in transport infrastructure, necessitating more efficient strategic planning in transport infrastructure investment projects implementation. This article addresses the selecting and scheduling of transport infrastructure projects, specifically within the context of drawing available resources from pre-allocated funds within a multi-annual budget investment program. The current decision-making process is largely based on expert judgment, lacking quantitative decision support methods. The authors propose a genetic algorithm as a decision-support tool that frames the problem as an NP-hard 0-1 multiple knapsack problem. The proposed genetic algorithm is unique for its matrix-encoded chromosomes, specially designed genetic operators, and a customized repair operator, which is implemented to address the large number of invalid chromosomes generated during the GA computation. The goal is to maximize the impact of allocated funds over a seven-year programming period, while respecting constraints specified by the funding authorities. In computational experiments, proposed GA is compared to an exact solution and is proved to be efficient in terms of quality of obtained solutions and computational time, highlighting its potential for enhancing strategic decision-making in transport infrastructure development.

This paper introduces a novel algorithm for solving the point-to-point shortest path problem in a static regular 8-neighbor connectivity (G8) grid. This algorithm can be seen as a generalization of Hadlock algorithm to G8 grids, and is shown to be theoretically equivalent to the relaxed A* (RA*) algorithm in terms of the provided solution's path length, but with substantial time and memory savings, due to a completely different computation strategy, based on defining a set of lookup matrices. Through an experimental study on grid maps of various types and sizes (1290 runs on 43 maps), it is proven to be 2.25 times faster than RA* and 17 times faster than the original A*, in average. Moreover, it is more memory-efficient, since it does not need to store a G score matrix.

This work presents a multi-start algorithm for solving the capacitated vehicle routing problem with two-dimensional loading constraints (2L-CVRP) allowing for the rotation of goods. Researches dedicated to graph theory and symmetry considered the vehicle routing problem as a classical application. This problem has complex aspects that stimulate the use of advanced algorithms and symmetry in graphs. The use of graph modeling of the 2L-CVRP problem by undirected graph allowed the high performance of the algorithm. The developed algorithm is based on metaheuristics such as the Constructive Genetic Algorithm (CGA), to construct promising initial solutions; a Tabu Search (TS), to improve the initial solutions on the routing problem; and a Large Neighborhood Search (LNS), for the loading subproblem. Although each one of these algorithms allowed to solve parts of the 2L-CVRP, the combination of these three algorithms to solve this problem was unprecedented in the scientific literature. In our approach, a parallel mechanism for checking the loading feasibility of routes was implemented using multi-threading programming to improve the performance. Additionally, memory structures, like hash-tables, were implemented to save time by storing and querying previously evaluated results for the loading feasibility of routes. For benchmarks, tests were done on well-known instances available in the literature. The results proved that the framework matched or outperformed most of the previous approaches. As the main contribution, this work brings higher quality solutions for large-size instances of the pure CVRP. This paper involves themes related to the symmetry journal, mainly complex algorithms, graphs, search strategies, complexity, graph modeling, and genetic algorithms. In addition, the paper especially focuses on topic-related aspects of special interest of the community involved in symmetry studies, such as, graph algorithms and graph theory.

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.

We present a modified characteristic finite element method that exhibits second-order spatial accuracy for solving convection-reaction-diffusion equations on surfaces. The temporal direction adopted backward-Euler method, while the spatial direction employed surface finite element method. In contrast to regular domains, it is observed that the point in the characteristic direction traverses the surface only once within a brief time. Thus, the good approximation of the solution in the characteristic direction holds significant importance for the numerical scheme. In this regard, Taylor expansion is employed to reconstruct the solution beyond the surface in the characteristic direction. The stability of our scheme is then proved. A comparison is made with an existing characteristic finite element method based on face mesh. Numerical examples are provided to validate the effectiveness of our proposed method.

Implementing High-Performance Computing to solve In-Memory Data Grid (IMDG)-based energy infrastructure resilience research problems in a heterogeneous environment presents a challenge to workflow management systems. Large-scale energy infrastructure needs multi-variant planning and tools to allocate and dispatch resources in IMDG taking into account the subject domain specificity, resource characteristics, and constraints and quotas for resource use. To that end, we propose a workflow management system using our Orlando Tools framework. To scale computing resources, we provide their integration and use corresponding software to determine key application parameters that can significantly impact the processed data size and the required number of allocated resources. We automated the IMDG cluster launch for the workflow executions. To demonstrate the advantage of our solution, we apply it to evaluate the resilience of the existing energy infrastructure model. Compared to similar approaches, our approach explores large infrastructures by modeling many simultaneously failed elements of different types up to the number of network elements. In terms of problem-solving efficiency and resource use, we achieve near-linear speedup with increasing the number of nodes of each resource.

Horses’ ability to adapt to new environments and to acquire new information plays an important role in handling and training. Social learning in particular would be very adaptive for horses as it enables them to flexibly adapt to new environments. In the context of horse handling, social learning from humans has been rarely investigated but could help to facilitate management practices. We assessed the impact of human demonstration on spatial problem-solving abilities in horses using a detour task. In this task, a bucket with a food reward was placed behind a double-detour barrier and horses (n = 16) received a human demonstration or no demonstration. Horses were allocated to two test groups of 8 horses each, which experienced the two treatments in a counterbalanced order. We found that horses did not solve the detour task faster with human demonstration. However, both test groups improved rapidly over trials. Our results suggest that horses prefer to use individual rather than social information when being confronted with a spatial problem-solving task.

Sharding shows great potential for extending the blockchain. The current challenge facing sharded blockchain technology lies in addressing the extended transaction confirmation times caused by isolated states between shards and unbalanced transaction allocation strategies. These factors contribute to an increase in cross-shard transactions and disproportionate shard workload, ultimately resulting in indefinite confirmation delays for cross-shard transactions. A critical priority for sharded blockchain systems is to conduct a comprehensive qualitative analysis to better understand and mitigate the prolonged transaction confirmation times. We introduce a Product-Form Queue Network (PFQN) model to address the transaction confirmation time problem in sharded blockchains and incorporate a new confirmation queue to more accurately simulate the actual transaction confirmation process in the blockchain. In addition, we provide a detailed quantitative analysis of the relationship between network load, consensus efficiency, and security in sharded blockchains, laying a theoretical foundation for achieving robustness and efficiency in sharded blockchains. This research not only contributes to addressing the scalability issues in sharded blockchains but also offers a new perspective for future research directions.

Dual generalized commutative quaternions have broad application prospects in many fields. Additionally, the matrix equation AXB = C has important applications in mathematics and engineering, especially in control systems, economics, computer science, and other disciplines. However, research on the matrix equation AXB = C over the dual generalized commutative quaternions remains relatively insufficient. In this paper, we derive the necessary and sufficient conditions for the solvability of the dual generalized commutative quaternion matrix equation AXB = C. Furthermore, we provide the general solution expression for this matrix equation, when it is solvable. Finally, a numerical algorithm and an example are provided to confirm the reliability of the main conclusions.

Abstract: The increased penetration of renewables in distribution power systems has motivated researchers to take significant interest in local energy transactions. The major goal of Local Energy Markets (LEM) is to promote the participation of small consumers in energy transactions and providing an opportunity for transactive energy systems. Such energy transactions in LEM are considered as a bi-level optimization problem in which all agents at upper and lower levels try to maximize their profits. But typical bi-level problem is very complex as it is inherently nonlinear, discontinued and strongly NP-hard. So, this article proposes the application of hybridized Cross Entropy Covariance Matrix Adaptation Evolution Strategy (CE-CMAES) to tackle such a complex bi-level problem of LEM. The proposed CE-CMAES secured the 1st rank in Testbed-2 entitled, “Bi-level optimization of end-users’ bidding strategies in local energy markets (LM)” at international competitions on Smart Grid Problems, held at GECCO 2020 and WCCI 2020. CE method is used for global exploration of search space and CMAES is used for local exploitation as its adaptive step-size mechanism prevents its premature convergence. A practical distribution system with renewable energy penetration is considered for simulation. The comparative analysis shows that the overall cost, mean fitness and Ranking Index (R.I) obtained from CE-CMAES are superior to those obtained from the state-of-the-art participated algorithms. Wilcoxon Signed Rank Statistical test also proves that CE-CMAES is statistically different from the tested algorithms.

Because of hyper complexity, difficulty to define, multiple stakeholders with conflicting perspectives, and lack of clear-cut solutions, wicked problems necessitate innovative and adaptive strategies. Operations Research has been a valuable tool for managers to make informed decisions for years. However, as we face increasingly complex and messy problems, it has become apparent that relying solely on either hard or soft OR approaches is no longer sufficient. We need to explore more innovative methodologies to address these wicked problems effectively. This study has bridged the research gap by proposing a structured process encompassing a subdivision-based problem structuring method for defining the wicked problem, a multi-attribute decision-making (MADM) for prioritizing sub-problems, and a hard OR technique, data envelopment analysis (DEA) for tackling one of the most critical sub-divisions. The proposed methodology, implemented in a case study, focuses on a higher education institution experiencing a decline in student admissions and involves five steps. First, a diverse group of stakeholders is formed to ensure comprehensive consideration of perspectives. Second, the wicked problem is defined, considering long-term consequences, multiple stakeholders, and qualitative stakeholder opinions. Third, a hierarchical structure is created to break down the wicked problem into manageable sub-problems. Fourth, a multi-criteria decision-making (MCDM) method prioritizes sub-problems. Finally, the sub-problems are addressed one by one using a combination of soft and hard OR tools. The findings highlight the benefits of integrating hard and soft OR approaches. The article concludes with reflections on the implications of using a combined OR approach to tackle wicked problems in higher education and beyond.

Partial Differential Equations (PDEs) constitute a fundamental framework for modeling various physical phenomena across diverse fields such as physics, engineering, and finance. Solving PDEs accurately and efficiently remains a significant challenge, particularly when dealing with complex systems or high-dimensional data. In this paper, we present a novel approach based on deep learning techniques to investigate the effective factors in solving PDEs. Our methodology leverages the expressive power of deep neural networks to learn and represent the underlying relationships between input parameters and the solutions of PDEs. By incorporating domain knowledge into the network architecture and training process, our approach aims to provide insights into the key factors influencing the solution of PDEs. We demonstrate the effectiveness of our method through numerical experiments on various PDEs, showcasing its capability to identify important features and improve predictive accuracy. Our findings suggest that deep learning techniques offer a promising avenue for understanding and analyzing the complex dynamics inherent in PDEs, paving the way for enhanced computational methods in scientific and engineering applications.

The applicability of the distance aggregation problem has attracted the interest of many authors. Motivated by this fact, in this paper we face the modular quasi-(pseudo-)metric aggregation problem. We characterize those functions that allow merging a collection of modular quasi-(pseudo-)metrics into a single one. Specifically, a description of such functions in terms of triangle triplets is given and, in addition, the relationship between modular quasi-(pseudo-)metric aggregation functions and modular (pseudo-)metric aggregation functions is discussed. Such characterizations are illustrated with appropriate examples. A few methods to construct modular quasi-(pseudo-)metrics are yielded. Several properties of modular quasi-(pseudo-)metric aggregation functions are explored and used to develop quick tests for discarding candidate functions to aggregate modular quasi-(pseudo-)metrics. Moreover, a characterization of those modular quasi-(pseudo-)metric aggregation functions that preserve modular quasi-(pseudo-)metrics is also provided. Furthermore, the relationship between modular quasi-(pseudo-)metric aggregation functions and quasi-(pseudo-)metric aggregation functions is studied in such a way that significative differences are displayed.

In the extended malfatti problem, the numbers of circles in the triangle are triangle numbers, because the tangency properties among the internal circles and 3 sides of the triangle have special type of structure. That is, the corner circle tangent to two sides of the triangle and two boundary circles, the boundary circles tangent to one side of the triangle and 4 other circles, and the inner circles always tangent to 6 other circles. The circles we find in extended general Malfatti’s problem has the property that the smallest radius and the largest radius for the circle has big difference. In this paper, we proposed algorithms to solve the problem that the tangency properties among circles and sides of triangle is not fixed, so that the number of circles in the triangle is not necessary a triangle numbers. The purpose of this change is try to find the radii of the circles in the triangle is within a small range.

Local polynomial smoother (LPS) is a weighted local least-squares nonparametric method. It provides a local Taylor series fit of the data at any location and can be directly used in a differential equation to provide a numerical scheme. In this article, we introduce this new nonparametric idea based on local polynomial smoother, for acquiring the numerical solution of the Bagley-Torvik fractional-order differential equations. Furthermore, this paper will present a numerical comparison with some methods, such as legendre operational matrix and pseudo-spectral method. The efficiency and accuracy of the LPS method are demonstrated by two numerical examples.

(1) Context: Cancer triggers significant changes in family dynamics. It is noteworthy that coping and problem-solving skills, particularly in situations involving cancer in children and adolescents, have not been adequately explored in the context of family adaptation. This study aims to analyze the effectiveness of family interventions in coping to improve problem-solving skills in parents and/or caregivers of children and adolescents during and after oncological treatment. (2) Methods: This is a scoping review following the recommendations of the Joanna Briggs Institute and the Systematic Reviews and Meta-Analyses Extension for Scoping Review (PRISMA-ScR), from 2014 to 2024, in the databases LILACS, CINAHL, SCOPUS, Web of Science, and PUBMED. (3) Results: Forty-five studies were eligible. Coping strategies were categorized as follows: (1) positive attitudes (including a sense of courage and hope, family support to enhance resilience, and future planning), (2) caregiver empowerment (involving acceptance of diagnosis, emotional distancing, and coping through religiosity), and (3) communication skills (encompassing professional communication, horizontal dialogue with healthcare teams, and sincere communication with friends and family). (4) Conclusions: Over time, families develop coping and problem-solving strategies that influence changes in family functioning patterns, aiding them in accepting, reinterpreting, and reframing ideas and feelings associated with neoplasia.

Natural laterite fixed-bed column intercalated with activated carbon prepared from Balanites ae-gyptiaca (BA-AC) was used for As(III) removal from an aqueous solution. Investigations were carried out to solve the problem of column clogging which appears during water percolation through the column. Experimental tests were conducted to evaluate the hydraulic conductivity and the effects of various parameters such as grain size, bed height, and initial As(III) concentra-tion. The breakthrough increased from 15 to 85 h with the increase of the bed height from 20 to 40 cm, and decreased from 247 to 32 h with the increase of initial As(III) concentration from 0.5 to 2 mg/L. The permeability data showed that the fixed-bed column filled with laterites layers intercalated with activated carbon performs much better than the non-intercalated adsorbent col-umn. The Bohart-Adams model showed that increasing the bed height induced a decrease in kAB and N0 values. The critical bed depths determined using the bed depth service time (BDST) mod-el for As(III) removal were 15.23 and 7.98 cm for 1 and 20% breakthrough, respectively. The re-sults showed that the new low-cost filtration system, based on laterite layers alternated with BA-AC layers, could be used for the treatment of arsenic-contaminated water.

The emerging working mode of coordinated trucks and drones has demonstrated significant practical potential in various fields, including logistics and delivery, intelligence surveillance reconnaissance, area monitoring, and patrol. The seamless collaboration between trucks and drones is garnering widespread attention in academia and has emerged as a key technology for achieving efficient and secure transportation. This paper provides a comprehensive and in-depth review of the research status on the routing problem for coordinated trucks and drones, covering aspects such as application background, cooperative modes, configurations, issues have been taken into consideration, and solution methodologies.

Student-centered active learning (SCAL) shifts the focus from the teacher to the student. Implementing SCAL requires the development of new forms of assessment beyond memorization and comprehension. This paper aims to demonstrate the effectiveness of SCAL by analyzing student performance at different cognitive levels. In flipped classrooms, students completed tasks with varying cognitive demands. The tests measured knowledge (level 1), comprehension (level 2), application (level 3) and analysis (level 4). This approach to assessment assesses not only the acquisition of content, but also skills that are critical to a health science student's future career. The results of expository learning were compared with student-centered collaborative learning in the Anatomy and Embryology I course over three academic years. Student opinions were collected through 326 anonymous Wooclap® surveys. No differences in performance were found for low cognitive level questions. However, SCAL significantly improved performance on higher cognitive level questions that required problem solving and application of knowledge. Despite the benefits of SCAL, it requires more effort from both teachers and students. The current assessment system, which measures the quality of teaching, penalizes this effort and requires teachers to believe strongly in the effectiveness of SCAL.

The augmenting commitment in the entrepreneurial learning process, both at academic and industry level, has led to new mechanisms and methodologies. Entrepreneurship literature has shown evidence of raising interest in the problem-based learning (PBL) methodology with regard to upcoming events from the surrounding learning context. This paper presents a Systematic Bibliographic Literature Review (SBLR) with respect to the application of PBL throughout distinct entrepreneurial processes either in higher education, or in industry. It aimed to identify relevant entrepreneurial opportunities for PBL. Bibliographic databases were searched for documents published between 2002 and May 2024 to categorize key topics discussed in the literature on PBL and entrepreneurship. The review process identified 142 empirical and non-empirical papers on entrepreneurship related PBL. Data analysis revealed diverse subthemes for PBL uses in entrepreneurship in both higher education institutions and industry. The research questions “What is the interplay of problem-based learning methodology with entrepreneurship?” guided the study. The central output of the research is the discovery of the varying uses of PBL to cope with diverse events arising within entrepreneurship context. Future research directions are suggested.

In previous papers we have derived equations of motion with radiation terms and proved the existence-uniqueness of periodic solution of the 3-body problem of classical electrodynamics. The number of equations of motion – 12 is more than the number of unknown functions – 9. It turns out that 9 equations are independent and the rest 3 ones are consequences of them. These three equations have a solution and they give the expressions for the energy of the moving particles. The main goal of the present paper is to estimate the energy of rounding about the nuclei particles and compare it with the values given by quantum mechanics.

In view of the fact that the field monitoring information can more intuitively and accurately reflect the stability state of slopes, this paper takes the warning threshold of slope deformation rate monitoring as the slope stability evaluation standard, and puts forward a method for solving the safety coefficient of rocky slopes. The discrete element method 3DEC, which is suitable for rocky slopes, is selected as the numerical calculation tool, and the convergence criterion of its strength reduction method is modified to the slope deformation rate threshold, and the method is realized by the bifurcation method through its built-in FISH programming language. The results of the classical case show that, by selecting the slope deformation rate threshold in the appropriate interval, the results of this paper's method are very close to those of the finite unit stress method and the limit equilibrium method, which verifies the reliability of this paper's method. Further, the method of this paper is applied to an open-pit mine slope project, based on the slope deformation on-site monitoring data, through the time series prediction method to determine the slope deformation rate warning threshold, using the threshold as an evaluation criterion to solve the slope's coefficient of safety, the calculation results show that: the slope's coefficient of safety in natural working conditions is 1.086, basically stable, suffered from continuous rainfall, the slope body is gradually saturated, the slope's coefficient of safety is reduced to 0.987, the slope's safety is reduced to 0.987. After continuous rainfall and gradual saturation of the slope, the coefficient of safety decreased to 0.987, destabilizing and destroying, which is consistent with the site conditions.

In this paper, we study the global existence and exponential decay for a dynamic contact problem between a Timoshenko beam with second sound and two rigid obstacles, of which the heat flux is given by Cattaneo's law instead of the usual Fourier's law. The main difficulties arise from the irregular boundary terms, from the low regularity of the weak solution and from the weaker dissipative effects of heat conduction induced by Cattaneo's law. By considering related penalized problems, proving some a priori estimates and passing to the limit, we prove the global existence of the solutions. By considering the approximate framework, constructing some new functionals and applying the perturbed energy method, we obtain the exponential decay result for the approximate solution, and then prove the exponential decay rate to the original problem by utilizing the weak lower semicontinuity arguments.

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

We present a very computationally light and fast approximation algorithm and then verify it with genetic algorithm and simulated annealing. We show that our algorithm is on par with GA and SA in terms of output produced while having a tightly bounded time complexity. Our algorithm works best when there is a strong positive correlation between the reliability of a component and its cost. We present two algorithms with the same essence. One of them is system cost bounded and the other is target reliability bounded. Our proposed algorithm works on a subsystem level redundancy instead of component level redundancy.

This article introduces a novel nature-inspired metaheuristic algorithm called Frilled Lizard Optimization (FLO), which emulates the hunting behavior of frilled lizards in their natural habitat. FLO draws in-spiration from the sit-and-wait strategy observed in frilled lizards during hunting. The underlying theory of FLO is presented and mathematically formulated in two phases: (i) an exploration phase, simulating the frilled lizard's attack towards prey, and (ii) an exploitation phase, simulating the lizard's retreat to the top of the tree after feeding. To assess FLO's efficacy in solving optimization problems, the algorithm's performance is evaluated across fifty-two standard benchmark functions, encompassing unimodal, high-dimensional multimodal, fixed-dimensional multimodal, and the CEC 2017 test suite. Comparative analyses with twelve existing metaheuristic algorithms are conducted. The simulation results reveal that FLO, distinguished by its adeptness in exploration, exploitation, and balancing them during search process, outperforms competing algorithms. Additionally, FLO is implemented on twenty-two constrained optimization problems from the CEC 2011 test suite and four engineering design problems, demonstrating its effectiveness in addressing real-world optimization applications.

The P versus NP problem is a fundamental question in computer science. It asks whether problems whose solutions can be quickly verified can also be quickly solved. Here, "quickly" refers to computational time that grows proportionally to the size of the input (polynomial time). While the problem's roots trace back to a 1955 letter from John Nash, its formalization is attributed to Stephen Cook and Leonid Levin. Despite extensive research, a definitive answer remains elusive. Closely tied to this is the concept of NP-completeness. If a single NP-complete problem could be solved efficiently, it would imply that all problems in NP can be solved efficiently, proving that P equals NP. This work posits that MONOTONE ONE-IN-THREE 3SAT, a notoriously difficult NP-complete problem, can be solved efficiently, thereby establishing the equivalence of P and NP.

In this paper, we investigate various graphene monolayer nanomesh structures (diodes) formed only by nanoholes, with a diameter of just 20 nm and etched from the graphene layer in different shapes (such as rhombus, bow-tie, rectangle, trapezoid, and triangle), and their electrical properties targeting electromagnetic energy harvesting applications. In this respect, the main parameters characterizing any nonlinear device for energy harvesting are extracted from tens of measurements performed on a single chip containing the fabricated diodes. The best nano-perforated graphene structure is the triangle nanomesh one, which exhibits remarkable performance in terms of its characteristic parameters, i.e., a 420 Ω differential resistance for optimal impedance matching to an antenna, a high responsivity greater than 1000 V/W, and a low noise equivalent power of 847 pW/√Hz at 0 V.

The marketing industry is rapidly evolving, necessitating educational programs to adapt and equip graduates with relevant skills and knowledge. This systematic literature review with bibliometric analysis (SLRBA) explores the integration of Problem-Based Learning (PBL) in marketing education. PBL is an instructional strategy that empowers students to solve real-life problems by integrating theory and practice, thus fostering critical thinking and decision-making skills. Our review synthesizes data from 71 sources, highlighting the definition of PBL, strategies to promote its implementation in marketing education, and the benefits and challenges associated with this approach. The findings indicate that PBL enhances student engagement, provides hands-on experience, and prepares students for real-world marketing challenges. Strategies such as using social media, serious games, e-learning, and feedback mechanisms are discussed for their effectiveness in promoting active learning and student participation. Despite its advantages, PBL faces challenges such as resource intensiveness, student resistance, and information integrity issues. This review underscores the importance of PBL in bridging the gap between theoretical knowledge and practical application, ultimately preparing marketing students to meet the demands of the industry. The paper concludes with recommendations for future research and best practices for implementing PBL in marketing education.

The study of different forms of preconditioners for solving a system of nonlinear equations, by using Newton’s method, is presented. The preconditioners provide numerical stability and rapid convergence with reasonable computation cost, whenever chosen accurately. Different families of iterative methods can be constructed by using a different kind of preconditioners. The multi-step iterative method consists of a base method and multi-step part. The convergence order of base method is quadratic and each multi-step add an additive factor of one in the previously achieved convergence order. Hence the convergence of order of an m-step iterative method is m + 1. Numerical simulations confirm the claimed convergence order by calculating the computational order of convergence. Finally, the numerical results clearly show the benefit of preconditioning for solving system of nonlinear equations.

Traditional population-based metaheuristic algorithms are effective in solving complex real-world problems but require careful strategy selection and parameter tuning. Parameter-less population-based optimization algorithms have gained importance due to their simplicity and efficiency. However, research on their applicability for solving large systems of nonlinear equations is still incipient. In this paper, a systematic review and detailed description of metaphor-less optimization algorithms is made, including the Jaya algorithm, the main Jaya variants for continuous optimization problems, with a focus on the Enhanced Jaya (EJAYA) algorithm, the three Rao algorithms, the best-worst-play (BWP) algorithm, and the very recent max-min-greedy-interaction (MaGI) algorithm. This paper also discusses a few previous parallelizations of the Jaya optimization algorithm, as well as recent GPU-based massively parallel implementations of the Jaya, Enhanced Jaya (EJAYA), Rao, and BWP algorithms developed by the authors. In addition, a novel GPU-accelerated version of the MaGI algorithm is proposed. The GPU-accelerated versions of the metaphor-less algorithms developed by the authors were implemented using the Julia programming language and tested primarily on GeForce RTX 3090 and NVIDIA A100 GPUs, as well as on Tesla V100S and Tesla T4 GPUs, using a set of difficult, large-scale nonlinear equation system problems. The computational experiments carried out produced quite significant speedups, which highlights the efficiency of the GPU-based versions of the metaphor-less algorithms developed for solving large-scale systems of nonlinear equations.

This article introduces a novel two-step fifth-order Jacobian-free iterative method aimed at efficiently solving systems of nonlinear equations. The method leverages the benefits of Jacobian-free approaches, utilizing divided differences to circumvent the computationally intensive calculation of Jacobian matrices. This adaptation significantly reduces computational overhead and simplifies the implementation process while maintaining high convergence rates. We demonstrate that this method achieves fifth-order convergence under specific parameter settings, with a broad applicability across various types of nonlinear systems. The effectiveness of the proposed method is validated through a series of numerical experiments which confirm its superior performance in terms of accuracy and computational efficiency compared to existing methods.

We investigate the use of amplitude amplification on the gate-based model of quantum computing as a means for solving combinatorial optimization problems. This study focuses primarily on QUBO (quadratic unconstrained binary optimization) problems, which are well-suited for qubit superposition states. Specifically, we demonstrate circuit designs which encode QUBOs as ‘cost oracle’ operations UC, which when combined with the standard Grover diffusion operator Us lead to high probabilities of measurement for states corresponding to the optimal and near optimal solutions. In order to achieve these probabilities, a single scalar parameter ps is required, which we show can be found through a variational quantum-classical hybrid approach.

The term STODS (Surgical Temporary Ocular Discomfort Syndrome) has been coined to describe the ocular surface perturbations induced by surgery. As one of the most important refractive elements of the eye, Guided Ocular Surface and Lid Disease (GOLD) optimization is fundamental to success in achieving refractive outcomes and mitigating STODS. Effective GOLD optimization and the prevention/treatment of STODS, requires an understanding of the molecular, cellular and anatomic factors that influence ocular surface microenviroment and the associated perturbations induced by surgical intervention. By reviewing the current understanding of STODS etiologies, we will attempt to outline a rationale for a tailored GOLD optimization depending on the ocular surgical insult. With a bench to bedside approach, we will highlight clinical examples of effective GOLD perioperative optimization can mitigate STODS deleterious effect on preoperative imaging and postoperative healing.

This paper presents a numerical algorithm for solving high-order BVPs. We introduce the construction method of multiscale orthonormal basis in W^m[0; 1] by multiscale orthonormal basis in W¹[0; 1]. We define approximate solution, and obtain the approximate solution of high-order BVPs by using the approximate theory. Moreover, the convergence and stability of the algorithm are improved. At last, several numerical experiments show the feasibility of the proposed method.

This paper investigates the periodic and quasi-periodic orbits in the symmetric collinear four-body problem through a variational approach. In Section 3, we analyze the conditions under which homographic solutions minimize the action functional. We demonstrate that these solutions for four equal masses arranged in a linear configuration are indeed the minimizers of the action functional and compute the minimum value of the action functional for these solutions. Additionally, we employ numerical experiments using Poincaré sections to explore the existence and stability of periodic and quasi-periodic solutions within this dynamical system. Our results provide a deeper understanding of the variational principles in celestial mechanics and reveal complex dynamical behaviors that are crucial for further studies in multi-body problems. The findings have significant implications for theoretical research and practical applications in astrodynamics and space mission planning.

Recycling waste products is an environmental-friendly activity that can bring benefits to accompany, saving manufacturing costs and improving economic efficiency. For the beer industry, recycling bottles can reduce manufacturing costs and reduce the industry's carbon footprint. This paper presents a model for a multi-objective collection-distribution center location and allocation problem in a closed loop supply chain for the beer industry, in which the objective is to minimize total costs and transportation pollution. Uncertainties in the form of randomness and fuzziness are jointly handled in this paper to ensure a more practical problem solution, for which returned bottle sand unusable bottles are considered fuzzy random variables. A heuristic algorithm based on priority-based global-local-neighbor particle swarm optimization (pb-glnPSO) is applied to ensure reliable solutions for this NP-hard problem. A case study on a beer operation company is conducted to illustrate the application of the proposed model and demonstrate the priority-based global-local-neighbor particle swarm optimization.

In this paper, the Hafele‐Keating experiment and the geostationary orbit satellite of related physics problems of are analyzed and discussed in detail. If researchers read the paper and think about it, It will be found that the Hafele‐Keating experiment and the geostationary satellite problem prove that some of the core ideas and theories of relativity are seriously wrong. Isnʹt that a very serious problem in physics? Canʹt this cause the academic circles to pay great attention to it? Isnʹt this worthy of in‐depth analysis and research? The core of the paper is to point out that there are problems with the space concept and the reference system theory of classical physics and relativity, And that would bring up a whole host of physics problems. It takes a concerted effort from the academic community, Do furtherin‐depth analysis and research. Strive forthe further discovery and perfection of physics theory.

Taking due account of users' perspectives is crucial for improving the quality of healthcare services. This study aimed to analyse the representations and evaluation criteria that users of a public health agency express towards care and treatment services and to explore whether and how the content and meaning of their communications varied according to pre-pandemic, pandemic or post-pandemic periods. 501 communications (73.4% complaints, 16% appreciations, 10.6% enquiries) sent to the public relations office of an Italian health agency were collected. An automatic content analysis procedure (ACASM) was applied to the textual corpus. Four main thematic cores were identified concerning the request for care and respect, the value of the doctor-patient relationship and the difficulties in contacting services and accessing care. Two main latent dimensions of meaning were identified, which capture the dialectic between the demand for relationships and the demand for access to care, and between attention to the relational competence of health workers and attention to the needs and rights of users. Communications collected during the pre-pandemic and post-pandemic periods mainly concern the difficulty of access to care; those collected during the pandemic period mainly concern the doctor-patient relationship. Interpersonal aspects and timely access to care appear to be crucial in users' assessment of the quality of care.

Using flexible AC transmission system (FACTS) devices in power systems while adhering to some equality and inequality constraints, researchers around the world sought to address this issue with the objectives of improving the voltage profile, reducing power losses in transmission lines, and increasing system reliability and safety. The recent development of FACTS controllers opens up new perspectives for safer and more efficient operation of electrical power networks by continuous and rapid action on power systems parameters, such as phase angle shifting, voltage injection and line impedance compensation. Thus, an improvement on voltage profile and enhancement of power transfer capability can be obtained. It is for that, the idea behind the FACTS concept is to enable the transmission system to be an active element in increasing the flexibility of power transfer requirements and in securing stability of integrated power system. It may also be effective in transient stability improvement, power oscillations damping and balancing power flow in parallel lines. The primary issue that has significantly piqued the interest of a number of researchers working in this field is the FACTS optimization problem, which involves determining the optimal type, location, and size of FACTS devices in electrical power systems. For solving this mixed integer, nonlinear and non-convex optimization problem, this paper provides an in-depth and comprehensive review of the various optimization techniques covered in published works in the field. In this review, a classification of optimization techniques in five main groups that are widely used, such as classical optimization techniques or conventional optimization approaches, Meta heuristic methods, analytic methods or sensitive index methods and mixed or hybrid methods, is summarized. In addition, a performance descriptions and comparison of these different optimization techniques are discussed in this study. Finally, some advice is offered for future research in this field.

We introduce two symmetric concepts to physics: “distance” (space and time in one) and “wavematter” (electromagnetic wave packet and matter in one). We claim that physics has chosen the wrong concept of time: It is not aware that the time of a moving object flows in a direction other than my time. We provide 15 proofs for our claim by solving 15 mysteries of physics graphically! For example, we prove that length contraction and time dilation are actually geometrical effects in a 4D manifold that we call “Euclidean spacetime” (ES). We prove that the discrepancy in calculating the Hubble constant stems from a systematic error in the redshift measurement. We prove that what I deem wave, deems itself matter, which solves wave–particle duality. We even untangle quantum entanglement without the issue of non-locality. We finally understand why alternative theories of Euclidean relativity have failed: They are all based on four dimensions of space rather than distance. A huge amount of energy was injected into ES at a point that we take as origin. Ever since has this energy been moving radially away at the speed of light. We live in the 3D hypersurface of an expanding 4D hypersphere. Hyperspherical coordinates have the great advantage that they reduce all that is ever happening to just one formula. So, it is the Theory of Everything in these coordinates: “Energy is covering radial distance which, divided by Euclidean time, is equal to the speed of light.” Acceleration and force like gravitation emerge from a rotation of objects in ES and a subsequent projection to 3D space. Matching the symmetry simplifies physics.

A variant of the von Neumann-Wigner Interpretation is proposed. It does not make use of the familiar language of wave functionsand observers. Instead it pictures the state of the physical world as a vector in a Fock space and, therefore not, literally, a functionof any spacetime coordinates. And, rather than segregating consciousness into individual points of view (each carrying with it asense of its proper time), this model proposes only unitary states of consciousness, Q(t), where t represents a fiducial time withrespect to which both the state of the physical world and the state of consciousness evolve. States in our world's Fock space areclassified as either 'admissible' (meaning they correspond to definite states of consciousness) or 'inadmissible' (meaning they donot). The evolution of the state vector of the world is such as to always keep it restricted to 'admissible' states. Consciousness istreated very much like what Chalmers calls an "M-Property." But we try to show that problems with the quantum Zeno effect do not arise from this model.

A solution for the Prandtl-Blasius equation is essential to all kinds of boundary layer problems. This paper revisits this classic problem and presents a general Maple code as its numerical solution. The solutions were obtained from the Maple code, using the Runge-Kutta method. The study also considers convergence radius expanding and an approximate analytic solution is proposed by curve fitting. Similarly, the study resolves some boundary layer related problems and provide relevant Maple codes for these.

Based on previous research results, we propose a new preprocessing HSS iteration method (PHSS) for the generalized Lyapunov equation. At the same time, the corresponding inexact PHSS algorithm (IPHSS) is given from the angle of application. All the new methods presented in this paper have given the corresponding convergence proof. The numerical experiments are carried out to compare the new method with the existing methods, and the improvement effect is obvious. The feasibility and effectiveness of the proposed method are proved from two aspects of theory and calculation.

The Hamiltonian of a quantum mechanical system has an affiliated spectrum. If this spectrum is the sequence of prime numbers, a connection between quantum mechanics and the nontrivial zeros of the Riemann zeta function can be made. In this case, the Riemann zeta function is analogous to chaotic quantum systems, as the harmonic oscillator is for integrable quantum systems. Such quantum Riemann zeta function analogies have led to the Bender-Brody-Müller (BBM) conjecture, which involves a non-Hermitian Hamiltonian that maps to the zeros of the Riemann zeta function. If the BBM Hamiltonian can be shown to be Hermitian, then the Riemann Hypothesis follows. As such, herein we perform a symmetrization procedure of the BBM Hamiltonian to obtain a unique Hermitian Hamiltonian that maps to the zeros of the analytic continuation of the Riemann zeta function, and provide an analytical expression for the eigenvalues of the results. The holomorphicity of the resulting eigenvalues is examined. Moreover, a second quantization of the resulting Schrödinger equation is performed, and a convergent solution for the nontrivial zeros of the analytic continuation of the Riemann zeta function is obtained. Finally, from the holomorphicity of the eigenvalues it is shown that the real part of every nontrivial zero of the Riemann zeta function converges at σ = 1/2.

Cancers are complex, adaptive ecosystems. They remain the leading cause of disease-related death among children in North America. As we approach computational oncology and Deep Learning Healthcare, our mathematical models of cancer dynamics must be revised. Recent findings support the perspective that cancer-microenvironment interactions consist of turbulent flows. As such, cancer pattern formation, protein-folding and metastatic invasion are discussed herein as processes driven by chemical turbulence within the framework of complex systems theory. Current state-of-the-art quantitative approaches used in reconstructing cancer stem cell networks are reviewed. To conclude, cancer stem cells are presented as strange attractors of the Waddington landscape.

The increasing adoption of student-centred learning environs by the institutions of higher education in business, has led to new mechanisms and methodologies such as the Simulation-Based Learning (SBL), Problem-Based Learning (PBL) and Challenge-Based Learning (CBL). Literature has shown evidence of raising interest in these methodologies towards a more experiential paradigm with regard to upcoming events from the surrounding real-world context. This paper presents a Systematic Bibliographic Literature Review (SBLR) with respect to the integration and application of these innovative and collaborative methodologies in higher education. It aimed to identify its relevant advantages, challenges, and consequences for the future of business education. Bibliographic databases were searched for documents published up to May 2024 to categorize key topics discussed in the literature on SBL, PBL and CBL. The review process identified 89 empirical and non-empirical papers on SBL, PBL and CBL, business related paperwork, which resulted from the PRISMA (Preferred Reporting Items for Systematic Reviews and Meta-Analyses) method. PRISMA is a framework with evidence-based data designed to help authors perform a systematic literature review. Data analysis revealed diverse subthemes for those methodologies uses in business higher education institutions. The research questions “What are the advantages, challenges and implications of SBL, PBL and CBL altogether, in the training of business students?” guided the study. The central output of the research is the discovery of the varying uses of SBL, PBL and CBL overall, to cope with diverse demands arising within environmental context. Future research directions are suggested.

In recent years, the delivery of medical supplies has faced significant challenges due to natural disasters and recurrent public health emergencies. Addressing the need for improved logistics operations during such crises, this article presents an innovative approach integrating vehicle and Unmanned Aerial Vehicle (UAV) logistics to enhance the efficiency and resilience of medical supply chains. Our study introduces a dual-mode distribution framework that employs the Density-Based Spatial Clustering of Applications with Noise (DBSCAN) algorithm for efficiently clustering demand zones unreachable by conventional vehicles, thereby identifying areas requiring UAV delivery. Furthermore, we categorize the demand for medical supplies into two distinct sets based on vehicle accessibility, optimizing distribution routes via both UAVs and vehicles. Through comparative analysis, our findings reveal that the artificial bee colony (ABC) algorithm significantly outperforms the genetic algorithm in terms of solving efficiency, iteration counts, and delivery speed. However, the ABC algorithm's tendency towards early local optimization and rapid convergence leads to potential stagnation in local optima. To mitigate this issue, we incorporate a simulated annealing technique into the ABC framework, culminating in a refined optimization approach that successfully overcomes the limitations of premature local optima convergence. The experimental results validate the efficacy of our enhanced algorithm, demonstrating reduced iteration counts, shorter computation times, and substantially improved solution quality over traditional logistic models. The proposed method holds promise for significantly improving the operational efficiency and service quality of the healthcare system's logistics during critical situations.

We developed a novel hybrid approach for solving global optimization, computer science, bio-medical and engineering real life applications that is based on the coupling of the Whale Optimizer and Sine Cosine Algorithms via a surrogate model. We relate the whale optimizer algorithm to balance between the exploitation and the exploration process in the proposed method. There exist confirmed techniques for searching approximate best optimal solutions, but our algorithm will further guarantee that such numerical and statistical solutions satisfy physical bounds of the standard and real life functions. Our experiments with the benchmark, bio-medical, computer science and engineering real life problems have illustrated the advantages of using a newly hybrid approach based on mixing Whale Optimizer and Sine Cosine algorithms. It holds considerable potential for reducing execution time for solving standard and real life problems and at the same time improving the quality of the solution.

Signal approximation, is the basic idea of signal processing and mathematical analysis where complex signals can be represented with simpler ones. This paper explores unifying two mathematical fundamentals, Dirichlet-type problems, and hyperbolic series identities, into signal approximation. In this paper, we address a well-known classic topic in mathematical analysis - the Dirichlet problem - to improve (the approximation of) signal using Fourier series. We also discuss using hyperbolic series representations to increase signal modeling flexibility. In this way, we hope to create new links that span some distance along this dimension and result in a somewhat theoretical view of signal behavior - present with the mathematical rigor needed for speculation but absent from an understanding capable of appropriately handling real-world complexity. This paper provides a theoretical investigation of the mechanics at play and reveals by analogy how these mathematical tools can potentially advance signal processing techniques and understanding. This paper illustrates Fourier series and fuzzy logic methods by two case studies on signal processing, satellite communication and financial risk measurement. The first case study performs signal approximation using the Fourier series and hyperbolic function identities to provide insight into how signals behave and are modeled. The second case study deals with applying fuzzy logic for risk evaluation of investment portfolios, emphasizing the utility in evasion systems solving uncertainty and imprecision problems related to financial decisions.

The elastic wave equation with the seismic tensorial force is solved in a homogeneous and isotropic medium (the Earth). Spherical-shell waves are obtained, which are associated to the primary P and S seismic waves. It is shown that these waves produce secondary waves with sources on the plane surface of a half-space, which have the form of abrupt walls with a long tail, propagating in the interior and on the surface of the half-space. These secondary waves are associated to the seismic mainshock. The results, previously reported, are re-derived by using Fourier transformations and specific regularization procedures. The relevance of this seismic motion for the ground motion, the seismographs' recordings and the effect of the inhomogeneities in the medium are discussed.

Nobel Prize-winning physicist Sir Roger Penrose and Stuart Hameroff, a renowned American physician and scientist, have put forward an innovative theory that the human brain has a quantum mechanism located in the microtubular protein system within neurons, known as the "Orch OR" theory. According to the researchers, this mechanism is responsible for the brain's non-computational actions such as consciousness and free will. This theory has been criticized by several researchers from both the biological and physical sides. The purpose of this paper is to examine whether there is a possible basis for this theory in the philosophy of science.

HIV infection invariably attracts the attention of medical staff in complex medical specialties. To achieve the goal of elimination by 2020, various approaches are required, including the establishment of prevention, diagnosis, monitoring, treatment, control measures. These should be supported by statistical studies that report on restricted or extended geographical areas, to the level of social class and age. Such an approach, combing the medical and social science perspectives (medicosocial) can prove useful for developing control measures. Due to the complexity of this immunodeficiency pathology, the condition also attracts comorbidities (most notably tuberculosis). Hence, prospective strategies need to be developed and oriented towards the goal of eradicating HIV infection. This paper presents strategies for consideration.

We have used the varying physical constant approach to resolve the flatness problem in cosmology. Friedmann equations are modified to include variability of speed of light, gravitational constant, cosmological constant and the curvature constant. The continuity equation obtained with such modifications includes scale factor dependent cosmological term as well as the curvature term along with the standard energy-momentum term. The result is that as the scale factor tends to zero (i.e. as the big-bang is approached) the universe becomes strongly curved rather than flatter and flatter in the standard cosmology. We have used the supernovae 1a redshift versus distance modulus data to determine the curvature variation parameter of the new model, which yields a better fit to the data than the standard ΛCDM model. The universe is found to be open type with radius of curvature R_c = 1.64 (1+z)^-3.3 c₀/H₀, where z is the redshift, c₀ is the current speed of light and H₀ is the Hubble constant.

Nowadays, we live in a world in which people are facing with a lot of data that should be stored or displayed. One of the key methods to control and manage this data refers to grouping and classifying them in clusters. Today, clustering has a critical role in information retrieval methods for organizing large collections inside a few significant clusters. One of the main motivations for the use of clustering is to determine and reveal the hidden and inherent structure of a set of data. Ensemble clustering algorithms combine multiple clustering algorithms to finally reach an overall clustering system. Ensemble clustering methods by lack of information fusing utilize several primary partitions of data to find better ways. Since various clustering algorithms look at the different data points, they can produce various partitions from such data. It is possible to create a partition with high performance by combining the partitions obtained from different algorithms, even if the clusters to be very dense from each other. Most studies in this area have examined all the initial clusters. In this study, a new method is used in which the most sustainable clusters are utilized instead of all primary produced clusters. Consensus function based on co-association matrixes used to select more stable clusters. The most stable clusters selection method is done by cluster stability criterion based on F-measure. Optimization functions are used to optimize the obtained final clusters. The genetic algorithm is the optimizer used in this article to find the ultimate clusters participated in a consensus. Experimental results on several datasets show that the output of proposed method is various clusters with high stability.

Good Boussinesq equations will be considered in this work. First we apply three combined compact schemes to approximate spatial derivatives of good Boussinesq equations. Then three fully discrete schemes are developed based on symplectic scheme in time direction, which are sympletic-structure preserving.Meanwhile, the convergence and conservation of the fully discrete schemes are analyzed. Finally, we present numerical experiments to confirm our theoretical analysis. Both our analysis and numerical test indicate that the fully discrete schemes are efficient in solving the spatial derivative mixed equation.

We demonstrate how a rigorous mathematical approach can be used to extract a current CMB temperature of 2.7276 ±0.0723 K from the 580 type Ia supernova data points in the Union2 database. Using redshift formula: z = Sqrt(Rh/R_t) − 1, incorporated into our new CMB redshift prediction redshift formula, we find that the above current CMB temperature value is a remarkably good match for this particular data set. In addition, we can alternatively start out with the measured current CMB temperature and extract the Hubble constant from all 580 supernovae. We then get an estimated Hubble constant of H0 = 66.8711+0.0019 km/s/Mpc when using the CMB temperature from the recent Dhal et al study [1] in combination with redshifts from all 580 supernovae. Furthermore, we get an estimated Hubble constant value of H_0 = 66.8943+0.0287 km/s/Mpc when using the CMB temperature measured by Fixsen [2]. In summary, our simple model essentially perfectly matches all 580 type Ia supernova redshifts while extracting H_0 or T_0 values. The Hubble constant we extract by this method fits very well with the Hubble constant extracted from the CMB by other studies. We believe that our new approach likely solves the Hubble tension problem, at least inside R_h = ct cosmology.

In the last years, a recent growing line of research has been developed with fruitful results by using fractional and conformable derivatives in the iterative procedures of classical methods for solving nonlinear equations. In that sense, the use of conformable derivatives has shown better behavior than fractional ones, not only in the theory, but also in the practice. In this work, we adapt the approximation of conformable derivatives in order to design the first conformable derivative-free iterative schemes to solve nonlinear equations: a Steffensen’s type method and a Secant type method; the latter with memory. Convergence analysis is made, preserving the order of classical cases, and the numerical performance is studied in order to confirm the results in the theory. It is shown that these methods can present some numerical advantages versus their classical partners, with wide sets of converging initial estimations.

Real-world optimization problems are often gov- erned by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Opti- mization Problems (COPs) fueled by advances in computational power. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose a novel hybrid Evolutionary Algorithm based on the Differential Evolution algorithm and Adaptive Parameter Gaining Sharing Knowledge-based algo- rithm to solve global real-world constrained parameter space. The proposed CHAGSKODE algorithm leverages the power of multiple adaptation strategies concerning the control parameters, search mechanisms, as well as uses knowledge sharing between junior and senior phases. We test our method on the benchmark functions taken from the CEC2020 special session & competition on real-world constrained optimization. Experimental results indicate that CHAGSKODE is able to achieve state-of-the- art performance on real-world constrained global optimization when compared against other well-known real-world constrained optimizers.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.

The generation and maintenance of membrane potential is considered a fundamental element of the cellular machinery. They are based on elements of physics and chemistry. Mathematics is used to validate the equations and evaluate the results. However, this computation process can lead to a misunderstanding of the phenomena involved or to the masking of crucial events. It is even possible that the calculation no longer corresponds to the hypothesis considered. Membrane theory is no exception to these trivial considerations, which are essential for normal theory validation.

The 3x+1 problem asks the following: Suppose we start with a positive integer, and if it is odd then multiply it by 3 and add 1, and if it is even, divide it by 2. Then repeat this process as long as you can. Do you eventually reach the integer 1, no matter what you started with? Collatz conjecture (or 3n+1 problem) has been explored for about 85 years. In this paper, we convert an integer number from decimal to binary number, and convert the Collatz function to binary function, which is multiplication and division of two binary numbers. Finally the iternation of the Collatz function, eventually reach the integer 1, thus we solve the 3x+1 problem completely.

The Gol'denveizer problem of a torus can be described as follows: a toroidal shell is loaded under axial forces and the outer and inner equators are loaded with opposite balanced forces. Gol'denveizer pointed out that the membrane theory of shells is unable to predict deformation in this problem, as it yields diverging stress near the crowns. Although the problem has been studied by Audoly and Pomeau (2002) with the membrane theory of shells, the problem is still far from resolved within the framework of bending theory of shells. In this paper, the bending theory of shells is applied to formulate the Gol'denveizer problem of a torus. To overcome the computational difficulties of the governing complex-form ordinary differential equation (ODE), the complex-form ODE is converted into a real-form ODE system. Several numerical studies are carried out and verified by finite-element analysis. Investigations reveal that the deformation and stress of an elastic torus are sensitive to the radius ratio, and the Gol'denveizer problem of a torus can only be fully understood based on the bending theory of shells.

A given problem in physics can be solved if it is well formulated. Well formulated means that it has a bijective correspondence to physical reality. Mass Gap Problem has no bijective correspondence with the physical reality and is that’s why not solvable mathematically. It can be solved in the frame of quantum mechanics by the formulation of the photon’s mass accordingly to the Planck-Einstein relation.

In this paper, the neural network is developed for solving the inverse photoacoustic problem aiming to estimate thermo-elastic properties and thickness of a semiconductor sample. The idea was that these sample properties be estimated from the phase characteristic because the phase measurements are more sensitive. The neural network has been trained on a large basis of photoacoustic phases calculated from a theoretical Si n-type model in the range of 20Hz to 20kHz, on which random Gaussian noise has been applied. It is shown that high accuracy and precision could be reached in solving of inverse photoacoustic problem using only phase measurement.

The study of precipitation amount at different time scales constitutes an important issue in climate research and risk assessment. When dealing with daily totals, a frequent but sometimes underestimated problem is at what time the observation day begins. The choice of different starting times may lead to incompatibility between stations and incorrect identification of extreme events. In this work, the problem of temporal misalignment between precipitation datasets characterized by different starting time of the observation day is analyzed. The most widely used adjustment methods (1day and uniform shift) and two methods based on reanalysis (NOAA and ERA5) are evaluated in terms of temporal alignment, precipitation statistics and percentile distributions. As test series, the precipitation amount collected from 9 a.m. local time (09 LT) on the previous day to 09 LT on the target day (9-9 datasets) of the Padua and nearby stations in the period 1993-2022 have been selected. Results show that the reanalysis-based methods, in particular ERA5, outperform the others in temporal alignment, regardless the station. But, for the periods in which reanalysis data are not available, “1day” method, which shifts the daily amount back one calendar day, and “unif” method, which distributes uniformly the daily total from a 2-day moving window surrounding the target date, can be considered valid alternatives. On the other side, concerning the precipitation statistics, the reanalysis-based methods are not the best option, as they increase the precipitation frequency and reduce the mean value over wet days, NOAA much more than ERA5. Nevertheless, the uniform method provides a larger deviation from the original daily series. The use of the series of a station nearby the target one, which is mandatory in case of missing data, gives similar or better results than applying any adjustment method to the 9-9 series. General conclusions can hardly be drawn as they depend on the method and station. For the Padua dataset, the analysis was repeated at monthly and seasonal resolution. In general, the adjustment series show the most relevant changes in the precipitation statistics in summer and less temporal alignment with the original series in summer and autumn, the two seasons mainly affected by heavy rains in Padua. Finally, the percentiles distribution, analyzed for all the methods and stations, indicates that any adjustment method underestimates the percentile values, except ERA5. Only Legnaro, the station most correlated with Padua, gives results like ERA5.

In this work, we offer a novel and accurate method in order to find the solution of the linear differential equations over the intervals [0, 1) based on the generalization of Legendre wavelets. The mechanism is still upon workable implementation of the operational matrix of integration and its derivatives. This method reduces the problems into algebraic equations via the properties of generalized Legendre wavelet (GLW) together with the operational matrix of integration. The function approximation has been picked out in such a way so as to enumerate the connection coefficients in an facile manner. The proposed numerical technique, based on the GLW, has been examined on three linear problems as a consequence of this investigation. The outcomes have shown that this method, as opposed to some other existing numerical and analytical methods, is a very useful and advantageous for tackling such problems.

The global issues of overweight and sedentary lifestyles demand comprehensive responses from health systems, yet health education still needs to be more cohesive and less sporadic. This study focuses on primary school children as a specific target for instilling healthy habits, employing ac-tive learning strategies to address healthy diet and physical activity. Through Problem-Based Learning projects, the study engaged fourth-grade primary students in acquiring healthy habits. The study was carried out over four consecutive years at a school with two lines, allowing the employment of an opportunity sample and evaluating intervention and control groups by com-paring their corresponding scores. Control groups integrated a total of 54 students, while the in-tervention group included a total of 159 students. A pre-test and post-test questionnaire were used for data collection. Evaluation differential scores revealed statistically significant higher scores in the intervention groups: 3.62 points in control groups and 6,94 in intervention groups, particu-larly in attitudinal competences. These strategies not only facilitated the development of crucial skills such as information search, synthesis, representation, analysis, decision-making, teamwork, and intrapersonal awareness but also significantly broadened the knowledge acquired in aspects related to healthy habits. This approach proved effective in helping children comprehend the im-portance of healthy choices and encouraged integrating such habits into their daily lives.

Starting with unitary quantum dynamics, we investigate how to add quantum measurements. Quantum measurements have four essential components: the furcation, the witness production, an alignment projection, and the actual choice decision. The first two components still lie in the domain of unitary quantum dynamics. The decoherence concept explains the third contribution. It can be based on the requirement that witnesses reaching the end of time on the wave function side and the conjugate one have to be identical. In this way, it also stays within the quantum dynamics domain. The surjection hypothesis explains the actual choice decision. It is based on a two boundary interpretation applied to the complete quantum universe. It offers a simple way to reduce these seemingly random projections to purely deterministic unitary quantum dynamics, eliminating the measurement problem.

We generalize the idea of quantum clock time to quantum spacetime reference frame via physical realization of a reference system by quantum rulers and clocks. Omitting the internal degrees of freedom (such as spins) of the physical rulers and clocks, only considering their metric properties, the spacetime reference frame is described by a bosonic non-linear sigma model (NLSM). We study the quantum behavior of the system under approximations, and obtain (1) a cosmological constant valued (2/π)ρ_c0 (ρ_c0 the critical density at near current epoch) which is very close to the observations; (2) an effective Einstein-Hilbert term; (3) the ratio of variance to mean-squared of spacetime interval tends to a universal constant 2/π in the infrared region. This effect is testable by observing a linear dependence between the inherent quantum variance and mean-squared of the redshifts from cosmic distant spectral lines. The proportionality is expected to be the observed percentage of the dark energy. The equivalence principle is also generalized to the quantum level.

Given a set of distinct non-negative integers X^n and a target certificate S in parametrized form: ∃X^k⊆X^n,∑_(x_i∈X^k)▒x_i =S (k=|X^k |,n=|X^n |). We present a polynomial solution of the subset sum problem with time complexity T≤O(kn)≤O(n^2) and space complexity S≤O(((n-1)n)/2)≤O(n^2 ), so that P = NP.

In this work, an improved collocation method based on the Bernoulli polynomials is presented to solve the Volterra integral equation (VIE) of the second kind. The main idea of the proposed method is to improve the results of the classic Bernoulli collocation method (BCM) by dividing the interval into some sub-intervals and considering the collocation points on each of them. Here, the zeros of the shifted Chebyshev polynomials (SCPs) are considered as collocation points. Then, BCM is applied step by step from the first sub-interval to the last one. By this process, a system of algebraic equations is attained for each sub-interval that could be easily solved. Convergence of the scheme is analyzed. For the purpose of demonstrating the validity, applicability, and efficiency of the suggested scheme several numerical examples are provided. Numerical results illustrate that the accuracy of the improved Bernoulli collocation method (IBCM) is more than BCM.

Conventionally, partial differential equations (PDE) problems are solved numerically through discretization process by using finite difference approximations. The algebraic systems generated by this process are then finalized by using an iterative method. Recently, scientists invented a short cut approach, without discretization process, to solve the PDE problems, namely by using machine learning (ML). This is potential to make scientific machine learning as a new sub-field of research. Thus, given the interest in developing ML for solving PDEs, it makes an abundance of an easy-to-use methods that allows researchers to quickly set up and solve problems. In this review paper, we discussed at least three methods for solving high dimensional of PDEs, namely PyDEns, NeuroDiffEq, and Nangs, which are all based on artificial neural networks (ANNs). ANN is one of the methods under ML which proven to be a universal estimator function. Comparison of numerical results presented in solving the classical PDEs such as heat, wave, and Poisson equations, to look at the accuracy and efficiency of the methods. The results showed that the NeuroDiffEq and Nangs algorithms performed better to solve higher dimensional of PDEs than the PyDEns.