Search results for "Cardinali"
showing 10 items of 48 documents
A common extension of Arhangel'skii's Theorem and the Hajnal-Juhasz inequality
2019
AbstractWe present a result about $G_{\unicode[STIX]{x1D6FF}}$ covers of a Hausdorff space that implies various known cardinal inequalities, including the following two fundamental results in the theory of cardinal invariants in topology: $|X|\leqslant 2^{L(X)\unicode[STIX]{x1D712}(X)}$ (Arhangel’skiĭ) and $|X|\leqslant 2^{c(X)\unicode[STIX]{x1D712}(X)}$ (Hajnal–Juhász). This solves a question that goes back to Bell, Ginsburg and Woods’s 1978 paper (M. Bell, J.N. Ginsburg and R.G. Woods, Cardinal inequalities for topological spaces involving the weak Lindelöf number, Pacific J. Math. 79(1978), 37–45) and is mentioned in Hodel’s survey on Arhangel’skiĭ’s Theorem (R. Hodel, Arhangel’skii’s so…
Constructing Good Solutions for the Spanish School Timetabling Problem
1996
In the school timetabling problem a set of lessons (combinations of classes, teachers, subjects and rooms) has to be scheduled within the school week. Considering classes, teachers and rooms as resources for the lessons, the problem may be viewed as the scheduling of a project subject to resource constraints. We have developed an algorithm with three phases. In Phase I an initial solution is built by using the scheme of parallel heuristic algorithm with priority rules, but imbedding at each period the construction of a maximum cardinality independent set on a resource graph. In Phase II a tabu search procedure starts from the solution of Phase I and obtains a feasible solution to the proble…
On the Computation of the Efficient Frontier of the Portfolio Selection Problem
2012
An easy-to-use procedure is presented for improving theε-constraint method for computing the efficient frontier of the portfolio selection problem endowed with additional cardinality and semicontinuous variable constraints. The proposed method provides not only a numerical plotting of the frontier but also an analytical description of it, including the explicit equations of the arcs of parabola it comprises and the change points between them. This information is useful for performing a sensitivity analysis as well as for providing additional criteria to the investor in order to select an efficient portfolio. Computational results are provided to test the efficiency of the algorithm and to i…
A multi-objective genetic algorithm for cardinality constrained fuzzy portfolio selection
2012
This paper presents a new procedure that extends genetic algorithms from their traditional domain of optimization to fuzzy ranking strategy for selecting efficient portfolios of restricted cardinality. The uncertainty of the returns on a given portfolio is modeled using fuzzy quantities and a downside risk function is used to describe the investor's aversion to risk. The fitness functions are based both on the value and the ambiguity of the trapezoidal fuzzy number which represents the uncertainty on the return. The soft-computing approach allows us to consider uncertainty and vagueness in databases and also to incorporate subjective characteristics into the portfolio selection problem. We …
Fuzzy portfolio selection based on the analysis of efficient frontiers
2011
We present an algorithm for analyzing the geometry of the efficient frontier of the portfolio selection problem with semicontinuous variable and cardinality constraints, and use it as a basis to solve a fuzzy version of the problem, designed to obtain efficient portfolios, in the Markowitz's sense, for which the trade-off between expected return and assumed risk fits better the investor's subjective criteria. We illustrate our proposal with an example solved with LINGO and Mathematica.
P-spaces and the Whyburn property
2009
We investigate the Whyburn and weakly Whyburn property in the class of $P$-spaces, that is spaces where every countable intersection of open sets is open. We construct examples of non-weakly Whyburn $P$-spaces of size continuum, thus giving a negative answer under CH to a question of Pelant, Tkachenko, Tkachuk and Wilson. In addition, we show that the weak Kurepa Hypothesis (a set-theoretic assumption weaker than CH) implies the existence of a non-weakly Whyburn $P$-space of size $\aleph_2$. Finally, we consider the behavior of the above-mentioned properties under products; we show in particular that the product of a Lindel\"of weakly Whyburn P-space and a Lindel\"of Whyburn $P$-space is we…
A Nonlinear Label Compression and Transformation Method for Multi-label Classification Using Autoencoders
2016
Multi-label classification targets the prediction of multiple interdependent and non-exclusive binary target variables. Transformation-based algorithms transform the data set such that regular single-label algorithms can be applied to the problem. A special type of transformation-based classifiers are label compression methods, which compress the labels and then mostly use single label classifiers to predict the compressed labels. So far, there are no compression-based algorithms that follow a problem transformation approach and address non-linear dependencies in the labels. In this paper, we propose a new algorithm, called Maniac (Multi-lAbel classificatioN usIng AutoenCoders), which extra…
A Novel Bayesian Network Based Scheme for Finding the Optimal Solution to Stochastic Online Equi-partitioning Problems
2014
A number of intriguing decision scenarios, such as order picking, revolve around partitioning a collection of objects so as to optimize some application specific objective function. In its general form, this problem is referred to as the Object Partitioning Problem (OOP), known to be NP-hard. We here consider a variant of OPP, namely the Stochastic Online Equi-Partitioning Problem (SO-EPP). In SO-EPP, objects arrive sequentially, in pairs. The relationship between the arriving object pairs is stochastic: They belong to the same partition with probability p. From a history of object arrivals, the goal is to predict which objects will appear together in future arrivals. As an additional compl…
Minimal Absent Words in Rooted and Unrooted Trees
2019
We extend the theory of minimal absent words to (rooted and unrooted) trees, having edges labeled by letters from an alphabet \(\varSigma \) of cardinality \(\sigma \). We show that the set \(\text {MAW}(T)\) of minimal absent words of a rooted (resp. unrooted) tree T with n nodes has cardinality \(O(n\sigma )\) (resp. \(O(n^{2}\sigma )\)), and we show that these bounds are realized. Then, we exhibit algorithms to compute all minimal absent words in a rooted (resp. unrooted) tree in output-sensitive time \(O(n+|\text {MAW}(T)|)\) (resp. \(O(n^{2}+|\text {MAW}(T)|)\) assuming an integer alphabet of size polynomial in n.
Rolewicz-type chaotic operators
2015
In this article we introduce a new class of Rolewicz-type operators in l_p, $1 \le p < \infty$. We exhibit a collection F of cardinality continuum of operators of this type which are chaotic and remain so under almost all finite linear combinations, provided that the linear combination has sufficiently large norm. As a corollary to our main result we also obtain that there exists a countable collection of such operators whose all finite linear combinations are chaotic provided that they have sufficiently large norm.