Properties of the Voronoi tessellations arising from the random 2D distribution points are reported. We applied the procedure of dividing the sides of Voronoi cells into equal or random parts to Voronoi diagrams generated by a set of randomly placed on the plane points. The dividing points were then used to construct the following Voronoi diagram. Repeating this procedure led to a surprising effect of positional ordering of Voronoi cells, reminiscent of the formation of lamellae and spherulites in linear semi-crystalline polymers and metallic glasses. Thus, we can conclude, that by applying even a simple set of rules to a random set of seeds we introduce order into an initially disordered system. At the same time, the Voronoi entropy showed a tendency to values typical for completely random patterns and did not distinguish the short-range ordering. The Voronoi entropy and the continuous measure of symmetry of the patterns demonstrated the distinct asymptotic behavior, while approaching the close saturation values with the increase of the number of the iteration steps. Voronoi entropy grew, with the number of iterations, whereas the continuous measure of symmetry of the same patterns demonstrated the opposite asymptotic behavior. The Voronoi entropy is not an unambiguous measure of order in the 2D patterns. The more symmetrical patterns may demonstrate the higher values of the Voronoi entropy.

The General Theory of Information (GTI) tells us that information is represented, processed and communicated using physical structures. The physical universe is made up of structures combining matter and energy. According to GTI, “Information is related to knowledge as energy is related to matter.” GTI also provides tools to deal with transformation of information and knowledge. We present here, the application of these tools for the design of digital autopoietic machines with higher efficiency, resiliency and scalability than the information processing systems based on the Turing machines. We discuss the utilization of these machines for building autopoietic and cognitive applications in a multi-cloud infrastructure.

Gas Path Analysis and matching turbine engine models to experimental data are inverse problems of mathematical modelling which are characterized by parametric uncertainty. This results from the fact that the number of measured parameters is significantly lower than the number of components’ performance parameters needed to describe the real engine. In these conditions, even small measurement errors can result in a high variation of results, and obtained efficiency, loss factors etc. can appear out of the physical range. The current methods of engine model identification have developed considerably to provide stable, precise and physically adequate solutions. Presented in this work is an estimation method of engine components’ parameters based on multi-criteria identification which provides stable estimations of parameters and their confidence intervals with the known measurement errors. A priori information about the engine, its parameters and performance is used directly in the regularised identification procedure. The mathematical basis for this approach is the fuzzy sets theory. Forming objective functions and scalar convolutions synthesis of these functions is used to estimate gas-path components’ parameters. A comparison of the proposed approach with traditional methods showed that its main advantage is high stability of estimation in the parametric uncertainty conditions. Regularization reduces scattering, excludes incorrect solutions which do not correspond to a priori assumptions, and also helps to implement the Gas Path Analysis at the limited number of measured parameters. The method can be used for matching thermodynamic models to experimental data, Gas Path Analysis and also adapting dynamic models for the needs of the engine control system.

We present the real number system as a natural generalization of the natural numbers. First, we prove the co-finite topology, $Cof(\mathbb N)$, is isomorphic to the natural numbers. Then, we generalize these results to describe the continuum $[0,1]$. Then we prove the power set $2^{\mathbb Z}$ contains a subset isomorphic to the non-negative real numbers, with all its defining structure of operations and order. Finally, we provide two different constructions of the entire real number line. We see that the power set $2^{\mathbb N}$ can be given the defining structure of $\mathbb R$. The constructions here provided give simple rules for calculating addition, multiplication, subtraction, division, powers and rational powers of real numbers, and logarithms. The supremum and infimum are explicitly constructed by means of a well defined algorithm that ends in denumerable steps. In section 5 we give evidence our construction of $\mathbb N$ and $\mathbb R$ are canonical; these constructions are as natural as possible. In the same section, we propose a new axiomatic basis for analysis. In the last section we provide a series of graphic representations and physical models that can be used to represent the real number system. We conclude that the system of real numbers is completely defined by the order structure of $\mathbb N$.}

In this manuscript, we first introduce some properties of r-fuzzy soft α-open sets in fuzzy soft topological spaces based on the manuscript Aygunoglu et al. (Hacet. J. Math. Stat. 2014, 43, 193-208). In addition, we define the concepts of fuzzy soft α-closure (α-interior) operators, and investigate some properties of them. Furthermore, the concept of r-fuzzy soft α-connected sets is defined and characterized with help of fuzzy soft α-closure operators. Thereafter, we introduce and study the concepts of fuzzy soft almost (weakly) α-continuous mappings, which are weaker forms of fuzzy soft α-continuous mappings, and we discuss some properties of fuzzy soft α-continuity. Moreover, we establish that fuzzy soft α-continuity → fuzzy soft almost α-continuity → fuzzy soft weakly α-continuity, but the converse may not be true. It is also we show that the composition is fuzzy soft almost α-continuous mapping if, is fuzzy soft α-continuous mapping and is fuzzy soft almost continuous mapping. Finally, some new types of compactness via r-fuzzy soft α-open sets are defined, and the relationships between them are examined.

