Solving Linear equations with large number of variable contains many computations to be performed either iteratively or recursively. Thus it consumes more time when implemented in a sequential manner. There are many ways to solve the linear equations such as Gaussian elimination, Cholesky factorization, LU factorization, QR factorization. But even these methods when implemented on a sequential platform yield slower results as compared to a parallel platform where the time consumption is reduced considerably due to concurrent execution of instructions. The above mentioned linear equation solving methods can be implemented on the parallel platform using the direct approaches such as pipelining or 1D and 2D Partitioning approach. Vedic mathematics is a very ancient approach for solving mathematical problems. These Vedic mathematical approaches are well known for quicker and faster computation of mathematical problems. Vedic Mathematics provides a very different outlook towards the approach of solving linear Equation on parallel platform. It could be considered as a better approach for reducing space consumption and minimizing the number of algebraic operations involved in solving linear equation. In future Vedic Mathematics might serve as a viable solution for solving linear equation on parallel platform.

In this paper, a system of searching for optimal paths is developed and concreted on a FPGA. It is based on a memristive emulator, used as a delay element, by configuring the test graph as a memristor network. A parallel algorithm is applied to reduce computing time and increase efficiency. The operation of the algorithm in Matlab is checked beforehand and then exported to two different Intel FPGAs: a DE0-Nano board and an Arria 10 GX 220 FPGA. In both cases reliable results are obtained quickly and conveniently, even for the case of a 300x300 nodes maze.

Urban design is a complex problem-solving activity that commonly requires the aid of a variety of methods to support the process and enhance the quality of the outcomes. How to help designers with adequate methods to deal with ill-defined urban problems constitutes a major challenge in the urban design domain. In this regard, the use of urban design patterns is considered as a method that can contribute to urban design problem-solving. However, this tool was never investigated to understand its role in the task-related activities that take place during the design process by designers working in team, and its effect on the creativity of the final design outcome as perceived by urban designers and students. Therefore, an empirical research based on a controlled experiment was carried out to explore the aid provided by design patterns during the conceptual stages of the process. The study contributed to gain a better insight into the main design activities derived from the use of patterns as problem-solving tools, and to unveil their contribution to urban design. Implications for design practice and design education are discussed.

A family of linear singularly perturbed Cauchy problems is studied. The equations defining the problem combine both partial differential operators together with the action of linear fractional transforms. The exotic geometry of the problem in the Borel plane, involving both sectorial regions and strip-like sets, gives rise to asymptotic results relating the analytic solution and the formal one through Gevrey asymptotic expansions. The main results lean on the appearance of domains in the complex plane which remain intimately related to Lambert W function, which turns out to be crucial in the construction of the analytic solutions. On the way, an accurate description of the deformation of the integration paths defining the analytic solutions and the knowledge of Lambert W function are needed in order to provide the asymptotic behavior of the solution near the origin, regarding the perturbation parameter. Such deformation varies depending on the analytic solution considered, which lies in two families with different geometric features.

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

The properties of iterative splitting methods with serial versions have been analyzed since recent years, see [1] and [3]. We extend the iterative splitting methods to a class of parallel versions, which allow to reduce the computational time and keep the benet of the higher accuracy with each iterative step. Parallel splitting methods are nowadays important to solve large problems, which can be splitted in subproblems and computed independently with the dierent processors. We present a novel parallel iterative splitting method, which is based on the multi-splitting methods, see [2], [10] and [15]. Such a exibilisation with multisplitting methods allow to decompose large iterative splitting methods and recover the benet of their underlying waveform-relaxation (WR) methods. We discuss the convergence results of the parallel iterative splitting methods, while we could reformulate such an error to a summation of the individual WR methods. We discuss the numerical convergence of the serial and parallel iterative splitting methods and present dierent numerical applications to validate the benet of the parallel versions.

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

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

The article presents a cyber-physical system for acquiring, processing and reconstructing images from measurement data. The technology was based on process tomography, intelligent measurement sensors, machine learning, Big Data, Cloud Computing, Internet of Things as a solution for Industry 4.0. Industrial tomography enables observation of physical and chemical phenomena without the need of internal penetration and allows real-time monitoring of production processes. The application includes specialized intelligent devices for tomographic measurements and dedicated algorithms for solving the inverse problem. The work focuses mainly on electrical tomography and image reconstruction using deterministic methods and machine learning, the reconstruction results were compared, different measurement models were used. The researches were carried out for synthetic data and laboratory measurements. The main advantage of the proposed system is the possibility of spatial data analysis and their high processing speed. The presented research results show that the process tomography gives the possibility to analyse the processes taking place inside the facility without disturbing the production, analysis and detection of obstacles, defects and various anomalies. Knowing the characteristics of a given solution, the application allows you to choose the appropriate method to reconstruct the image.

