Tomographic task solution using a dichotomous discretization scheme in polar coordinates and partial system matrices invariant to rotations by A. А. Manushkin, N. N. Potrachov, A. V. Stepanov, E. Yu. Usachev

Subjects: Get full text

MODELLING OF AUTOMATIC CORRECTION OF MISTAKES IN TECHNOLOGY OF INFORMATION SYSTEMS by George N. Isaev

Subjects: Get full text

Inexact Newton matrix-free methods for solving complex biotechnological systems by Paweł Drąg, Marlena Kwiatkowska

Get full text

Small Populations, High-Dimensional Spaces: Sparse Covariance Matrix Adaptation by Silja Meyer-Nieberg, Erik Kropat

Get full text

Proposed Method for Tracking Moon Phases using the Co-Occurrence Matrix by Abeer Thanoon

Get full text

Some integral properties in the theory of generalized $k-$Bessel matrix functions by Carlo Cattani, Ghazi S. Khammash, Ayman Shehata

Get full text

Adoption of the Co-Occurrence Matrix and Artificial Neural Networks in Fingerprint Recognition by Maysoon Al-Nuaimi

Get full text

Wordline Input Bias Scheme for Neural Network Implementation in 3D-NAND Flash by Hwiho Hwang, Gyeonghae Kim, Dayeon Yu, Hyungjin Kim

Subjects: “…computing-in-memory (CIM)…”
Get full text

Matrix Method of Defect Analysis for Structures with Areas of Considerable Stiffness Differences by Monika Mackiewicz, Tadeusz Chyży

“…This enhancement significantly improves the accuracy of numerical calculations, as verified by computational calculations. The explicit formulation of the stiffness matrix enhances computational efficiency, making the approach particularly useful for periodic structures with inclusions, voids, or localized material defects. …”
Get full text

EVALUATION OF EFFECTIVE PROPERTIES OF BASALT TEXTILE REINFORCED CERAMIC MATRIX COMPOSITES by Soňa Valentová, Vladimír Hrbek, Michal Šejnoha

“…The present paper is concerned with the analysis of a ceramic matrix composite, more specifically the plain weave textile fabric composite made of basalt fibers embedded into the pyrolyzed polysiloxane matrix. …”
Get full text

Reduced Model in H∞ Vibration Control Using Linear Matrix Inequalities by Fernando Sarracini Júnior, Alberto Luiz Serpa

Get full text

Extracellular matrix density regulates the formation of tumour spheroids through cell migration. by Inês G Gonçalves, Jose Manuel Garcia-Aznar

“…However, it is still unclear exactly how both of these processes are regulated by the matrix composition. Here, we present a centre-based computational model that describes how collagen density, which modulates the steric hindrance properties of the matrix, governs individual cell migration and, consequently, leads to the formation of multicellular clusters of varying size. …”
Get full text

Fast crosstalk precoder based on structured matrix splitting for downstream transmission by LI You-ming, SHEN Wei, WANG Rang-ding, LI Xin-miao

“…Based on special line position,a novel precoder of cancellation crosstalk for downstream transmission was proposed.As the new method needs only two order matrix inversion,the precoder had a much lower computational com-plexity and was easy for implementation.In addition,the performance of the precoder was superior to that of the first or-der algorithm,almost the same tri-diagonal precoder.Computer simulation results based on real measured data verify the efficiency of the proposed precoder.…”
Get full text

A Novel Iterative Method for Polar Decomposition and Matrix Sign Function by F. Soleymani, Predrag S. Stanimirović, Igor Stojanović

“…We define and investigate a globally convergent iterative method possessing sixth order of convergence which is intended to calculate the polar decomposition and the matrix sign function. Some analysis of stability and computational complexity are brought forward. …”
Get full text

Legendre Wavelet Operational Matrix Method for Solution of Riccati Differential Equation by S. Balaji

“…A Legendre wavelet operational matrix method (LWM) is presented for the solution of nonlinear fractional-order Riccati differential equations, having variety of applications in quantum chemistry and quantum mechanics. …”
Get full text

Faster quantum subroutine for matrix chain multiplication via Chebyshev approximation by Xinying Li, Pei-Lin Zheng, Chengkang Pan, Fei Wang, Chunfeng Cui, Xian Lu

“…Abstract Matrix operations are crucial to various computational tasks in various fields, and quantum computing offers a promising avenue to accelerate these operations. …”
Get full text

Pooled‐matrix protein interaction screens using Barcode Fusion Genetics by Nozomu Yachie, Evangelia Petsalaki, Joseph C Mellor, Jochen Weile, Yves Jacob, Marta Verby, Sedide B Ozturk, Siyang Li, Atina G Cote, Roberto Mosca, Jennifer J Knapp, Minjeong Ko, Analyn Yu, Marinella Gebbia, Nidhi Sahni, Song Yi, Tanya Tyagi, Dayag Sheykhkarimli, Jonathan F Roth, Cassandra Wong, Louai Musa, Jamie Snider, Yi‐Chun Liu, Haiyuan Yu, Pascal Braun, Igor Stagljar, Tong Hao, Michael A Calderwood, Laurence Pelletier, Patrick Aloy, David E Hill, Marc Vidal, Frederick P Roth

Get full text

Comparative In silico Analysis of Enzymatic Degradation Resistance in Resin-matrix Ceramics by Özay Önöral, Ahmet Ozer Sehirli, Emine Erdag

“…Background: Resin-matrix ceramics (RMCs) are commonly used in prosthetic dentistry due to their ability to closely replicate the optical and mechanical characteristics of natural teeth. …”
Get full text

Bibliometric Analysis and Overview of Matrix Product States in the Bose-Hubbard Model by Juan Sebastián Gómez, Karen Cecilia Rodríguez

“…Context: Quantum many-body systems have been a prominent topic over the past two decades, underpinning advancements in superconductors, ultracold atoms, and quantum computing, among other fields. This bibliometric analysis explores key concepts, influential authors, and the current significance of a powerful family of algorithms in computational physics, i.e., density matrix renormalization group (DMRG) algorithms. …”
Get full text

Fast Global and Local Semi-Supervised Learning via Matrix Factorization by Yuanhua Du, Wenjun Luo, Zezhong Wu, Nan Zhou

“…This allows it to be optimized quickly using state-of-the-art unconstrained optimization algorithms. The computational complexity of the proposed method is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mi>m</mi><mi>d</mi><mo>)</mo></mrow></semantics></math></inline-formula>, which is much lower than that of the original symmetric matrix factorization, which is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><msup><mi>n</mi><mn>2</mn></msup><mi>d</mi><mo>)</mo></mrow></semantics></math></inline-formula>, and even lower than that of other anchor-based methods, which is <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>O</mi><mo>(</mo><mi>n</mi><mi>m</mi><mi>d</mi><mo>+</mo><msup><mi>m</mi><mn>2</mn></msup><mi>n</mi><mo>+</mo><msup><mi>m</mi><mn>3</mn></msup><mo>)</mo></mrow></semantics></math></inline-formula>, where <i>n</i> represents the number of samples, <i>d</i> represents the number of features, and <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>m</mi><mo>≪</mo><mi>n</mi></mrow></semantics></math></inline-formula> represents the number of anchors. …”
Get full text