This work addresses the problem of sampling from Gaussian probability distributions by means of uniform samples obtained deterministically and directly from space-filling curves (SFCs), a purely topological concept. To that end, the well-known inverse cumulative distribution function method is used, with the help of the probit function,which is the inverse of the cumulative distribution function of the standard normal distribution. Mainly due to the central limit theorem, the Gaussian distribution plays a fundamental role in probability theory and related areas, and that is why it has been chosen to be studied in the present paper. Numerical distributions (histograms) obtained with the proposed method, and in several levels of granularity, are compared to the theoretical normal PDF, along with other already established sampling methods, all using the cited probit function. Final results are validated with the Kullback-Leibler and two other divergence measures, and it will be possible to draw conclusions about the adequacy of the presented paradigm. As is amply known, the generation of uniform random numbers is a deterministic simulation of randomness using numerical operations. That said, sequences resulting from this kind of procedure are not truly random. Even so, and to be coherent with the literature, the expression ”random number” will be used along the text to mean ”pseudo-random number”.

An SIRS (Susceptible–Infected–Removed-Susceptible) mathematical model for the transmission dynamics of the Transfusion–Transmitted Malaria (TTM) model with optimal control pair u₁(t) and u₂(t) was developed and studied in this research work. The model Transfusion–Transmitted Malaria disease–free equilibrium and endemic equilibriums points were determined. The model exhibited two equilibriums; disease-free and endemic equilibrium. It is shown that the disease–free equilibrium was locally asymptotically stable if the associated basic reproduction numbers R₀ is less than unity while the disease persists if R₀ is greater than unity. The global stability of the Transfusion–Transmitted Malaria model at the disease-free equilibrium was established using the comparison method. The optimality system was derived and an optimal control model of blood screening and drug treatment for the Transfusion–Transmitted Malaria model was investigated. Conditions for the optimal control were considered using Pontryagin’s Maximum Principle and solved numerically using the Forward and Backward Finite Difference Method (FBDM). Numerical results obtained are in perfect agreement with our analytical results.

Searching for neutrinoless double beta decay is a top priority in particle and astroparticle physics, being the most sensitive test of lepton number violation and the only suitable process to probe the Majorana nature of neutrinos. In order to increase the experimental sensitivity for this particular search, ton-scale detectors operated at nearly zero-background conditions with a few keV energy resolution are required. In this scenario, cryogenic detectors have proven effective in addressing many of these issues simultaneously. After long technical developments, the CUORE experiment established the possibility to operate large scale detectors based on this technology. Parallel studies pointed out that scintillating cryogenic detectors represent a suitable upgrade for the CUORE design, directed towards higher sensitivities. In this work, we review the recent development of cryogenic detectors, starting from the status of the art and outlying the path toward next-generation experiments.

Many cryptographic systems require random numbers, and weak random numbers lead to insecure systems. In the modern world, there are several techniques for generating random numbers, of which the most fundamental and important methods are deterministic extractors proposed by von Neumann, Elias, and Peres. Elias’s extractor achieves the optimal rate (i.e., information theoretic upper bound) h(p) if the block size tends to infinity, where h(·) is the binary entropy function and p is probability that each bit of input sequences occurs. Peres’s extractor achieves the optimal rate h(p) if the length of input and the number of iterations tend to infinity. The previous researches related to both extractors did not mention practical aspects including running time and memory-size with finite input sequences. In this paper, based on some heuristics, we derive a lower bound on the maximum redundancy of Peres’s extractor, and we show that Elias’s extractor is better than Peres’s one in terms of the maximum redundancy (or the rates) if we do not pay attention to time complexity or space complexity. In addition, we perform numerical and non-asymptotic analysis of both extractors with a finite input sequence with any biased probability under the same environments. For doing it, we implemented both extractors on a general PC and simple environments. Our empirical results show that Peres’s extractor is much better than Elias’s one for given finite input sequences under the almost same running time. As a consequence, Peres’s extractor would be more suitable to generate uniformly random sequences in practice in applications such as cryptographic systems.

{\bf Abstract.} \\ {\bf Background:} Bangladesh hosts more than 800,000 Rohingya refugees from Myanmar. The low health immunity, lifestyle, access to good healthcare services, social-security cause this population to be at risk of far more direct effects of COVID-19 than the host population. Therefore, evidence-based forecasting of the COVID-19 burden is vital in this regard. In this study, we aimed to forecast the COVID-19 burden among the Rohingya refugees of Bangladesh to keep up with the disease outbreak's pace, health needs, and disaster preparedness. \noindent{\bf Methodology and Findings:} To estimate the possible consequences of COVID-19 in the Rohingya camps of Bangladesh, we used a modified Susceptible-Exposed-Infectious Recovered (SEIR) transmission model. All the values of different parameters used in this model were from the Bangladesh Government’s database and the relevant emerging literature. We addressed two different scenarios, i.e., the best-fitting model and good fitting model with unique consequences of COVID-19. Our best fitting model suggests that there will be good control over the transmission of the COVID-19 disease. At the end of December 2020, there will be only 169 confirmed COVID-19 cases in the Rohingya refugee camps. The average basic reproduction number ($ \mathcal{R}_{0} $) has been estimated to be 0.7563. \noindent{\bf Conclusion:} Our analysis suggests that, due to the extensive precautions from the Bangladesh government as well as other humanitarian organizations, the coronavirus disease will be under control if the maintenance continues like this. Although detailed and pragmatic preparedness should be adopted for the worst scenario.

Fermatean fuzzy linguistic (FFL) set theory provides an efficient tool for modeling a higher level of uncertain and imprecise information, which cannot be represented using intuitionistic fuzzy linguistic (IFL)/Pythagorean fuzzy linguistic (PFL) sets. On the other hand, the linguistic scale function is the better way to consider the semantics of the linguistic terms during the evaluation process. In the present paper, we first define some new modified operational laws for Fermatean fuzzy linguistic numbers (FFLNs) based on linguistic scale function (LSF) to overcome the shortcomings of the existing operational laws and prove some important mathematical properties of them. Based on it, the work defines several new aggregation operators (AOs), namely, the FFL-weighted averaging (FFLWA) operator, the FFL-weighted geometric (FFLWG) operator, the FFL-ordered weighted averaging (FFLOWA) operator, the FFL-ordered weighted geometric (FFLOWG) operator, the FFL-hybrid averaging (FFLHA) operator and the FFL-hybrid geometric (FFLHG) operator under FFL environment. Several properties of these AOs are investigated in detail. Further, based on these operators, a multiple attribute group decision-making (MAGDM) approach with FFL information is developed. Finally, to illustrate the effectiveness of the present approach, a real-life supplier selection problem is presented where the evaluation information of the alternatives is given in terms of FFLNs.

The aim of the studies was to test the hydraulic pressure losses along the length, local pressure losses, absolute and relative roughness values of the pipeline walls made of modern polymer material. The article presents the results of the experimental studies of hydraulic resistance of pipelines from modern polymer materials, the method of theoretical determination of resistance coefficients in the VALTEC ISO 21003 metal polymer pipeline, the classification and method of determining the values of local hydraulic resistance coefficients of T-Junctions are given, the dependence for determining the Darcy λ hydraulic friction coefficient associated with the value of the equivalent hydraulic roughness coefficient of the inner surface of pipes and the Reynolds number. The experimental data of the hydraulic coefficient of friction Darcy λ was compared with the known theoretical relationships of A.D. Altschul, Colbrooke for smooth pipes, Colbrooke and White, an alternative to the Colbrooke-White, Offengenden equation for low-shear pipes and pipes from polymer materials with Reynolds numbers Re>10^4. Dependence of hydraulic coefficient of friction on relative equivalent roughness of pipeline walls and Reynolds number, specific energy loss per one linear meter on total flow rate in system of hydraulically short pipeline is obtained. The empirical dependence of values of coefficients of local resistance ζ=f(Q2/Q3) from a ratio of the divided expenses of Q2/Q3 of the equal-pass T-Junction α=90 the pipeline to a branch up, on pass in the direct T-Junction and division of streams at various internal pipeline diameters of VALTEC.

Mechanical properties such as shape, volume and size affect the dynamics of biological systems. Most of the current methodological approaches are inclined to remove the existence of holes and impurities from systems’ description, regarding them as routes toward mechanical failure. On the contrary, we suggest that the occurrence of holes might be of utmost functional importance, allowing reversible transformations of cellular structures. The focus here is on the widespread occurrence of intracytoplasmic holes, that deeply modifies the topology of living cells and provides researchers with novel operational tools to investigate intracellular dynamics. We take as example the prokaryotic gas vesicles, i.e., intracellular cavities filled with gases spreading from the nearby medium. The mechanical and topological cellular properties dictated by intracytoplasmic holes are investigated, focusing on the physical constraints imposed by their very existence. For instance, the presence of gas vesicles breaks the cytoplasmic homogeneity, leading to inhomogeneity in functional activities and modifications in intracellular flows. Also, a topological approach to cytoplasmic holes suggests novel physiological roles for gas vesicles. For example, the gas vesicles’ ability to increase/decrease cellular volumes provides a mechanism that counteracts the detrimental effects of the surface/volume ratio. In conclusion, a structural/methodological approach based on the occurrence of holes testifies once again how the simple biophysical structure alone can dictate the function.

