Results 101 to 110 of about 519,259 (281)

Método para Obtener los Elementos de las Secciones Cónicas por Medio de Derivación Implícita

open access: yesTecnoLógicas, 2007
As a result of the research project "Strategies for differential calculus meaningful teaching and learning", this paper shows an alternative method to find simplified expressions to determine coordinates and equations for conical sections with focal axis
María C. González-Mazuelo   +1 more
doaj  

What is... Random Algebraic Geometry? [PDF]

open access: yesarXiv
We survey some ideas from the subject of Random Algebraic Geometry, a field that introduces a probabilistic perspective on classical topics in real algebraic geometry. This offers a modern approach to classical problems, such as Hilbert's Sixteenth Problem.
arxiv  

Multi‐view subspace clustering with incomplete graph information

open access: yesIET Computer Vision, EarlyView., 2022
Abstract The core of multi‐view clustering is how to exploit the shared and specific information of multi‐view data properly. The data missing and incompleteness bring great challenges to multi‐view clustering. In this paper, we propose an innovative multi‐view subspace clustering method with incomplete graph information, so‐called incomplete multiple ...
Xiaxia He   +5 more
wiley   +1 more source

Topology of Injective Endomorphisms of Real Algebraic Sets [PDF]

open access: yesarXiv, 2002
Using only basic topological properties of real algebraic sets and regular morphisms we show that any injective regular self-mapping of a real algebraic set is surjective. Then we show that injective morphisms between germs of real algebraic sets define a partial order on the equivalence classes of these germs divided by continuous semi-algebraic ...
arxiv  

A Sharper Ramsey Theorem for Constrained Drawings

open access: yesJournal of Graph Theory, EarlyView.
ABSTRACT Given a graph G $G$ and a collection C ${\mathscr{C}}$ of subsets of Rd ${{\mathbb{R}}}^{d}$ indexed by the subsets of vertices of G $G$, a constrained drawing of G $G$ is a drawing where each edge is drawn inside some set from C ${\mathscr{C}}$, in such a way that nonadjacent edges are drawn in sets with disjoint indices.
Pavel Paták
wiley   +1 more source

Lumped and distributed‐parameter pipe model framework for thermal transients: State‐space and transfer function theory and application to multi‐energy systems

open access: yesIET Renewable Power Generation, Volume 17, Issue 1, Page 199-215, 6 January 2023., 2023
Abstract The accurate prediction and simulation of thermal transients in district heating networks is essential for the meaningful analysis of combined heat and power systems. For this purpose, the focus of this paper lies on the development of a consistent and comprehensive modelling framework that links diverse pipe model categories to specific ...
Xiu Liu, Kai Strunz
wiley   +1 more source

Sylvester-Gallai type theorems for quadratic polynomials

open access: yesDiscrete Analysis, 2020
Sylvester-Gallai type theorems for quadratic polynomials, Discrete Analysis 2020:13, 34 pp. The [Sylvester-Gallai theorem](https://en.wikipedia.org/wiki/Sylvester%E2%80%93Gallai_theorem) asserts that given $n$ points in a plane that are not contained in
Amir Shpilka
doaj   +1 more source

Home - About - Disclaimer - Privacy