scholarly journals The Generalized Gielis Geometric Equation and Its Application

Symmetry ◽  
2020 ◽  
Vol 12 (4) ◽  
pp. 645 ◽  
Author(s):  
Peijian Shi ◽  
David A. Ratkowsky ◽  
Johan Gielis
Keyword(s):  
Power Law ◽  
Morphological Features ◽  
Original Version ◽  
Link Function ◽  
Plant Leaves ◽  
Special Cases ◽  
Geometric Equation ◽  
Special Case

Many natural shapes exhibit surprising symmetry and can be described by the Gielis equation, which has several classical geometric equations (for example, the circle, ellipse and superellipse) as special cases. However, the original Gielis equation cannot reflect some diverse shapes due to limitations of its power-law hypothesis. In the present study, we propose a generalized version by introducing a link function. Thus, the original Gielis equation can be deemed to be a special case of the generalized Gielis equation (GGE) with a power-law link function. The link function can be based on the morphological features of different objects so that the GGE is more flexible in fitting the data of the shape than its original version. The GGE is shown to be valid in depicting the shapes of some starfish and plant leaves.

MASS FUNCTION OF HALOS: A NEW ANALYTICAL APPROACH

2004 ◽  
Vol 13 (07) ◽  
pp. 1345-1349 ◽  
Author(s):  
JOSÉ A. S. LIMA ◽  
LUCIO MARASSI
Keyword(s):  
Power Law ◽  
Free Parameter ◽  
Analytical Approach ◽  
Mass Function ◽  
New Method ◽  
Power Law Distribution ◽  
The Press ◽  
The Universe ◽  
Special Case

A generalization of the Press–Schechter (PS) formalism yielding the mass function of bound structures in the Universe is given. The extended formula is based on a power law distribution which encompasses the Gaussian PS formula as a special case. The new method keeps the original analytical simplicity of the PS approach and also solves naturally its main difficult (the missing factor 2) for a given value of the free parameter.

Dynamics of Developing Laminar Non-Newtonian Falling Liquid Films With Free Surface

1978 ◽  
Vol 45 (1) ◽  
pp. 19-24 ◽  
Author(s):  
V. Narayanamurthy ◽  
P. K. Sarma
Keyword(s):  
Liquid Film ◽  
Power Law ◽  
Mathematical Formulation ◽  
Liquid Films ◽  
Interfacial Shear ◽  
Newtonian Liquid ◽  
Power Law Model ◽  
Falling Liquid Film ◽  
Falling Liquid Films ◽  
Special Case

The dynamics of accelerating, laminar non-Newtonian falling liquid film is analytically solved taking into account the interfacial shear offered by the quiescent gas adjacent to the liquid film under adiabatic conditions of both the phases. The results indicate that the thickness of the liquid film for the assumed power law model of the shear deformation versus the shear stress is influenced by the index n, the modified form of (Fr/Re). The mathematical formulation of the present analysis enables to treat the problem as a general type from which the special case for Newtonian liquid films can be derived by equating the index in the power law to unity.

Analytical Techniques for the Optimisation of Rocket Trajectories

1963 ◽  
Vol 14 (2) ◽  
pp. 105-124 ◽  
Author(s):  
Derek F. Lawden
Keyword(s):  
Gravitational Field ◽  
Artificial Satellite ◽  
Analytical Techniques ◽  
Present Position ◽  
Mayer Problem ◽  
Special Cases ◽  
Minimum Expenditure ◽  
Law Of Attraction ◽  
Special Case

SummaryThe development during the last two decades of analytical techniques for the solution of problems relating to the optimisation of rocket trajectories is outlined and the present position in this field of research is summarised. It is shown that the determination of optimal trajectories in a general gravitational field can be expressed as a Mayer problem from the calculus of variations. The known solution to such a problem is stated and applied, first to the special case of the launching of an artificial satellite into a circular orbit with minimum expenditure of propellant and, secondly, to the general astronautical problem of the economical transfer of a rocket between two terminals in a gravitational field. The special cases when the field is uniform and when it obeys an inverse square law of attraction to a point are then considered, and the paper concludes with some remarks concerning areas in which further investigations are necessary.

scholarly journals Water entry of an expanding wedge/plate with flow detachment

