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.

Maze navigation using one or more robots has become a recurring challenge in scientific literature and real life practice, with fleets having to find faster and better ways to navigate environments such as a travel hub (e.g. airports) or to evacuate a disaster zone. Many methods have been used to solve this issue, including the implementation of a variety of sensors and other signal receiving systems. Most interestingly, camera-based techniques have increasingly become more popular in this kind of applications, given their robustness and scalability. In this paper, we have implemented an end-to-end strategy to address this scenario, allowing a robot to solve a maze in an autonomous way, by using computer vision and path planning. In addition, this robot shares the generated knowledge to another by means of communication protocols, having to adapt its mechanical characteristics to be able to solve the same challenge. The paper presents experimental validation of the four components of this solution, namely camera calibration, maze mapping, path planning and robot communication. Finally, we present the integration and functionality of these methods applied in a pair of NAO robots.

A single Cancer immunotherapy has ushered in a transformative era in oncology, bringing forth unprecedented promise and opportunities. However, even with its significant breakthroughs, the domain faces the continual issue of treatment resistance. Such resistance not only restricts the broad effectiveness of these pioneering treatments but also highlights the imperative need for further research. Delving into the complex world of cancer immunotherapy resistance, we identify a range of mechanisms, from primary and secondary resistance to the notable effects of genetic and epigenetic variables, and the pivotal importance of the tumor microenvironment (TME). Additionally, we emphasize the need for innovative strategies to mitigate this resistance, including combination treatments, customized immune checkpoints, and instantaneous monitoring. By advocating for these cutting-edge methods, we foresee a direction that incorporates personalized healthcare, enhanced treatment options, and a steadfast dedication to the welfare of patients. Through a comprehensive and diverse approach, we aim to address the hurdles posed by resistance, elevating cancer immunotherapy as a symbol of hope for patients worldwide.

Catalyst with high catalytic activity and good stability are desirable in the electrocatalytic oxidation of glucose. Herein, Pt concave nanocubes with high-index facets (HIFs) supported by carbon black (Pt CNC/CB) are prepared through a hydrothermal method. The experimental results demonstrate that the peak current densities in different potential regions on the Pt CNC/CB anode are 0.22, 0.20, and 0.60 mA cm−2, respectively. The glucose oxidation reaction shows superior performances in basic and neutral conditions than in acid conditions. Better stability is achieved by Pt CNC/CB than Pt concave nanocubes (Pt CNCs). Abundant surface defects with low-coordinated atom numbers, such as the steps, kinks, and edges, are served as active sites in the electrocatalytic oxidation of glucose. With the addition of carbon black, the catalytic activity can be improved by facilitating the full exposure of the active surface defects on the HIFs of Pt CNCs. Moreover, to address the aggregation of Pt CNCs, caused by the high surface energy of HIFs, the introduction of carbon material is an effective way to preserve the HIFs, and thus enhance the stability of the catalyst. Hence, the prepared Pt CNC/CB electrocatalyst has great potential to be applied in the electrooxidation of glucose.

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.

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.

The description of the genus Leishmania as causative agents of leishmaniasis occurred during this modern age. But evolutionary studies suggest that the origin of Leishmania can be traced back to the Mesozoic era. Subsequently, during its evolutionary process, it sustained a worldwide dispersion predating the breakup of the Gondwana supercontinent. It is assumed that this parasite evolved from monoxenic Trypanosomatidae. Phylogenetic studies locate the dixenous Leishmania in a well-supported clade, recently named subfamily Leishmaniinae, which includes also monoxenous trypanosomatids. Virus-Like Particles were reported in many species of this family. So far, several Leishmania species have been reported as infected by Leishmania RNA Virus (LRV) and Leishbunyavirus (LBV). Since the first descriptions of LRV decades ago, differences in its genomic structure have been highlighted, leading to the designation of a LRV1 in L. (Viannia) species and a LRV2 in other L. (Leishmania) species. There are strong indications of virus infecting Leishmania spp. ability to enhance parasitic survival both in human and experimental infections, through highly complex and specialized mechanisms. Phylogenetic analyzes of these viruses have shown that their genomic differences correlate with the infected parasite species, suggesting a coevolutionary process. Herein, we will present unpublished results regarding the relationship Leishmania – endosymbiotic Leishmania viruses and will explore what has been described in the literature, and what is known about this association that could contribute to discussions about the worldwide dispersion of Leishmania.

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.

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.

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.

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.

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

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

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

