scholarly journals On the maximum size of random trees

1985 ◽  
pp. 139-144 ◽  
Author(s):  
M. Protasi ◽  
M. Talamo
Keyword(s):  
Maximum Size ◽  
Random Trees

Continuous Quantitative Monitoring of Mural, Platelet-Dependent, Thrombus Kinetics in the Crushed Rat Femoral Vein

1991 ◽  
Vol 65 (04) ◽  
pp. 425-431 ◽  
Author(s):  
F Stockmans ◽  
H Deckmyn ◽  
J Gruwez ◽  
J Vermylen ◽  
R Acland
Keyword(s):  
Thrombus Formation ◽  
Femoral Vein ◽  
Maximum Size ◽  
Digital Analysis ◽  
Video Recordings ◽  
Quantitative Monitoring ◽  
Set Up ◽  
Kinetics Of ◽  
Quantitative Nature

SummaryA new in vivo method to study the size and dynamics of a growing mural thrombus was set up in the rat femoral vein. The method uses a standardized crush injury to induce a thrombus, and a newly developed transilluminator combined with digital analysis of video recordings. Thrombi in this model formed rapidly, reaching a maximum size 391 ± 35 sec following injury, after which they degraded with a half-life of 197 ± 31 sec. Histological examination indicated that the thrombi consisted mainly of platelets. The quantitative nature of the transillumination technique was demonstrated by simultaneous measurement of the incorporation of 111In labeled platelets into the thrombus. Thrombus formation, studied at 30 min interval in both femoral veins, showed satisfactory reproducibility overall and within a given animalWith this method we were able to induce a thrombus using a clinically relevant injury and to monitor continuously and reproducibly the kinetics of thrombus formation in a vessel of clinically and surgically relevant size

Persistence of giants: population dynamics of the limpet Scutellastra laticostata on rocky shores in Western Australia

2020 ◽  
Vol 646 ◽  
pp. 79-92
Author(s):  
RE Scheibling ◽  
R Black
Keyword(s):  
Population Dynamics ◽  
Western Australia ◽  
Size Structure ◽  
Survival Rates ◽  
Maximum Size ◽  
High Rate ◽  
Adult Survival ◽  
Rocky Shores ◽  
Adult Size ◽  
Decadal Time Scale

Population dynamics and life history traits of the ‘giant’ limpet Scutellastra laticostata on intertidal limestone platforms at Rottnest Island, Western Australia, were recorded by interannual (January/February) monitoring of limpet density and size structure, and relocation of marked individuals, at 3 locations over periods of 13-16 yr between 1993 and 2020. Limpet densities ranged from 4 to 9 ind. m-2 on wave-swept seaward margins of platforms at 2 locations and on a rocky notch at the landward margin of the platform at a third. Juvenile recruits (25-55 mm shell length) were present each year, usually at low densities (<1 m-2), but localized pulses of recruitment occurred in some years. Annual survival rates of marked limpets varied among sites and cohorts, ranging from 0.42 yr-1 at the notch to 0.79 and 0.87 yr-1 on the platforms. A mass mortality of limpets on the platforms occurred in 2003, likely mediated by thermal stress during daytime low tides, coincident with high air temperatures and calm seas. Juveniles grew rapidly to adult size within 2 yr. Asymptotic size (L∞, von Bertalanffy growth model) ranged from 89 to 97 mm, and maximum size from 100 to 113 mm, on platforms. Growth rate and maximum size were lower on the notch. Our empirical observations and simulation models suggest that these populations are relatively stable on a decadal time scale. The frequency and magnitude of recruitment pulses and high rate of adult survival provide considerable inertia, enabling persistence of these populations in the face of sporadic climatic extremes.

scholarly journals A Comparison of Local Path Planning Techniques of Autonomous Surface Vehicles for Monitoring Applications: The Ypacarai Lake Case-study