2016 ◽  
Vol 797 ◽  
pp. 322-344 ◽  
Author(s):  
Yuriy A. Semenov ◽  
Guo Xiong Wu
Keyword(s):  
Free Surface ◽  
General Solution ◽  
Water Entry ◽  
Hodograph Method ◽  
Fixed Length ◽  
Pressure Distributions ◽  
Initial Stage ◽  
Special Cases ◽  
Wedge Plate ◽  
Special Case

A general similarity solution for water-entry problems of a wedge with its inner angle fixed and its sides in expansion is obtained with flow detachment, in which the speed of expansion is a free parameter. The known solutions for a wedge of a fixed length at the initial stage of water entry without flow detachment and at the final stage corresponding to Helmholtz flow are obtained as two special cases, at some finite and zero expansion speeds, respectively. An expanding horizontal plate impacting a flat free surface is considered as the special case of the general solution for a wedge inner angle equal to ${\rm\pi}$. An initial impulse solution for a plate of a fixed length is obtained as the special case of the present formulation. The general solution is obtained in the form of integral equations using the integral hodograph method. The results are presented in terms of free-surface shapes, streamlines and pressure distributions.

scholarly journals The Steady Profile of an Axisymmetric Ice Sheet

1981 ◽  
Vol 27 (95) ◽  
pp. 25-37 ◽  
Author(s):  
I. R. Johnson
Keyword(s):  
Aspect Ratio ◽  
Power Law ◽  
Viscous Incompressible Fluid ◽  
Ice Sheet ◽  
Plane Flow ◽  
The Third ◽  
Basal Sliding ◽  
Steady Plane ◽  
Third Dimension ◽  
Special Case

AbstractSteady plane flow under gravity of an axisymmetric ice sheet resting on a horizontal rigid bed, subject to surface accumulation and ablation, basal drainage, and basal sliding is treated according to a power law between shear traction and velocity. The surface accumulation is taken to depend on height, and the drainage and sliding coefficient also depend on the height of overlying ice. The ice is described as a general non-linearly viscous incompressible fluid, and temperature variation through the ice sheet is neglected. Illustrations are presented for Glen’s power law (including the special case of a Newtonian fluid), and the polynomial law of Colbeck and Evans. The analysis follows that of Morland and Johnson (1980) where the analogous problem for an ice sheet deforming under plane flow was considered. Comparisons are made between the two models and it is found that the effect of the third dimension is to reduce (or leave unchanged) the aspect ratio for the cases considered, although no general formula can be obtained. This reduction is seen to depend on both the surface accumulation and the sliding law.

scholarly journals On Reay's Relaxed Tverberg Conjecture and Generalizations of Conway's Thrackle Conjecture

10.37236/6516 ◽  
2018 ◽  
Vol 25 (3) ◽  
Author(s):  
Megumi Asada ◽  
Ryan Chen ◽  
Florian Frick ◽  
Frederick Huang ◽  
Maxwell Polevy ◽  
...  
Keyword(s):  
Geometric Property ◽  
Convex Sets ◽  
Convex Hulls ◽  
Open Problems ◽  
Higher Dimensional ◽  
Special Cases ◽  
Minimum Number ◽  
Point Set ◽  
Colored Version ◽  
Special Case

Reay's relaxed Tverberg conjecture and Conway's thrackle conjecture are open problems about the geometry of pairwise intersections. Reay asked for the minimum number of points in Euclidean $d$-space that guarantees any such point set admits a partition into $r$ parts, any $k$ of whose convex hulls intersect. Here we give new and improved lower bounds for this number, which Reay conjectured to be independent of $k$. We prove a colored version of Reay's conjecture for $k$ sufficiently large, but nevertheless $k$ independent of dimension $d$. Pairwise intersecting convex hulls have severely restricted combinatorics. This is a higher-dimensional analogue of Conway's thrackle conjecture or its linear special case. We thus study convex-geometric and higher-dimensional analogues of the thrackle conjecture alongside Reay's problem and conjecture (and prove in two special cases) that the number of convex sets in the plane is bounded by the total number of vertices they involve whenever there exists a transversal set for their pairwise intersections. We thus isolate a geometric property that leads to bounds as in the thrackle conjecture. We also establish tight bounds for the number of facets of higher-dimensional analogues of linear thrackles and conjecture their continuous generalizations.

scholarly journals Almost additive entropy

2014 ◽  
Vol 11 (05) ◽  
pp. 1450040 ◽  
Author(s):  
Nikos Kalogeropoulos
Keyword(s):  
Phase Space ◽  
Shannon Entropy ◽  
Power Law ◽  
Physical Significance ◽  
Small Deviations ◽  
Phase Space Volume ◽  
Composition Property ◽  
Flat Manifolds ◽  
Special Case ◽  
Space Volume