Smoothed particle hydrodynamics (SPH) is regarded as a pure Lagrangian approach, which can solve fluid dynamics problems without the creation of mesh. In this paper, a paralleled SPH solver is developed to solve particle-based computational acoustics (PCA). The aim of this paper is to study the feasibility of using SPH to solve acoustic problems and to improve the efficiency of solving processes by paralleling some procedures on GPU during calculating. A stand SPH code running serially in a CPU is proposed to solve wave equation. This is a wave propagating in a two-dimensional domain. After finishing the computation, the results are compared with the theoretical solutions and they agree well. So its feasibility is verified. There are two main methods for searching neighbor particles: all-pair search method and linked-list search method. Both methods are used in different codes to simulate an identical problem and their runtimes are compared to investigate their searching efficiencies. The runtime results show that linked-list search method has a higher efficiency, which can save a lot of searching time when simulating problems with huge amounts of particles. Furthermore, the percentages of different procedures’ runtimes in a simulation are also discussed to find the most consuming one. Then, some codes are modified to run in different GPUs and their runtimes are compared with those of serial ones on a CPU. Runtime results show that the paralleled algorithm can be more than 80 times faster than the serial one. The result shows that GPU paralleled SPH computing can achieve desirable accuracy and speed in solving acoustic problems.

Fleets of drones have attracted a lot of attention from the research community in recent years. One of the biggest challenges in deploying such systems is localization. While GNSS localization systems can only be effective in open outdoor environments, new solutions based on radio sensors (e.g., ultra-wideband) are increasingly being used for localization in various situations and environments. However, self-localization without prior knowledge of anchor positions remains an open problem which, for example, makes it impossible to track a moving target. In this article, we provide a comparison of different variants of gradient descent-based algorithms, with a new improved variant, for solving the localization problem using relative distance measurements and multilateration. It is applied to self-localization of anchors and tracking targets using ultra-wideband distance sensors. A realistic simulation of drone tracking and anchors’ localization is performed to demonstrate the robustness and accuracy of the proposed approach.

In 1929, E. Hubble discovered a correlation between the distance of galaxies from Earth and the redshift in the spectra of the galaxies. This redshift astronomers interpreted it as evidence that galaxies are moving away from the Earth, and that the Universe is expanding. In 1998, researchers from two independent projects concluded that the universe is expanding with acceleration under the influence of "dark energy", the nature of which is completely incomprehensible. Another problem is related to the Hubble constant (H). To date there are two leading approaches to determining H. One of them is based on measurements of the cosmic microwave background, the other is based on measuring the redshift of distant galaxies and then determining the distances to them by luminosity of variables (Cepheids) and exploding (supernovae) stars. The problem is that these methods give different values of the Hubble constant: according to the first method H ≈ 67 (km/s)/Mpc, according to the other – H ≈ 73 (km/s)/Mpc. The difference is 7–8%. Accordingly, the calculated radii of the observable universe differ. The reason for this discrepancy is unclear and constitutes the essence of the so-called cosmological crisis. In the presented article, we show that the original Hubble formula needs to be corrected and give the corrected formula (corrected Hubble’s law), which is the key to solving these problems.

In this article, we present a comparative study between the Adomian Decomposition Method (ADM) and Variational Iteration Method (VIM). The study outlines the significant features of the two methods, for solving nonlinear Volterra-Fredholm integro-differential equations. From the computational viewpoint, the VIM is more efficient, convenient and easy to use. Moreover, we proved the existence and uniqueness results and convergence of the solution. Finally, an example is included to demonstrate the validity and applicability of the proposed techniques.

Atomic structure of N-electron atoms is often determined using the Hartree-Fock method, which is an integro-differential equation. The exchange term of the Hartree-Fock equations is usually treated as an inhomogeneous term of a differential equation, or with a local density approximation. This work uses matrix methods to solve for the Hartree-Fock equations, rather than the more commonly-used shooting method to integrate an inhomogeneous differential equation. It is well known that a derivative operator can be expressed as a matrix made of finite-difference coefficients; energy eigenvalues and eigenvectors can be obtained by using computer linear-algebra packages. We extend the same technique to integro-differential equations, where a discretized integral can be written as a sum in matrix form. This method is compared against experiment and standard atomic structure calculations. We also can use this method for free-electron wavefunctions. This technique is important for spectral line broadening in two ways: improving the atomic structure calculations, and improving the motion of the plasma electrons that collide with the atom.

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.

This study presents the solution of the second type of a two-dimensional nonlinear integral equation in Banach space. Also, the existence and uniqueness of this equation’s solution are discussed. We utilize a numerical approach involving hybrid and block-pulse functions to obtain the approximate solution of a two-dimensional nonlinear integral equation. Nonlinear integral equation in two dimensions is reduced numerically to a system of nonlinear algebraic equations that can be solved using numerical methods. This study focuses on showing the convergence analysis for the numerical approach and obtaining an error estimate. Some numerical examples have been provided to demonstrate the approach’s viability and efficacy

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.

