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.

Petri nets are a graphical notation for describing a class of discrete event dynamic systems whose behaviours are charaterised by concurrency, synchronisation, mutual exclusion and conflict. They have been used over the years for the modelling of various distributed systems applications. With the advent of pervasive systems and the Internet of Things, the Calculus of Context-aware Ambients (CCA) emerged as a suitable formal notation for analysing the behaviours of these systems. In this paper, we are interested in comparing the expressive power of Petri nets to that of CCA. That is, can the class of systems represented by Petri nets be modelled in CCA? To answer this question, an algorithm is proposed that maps any Petri net onto a CCA process. We show that a Petri net and its corresponding CCA process behave the same way through experiments. It follows that CCA is at least as expressive as Petri nets, i.e. any system that can be specified in Petri nets can also be specified in CCA. Moreover, tools developed for CCA can also be used to analyse Petri nets.

Using assembly theory, we investigate the assembly pathways of binary strings of length N formed by joining bits present in the assembly pool and the strings that entered the pool as a result of previous joining operations. We show that the string assembly index is bounded from below by the shortest addition chain for N, and we conjecture about the form of the upper bound. We define the degree of causation for the minimum assembly index and show that for certain N it features regularities that can be used to determine a shortest addition chain. We show that a string with the smallest assembly index for N can be assembled by a binary program of length equal to this index if the length of this string is expressible as a product of Fibonacci numbers. We conjecture that there is no binary program that has a length shorter than the length of the string having the largest assembly index for N that could assemble this string. The results confirm that four Planck areas provide a minimum information capacity that corresponds to a minimum thermodynamic (Bekenstein-Hawking) entropy. Knowing that the problem of determining the assembly index is at least NP-complete, we conjecture that this problem is NP-complete, while the problem of creating the string so that it would have a predetermined largest assembly index is NP-hard. The proof of this conjecture would imply P ≠ NP, since every computable problem and every computable solution can be encoded as a finite binary string.

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.

The problem of normal impact of a rigid sphere onto a Maxwell viscoelastic solid half-space is considered. The first-order asymptotic solution is constructed in the framework of Hunter’s model of viscoelastic impact [Hunter, S. C., 1957. Energy absorbed by elastic waves during impact. Journal of the Mechanics and Physics of Solids, 5(3), 162–171.]. In particular, simple analytical approximations have been derived for the maximum contact force and the time to achieve it. A linear regression method is suggested for evaluating the instantaneous elastic modulus and the mean relaxation time from a set of experimental data collected for different impactors and impact velocities.

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.

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.

This manuscript presents a novel approach to estimating the potential within Schrödinger equations, with a particular focus on applications to the Navier-Stokes problem in fluid dynamics. By establishing new theoretical estimates, we delve into the intricate dynamics of fluid flow, aiming to unveil previously obscured aspects of the Navier-Stokes equations. Through a rigorous mathematical framework, we explore how these new potential estimates can provide a fresh perspective on fluid mechanics, contributing to the ongoing quest to solve some of its most persistent challenges.

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.

We show how the Poincar\'e--Riemann--Hilbert boundary-value problem enables us to construct effective estimates of the potential in the Schr\"odinger equation. The apparatus of the three-dimensional inverse problem of quantum scattering theory is developed for this. It is shown that the unitary scattering operator can be studied as a solution of the Poincar\'e--Riemann--Hilbert boundary-value problem. This allows us to go on to study the potential in the Schr\"odinger equation

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.

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.

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.

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.

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.

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

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

In this study, I examined the Beals conjecture on the basis of formulas that produce composite numbers, and I developed some other conjectures that, if answered, would be an answer to the Beals conjecture. Apart from this, I have examined the Beals conjecture from another perspective and posed The Germany Problem.

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.

The present paper reports an alternative solution of the measurement problem in quantum theory. The measurement problem can be characterized as that the U-procedure verses the R-procedure. The R-procedure is tested by the Yes/No measurement originally proposed by von Neuman and discussed in details by Penrose. We propose a novel stochastic sampling method to tackle the measurement paradox. Each testing sample produces a pair of Yes-number c and No-number d, which in turn generates a sample phase with respect to the exponential form of (c+id). All the sample phases forms a group G_R. Taking G_R as the sampling potential, combined with the dynamic phase group G_U，we establish a unified model of U-procedure and R-procedure for the evolution of wavefunction. Based on the Born rule, the probability of a sample is given by the squared magnitude of （c+id）. Some metaproperties of the new U-R model, such as natural transformation, consistency, and completeness, are presented. The present work provides a new picture of quantum mechanics and alike. The measurement problem widely exists in dynamic analysis, higher cognition, and large data modeling. Thus, the work reported here has a wide range of applications. Keywords: The measurement problem; U-R procedures; the Yes/No type measurement; stochastic sampling; sample phase; Born probability.

In this paper, a distributed algorithm is proposed to solve a consensus convex optimization problem. It is a Jacobi-proximal alternating direction method of multipliers with a damping parameter $\gamma$ in the iteration of multiplier. Compared with existing algorithms, it has the following nice properties: (1) The restriction on proximal matrix is relaxed substantively, thus alleviating the weight of the proximal term. Therefore, the algorithm has a faster convergence speed. (2) The convergence analysis of the algorithm is established for any damping parameter $\gamma\in(0,2]$, which is larger ones in the literature. In addition, some numerical experiments and an application to a logistic regression problem are provided to validate the effectiveness and the characteristics of the proposed algorithm.

Monge-Ampere equations have important research significance in many fields such as geometry, convex geometry and mathematical physics. In this paper, under some superlinear and sublinear conditions, the existence of nontrivial solutions for a system arising from Monge-Ampere equations with two parameters is investigated based on Guo-Krasnosel'skii fixed point theorem. In the end, two examples are given to illustrate our main results.

In the present paper, we efficiently solve the two-body problem for extreme cases such as those with high eccentricities. The use of numerical methods, with the usual variables, cannot maintain the perihelion passage accurately. In previous articles, we have verified that this problem is treated more adequately through temporal reparametrizations related to the mean anomaly through the partition function. The biparametric family of anomalies, with an appropriate partition function, allows a systematic study of these transformations. In the present work, we consider the elliptical orbit as a meridian section of the ellipsoid of revolution, and the partition function depends on two variables raised to specific parameters. One of the variables is the mean radius of the ellipsoid at the secondary, and the other is the distance to the primary. One parameter regulates the concentration of points in the apoapsis region, and the other produces a symmetrical displacement between the polar and equatorial regions. The three most used geodesy latitude variables are also studied, resulting in one not belonging to the biparametric family. However, it is in the one introduced now, which implies an extension of the biparametric method. The results obtained by the method presented here now allow a causal interpretation of the operation of numerous reparametrizations used in the study of orbital motion.