Scanning underwater areas, using magnetometers, in search of unexploded ordnance is a difficult challenge, where machine learning methods can find a significant application. However, this requires the creation of a set enabling the training of prediction models. Such a task is difficult and costly due to the limited availability of relevant data. To meet this challenge in the article, we propose the use of numerical modeling to solve this task. The conducted experiments allow us to conclude that it is possible to obtain high compliance of the numerical model with the results of physical tests. In addition, the paper discusses the methodology of simplifying the computational model, allowing for almost three times reduction of the calculation time. In addition, in the work we present the methodology of creating an appropriate data set, enabling the generation of any number of training samples.

In this paper, we consider the relation of more than four harmonic points in a line. For this purpose, starting from the dependence of the harmonic points, Desargues’ theorems, and perspectivity, we note that it is necessary to conduct a generalization of the Desargues’ theorems for projective complete n-points, which are used to implement the definition of the generalization of harmonic points. We present new findings regarding the uniquely determined and constructed sets of H-points and their structure. The well-known fourth harmonic points represent the special case (n=4) of the sets of H-points of rank 2, which is indicated by P42.

By the study of the pattern book Ying Zao Fa Shi (building regulations of Song Dynasty, 1103 AD), while analyzing the combining and dimensioning rule of timber framework and tile work, a model self-generating program has been compiled for the first time. The operating framework has been firstly defined, while solving the issues of clustering principle, connecting method, output classification, etc. with the detailed description of algorithm theory. Taking the corner bracket set and nine-ridge roof for example, after the compilation and debug by Grasshopper, according to various input parameters, various models have been generated automatically by the plugin, proving the velocity and the veracity of the algorithm.

The complete-lattice approach to optimization problems with a vector- or even set-valued objective already produced a variety of new concepts and results and was successfully applied in finance, statistics and game theory. For example, the duality issue for multi-criteria and vector optimization problems could be solved using the complete-lattice approach, compare [11]. So far, it has been applied to set-valued dynamic risk measures (in the stochastic case), as discussed in Feinstein, Rudloff etc. (see [11], for example), but it has not been applied to deterministic calculus of variations and optimal control problems. In this paper, the following problem of set-valued optimization is considered: minimize the functional $$ \overline J_t[y]=\int_0^t \overline L(s,y(s),\dot y(s))\ ds + U_0(y(0)) $$ over all admissible arcs $y$, where $\overline L$ is the associated multifunction to a vector-valued Lagrangian $L$, the integral is in the Aumann sense and $U_0$ is the initial cost. A new concept of \emph{value function}, for which a Bellman's optimality principle holds, is introduced. Also the classical result of the Hopf-Lax formula holds for the generalized value function. Finally, a derivative with respect to the time $t$ and a directional derivative with respect to $x$ of the value function are defined, based on ideas close to the concepts in [12]. The value function is proved to be solution of a suitable Hamilton-Jacobi equation.

The Pythagorean fuzzy set (PFS), which is characterized by a membership and a non-membership degree and the square sum of them is less or equal to one, can act as an effective tool to express decision makers’ fuzziness and uncertainty. Considering that the Heronian mean (HM) is a powerful aggregation operator which can take the interrelationship between any two arguments, we study the HM in Pythagorean fuzzy environment and propose new operators for aggregating interval-valued Pythagorean fuzzy information. First, we investigate the HM and geometric HM (GHM) under interval-valued intuitionistic fuzzy environment and develop a series of aggregation operators for interval-valued intuitionistic fuzzy numbers (IVIFNs) including interval-valued intuitionistic fuzzy Heronian mean (IVIFHM), interval-valued intuitionistic fuzzy geometric Heronian mean (IVIFGHM), interval-valued intuitionistic fuzzy weighted Heronian mean (IVIFWHM) and interval-valued intuitionistic fuzzy weighted geometric Heronian mean (IVIFWGHM). Second, some desirable and important properties of these aggregation operators are discussed. Third, based on these aggregation operators, a novel approach to multi-attribute decision making (MADM) is proposed. Finally, to demonstrate the validity of the approach, a numerical example is provided and discussed. Moreover, we discuss several real-world applications of these operators within policy-making contexts.

In this paper, we observe that if X is a set and (Bin(X), □) is the semigroup of binary systems on X, then its center ZBin(X) consists of the locally-zero-semigroups and that these can be modeled as (simple) graphs and conversely. Using this device we show that we may obtain many results of interest concerning groupoids by reinterpreting graph theoretical properties and at the same time results on graphs G may be obtained by considering them as elements of centers of the semigroups of binary systems (Bin(X), □) where X = V(G), the vertex set of G.

