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

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

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.

In an $m$-person symmetric game, all players are identical and indistinguishable. In this paper, we find that the payoff tensor of the player $k$ in an $m$-person symmetric game is $k$-mode symmetric, and the payoff tensors of two different individuals are the transpose of each other. Furthermore, we reformulate the $m$-person symmetric game as a tensor complementary problem and demonstrate that locating a symmetric Nash equilibrium is equivalent to finding a solution to the resulting tensor complementary problem. Finally, we use the hyperplane projection algorithm to solve the resulting tensor complementary problem, and we present some numerical results to find the symmetric Nash equilibrium.

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 addresses the difficulty of balancing real-time response and low power consumption in intelligent manhole cover application scenarios. It proposes a method to distinguish normal and abnormal events by segmenting the boundary where the acceleration of the intelligent manhole cover deviates from a set threshold and lasts for a certain period, based on the difference in vibration patterns of the intelligent manhole cover when a normal event and an abnormal event occur. This paper uses digital output motion sensor data autonomous data fusion to implement the pattern mentioned above recognition algorithm, which reduces the MCU computing and working time and the overall power consumption of the system while meeting the real-time response requirements. The test results demonstrate that the method has a high rate of anomaly recognition accuracy. The method ensures the system's real-time response capability, and the actual low power consumption test demonstrates that the device can operate continuously for 9.5 years. The low power consumption index exceeds the requirements of the existing national standard, thereby resolving the issue that it is challenging to balance intelligent manhole cover abnormality recognition and low power consumption.

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.

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.

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.

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.

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.

I show how the quantum paradoxes occurring when we adopt a standard realist framework (or a framework in which the collapse implies a physical change of the state of the system) vanish if we abandon the idea that a measurement is related (directly or indirectly) to a physical change of state. In Convivial Solipsism, similarly to Everett’s interpretation, there is no collapse of the wave function. But contrary to Everett’s interpretation, there is only one world. This allows also to get rid of any non-locality and to provide a solution to the Wigner’s friend problem and its more recent versions.

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.

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 .

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.

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.

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.

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.

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.

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.

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.

This paper is mainly based on a stricter premise of the twin paradox and the assumption of inertial frame, discusses the properties of time and space under the premise of complete symmetry, and draws an interesting conclusion: the simultaneity of different reference frames is possible realized, and the space is relatively independent. And based on this, the twin paradox, cosmic inflation, ultra-distance action of quantum entanglement, microscopic space motion of particles, measurement problems and other phenomena are tentatively explained from a new angle. This interpretation is exploratory and new. At the same time, the author also proposes an experimental way to test the relative independence of space.At the same time, this paper attempts to strictly prove that Einstein's definition of simultaneity and spatial absoluteness in special relativity may be problematic.

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.

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

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.

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.

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

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

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

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.

Starting from a very simple economic scenario, we build on it a game and then we introduce a general strategy able to reduce a regression problem to an equivalent binary classification problem. This reduction scheme (that we call adaptive reduction or also dynamic reduction) can be also used to derive a new boosting algorithm for regression problems named bOOst^d. The bOOst^d algorithm is very simple to implement, and it can use any learning algorithm with no priori assumptions. We present a conjecture for bOOst^d performances, which ensures a little error on training set. More important we can also provide a very good theoretical upper bound for the generalization error. We give a set of preliminary experimental results that seems to confirm our conjecture for bOOst^d performances on training set and the theoretical assumptions for the generalization error. We also provide a possible justification of why boosting often does not overfit. Finally, we leave some open problems and argue that in the future an adaptive single boosting (with an unique code) algorithm for binary, multi class and regression problems can be derived.