Quantum mechanics could be studied through polynomial algebra, as has been demonstrated by a work (“An approach to first-principles electronic structure calculation by symbolic-numeric computation” by A. Kikuchi). We carry forward the algebraic method of quantum mechanics through algebraic number theory; the basic equations are represented by the multivariate polynomial ideals; the symbolic computations process the ideal and disentangle the eigenstates as the algebraic variety; upon which one canbuild the Galois extension of the number field, in analogy with the univariate polynomial case, to investigate the hierarchy of solutions; the Galois extension is accompanied with the group operations, which permute the eigenstates from one to another, and furnish the quantum system with a non-apparent symmetry. Besides, this sort of algebraic quantum mechanics is an embodiment of the class field theory; some of the important consequences of the latter emerge in quantum mechanics. We shall demonstrate these points through simple models; we will see the use of computational algebra facilitates such sort of analysis, which might often be complicated if we try to solve them manually.

As people grow a custom to effortless outdoor navigation there is a rising demand for similar possibility indoors as well. Unfortunately, indoor localization, being one of the necessary requirements for navigation, continues to be problem without a clear solution. In this article we are proposing a method for an indoor positioning system using a single image. This is made possible using small preprocessed database of images with known control points as the only preprocessing needed. Using feature detection with SIFT algorithm we can look through the database and find image which is the most similar to the image taken by user. Pair of images is then used to find coordinates of database image using PnP problem. Furthermore, projection and essential matrices are determined allowing for the user image localization ~ determining the position of the user in indoor environment. Benefits of this approach lies in the single image being the only input from user and no requirements for new onsite infrastructure and thus enables a simpler realization for the building management.

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.

In this paper, I give readers an idea of what some scholars are interested in, what I found interesting, and what may be of future interest in the philosophy of emotion. I begin with a brief overview of the general topics of interests in the philosophy of emotion. I then discuss what I believe to be some of the most interesting topics in the contemporary discourse, including questions about how philosophy can inform the science of emotion, conceptions of the mind and the mind-body problem, concerns about perception, cognition, and emotion, along with questions about the place of 4E approaches and meta-semantic pluralist approaches in the embodied cognitive tradition. Finally, I discuss the emerging field of cultural evolution, the import of a dual-inheritance theory in this emerging field, and I propose a possible way to integrate the frameworks of dual-inheritance theory and meta-semantic pluralism to demonstrate at least one way in which the philosophy of emotion can contribute to the emerging field of cultural evolution.

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

We consider a family of nonlinear singularly perturbed PDEs whose coefficients involve a logarithmic dependence in time with confluent Fuchsian singularities that unfold an irregular singularity at the origin and rely on a single perturbation parameter. We exhibit two distinguished finite sets of holomorphic solutions, so-called outer and inner solutions, by means of a Laplace transform with special kernel and Fourier integral. We analyze the asymptotic expansions of these solutions relatively to the perturbation parameter and show that they are (at most) of Gevrey order 1 for the first set of solutions and of some Gevrey order that hinges on the unfolding of the irregular singularity for the second.

Distributed Systems architectures are becoming the standard computational model for processing and transportation of information, especially for Cloud Computing environments. The increase in demand for application processing and data management from enterprise and end-user workloads continues to move from a single-node client-server architecture to a distributed multitier design where data processing and transmission are segregated. Software development must considerer the orchestration required to provision its core components in order to deploy the services efficiently in many independent, loosely coupled - physically and virtually interconnected - data centers spread geographically, across the globe. This network routing challenge can be modeled as a variation of the Travelling Salesman Problem (TSP). This paper proposes a new optimization algorithm for optimum route selection using Algorithmic Information Theory. The Kelly criterion for a Shannon-Bernoulli process is used to generate a reliable quantitative algorithm to find a near optimal solution tour. The algorithm is then verified by comparing the results with heuristic solutions in 3 test cases. A statistical analysis is designed to measure the significance of the results between the algorithms and the entropy function can be derived from the distribution. The tested results shown an improvement in the solution quality by producing routes with smaller length and time requirements. The quality of the results proves the flexibility of the proposed algorithm for problems with different complexities without relying in nature-inspired models such as Genetic Algorithms and Simulated Annealing. This algorithm can be used by orchestration applications to deploy services across large cluster of nodes by making better decision in the route design.

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

