Results 21 to 30 of about 441 (217)

Implicit occluders

open access: yes2004 IEEE Symposium on Volume Visualization and Graphics, 2005
In this paper we propose a novel visibility-culling technique for optimizing the computation and rendering of opaque isosurfaces. Given a continuous scalar field f (x) over a domain D and an isovalue w, our technique exploits the continuity of f to determine conservative visibility bounds implicitly, i.e., without the need for actually computing the ...
Sinésio Pesco   +3 more
openaire   +2 more sources

Implicitization of Rational Parametric Surfaces

open access: yes, 1996
A generalized projective implicitization theorem is presented that can be used to solve the implicitization of rational parametric curves and surfaces in an affine space. The Groebner bases technique is used to implement the algorithm.
LUO, TIE, HSU, CHIH-PING, FIX, GEORGE
core   +1 more source

Piecewise approximate implicitization: Experiments using industrial data

open access: yes, 2006
We compare several methods for approximate implicitization by piecewise polynomials which have been developed by the authors, and a linear-algebrabased numerical method for implicitization which is provided as a part of MAPLE.
Jan B. Thomassen   +4 more
core   +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

Approximate Implicitization using Chebyshev Polynomials [PDF]

open access: yes, 2011
Whereas traditional approaches to implicitization of rational parametric curves have focused on exact methods, the past two decades have seen increased interest in the application of approximate methods for implicitization.
Barrowclough, Oliver Joseph David
core  

The skills required for transition to university and study in biological sciences: A student perspective

open access: yesFEBS Open Bio, EarlyView.
Bioscience students were asked for their opinions on the value and teaching of skills. 204 responded that teamwork, time management and study skills are necessary to reach University, that scientific writing, research, laboratory and presentation skills are taught effectively during their studies, while other skills are gained inherently through study ...
Janella Borrell, Susan Crennell
wiley   +1 more source

Why human connection is the true metric of research success

open access: yesFEBS Open Bio, EarlyView.
Human‐centred mentorship can be shaped by mentor attributes, actions, intrinsic drive and career ambition. Drawing on reflections across Singapore and France, as well as workshop insights from FEBS‐IUBMB ENABLE 2024, this article shows that human‐centred mentorship creates the conditions for sustainable growth, well‐being and retention in research ...
Timothy Lin Yun Tan   +3 more
wiley   +1 more source

Approximate Implicitization using Linear Algebra [PDF]

open access: yes, 2011
In this talk we consider a range of methods for exact and approximate implicitization of rational parametric curves and surfaces using linear algebra.
Barrowclough, Oliver Joseph David
core  

Pathways and pitfalls: a qualitative study of student experiences in biomedical science education

open access: yesFEBS Open Bio, EarlyView.
Biomedical science students from underrepresented backgrounds face barriers including financial strain, disrupted laboratory access and cultural exclusion. Peer networks provide vital support when institutional systems are difficult to navigate. To create inclusive learning environments and achieve academic success, educators should blend active, hands‐
Olivia J. Russell   +8 more
wiley   +1 more source

Implicit proofs

open access: yesJournal of Symbolic Logic, 2004
Abstract.We describe a general method how to construct from a prepositional proof system P a possibly much stronger proof system iP. The system iP operates with exponentially long P-proofs described “implicitly” by polynomial size circuits.As an example we prove that proof system iEF, implicit EF, corresponds to bounded arithmetic theory and hence, in
openaire   +3 more sources

Home - About - Disclaimer - Privacy