We consider partition functions, in the form of state sums, and associated probabilistic measures for aperiodic substrates described by model sets and their associated tiling spaces. We propose model set tiling spaces as microscopic models for small scales in the context of quantum gravity. Model sets possess special self-similarity properties that allow us to consider implications on large and observable scales from the underlying (non-ergodic) dynamics. In particular we consider the implication of the underlying aperiodic substrate for the well known problem of time in quantum gravity, and propose a correspondence between small and large scales, the so-called ergodic correspondence, that addresses the emergence of matter properties and spacetime structure. In the process we find a possible bound in the mass spectrum of fundamental particles.

This study reports results of focus groups with school nurses and teachers from elementary, middle, and high schools to explore their perceptions of child and adolescent oral health. Participants included 14 school nurses and 15 teachers (83% Female; 31% Hispanic, 21% White, 21% Asian, 14% African American, and 13% Others). Respondents were recruited from Los Angeles County schools and scheduled by school level for six one-hour focus groups, using Zoom. Audio recordings were transcribed, reviewed, and saved with anonymization of speaker identities. NVivo software was used to facilitate content analysis and identify key themes. The nurses’ rate of “Oral Health Education” comments statistically exceeded that of teachers, while teachers had higher rates for “Parental Involvement” and “Mutual Perception” “Need for Care” was perceived to be more prevalent in immigrants to the United States based on student behaviors and complaints. “Access to Care” was seen as primarily the nurse’s role. Strong relationships between community clinics and schools were viewed by some as integral to students achieving good oral health. The results suggest dimensions and questions important to item development for oral health surveys of children and parents to address screening, management, program assessment, and policy planning.

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.

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

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

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

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

The article is devoted to the preliminary concept of the Future Planetary Defense System (FPDS), emphasizing Astroballistics. This paper is intended to support international efforts to improve the planetary security of the Earth. The work covers three areas of knowledge: Astronautics, Astrodynamics, and Astroballistics. The most important part of the presented article is dynamic, contact combat modeling against small, deformable celestial bodies. For these purposes, the original, proprietary hydrocode of the Free Particle Method (HEFPM-G) with gravity was used. The main aim of combat is to redirect the Potentially Hazardous Objects (PHOs) to orbits safe for the Earth or destroy them. This concept's first task is to find, prepare and use dynamic three-dimensional models of celestial bodies' motion and spacecraft or human-crewed spaceships in the Solar System's relativistic frame. The second task is to prepare the FPDS' architecture and computer simulation space missions' initial concepts in the internal part of the solar system. The third and main task covers simulating, using hydrocodes, selected methods of fighting 100 m and 140 m diameter asteroids. The order of the article is as follows. The first part of the article presents an architecture and FPDS' modus operandi. Preliminary design and development of FPDS' space missions, including navigation, mission dynamics simulation, is prepared using an open-source space mission analysis and design tool. E.g., Asterank and Trajectory Browser or GMAT are presented in the second part. The third part of the article is devoted to computer hydrocodes (HEFPM-G) and the modeling and simulation of asteroid–asteroid collision, laser radiation effects on an asteroid, and FPDS spacecraft's warhead contact interaction on the small celestial body. The authors formulated the Main Planetary Defense Problem (MPDP) in this paper. The proposition of this problem solving has been realized by preparing its concepts, architecture, and modus operandi of the FPDS mission. Finally, a series of realistic simulations were made using hydrocode to deflect or destroy dangerous asteroids. The summary and conclusions can be found in the fourth part of the article.

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.

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 study revisits the Reynolds-averaged Navier--Stokes equations (RANS) and finds that the existing literature is erroneous regarding the primary unknowns and the number of independent unknowns in the RANS. The literature claims that the Reynolds stress tensor has six independent unknowns, but in fact the six unknowns can be reduced to three that are functions of the three velocity fluctuation components, because the Reynolds stress tensor is simply an integration of a second-order dyadic tensor of flow velocity fluctuations rather than a general symmetric tensor. This difficult situation is resolved by returning to the time of Reynolds in 1895 and revisiting Reynolds' averaging formulation of turbulence. The study of turbulence modeling could focus on the velocity fluctuations instead of on the Reynolds stress. An advantage of modeling the velocity fluctuations is, from both physical and experimental perspectives, that the velocity fluctuation components are observable whereas the Reynolds stress tensor is not.

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.

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.

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.

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.

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.

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

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