The Kolkata Paise Restaurant Problem is a very challenging game, where n agents have to decide where they will have lunch on a busy day during their lunch break. The game is very interesting because there are exactly n restaurants and each restaurant can accommodate only one agent. If two or more agents happen to choose the same restaurants, only one gets served and the others have to return back to work hungry. In this paper, we tackle this problem from an entirely new angle. We abolish certain implicit assumptions, which allows us to propose a novel strategy with greater utilization of the restaurants and overall efficiency. We emphasize the spatially distributed nature of our approach, which, for the first time, perceives the locations of the restaurants as uniformly distributed in the entire city area. This critical change in perspective has profound ramifications in the topological layout of the restaurants, which now makes it completely realistic to assume that every agent has a second chance. Every agent now may visit, in case of failure, more than one restaurants, within the predefined time constraints. From the point of view of each agent, the situation now resembles more that of the iconic travelling salesman, who must compute an optimal route through n cities. Following this shift in paradigm, we advocate the use of metaheuristics, as exacts solution of the TSP are prohibitively expensive, because they can produce near-optimal solutions in a very short amount of time. The use of metaheuristics enables each agent to compute her own personalized solution, incorporating her preferences, and providing alternative destinations in case of successive failures. We analyze rigorously the resulting situation, proving probabilistic formulas that confirm the advantages of this policy and the increase in utilization. The detailed mathematical analysis of our scheme demonstrates that it can achieve utilization ranging from .85 to 0.95 from the first day, while rapidly attaining steady state utilization 1.0. Moreover, the equations we have developed generalize previously presented formulas in the literature, which can be shown to be special cases of our results.

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

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

We provide an axiomatic base for the set of natural numbers, that has been proposed as a canonical construction, and use this definition of $\mathbb N$ to find several results on finite group theory. Every finite group $G$, is well represented with a natural number $N_G$; if $N_G=N_H$ then $H,G$ are in the same isomorphism class. We have a linear order, on the quotient space of isomorphism classes of finite groups, that is well behaved with respect to cardinality. If $H,G$ are two finite groups such that $|H|=m<n=|G|$, then $H<\mathbb Z_n\leq G\leq\mathbb Z_{p_1}^{n_1}\oplus\mathbb Z_{p_2}^{n_2}\oplus\cdots\oplus\mathbb Z_{p_k}^{n_k}$ where $n=p_1^{n_1}p_2^{n_2}\cdots p_{k}^{n_k}$ is the prime factorization of $n$. We find a canonical order for the objects of $G$ and define equivalent objects of $G$, thus finding the automorphisms of $G$. The Cayley table of $G$ takes canonical block form, and we are provided with a minimal set of independent equations that define the group. We show how to find all groups of order $n$, and order them. We give examples using all groups with order smaller than $10$, and we find the canonical block form of the symmetry group $\Delta_4$. In the next section, we extend our results to the infinite case, which defines a real number as an infinite set of natural numbers. A real function is a set of real numbers, and a sequence of real functions $f_1,f_2,\ldots$ is well represented by a set of real numbers, as well. In general, we represent mathematical objects using the smallest possible data-type. In the last section, mathematical objects are well assigned to tree structures. We conclude with brief comments on type theory and future work on computational aspects of these representations.

The article discusses determinants of living environment in Central and Eastern Europe. As an example, the city of Radzionkow was chosen, with 16 thousand inhabitants, located in the Silesia agglomeration in southern Poland, in the area where hard coal has been mined for almost two hundred years, which largely serves as a source of heating for houses and flats. 360 buildings in 6 groups of 60 buildings were examined in the selected city, which allowed to distinguish 3 different areas in terms of the quality of the living environment depending on the technical condition of buildings, the method of heating and location. To a large extent, determinants are the existing spatial and geophysical conditions of a given location. Many research and reports on the living environment do not take into account the factors mentioned, focusing only on the statistical data of pollution, excluding spatial factors. In the research presented, the author, taking into account location variables, shows differences in the measurements of air pollution in relation to the designated location zones depending on the morphological structure of the building, the degree of its modernization and the types of heating used in buildings.

Inverse problems of recovering surface fluxes on the boundary of a domain from pointwise observations are considered. Sharp conditions on the data ensuring existence and uniqueness of solutions in Sobolev classes are exposed. They are smoothness conditions on the data, geometric conditions on the location of measurement points, and the boundary of a domain. The proof relies on asymptotics of fundamental solutions to the corresponding elliptic problems and the Laplace transform. The problem is reduced to a linear algebraic system with a nondegerate matrix.

Service pricing is a bottleneck in the development of innovation services, as it is the issue of most concern between the suppliers and demanders. In this paper, a negotiation pricing model that is based on the multiobjective genetic algorithm is developed for innovation service pricing. Regarding the service pricing process as a multiobjective problem, the objective functions, which include the service price, service efficiency, and service quality, for suppliers and demanders are constructed. As the solution of a multiobjective problem is typically a series of alternatives, another negotiation process is necessary for determining the final decision. A learning strategy is adopted during the negotiation process to simulate reality. Finally, the model is implemented for an innovation service transaction, the objective of which is to identify the optimal price plan. The results demonstrate that the model can provide quantitative decision support for the pricing of an innovation service and ultimately yield a win-win result for both the supplier and demander of the innovation service. Furthermore, the influence of the parameters during the negotiation process is analyzed in detail. The effects of the learning strategy on accelerating the negotiation process, as well as the chosen of reasonable parameters are given.

