Die beslissing van die Hoogste Hof Appèl in Bekker v Naudé (2003 5 SA 173 (HHA)) dat nie-selfopgestelde vormgebrekkige testamente nie binne trefwydte hof se kondoneringsbevoegdheid ingevolge artikel 2(3) Wet op Testamente (7 1953) val nie, kan verreikende gevolge vir testamentopstellers hê. In hierdie het beslis vereiste dokument “wat opgestel of verly is deur 'n persoon wat sedert opstel verly...

The purpose of this thesis is to describe one-shot-learning gesture recognition systems developed on the ChaLearn Gesture Dataset [3]. We use RGB and depth images and combine appearance (Histograms of Oriented Gradients) and motion descriptors (Histogram of Optical Flow) for parallel temporal segmentation and recognition. The Quadratic-Chi distance family is used to measure differences between ...

http://dx.doi.org/10.1016/j.biocon.2015.05.001 0006-3207/Crown Copyright 2015 Published by Elsevier Ltd. All rights reserved. ⇑ Corresponding author. Tel.: +44 (0)191 3341379. E-mail address: [email protected] (S.G. Willis). S.G. Willis a,⇑, W. Foden , D.J. Baker , E. Belle , N.D. Burgess , J.A. Carr , N. Doswald , R.A. Garcia , A. Hartley , C. Hof , T. Newbold , C. Rahbek , R.J. Smith , ...

MARTIN HOF, TERESA KRAL, MAREK LANGNER, NOPPADON ADJIMATERA and IAN S. BLAGBROUGH J. Heyrovský Institute of Physical Chemistry, Academy of Sciences of the Czech Republic, Dolejškova 3, CZ-18223 Prague, Czech Republic, Agricultural University, Department of Physics and Biophysics, Wrocław, Poland, Wrocław University of Technology, Wrocław, Poland, Academic Centre for Biotechnology of Lipids Aggr...

Described is the implementation in XSLT of some major functional programming design patterns: • Higher-order functions (HOF) • Recursive iteration • Primitive recursion (folding) over lists and trees • Mapping of lists • Functional composition • Partial application and currying • Dynamic creation of a new function The author argues that using a functional programming library that supports these...

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We survey the known results and obtain new results for some sequences, in particular for Rote sequences and for fixed points of primitive morphisms of constant length belonging to “class P” of Hof-Knill-Simon. We also give ...

3 Scale and Performance in a Distributed File System SigOps HoF paper [SOSP’87, TOCS 1988] • John Howard (Project Lead, retired from Sun) • Michael Kazar (CTO Avere, IEEE Info Storage Sys Award) Co-founded Transarc (commercial AFS, acquired by IBM) • Sherri Menees [Nichols] (community activist, Redmond WA) • David Nichols (Microsoft, start-up became Live Meeting) • M. Satyanarayanan (CMU, ACM &...

With recent improved dense trajectory features (HOG, warped HOF, and warped MBH), we employ two advanced super vector methods, namely Fisher Vector (FV) and soft Vector of Locally Aggregated Descriptors (VLAD-K) to encode them separately. The two individual super vectors are concatenated into a Hybrid Super Vector, and a linear SVM classifier is used to predict labels. We achieve 87.46%1 in ave...