Code2vect: An efficient heterogenous data classifier and nonlinear regression technique

The aim of this paper is to present a new classification and regression algorithm based on Artificial Intelligence. The main feature of this algorithm, which will be called Code2Vect, is the nature of the data to treat: qualitative or quantitative and continuous or discrete. Contrary to other artificial intelligence techniques based on the “Big-Data,” this new approach will enable working with a reduced amount of data, within the so-called “Smart Data” paradigm. Moreover, the main purpose of this algorithm is to enable the representation of high-dimensional data and more specifically grouping and visualizing this data according to a given target. For that purpose, the data will be projected into a vectorial space equipped with an appropriate metric, able to group data according to their affinity (with respect to a given output of interest). Furthermore, another application of this algorithm lies on its prediction capability. As it occurs with most common data-mining techniques such as regression trees, by giving an input the output will be inferred, in this case considering the nature of the data formerly described. In order to illustrate its potentialities, two different applications will be addressed, one concerning the representation of high-dimensional and categorical data and another featuring the prediction capabilities of the algorithm.     

Equivalences among Z2s-linear Hadamard codes

The ${\mathbb{Z}}_{2^s}$-additive codes are subgroups of ${\mathbb{Z}}_{2^s}^n$, and can be seen as a generalization of linear codes over ${\mathbb{Z}}_2$ and ${\mathbb{Z}}_4$. A ${\mathbb{Z}}_{2^s}$-linear Hadamard code is a binary Hadamard code which is the Gray map image of a ${\mathbb{Z}}_{2^s}$-additive code. A partial classification of these codes by using the dimension of the kernel is known. In this paper, we establish that some ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ are equivalent, once $t$ is fixed. This allows us to improve the known upper bounds for the number of such nonequivalent codes. Moreover, up to $t=11$, this new upper bound coincides with a known lower bound (based on the rank and dimension of the kernel). Finally, when we focus on $s\in \{2,3\}$, the full classification of the ${\mathbb{Z}}_{2^s}$-linear Hadamard codes of length $2^t$ is established by giving the exact number of such codes.     

Data fusion methodologies for food and beverage authentication and quality assessment – A review

The ever increasing interest of consumers for safety, authenticity and quality of food commodities has driven the attention towards the analytical techniques used for analyzing these commodities. In recent years, rapid and reliable sensor, spectroscopic and chromatographic techniques have emerged that, together with multivariate and multiway chemometrics, have improved the whole control process by reducing the time of analysis and providing more informative results. In this progression of more and better information, the combination (fusion) of outputs of different instrumental techniques has emerged as a means for increasing the reliability of classification or prediction of foodstuff specifications as compared to using a single analytical technique. Although promising results have been obtained in food and beverage authentication and quality assessment, the combination of data from several techniques is not straightforward and represents an important challenge for chemometricians. This review provides a general overview of data fusion strategies that have been used in the field of food and beverage authentication and quality assessment.     

On classification of four-dimensional nilpotent Leibniz algebras

Leibniz algebras are certain generalization of Lie algebras. In this paper, we give the classification of four-dimensional non-Lie nilpotent Leibniz algebras. We use the canonical forms for the congruence classes of matrices of bilinear forms and some other techniques to obtain our result.     

Identification of key classification features of early cervical squamous cell carcinoma

Despite the tremendous progress in molecular analysis of pan-cancer, little is known regarding molecular classification of cervical squamous cell carcinoma. In this study, we adopted a multi-omics approach to identify potential key classification features of cervical squamous cell carcinoma. Specifically, we analyzed mRNA, and microRNA (miRNA) expression data, as well as DNA methylation and copy number variation in cervical squamous cell carcinoma cases, using datasets obtained from The Cancer Genome Atlas (TCGA). Moreover, we identified molecules in each dimension, as well as integrated and clustered filtered classification features, and used them to distinguish different subtypes. The resulting key classification features were used to establish a classification model for cervical squamous cell carcinoma. Our results revealed two cervical squamous cell carcinoma subtypes, with significant differences across clinical survival levels, as well as 8 key classification features of cervical squamous cell carcinomas. These findings are expected to provide important references for early classification of cervical squamous cell carcinoma and identification of classification markers.     

On the Range of Certain ASH Algebras of Real Rank Zero*

In this paper, the authors consider the range of a certain class of ASH algebras in [An, Q., Elliott, G. A., Li, Z. and Liu, Z., The classification of certain ASH C*-algebras of real rank zero, J. Topol. Anal., 14(1), 2022, 183–202], which is under the scheme of the Elliott program in the setting of real rank zero C*-algebras. As a reduction theorem, they prove that all these ASH algebras are still the AD algebras studied in [Dadarlat, M. and Loring, T. A., Classifying C*-algebras via ordered, m...     

On Dual Configurational Forces

The dual conservation laws of elasticity are systematically re-examined by using both Noether's variational approach and Coleman–Noll–Gurtin's thermodynamics approach. These dual conservation laws can be interpreted as the dual configurational force, and therefore they provide the dual energy–momentum tensor. Some previously unknown and yet interesting results in elasticity theory have been discovered. As an example, we note the following duality condition between the configuration force (energy–momentum tensor) and the dual configuration force (dual energy–momentum tensor) ,

Stability of a Steady Viscous Incompressible Flow Past an Obstacle

We derive a sufficient condition for stability of a steady solution of the Navier–Stokes equation in a 3D exterior domain Ω. The condition is formulated as a requirement on integrability on the time interval (0, +∞) of a semigroup generated by the linearized problem for perturbations, applied to a finite family of certain functions. The norm of the semigroup is measured in a bounded sub-domain of Ω. We do not use any condition on “smallness” of the basic steady solution.