Search results for "string"

Effect of mechanically deboning of chicken on the rheological and sensory properties of chicken sausages

2019

The current study was aimed to investigate the effects of different types and percentage of mechanically deboned chicken meat (MDC) on the textural and sensory properties of sausages in fried and nonfried condition. Cutting behavior, hardness, stringiness, gumminess, cohesiveness, chewiness, and resilience were evaluated on sausage with different percentage of MDC, using chicken fillet as a control. The result of the textural analysis showed that with a high percentage of MCD, the shear force, hardness, and stringiness increased in sausages. The cohesiveness and resilience often decreased with the rising of MDC percentage. Evaluation of shear force in fried products showed that the MDC perc…

Unravelling the atomic structure of cross-linked (1 × 2) TiO2(110).

2010

The cross-linked (1 × 2) reconstruction of TiO(2)(110) is a frequently observed phase reflecting the surface structure of titania in a significantly reduced state. Here we resolve the atomic scale structure of the cross-linked (1 × 2) phase with dynamic scanning force microscopy operated in the non-contact mode (NC-AFM). From an analysis of the atomic-scale contrast patterns of the titanium and oxygen sub-structures obtained by imaging the surface with AFM tips having different tip apex termination, we infer the hitherto most accurate model of the atomic structure of the cross-linked (1 × 2) phase. Our findings suggest that the reconstruction is based on added rows in [001] direction built …

Abelian varieties and theta functions associated to compact Riemannian manifolds; constructions inspired by superstring theory

2012

We look into a construction of principal abelian varieties attached to certain spin manifolds, due to Witten and Moore-Witten around 2000 and try to place it in a broader framework. This is related to Weil intermediate Jacobians but it also suggests to associate abelian varieties to polarized even weight Hodge structures. The latter construction can also be explained in terms of algebraic groups which might be useful from the point of view of Tannakian categories. The constructions depend on moduli much as in Teichm\"uller theory although the period maps in general are only real analytic. One of the nice features is how the index for certain differential operators canonically associated to …

Learning non-linear time-scales with kernel -filters

2009

A family of kernel methods, based on the @c-filter structure, is presented for non-linear system identification and time series prediction. The kernel trick allows us to develop the natural non-linear extension of the (linear) support vector machine (SVM) @c-filter [G. Camps-Valls, M. Martinez-Ramon, J.L. Rojo-Alvarez, E. Soria-Olivas, Robust @c-filter using support vector machines, Neurocomput. J. 62(12) (2004) 493-499.], but this approach yields a rigid system model without non-linear cross relation between time-scales. Several functional analysis properties allow us to develop a full, principled family of kernel @c-filters. The improved performance in several application examples suggest…

A loop-free two-close Gray-code algorithm for listing k-ary Dyck words

2006

AbstractP. Chase and F. Ruskey each published a Gray code for length n binary strings with m occurrences of 1, coding m-combinations of n objects, which is two-close—that is, in passing from one binary string to its successor a single 1 exchanges positions with a 0 which is either adjacent to the 1 or separated from it by a single 0. If we impose the restriction that any suffix of a string contains at least k−1 times as many 0's as 1's, we obtain k-suffixes: suffixes of k-ary Dyck words. Combinations are retrieved as special case by setting k=1 and k-ary Dyck words are retrieved as a special case by imposing the additional condition that the entire string has exactly k−1 times as many 0's a…

Boosting Textual Compression in Optimal Linear Time

2005

We provide a general boosting technique for Textual Data Compression. Qualitatively, it takes a good compression algorithm and turns it into an algorithm with a better compression performance guarantee. It displays the following remarkable properties: (a) it can turn any memoryless compressor into a compression algorithm that uses the “best possible” contexts; (b) it is very simple and optimal in terms of time; and (c) it admits a decompression algorithm again optimal in time. To the best of our knowledge, this is the first boosting technique displaying these properties.Technically, our boosting technique builds upon three main ingredients: the Burrows--Wheeler Transform, the Suffix Tree d…

Probabilistic versus deterministic memory limited learning

1995

Dictionary-symbolwise flexible parsing

2012

AbstractLinear-time optimal parsing algorithms are rare in the dictionary-based branch of the data compression theory. A recent result is the Flexible Parsing algorithm of Matias and Sahinalp (1999) that works when the dictionary is prefix closed and the encoding of dictionary pointers has a constant cost. We present the Dictionary-Symbolwise Flexible Parsing algorithm that is optimal for prefix-closed dictionaries and any symbolwise compressor under some natural hypothesis. In the case of LZ78-like algorithms with variable costs and any, linear as usual, symbolwise compressor we show how to implement our parsing algorithm in linear time. In the case of LZ77-like dictionaries and any symbol…

Extracting string motif bases for quorum higher than two

2012

Bases of generators of motifs consisting of strings in which some positions can be occupied by a don’t care provide a useful conceptual tool for their description and a way to reduce the time and space involved in the discovery process. In the last few years, a few algorithms have been proposed for the extraction of a basis, building in large part on combinatorial properties of strings and their autocorrelations. Currently, the most efficient techniques for binary alphabets and quorum q = 2 require time quadratic in the length of the host string. The present paper explores properties of motif bases for quorum q ≥ 2, both with binary and general alphabets, by also showing that important resu…

Top-k String Similarity Joins

2020

Top-k joins have been extensively studied in relational databases as ranking operations when every object has, among others, at least one ranking attribute. However, the focus has mostly been the case when the join attributes are of primitive data types (e.g., numerical values) and the join predicate is equality. In this work, we consider string objects assigned such ranking attributes or simply scores. Given two collection of string objects and a string similarity measure (e.g., the Edit distance), we introduce the top-k string similarity join () which returns k sufficiently similar pairs of objects with respect to a similarity threshold ϵ, which have the highest combined score computed by…