Search results for "Computer Science::Databases"

showing 10 items of 183 documents

Environmental chamber for an atomic force microscope.

2007

A commercial atomic force microscope (AFM), originally designed for operation in ambient conditions, was placed inside a compact aluminum chamber, which can be pumped down to high vacuum levels or filled with a desired gaseous atmosphere, including humidity, up to normal pressure. The design of this environmental AFM is such that minimal intrusion is made to the original setup, which can be restored easily. The performance inside the environmental chamber is similar to the original version.

Materials sciencebusiness.industryAtomic force microscopyEnvironmental chamberUltra-high vacuumchemistry.chemical_elementHumidityHumidityConductive atomic force microscopyMicroscopy Atomic Forcelaw.inventionOpticsPressure measurementchemistryAluminiumlawPressureGasesComposite materialbusinessInstrumentationNon-contact atomic force microscopyComputer Science::DatabasesAluminumThe Review of scientific instruments
researchProduct

Controlling Light Confinement by Excitation of Localized Surface Plasmons

2007

Localized surface plasmons can be used to control near-field optical phenomena in the subwavelength range. Specifically, this chaper reviews recent results which show that localized surface plasmons can confine the optical intensity down to nanoscopic dimensions. The discussion first considers how a collection-mode near-field optical microscope can observe the squeezing of the plasmon field of metallic nanostructures deposited on a flat surface. Numerical simulations then provide illustrations of the confined fields associated with nanostructures which are feasible using current microfabrication techniques. Finally, we present arguments which explain how localized surface plasmons can deliv…

Materials sciencebusiness.industrySurface plasmonNanophotonicsPhysics::OpticsSurface plasmon polaritonlaw.inventionOptical phenomenaOpticsOptical microscopelawbusinessNanoscopic scaleComputer Science::DatabasesPlasmonLocalized surface plasmon
researchProduct

How to simulate normal data sets with the desired correlation structure

2010

The Cholesky decomposition is a widely used method to draw samples from multivariate normal distribution with non-singular covariance matrices. In this work we introduce a simple method by using singular value decomposition (SVD) to simulate multivariate normal data even if the covariance matrix is singular, which is often the case in chemometric problems. The covariance matrix can be specified by the user or can be generated by specifying a subset of the eigenvalues. The latter can be an advantage for simulating data sets with a particular latent structure. This can be useful for testing the performance of chemometric methods with data sets matching the theoretical conditions for their app…

Mathematical optimizationCovariance functionCovariance matrixProcess Chemistry and TechnologyMathematicsofComputing_NUMERICALANALYSISMultivariate normal distributionCovarianceComputer Science ApplicationsAnalytical ChemistryEstimation of covariance matricesScatter matrixMatrix normal distributionCMA-ESAlgorithmComputer Science::DatabasesSpectroscopySoftwareMathematicsChemometrics and Intelligent Laboratory Systems
researchProduct

Differentiability of the isoperimetric profile and topology of analytic Riemannian manifolds

2012

Abstract We show that smooth isoperimetric profiles are exceptional for real analytic Riemannian manifolds. For instance, under some extra assumptions, this can happen only on topological spheres. To cite this article: R. Grimaldi et al., C. R. Acad. Sci. Paris, Ser. I 347 (2009).

Mathematics - Differential GeometryIsoperimetric dimensionRiemannian geometryTopology01 natural sciencessymbols.namesakeRicci-flat manifoldFOS: MathematicsDifferentiable functionMorse theory0101 mathematicsTopology (chemistry)Computer Science::DatabasesIsoperimetric inequalityMorse theoryMathematicsRiemann surface010102 general mathematicsGeneral Medicinecalibration53C20;49Q20;14P15;32B20010101 applied mathematicsDifferential Geometry (math.DG)Riemann surface[MATH.MATH-DG]Mathematics [math]/Differential Geometry [math.DG]symbolsMathematics::Differential GeometryIsoperimetric inequality
researchProduct

Multi-resolution analysis in arbitrary Hilbert spaces

1997

We discuss the possibility of introducing a multi-resolution in a Hilbert space which is not necessarily a space of functions. We investigate which of the classical properties can be translated to this more general framework and the way in which this can be done. We comment on the procedure proposed by means of many examples.

Mathematics - Functional Analysismulti resolution analysisFOS: MathematicsSettore MAT/07 - Fisica MatematicaComputer Science::DatabasesFunctional Analysis (math.FA)
researchProduct

On algebraic supergroups, coadjoint orbits and their deformations

