Search results for "STED"

showing 10 items of 2256 documents

La recente riforma della disciplina italiana del subappalto nella prospettiva del bid rigging

2023

L’articolo analizza in chiave critica la disciplina nazionale del subappalto nell’ambito delle gare pubbliche, così come recentemente riformata a seguito di diversi interventi normativi in ottemperanza alla procedura d’infrazione avviata dalla Commissione UE. Stando alla tesi dell’A., l’attuale quadro normativo – caratterizzato dalla quasi totale eliminazione delle limitazioni previgenti (probabilmente anche spingendosi oltre ciò che la Commissione UE ha richiesto) – difetta nel trovare un equo bilanciamento tra il principio della massima partecipazione alla gara, da un lato, e l’esigenza di prevenire e svelare potenziali condotte collusive, dall’altro. La suddetta conclusione, peraltro, ap…

The article critically analyzes the Italian regulation of subcontracting in the context of public tenders as recently amended by several legislative measures in compliance with the infringement procedure launched by the European Commission against Italy. According to the Author’s view the current legislative framework – characterized by the almost overall elimination of the previous limits (probably even going beyond what the European Commission requested) – lacks in finding a fair balance between the principle of the maximum participation in the tender on the one hand and the need to prevent and reveal potential collusive conduct on the other. Furthermore this conclusion is supported by the analysis of the regulation of the causes of exclusion from the tender still too timid in envisaging the optional exclusion of the participants due to anticompetitive conduct.
researchProduct

Rapid and eco-friendly synthesis of graphene oxide-silica nanohybrids

2014

The increasing interest in Graphene oxide (GO) is due to many issues: the presence of both sp2-conjugated atoms and oxygen-containing functional groups provides a strong hydrophilicity and the possibility to further functionalize it with other molecules (i.e. π-π interactions covalent attachment etc.) [1]. Furthermore since the GO is biocompatible and noncytotoxic many studies have been recently focused on the development of GO-based nanodevices for bioimaging DNA detection drug delivery. Due to their low cytotoxicity and large internal surface area silica nanoparticles have been taken into account as promising material for biolabeling and drug loading/delivery. Particular consideration has recently been demonstrated for GO-silica composites because of the potentialities for electrical applications their chemical inertia and stability toward ions exposure. The possibility to combine the extraordinary properties of GO and silica offers several advantages for the realization of nanoprobes for biological applications and of biosensor [12]. The strategy for the fabrication of GO-nanosilica nanohybrids can be schematized as follows: (i) synthesis of GO by oxidizing graphite powder with the method described by Marcano et al. [3] (ii) Preparation of oxygen-loaded silica nanoparticles by thermal treatments in controlled atmosphere in order to induce high NIR emission at 1272 nm from high purity silica nanoparticles. (iii) preparation of GrO-silica nanohybrid films via rapid solvent casting in water. The nanohybrids were tested by XPS FTIR Raman analysis UV photoluminescence analysis TGA Zeta potential measurements electrical tests AFM and SEM. Several nanohybrids were prepared by combining two different typologies of GO and two different samples of silica.
researchProduct

Canopy Architecture Appraisal by Fractal Dimension of 'Flordastar' Peach Trees Grafted onto Different Rootstocks

2007

The objective of this research was to evaluate the modification of canopy architecture of ''Flordastar'' peach (Prunus persica L. Batsch) grafted onto rootstocks with different vigour, by the use of fractal dimension (D). The hypothesis was that different vigour rootstocks are able to modify the complexity of the branching pattern and that this effect can be assessed by a geometric parameter such as the fractal dimension (D) of the 2D projection of tree branching structure. The observations were carried out in a four-year-old experimental orchard of cv. ''Flordastar'' peach trees grafted onto Ishtara, Barrier, GF677 and MrS 2/5 rootstocks. On digital pictures of leafless, dormant peach tree…