Developing detailed Finite Element Models related to aerospace, automobile, civil, material science etc could be a very challenging task, especially generating a mesh that could produce accurate results. This review article provides an overview of different types of structural mechanics problems which are of interest to researchers and recent developments in meshing methodology related to each type of problems. The article also describes an automatic 2D mesh generation framework leverag- ing the capabilities of commercial FEA software MSC.PATRAN

Most traditional theories of intelligence have little to do with the question of whether people with high intelligence can successfully address real world problems. A high IQ is correlated with many important outcomes (e.g., academic prominence, reduced crime), but it does not protect against cognitive biases, partisan thinking, reactance, confirmation bias, and even falling for discredited beliefs such as alchemy, cold fusion, and astrology. There are several newer theories that directly address the question about solving real-world problems. Prominent among them is Sternberg’s adaptive intelligence with “adaptation to the environment” as the central premise, a construct that does not exist on standardized IQ tests (e.g., Sternberg, 2019). Similarly, Stanovich and West (2014) argue that standardized tests of intelligence are not measures of rational thought—the sort of skill/ability that would be needed to address complex real-world problems. Halpern and Butler (2020) advocate for critical thinking as a better model of intelligence for addressing real-world problems than those that are based on psychometric properties of general intelligence. Yes, intelligence (i.e., critical thinking) can be enhanced and used for solving a real-world problem like Covid-19, which we use as an example of contemporary problems that need a new approach. Critical thinking may be an antidote for the chaos of the modern world.

This article puts forward the bi-matrix games with crisp parametric payoffs based on interval value function approach. We conclude that the equilibrium solution of the game model can converted into optimal solutions of the pair of the non-linear optimization problem. Finally, experiment results show the efficiency of the model.

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.

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 energy transition is a challenge that affects all sectors, from transport to civil structures and industry. With reference to the industrial sector, the greatest need is the decarbonisation of industries energy-intensive, such as producers of iron and steel, aluminium, cement, petrochemicals, paper, etc. In particular, the steel industry is a hard to abate high-emissivity industry which due to chemical processes and high thermal demands (often above 500 °C) contributed to 7.4% of global CO₂ in the year 2021. This paper has explored the potential applications of hydrogen in the hard-to-abate sectors, highlighting its versatility and significance in decarbonization efforts. It provides an overview of hydrogen production methods, emphasizing the importance of sustainable and green hydrogen production. It reviews hydrogen production methods, storage, and potential in blended combustion. In the final part of the article, some considerations are introduced on the possible role of hydrogen in the steel sector (both as a supplementary fuel and as a reducing agent in innovative processes), showing how although there is potential for its inclusion as an element for the decarbonization, it is necessary to evaluate the energy balances of the various processes and the methods of hydrogen production very carefully, in order not to risk obtaining a marginal effect.

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.

In this work, the analytical treatment of Fourth order pd equations has been discussed with the variational iteration algorithm with an auxiliary parameter. The technique has the capability of reducing the size of computational work and easily overcomes the difficulty of the perturbation method or Adomian polynomials. Comparison with the classic variational iteration algorithm- is carried out, showing that the modification is more efficient and reliable.

Randomized block Kaczmarz Method and randomized extended block Kaczmarz Method are proposed for solving matrix equation AXB=C, where the matrix A and B may be full rank or rank deficient. These methods are iterative methods without matrix multiplication, and are especially suitable for solving large-scale matrix equations. It is theoretically proved these methods converge to the solution or least square solution of the matrix equation. The numerical results show that these methods are more efficient than the existing algorithms for high-dimensional matrix equations.

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.

Real-world optimization problems are often governed by one or more constraints. Over the last few decades, extensive research has been performed in Constrained Optimization Problems (COPs) fueled by advances in computational intelligence. In particular, Evolutionary Algorithms (EAs) are a preferred tool for practitioners for solving these COPs within practicable time limits. We propose an ensemble of multi- method hybrid EA framework with four mutation operators, two crossover operators, multi-search [Differential Evolution (DE) & Gaining Sharing Knowledge (GSK)] optimization algorithm, and ensemble of constraint handling techniques to solve global real- world constrained optimization problem. The proposed frame- work FEPEA has an ascendancy of multiple adaptation strategies concerning the control parameters, search mechanisms, two sub-populations as well as uses knowledge sharing mechanism between junior and senior phases. The algorithm also combines the power of four popular constraint handling techniques (CHT) and uses a voting mechanism to select any particular CHT. On top of that, this algorithm also uses both linear and non- linear population size reduction in every step of the evolutionary process. We test our method on 57 real-world problems provided as part of the CEC 2020 special session & competition on real- world constrained optimization benchmark suite. Experimental results indicate that FEPEA 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.