In this paper we address the approximation of the coupling problem for the wave equation and Maxwell's equations of electromagnetism in the time domain in terms of the electric field, by means of a nodal linear finite-element discretization in space, combined with a classical'explicit finite-difference scheme for the time discretization. Our study applies to the particular case where the dielectric permittivity has a constant value outside a sub-domain, whose closure does not intersect the boundary of the domain where the problem is defined. Inside this sub-domain Maxwell's equations hold. Outside this sub-domain the wave equation holds, which may correspond to the Maxwell's equations with a constant permittivity under certain conditions. We consider as a model the case of first order absorbing boundary conditions. Optimal error estimates that hold in natural norms under reasonable assumptions are given, among which lies a typical CFL condition for hyperbolic equations.

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.

To identify the exchange coefficients of a nonlinear polynomial tricompartmental general system of α+β , we follow the procedure; firstly, the recommended solution is to introduce an adequate time t*&gt;0 in a determinable manner. That is, after injecting quantity a into the main compartment, wait a moment for the exchange in the polynomial α+β order nonlinear general system to settle, and then compare this compartment to compartment 2 at t*. Secondly, applying the Taylor formula will linearize the system and identify the exchange coefficients. Finally, we will prove that the linearization method is stable.

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 offers a novel geometric and visual approach to the renowned Four Color Map Theorem and K5 non-planarity problem while unveiling their profound connection to the "kissing number" problem in 2D. We represent planar graphs through circles and tangents, simplifying complex structures and shedding light on these classic problems. Our proofs by contradiction, rooted in the kissing number concept, reveal that both the Four Color Map Theorem and K5 non-planarity are fundamentally linked, as they pivot around the concept of coloring. This study bridges the realms of geometry and graph theory, providing fresh insights and emphasizing the significance of the kissing number problem in various fields.

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.

Continuous Distributed Constraint Optimization Problem (C-DCOPs) are a powerful framework to model problems with continuous variables in multi-agent systems. Previous works about C-DCOP algorithms mainly use pseudo-trees to guarantee the anytime property or are without anytime property guarantees. However, there is a risk of privacy leakage in the pseudo-tree due to utility passing between agents. Therefore, based on the basic constraint graph instead of the pseudo-tree, we (i) extend the Maximum Gain Message (MGM) algorithm by combining the local search strategy to solve C-DCOPs, named Continuous MGM (C-MGM), and it’s able to guarantee the monotonicity of the solution quality; (ii) propose a Parallel C-MGM (C-PMGM) algorithm to improve the solution quality through parallel random search; and (iii) introduce the differential search into C-PMGM to design a Parallel Differential Search C-MGM (C-PDSM) algorithm, which constructs a heuristic method to speed up convergence and improve solution quality. Compared to other anytime C-DCOP algorithms using pseudo-trees, the proposed three algorithms can exhibit better performance in avoiding privacy violations. We theoretically prove that the proposed algorithms are the anytime algorithms and empirically demonstrate that our algorithms outperform the state-of-the-art C-DCOP algorithms.

This study investigates the effect of dividend policy on firm performance and value in the Korean market, taking into account the unique context of Chaebol ownership structures. Analyzing 5,478 observations from the Korean Composite Stock Price Index, the research employs multiple regression models to explore the effects of various dividend policy measures under alignment and entrenchment theories. The key findings reveal significant impacts of cash dividend payment on firm value, while dividend yield and dividend policy exhibit varying associations. In the Chaebol and non-Chaebol context, mixed results suggest complex interactions between dividend policy and business outcomes. Policy recommendations emphasize transparent communication about dividend policy to mitigate information asymmetry and enhance corporate governance in the Korean market.

The design of thin-walled structures is commonly based on the solutions of linear boundary-valued problems, formulated within well-developed theories for elastic plates and shells. However, in modern appliances, especially in MEMS design, it is necessary to take into account non-linear mechanical effects that become decisive for flexible elements. Among substantial non-linear effects, that significantly change the deformation properties of thin plates, are the effects of residual stresses caused by incompatibility of deformations, which inevitably arise during the manufacture of ultra-thin elements. The development of new methods of mathematical modeling of residual stresses and incompatible finite deformations in plates is the subject of the paper. To this end the local unloading hypothesis is used. It makes possible to define smooth fields of local deformations (inverse implant field) for the mathematical formalization of incompatibility. The main outcomes are field equations, natural boundary conditions and conservation laws, derived from least action principle and variational symmetries with account of implant field. The derivations were carried out in the framework of elasticity theory for simple materials and, over and above, within the Cosserat’s theory of a two-dimensional continuum. As illustrative examples the distributions of incompatible deformations in a circular plate are considered.

The purpose of the research is to investigate the unique solvability of a nonlocal boundary value problem for a loaded equation of parabolic-hyperbolic type in a special domain. Methods: Using representations of a general regular solution, the existence and uniqueness of the problem posed is proved. Results: A new method for proving the unique solvability of nonlocal boundary value problems for one loaded equation of mixed type in a special domain has been formed and developed. Conclusions: The obtained results make it possible to solve some problems of genetics, immunology, transonic gas dynamics and thermal physics, which are associated with displacement.

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.

In this short communication, following a brief introduction, we undertake a comprehensive analytical study of the weighted Simpson index. Our primary emphasis concerns the precise determination of the optimal point (minimizer) coordinates and of the minimum value of the index, a differentiable convex function, which is related to the harmonic mean concept. Furthermore, we address and solve the inversion problem and show the tight connection between both approaches. Last, we give some insights and final remarks on this subject.

Topological defects such as magnetic monopoles that may have formed during cosmological phase transitions in the early universe. The Kibble mechanisms govern the formation of this defects and their abundance is influenced by the correlation length and the temperature-dependent Higgs mass. The Magnetic monopoles are particularly interested but their excessive production poses the monopole problem which is challenge to the standard model. Many solutions including symmetry breaking patterns and thermal pair production have been proposed to mitigate the monopole problem. Detecting monopoles would offer valuable insights into high-energy physics and the early universe. Detection of (even) a single monopole could revolutionize our current knowledge of the universe.

The asymptotic behavior of the analytic solutions of a family of singularly perturbed q-difference-differential equations in the complex domain is studied. Different asymptotic expansions with respect to the perturbation parameter and to the time variable are provided: one of Gevrey nature, and another of mixed type Gevrey and q-Gevrey. This asymptotic phenomena is observed due to the modification of the norm established on the space of coefficients of the formal solution. The techniques used are based on the adequate path deformation of the difference of two analytic solutions, and the application of several versions of Ramis-Sibuya theorem.

Sleep disorders are a frequent problem in pediatrics. The prevalence is variable (from 15 to 50%) although the majority of papers coincide in that 1 every 3 kids can experiment some kind of sleep disorder. Underlying medical problems usually manifest by difficulty to fall asleep or stay asleep. The diagnosis and resolution of the medical problems with the specific treatment should be the prime concern, before starting with the treatment of the sleep behavioral problem