Software fault prediction is the very consequent research topic for software quality assurance. Data driven approaches provide robust mechanisms to deal with software fault prediction. However, the prediction performance of the model highly depends on the quality of dataset. Many software datasets suffers from the problem of class imbalance. In this regard, under-sampling is a popular data pre-processing method in dealing with class imbalance problem, Easy Ensemble (EE) present a robust approach to achieve a high classification rate and address the biasness towards majority class samples. However, imbalance class is not the only issue that harms performance of classifiers. Some noisy examples and irrelevant features may additionally reduce the rate of predictive accuracy of the classifier. In this paper, we proposed two-stage data pre-processing which incorporates feature selection and a new Rough set Easy Ensemble scheme. In feature selection stage, we eliminate the irrelevant features by feature ranking algorithm. In the second stage of a new Rough set Easy Ensemble by incorporating Rough K nearest neighbor rule filter (RK) afore executing Easy Ensemble (EE), named RKEE for short. RK can remove noisy examples from both minority and majority class. Experimental evaluation on real-world software projects, such as NASA and Eclipse dataset, is performed in order to demonstrate the effectiveness of our proposed approach. Furthermore, this paper comprehensively investigates the influencing factor in our approach. Such as, the impact of Rough set theory on noise-filter, the relationship between model performance and imbalance ratio etc. comprehensive experiments indicate that the proposed approach shows outstanding performance with significance in terms of area-under-the-curve (AUC).

Contact with nature is suggested to be as an important resource for human health and well-being. Stress alleviation and reduction of mental fatigue are main instances of improvement of human health and well-being in contact with nature. Although the term restoration experience in contact with nature has been used repeatedly for concepts of stress alleviation and reduction of mental fatigue, these refer to different sets of theories and research studies. In this paper, by reviewing the nature-health related theories of Biophilia, Stress Recovery Theory, Attention Restoration Theory and Supportive Environment Theory (SET), the similarities and differences between these two concepts have been discussed. Moreover, the measurement approach instruments based on different study methodologies and aims are provided. This paper could provide information for future studies with focus on factors to be of benefit for restoration experience in design and planning of natural landscape environments with the aim of health and well-being development.

In this paper, firstly, some questionable formulas and conceptual oversights of previous reduced sigma set unscented transformation (UT) methods are revised through theoretical analysis. Then the revised UT methods based Kalman filters are used in a GPS/INS tightly-coupled system. The Kalman filter flows are the kind of square-root, since the square-root unscented Kalman filters (SRUKFs) can guarantee the stability of the system. By using the reduced sigma set SRUKFs (which contain simplex sigma set square-root unscented Kalman filter (S-SRUKF), spherical simplex sigma set square-root unscented Kalman filter (SS-SRUKF) and minimum sigma set square-root unscented Kalman filter (M-SRUKF)), the computation cost is greatly saved compared with the standard SRUKF, while the accuracy of the GPS/INS tightly-coupled system still maintained. The structure of the GPS/INS tightly-coupled system is in the form of error state, and the time updates of the state and the state covariance of SRUKFs are directly estimated without using UT, thus the computational time is also greatly saved. The pseudo-satellite is introduced to aid the system when the observation information is deficient, for example, when the GPS signal is deficient in the maneuver environment. By using the pseudo-satellite, the optimal performance of the system is guaranteed. Experiment of unmanned aerial vehicle (UAV) showed that the pseudo-satellite aided mechanism worked well.

Let  β= (((24!)!)!)!, and let {${\mathcal P}_{n^2+1}$} denote the set of all primes of the form {$n^2+1$}. Let ${\mathcal M}$ denote the set of all positive multiples of elements of the set {${\mathcal P}_{n^2+1} \cap (\beta,\infty)$}. The set {${\mathcal X}=\{0,\ldots,\beta\} \cup {\mathcal M}$} satisfies the following conditions: (1) ${\rm card}({\mathcal X})$ is greater than a huge positive integer and it is conjectured that ${\mathcal X}$ is infinite, (2)} we do not know any algorithm deciding the finiteness of ${\mathcal X}$, (3)~a~known and short algorithm for every {$n \in N$} decides whether or not {$n \in {\mathcal X}$}, (4) a known and short algorithm returns an integer~$n$ such that ${\mathcal X}$ is infinite if and only if ${\mathcal X}$ contains an element greater than $n$. The following problem is open: {\em simply define a set {${\mathcal X} \subseteq N$} such that ${\mathcal X}$ satisfies conditions (1)-(4), and \underline{we do not know any representation of~~${\mathcal X}$~~as a finite union of sets whose definitions are simpler than} \underline{the definition of ${\mathcal X}$}} {\tt (5)}. Let {$f(1)=2$}, {$f(2)=4$}, and let {$f(n+1)=f(n)!$} for every integer {$n \geqslant 2$}. For a positive integer $n$, let {$\Psi_n$} denote the following statement: {\em if a system of equations ${\mathcal S} \subseteq \Bigl\{x_i!=x_k: i,k \in \{1,\ldots,n\}\Bigr\} \cup \Bigl\{x_i \cdot x_j=x_k: i,j,k \in \{1,\ldots,n\}\Bigr\}$ has only finitely many solutions in positive integers \mbox{$x_1,\ldots,x_n$}, then each such solution \mbox{$(x_1,\ldots,x_n)$} satisfies {$x_1,\ldots,x_n \leqslant f(n)$}.} We prove that for every statement $\Psi_n$ the bound {$f(n)$} cannot be decreased. The author's guess is that the statements {$\Psi_1,\ldots,\Psi_9$} are true. We prove that the statement $\Psi_9$ implies that the set ${\mathcal X}$ of all {non-negative} integers $k$ whose number of digits belongs to {${\mathcal P}_{n^2+1}$} satisfies conditions {\tt (1)-(5)}.