The objective of this research was to evaluate the modification of canopy architecture of ''Flordastar'' peach (Prunus persica L. Batsch) grafted onto rootstocks with different vigour by the use of fractal dimension (D). The hypothesis was that different vigour rootstocks are able to modify the complexity of the branching pattern and that this effect can be assessed by a geometric parameter such as the fractal dimension (D) of the 2D projection of tree branching structure. The observations were carried out in a four-year-old experimental orchard of cv. ''Flordastar'' peach trees grafted onto Ishtara Barrier GF677 and MrS 2/5 rootstocks. On digital pictures of leafless dormant peach trees the tree skeleton was manually depicted by an image analysis software to measure total length and angles of insertion of branches. Bitmaps of the skeleton were then subjected to a specific software (FDCALC) able to calculate D by the "box counting" method. To account for the error introduced by analyzing a three dimensional structure with its 2D projection measurements were done on two images per tree taken from two different viewing angles. Results are shown in relation to tree vigour of the scion/stock combination. Fractal dimension was related to the vigour ranking of the graft combinations tested. In particular vigorous scion/stock combinations showed the highest D.HorticultureCanopy architectureHorticultureRootstockFractal dimensionMathematics
researchProduct

Abitare nel reale. Dalla crisi della periferia alla tessitura di nuove relazioni contestuali

2019

I progetti redatti per “Palermo Sud-Est” sono il risultato di un Laboratorio di Laurea strutturatosi attraverso incontri, seminari, comunicazioni specialistiche, esposizioni critiche, che – in una strategia condivisa – ha visto ogni studente elaborare il proprio lavoro nel confronto con gli altri attori del Laboratorio stesso. La ricerca sui “progetti urbani” è stata impostata di modo che ogni laureando fosse messo a conoscenza dei progetti svolti nello stesso ambito territoriale dai colleghi che l’avevano preceduto, così da poter operare in continuità e contribuire a formulare un ragionamento unitario, nel quale ogni progetto costituisse continuazione, verifica o anche variante dei precede…

The projects prepared for "Palermo South-East" are the result of a Graduate Laboratory structured through meetings seminars specialist communications critical exhibitions which - in a shared strategy - saw each student elaborate their work in comparison with others actors of the same Laboratory. The research on "urban projects" was set so that each graduating student was made aware of the projects carried out in the same geographical area by the colleagues who had preceded it so as to be able to operate in continuity and contribute to formulating a unitary reasoning in which each project constituted continuation verification or even variant of the previous ones. These coordinated works have pursued two fundamental objectives: the strengthening of infrastructures and the establishment of specialized public buildings with superior functions aimed at requalifying and regenerating various critical situations with particular attention to the relationship between context and life scenarios. Thus each designer while dealing with a main functional program simultaneously deals with various issues such as the rationalization of the road system the redevelopment of existing buildings the design and refunctionalization of urban services (for example the transformed Central Station in the hotel or the project of a great Mosque)several degree theses have addressed as the main theme or as a question in the background the design of a new bed for the Oreto river and the relative establishment of a park facing it. In this desire to "patch up the wounds" in the different areas of "Palermo South-East" in close relationship with the vicissitudes of the place there is a continuous reference to architectures of all time and some questions involving the functional program are suggested - that identifies the character (or perhaps "type") of what is to be inserted in a given context - and the qualities of living reality as a pivotal material in the design process.Settore ICAR/14 - Composizione Architettonica E Urbana
researchProduct

A solution to the stochastic point location problem in metalevel nonstationary environments.

2008

This paper reports the first known solution to the stochastic point location (SPL) problem when the environment is nonstationary. The SPL problem involves a general learning problem in which the learning mechanism (which could be a robot, a learning automaton, or, in general, an algorithm) attempts to learn a "parameter," for example, lambda*, within a closed interval. However, unlike the earlier reported results, we consider the scenario when the learning is to be done in a nonstationary setting. For each guess, the environment essentially informs the mechanism, possibly erroneously (i.e., with probability p), which way it should move to reach the unknown point. Unlike the results availabl…

Theoretical computer scienceAutomatic controlDiscretizationComputer scienceInformation Storage and RetrievalDecision Support TechniquesPattern Recognition AutomatedArtificial IntelligenceComputer SimulationElectrical and Electronic EngineeringStochastic ProcessesModels StatisticalLearning automatabusiness.industryStochastic processSignal Processing Computer-AssistedGeneral MedicineRandom walkComputer Science ApplicationsAutomatonHuman-Computer InteractionControl and Systems EngineeringPoint locationArtificial intelligencebusinessSoftwareAlgorithmsInformation SystemsIEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society
researchProduct

Shrinking language models by robust approximation