In the paper we present a new test for comparison of the means of multivariate samples with unknown distributions. The test is based on the comparison of the distributions of the distances between the samples’ elements and their means using univariate two-sample Kolmogorov-Smirnov test. The activity of the suggested method is illustrated by numerical analysis of the real-world and simulated data.

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.

The temporo-spatial theory of consciousness postulates that the brain implements its own inner time and space for conscious processing of outside world. In line with this hypothesis, I present a mechanistic model of mutually connected processes that encode the inner space and time. The model is used to elaborate the binding mechanism between two sets of processes representing the inner space and time, respectively. Further, a stochastic version of the model is developed to investigate the interplay between the binding strength and noise. The spectral entropy is used to characterize the noise effects on the systems of processes when the binding strength is varied. The stochastic modeling results reveal that the spectral entropy values for strongly bound systems have similar entropy values for weakly bound or even decoupled systems. Thus, the analysis performed in this study allows to conclude that the binding mechanism is noise-resilient.

Purpose: This study investigates the implementation and impact of maker culture—viewed as a tool for developing green digital skills—in higher education institutions in Hong Kong. Maker culture, a collaborative educational approach, embraces students’ capacity for self-paced, autonomous learning and applies this knowledge to creative problem-solving and innovation, key aspects of sustainability education. Methods: An empirical study was conducted, focusing on the experiences of teachers in the higher education sector in Hong Kong. Eight individuals were interviewed to gain insights into their perceptions and experiences with maker education within sustainability contexts. The sample was limited to ensure cross-sectional comparability and direct weighting of teachers’ experiences within a singular, complementary educational setting. Results: The findings provide valuable insights into the benefits and challenges of integrating maker education into traditional educational systems to foster green digital skills. It became evident that adequate resources, effective teachers, and improved administrative systems play significant roles in the successful implementation of this approach. Conclusion: Maker education, as a tool for developing green digital skills, offers a promising alternative to traditional performance-based studies. It has the potential to lead to a future of education that is creative, innovative, and student-directed, fostering sustainability competences. Therefore, despite the challenges, with the right support and resources, the integration of maker culture into educational systems could significantly transform teaching and learning processes, advancing sustainability education.

We consider a stationary inclusion in a real Hilbert space X, governed by a set of constraints K, a nonlinear operator A and an element f∈X. Under appropriate assumptions on the data the inclusion has a unique solution, denoted by u. We state and prove a covergence criterion, i.e., we provide necessary and sufficient conditions on a sequence {un}⊂X which guarantee its convergence to the solution u. We then present several applications which provide the continuous dependence of the solution with respect to the data K, A and f, on one hand, and the convergence of an associate penalty problem, on the other hand. We use these abstract results in the study of a frictional contact problem with elastic materials which, in a weak formulation, leads to a stationary inclusion for the deformation field. Finally, we apply the abstract penalty method in the anlysis of two nonlinear elastic constitutive laws.

Remediation of IT issues encoded into domain-specific or user-defined alerts occurring in cloud environments and customer ecosystems in a vast majority of cases suffers from accurate recommendations which could be timely supplied for recovery of performance degradations. That, of course, is hard to realize through furnishing those abnormality definitions with an appropriate expert knowledge which varies from one environment to another. At the same time, in a large proportion of support cases, the reported problems under Global Support Services (GSS) or Site Reliability Engineering (SRE) treatment ultimately go down to the product teams making them waste costly development hours on investigating self-monitoring metrics of our solutions. Therefore, the mean-time-to-resolution (MTTR) rates of problems/alerts are significantly impacted from lack of a systematic approach towards adopting AI Ops. That would imply building, maintaining, and continuously improving/annotating a data store of insights that ML models are trained and generalized across the whole customer base and corporate cloud services. Our ongoing study is in line with such a vision and validates an approach that learns the alert resolution patterns in such a global setting and explains them using interpretable AI methodologies. The knowledge store of causative rules is then applied in predicting potential sources of the application degradation reflected in an active alert instance. In this communication, we share our experiences with a prototype solution and up to date analysis demonstrating how root conditions are discovered with a high accuracy for a specific type of problem. It is validated against the historical data of resolutions performed by heavy manual development efforts. We also offer a Dempster-Shafer theory-based rule verification framework for experts as a what-if analysis tool to test their hypotheses about underlying environment.

It is a critical issue to allocate redundancy to critical smart grid infrastructure for disaster recovery planning. In this study, we present a framework to combine statistical prediction methods and optimization models for the optimal redundancy allocation problem. First, we develop statistical simulation methods to identify critical nodes of very large-scale smart grid infrastructure based on the topological features of embedding networks, and then present a linear integer programming model based on generalized assignment problem (GAP) for redundancy allocation of critical nodes in smart grid infrastructure. The model is specifically implemented in the context of smart grid infrastructure. The findings demonstrate that the combined approach of statistical simulation and optimization effectively addresses the size limitations inherent in a sole optimization approach. Notably, the optimal solutions for redundancy allocation in very large grid systems highlight that the cost of redundancy is only a fraction of the economic losses incurred due to weather-related outages.

We consider a Cauchy problem for differential equations in a Hilbert space $X$. The problem is stated in a time interval $I$, which can be finite or infinite. Weuse a fixed point argument for history-dependent operators to prove the unique solvability of the problem. Then, we state and prove convergence criteria for both a general fixed point problem and thecorresponding Cauchy problem. These criteria provide necessary and sufficient conditions on a sequence $\{u_n\}$ which guarantee its convergence to the solution of the corresponding problem, in the space of both continuous and continuously differentiable functions. We then specify our results in the study of a particular differential equation governed by two nonlinear operators. Finally, we provide an application in viscoelasticity and give a mechanical interpretation of the corresponding convergence result.

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

The quickest path problem in the multistate flow networks, also known as the quickest path reliability problem (QPRP), aims at calculating the probability of transmitting a minimum of d units of flow/dat/commodity from a source node to a destination node through one single path within T units of time. Several exact and approximation algorithms have been proposed in the literature to address this problem. Most of the exact algorithms in the literature need prior knowledge of all the network’s minimal paths (MPs), which is considered a weak point. In addition to the time, the budget is always limited in real-world systems, making it an essential consideration in the analysis of systems’ performance. Hence, this study considers the QPRP under the cost constraints and provides an efficient approach based on the node-child matrix to address the problem without knowing the MPs. We show the correctness of the algorithm, compute its complexity results, illustrate it through a benchmark example, and conduct extensive experimental results on the known benchmarks and one thousand randomly generated test problems to demonstrate its practical superiority compared to the existing algorithms in the literature.