The center vortex model of quantum chromodynamic states that vortices, closed color-magnetic flux, percolate the vacuum. Vortices are seen as the relevant excitations of the vacuum, causing confinement and dynamical chiral symmetry breaking. In an appropriate gauge, as direct maximal center gauge, vortices are detected by projecting onto the center degrees of freedom. Such gauges suffer from Gribov copy problems: different local maxima of the corresponding gauge functional can result in different predictions of the string tension. By using non-trivial center regions, that is, regions whose boundary evaluates to a non-trivial center element, a resolution of this issue seems possible. We use such non-trivial center regions to guide simulated annealing procedures, preventing an underestimation of the string tension in order to resolve the Gribov copy problem.

Mild Cognitive Impairment (MCI) is a clinical syndrome characterized by a moderate decline in one or more cognitive functions with a preserved autonomy in daily life activities [1]. MCI exhibits cognitive, behavioral, psychological symptoms [2]. The executive functions (EFs) are a set of key functions for everyday life and physical and mental health; and allow adapting the behavior to external changes [3-5]. Higher-level executive functions develop from basic EFs (inhibition, working memory, attentional control, and cognitive flexibility). They are planning, reasoning, problem- solving, and fluid intelligence (Gf) [3]. This systematic review investigates the relationship between higher-level executive functions and healthy and pathological aging, assuming the role of executive functions deficits as a predictor of cognitive decline. The systematic review was conducted according to the PRISMA Statement [6-7]. A total of 73 studies were identified. The results indicate that 65.8% of the studies confirm significant EFs alterations in MCI (100% problem solving, 71.4% fluid intelligence, 56.8% planning, 50% reasoning). These results seem to highlight a strong prevalence of higher-level executive functions deficits in MCI elderly than in healthy elderly.

The purpose of the study is to control the ratio of programs of different genres when forming the broadcast grid in order to increase and maintain the rating of the channel. In the multichannel environment, television rating control consists of selecting such content, ratings of which are completely restored after advertising. A hybrid approach combining the benefits of semantic training and fuzzy relational equations in simplification of the expert recommendation systems construction is proposed. The problem of retaining the television rating can be attributed to the problems of fuzzy resources control. The increase or decrease trends of the demand and supply are described by primary fuzzy relations. The rule-based solutions of fuzzy relational equations connect significance measures of the primary fuzzy terms. Rules refinement by solving fuzzy relational equations allows avoiding labor-intensive procedures for the generation and selection of expert rules. The solution set generation corresponds to the granulation of the television time, where each solution represents the time slot and the granulated rating of the content. In automated media planning, generation of the weekly TV program in the form of the granular solutions provides the decrease of the time needed for the programming of the channel broadcast grid.

Work-related thoughts in off-job time have been studied extensively in occupational health psychology and related fields. We provide a focused review of research on overcommitment – a component within the effort-reward imbalance model – and aim to connect this line of research to the most commonly studied aspects of work-related rumination. Drawing on this integrative review, we analyze survey data on ten facets of work-related rumination, namely (1) overcommitment, (2) psychological detachment, (3) affective rumination, (4) problem-solving pondering, (5) positive work reflection, (6) negative work reflection, (7) distraction, (8) cognitive irritation, (9) emotional irritation, and (10) inability to recover. First, we leverage exploratory factor analysis to self-report survey data from 357 employees to calibrate overcommitment items and to position overcommitment within the nomological net of work-related rumination constructs. Second, we leverage confirmatory factor analysis to self-report survey data from 388 employees to provide a more specific test of uniqueness vs. overlap among these constructs. Third, we apply relative weight analysis to quantify the unique criterion-related validity of each work-related rumination facet regarding (1) physical fatigue, (2) cognitive fatigue, (3) emotional fatigue, (4) burnout, (5) psychosomatic complaints, and (6) satisfaction with life. Our results suggest that several measures of work-related rumination (e.g., overcommitment and cognitive irritation) can be used interchangeably. Emotional irritation and affective rumination emerge as the strongest unique predictors of fatigue, burnout, psychosomatic complaints, and satisfaction with life. Our study assists researchers in making informed decisions on selecting scales for their research and paves the way for integrating research on effort-reward imbalance and work-related rumination.

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

Although educational timetabling problems have been studied for decades, one type, the STP, has not developed as quickly as the other two types due to its diversity and complexity. Also, most of the STP research has only focused on the educators’ availabilities when studying the educator aspect, and the educators’ preferences and expertise have not been taken into consideration. This paper proposes a conceptual model for the school timetabling problem considering educators’ availabilities, preferences and expertise as a whole, and chooses a common real-world school timetabling scenario to study. A mathematical model is presented. A Virtual search space for dealing with the large search space is introduced, and the artificial bee colony algorithm is adapted and applied to the proposed model. The proposed approach is simulated with a random-generated large dataset. The experimental results demonstrate that the proposed approach is able to solve the STP and handle a large dataset in an ordinary computer hardware environment, which significantly reduces computational costs. Compared to the traditional CP method, the proposed approach is more effective and can provide more satisfactory solutions in considering educators’ availabilities, preferences, and expertise levels.

