The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every color in the graph exactly once. The problem is motivated by applications in computational biology and is also well-studied from the theoretical point of view. In particular, it is known to be NPcomplete even on trees ...

to identify the high yielding lines with optimal characteristics, 40 recombinant inbred lines derived from a cross between ‘norstar’ (winter wheat) and ‘zagros’ (spring wheat) cultivars were examined using a randomized complete block design with three replications in 2014 at the research station of faculty of agriculture, university of tabriz, iran. the measured characters consisted of peduncle...

Many problems in linear elastodynamics, or dynamic fracture mechanics, can be reduced to Wiener–Hopf functional equations defined in a strip in a complex transform plane. Apart from a few special cases, the inherent coupling between shear and compressional body motions gives rise to coupled systems of equations, and so the resulting Wiener–Hopf kernels are of matrix form. The key step in the so...

We analyze the use, advantages, and drawbacks of graph kernels in chemoin-formatics, including a comparison of kernel-based approaches with other methodology, as well as examples of applications. Kernel-based machine learning [1], now widely applied in chemoinformatics, delivers state-of-the-art performance [2] in tasks like classification and regression. Molecular graph kernels [3] are a recen...

To edit or create the animation of a 3D character model has always been an important but time-consuming task, since the animator usually needs to set up the character’s skeleton, paint its binding weights, and adjust its key-poses. Hence, we propose an animation transfer system in this paper to take a well-edited character animation as the input. Then, the system can transfer the skeleton, bind...

We describe a machine learning approach for the 2017 shared task on Native Language Identification (NLI). The proposed approach combines several kernels using multiple kernel learning. While most of our kernels are based on character p-grams (also known as n-grams) extracted from essays or speech transcripts, we also use a kernel based on i-vectors, a low-dimensional representation of audio rec...

The purity of waxy corn seed is a very important index of seed quality. A novel procedure for the classification of corn seed varieties was developed based on the combined spectral, morphological, and texture features extracted from visible and near-infrared (VIS/NIR) hyperspectral images. For the purpose of exploration and comparison, images of both sides of corn kernels (150 kernels of each v...