Overdetermined Strata in General Families of Polynomials

2000 Mathematics Subject Classification: 12D10.

On Root Arrangements of Polynomial-Like Functions and their Derivatives

2000 Mathematics Subject Classification: 12D10.

On Affine Connections in a Riemannian Manifold with a Circulant Metric and two Circulant Affinor Structures

Ива Р. Докузова, Димитър Р. Разпопов - В настоящата статия е разгледан клас V оттримерни риманови многообразия M с метрика g и два афинорни тензора q и S. Дефинирана е и друга метрика ¯g в M. Локалните координати на всички тези тензори са циркулантни матрици. Намерени са: 1) зависимост между тензора на кривина R породен от g и тензора на кривина ¯R породен от ¯g; 2) тъждество за тензора на кривина R в случая, когато тензорът на кривина ¯R се анулира; 3) зависимост между секционната кривина на прозволна двумерна q-площадка {x, qx} и скаларната кривина на M.

Densities with Spherical Level Sets in the Gauss-exponential Domain

2000 Mathematics Subject Classification: 60F05, 60B10.

Generation of drifting optical pulses

The radiation in the form of Airy and Gaussian optical pulses is investigated. It is shown that the pulse envelope moves decelerating in the time-spatial coordinates on the surface of a parabolic cylinder for the Airy pulse and a hyperbolic cylinder for the Gaussian. © 2013 IEEE.

Resolvent and Scattering Matrix at the Maximum of the Potential

2000 Mathematics Subject Classification: 35P25, 81U20, 35S30, 47A10, 35B38.

Warped Product Semi-Slant Submanifolds of a Sasakian Manifold

2000 Mathematics Subject Classification: 53C40, 53C25.

Special compositions in affinely connected spaces without a torsion

2000 Mathematics Subject Classification: 53B05, 53B99.

A Harrod modell strukturális stabilitása (Structural stability of the Harrod model)

In this study it is shown that the nontrivial hyperbolic fixed point of a nonlinear dynamical system, which is formulated by means of the adaptive expectations, corresponds to the unstable equilibrium of Harrod. We prove that this nonlinear dynamical (in the sense of Harrod) model is structurally stable under suitable economic conditions. In the case of structural stability, small changes of the functions (C1-perturbations of the vector field) describing the expected and the true time variation of the capital coefficients do not influence the qualitative properties of the endogenous variables, that is, although the trajectories may slightly change, their structure is the same as that of the unperturbed one, and therefore these models are suitable for long-time predictions. In this situation the critique of Lucas or Engel is not valid. There is no topological conjugacy between the perturbed and unperturbed models; the change of the growth rate between two levels may require different times for the perturbed and unperturbed models.

Periphyton light transmission relationships in Florida Bay and the Florida Keys, USA

Light transmission was measured through intact, submerged periphyton communities on artificial seagrass leaves. The periphyton communities were representative of the communities on Thalassia testudinum in subtropical seagrass meadows. The periphyton communities sampled were adhered carbonate sediment, coralline algae, and mixed algal assemblages. Crustose or film-forming periphyton assemblages were best prepared for light transmission measurements using artificial leaves fouled on both sides, while measurements through three-dimensional filamentous algae required the periphyton to be removed from one side. For one-sided samples, light transmission could be measured as the difference between fouled and reference artificial leaf samples. For two-sided samples, the percent periphyton light transmission to the leaf surface was calculated as the square root of the fraction of incident light. Linear, exponential, and hyperbolic equations were evaluated as descriptors of the periphyton dry weight versus light transmission relationship. Hyperbolic and exponential decay models were superior to linear models and exhibited the best fits for the observed relationships. Differences between the coefficients of determination (r2) of hyperbolic and exponential decay models were statistically insignificant. Constraining these models for 100% light transmission at zero periphyton load did not result in any statistically significant loss in the explanatory capability of the models. In most all cases, increasing model complexity using three-parameter models rather than two-parameter models did not significantly increase the amount of variation explained. Constrained two-parameter hyperbolic or exponential decay models were judged best for describing the periphyton dry weight versus light transmission relationship. On T. testudinum in Florida Bay and the Florida Keys, significant differences were not observed in the light transmission characteristics of the varying periphyton communities at different study sites. Using pooled data from the study sites, the hyperbolic decay coefficient for periphyton light transmission was estimated to be 4.36 mg dry wt. cm−2. For exponential models, the exponential decay coefficient was estimated to be 0.16 cm2 mg dry wt.−1.

Tamed and Compatible Symplectic Forms on Four-Dimensional Almost Complex Lie Algebras

We are able to give a complete description of four-dimensional Lie algebras g which satisfy the tame-compatible question of Donaldson for all almost complex structures J on g are completely described. As a consequence, examples are given of (non-unimodular) four-dimensional Lie algebras with almost complex structures which are tamed but not compatible with symplectic forms.? Note that Donaldson asked his question for compact four-manifolds. In that context, the problem is still open, but it is believed that any tamed almost complex structure is in fact compatible with a symplectic form. In this presentation, I will define the basic objects involved and will give some insights on the proof. The key for the proof is translating the problem into a Linear Algebra setting. This is a joint work with Dr. Draghici.

Schéma implicite pour la résolution d'un système hyperbolique d'équations aux dérivées partielles

Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.

Parallel Problem Solving from Nature – PPSN XIV:14th International Conference, Edinburgh, UK, September 17-21, 2016, Proceedings