The paper proves the existence of a family of axisymmetric equilibrium figures as solutions of a stationary problem with unknown boundaries for the Navier–Stokes equations corresponding to the slow rotation of a viscous compressible two-layer liquid mass about some axis. It is assumed that the liquids are barotropic, capillary and have different viscosities, the internal fluid being bounded by a closed surface. This interface does not intersect with the external boundary of the cloud. The proof is based on implicit function theorem and carried out in the Hölder spaces.

This research employs a spatial optimization approach customized for addressing equitable emergency medical facility location problems, through the p-dispersed-median problem (p-DIME). The p-DIME integrates two conflicting classes of spatial optimization problems, dispersion, and median problems, aiming to identify the optimal locations for emergency medical facilities to achieve a balanced spatial distribution of emergency medical services (EMS) while effectively serving demands. To demonstrate the utility of the p-DIME model, we selected Gyeongsangbuk-do in South Korea, recognized as one of the most challenging areas for providing EMS to the elderly population (aged 65 and over). This challenge arises from the significant spatial disparity in the distribution of emergency medical facilities. The results of the model assessment gauge the spatial disparity of EMS, provide significantly enhanced solutions for a more equitable EMS distribution in terms of service coverage, and offer policy implications for future EMS location planning. In addition, to address the computational challenges posed by p-DIME's inherent complexity, involving mixed-integer programming, this study introduces a solution technique through constraint formulations aimed at tightening the lower bounds of the problem's solution space. The computational results confirm the effectiveness of this approach in ensuring reliable computational performance, with significant reductions in solution times, while still producing optimal solutions.

Descriptive geometry has indispensable applications in many engineering activities, some of which are presented in the first chapter of this paper in order to place the development presented here among them. As a result of the continuous variability of the technological environment according to various optimization aspects, the engineering activities must also be continuously adapted to the changes, which an appropriate approach and formulation are required from the practitioners of descriptive geometry, and can even lead to improvement in the field of descriptive geometry. The imaging procedures are always based on the methods and theorems of descriptive geometry. Resolving contradictions in spatial geometry reconstruction research is a constant challenge, to which a possible answer in many cases is the search for the right projection direction. A special method of enumerating the possible infinite viewpoints for the representation of the surface edge curves is presented in another part of the paper. The procedure for determining the correct directions in a mathematically exact way is also presented through examples. The analysis and some of the results of the Monge mapping, which is suitable for the solution of a mechanical engineering task to be solved in a specific technical environment, are also presented.

A novel approach was developed that combined LP-based row generation with optimization-based sorting to tackle computational challenges posed by budget allocation problems with combinatorial constraints. The proposed approach dynamically generated constraints using row generation and prioritized them using optimization-based sorting to ensure a high-quality solution. Computational experiments and case studies revealed that as the problem size increased, the proposed approach outperformed simplex solutions in terms of solution search time. Specifically, for a problem with 50 projects (N = 50) and 2,251,799,813,685,250 constraints, the proposed approach found a solution in just 1.4 seconds, while LP failed due to the problem size. The proposed approach demonstrated enhanced computational efficiency and solution quality compared to traditional LP methods.

With a software-defined network (SDN), the control plane is separated from the data plane, allowing the control of network flows to be easy and dynamic at the same time. While the controller, which is equipped with various control applications, is capable of analyzing a large amount of data, it may become overburdened when it is faced with a large volume of traffic. The intrusion detection system (IDS) is an example of control applications that can be used to detect intrusions. It is recommended to deploy instances of the IDS across the data plane. This will improve the processing power and detection rate and as a result reduce the load on the controller at the same time. While there is no doubt that an IDS would be beneficial for improving detection rates, installing one at each switch in the data plane would be costly. To address this issue, this paper proposes the deployment of IDS chains across the data plane. The controller directs incoming traffic via alternative paths, including the IDS chain, which increases the detection rate while avoiding overloading. In order to improve transmission efficiency, our study proposes a method of balancing the distribution of flows and assigning them to specific IDS chains. This approach minimizes the cost of flow grouping through the use of a new incoming traffic grouping technique. Our method is tested and evaluated through the use of a test bed and trace-based simulation, and has been proven to effectively reduce delays and hop counts across various traffic scenarios.

We examine a linear q-difference differential equation which is singular in complex time t at the origin. Its coefficients are polynomial in time and bounded holomorphic on horizontal strips in one complex space variable. The equation under study represents a q-analog of a singular partial differential equation, recently investigated by the author, which comprises Fuchsian operators and entails a forcing term that combines polynomial and logarithmic type functions in time. A sectorial holomorphic solution to the equation is constructed as a double complete Laplace transform in both time t and its complex logarithm log t and Fourier inverse integral in space. For a particular choice of the forcing term, this solution turns out to solve some specific nonlinear q-difference differential equation with polynomial coefficients in some positive rational power of t. Asymptotic expansions of the solution relatively to time t are investigated. A Gevrey type expansion is exhibited in a logarithmic scale. Furthermore, a formal asymptotic expansion in power scale is displayed, revealing a new fine structure involving remainders with both Gevrey and q-Gevrey type growth.

Carbon footprint mitigation actions have become a key issue for companies involved in urban freight transport. The electrification of the delivery fleets is one of the crucial sustainable actions carried out. To this end, it is necessary to explore several fleet renewal strategies over a finite planning horizon evaluating different types of electric powertrains for light commercial vehicles. The primary goal of this purpose-built analysis is to assist and boost the fleet managers' decisions when transitioning to alternative-fuelled vans, intending to maximize cost savings and reduce greenhouse gas emissions inventory. The model presented in this work is a Multi-Objective Linear Programming hybrid analysis taking into account the vehicle and energy supply infrastructure costs and the emissions reported in each inventory scope following the Greenhouse Gas Protocol sustainability guidelines. From this perspective, the conducted research offers a novel approximation to fleet management problems enabling a break-down cost analysis and an evaluation of the annual emissions company report. The comprehensive numerical simulations carried out over different study scenarios in Spain demonstrate that the optimization approach does not only show effective fleet renewal strategies but also identifies critical factors that impact the fleet's competitiveness, offering valuable insights for fleet managers and policymakers to meet carbon footprint reductions in a cost-effectively way.

The algorithm now known as Kadane’s algorithm for the maximum subarray problem uses many of the ideas that Kadane proposed, but it is not the algorithm that Kadane intended. This paper compares the two algorithms in question. They are both linear in time, employ just a few words of memory, and use a dynamic programming structure. The upshot is two light-weight algorithms for the maximum subarray problem.

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

