The container relocation problem (CRP) is one of the important topics in container terminals, which aims to find the optimal sequence of movements to minimize the total number of relocations needed to retrieve all the containers within a bay according to a given specific layout and retrieval order. However, determining such an order may be difficult due to uncertainty. Various CRP solution methods proposed so far show a common pitfall concerning the complexity of the solving process, whose scale grows exponentially with the number of containers. Considering the retrieval operation process of the inbound containers in a bay consists of several operation rounds, this paper focuses on the real-time operation scenario of each round to minimize the actual number of relocations during the pick-up process, i.e., starting from the initial layout of the bay, we minimize the sum of the incremental number of blocking containers due to the layout change and the number of reallocated containers unrelated to the target container. We present a heuristic algorithm (called SPFH) based on the three rules (LL, MSS, and FSS), considering the adjustment of the pick-up order of containers. Numerical experiments on a set of instances generated from the literature are performed. The proposed methodology excels in both execution efficiency and solution quality and is capable of solving instances that were impossible to solve before. This also makes our methods appealing for being applied in practice. The source codes are available at https://github.com/zhou-sf/rt-scrp.

There are many problems based on solving non-autonomous differential equations of the form x¨(t)+ω2(t)x(t)=0, where x(t) represents the coordinate of a material point and ω is the angular frequency. The inverse problem involves finding the bounded coefficient ω. Continuity of the function ω(t) is not required. The trajectory x(t) is unknown, but the initial and final values of the phase variables are given. The variation principle of minimum time for the entire dynamic process allows for the determination of the optimal solution {x(t),ω(t)}. Thus, the inverse problem is an optimal control problem. No simplifying assumptions were made.

This paper presents a new semi-explicit algorithm for parameters estimation in a time-fractional generalization of dual-phase-lag heat conduction model with the Caputo fractional derivatives. It is shown that this model can be derived from a general linear constitutive relation for the heat transfer by conduction when the heat conduction relaxation kernel contains the Mittag-Leffler function. The model can be used to describe heat conduction phenomena in a material with power-law memory. The proposed algorithm of parameters estimation is based on the time integral characteristics method. The explicit representations of the thermal diffusivity and the fractional analogues of the thermal relaxation time and the thermal retardation are obtained via a Laplace transform of the temperature field and utilized in the algorithm. An implicit relation is derived for the order of fractional differentiation. In the algorithm, this relation is resolved numerically. An example illustrates the proposed technique.

In this paper, the P versus NP problem is studied based on a six-dimensional space-time perspective. The gap between the P-class and NP-class arises from the relationship between time and the solution, as well as the answer that is independent of time. The complexity of solving a problem depends on the time dependence of the answer. Solving problems whose answers do not depend on the passage of time is very difficult and impossible. Like the description of the gravitational factor in Newtonian physics, NP class problems require different mathematical tools. Based on the generalization of physical facts in mathematics, based on six-dimensional space-time, a method to solve problem P versus NP problem has been stated. The results of this study offer a fresh insight into information processing that occurs independent of the passage of time.

We argue that the problem of time is not a crucial issue inherent in the quantum picture of the universe evolution. On the minisuperspace model example with the massless scalar field, we demonstrate four approaches to the description of quantum evolution, which give similar results explicitly. The relevance of these approaches to building a quantum theory of gravity is discussed.

This article introduces a novel three-phase angular perturbation technique for solving the School Bus Problem (SBP), an NP-hard combinatorial optimization challenge. The three phases—initial solution, global and local search, and solution exploration—focus on optimizing school bus routes by minimizing sharp turns and reducing travel distances. The performance of three metaheuristic algorithms (GAACOSA-AP, BFSPSO-AP, RL-AP) is evaluated, and significant improvements in routing efficiency are observed. we evaluated the performance of our hybrid algorithm against the industry-leading optimization software, CPLEX, and other optimization techniques across multiple school scenarios. The results show that the GAACOSA-AP algorithm consistently outperforms its counterparts, achieving substantial reductions in travel distances, particularly for complex routes with numerous stops. The integration of Angular Perturbation was key to improving route geometry by, reducing sharp turns, and enhancing overall path optimization by an average reduction of 27.12% compared to 22.37% without Angular Perturbation.

This paper proposes a novel formulation of the fuzzy newsvendor problem for inventory management applications. This new formulation allows the use of any profit function. A new credibility estimation is proposed to explore the neighborhood around the most impactful demand scenarios. Further, a simulation procedure was designed for the different demand scenarios, which allows the comparison of the proposed approach with probabilistic demand curves. The fuzzy newsvendor problem is solved using a modified genetic algorithm (GA), where an initialization mechanism with null values is proposed. The new formulation of the fuzzy newsvendor problem together with the modified GA have shown to improve the average profit up to 55% in problems with low-budget scenarios.

The development of the smart city concept and the inhabitants’ need to reduce travel time, as well as society’s awareness of the reduction of fuel consumption and respect for the environment, lead to a new approach to the classic problem of the Travelling Salesman Problem (TSP) applied to urban environments. This problem can be formulated as “Given a list of geographic points and the distances between each pair of points, what is the shortest possible route that visits each point and returns to the departure point?” Nowadays, with the development of IoT devices and the high sensoring capabilities, a large amount of data and measurements are available, allowing researchers to model accurately the routes to choose. In this work, the purpose is to give solution to the TSP in smart city environments using a modified version of the metaheuristic optimization algorithm TLBO (Teacher Learner Based Optimization). In addition, to improve performance, the solution is implemented using a parallel GPU architecture, specifically a CUDA implementation.

On the H-type group G⊂Rm×Rn, we study the existence of solutions for the Brezis-Nirenberg problem

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 demonstrates a global, non-parametric, non-iterative optimization of time-mean value of a kind of index vibrated by time-varying forcing. It is based on the fact that the (steady) forced vibration of non-autonomous ordinary differential equation systems is well approximated by an analytical solution when the amplitude of forcing is sufficiently small and its base state without forcing is linearly stable and steady. It is applied to optimize a time-averaged heat-transfer rate on a two-dimensional thermal convection field in a square cavity with horizontal temperature difference, and the globally optimal way of vibrational forcing, i.e. the globally optimal, spatial distribution of vibrational heat and vorticity sources, is first obtained. The maximized vibrational thermal convection corresponds well to the state of internal gravity wave resonance. In contrast, the minimized thermal convection is weak, keeping the boundary layers on both sidewalls thick.

Cosmic inflation has presented solutions for a number of important cosmological problems, yet left some unanswered. In this paper, we present a cosmological model based on the quantization of the zero-point field which is consistent with empirical data, requires fewer assumptions, and presents answers to some of those unanswered questions. A comparison between standard cosmology and the theory presented in this paper is given below. Vacuum energy density: Standard inflationary model needs both Hubble’s constant and Matter density to estimate it. But, new cosmological model needs only Hubble’s constant. Non-vacuum energy density: Standard model can’t predict it. But, the new model can predict using only Hubble’s constant. Ratio of vacuum energy to total energy: Standard model can’t predict it. But, new model can predict it, that too without using Hubble’s constant. Energy conservation: In standard model, total energy is not conserved before inflation. But, in the new model, energy is conserved right from beginning of the universe whose net energy (including gravitational potential energy) is always zero. Flatness and homogeneity: Standard model needs Inflaton field with a specific potential energy distribution to explain it. But, new model doesn’t need any such hypothetical field, just the zero-point field is sufficient. Based on the new cosmological model, in the conclusion, realistic possibility for existence of multiverse and a mechanism for end of universe are discussed.

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

This paper proposes an electric vehicle routing problem with considering states of charging stations and suggests solution strategies. Charging of electric vehicles is a main issue in the field of electric vehicle routing problem. There are many studies to find locations of charging stations, recharging functions for batteries of vehicles, and so on. However, states of charging stations significantly affect the routes of electric vehicles, which is not much explored. The states may include open or close of charging stations, occupied or empty of charging slots, and so on. This paper investigates how the states of charging stations are estimated and routing strategies are determined. We formulate a mixed integer programming model and suggest how to solve the problem with exact method. Numerical examples provide the optimal routing strategies of electric vehicles in the changing environments of the states of charging stations.