We studies the initial value problem for the fractional Navier-Stokes-Coriolis equations, which obtained by replacing the Laplacian operator in the Navier-Stokes-Coriolis equation by the more general operator $(-\Delta)^\alpha$ with $\alpha>0$. We introduce function spaces of the Besove type characterized by the time evolution semigroup associated with the general linear Stokes-Coriolis operator. Next, we establish the unique existence of global in time mild solutions for small initial data belonging to our function spaces characterized by semigroups in both the scaling subcritical and critical settings.

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.

Instead of the conventional 0 and 1 values, bipolar reasoning uses -1, 0, +1 to describe double-sided judgements in which neutral elements are halfway between positive and negative evaluations (e.g., “uncertain” lies between “impossible” and “totally sure”). We discuss the state-of-the-art in bipolar logics and recall two medieval forerunners, i.e., William of Ockham and Nicholas of Autrecourt, who embodied a bipolar mode of thought that is eminently modern. Starting from the trivial observation that “once a wheat sheaf is sealed and tied up, the packed down straws display the same orientation”, we work up a new theory of the bipolar nature of networks, suggesting that orthodromic (i.e., feedforward, bottom-up) projections might be functionally coupled with antidromic (i.e., feedback, top-down) projections via the mathematical apparatus of presheaves/globular sets. When an entrained oscillation such as a neuronal spike propagates from A to B, changes in B might lead to changes in A, providing unexpected antidromic effects. Our account points towards the methodological feasibility of novel neural networks in which message feedback is guaranteed by backpropagation mechanisms endowed in the same feedforward circuits. Bottom-up/top-down transmission at various coarse-grained network levels provides fresh insights in far-flung scientific fields such as object persistence, memory reinforcement, visual recognition, Bayesian inferential circuits and multidimensional activity of the brain. Implying that axonal stimulation by external sources might backpropagate and modify neuronal electric oscillations, our theory also suggests testable previsions concerning the optimal location of transcranial magnetic stimulation’s coils in patients affected by drug-resistant epilepsy.

In the energy-momentum density expressions for a relativistic perfect fluid with a bulk motion, one comes across a couple of pressure-dependent terms, which though well known, are to an extent, lacking in their conceptual basis and the ensuing physical interpretation. In the expression for the energy density, the rest mass density along with the kinetic energy density of the fluid constituents due to their random motion, which contributes to the pressure as well, are already included. However, in a fluid with a bulk motion, there are, in addition, a couple of explicit, pressure-dependent terms in the energy-momentum densities, whose presence to an extent, is shrouded in mystery, especially from a physical perspective. We show here that one such pressure-dependent term appearing in the energy density, represents the work done by the fluid pressure against the Lorentz contraction during transition from the rest frame of the fluid to another frame in which the fluid has a bulk motion. This applies equally to the electromagnetic energy density of electrically charged systems in motion and explains in a natural manner an apparently paradoxical result that the field energy of a charged capacitor system decreases with an increase in the system velocity. The momentum density includes another pressure-dependent term, that represents an energy flow across the system, due to the opposite signs of work being done by pressure on two opposite sides of the moving fluid. From Maxwell's stress tensor we demonstrate that in the expression for electromagnetic momentum of an electric charged particle, it is the presence of a similar pressure term, arising from electrical self-repulsion forces in the charged sphere, that yields a natural explanation for the famous, more than a century old, 4/3 factor in the electromagnetic mass.

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

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

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

We examine a nonlinear initial value problem both singularly perturbed in a complex parameter and singular in complex time at the origin. The study undertaken in this paper is the continuation of a joined work with A. Lastra published in 2015. A change of balance between the leading and a critical subdominant term of the problem considered in our previous work is performed. It leads to a phenomenon of coalescing singularities to the origin in the Borel plane w.r.t time for a finite set of holomorphic solutions constructed as Fourier series in space on horizontal complex strips. In comparison to our former study, an enlargement of the Gevrey order of the asymptotic expansion for these solutions relatively to the complex parameter is induced.

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.

A nonlinear singularly perturbed Cauchy problem with confluent fuchsian singularities is examined. This problem involves coefficients with polynomial dependence in time. A similar initial value problem with logarithmic reliance in time has been investigated by the author in a recent work, for which sets of holomorphic inner and outer solutions were built up and expressed as a Laplace transform with logarithmic kernel. Here, a family of holomorphic inner solutions are constructed by means of exponential transseries expansions containing infinitely many Laplace transforms with special kernel. Furthermore, asymptotic expansions of Gevrey type for these solutions relatively to the perturbation parameter are established.

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.

