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.

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.

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 aim of this article is to introduce the new notion on a given graph. The notions of valued set, valued function, valued graph and valued quotient are introduced. The attributes of these new notions are studied. Valued set is about the set of vertices which have the maximum number of neighbors. The kind of partition of the vertex set to the vertices of the valued set is introduced and its attributes are studied. The behaviors of classes of graphs under these new notions are studied and the algebraic operations on these sets in the different situations get new result to understand the classes of graphs, these notions and the general graphs better and more.

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.

In this paper we exploit concepts from Information Theory to improve the classical Chvatal’s greedy algorithm for the Set Covering Problem. In particular, we develop a new greedy procedure, called Surprisal-Based Greedy Heuristic (SBH), incorporating the computation of a “surprisal” measure when selecting the solution columns. Computational experiments, performed on instances from the OR-Library, show that SBH yields a 2.5% improvement in terms of the objective function value over the Chvatal’s algorithm while retaining similar execution times, making it suitable for real-time applications. The new heuristic was also compared with Kordalewski’s greedy algorithm, obtaining similar solutions with much lower times on large instances, and Grossmann and Wool’s algorithm for unicost instances, where SBH obtained better solutions.

In this paper we prove that if the product $X^{n}$ of a space $X$ has some tightness-type properties, then the space of permutation degree ${\sf SP^{n}}X$ also has these properties. It is proved that the set tightness (resp. $T$-tightness) of the space of permutation degree ${\sf SP^{n}}X$ is equal to the set tightness (resp. $T$-tightness) of the product $X^{n}$.

Reliable and accurate flood prediction is a challenging task in poorly gauged basins due to data scarcity. Data is an essential component of any AI/ML model today, and the performance of such models hugely depends on the availability of sufficient amount of trusted, representative data. However, unlike a few well-studied rivers, most of the rivers in developing countries are still insufficiently monitored, which significantly hinges the design and development of advanced flood prediction models and early warning systems. This paper presents a multi-modal, sensor-based and near-real time river monitoring system to produce a multi-feature data set for the Kikuletwa river in Northern Tanzania, an area that heavily suffers from frequent floods. Our deployed system, which gather information about river depth levels and weather at several locations, aims at widening the ground truth of the river characteristics and eventually improve the accuracy of flood predictions. We provide details on the monitoring system used to gather the data as well as report on the methodology and the nature of the data. Finally, we present the relevance of the data set in the context of flood prediction, discussing the most suitable AI/ML-based forecasting approaches, while also highlighting some applications of the data set beyond flood warning systems.

Work done by us shows that rough topology is a good tool for dealing with things that happen in the real world. The concept of ”basis” has been used to show out the deciding elements of the recent outbreak of COVID-19 that was reported all over the world.

One of matrix equalities composed of multiple products of matrices and their generalized inverses is given by $A_1B_1^{-}A_2B_2^{-} \cdots A_kB_k^{-}A_{k+1}= A$ where $A_1$, $B_1$, $A_2$, $B_2$, $\ldots$, $A_k$, $B_k$, $A_{k+1}$, and $A$ are given matrices of appropriate sizes, and $B_1^{-}$, $B_2^{-}$, $\cdots$, $B_k^{-}$ are generalized inverses of matrices. The cases for $k = 1, 2$ and their special forms were properly approached in the theory of generalized inverses of matrices. In this note, the author presents an algebraic procedure to derive explicit necessary and sufficient conditions for the equality with $k = 3$ to always hold using certain rank equalities for the block matrices constructed by the given matrices, and then mention a key step of extending the previous work to a general situation.

This work analyzes a new indoor laboratory data set looking at early fire indicators in controlled and realistic experiments representing different incipient fire scenarios. The experiments were performed within the confines of an indoor laboratory setting using multiple distributed sensor nodes on different room positions. Each sensor node collected data of particulate matter (PM), volatile organic compounds (VOC), CO, CO2, H2, UV, air temperature and humidity in terms of a multivariate time series. These data hold immense value for researchers within the machine learning and data science communities who are keen on exploring innovative advanced statistical and machine learning techniques. They serve as a valuable resource for the development of early fire detection systems. The analysis of the collected data was carried out in dependence of the manhattan distance between the fire source and the sensor node. We found that especially larger particles (> 0.5 μm) and VOCs show a significant dependency with respect to the intensity as a function of the manhattan distance to the source. Moreover, we observed differences in the propagation behavior of VOCs, PM, and CO, which are particularly relevant in incipient fire scenarios due to the presence of strand popagation effects.