This paper presents a cooperative parallel tabu search meta-heuristic for the vehicle routing problem with time windows. It is based on the scheme in which several search threads cooperate by asynchronously exchanging information on the best solutions identified. The exchanges are performed through a mechanism called adaptive memory which holds and manages a pool of solutions. This enforces the asynchronous strategy of information exchanges and ensures the independence of the individual search threads. Each of these independent threads implements a tabu search meta-heuristic. Comprehensive computational experiments and comparisons to best known solutions show that the proposed cooperative parallel tabu search algorithm is able to achieve 48 new best solutions on VRPTW benchmark instances.

The capacitated team orienteering problem with time windows (CTOPTW) is a NP-hard combinatorial optimization problem. In the CTOPTW, a set of customers is given each with a profit, a demand, a service time and a time window. A homogeneous fleet of vehicles is available for serving customers and collecting their associated profits. Each vehicle is constrained by a maximum tour duration and a limited capacity. The CTOPTW is concerned with the determination of a preset number of vehicle tours that begin and end at a depot, visit each customer no more than once while satisfying the time duration, time window and vehicle capacity constraints on each tour. The objective is to maximize the total profit collected. In this study we propose an iterated local search (ILS) algorithm to deal with the CTOPTW. ILS is a single solution based meta-heuristic that successively invokes a local search procedure to explore the solution space. A perturbation operator is used to modify the current local optimum solution in order to provide a starting solution for the local search procedure. As different problems and instances have different characteristics, the success of the ILS is highly dependent on the local search procedure, the perturbation operator(s) and the perturbation strength. The basic ILS uses a single perturbation operator and the perturbation strength remains the same during the optimization process. To address these issues, we use three different perturbation operators and a varying perturbation strength which changes as the algorithm progresses. The idea is to assign a larger perturbation strength in the early stages of the search in order to focus on exploring the search space. The perturbation strength is gradually decreased so that we focus more on exploitation. The computational results show that the proposed ILS algorithm is able to generate high quality solutions on the CTOPTW benchmark instances taken from the scientific literature, demonstrating its efficiency in terms of both the solution quality and computational time. Moreover, the proposed ILS produces 21 best known results and 5 new best solutions.

This paper addresses the cosmological constant problem, a significant discrepancy highlighted by \cite{Weinberg:1988cp} that underlines a fundamental inconsistency between quantum field theory (QFT) and general relativity (GR). QFT examines matter dynamics within Lorentzian spacetime under standard model symmetry, while GR uses Riemannian geometry but adapts it to ensure local Lorentzian behavior in small regions. Despite the experimental successes of both theories, a major challenge exists in theoretical understanding. This letter seeks to clarify this critical misunderstanding. As the universe cools from its hot beginning, the \(SU(3) \times SU(2) \times U(1)\) standard model gauge symmetry evolves. This symmetry breaks to \(SU(3) \times U(1)\) upon cooling at the electroweak scale and ultimately to \(SU(3)\) alone as temperatures approach near-absolute zero kelvin, facilitated by the experimental Meissner effect. This suggests that \(SU(3)\) symmetry forms the foundational "atoms" of vacuum energy. Calculating the number of \(SU(3)\) vacuum atoms across the universe results in a value that perfectly aligns the theoretical predictions with the observed vacuum energy densities, thereby resolving the cosmological constant problem. Since \(SU(3)\) atoms account for the cosmological constant, they must be unbreakable. The third law of thermodynamics, which states that it is impossible to reach absolute zero Kelvin, provides the protection that prevents SU(3) atoms from breaking at zero Kelvin. This reveals the connection between the third law of thermodynamics and the quark confinement. This leads to the \(SU(3)\) atom creating a mass gap within the universe. This solution serves as a symmetric evidence of gauge-gravity duality as well as gravity-superconductor duality.

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

The work is devoted to the study of a family of linear initial value problems of partial differential equations in the complex domain, dealing with two complex time variables. The use of a truncated Laplace-like transformation in the construction of the analytic solution allows to overcome a small divisor phenomenon arising from the geometry of the problem and represents an alternative approach to the one proposed in a recent work by the first two authors. The result leans on the application of a fixed point argument and the classical Ramis-Sibuya theorem.

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.

Use of MS Excel as a platform for teaching simple iterative solution of partial differential equations runs into issues of reliability of the computation because of the large number of calculations required. This article documents the problem and an empirical solution. The cause of this unreliability was found by detailed examination of the numerical results from three simultaneous iterations. Computers of several types from different manufacturers were found to fail occasionally in updating variables in the numerical iteration. A simple work-around is suggested and was tested on several platforms.

In this paper, we explore the surprising behavior of certain discrete maps, drawing inspiration from Collatz-like problems and advanced techniques in analytic number theory, dynamical systems, and differential geometry. Specifically, we investigate a driven cubic-quintic Duffing equation and predict the number of limit cycles around equilibrium points. Furthermore, we develop a novel theoretical framework for chaos suppression in damped-driven systems, leveraging sequences derived from Collatz-like problems. Our study also focuses on analyzing the density of these sequences in both Euclidean and Riemannian metric spaces, providing a comparative analysis of their distribution properties. We estimate the growth rate of sequence density analytically and numerically, highlighting the sensitivity of the density values to the choice of parameters in both metric spaces. Our results present new insights into the behavior of these sequences and their implications for number theory, chaotic dynamics, and geometric analysis.

A consistent theory of quantum entanglement requires that constituent single-particle states belong to the same Hilbert space, the coherent eigenstates of a complete set of operators in a given representation, defined with respect to a shared continuous parameterization. Formulating such eigenstates for a single relativistic particle with spin, and applying them to the description of many-body states, presents well-known challenges. In this paper, we review the covariant theory of relativistic spin and entanglement in a framework first proposed by Stueckelberg and developed by Horwitz, Piron, et.\ al. This approach modifies Wigner's method by introducing an arbitrary timelike unit vector $n^\mu$ on which one induces a representation of $SL(2,C)$, rather than induce on the spacetime momentum $p^\mu$. Generalizing this approach, we construct relativistic spin states on an extended phase space $\{(x^\mu,p^\mu),(\zeta^\mu,\pi^\mu)\}$, inducing a representation on the momentum $\pi^\mu$, thus providing a novel dynamical interpretation of the timelike unit vector $n^\mu = \pi^\mu / M$. Studying the unitary representations of the Poincar\'e group on the extended phase space allows us to define basis quantities for quantum states and develop the gauge invariant electromagnetic Hamiltonian in classical and quantum mechanics. We write plane wave solutions for free particles and construct stable singlet states, and relate these to experiments involving temporal interference, analogous to the spatial interference known from double slit experiments.

Near-field (NF) integrated sensing and communication (ISAC) has the potential to revolutionize future wireless networks. It enables simultaneous communication and sensing operations on the same radio frequency (RF) resources using a shared hardware platform, maximizing resource utilization. NF-ISAC systems can improve communication and sensing performance compared to traditional far-field (FF) ISAC systems by employing the unique propagation characteristics of NF spherical waves with an additional distance dimension. Despite its potential, the NF-ISAC literature covers just a few specialized topics. A comprehensive survey encompassing all aspects of NF-ISAC systems has thus far been lacking. To this end, this paper systematically explores the prodigious potential of NF-ISAC technology. Specifically, an in-depth analysis of both NF and FF systems is provided, investigating their applicability in communication and sensing scenarios. Various channel model scenarios for NF and FF are discussed, emphasizing their distinguishing features. The advantages and philosophies of ISAC are further explored, opening opportunities to investigate both narrow-band and wide-band systems within NF ISAC. Case studies and simulation examples for each NF-ISAC design philosophy are provided to gain deeper insights into these system designs. An extensive literature review of existing NF-ISAC studies is conducted, exploring various methodologies, potentials, prospects, and conclusions. Finally, prospective research areas, remaining challenges, and applications of future NF-ISAC systems are discussed.

