Search results for "Turin"
showing 10 items of 2664 documents
Joint transform correlator with spatial code division multiplexing.
2006
A joint transform correlator may suffer from overlapping of the zero diffraction order of the output, which does not contain relevant information, and the correlation peaks that appear in the first diffraction orders if objects are not sufficiently separated. Such overlapping significantly reduces the signal-to-noise ratio of the identification process. We propose a novel approach based on code division multiplexing technique in which the contrast of the identification peaks is significantly enhanced. The approach does not include placing the two objects side by side but rather includes code multiplexing them. Moreover, the code division multiplexing technique allows the space-bandwidth pro…
Innovative user defined density profile approach to fsw of aluminium foam
2007
Metallic foams are one of the most exciting materials in the world of mechanical industry due to their reduced mass and the good mechanical, thermal and acoustic characteristics. Consequently, their application, is increasing day by day even with the important drawbacks that reduce their suitability and diffusion such as high manufacturing cost and difficulty in processing. An innovative approach is outlined in this paper that enables the production of complex shapes taking advantage of deformation processing and friction stir welding (FSW). The aim is to create customized tailored manufactured parts. The cellular construction of foams makes this approach rather challenging as the cell wall…
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,…
Experimental assessment of the shield-to-salt-fog properties of basalt and glass fiber reinforced composites in cork core sandwich panels applications
2018
Abstract In this paper, the effect of salt-fog exposition on the mechanical behavior of sandwich panels having cork agglomerate core was investigated. In particular, the aim of this research work is to assess the shield function of unidirectional basalt and E-glass reinforced polymer on the aging and failure mechanism of the core when such class of material are destined to operate in hostile environments (e.g., marine environment). To do this, the manufactured sandwich panels were exposed up to 60 days to salt-fog environment, according to ASTM B 117 standard. Unaged and aged specimens were analyzed through three point bending tests after aging time of 10, 25 and 60 days. Digital Image Corr…
The Steiner Traveling Salesman Problem and its extensions
2019
Abstract This paper considers the Steiner Traveling Salesman Problem, an extension of the classical Traveling Salesman Problem on an incomplete graph where not all vertices have demand. Some extensions including several depots or location decisions are introduced, modeled and solved. A compact integer linear programming formulation is proposed for each problem, where the routes are represented with two-index decision variables, and parity conditions are modeled using cocircuit inequalities. Exact branch-and-cut algorithms are developed for all formulations. Computational results obtained confirm the good performance of the algorithms. Instances with up to 500 vertices are solved optimally.
Capabilities of Ultrametric Automata with One, Two, and Three States
2016
Ultrametric automata use p-adic numbers to describe the random branching of the process of computation. Previous research has shown that ultrametric automata can have a significant decrease in computing complexity. In this paper we consider the languages that can be recognized by one-way ultrametric automata with one, two, and three states. We also show an example of a promise problem that can be solved by ultrametric integral automaton with three states.
Testing Grammars for Parsability
1990
In the preceding chapters we have studied in detail the major methods of deterministic context-free parsing: strong LL(k) parsing (Chapter 5), simple precedence parsing (Chapter 5), canonical LR(k) parsing, LALR(k) parsing, and SLR(k) parsing (Chapters 6 and 7), and canonical LL(k) parsing (Chapter 8). Each of these methods induces a class of grammars that are “parsable” using that method, that is, a class of grammars for which a deterministic parser employing that method can be constructed. For example, the LL(k) grammars constitute the class of grammars parsable by the LL(k) parsing method. By definition, a context-free grammar is an LL(k) grammar if and only if its canonical LL(k) parser…
On the Hierarchy Classes of Finite Ultrametric Automata
2015
This paper explores the language classes that arise with respect to the head count of a finite ultrametric automaton. First we prove that in the one-way setting there is a language that can be recognized by a one-head ultrametric finite automaton and cannot be recognized by any k-head non-deterministic finite automaton. Then we prove that in the two-way setting the class of languages recognized by ultrametric finite k-head automata is a proper subclass of the class of languages recognized by (k + 1)-head automata. Ultrametric finite automata are similar to probabilistic and quantum automata and have only just recently been introduced by Freivalds. We introduce ultrametric Turing machines an…
Lower space bounds for randomized computation
1994
It is a fundamental problem in the randomized computation how to separate different randomized time or randomized space classes (c.f., e.g., [KV87, KV88]). We have separated randomized space classes below log n in [FK94]. Now we have succeeded to separate small randomized time classes for multi-tape 2-way Turing machines. Surprisingly, these “small” bounds are of type n+f(n) with f(n) not exceeding linear functions. This new approach to “sublinear” time complexity is a natural counterpart to sublinear space complexity. The latter was introduced by considering the input tape and the work tape as separate devices and distinguishing between the space used for processing information and the spa…
Polyhedral results for a vehicle routing problem
1991
Abstract The Vehicle Routing Problem is a well known, and hard, combinatorial problem, whose polyhedral structure has deserved little attention. In this paper we consider the particular case in which all the demands are equal (since in the general case the associated polytope may be empty). From a known formulation of the problem we obtain the dimension of the corresponding polytope and we study the facetial properties of every inequality in it.