in this paper, we extend some famous maximal inequalities and obtain strong laws of largenumbers for arbitrary random variables by use of these inequalities and martingale techniques.

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Rening the method of diagrams we give a solution to an open problem of P. Hajek and P. Cintula (Conjectures 1 and 2 of [HaCi06]). We investigate also the properties of elementary extensions in witnessed ...

Our work is a contribution to the model theory of fuzzy predicate logics. In this paper we characterize elementary equivalence between models of fuzzy predicate logic using elementary mappings. Rening the method of diagrams we give a solution to an open problem of P. Hajek and P. Cintula (Conjectures 1 and 2 of [HaCi06]). We investigate also the properties of elementary extensions in witnessed ...

Supplemental Course Notes Please note that there are likely many typos in the file. These will be corrected over time. The notes are mainly based on the instructor's lecture notes as well as some references that are particularly acknowledged. Further references will be included in the bibliography. Standard material on probability measures and Markov Chains are available in many texts, and no p...

We consider combinatorial optimization problems for which the formation of a neighborhood structure of feasible solutions is impeded by a set of constraints. Neighborhoods are recovered by relaxing the complicating constraints into the objective function within a penalty term. We examine a heuristic called compressed annealing that integrates a variable penalty multiplier approach within the fr...

We consider algorithms to schedule packets with values and deadlines in a size-bounded buffer. At any time, the buffer can store at most B packets. Packets arrive over time. Each packet has a non-negative value and an integer deadline. In each time step, at most one packet can be sent. Packets can be dropped at any time before they are sent. The objective is to maximize the total value gained b...

OPTIMAL SPLITTING OF RENEWAL INPUT PROCESS TO A QUEUEING SYSTEM AND ITS APPLICATION TO A NETWORK Masao Mori Tokyo Institute of Technology Hiroshi Shirakawa Tokyo Institute of Technology (Received July 22, 1987; Revised October 30, 1987) Suppose customers over fraction p should be allocated to a single server queueing system by splitting a given input stream. In this paper we fust show that the ...

In this paper, we provide a new proof of the result that option prices are increasing in volatility when the underlying is a diffusion process. This has been shown to hold for convex payoff, path-independent options by El Karoui et al [7], Hobson [12] amongst others. The advantage of the new proof is that it can be extended to establish monotonicity results for path-dependent payoffs where the ...

M. Dezortova, M. Hajek, P. Krsek, F. Jiru, A. Skoch, J. Zamecnik, P. Marusic, M. Kyncl, M. Tichy, V. Komarek MR-Unit, Institute for Clinical and Experimental Medicine, Prague, Czech Republic, Dept Pediatric Neurology, Faculty Hospital Motol, Prague, Czech Republic, Dept Pathology and Molecular Medicine, Faculty Hospital Motol, Prague, Czech Republic, Dept Neurology, Faculty Hospital Motol, Prag...