Nonnegative matrix factorization (NMF) has been shown to be a strong data representation technique, with applications in text mining, pattern recognition, image processing, clustering and other fields. In this paper, we propose a hypergraph regularized Lp smooth nonnegative matrix factorization (HGSNMF), by incorporating hypergraph regularization and Lp smoothing constraint terms into the standard NMF. The hypergraph regularization term can capture the intrinsic geometry structure of the high dimension space data more comprehensively than simple graph, the Lp smoothing constraint may yield a smooth and more accurate solution to the optimization problem. The updating rules are given using multiplicative update techniques, and the convergence of HGSNMF is theoretically investigated. The experimental results on four different data sets show that the proposed method has better clustering effect than the related state-of-the-art methods in the vast majority of cases.

The continuous casting process of helical fiber reinforced metal matrix composites was proposed, and the experimental equipment was designed and manufactured. The relationship model be-tween the process parameters and the helical shape of the fibers in the metal matrix is analyzed by differential geometry. Helical carbon fiber reinforced lead matrix composites were prepared under different conditions. When the melting temperature and cooling intensity were increased, the helical radius of helical carbon fiber in lead matrix was increased. When the fiber rotation speed was increased, the helical radius was decreased, and the helical pitch was de-creased proportionally. The experimental results are consistent with the process model. Carbon fiber rein-forced aluminum composites were prepared. Scanning electron microscopy showed that the infiltration between the aluminum matrix and the carbon fiber was not complete. As the volume fraction of carbon fiber which was added in composites is too small, the mechanical properties of the composites have not been significantly improved.

This paper proposes an enhanced Quantum Key Distribution (QKD) protocol by incorporating a Three-Dimensional Angular Momentum Representation (3D AMR) to address vulnerabilities inherent in traditional two-dimensional polarization states-based systems. The 3D AMR method expands the state space, potentially increasing security against sophisticated quantum attacks. We present a theoretical and computational framework that transitions from the conventional two-dimensional polarization to a three-dimensional angular momentum space, which inherently increases the complexity and security of the quantum states used in QKD.

Lignin fibers typically influence the mixture performance of stone matrix asphalt (SMA), such as strength, stability, durability, noise level, rutting resistance, fatigue life, and water sensitivity. However, limited studies were conducted to analyze the influence of fibers on the percent voids in mineral aggregate in bituminous mixture (VMA) during the mixture design. This study analyzed the effect of different fibers and fiber contents on the VMA in SMA mixture design. A surface-dry condition method test and Marshall Stability test were applied on the SMA mixture with four different fibers (i.e., flocculent lignin fiber, mineral fiber, polyester fiber, blended fiber). The test results indicated that the bulk specific gravity of SMA mixtures and asphalt saturation decreased with the increasing fiber content, whilst the percent air voids in bituminous mixtures (VV), Marshall Stability and VMA increased. Mineral fiber had the most obvious impact on the bulk specific gravity of bituminous mixtures, while flocculent lignin fiber had a minimal impact. The mixture with mineral fiber and polyester fiber had significant effects on the volumetric properties, and, consequently, exhibited better VMA over the conventional SMA mixture with lignin fiber. Modified fiber content range was also provided, which will widen the utilization of mineral fiber and polyester fiber in the applications of SMA mixtures. The mixture evaluation suggested no statistically significant difference between lignin fiber and polyester fiber on the stability. The mineral fiber required a much larger fiber content to improve the mixture performance than other fibers. Overall, the results can be a reference to guide SMA mixture design.

This paper introduces a novel method for accurately calculating the upper biomass of single trees using Light Detection And Ranging (LiDAR) point cloud data. The proposed algorithm involves classifying the tree point cloud into two distinct ones: the trunk point cloud and the crown point cloud. Each part is then processed using specific techniques to create a 3D model and determine its volume. The trunk point cloud is segmented based on individual stems, with each stem further divided into slices that are modeled as cylinders. On the other hand, the crown point cloud is analyzed by calculating its footprint and gravity center. The footprint is further divided into angular sectors, with each being used to create a rotating surface around the vertical line passing through the gravity center. All models are represented in a matrix format, simplifying the process of minimizing and calculating the tree’s upper biomass, consisting of crown biomass and trunk biomass. To validate the proposed approach, both terrestrial and airborne datasets are utilized. A comparison with existing algorithms in the literature confirms the effectiveness of the new method. The study shows that the proposed algorithm achieves an average fit between 0.01 m and 0.49 m for individual trees.

While the number of publications on wine and health is steadily increasing, ranging from molecular level to epidemiological studies, often with contradictory results, little attention has been given to an holistic approach. In this review some unusual concepts are considered, such as phytocomplex, vehicle and the Matrix effect. As an example, three mono/polyphenols present in wine, Tyrosol, Hydroxytyrosol and Resveratrol, have been selected and the consequences of respecting, disregarding or ignoring the Matrix effect are shown. Underestimation of the wine Matrix effect could lead to deceiving results, as in the case of de-alcoholized wine or wine-compound-based nutritional supplements,or in emphasizing a single component toxic activity, in this case alcohol, ignoring the specific protective action at molecular level of other compounds (polyphenols) present in the same Matrix. The dark side of Matrix effect is also discussed. It is suggested that specificity of wine should be always taken in consideration by public health Authorities.

This study provides an in-depth review of the available literature on metal composite material machining, focusing on traditional machining operations such as turning, milling, shaping, drilling, and grinding. The motivation for the study is that this composite type has emerged as a vital material in applications requiring functionality, resilience, cost-effective operation, low consumption of energy and lightweight. Despite its superior characteristics, the manufacturing complexity and poor machinability of metal matrix composites have been the primary barriers to its adoption. Nevertheless, there is a reduction of exceptional efficiency, increase in surface roughness, tool wear and so on in metal matrix composites throughout machining. As a result, this review gives a comprehensive investigation of metal matrix composite machining and effect on process parameters and procedures. Furthermore, this study distinguishes metal matrix composites towards sustainable manufacturing and the metals employed by the researchers, as well as the gaps discovered for future recommendations in metal-based composites.

This note reconsiders a matrix equality $A_1A_2^{-}A_3A_4^{-}A_5 = A$ composed by six matrices of appropriate sizes, where $A_2^{-}$ and $A_4^{-}$ are generalized inverses of $A_2$ and $A_4$, respectively, and solves a selection of matrix set inclusion problems associated with various mixed reverse order laws for generalized inverses of products of two, three, and four matrices by means of this equality and its variations.

This paper considers the Hermitian solutions of a new system of commutative quaternion matrix equations, we establish both necessary and sufficient conditions for the existence of solutions. Furthermore, we derive an explicit general expression when it is solvable. To illustrate our main findings, we present two numerical algorithms and examples in this paper.

The report details out programming approach for automating warehouse using Answer Set Programming.

The release of the active substance from the matrix modified-release tablets based on Kollidon®SR and chitosan depends on its solubility in the dissolution medium and on the composition of the matrix-forming polymers. The study is based on new oral matrix tablets based on Kollidon®SR and chitosan, formulated to optimize the low oral bioavailability of chlorzoxazone, a non-steroidal anti-inflammatory drug, a class II Biopharmaceutical Classification System. Nine types of chlorzoxazone matrix tablets were obtained using the direct compression method, and their combination at 1:1, 1:2, 1:3 chlorzoxazone/ excipients, 20%-40% (w/w) Kollidon®SR, 3-7% (w/w) chitosan and the auxiliary substances were formulated in constant concentrations. Pharmaco-technical characterization included the analysis of flowability and compressibility properties (flow time, friction coefficient, angle of repose, Hausner ratio, Carr Index), and of pharmaco-chemical characteristics (mass and dose uniformity, thickness, diameter, mechanical strength, Friability, degree of softening, in vitro release profile) of the tablets. Based on the initial evaluation of the pharmaco-technical analysis, pharmaco-chemical characteristics, and in vitro release profile, only three matrix tablet formulations (F1b, F2b, and F3b) were further tested. They were evaluated through Fourier-transform infrared spectrometry, X-ray Diffraction, thermogravimetry, differential scanning calorimetry, and in vitro dissolution tests. The three formulations were comparatively studied regarding the release kinetics of active substances using in vitro release testing. The results were analyzed by fitting into four representative mathematical models for the modified release oral formulations. In vitro kinetic study reveals a complex mechanism of release occurring in the first (0 - 2 hours) and second (2.0 hours – 36 hours) steps of drug release. Two factors have been calculated to assess the release profile of chlorzoxazone: f1 - the similarity factor and f2 - the factor difference. The results have shown that both Kollidon®SR and chitosan may be used as matrix-forming agents when combined with chlorzoxazone. In vitro dissolution tests revealed the F2b sample, data suggesting a faster drug release. The three formulations showed optimum pharmaco-technical properties and in vitro kinetic study, and they had tremendous potential to be used in oral pharmaceutical products for the controlled delivery of chlorzoxazone.

This investigation mainly focused on the microstructural analysis of Al based hybrid metal matrix composites. Aluminium as base metal and reinforced with 2% B4 C, ZrO2 (2%,4%,6%), SiC (4%,8%,12%). Specimens were manufactured by using conventional stir casting technique. Hybrid metal matrix composites were examined by using Scanning electron microscope. This research explained XRD, EDS and Fractography analysis. This investigation shows the reinforced material has given better results in all aspects than pure Al6061 alloy and homogeneous dispersion of particles inside the matrix. Porosity, delamination, cracks, particle distributions were observed through microstructural analysis. Additionally determined the crystal size of pure Aluminium 6061 alloy and hybrid composites.

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, we introduce a way of representing a given mapping as the sum of odd and even mappings. Then, by using this representation, we investigate the stability of various forms for the general nonic functional equation.

AI research and implementations are growing, and so are the risks associated with AI (Artificial Intelligence) developments, especially when it’s difficult to understand exactly what they do and how they work, both at a localized level, and at deployment, in particular when distributed and on a large scale. Governments are pouring massive funding to promote AI research and education, yet research results and claims, as well as the effectiveness of educational programmes, can be difficult to evaluate given the limited reproducibility of computations based on ML (machine learning) and poor explainability, which in turn limits the accountability of the systems and can cause cascading systemic problems and challenges including poor reproducibility, reliability, and overall lack of trustworthiness. This paper addresses some of the issues in Knowledge Representation for AI at system level, identifies a number of knowledge gaps and epistemological challenges as root causes of risks and challenges for AI, and proposes that neurosymbolic and hybrid KR approaches can serve as mechanisms to address some of the challenges. The paper concludes with a postulate and points to related and future research