In this paper, a positive answer to the open question of Fabino et al. is given, and the concept of I\c sik type set valued contractions is introduced and fixed point theorem for such contractions is established. Examples to support main theorems are given, and an application to integral inclusion is given.

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.

Based on the definition of double fuzzy relations, two types of new rough set models are constructed, which are multi-granulation double fuzzy rough sets called optimistic and pessimistic multi-granulation double fuzzy rough sets, and some of their properties were studied. In addition, we study the relationship between optimistic and pessimistic multi-granulation double fuzzy rough sets and double fuzzy rough sets.

Soil quality is related to food security and human survival and development. In recent years, due to the acceleration of urbanization and the increase of abandoned land, land degradation occurs, poor topsoil quality. In this study, the minimum data set (MDS) was constructed through principal component analysis (PCA) to determine the indicator data set for evaluating topsoil quality in Tieling County, China. In addition, the soil quality index (SQI) was calculated to analyze the spatial distribution characteristics and influencing reasons of topsoil quality in Tieling County. The re-sults showed that MDS included total potassium (TK), Clay, zinc (Zn), soil organic matter (SOM), soil water content (SWC), cation exchange capacity (CEC), pH, and copper (Cu). The MDS indicators can well replace all indicators to evaluate the topsoil quality in the study area. The overall soil quality of Tieling County showed a trend of low in the east and high in the west, and gradually increased from the hilly area to the plain area. The evaluation results are consistent with field research, which can provide reference for other topsoil quality evaluation, and it also provide a basis for the formulation of soil quality improvement measures.

Among the various generalizations of persistent topology, the one based on rank functions and leading to indexing-aware functions appears to be particularly suited to catch graph-theoretical properties without the need for a simplicial construction and a homology computation. This paper defines and studies "simple" and "single-vertex" features in directed and undirected graphs, by which several indexing-aware persistence functions are produced, within the scheme of steady and ranging sets. The implementation of the "sink" feature and its application to trust networks provide an example of the ease of use and meaningfulness of the method.

As the problem of air pollution becomes more urgent, the precise determination of the characteristics of air pollution and the associated mechanisms of transport of pollutants becomes an increasingly urgent task. The simulation results of the Copernicus Atmospheric Monitoring Service (CAMS) [18] were used as initial data sets. The area of the Crimean Peninsula (within coordinates 44.50 latitude, 33.50 longitude) in 23 - 26 January, 2019 was chosen for the study. That time concentrations of pollutants (aerosol particles with a diameter of 2.5 (PM2.5) and 10 micrometers (PM10)) steadily increased and reached the maximum value. Four kinds of meteorological data sets were used in the work. The first and second data sets were the global NCEP/NCAR and (ERA-5) re-analyses. The third and fourth meteorological data sets were obtained using the Weather tracking and Forecasting model (WRF) as domains on high-resolution grids: 9 km and 2 km. The analysis of meteorological data sets was carried out to analyze the nature of the air masses movement in the studied region. Using the HYSPLIT model simulation was carried out to determine area of the sources of negative impact. The emissions transfer from the supposed sources of negative impact on the Crimea region is analyzed. The sensitivity of simulation the inverse and direct trajectories of air masses transfer was studied based a set of simulation results. On the basis of HYSPLIT model the simulation was carried out separately using meteorological data sets having different spatial and temporal resolutions. In general, the simulation results allowed us to conclude that the HYSPLIT model in combination with high-resolution meteorological input data of the WRF model are good to identify the sources of possible negative effects on atmospheric air located at long distances from the study site.

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.

With advances in information technology, big data, mobile communications, and robotics, digital technologies are increasingly being used in factories around the world. This digital transformation is named industry 4.0. Today, industrial companies are looking at how to adopt this era and implement these technologies 4.0 while improving their performance and generating more profits. The objective of this paper is to help companies to better choose the appropriate digital technologies according to their activities using a multi-experts-multi-criteria decision-making approach under hesitant fuzzy information. The proposed model is a generic model based on Multi-Agent Systems allowing to have an idea of the parameters necessary to apply the adopted approach. The adopted approach allows a better representation of uncertainty and subjectivity of experts’ judgments. It would be of great interest, especially, when exact quantitative data are not available. A real case company example is exposed (automotive company) towards putting into practice the proposed approach.

