We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any givenN and k, while allowing the actual payments to be made on-line, namely without the need to know all payment ...

We consider the k-payment problem: given a total budget of N units, represent this budget as a set of coins, so that any k exact payment requests of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k The actual payments are made on-line, namely without knowing all payment requests in advance. Our motivation ...

It is widely accepted to use conditional value-at-risk for risk management needs and option pricing. As a rule, there are difficulties in exact calculations of value-at-risk. In the paper, we methodology price spread options, extending some approximation approaches these needs. Our results illustrate by numerical which demonstrate their effectiveness. We also show how pricing can help with regu...

This paper shows simple dynamic programming algorithms for RNA secondary structure prediction with pseudoknots. For a basic version of the problem (i.e., maximizing the number of base pairs), this paper presents an O(n) time exact algorithm and an O(n4− ) time approximation algorithm. The latter one outputs, for most RNA sequences, a secondary structure in which the number of base pairs is at l...

Let Fn q be a vector space of dimension n over the finite field Fq . A q-analog of a Steiner system (also known as a q-Steiner system), denoted Sq(t,k,n), is a set S of k-dimensional subspaces of Fn q such that each t-dimensional subspace of Fn q is contained in exactly one element of S . Presently, q-Steiner systems are known only for t = 1, and in the trivial cases t = k and k= n. In this pap...