Search results for "Pattern"

Long-transient conoscopic pattern technique

1999

0038-1098; Recent results on laser induced anisotropy in terbium gallium garnet are extended to the dynamic regime. We observed that the characteristic conoscopic pattern formation time presents a quadratic dependence on the beam size. The observed pattern intensity is accounted for by a simple analytical formula. The transient refractive index change due to thermal stress in the terbium gallium garnet is determined. (C) 1999 Elsevier Science Ltd. All rights reserved.

Feedback and Communication in Active Hydrogel Spheres with pH Fronts: Facile Approaches to Grow Soft Hydrogel Structures

2021

Abstract Compartmentalized reaction networks regulating signal processing, communication and pattern formation are central to living systems. Towards achieving life‐like materials, we compartmentalized urea‐urease and more complex urea‐urease/ester‐esterase pH‐feedback reaction networks into hydrogel spheres and investigate how fuel‐driven pH fronts can be sent out from these spheres and regulated by internal reaction networks. Membrane characteristics are installed by covering urease spheres with responsive hydrogel shells. We then encapsulate the two networks (urea‐urease and ester‐esterase) separately into different hydrogel spheres to devise communication, pattern formation and attracti…

Perfect Hashing Structures for Parallel Similarity Searches

2015

International audience; Seed-based heuristics have proved to be efficient for studying similarity between genetic databases with billions of base pairs. This paper focuses on algorithms and data structures for the filtering phase in seed-based heuristics, with an emphasis on efficient parallel GPU/manycores implementa- tion. We propose a 2-stage index structure which is based on neighborhood indexing and perfect hashing techniques. This structure performs a filtering phase over the neighborhood regions around the seeds in constant time and avoid as much as possible random memory accesses and branch divergences. Moreover, it fits particularly well on parallel SIMD processors, because it requ…

Image classification based on 2D feature motifs

2013

The classification of raw data often involves the problem of selecting the appropriate set of features to represent the input data. In general, various features can be extracted from the input dataset, but only some of them are actually relevant for the classification process. Since relevant features are often unknown in real-world problems, many candidate features are usually introduced. This degrades both the speed and the predictive accuracy of the classifier due to the presence of redundancy in the candidate feature set. In this paper, we study the capability of a special class of motifs previously introduced in the literature, i.e. 2D irredundant motifs, when they are exploited as feat…

Finding Repetitions in Biological Networks: Challenges, Trends, and Applications

2013

FORMAZIONE DI PATTERN PER IL PROCESSO DELL'ELETTRODEPOSIZIONE IN MODELLI DI TIPO REAZIONE-DIFFUSIONE

2014

Noisy Channel in Language-Pair Phenomena Identification

2014

Protein Arrays for Sensing Applications: Relationship beetween Printing Conditions and Pattern Properties

2009

Patterns of Use of English Synonymous Medical Terms: the Case of Disease and Illness. A Corpus-Based Study

2010

It often happens that terms defined by dictionaries as synonyms have different patterns of use. An example of this phenomenon is represented by the terminological pair disease/illness in medical discourse. The behaviour of these commonly used terms will be an object of discussion in this study. The work is divided into two main sections. The first part takes into account the information included in conventional dictionaries, both bilingual and monolingual, generic and specialized, in order to see if the terms in question are described as perfectly interchangeable or as having different uses depending on the context. Some dictionaries highlight the use, both specific and generic, respectivel…

On Prefix Normal Words

2011

We present a new class of binary words: the prefix normal words. They are defined by the property that for any given length $k$, no factor of length $k$ has more $a$'s than the prefix of the same length. These words arise in the context of indexing for jumbled pattern matching (a.k.a. permutation matching or Parikh vector matching), where the aim is to decide whether a string has a factor with a given multiplicity of characters, i.e., with a given Parikh vector. Using prefix normal words, we give the first non-trivial characterization of binary words having the same set of Parikh vectors of factors. We prove that the language of prefix normal words is not context-free and is strictly contai…