This paper addresses the common engineering practice of specifying a required probability of attaining some performance level. The problem setup is that of a standard robust H∞ performance analysis of a parameter-dependent system, except that the parameter hyper-rectangle (box) shrinks in the analysis in order to accommodate a polytopic performance goal that is better than the one attainable fo...

Modern epidemiologic and clinical studies aimed at analyzing a time to an event endpoint T routinely collect, in addition to (possibly censored) information on T, high dimensional data often in the form of baseline (i.e. timeindependent covariates V (0)) and time-varying covariates V (t) , t > 0, measured at frequent intervals. Scientific interest, however, often focuses on a low dimensional fu...

Modelling of Supermarket Energy Control Systems and its Application in Design Integration and Optimisation Dr Yunting Ge Conventional supermarket refrigeration systems are responsible for considerable CO2 emissions due to high energy consumption and large quantities of refrigerant leakage. In the effort to conserve energy and reduce environmental impacts, an efficient design tool for the analys...

My research is in Functional Analysis (AMS classification 46), Operator Theory (47), Global Analysis (58), Probability Theory (60), and Combinatorics (05). Most of what I do relates to functional inequalities, often arising in mathematical physics, in many different contexts. Much of my recent work is in and around free probability theory, an important and relatively new field at the confluence...

We have studied the separation of a double stranded DNA (dsDNA), which is driven by either the temperature or force. By monitoring the probability of opening of entire base pairs along the chain, we show that the opening of a dsDNA depends not only on the sequence but also on the constraints on the chain in the experimental setups. Our results clearly demonstrate that the force-induced melting ...

Maximizing goal probability is an important objective in probabilistic planning, yet algorithms for its optimal solution are severely underexplored. There is scant evidence of what the empirical state of the art actually is. Focusing on heuristic search, we close this gap with a comprehensive empirical analysis of known and adapted algorithms. We explore both, the general case where there may b...