نتایج جستجو برای: latin majorization
تعداد نتایج: 30560 فیلتر نتایج به سال:
English. We present a study on the degree of homonymy between the lexicon of a morphological analyser for Latin and an Onomasticon. To understand the impact of homonymy, we discuss an experiment on four Latin texts of different era and genre. Italiano. L’articolo presenta uno studio sul grado di omonimia tra il lessico di un analizzatore morfologico per il latino e un Onomasticon. Al fine di co...
A latin rectangle is an m × n array, m ≤ n, from the numbers 1, 2, . . . , n such that each of these numbers occur in each row and in each column at most once. A critical set in an m×n array is a set S of given entries, such that there exists a unique extension of S to a latin rectangle of size m×n. If we index the rows and columns of an m×n array, m ≤ n, by the sets M = {1, 2, . . . ,m} and N ...
This document evaluates the nature of aging in Latin America and the Caribbean, and reviews available evidence regarding the demographic profile of the elderly, their health and disability status, the composition of their human capital, labor force participation and retirement behavior, residential arrangements, and intergenerational transfer systems. The review identifies problematic areas to ...
We introduce the concept of weak k-majorization extending the classical notion of weak sub-majorization. For integers k and n with k n a vector x 2 R is weakly k-majorized by a vector q 2 R if the sum of the r largest components of x does not exceed the sum of the r largest components of q, for r = 1; : : : ; k. For a given q the set of vectors weakly k-majorized by q de nes a polyhedron P (q;k...
Consider a category of product variants distinguished by some attribute such as color or flavor. A retailer must construct an assortment for the category, i.e., select a subset variants to stock and determine purchase quantities for each offered variant. We analyze this problem using a multinomial logit model to describe the consumer choice process and a newsboy model to represent the retailer’...
The main result of this paper is the extension of the Schur-Horn Theorem to infinite sequences: For two nonincreasing nonsummable sequences ξ and η that converge to 0, there exists a positive compact operator A with eigenvalue list η and diagonal sequence ξ if and only if Pn j=1 ξj ≤ Pn j=1 ηj for every n if and only if ξ = Qη for some orthostochastic matrix Q. When ξ and η are summable, requir...
Extracting structured subgraphs inside large graphs – often known as the planted subgraph problem – is a fundamental question that arises in a range of application domains. This problem is NP-hard in general, and as a result, significant efforts have been directed towards the development of tractable procedures that succeed on specific families of problem instances. We propose a new computation...
We propose a new majorization-minimization (MM) method for non-smooth and non-convex programs, which is general enough to include the existing MM methods. Besides the local majorization condition, we only require that the difference between the directional derivatives of the objective function and its surrogate function vanishes when the number of iterations approaches infinity, which is a very...
Abstract. The main result of this paper is the extension of the Schur-Horn Theorem to infinite sequences: For two nonincreasing nonsummable sequences ξ and η that converge to 0, there exists a compact operator A with eigenvalue list η and diagonal sequence ξ if and only if Pn j=1 ξj ≤ Pn j=1 ηj for every n if and only if ξ = Qη for some orthostochastic matrix Q. The similar result requiring equ...
Principal component lter banks (PCFB's) sequentially compress most of the input signal energy into the rst few subbands, and are mathematically de ned using the notion of majorization. In a series of recent works, we have exploited connections between majorization and convexity theory to provide a uni ed explanation of PCFB optimality for numerous signal processing problems, involving compressi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید