The adaptive identification method developed to evaluate the parameters of the Bouc-Wen hysteresis (BWH). The adaptive approach based on the use of adaptive observers. We synthesize adaptive identification algorithms using the second Lyapunov method. The boundedness of adaptive system processes shown in coordinate and parametric spaces. We prove exponential dissipativity of processes in an adaptive system. Estimating method proposed for signaling uncertainty in the system.

This article develops a duality principle and a related convex dual formulation suitable for a large class of models in physics and engineering. The results are based on standard tools of functional analysis, calculus of variations and duality theory. In particular, we develop applications to a model in non-linear elasticity.

The system identification problem with multiple nonlinearities is relevant. Its decision depends on many factors. These include: feedbacks, the method of connecting nonlinear links, signal properties. They affect the identifiability of the system parameters. We introduced a condition for the excitation constancy for state variables, which considers the S-identifiability of the system. We propose system decomposition by measuring input to identify parameters. Each subsystem has an implicit identification representation. It guarantees obtaining estimates of subsystem parameters based on experimental data. The trajectories boundedness of adaptive system proved in parametric and coordinate spaces. Conditions guaranteeing exponential stability of the system obtained. Systems of self-oscillation generation and nonlinear correction of a nonlinear system consider. Conditions for the trajectories boundedness of the adaptive system obtained for these cases. The influence of nonlinearity and feedback on the system performance estimated.

(1) Background: As Patient-reported outcome measures face challenges with low response rate on surveys, different incentive mechanism have been proposed to achieve a higher response rate. However, it seems that monetary incentives are the only mechanism with proven effect. Nevertheless, it is less likely to be used than other mechanisms due to the monetary cost. (2) Methods: In this research work, a cryptographic scheme for rewarding patients with cryptographic tokens is developed and implemented on the Ethereum test network. (3) Results: The model is able to distribute decentralised tokens to patients who complete the PROMs in a fair, private, decentralised approach. The token can be further used by patients to exchange more healthcare services, encouraging more patients to participate in PROMs. At the same time, an IER detection method is built to improve the quality of PROMs, avoiding the healthcare provider paying for meaningless PROMs from patients who barely participate for incentives. (4) Conclusions: This work provides an privacy-preserving incentive model to increase the response rate for PROMs surveys. Our model prevents patients providing invalid responses to gain rewards.

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 .

In this research, new setting is introduced for new SuperHyperNotions, namely, SuperHyperDefensive SuperHyperAlliances and Neutrosophic SuperHyperDefensive SuperHyperAlliances. Two different types of SuperHyperDefinitions are debut for them but the research goes further and the SuperHyperNotion, SuperHyperUniform, and SuperHyperClass based on that are well-defined and well-reviewed. The literature review is implemented in the whole of this research. For shining the elegancy and the significancy of this research, the comparison between this SuperHyperNotion with other SuperHyperNotions and fundamental SuperHyperNumbers are featured. The definitions are followed by the examples and the instances thus the clarifications are driven with different tools. The applications are figured out to make sense about the theoretical aspect of this ongoing research. The “Cancer’s Recognitions” are the under research to figure out the challenges make sense about ongoing and upcoming research. The special case is up. The cells are viewed in the deemed ways. There are different types of them. Some of them are individuals and some of them are well-modeled by the group of cells. These types are all officially called “SuperHyperVertex” but the relations amid them all officially called “SuperHyperEdge”. The frameworks “SuperHyperGraph” and “neutrosophic SuperHyperGraph” are chosen and elected to research about “Cancer’s Recognitions”. Thus these complex and dense SuperHyperModels open up some avenues to research on theoretical segments and “Cancer’s Recognitions”. Some avenues are posed to pursue this research. It’s also officially collected in the form of some questions and some problems. Assume a SuperHyperGraph. An “SuperHyperAlliance” is a minimal SuperHyperSet of SuperHyperVertices with minimum cardinality such that either of the following expressions hold for the cardinalities of SuperHyperNeighbors of s∈S:,|S∩N(s)|>|S∩(V \N(s))|,and|S∩N(s)|<|S∩(V \N(s))|.Thefirst Expression, holds if S is SuperHyperOffensive. And the second Expression, holds if S is “SuperHyperDefensive”. It’s useful to define “neutrosophic” version of SuperHyperDefensive SuperHyperAlliances. Since there’s more ways to get type-results to make SuperHyperDefensive SuperHyperAlliances more understandable. For the sake of having neutrosophic SuperHyperDefensive SuperHyperAlliances, there’s a need to “redefine” the notion of “SuperHyperDefensive SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a SuperHyperAlliance. It’s redefined neutrosophic SuperHyperAlliance if the mentioned Table holds, concerning, “The Values of Vertices, SuperVertices, Edges, HyperEdges, and SuperHyperEdges Belong to The Neutrosophic SuperHyperGraph” with the key points, “The Values of The Vertices & The Number of Position in Alphabet”, “The Values of The SuperVertices&The Minimum Values of Its Vertices”, “The Values of The Edges&The Minimum Values of Its Vertices”, “The Values of The HyperEdges&The Minimum Values of Its Vertices”, “The Values of The SuperHyperEdges&The Minimum Values of Its Endpoints”. To get structural examples and instances, I’m going to introduce the next SuperHyperClass of SuperHyperGraph based on SuperHyperDefensive SuperHyperAlliances. It’s the main. It’ll be disciplinary to have the foundation of previous definition in the kind of SuperHyperClass. If there’s a need to have all SuperHyperConnectivities until the SuperHyperDefensive SuperHyperAlliances, then it’s officially called “SuperHyperDefensive SuperHyperAlliances” but otherwise, it isn’t SuperHyperDefensive SuperHyperAlliances. There are some instances about the clarifications for the main definition titled “SuperHyperDefensive SuperHyperAlliances”. These two examples get more scrutiny and discernment since there are characterized in the disciplinary ways of the SuperHyperClass based on SuperHyperDefensive SuperHyperAlliances. For the sake of having neutrosophic SuperHyperDefensive SuperHyperAlliances, there’s a need to “redefine” the notion of “neutrosophic SuperHyperDefensive SuperHyperAlliances” and “neutrosophic SuperHyperDefensive SuperHyperAlliances”. The SuperHyperVertices and the SuperHyperEdges are assigned by the labels from the letters of the alphabets. In this procedure, there’s the usage of the position of labels to assign to the values. Assume a neutrosophic SuperHyperGraph. It’s redefined “neutrosophic SuperHyperGraph” if the intended Table holds. And SuperHyperDefensive SuperHyperAlliances are redefined “neutrosophic SuperHyperDefensive SuperHyperAlliances” if the intended Table holds. It’s useful to define “neutrosophic” version of SuperHyperClasses. Since there’s more ways to get neutrosophic type-results to make neutrosophic SuperHyperDefensive SuperHyperAlliances more understandable. Assume a neutrosophic SuperHyperGraph. There are some neutrosophic SuperHyperClasses if the intended Table holds. Thus SuperHyperPath, SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultiPartite, and SuperHyperWheel, are “neutrosophic SuperHyperPath”, “neutrosophic SuperHyperCycle”, “neutrosophic SuperHyperStar”, “neutrosophic SuperHyperBipartite”, “neutrosophic SuperHyperMultiPartite”, and “neutrosophic SuperHyperWheel” if the intended Table holds. A SuperHyperGraph has “neutrosophic SuperHyperDefensive SuperHyperAlliances” where it’s the strongest [the maximum neutrosophic value from all SuperHyperDefensive SuperHyperAlliances amid the maximum value amid all SuperHyperVertices from a SuperHyperDefensive SuperHyperAlliances.] SuperHyperDefensive SuperHyperAlliances. A graph is SuperHyperUniform if it’s SuperHyperGraph and the number of elements of SuperHyperEdges are the same. Assume a neutrosophic SuperHyperGraph. There are some SuperHyperClasses as follows. It’s SuperHyperPath if it’s only one SuperVertex as intersection amid two given SuperHyperEdges with two exceptions; it’s SuperHyperCycle if it’s only one SuperVertex as intersection amid two given SuperHyperEdges; it’s SuperHyperStar it’s only one SuperVertex as intersection amid all SuperHyperEdges; it’s SuperHyperBipartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming two separate sets, has no SuperHyperEdge in common; it’s SuperHyperMultiPartite it’s only one SuperVertex as intersection amid two given SuperHyperEdges and these SuperVertices, forming multi separate sets, has no SuperHyperEdge in common; it’s SuperHyperWheel if it’s only one SuperVertex as intersection amid two given SuperHyperEdges and one SuperVertex has one SuperHyperEdge with any common SuperVertex. The SuperHyperModel proposes the specific designs and the specific architectures. The SuperHyperModel is officially called “SuperHyperGraph” and “Neutrosophic SuperHyperGraph”. In this SuperHyperModel, The “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperVertices” and the common and intended properties between “specific” cells and “specific group” of cells are SuperHyperModeled as “SuperHyperEdges”. Sometimes, it’s useful to have some degrees of determinacy, indeterminacy, and neutrality to have more precise SuperHyperModel which in this case the SuperHyperModel is called “neutrosophic”. In the future research, the foundation will be based on the “Cancer’s Recognitions” and the results and the definitions will be introduced in redeemed ways. The recognition of the cancer in the long-term function. The specific region has been assigned by the model [it’s called SuperHyperGraph] and the long cycle of the move from the cancer is identified by this research. Sometimes the move of the cancer hasn’t be easily identified since there are some determinacy, indeterminacy and neutrality about the moves and the effects of the cancer on that region; this event leads us to choose another model [it’s said to be neutrosophic SuperHyperGraph] to have convenient perception on what’s happened and what’s done. There are some specific models, which are well-known and they’ve got the names, and some SuperHyperGeneral SuperHyperModels. The moves and the traces of the cancer on the complex tracks and between complicated groups of cells could be fantasized by a neutrosophic SuperHyperPath(-/SuperHyperCycle, SuperHyperStar, SuperHyperBipartite, SuperHyperMultipartite, SuperHyperWheel). The aim is to find either the longest SuperHyperDefensive SuperHyperAlliances or the strongest SuperHyperDefensive SuperHyperAlliances in those neutrosophic SuperHyperModels. For the longest SuperHyperDefensive SuperHyperAlliances, called SuperHyperDefensive SuperHyperAlliances, and the strongest SuperHyperCycle, called neutrosophic SuperHyperDefensive SuperHyperAlliances, some general results are introduced. Beyond that in SuperHyperStar, all possible SuperHyperPaths have only two SuperHyperEdges but it’s not enough since it’s essential to have at least three SuperHyperEdges to form any style of a SuperHyperCycle. There isn’t any formation of any SuperHyperCycle but literarily, it’s the deformation of any SuperHyperCycle. It, literarily, deforms and it doesn’t form. A basic familiarity with SuperHyperGraph theory and neutrosophic SuperHyperGraph theory are proposed.

Magnetic Nanoparticles (MNPs) is a promising technique to cure brain diseases. On the one hand, by serving as drug carriers, they can bypass the blood-brain barrier and deliver drug molecules to the brain parenchyma; on the other hand, their transport trajectory can be manipulated by applying an external magnetic field. However, due to the complex microstructure of brain tissues, e.g. the anisotropy of white matter (WM), how to achieve desired drug distribution patterns, e.g. uniform distribution, by tuning the drug delivery system is largely unknown. Here, in this study, by adopting a mathematical model capable of capturing the diffusion trajectories of MNPs in the microstructures, we systematically investigated the effects of key parameters in the MNPs delivery system on the equivalent diffusion coefficient of MNPs in the microenvironment of brain WM. The results show that uniform distribution of MNPs in anisotropic tissues can be achieved by adjusting the particle size and magnetic field. We have not only obtained a deeper understanding on how to optimise the MNPs delivery system, it can also be anticipated that an improved mathematical model could even help to achieve complex drug distribution patterns in the complicated brain environment by designing an appropriate combination of the key parameters.

: In this article, the authors propose an algorithmic approach to building a model of the dynamics of economic and, in particular, innovation processes. The approach under consideration is based on a complex algorithm that includes (1) decomposition of the time series into components using singular spectrum analysis; (2) recognition of the optimal component model based on fuzzy rules, and (3) creation of statistical models of individual components with their combination. It is shown that this approach corresponds to the high uncertainty characteristic of the tasks of the dynamics of innovation processes. The proposed algorithm makes it possible to create effective models that can be used both for analysis and for predicting the future states of the processes under study. The advantage of this algorithm is the possibility to expand the base of rules and components used for modeling. This is an important condition for improving the algorithm and its applicability for solving a wide range of problems.

Human behaviour was tipped as the mainstay in the control of further SARS-CoV-2 (COVID-19) spread especially after the lifting of restrictions by many countries. Countries in which restrictions were lifted soon after the first wave, had subsequent waves of the COVID-19 infections and it remains to be seen whether there will be more waves. In this paper, we formulate a deterministic model for COVID-19 incorporating dynamic non-pharmaceutical interventions, dubbed social dynamics. The model steady states are determined and their stability analysed. Numerical simulations are carried out to determine the pack of various parameters that influence the social dynamics. In South Africa, the first wave was the only wave in which the only interventions rested solely on human behavior. The model is thus fitted to COVID-19 data on the first wave in South Africa. The results presented in this paper have implications on the trajectory of the pandemic in the presence of changing social processes.

A proxy war, between a coalition of countries, BLUE and a country, RED, is considered. RED wants to increase the size of the RED territory. BLUE wants to involve more regions in trade and other types of cooperation. GREEN is a small and independent nation that wants to become a member of BLUE. RED attacks GREEN and tries to invade. BLUE decides to give optimal arms support to GREEN. This support can help GREEN in the war against RED and simultaneously reduce the military power of RED, which is valuable to BLUE, also outside this proxy war, since RED may confront BLUE also in other regions. The optimal control problem of dynamic arms support, from the BLUE perspective, is defined in general form. The objective function is a weighted sum of the present value of the free GREEN territory and the present value to BLUE of the net loss of military resources in the RED army. The net loss of RED at a particular point in time is a function of the location of the front line and the size of the mobile GREEN forces behind the RED line. First, it is assumed that the expected net loss is proportional to the force ratio behind the red front line. It is proved that the net loss function is a strictly concave quadratic function of x, the location of the front line. It is also proved that the unique maximum of the net loss function occurs at the same front location, also if the net loss function is proportional to the strength ratio behind the RED lines, raised to any strictly positive exponent. From the BLUE perspective, there is an optimal position of the front. This position is a function of the weights in the objective function and all other parameters. Optimal control theory is used to determine the optimal dynamic BLUE strategy, conditional on a RED strategy, which is observed by BLUE military intelligence. The optimal arms support strategy for BLUE is to initially send a large volume of arms support to GREEN, to rapidly move the front to the optimal position. Then, the support should be almost constant during most of the war, keeping the war front location stationary. In the final part of the conflict, when RED will have almost no military resources left and tries to retire from the GREEN territory, BLUE should strongly increase the arms support and make sure that GREEN rapidly can regain the complete territory and end the war

: Seasonal influenza (a.k.a flu) is responsible for considerable morbidity and mortality across the globe. The three recognized pathogens that cause epidemics during the winter season are influenza A, B and C. The influenza virus is particularly dangerous due to its mutability. Vaccines are an effective tool in preventing seasonal influenza, and their formulas are updated yearly according to WHO recommendations. However, in order to facilitate decision-making in the planning of the intervention, policymakers need information on the projected costs and quantities related to introducing the influenza vaccine, in order to help governments obtain an optimal allocation of the vaccine each year. In this paper, an approach based on a Controlled Elitism Non-Dominated Sorting Genetic Algorithm (CENSGA) model is introduced to optimize the allocation of influenza vaccination. A bi-objective model is formulated to control the infection volume, and reduce the unit cost of the vaccination campaign. An SIR (Susceptible–Infected–Recovered) model is employed for representing a potential epidemic. The model constraints are based on the epidemiological model, time management, and vaccine quantity. A two-phase optimization process is proposed: guardian control followed by contingent controls. The proposed approach is an evolutionary metaheuristic multi-objective optimization algorithm with a local search procedure based on a hash table. Moreover, in order to optimize the scheduling of a set of policies over a predetermined time to form a complete campaign, an extended CENSGA is introduced with a variable-length chromosome (VLC) along with mutation and crossover operations. To validate the applicability of the proposed CENSGA, it is compared with the classical Non-Dominated Sorting Genetic Algorithm (NSGA-II). The results are analyzed using graphical and statistical comparisons in terms of cardinality, convergence, distribution and spread quality metrics, illustrating that the proposed CENSGA is effective and useful for determining the optimal vaccination allocation campaigns.

In this paper mathematical analysis of the HIV/AIDS deterministic model exposed in [Espitia, C. et. al. Mathematical Model of HIV/AIDS Considering Sexual Preferences Under Antiretroviral Therapy, a Case Study in San Juan de Pasto, Colombia, Journal of Computational Biology 29 (2022) 483–493] is made. The objective is to gain insight into the qualitative dynamics of the model determining the conditions for the persistence or effective control of the disease in the community through the study of basic properties such as positiveness and boundedness, calculus of basic reproduction number, stationary points such as disease free equilibrium (DFE), boundary equilibrium (BE) and endemic equilibrium (EE) are calculated, local stability (LAS) of disease free equilibrium. It research allow to conclude that the best way to reduce contagion and consequently to reach a DFE is thought to be the reduction of homosexual partners rate as they are the most affected population by the virus, and are therefore the most likely to become infected and to spread the infection. Increasing the departure rate of infected individuals, leads to a decrease in untreated infected heterosexual men and untreated infected women.

The conceptual and theoretical backbones of symmetry/asymmetry detections or similarity/dissimilarity, and identity/unidentity study are automorphism or isomorphism respectively. However, the development of equations and methods for symmetry/asymmetry detections, similarity/dissimilarity, and identity/unidentity measures deviates from these backbones. In this article, an equation was proposed for symmetry/asymmetry detections, similarity/dissimilarity, and identity/unidentity measures, and proved that its isoreflective pairs-points are functionally bijective and inverse. The proposal, called Kabirian-based optinalysis, is based on the conceptual and theoretical frameworks of automorphism and isomorphism. The Kabirian-based optinalysis is also proven and characterized as invariant (robust) under translation (i.e., scaling and location shift), and rotation or reflection. Computing codes were written in python language for Kabirian-based optinalysis to serve as working codes for application and verification.

After the great success of Mobile wallet, the Internet of Things (IoT) leaves the door wide open for consumers to use their connected devices to access their bank accounts and perform routine banking activities from anywhere, anytime and with any device. However, consumers need to feel safe when interacting with IoT-based payment systems, and their personal information should be protected as much as possible. Unlike as usually done in the literature, in this paper, we introduce two lightweight and secure IoT-based payment protocols based on an identity-based signature scheme. We adopt a server-aided verification technique to construct the first scheme. This technique allows to outsource the heavy computation overhead on the sensor node to a cloud server while maintaining the user's privacy. The second scheme is built upon a pairing-free ECC-based security protocol to avoid the heavy computational complexity of bilinear pairing operations. The security reduction results of both schemes are held in the Random Oracle Model (ROM) under the discrete logarithm and computational Diffie-Hellman assumptions. Finally, we experimentally compare the proposed schemes against each other and against the original scheme on the most commonly used IoT devices: a smartphone, a smartwatch and the embedded device Raspberry Pi. Compared with existing schemes, our proposed schemes achieve significant efficiency in the term of communication and computational overheads

This research investigates a model for the COVID-19 outbreak in Indonesia by analyzing comorbid diseases, self-quarantine, government-provided quarantine, and immunization regimens. Some model parameters are derived from academic journals, others are extrapolated from data collected by the Indonesian Ministry of Health in 2020, and others are assumed. Evaluation of the model reveals non-endemic equilibrium points, endemic equilibrium points, and the basic reproduction number (BRN). The contact rate and infected probability factors impact the increase in the number of COVID-19-infected individuals with comorbid disease within a group. According to the sensitivity analysis of the BRN, the key parameters impacting the spread of COVID-19 are the rate of susceptible recruitment, the rate of contact, the COVID-19 infection death rate, and the likelihood of infection. In addition, sensitivity analyses are provided to examine the effect of parameter changes on subpopulations. We discovered that the natural death rate is the most sensitive parameter based on the sensitivity index after reaching equilibrium. Symmetry aspects appear in some of the visualization of the model’s solution and the BRN and parameters’ sensitivity.

Effective prediction of wastewater treatment is beneficial for precise control of wastewater treatment processes. The nonlinearity of pollutant indicators such as COD and TP makes the model difficult to fit and has low prediction accuracy. The classical deep learning methods have been shown to perform nonlinear modeling. However, there are enormous numerical differences between multi-dimensional data in the prediction problem of wastewater treatment, such as COD above 3000 mg/L and TP around 30 mg/L. It will make current normalization methods challenging to handle effectively, leading to the training failing to converge and the gradient disappears or exploding. This paper proposes a multi-factor prediction model based on deep learning. The model consists of a combined normalization layer and a codec. The combined normalization layer combines the advantages of three normalization calculation methods: z-score, Interval, and Max, which can realize the adaptive processing of multi-factor data, fully retain the characteristics of the data, and finally cooperate with the codec to learn the data characteristics and output the prediction results. Experiments show that the proposed model can overcome data differences and complex nonlinearity in predicting industrial wastewater pollutant indicators and achieve better prediction accuracy than classical models.

