The Work Ability Index (WAI) is the most widely used questionnaire for the self-assessment of working ability. Because of its different applications, shorter versions, and widespread use in healthcare activities, it is worthwhile assessing its characteristics. The WAI was distributed online among the workers of a healthcare company; the results were compared with data contained in the workers' personal health records and with absence registers. 340 out of 575 workers (59.1%) participated; 6.5% of them reported poor work ability. Exploratory factor analysis indicated that the one-factor version best described the characteristics of the WAI. The scores of the complete WAI, the shorter form without the list of diseases, and the minimal one-item version (WAS) had equal distribution and were significantly correlated. The WAI score was inversely related to age and significantly lower in women than in men, but it was higher in night workers than in colleagues due to the probable effect of selective factors. The WAI score was also correlated with absenteeism, but no differences were found between males and females in the average number of absences, suggesting that cultural or emotional factors influence the self-rating of the WAI. Workers tended to overreport illnesses in the online survey compared to data collected during occupational health checks. Musculoskeletal disorders were the most frequently reported illnesses (53%). Psychiatric illnesses affected 21% of workers and had the greatest impact on work ability. Multilevel ergonomic and human factor intervention seems to be needed to recover the working capacity of healthcare workers.

This work (in two parts) will review the recently developed predictive modeling methodology called “4th-BERRU-PM” and its applicability to energy systems as exemplified by an illustrative application to the Polyethylene-Reflected Plutonium (acronym: PERP) OECD/NEA reactor physics benchmark. The acronym 4th-BERRU-PM designates the “Fourth-Order Best-Estimate Results with Reduced Uncertainties Predictive Modeling” methodology, which yields best-estimate results with reduced uncertainties for the first fourth-order moments (mean values, covariance, skewness, and kurtosis) of the optimally predicted posterior distribution of model results and calibrated model parameters. The 4th-BERRU-PM uses the Maximum Entropy (MaxEnt) principle to incorporate fourth-order experimental and computational information, including fourth (and higher) order sensitivities of computed model responses to model parameters, thus incorporating, as particular cases, the results previously predicted by the second-order predictive modeling methodology 2nd-BERRU-PM, and vastly generalizing the results produced by extant data assimilation and data adjustment procedures. The 4th-BERRU-PM methodology encompasses the scopes of high-order sensitivity analysis (SA), uncertainty quantification (UQ), data assimilation (DA) and model calibration (MC). The application of the 4th-BERRU-PM methodology to energy systems is illustrated by means of the above-mentioned OECD/NEA reactor physics benchmark, which is modeled using the neutron transport Boltzmann equation involving 21976 imprecisely known parameters, the solution of which is representative of “large-scale computations.” The model result (“response”) of interest is the leakage of neutrons through the outer surface of this spherical benchmark, which can be computed numerically and measured experimentally. Part 1 of this work illustrates the impact of high-order sensitivities, in conjunction with parameter standard deviations of various magnitudes, on the determination of the expected value and variance of the computed response in terms of the first four moments of the distribution of the uncertain model parameters. Part 2 of this work will illustrate the capabilities of the 4th-BERRU-PM methodology for combining computational and experimental information, up to and including forth-order sensitivities and distributional moments, for producing best-estimate values for the predicted responses and model parameters while reducing their accompanying uncertainties.

This research focuses on the Hopf bifurcation occurring at a singular point with high-order degeneracy in a class of three-dimensional systems. Based on center manifold theorem, by expanding the technique for determining singular point values of degenerate singularities in two-dimensional systems, the formal series method to determine the singular point values at the high-order degenerate critical point is discussed. Furthermore, a class of specific three-dimensional differential systems with high-order degenerate singularities is explored. By computing the singular point values and determining center conditions, we proved that a minimum of 5 small-amplitude limit cycles in the vicinity of the origin. This research provides new perspectives on the center problem and limit cycle bifurcation in high-dimensional systems with high-order degenerate singular points.

Spatio-Temporal Dynamic Mode Decomposition (STDMD) is an extension of Dynamic Mode Decomposition (DMD) designed to handle spatio-temporal datasets. It extends the framework so that it can analyze data that has both spatial and temporal variations, allowing for the extraction of spatial structures and their temporal evolution. The STDMD method extracts temporal and spatial development information simultaneously, including wavenumber, frequencies and growth rates, which is essential in complex dynamic systems. We provide a comprehensive mathematical framework for sequential and parallel STDMD approaches. We also introduce delay coordinates generalization to the presented algorithms to extend the scope of their application. The extension, labeled delay embedding STDMD allows the use of delayed data, which can be both time-delayed and space-delayed. An explicit expression of the presented algorithms in matrix form is also provided, which facilitates theoretical analysis and provides a solid foundation for further research and development. The novel approach is demonstrated using some illustrative model dynamics.

For disciplines like biological science, security, and the medical field, link prediction is a popular research area. To demonstrate the link prediction many methods have been proposed. Some of them that have been demonstrated through this review paper are TransE, Complex, DistMult, and DensE models. Each model defines link prediction with different perceptions. We argue that the practical performance potential of these methods, having similar parameter values, using the fine-tuning technique to evaluate their reliability and reproducibility of results. We describe those methods and experiments; provide theoretical proofs and experimental examples, demonstrating how current link prediction methods work in such settings. We use the standard evaluation metrics for testing the model's ability.

Drug repositioning (also called drug repurposing) is a strategy for identifying new therapeutic targets for existing drugs. This approach is of great importance in pharmacology as it is a faster and cheaper way to develop new medical treatments. In this paper, we present, to our knowledge, the first application of multiplex-heterogeneous network embedding to drug repositioning. Network embedding learns the vector representations of nodes, opening the whole machine learning toolbox for a wide variety of applications including link prediction, node labelling or clustering. So far, the application of network embedding for drug repositioning focused on heterogeneous networks. Our approach for drug repositioning is based on multiplex-heterogeneous network embedding. Such method allows the richness and complexity of multiplex and heterogeneous networks to be projected in the same vector space. In other words, multiplex-heterogeneous networks aggregate different multi-omics data in the same network representation. We validate the approach on a task of link prediction and on a case study for SARS-CoV2 drug repositioning. Experimental results show that our approach is highly robust and effective for finding new drug-target associations.

Unsupervised metric learning has been generally studied as a byproduct of dimensionality reduction or manifold learning techniques. Manifold learning techniques like Diusion maps, Laplacian eigenmaps has a special property that embedded space is Euclidean. Although laplacian eigenmaps can provide us with some (dis)similarity information it does not provide with a metric which can further be used on out-of-sample data. On other hand supervised metric learning technique like ITML which can learn a metric needs labeled data for learning. In this work propose methods for incremental unsupervised metric learning. In rst approach Laplacian eigenmaps is used along with Information Theoretic Metric Learning(ITML) to form an unsupervised metric learning method. We rst project data into a low dimensional manifold using Laplacian eigenmaps, in embedded space we use euclidean distance to get an idea of similarity between points. If euclidean distance between points in embedded space is below a threshold t₁ value we consider them as similar points and if it is greater than a certain threshold t₂ we consider them as dissimilar points. Using this we collect a batch of similar and dissimilar points which are then used as a constraints for ITML algorithm and learn a metric. To prove this concept we have tested our approach on various UCI machine learning datasets. In second approach we propose Incremental Diusion Maps by updating SVD in a batch-wise manner.

Distributional word vector representation orword embedding has become an essential ingredient in many natural language processing (NLP) tasks such as machine translation, document classification, information retrieval andquestion answering. Investigation of embedding model helps to reduce the feature space and improves textual semantic as well as syntactic relations.This paper presents three embedding techniques (such as Word2Vec, GloVe, and FastText) with different hyperparameters implemented on a Bengali corpusconsists of180 million words. The performance of the embedding techniques is evaluated with extrinsic and intrinsic ways. Extrinsic performance evaluated by text classification, which achieved a maximum of 96.48% accuracy. Intrinsic performance evaluatedby word similarity (e.g., semantic, syntactic and relatedness) and analogy tasks. The maximum Pearson (ˆr) correlation accuracy of 60.66% (Ssˆr) achieved for semantic similarities and 71.64% (Syˆr) for syntactic similarities whereas the relatedness obtained 79.80% (Rsˆr). The semantic word analogy tasks achieved 44.00% of accuracy while syntactic word analogy tasks obtained 36.00%

For many engineering applications it is sufficient to use the concept of simple materials. However, higher gradients of the kinematic variables are taken into account to model materials with internal length scales as well as to describe localization effects using gradient theories in finite plasticity or fluid mechanics. In many approaches length scale parameter have been introduced that are related to a specific micro structure. An alternative approach is possible, if a thermodynamically consistent framework is used for material modelling as shown in the present contribution. However, even if sophisticated and thermodynamically consistent material models can be established there are still not yet standard experiments to determine higher order material constants. In order to contribute to this ongoing discussion system identification based on the method of self-adaptive filtering is proposed in this paper. To evaluate the effectiveness of this approach it has been applied to second-order gradient materials considering longitudinal vibrations. Based on thermodynamically consistent models that have been solved numerically it has been possible to prove that system identification based on self-adaptive filtering can be used effectively for both narrow-band and broadband signals in the field of second-order gradient materials. It has also been found that the differences identified for simple materials and gradient materials allow for condition monitoring and detection of gradient effects in the material behavior.

Embedding representation models characterize each word as a vector of numbers with a fixed length. These models have been used in tasks involving text classification, such as recommen- dation and question-answer systems. Semantic relationships are words with a relationship between them providing a complete idea to a text. Therefore, it is hypothesized that an embedding model involving semantic relationships will provide better performance for tasks that use them. This paper presents three embedding models based on semantic relations extracted fromWikipedia to classify texts. The synonym, hyponym, and hyperonym semantic relationships were the ones considered in this work since previous experiments have shown that they are the ones that provide the most semantic knowledge. Lexical-syntactic patterns present in the literature were implemented and subsequently applied to the Wikipedia corpus to obtain the semantic relationships present in it. Several semantic relationships are used in different models: synonymy, hyponym-hyperonym, and a combination of the first two. A convolutional neural network was trained for text classification to evaluate the performance of each model. The results obtained were evaluated with the metrics of precision, accuracy, recall, and F1-measure. The best values obtained with the second model were accuracy of 0.79 for the 20-Newsgroup corpus. F1-measure and recall of 0.87 respectively for the Reuters corpus.