Many authors proposed analytical methods for solving fully fuzzy Sylvester matrix equation (FFSME) based on Vec-operator and Kronecker product. However, these methods are restricted to nonnegative fuzzy numbers and cannot be extended to FFSME with near-zero fuzzy numbers. The main intention of this paper is to develop a new numerical method for solving FFSME with near-zero trapezoidal fuzzy numbers that provides a wider scope of trapezoidal fully fuzzy Sylvester matrix equation (TrFFSME) in scientific applications. This numerical method can solve the trapezoidal fully fuzzy Sylvester matrix equation with arbitrary coefficients and find all possible finite arbitrary solutions for the system. In order to obtain all possible fuzzy solutions, the TrFFSME is transferred to a system of non-linear equations based on newly developed arithmetic fuzzy multiplication between trapezoidal fuzzy numbers. The fuzzy solutions to the TrFFSME are obtained by developing a new two-stage algorithm. To illustrate the proposed method numerical example is solved.

This paper presents a steady-state and transient heat conduction analysis framework using the polygonal scaled boundary finite element method (PSBFEM) with polygon/quadtree meshes. The PSBFEM is implemented with commercial finite element code Abaqus by the User Element Subroutine (UEL) feature. The detailed implementation of the framework, defining the UEL element, and solving the stiffness/mass matrix by the eigenvalue decomposition are presented. Several benchmark problems from heat conduction are solved to validate the proposed implementation. Results show that the PSBFEM is reliable and accurate for solving heat conduction problems. Not only can the proposed implementation help engineering practitioners analyze the heat conduction problem using polygonal mesh in Abaqus, but it also provides a reference for developing the UEL to solve other problems using the scaled boundary finite element method.

Clifford algebra is unified language and efficient tool for geometry and physics. In this paper, we introduce this algebra to derive the integrable conditions for Dirac and Pauli equations. This algebra shows the standard operation procedure and deep insights into the structure of the equations. Usually, the integrable condition is related to the special symmetry of transformation group, which involves some advanced mathematical tools and its availability is limited. In this paper, the integrable conditions are only regarded as algebraic conditions. The commutators expressed by Clifford algebra have a neat and covariant form, which are naturally valid in curvilinear coordinate system and curved space-time. For Pauli and Schr\"odinger equation, many solutions in axisymmetric potential and magnetic field are also integrable. We get the scalar eigen equation in dipole magnetic field. By the virtue of Clifford algebra, the physical researches may be greatly promoted.

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

This work deals with a numerical implementation of a fifth order CENTRAL WENO-TVD (\textit{Weighted Essentially Non-Oscillatory-Total Variation Dimimishing}) of Haschem (2006) scheme applied to the convective terms of some hyperbolic conservation laws problems, in a volume finite framework. The WENO-TVD scheme is used to solve the 1D advection and Burgers equations. For this case is implemented two different numerical fluxes: The Lax-Friedrichs and TVD fluxes. In the TVD fluxes the schemes applied are in flux-limiter form. The schemes implemented for this flux are: Van Albada-1 (van Albada et al.,1982), van Albada-2 (Kermani et al., 2003), van Leer (Hassanzadeh, 2009) and MINMOD (Hirsch, 2007). The WENO type schemes are characterized for their high order approximation, and do not produce spurious oscilations near discontinuities, shocks and higher gradients. A third order Runge-Kutta TVD for the temporal variable is used. Qualitative and quantitative comparison are presented. The numerical solutions are computed with an in-house computer code developed in MATLAB software. In future works, it will develope a paralelization of computer code for solving systems of conservation laws, e.g. Euler equations of gas dynamics.

Body-centered cubic bismuth (Bi) is considered an enticing pressure marker, and therefore it is highly desirable to command its accurate equation of state (EOS). However, significant discrepancies are noted among the previous experimental EOSs. In the present work, the EOS up to 300 GPa is theoretically obtained by direct solving the partition function via a direct integral approach (DIA). The calculated results nearly reproduce the hydrostatic experimental measurements below 75 GPa, and the deviations from the measurements gradually get larger with increasing pressure. Based on the ensemble theory of equilibrium state, DIA works with high precision particularly in high-pressure conditions, so the hydrostatic EOS presented in this work is expected to be a reliable pressure standard.

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.

Empirical Colebrook equation from 1939 is still accepted as an informal standard to calculate friction factor during the turbulent flow (4000 < Re < 10⁸) through pipes from smooth with almost negligible relative roughness (ε/D→0) to the very rough (up to ε/D = 0.05) inner surface. The Colebrook equation contains flow friction factor λ in implicit logarithmic form where it is, aside of itself; λ, a function of the Reynolds number Re and the relative roughness of inner pipe surface ε/D; λ = f (λ, Re, ε/D). To evaluate the error introduced by many available explicit approximations to the Colebrook equation, λ ≈ f(Re, ε/D), it is necessary to determinate value of the friction factor λ from the Colebrook equation as accurate as possible. The most accurate way to achieve that is using some kind of iterative methods. Usually classical approach also known as simple fixed point method requires up to 8 iterations to achieve the high level of accuracy, but does not require derivatives of the Colebrook function as here presented accelerated Householder’s approach (3^rd order, 2^nd order: Halley’s and Schröder’s method and 1^st order: Newton-Raphson) which needs only 3 to 7 iteration and three-point iterative methods which needs only 1 to 4 iteration to achieve the same high level of accuracy. Strategies how to find derivatives of the Colebrook function in symbolic form, how to avoid use of the derivatives (Secant method) and how to choose optimal starting point for the iterative procedure are shown. Householder’s approach to the Colebrook’s equations expressed through the Lambert W-function is also analyzed. One approximation to the Colebrook equation based on the analysis from the paper with the error of no more than 0.0617% is shown.

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.

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.