Bandung and Lembang are the cities that are chosen by many tourists (local and foreign) as their destinations. Geographically, these cities are placed side-by-side and each city has its own characteristics. As in Bandung, there are many hotels and culinary spots, meanwhile, in Lembang, there are many scenery tourism spots. Tourists usually have limited time to visit all the destinations on holiday, which makes them choose several tourist destinations to visit. In this paper, the tourism itinerary recommendation system is proposed by calculating the most optimal route between destinations and approaching the Vehicle Routing Problem with Time Windows. The optimal route is defined by using Dijkstra the shortest path algorithm by using the collaboration between the road information (road length, traffic condition, travel time, and weather condition) and criteria weight that is determined using the Analytics Hierarchy Process as the graph weights. According to the simulation results, the criteria weights are 6.9%, 62.7%, 18.6%, and 11.9% for Route Length, Traffic Condition, Travel Time, and Weather Condition respectively. Moreover, the optimal number of tourism itinerary plans for the tourist in this research is 4 destinations. As the usage of computational resources, it takes 31.8% of CPU and 61.9% of Memory usage. For the time processing, it increases exponentially as the increment of number of requested stops. The output of this research is expected to be a solution to the tourist itinerary plan, especially in Bandung and Lembang.

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

When discussing the Diophantine quintic equation $p(a^5 + b^5) = q(c^5 + d^5)$ where p is a prime and q is an integer, there is a clear gap between the mathematical literature and online forums. Because of the intrinsic complexity of parameterizing fifth-degree equations, this equation re- mains largely unexplored. In this work, we approach this quintic problem through algebraic methods with the goal of providing numerical solutions that illuminate its properties and behaviors.Our research uncovers in- triguing patterns and connections that shed light on the enigmatic nature of Diophantine quintic equations in this particular form.

In this study, we focus on the vibration-damping devices within the renowned physical experimental apparatus—STM. Utilizing GeoGebra software and Python, we meticulously elucidate the principle by which the vibrations of the damper are damped in a magnetic field, thereby achieving the vibration-damping functionality of the entire system. This approach not only fosters a clear physical conceptualization but also ensures the acquisition of accurate and comprehensive knowledge. Furthermore, the inquiry demonstrates the process of problem clarification facilitated by the use of software tools and then we compare the power of the widlely programming language--Python and the GeoGebra.

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.

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

In this paper, we investigate a class of hierarchical variational inequalities (HVIPs, i.e., strongly monotone variational inequality problems defined on the solution set of multiple-set split common fixed point problems) with quasi-pseudocontractive mappings in real Hilbert spaces, which special cases can be found in many important engineering practical applications such as image recognizing, signal processing and machine learning. In order to solve HVIPs of potential application value, inspired by the primal-dual algorithm, we propose a novel accelerated cyclic iterative algorithm that combines the inertial method with a correction term and a self-adaptive step-size technique. Our approach eliminates the need for prior knowledge of the bounded linear operator norm. Under appropriate assumptions, we establish strong convergence of the algorithm. Finally, we apply our novel iterative approximation to solve multiple-set split feasibility problems and verify the effectiveness of the proposed iterative algorithm through numerical results.

In this paper, I introduce a new concept of representing numbers in base ; in other words, I have found new series for any number similar to series that could be written according to the collatz sequence which is called zi(n) in this article. These series need to end with 1. Then, we use two sets of rules to make a diagram which then proves the existence of such series for any number.In this diagram, by branching numbers into different branches in accordance to the modularity of 4 and continuing branching to the point that their numbers have enough common terms in their collatz series, we could reduce zi(n) to zi(k) so that k<n in any branch by Rule Number One. This diagram shows that zi(n) exists for every number, in other words, this proves the theorem (A) or zi-existence theorem. The proof of zi-existence theorem leads to a proof of the collatz conjecture because the collatz series could be written as a linear combination of such series that all of them end with 1, so the collatz series for any number ends with 1.

The present era of the Internet of Things (IoT) having intelligent functionalities in solving problems pertaining to realtime mission-critical systems has brought an immense revolution in diverse fields including healthcare and navigation systems. However, to the best of our knowledge, the potential of IoT has not been fully exploited yet in the field of the energy sector. We argue that there is an immense need to shift the traditional mission-critical electric power system architecture to IoT-based fully orchestrated architecture in order to increase efficiency, as billions of investment is reserved for the energy sector globally. Since network orchestration deals with auomating the interaction between multiple components involved to execute a particular service, therefore, scheduling the relevant processes within strict deadlines becomes the core pillar of the architecture. The mission-critical systems with urgent task execution often suffer from issues of missing task deadlines. In this study, we present a novel IoT task orchestration architecture for efficient energy management of a nanogrid system that focuses on minimizing the use of nonrenewable energy resources and maximizing the use of renewable energy resources. Moreover, major components of IoT task orchestration such as task mapping and task scheduling are also enhanced using NLP and PSO optimization modules. The proposed task scheduling algorithm incorporates the optimized surplus time, and efficiently executes the energy management-related tasks contemplating to their types. The study utilizes sensors to obtain data from physical IoT devices, including photovoltaic (PV), Energy Storage System (ESS), and diesel generator (DG). The performance of the proposed model is evaluated using data set of nanogrid houses. The outcomes revealed that IoT-task orchestration has played a pivotal role in efficient energy management for nanogrid mission-critical system. Furthermore, the comparison with state-of-the-art scheduling algorithms showed that the task starvation rate is reduced to 16% and 12% when compared with RR and FEF algorithms, respectively.

We study a localization of gravity through the matching point between non-inertial frames and local inertial frames. This localization of gravity is done through defining relative gravitational red-shift. This lead to an emergence of a timeless state in a mathematically consistent way. In this timeless state of gravity, we find a geometric interpretation of the speed of light and mass. The experimental support of the timeless state is the quantum entanglement and internal symmetries that are independent of time. Therefore gravity would be responsible for measurements independent of time including quantum entanglement. Timeless state in that sense explain why do we have gravity/gauge correspondence. We conjecture that the universe emerged from a black hole with a global $SU(3)\times SU(2)\times U(1)$ symmetry on its event horizon that produces gauge fields Electromagnetism, weak and strong nuclear force through localization of this global symmetry. Through the localization in the gravity field, the timeless measurements such as spin will be correlated with the varying of timeless measurement which is relative gravitational red-shift. We present a gravitational or geometric interpretation of spin-0, spin-1, and spin-1/2 states. We present an interpretation of why do we measure matter rather than anti-matter. We found that the Higgs scalar field is represented by the gravitational red-shift at every point in the space around the black hole. We derive the numerical value of the cosmological constant that agrees with experimental observations.

This paper is a slightly modified, abridged version of a previous work ``Parametric Gevrey asymptotics in two complex time variables through truncated Laplace transforms'' motivated by our contribution in the conference ``Formal and Analytic Solutions of Diff. (differential, partial differential, difference, q-difference, q-difference-differential) Equations on the Internet'' (FASnet20). It aims to clarify and give further detail at some crucial points concerning the asymptotic behavior of the solutions of the problems studied in that work.

This paper is a slightly modified, abridged version of a previous work "Parametric Gevrey asymptotics in two complex time variables through truncated Laplace transforms'' motivated by our contribution in the conference "Formal and Analytic Solutions of Diff. (differential, partial differential, difference, q-difference, q-difference-differential) Equations on the Internet'' (FASnet20). It aims to clarify and give further detail at some crucial points concerning the asymptotic behavior of the solutions of the problems studied in that work.

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

This article describes an approach for optimising sensor-controlled systems through minimal intervention, utilising Fuzzy Linear Systems of Equations (FLSE). Staring with a generalised model of the system behaviour, incorporating an array of control units, environmental sensors, and an expert knowledge base. The described problems of detecting the level of intervention needed to change the system state to another is handled with the help of developed methods for solving the inverse problem for FLSE. By achieving minimal intervention, we ensure that system adjustments effective, economically optimal and non-intrusive. A MATLAB-based implementation is presented.

For decades, there has been worry regarding phytic acid's function in lowering mineral bioavailability. Given its widespread prevalence in nuts, grains, legumes, and oilseeds, it is critical to revisit this topic in light of contemporary eating trends. The food pyramid advocates increased cereal and grain consumption as the foundation of a healthy diet. Phosphorus is also an important macro-mineral nutrient for chicken, as it promotes growth, bone formation, genomic function, high-quality flesh, and egg production. Imbalanced organic phosphorus sources in the diet can reduce phosphorus digestibility and increase environmental contamination. Moreover, phytic acid is an antinutritional molecule present in cereals and staple crops including wheat, maize, rice, and sorghum, which chelates P and important divalent cations like Fe and Ca and zinc. As a result, these cations cannot be absorbed by monogastric animals or humans, and phytic acid inhibits nutritional intake, with levels inversely related to protein and starch digestibility. The environmental impact of phytate, a common organic phosphorus molecule, is substantial. It can contribute nutrients to algae blooms in lakes, causing eutrophication. Furthermore, phytate's stability in complexation with metal ions might inhibit enzymatic hydrolysis, influencing its destiny in agricultural soils. In this paper, we summarize several approaches to addressing the challenges associated with phytic acid's interaction with the environment.