Traditional gene set enrichment analysis falters when applied to large genomic domains, where neighboring genes often share functions. This spatial dependency creates misleading enrichments, mistaking mere physical proximity for genuine biological connections. Here we present Spatial Adjusted Gene Ontology (SAGO), a novel cyclic permutation-based approach, to tackle this challenge. SAGO separates enrichments due to spatial proximity from genuine biological links by incorporating the genes' spatial arrangement into the analysis. We applied SAGO to various datasets in which the identified genomic intervals are large, including replication timing domains, H3K9me3 and H3K27me3 large domains, HiC compartments and lamina associated domains (LADs). Intriguingly, applying SAGO to prostate cancer samples with large copy number alteration (CNAs) domains eliminated most of the enriched GO terms, thus helping to accurately identify biologically relevant gene sets linked to oncogenic processes, free from spatial bias.

This work is divided into two parts. In the first one the combinatorics of a new class of randomly generated objects, exhibiting the same properties as the distribution of prime numbers, is solved and the probability distribution of the combinatorial counterpart of the n-th prime number is derived, together with an estimate of the prime-counting function π(x). A proposition equivalent to the Prime Number Theorem (PNT) is proved to hold, while the equivalent of the Riemann Hypothesis (RH) is proved to be false with probability 1 (w.p. 1) for this model. Many identities involving Stirling numbers of the second kind and harmonic numbers are found, some of which appear to be new. The second part is dedicated to generalizing the model to investigate the conditions enabling both PNT and RH. A model representing a general class of random integer sequences is found, for which RH holds w.p. 1. The prediction of the number of consecutive prime pairs, as a function of the gap d, is derived from this class of models and the results are in agreement with empirical data for large gaps. A heuristic version of the model, directly related to the sequence of primes, is discussed and new integral lower and upper bounds of π(x) are found.

The objective of the paper is to introduce new similarity measure for single valued neutrosophic sets based on logarithm function. We define logarithm similarity measure and their weighted similarity measure for single valued neutrosophic sets. Then we define hybrid logarithm similarity measure and weighted hybrid logarithm similarity measure for single valued neutrosophic sets. We prove the basic properties of the proposed measures. We then define an entropy function using logarithm function to determine unknown attribute weights. We develop a novel multi attribute group decision making strategy for single valued neutrosophic sets based on the weighted hybrid logarithm similarity measure. We address an illustrative example to demonstrate the effectiveness and aptness of the proposed strategies. We conduct a sensitivity analysis of the developed strategy. We also make a comparison between the obtained results from proposed strategies and different existing strategies in the literature.

The current work reports the upper bound of the state variable of the of the Pointwise Steady Fluid Flow Approximation (PSFFA) model of non-stationary M/Ek/1 queueing system.

There are many applications of anomaly detection in IoT domain. IoT technology consists of large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT devices are highly exposed due to Internet, they frequently meet with the challenges of illegitimate accesses in the form of intrusions, anomaly, fraud, etc. Identifying these illegitimate accesses in IoT domain can be an exciting research problem. In numerous applications fuzzy clustering and rough set theory have been successfully employed. As the data generated in IoT domains are high-dimensional, the clustering methods used for lower dimensional data cannot be applied efficiently. In this article, mixed approaches consisting of nano topology and fuzzy clustering techniques are proposed for anomaly detection. First of all, the nano topology is generated to find lower dimensional apace and then a couple of well-known fuzzy clustering techniques are employed on it for the efficient anomaly detection. The effectiveness of the proposed approaches is evaluated using time-complexity analysis, experimental studies with a synthetic dataset and a real-life dataset along with comparative studies with traditional fuzzy clustering approaches namely fuzzy c-means clustering (FCM) algorithm, Gustafson-Kessel (GK) Algorithm, Gath-Geva (GG) Algorithm, Mahalanobis Distance based Fuzzy C-Means algorithm (M-FCM), and Common Mahalanobis Distance based Fuzzy C-Means algorithm (CM-FCM). Experimentally, it has been found that the proposed approaches outperform the aforesaid algorithms in terms of detection rates, accuracy rates, false alarm rates and computational times.