Chimeric Antigen Receptor (CAR)-T cell immunotherapy revolutionized cancer treatment and consists of the genetic modification of T lymphocytes with a CAR gene, aiming to increase their ability to recognize and kill antigen-specific tumor cells. The dynamics of CAR-T cell responses in patients presents a multiphasic kinetics with distribution, expansion, contraction, and persistence phases. The characteristics and duration of each phase depend on the tumor type, the infused product, and on patient-specific characteristics. We present a mathematical model which describes the multiphasic CAR-T cell dynamics resulting from the interplay between CAR-T and tumor cells, considering patient and product heterogeneities. The CAR-T cell population is divided into functional (distributed and effector), memory, and exhausted CAR-T cell phenotypes. The model is able to describe the diversity of CAR-T cell dynamic behaviors in different patients and hematological cancers as well as their therapy outcomes. Our results indicate that the joint assessment of the area under the concentration-time curve in the first 28 days and the corresponding fraction of non-exhausted CAR-T cells may be considered as potential markers to classify therapy responses. Overall, the analysis of different CAR-T cell phenotypes can be a key aspect for a better understanding of the whole CAR-T cell dynamics.

We present a differentially private extension of the block coordinate descent based on objective perturbation. The algorithm iteratively performs linear regression in a federated setting on vertically partitioned data. In addition to a privacy guarantee, the algorithm also offers a utility guarantee; a tolerance parameter indicates how much the differentially private regression may deviate from an analysis without differential privacy. The algorithm’s performance is compared with the standard block coordinate descent algorithm and the trade-off between utility and privacy is studied. The performance is studied using both artificial test data and the forest fires data set. We find that the algorithm is fast and able to generate practical predictions with single-digit privacy budgets, albeit with some accuracy loss.

In this work, we explore the extreme searching of multidimensional functions by natural gradient descent based on Dirichlet and generalized Dirichlet distributions. The natural gradient is based on describing multidimensional surface with probability distributions, which allows us to reduce changing the accuracy of gradient and step-size. In this article, we propose an algorithm of natural gradient descent based on Dirichlet and generalized Dirichlet distributions. We demonstrate that the natural gradient descent with step-size adaptation with Dirichlet and generalized Dirichlet distributions has higher accuracy and does not take a large number of iterations for minimizing test functions than gradient descent and Adam.

In this note we describe a new approach to the option pricing problem by introducing the notion of the safe (and acceptable) for the writer price of an option, in contrast to the fair price used in the Black-Scholes model. Our starting point is that the option pricing problem is closely related with the hedging problem by practical techniques. Recalling that the Black - Scholes model does not give us the price of the option but the initial value of a replicating portfolio we observe easily that has a serious disadvantage because assumes the building of this replicating portfolio continuously in time and this is a disadvantage of any model that assumes such a construction. Here we study the problem from the practical point of view concerning mainly the over the counter market. This approach is not affected by the number of the underlying assets and is particularly useful for incomplete markets. In the usual Black-Scholes or binomial or some other approaches one assumes that one can invest or borrow at the same risk free rate $r>0$ which is not true in general. Even if this is the case one can immediately observes that this risk free rate is not a universal constant but is different among different people or institutions. So, the fair price of an option is not so much fair! Moreover, the two sides are not, in general, equivalent against the risk therefore the notion of a fair price has no meaning at all. We also define a variant of the usual binomial model, by estimating safe upward and downward rates $u,d$, trying to give a cheaper safe or acceptable price for the option.

A novel kind of power spectrum is constructed, the inter-spike spectrum, which transforms any signal into its spike-frequency domain. This method clearly shows the apparent cycles in the data and overcomes the problems for spike-train-like signals when using the obvious idea of Fourier-transforming it. We invent this instructive approach with the idea of transforming the τ-recurrence rate of a recurrence plot (RP), which often has a spiky appearance. The τ-recurrence rate is the density of recurrence points along diagonals of the RP, which are parallel to the main diagonal with a distance of τ. In this context the inter-spike spectrum can be interpreted as a nonlinear power spectrum of a potentially high dimensional system which constitutes the RP. The proposed measure is robust to noise and is able to detect and analyze bifurcations.

Brain tumors are abnormal cells growth in the brain tissues that can be cancerous, or not. In any case, they could be a very aggressive disease that should be detected as early as possible. Usually, magnetic resonance imaging (MRI) is the main tool commonly adopted by neurologists and radiologists to identify and classify any possible anomalies present in the brain anatomy. In the present work, an automatic unsupervised method called Z2-$\gamma$, based on the use of adaptive finite-elements and suitable pre-processing and post-processing techniques, is introduced. In particular, the proposed methodology is able to automatically classify whether a given MR image represents a healthy or a diseased brain and in this latter case, is able to locate the tumor area.

The fractional Hilbert transform, a generalization of the Hilbert transform, has been extensively studied in the literature because of its extensive use in optics, engineering, and signal processing. In the present work, we aimed to expand the fractional Hilbert transform to a space of generalized functions known as Boehmians. We introduce a new fractional convolution operator for the fractional Hilbert transform to prove a convolution theorem similar to the classical Hilbert transform and also to extend the fractional Hilbert transform to Boehmians. We also construct a suitable Boehmian space on which the fractional Hilbert transform exists. Further, we investigate convergence of the fractional Hilbert transform for the class of Boehmians and discuss the continuity of the extended fractional Hilbert transform.

Pancreatic cancer represents one of the difficult problems of contemporary medicine. The development illness evolves very slowly, takes place in special sake (stroma) and manifests clinically close to a final stage. Another feature of this pathology is a coexistence (symbiotic) effect between cancer cells and normal cells inside stroma. All these aspects make it difficult to understand the pathogenesis of pancreatic cancer and develop a proper therapy. The emergence of pancreatic pre-cancer and cancer cells represents a branching stochastic process engaging populations of 64 cells differing in the number of acquired mutations. In this study we formulate and calibrate the mathematical model of pancreatic cancer using the quasispecies framework. The mathematical model incorporates the mutation matrix, fineness landscape matrix and the death rates. Each element of the mutation matrix presents the probability of appearing a specific mutation in the branching sequence of cells representing the accumulation of mutations. The model incorporates the cancer cell elimination by effect CD8 T cells (CTL). The down-regulation of the effector function of CTLs and exhaustion are parameterized. The symbiotic effect of coexistence of normal and cancer cells is considered. The computational predictions obtained with the model are consistent with empirical data. The modelling approach can be used to investigate other types of cancers and examine various treatment procedures.

In this work we develop a new algorithm for efficient computation of the Voigt/complex error function. In particular, in this approach we propose a two-domain scheme where number of the grid-points is dependent on the input parameter $y$. The error analysis we performed shows that the MATLAB implementation meets the requirements for radiative transfer applications involving the HITRAN spectroscopic database. The run-time test shows that this MATLAB implementation provides rapid computation especially at smaller range of the parameter x.

The paper investigates new robust code constructions based on bent functions and spline–wavelet transformation. Implementation of bent functions in codes construction increases the probability of error detection in the data channel and cryptographic devices. Meanwhile, use of spline–wavelets theory for constructing the codes gives the possibility to increase system security from the actions of an attacker. Presented constructions combines spline–wavelets functions and bent functions. Developed robust codes, compared to existing ones, have a higher parameter of maximum error masking probability. Illustrated codes are ensuring the security of transmitted information. Some of the granted constructions were implemented on FPGA.

This short paper demonstrates that the galactic spiral equations developed from ROTASE model can be used to morphologically simulate the phyllotactic spiral-ring patterns of plants. It is also noticed during this project that although the numbers in the Fibonacci sequence dominate the phyllotactic numbers, there are still significant phyllotactic numbers are not in the Fibonacci sequence, however, most of those numbers are well fit into a Fibonacci sibling sequence starting with numbers 0 and 2. Many plants show the phyllotactic number pairs of 10-16, 16-26 and 26-42 from the Fibonacci sibling sequence, which is the second dominated sequence in the phyllotaxis.

Working memory refers to the capability of the nervous system to selectively retain short-term memories in an active state. The long-standing viewpoint is that neurons play an indispensable role and working memory is encoded by synaptic plasticity. Furthermore, some recent studies have shown that calcium signaling assists the memory processes and the working memory might be affected by the astrocyte density. Over the last few decades, growing evidence has also revealed that astrocytes exhibit diverse coverage of synapses which are considered to participate in neuronal activities. However, very little effort has yet been made to attempt to shed light on the potential correlations between these observations. Hence, in this article we will leverage a computational neuron-astrocyte model to study the short-term memory performance subject to various astrocytic coverage and we will demonstrate that the short-term memory is susceptible to this factor. Our model may also provide plausible hypotheses for the various sizes of calcium events as they are reckoned to be correlated with the astrocytic coverage.

In this paper, we will consider an autonomous two-dimensional ODE Kolmogorov type 1 system with three parameters, which is a particular system of the general predator–prey systems with 2 a Holling type II. By reformulating this system as a set of two second order differential equations, we 3 will investigate the nonlinear dynamics of the system from the Jacobi stability point of view, using 4 the Kosambi-Cartan-Chern (KCC) geometric theory. We will determine the nonlinear connection, the 5 Berwald connection and the five KCC-invariants which express the intrinsic geometric properties 6 of the system, including the deviation curvature tensor. Furthermore, we will obtain necessary and 7 sufficient conditions on the parameters of the system in order to have the Jacobi stability near the 8 equilibrium points and we will point out these on a few examples.

Nowadays the practice of developing algorithms to maintain the confidentiality of data shows that there is a lack of some features, such as velocity, predictability, etc. Generating pseudorandom numbers is one such problem that lies in the basement of many algorithms, even in hardware microprograms. An unreliable generator can cause cyberattacks on it, despite the security in the upper layers. At the same time, the algorithm should be fast enough to provide uninterrupted circuit work for the entire system. The paper presents a new algorithm generating pseudorandom numbers on cellular automata, which is not only fast and easy-repeating, but unpredictable enough and can be used in cryptographic systems. Using the NIST statistical test suite for random and pseudorandom number generators (PRNG), it is shown that the presented algorithm is more than three times superior to the state-of-the-art methods and algorithms in terms of ? − ?????. A high level of the presented algorithm’s parallelization allows for implementation it effectively on calculators with parallel structure. CPU-based architecture, FPGA-based architecture, CUDA- based architecture of PRNG and different PRNG implementations are presented to confirm high performance of the proposed solution.

