scholarly journals Tree Topologies along a Tropical Line Segment

2022 ◽  
Author(s):  
Ruriko Yoshida ◽  
Shelby Cox
Keyword(s):  
Line Segment ◽  
Tree Topologies

Less is more: Simple stimuli provoke more variable search strategies.

2020 ◽  
Author(s):  
Anna Nowakowska ◽  
Alasdair D F Clarke ◽  
Jessica Christie ◽  
Josephine Reuther ◽  
Amelia R. Hunt
Keyword(s):  
Line Segment ◽  
Search Strategies ◽  
Complex Objects ◽  
Search Behaviour ◽  
Line Segments ◽  
Surface Level ◽  
Efficient Search ◽  
Less Is More ◽  
Dramatic Shift

We measured the efficiency of 30 participants as they searched through simple line segment stimuli and through a set of complex icons. We observed a dramatic shift from highly variable, and mostly inefficient, strategies with the line segments, to uniformly efficient search behaviour with the icons. These results demonstrate that changing what may initially appear to be irrelevant, surface-level details of the task can lead to large changes in measured behaviour, and that visual primitives are not always representative of more complex objects.

A Novel Airport Detection Method via Line Segment Classification and Texture Classification

2015 ◽  
Vol 12 (12) ◽  
pp. 2408-2412 ◽  
Author(s):  
Gefu Tang ◽  
Zhifeng Xiao ◽  
Qing Liu ◽  
Hua Liu
Keyword(s):  
Line Segment ◽  
Detection Method ◽  
Texture Classification ◽  
Airport Detection

AG3line: Active grouping and geometry-gradient combined validation for fast line segment extraction

2021 ◽  
Vol 113 ◽  
pp. 107834
Author(s):  
Yongjun Zhang ◽  
Dong Wei ◽  
Yansheng Li
Keyword(s):  
Line Segment

scholarly journals Resolving Phylogenetic Relationships within Passeriformes Based on Mitochondrial Genes and Inferring the Evolution of Their Mitogenomes in Terms of Duplications

2019 ◽  
Vol 11 (10) ◽  
pp. 2824-2849 ◽  
Author(s):  
Paweł Mackiewicz ◽  
Adam Dawid Urantówka ◽  
Aleksandra Kroczak ◽  
Dorota Mackiewicz
Keyword(s):  
Phylogenetic Analyses ◽  
Mitochondrial Genes ◽  
The Other ◽  
Phylogenetic Position ◽  
Evolutionary Relationships ◽  
Mitochondrial Genomes ◽  
Ancestral State ◽  
Phylogenetic Information ◽  
Long Time ◽  
Tree Topologies

Abstract Mitochondrial genes are placed on one molecule, which implies that they should carry consistent phylogenetic information. Following this advantage, we present a well-supported phylogeny based on mitochondrial genomes from almost 300 representatives of Passeriformes, the most numerous and differentiated Aves order. The analyses resolved the phylogenetic position of paraphyletic Basal and Transitional Oscines. Passerida occurred divided into two groups, one containing Paroidea and Sylvioidea, whereas the other, Passeroidea and Muscicapoidea. Analyses of mitogenomes showed four types of rearrangements including a duplicated control region (CR) with adjacent genes. Mapping the presence and absence of duplications onto the phylogenetic tree revealed that the duplication was the ancestral state for passerines and was maintained in early diverged lineages. Next, the duplication could be lost and occurred independently at least four times according to the most parsimonious scenario. In some lineages, two CR copies have been inherited from an ancient duplication and highly diverged, whereas in others, the second copy became similar to the first one due to concerted evolution. The second CR copies accumulated over twice as many substitutions as the first ones. However, the second CRs were not completely eliminated and were retained for a long time, which suggests that both regions can fulfill an important role in mitogenomes. Phylogenetic analyses based on CR sequences subjected to the complex evolution can produce tree topologies inconsistent with real evolutionary relationships between species. Passerines with two CRs showed a higher metabolic rate in relation to their body mass.

Load-Optimization in Reconfigurable Networks

2021 ◽  
Vol 48 (3) ◽  
pp. 39-44 ◽  
Author(s):  
Wenkai Dai ◽  
Klaus-Tycho Foerster ◽  
David Fuchssteiner ◽  
Stefan Schmid
Keyword(s):  
Data Centers ◽  
Algorithmic Problem ◽  
Reconfigurable Networks ◽  
Load Optimization ◽  
Clos Networks ◽  
Optical Circuit ◽  
Tree Topologies ◽  
Packet Switch ◽  
Routing Policies

Emerging reconfigurable data centers introduce the unprecedented flexibility in how the physical layer can be programmed to adapt to current traffic demands. These reconfigurable topologies are commonly hybrid, consisting of static and reconfigurable links, enabled by e.g. an Optical Circuit Switch (OCS) connected to top-of-rack switches in Clos networks. Even though prior work has showcased the practical benefits of hybrid networks, several crucial performance aspects are not well understood. In this paper, we study the algorithmic problem of how to jointly optimize topology and routing in reconfigurable data centers with a known traffic matrix, in order to optimize a most fundamental metric, maximum link load. We chart the corresponding algorithmic landscape by investigating both un-/splittable flows and (non-)segregated routing policies. We moreover prove that the problem is not submodular for all these routing policies, even in multi-layer trees, where a topological complexity classification of the problem reveals that already trees of depth two are intractable. However, networks that can be abstracted by a single packet switch (e.g., nonblocking Fat-Tree topologies) can be optimized efficiently, and we present optimal polynomialtime algorithms accordingly. We complement our theoretical results with trace-driven simulation studies, where our algorithms can significantly improve the network load in comparison to the state of the art.

An Efficient Improved Algorithm of Convex Hull

2014 ◽  
Vol 602-605 ◽  
pp. 3104-3106
Author(s):  
Shao Hua Liu ◽  
Jia Hua Zhang
Keyword(s):  
Convex Hull ◽  
Line Segment ◽  
Main Idea ◽  
Discrete Point ◽  
Directed Line ◽  
Generation Algorithm ◽  
Simple Program ◽  
Point Set ◽  
High Computational Efficiency ◽  
Improved Algorithm

This paper introduced points and directed line segment relation judgment method, the characteristics of generation and Graham method using the original convex hull generation algorithm of convex hull discrete points of the convex hull, an improved algorithm for planar discrete point set is proposed. The main idea is to use quadrilateral to divide planar discrete point set into five blocks, and then by judgment in addition to the four district quadrilateral internally within the point is in a convex edge. The result shows that the method is relatively simple program, high computational efficiency.

INVESTIGATION ON MULTISETS MIXTURE LEARNING BASED OBJECT DETECTION

2007 ◽  
Vol 21 (08) ◽  
pp. 1339-1351 ◽  
Author(s):  
ZHI-YONG LIU ◽  
HONG QIAO ◽  
LEI XU
Keyword(s):  
Object Detection ◽  
Hough Transform ◽  
Line Segment ◽  
Reconstruction Error ◽  
Mean Square ◽  
Noise Resistance ◽  
Generalized Hough Transform ◽  
The Mean ◽  
Sample Reconstruction

By minimizing the mean square reconstruction error, multisets mixture learning (MML) provides a general approach for object detection in image. To calculate each sample reconstruction error, as the object template is represented by a set of contour points, the MML needs to inefficiently enumerate the distances between the sample and all the contour points. In this paper, we develop the line segment approximation (LSA) algorithm to calculate the reconstruction error, which is shown theoretically and experimentally to be more efficient than the enumeration method. It is also experimentally illustrated that the MML based algorithm has a better noise resistance ability than the generalized Hough transform (GHT) based counterpart.

Sign in / Sign up

Export Citation Format

Share Document