Finding anomalies in the real-time system is recognized as one of most challenging study in information security. It has so many applications like IoT, and Stock-Market. In any IoT system the data generated are real-time, and temporal in nature. Since due to the extreme exposure to Internet and interconnectivity of devices, the IoT systems often face issues like fraud, anomalies, intrusions etc. Discovering anomaly in such domain can be interesting. Clustering and rough set theory have been tried in many cases. Considering the time-stamp associated with IoT data, time-dependent patterns like periodic clusters can be generated which could be helpful for the efficient detection of anomalies by providing more in-depth analysis of the system. In this paper, a mixed method comprising of nano topology, a modified k-means clustering and an interval superimposition technique is used for finding fuzzy periodic clusters in the subspace generated by the nano topology. For every clusters there will be an associated sequence of time-intervals where it exists. The sequence time-intervals accompanying with each clusters may exhibit some remarkable patterns. For example, there may exist different types of periodicity namely yearly, monthly, daily, and hourly etc. For finding such fuzzy periodicity, an operation called interval-superimposition has been used. The time-intervals associated with each cluster are superimposed if they have reasonable overlapping. Each superimposed time-interval generates a fuzzy time-interval. The data instances are thought to be anomalous if they either belong to sparse clusters or don't belong to any clusters. The efficacy of the method can be assessed by means of both time-complexity analysis and comparative studies with existing clustering-based anomaly detection algorithms with a real-life and a synthetic dataset. It can been found experimentally that our method can extract anomaly with 98% of accuracy and it runs cubic time approximately.

In this paper, we introduce a new class of open sets that is called is*-open set . Also, we present the notion of is*-continuous, is*-open, is*-irresolute, is*-totally continuous, and is-contra-continuous mappings, and we investigate some properties of these mappings. Furthermore, we introduce some is*-separation axioms, and is*-mappings are related with is*-separation axioms. . .

Myocardial infarction, more commonly known as heart attack, is a huge health problem around the world. It is a result of inadequate blood supply to certain parts of the heart and death of heart muscle cells in that region. Although it has been around for a long time, newer and newer ways of probing myocardial infarction is being followed. Bioinformatics and Systems Biology are relatively recent fields to try to give new insights into myocardial infarction. Following the footsteps of others, this in silico study has tried to chime in on the investigation into myocardial infarction. The study began with the gene expression omnibus dataset uploaded to the NCBI from a whole-genome gene expression analysis carried out at Mayo Clinic in Rochester, Minnesota. From the dataset, differentially expressed genes following first-time myocardial infarction were identified and classified into up-regulated and down-regulated ones. Gene Set Enrichment Analysis (GSEA) was carried out on the up-regulated genes which were statistically significant and corresponded with the NCBI generated annotations. Protein-Protein Interaction Network for these genes was constructed. GSEA revealed 5 transcription factors, 5 microRNAs and 3 pathways significantly associated with them. From the Protein-Protein Interaction Network, 6 key proteins (hub nodes) have been identified. These 6 proteins may open a new window of opportunity for the discovery/design of new drugs for mitigating the damage caused by myocardial infarction.

The aim of this article is introduced the concept of double framed T-soft fuzzy set (DFT-soft fuzzy set) which is the combination of soft set and fuzzy set. We also defined the notions and apply this concept in BCK/BCI-algebras. By using example, we also discussed the concept of double framed T-soft fuzzy algebra (DFT-soft fuzzy algebra) and double framed B-soft fuzzy algebra (DFB-soft fuzzy algebra) and also investigated their properties. Each double framed T-soft fuzzy algebra is double framed B-soft fuzzy algebra but by using example, we proved that converse may or may not be possible.

Genomic selection (GS) can accelerate variety improvement when training set (TS) size, and its relationship with the breeding set (BS) are optimized for prediction accuracies (PA) of genomic prediction (GP) models. Sixteen GP algorithms were run on phenotypic best linear unbiased predictors (BLUPs) and estimators (BLUEs) of resistance to both fall armyworm (FAW) and maize weevil (MW) in a tropical maize panel. For MW resistance, 37% of the panel was the TS, and BS was the remainder whilst for FAW, random-based training sets (RBTS) and pedigree-based training sets (PBTS) were designed. PAs achieved with BLUPs varied from 0.66 to 0.82 for MW resistance traits, and, for FAW resistance, 0.694 to 0.714 for RBTS of 37%, and 0.843 to 0.844 for RBTS of 85%, and, these were at least two-fold those from BLUEs. For PBTS, FAW resistance PAs were generally higher than those for RBTS, except for one dataset. GP models generally showed similar PAs across individual traits whilst the TS designation was determinant since a positive correlation (R=0.92***) between TS size and PAs was observed for RBTS and, for the PBTS, it was negative (R=0.44**). This study pioneers the use of GS for maize resistance to insect pests in sub-Saharan Africa.

In the present study. At first, some properties of r-fuzzy soft β-closed sets are introduced on fuzzy soft topological spaces based on the paper Aygunoglu et al. (Hacet. J. Math. Stat. 2014, 43, 193-208). Also, we define the closure and interior operators with respect to the classes of r-fuzzy soft β-closed and r-fuzzy soft β-open sets, and investigate some of their properties. In addition, the concept of r-fuzzy soft β-connected sets is introduced and characterized with help of fuzzy soft β-closure operators. Thereafter, some properties of a fuzzy soft β-continuity are studied. Furthermore, we introduce and study the concepts of fuzzy soft almost (weakly) β-continuous functions, which are weaker forms of a fuzzy soft β-continuity. Also, the relationships between these classes of functions are specified with the help of some illustrative examples. Finally, we explore new types of fuzzy soft functions called, fuzzy soft β-irresolute (strongly β-irresolute, β-irresolute open, β-irresolute closed and β-irresolute homeomorphism) functions, and discuss some properties of them. Also, we show that fuzzy soft strongly β-irresolute → fuzzy soft β-irresolute → fuzzy soft β-continuity, but the converse may not be true.