The realm of natural language processing has always been fascinated by the intricacies of sentence semantics. The emergence of context-aware word representations, especially from pre-trained models like ELMO and BERT, has revolutionized several semantic tasks including but not limited to, question answering, text categorization, and sentiment analysis. Despite these advancements, the integration of supplementary knowledge, particularly syntactic, to augment semantic comprehension in models remains an area ripe for exploration. This paper introduces the Syntactic Enhancement Network (SEN), a pioneering method for synergizing syntactic elements with established pre-trained language models. Our approach encompasses a dual-phase evaluation: initially, we delve into the syntactic augmentation of both RNN-based and Transformer-based language models; subsequently, we test our SEN's proficiency in two specific domains: the task of sentence completion and the extraction of biological relationships. The results are striking, with SEN achieving a stellar 91.2% accuracy in sentence completion—surpassing baseline models by a substantial 37.8%. In the context of biological relation extraction, SEN demonstrates competitive prowess with a 75.1% F1 score.

Scientific progress is increasingly dependent on knowledge in computation-ready forms. In the life sciences, among others, many scientists therefore extract and structure knowledge from the literature. In a process called manual curation, they enter knowledge into spreadsheets, or into databases where it serves their and many others' research. Valuable as these curation efforts are, the range and detail of what can practically be captured and shared remains limited, because of the constraints of current curation tools. Many important contextual aspects of observations described in literature simply do not fit in the form defined by these tools, and thus cannot be captured. Here we present the design of an easy-to-use, general-purpose method and interface, that enables the precise semantic capture of virtually unlimited types of information and details, using only a minimal set of building blocks. Scientists from any discipline can use this to convert any complex knowledge into a form that is easily readable and meaningful for both humans and computers. The method VSM forms a universal and high-level language for encoding ideas, and for interacting with digital knowledge.

In this paper we discuss a problem of generalization of binomial distributed triangle, that is sequence A287326 in OEIS. The main property of A287326 that it returns a perfect cube n as sum of n-th row terms over k; 0 ≤ k ≤ n−1 or 1 ≤ k ≤ n, by means of its symmetry. In this paper we have derived a similar triangles in order to receive powers m = 5; 7 as row items sum and generalized obtained results in order to receive every odd-powered monomial n^2m+1; m ≥ 0 as sum of row terms of corresponding triangle. In other words, in this manuscript are found and discussed the polynomials D_m(n,k) and U_m(n,k), such that, when being summed up over k in some range with respect to m and n returns the monomial n^2m+1.

Several Lung diseases can result in lung damage structural changes, with lung transplantation as a only therapeutic option when the disease reaches an advanced progression, unfortunately, the success of lung transplantation is limited. In this context, lung bioengineering is considered a potential therapeutic alternative and the current approach is based on the use of the natural extracellular matrix (ECM) of the decellularized lung. The use of undifferentiated cells to seed an ECM can be a more practical strategy for lung bioengineering but the sterilization of the organ for this recellularization process is still a challenge. In this sense, Low-Level Laser Therapy (LLLT) can emerge as a potential treatment alternative. Therefore, the objective of this study was to verify if LLLT, can optimize lung recelularization with mesenchymal stem cells by cytokine modulation. For this, we decellularized lungs from C57BL/6 mice perfusing SDS 1% via pulmonary artery, sterilized with LLL (660nm, 100mW, 30s). Whole lung scaffolds were recellularized: (1) Recellularized Lung (2) Recellularized Lung + LLLT. Mesenchymal stem cells derived from human tooth pulp (DPSc) were seeded into lungs and incubated for 24 hours at 37ºC, 5% CO₂, in a bioreactor-like conditions, maintaining CPAP at 20cmH2O, 90% O2, and LLL at wavelength of 808nm, 100mW, 30s. Culture medium were analyzed at 24 hours. H&E, immunostaining, SEM and ELISA assay were performed. We produced viable biological scaffolds absent of DNA content, preserving glycosaminoglycans and collagen I, III and IV, fibronectin, laminin and elastin and lung structure (SEM). The levels of IL-6 and IL-8 were stable during the 24 hours of culture. IFN-γ levels showed significant difference in the DPSc and DPSc+LLLT group in the 24-hour evaluation. The levels of IL-10 decreased after LLLT. These findings highlight LLLT's role in cytokine regulation and contamination prevention during lung recellularization with mesenchymal stem cells. Overall, these results demonstrated that LLLT's modulated cytokine levels and could prevent contamination during the lung recellularization process with mesenchymal stem cells, offering promise for enhanced therapeutic strategies in lung bioengineering.

Thin people who undergo implant insertion into the chest wall face a high risk of implant exposure to the external environment. Five months after an 8-year-old boy underwent implantable cardioverter-defibrillator (ICD) implantation in a subcutaneous pocket in the left anterolateral chest wall to manage long QT syndrome, ICD replacement became necessary owing to exposure risk from distal and lateral thinning of the ICD pocket. Pocket rupture and exposure would increase the risk of infection; therefore, we performed ICD removal and primary pocket closure. Two weeks later, a new suprafascial pocket was created, acellular dermal matrix (ADM) was attached to the inner wall to prevent ICD protrusion, and a new ICD was inserted. One year postoperatively, the ADM was engrafted, and no complications were observed. A thin subcutaneous layer increases the risk of ICD implantation complications. Inner wall strengthening with ADM can help prevent pocket rupture.

In Indonesia, types of meat are still identified manually due to increasing prices for beef and buf-falo ahead of Idul Fitri. Traders mix beef with pork to thwart the beef scam. Haar wavelet and GLCM, GLCM with angles of 0°, 45°, 90°, and 135°, as well as matrices using contrast, correlation, energy, homogeneity, and entropy, are used in feature extraction. The following are the results of meat image classification testing using k-NN, Haar wavelet, and GLCM: The k-NN algorithm shows superiority in identifying fresh (99%), frozen (99%), and rotten (96%) meat texture images with the most fantastic accuracy results in every situation. Meanwhile, GLCM routinely provides good results, especially regarding the texture image of fresh meat (183.21) and rotten meat (115.79). However, despite delivering less throughput than k-NN and GLCM, Haar wavelets are still helpful, especially when dealing with fresh meat texture images (89,96).

Uterine tube extracellular matrix is a key component that regulates tubal tissue physiology, and it has a region-specific structural distribution, which are directly associated to their functions. Considering this, application of biological matrices in culture systems is an interesting strategy to develop biomimetic tubal microenvironments and enhance their complexity. However, there are no established protocols to produce tubal biological matrices that consider the organ morphophysiology for such applications. Therefore, this study aimed to establish region-specific protocols to obtain decellularized scaffolds derived from porcine infundibulum, ampulla, and isthmus to provide suitable sources of biomaterials for tissue-engineering approaches. Porcine uterine tubes were decellularized in solutions of 0.1% SDS and 0.5% Triton X-100. Decellularization efficiency was evaluated by DAPI staining and DNA quantification. We analyzed ECM composition and structure by optical and scanning electronic microscopy, FTIR and Raman spectroscopy. DNA and DAPI assays validated the decellularization, presenting significative reduction of cellular content. Structural and spectroscopy analyses revealed that produced scaffolds remained well structured and with ECM composition preserved. YS and HEK293 cells were used to attest cytocompatibility, allowing cell survival and successful interaction with the scaffolds. These results suggest that such matrices are applicable for future biotechnological approaches in the reproductive field.

Scene classification plays an important role in the intelligent processing of high-resolution satellite (HRS) remotely sensed image. In HRS image classification, multiple features, e.g. shape, color, and texture features, are employed to represent scenes from different perspectives. Accordingly, effective integration of multiple features always results in better performance compared to methods based on a single feature in the interpretation of HRS image. In this paper, we introduce a multi-task joint sparse and low-rank representation model to combine the strength of multiple features for HRS image interpretation. Specifically, a multi-task learning formulation is applied to simultaneously consider sparse and low-rank structure across multiple tasks. The proposed model is optimized as a non-smooth convex optimization problem using an accelerated proximal gradient method. Experiments on two public scene classification datasets demonstrate that the proposed method achieves remarkable performance and improves upon the state-of-art methods in respective applications.

The transformation of the states of polarization of electromagnetic waves that interact with polarimetrically linear media can be represented by means of the associated Mueller matrix. A global measure of the ability of a linear medium to modify the states of polarization of incident waves, due to any combination of enpolarizing, depolarizing and retarding properties, is introduced as a distance of the Mueller matrix to the identity matrix. This new descriptor, called the polarizing power, is applicable to any Mueller matrix and can be expressed as a function of the degree of polarimetric purity and the trace of the Mueller matrix. The graphical representation of the feasible values of the polarizing power provides a general view of its main peculiarities and features. The values of the polarizing power for several typical devices are analyzed.

In this paper after introducing a model of binary data matrix (BDM) for physical parameters of an evolving system (of particles), we develop a Hilbert space as an ambient space to derive induced metric tensor on embedded parametric manifold identified by associated joint probabilities of particles observables (parameters). Parameter manifold assumed as space-like hypersurface evolving along time axis, an approach that resembles 3+1 formalism of ADM and numerical relativity. We show the relation of endowed metric with related density matrix. Identification of system density matrix by this metric tensor, leads to the equivalence of quantum Liouville equation and metric compatibility condition while covariant derivative of metric tensor has been calculated respect to Wick rotated time or spatial coordinates. After deriving a formula for expected energy per particles, we prove the equality of this expected energy with local scalar curvature of related manifold. We show the compatibility of BDM model with Hamilton-Jacobi formalism and canonical forms. On the basis of the model, I derive the Ricci flow like dynamics as the governing dynamics and subsequently derive the action of BDM model and Einstein field equations. Given examples clarify the compatibility of the results with well-known principles such as equipartition energy principle and Landauer’s principle. This model provides a background for geometrization of quantum mechanics compatible with curved manifolds and information geometry. Finally, we conclude a “bit density principle” which predicts the Planck equation, De Broglie wave particle relation, , Beckenstein bound and Bremermann limit.

Currently, obesity is a critical global public health burden. Numerous studies have demonstrated the regulation of the pathogenesis of obesity and metabolic abnormalities by the gut microbiota and microbial factors; however, their involvement in the various degrees of obesity is not yet understood well. Previously, obesity has been shown to be associated with decreased levels of vitamin B12. Considering exclusive microbial production of vitamin B12, we hypothesised that a decrease in cobalamin levels in obese individuals may be at least partially caused by its depleted production in the intestinal tract by the commensal microbiota. In the present study, our aim was to estimate the abundance of enzymes and metabolic pathways for vitamin B12 synthesis in the gut microbiota of mouse models of alimentary and genetically determined obesity, to evaluate the contribution of the obesogenic microbiome to vitamin B12 synthesis in the gut. We have defined a significantly lower representation of enzymes and metabolic pathways for vitamin B12 biosynthesis in obese mice compared to non-obese mice, wherein enzyme depletion was more pronounced in lepr(-/-) (db/db) mice, which developed severe obesity. The representation of enzymes involved in cobalamin synthesis is strongly correlated with representation of several microbes in high-fat diet fed mice, whereas there were almost no correlations in db/db mice. Therefore, the degree of obesity and the composition of the correspondent microbiota are the main contributors to the representation of genes and pathways for cobalamin biosynthesis in the mouse gut.