Protein Contact Network (PCN) is an emerging paradigm for modelling protein structure. A common approach to interpreting such data is through network-based analyses. It has been shown that clustering analysis may discover allostery in PCN. Nevertheless Network Embedding has shown good performances in discovering hidden communities and structures in network. In this work, we compare some approaches for graph embedding with respect to some classical clustering approaches for annotating protein structures.

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.

Network Embedding (NE) is an important method to learn the representations of network via a low-dimensional space. Conventional NE models focus on capturing the structure information and semantic information of vertices while neglecting such information for edges. In this work, we propose a novel NE model named BimoNet to capture both the structure and semantic information of edges. BimoNet is composed of two parts, i.e., the bi-mode embedding part and the deep neural network part. For bi-mode embedding part, the first mode named add-mode is used to express the entity-shared features of edges and the second mode named subtract-mode is employed to represent the entity-specific features of edges. These features actually reflect the semantic information. For deep neural network part, we firstly regard the edges in a network as nodes, and the vertices as links, which will not change the overall structure of the whole network. Then we take the nodes' adjacent matrix as the input of the deep neural network as it can obtain similar representations for nodes with similar structure. Afterwards, by jointly optimizing the objective function of these two parts, BimoNet could preserve both the semantic and structure information of edges. In experiments, we evaluate BimoNet on three real-world datasets and task of relation extraction, and BimoNet is demonstrated to outperform state-of-the-art baseline models consistently and significantly.

A signed graph is an undirected graph such that all of its edges are labeled positive or negative. Let D be an embedding of a signed graph G in the Euclidean line. If in D for all of the vertices their positive neighbors are closer than the negative neighbors, then D is called a valid drawing of G. In this paper we show that signed trees, unicyclic graphs, and ladder graphs have a valid drawing in the Euclidean line.

Germanium (Ge) nanostrip is embedded in polymer and studied as a waveguide. Measurement reveals that this new type of semiconductor/polymer heterogeneous waveguide exhibits strong absorption for the TE mode from 1500 nm to 2004 nm, while the propagation loss for the TM mode declines from 20.56 dB/cm at 1500 nm to 4.89 dB/cm at 2004 nm. The transmission characteristics serves as an essential tool to verify the optical parameters (n-κ) of the thin strips, addressing to the ambiguity raised by spectroscopic ellipsometry regarding highly absorbing materials. Furthermore, the observed strong absorption for the TE mode at 2004 nm is well beyond the cut-off wavelength of the crystalline bulk Ge (~1850 nm at room temperature). This redshift is modeled to manifest the narrowing of the Tauc-fitted bandgap due to the grain order effect in the amorphous Ge layer. The accurate measurement of the nanometer-scale light-absorbing strips in a waveguide form is a crucial step toward the accurate design of integrated photonic devices that utilize such components.

Functional connectivity (FC) is a potential candidate that can increase the performance of brain-computer interfaces (BCIs) in the elderly because of its compensatory role in neural circuits. However, it is difficult to decode FC by current machine learning techniques because of a lack of its physiological understanding. To investigate the suitability of FC in BCI for the elderly, we propose the decoding of lower- and higher-order FCs using a convolutional neural network (CNN) in six cognitive-motor tasks. The layer-wise relevance propagation (LRP) method describes how age-related changes in FCs impact BCI applications for the elderly compared to younger adults. Seventeen younger (24.5±2.7 years) and twelve older (72.5±3.2 years) adults were recruited to perform tasks related to hand-force control with or without mental calculation. CNN yielded a six-class classification accuracy of 75.3% in the elderly, exceeding the 70.7% accuracy for the younger adults. In the elderly, the proposed method increases the classification accuracy by 88.3% compared to the filter-bank common spatial pattern (FBCSP). LRP results revealed that both lower- and higher-order FCs were dominantly overactivated in the prefrontal lobe depending on task type. These findings suggest a promising application of multi-order FC with deep learning on BCI systems for the elderly.

Topic discovery is finding the main idea of large amounts of textual data. It indicates the recurring topics in the documents, allowing an overview of the texts. Current topic discovery models receive the texts, with or without pre-processing of Natural Language Processing. The processing consists of stopwords removal, text cleaning and normalization (lowercase conversion). A topic discovery model that receives texts with or without processing generates general topics since the input data is many uncategorized texts. The general topics do not offer a detailed overview of the input texts, and manual text categorization is a time-consuming and tedious task. Accordingly, it is necessary to integrate an automatic text classification task in the topic discovery process to obtain specific topics with their top words that contain relevant relationships based on belonging to a class. Text classification performs a word analysis that makes up a document to decide what class or category is being identified; then, integrating the text classification before a topic discovery process will provide latent topics depicted by top words with a high coherence in each topic based on the previously obtained classes. Therefore, this paper exposes a approach that integrates text classification into topic discovery from large amounts of English textual data, such as 20-Newsgroup and Reuters corpora. The text classification is accomplished with a Convolutional Neural Network(CNN) incorporating three embedding models based on semantic relationships. The topic discovery over categorized texts is realized with Latent Dirichlet Analysis(LDA), Probabilistic Latent Semantic Analysis(PLSA), and Latent Semantic Analysis(LSA) algorithms. An evaluation process was performed based on the normalized topic coherence metric. The 20-Newsgroup corpus was classified, and twenty topics with ten top words were discovered for each class, obtaining 0.1723 normalized topic coherence when applying LDA, 0.1622 with LSA, and 0.1716 with PLSA. The Reuters corpus was also classified, obtaining 0.1441 normalized topic coherence when applying the LDA algorithm to obtain 20 topics for each class.

There are introduced two new steganalytic methods not depending on the statistics of the cover objects, namely side attacks stegosystems. The first one assumes that the plaintext, encrypted before embedding, is known by the attacker. In this case, the stegosystem’s detection is based on the calculation of mutual information between message and extracted encrypted data. For this calculation, a notion of the k-nearest neighbor distance is applied. The second method is applied to HUGO, one of the most efficient steganographic algorithms. In this case the stegosystem’s detection is based on a verification of the NIST tests to the extracted encrypted messages. Moreover, we show that the problem to find a submatrix of­ the embedding matrix determining a trellis code structure in the HUGO algorithm provides a search of the stegokey of the proposed stegosystem.

We monitored the water quality and hydrological conditions of a horizontal subsurface constructed wetland (HSSF-CW) in Beijing, China, for 2 years. We simulated the area rate constant and the temperature coefficient with the first-order kinetic model. We examined the relationships between the nitrogen (N) removal rate, N load, seasonal variations in the N removal rate, and environmental factors, such as the area rate constant, temperature, and dissolved oxygen (DO). The effluent ammonia (NH₄⁺-N) and nitrate (NO₃⁻-N) concentrations were significantly lower than the influent concentrations (p<0.01, n=38). The NO₃⁻-N load was significantly correlated with the removal rate (R²=0.9566, p<0.01), but the NH^₄+-N load was not correlated with the removal rate (R²=0.0187, p>0.01). The area rate constants of NO₃⁻-N and NH₄⁺-N at 20 °C were 27.01±26.49 and 16.63±10.58 m∙yr⁻¹, respectively. The temperature coefficients for NO₃⁻-N and NH₄⁺-N were estimated at 1.0042 and 0.9604, respectively. The area rate constants for NO₃⁻-N and NH₄⁺-N were not correlated with temperature (p>0.01). The NO₃⁻-N area rate constant was correlated with the corresponding load (R²=0.9625, p<0.01). The NH₄⁺-N area rate was correlated with DO (R²=0.6922, p<0.01), suggesting that the factors that influenced the N removal rate in this wetland met Liebig's law of the minimum.

Most machine learning and deep learning algorithms can only use low-dimensional data as input, but the data that must be processed in practical applications is diverse and irregular. There are two main problems with big dynamic data. (1) The size of the embedding table grows linearly with the vocabulary size, resulting in massive memory consumption. (2) For different newly added vocabularies. To solve these two problems, this paper proposes a novel embedding algorithm that can learn attribute associations with entities based on deep and hash algorithms. Taking movie data as an example, the encoding method and the specific flow of the algorithm are presented in detail, and the effect of dynamic reuse of data models is realized. Compared with the four existing embedding algorithms which can fuse entity attribute information, the deep hash embedding algorithm proposed in this paper has obvious optimization of time and space complexity.

: This article reports on polymer (PLLA, poly(L-lactic acid)) nanosheets incorporated with Fe-ion nanoparticles, aiming at using the latter nanoparticles as source to release Fe ions to facilitate burn wound healing when such nanosheets are applied on skin as biomedical tissue. Laser ablation in liquid phase was used to produce Fe-containing nanoparticles that after incorporation into PLLA nanosheets would release Fe ions when in immersed in water. Such nanoparticles prepared in chloroform are shown by XPS to be based on iron chloride and oxide phases. After incorporation into PLLA nanosheets, the ion –release test demonstrated that Fe ions could be released successfully into water at pH 7.4, which implies that such polymer nanosheets show promise for biomedical applications as potential patches for healing burn wounds. Incorporation with two different metal ions (Fe and Zn) is shown to be efficient and both types of ions were demonstrated to be released simultaneously and with comparable release rates.

