Search results for " set"
showing 10 items of 2095 documents
Economic Crises, Sovereign Debt Restructurings and the Shifting Landscape of International Investment Law
2016
International audience
Recensione a R. Darnton, L’età dell’informazione. Una guida non convenzionale al Settecento
2007
La recensione prende in considerazione gli otto saggi che forniscono al «comune lettore colto» una via d’accesso alla comprensione delle mentalità settecentesca. Un’insolita guida al Settecento, dunque, secolo complesso e multiforme per eccellenza, di cui Darnton intende svelare gli addentellati col mondo contemporaneo.
Highmann's Theorem on Discrete Sets
2006
In this paper we investigate properties of different classes of discrete sets with respect to the partial-order of subpicture. In particular we take in consideration the classes of convex polyominoes and L-convex polyominoes. In the first part of the paper we study closure properties of these classes with respect the order and we give a new characterization of L-convex polyominoes. In the second part we pose the question to extend Higman’s theoremto discrete sets. We give a negative answer in the general case and we prove that the set of L-convex polyominoes is well-partially-ordered by using a representation of L-convex polyominoes in terms of words of a regular language.
On arithmetic sums of Ahlfors-regular sets
2021
Let $A,B \subset \mathbb{R}$ be closed Ahlfors-regular sets with dimensions $\dim_{\mathrm{H}} A =: \alpha$ and $\dim_{\mathrm{H}} B =: \beta$. I prove that $$\dim_{\mathrm{H}} [A + \theta B] \geq \alpha + \beta \cdot \tfrac{1 - \alpha}{2 - \alpha}$$ for all $\theta \in \mathbb{R} \, \setminus \, E$, where $\dim_{\mathrm{H}} E = 0$.
Das ritual der unterwerfung Stefan Nemanjas unter Maunel I. Komnenos (1172)
2013
This article investigates the ceremonial of the subjection of the Serbian zupan Stefan Nemanja to the Byzantine emperor Manuel I Komnenos (1172) and compares it with similar events of the period in question. It argues for a strong influence of western forms of conflict resolution (?deditio?) in the ceremonial.
Openness and Discreteness
2013
The aim of this chapter is to study conditions under which a mapping of finite distortion is open (maps open sets to open sets) and discrete (preimage of each point is a discrete set).
Errors Generated by Uncertain Data
2014
In this chapter, we study effects caused by incompletely known data. In practice, the data are never known exactly, therefore the results generated by a mathematical model also have a limited accuracy. Then, the whole subject of error analysis should be treated in a different manner, and accuracy of numerical solutions should be considered within a framework of a more complicated scheme, which includes such notions as maximal and minimal distances to the solution set and its radius.
A novel heuristic memetic clustering algorithm
2013
In this paper we introduce a novel clustering algorithm based on the Memetic Algorithm meta-heuristic wherein clusters are iteratively evolved using a novel single operator employing a combination of heuristics. Several heuristics are described and employed for the three types of selections used in the operator. The algorithm was exhaustively tested on three benchmark problems and compared to a classical clustering algorithm (k-Medoids) using the same performance metrics. The results show that our clustering algorithm consistently provides better clustering solutions with less computational effort.
Gear classification and fault detection using a diffusion map framework
2015
This article proposes a system health monitoring approach that detects abnormal behavior of machines. Diffusion map is used to reduce the dimensionality of training data, which facilitates the classification of newly arriving measurements. The new measurements are handled with Nyström extension. The method is trained and tested with real gear monitoring data from several windmill parks. A machine health index is proposed, showing that data recordings can be classified as working or failing using dimensionality reduction and warning levels in the low dimensional space. The proposed approach can be used with any system that produces high-dimensional measurement data. peerReviewed
Twister Tries
2015
Many commonly used data-mining techniques utilized across research fields perform poorly when used for large data sets. Sequential agglomerative hierarchical non-overlapping clustering is one technique for which the algorithms’ scaling properties prohibit clustering of a large amount of items. Besides the unfavorable time complexity of O(n 2 ), these algorithms have a space complexity of O(n 2 ), which can be reduced to O(n) if the time complexity is allowed to rise to O(n 2 log2 n). In this paper, we propose the use of locality-sensitive hashing combined with a novel data structure called twister tries to provide an approximate clustering for average linkage. Our approach requires only lin…