Finding out how cells with the same genome change fates in differentiation commitment is a challenge of biology. We used MCF-7 breast cancer cells treated with the ErbB2 ligand heregulin (HRG), which induces differentiation, to address if and how the constitutive pericentromere-associated domains (PADs) may be involved in this process. PAD-specific repressive heterochromatin (H3K9me3) and active euchromatin (H3K4me3) marking, centromere (CENPA) labelling, qPCR, acridine-orange-DNA structural test, and microscopic image analysis were applied. We found a two-step DNA unfolding, at 15-20 min and 60 min after HRG treatment, coinciding with bi-phasic activation of the early response genes (c-FOS family) and two steps of critical phase transition which were revealed in transcriptome studies. In control, the distribution of PAD number and size displays a power-law scaling with a boundary at the nucleolus. PADs’ clustering correlates with centromere numbers. 15 min after HRG treatment, the unravelling of PADs occurs, coinciding with the first step of euchromatin unfolding. The second step is associated with transcription of long-non-coding-RNA from satellite III DNA. We hypothesize that splitting of the PAD clusters under the critical size threshold of the silencing domain abrupts position effect variegation. It allows the first genome transcription avalanche to occur, starting differentiation commitment.

Background: Our knowledge of prostate cancer (PCa) genomics mainly reflects European (EUR) and Asian (ASN) populations. Our understanding of the influence of Middle Eastern (ME) and African (AFR) ancestry on the mutational profiles of prostate cancer is limited. Design, setting and participants: To characterize genomic differences between ME, EUR, ASN and AFR ancestry, fluorescent in situ hybridization (FISH) studies for NKX3-1 deletions and MYC amplification was carried out on 42 tumors arising in individuals of ME ancestry. These were supplemented by analysis of copy number profiles of 401 tumors of all ancestries. Outcome measurement and statistical analysis: FISH results of NKX3-1 and MYC were assessed in the ME cohort and compared to other ancestries. Gene level copy number aberrations (CNAs) for each sample were statistically compared between ancestry groups. Results and Limitation: NKX3-1 deletions by FISH were observed in 17/42 (17.5%) prostate tumors arising in men of ME ancestry, while MYC amplifications were only observed in 1/42 (0.23%). Using CNAs called from arrays, the incidence of NKX3-1 deletions was significantly lower in ME vs. other ancestries (20% vs. 52%; p = 2.3 x 10-3). No differences in MYC amplifications was noted between the two cohorts using array-based CNAs. Across the genome, tumors arising in men of ME ancestry had fewer CNAs than those of other ancestries (p = 0.014). Additionally, the somatic amplification of 21 specific genes was more frequent in tumors arising in men of ME vs. EUR ancestry (Proportions test; Q < 0.05). Those included amplifications in the glutathione S-transferase family on chromosome 1 (GSTM1, GSTM2, GSTM5) and the IQ Motif Containing family on chromosome 3 (IQCF1, IQCF2, IQCF13, IQCF4, IQCF5, IQCF6). Conclusion: Significant differences in genetic background exists between different ancestries. The lower number of somatic CNAs observed in prostate cancer arising in men of ME ancestry may explain the relatively good prognosis in this population. Larger studies are warranted.