The present paper discusses a study of a class of Charlier matrix polynomials and its generalized analogue. Certain generating matrix functions, recurrence matrix relations, matrix differential equation, summation formulas and many new results have been discussed for these matrix polynomials. Weisner's group theoretic method is used to obtain matrix generating relations for Charlier matrix polynomials and the details of this method were given in this paper. Finally, we will discuss only briefly the procedure followed.

This article explores the intricate dynamics of complexity and emergence through the lens of a graphical model representing hippocampal functions. Utilizing a series of overlapping curves that intersect at varying degrees and frequencies, we create a visual metaphor for the sophisticated processes to store information observed in the hippocampus. This model not only depicts the spatial and frequency-related interactions of these curves but also illustrates the emergent patterns that arise from these interactions. These patterns exemplify the principles of complexity and emergence, where the collective behavior of simple elements results in intricate and unexpected outcomes. This graphical representation serves as a bridge between the abstract mathematical concepts of complexity theory and the tangible biological processes observed in neuroscience. By drawing parallels to the hippocampus, known for its role in memory formation and spatial navigation, the article sheds light on how complex systems, such as neural networks, exhibit properties that are more than just the sum of their parts. The model thus offers a unique perspective on understanding complex systems, not only in neuroscience but in broader scientific inquiries where complexity and emergent phenomena are pivotal.

The Collatz conjecture, a longstanding mathematical puzzle, posits that, regardless of the starting integer, iteratively applying a specific formula will eventually lead to the value 1. This paper introduces a novel approach to validate the Collatz conjecture by leveraging the binary representation of generated numbers. Each transition in the sequence is predetermined using the Collatz conjecture formula, yet the path of transitions is revealed to be intricate, involving alternating increases and decreases for each initial value. The study delves into the global flow of the sequence, investigating the behavior of the generated numbers as they progress toward the termination value of 1. The analysis utilizes the concept of probability to shed light on the complex dynamics of the Collatz conjecture. By incorporating probabilistic methods, this research aims to unravel the underlying patterns and tendencies that govern the convergence of the sequence. The findings contribute to a deeper understanding of the Collatz conjecture, offering insights into the inherent complexities of its trajectories. This work not only validates the conjecture through binary representation but also provides a probabilistic framework to elucidate the global flow of the sequence, enriching our comprehension of this enduring mathematical mystery.

VSM is a recently introduced method for entering and displaying any type of knowledge, in a form that is both semantically precise for computation and intuitive for human understanding. VSM is the combination of a new semantic model, and the design for a dedicated user interface to support it. Here we present the implementation of this user interface, as a sophisticated HTML-element, <vsm-box>, that can be embedded in any web-based curation app. We show how developers can use it for biocuration projects, customize it to particular end-user needs, and contribute to its growth. Vsm-box is open-source at https://github.com/vsmjs/vsm-box under the AGPL license, as a JavaScript (ES6) Vue.js web-component that runs in all modern web browsers. It is the capstone of the Vsmjs organization at https://github.com/vsmjs that groups its supporting modules. Extensive supplementary material on VSM and vsm-box is available at https://vsmjs.github.io.

The continuous flowing spacetime forms a spacetime group G, one of its fundamental groups is the Poincare group PO(1,3), and the matter and interaction fields are representations of its intrinsic spacetime group. As a kind of quantized space-time unit, space-time group elements generate both space-time manifolds and matter. Matter and fields are aggregates of the quantum space-time within them and determine their type: the Lorentz group SO(1,3) represents a rotating spacetime corresponding to visible matter and the translation group P^1,3 represents a translational spacetime corresponding to dark matter and dark energy. The aggregation mode of space-time degrees of freedom in matter reveals that charge conjugation symmetry is the inverse symmetry of internal time of charged particles, and the external parity breaking of neutrinos is also due to their internal spatial aggregation mode.

This paper is motivated by three main assumptions: (1) The currently dominant forms of knowledge representation (natural language text, formulas, graphics) are suboptimal to facilitate knowledge transfer between control engineering sub-fields and into potential application domains. (2) Formal knowledge representation (in general) is a promising supplementary approach, but (3) the established technologies so far have failed to be significantly adopted for formal representation of control engineering knowledge. Thus, after briefly reviewing existing representation methods, we introduce our own approach: The Python based imperative representation of knowledge (PyIRK) and its application to formulate the Ontology of Control Systems Engineering (OCSE). One of its main features is the possibility to represent the actual content of definitions and theorems as nodes and edges of a knowledge graph, which is demonstrated by selected elements from Lyapunov theory. While the approach is still experimental, the formalization already allows to apply methods of automated quality assurance and a semantic search mechanism. The current feature set of the framework is demonstrated on various examples before directions for further developments are discussed.

The paradigm of leveraging code as a dataset has recently gained traction, offering innovative solutions in domains such as automated commit message generation, pull request description automation, and program repair mechanisms. Consider the challenge in generating commit messages: traditional methods treat source code as a mere token sequence, applying neural machine translation models. This approach, however, overlooks the critical syntactic structures inherent in programming languages, which could offer deeper insights and improved accuracy. Building upon prior research, specifically the Code2Seq framework, which utilized Abstract Syntax Tree (AST) structural data for source code representation to automate method name generation, this paper extends and refines this concept. We introduce "CSR", a novel methodology adapted to represent code edits effectively. This paper investigates the impact of employing syntactic structure, focusing on the classification of code edits. Drawing inspiration from Code2Seq, "CSR" utilizes AST's structural properties, particularly the paths connecting leaf nodes, to enhance the task of code edit classification. This approach is rigorously evaluated on two distinct datasets, comprising fine-grained syntactic edits. Our comprehensive experiments reveal that incorporating syntactic structures does not significantly outperform simpler methodologies. While methods like Code2Seq and our proposed "CSR" show potential, our findings highlight that there is considerable scope for improvement and refinement before such techniques can be universally applied for learning representations of code edits. We anticipate that our findings will spark further research in this field, paving the way for more effective use of syntactic structures in code representation.

The evolution of sentence representation learning, especially with parse tree encoders, has shown remarkable progress. Traditional approaches predominantly rely on recursive encoding of tree structures, which impedes parallel processing capabilities. Additionally, these methods often overlook the significance of dependency tree arc labels. To overcome these limitations, we introduce the Syntax-Enhanced Transformer (SET), incorporating a novel dual-attention mechanism that integrates relation-focused attention alongside traditional self-attention. This design effectively encodes both dependency and spatial positional relationships within sentence dependency trees. Our approach innovatively incorporates syntactic information into the Transformer framework without compromising its inherent parallelizability. The SET demonstrates superior or comparable performance to contemporary methods across various sentence representation tasks, significantly enhancing computational efficiency.

Using classical clinical observations, we first outline an elementary conceptual model for the Mind Representation System, then move to a more elaborate mathematical model that refers to discrete cofibration with enriched fibers.

3D city models are being extensively used in applications such as evacuation scenarios and energy consumption estimation. The main standard for 3D city models is the CityGML data model which can be encoded through the CityJSON data format. CityGML and CityJSON use polygonal modelling in order to represent geometries. True topological data structures have proven to be more computationally efficient for geometric analysis compared to polygonal modelling. In a previous study, we have introduced a method to topologically reconstruct CityGML models while maintaining the semantic information of the dataset, based solely on the combinatorial map (C-Map) data structure. As a result of the limitations of C-Map's semantic representation mechanism, the resulting datasets could suffer either from semantic information loss or the redundant repetition of them. In this article, we propose a solution for a more efficient representation of both geometry, topology and semantics by incorporating the C-Map data structure in the CityGML data model and implementing a CityJSON extension to encode the C-Map data. In addition, we provide an algorithm for the topological reconstruction of CityJSON datasets to append them according to this extension. Finally, we apply our methodology to three open datasets in order to validate our approach when applied to real-world data. Our results show that the proposed CityJSON extension can represent all geometric information of a city model in a lossless way, providing additional topological information for the objects of the model.

In the paper, by virtue of a Lévy–Khintchine representation and an alternative integral representation for the weighted geometric mean, the authors establish a Lévy–Khintchine representation and an alternative integral representation for the Toader–Qi mean. Moreover, the authors also collect an probabilistic interpretation and applications in engineering of the Toader–Qi mean.

In this paper, we define Tetranacci and Tetranacci-Lucas matrix sequences and investigate their properties.

Hydrogels can be considered as mimics of extracellular matrix (ECM).Cytoskeleton through integrins is connected with ECM and cytoskeleton tension depends on ECM stiffness.A number of age-related diseases depend on cellular processes related with cytoskeleton function.Some examples of cancer initiation and progression and heart disease in relationship with ECM stiffness has been analysed.Incorporation of rigid particles in ECM can increase ECM stifness and to promote formation of internal residual stresses. Water migration, changes of water binding energy to biomactomolecules, changes of the state of water from tightly bound water to free and loosely bound water changes stiffness of ECM. Risks related with rigid particles incorporation into ECM have been also iscussed.

Cells actively sense differences in topology, matrix elasticity and protein composition of the extracellular microenvironment and adapt their function and morphology. In this study, we focus on the cross-talk between matrix stiffness and protein coating density that regulate morphology and proliferation dynamics of single myocytes. For this, C2C12 myocytes were monitored on L-DOPA functionalized hydrogels of 22 different elasticity and fibronectin density compositions. Static images were recorded and statistically analyzed to determine morphological differences and to identify the optimized extracellular matrix (ECM). Using that information, selected ECMs were used to study the dynamics before and after cell proliferation by statistical comparison of distinct cell states. We observed a fibronectin density independent increase of the projected cell area until 12 kPa. Additionally, changes in the fibronectin density led to an area optimum at about 2.6 μg/cm, which was confirmed by an independent F-actin analysis, revealing a maximum actin filament to cell area ratio of 7.5 %. The proliferation evaluation showed an opposite correlation between cell spreading duration and speed to the matrix elasticity and protein density, which did not affect the cell cycle duration. In summary, we identified an optimized ECM composition, while independent matrix properties regulate distinct cell characteristics.

This paper aims to unify q-derivative/q-integral and h-derivative/h-integral in a single definition, this will be called q−h-derivative/q−h-integral. These notions are further extended on finite interval [a,b] in the form of left and right q−h-derivatives and q−h-integrals. Some inequalities are studied for q−h-integrals which are directly connected with well known results. In diverse fields of science and engineering the theory based on q-derivatives/q-integrals and h-derivatives/h-integrals can be unified by using the concept of q−h-derivative/q−h-integral.