The 3x+1 problem is a problem of continuous iteration for integers. According to the basic theorem of arithmetic and the way of iteration, we derive a general formula for continuous iteration for odd integers. Through this formula, we can construct a loop iteration equation and obtain the result of the equation: the equation has only one positive integer solution. In addition, this general formula can be converted into a linear indeterminate equation. The process of solving this equation shows that the relationship between the iteration result and the odd number being iterated is linear. Extending this result to all positive even numbers, we get the answer to the 3x + 1 question.

The cosmological model presented here rests on the postulate that the universe can be described as an interacting attraction (exerted by matter) and repulsion (exerted by the excitation energy of the quantum vacuum) system in virial equilibrium. The basic parameters of the model, the matter density and the excitation energy of the quantum vacuum are determined by observations and are not adjusted to the model. The model requires only a few assumptions that can be deduced from the laws of conventional physics and from the rules of quantum field theory. Existing problems in standard cosmology, such as the flatness and the horizon problems, among others, can be resolved in a straightforward way without inflation and without recourse to dark matter and dark energy.

In this paper, we propose a system of nonlinear mixed variational inequality problems, which consists of two elliptic mixed variational inequality problems on Banach spaces. Under suitable assumptions, using the Kakutani-Ky Fan fixed point theorem and Minty techniques, we prove the solution set to the system of nonlinear mixed variational inequality problem is nonempty, weakly compact and unique. Additionally, we suggest a stability result for the system of nonlinear mixed variational inequality problem by perturbing the duality mappings. Furthermore, we present an optimal control problem governed by the system of nonlinear mixed variational inequality problems and establish a solvability result.

Although general relativity has been successful in explaining many astronomical phenomena, few problems about the contents and evolution of the universe have remained mysterious since last century. Most important of them is the cosmological constant problem in which conventional calculation of vacuum (or dark) energy density using quantum mechanics leads to a value ~10¹¹⁴ J/m³ which is ~10¹²³ times more than the vacuum energy (5.3×10^-10 J/m³) estimated from astronomical observations of expanding universe. Similarly, cosmic coincidence problem questions why the matter energy density (ordinary plus dark matter) is of the same order as the vacuum energy density at present time. Finally, the mechanism responsible for spatial flatness and expansion of the universe are not clearly understood. In this paper, by taking the vacuum as a finite and closed quantum oscillator, we solve all of the above-mentioned problems. At first, by using purely quantum mechanical approach, we predict that the dark energy density is c⁴/(GR²) = 5.27×10^-10 J/m³ (where R is radius of 3-sphere of universe) and matter energy density is c⁴/(2GR²) = 2.6×10^-10 J/m³ which match well with astronomical observations. We also prove that the dark energy has always been ~66.7% and matter energy has been ~33.3% of total energy and hence, the so called cosmic coincidence problem doesn’t exist. Next, we show how flatness of space could be maintained since the early stage of universe. Finally, using our model, we derive the expression for age and radius of universe which match well with the astronomical data.

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

Unmanned aerial vehicle (UAV), or drone is recognized for its potential to improve efficiency and address last-mile delivery issues. As a result, there has been a lot of activity in recent years in the field of drone scheduling and routing. Unlike the vehicle routing problem, drone route design is difficult due to several operational characteristics, such as speed optimization, multitrip operation, and energy consumption estimation. On the one hand, drone energy consumption is a complex nonlinear function of both speed and payload in practice. On the other hand, the high operating speed of drones can significantly curtail the drone range, thereby limiting the efficiency of drone delivery systems. Most of the existing drone delivery models either assume constant drone speed or do not consider the effect of drone speed and parcel weight on energy consumption, leading to costly or energy-infeasible routes. This paper addresses the trade-off between speed and flight range in a multi-trip drone routing problem with variable flight speeds (DRP-VFS), in which a team of homogeneous drones is employed for delivery services. We propose a new model to particularly consider energy constraints using a nonlinear energy consumption model and treat drone speeds as decision variables so that various drone speeds can be adopted in applications. The DRP-VFS is initially formulated as mixed-integer linear programming (MILP) to minimize total energy consumption. To solve large-scale instances, we propose a three-phase adaptive large neighborhood search (ALNS) algorithm. The experimental results demonstrate that suboptimal solutions can be found effectively in practical scenarios using the proposed method. Furthermore, results indicate that operating drones at variable speeds leads to about 21% of energy savings compared to fixed speeds, boasting advantages in cost-savings and range extensions.

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

This paper is aimed at studying the temporal evolution of the surface displacements occurred over the past few years in the ocean-reclaimed platforms of the Shanghai megacity (China), which are mainly ascribable to consolidation processes of large dredger fills and alluvial deposits. With respect to previous analyses carried out over the same area, this work provides a joint multi-platform differential interferometry synthetic aperture radar (DInSAR) analysis, based on the application of the advanced Small BAseline Subset (SBAS) algorithm. This led us to retrieve long-term deformation time-series that are helpful for a better understanding of the on-going deformation phenomena. To this aim, we have exploited two sequences of SAR data collected by the ASAR/ENVISAT and by the COSMO-SkyMed (CSK) sensors, respectively, spanning the whole time period from 2007 to 2016. Unfortunately, the large time gap (of about three years) existing between the available ASAR/ENVISAT and CSK datasets gave rise to additional difficulties for their combination. Nevertheless, this problem has been faced by benefiting from the knowledge of a time-dependent model describing the temporal evolution of the expected deformations affecting the Shanghai ocean-reclaimed platforms.

This research aimed to study and compare prevalence of work-related musculoskeletal (MSK) problem and perceived discomfort among port crane operators consisting of quay and rubber tyred gantry (RTG) cranes working in the Laem Chabang Deep-sea Port, Thailand. Direct interviews for a cross-sectional analysis was selected for this unique job with a small amount of sample size. A standardized modified version of the Nordic Musculoskeletal Questionnaire (NMQ) was lunched for 26 male participants, consisting of 11 quay and 15 RTG, where a priori power analysis using G*Power suggested the minimum as 24 for the hypothesis test. Socio-demographic characteristics showed no significant difference among them. The NMQ revealed lower back as the highest prevalent body part (76.9%) followed by neck, shoulders and upper back at the same percentage (23.1%) for all port crane group, with up to 96.2% reporting MSK problem over the past 12 months. And Borg scale rating, assessing the perceived discomfort, revealed lower back with the highest score (2.38) followed by upper back (0.65), shoulders (0.54) and neck (0.5). Remarkably, the comparation between the quey and RTG crane operators on the MSK prevalence (χ2 test) and perceived discomfort levels (Kruskal-Wallis test), regarding different 9 body parts, revealed a significant difference between the two on upper back with quay crane having more problem than the RTG at p &lt; 0.05. while the rest of them were mainly in the same direction. MSK contributors such as: working awkward posture, mental stress, height, trolley distance and vibration are considerably the main causes of this. However, the larger in scale of exposure to those for the quey crane compared to the RTG might have led to the distinguishing MSK problem found in this study which require thoroughly deliberation for the particular solutions.

We consider the problem of finding the largest clique of a graph. This is an NP-hard problem and no exact algorithm to solve it exactly in polynomial time is known to exist. Several heuristic approaches have been proposed to find approximate solutions, Markov Chain Monte Carlo being one of those. In the context of Markov Chain Monte Carlo, we present a class of ``parallel dynamics'', known as Probabilistic Cellular Automata, which can be used in place of the more standard choice of sequential ``single spin flip'' to sample from a probability distribution concentrated on the largest cliques of the graph. We perform a numerical comparison between the two classes of chains both in terms of the quality of the solution and in terms of computational time. We show that the parallel dynamics are considerably faster than the sequential one while providing solutions of comparable quality.

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

An electrothermal analysis for barium titanate based ceramics is presented combining the Heywang–Jonker model for the electric resistivity with a heat dissipation mechanism based on natural convection and radiation in a one dimensional model on the device level with voltage as the control parameter. Both PTC and NTC effects are accounted for through the double Schottky barriers at the grain boundaries of the material. The problem formulated in this way admits uniform and non–uniform multiple steady state solutions that do not depend on the external circuit. The numerical bifurcation analysis reveals that the PTC effect gives rise to several multiplicites above the Curie point, whereas the NTC effect is responsible for the thermal runaway (temperature blowup). The thermal runaway phenomenon as a potential thermal shock could be among the possible reasons for the observed thermomechanical failures (delamination fracture). The theoretical results for the NTC regime and the thermal runaway are in agreement with experimental flash sintering results obtained for 3% and 8% yttria stabilized zirconia.

: Multimodal Large Language Models (MLLMs) harness comprehensive knowledge spanning text, images, and audio to adeptly tackle complex problems, including zero-shot in-context learning scenarios. This study explores the ability of MLLMs in visually solving the Traveling Salesman Problem (TSP) and Multiple Traveling Salesman Problem (mTSP) using images that portray point distributions on a two-dimensional plane. We introduce a novel approach employing multiple specialized agents within the MLLM framework, each dedicated to optimizing solutions for these combinatorial challenges. Our experimental investigation includes rigorous evaluations across zero-shot settings and introduces innovative multi-agent zero-shot in-context scenarios. The re-sults demonstrated that both multi-agent models—Multi-Agent 1, which includes the Initializer, Critic, and Scorer agents, and Multi-Agent 2, which comprises only the Initializer and Critic agents—significantly improved solution quality for TSP and mTSP problems. Multi-Agent 1 ex-celled in environments requiring detailed route refinement and evaluation, providing a robust framework for sophisticated optimizations. In contrast, Multi-Agent 2, focusing on iterative re-finements by the Initializer and Critic, proved effective for rapid decision-making scenarios. These experiments yield promising outcomes, showcasing the robust visual reasoning capabilities of MLLMs in addressing diverse combinatorial problems. The findings underscore the potential of MLLMs as powerful tools in computational optimization, offering insights that could inspire further advancements in this promising field.

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

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

The brain’s ability to create a unified conscious representation of an object by integrating information from multiple perception pathways is called perceptual binding. Binding is crucial for normal cognitive function. Some perceptual binding errors and disorders have been linked to certain neurological conditions, brain lesions, and conditions that give rise to illusory conjunctions. However, the mechanism of perceptual binding remains elusive. Here, we present a computational model of binding using two sets of coupled oscillatory processes that are assumed to occur in response to two different percepts. We use the model to study the dynamic behavior of coupled processes to characterize how these processes can modulate each other and reach a temporal synchrony. We identify different oscillatory dynamic regimes that depend on coupling mechanisms and parameter values. The model can also discriminate different combinations of initial inputs that are set by initial states of coupled processes. Decoding brain signals that are formed through perceptual binding is a challenging task, but our modeling results demonstrate how crosstalk between two systems of processes can possibly modulate their outputs. Therefore, our mechanistic model can help one gain a better understanding of how crosstalk between perception pathways can affect the dynamic behavior of the systems that involve perceptual binding.

The research develops the vehicular routing problem for the distribution of refrigerated products in a multinational company. The mathematical model corresponds to the vehicle routing problem with hard time windows and stochastic service (VRPTW-ST) time model applied in the city of Santiago de Chile. For optimization of the model, optimization methods tabu search, chaotic search and general algebraic modeling were used. The results allow to validate the meta-heuristic chaotic search to solve the VRPTW-ST; chaotic search method obtains superior performance than tabu search method for solving a real problem in a large city.

This article presents a description of a new method for solving the factorization problem, based on the gradient descent algorithm. This approach demonstrates significant improvements in efficiency compared to traditional methods proposed in previous research. This article describes a new method for solving the factorization problem, based on the gradient descent algorithm, and demonstrates the transition from algebraic methods to approaches based on functional analysis. The proposed approach not only improves the efficiency of solving the problem but also allows the application of computational algorithms of functional analysis, opening new possibilities for research and optimization.

The paper studies some cases in physics such as Galilean inertia motion and etc., and presents a logical schema of recursive abduction, from which we can derive the universality of physical laws in an effective logical path without requiring infinite inductions. Recursive abduction provides an effective logical framework to connect a universal physical law with finite empirical observations based on both quasi-law tautologies and suitable recursive dimensions, two new concepts introduced in this paper. Under the viewpoint of recursive abduction, the historical difficulty from Hume’s problem naturally vanishes. In Hume’s problem one always misunderstood a time-recursive issue as an infinitely inductive problem and, thus, sank into an inescapable quagmire. With this new effective logical schema, the paper gives a concluding discussion to Hume’s problem and justifies the validity of probability argument for natural laws.

Laboratory diagnosis of leishmaniasis remains a major challenge, demonstrating variable efficacy in detecting infected mammalian hosts. Thus, there is a great need for the accuracy of the identification of appropriate antigens to also improve diagnostic tests. This review brings to the fore the sensitivity of the balance in canine and human leishmaniasis, which greatly influences the progression of the disease and especially the diagnostic methods. The problem of diagnosis arises in asymptomatic leishmaniasis, since in these conditions the methods considered as reference in the diagnosis of leishmaniasis no longer show certainty, being influenced for the most part by the immune response of the host, which is different according to the presence of other associated diseases or even according to the breed, when we talk about dogs. Consequently, the diagnosis and surveillance of leishmaniasis cases remains an open topic, with the need for new methods adapted to the immunological status of the host.

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.

Recent advances in the theory of quantum gravity show that the Ricci flow serves as the time evolution operator for the vacuum energy density and that in the presence of baryonic matter, the Ricci flow is analogous to the heat equation in the presence of a heat sink. Here we show using the equations of quantum gravity, that quantum information can be modelled as a thermal fluid consisting of a superposition of weakly excited eigenstates of a quantum field and that each eigenstate vector has an associated eigenstate potential well. The depth of the potential well depends on the amplitude of the eigenstate vector. Measurement is then considered as a selection by tuning process which only allows an eigenstate resonating with the detector to be detected. During the detection process, the resonating eigenstate vector increases in amplitude, deepening its potential well such that the other weakly excited states rapidly drain their small excitation energies into it via the principle of minimum action. This draining process is the act of collapsing the wave function to a specific state. Also, the presence of the eigenstate potential wells is what cancels out the infinities from high energy interactions.

Health issues of children with intellectual disabilities (ID) have gained significant attention as a key focus of China health goals. This study aimed to compare the differences in displacement skills and problem behaviors among children with varying degrees and types of ID, while also exploring their relationship. The study included 90 participants who were children with ID and had completed TGMD-2 displacement skills and Strengths and Difficulties Questionnaire (SDQ) assessments. Covariance, partial correlation, and multiple linear regression analyses were conducted to examine the differences and correlations between these factors. The findings revealed that higher severity of intellectual disability was associated with lower scores in locomotor skills and increased manifestation of problem behaviors. Notably, there were significant variations in locomotor skills and problem behaviors among children with different types of intellectual disabilities. There is a positive correlation between locomotor skills and problem behaviors in children with intellectual disabilities, where locomotor skills can predict the occurrence of problem behaviors. In Conclusion, the research confirms that the development of locomotor skills can have a positive impact on the accompanying problem behaviors of children with developmental disabilities.

In this paper, we study nonlocal problems for a fractional diffusion equation and a degenerate hyperbolic equation with singular coefficients in the lower terms. The uniqueness of the solution to the problem is proved by the method of energy integrals. The existence of a solution is equivalently reduced to the question of the solvability of Volterra integral equations of the second kind and a fractional differential equation. For a particular solution of the proposed problem, its visualization is carried out for various values of the order of the fractional derivative. It is shown that the order of the derivative affects the intensity of the diffusion process (subdiffusion), as well as the shape of the wave front.