The exact similarity solutions (also called as special exact solutions) of two dimensional laminar boundary layer were obtained by Blasius in 1908, however, no similarity solutions for two dimensional turbulent boundary layers have been reported in the literature. With the help of dimensional analysis and invariance principle, Prandtl mixing length $\ell=\kappa y$ for one dimensional turbulent boundary layer is extended to $\ell(x,y)=\kappa y (1-\frac{y}{\delta})\sqrt{\frac{\nu}{U\delta}} $ for the two dimensional turbulent boundary layers, furthermore, with a similarity transformation, we successfully transform the two dimensional turbulent boundary layers partial differential equations into a single ordinary differential equation $f'''+ ff''+\beta(1-f'^2)+\kappa^2[\eta^2(1-\eta)^2f''|f''|]'=0$. As an application, similarity solutions of the two dimensional turbulent boundary layer on a flat plate at zero incidence have been studied in detail. To solve the ordinary differential equation numerically, a complete Maple code is provided.

In this paper, we derive Von Koch's inequality without using the Riemann Hypothesis. As well known, Von Koch's inequality is equivalent to the Riemann Hypothesis. Namely, we show that the Riemann Hypothesis is true. Furthermore, we show that the upper limit of its can be lowered.

Road networks are monitored to evaluate their decay level and the performances regarding ride comfort, vehicle rolling noise, fuel consumption, etc. In this study, an Inertial Measurement Unit is proposed by using a low-cost three-axis Micro-Electro-Mechanical Systems accelerometer and a GPS instrument, which are connected to a Raspberry Pi Zero W board and embedded inside a vehicle to monitor indirectly the road condition. To assess the level of pavement decay, the comfort index awz defined by the ISO 2631 standard was considered. Considering 21 km of roads, with different levels of pavement decay, validation measures made using the proposed IMU, another pre-assembled IMU, and a Road Surface Profiler were performed. Therefore, comparisons between awz determined with accelerations measured on the two different IMU are made; in addition, also correlations between awz, International Roughness Index (IRI), and Ride Number (RN) were performed. The results were shown very good correlations between the awz calculated with the proposed IMU and ones in the other IMU. In addition, the correlations between awz and IRI and RN were showed promising results, considering the use and the costs of the proposed IMU as a reliable method to assess the pavements decay in road networks where the use of traditional systems is difficult and/or not cheap.

Trachsummaroma is an eye infectious disease caused by Chlamydia Trachomatis bacterium, which may lead to irreversible blindness. The disease is spread directly or indirectly by contacting a contaminated material. It can also be transmitted through the disease vector known as “Musca sorbens” or “Bazaar fly”. To curtail the spread of the disease in a population, a meaningful information on the spread and possible control of the disease is required. Mathematical modeling provides efficient tools that can be used to understand and analyze the dynamics of the disease and its control. Several compartmental epidemic models have been proposed in the literature to study the dynamics of trachoma; including SI, SIR and SEIR. However, majority of the existing trachoma models consider only person to person transmission. Thus, the information provided by such models is insufficient since they did not capture the disease vector transmission. The current study proposed a novel SEIR-SEI model that consider both person-person and vector transmission dynamics. The threshold quantity, basic reproduction number R0 is obtained using the next generation matrix, and it was proved that the disease-free equilibrium is asymptotically stable when R0 < 1, and the endemic equilibrium is globally asymptotically stable when R0 > 1. Some simulation results with the aid of mesh plots for the reproductive number as a function of two different biological parameters were obtained. Furthermore, a comprehensive sensitivity analysis is conducted to identify the influence of the individual parameters on the R0. Numerical results show that the vector contact rate has the highest sensitivity with respect to R0, and the value of R0 increases with increase in, hence, the disease can be controlled by decreasing the vector contact rate. Similarly, improving the rate of environmental hygiene and facial cleanliness will decrease the size of R0 and result in the declination of the disease transmission. Moreover, a detailed parameter estimation of the model parameters and model fitting was presented with the use of field data cases from Northern Nigeria using least-square fitting method. The study provides alternative tools that can be used for planning trachoma control program to achieve global eradication of trachoma as a public heath challenge as targeted by WHO in 2030.

Let $f\left(1\right)=1$ , and let $f(n+1)=2^{2^{f\left(n\right)}}$ for every positive integer n. We consider the following hypothesis: if a system S ⊆ {x_i · x_j = x_k : i, j, k ∈ {1, . . . , n}} ∪ {x_i + 1 = x_k : i, k ∈{1, . . . , n}} has only finitely many solutions in non-negative integers x₁, . . . , x_n, then each such solution (x₁, . . . , x_n) satisfies x₁, . . . , x_n ≤ f (2n). We prove: (1) the hypothesisimplies that there exists an algorithm which takes as input a Diophantine equation, returns an integer, and this integer is greater than the heights of integer (non-negative integer, positive integer, rational) solutions, if the solution set is finite; (2) the hypothesis implies that there exists an algorithm for listing the Diophantine equations with infinitely many solutions in non-negative integers; (3) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many rational solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has a rational solution; (4) the hypothesis implies that the question whether or not a given Diophantine equation has only finitely many integer solutions is decidable by a single query to an oracle that decides whether or not a given Diophantine equation has an integer solution; (5) the hypothesis implies that if a set $\mathfrak{M}$ ⊆ has a finite-fold Diophantine representation, then $\mathfrak{M}$ is computable.

In standard construction of hyperrational numbers using ultra-power we assume that the ultralter is selective. It makes possible toassign real value to any nite hyperrational number. So, we can consider hyperrational numbers with selective ultralter as extension of traditional real numbers. Also proved the existence of strictly monotonic or stationary representing sequence for any hyperrational number.

In this research, a novel method to investigation the transient heat transfer coefficient in a channel is suggested experimentally, in which the water flow, itself, is considered both just liquid phase and liquid-vapor phase. The experiments were designed to predict the temporal and spatial resolution of Nusselt number. The inverse technique method is non-intrusive, in which time history of temperature is measured, using some thermocouples within the wall to provide input data for the inverse algorithm. The conjugate gradient method is used mostly as an inverse method. The temporal and spatial changes of heat flux, Nusselt number, vapor quality, convection number, and boiling number have all been estimated, showing that the estimated local Nusselt numbers of flow for without and with phase change are close to those predicted from the correlations of Churchill and Ozoe (1973) and Kandlikar (1990), respectively. This study suggests that the extended inverse technique can be successfully utilized to calculate the local time-dependent heat transfer coefficient of boiling flow.

The efficient generation of high-quality random numbers is essential in the operation of cryptographic modules. The quality of a random number generator is evaluated by the min-entropy of its entropy source. Typical method used to achieve high min-entropy of the output sequence is an entropy accumulation based on a hash function. This is grounded in the famous Leftover Hash Lemma which guarantees a lower bound on the min-entropy of the output sequence. However, the hash function based entropy accumulation has slow speed in general. For a practical perspective we need a new efficient entropy accumulation with the theoretical background for the min-entropy of the output sequence. In this work, we obtain the theoretical bound for the min-entropy of the output random sequence through the very efficient entropy accumulation using only bitwise XOR operations, where the input sequences from the entropy source are independent. Moreover we examine our theoretical results by applying to the quantum random number generator that uses dark noise arising from image sensor pixels as its entropy source.

Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction. Quantum entropy in the measurements decides the quality and security of the random number generator (RNG). At the same time, it directly determines the extraction ratio of true randomness from the raw data, in other words, it obviously affects quantum random bits generating rate. In this work, we commit to enhancing quantum entropy content in the vacuum noise based quantum RNG. We have taken into account main factors in this proposal to establish the theoretical model of quantum entropy content, including the effects of classical noise, the optimum dynamical analog-digital convertor (ADC) range, the local gain and the electronic gain of the homodyne system. We demonstrate that by amplifying the vacuum quantum noise, abundant quantum entropy is extractable in the step of post-processing even classical noise excursion, which may be deliberately induced by an eavesdropper, is large. Based on the discussion and the fact that the bandwidth of quantum vacuum noise is infinite, we propose large dynamical range and moderate TIA gain to pursue higher local oscillator (LO) amplification of vacuum quadrature and broader detection bandwidth in homodyne system. High true randomness extraction ratio together with high sampling rate is attainable. Experimentally, an extraction ratio of true randomness of 85.3% is achieved by finite enhancement of the laser power of the LO when classical noise excursions of the raw data is obvious.

The paper proves that an odd composite integer $N$ can be factorized in at most $O( 0.125u(log_2N)^2)$ searching steps if $N$ has a divisor of the form $2^a{u} +1$ or $2^a{u}-1$ with $a > 1$ being a positive integer and $u > 1$ being an odd integer. Theorems and corollaries are proved with detail mathematical reasoning. Algorithms to factorize the kind of odd composite integers are designed and tested by factoring certain Fermat numbers. The results in the paper are helpful to factorize the related kind of odd integers as well as some big Fermat numbers

In this paper, we examine the weak abc conjecture and the strong abc conjecture using some functions. we attempt to discuss the possibilty that the negative consequence of the weak abc conjecture. Namely, we derive that the weak abc conjecture is not true. Additionally, we show that the strong abc conjecture is not true.

The following is the Collatz Conjecture: Suppose we begin with a positive number, multiply it by 3 and add 1 if it is odd, and divide it by 2 if it is even. Then continue doing this as long as you can. Will it matter where you start, whether you end up at the number 1? The Collatz conjecture has been studied for around 85 years. We transform the Collatz function from decimal to binary, then use the binary string's character to prove the Collatz conjecture. In addition, we use mathematics to give another interpretation to chaos, which is the ultimately periodic positive integer sequence.

In this paper, by using the q-integer, we introduce a new generalization of Fibonacci and Lucas sedenions called q-Fibonacci and q-Lucas sedenions. We present some fundamental properties of these type of sedenions such as Binet formulas, exponential generating fuctions, summation formulas, Catalan's identity, Cassini's identity and d'Ocagne's identity.

In mathematics, the Riemann hypothesis is a conjecture that the Riemann zeta function has its zeros only at the negative even integers and complex numbers with real part 1/2. Many consider it to be the most important unsolved problem in pure mathematics. It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute to carry a US 1,000,000 prize for the first correct solution. We prove the Riemann hypothesis using the Complexity Theory. Number theory is a branch of pure mathematics devoted primarily to the study of the integers and integer-valued functions. The Goldbach's conjecture is one of the most important and unsolved problems in number theory. Nowadays, it is one of the open problems of Hilbert and Landau. We show the Goldbach's conjecture is true using the Complexity Theory as well. An important complexity class is 1NSPACE(S(n)) for some S(n). These mathematical proofs are based on if some unary language belongs to 1NSPACE(S(log n)), then the binary version of that language belongs to 1NSPACE(S(n)) and vice versa.

The common dandelion uses a bundle of drag-enhancing bristles (the pappus) that enables seed dispersal over formidable distances; however, the scaling laws of aerodynamic drag underpinning pappus-mediated flight remains unresolved. In this paper, we study the aerodynamic shape of dandelion, derive the scaling law of resistance, determine the Vogel exponent. In particular, we find that the total drag coefficient is proportional to the -2/3 power of the dandelion pappus Reynolds number, and obtain the terminal velocity of the dandelion seed under gravitation field.

A multiscale mathematical model is proposed seeking to study the propagation dynamics of the Human Immunodeficiency Virus (HIV) in a group of young people between 15 and 24 years of age, through sexual contact without protection, considering the use of antiretroviral therapy (ART) and therapeutic failure. The model consists in a scale-free complex network that follows a power law, coupled with the immunological dynamics of each individual, that is, it considers the infection by the virus in the immune system of each HIV carrier, through a system of non-linear differential equations that govern the infection’s behavior in the immune system. Propagation of the virus in the network is modelled by taking into account information from the immunological status of each person. The study found that for a population to have high HIV prevalence, it is not necessary at the beginning of the simulation time for the virus to propagate rapidly. In addition, the study proves that with a higher number of sexual partners, there will be greater prevalence of HIV in the population and that the use of ART helps to control the propagation of the infection in the population. As an interesting result, it was also found that there is a higher number of HIV carriers who abandon ART than those who have access to it.

We show how every power series gives rise to a Fibonacci series and a companion series involving Lucas numbers. For illustrative purposes, Fibonacci series arising from trigonometric functions, inverse trigonometric functions, the gamma function and the digamma function are derived. Infinite series involving Fibonacci and Bernoulli numbers and Fibonacci and Euler numbers are also obtained.

We evaluate various binomial sums involving the powers of Fibonacci and Lucas numbers.

We derive new infinite series involving Fibonacci numbers and Riemann zeta numbers. The calculations are facilitated by evaluating linear combinations of polygamma functions of the same order at certain arguments.

In this paper, we present the extension of the pressure-based solver designed for the simulation of compressible and/or incompressible two-phase flows of viscous fluids. The core of the numerical scheme is based on the hybrid Kurganov— Noele — Petrova/PIMPLE algorithm. The governing equations are discretized in the conservative form and solved for velocity and pressure, with the density evaluated by an equation of state. The acoustic-conservative interface discretization technique helps to prevent the unphysical instabilities on the interface. The solver was validated on various cases in wide range of Mach number, both for single-phase and two-phase flows. The numerical algorithm was implemented on the basis of the well-known open-source Computational Fluid Dynamics library OpenFOAM in the solver called interTwoPhaseCentralFoam. The source code and the pack of test cases are available on GitHub: https://github.com/unicfdlab/hybridCentralSolvers

Physics-informed neural networks are a promising method to yield surrogate models of flow fields. We present a metamodeling technique for variable geometries based on physics-informed neural networks. The method was applied to the DU99W350 airfoil at a Reynolds number of 1×10⁵. The model predicted the Reynolds-averaged velocity and pressure field around the airfoil for arbitrary angles of attack between 10.0° and 17.5°. The model was trained with data from CFD simulations for a limited set of angles of attack. Additionally, satisfaction of the a priori known boundary conditions as well as the Reynolds-averaged Navier-Stokes equations were trained. A sensitivity analysis concerning the Reynolds number, the amount and distribution of training data, and the turbulence model was conducted showing the superiority of the pseudo-Reynolds stress method and the demand of labeled training data in the domain. The trained network was capable of predicting the developing flow separation on the suction surface and exhibited excellent agreement with CFD results even in the proximity to the wall for interpolations as well as extrapolations from the labeled data set.

A century-old scientific conundrum is solved in this paper. The Prandtl mixing length modelled plane boundary turbulent flow is described by: $\frac{du^+}{d{y^+} }+\kappa^2{y^+} ^2\left( \frac{du^+}{d{y^+} }\right)^2=1$, together with boundary condition $ {y^+} =0:\, u^+=0$. Only an approximate solution to this nonlinear ordinary differential equation (ODE) has been sought so far, however, the exact solution to this ODE has not been obtained. By introducing a transformation, $2\kappa y^+=\sinh \xi$, I successfully find the exact solution of the ODE as follows: $u^+=\frac{1}{\kappa}\ln(2\kappa {y^+} +\sqrt{1+4\kappa^2{y^+} ^2})-\frac{2{y^+} }{1+\sqrt{1+4\kappa^2{y^+} ^2}}$.

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.

In this part of the series of two papers, we extend the theorems discussed in part I for infinite series. We then use these theorems to develop distinct novel results involving the Hurwitz zeta function, Riemann zeta function, Polylogarithm and Fibonacci numbers. In continuation, we obtain some zeros of the newly developed zeta functions and explain their behaviour using plots in complex plane. Furthermore, we provide particular cases for the theorems and corollaries which show that our results generalise the currently available functions and series such as the Riemann zeta function and the geometric series. Finally, we provide four miscellaneous examples to showcase the vast scope of the developed theorems.

We study various properties of the polygonal numbers; such as their recurrence relations; fundamental identities; weighted binomial and ordinary sums; partial sums and generating functions of their powers; and a continued fraction representation for them. A feature of our results is that they are presented naturally in terms of the polygonal numbers themselves and not in terms of arbitrary integers; unlike what obtains in most literature.

The turbulent Poiseuille flow between two parallel plates is one of the simplest possible physical situations, and it has been studied intensively. In this paper, we propose a modified Prandtl-van Driest mixing length that satisfies both boundary conditions and wall damping effects. With our new formulations, we numerically solve the problem and, moreover, propose an approximate analytical solution of mean velocity. As applications of our solution, an approximate analytical friction coefficient of turbulent Poiseuille flow is proposed.

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.

The traditional sequent peak algorithm (SPA) was used to assess the reservoir volume (VR) for comparison with deficit volume, DT, (subscript T representing the return period) obtained from the drought magnitude (DM) based method with draft level set at the mean annual flow on 15 rivers across Canada. At an annual scale, the SPA based estimates were found to be larger with an average of nearly 70% compared to DM based estimates. To ramp up DM based estimates to be in parity with SPA based values, the analysis was carried out through the counting and the analytical procedures involving only the annual SHI (standardized hydrological index, i.e. standardized values of annual flows) sequences. It was found that MA2 or MA3 (moving average of 2 or 3 consecutive values) of SHI sequences were required to match the counted values of DT to VR. Further, the inclusion of mean, as well as the variance of the drought intensity in the analytical procedure, with aforesaid smoothing led DT comparable to VR. The distinctive point in the DM based method is that no assumption is necessary such as the reservoir being full at the beginning of the analysis - as is the case with SPA.

We derive the thermal noise spectrum of the Fourier transform of the electric field operator of a given wave vector starting from the quantum-statistical definitions and relate it to the complex frequency and wave vector dependent complex conductivity in a homogeneous, isotropic system of electromagnetic interacting electrons. We analyze separately the longitudinal and transverse case with their peculiarities. The Nyquist formula for vanishing frequency and wave vector, as well as its modification for non-vanishing frequencies and wave vectors follow immediately. Furthermore we discuss also the noise of the photon occupation numbers. It is important to stress that no additional assumptions at all were used in this straightforward proof.

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.

The exact similarity solutions of two dimensional laminar boundary layer were obtained by Blasius in 1908, however, for two dimensional turbulent boundary layers, no similarity solutions (special exact solutions) have ever been found. In the light of Blasius' pioneer works, we extend Blasius similarity transformation to the two dimensional turbulent boundary layers, and successfully transform the two dimensional turbulent boundary layers partial differential equations into a single ordinary differential equation. By author's Maple code, we numerically solve the ordinary differential equation and produce some useful quantities.

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 study, the field measurement-based validation of a novel sediment transport calculation method is presented. River sections with complex bed topography and inhomogeneous bed material composition highlight the need for an improved sediment transport calculation method. The complexity of the morphodynamic features can result in the simultaneous appearance of the gravel and finer sand dominated sediment transport (e.g. parallel bed armoring and siltation) at different regions within a shorter river reach. For the improvement purpose of sediment transport calculation in such complex river beds, a novel sediment transport method was elaborated. The base concept of it is the combined use of two already existing empirical sediment transport models. The method was already validated against laboratory measurements. The major goal of this study is the verification of the novel method with a real river case study. The combining of the two sediment transport models is based on the implementation of a recently presented classification method of the locally dominant sediment transport nature (gravel or sand transport dominates). The results are compared with measured bed change maps. The verification clearly refers to the meaningful improvement in the sediment transport calculation by the novel manner in case of spatially varying bed content.

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.

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.

Proteomic technology has improved at a staggering pace in recent years, with even practitioners challenged to keep up with new methods and hardware. The most common metric used for method performance is the number of peptides and proteins identified. While this metric may be helpful for proteomics researchers shopping for new hardware, this is often not the most biologically relevant metric. Biologists often utilize proteomics in the search for protein regulators that are of lower relative copy number in the cell. In this review, I re-evaluate untargeted proteomics data using a simple graphical representation of the absolute copy number of proteins present in a single cancer cell as a metric. By comparing single shot proteomics data to the coverage of the most in-depth proteomic analysis of that cell line acquired to-date we can obtain a rapid metric of method performance. Using a simple copy number metric allows visualization of how proteomics has developed in both sensitivity and overall dynamic range when using both relatively long and short acquisition times. To enable reanalysis beyond what is presented here, two available web applications have been developed for single and multi-experiment comparisons with reference protein copy number data for multiple cell lines and organisms.

Current prenatal genetic evaluation showed a significantly increase in non-invasive screening and the reduction of invasive diagnostic procedures. To evaluate the diagnostic efficacy on detecting common aneuploidies, structural chromosomal rearrangements and pathogenic copy number variants (pCNV), we performed a retrospective analysis on a case series initially analyzed by aneuvysion fluorescence in situ hybridization (FISH) and karyotyping then followed by array comparative genomic hybridization (aCGH). Of the 386 cases retrieved from the past decade, common aneuploidies were detected in 137 cases (35.5%), other chromosomal structural rearrangements were detected in four cases (1%), and pCNV were detected in five cases (1.3%). The relative frequencies for common aneuploidies suggested a under detection of sex chromosome aneuploidies. Approximately 9.5% of cases with common aneuploidies showed a mosaic pattern. Inconsistent results between FISH and karyotyping were noted in cases with pseudo-mosaicism introduced by culture artifact or variable cellular proliferation from cells with mosaic karyotypic complements under in vitro cell culture. Based on findings from this case series, cell-based FISH and karyotyping should be performed to detect common aneuploidies, structural chromosomal abnormalities, and mosaic pattern. DNA-based aCGH and reflex FISH should be performed to detect and confirm genomic imbalances and pCNV. Practice points to ensure the diagnostic accuracy and efficacy were summarized.

Spatial evaluation of flood-prone areas at the drainage basins is one of the basic strategies in the field of flood risk management. The present study aims to investigate the efficiency of the CN logistic and hydrological regression model for predicting and zoning floods. In the first stage, 13 runoff parameters, hydrologic soil groups (HSGs), slope, lithology, drainage density (DD), land curvature, elevation, distance to waterways/rivers, topographic wetness index (TWI), stream power index (SPI), rainfall, land use, and NDVI were employed. In the SCS-CN model of the drainage basin, the infiltration rate (S) and runoff amount (Q) were determined. The weights of the used layers were weighted by the AHP. Also, a flood zoning map of the drainage basin with different 5, 15, 25, and 50 year return periods was drawn by applying the weights of the layers. To ensure the accuracy of the zoning map with the logistic regression model, the ROC curve, and the area below the curve were used. The results showed that for the prediction rate, the AUC is 0.81%, indicating that the model has acceptable accuracy. The most important factors affecting flood are geological index; distance to waterways/rivers; and NDVI in the logistic regression model, and slope, DD, rainfall, and land use in the SCS-CN model respectively. 30 to 46% of the drainage basin area during 5 to 50 year periods has moderate flood potential, and 28 to 34% has high potential.

In this article, we introduce the concept of soft intervals, soft ordering and sequences of soft real numbers, and some of their structural properties are studied. The notion of soft Lebesgue measure on the soft real numbers has been introduced. Also, a correspondence relationship has been established between the soft Lebesgue measure and the classical Lebesgue measure. Furthermore, we have studied some exciting results and relations between the soft Lebesgue measure and the Lebesgue measure of soft real sets.

Reliability assessment in traditional power distribution systems has played a key role in power system planning, design, and operation. Recently, new information and communication technologies have been introduced in power systems automation and asset management, making the distribution network even more complex. In order to achieve efficient energy management, the distribution grid has to adopt a new configuration and operational conditions that are changing the paradigm of the actual electrical system. Therefore, the emergence of the cyber-physical systems concept to face future energetic needs requires alternative approaches for evaluating the reliability of modern distribution systems, especially in the smart grids environment. In this paper, a reliability approach that makes use of failure modes of power and cyber network main components is proposed to evaluate risk analysis in smart electrical distribution systems. We introduce the application of Failure Modes and Effects Analysis (FMEA) method in future smart grid systems in order to establish the impact of different failure modes on their performance. A smart grid test system is defined and failure modes and their effects for both power and the cyber components are presented. Preventive maintenance tasks are proposed and systematized to minimize the impact of high-risk failures and increase reliability.

New setting is introduced to study the global offensive alliance. Global offensive 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 offensive alliance based on strong edges. The structure of set is studied and general results are obtained. Also, some classes of neutrosophic graphs containing complete, empty, path, cycle, star, and wheel are investigated in the terms of set, minimal set, number, and neutrosophic number. Neutrosophic number is defined in new way. It’s first time to define this 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-offensive-alliance number and minimal-global-offensive-alliance-neutrosophic number. Two different types of sets namely global-offensive alliance and minimal-global-offensive alliance are defined. Global-offensive alliance identifies the sets in general vision but minimal-global-offensive alliance takes focus on the sets which deleting a vertex is impossible. Minimal-global-offensive-alliance number is about minimum cardinality amid the cardinalities of all minimal-global-offensive alliances in a given neutrosophic graph. New notions are applied in the settings both individual and family. Family of neutrosophic graphs is studied in the way that, the family only contains same classes of neutrosophic graphs. Three types of family of neutrosophic graphs including m-family of neutrosophic stars with common neutrosophic vertex set, m-family of odd complete graphs with common neutrosophic vertex set, and m-family of odd complete graphs with common neutrosophic vertex set are studied. The results are about minimal-global-offensive alliance, minimal-global-offensive-alliance number and its corresponded sets, minimal-global-offensive-alliance-neutrosophic number and its corresponded sets, and characterizing all minimal-global-offensive alliances. The connection of global-offensive-alliances with dominating set and chromatic number 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, path, 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. 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 offensive 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. It leads us to the notion of global offensive 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.

Deterministic-stochastic empirical mode decomposition (EMD) is used to obtain low-frequency (non-diffusive, i.e., background velocity) and high-frequency (diffusive, i.e., eddies) components from a Lagrangian drifter‘s trajectory. Eddy characteristics are determined from the time series of eddy trajectories from individual Lagrangian drifter such as the eddy radial scale, eddy velocity scale, eddy Rossby number, and eddy-background kinetic energy ratio. A long-term dataset of the SOund Fixing And Ranging float time series obtained near the California coast by the Naval Postgraduate School from 1992 to 2004 at depth between 150 and 600 m (http://www.oc.nps.edu/npsRAFOS/) is used as an example to demonstrate the capability of the deterministic-stochastic EMD.

The most common index for representing structural condition of the pavement is the structural number. The current procedure for determining structural numbers involves utilizing falling weight deflectometer and ground-penetrating radar tests, recording pavement surface deflections, and analyzing recorded deflections by back-calculation manners. This procedure has two drawbacks: 1. falling weight deflectometer and ground-penetrating radar are expensive tests, 2. back-calculation ways has some inherent shortcomings compared to exact methods as they adopt a trial and error approach. In this study, three machine learning methods entitled Gaussian process regression, m5p model tree, and random forest used for the prediction of structural numbers in flexible pavements. Dataset of this paper is related to 759 flexible pavement sections at Semnan and Khuzestan provinces in Iran and includes “structural number” as output and “surface deflections and surface temperature” as inputs. The accuracy of results was examined based on three criteria of R, MAE, and RMSE. Among the methods employed in this paper, random forest is the most accurate as it yields the best values for above criteria (R=0.841, MAE=0.592, and RMSE=0.760). The proposed method does not require to use ground penetrating radar test, which in turn reduce costs and work difficulty. Using machine learning methods instead of back-calculation improves the calculation process quality and accuracy.

Therapeutic proteins are used to successfully treat hemophilia, Crohn’s Disease, diabetes, and cancer. Recent product recalls have occurred because of sub-visible particle formation resulting from the inherent instability of proteins. It has been suggested that particle formation is associated with late stage processing steps of filling, shipping, and delivery. Previous works demonstrated that cavitation might occur in therapeutic vials subjected to agitation or accidentally dropped, but that mitigation can be achieved with fluid property manipulation. The goal of this research was to (1) assess the risk of cavitation under common pharmaceutical manufacturing conditions (i.e., pipe contraction and pumps), (2) establish a simple threshold criterion for when particulate will form, and (3) suggest a series of mitigation techniques based on these thresholds. To accomplish these tasks, computational fluid dynamic simulations for a variety of pipe contraction and fluid properties were performed. The results of this research show that reducing the turbulence in a fluid system will reduce the likelihood of cavitation. Additionally, threshold bounds were created that establish a definitive transition at which cavitation will occur.

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.

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

We evaluate various sums involving the powers of Fibonacci and Lucas numbers.

Turbulence is a fluid dynamic problem refractory to mathematical treatment. Examining a theoretical model of liquid water flowing in a cylinder at different Raleigh numbers, we propose a novel approach to elucidate the first stages of turbulent flows. The weakly bonded molecular assemblies of liquid water form a fluctuating branched polymer in which every micro-cluster displays different density. Against the common view of liquid water as an incompressible and continuous fluid, we suggest that the occurrence of transient local aggregates could be able to generate the vortices and eddies that are the hallmarks of turbulence. We quantify the local changes in velocity, diameter and density required to engender “obstacles” to the average flow. Then, we show how these microstructures, equipped with different Raleigh numbers and characterized by high percolation index, could generate boundary layers that contribute to micro-vortices production. We conclude that the genesis of turbulence cannot be assessed in terms of collective phenomena, rather is sustained, among many other factors, by the underrated microscopic inhomogeneities of fluids like liquid water.

An iterative outlier elimination procedure based on hypothesis testing, commonly known as Iterative Data Snooping (IDS) among geodesists, is often used for the quality control of the modern measurement systems in geodesy and surveying. The test statistic associated with IDS is the extreme normalised least-squares residual. It is well-known in the literature that critical values (quantile values) of such a test statistic cannot be derived from well-known test distributions, but must be computed numerically by means of Monte Carlo. This paper provides the first results about Monte Carlo-based critical value inserted to different scenarios of correlation between the outlier statistics. From the Monte Carlo evaluation, we compute the probabilities of correct identification, missed detection, wrong exclusion, overidentifications and statistical overlap associated with IDS in the presence of a single outlier. Based on such probability levels we obtain the Minimal Detectable Bias (MDB) and Minimal Identifiable Bias (MIB) for the case where IDS is in play. MDB and MIB are sensitivity indicators for outlier detection and identification, respectively. The results show that there are circumstances that the larger the Type I decision error (smaller critical value), the higher the rates of outlier detection, but the lower the rates of outlier identification. For that case, the larger the Type I Error, the larger the ratio between MIB and MDB. We also highlight that an outlier becomes identifiable when the contribution of the measures to the wrong exclusion rate decline simultaneously. In that case, we verify that the effect of the correlation between the outlier statistics on the wrong exclusion rates becomes insignificant from a certain outlier magnitude, which increases the probability of identification.

For a positive integer k, a radio k-coloring of a simple connected graph G = (V (G), E(G)) is a mapping | f(u) - f(v)| ≥ k +1-d (u , v ) such that f :V (G)→{0,1, 2,...} for each pair of distinct vertices u and v of G, where d(u, v) is the distance between u and v in G. The span of a radio k-coloring f, rck(f), is the maximum integer it assigns to some vertex of G. The radio k-chromatic number, rck(G) of G is min{rck(f)}, where the minimum is taken over all radio k-colorings f of G. If k is the diameter of G, then rck(G) is known as the radio number of G. In this work, we propose four algorithms (two serial algorithms and their parallel versions) which related to the radio k-coloring problem. One of them is an approximate algorithm that determines an upper bound of the radio number of a given graph. The other is an exact algorithm which finds the radio number of a graph G. The approximate algorithm is a polynomial time algorithm while the exact algorithm is an exponential time algorithm. The parallel algorithms are parallelized using the Message Passing Interface (MPI) standard. The experimental results prove the ability of the proposed algorithms to achieve a speedup 7 for 8 processors.

This article introduces a new way of using a Fibre Bragg Grating (FBG) sensor for detecting the presence and number of occupants in the monitored space in a Smart Home (SH). CO₂ sensors are used to determine the CO₂ concentration of the monitored rooms in an SH. CO₂ sensors can also be used for occupancy recognition of the monitored spaces in SH. To determine the presence of occupants in the monitored rooms of the SH, the newly devised method of CO₂ prediction, by means of an Artificial Neural Network (ANN) with a Scaled Conjugate Gradient (SCG) algorithm using measurements of typical operational technical quantities (indoor temperature, relative humidity indoor and CO₂ concentration in the SH) is used. The goal of the experiments is to verify the possibility of using the FBG sensor in order to unambiguously detect the number of occupants in the selected room (R104) and, at the same time, to harness the newly proposed method of CO₂ prediction with ANN SCG for recognition of the SH occupancy status and the SH spatial location (rooms R104, R203, and R204) of an occupant. The designed experiments will verify the possibility of using a minimum number of sensors for measuring the non-electric quantities of indoor temperature and indoor relative humidity and the possibility of monitoring the presence of occupants in the SH using CO₂ prediction by means of the ANN SCG method with ANN learning for the data obtained from only one room (R203). The prediction accuracy exceeded 90% in certain experiments. The uniqueness and innovativeness of the described solution lie in the integrated multidisciplinary application of technological procedures (the BACnet technology control SH, FBG sensors) and mathematical methods (ANN prediction with SCG algorithm, the Adaptive Filtration with of LMS algorithm) employed for the recognition of number persons and occupancy recognition of selected monitored rooms of SH.

We evaluate some binomial cubic Fibonacci sums.

By imposing the condition of non-vanishing expectation values for the amplitude and phase of field operators, pure quantum states are identified composed of two consecutive number states. These pure states also deliver noise-free radiation modes restricting the “half-photon noise” to the expectation value of the lowest level of dynamic and coherent number states. As a result, instantaneous phase-sensitive amplification of photons is easily controlled and direct evaluation of time or distance - varying wavefront distributions of photons and phases can be carried out for sub-Poissonian distributions of photons without the need for quasi-probabilities.

Classical enzyme kinetics are summarized and linked with modern discoveries here. The time course of sequential catalytic events by biological macromolecular enzyme is analyzed at the molecular level; the relationships between catalytic efficiency (turnover number), catalytic rate/velocity, the amount of time taken and physical/biochemical conditions of the system are discussed. This writing tries to connect the microscopic molecular behavior of enzyme to kinetic data obtained in experiment, and the hypothesis proposed here provide an interpretation to previous experimental observations and can be testified by future experiments.

The lightcone gauge is a set of what are called the observational coordinates adapted to our past lightcone. We develop this gauge by producing a perturbed spacetime metric that describes the geometry of our past lightcone where observations are usually obtained. We connect the produced observational metric to the perturbed Friedmann-Lema\^itre-Robertson-Walker metric in the standard general gauge or what is the so-called 1+3 gauge. We derive the relations between these perturbations of spacetime in the observational coordinates and those perturbations in the standard metric approach, as well as the dynamical equations for the perturbations in observational coordinates. We also calculate the observables in the lightcone gauge and re-derive them in terms of Bardeen potentials to first order. A verification is made of the observables in the perturbed lightcone gauge with those in the standard gauge. The advantage of the method developed is that the observable relations are simpler than in the standard formalism, and they are expressed in terms of the metric components which in principle are measurable. We use the perturbed lightcone gauge in galaxy surveys and the calculations of galaxy number density contrast. The significance of the new gauge is that by considering the null-like light propagations the calculations are much simpler due to the non-consideration of the angular deviations.

Mechanisms for somatic chromosomal mosaicism (SCM) and chromosomal instability (CIN) are incompletely understood. During SNP-array molecular karyotyping and bioinformatic analyses of children with neurodevelopmental disorders and congenital malformations (n=612), we observed colocalizaion of regular chromosomal imbalances or copy number variations (CNV) with mosaic ones (n=47 or 7.7%). Analyzing molecular karyotyping data and pathways affected by CNV burdens, we proposed a mechanism for SCM/CIN, which had been designated as “chromohelkosis” (from the Greek chromosome ulceration/open wound). Briefly, structural chromosomal imbalances are likely to cause local instability (“wreckage”) at the breakpoints, which results either to partial/whole chromosome loss (e.g. aneuploidy) or elongation of duplicated regions. Accordingly, a function for classical/alpha satellite DNA (protection from the wreckage towards the centromere) has been hypothesized. Since SCM and CIN are ubiquitously involved in development, homeostasis and disease (e.g. prenatal development, cancer, brain diseases, aging), we have metaphorically (ironically) designate the system explaining chromohelkosis contribution to SCM/CIN as the cytogenomic “theory of everything” like the homonymous theory in physics inasmuch as it might explain numerous phenomena in chromosome biology. Recognizing possible empirical and theoretical weaknesses of this “theory”, we nevertheless believe that studies of chromohelkosis-like processes are required to understand structural variability and flexibility of the genome.

To investigate the influence of supplemental lighting intensity on the production of cut gerbera during Canada’s supplemental lighting season (November to March), trials were carried out at a research greenhouse. Five supplemental LED light intensity (LI) treatments provided canopy-level photosynthetic photon flux densities (PPFD) ranging from 41 to 180 µmol·m-2·s-1. With a 12-h photoperiod, the treatments provided 1.76 to 7.72 mol·m-2·d-1 of supplemental light. Two cultivars of cut gerbera (Gerbera jamesonii H. Bolus ex Hook.f) were used to evaluate vegetative growth and flower production. Plugs of ‘Ultima’ were assessed for vegetative growth and rate of flower development. There were minor LI treatment effects on number of leaves and chlorophyll content index and flowers from plants under the highest vs. lowest LI matured 10% faster. Reproductively mature ‘Panama’ plants were assessed for flower yield and quality. ‘Panama’ flowers from the highest LI treatment had shorter stems than the three lowest LI treatments, flowers from the middle LI treatment had larger diameter than the other treatments. Flowers from the lowest LI treatment had lower fresh mass than the three highest LI treatments. There were linear relationships between LI and numbers of flowers harvested, with the highest LI treatment producing 10.3 and 7.0 more total and marketable flowers per plant than the lowest LI treatment. In general, increasing levels of supplemental light had only minor effects on vegetative growth (young plants) and size and quality of harvested flowers (mature plants) but flowers from plants grown under higher LIs were more numerous and matured faster.

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.

The complex interplay among pathogens, host factors, and the integrity and composition of the endogenous microbiome determine the course and outcome of gastrointestinal infections. The model organism Yersinia entercolitica (Ye) is one of the five top frequent causes of bacterial gastroenteritis based on the Epidemiological Bulletin of the Robert Koch Institute (RKI) published on September 10, 2020. A fundamental challenge in predicting the course of an infection is to understand whether co-infection with two Yersinia strains differing only in their capacity to resist killing by the host immune system may decrease the overall virulence by competitive exclusion or increase it by acting cooperatively. Herein, we study the primary interactions among Ye, the host immune system and the microbiota, and their influence on Yersinia population dynamics. The employed model considers two host compartments, the intestinal mucosa and lumen, commensal bacteria, the co-existence of wild-type and mutant Yersinia strains, as well the host immune responses. We determine four possible equilibria: the disease-free, wild-type-free, mutant-free, and co-existence of wild-type and mutant equilibrium. We also calculate the reproduction number for each strain as a threshold parameter to determine if the population may either be eradicated or persist within the host. We conclude that the infection should disappear if the reproduction numbers for each strain fall below one, and the commensal bacteria’s growth rate exceeds the pathogens’ growth rates. These findings will help inform public health control strategies. The supplement includes MATLAB source script, Maple workbook, and figures.

The optimization problem of two or more special-purpose functions of the energy system is subjected to an analysis. Based on experience of our research and general knowledge of partial solutions of energy system optimization at the level of control of production and power energy supply by energy companies in the Czech Republic, a special-purpose (cost) function has been defined. By analysing the special-purpose function, penalty and limitations have been defined. Using the fuzzy logic, a set of suitable solutions for the special-purpose function is accepted. An optimum of the special-purpose function is looked for using the simulated annealing method. The history of electricity consumption is sorted by day and by hour, representing the multidimensional data. When using the cluster analysis, type daytime diagrams of consumption are defined. Type daytime diagrams form prototypes of identified clusters. The so-called self-organizing neural network with Kohonen map attached is used to perform the cluster analysis. The result of our research is presented by an experiment.

In this article, author performs computational analysis for the generalized zeta functions by using computational software Mathematica. To achieve the purpose recently obtained difference equations are used. These difference equations have a computational power to compute these functions accurately while they can not be computed by using their known integral represenations. Several authors investigated such functions and their analytic properties, but no work has been reported to study the graphical representations and zeors of these functions. Author performs numerical computations to evaluate these functions for different values of the involved parameters. Taylor series expansions are also presented in this research.

This review is a first attempt at bringing together various concepts from research on wall- and magnetically-bounded turbulent flows. Brief reviews of both fields are provided: The main similarities identified are coherent (turbulent) structures, flow generation and transport barriers. Examples are provided and discussed.

Measles is a highly contagious airborne disease that is endemic in many developing countries with low levels of vaccination coverage. In this paper, we propose a deterministic compartmental mathematical model for measles disease dynamics. We establish the global stability conditions for the disease-free and endemic equilibria using the Lyapunov function stability method. \textcolor{red}{Using arbitrary parameters it is obtained that the proposed model exhibits forward bifurcation}. Numerical integration using MATLAB software was used to simulate the model solution of the forward problem. We calibrate the proposed model to estimate the parameters with a 95\% confidence interval (CI) using real data from Ethiopia by formulating an inverse problem. We notice that the model fits well with the real data of Ethiopia. The estimated basic reproduction number ($R_0$) is found to be $R_0=1.3973$ which proves that the disease is endemic. It is also obtained from the local sensitivity analysis that reducing the transmission rate and increasing the vaccination rate could effectively minimize the $R_0$.

Single-layer core corrugated sandwich panels generally consist of a corrugated core and two layers of panels, while multi-layer core corrugated sandwich panels are formed by stacking multiple layers of panels with multiple layers of core layers. In this study, integrated multilayer core corrugated sandwich panels with different shapes of corrugated cores (triangular, trapezoidal, and rectangular) and the different number of core layers were fabricated using 3D printing technology, and the mechanical behavior of such multilayer core corrugated sandwich panels under quasi-static three-point bending was investigated using experiments and numerical simulations. The effects of core shape and number of core layers on the bending deformation process, damage mode, load carrying capacity, and bending energy dissipation capacity of multilayer core sandwich panels are discussed. Parametric design of multilayer triangular core corrugated sandwich panels was also carried out by finite element software ABAQUS. It was found that a new multilayer corrugated sandwich panel with a multi-layer core is better than the single core shape multilayer corrugated sandwich panel in terms of bending load capacity, energy dissipation capacity and deformation capacity can be obtained through the combination design of different core shapes.

In this study, a monoethanolamine aerosol growth model was developed to investigate the aerosol growth factor. Interactions among the internal conditions in an absorber were considered in this aerosol model. Additionally, an experiment was conducted to measure aerosol particle size, for collecting in-house validation data. Sucrose was used as the aerosol nuclei instead of sulfuric acid to prevent the corrosion of equipment used in the experiment. Experimental results showed that the outlet aerosol sizes increased to the same size regardless of the sucrose concentrations. The aerosol growth model was validated using the in-house experimental data. The aerosol growth model efficiently predicted the aerosol size. For investigating aerosol growth effects, particle number concentration was determined to be the primary factor affecting aerosol growth and amine emissions. When the particle number concentration increased, the aerosol size decreased, whereas the MEA emission increased.

The object of this work is to determine the correlation on the Nusselt number on the individual rows of a four-row tubular finned heat exchanger with continuous fins with a staggered tube arrangement using CFD modelling. Correlations for calculating Darcy-Weisbach friction factors on individual tube rows were also determined. Relationships for the Nusselt number and friction factor derived for the entire exchanger based on CFD modelling were compared with those available in the literature determined using experimental data. The maximum relative differences between the Nusselt number for a four-row exchanger determined experimentally and by CFD modelling are in the range from 22% for a Reynolds number based on a tube's outside diameter of 1,000 to 30% for a Reynolds number of 13,000. The maximum relative differences between the friction factor for a four-row exchanger determined experimentally and by CFD modelling are in the range of 50% for a Reynolds number based on a tube outer diameter of 1,000 to 10% for a Reynolds number of 13,000. The CFD modeling performed shows that in the range of Reynolds numbers based on hydraulic diameters from 150 to 1,400, the Nusselt number for the first row in a four-row finned heat exchanger is about 22% to 15% higher than the average Nusselt number for the entire exchanger. In the range of Reynolds number changes based on hydraulic diameter from 2,800 to 6,000, the Nusselt numbers on the first and second rows of tubes are close to each other. Correlations on Nusselt numbers and friction factors derived for individual tube rows can be used in the design of plate-fin and tube heat exchangers used in equipment such as air-source heat pumps, automotive radiators, air-conditioning systems and in air hot-liquid coolers. In particular, the correlations can be used to select the optimum number of tube rows in the exchanger.

In 1937,German mathematician L.Collatz proposed the following conjeture:for any positive integer,if it is even,divide it by 2,if it is odd,multiply it by 3 and add 1 to get an even number.Continuing with the above rule, the final result will be 1.This paper gives a proof of this conjecture.

The mathematical modelling of reverse logistics inventory systems ignores that returned items may arrive out of sequence, i.e. with different number of remanufacturing times. Moreover, such modelling assumes that the retuned items may retain the same quality upon recovery regardless of how many times they have been previously remanufactured. This paper develops a new mathematical expression of the percentage of retuned items that can be remanufactured a finite number of times. The proposed expression is modelled as a function of the expected number of times an item can be remanufactured on its life cycle and the number of times an item can be technologically (or optimally) remanufactured based on its quality upon recovery. The model developed in this paper considers joint production and remanufacturing options. The return rate is a varying demand dependent rate, which is a decision variable with demand, product deterioration, manufacturing and remanufacturing rates being arbitrary functions of time. The model considers the initial inventory of returned items in the mathematical formulation, which enables decision makers to adjust all functions and input parameters for subsequent cycles. Illustrative examples indicate that dependent purchasing price of recovery items and the incorporation of remanufacturing investment cost significantly impact on the optimal remanufacturing policy.

The effect of biotic (e.g., growth characteristics) and a-biotic (e.g., crown closure) factors on cone production, fertility variation and gene diversity was evaluated in two consecutive years in 130 year old natural populations of Taurus cedar also called cedar of Lebanon (Cedrus libani A. Rich.). The a-biotic factors viz., altitude, temperature, aspect and rainfall varied; while some of them can be managed by cultural operations like management of crown and stand density. Impact of crown closure on cone production, fertility variation and related parameters were observed in Taurus cedar’s natural populations sampled from southern Turkey. Maximum cone production of 29 and 40/tree was recorded with full crown closure in two consecutive years by large differences among individuals within crown closure class. For instance, cone productions were between 10 and 67 in full crown closure of first year. The sibling coefficient, which is a measure of the fertility variation in a stand, was the highest (1.16) for full crown closure in the first (meaning 86% fertile trees) and the second year (1.55, 65%), while it was the lowest for medium crown closure (1.09, 92%) in both years. Gene diversity decreased from a degraded patch (0.987) to that with full crown closure (0.984). Results of variance analysis showed significant (p≤0.05) difference between crown closure classes for cone production within second year, and between years. Significant positive (p0.05) correlations were noted between years for cone production (r=0.22), and between cone production and crown closure in first and second years (r=0.29). However, growth characteristics had no effective on cone productions in individual crown closure classes, while there were significant (p0.05) correlations between diameter at breast height and cone production for both years (r= 0.15 and 0.17) in pooled populations.

The divination function of China's Yijing has led to its circulation for thousands of years. In our exploration of Yijing's characteristics using big data, we have discovered variations in results between the coin toss method and the ancient yarrow-stalk method of divination, known as "the number for the great expansion method of divination(大衍之数)". The yarrow-stalk method serves as the fundamental method of divination in Yijing and continues to hold significance in studying the essential characteristics of Yijing. Despite the complexity of yarrow calculations, advancements in computer technology and big data have simplified its application. By employing the yarrow-stalk method, we simulated changes in the 64 hexagrams, calculated probabilities and proportions of hexagram alterations, and derived fundamental characteristics and patterns of hexagrams. Additionally, we constructed the spatial representation of lines and hexagrams. Through a binary system rearrangement, we created a 64x64 matrix illustrating hexagram transformations. Subsequently, we generated 100 million random hexagrams and analyzed line and hexagram changes accordingly. Our findings indicate the following:(1) Big data analysis reveals evident asymmetry in the hexagrams obtained through the yarrow-stalk method, with a triangular fractal characteristic forming the background.(2) Each of the 64 hexagrams exhibits a distinct probability distribution when transforming into other hexagrams, which can be categorized into five types.(3)The occurrence probabilities of Laoyang, Laoyin, Shaoyang, and Shaoyin are 18.61%, 6.387%, 31.38%, and 43.62% respectively. The probabilities of Yin and Yang occurrences are nearly equal, each close to 50%. However, the probability of Laoyang is approximately three times higher than that of Laoyin.(4) Visualized and analyzed the characteristics of hexagram changes greater than 100000 times using 3D statistical maps and Sankey diagram.These results demonstrate that the yarrow-stalk method effectively unveils the characteristics and underlying patterns of the 64 hexagrams. This study provides a novel approach for scientifically exploring the internal laws governing the 64 hexagrams in Yijing.

We present a class of efficient parametric closure models for 1D stochastic Burgers equations. Casting it as statistical learning of the flow map, we derive the parametric form by representing the unresolved high wavenumber Fourier modes as functionals of the resolved variables’ trajectory. The reduced models are nonlinear autoregression (NAR) time series models, with coefficients estimated from data by least squares. The NAR models can accurately reproduce the energy spectrum, the invariant densities, and the autocorrelations. Taking advantage of the simplicity of the NAR models, we investigate maximal and optimal space-time reduction. Reduction in space dimension is unlimited, and NAR models with two Fourier modes can perform well. The NAR model’s stability limits time reduction, with a maximal time step smaller than that of the K-mode Galerkin system. We report a potential criterion for optimal space-time reduction: the NAR models achieve minimal relative error in the energy spectrum at the time step where the K-mode Galerkin system’s mean CFL number agrees with the full model’s.

Unsupervised physics-informed deep learning can be used to solve computational physics problems by training neural networks to satisfy the underlying equations and boundary conditions without labeled data. Parameters such as network architecture and training method determine the training success. However, the best choice is unknown a priori as it is case specific. Here, we investigated network shapes, sizes, and types for unsupervised physics-informed deep learning of the two-dimensional Reynolds-averaged flow around cylinders. We trained mixed-variable networks and compared them to traditional models. Several network architectures with different shape factors and sizes were evaluated. The models were trained to solve the Reynolds-averaged Navier-Stokes equations incorporating Prandtl's mixing length turbulence model. No training data were deployed to train the models. The superiority of the mixed-variable approach was confirmed for the investigated high Reynolds number flow. The mixed-variable models were sensitive to the network shape. For the two cylinders, differently deep networks showed superior performance. The best fitting models were able to capture important flow phenomena such as stagnation regions, boundary layers, flow separation, and recirculation. We also encountered difficulties when predicting high Reynolds number flows without training data

Malaria is a critical fevered illness caused by Plasmodium parasites transmitted among people through the bites of infected female Anopheles mosquitoes. Public awareness about the disease is important for the control of disease. This article proposes a mathematical model to study the dynamics of malaria disease transmission with the influence of awareness-based control interventions. We found two equilibria of the model, namely the disease-free and endemic equilibrium. Disease-free equilibrium is stable globally if basic reproduction number (R0) is less than unity (R0&lt;1). Some basic mathematical properties of the proposed model, such as nonnegativity and boundedness of solutions, the feasibility of the equilibrium points and their stability properties, have been studied. Finally, we adopted optimal control to minimize the cost of disease control and solve the problem by formulating Hamiltonian functional. The optimal use of insecticides for controlling the mosquito population is determined. Numerical simulations have been provided for the confirmation of the analytical results. We conclude that media awareness with optimal control approach is best for cost-effective malaria disease management.

We generalize the dynamical analog of the Berry geometric phase setup to the quaternionic model of Avron et al. In our dynamical quaternionic system, the fast half-integer spin subsystem interacts with a slow two-degrees-of-freedom subsystem. The model is invariant under the 1:1:2 weighted SO(2) symmetry and spin inversion. There is one formal control parameter in addition to four dynamical variables of the slow subsystem. We demonstrate that the most elementary qualitative phenomenon associated with the rearrangement of the energy super-bands of our model consists of the rearrangement of one energy level between two energy superbands which takes place when the formal control parameter takes the special isolated value associated with the conical degeneracy of the semi-quantum eigenvalues. This qualitative phenomenon is of the topological origin, and is characterized by the second Chern class of the associated semi-quantum system. The correspondence between the number of redistributed energy levels and the second Chern number is confirmed through a series of examples.

In the paper it is demonstrated that a valid path to a contradiction in complex number theory exists. In the path use is made of Euler’s identity and simple trigonometry. Each step can be easily verified.

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

Prostate cancer (PC) is the most frequently diagnosed non-skin cancer in the world. Previous studies showed that genomic alterations represent the most common mechanism for molecular alterations that cause the development and progression of PC. Great efforts have been done to identify common protein-coding genetic variations; however, the impact of non-coding variations including regulatory genetic variants is not still well understood. To gain an understanding of the functional impact of genetic variants, particularly, regulatory variants in PC, we developed an integrative pipeline (AGV) that used whole genome/exome sequences, GWAS SNPs, chromosome conformation capture data, and ChIP-Seq signals to investigate the potential impact of genomic variants on the underlying target genes in PC. We identified 646 putative regulatory variants, of which 30 of them significantly altered the expression of at least one protein-coding gene. Our analysis of chromatin interactions data (Hi-C) revealed that the 30 putative regulatory variants may affect 131 coding and non-coding genes. Interestingly, our study showed the 131 protein-coding genes are involved in disease-related pathways including Reactome and MSigDB in which for most of them targeted treatment options are currently available. Together, our results provide a comprehensive map of genomic variants in PC and revealed their potential contribution to prostate cancer progression and development.

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.

Counting in terms of cycles allows modeling many processes of Nature. We make use of a slight numerical incongruence within the numbering system to find a translational mechanism which connects sequential ↔ commutative properties of assemblies. The algorithms allow picturing the logical syntax Nature uses when reading the DNA. Ordering a collection on two different properties of its members will impose two differing sequences on the members. The coordinates of a point on a plane of which the axes are the two sorting orders sidestep the logical contradiction arising from the different linear assignments. During a reorder, elements aggregate into cycles. Using an etalon collection of simple logical symbols (which are pairs of natural numbers), which we reorder, we see typical movement patterns along the path of the string of elements that are members of the same cycle. We split the {value, position} descriptions of a natural number and observe the places the unit occupies at specific instances of time among its peers, while being a member of a cycle, under different orders prevailing. Which places elements occupy among their peers, under specific order conditions, is determined by numeric properties of the natural numbers that make up the element. The model presented is therefore tautologic, and can be compared to a hybrid of sudokus with the ultimate form of Rubik‘s cube. It is necessary for the reader to do some self-education on the matter of cycles as a prerequisite to understanding the working principle of the model. The contraption being a new development, it can’t have references in literature.One cannot lose a bet on the idea that sorting and ordering a collection of elementary logical elements will turn up typical patterns and that these archetypes of patterns will be of interest to Theoretical Physics, Chemistry, Biology, Information Theory, and some other fields, too.

Due to its high specific surface area and rich porous structure, acacia-derived porous activated carbon is the most potentially effective material for wastewater treatment. This research study aimed to prepare activated carbon using Acacia erioloba seedpods as carbonaceous materials and phosphoric acid as an activating agent. The specific surface area of the prepared activated carbon sample was characterised by Brunauer–Emmett–Teller instrument. The specific surface area value was 387 m²/g. The activated carbon prepared was then sieved into three different particle sizes of 50, 100 and 200 micrometres and characterised using various analytical procedures, including proximate analysis to study moisture content, ash content, volatile matter content and fixed carbon content. The bulk density, SEM, power of hydrogen, iodine number and methylene blue number index were also investigated to determine the adsorption properties of the prepared activated carbon. Batch adsorption dynamics for the removal of organic compounds such as methylene blue and unsaturated character of fatty acid from aqueous solution were also carried out at room temperature to evaluate the prepared activated carbon's applicability in water treatment. The iodine number was 528, 638, and 554 mg/g for the 50, 100, and 200 μm activated carbon particles, respectively. From the results, the adsorption of methylene blue favoured the Freundlich adsorption model, showing higher correlation (R²) values than the Langmuir model. The results indicate that methylene blue particles were adsorbed on heterogeneous surfaces.

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.

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.

In my paper, a divisibility rule named the Queen function is de- scribed, which has been generalized for every integer and encompasses all pre- viously established divisibility rules. Subsequently, the paper discusses other areas where this function is instrumental. These include simplifying ratios, generating prime numbers, and more. Towards the end of the paper, a set of hypotheses is also presented. Among these, the most significant is the novel approach involving the application of the Queen function for prime number generation.

Investment management is a common process and practice used for achieving a desirable investment goal or outcome. Investment assessment should be carried out at various stages of project realization in accordance with capital investment volume. Investment risk management implies the effective control of all procedures and monitoring of risks in all phases of the investment project. Because of the reason that a single indicator in probability calculation of achieving optimal return from the investment does not exist, performing sufficiently reliable estimates of the quality of investments becomes a tedious task. There are many indicators, factors, and criteria required for consideration to reach the effective solution of the investment problem. Unfortunately, the systematic variation of economic situations in the marketplace stipulates the continuous and frequent changes of investment conditions and environment in which the investor should act and operate. Hence, the rules required for providing a reasonable quality of investment projects can be based only on investor’s management strategy and rely on investor’s intuition and practice. The importance of classification in investment management and decision making process is undeniable. The objects to be classified are described using assessments in accordance with various criteria which can be both quantitative and qualitative. With a competent formulation of the investment process, both methods are used in parallel. There exist various decision making approaches for the investment management, and simple additive weighting (SAW) is one of the well-known multi-criteria decision making (MCDM) methods aiming to provide an optimal decision for decision maker when solving various real-life problems, and particularly, investment problem. In this paper, fuzzy simple additive weighting (FSAW) method in group decision making is applied to undertake the capital investment expenditure for purchasing cars with the purpose of renting them to the public. The development of existing FSAW method is accomplished and this process involves the sensibility of outcomes to changes in the rate of fuzziness represented with decisions taken. Eventually, the degree of fuzziness involved in an analysis that directly attempts to model the immanent vagueness and imperfectness in particular precedency judgments made, is determined. A numerical example illustrates the importance and effectiveness of the suggested approach with the aim of ranking alternatives and hence, determining the most preferred alternative in MCDM problem.

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.

The APOE locus has garnered significant clinical interest because of its association with Alzheimer's disease (AD) and longevity. This genetic association appears across multiple genes in the APOE locus. Despite the apparent differences between AD and longevity, both conditions share a commonality of aging-related changes in mitochondrial function. This commonality is likely due to accumulative biological effects, partly exerted by the APOE locus. In this study, we investigated changes in mitochondrial structure/function-related markers using oxidative stress-induced human cellular models and postmortem brains (PMBs) from individuals with AD and normal controls. Our results reveal a range of expressional alterations, either up- or down-regulated, in these genes in response to oxidative stress. In contrast, we consistently observed an upregulation of multiple APOE locus genes in all cellular models and AD PMBs. Additionally, the effects of AD status on mitochondrial DNA copy number (mtDNA CN) varied depending on APOE genotype. Our findings imply a potential coregulation of APOE locus genes, possibly occurring within the same topologically associating domain (TAD) of the 3D chromosome conformation. The coordinated expression of APOE locus genes could impact mitochondrial function, contributing to the development of AD or longevity. Our study underscores the significant role of the APOE locus in modulating mitochondrial function and provides valuable insights into the underlying mechanisms of AD and aging, emphasizing the importance of this locus in clinical research.

Fibroepithelial lesions (FL) of the breast, in particular Phyllodes tumors (PT) and fibroadenomas, pose a significant diagnostic challenge. There are no generally accepted criteria that distinguish benign, borderline, malignant PT, and FA. Combined genome-wide DNA methylation and copy number variant (CNV) profiling is an emerging strategy to classify tumors. We compiled a series of patient-derived archival biopsy specimens reflecting the FL spectrum and histological mimickers including clinical follow-up data. DNA methylation and CNVs were determined by well-established microarrays. Comparison of the patterns with a pan-cancer dataset assembled from public resources including "The Cancer Genome Atlas" (TCGA) and "Gene Expression Omnibus" (GEO) suggests that FLs form a methylation class distinct from both control breast tissue as well as common breast cancers. Complex CNVs were enriched in clinically aggressive FLs. Subsequent fluorescence in situ hybridization (FISH) analysis detected respective aberrations in the neoplastic mesenchymal component of FLs only, confirming that the epithelial component is non-neoplastic. Of note, our approach could lead to the elimination of the diagnostically problematic category of borderline PT and allow for optimized prognostic patient stratification. Furthermore, the identified recurrent genomic aberrations such as 1q gains (including MDM4), CDKN2a/b deletions and EGFR amplifications may inform therapeutic decision-making.

We study electrohydrodynamic (EHD) linear (in)stability of microfluidic channel flows, i.e. the stability of interface between two-shearing viscous (perfect) dielectrics exposed to an electric field in large aspect ratio microchannels. We then apply our results to particular microfluidic systems known as electroosmotic (EO) pumps. Our results are detailed analytical expressions for the growth rate of two-dimensional EHD modes in Couette-Poiseuille flows in the limit of small Reynolds number ($R$); the expansions to both zeroth- and first-order-$R$ are considered. The growth rates are complicated functions of viscosity-, height-, density- and dielectric-constant ratio, as well as of wavenumbers and voltages, and to our knowledge have not been presented before in literature. To make the results more useful, e.g., for voltage-control EO pump operations, we also derive equations for the impending voltages of the neutral stability curves that divide stable from unstable regions in voltage-wavenumber stability diagrams. The voltage equations and the stability diagrams are given for all wavenumbers. We finally outline the flow regimes in which our first-order-$R$ voltage corrections could potentially be experimentally measured. Our work gives the insight into the coupling mechanism between electric field and shear flow in parallel-planes channel flows, correcting an erroneous attempt from literature. Our general analysis enables us also to refine the renowned instability mechanism due to viscosity stratification, i.e., the case of pure shear instability, when the first-order-$R$ voltage correction equals zero.

Mathematical modeling is crucial in investigating the pandemic of the ongoing coronavirus disease (COVID-19). The primary target area of the SARS-CoV-2 virus is epithelial cells in the human lower repertory track. During this viral infection, infected cells can initiate innate and adaptive immune responses to viral infection. Immune response in COVID -19 infection can lead to longer recovery time and more severe secondary complications. We formulate a target cell limited mathematical model by incorporating a saturation term for SARS-CoV-2 infected epithelial cell loss reliant on infected cell levels. Forward and backward bifurcation between disease-free and endemic equilibrium points has been analyzed. Global stability of both disease-free and endemic equilibrium is provided. We have seen that the disease-free equilibrium is globally stable for $R_0<1$, and endemic equilibrium exists and is globally stable for $R_0>1$. Impulsive application of drug dosing has been applied for the treatment of covid-19 patients. Also, the dynamics of the impulsive system are discussed when a patient takes drug holidays. The numerical simulations are performed in support of our analytical findings and for the qualitative analysis of the system's dynamics with and without impulse drug dosing.

The accurate identification of the primary tumor origin in metastatic cancer cases is crucial for guiding treatment decisions and improving patient outcomes. Copy Number Alterations (CNA) have emerged as valuable genomic markers for predicting the origin of metastases. This research article presents a comprehensive analysis of CNA-based prediction models in metastatic cancer. The study utilizes a dataset comprising CNA profiles from twenty different cancer types and employs advanced AI-based techniques for prediction. The research workflow consists of two models. The first is convolution network-based, while the other is a multi-stage model. In the first stage, a RELU model is developed to differentiate between 16 cancer types, considering their CNA, chromosome location, strand, and overall location. The second stage involves building specialized models to detect differences between cancer types within the same location or organs, such as brain lower-grade glioma and glioblastoma multiforme. Both generalized models achieve an overall accuracy of over 90%, while the specialized models achieve an accuracy of approximately 95% with minimal loss values. The results demonstrate the potential of AI-based approaches utilizing CNA data for improved diagnosis and personalized treatment strategies in metastatic cancer. This research establishes a solid foundation for future advancements in the field, paving the way for more effective and targeted approaches in metastatic cancer management.