In the research we consider a structure-fluid interaction of oscillating piezodevice and acoustic liquid. Such problem requires finding resonance or anti-resonance frequencies of the solid structure to use them in the latter frequency-response analyses step. After finite element discretization of the issue, we need to solve a generalized eigenvalue problem (GEP). The most efficient numerical method for solving the partial GEP is the shift-and-invert Lanczos method. Each step of this algorithm requires solving a large scale system of linear algebraic equations (SLAEs) with special properties. Various ways of ordering grid nodes lead to coefficient matrices with different structure. Several methods are compared in terms of efficiency. The results of the numerical experiments are presented.

In real-life scenario, there are many mathematical tools to handle the incomplete and imprecise data. One of them is the fuzzy approach. This article aims to contribute to the literature of fuzzy multi-objective dynamic programming issues involving the fuzzy objective functions. The piecewise quadratic fuzzy numbers characterize these fuzzy parameters. Some basic notions in the problem under the α-pareto optimal solution concept is redefined and analyzed to study the stability of the problem. Furthermore, a technique, named as enhancing decomposition approach, is presented for achieving a subset for the parametric space that contains the sameα-pareto optimal solution. For a better understanding and comprehension of the suggested concept, a numerical example is provided.

The methods for constructing solutions to integro-differential equations of the Volterra type are considered. The equations are related to fractional conformable derivatives. Explicit solutions of homogeneous and inhomogeneous equations are constructed and a Cauchy-type problem is studied. It should be noted that the considered method is based on the construction of normalized systems of functions with respect to a differential operator of fractional order.

A method of solution to solve the compressible unsteady 3D Navier-Stokes Equations in cylindrical co-ordinates coupled to the continuity equation in cylindrical coordinates is presented in terms of an additive solution of the three principle directions in the radial, azimuthal and z directions of flow. A dimensionless parameter is introduced whereby in the large limit case a method of solution is sought for in the boundary layer of the tube. A reduction to a single partial differential equation is possible and integral calculus methods are applied for the case of a body force directed to the centre of the tube to obtain an integral form of the Hunter-Saxton equation. Also an extension for a more general body force is shown where in addition there is a rotational force applied.

AGI could arise within the next decades, promising a decisive strategic advantage. This paper discusses risks, associated with the development of AGI: destabilizing effects on strategic balance, underestimating risks in the interest of victory in the race, egoistically exploiting the huge benefits by a tiny minority. Further: Developed AGI could be beyond human control. Human goals could not be implemented and an intelligence explosion to superintelligence could take place leading to a total loss of control and power. If competition for AGI is non-transparent, secret, uncontrolled and not regulated, it’s possible that risks could not be managed and would lead to catastrophic consequences. The danger corresponds to that of nuclear weapons. It is crucial that the key actors of a possible AI Race agree at an early stage on the prevention and transparent regulation of a possible AI Race - similar to measures to secure strategic stability, on arms control measures, disarmament, and prevention of the proliferation of nuclear weapons. The realization that an uncontrolled AI race can lead to the extinction of humanity - this time even independent of human will – requires analogous measures to contain, prevent, regulate and secure an AI race within the framework of AGI development.

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.

Density distribution function of classical statistical mechanics is generally generalized as a product of a general complex function and its complex Hermitian conjugate function, and the average of classical statistical mechanics is generalized as the average of the quantum mechanics. Furthermore, this paper derives three ones of the five axiom presumptions of quantum mechanics, e.g., deduces Schrȍdinger equation by two general ways, makes the three axiom presumptions into three theorems of quantum mechanics, not only solves the crisis to hard understand, but also gets new theories and new discoveries, e.g., this paper solves the crisis of the origin of the wave-particle duality, derives operators, eigenvalues and eigenstates, deduces commutation relations for coordinate and momentum as well as the time and energy, and discovers quantum mechanics is just a generalization ( mechanics ) theory of the complex square root of ( real density function of ) classical statistical mechanics. Quantum mechanics being just a generalization theory of the complex square root of classical statistical mechanics is both new physics and revolutionary discovery, which are affecting people’s deep philosophical thinking for modern physics development, solve all the crisises of quantum mechanics, quantum information and so on, and make quantum mechanics have scientific solid bases being checked and both no basic axiom presumption and no all the quantum strange incomprehensible properties, because classical statistical mechanics and the complex square root of classical statistical mechanics have the scientific solid bases being checked. In addition, this paper discovers the reason no taking the time derivative of space coordinates in Schrȍdinger equation. Therefore, this paper gives solution to the crisis of the first quantization origin, and mainly deduces quantum physics no all the quantum current strange incomprehensible properties.