2002

We study the problem of reducing the size of a language model while preserving recognition performance (accuracy and speed). A successful approach has been to represent language models by weighted finite-state automata (WFAs). Analogues of classical automata determinization and minimization algorithms then provide a general method to produce smaller but equivalent WFAs. We extend this approach by introducing the notion of approximate determinization. We provide an algorithm that, when applied to language models for the North American Business task, achieves 25-35% size reduction compared to previous techniques, with negligible effects on recognition time and accuracy.

Theoretical computer scienceFinite-state machineNested wordComputer scienceQuantum finite automataAutomata theoryLanguage modelAlgorithmNatural languageAutomatonProceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181)
researchProduct

Quantum versus Probabilistic One-Way Finite Automata with Counter

2001

The paper adds the one-counter one-way finite automaton [6] to the list of classical computing devices having quantum counterparts more powerful in some cases. Specifically, two languages are considered, the first is not recognizable by deterministic one-counter one-way finite automata, the second is not recognizable with bounded error by probabilistic one-counter one-way finite automata, but each recognizable with bounded error by a quantum one-counter one-way finite automaton. This result contrasts the case of one-way finite automata without counter, where it is known [5] that the quantum device is actually less powerful than its classical counterpart.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordComputer scienceTimed automatonBüchi automatonω-automatonNondeterministic finite automaton with ε-movesTuring machinesymbols.namesakeDFA minimizationDeterministic automatonContinuous spatial automatonQuantum finite automataDeterministic system (philosophy)Two-way deterministic finite automatonNondeterministic finite automatonDiscrete mathematicsFinite-state machineQuantum dot cellular automatonNonlinear Sciences::Cellular Automata and Lattice GasesMobile automatonTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonProbabilistic automatonsymbolsAutomata theoryComputer Science::Formal Languages and Automata TheoryQuantum cellular automaton
researchProduct

Multiple Usage of Random Bits in Finite Automata

2012

Finite automata with random bits written on a separate 2-way readable tape can recognize languages not recognizable by probabilistic finite automata. This shows that repeated reading of random bits by finite automata can have big advantages over one-time reading of random bits.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordFinite-state machineTheoretical computer scienceKolmogorov complexityComputer scienceω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesBit fieldTuring machinesymbols.namesakeTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESsymbolsQuantum finite automataAutomata theoryArithmeticComputer Science::DatabasesComputer Science::Formal Languages and Automata Theory
researchProduct

Tally languages accepted by Monte Carlo pushdown automata

1997

Rather often difficult (and sometimes even undecidable) problems become easily decidable for tally languages, i.e. for languages in a single-letter alphabet. For instance, the class of languages recognizable by 1-way nondeterministic pushdown automata equals the class of the context-free languages, but the class of the tally languages recognizable by 1-way nondeterministic pushdown automata, contains only regular languages [LP81]. We prove that languages over one-letter alphabet accepted by randomized one-way 1-tape Monte Carlo pushdown automata are regular. However Monte Carlo pushdown automata can be much more concise than deterministic 1-way finite state automata.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordTheoretical computer scienceComputational complexity theoryComputer scienceDeterministic pushdown automatonTuring machinesymbols.namesakeRegular languageComputer Science::Logic in Computer ScienceQuantum finite automataNondeterministic finite automatonDiscrete mathematicsFinite-state machineDeterministic context-free languageComputabilityDeterministic context-free grammarContext-free languagePushdown automatonAbstract family of languagesComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Cone (formal languages)Embedded pushdown automatonUndecidable problemNondeterministic algorithmTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonsymbolsComputer Science::Programming LanguagesAlphabetComputer Science::Formal Languages and Automata Theory
researchProduct

Local automata and completion

1993

The problem of completing a finite automata preserving its properties is here investigated in the case of deterministic local automata. We show a decision procedure and give an algorithm which complete a deterministic local automaton (if the completion exists) with another one, having the same number of states.

TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESNested wordTheoretical computer scienceComputer scienceTimed automatonω-automatonNonlinear Sciences::Cellular Automata and Lattice GasesTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESDeterministic finite automatonDFA minimizationAutomata theoryQuantum finite automataNondeterministic finite automatonComputer Science::Formal Languages and Automata Theory
researchProduct