The aim of this survey is to review some recent developements in devising efficient preconditioners for sequences of linear systems A x = b. Such a problem arise in many scientific applications, such as discretization of transient PDEs, solution of eigenvalue problems, (Inexact) Newton method applied to nonlinear systems, rational Krylov methods for computing a function of a matrix. Full purpose preconditioners such as the Incomplete Cholesky (IC) factorization or approximate inverses are aimed at clustering eigenvalues of the preconditioned matrices around one. In this paper we will analyze a number of techniques of updating a given IC preconditioner (which we denote as P0 in the sequel) by a low-rank matrix with the aim of further improving this clustering. The most popular low-rank strategies are aimed at removing the smallest eigenvalues (deflation) or at shifting them towards the middle of the spectrum. The low-rank correction is based on a (small) number of linearly independent vectors whose choice is crucial for the effectiveness of the approach. In many cases these vectors are approximations of eigenvectors corresponding to the smallest eigenvalues of the preconditioned matrix P0 A. We will also review some techniques to efficiently approximate these vectors when incorporated within a sequence of linear systems all possibly having constant (or slightly changing) coefficient matrices. Numerical results concerning sequences arising from discretization of linear/nonlinear PDEs and iterative solution of eigenvalue problems show that the performance of a given iterative solver can be very much enhanced by the use of low-rank updates.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

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.

Quantum optimization is a significant area of quantum computing with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational Hamiltonian-based algorithms, struggle on present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning but often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for the Quantum Approximate Optimization Algorithm to satisfy all the requirements that correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities of measuring solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in linear number of entangleming gates instead of exponential and superior performance compared to standard formulations. Specifically, we achieve higher probabilities of measuring feasible solutions in 9 out of 9 instances compared to standard Hamiltonian formulations and surpass quadratic programming formulations known from quantum annealers in 7 out of 9 instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.

This paper attempts to clarify an issue regarding the lasting unsolved problem of turbulence, namely the closure problem. This study shows that all perspectives regarding the numbers of un- known quantities in the Reynolds turbulence equations stem from the misunderstandings of physics of the Reynolds stress tensor. The current literatures have a consensus that the Reynolds stress tensor has six unknowns; however, this study shows that the Reynolds stress tensor actually has only three ones, namely the three components of fluctuation velocity. With this new understanding, the closed turbulence equations for incompressible flows are proposed.

Diffuse optical tomography (DOT) is a medical imaging procedure using light to measure the geometric and working properties of cells, for instance, oxygen consumption, water content, and fat percentage in the tissue by performing three-dimensional visualization of the tissue. This paper aims to explain the theory behind diffuse optical tomography imaging and how the technology works. The paper explains how photon migration techniques based on diffusion theory can be used to image the optical properties of tissue. There are several reasons why near-infrared (NIR) imaging is the most effective method in terms of recovering optical parameters quantitatively in the near-infrared region. The author discusses the methods in detail. This research also presents various advantages, practical uses, and potential problems that have been related to DOT in this work. There is also a brief discussion of current research developments in medical imaging using near-infrared wavelengths, and what the future holds for that area.

This paper proposes a new dynamic analysis of reasoning. It makes the following contributions. First, the current states of the psychology of reasoning are critically reviewed from theoretical and empirical perspectives. The long-standing controversies between logicians and psychologists are clarified by introducing the gauge theoretic structure. The debates between the mental logic theory and the mental models theory are carefully reviewed by identifying the problem types used in the empirical studies. Certain mental fluctuations are found and a quantum theoretic solution is examined. Second, it solves the measurement problem within the Hamiltonian framework. The modeling structure underlying reasoning dynamics is the electrodynamics. They are both the single-charge dynamic systems sharing the U(1) symmetry. The mental logic theory and the mental models theory are now characterized as wavefunctions in a unified account of the dynamic analysis with the yes/no measurements. The stochastic sampling method is introduced to solve the measurement problem, which has a wide range of applications in social sciences. Third, a novel metatheoretic framework of reasoning dynamics within Lagrangian framework is proposed. It solves the “Man vs. Men” problem via gauge theoretic modeling, by making the distinction between the global level and the local level. At each level, the gauge transformations are applied to achieve the global symmetry and the local gauge symmetry. It explains the meanings of the gauge principle and the Nether theorem. Fourth, the special theory of relativity is applied to address the “Man vs. Men” problem. It explains how to draw the global language cone and the individualized local language cones. Finally, it points out that borrowing modeling methods from physics has a long tradition in psychology. The present work utilizes the conceptual and modeling methods found in modern theoretical physics.

Neural or mental simulation of actions is a powerful tool for allowing cognitive agents to develop Prospection Capabilities that are crucial for learning and memorizing key aspects for challenging skills. In previous studies we developed an approach based on the animation of the redundant human Body Schema based on the Passive Motion Paradigm (PMP). In this paper we show that this approach can be easily extended to hyper-redundant serpentine robots as well as to hybrid configurations where the serpentine robot is functionally integrated with a traditional skeletal infrastructure. A simulation model is analyzed in detail showing that it incorporates spatio-temporal features discovered in the biomechanical studies of biological hydrostats like the elephant trunk or the octopus tentacles. It is proposed that such generative internal model can be the basis for a cognitive architecture appropriate for serpentine robots, independent of the underlying design and control technologies. Although robotic hydrostats have received a lot of attention in the last decades, the great majority of research activities have been focused on the actuation/sensorial/material technologies that can support the design of hyperredundant soft robots as well as the related control methodologies. The cognitive level of analysis has been limited to motion planning, without addressing synergy formation and metal time travel. This is where the contribution of the paper is focused on.

In this paper we study a conjecture proposed by P.Duxbury , C.laror , L.Leduino de Salles Neto in 2021\cite{conjecture} on the Golumb Ruler Problem which is a classical optimization model in discrete case . In \cite{conjecture} the authors constucted a continuous model for the Golumb Ruler Problem associated to the discrete case and conjectured that the optimal value of both cases are equal . We deal with this conjecture via algebraic geometrical methods .

(1) Background: There is not much research about obesity in nursing homes although knowledge will help us to develop customized treatment plans and prevention strategies, which may help to decrease the burden for all persons involved. The objective of conducting this study was to describe the prevalence of obesity and the association between obesity and care problems in nursing home patients. (2) Methods: This study is a secondary data analysis of data collected in an annually performed cross-sectional study called “Nursing Quality Measurement 2.0”. A standardized and tested questionnaire was used to collect data. (3) Results: 1236 nursing home patients took part and 16.7% of them were obese. The multivariate logistic regression analysis results show that urinary incontinence is significantly associated with the presence of obesity (OR 2.111). The other care problems of pressure injuries, fecal and double incontinence, physical restraints, falls and pain were not associated with obesity. (4) Conclusion: The results indicate that, in the nursing home setting, health care staff should pay special attention to the patients’ nutritional and continence status and help patients maintain a normal, healthy weight. Conducting more studies with larger sample sizes is recommended, as this will allow differentiation among different obesity classes.

In a previous paper we defined the Black-and-White SAT problem which has exactly two solutions, where each variable is either true or false. We showed that Black-and-White $2$-SAT problems represent strongly connected directed graphs. We presented also the strong model of communication graphs. In this work we introduce two new models, the weak model, and the Balatonbogl\'{a}r model of communication graphs. A communication graph is a directed graph, where no self loops are allowed. In this work we show that the weak model of a strongly connected communication graph is a Black-and-White SAT problem. We prove a powerful theorem, the so called Transitions Theorem. This theorem states that for any model which is between the strong and the weak model, we have that this model represents strongly connected communication graphs as Blask-and-White SAT problems. We show that the Balatonbogl\'{a}r model is between the strong and the weak model, and it generates $3$-SAT problems, so the Balatonbogl\'{a}r model represents strongly connected communication graphs as Black-and-White $3$-SAT problems. Our motivation to study these models is the following: The strong model generates a $2$-SAT problem from the input directed graph, so it does not give us a deep insight how to convert a general SAT problem into a directed graph. The weak model generates huge models, because it represents all cycles, even non-simple cycles, of the input directed graph. We need something between them to gain more experience. From the Balatonbogl\'{a}r model we learned that it is enough to have a subset of a clause, which represents a cycle in the weak model, to make the Balatonbogl\'{a}r model more compact. We still do not know how to represent a SAT problem as a directed graph, but this work gives a strong link between two prominent fields of formal methods: SAT problem and directed graphs.