This paper presents a two-dimensional mathematical model of compound eye vision. Such a model is useful for solving navigation issues for autonomous mobile robots on the ground plane. The model is inspired by the insect compound eye that consists of ommatidia, which are tiny independent photoreception units, each of which combines a cornea, lens, and rhabdom. The model describes the planar binocular compound eye vision, focusing on measuring distance and azimuth to a circular feature with an arbitrary size. The model provides a necessary and sufficient condition for the visibility of a circular feature by each ommatidium. On this basis, an algorithm is built for generating a training data set to create two deep neural networks (DNN): the first detects the distance, and the second detects the azimuth to a circular feature. The hyperparameter tuning and the configurations of both networks are described. Experimental results showed that the proposed method could effectively and accurately detect the distance and azimuth to objects.

Germplasm is a long-term resource management mission and investment for civilization. For both food and nutritional health, the present changing environmental scenario has become an urgent universal concern. Multiple excellent studies have been previously performed, although the advancement and innovation of practices will require the exploration of the potentiality of crop germplasm. In this study, we emphasized (i) germplasm activates, current challenges and ongoing trends of the crop germplasm, and (ii) how the system biology will be helpful to understand the complex traits such as water use efficiency (WUE), and nitrogen use efficiency (NUE) to mitigate challenges for sustainable development under growing food requirement and climate change conditions. We focused on a vision for transforming PGR into a bio-digital resource system, for the development of climate-smart crops for sustainable food production. Moreover, this review attempted to address current challenges, research gaps and describe the advanced integrated strategies that could provide a platform for future crop improvement research.

Intuitionistic fuzzy set, which can be represented using the triangular intuitionistic fuzzy number (TIFN), is a more generalized platform for expressing imprecise, incomplete and inconsistent information when solving multi-criteria decision-making problems, as well as for reflecting the evaluation information exactly in different dimensions. In this paper, the TIFN has been applied for solving some multi-criteria decision-making problems by developing a new triangular intuitionistic fuzzy geometric aggregation operator, that is the generalized triangular intuitionistic fuzzy ordered weighted geometric averaging (GTIFOWGA) operator, and defining some triangular intuitionistic fuzzy geometric aggregation operators including the triangular intuitionistic fuzzy weighted geometric averaging (TIFWGA) operator, the ordered weighted geometric averaging (TIFOWGA) operator and the hybrid geometric averaging (TIFHWGA) operator. Based on these operators, a new approach for solving multicriteria decision-making problems when the weight information is fixed has been proposed. Finally, the proposed method has been compared with some similar existing computational approaches by virtue of a numerical example to verify its feasibility and rationality.

Identifying or authenticating a computer user are necessary steps to keep systems secure on the network and to prevent fraudulent users from accessing accounts. Keystroke dynamics authentication can be used as an additional authentication method. Keystroke dynamics involves in-depth analysis of how you type on the keyboard, analysis of how long a key is pressed or the time between two consecutive keys. This field has seen a continuous growth in scientific research. In the last five years alone, about 10,000 scientific researches in this field have been published. One of the main problems facing researchers is the small number of public data sets that include how users type on the keyboard. This paper aims to provide researchers with a data set that includes how to type free text on the keyboard by 80 users. The data were collected in a single session via a web platform. The dataset contains 410,633 key-events collected in a total time interval of almost 24 hours. In similar research, most datasets are with texts written by users in English. The language in which the users wrote for this research is Romanian. This paper also provides an extensive analysis of the data set collected and presents relevant information for the analysis of the data set in future research.

A numerical study for the effect of crest width, breaking parameter and trunk permeability on hydrodynamics and flow behavior in the vicinity of rubble-mound, permeable, zero-freeboard breakwaters (ZFBs) is presented. The modified two dimensional Navier-Stokes equations for two-phase flows in porous media with a Smagorinsky model for the subgrid scale stresses were solved numerically. An immersed-boundary/level-set method was used. The numerical model was validated for the cases of wave propagation over a submerged impermeable trapezoidal bar and over a low-crested permeable breakwater. Five cases of breakwaters were examined, and the main results are: (a) The size of the crest width, B, does not notably affect the wave reflection, vorticity and currents in the seaward region of ZFBs, while wave transmission, currents in the leeward side, and mean overtopping discharge, all decrease with increasing B. A non-monotonic behavior of the wave setup is also observed. (b) As the breaking parameter decreases, wave reflection, transmission, currents, mean overtopping discharge, and wave setup decrease. This observation is also verified by relevant empirical formulas. (c) As the ZFB trunk permeability decreases, an increase of the wave reflection, currents, wave setup, and a decrease of wave transmission and mean overtopping discharge is observed.