There is a considerable amount of research in online social networks, most of which focuses on the structural analysis of social graphs. The interpersonal relationships of social networks, especially friend circle, can solve the cold start and sparsity problems, and through the relationship between social networks can effectively recommend users' favorite items (items), such as music , videos, brands/products, preferred tags, location, services, etc. User relationships in social networks are diverse and there are many different perspectives on different social networks. Associations among users can form multi-layered composite networks, and multi-layered social networks present new challenges and opportunities. Different relationships can influence users' preferences to different degrees, which in turn affects their behavior. Therefore, fusing multiple social networks is an effective way to improve recommendation. Although some studies have started to address multiple social network recommendations, simple linear superposition cannot reflect the coupling and nonlinear association between multiple social networks. In this paper, we propose a graph neural network recommendation model under social relationships based on this background. We first propose to compute the 2nd order collaborative signals and their intensities directly from the neighboring matrix for updating the node embedding of the graph convolution layer. Secondly by embedding historical evaluations, various social networks constituting different dimensions, the attention integration of user preferences by different social networks is achieved, and its effectiveness and scalability are demonstrated in theoretical derivation and experimental validation. The theoretical derivation and experimental validation demonstrate its effectiveness and scalability.

In heterogeneous networks, the random walks based on meta-path requires prior knowledge and lacks flexibility. And the random walks based on non-meta-path only considers the number of node types, but does not consider the influence of schema and topology between node types in real networks. To solve the above problems, this paper proposes a novel model HNE-RWTIC (Heterogeneous Network Embedding Based on Random Walks of Type & Inner Constraint). Firstly, to realize the flexible walks, we design a Type strategy, which is the node type selection strategy based on the co-occurrence probability of node types. Secondly, to achieve the uniformity of node sampling, we design an Inner strategy, which is the node selection strategy based on the adjacency relationship between nodes. The Type & Inner strategy can realize the random walks based on meta-path, the flexibility of the walks, and can sample the node types and nodes uniformly in proportion. Thirdly, based on the above strategy, a transition probability model is constructed; then, we obtain the nodes embedding based on the random walks and Skip-Gram. Finally, in classification and clustering tasks, we conducted a thorough empirical evaluation of our method on three real heterogeneous networks. Experimental results shown that F1-Score and NMI of HNE-RWTIC outperform state-of-the-art approaches.

In this paper we have studied some properties for determinant-calculating for cubic-matrix of order 2 and order 3. These properties are analogous to some properties for determinants of square matrix we have proved and noted that these properties also are applicable (or not in some details) on this concept for cubic-matrix of orders 2 and 3. All results in this paper, are presented in detail during the theorem proofs.

Complexity science studies physical phenomena that cannot be explained by the mere analysis of the single units of a system but requires to account for their interactions. A feature of complexity in connected systems is the emergence of mesoscale patterns in a geometric space, such as groupings in bird flocks. These patterns are formed by groups of points that tend to separate from each other, creating mesoscale structures. When multidimensional data or complex networks are embedded in a geometric space, some mesoscale patterns can appear respectively as clusters or communities, and their geometric separability is a feature according to which the performance of an algorithm for network embedding can be evaluated. Here, we introduce a framework for the definition and measure of the geometric separability (linear and nonlinear) of mesoscale patterns by solving the travelling salesman problem (TSP), and we offer experimental evidence on embedding and visualization of multidimensional data or complex networks, which are generated artificially or are derived from real complex systems. For the first time in literature the TSP’s solution is used to define a criterion of nonlinear separability of points in a geometric space, hence redefining the separability problem in terms of the travelling salesman problem is an innovation which impacts both computer science and complexity theory.

In this paper, inspired by recent articles of G. Anatriello and G. Vincenzi (see \cite{Ana}), and G. Cerda-Morales (see \cite{Cer1,Cer2}), we will introduce the third-order $\overline{h}$-Jacobsthal and third-order $\overline{h}$-Jacobsthal--Lucas sequences and their associated quaternions. The new results that we have obtained extend most of those obtained in \cite{Cer2}.

Using multi-color flow cytometry analysis, we studied the immunophenotypical differences between leukemic blasts/LSCs from patients with AML/MDS and hematopoietic stem and progenitor cells (HSPCs) from patients in complete remission (CR) following their successful treatment. The panel of markers included CD34, CD38, CD45RA, CD123 as representatives for a hierarchical hematopoietic stem and progenitor cell (HSPC) classification as well as programmed death ligand 1 (PD-L1). Rather than restricting the evaluation on a 2- or 3-dimensional analysis, we applied a t-distributed stochastic neighbor embedding (t-SNE) approach to get a deeper insight and segregation between leukemic and normal HPSCs. For that purpose, we created a t-SNE map, which resulted in the visualization of 27 cell clusters based on their similarity concerning the composition and intensity of antigen expression. Two of these clusters were “leukemia-related” containing a great proportion of CD34⁺/CD38^- hematopoietic stem cells (HSCs) or CD34⁺ cells with a strong coexpression of CD45RA/CD123, respectively. CD34⁺ cells within the latter cluster were also highly positive for PD-L1 reflecting their immunosuppressive capacity. Beyond this proof of principle study, the inclusion of additional markers will be helpful to refine the differentiation between normal HSPCs and leukemic cells, particularly in the context of minimal disease detection and antigen-targeted therapeutic interventions. Furthermore, we suggest a protocol for the assignment of new cell ensembles in quantitative terms, via a numerical value, the Pearson coefficient, based on a similarity comparison of the t-SNE pattern with a reference.

Nowadays, we use social networks such as Twitter, Facebook, WeChat and Weibo as means to communicate with each other and get to know others. Gradually social networks has become indispensable in our everyday life, and we cannot absolutely imagine what the daily life would be like without social networks. Through social networks, we can access friends' opinions and behaviors easily and are influenced by them in turn. Thus, an effective algorithm to find the top-K influential nodes (the problem of influence maximization) in the social network is critical for various downstream tasks such as viral marketing, anticipating natural hazards, reducing gang violence, public opinion supervision etc. Solving the problem of influence maximization in real-world propagation scenarios often involves estimating influence strength (influence probability between two nodes), which cannot directly observed. To estimate influence strength, conventional approaches propose various humanly-devised rules to extract features of user interactions, the effectiveness of which heavily depends on domain expert knowledge. Besides, they are often applicable for special scenarios or specific diffusion models. Consequently, they are difficult to be generalized into different scenarios, diffusion models and even domains. Inspired by the powerful ability of neural networks in the field of representation learning, we design a deep hierarchical network embedding model HGE to map nodes (with attributes) into latent space automatically. In general, HGE takes an attributed social network as the input for learning latent network representation of each node, incorporating hierarchical community structure, node attributes and general network structure into a unified deep generative framework. Then, with the leaned latent representation of each node, we propose a HGE-GA algorithm to predict influence strength and compute the top-K influential nodes through a greedy-based maximization algorithm. Extensive experiments on real-world attributed networks demonstrate the outstanding superiority of the proposed HGE model and HGE-GA algorithm compared with the state-of-the-art methods, verifying the effectiveness of the proposed model and algorithm.

With large-scale distributed generators (DGs) in an active distribution network (ADN), conventional load flow convergence failure is incurred by heavy power transmission. The Holomorphic Embedding Load Flow Method (HELM) has proven to be more robust than the Newton–Raphson method under heavy power transmission. At present, HELM is mainly designed for balanced transmission networks. In this study, we developed a three-phase HELM model to accommodate DGs, delta connection loads, and ZIP loads for ADN. The effectiveness and better performance of the proposed method under heavy load situations were validated using modified unbalanced IEEE 13, 34, 37, and 123 test feeders.

This paper focus on the modeling and time-domain analyzing method of piecewise-smooth fractional-order circuit systems. Firstly, an analytical framework is constructed based on a generalized piecewise-smooth two-port impedance network model, which takes the topological characteristics of Dickson type switched-capacitor converters (SCCs) as examples, and considers the fractional-order characteristics of class-2 X7R ceramic capacitors, which are widely used in SCCs. Secondly, the time-domain analyzing method for such a piecewise-smooth fractional-order circuit system is developed, numerical solutions are obtained, and the influence of the fractional-order capacitor on the power conversion efficiency of the system are revealed. Finally, in order to validate the analysis, both numerical simulation and experiments are provided in the work, the results of which confirm that, the proposed fractional-order analytical framework can capture the power loss mechanism of piecewise-smooth fractional-order circuit systems more effectively than the traditional integer-order based approach, thus benefiting the design of circuit systems.

In recent years, pedestrian re-identification has gained a lot of interest due to its importance for many purposes such as security and safety. Many types of solutions have been proposed to solve this problem, where the majority are based on a features extraction such Convolution Neural Networks (CNNs). These approaches assume that only the identities that are in the training data can be recognized. The pedestrians in the training data are called In distribution (ID). However, in real world scenarios, new pedestrians and objects can appear in the scene and the model should detect them as Out Of Distribution (OOD). In our previous study , we proposed a pedestrian re-identification based on von-Mises Fisher (vMF) distribution. Each identity is embedded in the unit sphere as a compact vMF distribution far from other identities distributions. The embedding is done through a base CNN. Recently, proposed a framework called Virtual Outlier Synthetic (VOS), that detects OOD based on synthesising virtual outlier in the embedding space in an online manner. Their approach assumes that the samples from the same object maps to a compact space. This assumption aligns with the vMF based approach. Therefore, in this paper, we revisited the vMF approach and merged with VOS in order to detect OOD data points. We present our approach to merge both frameworks. We conducted several experiments to evaluate our proposed framework. Results showed that our framework was able to detect new pedestrian that do not exist in the training data in the inference phase. It also slightly helped to improve the re-identification performance.

We study and describe possibilities for arities of elementary theories and of their expansions. Links for arities with respect to Boolean algebras, to disjoint unions and to compositions of structures are shown. Arities and aritizabilities are semantically characterized. The dynamics for arities of theories is described.