This work implements a stable algorithm in Field-Programmable Gate Arrays (FPGAs) for which two architectures (unrolling the loop) were developed and analyzed. The algorithm recovers sources located at the boundary separating two homogeneous media that make up a two-dimensional non-homogeneous region from measurements on the boundary of such region. The problem of recovering these sources is an ill-posed inverse problem as small errors in the measurement can produce important changes in the source location. Inverse source problems have many applications in different areas, such as engineering and medicine, making the proposed implementation important. The first architecture (mode one) allows considering different operating speeds, which is an advantage depending on whether we work with fast or slow signals. The second one (mode two) reduces resource consumption by exploiting the characteristics of the source identification algorithm, which is an advantage for multichannel problems such as inverse electrocardiography or electroencephalography. The architectures were tested on four FPGAs of the 7 Series of Xilinx: Spartan-7 xc7s100fgga484, Virtex-7 xc7v585tffg1157, Kintex-7 xc7k70tfbg484, and Artix-7 xc7a35tcpg236. The two FPGA implementations of the algorithm were validated using synthetic examples implemented in MATLAB. The results presented here can be extended to concentric spheres and complex geometries.

We introduce linear probing hashing schemes that construct a hash table of size $n$, with constant load factor $\alpha$, on which the worst-case unsuccessful search time is asymptotically almost surely $O(\log \log n)$. The schemes employ two linear probe sequences to find empty cells for the keys. Matching lower bounds on the maximum cluster size produced by any algorithm that uses two linear probe sequences are obtained as well.

In this paper we study a bilinear optimal control problem related to a 2D parabolic-elliptic chemo-repulsion system consider a nonlinear chemical signal production term. We prove the existence of global optimal solutions with bilinear control, and applying a result on the existence of Lagrange multipliers in Banach spaces, we derive an optimality system for a local optimal solution.

The time evolution of the continuous measure symmetry for the system built of the three bodies interacting via the potential U(r)~1/r is reported. Gravitational and electrostatic interactions between the point bodies were addressed. In the case of the pure gravitational interaction the three-body-system deviated from its initial symmetrical location, described by the Lagrange equilateral triangle, comes to collapse, accompanied by the growth of the continuous measure of symmetry. When three point bodies interact via the Coulomb repulsive interaction, the time evolution of CMS is quite different. CMS calculated for all of studied initial configurations of the point charges and all of their charge-to-mass ratios always comes to its asymptotic value with time, evidencing the stabilization of the shape of the triangle, constituted by the interacting bodies.

The Gestalt psychologists’ theory of insight problem-solving was based on a direct parallelism between perceptual experience and higher-order forms of cognition (e.g., problem-solving). Simi-larly to the sudden recognition of an ambiguous figure, they contended that problem-solving in-volves a restructuring of one's initial representation of the problem’s elements, leading to a sud-den leap of understanding phenomenologically indexed by the "Aha!" feeling. Over the last centu-ry, different scholars discussed the validity of the Gestalt psychologists’ perspective foremost us-ing the behavioral measures available at the time. However, in the last 2 decades, scientists gained a deeper understanding of insight problem-solving due to the advancements in cognitive neuroscience. This review aims to provide a retrospective reading of Gestalt theory based on the knowledge accrued by adopting novel paradigms and investigating their neurophysiological correlates. Among several key points that the Gestalt psychologists underscored, we focus specif-ically on the role of the visual system in marking a discrete switch of knowledge into awareness, as well as the perceptual experience and the holistic standpoints. While the main goal of this paper is to read the previous theory in light of new evidence, we also hope to initiate an academic dis-cussion and encourage further research about the points we raise.

In recent, Chae found that, at weak gravitational acceleration g_N≲10⁻⁹ms⁻², the observed orbit of the wide binary stars is not accordant with current theory of binary star. Here, we present, this finding should be an observational evidence for that Newtonian theory of orbit perturbation is still valid in galactic scale.

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.

The zero-catch problem is a key issue in CPUE(Catch Per Unit Effort) standardization, and previous studies have treated all zero-catch data uniformly, but this actually loses some correctly-labeled samples. On the other hand, for the main catches with few zero-catch samples, the problem of low performance of fisheries forecasting remains unsolved even though the forecasting model structure is updating constantly, since we cannot know whether the samples are correctly recorded. In this paper, we propose a method based on confident learning theory to detect anomalous samples in the datasets and unify zero-catch and non-zero samples as noise through an overarching framework of learning with noisy labels, which reveals the heterogeneity among zero-catch samples (as well as among non-zero samples) and the homogeneity between zero-catch samples and non-zero samples. Using three species of tuna in the tropical Atlantic Ocean with the spatial resolution of 0.5 ◦ × 0.5 ◦ and time resolution of days from 2016 to 2019 as experimental material, performance on all three classical machine learning models(Random forest, Support Vector Machine and XGBoost) is significantly improved compared to each baseline.This confirms that we propose a self-adaptive, effective method for detecting and repairing anomalous samples in the fishery dataset.

The standard approach to integrable nonlinear evolution equations (NLEE) usually uses the following steps: 1) Lax representation $[L,M]=0$; 2)~construction of fundamental analytic solutions (FAS); 3) reducing the inverse scattering problem (ISP) to a Riemann-Hilbert problem (RHP) $\xi^+(x,t,\lambda) =\xi^-(x,t,\lambda) G(x,t\lambda)$ on a contour $\Gamma$ with sewing function $G(x,t,\lambda)$; 4) soliton solutions and possible applications.Step 1) involves several assumptions: the choice of the Lie algebra $\mathfrak{g}$ underlying $L$, as well as its dependence on the spectral parameter, typically linear or quadratic in $\lambda$. In the present paper we propose another approach which substantially extends the classes of integrable NLEE.Its first advantage is that one can effectively use any polynomial dependence in both $L$ and $M$. We use the following steps: A) Start with canonically normalized RHP with predefined contour $\Gamma$; B) Specify the $x$ and $t$ dependence of the sewing function defined on $\Gamma$; C) Introduce convenient parametrization for the solutions $ \xi^\pm(x,t,\lambda)$ of the RHP and formulate the Lax pair and the nonlinear evolution equations (NLEE); D) use Zakharov-Shabat dressing method to derive their soliton solutions. This needs correctly taking into account the symmetries of the RHP. E) Define the resolvent of the Lax operator and use it analyze its spectral properties.

We discuss the optimal control formulation for enhancement and denoising of satellite multiband images and propose to take it in the form of an L1-control problem for quasi-linear parabolic equation with non-local p[u]-Laplacian and with a cost functional of a tracking type. The main characteristic feature of the considered class of parabolic problems is the fact that the variable exponent p(t,x) and the anisotropic diffusion tensor D(t,x) are not well predefined a priori, but instead these characteristic non-locally depend on a solution of this problem, i.e., pu=p(t,x,u) and Du=D(t,x,u). We prove the existence of optimal pairs with sparse L1-controls using for that the indirect approach and a special family of approximation problems.