Internet-led labour market has become so competitive forcing many organisations from different sectors to embrace e-recruitment. However, realising the value of the e-recruitment from a Requirements Engineering (RE) analysis perspective is challenging. This research is motivated by the results of a failed e-recruitment project conducted in military domain which is used as a case study in this research. After reviewing the various challenges faced in that project through a number of related research domains, this research focuses on two major problems which are the (1) difficulty of scoping, representing, and systematically transforming recruitment problem knowledge towards e-recruitment solution specification; and (2) the difficulty of documenting e-recruitment best practices for reuse purposes in an enterprise recruitment environment. In this paper, a Problem-Oriented Conceptual Model (POCM) with a complementary Ontology for Recruitment Problem Definition (Onto-RPD) is proposed to contextualise the various recruitment problem viewpoints from an enterprise perspective and to elaborate those problem viewpoints towards a comprehensive recruitment problem definition. The POCM and Onto-RPD are developed incrementally using action-research conducted on three real case studies: (1) Secureland Army Enlistment, (2) British Army Regular Enlistment, and (3) UK Undergraduate Universities and Colleges Admissions Service (UCAS). They are later evaluated in a focus group study against a set of criteria. The study showed that the POCM and Onto-RPD provide a strong foundation for representing and understanding the e-recruitment problems from different perspectives.

In Chuanming Zong’s program to attack Hadwiger’s covering conjecture, which is a longstanding open problem from Convex and Discrete Geometry, it is essential to estimate covering functionals of convex bodies effectively. Recently, He et al. [J. Optim. Theory Appl. 2023, 196, 1036–1055.] and Yu et al. [Mathematics, 2023, 11, 2000] provided two deterministic global optimization algorithms having high computational complexity for this purpose. Since satisfactory estimations of covering functionals will be sufficient in Zong’s program, we propose a stochastic global optimization algorithm based on CUDA and provide an error estimation for the algorithm. The accuracy of our algorithm is tested by comparing numerical and exact values of covering functionals of convex bodies including the Euclidean unit disc, the three-dimensional Euclidean unit ball, the regular tetrahedron, and the regular octahedron. We also present estimations of covering functionals for the regular dodecahedron and the regular icosahedron.

This paper deals with a non-standard finite difference scheme defined on a quasi-uniform mesh for approximate solutions of the Magneto-Hydro Dynamics (MHD) boundary layer flow of an incompressible fluid past a flat plate for a wide range of the magnetic parameter. We show how to improve the obtained numerical results via a mesh refinement and a Richardson extrapolation. The obtained numerical results are favourably compared with those available in the literature.

This paper shown that turbulence closure problem is not an issue at all. All mistakes in the literature regarding the numbers of unknown quantities in the Reynolds turbulence equations stem from the misunderstandings of physics of the Reynolds stress tensor, i.e., all literatures have stated that the symmetric Reynolds stress tensor has six unknowns; however, it actually has only three unknowns, i.e., the three components of fluctuation velocity. We shown the integral-differential equations of the Reynolds mean and fluctuation equations have exactly eight equations, which equal to the numbers of quantities in total, namely, three components of mean velocity, three components of fluctuation velocity, one mean pressure and one fluctuation pressure. That is why we claim in this paper, that the Reynolds Navier-Stokes turbulence equations of incompressible flow are closed rather than unclosed. This study may help to solve the puzzle that has eluded scientists and mathematicians for centuries.

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

Continuous cropping of Platycodon produces problems that significantly impact its yield and quality making it a pressing issue that requires immediate attention. In this study, the sandwich method is employed to evaluate the allelopathic activity of different plant parts (leaves, stems, and roots) of Platycodon. The inhibitory effects of the various Platycodon plant parts were quantified based on their effects on lettuce seedlings growth by Sandwich method, with the following average inhibition percentages at 1 mg/ml (agar) of : leaves (79.4%, 61.8%), stems (58.0%, 45.7%), and roots (53.4%, 49.3%) for lettuce radicals and hypocotyls, respectively. At a concentration of 5 mg/ml, the inhibitory effects were as follow: leaves (91.9%, 72.2%), stems (79.5%, 60.3%), and roots (71.4%, 65.2%). Also, by employing the Plant Box method, it was determined that Platycodon root exudation. The growth inhibition rates of lettuce seedling roots and hypocotyls were 45.5% and 18.9%, respectively. The effect of activated carbon on the adsorption of allelopathic substances was investigated, and the results of the sandwich method with a concentration of 1 mg/ml showed the following growth inhibitory effects on lettuce seedlings and hypocotyls: roots (27.8%, 25.7%), leaves (13.3%, 25.7%), and stem (9.07%, 13.6%). The Plant Box method revealed average rates of inhibition of -16.7% and -4.70% on the growth of lettuce seedlings and hypocotyls, respectively. The results of this study demonstrated that activated carbon has a mitigating effect on the allelopathic inhibition associated with the different plant parts and root exudation of Platycodon, thus may provide a potential solution for overcoming obstacles associated with continuous cropping of Platycodon.

Background: Underreporting of Visceral Leishmaniasis (VL) in India remains a problem to public health controls. Effective and reliable surveillance systems are critical for monitoring disease outbreaks and public health control programs. However, in India, government surveillance systems are affected by levels of scarcity in resources and therefore, uncertainty surrounds the true incidence of asymptomatic and clinical cases, affecting morbidity and mortality rates. The State of Bihar alone contributes up to the 40\% of the worldwide VL cases. The inefficiency of surveillance systems occurs because of multiple reasons including delay in seeking health care, accessing non-authentic health care clinics, and existence of significant asymptomatic self healing infectious cases. This results in a failure of the system to adequately report true transmission rates and number of symptomatic cases that have sought medical advice (thus, high underreporting of cases). Objectives and Methods: There are several methods to estimate the extent of underreporting in the surveillance system. In this research, we use a mathematical dynamic model and two different types of data sets, namely, monthly incidence for 2003-2005 and yearly incidence from 2006-2012 from the Bihar's 21 most VL affected districts out of its 38 districts. The goals of the study are to estimate critical metrics to measure level of transmission and to evaluate the estimation process between the two data sets and 21 districts. In particularly, our focus is on (i) estimating infection transmission potential, underreporting level in incidence and proportion of self-healing cases, (ii) quantifying reproduction number of the$R_0$, and (iii) comparing underreporting incidence levels and proportion of self-healing cases between the two periods 2003-2005 and 2006-2012 and between 21 districts. Results: Our research suggests that the number of asymptomatic individuals in the population who eventually self-heal may have a significant effect on the dynamics of VL spread. The estimated mean self-healing proportion (out of all infected) is found to be $\sim 0.6$ with only 7 out of 21 affected districts having self-healing proportion less than $0.5$ for both data sets. The estimated mean underreporting level is at least $64$\% for the state of Bihar. The estimates of the basic reproduction numbers obtained are similar in magnitude for most of the districts, being in the range of (0.88, 2.79) and (0.98, 1.01) for 2003-2005 and 2006-2012, respectively. Conclusions: The estimates for the two types (monthly and yearly) of temporal data suggest that monthly data are better for estimation if less number of data points are available, however, in general, using such data set results in larger variances in parameters as compared to estimates obtained through aggregated yearly data. Estimated values of transmission related metrics are lower than those obtained from earlier analyses in the literature, and the implications of this for VL control are discussed. The spatial heterogeneity in these control metrics increases the risk of epidemics and makes the control strategies more complex.

The reasons for the circular sense of human color perception generated by two sorts of color opponent neurons and three cone types are not well understood. Here we use geometrical analysis to examine the hypothesis that opponency, the recursive nature of color perception, and trichromacy arise as the most efficient ways of distinguishing spectrally different points on a plane using a minimum of color classes and receptor types.

We focus on macromolecules which are modelled as sequentially growing dual scale-free networks. The dual networks are built by replacing star-like units of the primal treelike scale-free networks through rings, which are then transformed in a small-world manner up to the complete graphs. In this respect, the parameter γ describing the degree distribution in the primal treelike scale-free networks regulates the size of the dual units. The transition towards the networks of complete graphs is controlled by the probability p of adding link between non-neighbouring nodes of the same initial ring. The relaxation dynamics of the polymer networks is studied in the framework of generalized Gaussian structures by using the full eigenvalue spectrum of the Laplacian matrix. The dynamical quantities on which we focus here are the averaged monomer displacement and the mechanical relaxation moduli. For several intermediate values of the parameter’s set (γ, p) we encounter for these dynamical properties regions of constant in-between slope.

In this paper, we consider with a class of system of differential equations whose argument transforms are involution. In this an initial value problem for a differential equation with involution is reduced to an initial value problem for a higher order ordinary differential equation. Than either two initial conditions are necessary for a solution, the equation is then reduced to a boundary value problem for a higher order ODE.

