Results 41 to 50 of about 1,650,745 (287)

K-RANK: AN EVOLUTION OF Y-RANK FOR MULTIPLE SOLUTIONS PROBLEM [PDF]

open access: yesBrazilian Journal of Chemical Engineering, 2019
ABSTRACT Y-rank can present faults when dealing with non-linear problems. A methodology is proposed to improve the selection of data in situations where y-rank is fragile. The proposed alternative, called k-rank, consists of splitting the data set into clusters using the k-means algorithm, and then apply y-rank to the generated clusters.
Pedro V. J. L. Santos   +3 more
openaire   +4 more sources

Reliability of autoregressive error models as post-processors for probabilistic streamflow forecasts [PDF]

open access: yesAdvances in Geosciences, 2011
In this study, the reliability of different versions of autoregressive error models as post-processors for probabilistic streamflow forecasts is evaluated. Rank histograms and reliability indices are used as performance measures.
M. Morawietz, C.-Y. Xu, L. Gottschalk
doaj   +1 more source

Projection onto the Set of Rank-Constrained Structured Matrices for Reduced-Order Controller Design

open access: yesAlgorithms, 2022
In this paper, we propose an efficient numerical computation method of reduced-order controller design for linear time-invariant systems. The design problem is described by linear matrix inequalities (LMIs) with a rank constraint on a structured matrix ...
Masaaki Nagahara, Yu Iwai, Noboru Sebe
doaj   +1 more source

Preferences of Pediatric Patients and Their Caregivers for Chemotherapy‐Induced Nausea and Vomiting Control Endpoints: A Mixed Methods Study

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Purpose Although not always achieved, complete chemotherapy‐induced nausea and vomiting (CINV) control is the conventional goal of CINV prophylaxis. In this two‐center, mixed‐methods study, we sought to understand the preferences of adolescent patients and family caregivers for CINV control endpoints.
Haley Newman   +8 more
wiley   +1 more source

A Rank-Based Assignment Lottery for an Assignment Problem

open access: yesAppliedMath
For a traditional assignment problem with the same number of objects and agents, we introduce a new assignment lottery based on the notion of rank and analyze some of its properties.
Claudia Meo
doaj   +1 more source

Local low-rank approach to nonlinear matrix completion

open access: yesEURASIP Journal on Advances in Signal Processing, 2021
This paper deals with a problem of matrix completion in which each column vector of the matrix belongs to a low-dimensional differentiable manifold (LDDM), with the target matrix being high or full rank.
Ryohei Sasaki   +3 more
doaj   +1 more source

On the Orbit Problem of Free Lie Algebras

open access: yesJournal of New Theory, 2023
By operationalizing $F_{n}$ as a free Lie Algebra of finite rank $n$, this work considers the orbit problem for $F_{n}$. The orbit problem is the following: given an element $u\in F_{n}$ and a finitely generated subalgebra $H$ of $F_{n}$, does $H$ meet ...
Zeynep Yaptı Özkurt
doaj   +1 more source

Nonconvex Nonsmooth Low-Rank Minimization via Iteratively Reweighted Nuclear Norm

open access: yes, 2015
The nuclear norm is widely used as a convex surrogate of the rank function in compressive sensing for low rank matrix recovery with its applications in image recovery and signal processing.
Lin, Zhouchen   +3 more
core   +1 more source

Health‐Related Quality of Life and Symptom Severity Among Patients With PIK3CA‐Related Overgrowth Spectrum: A Mixed‐Methods Study to Understand Real‐World Experience With Alpelisib Treatment

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background PIK3CA‐related overgrowth spectrum (PROS) includes several rare overgrowth disorders resulting from somatic gain‐of‐function mutations in PIK3CA. Despite treatment advances, including the recent approval of alpelisib for PROS in the United States, literature detailing the patient experience with PROS is limited.
Vamsi Bollu   +8 more
wiley   +1 more source

Low-rank semidefinite programming for the MAX2SAT problem

open access: yes, 2018
This paper proposes a new algorithm for solving MAX2SAT problems based on combining search methods with semidefinite programming approaches. Semidefinite programming techniques are well-known as a theoretical tool for approximating maximum satisfiability
Kolter, J. Zico, Wang, Po-Wei
core   +1 more source

Home - About - Disclaimer - Privacy