In 1999, Molodtsov initiated the theory of soft sets as a new mathematical tool for dealing with uncertainties in many fields of applied sciences. In 2011, Shabir and Naz introduced and studied the notion of soft topological spaces, also defining and investigating many new soft properties as generalization of the classical ones. In this paper, we introduce the notions of soft separation between soft points and soft closed sets in order to obtain a generalization of the well-known Embedding Lemma to the class of soft topological spaces.

The most common liver disorder nowadays is non-alcoholic fatty liver disease(NAFLD) and it is a progressive disease that rises in severity from steatosis to nonalcoholic steatohepatitis(NASH), fibrosis and cirrhosis to increase risk of developing hepatocellular carcinoma. It is a cause of great concern as there is an estimated seventy million Americans who are currently affected by NAFLD, and this is expected to only increase because of its association with obesity and diabetes and also a lack of therapies to keep its development and progression in check. In this particular study we performed a gene set enrichment analysis(GSEA) of differentially expressed genes in a green tea against methionine-choline deficient diet in high-fat patients in the development of non-alcoholic fatty liver disease(NAFLD). The downregulated genes were used to perform an enrichment analysis and in the ARCHS4 TFs Coexpression database the most significant gene was found to be KLF5_human_tf_ARCHS4_coexpression. In the ARCHS4 Kinases Coexpression pathway database STYK1_human_kinase_ARCHS4 Coexpression was found to be the most significant gene. And finally for the upregulated genes a similar enrichment analysis was performed and in the humancy database γ-linolenate biosynthesis_Homo sapiens_PWY-6000 gene was discovered to be the most significant one. This study has used bioinformatics tools and the Enrichr software to perform a comparative analysis of differentially expressed gene sets for high-fat patients having a diet consisting of green tea against a methionine-choline deficient diet. Green tea is known to contain several antioxidants and polyphenols which provide protection against many liver diseases such as non-alcoholic fatty liver disease(NAFLD). The present study simply tries to build awareness of this to the general public and allow them to learn more about certain diets which have protective effects against liver diseases. Hopefully by implementing these in their daily lifestyles the public can gain some form of protection against these types of liver disorders.

The usage of Quantum Similarity through the equation Z = {∀θ ∈ Z → ∃s ∈ S ∧ ∃t ∈ T : θ = (s, t)}, represents a way to analyze the way communication works in our DNA. Being able to create the object set reference for z being (s, t) in our DNA strands, we are able to set logical tags and representations of our DNA in a completely computational form. This will allow us to have a better understanding of the sequences that happen in our DNA. With this approach, we can also utilize mathematical formulas such as the Euler–Mascheroni constant, regression analysis, and computational proofs to answer important questions on Quantum biology, Quantum similarity, and Theoretical Physics.

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

A time interval only description necessarily needs its own independent definitions, without one moment time coordinates to it. In this paper derived are time interval only set properties, including commutation relations, addition, multiplication and derivatives. Time interval only set commutation relations, consistent with one moment time set properties, are introduced by defining correspondence relations for these sets. Time development and equilibrium within the time interval description depend on the well-known ‘mean velocity theorem’ and the time interval version of the Legendre transform. In contrast, usually applied is only the traditional vector and one moment time coordinate kinematic approach from Newton’s laws. The main results of this paper are correspondences and time interval only set commutation relations. All other properties are derived from these results, while for the time interval only set, different from the one moment time set the canonical property is not valid. The time interval only description can be applied assuming spherical symmetric star-source radiation propagation, with finite time intervals for realistic measurement events. From time development with (a-)symmetry of time intervals, and from Curie’s principle, change can be described with a set theoretic approach. Time interval only set properties include the time interval only version of Noether charges and structure constants. A time interval only description for wave propagation, including group-velocity, for zero and non-zero mass wave particles, relates to the properties of the time interval only set. A second result in terms of the time interval only description is propagation wave energy equivalence with gravitation energy, derived from time interval only set commutation relations. A time interval approach, however including one moment time description dependence, was introduced in earlier publications of this author. In part 1 investigated are the time interval only set and its properties, a forthcoming part 2 to application of the time interval only description to specific groups of stars as emission sources.

In real-life scenario, there are many mathematical tools to handle the incomplete and imprecise data. One of them is the fuzzy approach. This article aims to contribute to the literature of fuzzy multi-objective dynamic programming issues involving the fuzzy objective functions. The piecewise quadratic fuzzy numbers characterize these fuzzy parameters. Some basic notions in the problem under the α-pareto optimal solution concept is redefined and analyzed to study the stability of the problem. Furthermore, a technique, named as enhancing decomposition approach, is presented for achieving a subset for the parametric space that contains the sameα-pareto optimal solution. For a better understanding and comprehension of the suggested concept, a numerical example is provided.