We demonstrate a new quantitative method to the sieve of Eratosthenes, which is an alternative to the sieve of Legendre. In this method, every element of a given set is sifted out once only, and therefore, this method is free of the Mobius function and of the parity barrier. Using this method, we prove that every sufficiently large even number is the sum of two primes, and that every even number is the difference of two primes in infinitely many ways.

In this article, our main purpose is to establish a new extension of Mittag-Leffler function by using the known extended beta function $\mathbf{B}_{\omega}(a,b;p)$ introduced in [1]. It led to a novel extension of the applicability of Mittag-Leffler function that introduced them as distributions defined for a specific set of functions. We also, investigate some of its important properties, namely recursion relation, Mellin transform and differential formulas.

In this paper, we propose a novel approach to recognize radar targets on inverse synthetic aperture radar (ISAR) and synthetic aperture radar (SAR) images. This approach is based on the multiple salient keypoint descriptors (MSKD) and multitask sparse representation based classification (MSRC). Thus, to characterize the targets in the radar images, we combine the scale-invariant feature transform (SIFT) and the saliency map. The goal of this combination is to reduce the SIFT keypoints and their time computing time by maintaining only those located in the target area (salient region). Then, we compute the feature vectors of the resulting salient SIFT keypoints (MSKD). This methodology is applied for both training and test images. The MSKD of the training images leads to construct the dictionary of a sparse convex optimization problem. To achieve the recognition, we adopt the MSRC taking into consideration each vector in the MSKD as a task. This classifier solves the sparse representation problem for each task over the dictionary and determines the class of the radar image according to all sparse reconstruction errors (residuals). The effectiveness of the proposed approach method has been demonstrated by a set of extensive empirical results on ISAR and SAR images databases. The results show the ability of our method to predict adequately the aircraft and the ground targets.

Bonchev and Trinajstic defined two distance based entropy measures to measure the molecular branching of molecular graphs in 1977 [Information theory, distance matrix, and molecular branching, J. Chem. Phys., 38 (1977), 4517–4533]. In this paper we use these entropy measures which are based on distance matrices of graphs. The first one is based on distribution of distances in distance matrix and the second one is based on distribution of distances in upper triangular submatrix. We obtain the two entropy measures of paths, stars, complete graphs, cycles and complete bipartite graphs. Finally we obtain the minimal trees with respect to these entropy measures with fixed diameter.

Biases in Artificial Intelligence (AI) or Machine Learning (ML) systems due to skewed datasets problematise the application of prediction models in practice. Representation bias is a prevalent form of bias found in the majority of datasets. This bias arises when training data inadequately represents certain segments of the data space, resulting in poor generalisation of prediction models. Despite AI practitioners employing various methods to mitigate representation bias, their effectiveness is often limited due to a lack of thorough domain knowledge. To address this limitation, this paper introduces human-in-the-loop interaction approaches for representation debiasing of generated data involving domain experts. Our work advocates for a controlled data generation process involving domain experts to effectively mitigate the effects of representation bias. We argue that domain experts can leverage their expertise to assess how representation bias affects prediction models. Moreover, our interaction approaches can facilitate domain experts in steering data augmentation algorithms to produce debiased augmented data and validate or refine the generated samples to reduce representation bias. We also discuss how these approaches can be leveraged for designing and developing user-centred AI systems to mitigate the impact of representation bias through effective collaboration between domain experts and AI.

This is the first paper in a cycle investigating the exact solution of the loop equation for decaying unforced turbulence in three dimensions, which we have found in the previous work. In this paper, we prove the exact equivalence of this solution (the Euler ensemble) to the theory of Fermi particles on a ring. The continuum limit of this theory will be studied in the next papers.

The Semantic-Enhanced Tree-LSTM (SeT-LSTM) network, a novel advancement in the realm of linguistic modeling, marks a significant step forward from traditional Tree-based Long Short Term Memory (LSTM) networks. By intricately weaving in the nuances of typed grammatical dependencies, SeT-LSTMs offer a more nuanced understanding of language semantics. Traditional models often overlook the semantic shift caused by variations in word or phrase roles, a gap this paper aims to fill by focusing on the types of grammatical connections, or typed dependencies, within sentences. Our proposed architecture, dubbed the Semantic Relationship-Guided LSTM (SRG-LSTM), leverages a control mechanism to model the interplay between sequence elements. Additionally, we present a novel Tree-LSTM variant, the Semantic Dependency Tree-LSTM (SDT-LSTM), which integrates dependency parse structures with dependency types for more robust sentence embedding. The SDT-LSTM demonstrates superior performance in Semantic Relatedness Scoring and Sentiment Analysis compared to its predecessors. Qualitatively, it shows resilience to changes in sentence voice and heightened sensitivity to nominal alterations, aligning well with human intuition. This research underlines the pivotal role of grammatical relationships in sentence understanding and paves the way for further exploration in this domain.

Self-supervised learning is a method that learns general representation from unlabeled data. Masked image modeling (MIM), one of the generative self-supervised learning methods, has drawn attention showing state-of-the-art performance on various downstream tasks, though showing poor linear separability resulting from the token-level approach. In this paper, we propose a contrastive learning-based multi-view masked autoencoder for MIM, exploiting an image-level approach by learning common features from two different augmented views. We strengthen MIM by learning long-range global patterns from contrastive loss. Our framework adopts simple encoder-decoder architecture, learning rich and general representation by following a simple process: 1) two different views are generated from an input image with random masking and by contrastive loss, we can learn semantic distance of the representations generated by an encoder. By applying a high mask ratio, 80%, it works as strong augmentation and alleviates the representation collapse problem. 2) With reconstruction loss, decoder learns to reconstruct an original image from the masked image. We assess our framework by several experiments on benchmark datasets of image classification, object detection, and semantic segmentation. We achieve 84.3% fine-tuning accuracy on ImageNet-1K classification and 76.7% in linear probing, exceeding previous studies and show promising results on other downstream tasks. Experimental results demonstrate that our work can learn rich and general image representation by applying contrastive loss to masked image modeling.

Recognizing highly occluded objects is believed to arises from the interaction between the brain's vision and cognition controlling areas, although supporting neuroimaging data is currently limited. To explore the neural mechanism during this activity, we conducted an occlusion object recognition experiment using functional magnetic resonance imaging (fMRI). During magnet resonance examinations, 66 subjects engaged in object recognition tasks with three different occlusion degrees. Generalized linear model (GLM) analysis showed that the activation degree of occipital lobe (inferior occipital gyrus, middle occipital gyrus, and occipital fusiform gyrus) and dorsal anterior cingulate cortex (dACC) was related to the occlusion degree of the objects. Multivariate pattern analysis (MVPA) further unearthed a considerable surge in classification precision when dACC activation was incorporated as a feature. This suggested the combined role of dACC and occipital lobe in occluded object recognition tasks. Moreover, psychophysiological interaction (PPI) analysis disclosed that functional connectivity (FC) between the dACC and the occipital lobe was enhanced with increased occlusion, highlighting the necessity of FC between these two brain regions in effectively identifying exceedingly occluded objects. In conclusion, these findings contribute to understanding the neural mechanisms of highly occluded objects recognition, augmenting our appreciation of how the brain manages incomplete visual data.

This paper proposes a Grouped Contrastive Learning of self-supervised Sentence Representation (GCLSR), which can learn an effective and meaningful representation of sentences. Previous works maximize the similarity between two vectors to be the objective of contrastive learning, suffering from the high-dimensionality of the vectors. In addition, most previous works have adopted discrete data augmentation to obtain positive samples and directly employed contrastive framework of computer vision to perform contrastive training, which could hamper contrastive training because text data is discrete and sparse compared with image data. To address those issues, we propose a grouped contrastive learning framework, i.e., GCLSR, which divides the high-dimensional feature vector into several groups and respectively computes the groups’ contrastive losses to make use of more local information, eventually obtaining a more fine-grained sentence representation. In addition, in GCLSR, we design a new self-attention mechanism and a continuous as well as partial word vector augmentation (PWVA). For the discrete and sparse text data, the usage of self-attention could help model focus the informative words by measuring the importance of every word in a sentence. By using the PWVA, GCLSR can obtain high-quality positive samples used for contrastive learning. Experimental results demonstrate that our proposed GCLSR achieves an encouraging result on the challenging datasets of the standard semantic textual similarity (STS) task and transfer task.

This paper introduces a method to achieve optimal Gaussian estimation even when operating with low precision numerical representations of the full covariance matrix, such as 16-bit integer or 32-bit single precision formats, instead of more expensive double precision floating point representations (64 bits). The approximation's numerical error is accurately estimated in a conservative manner, resulting in minimal covariance inflation. When combined with a compressed estimator like the GCKF (Global Compressed Kalman Filter), which performs global updates at low frequency, this approach produces estimates that are nearly identical to the optimal ones. The deviation between the results obtained using this new approach and those obtained with the standard GCKF (which operates in double precision) is negligible. This new method is particularly relevant in high-dimensional estimation problems that require high-frequency operation. By leveraging the compressed operation of the GCKF, the estimation process applies the necessary approximation only during low-frequency global updates, using the single precision format instead of the more expensive double precision representations. The introduced numerical approximation is accurately estimated while maintaining a conservative approach, resulting in minimal covariance inflation. When combined with the GCKF, which performs global updates at low frequency, the estimates produced are almost identical to the optimal ones. This approach is particularly useful in high-dimensional estimation problems that require high-frequency operation. By representing the full covariance matrix in a low precision numerical format and applying appropriate scaling, memory usage is significantly reduced, offering substantial benefits for high-dimensional estimation problems and enabling real-time smoothing processes in such cases. By reducing the memory requirements for storing the full covariance matrix, the CPU avoids encountering a high number of page faults, resulting in improved processing performance. Lastly, the experimental section verifies the performance of the proposed approach in a single precision (32-bit floating point) GCKF SLAM process, assessing expected values and standard deviations of marginal PDFs.

Many studies in the field of robot navigation have focused on environment representation and localization. The goal of map representation is to summarize spatial information in topological and geometrical abstracts. By providing strong priors, maps improve the performance and reliability of automated robots. Due to the transition to fully automated driving in recent years, there has been a constant effort to design methods and technologies to improve the precision of road participants and the environment's information. Among these efforts is the High Definition (HD) Map concept. Making HD maps requires accuracy, completeness, verifiability, and extensibility. Because of the complexity of HD mapping, it is currently expensive and difficult to implement, particularly in an urban environment. In an urban traffic system, the road model is at least a map with sets of roads, lanes, and lane markers. While more research is being dedicated to mapping and localization, a comprehensive review of the various types of map representation is still required. This paper presents a brief overview of map representation, followed by a detailed literature review of HD Map for automated vehicles. The current state of AV mapping is encouraging, the field has matured to a point where detailed maps of complex environments are built in real-time and have been proved useful. Many existing techniques are robust to noise and can cope with a large range of environments. Nevertheless, there are still open problems for future research. AV mapping will continue to be a highly active research area essential to the goal of achieving full autonomy.