In this paper we study a special kind of finite mixture model. The sample drawn from the model consisits of three parts. The first two parts are drawn from specified distributions f1 and f2, while the third one is drawn from the mixture. A problem of interest is whether the two distributions f1 and f2 are the same. To test this hypothesis, we first define the regular location and scale family of distributions and assume that f1 and f2 are regular denisty functions. Then the hypothesis transforms to the equalities of the location and scale parameters, respectively. To utilize the information in the sample, we use Bayes’ theorem to obtain the posterior distribution and give the sampling method. Then we propose the posterior p-value to test the hypothesis. The simulation studies show that our posterior p-value largely improves the power in both normal and logistic cases while nicely controls the Type-I error. A real halibut dataset is used to illustrate the validity of our method.

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

There have been a vast number of studies on reading strategies from different angles performed at various age levels. However, the COVID-19 pandemic has brought a challenge to students´ lives, especially at the university level where they have to struggle with reading many materials online and offline. Therefore, this study investigated the levels of three different strategies of metacognitive awareness: global reading strategy, problem-solving strategy, and support reading strategy among 192 Slovak freshmen university students in a Business English class during the COVID-19 pandemic. The findings reveal that the students used problem-solving strategies the most, followed by global and support reading strategies the least. The results also indicate a difference between male and female students at individual levels of reading strategies. The study proposes a set of recommendations with an alliance of COVID-19 learning environment based on the results such as taking notes while reading and highlighting the most important information with an emphasis on details or showing the importance of previewing the text, asking questions/making predictions about the text, and most importantly paying attention to self-regulation practices in a new school environment.

We study the robustness of the cμ-rule for the optimal allocation of a resource consisting of one unreliable server to parallel queues with two different classes of customers. The customers in queues can be served with respect to a FCFS retrial discipline, when the customers at the head of queues repeatedly tries to occupy the server in a random time. It is proved that for the scheduling problem in the system without arrivals the cμ-rule minimizes the total average cost. For the system with arrivals it is difficult directly to prove the optimality of the same policy with explicit relations. We derived for an infinite-buffer model a static control policy that also prescribes for the certain values of system parameters the service exclusively for the class-i customers if both of queues are not empty with the aim to minimize the average cost per unit of time. It is also shown that in a finite-buffer case the cμ-rule fails.

In a p-uniformly convex and uniformly smooth Banach space, let the pair of variational inequality and fixed point problems (VIFPPs) consist of two variational inequality problems (VIPs) involving two uniformly continuous and pseudomonotone mappings and two fixed point problems implicating two uniformly continuous and Bregman relatively asymptotically nonexpansive mappings. This article designs two parallel subgradient-like extragradient algorithms with inertial effect for solving this pair of VIFPPs, where each algorithm consists of two parts which are of symmetric structure mutually. Under mild registrations, we prove weak and strong convergence of the suggested algorithms to a common solution of this pair of VIFPPs, respectively. Lastly, an illustrative example is furnished to verify the applicability and implementability of our proposed approaches.

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.

In this paper, a short survey of the existed results concerning the Jacobian Conjecture is first given. Then the 3-fold linear type polynomial map will be analyzed in detail. The expansion of the Jacobian condition is deduced to obtain its equivalent algebraic equations, and the Jacobian condition will be analyzed to derive two coordinate transformations that can maintain the invariance of the Jacobian condition. Finally, it is proved by mathematical induction method that one general chain expression presented in this paper is just the inverse polynomial map of 3-fold linear type polynomial map, i.e. LJC(n,[3]) holds such that the Jacobian Conjecture holds.

In this paper, we design two inertial-type subgradient extragradient algorithms with line-search process for solving the pseudomonotone variational inequality problems (VIPs) and common fixed-point problem (CFPP) of finite Bregman relatively nonexpansive mapping and a Bregman relatively demicontractive mapping in p-uniformly convex and uniformly smooth Banach spaces, which are more general than Hilbert spaces. Under mild conditions, we derive weak and strong convergence of the suggested algorithms to a common solution of the VIPs and CFPP, respectively. Additionally, an illustrated example is furnished to back up the feasibility and implementability of our proposed methods.

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.

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.

With the continuous improvement and observable benefits of electric vehicles (EVs), major logistic companies are introducing more EVs into their conventional fleets. This gives rise to a new type of vehicle routing problem with mixed vehicles, where heterogeneous internal combustion vehicles (ICVs) and electric vehicles are considered in route planning. In addition, certain deliveries that are not efficient on any type of vehicles, are outsourced to third-party common carriers. In this paper, we define this problem as a mixed vehicle routing problem with common carriers (MVRPC). The objective of such problems is to minimize the transportation costs by considering routes with ICVs and EVs, the possibility of visiting recharging stations, outsourcing options, and drivers’ layover regulations. This variant of the vehicle routing problems has many practical applications, particularly in the design of long-haul transportation and last-mile delivery services. Effective MVRPC solutions play a key role in promoting the going Green image and optimally allocating resources. The problem has received limited attention in the literature likely because addressing all the needed aspects is especially challenging. To solve the large-scale problem, we develop a branch-and-cut pricing framework that relies on strong cuts and customized labeling algorithms. Numerical experiments highlight the effectiveness of our algorithm. This success can be attributed to tailored critical resources, dynamically bounded bidirectional labeling procedures, strong dominance criteria, and implementation strategies.

News recommendation schemes utilize features of the news itself and information about users to suggest and recommend relevant news items to the users towards the interest they have. However, the effectiveness of the existing news recommendation scheme is limited in the occurrence of new user cold start problems. Therefore, we designed a news recommender system using hybrid approaches to address new user cold start problems to ease and suggest more related news articles for new users. To achieve the objective mentioned above, user demographic data with a hybrid recommendation system that contains the scheme of both content-based and collaborative filtering approaches is proposed. To evaluate the effectiveness of the proposed model, an extensive experiment is conducted using a dataset of news articles with user rating value and user demographic data. The performance of the proposed model is done by two ways of experiment. So, the performance of the proposed model performs around 68.05% of Precision, 42.46% of Recall and 52.1% of the average F1 score for the experiment based on individual user similarity in the system. And also performs around 93.75% of precision, 40.25% of recall and 56.31% F1-score for the similarity of users based on the similarity of users within the same category which is better than the first experiment.