Nowadays, according to spectacular improvement in health care and biomedical level, a tremendous amount of data is recorded by hospitals. In addition, the most effective approach to reduce disease mortality is to diagnose it as soon as possible. As a result, data mining by applying machine learning in the field of diseases provides good opportunities to examine the hidden patterns of this collection. An exact forecast of the mortality after heart surgery will cause Successful medical treatment and fewer costs. This research wants to recommend a new stacking predictive model after utilizing the random forest feature importance method to foresee the mortality after heart surgery on a highly unbalanced dataset by using the most practical features. To solve the unbalanced data problem, a combination of the SVM-SMOTE over-sampling algorithm and the Edited-Nearest-Neighbor under-sampling algorithm is used. This research compares the introduced model with some other machine learning classifiers to ensure efficiency through shuffle hold-out and 10-fold cross-validation strategies. In order to validate the performance of the implemented machine learning methods in this research, both shuffle hold-out, and 10-fold cross-validation results indicated that our model had the highest efficiency compared to the other models. Furthermore, the Friedman statistical test is applied to survey the differences between models. The result demonstrates that the introduced stacking model reached the most accurate predicting performance after Logistic Regression.

Increasing the metacognitive abilities of chemistry students is an indisputable output of the teaching and learning process today. Collaborative problem based learning is a learning method that has been tested and proven to be applied, especially in Western countries in increasing the metacognitive abilities of students, but it is still very minimal applied in Asian countries, including Indonesia. Thus, this study was conducted to explore previous studies that examined collaborative problem-based learning in improving students' metacognitive abilities. The research design used in this study is a Systematic Literature Review with the requirements of the inclusion of articles on collaborative problem-based learning in improving the metacognitive abilities of chemistry students, accredited national and international publications between 2010 and 2020, full text, journal articles, and open access. The results of the exploration that were carried out found 102 articles, then the title and abstract were read into 20 articles, and 4 articles were read in full, which fulfilled all the stipulated inclusion requirements. The results of the systematic literature review conducted in this study provide empirical evidence of literacy that problem based learning improves the metacognitive abilities of chemistry students. However, most of research conducted still uses various instruments, which are not standardized and validated.

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

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.

Studying the two famous old problems that why the moon can move around the Sun and why the orbit of the Moon around the Earth cannot be broken off by the Sun under the condition that calculating with F=GMm/R^2, the attractive force of the Sun on the Moon is almost 2.2 times that of the Earth. We found that the planet and moon are unified as one single gravitational unit which results in that the Sun cannot have the force of F=GMm/R^2 on the moon. The moon is moved by the gravitational unit orbiting around the Sun. It could indicate that the gravitational field of the moon is limited inside the unit and the gravitational fields of both the planet and moon is unified as one single field interacting with the Sun. The findings are further clarified by reestablishing Newton’s repulsive gravity.