2004

In this paper we study algebraic supergroups and their coadjoint orbits as affine algebraic supervarieties. We find an algebraic deformation quantization of them that can be related to the fuzzy spaces of non-commutative geometry.

Mathematics::Quantum AlgebraFísicaMathematics::Representation TheoryComputer Science::Databases
researchProduct

Verification of scope-dependent hierarchical state machines

2008

AbstractA hierarchical state machine (Hsm) is a finite state machine where a vertex can either expand to another hierarchical state machine (box) or be a basic vertex (node). Each node is labeled with atomic propositions. We study an extension of such model which allows atomic propositions to label also boxes (Shsm). We show that Shsms can be exponentially more succinct than Shsms and verification is in general harder by an exponential factor. We carefully establish the computational complexity of reachability, cycle detection, and model checking against general Ltl and Ctl specifications. We also discuss some natural and interesting restrictions of the considered problems for which we can …

Model checkingVertex (graph theory)Model checkingFinite-state machineComputational complexity theoryTemporal logicAutomataTheoretical Computer ScienceComputer Science ApplicationsSuccinctnessComputational Theory and MathematicsReachabilityComputer Science::Logic in Computer ScienceHierarchical state machinesTemporal logicCycle detectionAlgorithmComputer Science::DatabasesMathematicsInformation SystemsInformation and Computation
researchProduct

On Generalizing Lipschitz Global Methods forMultiobjective Optimization

2015

Lipschitz global methods for single-objective optimization can represent the optimal solutions with desired accuracy. In this paper, we highlight some directions on how the Lipschitz global methods can be extended as faithfully as possible to multiobjective optimization problems. In particular, we present a multiobjective version of the Pijavskiǐ-Schubert algorithm.

Multiobjective optimization problemMathematical optimizationComputer scienceLipschitz continuityMulti-objective optimizationComputer Science::Databases
researchProduct

Halloysite Nanotube with Fluorinated Lumen: Non-Foaming Nanocontainer for Storage and Controlled Release of Oxygen in Aqueous Media

2014

Halloysite clay nanotubes were selectivity modified by adsorbing perfluoroalkylated anionic surfactants at the inner surface. The modified nanotubes formed kinetically stable dispersions due to the enhanced electrostatic repulsions exercised between the particles. We proved that the modified nanotubes can be used as non-foaming oxygen nanocontainers in aqueous media. The gas release from supersaturated dispersions can be controlled by external stimuli and system composition. In conclusion, we managed to put forward an easy strategy to develop smart materials from natural nanoclays, which can endow important applications like the storage and delivery of gas.

NanotubeMaterials sciencechemistry.chemical_elementengineering.materialSmart materialHalloysiteOxygenBiomaterialsCondensed Matter::Materials ScienceFluorinated surfactantColloid and Surface ChemistryHalloysite; nanoclay; Fluorinated surfactant; Gas solubilizationOrganic chemistryPhysics::Chemical PhysicsComputer Science::DatabasesSettore CHIM/02 - Chimica FisicaSupersaturationNanocontainerHalloysiteControlled releaseSurfaces Coatings and FilmsElectronic Optical and Magnetic MaterialsCondensed Matter::Soft Condensed MatternanoclaychemistryChemical engineeringengineeringGas solubilizationSelectivity
researchProduct

A description based on languages of the final non-deterministic automaton

2014

The study of the behaviour of non-deterministic automata has traditionally focused on the languages which can be associated to the different states. Under this interpretation, the different branches that can be taken at every step are ignored. However, we can also take into account the different decisions which can be made at every state, that is, the branches that can be taken, and these decisions might change the possible future behaviour. In this case, the behaviour of the automata can be described with the help of the concept of bisimilarity. This is the kind of description that is usually obtained when the automata are regarded as labelled transition systems or coalgebras. Contrarily t…

Nested wordTheoretical computer scienceGeneral Computer ScienceTimed automatonLlenguatges de programacióω-automatonTheoretical Computer ScienceDeterministic pushdown automatonCoalgebraFinal automatonDeterministic automatonQuantum finite automataAutomatitzacióComputer Science::DatabasesMathematicsDiscrete mathematicsNonlinear Sciences::Cellular Automata and Lattice GasesNon-deterministic automatonMobile automatonBisimilarityComputer Science::Programming LanguagesAutomata theoryFormal languageÀlgebraMATEMATICA APLICADAComputer Science::Formal Languages and Automata Theory
researchProduct