Results 11 to 20 of about 476,385 (316)

hennylab/Neuronal-Convex-hull-intersection: Neuronal-Convex-hull-intersection [PDF]

open access: yes, 2022
Raw data, MATLAB scripts and data analysis from: Geometrical factors determining dendritic domain intersection between neurons: a modeling study Rafael Ignacio Gatica1, Trinidad Montero1, Navid Farassat2 and Pablo Henny1 1Laboratorio de Neuroanatomía ...
hennylab
core   +1 more source

Exploring temporal instability effects on bicyclist injury severities determinants for intersection and non-intersection-related crashes [PDF]

open access: yes, 2023
Cycling is a sustainable and healthy mode of transportation with direct links to reducing traffic congestion, lowering greenhouse gas emissions, and improving air quality.
Shamsunnahar Yasmin (11237904)   +2 more
core   +2 more sources

Private and threshold set-intersection [PDF]

open access: yes, 2018
: "In this paper we consider the problem of privately computing the intersection of sets (set-intersection), as well as several variations on this problem: cardinality set-intersection, threshold set-intersection, and over-threshold set-intersection ...
Lea Kissner (5358443)   +1 more
core   +1 more source

When private set intersection meets big data : an efficient and scalable protocol [PDF]

open access: yes, 2013
Large scale data processing brings new challenges to the design of privacy-preserving protocols: how to meet the increasing requirements of speed and throughput of modern applications, and how to scale up smoothly when data being protected is big ...
Chen, Liqun   +5 more
core   +1 more source

The Intersection Structure of $t$-Intersecting Families [PDF]

open access: yesThe Electronic Journal of Combinatorics, 2005
A family of sets is $t$-intersecting if any two sets from the family contain at least $t$ common elements. Given a $t$-intersecting family of $r$-sets from an $n$-set, how many distinct sets of size $k$ can occur as pairwise intersections of its members? We prove an asymptotic upper bound on this number that can always be achieved.
openaire   +2 more sources

On Intersecting Polygons

open access: yesCoRR, 2023
Consider two regions in the plane, bounded by an $n$-gon and an $m$-gon, respectively. At most how many connected components can there be in their intersection? This question was asked by Croft. We answer this asymptotically, proving the bounds $$\left\lfloor \frac{m}{2}\right\rfloor \cdot \left\lfloor \frac{n}{2}\right\rfloor\le f(n,m)\le \left\lfloor
openaire   +3 more sources

Introduction to Intersection Theory [PDF]

open access: yes, 2023
openIntersection theory is a fundamental tool in algebraic geometry to study the geometry of algebraic varieties. The aim of this thesis is to provide a comprehensive and rigorous introduction to intersection theory by following William Fulton’s classic ...
SCHIAVONE, LORENZO
core  

Plasma YKL-40 Elevation on Admission and Follow-Up Is Associated with Diastolic Dysfunction and Mortality in Patients with Acute Myocardial Infarction

open access: yesCardiology Research and Practice, 2018
Objective. The aim of the study was to determine an association between the plasma YKL-40 level and echocardiographic left ventricle systolic and diastolic function parameters in patients with acute myocardial infarction. Subjects and Methods.
Selcuk Pala   +5 more
doaj   +1 more source

Development of alternatives for Signalized intersection- A Case study of Laxmi Mill junction, Coimbatore [PDF]

open access: yesMATEC Web of Conferences, 2023
Urbanization and industrialization are two of the most important features of modern civilization. This leads to traffic congestion at the major roads of urbanized areas.
Indhiradevi P.   +5 more
doaj   +1 more source

Intersections of graphs

open access: yesJournal of Graph Theory, 2011
Summary: Let \(G\) and \(H\) be two graphs of order \(n\). If we place copies of \(G\) and \(H\) on a common vertex set, how much or little can they be made to overlap? The aim of this article is to provide some answers to this question, and to pose a number of related problems. Along the way, we solve a conjecture of \textit{P. Erdős} et al. [ibid. 12,
Bollobas, B, Scott, A
openaire   +1 more source

Home - About - Disclaimer - Privacy