This paper is devoted to the foundational problems of dendrogramic holographic theory (DH-theory). We use the ontic-epistemic (implicate-explicate order) methodology. The epistemic counterpart is based on representation of data by dendrograms constructed with hierarchic clustering algorithms. The ontic Universe is described as the p-adic tree; it is zero dimensional, totally disconnected, disordered, and bounded (in p-adic ultrametric). Interrelation classical-quantum loses its sharpness; generally simple dendrograms are ``more quantum’’ than complex one. We use the CHSH-inequality as a measure of quantum(-likeness). We demonstrate that it can be violated by classical experimental data represented by dendrograms. The seed of this violation is neither nonlocality nor rejection of realism. This is nonergodicity of dendrogramic time series. Generally, violation of ergodicity is one of the basic features of DH-theory. We also consider DH-theory for Minkovski geometry and monitor the dependence of CHSH-violation and nonergodicity on geometry as well as a Lorentz transformation of data.

The paper describes an algorithm for semantic representation of behavioral contexts relative to a dichotomic decision alternative. The contexts are represented as quantum qubit states in two-dimensional Hilbert space visualized as points on the Bloch sphere. The azimuthal coordinate of this sphere functions as a one-dimensional semantic space in which the contexts are accommodated according to their subjective relevance to the considered uncertainty. The contexts are processed in triples defined by knowledge of a subject about a binary situational factor. The obtained triads of context representations function as stable cognitive structure at the same time allowing a subject to model probabilistically-variative behavior. The developed algorithm illustrates an approach for quantitative subjectively-semantic modeling of behavior based on conceptual and mathematical apparatus of quantum theory.

We present an ontology log-OLOG- representation of the classical Miller-Urey experiment, usually considered as a paradigm for spontaneous generation of biomolecules on the prebiotic Earth and also, as a key in understanding the chemical evolution phenomena linked to the origins of life. Ologging The Miler-Urey experiment enables us, through the categorical notion of fibre product or pullback, to define the concept of Biogenic Space, as a space containing low complexity biogenic units subjected to appropriate physical and chemical conditions, facilitating the synthesis of highly complex organic molecules. Also, we characterize the Biogenic Space as a concrete universal object that could be associated with the preconditions for life inside various structures in the universe such as exoplanets and exomoons located in habitable zones, but also in interstellar and intergalactic organic clouds.

In this note we construct explicit complex and real matrix representations for the generators of real Clifford algebra $C\ell_{p,q}$. The representation is based on Pauli matrices and has an elegant structure similar to the fractal geometry. We find two classes of representation, the normal representation and exceptional one. The normal representation is a large class of representation which can only be expanded into $4m+1$ dimension, but the exceptional representation can be expanded as generators of the next period. In the cases $p+q=4m$, the representation is unique in equivalent sense. These results are helpful for both theoretical analysis and practical calculation. The generators of Clifford algebra are the faithful basis of $p+q$ dimensional Minkowski space-time or Riemann space, and Clifford algebra converts the complicated relations in geometry into simple and concise algebraic operations, so the Riemann geometry expressed in Clifford algebra will be much simple and clear.

Matrix metalloproteinases (MMPs) have been demonstrated to have both detrimental and protective functions in inflammatory diseases. Several MMP inhibitors, with the exception of Periostat®, have failed in Phase III clinical trials. As an alternative strategy, recent efforts have been focussed on the development of more selective inhibitors or targeting other domains than their active sites (e.g., exosites, ectosites) through specific small molecule inhibitors or monoclonal antibodies. Here, we present some examples that aim to better understand the mechanisms of conformational changes/allosteric control of MMPs functions. In addition to MMP inhibitors, we discuss unbiased global approaches such as proteomics and N-terminomics to identify new MMP substrates and achieve a better understanding of the roles of these proteases in diseases.

The closed forms of the non-resonant thermonuclear function in the Maxwell-Boltzmann and Tsallis case with depleted tail are obtained in generalized special functions. The results are written in terms of H-function of two variables. The importance of the results in this paper lies in the fact that the reaction rate probability integrals in Maxwell-Boltzmann and Tsallis cases are not obtained by the conventional method of approximation or by means of a single variable transform technique but by means of a two variable transform method. The Behaviour of the depleted non-resonant thermonuclear functions are examined using graphs. The results in the paper are of much interest to astrophysicists and statisticians in their further work in this area.

Introduced in 1967 by Lov\'{a}sz, graph exponentiation has received little attention over the past several decades. Since graph exponentiation produces large graphs and any graph can be constructed utilizing its adjacency matrix, we provide a four step linear construction algorithm that generates the adjacency matrix for the graph exponential.

Biofilm matrix is akin to bacterial abodes, primarily composed of proteins, polysaccharides, extracellular DNA, and lipids, providing essential structural support to bacteria. While some biofilm matrix offers significant benefits, such as engineered biofilm reactors that assist in water pollutant removal, others pose risks to human health, potentially leading to conditions like lung infections. Realizing the potential of advantageous biofilm matrix and mitigating the harmful effects of detrimental ones necessitates a comprehensive and systematic exploration of this intricate domain. To facilitate this examination, our study leveraged a dataset of the 1000 most pivotal papers in the field and conducted an exhaustive bibliographic review. This paper serves as a valuable resource for understanding the current progress in biofilm matrix research and delving into vital avenues for future exploration in this dynamic field.

We report a theoretical derivation of the Cabibbo-Kobayashi-Maskawa (CKM) matrix parameters and the accompanying mixing angles. These results are arrived at from the exceptional Jordan algebra applied to quark states, and from expressing flavor eigenstates (i.e. left-chiral states) as superposition of mass eigenstates (i.e. the right-chiral states) weighted by square-root of mass. Flavor mixing for quarks is mediated by the square-root mass eigenstates, and the mass ratios used have been derived in earlier work from a left-right symmetric extension of the standard model. This permits a construction of the CKM matrix from first principles. There exist only four normed division algebras, they can be listed as follows - the real numbers $\mathbb{R}$, the complex numbers $\mathbb{C}$, the quaternions $\mathbb{H}$ and the octonions $\mathbb{O}$. The first three algebras are fairly well known; however, octonions as algebra are less studied. Recent research has pointed towards the importance of octonions in the study of high energy physics. Clifford algebras and the standard model are being studied closely. The main advantage of this approach is that the spinor representations of the fundamental fermions can be constructed easily here as the left ideals of the algebra. Also the action of various Spin Groups on these representations too can be studied easily. In this work, we build on some recent advances in the field and try to determine the CKM angles from an algebraic framework. We obtain the mixing angle values as $\theta_{12}=11.093^o, \theta_{13}=0.172^o, \theta_{23}=4.054^o$. In comparison, the corresponding experimentally measured values for these angles are $13.04^o \pm 0.05^o, 0.201^o \pm 0.011^o, 2.38^o \pm 0.06^o $. The agreement of theory with experiment is likely to improve when running of quark masses is taken into account.

Metal matrix composite are used in such fields of technology, such as: aerospace, electronics, energy, industry, defense, automotive, aviation, shipbuilding, and more. Composite coatings of ceramic - metals is used primarily to enhance the durability of machine parts. Therefore, new materials are permanently looked for, what has resulted in the past in development of composite materials. The coatings dispersed are consisting of metallic matrix (metals and their alloys) and small non-metallic particles. The deposition of ceramic particles simultaneously with metallic matrix leads often to composite coatings possessing properties much better than those of metallic coating. The nickel and less often, other iron group elements are usually used as a matrix and Al2O3 as tough particles. The welding technology of applying alloy and composite coatings is widely used. The technology of infrasound thermal spraying of metal matrix composite coatings was presented. It is a simple technology and a very useful one in ship machinery regeneration during the cruise craft (e.g. internal combustion engines, torque pumps, separators). The metal matrix composite coatings must undergo finishing due to high surface roughness after application. In the article to used finishing by plastic working and machining of coatings nickel matrix composite was proposed.

We leverage the explainability feature of KAN network and build an explainable language model where certain neurons encode individual words and neuron activation is fully interpretable in terms of the basis of a word. To do that, we propose a continuous word2vec model where a meaning of a word is expressed by a continuous profile of distances of this word from the words in the basis of words which is interpolated. As a result, the whole KAN network can be interpreted as a sequential procedure with word expressions. We then proceed from words to logic programs and develop a clause learning technique based on KAN. A logic program construction process from facts now become fully interpretable. We follow the differentiable inductive logic programming technique, representing a logic program as a matrix learned by KAN. Hence, we obtain an efficient and fully interpretable rule learning approach.

In this paper, we use a machine learning method, known as Nonnegative Matrix Factorization, to extract from a given image some new information obtained from a number of color space representations. Such kind of information, termed ``metacolor'', can be considered as a particular color space representation of the image, which can be used to obtain a binary segmentation of the investigated image by distinguishing foreground and background pixels. Some numerical experiments prove that the proposed method shows improved results when compared with common simpler thresholding algorithms.

The art of representing source code is pivotal in numerous programming analysis applications. Recent strides in neural networks have marked notable successes in this realm. However, the peculiar structural characteristics inherent in programming languages have not been fully exploited in existing models. While neural models based on abstract syntax trees (ASTs) adeptly manage the tree-like nature of source codes, they fall short in discerning the diverse substructural nuances within programs. This paper introduces the Dynamic Syntax Tree Model (DSTM), an innovative approach that fuses various neural network modules into tree architectures tailored to the specific AST of the input. Distinct from preceding tree-based neural models, DSTM adeptly discerns the semantic variances across different AST substructures. We validate DSTM through rigorous testing in program classification and code clone detection, outperforming contemporary methods and demonstrating the benefits of harnessing intricate source code structures.

The continuous nature of space and time is a fundamental tenet of many scientific endeavours. That digital representation imposes granularity is well recognized but whether it is possible to address space completely remains unanswered. Part 1 argues that Hales’ proof of Keppler’s conjecture on the packing of hard spheres suggests the answer to be ‘no’, providing examples of why this matters in GIS generally and spatio-temporal GIS in particular. Part 2 seeks to resolve the dichotomy between continuous and granular space, showing how a continuous space may be emergent over a random graph. However, its projection into 3D/4D imposes granularity. Perhaps surprisingly, representing space and time as locally conjugate may be key to addressing a ‘smooth’ spatial continuum. This insight leads to the suggestion of Face Centered Cubic Packing as a space-time topology but also raises further questions for spatio-temporal representation.

