We introduce and characterize a new class of bargaining solutions: those which can be obtained by sequentially applying two binary relations to eliminate alternatives. As a by-product we obtain as a particular case a partial characterization result by Zhou (Econometrica, 1997) of an extension of the Nash axioms and solution to domains including non-convex problems, as well as a complete charact...

In this paper, we present a novel two-stage metric learning algorithm. We first map each learning instance to a probability distribution by computing its similarities to a set of fixed anchor points. Then, we define the distance in the input data space as the Fisher information distance on the associated statistical manifold. This induces in the input data space a new family of distance metric ...

We study two-stage choice procedures in which the decision maker first preselects the alternatives whose values according to a criterion pass a menu-dependent threshold and then maximizes a second criterion to narrow the selection further. This framework overlaps with several existing models that have various interpretations and impose various additional restrictions on behavior. We show that t...

In seismic data processing, deconvolution plays a very important role because it permits to increase the temporal resolution of seismic sections and to equalize sources. The deconvolution problem when the wavelet is known is an ill-posed problem that can be tackled via regularization methods. However, the seismic source wavelet is unknown and therefore, it must be estimated from the data prior ...

This paper presents the application of Two-Stage Programming (2sp) for developing error-free paral-lel/distributed applications through automatic verii-cation of computed results with respect to a given speciication. The presentation focuses the case study of the parallel block-striped partitioning variant of Prim's algorithm for nding a minimum spanning tree of a dense graph. We show that the ...

We propose a two-stage stochastic programming framework for designing or identifying “resilient”, or “repairable” structures in graphs whose topology may undergo a stochastic transformation. The repairability of a subgraph satisfying a given property is defined in terms of a budget constraint, which allows for a prescribed number of vertices to be added to or removed from the subgraph so as to ...

A new approach to derive the principal components of symbolic data is proposed in this article. This is done in two stages: first getting eigenblocks and eigenmatrices of the variancecovariance matrix, and then analyzing these eigenblocks and the corresponding principal vectors together in some seemly sense to get the adjusted eigenvalues and the corresponding eigenvectors of the interval data....

Secondary structure prediction is a crucial task for understanding the variety of protein structures and performed biological functions. Prediction of secondary structures for new proteins using their amino acid sequences is of fundamental importance in bioinformatics. We propose a novel technique to predict protein secondary structures based on position-specific scoring matrices (PSSMs) and ph...

Interference lithography for the fabrication of photonic crystals is considered. A two-stage design method for realization of photonic bandgap structures with desired symmetries is developed. An optimal photonic crystal with a large bandgap is searched by adjusting some parameters while keeping some basic symmetry of the unit cell unchanged. A nonlinear programming method is then used to find t...