Industrial dynamical systems often exhibit multi-scale response due to material heterogeneities, operation conditions and complex environmental loadings. In such problems, it is the case that the smallest length-scale of the systems dynamics controls the numerical resolution required to effectively resolve the embedded physics. In practice however, high numerical resolutions is only required in a confined region of the system where fast dynamics or localized material variability are exhibited, whereas a coarser discretization can be sufficient in the rest majority of the system. To this end, a unified computational scheme with uniform spatio-temporal resolutions for uncertainty quantification can be very computationally demanding. Partitioning the complex dynamical system into smaller easier-to-solve problems based of the localized dynamics and material variability can reduce the overall computational cost. However, identifying the region of interest for high-resolution and intensive uncertainty quantification can be a problem dependent. The region of interest can be specified based on the localization features of the solution, user interest, and correlation length of the random material properties. For problems where a region of interest is not evident, Bayesian inference can provide a feasible solution. In this work, we employ a Bayesian framework to update our prior knowledge on the localized region of interest using measurements and system response. To address the computational cost of the Bayesian inference, we construct a Gaussian process surrogate for the forward model. Once, the localized region of interest is identified, we use polynomial chaos expansion to propagate the localization uncertainty. We demonstrate our framework through numerical experiments on a three-dimensional elastodynamic problem

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

Three body systems in which one of the bodies is ejected without escaping the binary system have previously been studied in various restricted forms. However, none of these studies dwells on the problem in a general setting. Thus, to study this phenomenon qualitatively, we try to expand this problem's scope to unequal mass systems and generalize them by considering various configurations of fixed initial points with precisely calculated initial velocities, some zero velocity models and some optimized models. We will see the use of terminology similar to the previous studies done in this domain but incorporate different analytical and evaluation methods.

This study proposes a novel flexible bus dispatching system where a fleet of fully automated modular bus units, together with conventional buses, serves the passenger demand. These modular bus units can either operate individually or combined (forming larger modular buses with a higher passenger capacity). This provides enormous flexibility to manage the service frequencies and vehicle allocation, reducing thereby the operating cost and improving passenger mobility. We develop an optimization model used to determine the optimal composition of bus units and the optimal service frequency at which the buses (both conventional and modular) are dispatched across each bus line. We explicitly account for the dynamics of traffic congestion and complex interactions between the modes at the network level based on the recently proposed three-dimensional macroscopic fundamental diagram (3D-MFD). To the best of our knowledge, this is the first application of the 3D-MFD and modular bus units for the frequency setting problem in the domain of bus operations. Numerical results show the improvements in the total system cost made by adapting the number of combined modular bus units and their dispatched frequencies to the evolution of both, the car and the passenger demand. A comparison with the commonly used approach that considers only the bus system (neglecting the complex multimodal interactions and congestion propagation) reveals the value of the proposed modeling framework.

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

Different variants of thinning for discrete random variables are studied. The thinning procedure allows to introduce an analog of scale parameter for positive integer-valued random variables. Sufficient and necessary conditions for the existence of such a scale are given.

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

We examine a family of linear partial differential equations both singularly perturbed in a complex parameter and singular in complex time at the origin. These equations entail forcing terms which combine polynomial and logarithmic type functions in time and that are bounded holomorphic on horizontal strips in one complex space variable. A set of sectorial holomorphic solutions are built up by means of complete and truncated Laplace transforms w.r.t time and parameter and Fourier inverse integral in space. Asymptotic expansions of these solutions relatively to time and parameter are investigated and two distinguished Gevrey type expansions in monomial and logarithmic scales are exhibited.

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.

In a recent paper [1], I argued against backward in time effects used by several authors to explain delayed choice experiments. I gave an explanation showing that there is no physical influence propagating from the present to the past and modifying the state of the system at a time previous to the measurement. However, though the solution is straightforward in the case of delayed choice experiments involving only one particle, it is subtler in the case of experiments involving two entangled particles because they give rise to EPR-like situations. Considering that a measurement is not an actual change of the physical state of a system and is relative to the observer allows to understand that there is neither backward in time effects nor instantaneous collapse of the second system when the first one is measured, as is often postulated. This allows also to get rid of any non-locality [2]. In this paper, I want to go further into the consequences of this way of considering the measurement, that I have called Convivial Solipsism, and show that even if, in the usual sense, there is no physical effect of the present or of the future on the past, we must nevertheless consider that the observer’s past is sometimes not entirely determined and that it becomes determined only when certain measurements are done latter. This apparent contradiction disappears if one understand that each observer builds, through her own measurements, her own world (that I call the phenomenal world in Convivial Solipsism) which is different from what we are used to consider as the common world shared by everybody.

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.