In this review, our goal is to design and test quantum-like algorithms for Artificial Intelligence (AI) in open systems to structure a human-machine team to be able to reach its maximum performance. Unlike the laboratory, in open systems, teams face complexity, uncertainty and conflict. All task domains have complexity levels, some have low, and others high levels. Complexity in this new domain is affected by the environment and the task, which are both affected by uncertainty and conflict. We contrast the individual and interdependence approaches to teams. The traditional and individual approach focuses on building teams and systems by aggregating the best available information for individuals, their thoughts, behaviors and skills. Its concepts are characterized chiefly by one-to-one relations between mind and body, a summation of disembodied individual mental and physical attributes, and degrees of freedom corresponding to the number of members in a team; however, this approach is characterized by the many researchers who have invested in it for almost a century with few effects that can be generalized to human-machine interactions; by the replication crisis of today (e.g., the invalid scales for self-esteem, implicit racism, and honesty); and by its many disembodied concepts. In contrast, our approach is based on the quantum-like nature of interdependence. It allows us to theorize about the bistability of mind and body, but it proposes a measurement problem and a non-factorable nature. Bistability addresses team structure and performance; the measurement problem solves the replication crisis; and the non-factorable aspect of teams reduces the degrees of freedom and the information derivable from teammates to match findings by the National Academies of Science. We begin with a review of the science of teams and a focus on human-machine team research in the laboratory versus the open; justifications for rejecting traditional social science while supporting our approach; a full understand of the complexity of the domain, tasks in the domain, and how teams address both; the mathematics involved; a review of results from our model versus the open field; a discussion of the results; conclusions; and the path forward to successfully advance the science of interdependence and autonomy.

High-fidelity patient simulation (HFPS) is widely used in professional training to enhance students’ competence in clinical management. Problem-solving (PS) and clinical reasoning (CR) skills are essential to developing students in professional competence in safe and effective care. These two skills should be initiated at the early training. However, little is known about the effects of HFPS on developing PS and CR skills in first year undergraduate students. Therefore, this pre- and post-experimental study aimed to investigate the effects of HFPS on development of PS and CR skills in first-year nursing students. The students were required to go through four sessions, preparation, pre-briefing and orientation, simulation role-playing, and debriefing, for the HFPS. The study utilized the Problem-Solving Inventory (PSI) and the Nurses Clinical Reasoning Scale (NCRS) to measure problem-solving and clinical reasoning abilities before and after HFPS. Bivariate analysis, one-sample t-test, and independent t-test were performed to evaluate the performance of the PS and CR skills at the two study periods. One hundred eighty-nine students were recruited, with a mean age of 20.56 years, and 73% were female students. The analytic results showed that the PSI, particularly in domains of Problem-Solving Confidence (PSC) (p&lt;0.001) and overall PS (p&lt;0.001), and the CR (p&lt;0.001) had significant improvement after HFPS. The study concluded that HFPS is an effective innovative method to significantly improve students’ problem-solving and clinical reasoning abilities. Nurse educators play an important role in providing explicit learning instructions in a simulation guideline that directs and guides students to learn at each stage of HFPS. Students should take more initiative and engage in their learning through HFPS to enhance their competence in knowledge and higher intellectual skills for personal and professional developments.

Large values and gradients of stresses and deformations, triggering concentrations of stresses and deformations, arise in the corner areas of a structure. The action of forced deformations, leading to the finite rupture of the contact between the elements of a structure, also triggers the concentration of stresses, while the rupture reaches an irregular point, a line on the area boundary. The theoretical analysis of the stress-strain state (SSS) of areas with angular cutouts in the boundary under the action of discontinuous forced deformations is reduced to the study of singular solutions to the homogeneous problem of the elasticity theory that has power-related features. The calculation of stress concentration coefficients in the domain of a singular solution to the elastic problem makes no sense. It is experimentally proven that the zone, that is close to the vertex of the angular cutout in the area boundary, has substantial deformations, rotations, and it corresponds to rising values of the first and second derivatives of displacements along the radius in cases of sufficiently small radii in the neighbourhood of the irregular point of the boundary. For such areas, it is necessary to consider the plane problem of the elasticity theory, taking into account the geometric nonlinearity under the action of forced deformations. This will allow analyzing the effect of relations between orders of values of deformations, rotations, and forced deformations on the form of the equation of equilibrium. The purpose of this work is to analyze the effect of relations of deformation orders, rotations, forced deformations on the form of the equilibrium equation in the polar coordinate system for a V-shaped area under the action of forced temperature-induced deformations with regard for the geometrical non-linearity and physical linearity.

Previous research on the relative benefits of Augmentative and Alternative Communication Systems (AACs) has indicated controversial results regarding the effectiveness, the ease of use, and the preference for the different systems. The study aims to observe the comparative effectiveness of two different Augmentative and Alternative Communication (AAC) tools, the Picture Exchange Communication System (PECS) and a speech-generating device (SGD), as communication aids for children with autism. Three children with severe autism and minimally verbally or with no functional language participated. The results showed an increase of communicative behavior with both AAC intervention strategies and a speed acquisition time slightly shorter for the SGD training. Two of the three participants showed a preference for the use of the SGD. Reduction in problem behaviors and improvement in vocal production was observed for one of the participants. Results suggest that PECS and SGD are similarly appropriate for the development of initial request skills and that they can encourage vocal production in students with specific prerequisites.