The natural product Salvinorin A (SalA) was the first nitrogen-lacking agonist discovered for the opioid receptors and exhibits high selectivity for the kappa opioid receptor (KOR) turning SalA into a promising analgesic to overcome the current opioid crisis. Since SalA’s suffers from poor pharmacokinetic properties, particularly the absence of gastrointestinal bioavailability, fast metabolic inactivation and subsequent short duration of action, the rational design of new tailored analogs with improved clinical usability is highly desired. Despite being known for decades, the binding mode of SalA within the KOR remains elusive as several conflicting binding modes of SalA were proposed hindering the rational design of new analgesics. In this study, we rationally determined the binding mode of SalA to the active state KOR by in silico experiments (docking, molecular dynamics simulations, dynophores) in the context of all available mutagenesis studies and structure-activity relationship (SAR) data. To the best of our knowledge this is the first comprehensive evaluation of SalA’s binding mode since the determination of the active state KOR crystal structure. SalA binds above the morphinan binding site with its furan pointing towards the intracellular core while the C2-acetoxy group is oriented towards the extracellular loop 2 (ECL2). SalA is solely stabilized within the binding pocket by hydrogen bonds (C210ECL2, Y3127.35, Y3137.36) and hydrophobic contacts (V1182.63, I1393.33, I2946.55, I3167.39). With the disruption of this interaction pattern or the establishment of additional interactions within the binding site we were able to rationalize the experimental data for selected analogs. We surmise the C2-substituent interactions as important for SalA and its analogs to be experimentally active, albeit moderate frequency within MD simulations of SalA. We further identified the non-conserved residues 2.63, 7.35, and 7.36 responsible for the KOR subtype selectivity of SalA. We are confident that the elucidation of the SalA binding mode will promote the understanding of KOR activation and the facilitate the development of novel analgesics that are urgently needed.

The aim of this paper is to deep into the dynamic study of the well known Chebyshev-Halley family of iterative methods for solving nonlinear equations. Our objetives are twofold: one the one hand, we are interested in characterize the existence of extraneous attracting fixed points when the methods in the family are applied to polynomial equations. On the other hand, we are also interested in study the free critical points of the methods in the family, as a previous step to determine the existence of attracting cycles. In both cases, we want to identify situations where the methods in the family have a bad behavior from the root-finding point of view. Finally, and joining these two studies, we look for polynomials for which there are methods in the family where this two situations happen simultaneously. That is, the rational map obtained by applying a method in the Chebyshev-Halley family to a polynomial has both super-attracting extraneous fixed point and super-attracting cycles different to the roots of the polynomial.

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.

The splitting method developed in a previous study for linear, multi – component, convection-diffusion mass transfer equations is extended to non-linear, multi-component, convection-diffusion mass transfer equations. The diffusion term is non-linear (the diffusion coefficients depend on chemical species concentrations). Theoretical results about the splitting error are presented, as well as numerical simulations for mixtures with n ≤ 5. The numerical experiments show second-order accuracy and stability for the present splitting algorithm.

In this paper we totally discard the traditional trial-and-error algorithms of choosing acceptable shape parameter c in the multiquadrics $-\sqrt{c^{2}+\|x\|^{2}}$ when dealing with differential equations. Instead, we choose c directly by the MN-curve theory and hence avoid the time-consuming steps of solving a linear system required by each trial of the c value in the traditional methods. The quality of the c value thus obtained is supported by the newly born choice theory of the shape parameter. Experiments show that the approximation error of the approximate solution to the differential equation is very close to the best approximation error among all possible choices of c.

In this paper, we investigate an analytical solution of a class of nonlinear fractional integro-differential equation base on a generalized fractional power series expansion. The fractional derivatives are described in the conformable's type. The new approach is a modified form of the well-known Taylor series expansion. The illustrative examples are presented to demonstrate the accuracy and effectiveness of the proposed method

In this paper, we employ fuzzy Sumudu transform for solving system of linear fuzzy differential equations with fuzzy constant coefficients. The system with fuzzy constant coefficients is interpreted under strongly generalized differentiability. For this purpose, new procedures for solving the system are proposed. A numerical example is carried out for solving system adapted from fuzzy radioactive decay model. Conclusion is drawn in the last section and some potential research directions are given.

