In this work, we investigate efficient algorithms for accessing information stored in a large number of RFID tags. Interrogators, equipped with RFID scanners, regularly arrive at the tag system, read from and write messages to the tags, and then leave. We develop techniques for the interrogators to read the newest messages from the tags as quickly as possible, since newer information is often t...

Contamination technique will be examined as a possible approach to robustness analysis of results obtained for multistage stochastic linear programs with respect to changes of their structure or of the input data. We shall focus on the case when the already selected scenario tree gets extended for additional (stress or out-of-sample) scenarios and/or additional stages. MSC 2000: 90C15, 90C31

Multistage stochastic programs can be seen as discrete optimal control problems with a characteristic dynamic structure induced by the scenario tree. To exploit that structure, we propose a highly eecient dynamic programming recursion for the computationally intensive task of KKT systems solution within an interior point method. Test runs on a multistage portfolio selection problem demonstrate ...

We propose a generic method for obtaining quickly good upper bounds on the minimal value of a multistage stochastic program. The method is based on the simulation of a feasible decision policy, synthesized by a strategy relying on any scenario tree approximation from stochastic programming and on supervised learning techniques from machine learning.

We discuss the phenomenological viability of string multi-Higgs doublet models, namely a scenario of heterotic Z3 orbifolds with two Wilson lines, which naturally predicts three supersymmetric families of matter and Higgs fields. We study the orbifold parameter space, and discuss the compatibility of the predicted Yukawa couplings with current experimental data. We address the implications of t...

The suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representation...

We study the hadroproduction of two neutral Higgs bosons in the minimal supersymmetric extension of the standard model, which provides a handle on the trilinear Higgs couplings. We include the contributions from quark-antiquark annihilation at the tree level and those from gluon-gluon fusion, which proceeds via quark and squark loops. We list compact results for the tree-level partonic cross se...

Many planning tasks involve complex reasoning about time: what must happen in sequence and what may happen in parallel. One hundred ten online participants were provided with a simple planning scenario (to design a calling tree) and asked to manipulate different diagrammatic representations of the problem. More important than the initial representation was the participants’ transformed represen...

We have investigated some phenomenological aspects of an SU(2)× U(1) scenario where scalars belonging to arbitrary representations of SU(2) are involved in electroweak symmetry breaking. The resulting interaction terms are derived. Some constraints are obtained on the arbitrary scalar sector from the requirement of tree-level unitarity in longitudinal gauge boson scattering. We also show that, ...