This paper presents an approach to the Timoshenko beam theory (TBT) using the finite difference method (FDM). The Timoshenko beam theory covers cases associated with small deflections based on shear deformation and rotary inertia considerations. The FDM is an approximate method for solving problems described with differential equations. It does not involve solving differential equations; equations are formulated with values at selected points of the structure. In addition, the boundary conditions and not the governing equations are applied at the beam’s ends. The model developed in this paper consisted of formulating differential equations with finite differences and introducing additional points at the beam’s ends and at positions of discontinuity (concentrated loads or moments, supports, hinges, springs, brutal change of stiffness, spring-mass system, etc.). The introduction of additional points allowed us to apply the governing equations at the beam’s ends. Moreover, grid points with variable spacing were considered, the grid being uniform within beam segments. First-order, second-order, and vibration analyses of structures were conducted with this model. Furthermore, tapered beams were analyzed (element stiffness matrix, second-order analysis, vibration analysis). Finally, a direct time integration method (DTIM) was presented; the FDM-based DTIM enabled the analysis of forced vibration of structures, with damping taken into account. The results obtained in this paper showed good agreement with those of other studies, and the accuracy was increased through a grid refinement. Especially in the first-order analysis of uniform beams, the results were exact for uniformly distributed and concentrated loads regardless of the grid.

Here, I present an alternate solution for the dark matter problem. I show that the stars of a galaxy’s arm attract each other with a force other than gravity, producing a chain of stars. We already have an abundance of data (ring and multiring galaxies) as proof for the existence of this strong stars’ chain. This attraction force does not end at the galaxy’s boundaries but gets deeper into the cosmos, and it may explain the dark-energy problem. This attraction force affects only stars and seems to have no effect on planets. I also offer a novel timeline order for the well-known galaxies using Hubble classification. I nominate entangled particles for the role that causes this phenomenon.

Single cell RNA-seq (scRNA-seq) profiles conceal temporal and spatial tissue developmental information. De novo reconstruction of single cell temporal trajectory has been fairly addressed, but reverse engineering single cell 3D spatial tissue localization is hitherto landmark based, and de novo spatial reconstruction is a compelling computational open problem. Here we show that a new algorithm - named D-CE - for coalescent embedding of single cell transcriptomic networks can address this open problem. We rely merely on the spatial information encoded in the expression patterns of developmental signal transcription factor (DST) genes, and we find that D-CE of cell-cell association DST-transcriptomic networks reliably reconstructs the Geo-seq or single cell samples’ 3D spatial tissue distribution. Comparison to the novoSpaRC and CSOmap (recent and only available de novo 3D spatial reconstruction methods) on 16 datasets and 681 reconstructions, reveals a significantly distinctive superior performance of D-CE.

This paper presents an approach to the Euler-Bernoulli beam theory (EBBT) using the finite difference method (FDM). The EBBT covers the case of small deflections, and shear deformations are not considered. The FDM is an approximate method for solving problems described with differential equations. The FDM does not involve solving differential equations; equations are formulated with values at selected points of the structure. Generally, the finite difference approximations are derived based on fourth-order polynomial hypothesis (FOPH) and second-order polynomial hypothesis (SOPH) for the deflection curve; the FOPH is made for the fourth and third derivative of the deflection curve while the SOPH is made for its second and first derivative. In addition, the boundary conditions and not the governing equations are applied at the beam’s ends. In this paper, the FOPH was made for all of the derivatives of the deflection curve, and additional points were introduced at the beam’s ends and positions of discontinuity (concentrated loads or moments, supports, hinges, springs, etc.). The introduction of additional points allowed us to apply the governing equations at the beam’s ends and to satisfy the boundary and continuity conditions. Moreover, grid points with variable spacing were also considered, the grid being uniform within beam segments. First-order analysis, second-order analysis, and vibration analysis of structures were conducted with this model. Furthermore, tapered beams were analyzed (element stiffness matrix, second-order analysis). Finally, a direct time integration method (DTIM) was presented. The FDM-based DTIM enabled the analysis of forced vibration of structures, with damping taken into account. The results obtained in this paper showed good agreement with those of other studies, and the accuracy was increased through a grid refinement. Especially in the first-order analysis of uniform beams, the results were exact for uniformly distributed and concentrated loads regardless of the grid. Further research will be needed to investigate polynomial refinements (higher-order polynomials such as fifth-order, sixth-order…) of the deflection curve; the polynomial refinements aimed to increase the accuracy, whereby non-centered finite difference approximations at beam’s ends and positions of discontinuity would be used.

Collatz conjecture (3x+1 problem) is a natural phenomenon in set theory that may be reconstructed using known combinatorics and order theory. Construction begins by selecting a specific order isomorphism with a bijectional order-embedding. Mapping by 3x+1 induces a unique property to only members of the mapped embedding. Under selective congruence from recursive division by two, that complex controls sequence behavior. This demonstration uses an order isomorphism consisting of two linear orders: the (1) odd positive integers and the always odd (2) Rule 50 Jacobsthal numbers, as the embedding. The argument proceeds by cardinality. When the order isomorphism is mapped under 3x+1, all Rule 50 Jacobsthal numbers are mapped to all the powers of four. This one-to-one correspondence guarantees that every odd integer is assigned to a Rule 50 Jacobsthal number, and subsequently, to a power of four. To align this construction with the conjecture, expand the set to all positive integers by showing that: (1) the powers of four embed the powers of two, in a natural way, and (2) the unique factorization of any positive even integer, not congruent to a power of two, is simply an odd integer, once the factorized power of two is divided out. In other words, if the initial choice for a positive integer is not congruent to a power of two, then recursion continues until a Rule 50 Jacobsthal number (guaranteed by cardinality) is attained. Since this value mapped by 3x+1 is always a power of four, repeated division by two will always send the sequence to one. Because this same process occurs for any choice of positive integer, Collatz conjecture is true.

In this paper, we consider the problem that the maximal order consider the groups that consisting of transformations we called NG-Transformation on a nonempty set A has no bijection as its element. We find the order of these groups not greater that (n-1)!. In addition, we will prove our result by showing that any kind of NG-group in the theorem be isomorphic to a permutation group on a quotient set of A with respect to an equivalence relation on A.

The root system plays an irreplaceable role in plant growth. Its improvement can increase crop productivity. However, such system is still mysterious for us. The underlying mechanism has not been fully uncovered. The investigation on proteins related to the root system is an important means to complete this task. In the previous time, lack of root-related proteins makes it impossible to adopt machine learning methods for designing efficient models for the discovery of novel root-related proteins. Recently, a public database on root-related proteins was set up and machine learning methods can be applied in this field. In this study, we proposed a machine learning based model, named Graph-Root, for identification of root-related proteins. The features derived from protein sequences and one network were extracted, where the former features were processed by graph convolutional neural network and multi-head attention, and the later features abstracted the linkage between proteins. These features were fed into the fully connected layer to make prediction. The 5-fold cross-validation and independent tests suggested its good performance. It also outperformed the only one previous model, SVM-Root. Furthermore, the importance of each feature type and component in the proposed model was investigated.

Antimicrobial resistance (AMR) poses one of the significant challenges for the progress of modern medicine not only by its myriad manifestations on a microbiological plane but also due to its demand for a complex, multisectoral approach for its annulment. While some nations have been actively involved in the deployment of counter measures against AMR, the same have yet to be implemented in India. This can be attributed due to a combination of its epitomizing multivariate nature and the challenges encountered on a ground-level in policy implementation. This review surveys mechanisms and factors promoting incidence of AMR, potential Artificial Intelligence (AI) implementation alongside evaluating the efficacy of the One Health approach on national and state levels in curbing the rise of AMR.

The central goal of few-shot scene classification is to learn a model that can generalize well to a novel scene category (UNSEEN) from only one or a few labeled examples. Recent works in the remote sensing (RS) community tackle this challenge by developing algorithms in a meta-learning manner. However, most prior approaches have either focused on rapidly optimizing a meta-learner or aimed at finding good similarity metrics while overlooking the embedding power. Here we propose a novel Task-Adaptive Embedding Learning (TAEL) framework that complements the existing methods by giving full play to feature embedding’s dual roles in few-shot scene classification - representing images and constructing classifiers in the embedding space. First, we design a lightweight network that enriches the diversity and expressive capacity of embeddings by dynamically fusing information from multiple kernels. Second, we present a task-adaptive strategy that helps to generate more discriminative representations by transforming the universal embeddings into task-specific embeddings via a self-attention mechanism. We evaluate our model in the standard few-shot learning setting on two challenging datasets: NWPU-RESISC4 and RSD46-WHU. Experimental results demonstrate that, on all tasks, our method achieves state-of-the-art performance by a significant margin.

The gradient descent algorithm has become the standard algorithm for computing the extreme values of functions, but for multivariate functions this algorithm is mostly ineffective. This is because the convergence rate of each element is inconsistent in most cases. However, in this paper, we found that the gradient sign is a self-optimizing operator, ensuring that the convergence rate is consistent across all elements. This also explains, from an optimization perspective, the success of the Fast Gradient Sign Method (FGSM) in generating adversarial samples that are indistinguishable from the normal input, but can easily fool neural networks. We also found that the fractional order gradient is also self-optimizing, and that the convergence speed of this algorithm can be controlled by adjusting the order of the gradient. Experiments suggest that this algorithm not only generates adversarial samples faster than other algorithms, but that a single source image can generate many such samples. This algorithm is also more effective than others at generating adversarial samples from simple images.

In this paper, we study the third order semilocal convergence of the Newton-like method for finding the approximate solution of nonlinear operator equations in the setting of Banach spaces. First, we discuss the convergence analysis under ω-continuity condition, which is weaker than the Lipschitz and Hölder continuity conditions. Second, we apply our approach to solve Fredholm integral equations, where the first derivative of involved operator not necessarily satisfy the Hölder and Lipschitz continuity conditions. Finally, we also prove that the R-order of the method is 2p + 1 for any p $\in$ (0,1].

This paper presents an approach to the Kirchhoff-Love plate theory (KLPT) using the finite difference method (FDM). The KLPT covers the case of small deflections, and shear deformations are not considered. The FDM is an approximate method for solving problems described with differential equations. The FDM does not involve solving differential equations; equations are formulated with values at selected points of the structure. Generally in the case of KLPT, the finite difference approximations are derived based on the fourth-order polynomial hypothesis (FOPH) and second-order polynomial hypothesis (SOPH) for the deflection surface. The FOPH is made for the fourth and third derivative of the deflection surface while the SOPH is made for its second and first derivative; this leads to a 13-point stencil for the governing equation. In addition, the boundary conditions and not the governing equations are applied at the plate edges. In this paper, the FOPH was made for all of the derivatives of the deflection surface; this led to a 25-point stencil for the governing equation. Furthermore, additional nodes were introduced at plate edges and at positions of discontinuity (continuous supports/hinges, incorporated beams, stiffeners, brutal change of stiffness, etc.), the number of additional nodes corresponding to the number of boundary conditions at the node of interest. The introduction of additional nodes allowed us to apply the governing equations at the plate edges and to satisfy the boundary and continuity conditions. First-order analysis, second-order analysis, buckling analysis, and vibration analysis of plates were conducted with this model. Moreover, plates of varying thickness and plates with stiffeners were analyzed. Finally, a direct time integration method (DTIM) was presented. The FDM-based DTIM enabled the analysis of forced vibration of structures, with damping taken into account. In first-order, second-order, buckling, and vibration analyses of rectangular plates, the results obtained in this paper were in good agreement with those of well-established methods, and the accuracy was increased through a grid refinement.

This paper presents an exact solution to the Timoshenko beam theory (TBT) for first-order analysis, second-order analysis, and stability. The TBT covers cases associated with small deflections based on shear deformation considerations, whereas the Euler–Bernoulli beam theory (EBBT) neglects shear deformations. Thus, the Euler–Bernoulli beam is a special case of the Timoshenko beam. The moment-curvature relationship is one of the governing equations of the EBBT, and closed-form expressions of efforts and deformations are available in the literature. However, neither an equivalent to the moment-curvature relationship of EBBT nor closed-form expressions of efforts and deformations can be found in the TBT. In this paper, a moment-shear force-curvature relationship, the equivalent in TBT of the moment-curvature relationship of EBBT, was presented. Based on this relationship, first-order and second-order analyses were conducted, and closed-form expressions of efforts and deformations were derived for various load cases. Furthermore, beam stability was analyzed and buckling loads were calculated. Finally, first-order and second-order element stiffness matrices were determined.

The Mobius function is commonly used to define Euler's totient function and the Mangoldt function. Similarly, the summatory Mobius function (the Mertens function) can be used to define the summatory totient function and the summatory Mangoldt function (the second Chebyshev function).

In a recent paper we have a shown that the flattening of galactic rotation curves can be explained by retardation. However, this will rely on a temporal change of galactic mass. In our previous work we have kept only second order terms of the retardation time in our analysis, while higher terms in the Taylor expansion where not considered. Here we consider analysis to all orders and show that indeed a second order analysis will suffice, and higher order terms can be neglected.

Link prediction is to complete the missing links in the network or to predict the generation of new links according to the current network structure information, which is very important for mining and analyzing the evolution of the network such for construction and analysis of logical architecture in 6G network. Link prediction algorithms based on node similarity need predefined similarity functions, which is highly hypothetical and only applies to specific network structures without generality. To solve this problem, this paper proposes a link prediction algorithm based on the subgraph of the target node pair. In order to automatically learn the graph structure characteristics, the algorithm firstly extracts the h-hop subgraph of the target node pair, and then predicts whether the target node pair will be linked according to the subgraph. Experiments on seven real data sets show that the link prediction algorithm based on target node pair subgraph is suitable for various network structures and superior to other link prediction algorithms.

In recent years, team-based learning (TBL) is gaining popularity as a student-centered active collaborative learning strategy in healthcare education. This paper reports the design, implementation, and impact of a "hybrid team-based learning" (H-TBL) for one respiratory lecture in year two undergraduate physiotherapy program in 2019. A retrospective study was conducted, including 136 second-year undergraduate physiotherapy students using H-TBL design for one respiratory lecture topic. Student engagement was evaluated based on the percentage of completion for pre-class work, attendance to classroom session, and submission of formative creative assignment. Student' performance on formative creative tasks was evaluated based on thinking and learning rubric. Student perceptions were assessed based on the student's feedback using "Mentimeter." 109/ 136 (80%) students attended the COPD 2 session. 90/109 (82%) students engaged in COPD 1 (web-based) and tRAT in COPD 2 session. 54/109 (50%) students provided feedback and 67/90 (74%) students submitted formal formative creative assignment on completion of COPD 2 session. This study confirms that H-TBL enhances student's active engagement, creativity, and equilibration of their subject knowledge. Future randomized studies are mandated to explore the validity and specificity of H-TBL in diverse physiotherapy curriculum to evaluate the long-term student engagement and academic performance.

This paper discusses the concept of fractional derivative with complex order from the application point of view. It is shown that a fractional derivative is hermitian, if and only if the order is real. The hermitian part of complex order derivatives behave like allpass filters with almost logarithmic phase.

The genetic code evolved by parallel tracks of chaotic and ordered processes. Liquid-liquid phase separation (hydrogels), a chaotic process, constructs diverse membraneless compartments within cells, resulting in regulated hydration and sequestration and concentration of reaction components. Hydrogels relate to chaotic amyloid fiber production. We propose that polyglycine and related hydrogels (i.e. GADV; G is glycine), phase separations, membraneless droplets and amyloid accretions organized protocell domains to drive the earliest evolution of the genetic code and the pre-life to cellular life transition. By contrast, evolution of tRNA, tRNAomes, aminoacyl-tRNA synthetases and translation systems followed highly ordered and systematic pathways, described by well-defined mechanisms and rules. The pathway of evolution of aminoacyl-tRNA synthetases, which tracked evolution of the genetic code, is clarified. Hydrogels and amyloids form a chaotic component, therefore, that complemented otherwise systematic processes. We describe with detail a pre-life world in which hydrogels and amyloids provided the selections of the first life.

Purpose: Perceptual learning and production practice are basic mechanisms that children depend on to acquire adult levels of speech accuracy. In this study, we examined perceptual learning and production practice as they contributed to changes in speech accuracy in three- and four-year-old children. Our primary focus was manipulating the order of perceptual learning and baseline production practice to better understand when and how these learning mechanisms interact. Method: Sixty-five typically-developing children between the ages of three and four were included in the study. Children were asked to produce CVCCVC nonwords like /bozjəm/ and /tʌvtʃəp/ that were described as the names of make-believe animals. All children completed two separate experimental blocks: a baseline block in which participants heard each nonword once and repeated it, and a test block in which the perceptual input frequency of each nonword varied between 1 and 10. Half of the participants completed a baseline-test order; half completed a test-baseline order. Results: Greater accuracy was observed for nonwords produced in the second experimental block, reflecting a production practice effect. Perceptual learning resulted in greater accuracy during the test for nonwords that participants heard 3 or more times. However, perceptual learning did not carry over to baseline productions in the test-baseline design, suggesting that it reflects a kind of temporary priming. Finally, a post hoc analysis suggested that the size of the production practice effect depended on the age of acquisition of the consonants that comprised the nonwords. Conclusions: The study provides new details about how perceptual learning and production practice interact with each other and with phonological aspects of the nonwords, resulting in complex effects on speech accuracy and learning of form-referent pairs. These findings may ultimately help speech-language pathologists maximize their clients’ improvement in therapy.

In this paper, we derive multifarious relationships among the two types of higher order q-Daehee polynomials and p-adic gamma function via Mahler theorem. Also, we compute some weighted p-adic q-integrals of the derivative of p-adic gamma function related to the Stirling numbers of the both kinds and the q-Bernoulli polynomials of order k.

In this paper, two types of the general fractional derivatives of distributed order as well as a corresponding fractional integral of distributed type are defined and their basic properties are investigated. The general fractional derivatives of distributed order are constructed for a special class of the one-parametric Sonin kernels with a power law singularities at the origin. The conventional fractional derivatives of distributed order based on the Riemann-Liouville and the Caputo fractional derivatives are particular cases of the general fractional derivatives of distributed order introduced in this paper.

The higher-order interactions in complex systems are gaining attention. Extending the classic bounded confidence model where an agent’s opinion update is the average opinion of its peers, this paper proposes a higher-order version of the bounded confidence model. Each agent organizes a group opinion discussion among its peers. Then, the discussion’s result influences all participants’ opinions. Since an agent is also the peer of its peers, the agent actually participates in multiple group discussions. We assume the agent’s opinion update is the average over multiple group discussions. The opinion dynamics rules can be arbitrary in each discussion. In this work, we experiment with two discussion rules: centralized and decentralized. We show that the centralized rule is equivalent to the classic bounded confidence model. The decentralized rule, however, can promote opinion consensus. In need of modeling specific real-life scenarios, the higher-order bounded confidence is convenient to combine with other higher-order dynamics, from the contagion process to evolutionary dynamics.

In this paper the D 3 dihedral logistic map of fractional order is introduced. The map 1 presents a dihedral symmetry D 3 . It is numerically shown that the construction and interpretation 2 of the bifurcation diagram versus the fractional order require special attention. The system stability 3 is determined and the problem of hidden attractors is analyzed. Also, analytical and numerical 4 results show that the chaotic attractor of integer order, with D 3 symmetries, looses its symmetry 5 in the fractional-order variant.