While the importance of corporate governance has been broadly acknowledged in global financial markets and academic research, how to devise a practical evaluation system is relatively unexplored. This paper attempts to refine the Corporate Governance Evaluation System (CGES), constructed by the Taiwan Stock Exchange (TWSE) since 2014. The current CGES has several debatable issues in its complicated design (e.g., it comprises over 80 indicators in different types). To resolve those issues, this study invited ten senior domain experts (including several CEOs of financial holding companies) to retrieve 13 essential criteria from the CGES in four dimensions. And this study integrates several multiple criteria decision-making (MCDM) methods (i.e., Decision-making trial and evaluation laboratory (DEMATEL), modified VIKOR, DEMATEL-based analytical network process (DANP)) and the fuzzy evaluation technique to rank the exemplary companies. The obtained ranking is consistent with the one released from the CGES in 2017. This study conducted additional experiments to ensure the robustness of the findings. The newly devised model not only supports the ranking decisions but also provides a managerial guidance for companies to pursue systematic improvements. These findings enrich the understanding of corporate governance and contribute to gaining business sustainability for financial holding companies.

The central promise of personalized medicine is individualized treatments that target molecular mechanisms underlying the physiological changes and symptoms arising from disease. We demonstrate a bioinformatics analysis pipeline as a proof-of-principle to test the feasibility and practicality of comparative transcriptomics to classify two of the most popular in vivo diet-induced models of coronary atherosclerosis, apolipoprotein E null mice and New Zealand White rabbits. Transcriptomics analyses indicate the two models extensively share dysregulated genes albeit with some unique pathways. For instance, while both models have alterations in the mitochondrion, the biochemical pathway analysis revealed, Complex IV in the electron transfer chain is higher in mice, whereas the rest of the electron transfer chain components are higher in the rabbits. Several fatty acids anabolic pathways are expressed higher in mice, whereas fatty acids and lipids degradation pathways are higher in rabbits. This reflects the differences between two translational models of atherosclerosis. This study validates transcriptome analysis as a potential method to precisely identify altered cellular and molecular pathways in atherosclerotic disease, which can be used to individualize treatment even in the absence of genetic data.

In this study, we present the concept of interval-valued fuzzy soft point and then introduce the notions of neighborhood and quasi-neighbourhood of it in interval-valued fuzzy soft topological spaces. Separation axioms in interval-valued fuzzy soft topology, so-called $q$-$T_{i}$ for $ i=0,1,2,3,4 ,$ is introduced and some of its basic properties are also studied.

It is known that the class of p-normed spaces (0 < p ≤ 1) is an important generalization of usual normed spaces with rich topological and geometrical structure, but the most of tools and general principles in nature with nonlinearity have not been developed yet, thus the main goal of this paper is to develop tools for nonlinear analysis under the framework of p-vector spaces. In particular, we first develop the general fixed point theorems which provide solutions to answer Schauder conjecture since 1930’s in the affirmative for p-vector spaces when p = 1 (which is just general topological vector spaces); then the one best approximation result for upper semi-continuous mappings is given, which is used as a powerful tool to establish fixed points for non-self set-valued mappings with either inward or outward set conditions; and finally we establish comprehensive existence results of solutions for Birkhoff-Kellogg Problems, and the general principle of nonlinear alternative by including Leray-Schauder alternative and related results. The results given in this paper not only include the corresponding results in the existing literature as special cases, but also expected to be useful tools for the study of nonlinear problems arising from theory to practice.

The influence and importance of research and development (R&D) for business sustainability have gained increasing interests, especially in the high-tech sector. However, the efforts of R&D might cause complex and mixed impacts on the financial results considering the associated expenses. Thus, this study aims to examine how R&D efforts may influence business to improve its financial performance considering the dual objectives: the gross and the net profitability. This research integrated a rough-set-based soft computing technique and multiple criteria decision-making (MCDM) methods to explore this complex and yet valuable issue. A group of public listed companies from Taiwan, all in the semiconductor sector, was analyzed as a case study. Initially, more than 30 variables were considered, and the adopted soft computing technique retrieved 14 core attributes—for the dual profitability objectives—to form the evaluation model. The importance of R&D for pursuing superior financial prospects is confirmed, and the empirical case demonstrates how to guide an individual company to plan for improvements to achieve its long-term sustainability by this hybrid approach.

Matiyasevich's theorem states that there is no algorithm to decide whether or not a given Diophantine equation has a solution in non-negative integers. Smorynski's theorem states that the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable. We prove: (1) Smorynski's theorem easily follows from Matiyasevich's theorem, (2 ) Hilbert's Tenth Problem for Q has a negative solution if and only if the set of all Diophantine equations with a finite number of rational solutions is not recursively enumerable.

We prove: (1) the set of all Diophantine equations which have at most finitely many solutions in non-negative integers is not recursively enumerable, (2) the set of all Diophantine equations which have at most finitely many solutions in positive integers is not recursively enumerable, (3) the set of all Diophantine equations which have at most finitely many integer solutions is not recursively enumerable, (4) analogous theorems hold for Diophantine equations D(x₁, …, x_p) = 0, where p ∈ N\{0} and for every i ∈ {1, …, p} the polynomial D(x₁, …, x_p) involves a monomial M with a non-zero coefficient such that x_i divides M, (5) the set of all Diophantine equations which have at most k variables (where k ≥ 9) and at most finitely many solutions in non-negative integers is not recursively enumerable.