Diffuse optical tomography (DOT) is an optical medical imaging method that can assess the structural properties of tissues and their functional characteristics, such as hemoglobin concentration, water content, as well as lipid concentration, via three-dimensional image reconstruction. This paper presents the theoretical basis and working principle of diffuse optical tomography. The paper explains how the optical properties of tissue can be imaged by photon migration techniques based on diffusion theory. The author presents the reasoning for near-infrared (NIR) imaging as the most effective technique in terms of quantitative recovery of spectroscopic optical parameters. This work also listed various advantages, applications, and challenges of DOT. The paper also briefly discusses current progress in near-infrared medical imaging and its future direction.

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.

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.

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.

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.

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

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

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.

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.

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

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.

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.

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.

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.

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.

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.

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.

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.

We propose Reduced Collatz Conjecture that is equivalent to Collatz Conjecture, which states that every positive integer can return to an integer less than it, instead of 1. Reduced Collatz Conjecture should be easier because some properties are presented in reduced dynamics, rather than in original dynamics (e.g., ratio and period). Reduced dynamics is a computation sequence from starting integer to the first integer less than it, and original dynamics is a computation sequence from starting integer to 1. Reduced dynamics is a component of original dynamics. We denote dynamics of x as a sequence of either computations in terms of ``I'' that represents (3*x+1)/2 and ``O'' that represents x/2. Here 3*x+1 and x/2 are combined together, because 3*x+1 is always even and followed by x/2. We formally prove that all positive integers are partitioned into two halves and either presents ``I'' or ``O'' in next ongoing computation. More specifically, (1) if any positive integer x that is i module $2^t$ (i is an odd integer) is given, then the first t computations (each one is either ``I'' or ``O'' corresponding to whether current integer is odd or even) will be identical with that of i. (2) If current integer after t computations (in terms of ``I'' or ``O'') is less than x, then reduced dynamics of x is available. Otherwise, the residue class of x (namely, i module $2^t$) can be partitioned into two halves (namely, i module $2^{t+1}$ and $i+2^t$ module $2^{t+1}$), and either half presents ``I'' or ``O'' in intermediately forthcoming (t+1)-th computation.

This paper develops feasible control strategies and associated system responses to bring an autonomous front-axle bicycle robot from specified initial conditions to final conditions such that a specific performance index is minimized. To solve the problem, the following approach is used: The feasible controls derived from the normal equations of optimality are substituted into the state and the costate systems and form a combined control-free state-costate system which is vectorized to enable and ease the application of a numerical method. A computer program written in Matlab computer programming language, codes a fourth-order Runge-Kutta numerical method and then solve the combined state-costate system of ordinary differential equations. The obtained results are the feasible bicycle robot trajectory, the feasible state functions, the feasible costate functions and the feasible control functions. Associated Computational Simulations are designed and provided to persuade on the effectiveness and the reliability of the approach.

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.

With Unmanned Aerial Vehicles (UAV), a swift response to urgent needs like search \& rescue missions or medical deliveries can be realized. Simultaneously, the legislator is establishing so-called geographical zones, which restrict UAV operations to mitigate the air and ground risk to third parties. These geographical zones serve a particular safety interest, but they may also hinder the efficient usage of UAVs on time-critical missions with a range-limiting battery capacity. In this study, we address a facility location problem for up to two UAV hangars with a robust optimization model considering demand hotspots, geographical zones as restricted areas, a standard mission to satisfy battery capacity constraints, and the impact of wind scenarios. To this end, water rescue missions are used exemplary, for which positive and negative location factors for UAV hangars and areas of increased drowning risk as demand points are derived from open-source georeferenced data. Optimal UAV mission trajectories are computed with an A* algorithm considering five different restriction scenarios. As this pathfinding is very time-consuming, binary occupancy grids and image processing algorithms accelerate the computation by identifying either entirely inaccessible or restriction-free connections beforehand. For the optimal UAV hangar locations, we maximize accessibility while minimizing the service time to the hotspots, resulting in a decrease from the average service time of 570.4 s for all facility candidates to 351.1 s for one and 287.2 s for two optimal UAV hangar locations.

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

In this work we study the recently developed parametrized partition function formulation and show how we can infer the thermodynamic properties of fermions based on numerical simulation of bosons and distinguishable particles at various temperatures. In particular, we show that in the three dimensional space defined by energy, temperature and the parameter characterizing parametrized partition function, we can map the energies of bosons and distinguishable particles to fermionic energies through constant-energy contours. We apply this idea to both noninteracting and interacting Fermi systems and show it is possible to infer the fermionic energies at all temperatures, thus providing a practical and efficient approach to obtain thermodynamic properties of large fermion systems with numerical simulation. As an example, we present energies for up to 50 noninteracting fermions and up to 20 interacting fermions at all temperatures and show good agreement with the analytical result for noninteracting case.

