The accuracy of multiple sequence alignment pro-gram MAFFT has been improved. The new version (5.3) of MAFFT offers new iterative refinement options, H-INS-i, F-INS-i and G-INS-i, in which pairwise alignment information are incorporated into objective function. These new options of MAFFT showed

to the machine learning community. There are in the literature some indications that very simple rules may achieve surprisingly high accuracy on many datasets. For example, Rendell occasionally remarks that many real world datasets have "few peaks (often just one) " and so are &

the algorithms to handle more than thousands of training images. In this paper we develop an extension of the SPM method, by generalizing vector quantization to sparse coding followed by multi-scale spatial max pooling, and propose a linear SPM kernel based on SIFT sparse codes. This new approach remarkably

Variable selection plays an important role in high dimensional statistical modeling which nowa-days appears in many areas and is key to various scientific discoveries. For problems of large scale or dimensionality p, estimation accuracy and computational cost are two top concerns. In a recent paper

A new approach is presented for elastic registration of medical images, and is applied to magnetic resonance images of the brain. Experimental results demonstrate remarkably high accuracy in superposition of images from different subjects, thus enabling very precise localization of morphological

There has been a renewed interest regarding the correct form of the massive gauge-boson propagators to be used in the resonance region [1-9]. In particular, the accuracy attained in LEP experiments regarding the Z 0 mass, has raised the question whether the extracted value of the renormalized onshell Z

. Phys. 119, 146). It is based mainly on the use of a truly upwind discretization near the interface. Comparison with the previous algorithm shows a definite improvement. When used with a first-order upwind scheme, the method provides first-order accuracy for the signed distance function in the whole

the long-term dynamics of individual submissions from initial data. In the case of Digg, measuring access to given stories during the first two hours allows us to forecast their popularity 30 days ahead with remarkable accuracy, while downloads of Youtube videos need to be followed for 10 days to attain

We demonstrate a system built using probabilistic techniques that allows for remarkably accurate localization across our entire office building using nothing more than the built-in signal intensity meter supplied by standard 802.11 cards. While prior systems have required significant investments

. In a recent paper deBoor, Hollig, and Sabin proposed a method for local sixth-- order interpolation of convex planar curves by geometrically C 2 piecewise cubic curves, using positional, directional, and curvature data at breakpoints. This note extends their results to curves with simple zeros of curvature and gives some hints to stabilize the numerical construction. Keywords. Curves, Interpolation, Geometric Continuity, Convergence Order. 1 Hermite Interpolation This paper follows the work [1] of deBoor, Hollig, and Sabin concerning Hermite interpolation of smooth curves f : IR ! IR 2 . Their piecewise cubic geometrically C 2 interpolants use positional, directional, and curvature data. They are approximations of order O(h 6 ) with respect to the maximum distance h of two adjoining interpolation points, provided that the curvature f of f does not vanish. The approximation order can drop to four in presence of double zeros of curvature, as is shown in [1] by an example. Ho...