A calibrated mathematical model of antiviral immune response to SARS-CoV-2 infection is developed. The model considers the innate and antigen-specific responses to SARS-CoV-2 infection. Recently published data sets from human challenge studies with SARS-CoV-2 were used for parameter estimation. Understanding the regulation of multiple intertwined reaction components of the immune system is necessary for linking the clinical phenotypes of COVID-19 with the kinetics of immune responses. Consideration of multiple immune reaction components in a single calibrated mathematical model allowed us to address some fundamental issues related to pathogenesis of COVID-19, i.e. sensitivity of the peak viral load to parameters characterizing the specific response components, the kinetic coordination of the individual responses, and the factors favoring a prolonged viral persistence. The model provides a tool for predicting the infectivity of patients, i.e. the amount of virus which is transmitted via droplets from the person infected with SARS-CoV-2, depending on the time of infection. The thresholds in the relative unbalance between innate and adaptive response parameters which lead to a prolonged persistence of SARS-CoV-2 due to the loss of a kinetic response synchrony/coordination were identified.

In this paper it will be considered three deterministic models for the study of the interaction between the human immune system and a virus: the logistic model, the Gompertz model, and the generalized logistic model (or Richards model). A qualitative analysis of this models based on dynamical systems theory will be performed, by studying the local behavior of the equilibria and obtaining local dynamics properties from the linear stability point of view. Also, we will compare this models in order to understanding which is more appropriate to models the interaction between the human immune system and a virus. It will be obtained some natural medical interpretations which are available for all three models and can be useful to the medical community.

In the present study we introduce a deterministic mathematical model in order to study the interaction between the human immune system and a virus, like COVID 19. The mathematical analysis is based on the tools of dynamical systems theory, by modeling the interactions between the immune system and the virus, using a predator-prey method and following the ideas of G. Moza, from \cite{TGV}. It will be obtained some conclusions with medical relevance and the main three of them are the followings: 1) A deficiency of a single type of immunity in the early stages of virus proliferation, may lead to a large virus multiplication and the human body can loses the fight against this virus; 2) If the level of all components of the immunity system are at the normal threshold from the first moment of the infection and the immune system kill the virus at higher rate than the rate of virus reproduction, then the human body has the ability to stop the multiplication of the virus and liquidate it, that means the virus will be destroyed; 3) If the level of at least one type of immunity can be increased beyond the normal threshold, by medical interventions (like vaccination) in the early stages of virus infection, then the immune system has a better chance to win the fight with the virus.

This paper reports a new global Mittag-Leffler synchronization criterion with regard to fractional-order hyper-chaotic financial systems by designing the suitable impulsive control and the state feedback controller. The significance of this impulsive synchronization lies in the fact that the backward economic system can synchronize asymptotically with the advanced economic system under the effective impulse macroeconomic management means. Matlab LMI-toolbox is utilized to deduce the feasible solution in numerical example, which shows the effectiveness of the proposed methods. It is worth mentioning that the LMI-based criterion usually requires the activation function of the system to be Lipschitz, but the activation function in this paper is fixed and truly nonlinear, which cannot be assumed to be Lipschitz continuous. This is another mathematical difficulty overcome in this paper.

The application of evolutionary optimization algorithms in problem solving is currently gaining wide popularity. Use of Differential Evolution (DE) algorithm in obtaining analytically approximate solution of unstable second order initial value Ordinary Differential Equation (ODE) is presented in this work. The methodology involves solving an associated problem of optimization with con-strains to get an analytically approximate solution for the ODE under consider-ation. Three test cases were used to demonstrate the efficiency of our method. In comparison with other methods discussed in the literature, our method gave significant improvement on the accuracy of the obtained results.

The development of synthetic biology has enabled us to make massive progress on biotechnology and to approach research questions from a brand new perspective. In particular, the design and study of gene regulatory networks in vitro, in vivo and in silico, have played an increasingly indispensable role in understanding and controlling biological phenomena. Among them, it is of great interest to understand how associative learning is formed at the molecular circuit level. Noticeably, mathematical models have been increasingly used to predict the behaviors of molecular circuits. The Fernando’s model, which is thought to be one of the first works in this line of research using the Hill equation, attempted to design a synthetic circuit that mimics Hebbian learning in the neural network architecture. In this article, we carry out in-depth computational analysis of the model and demonstrate that the reinforcement effect can be achieved by choosing the proper parameter values. We also construct a novel circuit that can demonstrate forced dissociation, which was not observed in the Fernando’s model. Our work can be readily used as reference for synthetic biologists who consider implementing the circuits of this kind in biological systems.

The importance of statistics in biological research is inevitable. The appliance of statistics is the most powerful tool to support the scientific hypothesis and to give credibility to biological research methodology, to interpret convoluted explanations and conclusions based on the research findings. The evidences from literatures point the persistent statistical errors, selection of non-proper statistical test with the consequence of misinterpretation of the scientific results which are published in international journals. One of the most extensively used statistical tests in the field of biology (preclinical and clinical) is analysis of variance (ANOVA). ANOVA test is in place of multiple T-tests to compare the means of more than two groups at a time; and there are some important points which biologists should be aware of them to avoid possible misinterpretation of results with the consequence of wrong conclusion. Accordingly, the aim of the current review is to help biologists to understand the basic concepts of ANOVA test and reach to a more valid interpretation of achieved results.

Citizen participation has always been of vital importance in decision-making processes and, likewise, joint work in the formulation and execution of projects that respond to territorial needs. This in order to ensure the best impact of public or private investment, optimizing the result and community articulation. For this reason, this investigation proposes a methodology of evaluation and prioritization of projects based on an approach integrated between the modelling in dynamics systems (SDM) and the Analytical process network (ANP), in which the citizen factors are used as qualitative and quantitative variables inside the posed balance sheet model. This is how the model developed by the Stella Architect software, it offers to the decision makers approximate information about the reality of the community, especially those who were affected by the Colombian conflict and where the expectations of a comprehensive repair could disrupt the socioeconomic system and reveal more pressing interests than those of the central government. The methodology is described by the information gotten through the participatory workshops done in the California county that belongs to the Magdalena region, this is a very affected region by the conflict in Colombia. The investigation results confirm the useful of, first of all, the use of the modelling as an information-generating tool by allowing the simulation of relevant variables in the evaluation and prioritization of projects at different moments of time and, in second place, use the knowledge of the experts that expose the ANP method for establishing the importance of each variable compared with other variables and, likewise of each project compared to the rest of the alternatives in each of the different instants of time in which the evaluation is carried out, given that the results could change in any time, the official ranking is showed after an optimization process with partial results.

In this paper, the functional variable method is used to establish solitary wave solutions and periodic wave solutions of the loaded quadratic non-linear Klein-Gordon equation, the loaded cubic non-linear Klein-Gordon equation and the loaded coupled non-linear Klein-Gordon equation. All solutions of these equations have been examined and three dimensional graphics of the obtained solutions have been drawn by using the Matlab software. The main advantage of the proposed functional variable method over other methods is that it provides more new exact traveling wave solutions along with additional free parameters. The graphical representations of the soliton solutions and the periodic wave solutions by using distinct values of random parameter are demonstrated to better understand their physical features. The exact solutions have its great importance to reveal the internal mechanism of the physical phenomena.

Digital twins are the foundation of autonomous off-road vehicles. Dynamic reduction methods are one of several ways to develop digital twins for off-road vehicles. The article commences with a comprehensive overview of the most widely used dynamic reduction methods and then introduces performance metrics for assessing their efficacies in the context of digital twins. The paper additionally includes a detailed mathematical derivation of the state-space representation for reduced-order finite element models. The state-space representation of the reduced finite element models facilitates their export to problem-solving environments for dynamic analysis. The state-space models are eventually solved utilizing the built-in libraries of numerical solvers in textual and graphical programming platforms. In addition, the article identifies the set of solvers that best suit the simulation of virtual models for off-road vehicles. This article also includes an evaluation of the simulation results of digital models with modes ranging from 0 to 30 Hz. In addition, the article demonstrates the lower bound of the frequency range necessary and sufficient to be retained in off-road vehicle virtual models. Finally, the paper presents the simulation outcomes for digital models of commercial off-road vehicles with custom-built control, electrical, and control systems.

The application of transformations of the state equations of continuous linear and bilinear systems to the canonical form of controllability allows one to simplify the computation of Gramians of these systems. In the paper we developed the method and obtain algorithms for computation of the controllability and observability Gramians of continuous linear and bilinear stationary systems with many inputs and one output, based on the method of spectral expansion of the Gramians and the iterative method for computing the bilinear systems Gramians. An important feature of the concept is the idea of separability of the Gramians expansion: sep333arate computation of the scalar and matrix parts of the spectral Gramian expansion reduces the sub-Gramian matrices computation to calculation of numerical sequences of their elements. For the continuous linear systems with one output the method and the algorithm of the spectral decomposition of the controllability Gramian are developed in the form of Xiao matrices. Analytical expressions for the diagonal elements of the Gramian matrices are obtained, making use of which the rest elements can be calculated. For continuous linear systems with many outputs the spectral decompositions of the Gramians in the form of generalized Xiao matrices are obtained, which allows to significantly reduce the number of calculations. The obtained results are generalized for continuous bilinear systems with one output. Iterative spectral algorithms for computation of elements of Gramians of these systems are proposed. Examples are given that illustrate theoretical results.

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.

Power series expansions are useful in approximation theory and mathematical physics. The manuscript presents several types of fractional Taylor expansions of sufficiently smooth functions. This is achieved by employing an incremental regularization procedure to the computation of the derivative. The series are constructed in an algorithmic way, which allows for its implementation in computer algebra systems.

A correct system design can be systematically obtained from a specification model of a real-time system that integrates hybrid measurements in a realistic industrial environment, this has been carried out through complete Matlab / Simulink / Stateflow models. However, there is a widespread interest in carrying out that modeling by resorting to Machine Learning models, which can be understood as Automated Machine Learning for Real-time systems that present some degree of hybridization. An induction motor controller which must be able to maintain a constant air flow through a filter is one of these systems and it is discussed in the paper as a study case of closed-loop control system. The article discusses a practical application of ML methods that demonstrates how to replace such closed loop in industrial control systems with a Simulink block generated from neural networks to show how the proposed procedure can be applied to derive complete hybrid system designs with artificial neural networks (ANN). In the proposed ANN-based method to design a real-time hybrid system with continuous and discrete components, we use a typical design of a neural network, in which we define the usual phases: training, validation, and testing. The generated output of the model is made up of reference variables values of the cyber-physical system, which represent the functional and dynamic aspects of model. They are used to feed Simulink/Stateflow blocks in the real target system.