Many real complex systems present multilayer structure where high-order metadata on one layer refers to dyadic data on a lower layer. Significant progresses to analyse high-order metadata under the assumption of community organization have been done. However, there are no planted communities in real-world networks, and the necessity of new frameworks to analyze high-order metadata regardless of community organization has been raised.Here, we propose to adopt hyperedge organization. Predicting ‘entanglements’ between a hyperedge and nodes scattered in the rest of the network might suggest structural or functional liaisons, without assumption of any community organization. We introduce a novel concept: hyperedge entanglement (HE), which associates to each hyperedge an entangled hyperedge, by means of a network operator that predicts significant ‘interactions at distance’ between network nodes and existing hyperedges. We also introduce a new challenge termed hyperedge entanglement prediction (HEP), and an algorithm to perform this task. We evaluated HEP performance on social, biological and synthetic data where, given only topology and hyperedges (such as communities or functional modules), the goal is to predict whether nodes not connected to a certain hyperedge might be candidates for a significant entanglement. Finally, as real application in diseasome systems biomedicine, we perform HEP on the human protein interactome to predict unknown gene entanglements with the COPD disease gene hyperedge. HEP predictions are validated by biological experiments, enlarging our understanding of molecular mechanisms behind COPD/aneurysm comorbidity.

This paper presents a numerical algorithm for solving high-order BVPs. We introduce the construction method of multiscale orthonormal basis in W^m[0; 1] by multiscale orthonormal basis in W¹[0; 1]. We de fine approximate solution, and obtain the approximate solution of high-order BVPs by using the approximate theory. Moreover, the convergence and stability of the algorithm are improved. At last, several numerical experiments show the feasibility of the proposed method.

A premise of statistical learning research is that learners attend to and learn the frequencies of repeating or co-occurring elements in the input. When the input is a series of words, participants readily learn the frequencies of phoneme sequences, that is, to learn phonotactic frequencies. Inherent to the concepts of both frequency and phonotactics is order, or the temporal structure of the input. Order is similarly inherent to statistical learning, yet the effect of order on statistical learning is not well understood. In the present study, adult participants learned the relative frequencies of eight item-medial consonant sequences, for example, the /mk/ in /nʌmkət/. Across five ordering conditions, both familiarization and test stimuli were independently ordered and randomized, thus allowing for a relatively broad search for order effects in an established statistical learning paradigm. Participants learned the target frequencies equivalently across the five ordering conditions, indicating no modulating effect of order. Nevertheless, participants also approached the task by applying idiosyncratic, structured orders to their responses. The result is an unexpected but robust effect of order. Both the results and the design of the study also allow for increased integration of statistical learning with memory and other aspects of cognition.

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

We propose a class of stochastic models for a dynamics of limit order book with different type of liquidities. Within this class of models we study the one where a spread decreases uniformly, belonging to the class of processes known as a population processes with uniform catastrophes. The law of large numbers (LLN), central limit theorem (CLT) and large deviations (LD) are proved for our model with uniform catastrophes. Our results allow us to satisfactorily explain the volatility and local trends in the prices, relevant empirical characteristics that are observed in this type of markets. Furthermore, it shows us how these local trends and volatility are determined by the typical values of the bid-ask spread. In addition, we use our model to show how large deviations occur in the spread and prices, such as those observed in flash crashes.

In this paper, we compare the performance between systems of ordinary and (Caputo) fractional differential equations depicting the susceptible-exposed-infectious-recovered (SEIR) models of diseases. In order to understand the origins of both approaches as mean-field approximations of integer and fractional stochastic processes, we introduce the fractional differential equations as approximations of some type of fractional nonlinear birth--death processes. Then, we examine validity of the two approaches against empirical courses of epidemics; we fit both of them to case counts of three measles epidemics that occurred during the pre-vaccination era in three different locations. While FDEs appear more flexible in fitting empirical data, our ODEs offered better fits to two out of three data sets. Important differences in transient dynamics between these modeling approaches are discussed.

DGJ (Daftardar-Gejii-Jafaris) method is used to obtain numerical solution of the third order fractional differential equation. Providing the DGJ method converges, the approximate solution is a good and effective numerical result which is close to the exact solution or the exact solution. For this,the examples of the explaning the method are presented. The proposed method is implemented for the approximation solution of the third order nonlinear fractional partial differential equations. The method was shown to be unsuitable and inconsistent for an example of a nonlinear fractional partial differential equation depend on initial-boundary value conditions. The fact that these numerical results are not consistent can be explained by the fact that the method is not convergent.

To extend the calculation power of tensor analysis, we introduce four new definition of tensor calculations. Some useful tensor identities have been proved. We demonstrate the application of the tensor identities in continuum mechanics: momentum conservation law and deformation superposition.

Reliable prediction of infectious disease is an essential need for public health organizations to minimize or prevent the disease's spread. With the increase of data growth in the healthcare sector, accurate analysis of such data helps for early disease detection and better patient care. With the availability of huge data, it is a great deal for predicting and handling an epidemic occurrence. To control the epidemic disease, a new Artificial Intelligence called Manhattan Hessian Linear Feature Embedding Based Tucker Congruence Deep Convolutional Network (MHLFE-TCDCN) is introduced with higher accuracy and minimum time consumption. The MIoT device is used to collect the data from the patient body. The proposed MHLFE-TCDCN includes two major processes namely feature selection and classification with multiple layers such as input, two hidden layers, and one output layer. First, the feature selection process is performed using the Manhattan Hessian Locally Linear Embedding technique in the first hidden layer to minimize the dimensionality and time complexity. After selecting the feature, the classification is performed using the Tucker coefficient of congruence regression. The Tucker coefficient of congruence measures the similarity between the training and testing disease data. A positive similarity level is used to accurately identify the disease at the output layer based on the similarity measure. Experimental assessment is carried out with various parameters such as accuracy, precision, recall, F-measure, and computational time concerning several numbers of patient data. The quantitative results and discussion that the proposed MHLFE-TCDCN technique achieves higher accuracy with minimal computation time as compared to the conventional methods.

In this research article we solve the problem of synchronization and anti-synchronization of chaotic systems described by discrete and time-delayed variable fractional order differential equations. To guarantee the synchronization and anti-synchronization of these systems, we use the well-known PID control theory and the Lyapunov-Krasovskii stability theory for discrete systems of variable fractional order.We illustrate the results obtained through simulation with examples, in which it can be seen that our results are satisfactory, thus achieving synchronization and anti-synchronization of chaotic systems of variable fractional order with discrete time delay.

In the paper, the author introduces the notions "multi-order logarithmic numbers" and "multi-order logarithmic polynomials", establishes an explicit formula, an identity, and two recurrence relations by virtue of the Faa di Bruno formula and two identities of the Bell polynomials of the second kind in terms of the Stirling numbers of the fi rst and second kinds, and constructs some determinantal inequalities, product inequalities, logarithmic convexity for multi-order logarithmic numbers and polynomials by virtue of some properties of completely monotonic functions.

The only cases where exact distributions of estimates are known is for samples from exponential families, and then only for special functions of the parameters. So statistical inference was traditionally based on the asymptotic normality of estimates. To improve on this we need the {\it Edgeworth expansion} for the distribution of the standardized estimate. This is an expansion in $n^{-1/2}$ about the normal distribution, where $n$ is typically the sample size. The 1st few terms of this expansion were originally given for the special case of a sample mean. In earlier work we derived it for {\it any } standard estimate, hugely expanding its application. We call an estimate $\hat{w}$ of an unknown vector $w\in R^p$, a {\it standard estimate}, if $E\ \hat{w}\rightarrow w$ as $n\rightarrow \infty$, and for $r\geq 1$ the $r$th order cumulants of $\hat{w}$ have magnitude $n^{1-r}$ and can be expanded in $n^{-1}.$ Here we give another huge extension. We give the expansion of the distribution of {\it any smooth function} of $\hat{w}$, say $t(\hat{w})\in R^q,$ giving its distribution to $n^{-5/2}$. We do this by showing that $t(\hat{w})$, is a standard estimate of $t(w)$. This provides far more accurate approximations for the distribution of $t(\hat{w})$ than its asymptotic normality. %NOT USED: The building blocks of the Edgeworth expansions are the {\it cumulant coefficients } of the estimate. These cumulant coefficients are also needed for bias reduction, Bayes estimates and confidence regions. We give {\it chain rules} for the cumulant coefficients of $t(\hat{w})$ in terms of those of $\hat{w}$ and the derivatives of $t(w)$, up to those needed for 5th order Edgeworth expansions for $t(\hat{w})$ and its {\it tilted expansion}, useful for the tail of the distribution.

In this paper, we study properties of formal concepts from an order-theoretic perspective. We first establish a natural correspondence between formal contexts and preorders as well as their induced posets. Then, based on the poset induced from a formal context, we provide characterization for join-irreducible or meet-irreducible elements of finite concept lattices. In addition, we introduce the notion of rough conceptual approximations based on topological closure and interior operators. In contrast with the conventional definition of equivalence class of an object used in Pawlakian approximation spaces, we instead utilize the extent of an object concept. We show that rough conceptual approximations are equivalent to approximation operators in the generalized approximation space associated with the preorder corresponding to a formal context. We also illustrate these theoretical results with examples and discuss their potential applications.

Studying concurrent systems is to sort the read/write and control events in the concurrent system according to the order, or in partial order, or in strict order. Because of the concurrency of events and the timeliness of writing events, there will be overlap between events, which requires interval order analysis. A single start and end sequence to represent the entire hierarchical order structure as well as all equivalent spaced order observations.a single sequence of beginnings and endings to represent the entire stratified order structures as well as all equivalent interval order observations. Mazurkiewicz traces and Comtracks are hierarchical traces, but they cannot describe interval traces. In a few sentences of this summary, we can tell the problems (petri interval traces with data), the previous work (Mazurkiewicz traces, Comtracks), the reasons that cannot be solved, and our own solutions (DPN: Petri nets with data, interval traces). This paper focuses on a BE (Beginnings and Endings) sequence representing an equivalent class of runs, or targets. Our goal is to have a BE sequence to represent the entire hierarchical order structure, that is, all equivalent observable interval orders.