In this paper, we present a new parametric class of optimal fourth-order iterative methods to estimate the solutions of nonlinear equations. After the convergence analysis, we study the stability of this class by using the tools of complex discrete dynamics. This allows us to select those elements of the class with lower dependence on initial estimations. We verify by means of numerical tests that the stable members on quadratic polynomials perform better than the unstable ones, when applied to other non-polynomial functions. We also compare the performance of the best elements of the family with known methods, such as the schemes by Newton or Chun, among others, showing robust and stable behaviour.

The Physics-Informed Neural Networks (PINNs) improve the efficiency of data utilization by combining physical principles with neural network algorithms and ensure that the predictions are consistent and stable with the physical laws. PINNs opens up a new approach to address inverse problems in fluid mechanics. Based on the single-relaxation-time lattice Boltzmann method (SRT-LBM) with the Bhatnagar-Gross-Krook (BGK) collision operator, the PINN-SRT-LBM model is proposed in this paper for solving the inverse problem in fluid mechanics. The PINN-SRT-LBM model consists of three components. The first component involves a deep neural network that predicts the equilibrium control equations in different discrete velocity directions within SRT-LBM. The second component employs another deep neural network to predict non-equilibrium control equations, enabling inference of the fluid's non-equilibrium characteristics. The third component, a physics informed function translates the outputs of the first two networks into physical infor-mation. By minimizing the residuals of the physical partial differential equations (PDEs), the physics informed function infers relevant macroscopic quantities of the flow. The model evolves two sub-models applicable to different dimensions, named PINN-SRT-LBM-I and PINN-SRT-LBM-II models according to the construction of the physical informed function. The innovation of this work is the introduction of SRT-LBM and discrete velocity models as physical drivers into the neural network through the interpretation function. Therefore, PINN-SRT-LBM allows the neural network to handle inverse problems of various dimensions and focus on problem-specific solving. Experimental results confirm the accurate prediction of flow infor-mation at different Reynolds numbers within the computational domain. Relying on the PINN-SRT-LBM models, inverse problems in fluid mechanics can be solved efficiently.

This paper briefly reviews the state of the art in artificial intelligence including inductive and deductive methods. Deep learning and ensemble machine learning lie in inductive methods while automated reasoning implemented in deductive computer languages (Prolog, Otter, and Z3) is based on deductive methods. In the inductive methods, intelligence is inferred by pseudorandom number for creating the sophisticated decision trees in Go (game), Shogi (game), and quiz bowl questions. This paper demonstrates how to wisely use the pseudorandom number for solving coin-weighing puzzles with the deductive method. Monte Carlo approach is a general purpose problem-solving method using random number. The proposed method using pseudorandom number lies in one of Monte Carlo methods. In the proposed method, pseudorandom number plays a key role in generating constrained solution candidates for coin-weighing puzzles. This may be the first attempt that every solution candidate is solely generated by pseudorandom number while deductive rules are used for verifying solution candidates. In this paper, the performance of the proposed method was measured by comparing with the existing open source codes by solving 12-coin and 24-coin puzzles respectively.

In this paper, we introduce as a pedagogical strategy an internal division-free, straightforward, and symmetrically progressing algorithm in manually computing matrix inverse and solving systems of linear equations by revisiting the application of elementary row operations in the Gauss-Jordan reduction method and connecting it to the determinant method. The proposed cross-multiplication-flip (CMF) algorithm employs cross-multiplication similar to the butterfly movement in computing determinants as a strategic application of elementary row operations to efficiently reduce the rows and then applies flipping of rows and entries to put an upper triangular matrix into lower triangular form to continue the reduction process.

Traveling salesman problems (TSPs) are well-known combinatorial optimization problems, and most existing algorithms are challenging for solving TSPs when its scale is large. To improve the efficiency of solving large-scale TSPs, this work presents a novel adaptive layered clustering framework with improved genetic algorithm (ALC\_IGA). The primary idea behind ALC\_IGA is to break down a large-scale problem into a series of small-scale problems. First, the $k$-means and improved genetic algorithm are used to segment the large-scale TSPs layer by layer and generate the initial solution. Then, the developed two phases simplified $2$-opt algorithm is applied to further improve the quality of the initial solution. The analysis reveals that the computational complexity of the ALC\_IGA is between $O(n\log n)$ and $O(n^2)$. The results of numerical experiments on various TSP instances indicate that, in most situations, the ALC\_IGA surpasses the state-of-the-art algorithms in convergence speed, stability, and solution quality. Specifically, the ALC\_IGA can solve instances with $2 \times 10^5$ nodes within 0.15h, $1.4 \times 10^6$ nodes within 1h, and $2 \times 10^6$ nodes in three dimensions within 1.5h.

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.