The process of revitalising quiescent cells in order for them to proliferate plays a pivotal role in the repair of warn out tissues as well as for tissue homeostasis. This process is also crucial in the growth, development and well-being of higher multi-cellular organisms such as mammals. Deregulation of quiescent-proliferation transition is related to many diseases, in particular cancer. Recent studies have revealed that this process is regulated tightly by the Rb−E2F bistable switch mechanism. Based on experimental observations, in this study, we formulate a mathematical model to examine the effect of the growth factor concentration on the proliferation-quiescence transition in human cells. Working with a non-dimensionalised model, we prove positivity, boundedness and uniqueness of solutions. To understand model solution behaviour close to bifurcation points, we carry out bifurcation analysis, which is further verified by use of numerical bifurcation analysis, sensitivity analysis and numerical simulations. Indeed, bifurcation and numerical analysis of the model predicted a transition between stable, bistable and stable states, which are dependent on the growth factor concentration parameter (GF). The derived predictions confirm experimental observations.

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.

In this paper, we demonstrate the Collatz conjecture using the mathematical complete induction method. We show that this conjecture is satisfied for the first values of natural numbers, and in analyzing the sequence generated by odd numbers, we can deduce a formula for the general term of the Collatz sequence for any odd natural number n after several iterations. This formula is used in one case that we analyze using the mathematical complete induction method in the process of demonstrating the conjecture.

Numerical methods, including machine learning methods, are now actively used in the applications related to guided wave propagation. The method proposed in this study for material properties characterization is based on the algorithm of the clustering of multivariate data series obtained as a result of the application of the matrix pencil method to the experimental data. In the proposed technique, multi-objective optimization is employed to improve the accuracy of particular parameter identification. At the first stage, the computationally efficient method based on the calculation of the Fourier transform of Green's matrix is employed iteratively and the obtained solution is used for the filter construction with decreasing bandwidth, which allows us to obtain nearly noise-free classified data (with mode separation). The filter provides data separation between all guided waves in a natural way, which is needed at the second stage, where the slower method based on the minimization of the slowness residuals is applied to the data. The method might be applied for material properties identification in plates with thin coatings/interlayers, multi-layered anisotropic laminates etc.

An actual problem of inertial navigation related to the creation of a multifunctional device that performs the functions of a meter for both angular velocities and linear accelerations is considered. The possibility of constructing such a device based on a hybrid-type modulation micromechanical gyroscope has shown. The ability to measure linear accelerations has provided by the presence of a small symmetrical distance between the axes of the elastic suspension relative to the center of mass of the sensor element. A mathematical model of the device ("heavy" gyroscope) as a high-quality three-dimensional oscillatory system is constructed. It has shown numerically that the reaction of the system to the movement of an object has, along with precession, the observed nutation. This allows you to develop an algorithm for separating information about the angular and linear motion of the base and implement a two-component angular velocity meter and a two-component linear acceleration meter in one device.

In this work we study the following problem, from a computational point of view: If three points are selected in the unit square at random, what is the probability that the triangle obtained is obtuse, acute or right? We provide two convergent strategies: the frst derived from the ideas introduced in [2] and the second built on the combinatorics theory. The combined use of these two methods allows us to address the random triangle theory from a new perspective and, we hope, to work out a general method of dealing with some classes of computational problems.

Increasing rate of seepage velocity from several formation characteristics, such as permeability and porosity, in water aquifer environment greatly prompt pollution of water reservoirs within a short period of time. Considerably, migration rate of dissolved heavy metals from Solid Waste Dumpsites (SWD), such as municipal dumpsites and landfills, through heterogeneous aquifer environment, and finally into nearby water reservoirs are mainly influenced by variation of seepage velocity within the soil and water environment. This presents a dynamic system for water pollution that was studied using a formulated mathematical model to describe the transport process of dissolved heavy metals, mainly characterized by seepage velocities, within the water aquiferous environment. Permeability, porosity, fluid pressure and concentration of heavy metals in aquiferous environment were used as principal parameters that influence seepage velocity of the metals, in dissolved state, through the structural formation of water aquifers. The derived mathematical equations that constitute the model of this study were generated through Darcy’s law and the equation of continuity. The model was validated on structural river aquifer sediments, and it was solved using graphical method through matlab open-source software. The initial and boundary conditions were obtained by discretizing the geological setting of flow region so as to transform the gradient of the head, into the time domain.

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.

New setting is introduced to study co-neighborhood, neutrosophic t-neighborhood, neutrosophic quasi-vertex set, neutrosophic quasi-order, neutrosophic neighborhood, neutrosophic co-t-neighborhood, neutrosophic quasi-edge set, neutrosophic quasi-size, Neutrosophic number, neutrosophic co-neighborhood, co-neutrosophic number, quasi-number and quasi-co-number. Some classes of neutrosophic graphs are investigated.