We explore consequences of a hyperbolic metric induced by the composition property of the Harvda–Charvat/Daróczy/Cressie–Read/Tsallis entropy. We address the special case of systems described by small deviations of the non-extensive parameter q ≈ 1 from the "ordinary" additive case which is described by the Boltzmann/Gibbs/Shannon entropy. By applying the Gromov/Ruh theorem for almost flat manifolds, we show that such systems have a power-law rate of expansion of their configuration/phase space volume. We explore the possible physical significance of some geometric and topological results of this approach.

scholarly journals Minimizing Total Completion Time For Preemptive Scheduling With Release Dates And Deadline Constraints

2014 ◽  
Vol 39 (1) ◽  
pp. 17-26 ◽  
Author(s):  
Cheng He ◽  
Hao Lin ◽  
Yixun Lin ◽  
Junmei Dou
Keyword(s):  
Completion Time ◽  
Total Completion Time ◽  
Release Dates ◽  
Preemptive Scheduling ◽  
Release Date ◽  
Enumeration Algorithm ◽  
Processing Times ◽  
Special Cases ◽  
Deadline Constraints ◽  
Special Case

Abstract It is known that the single machine preemptive scheduling problem of minimizing total completion time with release date and deadline constraints is NP- hard. Du and Leung solved some special cases by the generalized Baker's algorithm and the generalized Smith's algorithm in O(n2) time. In this paper we give an O(n2) algorithm for the special case where the processing times and deadlines are agreeable. Moreover, for the case where the processing times and deadlines are disagreeable, we present two properties which could enable us to reduce the range of the enumeration algorithm

scholarly journals Every Local Minimum Value Is the Global Minimum Value of Induced Model in Nonconvex Machine Learning

2019 ◽  
Vol 31 (12) ◽  
pp. 2293-2323 ◽  
Author(s):  
Kenji Kawaguchi ◽  
Jiaoyang Huang ◽  
Leslie Pack Kaelbling
Keyword(s):  
Machine Learning ◽  
Neural Networks ◽  
Local Minimum ◽  
Deep Neural Networks ◽  
Representation Learning ◽  
Minimum Value ◽  
Special Cases ◽  
Optimal Value ◽  
Special Case ◽  
Theoretical Results

For nonconvex optimization in machine learning, this article proves that every local minimum achieves the globally optimal value of the perturbable gradient basis model at any differentiable point. As a result, nonconvex machine learning is theoretically as supported as convex machine learning with a handcrafted basis in terms of the loss at differentiable local minima, except in the case when a preference is given to the handcrafted basis over the perturbable gradient basis. The proofs of these results are derived under mild assumptions. Accordingly, the proven results are directly applicable to many machine learning models, including practical deep neural networks, without any modification of practical methods. Furthermore, as special cases of our general results, this article improves or complements several state-of-the-art theoretical results on deep neural networks, deep residual networks, and overparameterized deep neural networks with a unified proof technique and novel geometric insights. A special case of our results also contributes to the theoretical foundation of representation learning.

scholarly journals An Approximation Theorem for Vector Equilibrium Problems under Bounded Rationality

Mathematics ◽  
2020 ◽  
Vol 8 (1) ◽  
pp. 45
Author(s):  
Wensheng Jia ◽  
Xiaoling Qiu ◽  
Dingtao Peng
Keyword(s):  
Exact Solution ◽  
Bounded Rationality ◽  
Equilibrium Problems ◽  
Approximation Theorem ◽  
Optimization Problems ◽  
Vector Equilibrium Problems ◽  
Special Cases ◽  
Full Rationality ◽  
Vector Equilibrium ◽  
Special Case

In this paper, our purpose is to investigate the vector equilibrium problem of whether the approximate solution representing bounded rationality can converge to the exact solution representing complete rationality. An approximation theorem is proved for vector equilibrium problems under some general assumptions. It is also shown that the bounded rationality is an approximate way to achieve the full rationality. As a special case, we obtain some corollaries for scalar equilibrium problems. Moreover, we obtain a generic convergence theorem of the solutions of strictly-quasi-monotone vector equilibrium problems according to Baire’s theorems. As applications, we investigate vector variational inequality problems, vector optimization problems and Nash equilibrium problems of multi-objective games as special cases.

Sign in / Sign up

Export Citation Format

Share Document