A stochastic dominance (SD) relation can be defined by two different perspectives: One from the view of distributions, and the other one from the view of expected utilities. In early days, Fishburn investigated SD from the view of distributions and we refer this perspective as Fishburn’s SD. One of his many results was the development of fractional-order SD for continuous distributions. However, discrete fractional-order SD may not be generalized directly since some properties of fractional calculus do not have a discrete counterpart. In this paper, we develop a discrete analogue of fractional-order SD from the view of distributions. We generalize the order of SD by Lizama’s fractional delta operator, show the preservation of SD hierarchy, and formulate the utility classes that are congruent with our SD relations. This work brings a message that some results of discrete SD cannot be generalized directly from continuous SD. We characterize the difference between discrete and continuous fractional-order SD, as well as the way to handle them.

A new type of ordinary differential equation is introduced and discussed, namely, the time-dependent order ordinary differential equations. These equations can be solved via fractional calculus and are mapped into Volterra integral equations of second kind with singular integrable kernel. The solutions of the time-dependent order differential equations smoothly deforms solutions of the classical integer order ordinary differential equations into one-another, and can generate or remove singularities. An interesting symmetry of the solution in relation to the Riemann zeta function and Harmonic numbers was also proved.

In this paper we study the initial boundary value problem for logarithmic Higher Order Wave equation. Introducing the Logarithmic Sobolev inequality and using the combination of Galerkin method, we consider the theorem of existence of a global weak solution to problem for the initial boundary value problem of the logarithmic wave equation. By constructing an appropriate Lyapunov function, we obtain the decay estimates of energy for logarithmic Higher Order Wave equation. The proof of the main theorem is given.

This paper first discusses a fractional-order Liu system of order as low as 2.7 and shows its chaotic characteristics by carrying out numerical simulations such as Lyapunov exponents, bifurcation diagrams and phase portraits. Then, by using the topological horseshoe theory and computer-assisted proof, the existence of chaos in the system is verified theoretically. Finally, the fractional-order system is implemented on a Field Programmable Gate Array (FPGA) and the results obtained show that the fractional-order Liu system is indeed chaotic.

Damage in concrete structures initiates as the growth of diffuse microcracks that is followed by damage localisation and eventually leads to structural failure. Weak changes such as diffuse microcracking processes are failure precursors. Identification and characterisation of these failure precursors at an early stage of concrete degradation and application of suitable precautionary measures will considerably reduce the costs of repair and maintenance. To this end, a reduced order multiscale model for simulating microcracking-induced damage in concrete at the mesoscale levelis proposed. The model simulates the propagation of microcracks in concrete using a two-scale computational methodology. First, a realistic concrete specimen that explicitly resolves the coarse aggregates in a mortar matrix was generated at the mesoscale. Microcrack growth in the mortar matrix is modelled using a synthesis of continuum micromechanics and fracture mechanics. Model order reduction of the two-scale model is achieved using clustering technique. Model predictions are calibrated and validated using uniaxial compression tests performed in the laboratory.

This work is intended to lead a study of necessary and sufficient optimality conditions for scalar optimization problems on Hadamard manifolds. In the context of this geometry, we obtain and present new function types characterized by the property of having all their second-order stationary points to be global minimums. In order to do so, we extend the concept convexity in Euclidean space to a more general notion of invexity on Hadamard manifolds. This is done employing notions of second-order directional derivative, second-order pseudoinvexity functions and the second-order Karush-Kuhn-Tucker-pseudoinvexity problem. Thus, we prove that every second-order stationary point is a global minimum if and only if the problem is either second-order pseudoinvex or second-order KKT-pseudoinvex depending on whether the problem regards unconstrained or constrained scalar optimization respectively. This result has not been presented in the literature before. Finally, examples of these new characterizations are provided in the context of \textit{"Higgs Boson like"} potentials among others.

The semi-logarithmic plot of the cumulative number of cases of epidemics resembles the response of a first-order systems for a step load. This similarity was utilized to develop a first order model that can be used for extracting information about the dynamics of infectious disease epidemics. The developed model was validated using COVID-19 data of China. It was also heuristically fitted to other 13 countries. Obtained results indicated that the model can reliably forecasts the number of infected person, epidemic growth speed towards steady-state condition (process time constant, T), and time to reach steady-state condition (4T). The developed model will help public health authorities in developing more effective control strategies of epidemics.

In this paper, we introduce the evolve-then-filter (EF) regularization method for reduced order modeling of convection-dominated stochastic systems. The standard Galerkin projection reduced order model (G-ROM) yield numerical oscillations in a convection-dominated regime. The evolve-then-filter reduced order model (EF-ROM) aims at the numerical stabilization of the standard G-ROM, which uses explicit ROM spatial filter to regularize various terms in the reduced order model (ROM). Our numerical results based on a stochastic Burgers equation with linear multiplicative noise. It shows that the EF-ROM is significantly better results than G-ROM.

The present work reports on the calculated electronic and magnetic structure of the binary Co-Ga system at high Co content. β-CoGa adopts a simple cubic CsCl type structure. Well-ordered CoGa does not exhibit collective magnetism but is a paramagnetic, metallic compound. Neither Co nor Ga deficiency induces magnetic order, however, ferromagnetism is observed for Co-Ga anti-site disorder. The magnetic moment per cell increases up to about 1.2 μB in the completely disordered body centered cubic structure. With increasing Co content, Co1+xGa1−x maintains the CsCl type structure and becomes ferromagnetic. Most important, a discontinuity of the magnetic order with composition is observed at about 10% excess Co, where a change from a low magnetic moment state to a high moment state is observed. This is accompanied by a change in the electronic structure and transport properties. The discontinuity is forced by the increasing exchange splitting related to the localized moment of the additional Co atoms that replace Ga. Subsequently, the magnetic moment increases continuously up to 2.5 μB for x=0.6. For x≳0.6, the structure changes to face centered cubic with random site occupation and the magnetic moment further increases. Above the magnetic discontinuity, the Curie temperature increases linearly with the Co content from the onset of ferromagnetism, until it reaches its maximum in pure Co.

We discuss the role of the opposing principles of order and disorder in physical and biological systems in determining stability, growth and evolution and bring forth the potential role of a cosmic ordering agency. We analyze its role in decreasing entropy by coarse-graining and hence in determining the initial low entropy state of the big bang universe. Since all physical and biological systems have either cycles of order and disorder alternating, or may have chaotic evolution with non-linear laws, the same is expected of the dynamics of the whole universe as well. The entropy of the initial state of the universe could be low because of the reduction of degrees of freedom (DoF) as one moves from physical encoding to neural encoding and then on to psychic encoding of information in a nested manner by coarse-graining. It is by such encoding that this cosmic agency enables the universe to pass through the big crunch phase and then rolls it out as the big bang universe from the initial state of low entropy.

Disputes on authorships or the order of authors on publications are among the most common conflicts in science, particularly where multi-author papers have become the norm. Here, I propose an adaptable and generalizable method to rationalize and democratize decisions about authorships, which can be applied in diverse scientific areas. In the process, the authors of a manuscript collect, discuss, score, and weight their contributions to the final manuscript. The decision process is assisted by a simple spreadsheet-based “authorship matrix”, which helps to break down the complexity of different contributions and their importance. The matrix generates a score s describing the percentage of the author’s total contributions and can be used to determine authorship and their order. The transparency and simplicity score s can reduce conflicts and thus increase productivity in collaborations.

In this work, several random Boolean networks (RBN) are generated and analyzed from two characteristics: their time evolution diagram and their transition diagram. To do this, its randomness is estimated using three metrics, of which algorithmic complexity is the only one capable of revealing both transitions towards the chaotic regime and the algorithmic contribution of certain states to the transition diagram and their relationship with the order they occupy in the temporal evolution of the respective RBN.

We investigate numerically the interactions of in-phase Airy beams modulated by a fundamental Gaussian beam and fourth-order diffraction in Kerr nonlinear media. Directly numerical simulations show that normal (anomalous) fourth-order diffractions and in-phase (out-of-phase) Gaussian beam affect the interactions of solitons generated from Airy beams in unique manners. Different from previous results that interactions between in-phase (out-of-phase) conventional beams are always attractive (repulsive), many anomalous interactions of Airy beams are obtained. Stable bound states of breathing Airy soliton pairs can be formed with the help of fourth-order diffraction and fundamental Gaussian beam.

The local and global order in dense packings of linear, semi-flexible polymers of tangent hard spheres are studied by employing extensive Monte Carlo simulations at increasing volume fractions. Chain stiffness is controlled by a tunable harmonic potential for the bending angle whose intensity dictates the rigidity of the polymer backbone as a function of the bending constant and equilibrium angle. The studied angles range from acute to obtuse ones, reaching the limit of rod-like polymers. We analyze how packing density and chain stiffness affect the ability of chains to self-organize at the local and global levels. The former corresponds to crystallinity as quantified by the Characteristic Crystallographic Element (CCE) norm descriptor, while the latter is computed through the scalar orientational order parameter. In all cases, we identify the critical volume fraction for the phase transition and gauge the established crystal morphologies, developing a complete phase diagram as a function of packing density and equilibrium bending angle. A plethora of structures is obtained, ranging from random hexagonal closed packed morphologies of mixed character and almost perfect face centered cubic (FCC) and hexagonal close-packed (HCP) crystals at the level of monomers, to nematic mesophases, with prolate and oblate mesogens at the level of chains. For rod-like chains, hysteresis is observed between the establishment of long-range nematic order and crystallization, while for right-angle chains both transitions are synchronized. A comparison is also provided against the analogous packings of monomeric and fully flexible chains of hard spheres.

Fractional differential equations have become a fundamental modelling approach for understanding and simulating the many aspects of nonlocality and spatial heterogeneity of complex materials and systems. Yet, while real-order fractional operators are nowadays widely adopted, little progress has been made in extending such operators to complex-order counterparts. In this work, we introduce new definitions for the complex-order fractional Laplacian, fully consistent with the theory of averaging of smooth functions over fractal sets, and present tailored spectral methods for their numerical treatment. The proposed complex-order operators exhibit a dual particle-wave behaviour, with solutions manifesting wave-like features depending on the magnitude of the imaginary part of the fractional order. Reaction-diffusion systems driven by the complex-order fractional Laplacian exhibit unique spatio-temporal dynamics, such as equilibrium of diffusion in random materials by interference of scattered waves, conduction block and highly fractionated propagation, or the generation of completely novel Turing patterns. Taken together, our results support that the proposed complex-order operators hold unparalleled capabilities to advance the description of multiscale transport phenomena in physical and biological processes highly influenced by the heterogeneity of complex media.

