This paper considers systems whose input signals are fuzzy stochastic processes of second order. The analysis is entirely restricted to discrete time linear time-invariant systems. Convergence conditions of the output are given. The equations on the mean value functions and the covariance...

Directed paths are obtained by inverting a matrix with elements from a field, showing that it is unnecessary to go through the cumbersome procedure of inverting a matrix with elements from a division ring

We consider the problem of optimally allocating the resources to competing activities where the amounts of the resources are not previosly given but are also to be determined subject to certain linear constraints. The objective is to find such activity levels such that their weighted deviation...

In this paper, I consider a problem of multi-dimensional screening in the case when the number of consumer's characteristics, , differs from , the number of goods produced by a monopolist. I show that, in the case when , the qualitative features of solution are similar to those obtained by...

We discuss the -Optimal Martingale Measure for ∈ (1, ∞) in continuous incomplete markets whose stock price is fluctuated by a -dimensional continuous semimartingale. In this paper, we treat two simple models. One is a model where the mean-variance trade-off process is deterministic. Another...

We have proved a new rotational sorting algorithm capable of reducing the complexity of data assignment process embedded in the maximum likelihood (ML)-based solution of a multitarget tracking problem from () of the conventional Hungarian type routines to () provided that the bearings-only...

We give a simplification of the proof of the Bott periodicity theorem presented by Aguilar and Prieto. These methods are extended to provide a new proof of the real Bott periodicity theorem. The loop spaces of the groups and are identified by considering the fibers of explicit quasifibrations...

We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, into rectangles, and show an Ω( log ) lower bound on the time-complexity. The result holds for any decomposition,...