Search results for "Spatial"
showing 10 items of 2121 documents
Super-resolved or field of view enlarged imaging based upon spatial depolarization of light
2010
Abstract In this paper we present a new approach allowing the surpassing of the diffraction based limitation for the achievable resolution provided by imaging systems. It is based on an encoding–decoding process of various spatial pixels or regions in the field of view of the imaged object by orthogonal and differently time varying polarization states. The reconstruction of the original spatial information is obtained by applying a decoding process in a way similar to the encoding one. Although all the spatial information is summed and mixed together by the system, the decoding provides super-resolved imaging since in every spatial position the undesired spatial information having time vary…
Non-Conventional Tunable Spatial Filtering
1987
A virtual display of the Fraunhofer diffraction pattern of any object is formed in the transverse source plane by theyirtual diffracted rays extqn0ing in the region to the left of the screen containing the transparencyl),2). Except for a few cases '')"°), the concept of virtual Fourier transform appears not to have been made use of. The main idea of this paper is, bearing in mind the property referred to in the above paragraph, to describe a novel spatial filtering technique. In this way, one can obtain different filtered images, by simply moving the point source along the optical axis. The basic theory is described below.
Dispersion Compensation in Holograms Reconstructed by Femtosecond Light Pulses
2014
This chapter describes how the spatiotemporal dispersion associated with the diffraction of broadband femtosecond light pulses through computer generated holograms (CGHs) can be compensated to a first order with a properly designed dispersion compensation module (DCM). The angular dispersion of the beam associated to CGHs leads to both spatial and temporal distortion of the pulse. Some experiments in one-shot second harmonic generation, wide-field two-photon microscopy, and parallel micromachining are shown to study the quality of the compensation performed with the DCM.
Geometrical Transformations In The Fraunhofer Plane
1987
A virtual display of the Fraunhofer diffraction pattern is generated solely by illuminating the object with a point source. If this pattern is imaged with an anamorphic system, several linear geometrical transformations can be achieved. Furthermore, a nonsymmetrical Fourier transformer with a variable degree of anamorphic magnification on the Fraunhofer pattern can be implemented.
Pattern formation in clouds via Turing instabilities
2020
Pattern formation in clouds is a well-known feature, which can be observed almost every day. However, the guiding processes for structure formation are mostly unknown, and also theoretical investigations of cloud patterns are quite rare. From many scientific disciplines the occurrence of patterns in non-equilibrium systems due to Turing instabilities is known, i.e. unstable modes grow and form spatial structures. In this study we investigate a generic cloud model for the possibility of Turing instabilities. For this purpose, the model is extended by diffusion terms. We can show that for some cloud models, i.e special cases of the generic model, no Turing instabilities are possible. However,…
Durable Rural Development Through the 2014 - 2020 National Rural Development Program
2018
Abstract Rural Development Policy is a priority for the E.U., as half of the Union’s population lives in rural areas. This policy is focused on society’s durable development, under all its aspects: economic, social, cultural, and so on. The challenges which rural areas of member states face must be addressed, while at the same time applying European norms and standards for rural development. After Romania became a part of the E.U., rural areas here were supported through several national rural development programs, so as to create a durable and sustainable rural economy. Major changes are required to achieve this kind of development, such as replacing old agricultural structures, modernizin…
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 …