Results 41 to 50 of about 42,601 (304)

Penyelesaian Metode Quick Simplex Terhadap Metode Dua Fase dengan Dua Elemen secara Simultan pada Kasus Minimum

open access: yesKubik, 2021
Linear programming is a way to solve the problemof allocating limiter resources optimally. One of the methods used in solving the simplex method for mixed constraints is the two-phase method.
Elfira Safitri   +3 more
doaj   +1 more source

Wide and Deep Model of Multi-Source Information-Aware Recommender System

open access: yesIEEE Access, 2018
Collaborative filtering recommendation suffers from the problems of high data sparsity, poor expansibility, cold start, and the difficulty of modeling user preferences, among which data sparsity is the greatest issue. Although our previous work on matrix
Weihua Yuan   +4 more
doaj   +1 more source

An Online Semi-Definite Programming with a Generalized Log-Determinant Regularizer and Its Applications

open access: yesMathematics, 2022
We consider a variant of the online semi-definite programming problem (OSDP). Specifically, in our problem, the setting of the decision space is a set of positive semi-definite matrices constrained by two norms in parallel: the L∞ norm to the diagonal ...
Yaxiong Liu   +3 more
doaj   +1 more source

Modelling stem cell differentiation related processes—A practical overview for biologists

open access: yesFEBS Letters, EarlyView.
Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar   +4 more
wiley   +1 more source

Methodology of optimization of territorially-branch structure of region in the conditions of economy reforming [PDF]

open access: yesЭкономика региона, 2012
This paper is devoted to the analysis of transition from centralized planning economy to market relations, revealing of problems and working out of necessary macro proportions in placing of productive forces, integration maintenance between ...
Arkadiy Iosifovich Moroz
doaj   +1 more source

Dynamic Tensor Modeling for Missing Data Completion in Electronic Toll Collection Gantry Systems

open access: yesSensors, 2023
The deployment of Electronic Toll Collection (ETC) gantry systems marks a transformative advancement in the journey toward an interconnected and intelligent highway traffic infrastructure.
Yikang Rui, Yan Zhao, Wenqi Lu, Can Wang
doaj   +1 more source

The symmetric N-matrix completion problem

open access: yesLinear Algebra and its Applications, 2005
A real \(n\times n\) matrix is called an \(N\)-matrix if all its principal minors are negative. Consider a partial symmetric matrix \(A\) where some entries are unspecified. The problem under consideration is whether it is possible to determine these unspecified entries in such a way that the resulting fully specified symmetric matrix is an \(N ...
Araújo, C. Mendes   +2 more
openaire   +1 more source

Design and analysis strategies for robust microbiome ageing research

open access: yesFEBS Letters, EarlyView.
The gut microbiome changes with age and associates with age‐related morbidity and mortality, establishing it as a potential biomarker and intervention target for ageing. Realising this potential requires methodological rigour, yet distinguishing biological signals from methodological artefacts remains challenging across cohorts. This review provides an
Mark Olenik   +5 more
wiley   +1 more source

Shaping Intensities of Complex Scalar Fields in Inhomogeneous Scenarios via Linearly Combined Bricks

open access: yesIEEE Open Journal of Antennas and Propagation
The ability to enforce a given behaviour on the electromagnetic field intensity distribution is relevant in a wide range of applications, including the particularly challenging case where shaping is required in heterogeneous media.
Martina Teresa Bevacqua   +2 more
doaj   +1 more source

Parameterized Algorithms for the Matrix Completion Problem

open access: yesCoRR, 2018
We consider two matrix completion problems, in which we are given a matrix with missing entries and the task is to complete the matrix in a way that (1) minimizes the rank, or (2) minimizes the number of distinct rows. We study the parameterized complexity of the two aforementioned problems with respect to several parameters of interest, including the ...
Ganian, R.   +3 more
openaire   +4 more sources

Home - About - Disclaimer - Privacy