Search results for " Spatial"
showing 10 items of 582 documents
Architectures “on ruins” and ambiguous transparency: the glass in preservation and communication of archaeology
2008
Abstract The contemporary architecture is characterized by an even more marked transparency, as a result of a continuous experimentation all directed towards the search of the built “lightness”, that is towards the “dematerialization” of the architecture and the consequent loss of weight connected to the excess of form. It is in 1851 that a New Architectural Age springs because of the realization of the Crystal Palace, in London – that has addressed towards the experimentation of the glass as an architectural, structural element and of design. Today, part of this experimentation has been applied for some interventions of coverage, protection and communication in situ of the archaeological r…
The fate of organic matter sources in coastal environments: a comparison of three Mediterranean lagoons
2008
Trophic processes in coastal lagoons are strongly influenced by freshwater inputs and water exchanges with the sea. In recent years, stable isotope analysis has become a widespread and reliable method for the examination of trophic structure over time and space, also in complex ecosystems such as coastal lagoons. Stable isotopes of carbon and nitrogen were studied in primary producers and consumers to identify organic matter source pools from terrestrial, benthic and pelagic environments and to characterise the trophic structure in three Mediterranean coastal lagoons (Lake Fusaro, the Lake of Sabaudia and Stagnone di Marsala). The results highlighted the negligible importance of terrestrial…
High spatial resolution analysis of the iron oxidation state in silicate glasses using the electron probe
2018
The iron oxidation state in silicate melts is important for understanding their physical properties, although it is most often used to estimate the oxygen fugacity of magmatic systems. Often high spatial resolution analyses are required, yet the available techniques, such as μrXANES and μMössbauer, require synchrotron access. The flank method is an electron probe technique with the potential to measure Fe oxidation state at high spatial resolution but requires careful method development to reduce errors related to sample damage, especially for hydrous glasses. The intensity ratios derived from measurements on the flanks of FeLα and FeLβ X-rays (FeLβf/FeLαf) over a time interval (time-depend…
Parallel laser micromachining based on diffractive optical elements with dispersion compensated femtosecond pulses
2013
We experimentally demonstrate multi-beam high spatial resolution laser micromachining with femtosecond pulses. The effects of chromatic aberrations as well as pulse stretching on the material processed due to diffraction were significantly mitigated by using a suited dispersion compensated module (DCM). This permits to increase the area of processing in a factor 3 in comparison with a conventional setup. Specifically, 52 blind holes have been drilled simultaneously onto a stainless steel sample with a 30 fs laser pulse in a parallel processing configuration.
Continuity and discontinuity in the semantics of the Latin preposition per: a cognitive hypothesis
2011
Abstract We propose a description of the semantic network of the Latin prepositional phrase per ‘through’ + Accusative in the early stage of this language. Drawing upon the insights of Cognitive Grammar, we analyze the role of the schematic import in the spread from basic to abstract meanings. Finally, we draw a map of the polysemous network of per, showing that the continuity of the different, but consistently linked, meanings does not necessarily imply the unidirectionality of the concrete-to-abstract shifts.
Transition Function Complexity of Finite Automata
2011
State complexity of finite automata in some cases gives the same complexity value for automata which intuitively seem to have completely different complexities. In this paper we consider a new measure of descriptional complexity of finite automata -- BC-complexity. Comparison of it with the state complexity is carried out here as well as some interesting minimization properties are discussed. It is shown that minimization of the number of states can lead to a superpolynomial increase of BC-complexity.
Quantum Finite State Automata over Infinite Words
2010
The study of finite state automata working on infinite words was initiated by Buchi [1]. Buchi discovered connection between formulas of the monadic second order logic of infinite sequences (S1S) and ω-regular languages, the class of languages over infinite words accepted by finite state automata. Few years later, Muller proposed an alternative definition of finite automata on infinite words [4]. McNaughton proved that with Muller’s definition, deterministic automata recognize all ω-regular languages [2]. Later, Rabin extended decidability result of Buchi for S1S to the monadic second order of the infinite binary tree (S2S) [5]. Rabin theorem can be used to settle a number of decision probl…
Language Recognition Power and Succinctness of Affine Automata
2016
In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by Diaz-Caro and Yakaryilmaz [6] referred as affine automata. First, we present efficient simulations of probabilistic and quantum automata by means of affine automata which allows us to characterize the class of exclusive stochastic languages. Then, we initiate a study on the succintness of affine automata. In particular, we show that an infinite family of unary regular languages can be recognized by 2-state affine automata, whereas the number of states of any quantum and probabilistic automata cannot be bounded. Finally, we present the characterization …
One Alternation Can Be More Powerful Than Randomization in Small and Fast Two-Way Finite Automata
2013
We show a family of languages that can be recognized by a family of linear-size alternating one-way finite automata with one alternation but cannot be recognized by any family of polynomial-size bounded-error two-way probabilistic finite automata with the expected runtime bounded by a polynomial. In terms of finite automata complexity theory this means that neither 1Σ2 nor 1Π2 is contained in 2P2.
Hopcroft's algorithm and tree-like automata
2011
Minimizing a deterministic finite automata (DFA) is a very important problem in theory of automata and formal languages. Hopcroft's algorithm represents the fastest known solution to the such a problem. In this paper we analyze the behavior of this algorithm on a family binary automata, called tree-like automata, associated to binary labeled trees constructed by words. We prove that all the executions of the algorithm on tree-like automata associated to trees, constructed by standard words, have running time with the same asymptotic growth rate. In particular, we provide a lower and upper bound for the running time of the algorithm expressed in terms of combinatorial properties of the trees…