The option of decarbonizing urban freight transport using Battery Electric Vehicle (BEV) seems promising.However, there is currently a strong debate whether Fuel Cell Electric Vehicle (FCEV) might be the bettersolution. The question arises as to how a fleet of FCEV influences the operating cost, the Greenhouse Gas(GHG) emissions and primary energy demand in comparison to BEVs and to Internal Combustion EngineVehicle (ICEV). To investigate this, we simulate the urban food retailing as a representative share of urbanfreight transport using a multi-agent transport simulation software. Synthetic routes as well as fleet size andcomposition are determined by solving a Vehicle Routing Problem (VRP). We compute the operating costsusing a total cost of ownership (Total Cost of Ownership (TCO)) analysis and the use phase emissions as wellas primary energy demand using the Well To Wheel (WTW) approach. While a change to BEV results in 17 -23% higher costs compared to ICEV, using FCEVs leads to 22 - 57% higher costs. Assuming today’s electricitymix, we show a GHG emission reduction of 25% compared to the ICEV base case when using BEV. Currenthydrogen production leads to a GHG reduction of 33% when using FCEV which however cannot be scaled tolarger fleets. Using current electricity in electrolysis will increase GHG emission by 60% compared to the basecase. Assuming 100% renewable electricity for charging and hydrogen production, the reduction from FCEVsrises to 73% and from BEV to 92%. The primary energy requirement for BEV is in all cases lower and forhigher compared to the base case. We conclude that while FCEV have a slightly higher GHG savings potentialwith current hydrogen, BEV are the favored technology for urban freight transport from an economic andecological point of view, considering the increasing shares of renewable energies in the grid mix.

It is claimed that classical mechanics (CM) in terms of its equivalent Koopman-von Neumann formulation (KvN) is indeed a ’real’ quantum theory since the formalism of quantum mechanics (FQM) does not, nor need it, exclude it as a such. This claim is made manifest by suggesting a common structure of which both KvN and ordinary quantum mechanics (OQM) correspond to unitary representations of, although unitarily inequivalent such. It is shown that OQM is obtained by enforcing the extra physical condition of quantized energy levels, which by itself does not constitute the ’quantum mystery’. It is furthermore shown that KvN in a physically realizable sense contain the hallmark quantum behavior of quantum interference. It is hence concluded that both CM and OQM are subjected to the same foundational issues. As the central part of both KvN and OQM is the introduction of probabilities via FQM it is suggested that the foundational issues regarding FQM are less about FQM itself and more about the concept of probability.

This article investigates the prospect of implementing multidisciplinary and multicultural student teamwork (MMT) involving Case-based Learning (CBL) and Problem-based Learning (PBL) as a sustainable teaching practice. Based on a mixed methods approach, which includes direct observation (both physical and virtual), questionnaire distribution and focus-group interviews the study reveals that MMT through CBL and PBL can both facilitate and hinder sustainable learning. Our findings show that while MMT enhances knowledge sharing, it also poses a wide range of challenges, raising questions about its social significance as a sustainable teaching practice. The study suggests the implementation of certain mechanisms, such as ‘Teamwork Training’ and ‘Pedagogical Mentors’, aiming to strengthen the sustainable orientation of MMT through CBL and PBL.

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

The mind-body problem is the central issue in both of philosophy and life science for several centuries. To date, there is still no conclusive theory to interpret the relation between the mind and the body, even just the mind alone. Here, we promote a novel model, a derived mathematic equation called the entropic system equation, to describe the innate characters of the mind and the mechanism of the mind-body coupling phenomenon. As the semi-open thermodynamic systems far from equilibrium, the living organisms could be logically considered as an entropic system. In the living organisms or the entropic systems, there also are three essential existing elements including mass, energy and information, in which the mind and the body are hypothetically coupled by free energy and entropic force.

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

The textbook analysis of vacuum energy density (VED) in flat spacetime follows from Pauli’s lectures of 1951, in which quantum vacuum is modeled as a reservoir of free harmonic oscillators. In his lectures, Pauli shows that deriving a nearly vanishing VED is contingent upon fulfilling three corollary conditions called polynomial-in-mass-constraints. The goal of this work is to evaluate Pauli’s constraints against the Standard Model parameters and the Higgs mechanism of spontaneous symmetry breaking.

Mental health and emotional responses to the effects of COVID-19 lockdown in sub-Saharan Africa (SSA) are of serious public health concern and may negatively affect the mental health status of people. Hence, this study assessed the prevalence of mental health symptoms as well as emotional reactions among sub-Saharan Africans (SSAs) and associated factors among SSAs during the COVID-19 lockdown period. This was a web-based cross-sectional, a study on mental health and emotional features from 2005 respondents in seven SSA countries. This study was conducted between April 27 and May 17, 2020 corresponding to the lockdown period in most SSA countries. Respondents aged 18 years and above and the self-reported symptoms were feeling anxious, being worried, angry, bored and frustrated. These were the main outcomes and were treated as dichotomous variables. Univariate and multivariate logistic regression analyses were used to identify the factors associated with these symptoms. We found that over half (52.2%) of the participants reported any of the mental health symptoms in SSA and the prevalence of feeling bored was 70.5% followed by feeling anxious (59.1%), being worried (57.5%), frustrated (51.5%) and angry (22.3%) during the COVID-19 pandemic. Multivariate analysis revealed that males, those aged >28 years, Central and Southern Africans, those who were not married, the unemployed, those living with more than six persons in a household, had higher odds of mental health and emotional symptoms. Similarly, people who perceived low risk of contracting the infection, and those who thought the pandemic would not continue after the lockdown had higher odds of mental health and emotional symptoms. Health care workers had lower odds for feeling angry than non-healthcare workers. During COVID-19 lockdown periods in SSA, about one in two participants reported mental health and emotional symptoms. Public health measures can be effectively used to identify target groups for prevention and treatment of mental health and emotional symptoms. Such interventions should be an integral component of SSA governments’ response and recovery strategies of any future pandemic.

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

We refute a recently proposed thought experiment namely the Dead-Alive Physicist (DAP) whose authors claim it to be the falsification of the von Neumann interpretation in Quantum Mechanics. We discover major flaws in their model and our justification serves the purpose of disregarding further claims and assertions made in the paper at various stages. Thus, in a yet another situation, it is proven that the formalism advanced by von Neumann is non-trivial and non-falsifiable.

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

This paper discusses a possible approach to validate the Goldbach conjucture which states that all even numbers can be expressed as a summation of two prime numbers. For this purpose the paper begins with the concept of successive-addition-of-digits-of-an-integer-number (SADN) and its properties in terms of basic algebraic functions like addition, multiplication and subtraction. This concept of SADN forms the basis for classifying all odd numbers into 3 series- the S1, S3 and S5 series- which comprise of odd numbers of SADN(7,4,1), SADN(3,9,6) and SADN(5,2,8) respectively and follow a cyclical order. The S1 and S5 series are of interest in the analysis since they include both prime and composite numbers while the S3 series exclusively consists of composite numbers. Furthermore, the multiplicative property of SADN shows why composites on the S1 series are derived as products of intra-series elements of the S1 and S5 series while composites on the S5 series are derived as products of inter-series elements of the S1 and S5 series. The role of SADN is also important in determining the relevant series for identifying the combination of primes for a given even number since it shows why such combinations for even numbers of SADN(1,4,7) will be found on the S5 series while those for even numbers of SADN(2,5,8) will lie on the S1 series and both the series have a role to play in identifying the prime number combinations for even numbers with SADN(3,6,9). Thereafter, the analysis moves to calculating the total number of acceptable combinations for a given even number that would include combinations in the nature of two composites (c1+c2), one prime and one composite (p+c) and two primes (p1+p2). A cyclical pattern followed by even numbers is also discussed in this context. Identifying the c1+c2 and p+c combinations and thereafter subtracting them from the total number of combinations will yield the number of p1+p2 combinations. For this purpose the paper discusses a general method to calculate the number of composites on the S1 and S5 series for a given number and provides a detailed method for deriving the number of c1+c2 combinations. The paper presents this analysis as a proof to validate the Goldbach conjecture. Since even numbers can be of SADN 1 to 9 and the relation between nTc (i.e. total number of acceptable combinations) and nc(i.e. number of composites) for all even numbers can either be of nTc > nc or nTc ≤ nc, the paper shows that the Goldbach conjecture is true for both these categories of even numbers. In this manner this analysis is totally inclusive of all even numbers in general terms and since the analysis of every even number is common in methodology but unique in compilation, apart from being totally inclusive, it is also mutually exclusive in nature. This proves that the Goldbach conjecture which states that all even numbers can be expressed as atleast one combination of two prime numbers holds true for all even numbers, across all categories possible. Additionally this approach proves that the identification of p1+p2 combinations which would validate the Goldbach conjecture lies in the identification of c1+c2 combinations.

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.

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