Sensors ◽  
2020 ◽  
Vol 20 (5) ◽  
pp. 1488
Author(s):  
Federico Peralta ◽  
Mario Arzamendia ◽  
Derlis Gregor ◽  
Daniel G. Reina ◽  
Sergio Toral
Keyword(s):  
Path Planning ◽  
Random Trees ◽  
Fast Marching Method ◽  
Fast Marching ◽  
Planning Techniques ◽  
Advantages And Disadvantages ◽  
Autonomous Surface Vehicle ◽  
Local Path Planning ◽  
Custom Made ◽  
Local Path

Local path planning is important in the development of autonomous vehicles since it allows a vehicle to adapt their movements to dynamic environments, for instance, when obstacles are detected. This work presents an evaluation of the performance of different local path planning techniques for an Autonomous Surface Vehicle, using a custom-made simulator based on the open-source Robotarium framework. The conducted simulations allow to verify, compare and visualize the solutions of the different techniques. The selected techniques for evaluation include A*, Potential Fields (PF), Rapidly-Exploring Random Trees* (RRT*) and variations of the Fast Marching Method (FMM), along with a proposed new method called Updating the Fast Marching Square method (uFMS). The evaluation proposed in this work includes ways to summarize time and safety measures for local path planning techniques. The results in a Lake environment present the advantages and disadvantages of using each technique. The proposed uFMS and A* have been shown to achieve interesting performance in terms of processing time, distance travelled and security levels. Furthermore, the proposed uFMS algorithm is capable of generating smoother routes.

scholarly journals Development of an Improved Rapidly Exploring Random Trees Algorithm for Static Obstacle Avoidance in Autonomous Vehicles

Sensors ◽  
2021 ◽  
Vol 21 (6) ◽  
pp. 2244
Author(s):  
S. M. Yang ◽  
Y. A. Lin
Keyword(s):  
Path Planning ◽  
Obstacle Avoidance ◽  
Autonomous Vehicles ◽  
Autonomous Vehicle ◽  
Optimal Path ◽  
Random Trees ◽  
Average Deviation ◽  
Lane Changes ◽  
Path Smoothing ◽  
Rapidly Exploring Random Trees

Safe path planning for obstacle avoidance in autonomous vehicles has been developed. Based on the Rapidly Exploring Random Trees (RRT) algorithm, an improved algorithm integrating path pruning, smoothing, and optimization with geometric collision detection is shown to improve planning efficiency. Path pruning, a prerequisite to path smoothing, is performed to remove the redundant points generated by the random trees for a new path, without colliding with the obstacles. Path smoothing is performed to modify the path so that it becomes continuously differentiable with curvature implementable by the vehicle. Optimization is performed to select a “near”-optimal path of the shortest distance among the feasible paths for motion efficiency. In the experimental verification, both a pure pursuit steering controller and a proportional–integral speed controller are applied to keep an autonomous vehicle tracking the planned path predicted by the improved RRT algorithm. It is shown that the vehicle can successfully track the path efficiently and reach the destination safely, with an average tracking control deviation of 5.2% of the vehicle width. The path planning is also applied to lane changes, and the average deviation from the lane during and after lane changes remains within 8.3% of the vehicle width.

scholarly journals ON THE HEIGHT AND RELATIONAL COMPLEXITY OF A FINITE PERMUTATION GROUP

2021 ◽  
pp. 1-40
Author(s):  
NICK GILL ◽  
BIANCA LODÀ ◽  
PABLO SPIGA
Keyword(s):  
Permutation Group ◽  
Model Theory ◽  
Independent Set ◽  
Maximum Size ◽  
Proper Subset ◽  
Permutation Groups ◽  
Finite Permutation Group ◽  
Pointwise Stabilizer ◽  
Relational Complexity

Abstract Let G be a permutation group on a set $\Omega $ of size t. We say that $\Lambda \subseteq \Omega $ is an independent set if its pointwise stabilizer is not equal to the pointwise stabilizer of any proper subset of $\Lambda $ . We define the height of G to be the maximum size of an independent set, and we denote this quantity $\textrm{H}(G)$ . In this paper, we study $\textrm{H}(G)$ for the case when G is primitive. Our main result asserts that either $\textrm{H}(G)< 9\log t$ or else G is in a particular well-studied family (the primitive large–base groups). An immediate corollary of this result is a characterization of primitive permutation groups with large relational complexity, the latter quantity being a statistic introduced by Cherlin in his study of the model theory of permutation groups. We also study $\textrm{I}(G)$ , the maximum length of an irredundant base of G, in which case we prove that if G is primitive, then either $\textrm{I}(G)<7\log t$ or else, again, G is in a particular family (which includes the primitive large–base groups as well as some others).

