Results 51 to 60 of about 7,878,130 (281)

Design and evaluation of FEBS Education and Training Academy module – Integrating generative artificial intelligence into life‐science education

FEBS Open Bio, EarlyView.
Life‐science educators from 14 countries redesigned their own course materials with generative AI in a three‐session, pedagogy‐first FEBS Education and Training Academy workshop built on PICRAT. Among 12 matched respondents, four more reported high confidence in each of five practical domains, and 10 of 13 reported implementing at least one idea ...
Zvonimir Mlinarić, Ali Burak Özkaya
wiley   +1 more source

New error bounds for linear complementarity problems of weakly chained diagonally dominant B-matrices

Open Mathematics, 2017
Some new error bounds for the linear complementarity problems are obtained when the involved matrices are weakly chained diagonally dominant B-matrices. Numerical examples are given to show the effectiveness of the proposed bounds.
Sun Deshu, Wang Feng
doaj   +1 more source

Multi-agent network flows that solve linear complementarity problems [PDF]

, 2018
summary:In this paper, we consider linear complementarity problems with positive definite matrices through a multi-agent network. We propose a distributed continuous-time algorithm and show its correctness and convergence.
Liang, Shu, Zeng, Xianlin
core   +1 more source

Comparing the Effect of Semi‐Immersive Virtual Reality, Computerized Cognitive Training, and Traditional Rehabilitation on Cognitive Function in Multiple Sclerosis: A Randomized Clinical Trial

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio, Desiree Latella, Lilla Bonanno, Paulo Cezar Rocha dos Santos, Marcos Maldonado‐Díaz, Meir Plotnik, Rosaria De Luca, Angelo Quartarone, Rocco Salvatore Calabrò   +8 more
wiley   +1 more source

INFEASIBLE FULL NEWTON-STEP INTERIOR-POINT METHOD FOR LINEAR COMPLEMENTARITY PROBLEMS

Croatian Operational Research Review, 2012
In this paper we consider an Infeasible Full Newton-step Interior-Point Method (IFNS-IPM) for monotone Linear Complementarity Problems (LCP). The method does not require a strictly feasible starting point.
Goran Lešaja, Antre M. Drummer, Ljiljana Miletić   +2 more
doaj  

Continuous Homotopies for the Linear Complementarity Problem [PDF]

SIAM Journal on Matrix Analysis and Applications, 1989
The linear complementarity problem is formulated as a nonlinear system of equations or a constrained optimization problem. The present paper proposes and analyzes several continuous homotopies for the obtained nonlinear formulation of the linear complementarity problem. Some numerical experiments are verbally reported. A technical report of the authors
Watson, Layne T., Bixler, J. Patrick, Poore, Aubrey B.   +2 more
openaire   +2 more sources

Deep Learning Pose Estimation for Phenotyping of Co‐Occurring Hyperkinetic Movement Disorders

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective To explore whether routine outpatient video combined with deep learning‐based pose estimation and clinically interpretable kinematic features can support multi‐label phenotyping of co‐occurring hyperkinetic movement disorders (HMDs).
Laura Cif, Diane Demailly, Gabriella A. Horvàth, Juan Dario Ortigoza Escobar, Nathalie Dorison, Mayté Castro Jiménez, Cécile A. Hubsch, Thomas Wirth, Gun‐Marie Hariz, Sophie Huby, Morgan Dornadic, Zohra Souei, Muhammad Mushhood Ur Rehman, Simone Hemm, Mehdi Boulaymen, Eduardo M. Moraud, Jocelyne Bloch, Xavier Vasques   +17 more
wiley   +1 more source

An arc search interior-point algorithm for monotone linear complementarity problems over symmetric cones

Mathematical Modelling and Analysis, 2018
An arc search interior-point algorithm for monotone symmetric cone linear complementarity problem is presented. The algorithm estimates the central path by an ellipse and follows an ellipsoidal approximation of the central path to reach an ε-approximate ...
Mohammad Pirhaji, Maryam Zangiabadi, Hossein Mansouri, Saman H. Amin   +3 more
doaj   +1 more source

Global error bounds of the extended vertical linear complementarity problems for Dashnic–Zusmanovich matrices and Dashnic–Zusmanovich-B matrices

Journal of Inequalities and Applications, 2022
Global error bounds of the extended vertical linear complementarity problems for Dashnic–Zusmanovich (DZ) matrices and Dashnic–Zusmanovich-B (DZ-B) matrices are presented, respectively.
Yingxia Zhao, Deshu Sun
doaj   +1 more source

Algorithms and Environments for Complementarity [PDF]

, 2000
Complementarity problems arise in a wide variety of disciplines. Prototypical examples include theWardropian andWalrasian equilibrium models encountered in the engineering and economic disciplines and the first order optimality conditions for nonlinear
Munson, Todd
core