This paper focuses on the combination of the method of moments and the wire-grid approximation as an effective computational technique for modeling symmetrical antennas with low computational cost and quite accurate results. The criteria and conditions for the use of wire-grid surface approximation from various sources are presented together with new recommendations for modeling symmetrical antenna structures using the wire-grid approximation. These recommendations are used to calculate the characteristics of biconical and horn antennas at different frequencies. The results obtained using different grid and mesh settings are compared to those obtained analytically. Moreover, the results are compared to those obtained using the finite difference time domain numerical method, as well as the measured ones. All results are shown to be in a good agreement. The used recommendations for building a symmetrical wire-grid of those symmetrical antenna elements provided the most advantageous parameters of the grid and mesh settings and the wire radius, which are able to give a quite accurate results with low computational cost. Additionally, the known equal area rule was modified for a rectangular grid form. The obtained radiation patterns of a conductive plate using both the original rule and the modified one are compared with the electrodynamic analysis results. It is shown that the use of the modified rule is more accurate when using a rectangle grid form.

We propose a non-invasive approach to control the quality of spheroids and their fusion into a complex bioconstruct. The proposed method is based on the union of the nutrient concentration change calculated using Fick's law and the "reaction-diffusion" equations, taking into account absorption coefficient with specifying the exact fusion geometry using implicit Function Repre-sentation (FRep) functions. The proposed approach allows us to analyze the viability of cells within the spheroid, predict the fusion of spheroids, and accurately model complex heteroge-neous biostructures as a future task for our research. These results will significantly accelerate the development of such a promising field of additive biotechnologies as 3D bioprinting.

The PILAR model provides a dynamical systems perspective on collaboration. Two studies are performed using peer assessment data, both testing empirical support for the five Pillars (prospects, involved, liked, agency, respect) that constitute member’s perceptions of collaboration viability. The first study analyses peer-assessment data collected online from 458 first-year engineering students (404 males; 54 females). A nine-item instrument was inherited from past year’s usage in the course, expanded with four additional items to elaborate upon the agency and liked Pillars. Exploratory factor analysis was conducted on student responses to test whether they thematically aligned to constructs consistent with the five Pillars. As anticipated, twelve of the thirteen items grouped into five components, each aligned with a Pillar, providing empirical evidence that the five Pillars represent perceptions of collaboration. The second study replicated the first study using a retrospective analysis of 87 items included in the Comprehensive Assessment of Team Member Effectiveness (CATME) peer-assessment tool. The associated factor analyses resulted in five components and conceptual alignment of these components with Pillars was evident for three of five CATME components. We recommend a peer-assessment instrument based upon PILAR as potentially more parsimonious and reliable than an extensive list of behaviours, such as employed by CATME. We also recommend including items that target inter-rater bias, which is aligned with the liked Pillar, that instruments such as CATME exclude.

We proposed in this work the introduction of a new vision of stochastic processes through geometry induced by dilation. The dilation matrices of a given process are obtained by a composition of rotation matrices built in with respect to partial correlation coefficients. Particularly interesting is the fact that the obtention of dilation matrices is regardless of the stationarity of the underlying process. When the process is stationary, only one dilation matrix is obtained and it corresponds therefore to Naimark dilation. When the process is nonstationary, a set of dilation matrices is obtained. They correspond to Kolmogorov decomposition. In this work, the nonstationary class of periodically correlated processes was of interest. The underlying periodicity of correlation coefficients is then transmitted to the set of dilation matrices. Because this set lives on the Lie group of rotation matrices, we can see them as points of a closed curve on the Lie group. Geometrical aspects can then be investigated through the shape of the obtained curves, and to give a complete insight into the space of curves, a metric and the derived geodesic equations are provided. The general results are adapted to the more specific case where the base manifold is the Lie group of rotation matrices, and because the metric in the space of curve naturally extends to the space of shapes, this enables a comparison between curves’ shapes and allows then the classification of processes’ measure.

Novel tetragonal matrix Ba0.5Gd0.5-xNaxF2.5-x, where x = 0.05, doped by Yb3+, Ho3+, Er3+, was synthesized by molten salt synthesis (MSS) from nitrate flux. XRD data show that tetragonal phase with a = 4.122(1) Å, c = 17.672(1) Å is stable in argon atmosphere up to 960 °C. Luminescence spectra recorded in 500-900 nm and 1050-1700 nm upon 974 nm pumping demonstrated the characteristic luminescence at 1550 nm (4I13/2 → 4I15/2) for Er3+ and 1150 nm (5I6 → 5I8) for Ho3+. The relative thermal sensitivity (Sr) at 296-316 K were 0.3 %*K-1 and 5.5%*К-1 in shortwave infrared (SWIR) and visible range, respectively. Synthesized luminophores can be used as dual-range optical temperature sensors, which simultaneously operating in visible and SWIR ranges.

It is shown that a Mueller quaternion can be formulated as a quaternion with matrix coefficients, and this Mueller quaternion transforms the Stokes quaternion for depolarizing process as well as for nondepolarizing process. Mueller quaternion keeps track of the phase acquired by the Stokes quaternion and, in general, quaternion states of optical media comprises all properties of Jones, Mueller-Jones and Mueller matrices.

Aging is a major risk factor for the higher incidence and prevalence of chronic conditions, such as cancer, cardiovascular and metabolic diseases, and neurodegenerative diseases. Closely linked with the onset of all these age-related diseases is immunosenescence, a condition defined as progressive reconfiguration of the immune functions leading to an increased susceptibility to infectious diseases, poorer response to vaccination, increased prevalence of cancer, rheumatoid arthritis, and other chronic diseases characterized by a pro-inflammatory state named inflammaging. Given that immunosenescence frames age-related diseases, it is natural to ask how these illnesses are related under the context of innate and adaptative components of the immune system. Knowledge processing by Formal Concept Analysis (FCA) of age-related diseases framed in an immunosenescence multivalued context shows that a hierarchy among these diseases emerges with a subconcept-superconcept nested structure, with two clusters, first made of metabolic diseases, cancer, and cardiovascular diseases. Second metabolic and neurodegenerative diseases and rheumatoid arthritis. Metabolic diseases seem to be a pivot illness and they must be a primary target given their global incidence and prevalence and their cost-effective treatments like regular physical activity, weight loss, healthy diet, stopping smoking, and reducing or managing stress. Another implication of the ontological analysis of age-related diseases is about the nature of immunosenescence, suggesting that initial symptoms of age-related diseases are mainly related to innate immune mechanisms, and developing of severe symptoms of age-related diseases like cancer, cardiovascular or neurodegenerative diseases depends on the activation of acquired immunity processes.

In bioinformatics research, traditional machine learning methods have demonstrated efficacy in addressing Euclidean data. However, real-world data often encompasses non-Euclidean forms, such as graph data, which contain intricate structural patterns or high-order relationships that elude conventional machine-learning approaches. Representation learning seeks to derive valuable data representations from enhancing predictive or analytic tasks, capturing vital patterns and structures. This method has proven particularly beneficial in bioinformatics and biomedicine, as it effectively handles high-dimensional, sparse data, detects complex biological patterns, and optimizes predictive performance. In recent years, graph representation learning has become a popular research direction. It embeds graphs into a low-dimensional space while preserving the structural and attribute information of the graph, enabling better feature extraction for downstream tasks. This study extensively reviews representation learning advancements, particularly in the research of representation methods since the emergence of COVID-19. We begin with an analysis and classification of neural network-based language model representation learning techniques as well as graph representation learning methods. Subsequently, we explore their methodological innovations in the context of COVID-19, with a focus on the domains of drugs, public health, and healthcare. Furthermore, we discuss the challenges and opportunities associated with graph representation learning. This comprehensive review presents invaluable insights for researchers as it documents the development of COVID-19 and offers experiential lessons to preempt future infectious diseases. Moreover, this study guides future bioinformatics and biomedicine research methodologies.

When phenomena in quantum mechanics are interpreted from the perspective of bio-psychology, wave function collapse from several to a single eigenstate must be plausibly explained. Quantum mechanics requires a context, yet the context of an observer is rarely considered. On the other hand, in bio-psychology, the observer context is examined to explain superposition and collapse by different mental functions used in everyday life. Three mental functions are described, one of which is responsible for observation, and the others for conservation and treatment of information in mental representation. Whereas observation produces information with certainty, the subsequent processes result in uncertain potentiality. In order to encompass uncertainty, multiple possibilities are simultaneously considered in mental superposition, one of which should represent the unknown future outcome. During observation, all suggested potentialities necessarily collapse to one real outcome. The collapse of superposition does not occur in observable physical reality, but in its mental representation. Some physical principles—such as superposition, infinity and nothingness before the Big Bang—are pure phenomena of mental representation, which will always remain unverifiable by observation. This argument proves that mental representation brought about by the observer context participates in the production of mental models for the best approximation of physical reality.

Iyer Markoulakis Helmholtz Hamiltonian mechanics formalisms mathematically modeled physics with vortex rotational fields acting with gradient fields, typically in zero-point microblackhole general fields. Here, Helmholtz metrics have been gaged to Coulombic Hilbert metrics, representing Gilbertian and Amperian natures of electromagnetic fields out of the mechanical fields from Helmholtz Hamiltonian mechanics. This ansatz general gaging helps to properly isolate field effects – mechanical, electric, magnetic components within the analytical processes. Vacuum gravitational fields and the flavor Higgs-Boson matter inertial gravitational fields have been thus quantified extending to stringmetrics constructs matrix showing charge asymmetry gage metrics, having the power to analyze dark energy superluminal phase, dark matter luminal phase, and light matter subluminal phase. Interpreting particle physics gage matrix pointing to Dirac seas electrons, monopoles with positrons, electron-positron annihilation leading to energy production, relativistic energy generating matter, and both monopoles – vacuum and compressed out of vortex Helmholtz decomposition fields have been interpolated. Quantum ASTROPHYSICS gage metrix posits superluminal profile of signals velocity generating electron-positron chain like “curdling” action that is consistent with physics literature reporting nature electron photon observed oscillatory fields configurations. This helps proposing creation of neutrino antineutrino pair orthogonal to electron positron “curdling” planes, that may lead to formation of protonic hydrogen of stars or orthogonally muon. These aspects will explain receding or fast expanding universe with dark matter in terms of flavor metrics versus gage associating metrics flavor. Additional interpretations of virtual gravitational dipoles that have gravitational charge of opposite signs, reported per physics literature at Planck dimensions, that may originate at the center of supermassive blackhole. On the other hands, vacuum monopoles occur probably at infinity with cosmos extent.

We work with reference to a well-known semiclassical model, in which quantum degrees of freedom interact with classical ones. We show that, in the classical limit, it is possible to represent classical results (e.g., classical chaos) by means a pure-state density matrix.

