Abstract. This work introduces a system of algorithms to compute period matrices for general surfaces with arbitrary topologies. The algorithms are intrinsic to the geometry, independent of surface representation. The computation is efficient, stable and practical for real applications. The algorithms are experimented to real surfaces including human faces and sculptures, and applied for surfac...

This paper suggests an improvement of the theoretical foundation of information systems research of the 1990s. This foundation is found in human activity theory. The paper deals with how human activity theory can help systems design change, theoretically and practically. Applying activity theory to systems design, certain cornerstones become apparent, on which future systems design practice and...

Recently Kojima and Tun cel proposed new successive convex relaxation methods and their localized-discretized variants for general nonconvex quadratic optimization problems. Although an upper bound of the optimal objective function value within a previously given precision can be found theoretically by solving a nite number of linear programs, several important implementation issues remain unso...

We present a novel method for onset detection in musical signals. It improves over previous energy-based and phase-based approaches by combining both types of information in the complex domain. It generates a detection function that is sharp at the position of onsets and smooth everywhere else. Results on a handlabelled data-set show that high detection rates can be achieved at very low error r...

We consider the unrelated parallel machines scheduling problem where jobs have earliness and tardiness penalties and a common due date. We formulate this problem and some of its variants as 0-1 programs with quadratic objective function subject to linear constraints. The main contribution of this paper is to use and develop different convex reformulations to solve exactly the quadratic programs...

In this talk, I will first motivate and describe the master equation introduced in large population stochastic control, which is a PDE written on the Wasserstein space. In particular, I will recall the probabilistic representation of its solution in term of a (fully coupled) FBSDE with McKean-Vlasov interaction. I will then introduce a scheme for this class of BSDEs and demonstrate its converge...

By exploiting the duality between boosting and online learning, we present a boosting framework which proves to be extremely powerful thanks to employing the vast knowledge available in the online learning area. Using this framework, we develop various algorithms to address multiple practically and theoretically interesting questions including sparse boosting, smooth-distribution boosting, agno...

Determinism is a theoretically and practically important concept in labelled transition systems and trees. We study its generalisation to event structures. It turns out that the result depends on what characterising property of tree determinism one sets out to generalise. We present three distinct notions of event structure determinism, and show that none of them shares all the pleasant propert...