This book constitutes the refereed proceedings of the 14th International Conference on Parallel Problem Solving from Nature, PPSN 2016, held in Edinburgh, UK, in September 2016. The total of 93 revised full papers were carefully reviewed and selected from 224 submissions. The meeting began with four workshops which offered an ideal opportunity to explore specific topics in intelligent transportation Workshop, landscape-aware heuristic search, natural computing in scheduling and timetabling, and advances in multi-modal optimization. PPSN XIV also included sixteen free tutorials to give us all the opportunity to learn about new aspects: gray box optimization in theory; theory of evolutionary computation; graph-based and cartesian genetic programming; theory of parallel evolutionary algorithms; promoting diversity in evolutionary optimization: why and how; evolutionary multi-objective optimization; intelligent systems for smart cities; advances on multi-modal optimization; evolutionary computation in cryptography; evolutionary robotics - a practical guide to experiment with real hardware; evolutionary algorithms and hyper-heuristics; a bridge between optimization over manifolds and evolutionary computation; implementing evolutionary algorithms in the cloud; the attainment function approach to performance evaluation in EMO; runtime analysis of evolutionary algorithms: basic introduction; meta-model assisted (evolutionary) optimization. The papers are organized in topical sections on adaption, self-adaption and parameter tuning; differential evolution and swarm intelligence; dynamic, uncertain and constrained environments; genetic programming; multi-objective, many-objective and multi-level optimization; parallel algorithms and hardware issues; real-word applications and modeling; theory; diversity and landscape analysis.

Augmentations and Rulings of Legendrian Links

For any Legendrian knot in R^3 with the standard contact structure, we show that the existence of an augmentation to any field of the Chekanov-Eliashberg differential graded algebra over Z[t,t^{-1}] is equivalent to the existence of a normal ruling of the front diagram, generalizing results of Fuchs, Ishkhanov, and Sabloff. We also show that any even graded augmentation must send t to -1.

We extend the definition of a normal ruling from J^1(S^1) given by Lavrov and Rutherford to a normal ruling for Legendrian links in #^k(S^1\times S^2). We then show that for Legendrian links in J^1(S^1) and #^k(S^1\times S^2), the existence of an augmentation to any field of the Chekanov-Eliashberg differential graded algebra over Z[t,t^{-1}] is equivalent to the existence of a normal ruling of the front diagram. For Legendrian knots, we also show that any even graded augmentation must send t to -1. We use the correspondence to give nonvanishing results for the symplectic homology of certain Weinstein 4-manifolds.

Learning from Geometry

Subspaces and manifolds are two powerful models for high dimensional signals. Subspaces model linear correlation and are a good fit to signals generated by physical systems, such as frontal images of human faces and multiple sources impinging at an antenna array. Manifolds model sources that are not linearly correlated, but where signals are determined by a small number of parameters. Examples are images of human faces under different poses or expressions, and handwritten digits with varying styles. However, there will always be some degree of model mismatch between the subspace or manifold model and the true statistics of the source. This dissertation exploits subspace and manifold models as prior information in various signal processing and machine learning tasks.

A near-low-rank Gaussian mixture model measures proximity to a union of linear or affine subspaces. This simple model can effectively capture the signal distribution when each class is near a subspace. This dissertation studies how the pairwise geometry between these subspaces affects classification performance. When model mismatch is vanishingly small, the probability of misclassification is determined by the product of the sines of the principal angles between subspaces. When the model mismatch is more significant, the probability of misclassification is determined by the sum of the squares of the sines of the principal angles. Reliability of classification is derived in terms of the distribution of signal energy across principal vectors. Larger principal angles lead to smaller classification error, motivating a linear transform that optimizes principal angles. This linear transformation, termed TRAIT, also preserves some specific features in each class, being complementary to a recently developed Low Rank Transform (LRT). Moreover, when the model mismatch is more significant, TRAIT shows superior performance compared to LRT.

The manifold model enforces a constraint on the freedom of data variation. Learning features that are robust to data variation is very important, especially when the size of the training set is small. A learning machine with large numbers of parameters, e.g., deep neural network, can well describe a very complicated data distribution. However, it is also more likely to be sensitive to small perturbations of the data, and to suffer from suffer from degraded performance when generalizing to unseen (test) data.

From the perspective of complexity of function classes, such a learning machine has a huge capacity (complexity), which tends to overfit. The manifold model provides us with a way of regularizing the learning machine, so as to reduce the generalization error, therefore mitigate overfiting. Two different overfiting-preventing approaches are proposed, one from the perspective of data variation, the other from capacity/complexity control. In the first approach, the learning machine is encouraged to make decisions that vary smoothly for data points in local neighborhoods on the manifold. In the second approach, a graph adjacency matrix is derived for the manifold, and the learned features are encouraged to be aligned with the principal components of this adjacency matrix. Experimental results on benchmark datasets are demonstrated, showing an obvious advantage of the proposed approaches when the training set is small.

Stochastic optimization makes it possible to track a slowly varying subspace underlying streaming data. By approximating local neighborhoods using affine subspaces, a slowly varying manifold can be efficiently tracked as well, even with corrupted and noisy data. The more the local neighborhoods, the better the approximation, but the higher the computational complexity. A multiscale approximation scheme is proposed, where the local approximating subspaces are organized in a tree structure. Splitting and merging of the tree nodes then allows efficient control of the number of neighbourhoods. Deviation (of each datum) from the learned model is estimated, yielding a series of statistics for anomaly detection. This framework extends the classical {\em changepoint detection} technique, which only works for one dimensional signals. Simulations and experiments highlight the robustness and efficacy of the proposed approach in detecting an abrupt change in an otherwise slowly varying low-dimensional manifold.