Portfolio weights solely based on risk avoid estimation error from the sample mean, but they are still affected from the misspecification in the sample covariance matrix. To solve this problem, we shrink the covariance matrix towards the Identity, the Variance Identity, the Single-index model, the Common Covariance, the Constant Correlation and the Exponential Weighted Moving Average target matrices. By an extensive Monte Carlo simulation, we offer a comparative study of these target estimators, testing their ability in reproducing the true portfolio weights. We control for the dataset dimensionality and the shrinkage intensity in the Minimum Variance, Inverse Volatility, Equal-risk-contribution and Maximum Diversification portfolios. We find out that the Identity and Variance Identity have very good statistical properties, being well-conditioned also in high-dimensional dataset. In addition, the these two models are the best target towards to shrink: they minimise the misspecification in risk-based portfolio weights, generating estimates very close to the population values. Overall, shrinking the sample covariance matrix helps reducing weights misspecification, especially in the Minimum Variance and the Maximum Diversification portfolios. The Inverse Volatility and the Equal-Risk-Contribution portfolios are less sensitive to covariance misspecification, hence they benefit less from shrinkage.

In this study, we investigate how dataset composition influences the performance and bias of age estimation models across different ethnic groups. We utilized pre-trained Convolutional Neural Networks (CNNs) such as VGG19, fine-tuning them on two datasets: UTKFace and APPA-REAL. UTKFace comprises 23,705 samples (12,391 males, 11,314 females) including 10,078 White, 4,526 Black, and 3,434 Asian individuals. APPA-REAL consists of 7,591 samples (3,818 males, 3,773 females) with 6,686 White, 231 Black, and 674 Asian individuals. We adjusted dataset composition by oversampling minority groups and reducing samples from the majority group to evaluate effects on model performance, measured using Mean Absolute Error (MAE) and standard deviation. Our findings demonstrate that oversampling alone does not guarantee equitable performance across ethnicities; reducing samples from the majority group often resulted in more balanced performance, evidenced by lower MAE standard deviations. These results underscore the importance of a nuanced approach to achieve fairness, including combining various sampling techniques. This study emphasizes the critical need for tailored dataset compositions to mitigate bias and suggests exploring more refined data processing methods and algorithmic adjustments for enhanced model fairness and accuracy in facial recognition technologies.

Reconstructing a 3D model of a scene from a set of multiple views poses a significant challenge in the field of computer vision. The advent of NeRF has marked a major breakthrough in this domain. However, there is a need to extend the capabilities of the NeRF model to enable editing tasks such as relighting and deformation, as well as to enhance its training efficiency. Neural reflectance fields introduce the concept of the reflectance equation into the NeRF framework to achieve relighting of the NeRF model. We leverage the TensoRF approach, which incorporates tensor decomposition and employs multiple tensors to store features, to expedite the training process of the NeRF model. Our novel method, called StensorR, combines the reflectance equation and tensor decomposition within the radiation field model framework. Differing from previous approaches, we employ a single tensor to store scene features and render the surface color of our scene using a simplified reflectance equation. This approach accelerates model convergence and enables relighting of the NeRF model. Experimental results demonstrate that our method achieves a 50% faster convergence rate compared to existing relighting radiation field models, while successfully enabling relighting and improving the quality of synthesized images from new viewpoints.

We show that, as in the case of the principle of minimum action in classical and quantum mechanics, there exists an even more general principle in the very fundamental structure of quantum space-time: This is the principle of minimal group that allows to consistently and simultaneously obtain a natural description of the spacetime dynamics and the physical states admissible in it. The theoretical construction is based on the physical states that are average values of the generators of the Metaplectic group Mp(n) , the double covering of SL(2C) in a vector representation, with respect to the coherent states carrying the spin weight. Our main results here are: (i) There exists a connection between the dynamics given by the Metaplectic group symmetry generators and the physical states (mappings of the generators through bilinear combinations of the basic states). (ii) The ground states are coherent states of the Perelomov-Klauder type defined by the action of the Metaplectic group which divide the Hilbert space into even and odd states mutually orthogonal. They carry a spin weight 1/4 and 3/4 respectively from which, two other basic states can be formed. (iii) The physical states, mapped bilinearly with the basic 1/4 and 3/4 spin weight states, plus their symmetric and antisymmetric combinations, have spin contents s = 0, 1/2, 1, 3/2 and 2. (iv) The generators realized with the bosonic variables of the harmonic oscillator introduce a natural supersymmetry and a superspace whose line element is the geometrical Lagrangian of our model. (v) From the line element as operator level, a coherent physical state of spin 2 can be obtained and naturally related to the metric tensor. (vi) The metric tensor is naturally discretized by taking the discrete series given by the basic states (coherent states) in the n number representation, reaching the classical (continuous) space-time for n going to infinity. (vii) There emerges a relation between the eigenvalue of our coherent state metric solution and the black hole area (entropy) as A_{bh}/4 l_{p}^{2} = I alpha I relating the phase space of the metric found g_{ab} and the black hole area A_{bh} through the Planck length l_{p}^{2} and the eigenvalue I alpha I of the coherent states. As a consequence of the lowest level of the quantum discrete space-time spectrum, eg the ground state associated to n = 0 and its characteristic length, there exists a minimum entropy related to the black hole history.

This work considers the task of representation learning on the attributed relational graph (ARG). Both the nodes and edges in an ARG are associated with attributes/features allowing ARGs to encode rich structural information widely observed in real applications. Existing graph neural networks offer limited ability to capture complex interactions within local structural contexts, which hinders them from taking advantage of the expression power of ARGs. We propose Motif Convolution Module (MCM), a new motif-based graph representation learning technique to better utilize local structural information. The ability to handle continuous edge and node features is one of MCM’s advantages over existing motif-based models. MCM builds a motif vocabulary in an unsupervised way and deploys a novel motif convolution operation to extract the local structural context of individual nodes, which is then used to learn higher-level node representations via multilayer perceptron and/or message passing in graph neural networks. When compared with other graph learning approaches to classifying synthetic graphs, our approach is substantially better in capturing structural context. We also demonstrate the performance and explainability advantages of our approach by applying it to several molecular benchmarks.

The prediction of drug--target interactions is always a key task in the field of drug redirection. However, traditional methods of predicting drug--target interactions are either mediocre or rely heavily on data stacking. In this work, we merged heterogeneous graph information and obtained effective node information and substructure information based on mutual information in graph embeddings. We then learned high quality representations for downstream tasks, and proposed an end--to--end auto--encoder model to complete the task of link prediction. Experimental results show that our method outperforms several state--of--art models. The model can achieve the area under the receiver operating characteristics (AUROC) curve of 0.959 and area under the precise recall curve (AUPR) of 0.848. We found that the mutual information between the substructure and graph--level representations contributes most to the mutual information index in a relatively sparse network. And the mutual information between the node--level and graph--level representations contributes most in a relatively dense network.

Computing the rotation tensor is vital in the analysis of deformable bodies. This paper describes an explicit expression for the SO(3) rotation tensor R of the deformation gradient F, and successfully establishes an intrinsic relation between the exponential mapping Q = exp A and the deformation F. As an application, Truesdell's simple shear deformation is revisited.

With the rapid development of Internet and the widely usage of smart devices, massive multimedia data are generated, collected, stored and shared on the Internet. This trend makes cross-modal retrieval problem become a hot issue in this years. Many existing works pay attentions on correlation learning to generate a common subspace for cross-modal correlation measurement, and others uses adversarial learning technique to abate the heterogeneity of multi-modal data. However, very few works combine correlation learning and adversarial learning to bridge the inter-modal semantic gap and diminish cross-modal heterogeneity. This paper propose a novel cross-modal retrieval method, named ALSCOR, which is an end-to-end framework to integrate cross-modal representation learning, correlation learning and adversarial. CCA model, accompanied by two representation model, VisNet and TxtNet is proposed to capture non-linear correlation. Beside, intra-modal classifier and modality classifier are used to learn intra-modal discrimination and minimize the inter-modal heterogeneity. Comprehensive experiments are conducted on three benchmark datasets. The results demonstrate that the proposed ALSCOR has better performance than the state-of-the-arts.

This paper presents a new method : HIVEC to learn latent vector representations of graphs in a manner that captures the semantic dependencies of sub-structures. The representations can then be used in machine learning algorithms for tasks such as graph classification, clustering etcetera. The method proposed is unsupervised and uses the information of co-occurrence of sub-structures. It introduces a notion of hierarchical embeddings that allows us to avoid repetitive learning of sub-structures for every new graph. As an alternative to deep learning methods, the edit distance similarity between sub-structures is also used to learn vector representations. We compare the performance of these methods against previous work.

In this paper, we propose a novel network representation learning model TransPath to encode heterogeneous information networks (HINs). Traditional network representation learning models aim to learn the embeddings of a homogeneous network. TransPath is able to capture the rich semantic and structure information of a HIN via meta-paths. We take advantage of the concept of translation mechanism in knowledge graph which regards a meta-path, instead of an edge, as a translating operation from the first node to the last node. Moreover, we propose a user-guided meta-path sampling strategy which takes users' preference as a guidance, which could explore the semantics of a path more precisely, and meanwhile improve model efficiency via the avoidance of other noisy and meaningless meta-paths. We evaluate our model on two large-scale real-world datasets DBLP and YELP, and two benchmark tasks similarity search and node classification. We observe that TransPath outperforms other state-of-the-art baselines consistently and significantly.

This article is devoted to the results of in-depth analysis of the system of binary-oppositional structures in DNA n-plet alphabets and their algebraic-matrix representations. These results show that the molecular complementary replication of DNA strands is accompanied by the presence of an algebraic version of the principle "like begets like" in matrix representations of DNA alphabets having internal structures. This algebraic version is based on binary-oppositional structures in the genetic molecular system, which can be represented by binary numbers and corresponding matrices of DNA alphabets. The received results allow thinking that the phenomenon "like begets like" (or a complementary replication in a wide sense) is systemic in the genetic organization and is connected with algebraic features of biological organization. Correspondingly, the biological principle "like begets like" can be additionally modeled by algebraic-matrix methods and approaches. Such algebra-matrix modeling of the genetic coding system gives new ways for studying and understanding the key role of the named principle in genetic and other inherited physiological complexes. On this way, the author discovered general rules of stochastic organization of information binary sequences of genomic DNAs of eukaryotes and prokaryotes. The presented rules are connected with information dichotomies of probabilities and corresponding fractal-like trees of probabilities, which fundamentally differ from constructional dichotomies in biological bodies. The received phenomenological data and rules lead to new biological ideas.

The extracellular matrix (ECM) is a ubiquitous member of the body and is key to the maintenance of tissues and organs integrity. Initially thought to be a by-stander in many cellular processes, the extracellular matrix has been shown to have diverse components that regulate and activate many cellular processes and ultimately influence cell phenotype. Importantly, the ECM composition, architecture, and stiffness/elasticity influence cellular phenotypes. Under normal conditions and during development, the synthesized ECM is constantly undergoing degradation and remodeling processes via the action of matrix proteases that maintain tissue homeostasis. In many pathological conditions including fibrosis and cancer, the ECM synthesis, remodeling, and degradation is dysregulated causing its integrity to be altered. Both physical and chemical cues from the ECM are sensed via receptors including integrins and play key roles in driving cellular proliferation and differentiation and in various disease progression such as cancers. Advances in ‘omics’ technologies have seen an increase in studies focussing on bi-directional cell-matrix interactions and here we highlight emerging knowledge on the role played by the ECM during normal development and in pathological conditions. This review summarizes current ECM-targeted-therapies that can modify tumor ECM to overcome drug resistance and better cancer treatment.

