What is the problem we wish to solve when we try to construct a rational economic order? On certain familiar assumptions the answer is simple enough. If we possess all the relevant information, if we can start out from a given system of preferences and if we command complete knowledge of available means, the problem which remains is purely one of logic. That is, the answer to the question of wh...

A shortage function is defined that looks for possible increases in return and skewness and decreases in variance. Global optimality is guaranteed for the resulting optimal portfolios. We also establish a link to a proper indirect mean-variance-skewness utility function. For computational reasons, the optimal portfolios resulting from this dual approach are only locally optimal. This framework ...

This paper presents a simple 7/2-approximation algorithm for the max duo-preservation string mapping (MPSM) problem. This problem is complementary to the classical and well studied min common string partition problem (MCSP), that computes the minimal edit distance between two strings when the only operation allowed is to shift blocks of characters. The algorithm improves on the previously best ...

The paper studies large deviations of maximum likelihood and related estimates in the case of i.i.d. observations with distribution determined by a parameter θ taking values in a general metric space. The main theorems provide sufficient conditions under which an approximate sieve maximum likelihood estimate is an asymptotically locally optimal estimate of g(θ) in the sense of Bahadur, for virt...

Abstract In this paper we describe I-Subdue, an extension to the Subdue graph-based data mining system. I-Subdue operates over sequentially received relational data to incrementally discover the most representative substructures. The ability to incrementally refine discoveries from serially acquired data is important for many applications, particularly as computer systems become more integrated...

In this paper, an evolutionary programming-based clustering algorithm is proposed. The algorithm effectively groups a given set of data into an optimum number of clusters. The proposed method is applicable for clustering tasks where clusters are crisp mad spherical. This algorithm determines the number of clusters and the cluster centers in such a way that locally optimal solutions are avoided....

Some nonparametric tests for the hypothesis of interchangeability of the elements of a (stochastic) 2-vector under competing risks model are proposed and studied here. Both fixed sample and sequential procedures are studied. The case of progressively censored nonparametric procedures is also presented. Along with some martingale theorems on allied rank statistics, their weak convergence results...

Robust nonlinear controller design with constraint on the poles' location of the linear part of closed-loop system is proposed. The design method is based on the integrator backstepping procedure and linear constrained ∞ H for nonlinear strictfeedback systems with disturbance also in strict-feedback form. The resulted closedloop system will be globally stable, while both local robustness and de...

In the present work, some efforts have been made to search of effective rotation patterns in estimation of precision of population mean of study variable on current occasion in two-occasion successive sampling. Information on an auxiliary character, which is readily available on previous and current occasion, has been used along with the information on study character from the first and second ...