This paper presents a new methodology to derive and analyze strategies for a fully decarbonized urban transport system which combines conceptual vehicle design, a large-scale agent-based transport simulation, operational cost analysis, and life cycle assessment for a complete urban region. The holistic approach evaluates technical feasibility, system cost, energy demand, transportation time and sustainability-related impacts of various decarbonization strategies. In contrast to previous work, the consequences of a transformation to fully decarbonized transport system scenarios are quantified across all traffic segments, considering procurement, operation and disposal. The methodology can be applied to arbitrary regions and transport systems. Here, the metropolitan region of Berlin is chosen as a demonstration case. First results are shown for a complete conversion of all traffic segments from conventional propulsion technology to battery electric vehicles. The transition of private individual traffic is analyzed regarding technical feasibility, energy demand and environmental impact. Commercial goods, municipal traffic and public transport are analyzed with respect to system cost and environmental impacts. We can show a feasible transition path for all cases with substantially lower greenhouse gas emissions. Based on current technologies and today’s cost structures our simulation shows a moderate increase in total systems cost of 13-18%.

Considering the significant advancements in autonomous vehicle technology, research in this field is of interest to researchers. To automatic parking, controlling steer angle, gas hatch, and brakes need to be learned. Due to the increase in the number of cars and road traffic, car parking space has decreased. Its main reason is information error. Because the driver does not receive the necessary information or receives it too late, he cannot take appropriate action against it. This paper uses two phases: the first phase, for goal coordination, was used genetic algorithms and the Cuckoo search algorithm was used to increase driver information from the surroundings. Using the Cuckoo search algorithm and considering the limitations, it increases the driver’s level of information from the environment. Also, by exchanging information through the application, it enables the information to reach the driver much more quickly and the driver reacts appropriately at the right time. The suggested protocol is called the MODM-based solution. Here, the technique is assessed through extensive simulations performed in the NS-3 environment. Based on the simulation outcomes, it is indicated that the parking system performance metrics are enhanced based on the detection rate, false-negative rate, and false-positive rate.

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

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.

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.

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

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

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.

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.

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.

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

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.

For more than one hundred years, scientists dispute the correct interpretation of Lorentz transformations within the framework of the special theory of relativity of Albert Einstein. On the one hand, the changes in length, time and mass with increasing velocity are interpreted as apparent due to the observer dependence within special relativity. On the other hand, real changes are described corresponding to the experimental evidence of mass increase in particle accelerators or of clock delay. This ambiguity is accompanied by an ongoing controversy about valid Lorentz-transformed thermodynamic quantities such as entropy, pressure and temperature. In this paper is shown that the interpretation problem of the Lorentz transformations is genuinely anchored within the postulates of special relativity and can be solved on the basis of the thermodynamic approach of matter-energy equivalence, i.e. an energetic distinction between matter and mass. It is suggested that the velocity-dependent changes in state quantities are real in each case, in full agreement with the experimental evidence.