By constructing a static map, the library robot can navigate and access documents autonomously, which greatly improves efficiency; however, for libraries where shelves can be moved, map changes do not allow for direct navigation, and also sensors such as radar and camera are relatively expensive, so we propose a low-cost navigation algorithm based on real-time ranging data and map matrices, and designed a mobile archive access robot. In order to obtain real-time distance data, nine near/long range sensors were mounted on the chassis and a composite digital filtering algorithm was designed based on different moving area characteristics; then the access task matrix and map matrix were designed based on the archive access task and the location characteristics of the archive shelf placement, the robot can rely on the range data to update the map matrix during the moving process, complete its own positioning, and use the task matrix The robot can use the task matrix to complete autonomous navigation and access to multiple files. Experiments show that the filtered positioning accuracy can reach 1cm, while the robot can move to the target shelf autonomously, which is more practical and less costly.

The paper summarizes in a step by step ‘recipe’ format a model of developing new ideas (Ideation) that can be used to form a new venture or develop a new product. The proposed ‘recipes’ are widely used and can be applied in tandem with other prevalently available models or tools. The intention of the paper is also to serve as a resource for entrepreneurs and innovators, and the links and references munificently used in the paper are serving this purpose. The author has used the outline and the tools described here in numerous Ideation classes taught for over a decade in several countries around the world. The paper’s intention is not to conduct a systematic review on the subject of new venture creation or propose new research agenda (for that, see for example Shepherd et al., 2021). The purpose is to provide an effective and efficient set of tools, models and techniques that can assist the entrepreneur in her journey to create and achieve her dreams. One such tool is the matrix of Reasonings-Outcomes introduced here for the first time.

The bottleneck in creating dynamic models of biological networks and processes often lies in estimating unknown kinetic model parameters from experimental data. In this regard, experimental conditions have a strong influence on parameter identifiability and should therefore be optimized to give the maximum information for parameter estimation. Existing model-based design of experiment (MBDOE) methods commonly rely on the Fisher Information Matrix (FIM) for defining a metric of data informativeness. When the model behavior is highly nonlinear, FIM-based criteria may lead to suboptimal designs since the FIM only accounts for the linear variation of the model outputs with respect to the parameters. In this work, we developed a multi-objective optimization (MOO) MBDOE, where model nonlinearity was taken into consideration through the use of curvature. The proposed MOO MBDOE involved maximizing data informativeness using a FIM-based metric and at the same time minimizing the model curvature. We demonstrated the advantages of the MOO MBDOE over existing FIM-based and other curvature-based MBDOEs in an application to the kinetic modeling of fed-batch fermentation of Baker's yeast.

Following Smolin, we proceed to unification of general relativity and quantum theory by operating solely with events, i.e., without appealing to physical systems and space-time. The universe is modelled as a dendrogram (finite tree) expressing the hierarchic relations between events. This is the observational (epistemic) model; the ontic model is based on p-adic numbers (infinite trees). Hence, we use novel mathematics—not only space-time but even real numbers are not in use. Here, the p-adic space (which is zero dimensional) serves as the base for the holographic image of the universe. In this way our theory relates to p-adic physics; in particular, p-adic string theory and complex disordered systems (p-adic representation of Parisi matrix for spin glasses). Our Dendrogramic-Holographic (DH) theory matches perfectly with the Mach’s principle and Brans-Dicke theory. We found surprising informational interrelation between the fundamental constants, h, c, G, and their DH-analogues, h(D), c(D), G(D). DH-theory is part of Wheeler’s project on the information restructuring of physics. It is also a step towards the Unified Field theory. The universal potential V is nonlocal, but this is relational DH-nonlocality. V can be coupled to the Bohm quantum potential by moving to the real representation. This coupling enhanced the role of the Bohm potential.

Indoor scene recognition has great significance for intelligent applications such as mobile robots, location-based services (LBS) and so on. Wherever we are or whatever we do, we are under a specific scene. The human brain can easily discern a scene with a quick glance. However, for a machine to achieve this purpose, on one hand, it often requires plenty of well-annotated data which is time-consuming and labor-intensive. On the other hand, it is hard to learn effective visual representations due to large intra-category variation and inter-categories similarity of indoor scenes. To solve these problems, in this paper, we adopted an unsupervised visual representation learning method which can learn from unlabeled data with a Siamese Convolutional Neural Network (Siamese ConvNet) and graph-based constraints. Specifically, we first mined relationships between unlabeled samples with a graph structure. And then, these relationships can be used as supervision for representation learning with a Siamese network. In this method, firstly, a k-NN graph would be constructed by taking each image as a node in the graph and its k nearest neighbors are linked to form the edges. Then, with this graph, cycle consistency and geodesic distance would be considered as criteria for positive and negative pairs mining respectively. In other words, by detecting cycles in the graph, images with large differences but in the same cycle can be considered as same category (positive pairs). By computing geodesic distance instead of Euclidean distance from one node to another, two nodes with large geodesic distance can be regarded as in different categories (negative pairs). After that, visual representations of indoor scenes can be learned by a Siamese network in an unsupervised manner with the mined pairs as inputs. In order to evaluate the proposed method, we tested it on two scene-centric datasets, MIT67 and Places365. Experiments with different number of categories have been conducted to excavate the potential of proposed method. The results demonstrated that semantic visual representations for indoor scenes can be learned in this unsupervised manner. In addition, with the learned visual representations, indoor scene recognition models trained with the learned representations and a few of labeled samples can achieve competitive performance compared to the state-of-the-art approaches.

Abstract: Congenital cytomegalovirus (cCMV) infection poses significant risks to fetal development, particularly affecting the nervous system. This study reports a fetal autopsy case, examining cCMV infection and focusing on CMV DNA measurements in various fetal organs before formalin fixation, a novel approach for comprehensive CMV DNA evaluations in fetal organs affected by cCMV. A 20-week-old male fetus was diagnosed with cCMV following the detection of CMV DNA in ascites obtained via abdominocentesis in utero. After termination of pregnancy, multiple organs of the fetus, including the cerebrum, thyroid gland, heart, lungs, liver, spleen, kidneys, and adrenal glands, were extracted and examined for CMV DNA loads using real-time polymerase chain reaction. Histopathological examination involved hematoxylin-eosin and CMV-specific immunostaining. A correlation was found between CMV DNA loads and pathology, with higher CMV-infected cell numbers observed in organs positively identified with both staining methods, exhibiting CMV DNA levels of ≥1.0 × 104 copies/mL, compared to those detected solely by CMV-specific immunostaining, where CMV DNA levels ranged from 1.0 x 103 to 1.0 x 104 copies/mL. These results highlight a quantifiable relationship between organ infection extent and CMV DNA concentration, providing insights into cCMV pathogenesis and potentially informing future diagnostic and therapeutic strategies for cCMV infection.

The evolution of even and odd Schrödinger cat states of the inverted oscillator is obtained in the center-of-mass tomographic probability description of the two-mode oscillator.The notion of entangled probability distribution is reviewed. Evolution equations describing the time-dependence of probability distributions identified with quantum system states are discussed.The connection with the Schrödinger equation and the von Neumann equation is clarified.

The QBIT theory is an attempt toward solving the problem of consciousness in the light of Quantum mechanics, Biology, Information theory, and Thermodynamics. “Internal representation” is a key concept in the QBIT theory of consciousness. An internal representation is defined as a pack of information (within a cognitive system) that represents an external stimulus.The QBIT theory suggests that when robustness of an internal representation exceeds a certain threshold, a conscious experience (or a quale) is generated. In this paper, the concept of internal representation and its relation with consciousness is explored.

This paper explores the application of Random Matrix Theory (RMT) as a methodological enhancement for portfolio selection within financial markets. Traditional approaches to portfolio optimization often rely on historical estimates of correlation matrices, particularly susceptible to instability. To address this challenge, we combine a data preprocessing technique based on the Hilbert transformation of returns with RMT to refine the accuracy and robustness of correlation matrix estimation. By contrasting empirical correlations with those derived from random matrices, we uncover non-random properties and underlying relationships within financial data. We then utilize this methodology to construct the correlation network dependence structure used in portfolio optimization. The empirical analysis presented in this paper validates the effectiveness of RMT in enhancing portfolio diversification and risk management strategies. This research contributes by offering investors and portfolio managers with methodological insights to construct portfolios that are more stable, robust, and diversified. At the same time, it advances our comprehension of the intricate statistical principles underlying multivariate financial data.

Matrix-variate Gaussian type or Wishart type distributions in the real domain are widely used in the literature. When the exponential trace has an arbitrary power and when a factor involving a determinant enters into the model or a matrix-variate gamma type or Wishart type model with exponential trace having an arbitrary power, is extremely difficult to handle. Evaluation of the normalizing constant in such a model is the most important part because when studying the properties of such a model, the method used in the evaluation of the normalizing constant will be the relevant steps in all the computations involved. One such model with a factor involving a trace and the exponential trace having an arbitrary power, in the real domain, is known in the literature as Kotz' model. No explicit evaluation of the normalizing constant in the model involving trace with an exponent and determinant with an exponent entering into the model and at the same time the exponential trace having an arbitrary exponent seems to be available in the literature. The normalizing constant widely used in the literature and interpreted as the normalizing constant in the general model and refers to as a Kotz' model does not seem to be correct. Corresponding model in the complex domain, with the correct normalizing constant, does not seem to be available in the literature. One of the main contributions in this paper is the matrix-variate distributions in the complex domain belonging to Gaussian type, gamma type, type-1 and type-2 beta type when the exponential trace has an arbitrary power. All these models are believed to be new. A second main contribution is the explicit evaluation of the the normalizing constants, in the real and complex domains especially in the complex domain, in a matrix-variate model involving a determinant and a trace as multiplicative factors and at the same time the exponential trace having an arbitrary power. Another main contribution is the introduction of matrix-variate models with exponential trace having an arbitrary exponent, in the categories of type-1 beta, type-2 beta and gamma distributions or in the family of Mathai's pathway models [1], both in the real and complex domains. Another new contribution is the logistic-based extensions of models in the real and complex domains with exponential trace having an arbitrary exponent and connecting to extended zeta functions introduced by this author recently. Some properties of such models are indicated but not derived in detail in order to limit the size of the paper. The techniques and steps used at various stages in this paper will be highly useful for people working in multivariate statistical analysis as well as people applying such models in engineering problems, communication theory, quantum physics and related areas, apart from statistical applications.