One of the possible mechanisms causing significant emissions of methane into the atmosphere within the Arctic shelf may be the decomposition of gas hydrates. Their accumulations within the Arctic shelf formed during Ice Age almost simultaneously with the formation of permafrost, which contributed to the emergence of a zone of stable existence of gas hydrates. The subsequent flooding of the Arctic shelf led to the degradation of the permafrost and the violation of the conditions for the existence of hydrates. To assess the state of the stability zone, methods of mathematical numerical modeling are used. Standard seismic methods are widely used to localize gas hydrates, but monitoring their physical state requires the development of fundamentally new approaches based on solving multiparameter inverse seismic problems. In particular, the degree of attenuation of seismic energy is one of the objective parameters for assessing the consolidation of gas hydrates: the closer they are to the beginning of decomposition, the higher the attenuation, and hence the lower the quality factor. Thus, the methods of seismic monitoring of the state of gas hydrates in order to predict the possibility of developing dangerous scenarios should be based on solving a multi-parameter inverse seismic problem. This publication is devoted to the presentation of this approach.

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

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

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.

We point out an inconsistency in Newton's equations of celestial mechanics. A set of differential equations implied by Newton's equations are shown to be free of this inconsistency. We then investigate the integrals of motion associated with this relative difference system.

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.

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.

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.

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.

We present a new model formulation for a class of capacitated lot-sizing problem considering setup costs, product returns, and remanufacturing (CLSP-RM). We investigate a broad class of instances that fall into two groups, in the first group we can reformulate the problem with a relaxation and test whether the original problem is solvable. The relaxation gives near optimal solutions and the solution of this class does not give any difficulty to known solvers such as Cplex, Gurobi or Xpress. The second group of instances are of category NP and will be solved with a simple period-by-period simulation

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.

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.

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.

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.

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.

For each $t\in(-1,1)$, exact values of the least upper bounds $$ H(t)=\sup_{\E X=t,\,\E X^2=1} \frac{\E\abs{X}^3}{\E \abs{X-t}^3},\quad \sup_{\E X=t,\,\E X^2=1} \frac{L_1(X)}{L_1(X-t)} $$ are obtained, where $L_1(X)=\E|X|^3/(\E X^2)^{3/2}$ is the non-cental Lyapunov ratio. It is demonstrated that these values are attained only at two-point distributions. As a corollary, S.\,Shorgin's conjecture is proved that states that the exact value is $$ \sup\frac{L_1(X)}{L_1(X-\E X)}= \frac{\sqrt{17 + 7\sqrt7}}{4} = 1.4899\ldots, $$ where the supremum is taken over all non-degenerate distributions of the random variable $X$ with the finite third moment. Also, in terms of the central Lyapunov ratio $L_1(X-\E X)$, an analog of the Berry--Esseen inequality is proved for Poisson random sums of independent identically distributed random variables with the constant $$ 0.3031\cdot H\left(\frac{\E X}{\sqrt{\E X^2}}\right) \left(1-\frac{(\E X)^2}{\E X^2}\right)^{3/2} \le 0.3031\cdot \frac{\sqrt{17 + 7\sqrt7}}{4}<0.4517.$$ where $\Law(X)$ is the common distribution of the summands.

This paper aims at computing feasible control strategies and the corresponding feasible state trajectories to drive an autonomous rear-axle bicycle robot from a given initial state to a final state such that the total running cost is minimized. Pontryagin’s Minimum Principle is applied and derives the optimality conditions from which the feasible control functions, expressed as functions of state and costate variables, are substituted into the combined state-costate system to obtain a new free-control state-costate nonlinear system of ordinary differential equations. A computer program was written in Scilab to solve the combined state-costate system and obtain the feasible state functions, the feasible costate functions and the feasible control functions. Associated Computational Simulations were provided to show the effectiveness and the reliability of the approach.

We examine here characteristics of electromagnetic waves that propagate through an unbounded space filled with a homogeneous isotropic chiral medium. Resulting characters are compared to those of the electromagnetic waves propagating through an achiral free space. To this goal, we form energy conservation laws for key bilinear parameters in a chiral case. Due to a nonzero medium chirality, conservation laws turn out to contain extra terms that are linked to the spin-orbit coupling, which is absent for an achiral case. As an example, we take a plane wave for achiral case to evaluate those bilinear parameters. Resultantly, the conservation laws for a chiral case are found to reveal inconsistencies among several bilinear parameters that constitute the con-servation laws , thereby prompting us to establish partial remedies for formulating proper wave-propagation problems.

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

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

We investigate a family of nonlinear partial differential equations which are singularly perturbed in a complex parameter and singular in a complex time variable at the origin. These equations combine differential operators of Fuchsian type in time and space derivatives on horizontal strips in the complex plane with a nonlocal operator acting on the complex parameter known as the formal monodromy around 0. Their coefficients and forcing terms comprise polynomial and logarithmic type functions in time and are bounded holomorphic in space. A set of logarithmic type solutions are shaped by means of Laplace transforms relatively to time and parameter and Fourier integrals in space. Furthermore, a formal logarithmic type solution is modeled which represents the common asymptotic expansion of Gevrey type of the genuine solutions with respect to the complex parameter on bounded sectors at the origin.