Finite-dimensional global attractors in Banach spaces

We provide bounds on the upper box-counting dimension of negatively invariant subsets of Banach spaces, a problem that is easily reduced to covering the image of the unit ball under a linear map by a collection of balls of smaller radius. As an application of the abstract theory we show that the global attractors of a very broad class of parabolic partial differential equations (semilinear equations in Banach spaces) are finite-dimensional.     

Ostrowski type inequalities on H-type groups

The main aim of this paper is to establish an Ostrowski type inequality on H-type groups using the L^∞ norm of the horizontal gradient. The work has been motivated by the work of Anastassiou and Goldstein in [G.A. Anastassiou, J.A. Goldstein, Higher order Ostrowski type inequalities over Euclidean domains, J. Math. Anal. Appl. 337 (2008) 962-968].     

A minimum distance estimator in an imprecise probability model - Computational aspects and applications

The article considers estimating a parameter θ in an imprecise probability model which consists of coherent upper previsions . After the definition of a minimum distance estimator in this setup and a summarization of its main properties, the focus lies on applications. It is shown that approximate minimum distances on the discretized sample space can be calculated by linear programming. After a discussion of some computational aspects, the estimator is applied in a simulation study consisting of two different models. Finally, the estimator is applied on a real data set in a linear regression model.     

图的无符号拉普拉斯和距离无符号拉普拉斯特征值

Let G be a simple graph. We first show that ■, where δiand di denote the i-th signless Laplacian eigenvalue and the i-th degree of vertex in G, respectively.Suppose G is a simple and connected graph, then some inequalities on the distance signless Laplacian eigenvalues are obtained by deleting some vertices and some edges from G. In addition, for the distance signless Laplacian spectral radius ρQ(G), we determine the extremal graphs with the minimum ρQ(G) among the trees with given diameter, the unicyclic and bicyclic graphs with given girth, respectively.     

Locating a single facility and a high-speed line

In this paper we study a facility location problem in the plane in which a single point (facility) and a rapid transit line (highway) are simultaneously located in order to minimize the total travel time from the clients to the facility, using the _L1$L_1$ or Manhattan metric. The rapid transit line is given by a segment with any length and orientation, and is an alternative transportation line that can be used by the clients to reduce their travel time to the facility. We study the variant of the problem in which clients can enter and exit the highway at any point. We provide an O(n³)$O(n^3)$-time algorithm that solves this variant, where n is the number of clients. We also present a detailed characterization of the solutions, which depends on the speed given along the highway.     

Circle approximation using LN Bézier curves of even degree and its application

We present an approximation method of circular arcs using linear-normal (LN) Bézier curves of even degree, four and higher. Our method achieves G^m$G^m$ continuity for endpoint interpolation of a circular arc by a LN Bézier curve of degree 2m  , for m=2,3$m=2,3$. We also present the exact Hausdorff distance between the circular arc and the approximating LN Bézier curve. We show that the LN curve has an approximation order of 2m+2$2m+2$, for m=2,3$m=2,3$. Our approximation method can be applied to offset approximation, so obtaining a rational Bézier curve as an offset approximant. We derive an algorithm for offset approximation based on the LN circle approximation and illustrate our method with some numerical examples.     

Banach空间闭子集上微分方程解的整体存在唯一性定理

本文利用比较方法和Kuratowski非紧致测度研究Banach空间闭子集上微分方程解的整体存在唯一性,得出了一个一般性判别准则.作为特例,本文的结果包含了文[4]中的主要定理.     

Fuzzy σ-algebras and fuzzy measurable functions

In this paper we first give an axiomatic definition of a fuzzy σ-algebra which is a generalisation of the family of fuzzy events considered by L.A. Zadeh [13]. The relationship between classical and fuzzy σ-algebras and between topologies and σ-algebras, in both cases, classical and fuzzy, is established in the notation of commutative diagrams. For fuzzy topologies we refer to the work of R. Lowen [8]. After a comparison between classical measurability of functions and fuzzy measurability defined in this paper we finally introduce the product of fuzzy σ-algebras.     

The connectivity of a graph on uniform points on [0,1]

A random graph G_n(x) is constructed on independent random points U₁,…,U_n distributed uniformly on [0,1]^d, d1, in which two distinct such points are joined by an edge if the l_∞-distance between them is at most some prescribed value 0<x<1. The connectivity distance c_n, the smallest x for which G_n(x) is connected, is shown to satisfy

(1)

For d2, the random graph G_n(x) behaves like a d-dimensional version of the random graphs of Erdös and Rényi, despite the fact that its edges are not independent: c_n/d_n→1, a.s., as n→∞, where d_n is the largest nearest-neighbor link, the smallest x for which G_n(x) has no isolated vertices.     

Necessary Conditions for Differentiability of Distance Functions

Necessary conditions for the Gâteaux differentiability of the distance function to a set are considered. A series of characterizing results is obtained.