^{We consider the collective pricing orders in a minimum supply chain that is composed of a monopolistic manufacturer and many retailers that belong to the same chain store firm. The retailers have the freedom to raise or lower the local price. The chain store firm sets up the commercial rules for local retail stores to maximize its total payoff. The monopolistic manufacturer firm controls the total quantity supplied for the market to achieve maximum benefits. We applied the two dimensional Ising model in statistical physics to map the collective distribution of microscopic strategy of local retailers into the macroscopic total payoff of the chain store firm. The local stores choose to raise the price or lower the price based their own mind when the supply in market surpasses the demand. When the supply in market is far less than the demand, the stores synchronously raise prices, even though a local store only have the incomplete information of their nearest neighboring supermarket. We find the critical equation for the balance point between the action of supplier and the action of chain store management based on game theory and statistical physics. The critical equation can identify the Nash equilibrium point of the non-cooperative game between the manufacturer and the chain-store seller, and reveal different levels of collective operations. This statistical physics method also holds for more complicate supply chains and economic systems.}

We consider a model of predator-prey interaction at fractional-order where the predation obeys the ratio-dependent functional response and the prey is linearly harvested. For the proposed model, we show the existence, uniqueness, non-negativity as well as the boundedness of the solutions. Conditions for the existence of all possible equilibrium points and their stability criteria, both locally and globally, are also investigated. The local stability conditions are derived using the Magtinon's theorem, while the global stability is proven by formulating an appropriate Lyapunov function. The occurance of Hopf bifurcation around the interior point is also shown analytically. At the end, we implement the Predictor-Corrector scheme to perform some numerical simulations.

Most of existing fuzzy forecasting models partition historical training time series into fuzzy time series and build fuzzy-trend logical relationship groups to generate forecasting rules. The determination process of intervals is complex and uncertainty. In this paper, we present a novel fuzzy forecasting model based on high-order fuzzy-fluctuation trends and the fuzzy-fluctuation logical relationships of the training time series. Firstly, we compare each data with the data of its previous day in historical training time series to generate a new fluctuation trend time series(FTTS). Then, fuzzify the FTTS into fuzzy-fluctuation time series(FFTS) according to the up, equal or down range and orientation of the fluctuations. Since the relationship between historical FFTS and the fluctuation trend of future is nonlinear, Particle Swarm Optimization (PSO) algorithm is employed to estimate the required parameters. Finally, use the acquired parameters to forecast the future fluctuations. In order to compare the performance of the proposed model with that of the other models, we apply the proposed method to forecast the Taiwan Stock Exchange Capitalization Weighted Stock Index (TAIEX) time series datasets. The experimental results and the comparison results show that the proposed method can be successfully applied in stock market forecasting or such kinds of time series. We also apply the proposed method to forecast Shanghai Stock Exchange Composite Index (SHSECI) to verify its effectiveness and universality.

The Ramsey theory based approach to the phase transitions of the second order is suggested. The phase transitions of the second order are seen as switching of physical interactions/chemical bonds between the entities forming the primitive cell of the material. Such a switching is typical for a phase change materials. If the energy of the primitive cell is kept constant under the change in the spatial order of the chemical bonds, the phase transition of the second order takes place. The switching of interactions between the entities forming the primitive cell is accompanied by the breaking of the initial symmetry of the cell. The order parameter/the degree of ordering characterizing the ordering within the primitive cell is re-defined. The introduced degree of ordering quantifies ordering of links/interactions/chemical bonds between entities constituting the 2D lattice; whereas, the classical “Landau degree of order” quantifies the symmetry breaking under variation in spatial locations of these entities. The suggested approach is generalized easily for 3D primitive cells. Thermal capacity of the non-symmetrical phase is larger than that of the symmetrical phase. For the primitive cells built of six interacting entities, the Ramsey Theory predicts inevitable appearance of the unstable monochromatic triangles, when the links correspond to attraction or repulsion interactions. The situation becomes different for the primitive cells built of five interacting entities.

In this paper, we propose to explore a nonlinear fractional mathematical model of HFMD- Hand Foot Mouth Disease with vaccinated compartment. Firstly, we prove the non negativity and boundedness for the fractional order dynamical model. The system’s existence and uniqueness are studied using the formulation of the Caputo derivative operator. The fixed-point approach was used to get results indicating the presence of at least one solution. In numerical simulation, we obtained the approximate solution by using fractional Euler method.

Fractional calculus is defined by expanded integer order integration and differentiation. In this paper, multiple mathematical models of a nonlinear dual tank device are precisely formulated by fractional calculus. Using the accurate model, multivariable Fractional-Order Controller is designed for the nonlinear device. The merits of the fractional-order design include: 1) Control of multivariable nonlinearities, 2) Compensation of uncertainties, 3) Elimination of coupling effects. Simulations and experiments are conducted to verify the precision of the fractional order models and the effectiveness of the multivariable fractional-order control design.

In this paper, we concentrate on the study of the properties of residual Tsallis entropy for order statistics. Order statistics have an important role in reliability structural engineering for example for modelling lifetimes of series and parallel systems. The residual Tsallis entropy of ith order statistic from a continuous distribution function and its deviation from the residual Tsallis entropy of ith order statistics from a uniform distribution is investigated. In a mathematical framework, a method to express the residual Tsallis entropy of the ith order statistic from a continuous distribution in terms of the residual Tsallis entropy of the ith order statistic from a uniform distribution is provided. This approach may provide insight into the behavior and properties of the residual Tsallis entropy for order statistics. Further, we study the monotonicity properties of the residual Tsallis entropy of order statistics under dierent conditions. By studying these properties, deeper understanding of the relationship between the position of order statistics and the resulting residual Tsallis entropy is gained.

In this paper, we consider the fourth-order parabolic equations with integer and fractional order time derivatives with Neumann boundary conditions. The integer order time derivatives are approximated by backward Euler difference quotients, and the fractional order time derivatives are approximated by L1 interpolation. We propose the block-centered finite difference scheme for fourth-order parabolic equations of integer and fractional order time derivatives. We prove the stability of the block-centered finite difference scheme and the second-order convergence of the discrete L2 norms of the approximate solution and its derivatives of every order. Numerical examples are given to verify the effectiveness of the block-centered finite difference scheme.

We characterize the form of the order divisor graph of cyclic groups based on the group order. Furthermore, we describe some topological indices of the order divisor graph of cyclic groups, including the Wiener index, Harary index, first Zagreb index, and second Zagreb index.

In this paper, the 1st level general fractional derivatives of arbitrary order are defined and investigated for the first time. We start with a generalization of the Sonin condition for the kernels of the general fractional integrals and derivatives and then specify a set of the kernels that satisfy this condition and posses an integrable singularity of power law type at the origin. The 1st level general fractional derivatives of arbitrary order are integro-differential operators of convolution type with the kernels from this set. They contain both the general fractional derivatives of arbitrary order of the Riemann-Liouville type and the regularized general fractional derivatives of arbitrary order considered in the literature so far. For the 1st level general fractional derivatives of arbitrary order, some important properties including the 1st and the 2nd fundamental theorems of Fractional Calculus are formulated and proved.

We present an error reconciliation method for Quantum Key Distribution (QKD) that corrects 100% of errors generated in regular binary frames transmitted over a noisy quantum channel regardless of the quantum channel error rate. In a previous investigation, we introduced a novel distillation QKD algorithm whose secret key rate descends linearly with respect to the channel error rate. Now, as the main achievement of this work, we demonstrate an improved algorithm capable of retaining almost all the secret information enclosed in the regular binary frames. Remarkably, this technique increases quadratically the secret key rate as a function of the double matching detection events and doubly quadratically in the number of the quantum pulses. Furthermore, this reconciliation method opens up the opportunity to use less attenuated quantum pulses, would allow greater QKD distances at drastically increased secret key rate. Since our method can be implemented as a software update, we hope that quantum key distribution technology would be fast deployed over global data networks in the quantum era.

In this work, generalized geometry of second-order tangent groups and affine configuration complexes is proposed. Initially, geometry for higher weights n=4 and weights n=5 is presented through some interesting and suitable homomorphisms, finally, this geometry is extended and generalized for any weight n.

In this paper, we investigate the equilibrium points, stability of two equilibrium points, convergences of negative equilibrium point, periodic solutions, and existence of bounded or unbounded solutions of a system of nonlinear difference equations x_n+1 =x_n-1y_n - 1, y_n+1 = y_n-1x_n - 1 n = 0,1,..., where the initial values are real numbers. Additionally we present some numerical examples to verify our theoretical results.

This paper deals with the form, the stability character, the periodicity and the global behavior of solutions of the following four rational difference equations x_{n+1} = ((±1)/(x_{n}(x_{n-1}±1)-1)) x_{n+1} = ((±1)/(x_{n}(x_{n-1}∓1)+1)).

The study of order patterns of three equally spaced values $x_t,x_{t+d},x_{t+2d}$ in a time series is a powerful tool. The lag $d$ is changed in a wide range so that differences of frequencies of order patterns become autocorrelation functions. Similar to a spectrogram in speech analysis, four ordinal autocorrelation functions are used to visualize big data series, as for instance heart and brain activity over many hours. The method applies to real data without preprocessing, outliers and missing data do not matter. On the theoretical side, we study properties of order correlation functions and show that the four autocorrelation functions are orthogonal in a certain sense. An analysis of variance of a modified permutation entropy can be performed with four variance components associated with the functions.