Nitrogen is the most commonly managed mineral nutrient in olive groves because it is essential for plant growth. The precise management of N fertilization in olive cultivation is still not fully clarified, but it is now essential for providing sustainable production. A nitrogen fertilizer ex-periment with olive trees (cv. Kalinioti) was carried out over a six-year period. Seven levels of nitrogen fertilizer given as ammonium nitrate (control, 1, 2, 3, 4, 5, and 6 kg/tree) were annually applied in order to determine the effect of nitrogen on vegetative growth, fruit set, fruit weight, yield, maturation index and leaf N,P, and K concentrations. The results indicate that, under these conditions, application of up to 4 kg NH4NO3/tree significantly increased yield to 62.5 kg/tree compared to the control. The positive effect was attributed to the initial and final fruit set increases (7.63 and 3.73%, respectively). However, the weight of 100 olives (337 g) at the same fertilizer rate was considerably lower compared to the control. Higher nitrogen rates decreased yield while increasing overall shoot growth. Nitrogen fertilization did not significantly influence the oil content of olive fruit. Fruit weight, maturation index and concentration of oil reached maximum levels in the beginning of December, indicating a suitable start to olive harvesting with reduced yield losses due to unfavorable weather conditions. With increasing fertilizer levels from 0 to 6 kg NH4NO3,/tree concentration of N in olive leaves also increased from 1.23% to 2.38%. Maximum yield was achieved at a level of 6 kg NH4NO3/tree, which corresponded to 2.01% N in leaves. The results suggest that application of 3 kg NH4NO3/tree can be recommended for table olive pro-duction due to the fact that fruit weight was not decreased, while fertilization with 4 kg NH4NO3/tree was suitable for oil olives.

A series of water diversion projects to address the uneven distribution of water resources in China involve the construction of a large number of hydraulic tunnels. As the lining structure that maintains the stability and durability of the tunnels, it is prone to durability damage during the operation process, which in turn affects the water transmission safety and water supply capacity. Therefore, it is important to evaluate the durability of hydraulic tunnel lining structure. Considering the randomness and fuzziness of the factors affecting the durability of hydraulic tunnel lining structure, this paper proposes a comprehensive evaluation model based on the coupling of set-pair analysis and extension. The G1 method and the simple correlation function method are used to determine the subjective and objective weights of the evaluation indexes respectively, and the combination weight is assigned based on the principle of minimum entropy; the set-pair analysis principle is used to establish the linkage affiliation function, calculate the comprehensive linkage affiliation of the object to be evaluated, and the maximum affiliation principle is used to judge the durability level of the hydraulic tunnel lining structure. Finally, taking a section of hydraulic tunnel as an example, the model proposed in this paper is used to calculate its durability grade as Class III, with the set-pair potential SHI(H) = 7.5856, which is consistent with the actual engineering practice, and a comparative study is done in combination with the AHP-Extenics method. It is verified that the evaluation model can scientifically and reasonably evaluate the durability of hydraulic tunnel lining structure, providing a basis for subsequent maintenance and reinforcement.

Multi-Object Tracking (MOT) is a key technology for Unmanned Aerial Vehicles (UAVs). Traditional tracking-by-detection methods firstly employ an object detector to retrieve targets in each image and then track them based on a matching algorithm. Recently, the popular multi-task learning methods has been dominating this area since they can detect targets and extract Re-Identification (Re-ID) features in a computationally efficient way. However, the detection task and the tracking task have conflicting requirements on image features, leading to the poor performance of the joint learning model compared to separate detection and tracking methods. The problem is more severe when it comes to UAV images due to the presence of irregular motion of large number of small targets. In this paper, we propose a balanced Joint Detection and Re-ID learning (JDR) network to address the MOT problem in UAV vision. To better handle the non-uniform motion of objects in UAV videos, the Set-Member Filter is applied which describes object state as a bounded set. An appearance matching cascade is then proposed based on target state set. Furthermore, a Motion-Mutation module is designed to address the challenges posed by the abrupt motion of UAV. Extensive experiments on the VisDrone-MOT2019 dataset demonstrate that our proposed model, termed as SMFMOT, outperforms state-of-the-arts by a large margin and achieves superior performance on the MOT tasks in UAV videos.

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.