The etiopathogenesis of autism spectrum disorder (ASD) remains largely unclear. Among other biological hypotheses, researchers have evidenced an imbalance in the endocannabinoid (eCB) system, which regulates some functions typically impaired in ASD, such as emotional responses and social interaction. Also, cannabidiol (CBD), the non-intoxicating component of Cannabis sativa, has been recently approved for treatment-resistant epilepsy. Seizures represent frequent medical comorbidities of ASD and could be responsible for the onset or worsening of behavioral problems. Thus, it has been hypothesized that cannabinoids could be useful in improving some ASD symptoms. Our systematic review was conducted according to the PRISMA guidelines and aimed to summarize the literature regarding the use of cannabinoids in ASD. After searching in Web of Knowledge^TM, PsycINFO, and Embase, we included ten studies (eight papers and two abstracts). Four ongoing trials were retrieved in ClinicalTrials.gov. Findings are promising, as cannabinoids appeared to improve problem behaviors, sleep, hyperactivity, and communication deficits, with limited cardiac and metabolic side effects. Interestingly, they generally allowed to reduce the number of prescribed medications and decreased the frequency of seizures in epileptic patients. Mechanisms of action could be linked to the excitatory/inhibitory imbalance found in people with ASD. However, further trials need to be implemented with better characterization and homogenization of samples, and well-defined outcomes.

The use of wind energy has been developing fast over the last years. The global cumulative wind power capacity increased by 10.5% in 2019, most of which comes from onshore wind farms. One of the consequences of this continuous increase is the use of land for onshore wind farms. There are already cases worldwide where lack of well-established plans and strategies have caused delays in projects. The need for efficiently using land for wind farms will be mandatory in the short term. In this work, we present a numerical analysis to evaluate wind farm land-use. By defining the ratio between mechanical output power over an area as a parameter called land-use ratio, this work focused on comparing several cases of aligned and staggered layouts. Mechanical output power was estimated using a validated code based on Blade Element Momentum code, and the wake velocities and wake interaction effects were estimated using a validated wind turbine CFD model. In terms of output power, staggered designs are more efficient than aligned designs. However, the results showed that even though staggered designs produced higher output power, aligned farms with tight lateral spacing could be as efficient as staggered ones in terms of land-use but using fewer turbines. In summary, tightly aligned designs should be a tendency in the future towards efficient use of land in wind farms.

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.

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.

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.

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.

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

The advance of the medical field in the 21st century has influenced the development of many innovations, including in medical education. PBL (problem-based learning) is one of the pedagogical approaches that has been studying and implementing worldwide to attract medical students’ attention with their learning style and learning environment. China is the most significant “receiver” country of foreign students in Asia, and clinical medicine is one of the most chosen majors for undergraduate. In China, PBL has been implementing in some schools, but mostly with the local students and only a few implementations to the international students. International medical students in China faced a variety of challenges during their studies. In this review paper, we give the solution to adapt to the challenges by focusing on the implementation the integrated organ/system curriculum/syllabus with the PBL method to the school system with the support of the school stakeholders and students’ role.

A lot of previous research have proposed various frameworks and algorithms to optimize routes to reduce the total transportation cost, which accounts for over 70% of overall logistics cost. However, it is very hard to find the cases applied the mathematical models or algorithms to the practical business environment cases, especially daily operating logistics services like convenient stores. Most of previous research have considered the developing an optimal algorithm which can solve the mathematical problem within the practical time while satisfying all constraints such as the capacity of delivery and pick-up, and time windows. For the daily pick-up and delivery service like supporting several convenient stores, it is required to consider the unit transporting container as well as the demand, capacity of trucks, traveling distance and traffic congestion. Especially, the reusable transporting container, trays, should be regarded as the important asset of logistics center. However, if the mathematical model focuses on only satisfying constraints related delivery and not considering the cost of trays, it is often to leave the empty trays on the pick-up points when there is not enough space in the track. In this research, it has been proposed to build the mathematical model for optimizing pick-up and delivery plans by extending the general vehicle routing problem of simultaneous delivery and pickup with time windows while considering left-over cost. With the numerical experiments, it has been proved that the proposed model may reduce the total delivery cost. It may be possible to apply the proposed approach to the various logistics business which uses the reusable transporting container like shipping containers, refrigerating containers, trays, and pallets.

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

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.

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.

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.

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