scholarly journals THE PROBLEM OF EMPLACEMENT OF TRIANGULAR GEOMETRIC NET ON THE SPHERE WITH NODES ON THE SAME LEVEL

2017 ◽  
Vol 13 (2) ◽  
pp. 154-160 ◽  
Author(s):  
Vasilij D. Antoshkin
Keyword(s):  
Spherical Triangle ◽  
Minimum Size ◽  
Effective Solution ◽  
Shortest Distance ◽  
Minimum Number ◽  
Triangular Network ◽  
Spherical Triangles

One of the methods of formation of triangular networks in the field is investigated. Conditions of the problem of locating a triangular network in the area are delivered. The criterion for assessing the effectiveness of the solution of the problem is the minimum number of sizes of the dome panels, the possibility of pre-assembly and pre-stressing. The solution of the problem of one embodiment of a triangular network of accommodation in a compatible spherical triangle and, accordingly, on the sphere. Placing on the area of regular and irregular hexagon inscribed in a circle, ie, flat figures or composed in turn of spherical triangles with minimum dimensions of the ribs, is an effective solution in the form of a network formed by circles of minimum radii, ie, circles on a sphere obtained at the touch of three adjacent circles whose centers are at the shortest distance from each other. Task align the supports at one level can be resolved by placement in the regular hexagons and irregular pentagons hexagonsinscribed in a circle of minimum size.

Path Planning of Mobile Robot Using Improved Artificial Bee Colony Algorithm

2020 ◽  
Vol 38 (9A) ◽  
pp. 1384-1395
Author(s):  
Rakaa T. Kamil ◽  
Mohamed J. Mohamed ◽  
Bashra K. Oleiwi
Keyword(s):  
Mobile Robot ◽  
Comparative Research ◽  
Artificial Bee Colony Algorithm ◽  
Artificial Bee Colony ◽  
Dynamic Control ◽  
Computational Time ◽  
Bee Colony ◽  
Shortest Distance ◽  
Minimum Number ◽  
Cubic Polynomial

A modified version of the artificial Bee Colony Algorithm (ABC) was suggested namely Adaptive Dimension Limit- Artificial Bee Colony Algorithm (ADL-ABC). To determine the optimum global path for mobile robot that satisfies the chosen criteria for shortest distance and collision–free with circular shaped static obstacles on robot environment. The cubic polynomial connects the start point to the end point through three via points used, so the generated paths are smooth and achievable by the robot. Two case studies (or scenarios) are presented in this task and comparative research (or study) is adopted between two algorithm’s results in order to evaluate the performance of the suggested algorithm. The results of the simulation showed that modified parameter (dynamic control limit) is avoiding static number of limit which excludes unnecessary Iteration, so it can find solution with minimum number of iterations and less computational time. From tables of result if there is an equal distance along the path such as in case A (14.490, 14.459) unit, there will be a reduction in time approximately to halve at percentage 5%.

Areas, Angles, and Polyhedra

2017 ◽  
Author(s):  
Glen Van Brummelen
Keyword(s):  
Eighteenth Century ◽  
Unit Sphere ◽  
Regular Polyhedron ◽  
Spherical Triangle ◽  
French Mathematician ◽  
Regular Polyhedra ◽  
Leonhard Euler ◽  
Spherical Triangles

This chapter explains how to find the area of an angle or polyhedron. It begins with a discussion of how to determine the area of a spherical triangle or polygon. The formula for the area of a spherical triangle is named after Albert Girard, a French mathematician who developed a theorem on the areas of spherical triangles, found in his Invention nouvelle. The chapter goes on to consider Euler's polyhedral formula, named after the eighteenth-century mathematician Leonhard Euler, and the geometry of a regular polyhedron. Finally, it describes an approach to finding the proportion of the volume of the unit sphere that the various regular polyhedra occupy.

A Minimum Size of the Search Cube in the MAFA-ILS Method

2017 ◽  
Author(s):  
Krzysztof Nowel ◽  
Sławomir Cellmer ◽  
Dawid Kwasniak
Keyword(s):  
Modern Method ◽  
The Other ◽  
Minimum Size ◽  
Proper Solution ◽  
Effective Solution ◽  
Search Region ◽  
Gnss Positioning ◽  
Integer Least Squares ◽  
Classic Approach

The Modified Ambiguity Function Approach – Integer Least Squares (MAFA-ILS) is one of the modern method for the precise real-time GNSS positioning, for many applications such as geodesy or surveying engineering. Contrary to the classic approach, in the MAFA-ILS method the solution is sought in the coordinate domain. However, to obtain a proper solution, the search region cannot be too small. On the other hand, to have an effective solution – in the computational load sense – this region cannot be too big. In this case the determination of the minimum size of appropriate search region is not a trivial task. The paper presents a certain solution of this problem.