In this article, one-dimensional viscous quantum hydrodynamical model of semiconductor devices is numerically investigated. The model treats the propagation of electrons in a semiconductor device as the flow of a charged compressible fluid. It plays an important role in predicting the behavior of electron flow in semiconductor devices. The nonlinear viscous quantum hydrodynamic models contain Euler-type equations for density and current, viscous and quantum correction terms, and a Poisson equation for electrostatic potential. Due to high nonlinearity of model equations, numerical solution techniques are applied to obtain their solutions.. The proposed numerical scheme is a splitting scheme based on the kinetic flux-vector splitting (KFVS) method for the hyperbolic step, and a semi-implicit Runge-Kutta method for the relaxation step. The KFVS method is based on the direct splitting of macroscopic flux functions of the system on the cell interfaces. The second order accuracy of the scheme is achieved by using MUSCL-type initial reconstruction and Runge-Kutta time stepping method. Several case studies are considered. For validation, the results of current scheme are compared with those obtained from the splitting scheme based on the NT central scheme. The effects of various parameters such as device length, viscosities, different doping and voltage are analyzed. The accuracy, efficiency and simplicity of the proposed KFVS scheme validates its generic applicability to the given model equations.

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.

This paper studies an effective finite difference scheme for solving two-dimensional Heston stochastic volatility option pricing model problems. A dynamically balanced up-downwind strategy for approximating the cross-derivative is implemented and analyzed. Semi-discretized and spatially nonuniform platforms are utilized. The numerical method comprised is simple, straightforward with reliable first order overall approximations. The spectral norm is used throughout the investigation and numerical stability is proven. Simulation experiments are given to illustrate our results.

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.

A swarm based nature-inspired optimization algorithm namely fruit fly optimization algorithm (FOA) has simple structure and ease of implementation. However, FOA has a low success rate and a slow convergence because FOA generates new positions around the best location using fixed search radius. Several improved FOAs have been proposed. But their exploration ability is questionable. To make the search process to transit from the exploration phase to the exploitation phase smoothly, this paper proposes a new FOA constructed from a cooperation of the multileader and the probabilistic random walk strategies (CPFOA). It has two population types working together. CPFOA's performance is evaluated by 18 well-known standard benchmark, and 30 CEC’2017 functions. The results showed that CPFOA outperforms both the original FOA and its variants in terms of convergence speed and performance accuracy. The results base on CEC’2017 show that CPFOA can achieve a very promising accuracy when compared with the well-known competitive algorithms. CPFOA is applied to optimize two applications; the MLPs classifying real datasets and extracting parameters of T-S fuzzy system for modelling Box and Jenkins gas furnace data set. CPFOA can find parameters having a very high quality compared with the best known competitive algorithms.

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, improved matrix Reduction Method is proposed for the solution of fuzzy transportation problem in which all inputs are taken as fuzzy numbers. Since ranking fuzzy number is important tool in decision making, Fuzzy trapezoidal number is converting in to crisp set by using Mean techniques and solved by proposed method for fuzzy transportation problem. We give suitable numerical example for unbalanced and compare the optimal value with other techniques. The Result shows that the optimum profit of transportation problem using proposed technique under robust ranking method is better than the other method. Novelty: The numerical illustration demonstrates that the new projected method for managing the transportation problems on fuzzy algorithms.

There exist numerous high-dimensional problems in the real world which cannot be solved through the common traditional methods. The metaheuristic algorithms have been developed as successful techniques for solving a variety of complex and difficult optimization problems. Notwithstanding their advantages, these algorithms may turn out to have weak points such as lower population diversity and lower convergence rate when facing complex high-dimensional problems. An appropriate approach to solve such problems is to apply multi-agent systems along with the metaheuristic algorithms. The present paper proposes a new approach based on the multi-agent systems and the concept of agent, which is named Multi-Agent Metaheuristic (MAMH) method. In the proposed approach, several basic and powerful metaheuristic algorithms, including Genetic Algorithm (GA), Particle Swarm Optimization (PSO), Artificial Bee Colony (ABC), Firefly Algorithm (FA), Bat Algorithm (BA), Flower Pollination Algorithm (FPA), Gray Wolf Optimizer (GWO), Whale Optimization Algorithm (WOA), Crow Search Algorithm (CSA), Farmland Fertility Algorithm (FFA), are considered as separate agents each of which sought to achieve its own goals while competing and cooperating with others to achieve the common goals. In overall, the proposed method was tested on 32 complex benchmark functions, the results of which indicated effectiveness and powerfulness of the proposed method for solving the high-dimensional optimization problems. In addition, in this paper, the binary version of the proposed approach, called Binary MAMH (BMAMH), was executed on the spam email dataset. According to the results, the proposed method exhibited a higher precision in detection of the spam emails compared to other metaheuristic algorithms and methods.

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.