scholarly journals Gibbs partitions, Riemann–Liouville fractional operators, Mittag–Leffler functions, and fragmentations derived from stable subordinators

2021 ◽  
Vol 58 (2) ◽  
pp. 314-334
Author(s):  
Man-Wai Ho ◽  
Lancelot F. James ◽  
John W. Lau
Keyword(s):  
Special Functions ◽  
Dirichlet Distribution ◽  
Random Trees ◽  
Fractional Integrals ◽  
Biased Sampling ◽  
Scaling Limits ◽  
Fractional Operators ◽  
Random Partitions ◽  
Two Parameter ◽  
Potential Use

AbstractPitman (2003), and subsequently Gnedin and Pitman (2006), showed that a large class of random partitions of the integers derived from a stable subordinator of index $\alpha\in(0,1)$ have infinite Gibbs (product) structure as a characterizing feature. The most notable case are random partitions derived from the two-parameter Poisson–Dirichlet distribution, $\textrm{PD}(\alpha,\theta)$, whose corresponding $\alpha$-diversity/local time have generalized Mittag–Leffler distributions, denoted by $\textrm{ML}(\alpha,\theta)$. Our aim in this work is to provide indications on the utility of the wider class of Gibbs partitions as it relates to a study of Riemann–Liouville fractional integrals and size-biased sampling, and in decompositions of special functions, and its potential use in the understanding of various constructions of more exotic processes. We provide characterizations of general laws associated with nested families of $\textrm{PD}(\alpha,\theta)$ mass partitions that are constructed from fragmentation operations described in Dong et al. (2014). These operations are known to be related in distribution to various constructions of discrete random trees/graphs in [n], and their scaling limits. A centerpiece of our work is results related to Mittag–Leffler functions, which play a key role in fractional calculus and are otherwise Laplace transforms of the $\textrm{ML}(\alpha,\theta)$ variables. Notably, this leads to an interpretation within the context of $\textrm{PD}(\alpha,\theta)$ laws conditioned on Poisson point process counts over intervals of scaled lengths of the $\alpha$-diversity.

scholarly journals Modules and Techniques for Motion Planning: An Industrial Perspective

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 420
Author(s):  
Stefano Quer ◽  
Luz Garcia
Keyword(s):  
Data Fusion ◽  
Autonomous Driving ◽  
Random Trees ◽  
Approximation Techniques ◽  
Main Research ◽  
Autonomous Cars ◽  
Critical Issues ◽  
Relative Errors ◽  
Path Planner ◽  
Many Core

Research on autonomous cars has become one of the main research paths in the automotive industry, with many critical issues that remain to be explored while considering the overall methodology and its practical applicability. In this paper, we present an industrial experience in which we build a complete autonomous driving system, from the sensor units to the car control equipment, and we describe its adoption and testing phase on the field. We report how we organize data fusion and map manipulation to represent the required reality. We focus on the communication and synchronization issues between the data-fusion device and the path-planner, between the CPU and the GPU units, and among different CUDA kernels implementing the core local planner module. In these frameworks, we propose simple representation strategies and approximation techniques which guarantee almost no penalty in terms of accuracy and large savings in terms of memory occupation and memory transfer times. We show how we adopt a recent implementation on parallel many-core devices, such as CUDA-based GPGPU, to reduce the computational burden of rapidly exploring random trees to explore the state space along with a given reference path. We report on our use of the controller and the vehicle simulator. We run experiments on several real scenarios, and we report the paths generated with the different settings, with their relative errors and computation times. We prove that our approach can generate reasonable paths on a multitude of standard maneuvers in real time.

Sign in / Sign up

Export Citation Format

Share Document