Results 131 to 140 of about 11,895,834 (312)
Understanding and using the implicit association test: I. An improved scoring algorithm.
Journal of Personality and Social Psychology, 2003 In reporting Implicit Association Test (IAT) results, researchers have most often used scoring conventions described in the first publication of the IAT (A.G. Greenwald, D.E. McGhee, & J.L.K. Schwartz, 1998).
A. Greenwald, Brian A. Nosek, M. Banaji
semanticscholar +1 more source
Molecular Oncology, Volume 19, Issue 4, Page 1170-1187, April 2025.High‐grade serous ovarian cancer (HGSOC) is the most common and aggressive type of ovarian cancer with urgent need for new treatment strategies. This study evaluates plasma‐activated media (PAM) as a novel treatment for HGSOC, showing its ability to selectively induce oxidative stress and apoptosis in HGSOC cell lines, patient ascites cells and primary
Lorena T. Davies +9 more
wiley +1 more source
Weighted graph algorithms with Python [PDF]
The Python Papers 11, 3 (2016), 2015 Python implementation of selected weighted graph algorithms is presented. The minimal graph interface is defined together with several classes implementing this interface. Graph nodes can be any hashable Python objects. Directed edges are instances of the Edge class. Graphs are instances of the Graph class.
arxiv
International Journal of Distributed Sensor Networks, 2015 We propose a selective random cyclic-delay diversity (CDD) enhanced joint cooperative relay and hybrid automatic repeat request (HARQ) scheme for two-hop vehicular communications.
Gang Wu, Qinghe Du, Kun Hua
doaj +1 more source
A Limited Memory Algorithm for Bound Constrained Optimization
SIAM Journal on Scientific Computing, 1995 An algorithm for solving large nonlinear optimization problems with simple bounds is described. It is based on the gradient projection method and uses a limited memory BFGS matrix to approximate the Hessian of the objective function.
R. Byrd, P. Lu, J. Nocedal, C. Zhu
semanticscholar +1 more source
Algorithmics of Diffraction [PDF]
Acta Physica Polonica B Proceedings Supplement, 2019 Diffraction and Low-x 2018 proceedings (Acta Phys. Pol.
openaire +4 more sources
Molecular Oncology, Volume 19, Issue 4, Page 1117-1131, April 2025.This study shows that patients with gastrointestinal adenocarcinomas can be stratified into six distinct subtypes based on genome‐scale DNA methylation profiling. This stratification, achieved using a robust analytical framework, aligns with established tumor characteristics and holds potential to support prognostication.
Rita Pinto +3 more
wiley +1 more source
Hedging Algorithms and Repeated Matrix Games [PDF]
Workshop of the European Conference on Machine Learning on Machine
Learning and Data Mining in and around Games, 2011, 2018 Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that $UCB$, $M3$, $S$ or $Exp3$ algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on prediction problems.
arxiv
Molecular Oncology, Volume 19, Issue 4, Page 1054-1074, April 2025.The mitosis‐related gene SKA1 was among 629 genes consistently dysregulated in OSCC across nine public gene expression datasets. In OSCC cell lines, SKA1 promoted proliferation and migration, enhanced radioresistance, and reduced radiation‐induced senescence.
Alexander Michael Grandits +7 more
wiley +1 more source
A more robust boosting algorithm [PDF]
arXiv, 2009 We present a new boosting algorithm, motivated by the large margins theory for boosting. We give experimental evidence that the new algorithm is significantly more robust against label noise than existing boosting algorithm.
arxiv