In a series of recent papers we developed a formulation of general relativity in which spacetime and the dynamics of matter evolve with a Poincaré invariant parameter τ. In this paper we apply the formalism to derive the metric induced by a `static’ event evolving uniformly along its t-axis at the spatial origin x=0. The metric is shown to vary with t and τ, as well as spatial distance r, taking its maximum value for a test particle at the retarded time τ=t−r/c. In the resulting picture, an event localized is space and time produces a metric field similarly localized, where both evolve in τ. We first derive this metric as a solution to the wave equation in linearized field theory, and discuss its limitations by studying the geodesic motion it produces for an evolving event. By then examining this solution in the 4+1 formalism, which poses an initial value problem for the metric under τ-evolution, we clarify these limitations and indicate how they may be overcome in a solution to the full nonlinear field equations.

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

Decomposed fuzzy sets are the resent extension of intuitionistic fuzzy sets by incorporating functional and dysfunctional points of views to the definition of membership functions. This paper extends the Technique of Order Preference Similarity to the Ideal Solution (TOPSIS) method to the Decomposed Fuzzy TOPSIS (DF TOPSIS) method and applies it to a multi-criteria risk-based supplier selection problem under fuzziness. DF TOPSIS involves finding a positive ideal solution and a negative ideal solution and measuring the distance of each alternative to these solutions. The final ranking is obtained based on the proportion of distances to the positive and negative ideal solutions. The developed DF TOPSIS method incorporates the accuracy and consistency of expert judgments, enhancing the decision-making process. A sensitivity analysis is also presented in order to show the robustness of the obtained rankings by DF TOPSIS.

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 study, we introduce a new class of bi-univalent functions using q-Janowski Function. We derive the Fekete-Szegö functional problems for functions in this new subclass, as well as estimates for the Taylor-Maclaurin coefficients |α2| and |α3|. Furthermore, a collection of fresh outcomes are3 presented by customizing the parameters employed in our initial discoveries.

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

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

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

In this non-exhaustive review, we discuss the importance of invariant vectors in atomic physics, such as the Laplace-Runge-Lenz vector, the Redmond vector in the presence of an electric field, the Landau-Avron-Sivardière vector when the system is subject to a magnetic field, and the supergeneralized Runge-Lenz vector for the two-center problem. Application to Stark and Zeeman effects are outlined. The existence of constants of motion in the charge-dyon system is also briefly mentioned.

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

Home care centers face both an increase in demand and many variations during the execution of routes, compromising the routes initially planned: robust solutions are not effective enough, it is necessary to move on to resilient approaches. We create a close to reality use case supported by interviews of staff at home health care centers, where caregivers are faced with unexpected events that compromise their initial route. We model, analyze and compare three resilient approaches to deal with these disruptions: a baseline approach without any collaboration, a distributed collaborative approach, and a centralized collaborative approach, where we propose a centralization and sharing of information to improve local decision-making. The latter reduces the number of late arrivals by 11% and the total time of late arrival by 21%, and also halves the number of routes exceeding the end of work time (contrary to the distributed collaborative approach, due to the time wasted reaching colleagues). The use of a device, such as a smartphone application, to centralize and share information thus allows better mutual assistance between caregivers. Moreover, we highlight several possible openings like the coupling of simulation and optimization to propose a more resilient approach.

In the present paper we introduce three new classes of bi-univalent functions connected with Gregory coefficients. For functions in each of these three bi-univalent function classes we have derived the estimates of the Taylor--Maclaurin coefficients $\left|a_{2}\right|$ and $\left|a_{3}\right|$ and Fekete-Szeg\H{o} functional problems for functions belonging to these new subclasses. We defined three subclasses of the class of the bi-univalent functions $\Sigma$, namely $\mathfrak{HG}_{\Sigma}$, $\mathfrak{GM}_{\Sigma}(\mu)$ and $\mathfrak{G}_{\Sigma}(\lambda)$ by using the subordinations with the function whose coefficients are Gregory's numbers. First, we proved that these classes are not empty, i.e. contains other functions than the identity one. Using the well-known Carath\'eodory Lemma for the functions with real positive parts in the open unit disk, together with an estimation due to P. Zaprawa (see https://doi.org/10.1155/2014/357480) and another one of Libera and Zlotkiewicz, we gave upper bounds for the above mentioned initial coefficients and for the Fekete-Szeg\H{o} functionals. The main results are followed by some particular cases, and the novelty of the definitions and the proofs could involve further studies for such type of similarly defined subclasses.

The following system of equations {x_1 \cdot x_1=x_2, x_2 \cdot x_2=x_3, 2^{2^{x_1}}=x_3, x_4 \cdot x_5=x_2, x_6 \cdot x_7=x_2} has exactly one solution in ({\mathbb N}\{0,1})^7, namely (2,4,16,2,2,2,2). Hypothesis 1 states that if a system of equations S \subseteq {x_i \cdot x_j=x_k: i,j,k \in {1,...,7}} \cup {2^{2^{x_j}}=x_k: j,k \in {1,...,7}} has at most five equations and at most finitely many solutions in ({\mathbb N}\{0,1})^7, then each such solution (x_1,...,x_7) satisfies x_1,...,x_7 \leq 16. Hypothesis 1 implies that there are infinitely many composite numbers of the form 2^{2^{n}}+1. Hypotheses 2 and 3 are of similar kind. Hypothesis 2 implies that if the equation x!+1=y^2 has at most finitely many solutions in positive integers x and y, then each such solution (x,y) belongs to the set {(4,5),(5,11),(7,71)}. Hypothesis 3 implies that if the equation x(x+1)=y! has at most finitely many solutions in positive integers x and y, then each such solution (x,y) belongs to the set {(1,2),(2,3)}. We describe semi-algorithms sem_j (j=1,2,3) that never terminate. For every j \in {1,2,3}, if Hypothesis j is true, then sem_j endlessly prints consecutive positive integers starting from 1. For every j \in {1,2,3}, if Hypothesis j is false, then sem_j prints a finite number (including zero) of consecutive positive integers starting from 1.

I extend earlier work that derived a Born rule for nuclear-decay cloud chamber tracks (Mott problem) without invoking quantum measurement axioms. The key ingredient there was the identification of sites at which the cross section for ionization by a passing charged particle is singular at ionization threshold. This singularity arose from a Penning-like process involving molecular polarization in sub-critical vapor clusters. In the present paper, I propose a simple experiment to determine if similar ionization physics takes place in the mica window of a Geiger counter and drives the collimation of spherically-symmetric wavefunctions outside the counter tube into ion tracks inside. The experiment measures the count rate from a radioactive point source as a function of source-window separation. I have performed a proof-of-concept of this experiment; results are consistent with the singular-ionization picture. I consider implications for the Stern-Gerlach experiment and superconducting qubits. I detail further work required to flesh out these results more rigorously.

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.

The problem of optimal scheduling in a system with parallel queues and a single server has been extensively studied in the queueing theory. However, such systems have mostly been studied by assuming homogeneous attributes of arrival and service processes, or in heterogeneous case a Markov random process was usually assumed. In this paper, we explore the possibility of combining simulation and neural network paradigms for optimal scheduling in a heterogeneous system with an arbitrary inter-arrival and service time distributions. The service of any queue by the server is exhaustive. Further routing of the server after the queue has been emptied is as instructed by the trained neural network. Any change in the queue that currently has a server is accompanied by a switching cost. The simulated annealing optimization algorithm which is used to optimize the parameters of the neural network was adapted for numerically evaluated average cost function. A Markov decision problem was formulated for the corresponding markovian queueing system to verify the results of solving the optimization problem. In addition to comparing the actual values of the average cost, the parameter values of the neural network trained on the optimal control policy of the Markov model are also used to determine the domains of parameters required for the simulated annealing defined on a finite discrete domain. Numerical analysis shows the effectiveness of this approach. Moreover, a comparison of the results for different distributions illustrates the insensitivity of the optimal control policy to the shape of the distributions for the same two first moments. Thus, the optimal control policy for an exponential model can be used as a suboptimal one for the general system.

Equine Assisted Activities (EAA) are considered a suitable innovative rehabilitative practice for children with neurodevelopmental disorders, including Autism Spectrum Disorder (ASD). While standardized scales have been previously used as a tool to evaluate the effects of EAA on different domains of functioning in ASD children, few studies have considered an ethological approach as a means to describe human-horse interactions in the context of ASD. In this study, we aimed to evaluate the behaviour of 19 children with ASD - in comparison with 19 typically developing children (TD) - during EAA sessions. We developed an ethogram from the video-recordings, to assess spatial relationships, social interactions and communicative behaviours displayed by the child towards the horse, as well as the occurrence of problem behaviours. Results indicate that children’s behaviours during EAA sessions are modulated by sex and age, while previous children’s experience with EAA appeared to improve interpersonal distance and horse handling. Results from this study highlight the importance of exploring children's behavioural response during animal-assisted activities through direct measurements. This may allow linking the quality/strength of the child-horse relationship to the benefits obtained by the child, particularly in the social/communicative domain, a core symptom of ASD.