New setting is introduced to study neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of different vertices. Neighbor is a key term to have these notions. Having all possible edges amid vertices in a set is a key type of approach to have these notions namely neutrosophic failed-independent number and failed independent neutrosophic-number. Two numbers are obtained but now both settings leads to approach is on demand which is finding biggest set which have all vertices which are neighbors. Let NTG : (V,E,σ,μ) be a neutrosophic graph. Then failed independent number I(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously; failed independent neutrosophic-number In(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximum neutrosophic cardinality of a set S of vertices such that every two vertices of S are endpoints for an edge, simultaneously. As concluding results, there are some statements, remarks, examples and clarifications about some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-t-partite-neutrosophic graphs. The clarifications are also presented in both sections “Setting of Neutrosophic Failed-Independent Number,” and “Setting of Failed Independent Neutrosophic-Number,” for introduced results and used classes. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhoods of vertices. In path-neutrosophic graphs, two neighbors, form maximal set but with slightly differences, in cycle-neutrosophic graphs, two neighbors forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of all vertices leads us to neutrosophic failed-independent number and failed independent neutrosophic-number. In star-neutrosophic graphs, a set of vertices containing only center and one other vertex, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices including two vertices from different parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of t vertices from different parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set to extend this set to set of all vertices has key role to have these notions in the form of neutrosophic failed-independent number and failed independent neutrosophic-number arising neighborhood of vertices. The cardinality of a set has eligibility to neutrosophic failed-independent number but the neutrosophic cardinality of a set has eligibility to call failed independent neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connections amid each other, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

The present paper is concerned with the study of the quality of life index. Such an index has become an important index for measuring the well-being of individuals. However, the quality of life index is always a subjective, intangible, and often hard to quantify with precision due to the lack of quantitative models dealing with. The main goal of the present paper is thus to propose a mathematical, quantitative model for the measurement of a quality of life index. The main novelty is firstly the construction of a wavelet dynamic multiscale model to quantify and investigate the effect of time scale on the quality of life index measuring. The proposed procedure is acted empirically on a sample corresponding to Saudi Arabia as a case of study during the period from 2003 to 2020 as part of the 2030-vision plan. Saudi Arabia has implemented the so-called 2030-vision plan where the quality of life improvement is one of the main goals to be attempted. The findings show that wavelets are capable to localize the time-wise behavior of the index contrarily to classical studies which estimate a global view of the index. Moreover, the study shows the link between the quality of life behavior and many other indices.

New setting is introduced to study failed zero-forcing number and failed zero-forcing neutrosophic-number. Leaf-like is a key term to have these notions. Forcing a vertex to change its color is a type of approach to force that vertex to be zero-like. Forcing a vertex which is only neighbor for zero-like vertex to be zero-like vertex but now reverse approach is on demand which is finding biggest set which doesn’t force. LetNTG : (V,E,σ,μ) be a neutrosophic graph. Then failed zero-forcing number Z(NTG) for a neutrosophic graph NTG : (V,E,σ,μ) is maximal cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black after finitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing neutrosophic-number Zn(NTG) for a neutrosophic graphNTG : (V,E,σ,μ) is maximal neutrosophic cardinality of a set S of black vertices (whereas vertices in V (G) \ S are colored white) such that V (G) isn’t turned black afterfinitely many applications of “the color-change rule”: a white vertex is converted to a black vertex if it is the only white neighbor of a black vertex. Failed zero-forcing number and failed zero-forcing neutrosophic-number are about a set of vertices which are applied into the setting of neutrosophic graphs. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs, star-neutrosophic graphs, bipartite-neutrosophic graphs, and t-partite-neutrosophic graphs are investigated in the terms of maximal set which forms both of failed zero-forcing number and failed zero-forcing neutrosophic-number. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form failed zero-forcing number and failed zero-forcing neutrosophic-number. In path-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set but with slightly differences, in cycle-neutrosophic graphs, the set of vertices such that every given two vertices in the set, have distance at least two, forms maximal set. Other classes have same approaches. In complete-neutrosophic graphs, a set of vertices excluding two vertices leads us to failed zero-forcing number and failed zero-forcing neutrosophic-number. In star-neutrosophic graphs, a set of vertices excluding only two vertices and containing center, makes maximal set. In complete-bipartite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set but with slightly differences, in complete-t-partite-neutrosophic graphs, a set of vertices excluding two vertices from same parts makes intended set. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definition are provided. Using basic set not to extend this set to set of all vertices has key role to have these notions in the form of failed zero-forcing number and failed zero-forcing neutrosophic-number. The cardinality of a set has eligibility to form failed zero-forcing number but the neutrosophic cardinality of a set has eligibility to call failed zero-forcing neutrosophic-number. Some results get more frameworks and perspective about these definitions. The way in that, two vertices don’t have unique connection together, opens the way to do some approaches. A vertex could affect on other vertex but there’s no usage of edges. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to pursue this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

In this paper, we propose an unsupervised blind restoration model for images in hybrid degradation scenes. The proposed model encodes the content information and degradation information of images and then uses the attention module to disentangle the two kinds of information. It can improve the ability of disentangled presentation learning for a generative adversarial network (GAN) to restore the images in hybrid degradation scenes, enhance the detailed features of restored image and remove the artifact combining the adversarial loss, cycle-consistency loss, and perception loss. The experimental results on the DIV2K dataset and medical images show that the proposed method outperforms existing unsupervised image restoration algorithms in terms of peak signal-to-noise ratio (PSNR), structural similarity (SSIM), and subjective visual evaluation.

New setting is introduced to study quasi-degree and quasi-co-degree arising from co-neighborhood. quasi-degree and quasi-co-degree is about a vertex which are applied into the setting of neutrosophic graphs. . The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs namely path-neutrosophic graphs, cycle-neutrosophic graphs, complete-neutrosophic graphs and star-neutrosophic graphs, complete-bipartite-neutrosophic graphs and complete-multipartite-neutrosophic graphs are investigated in the terms of a vertex which is called either quasi-degree or quasi-co-degree. Neutrosophic number is reused in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number to compare with other vertices. Summation of three values of vertex makes one number and applying it to a comparison. This approach facilitates identifying vertices which form quasi-degree and quasi-co-degree. Quasi-degree is a value of a vertex which is maximum amid all values of vertices which are neighbors to a fixed vertex. Quasi-co-degree is a value of an edge which is maximum amid all values of edges which are neighbors to a fixed vertex but corresponded vertex is representative for this notion. Using different values which are related to a vertex inspire us to focus on edge and vertices which are corresponded to a fixed vertex. The notion of neighborhood is used to collect either vertices are titled neighbors or edges are incident to fixed vertex. In both settings, some classes of well-known neutrosophic graphs are studied. Some clarifications for each result and each definitions are provided. Using fixed vertex has key role to have these notions in the form of vertex or edge. The value of an edge has eligibility to call quasi-co-degree but the value of a vertex has eligibility to call quasi-degree. Some results get more frameworks and perspective about these definitions. The way in that, two vertices have connection together, open the way to define neighborhood and co-neighborhood. The maximum values in neighborhood and co-neighborhood introduces quasi-degree and quasi-co-degree, respectively. New name is chosen from degree. Since amid all vertices with different degrees, one vertex is chosen. In other words, one vertex is fixed and its degree turns out quasi-degree where two degrees could be assigned to a vertex. Degree of edges and degree of vertices. The number of edges which are incident to the vertex and the number of vertices which are neighbors to the vertex. Degree and co-degree are the notions which are transformed to use in quasi-style. Two neutrosophic values introduce two neutrosophic vertices separately in each settings. These notions are applied into neutrosophic graphs as individuals but not family of them as drawbacks for these notions. Finding special neutrosophic graphs which are well-known, is an open way to purse this study. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

This paper presents an extension of the results obtained in previous work concerning the application of global optimization techniques to the design of finite strategic games with mixed strategies. In that publication the Fuzzy ASA global optimization method was applied to many examples of synthesis of strategic games with one previously specified Nash equilibrium, evidencing its ability in finding payoff functions whose respective games present those equilibria, possibly among others. That is to say, it was shown it is possible to establish in advance a Nash equilibrium for a generic finite state strategic game and to compute payoff functions that will make it feasible to reach the chosen equilibrium, allowing players to converge to the desired profile, con- sidering that it is an equilibrium of the game as well. Going beyond this state of affairs, the present article shows that it is possible to ”impose” multiple Nash equilibria to finite strategic games by following the same reasoning as before, but with a fundamental change: using the same fundamental theorem of Richard McKelvey, modifying the originally prescribed objective function and globally minimizing it. The proposed method, in principle, is able to find payoff functions that result in games featuring an arbitrary number of Nash equilibria, paving the way to a substantial number of potential applications.

New setting is introduced to study the global powerful alliance. Global powerful alliance is about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define this notion. Also, neighborhood is defined based on strong edges. Strong edge gets a framework as neighborhood and after that, too close vertices have key role to define global powerful alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs excluding empty, path, star, and wheel and containing complete, cycle and r-regular-strong are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is used in this way. It’s applied to use the type of neutrosophic number in the way that, three values of a vertex are used and they’ve same share to construct this number. It’s called “modified neutrosophic number”. Summation of three values of vertex makes one number and applying it to a set makes neutrosophic number of set. This approach facilitates identifying minimal set and optimal set which forms minimal-global-powerful-alliance number and minimal-global-powerful-alliance-neutrosophic number. Two different types of sets namely global-powerful alliance and minimal-global-powerful alliance are defined. Global-powerful alliance identifies the sets in general vision but minimal-global-powerful alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-powerful-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-powerful alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs has an open avenue, in the way that, the family only contains same classes of neutrosophic graphs. The results are about minimal-global-powerful alliance, minimal-global-powerful-alliance number and its corresponded sets, minimal-global-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-powerful alliances, minimal-t-powerful alliance, minimal-t-powerful-alliance number and its corresponded sets, minimal-t-powerful-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-t-powerful alliances. The connections amid t-powerful-alliances are obtained. The number of connected components has some relations with this new concept and it gets some results. Some classes of neutrosophic graphs behave differently when the parity of vertices are different and in this case, cycle, and complete illustrate these behaviors. Two applications concerning complete model as individual and family, under the titles of time table and scheduling conclude the results and they give more clarifications and closing remarks. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study deeply and with more results but it seems that analogous results are determined. Slight progress is obtained in the family of these models but there are open avenues to study family of other models as same models and different models. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on strong edges illustrate open way to get results. A set is global powerful alliance when two sets partitioning vertex set have uniform structure. All members of set have more amount of neighbors in the set than out of set and reversely for non-members of set with less members in the way that the set is simultaneously t-offensive and(t-2)-defensive. A set is global if t=0. It leads us to the notion of global powerful alliance. Different edges make different neighborhoods but it’s used one style edge titled strong edge. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for these notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

Critical infrastructures are those that are essential. For this type of infrastructure, it is necessary to implement analytical methodologies that will allow us to quickly obtain the susceptibility or resilience and possible damage generated in extreme precipitation episodes, through a holistic perspective in which the factors linked to hydrological risk intervene. In particular, urban hydraulic infrastructures are analyzed considering the degree of criticality, defined as the number of interactions on the different activities of the population. For this purpose, a hydrological risk analysis methodology is required. This methodology is focused on an integral approach of the system indicators to be analyzed and linked to the hydrological threat. This work proposes to delimit and analyze those factors that involve risk using an analytical expression. This model will estimate the damage to these infrastructures breaking down the factors involved in the risk equation and analyzing their variability according to the intrinsic characteristics linked to them as well as the interaction with external factors.

A detection system, modeled in a graph, uses "detectors" on a subset of vertices to uniquely identify an "intruder" at any vertex. We consider two types of detection systems: open-locating-dominating (OLD) sets and identifying codes (ICs). An OLD set gives each vertex a unique, non-empty open neighborhood of detectors, while an IC provides a unique, non-empty closed neighborhood of detectors. We explore their fault-tolerant variants: redundant OLD (RED:OLD) sets and redundant ICs (RED:ICs), which ensure that removing/disabling at most one detector guarantees the properties of OLD sets and ICs, respectively. This paper focuses on constructing optimal RED:OLD sets and RED:ICs on the infinite king's grid, and presents the proof for the bounds on their minimum densities; [3/10, 1/3] for RED:OLD sets and [3/11, 1/3] for RED:ICs.

New setting is introduced to study the alliances. Alliances are about a set of vertices which are applied into the setting of neutrosophic graphs. Neighborhood has the key role to define these notions. Also, neighborhood is defined based on the edges, strong edges and some edges which are coming from connectedness. These three types of edges get a framework as neighborhood and after that, too close vertices have key role to define offensive alliance, defensive alliance, t-offensive alliance, and t-defensive alliance based on three types of edges, common edges, strong edges and some edges which are coming from connectedness. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, bipartite, t-partite, star and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. In this study, there’s an open way to extend these results into the family of these classes of neutrosophic graphs. The family of neutrosophic graphs aren’t study but it seems that analogous results are determined. There’s a question. How can be related to each other, two sets partitioning the vertex set of a graph? The ideas of neighborhood and neighbors based on different edges illustrate open way to get results. A set is alliance when two sets partitioning vertex set have uniform structure. All members of set have different amount of neighbors in the set and out of set. It leads us to the notion of offensive and defensive. New ideas, offensive alliance, defensive alliance, t-offensive alliance, t-defensive alliance, strong offensive alliance, strong defensive alliance, strong t-offensive alliance, strong t-defensive alliance, connected offensive alliance, connected defensive alliance, connected t-offensive alliance, and connected t-defensive alliance are introduced. Two numbers concerning cardinality and neutrosophic cardinality of alliances are introduced. A set is alliance when its complement make a relation in the terms of neighborhood. Different edges make different neighborhoods. Three types of edges are applied to define three styles of neighborhoods. General edges, strong edges and connected edges are used where connected edges are the edges arising from connectedness amid two endpoints of the edges. These notions are applied into neutrosophic graphs as individuals and family of them. Independent set as an alliance is a special set which has no neighbor inside and it implies some drawbacks for this notions. Finding special sets which are well-known, is an open way to purse this study. Special set which its members have only one neighbor inside, characterize the connected components where the cardinality of its complement is the number of connected components. Some problems are proposed to pursue this study. Basic familiarities with graph theory and neutrosophic graph theory are proposed for this article.

New setting is introduced to study “closing numbers” and “super-closing numbers” as optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. In this way, some approaches are applied to get some sets from (Neutrosophic)n-SuperHyperGraph and after that, some ideas are applied to get different types of super-closing numbers which are called by optimal-super-resolving number, optimal-super-coloring number and optimal-super-dominating number. The notion of dual is another new idea which is covered by these notions and results. In the setting of dual, the set of super-vertices is exchanged with the set of super-edges. Thus these results and definitions hold in the setting of dual. Setting of neutrosophic n-SuperHyperGraph is used to get some examples and solutions for two applications which are proposed. Both setting of SuperHyperGraph and neutrosophic n-SuperHyperGraph are simultaneously studied but the results are about the setting of n-SuperHyperGraphs. Setting of neutrosophic n-SuperHyperGraph get some examples where neutrosophic hypergraphs as special case of neutrosophic n-SuperHyperGraph are used. The clarifications use neutrosophic n-SuperHyperGraph and theoretical study is to use n-SuperHyperGraph but these results are also applicable into neutrosophic n-SuperHyperGraph. Special usage from different attributes of neutrosophic n-SuperHyperGraph are appropriate to have open ways to pursue this study. Different types of procedures including optimal-super-set, and optimal-super-number alongside study on the family of (neutrosophic)n-SuperHyperGraph are proposed in this way, some results are obtained. General classes of (neutrosophic)n-SuperHyperGraph are used to obtains these closing numbers and super-closing numbers and the representatives of the optimal-super-coloring sets, optimal-super-dominating sets and optimal-super-resolving sets. Using colors to assign to the super-vertices of n-SuperHyperGraph and characterizing optimal-super-resolving sets and optimal-super-dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on n-SuperHyperGraph to get new results about closing numbers and super-closing numbers alongside sets in the way that some closing numbers super-closing numbers get understandable perspective. Family of n-SuperHyperGraph are studied to investigate about the notions, super-resolving and super-coloring alongside super-dominating in n-SuperHyperGraph. In this way, sets of representatives of optimal-super-colors, optimal-super-resolving sets and optimal-super-dominating sets have key role. Optimal-super sets and optimal-super numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal-super ones. Simultaneously, three notions are applied into (neutrosophic)n-SuperHyperGraph to get sensible results about their structures. Basic familiarities with n-SuperHyperGraph theory and neutrosophic n-SuperHyperGraph theory are proposed for this article.

New setting is introduced to study types of coloring numbers, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Different types of procedures including neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtain chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic hypergraphs. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing representatives of the colors are applied in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about number, degree and co-degree in the way that some number, degree and co-degree get understandable perspective. Neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs are studied to investigate about the notions, coloring, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges in neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs. In this way, sets of representatives of colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, notions chromatic number, the representatives of the colors, degree of vertices, degree of hyperedges, co-degree of vertices, co-degree of hyperedges, neutrosophic degree of vertices, neutrosophic degree of hyperedges, neutrosophic co-degree of vertices, neutrosophic co-degree of hyperedges, neutrosophic number of vertices, neutrosophic number of hyperedges are applied into neutrosophic hypergraphs, especially, neutrosophic (r, n)−regular hypergraphs and neutrosophic complete r−partite hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

New setting is introduced to study resolving number and chromatic number alongside dominating number. Different types of procedures including set, optimal set, and optimal number alongside study on the family of neutrosophic hypergraphs are proposed in this way, some results are obtained. General classes of neutrosophic hypergraphs are used to obtains these numbers and the representatives of the colors, dominating sets and resolving sets. Using colors to assign to the vertices of neutrosophic hypergraphs and characterizing resolving sets and dominating sets are applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different ways of study on neutrosophic hypergraphs to get new results about numbers and sets in the way that some numbers get understandable perspective. Family of neutrosophic hypergraphs are studied to investigate about the notions, dimension and coloring alongside domination in neutrosophic hypergraphs. In this way, sets of representatives of colors, resolving sets and dominating sets have key role. Optimal sets and optimal numbers have key points to get new results but in some cases, there are usages of sets and numbers instead of optimal ones. Simultaneously, three notions are applied into neutrosophic hypergraphs to get sensible results about their structures. Basic familiarities with neutrosophic hypergraphs theory and hypergraph theory are proposed for this article.

New setting is introduced to study chromatic number. Different types of chromatic numbers and neutrosophic chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using different types of edges from connectedness in same neutrosophic graphs and in modified neutrosophic graphs to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute types of chromatic numbers. This specific relation amid edges is necessary to compute both types of chromatic number concerning the number of representative in the set of representatives and types of neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no intended edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

The process of water treatment by nanoparticles is one of the most considerable subjects in the cross-field of hydrodynamics, chemistry and mathematics. This paper is dedicated to the case of the flows that appear when squeezing and stretching a spongy with a mix of water with nanoparticles and contaminants. It is assumed that fluid is homogeneous at the starting moment, the parameters of the nanoparticles and contaminants are known, and there is a constant non-homogeneous magnetic field applied to the system. The flow starts moving when the walls of the channel shift to each other. Exact and numerical solutions of the system of ordinary differential equations are used to receive the results. The article gives an answer to the question about stability of the flow and proposes the technique to evaluate the essential characteristics of the system to achieve the treatment process efficiency. The main result is that the considered system shows excellent treatment properties during some part of squeezing stage. This effect does not appear without magnetic field.

We propose two methods for obtaining estimations on the minimum distance and covering radius of orthogonal arrays. Both methods are based on knowledge about the (feasible) sets of distance distributions of orthogonal arrays with given length, cardinality, factors and strength. New bounds are presented either in analytic form and as products of an ongoing project for computation and investigation of the possible distance distributions of orthogonal arrays with parameters in doable ranges.

This paper presents an algorithm for the fully automatic mesh generation for the finite element analysis of ships and offshore structures. The quality requirements on the mesh generator are imposed by the acceptance criteria of the classification societies as well as the need to avoid shear locking when using low degree shell elements. The meshing algorithm will be generating quadrilateral dominated meshes (consisting of quads and triangles) and the mesh quality requirements mandate that quadrilaterals with internal angles close to $90\degree$ are to be preferred. The geometry is described by a dictionary containing points, rods, surfaces and openings. The first part of the proposed method consist of an algorithm to automatically clean the geometry. The corrected geometry is then meshed by the frontal Delaunay mesh generator as implemented in the gmsh package. We present a heuristic method to precondition the cross field of the frontal quadrilateral mesher. Also the influence of the order in which the plates are meshed will be explored as a preconditioning step.

New setting is introduced to study chromatic number. vital chromatic number and n-vital chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assign to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using vital edge from connectedness to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute vital chromatic number. This specific relation amid edges is necessary to compute both vital chromatic number concerning the number of representative in the set of representatives and n-vital chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no vital edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

New setting is introduced to study chromatic number. Neutrosophic chromatic number and chromatic number are proposed in this way, some results are obtained. Classes of neutrosophic graphs are used to obtains these numbers and the representatives of the colors. Using colors to assigns to the vertices of neutrosophic graphs is applied. Some questions and problems are posed concerning ways to do further studies on this topic. Using strong edge to define the relation amid vertices which implies having different colors amid them and as consequences, choosing one vertex as a representative of each color to use them in a set of representatives and finally, using neutrosophic cardinality of this set to compute neutrosophic chromatic number. This specific relation amid edges is necessary to compute both chromatic number concerning the number of representative in the set of representatives and neutrosophic chromatic number concerning neutrosophic cardinality of set of representatives. If two vertices have no strong edge, then they can be assigned to same color even they’ve common edge. Basic familiarities with neutrosophic graph theory and graph theory are proposed for this article.

We provide methodology and numerical results for the Hattendorff differential equa- tion for the continuous time evolution of the variance of L(j)t , the loss at time t random variable for a multi-state process, given that the state at time t is j.

When presenting special relativity, it is customary to single out the so-called paradoxes. One of these paradoxes is the formal occurrence of speeds exceeding the speed of light. An essential part of such paradoxes arises from the incompleteness of the relativistic calculus of velocities. In special relativity, the additive group is used for velocities. However, the use of only group operations imposes artificial restrictions on possible computations. Naive expansion to vector space is usually done by using non-relativistic operations. We propose to consider arithmetic operations in the special theory of relativity in the framework of the Cayley–Klein model for projective spaces. We show that such paradoxes do not arise in the framework of the proposed relativistic extension of algebraic operations.

Four discrete models using the exact spectral derivative discretization finite difference (ESDDFD) method are proposed for a chaotic five-dimensional, conformable fractional derivative financial system incorporating ethics and market confidence. Since the system considered was recently studied using the conformable Euler finite difference (CEFD) method and found to be hyperchaotic, and the CEFD method was recently shown to be valid only at fractional index , the source of the hyperchaos is in question. Through numerical experiments, illustration is presented that the hyperchaos previously detected is in part an artifact of the CEFD method as it is absent from the ESDDFD models.

The aim of this work is to introduce a mathematical model representing the evolution of the temperature in a vegetation cover and the ground underneath it. Vegetation, and its interaction with soil, plays a very important role in the protection of soil surface from the action of sun and precipitations. A reduction in the vegetated mass increase the risk of desertification, soil erosion or surface runoffs which which can give rise to soil loss and sediment retention. These processes can favour climate change and global warming, which are major concerns nowadays. The mathematical model presented takes into account the main processes involved in vegetation cover and the interaction with the soil, among which, we can mention the Leaf Area Index, which is a dimensionless quantity defined as the one-sided green leaf area per unit ground surface area, or albedo and co-albedo which are clearly influenced by the vegetation. It is also considered a nonlinear heat capacity in the soil which incorporates the latent heat of fusion, when the phase change takes place. The numerical technique used to solve the mathematical model is based on a finite volume scheme with Weighted Essentially Non Oscillatory technique for spatial reconstruction and the third order Runge-Kutta Total Variation Diminishing numerical scheme is used for time integration. Some numerical examples are solved to obtain the distribution of temperature both in the vegetation cover and the soil.

In the current era of ‘big data’, scientists are able to quickly amass enormous amount of data in a limited number of experiments. The investigators then try to hypothesize about the root cause based on the observed trends for the predictors and the response variable. This involves identifying the discriminatory predictors that are most responsible for explaining variation in the response variable. In the current work, we investigated three related multivariate techniques: Principal Component Regression (PCR), Partial Least Squares or Projections to Latent Structures (PLS), and Orthogonal Partial Least Squares (OPLS). To perform a comparative analysis, we used a publicly available dataset for Parkinson’ disease patien ts. We first performed the analysis using a cross-validated number of principal components for the aforementioned techniques. Our results demonstrated that PLS and OPLS were better suited than PCR for identifying the discriminatory predictors. Since the X data did not exhibit a strong correlation, we also performed Multiple Linear Regression (MLR) on the dataset. A comparison of the top five discriminatory predictors identified by the four techniques showed a substantial overlap between the results obtained by PLS, OPLS, and MLR, and the three techniques exhibited a significant divergence from the variables identified by PCR. A further investigation of the data revealed that PCR could be used to identify the discriminatory variables successfully if the number of principal components in the regression model were increased. In summary, we recommend using PLS or OPLS for hypothesis generation and systemizing the selection process for principal components when using PCR.rewordexplain later why MLR can be used on a dataset with no correlation

In light of Liu \emph{at el.}'s original works, this paper revisits the solution of Burgers's nonlinear equation $u_t=a(u_x)^2+bu_{xx} $. The study found two exact and explicit solutions for groups $G_4$ and $G_6$, as well as a general solution. A numerical simulation is carried out. In the appendix a Maple code is provided

3D Zernike moments based on 3D Zernike polynomials have been successfully applied to the field of voxelized 3D shape retrieval and have attracted more attention in biomedical image processing. As the order of 3D Zernike moments increases, both computational efficiency and numerical accuracy decrease. Due to this phenomenon, a more efficient and stable method for computing high-order 3D Zernike moments was proposed in this study. The proposed recursive formula for computing 3D Zernike radial polynomials combines the recursive calculation of spherical harmonics to develop a voxel-based algorithm for the calculation of 3D Zernike moments. The algorithm was applied to the 3D shape Michelangelo's David with a size of 150×150×150 voxels. As compared to the method without additional acceleration, the proposed method uses a group action of order sixteen orthogonal group and saving unnecessary iterations, the factor of speed-up is 56.783±3.999 when the order of Zernike moments is between 10 and 450. The proposed method also obtained an accurate reconstructed shape with the error rate (normalized mean square error) of 0.00 (4.17×10^-3) when the reconstruction was computed for all moments up to order 450.

The main idea of this paper is to investigate the exact solutions and dynamic properties in optical nanofibers, which is modeled by space-time fractional perturbed nonlinear schr\"odinger equation involving Kerr law nonlinearity with conformal fractional derivative. Firstly, by the complex fractional traveling wave transformation, the traveling wave system of the original equation is obtained, then a conserved quantity, namely the Hamiltonian is constructed, and the qualitative analysis of this system is conducted via this quantity by classifying the equilibrium points. Moreover, the prior estimate of the existence of the soliton and periodic solution is established via the bifurcation method. Furthermore, all exact traveling wave solutions are constructed to illustrate our results explicitly by the complete discrimination system for polynomial method.

So called Higuchi’s method of fractal dimension estimation is widely used and the term Higuchi’s fractal dimension even occurs in many publications. This paper deals with this method from mathematical point of view. Terms distance and dimension and its basic properties are explained and Higuchi’s dimension according the original source is defined. Definition of Higuchi’s dimension was comparated with mathematical definition of the distance and dimension. It is showed, that the definition of the Higuchi’s dimension does not satisfy axioms of distance and dimension. So called Higuchi’s method and Higuchi’s dimension are mathematically incorrect. Therefore, all results achieved by this method are scientifically unreliable.

Applying a procedure similar to that of E.S. Bring, by using a 4^th degree Tschirnhaus transformation, it was possible to transform the Bring-Jerrard normal quintic (BJQ) equation into a De Moivre form (DMQ), so that it could be solved by radicals. The general solution by radicals of the De Moivre equations of any degree is presented. By the same procedure the BJSx (normal sextic) equation was taken to another one without the 2^nd, 4^th and 6^th terms which was transformed into a cubic (solvable) equation. By applying a 6^th degree Tschirnhaus transformation to the BJSp (normal septic) equation its Bring-Jerrard binormal (without the 2^nd, 3^rd, 4^th and 5^th terms) form was obtained.

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.

Autonomous differential equations of fractional order and non-singular kernel are solved. While solutions can be obtained through numerical, graphical, or analytical solutions, we seek an implicit analytical solution.

Radiation Fireballs are singular phenomena which involve severe thermal radiation and consequently, they need to be duly assessed and prevented. Although the radiative heat transfer produced by a sphere is relatively well known, the shadowing measures implemented to control the fireball’s devastating effects have frequently posed a difficult analytical instance, mainly due to its specific configuration. In this article, since the usual solving equations for the said cases are impractical, the authors propose a novel graphic-algorithm method that sorts the problem efficiently for different kinds of obstructions and relative positions of the fireball and the defenses. Adequate application of this method may improve the safety of a significant number of facilities exposed to such risks.

The aim of this work is to explain the behaviour of the multiresistance percentage of Pseudomona aeruginosa in some countries of Europe through a multivariate statistical analysis and machine learning validation, using data from the European Antimicrobial Resistance Surveillance System, the World Health Organization and the World Bank. First, we will use a descriptive analysis and a principal components analysis. Then, we use a k-means clustering to determine the countries and regions that are most affected by the antibiotic resistance. Second, we expand the database by adding some socioeconomic, governance and antibiotic-consumption variables. We then run a data panel regression analysis to determine some functions that relates the multiresistance percentage with those new variables. Finally, we use machine learning techniques to validate a pooling panel data case, using XGBoost and random forest algorithms. The results of the data panel analysis indicate that the most important variables for the multiresistance percentage are corruption control and the rule of law. Similar results are found with the machine learning validation analysis, where the human development index is an additional important variable for the multiresistance percentage.

This article describes an algorithm for generating fractals using polar coordinates. The classic Julie and Mandelbrot polynomial iteration applied to a complex number is replaced by a separate iteration for distance and angle. By varying the polynomial parameters of the iteration functions, a wide range of attractive images can be created. Distance and angle values ​​are used to colorize fractal images.

Here we studied Bianchi type-III string cosmological models generated by means of a cloud of strings with particles connected to them in the framework of Lyra geometry considering five-dimensional space-time. To obtain the exact solutions of field equations we consider that the shear scalar and the scalar expansion are proportional, σ∞θ which leads to D=cn and secondly we adopt the assumption considering the Reddy String Condition, ρ+λ=0. From the two different cases obtained here, first case leads to the Bianchi type-III string cosmological model in Lyra geometry in five-dimensional space-time and the second case leads to the five-dimensional vacuum universe in general relativity. The Geometrical and physical properties of the model universe are studied comparing with the present day’s observational findings. The model universe obtained here starts with the big bang and as time progresses both particle density ρp and energy density ρ decreases with expansion of our Universe.

A data-driven analysis method known as dynamic mode decomposition (DMD) approximates the linear Koopman operator on projected space. In the spirit of Johnson-Lindenstrauss Lemma, we will use random projection to estimate the DMD modes in reduced dimensional space. In practical applications, snapshots are in high dimensional observable space and the DMD operator matrix is massive. Hence, computing DMD with the full spectrum is infeasible, so our main computational goal is estimating the eigenvalue and eigenvectors of the DMD operator in a projected domain. We will generalize the current algorithm to estimate a projected DMD operator. We focus on a powerful and simple random projection algorithm that will reduce the computational and storage cost. While clearly, a random projection simplifies the algorithmic complexity of a detailed optimal projection, as we will show, generally the results can be excellent nonetheless, and quality understood through a well-developed theory of random projections. We will demonstrate that modes can be calculated for a low cost by the projected data with sufficient dimension.

Targeted radionuclide therapy (TRT) has recently seen a surge in popularity, with the use of radionuclides conjugated to small molecules and antibodies. Similarly, immunotherapy also has shown promising results – an example being chimeric antigen receptor (CAR) T-cells therapy in hematologic malignancies. Moreover, TRT and CAR T therapies possess unique features that require special consideration when determining how to dose, time, and sequence combination treatments, including the distribution of TRT dose in the body, the decay rate of the radionuclide, and the proliferation and persistence of the CAR-T cells. These characteristics complicate additive or synergistic effects of combination therapies and warrant a mathematical treatment which includes these dynamics in relation to the proliferation and clearance rates of the target tumor cells. Here we combine two previously published mathematical models in a multiple myeloma setting to explore the effects of dose, timing, and sequencing of TRT and CAR-T cell based therapies. We find that for a fixed TRT and CAR-T cell dose, the tumor proliferation rate is the most important parameter in determining the best timing of TRT and CAR T therapies.

In this short note we present a technique using which one attributes frequency and wavevector to (almost) arbitrary scalar fields. Our proposed definition is then applied to the classical wave equation to yield a novel nonlinear PDE.

In this lecture notes, we will introduce Asymptotics, then we will give a short glimpse on Perturbation theory (regular versus singular), which plays a crucial role especially in theoretical physics. Our goal is to find Asymptotic series that approximates the values of integrals depending on some parameter or the solutions of differential equations. These methods that lead to obtain more effective algorithms of numerical evaluation are called: Asymptotic Methods.

Unlike the volume, the expression for the lateral area of a regular conoid has not yet been obtained by means of direct integration or a differential geometry procedure. As this form is relatively used in engineering, the inability to determine its surface, represents a serious hindrance for several problems which arise in radiative transfer, lighting and construction, to cite just a few. Since this particular shape can be conceived as a set of linearly dwindling ellipses which remain parallel to a circular directrix, a typical problem appears when looking for the length of such ellipses. We conceived a new procedure which, in principle, consists in dividing the surface into infinitesimal elliptic strips to which we have subsequently applied Ramanujan’s second approximation. In this fashion, we can obtain the perimeter of any ellipse pertaining to the said form as a function of the radius of the directrix and the position of the ellipse’s center on the X-axis. Integrating the so-found perimeters of the differential strips for the whole span of the conoid, an unexpected solution emerges through the newly found number psi (ψ). As the strips are slanted in the symmetry axis, their width is not uniform and we need to perform some adjustments in order to complete the problem with sufficient precision. Relevant implications for technology, building science, radiation and structure are derived in the ensuing discussion.

A method for noise reduction of spectra based on fitting a multi-window model is presented. The spectrum is modeled as the sum of the polynomial background and Lorentzian peaks. This model applies to all points in the spectrum and to all window sizes. An iterative algorithm is used for fitting. Based on the initial data, the background calculated by the direct least squares method is subtracted. Positive data values ​​are inverted using the 1/x function and the same procedure is used to fit the Lorentzian peaks. The weighted sum of all windows fit containing the point to be processed is used as the result. The weighting factors are calculated by evaluating the quality of the fit. The performance of the presented method is compared with the Savitsky-Golay method and the wavelet noise reduction method. The proposed approach provides good noise reduction performance without using user-entered parameters.

In this essay, the new notion concerning longest path is introduced. Longest path has a close relation with the notion of diameter in graph. The classes of graph are studied in the terms of having the vertex with longest path. Valued number is the number of edges belong to the longest path in the matter of vertex. For every vertex, there’s a valued number and new notion of valued set is the generalization of valued number for the vertex when all vertices of the graphs are corresponded to a vertex which has the greater valued number. For any positive integer, there’s one graph in that, there’s vertex which its valued number is that. By deleting the vertices which don’t belong to valued set, new notion of new graph is up. It’s called valued graph. The comparison amid valued graph and initial graph is up, too.

In today’s world face detection is the most important task. Due to the chromosomes disorder sometimes a human face suffers from different abnormalities. For example, one eye is bigger than the other, cliff face, different chin-length, variation of nose length, length or width of lips are different, etc. For computer vision currently this is a challenging task to detect normal and abnormal face and facial parts from an input image. In this research paper a method is proposed that can detect normal or abnormal faces from a frontal input image. This method used Fast Fourier Transformation (FFT) and Discrete Cosine Transformation of frequency domain and spatial domain analysis to detect those faces.

The kind of set which is based on edges, is introduced. The analysis on this set is done in the matter of operation which are the classes of graphs. The general notion which is related to this concept, is up. The set of edges is seen in the matter of common vertex, entitled neighbor edges and the set of edges which has specific condition on the vertices of graphs, entitled ghost set. The kind of viewpoint when the edges are up so the kind of efforts to assign some notions which get the sensible result of edges which make sense about these two types of notions. Notions of having some attributes about vertices concerning edges and edges' attributes to get result about edges in the matter of vertices.

In this article, some kinds of triple belongs to metric dimensions are defined. Some classes of graphs in the matter of these kinds, are studied and the relation amid these kinds are considered. The kind of having equivalency amid these notions and some classes of graphs, is obtained. The kind of locating some vertices by some vertices when the number of locating vertices is increased, has the key role to analyze the classes of graphs, general graphs, and graph's parameters.

In this article, some notions about set, weight of set, number, number's position, special vertex are introduced. Some classes of graph under these new notions have been opted as if the study on the special attributes of these new notion when they've acted amid each other is considered. Internal and external relations amid these new notions have been obtained as if some classes of graphs in the matter of these notions are been pointed out.

In this article, the connections amid matroid and other notions have been studied. The structure of matroid could be a reflection of some other structure in lattice theory, group theory, other algebraic structure, graph theory, combinatorics and enumeration theory.