The identification of fetal cells in the blood and tissues of healthy mothers raised questions about the potential alloreactive origins of various diseases, such as autoimmunity, diabetes, arteriosclerosis, and cancer. However, the extent to which alloreactivity contributes to these diseases remains unverified. This study presents a basic mathematical disease model based on the genes’ origin and immunological interactions. This model, grounded in set theory, classifies these immunological interactions based on their intrinsic, extrinsic, and allogeneic nature. Therefore, this model offers an unexpected common theoretical foundation for understanding alloreactivity, genetic diseases, and infections. Furthermore, this model provides a valuable framework for scrutinizing the role of alloreactivity in health and disease.

Based on the multiple coordination framework of “promising government-effective market-ordered society”, this paper takes 68 cases of adding elevators to old buildings as samples, and selects six conditional variables: approval optimization, financial subsidies, financing innovation, technological innovation, capable people leading and neighborhood committee guidance. Using Crisp-Set Qualitative Comparative Analysis (csQCA), this paper discusses the combination of conditions that affect the success or failure. It is found that: approval optimization and neighborhood committee guidance are sufficient conditions for the success; successful cases can be divided into three types: “political and social dual-drive type”, “market and social dual-drive type” and “ternary co-drive type”; lack of approval optimization, lack of financing innovation, and the existence of capable people leading are necessary conditions for the failure. The failure cases can be divided into “government and market double failure type” and “market failure type”.

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.

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.

Given a set of distinct non-negative integers X^n and a target certificate S in parametrized form: ∃X^k⊆X^n,∑_(x_i∈X^k)▒x_i =S (k=|X^k |,n=|X^n |). We present a polynomial solution of the subset sum problem with time complexity T≤O(kn)≤O(n^2) and space complexity S≤O(((n-1)n)/2)≤O(n^2 ), so that P = NP.

This communication explores the transition from Cognitive Behavioural Therapy (CBT) to a more holistic model, named Complex Therapy, developed by Tullio Scrimali for explaining and treating mental disorders. The Author delves into the limitations of traditional CBT and introduces an innovative framework that integrates multiple therapeutic modalities. While CBT is based on the study and modification of behaviour and cognition, Complex Therapy includes, in its focus, the theory of human relationships, the attachment theory, neuroscience, applied neuroscience, complex systems theory and ecology.Complex Therapy addresses the multifaceted nature of mental health issues by combining evidence-based techniques with personalized care strategies. The goal is to enhance patient outcomes through a tailored, comprehensive treatment plan that adapts to the evolving needs of individuals facing mental health challenges.Two innovative and original items which Scrimali has developed, which are a device for Applied Neuroscience MindLAB Set and a new botanical drug, NegEnt, are presented and discussed.The topic also describes, an original and integrated protocol, named Negative Entropy, the author has developed for treating a challenging disorder, such as schizophrenia, he renamed Entropy of Mind.

The multiobjective optimization problem is a key research direction in the field of optimization. Based on the multivariant optimization algorithm (MOA), this paper puts forward a multiobjective multivariant optimization algorithm (MMOA). A good point set is adopted for population initialization and to ensure the homogeneity of the initial solution set and avoid prematurity; global atoms are acquired by non-dominated sorting and an external archiving strategy; a nonlinear search radius is designed to balance global and local searches and enhance the convergence precision of the algorithm. Levy Flight and Sine chaotic mapping are introduced to redesign the update formula for local atoms, increase the convergence rate of the algorithm, and boost the optimization efficiency. Comparative experiments are conducted between MMOA and NSGA-II, MOEA/D, NSWOA, MOGWO, NSMFO on multiobjective test functions and an engineering example. The simulation results show that MMOA has superior convergence and diversity to the other five algorithms.

In this paper, we propose an efficient numerical method to solve the diffusive logistic model with a free boundary which is often used to simulate the spreading of the new or invasive species. The boundary movement is tracked by the level-set method, where the Hamilton-Jacobi weighted essentially nonoscillatory (HJ-WENO) scheme is utilized to capture the boundary curve embedded by the Cartesian grids via the embedded boundary method. Then the radial basis function-finite difference (RBF-FD) method is adopted to the spatial discretization and the IMEX scheme is considered for time integration. A variety of numerical examples are carried out to demonstrate the evolution of diffusive logistic model in different initial boundaries.