IDENTIFYING CO-REGULATING MICRORNA GROUPS

2010 ◽  
Vol 08 (01) ◽  
pp. 99-115 ◽  
Author(s):  
JIYUAN AN ◽  
KWOK PUI CHOI ◽  
CHRISTINE A. WELLS ◽  
YI-PING PHOEBE CHEN
Keyword(s):  
Neurodegenerative Diseases ◽  
Target Genes ◽  
Signal To Noise Ratio ◽  
Statistical Tests ◽  
False Positive Rate ◽  
Target Prediction ◽  
Minimum Size ◽  
Supplementary Information ◽  
P Value ◽  
Minimum Number

Background: Current miRNA target prediction tools have the common problem that their false positive rate is high. This renders identification of co-regulating groups of miRNAs and target genes unreliable. In this study, we describe a procedure to identify highly probable co-regulating miRNAs and the corresponding co-regulated gene groups. Our procedure involves a sequence of statistical tests: (1) identify genes that are highly probable miRNA targets; (2) determine for each such gene, the minimum number of miRNAs that co-regulate it with high probability; (3) find, for each such gene, the combination of the determined minimum size of miRNAs that co-regulate it with the lowest p-value; and (4) discover for each such combination of miRNAs, the group of genes that are co-regulated by these miRNAs with the lowest p-value computed based on GO term annotations of the genes. Results: Our method identifies 4, 3 and 2-term miRNA groups that co-regulate gene groups of size at least 3 in human. Our result suggests some interesting hypothesis on the functional role of several miRNAs through a "guilt by association" reasoning. For example, miR-130, miR-19 and miR-101 are known neurodegenerative diseases associated miRNAs. Our 3-term miRNA table shows that miR-130/19/101 form a co-regulating group of rank 22 (p-value =1.16 × 10-2). Since miR-144 is co-regulating with miR-130, miR-19 and miR-101 of rank 4 (p-value = 1.16 × 10-2) in our 4-term miRNA table, this suggests hsa-miR-144 may be neurodegenerative diseases related miRNA. Conclusions: This work identifies highly probable co-regulating miRNAs, which are refined from the prediction by computational tools using (1) signal-to-noise ratio to get high accurate regulating miRNAs for every gene, and (2) Gene Ontology to obtain functional related co-regulating miRNA groups. Our result has partly been supported by biological experiments. Based on prediction by TargetScanS, we found highly probable target gene groups in the Supplementary Information. This result might help biologists to find small set of miRNAs for genes of interest rather than huge amount of miRNA set. Supplementary Information:.

scholarly journals On the special spherical triangles for physical and cosmological applications

2021 ◽  
pp. 112-114
Author(s):  
Kalimuthu S
Keyword(s):  
Spherical Triangle ◽  
Spherical Triangles ◽  
The Way

It is well known that a spherical triangle of 270 degree triangle is constructible on the surface of a sphere; a globe is a good example. Take a point (A) on the equator, draw a line 1/4 the way around (90 degrees of longitude) on the equator to a new point (B).

scholarly journals Dihedral f-tilings of the sphere by rhombi and triangles

2005 ◽  
Vol Vol. 7 ◽  
Author(s):  
Ana Breda ◽  
Altino F. Santos
Keyword(s):  
Spherical Triangle ◽  
International Audience ◽  
Spherical Triangles

International audience We classify, up to an isomorphism, the class of all dihedral f-tilings of S^2, whose prototiles are a spherical triangle and a spherical rhombus. The equiangular case was considered and classified in Ana M. Breda and Altino F. Santos, Dihedral f-tilings of the sphere by spherical triangles and equiangular well-centered quadrangles. Here we complete the classification considering the case of non-equiangular rhombi.

New Formulae for Combined Spherical Triangles

2018 ◽  
Vol 72 (2) ◽  
pp. 503-512
Author(s):  
Tsung-Hsuan Hsieh ◽  
Shengzheng Wang ◽  
Wei Liu ◽  
Jiansen Zhao
Keyword(s):  
Research Field ◽  
Great Circle ◽  
Spherical Triangle ◽  
Spherical Trigonometry ◽  
Calculation Process ◽  
Different Types ◽  
Celestial Bodies ◽  
Spherical Triangles

