Search results for "Formal"
showing 10 items of 1654 documents
A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY
2013
Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…
Fluorescence In Situ Hybridization (FISH) on Formalin-Fixed Paraffin-Embedded (FFPE) Tissue Sections
2011
Fluorescence In Situ Hybridization (FISH) is a powerful technique for localizing specific DNA targets directly in the fixed tissue or cells. Bacterial artificial chromosome (BAC) as well as commercial probes, which could be supplied ready for use or concentrated and must be diluted following the manufacturers instructions, can be used. The technique requires 2 days, as an overnight incubation of the FISH probes is needed for optimal hybridization. The critical steps include deparaffinization of tissue sections, optimal pretreatment (target retrieval and protein digestion), and probe hybridization. In this chapter, the described FISH protocol provides a methodology for analyzing the cytogene…
Dynamically generated N* resonances from the interaction of two mesons and a baryon
2009
We have studied the ππN system and coupled channels by using of the Faddeev equations and two N* and one Δ states, all of them with JP = 1/2+, have been found in the formalism as dynamically generated states. In addition, signatures for a new N* resonance with JP = 1/2+ are found around an energy of 1920 MeV in the three-body center of mass system.
Tunable antenna system for plug&play satellite avionics: Prototyping and test
2014
In the framework of an ESA program, a new architecture for plug&play compact antenna systems in the X band has been investigated and experimentally verified by many prototypes. The proposed antenna system takes inspiration from the LEGO building toys: the basic component of the new architecture is a 2.7cm-cube complex module that integrates a three-dimensional local network and a programmable mechanism based on the bonding-wire technology to select one among three polarization options. Elemental blocks can be augmented by accessories to shape the beam and may be used in array configuration over boards provided with cluster-level beamforming networks. Measurements have been performed for bot…
Natural Language Parsing
2009
Automatic natural language processing captures a lion’s share of the attention in open information management. In one way or another, many applications have to deal with natural language input. In this chapter the authors investigate the problem of natural language parsing from the perspective of biolinguistics. They argue that the human mind succeeds in the parsing task without the help of languagespecific rules of parsing and language-specific rules of grammar. Instead, there is a universal parser incorporating a universal grammar. The main argument comes from language acquisition: Children cannot learn language specific parsing rules by rule induction due to the complexity of unconstrain…
The formal method in Germany and Russia : the beginnings of European psycholinguistics
2018
Abstract German–Austrian psychology is a direct source of the European formalism movement both in the German context (Germany, Austria) as well as in Russia. This interest of the formalists in the corporeal component of linguistic and literary production has resulted in a particular research stream, which could be defined as a ‘linguo-somatic orientation’. In particular, this is the case of Alois Riegl’s [1] perceptive ‘tactile–optical’ method; Adolf von Hildebrand’s [2] architectonic conception; Konrad Fiedler’s [3] ‘sensorial aesthetics’; W. Wölfflin’s [4] ‘basic concepts’ of the art history, W. Worringer’s [5] psychological arts typology as well as Oskar Walzel’s sound-corporeal poetics …
Black Holes in Extended Gravity Theories in Palatini Formalism
2013
We consider several physical scenarios where black holes within classical gravity theories including R 2 and Ricci-squared corrections and formulated a la Palatini can be analytically studied.
Research of Complex Forms in Cellular Automata by Evolutionary Algorithms
2004
This paper presents an evolutionary approach for the search for new complex cellular automata. Two evolutionary algorithms are used: the first one discovers rules supporting gliders and periodic patterns, and the second one discovers glider guns in cellular automata. An automaton allowing us to simulate AND and NOT gates is discovered. The results are a step toward the general simulation of Boolean circuits by this automaton and show that the evolutionary approach is a promising technic for searching for cellular automata that support universal computation.
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
2004
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers provides elements of answer, as it describes how another universal cellular automaton than the Game of Life (Life) was sought and found using evolutionary algorithms. This paper includes a demonstration that consists in showing that the presented R automaton can both implement any logic circuit (logic universality) and a simulation of Life (universality in the Turing sense).
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.