In this paper, we propose a method to find all efficient solutions of an interval multiple objective linear programming (IMOLP) problem with interval coefficients in the objective functions, the constraint matrix and the right-hand side vector. The set of all efficient solutions of an IMOLP problem can completely supply information to the decision makers in finding their most preferred solutions but, up to now, not all solutions of an IMOLP problem can be found by known methods. A numerical example is given to illustrate the working of the proposed method.

This study derives space travel pricing by Walrasian Equilibrium, which is logical reasoning from the general relativity theory (GRT), the accounting equation, and economic supply and demand functions. The Cobb-Douglas functions embed the endogenous space factor as new capital to form the space travel firm's production function, which is also transformed into the consumer's utility function. Thus, the market equilibrium occurs at the equivalence of supply and demand functions, like the GRT presents the equivalence between the spatial geometric tensor and the energy-momentum tensor, which explains the principles of gravity and the motion of space matter in the spacetime framework. The mathematical axiomatic set theory of the accounting equation explains the equity premium effect that causes a short-term accounting equation inequality, then reaches the equivalence by suppliers' incremental equity through the closing accounts process of the accounting cycle. On the demand side, the consumption of space travel can be assumed as a value at risk (VaR) investment to attain the specific spacetime curvature in an expected orbit. Spacetime market equilibrium is then achieved to construct the space travel pricing model. The methodology of econophysics and analogy method was applied to infer the space travel pricing by the model of profit maximization, single-minded, and envy-free pricing in unit-demand markets. A case study with simulation was conducted for empirical verification of the math models and algorithm. Results show that space travel pricing remains the principle of market equilibrium but needs to be extended to the spacetime tensor of GRT.

This paper addresses a mode-dependent state-feedback H∞ control for descriptor hybrid systems, considering both the absence and presence of actuator saturation. Firstly, the necessary and sufficient conditions for the stochastic admissibility criterion with H∞ performance ? of the closed-loop system is proposed. Given the proposed non-convex condition, the author reformulates it into linear matrix inequalities (LMIs). Then, to extend the result to the systems with actuator saturation, the actuator saturated control input is expressed as a linear combination of given state-feedback control input and a virtual control input that remains under the saturation level. To verify this expression, the set invariant condition is also suggested by using the singular mode-dependent Lyapunov function candidate. Therefore, the LMI conditions for the existence of the mode-dependent state-feedback H∞ control and the ellipsoidal shape of invariant set are successfully derived. Two numerical examples demonstrate the effectiveness of the proposed approach in optimizing H∞ performance $\gamma$ and identifying the largest invariant set.

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.

There are many problems based on solving non-autonomous differential equations of the form x¨(t)+ω2(t)x(t)=0, where x(t) represents the coordinate of a material point and ω is the angular frequency. The inverse problem involves finding the bounded coefficient ω. Continuity of the function ω(t) is not required. The trajectory x(t) is unknown, but the initial and final values of the phase variables are given. The variation principle of minimum time for the entire dynamic process allows for the determination of the optimal solution {x(t),ω(t)}. Thus, the inverse problem is an optimal control problem. No simplifying assumptions were made.

Study of differential equation theory has come a long way with applications in the various fields. In 1961, Zygmund and Calderón introduced the notion of derivatives on metric Lr which proved to be better in applications than approximate derivatives. But most of the studies involved are on fuzzy set theory, so it seems likely that intuitionistic fuzzy Lr - norm - based derivatives deserve study. In the study, the fuzzy derivative is extended to intuitionistic fuzzy derivatives with respect.to Lr - norm - based derivatives using intuitionistic fuzzy number valued functions. The efficacy of the proposed method is established by proving the associated theorems along with numerical examples. Further, the Cauchy problem is also studied with respect to intuitionistic fuzzy setting.

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.

This paper investigates reachable set estimation and state-feedback controller design for linear time-delay control system with bounded disturbances. First, by constructing an appropriate Lyapunov-Krasovskii functional, we obtained a delay-dependent condition, which determed the admissible bounding ellipsoid for the reachable set of the system we considered. Then, a sufficient condition in form of liner matrix inequalities is given to solve the problem of controller design with reachable set estimation. Finally, by minimizing the volume of the ellipsoid and solving the liner matrix inequality, we obtain the desired ellipsoid and controller gain. A comparative numerical example is given to verify the usefulness of our result.

