Multilevel Training of Binary Morphological Operators

The design of binary morphological operators that are translation-invariant and locally defined by a finite neighborhood window corresponds to the problem of designing Boolean functions. As in any supervised classification problem, morphological operators designed from a training sample also suffer from overfitting. Large neighborhood tends to lead to performance degradation of the designed operator. This work proposes a multilevel design approach to deal with the issue of designing large neighborhood-based operators. The main idea is inspired by stacked generalization (a multilevel classifier design approach) and consists of, at each training level, combining the outcomes of the previous level operators. The final operator is a multilevel operator that ultimately depends on a larger neighborhood than of the individual operators that have been combined. Experimental results show that two-level operators obtained by combining operators designed on subwindows of a large window consistently outperform the single-level operators designed on the full window. They also show that iterating two-level operators is an effective multilevel approach to obtain better results.

Spaces of compact operators on C(2(m) circle plus [0, alpha]) spaces

We classify up to isomorphism the spaces of compact operators K(E, F), where E and F are Banach spaces of all continuous functions defined on the compact spaces 2(m) circle plus [0, alpha], the topological sum of Cantor cubes 2(m) and the intervals of ordinal numbers [0, alpha]. More precisely, we prove that if 2(m) and aleph(gamma) are not real-valued measurable cardinals and n >= aleph(0) is not sequential cardinal, then for every ordinals xi, eta, lambda and mu with xi >= omega(1), eta >= omega(1), lambda = mu < omega or lambda, mu is an element of [omega(gamma), omega(gamma+1)[, the following statements are equivalent: (a) K(C(2(m) circle plus [0, lambda]), C(2(n) circle plus [0, xi])) and K(C(2(m) circle plus [0, mu]), C(2(n) circle plus [0, eta]) are isomorphic. (b) Either C([0, xi]) is isomorphic to C([0, eta] or C([0, xi]) is isomorphic to C([0, alpha p]) and C([0, eta]) is isomorphic to C([0,alpha q]) for some regular cardinal alpha and finite ordinals p not equal q. Thus, it is relatively consistent with ZFC that this result furnishes a complete isomorphic classification of these spaces of compact operators. (C) 2010 Elsevier Inc. All rights reserved.

On Groups Whose Maximal Cyclic Subgroups Are Maximal

We consider the problem of classifying those groups whose maximal cyclic subgroups are maximal. We give a complete classification of those groups with this property and which are either soluble or residually finite.

Enhancing the distribution of Swedish tourism services on international markets : Possible export-ready criteria requisitioned by European tour operators

This paper identifies subjects which are relevant for Swedish suppliers of tourism services beforeapproaching foreign markets. Most suppliers are micro, small or medium sized companies anduse intermediaries, such as tour operators, for internationalization. The research considers theopinion of British and German tour operators, which require some criteria beforehand in orderto simplify both the initialization and the development of cooperation. Destination marketingorganizations (DMOs) are hereby the go-betweens since they not only represent small-scalesuppliers on international markets, but also initiate first encounters between suppliers and touroperators. Suppliers need to provide DMOs with accurate information in order to ensure thebest possible representation. After initializing collaboration, business relationships are sought todevelop in order to facilitate long-term cooperation. Proper preparation forms therefore the basefor strengthening the competitiveness of Swedish tourism prior approaching internationalmarkets. The enhancement of distributing Swedish tourism services on foreign markets appearedto be a profitable way to enable further growth, which is strongly limited on the domestic market.Increasing the export share therefore secures and further facilitates tourism’s valuablecontributions to the Swedish economy.

A user guide to simple monitoring and sustainable operation of PV-diesel hybrid systems : Handbook for system users and operators

This report contains a suggestion for a simple monitoring and evaluation guideline for PV-diesel hybrid systems. It offers system users a way to better understand if their system is operated in a way that will make it last for a long time. It also gives suggestions on how to act if there are signs of unfavourable use or failure. The application of the guide requires little technical equipment, but daily manual measurements. For the most part, it can be managed by pen and paper, by people with no earlier experience of power systems.The guide is structured and expressed in a way that targets PV-diesel hybrid system users with no, or limited, earlier experience of power engineering. It is less detailed in terms of motivations for certain choices and limitations, but rich in details concerning calculations, evaluation procedures and maintenance routines. A more scientific description of the guide can be found in a related journal article.

All maximal-pairs in step-leap representation of melodic sequence

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.

All maximal-pairs in step-leap representation of melodic sequence

This paper proposes an efficient pattern extraction algorithm that can be applied on melodic sequences that are represented as strings of abstract intervallic symbols; the melodic representation introduces special “binary don’t care” symbols for intervals that may belong to two partially overlapping intervallic categories. As a special case the well established “step–leap” representation is examined. In the step–leap representation, each melodic diatonic interval is classified as a step (±s), a leap (±l) or a unison (u). Binary don’t care symbols are used to represent the possible overlapping between the various abstract categories e.g. *=s, *=l and #=-s, #=-l. We propose an O(n+d(n-d)+z)-time algorithm for computing all maximal-pairs in a given sequence x=x[1..n], where x contains d occurrences of binary don’t cares and z is the number of reported maximal-pairs.

Non-monotone insurance contracts and their empirical consequences

The goal of this paper is to show the possibility of a non-monotone relation between coverage ans risk which has been considered in the literature of insurance models since the work of Rothschild and Stiglitz (1976). We present an insurance model where the insured agents have heterogeneity in risk aversion and in lenience (a prevention cost parameter). Risk aversion is described by a continuous parameter which is correlated with lenience and for the sake of simplicity, we assume perfect correlation. In the case of positive correlation, the more risk averse agent has higher cosr of prevention leading to a higher demand for coverage. Equivalently, the single crossing property (SCP) is valid and iplies a positive correlation between overage and risk in equilibrium. On the other hand, if the correlation between risk aversion and lenience is negative, not only may the SCP be broken, but also the monotonocity of contracts, i.e., the prediction that high (low) risk averse types choose full (partial) insurance. In both cases riskiness is monotonic in risk aversion, but in the last case there are some coverage levels associated with two different risks (low and high), which implies that the ex-ante (with respect to the risk aversion distribution) correlation between coverage and riskiness may have every sign (even though the ex-post correlation is always positive). Moreover, using another instrument (a proxy for riskiness), we give a testable implication to desentangle single crossing ans non single croosing under an ex-post zero correlation result: the monotonicity of coverage as a function os riskiness. Since by controlling for risk aversion (no asymmetric information), coverage is monotone function of riskiness, this also fives a test for asymmetric information. Finally, we relate this theoretical results to empirical tests in the recent literature, specially the Dionne, Gouruéroux and Vanasse (2001) work. In particular, they found an empirical evidence that seems to be compatible with asymmetric information and non single crossing in our framework. More generally, we build a hidden information model showing how omitted variables (asymmetric information) can bias the sign of the correlation of equilibrium variables conditioning on all observable variables. We show that this may be the case when the omitted variables have a non-monotonic relation with the observable ones. Moreover, because this non-dimensional does not capture this deature. Hence, our main results is to point out the importance of the SPC in testing predictions of the hidden information models.