Spherical trigonometry formulae are widely adopted to solve various navigation problems. However, these formulae only express the relationships between the sides and angles of a single spherical triangle. In fact, many problems may involve different types of spherical shapes. If we can develop the different formulae for specific spherical shapes, it will help us solve these problems directly. Thus, we propose two types of formulae for combined spherical triangles. The first set are the formulae of the divided spherical triangle, and the second set are the formulae of the spherical quadrilateral. By applying the formulae of the divided spherical triangle, waypoints on a great circle track can be obtained directly without finding the initial great circle course angle in advance. By applying the formulae of the spherical quadrilateral, the astronomical vessel position can be yielded directly from two celestial bodies, and the calculation process concept is easier to comprehend. The formulae we propose can not only be directly used to solve corresponding problems, but also expand the spherical trigonometry research field.

scholarly journals Optimal Testing and Design of Adders

VLSI Design ◽  
1994 ◽  
Vol 1 (4) ◽  
pp. 285-298 ◽  
Author(s):  
Michael J. Batek ◽  
John P. Hayes
Keyword(s):  
Performance Optimization ◽  
Minimum Size ◽  
Optimal Test ◽  
Test Set ◽  
Tree Structures ◽  
Ripple Carry Adder ◽  
Conflicting Objectives ◽  
Minimum Number ◽  
Test Sets ◽  
And Performance

On-the-fly calculations of area and performance are a typical part of the computer-aided iterative design process in VLSI, which aims at a satisfactory tradeoff of various conflicting objectives, among which are test-generation time and test-set size. However, determining test sets on-the-fly as one circuit is transformed into another is extremely difficult. Our goal is to add a test dimension to the design optimization process that complements methods concerned with area and performance optimization. We define a set of logic transformations that result in easily computed changes to test sets. Test-set preserving (TSP) transformations preserve a combinational circuit’s test sets, while test-set altering (TSA) transformations introduce a minimum number of tests needed to maintain completeness. We illustrate our approach with a family of adders that share area-efficient tree structures and differ in the amount of carry-lookahead used to accelerate carry computation. Members include the ripple-carry adder, which has no lookahead, and the standard carry-lookahead adder, which exploits lookahead across all inputs. It is straightforward to derive area and performance measures for this class of adders. Given an n-bit adder with lookahead degree k, we determine a sequence of circuit transformations that produce the adder of degree k2 and test sets of minimum size. Optimal test sets of size k(logkn + 1) + 2 result for arbitrary n and k, which improve significantly upon previously reported tests.

scholarly journals Covering Partial Cubes with Zones

10.37236/5076 ◽  
2015 ◽  
Vol 22 (3) ◽  
Author(s):  
Jean Cardinal ◽  
Stefan Felsner
Keyword(s):  
Isometric Embedding ◽  
Linear Extension ◽  
Upper And Lower Bounds ◽  
Minimum Size ◽  
Worst Case ◽  
Line Arrangement ◽  
Minimal Dimension ◽  
Special Cases ◽  
Minimum Number ◽  
Partial Cube

A partial cube is a graph having an isometric embedding in a hypercube. Partial cubes are characterized by a natural equivalence relation on the edges, whose classes are called zones. The number of zones determines the minimal dimension of a hypercube in which the graph can be embedded. We consider the problem of covering the vertices of a partial cube with the minimum number of zones. The problem admits several special cases, among which are the following:cover the cells of a line arrangement with a minimum number of lines,select a smallest subset of edges in a graph such that for every acyclic orientation, there exists a selected edge that can be flipped without creating a cycle,find a smallest set of incomparable pairs of elements in a poset such that in every linear extension, at least one such pair is consecutive,find a minimum-size fibre in a bipartite poset.We give upper and lower bounds on the worst-case minimum size of a covering by zones in several of those cases. We also consider the computational complexity of those problems, and establish some hardness results.

scholarly journals Fractional Strong Matching Preclusion of Split-Star Networks

2019 ◽  
Vol 11 (4) ◽  
pp. 32
Author(s):  
Ping Han ◽  
Yuzhi Xiao ◽  
Chengfu Ye ◽  
He Li
Keyword(s):  
Perfect Matching ◽  
Minimum Size ◽  
Star Networks ◽  
Minimum Number

The matching preclusion number of graph G is the minimum size of edges whose deletion leaves the resulting graph without a perfect matching or an almost perfect matching. Let F be an edge subset and F′ be a subset of edges and vertices of a graph G. If G − F and G − F′ have no fractional matching preclusion, then F is a fractional matching preclusion (FMP) set, and F ′is a fractional strong matching preclusion (FSMP) set of G. The FMP (FSMP) number of G is the minimum number of FMP (FSMP) set of G. In this paper, we study fractional matching preclusion number and fractional strong matching preclusion number of split-star networks. Moreover, We categorize all the optimal fractional strong matching preclusion sets of split-star networks.

Sign in / Sign up

Export Citation Format

Share Document