In this article, we first introduced new types of higher separation axioms called (r,s)-GFS-regular and (r,s)-GFS-normal spaces with the help of (r,s)-generalized fuzzy semi-closed sets (briefly, (r,s)-gfsc sets) and discussed some topological properties of them. Thereafter, we defined a stronger form of (r,s)-gfsc sets called (r,s)-g*fsc sets and investigated some of its features. Moreover, we showed that (r,s)-fsc set → (r,s)-g*fsc set → (r,s)-gfsc set, but the converse may not be true. In addition, we explored new types of fuzzy generalized mappings between double fuzzy topological spaces (U, τ, τ*) and (V, η, η*), and the relationships between these classes of mappings were examined with the help of some illustrative examples. Finally, some new types of compactness via (r,s)-gfso sets were defined and the relationships between them were introduced.

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.

Optimal control is a critical tool for mechanical robotic systems, facilitating precise manipulation of dynamic processes. These processes are described through differential equations governed by a control function, addressing a time-optimal problem with bilinear characteristics. Our study utilizes the classical approach complemented by Pontryagin's Maximum Principle (PMP) to explore this inverse optimal problem. The objective is to develop an exact piecewise control function that effectively manages trajectory control while considering the effects of viscous friction. Our simulations demonstrate that the proposed control law markedly diminishes oscillations induced by boundary conditions. This research not only aims to delineate the reachability set but also strives to determine the minimal time required for the process. The findings include an exact analytical solution for the stated control problem.

Honey bee colonies rapidly decline when confined to greenhouses, increasing pollination rental costs as they need to be replaced frequently. We tested a hive system with entrances that can be manipulated to direct bees to inside or outside greenhouses containing a zucchini crop. In one greenhouse, the bees could only forage inside for 15 days; in another, bees were directed to the inside from 5 to 9 AM, after which they foraged outside. This procedure was repeated two more times in each greenhouse with new hives. Data was collected on how the number of bee flower visits affected fruit production, the frequency of flower visits, and the amount of bee brood and food in the hives. Flowers visited by bees four times or more set more and larger fruit. The frequency of flower visits by bees from the hives confined to the greenhouse was reduced after eight days; it was not reduced in the greenhouse with bees that could forage outside. Bee brood area was reduced in the colonies that were confined to the greenhouse, while it was maintained in the semiconfined hives. The hive system with controllable entrances proved effective for pollination, while causing less damage to the bees.

Scheduling and optimization have a central place in the research area of computing because it is increasingly important to achieve fully automated production processes to adjust manufacturing systems to the requirements of Industry 4.0. In this paper, we demonstrate how an automated wet-etch scheduling problem for a semiconductor industry can be solved by constraint answer set programming (CASP) and, its solver called clingcon. The considered scheduling problem includes a robot for lot transfers between the baths. CASP is a hybrid approach in automated reasoning that combines different research areas such as answer set programming, Constraint Processing and Satisfiability Modulo Theories. For a long time, exact methods such as constraint programming have displayed difficulties in solving real large-scale problem instances. Currently, the performance of state-of-the-art constrains solvers is comparatively better than a decade ago, and some complex combinatorial problems can be optimally solved. These theoretical and technical achievements open new horizons for declarative programming applications such as logistics. A successful solution to this problem is achieved and we found that in most cases tested, CASP is faster and obtains in most cases similar makespan values than solutions based on mixed integer linear programming and constraint paradigms.

Private Set Intersection (PSI) is a cryptographic method in secure multi-party computation that allows entities to identify common elements in their datasets without revealing their private data. Traditional approaches assume similar-sized datasets and equal computational power, overlooking practical imbalances. In real-world applications, dataset sizes and computational capacities often vary, particularly in the Internet of Things and mobile scenarios where device limitations restrict computational types. Traditional PSI protocols are inefficient here, as computational and communication complexities correlate with the size of larger datasets. Thus, adapting PSI protocols to these imbalances is crucial. This paper explores unbalanced PSI scenarios where one party (the receiver) has a relatively small dataset and limited computational power, while the other party (the sender) has a large amount of data and strong computational capabilities. It introduces three innovative solutions for unbalanced PSI: unbalanced PSI protocol based on Cuckoo filters, unbalanced PSI protocol based on single cloud assistance, and unbalanced PSI protocol based on dual cloud assistance, each addressing the shortcomings of the previous solution. These protocols primarily optimize database computational load, storage capacity, protocol execution time, and security. Depending on performance and security needs, different protocols can be employed for applications such as private contact discovery.