Roughness sub-layer wind speed model for tropical wooded areas

There are few reports in the literature regarding wind speed near the ground. This work presents a model for wind speed from 4 m above the ground, based on year-round measurements in two meteorological towers. Each tower is equipped with anemometers at five heights, as well as thermometers and pressure and relative humidity sensors. The data is processed using Eureqa artificial intelligence software, which determines the functional relationship between variables using an evolutionary search technique called symbolic regression. Using this technique, models are found for each month under study, in which height and temperature are the variables that most affect wind speed. The model that best predicts the measured wind speeds is then selected. A polynomial function directly proportional to height and temperature is identified as the one that provides the best predictions of wind speed on average, within the rough sub-layer. Finally, future work is identified on testing the model at other locations.

Prime n solutions of the Brocard’s Problem

In this paper on the [1]“Brocard’s Problem” , I have worked on case when n is prime and n divides m-1. Necessary conditions on m are given in Theorem and Corollaries.I used necessary and sufficient condition of primes. Assuming that n is prime and divides m-1, I applied Inverse Laplace Transform on the obtained equation and got a polynomial function which is easier to deal with. I worked with zero of the polynomial function and got lower bound of p which was not useful as p tends to infinity, but solving quartic equation which I have given at the end could give significant upper, lower bounds of p.What would happen to those upper, lower bounds if p tends to infinity?

Threshold value estimation of journey-distance using generalized polynomial function

The present work demonstrates an experience in estimating the threshold value of journey distances travelled by transit passengers using generalized polynomial function. The threshold value of journey distances may be defined as that distance beyond which passengers might no more be interested to travel by their reported mode. A knowledge on this threshold value is realized to be useful to limit the upper-most slab of transit fare, while preparing of a length-based fare matrix table. Theoretically, the threshold value can be obtained at that point on the cumulative frequency distribution (CFD) curve of journey distances at which the maximum rate of change of the slope of curve occurs. In this work, the CFD curve of the journey distance values is empirically modelled using Newton’s Polynomial Interpolation method, which helps to overcome various challenges usually encountered while an assumption of a theoretical probability distribution is considered a priori for the CFD.

Edge Weight-Based Entropy of Magnesium Iodide Graph

Among the inorganic compounds, there are many influential crystalline structures, and magnesium iodide is the most selective. In the making of medicine and its development, magnesium iodide is considered a multipurpose and rich compound. Chemical structures and networks can be studied by given tools of molecular graph theory. Given tools of molecular graph theory can be studied for chemical structures and networks, which are considered economical with simple methodology. Edge weight-based entropy is a recent advent tool of molecular graph theory to study chemical networks and structures. It provides the structural information of chemical networks or their related build-up graphs and highlights the molecular properties in the form of a polynomial function. In this work, we provide the edge weight-based entropy of magnesium iodide structure and compute different entropies, such as Zagreb and atom bond connectivity entropies.

Determination of the variable density of the rod from natural frequencies of longitudinal vibrations

Rods of various configurations are elements of many structures and machines. Therefore, the acoustic and vibration diagnostics of such parts has been widely developed. The paper considers the problem of determining the variable density of the rod from the natural frequencies of longitudinal vibrations. It is assumed that the density changes along the axis and is described by a polynomial function. This approach allows one to determine the law of density variation from a finite set of eigenvalues. The results of the study can find applications for finding hidden defects in steel and composite rods, which arise during the production process or due to corrosion.

Analytical determination of DNA melting characteristic parameters using the optimal degree polynomial regression model

The article describes a new technique for determining two main parameters of DNA melting: the melting temperature Tm and the temperature melting range ΔT, based on the plotting of an approximating polynomial function for the DNA melting curve. An algorithm is proposed for reducing the melting curve to approximation by the fourth degree polynomial function in accordance with the physical aspect of the DNA melting process. The correctness of the optimal degree choice from the condition of minimizing the value of the Akaike’s information criterion corrected has been confirmed. Analytical expressions for calculating the values of Tm and ΔT are given oriented to a polynomial function of the fourth degree. Results comparison of applying the proposed and well-known techniques based on the experimental data is performed. The advantages of the new technique are revealed.

Annual dynamic dataset of global cropping intensity from 2001 to 2019

The cropping intensity has received growing concern in the agriculture field in applications such as harvest area research. Notwithstanding the significant amount of existing literature on local cropping intensities, research considering global datasets appears to be limited in spatial resolution and precision. In this paper, we present an annual dynamic global cropping intensity dataset covering the period from 2001 to 2019 at a 250-m resolution with an average overall accuracy of 89%, exceeding the accuracy of the current annual dynamic global cropping intensity data at a 500-m resolution. We used the enhanced vegetation index (EVI) of MOD13Q1 as the database via a sixth-order polynomial function to calculate the cropping intensity. The global cropping intensity dataset was packaged in the GeoTIFF file type, with the quality control band in the same format. The dataset fills the vacancy of medium-resolution, global-scale annual cropping intensity data and provides an improved map for further global yield estimations and food security analyses.

Dense Complete Set For NP

A sparse language is a formal language such that the number of strings of length $n$ is bounded by a polynomial function of $n$. We create a class with the opposite definition, that is a class of languages that are dense instead of sparse. We define a dense language on $m$ as a formal language (a set of binary strings) where there exists a positive integer $n_{0}$ such that the counting of the number of strings of length $n \geq n_{0}$ in the language is greater than or equal to $2^{n - m}$ where $m$ is a real number and $0 < m \leq 1$. We call the complexity class of all dense languages on $m$ as $DENSE(m)$. We prove that there exists an $\textit{NP--complete}$ problem that belongs to $DENSE(m)$ for every possible value of $0 < m \leq 1$.

Dense Complete Set For NP

A sparse language is a formal language such that the number of strings of length $n$ is bounded by a polynomial function of $n$. We create a class with the opposite definition, that is a class of languages that are dense instead of sparse. We define a dense language on $m$ as a formal language (a set of binary strings) where there exists a positive integer $n_{0}$ such that the counting of the number of strings of length $n \geq n_{0}$ in the language is greater than or equal to $2^{n - m}$ where $m$ is a real number and $0 < m \leq 1$. We call the complexity class of all dense languages on $m$ as $DENSE(m)$. We prove that there exists an $\textit{NP--complete}$ problem that belongs to $DENSE(m)$ for every possible value of $0 < m \leq 1$.