The capacitated lot-sizing problem with product recovery (CLSP-RM) holds significant importance in reverse logistics but is notoriously complex (NP-hard). In this study, two techniques are introduced to confront this challenge. The first technique entails devising a linear optimization task that eliminates capacity limitations across a wide problem spectrum, yielding a remarkably accurate approximation of the optimal solution. This adaptable approach presents a potent alternative and holds potential for extension to diverse problem categories owing to its versatile nature. The second technique employs a simulation methodology utilizing Halton’s uniform random numbers to address the issue. This randomized production search method sidesteps considerations of production costs, inventory expenditures, and production order when determining production batches. The research’s novelty lies in its application of these techniques to the problem. The suggested methods undergo evaluation via a benchmark dataset of approximately 4200 instances, with comparison against solutions derived through the Gurobi solver. The results underscore the efficacy and resilience of the introduced methodology in tackling the CLSP-RM predicament.

We compute explicitly trace of one-dimensional diffusion process which can be regarded as a Dirichlet form on graphs and we study its conservativeness property. Finally, we give an example of a discretization of one dimensional diffusion of Bessel's process with order $\nu$.

The present work studies a swelling porous-elastic system with viscoelastic damping. We establish a general and optimal decay estimate which generalizes some recent results in the literature. Our result is established without imposing the usual equal-wave-speed condition associated with similar problems in literature.

The dynamics of the main photosynthetic structures is studied by mathematical modeling methods in this article. Chlorophyll portion variability in phytoplankton and the formation of energy-intensive substances in the process of photosynthesis underlie the models. These cellular components are considered in terms of their participation in the growth of specific biomass. Computational experiments are presented that simulate various degrees of environmental friendliness. The corresponding functions are built in accordance with seasonal fluctuations throughout the year in the Far East region of Russia. The stability of model solutions in long-term dynamics is also investigated. The models were tested for biological adequacy and their effectiveness was compared. For the model selected as a result of the comparison, the optimal control problem has been formulated and solved. It is shown that in this way it is possible to reduce the space of the initial components of the model system.

We can analyze the properties of the Collatz Conjecture by using Terras’ Theorem, and computational graphical calculations. To do this, we introduce the concept of “tree" which shows the relationship between the input and output positive integers of the Collatz process. This approach offers a novel way for determining the non-existence of loops and diverge trees through computer simulations.

Starting with a positive odd integer $n$, apply a function $f(n)$ repetitively such that $f(n) = 3n + 1$ if $n \not\equiv 0 (\text{mod}\:2)$ or $f(n) = n/2$ if $n \equiv 0 (\text{mod}\:2)$. Let the sequence of all the odd integers obtained form an orbit $n, f^1(n) , f^2(n), \ldots, f^k(n), f^{k + 1}(n)$. The $k^{th}$ odd integer is written as $f^k(n) = (3^k + \mathbf{B(k)})/2^{\mathbf{z(k)}}$ where $\mathbf{B(k)}$ is the collection of terms without the coefficient $n$. We show that when $1 - \mathbf{B(k)}/(2^{\mathbf{z(k)}} n) \approx 1$, the condition for unbounded orbit is given by OEIS A022921. Further, if there exists at least one orbit for which $f^{k + 1}(n) = n$ when $(k + 1) < 3$, we show that there exists no orbit with $k + 1 > 3$ for which $f^{k + 1}(n) = n$. The final result is that the odd integers that can violate the Collatz conjecture are smaller than 5.

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

This paper investigates an inverse problem of option pricing in the extended Black--Scholes model. We identify the model coefficients from the measured data and attempt to find arbitrage opportunities in financial markets using a Bayesian inference approach. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by Markov Chain Monte Carlo (MCMC), which explores the posterior state space. The efficient sampling strategy of MCMC enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown drift and volatility coefficients from the measured data.

This paper investigates the inverse option problems (IOP) in the extended Black--Scholes model arising in financial markets. We identify the volatility and the drift coefficient from the measured data in financial markets using a Bayesian inference approach, which is presented as an IOP solution. The posterior probability density function of the parameters is computed from the measured data. The statistics of the unknown parameters are estimated by a Markov Chain Monte Carlo (MCMC) algorithm, which exploits the posterior state space. The efficient sampling strategy of the MCMC algorithm enables us to solve inverse problems by the Bayesian inference technique. Our numerical results indicate that the Bayesian inference approach can simultaneously estimate the unknown trend and volatility coefficients from the measured data.

The development and generalization of Digital Volume Correlation (DVC) on X-ray computed tomography data highlight the issue of long term storage. The present paper proposes a new model-free method for pruning the DVC data. The size of the remaining sampled data can be user-defined, depending on the needs concerning storage space. The data pruning procedure is deeply linked to hyper-reduction techniques. The DVC data of a resin-bonded sand tested in uniaxial compression is used as an illustrating example. The relevance of the pruned data is tested afterwards for model calibration. A new Finite Element Model Updating (FEMU) technique coupled with an hybrid hyper-reduction method is used to successfully calibrate a constitutive model of the resin bonded sand with the pruned data only.

Zero-Knowledge Proofs ZKP provide a reliable option to verify that a claim is true without giving detailed information other than the answer. A classical example is provided by the ZKP based in the Graph Isomorphism problem (GI), where a prover must convince the verifier that he knows an isomorphism between two isomorphic graphs without publishing the bijection. We design a novel ZKP exploiting the NP-hard problem of finding the algebraic ideal of a multivariate polynomial set, and consequently resistant to quantum computer attacks. Since this polynomial set is obtained considering instances of GI, we guarantee that the protocol is at least as secure as the GI based protocol.

The capital allocation framework proposed by [] presents capital allocation principles as solutions to particular optimization problems and provides a general solution of the quadratic allocation problem via a geometric proof. However, the widely used haircut allocation principle is not reconcilable with that optimization setting. In this paper we provide an alternative proof of the quadratic allocation problem based on the Lagrange multipliers method to reach the general solution. We show that the haircut allocation principle can be accommodated to the optimization setting with the quadratic optimization criterion if one of the original conditions is relaxed. Two examples are provided to illustrate the accommodation of this allocation principle.

Nowadays, the wasting of resources is one of the fundamental challenges of the industrial sector. The rectangle packing problem can be very effective in this context. Practical applications of this issue in the timing and designing of the industries and businesses are very remarkable. The purpose of this issue is to arrange a set of rectangles with specific dimensions in a rectangular page with a specific width and unlimited height without overlapping. The fundamental challenge in this issue is that this is an NP-complete issue. Therefore, it is difficult to achieve the best arrangement, which has the maximum rate of resource utilization and also has a linear running time. Many algorithms have been presented to estimate a practical solution for this issue. In the past decades, the best fit method has been one of the most useful methods for this purpose. This study presents a combinatorial algorithm based on two algorithms, including the lowest front-line strategy and the best-fit algorithm. The running results indicate that the suggested algorithm performs well, despite its simplicity. The time complexity of the suggested algorithm is O(nm), in which n is the number of input rectangles and m is the number of the created front lines.

Many people, including Horadam, have studied the numbers $W_n$, satisfying the recurrence relation $W_n=u W_{n-1}+v W_{n-2}$ ($n\ge 2$) with $W_0=0$ and $W_1=1$. In this paper, we study the $p$-numerical semigroups of the triple $(W_i,W_{i+2},W_{i+k})$ for integers $i,k(\ge 3)$. For a nonnegative integer $p$, the $p$-numerical semigroup $S_p$ is defined as the set of integers whose nonnegative integral linear combinations of given positive integers $a_1,a_2,\dots,a_\kappa$ with $\gcd(a_1,a_2,\dots,a_\kappa)=1$ are expressed in more than $p$ ways. When $p=0$, $S=S_0$ is the original numerical semigroup. The largest element and the cardinality of $\mathbb N_0\backslash S_p$ are called the $p$-Frobenius number and the $p$-genus, respectively.

In this note, we suggest a one-sample version of the recently proposed two-sample test for comparison of the means of multivariate samples. The test checks a hypothesis that the mean of multivariate sample is equal to a certain value with the alternative hypothesis that the mean does not equal to this value. The suggested test is illustrated by analysis of real-world and simulated data.