a higher-order duration calculus and its completeness

National Natural Science Foundation of China; Public Administration and Civil Service Bureau of Macau SAR; Companhia de Telecomunicacoes de Macau S.A.R.L.; Macau SAR Government Tourist Office

An Algorithm for Group Formation and Maximal Independent Set in an Amorphous Computer

Amorphous computing is the study of programming ultra-scale computing environments of smart sensors and actuators cite{white-paper}. The individual elements are identical, asynchronous, randomly placed, embedded and communicate locally via wireless broadcast. Aggregating the processors into groups is a useful paradigm for programming an amorphous computer because groups can be used for specialization, increased robustness, and efficient resource allocation. This paper presents a new algorithm, called the clubs algorithm, for efficiently aggregating processors into groups in an amorphous computer, in time proportional to the local density of processors. The clubs algorithm is well-suited to the unique characteristics of an amorphous computer. In addition, the algorithm derives two properties from the physical embedding of the amorphous computer: an upper bound on the number of groups formed and a constant upper bound on the density of groups. The clubs algorithm can also be extended to find the maximal independent set (MIS) and $Delta + 1$ vertex coloring in an amorphous computer in $O(log N)$ rounds, where $N$ is the total number of elements and $Delta$ is the maximum degree.

Maximal L p -regularity for the Laplacian on Lipschitz domains

I.Wood: Maximal Lp-regularity for the Laplacian on Lipschitz domains, Math. Z., 255, 4 (2007), 855-875.

A 3-min all-out test to determine peak oxygen uptake and the maximal steady state

Burnley, M., Doust, J., Vanhatalo, A., A 3-min all-out test to determine peak oxygen uptake and the maximal steady state, Medicine & Science in Sports & Exercise. 38(11):1995-2003, November 2006. RAE2008

Maximal strength and cortisol responses to psyching-up during the squat exercise

McGuigan, M. R., Ghiagiarelli, J., Tod, D. (2005). Maximal strength and cortisol responses to psyching-up during the squat exercise. Journal of Sports Sciences, 23 (7), 687-692. RAE2008

Problems of maximal mean resistance on the plane

Plakhov, A.Y.; Gouveia, P.D.F., (2007) 'Problems of maximal mean resistance on the plane', Nonlinearity 20(9) pp.2271-2287 RAE2008

Entropy Loss is Maximal for Uniform Inputs

A secure sketch (defined by Dodis et al.) is an algorithm that on an input w produces an output s such that w can be reconstructed given its noisy version w' and s. Security is defined in terms of two parameters m and m˜ : if w comes from a distribution of entropy m, then a secure sketch guarantees that the distribution of w conditioned on s has entropy m˜ , where λ = m−m˜ is called the entropy loss. In this note we show that the entropy loss of any secure sketch (or, more generally, any randomized algorithm) on any distribution is no more than it is on the uniform distribution.

Ontological representation of design science research publications

A search result provided by existing digital library and web search systems typically comprises only a prioritised list of possible publications or web pages that meet the search criteria, possibly with excerpts and possibly with search terms highlighted. The research in progress reported in this poster contributes to a larger research effort to provide a readable summary of search results that synthesise relevant publications or web pages to provide results that meet four C’s: comprehensive, concise, coherent, and correct, as a more useful alternative to un-synthesised result lists. The scope of this research is limited to searching for and synthesising Design Science Research (DSR) publications that present the results of DSR, as an example problem domain.