Search results for "algebra"

showing 10 items of 4129 documents

Solid-State Lighting: Simple, Fast, Bright, and Stable Light Sources (Adv. Mater. 7/2012)

2012

Solid-state lightingOpticsMaterials scienceMechanics of Materialsbusiness.industrySimple (abstract algebra)lawMechanical EngineeringOptoelectronicsGeneral Materials Sciencebusinesslaw.inventionAdvanced Materials
researchProduct

Cover Picture: Solvent-Adaptive Behavior of Oligospirobifluorenes at the Surface of Quartz Crystal Microbalances-A Conformational Process (ChemPlusCh…

2017

SolventCrystalMaterials scienceMolecular recognitionChemical physicsScientific methodSolvationCover (algebra)General ChemistryQuartz crystal microbalanceQuartzChemPlusChem
researchProduct

Inside Back Cover: Ultrafast Solvent-Assisted Electronic Level Crossing in 1-Naphthol (Angew. Chem. Int. Ed. 27/2013)

2013

Solventchemistry.chemical_compoundchemistry1-NaphtholElectronic levelCover (algebra)General ChemistryPhotochemistryFemtochemistryUltrashort pulseCatalysisAngewandte Chemie International Edition
researchProduct

Quantum counter automata

2011

The question of whether quantum real-time one-counter automata (rtQ1CAs) can outperform their probabilistic counterparts has been open for more than a decade. We provide an affirmative answer to this question, by demonstrating a non-context-free language that can be recognized with perfect soundness by a rtQ1CA. This is the first demonstration of the superiority of a quantum model to the corresponding classical one in the real-time case with an error bound less than 1. We also introduce a generalization of the rtQ1CA, the quantum one-way one-counter automaton (1Q1CA), and show that they too are superior to the corresponding family of probabilistic machines. For this purpose, we provide gene…

SoundnessFOS: Computer and information sciencesQuantum PhysicsGeneralizationComputer scienceProbabilistic logicFOS: Physical sciences0102 computer and information sciences02 engineering and technologyComputational Complexity (cs.CC)01 natural sciencesAutomatonAlgebraComputer Science - Computational Complexity010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Quantum finite automata020201 artificial intelligence & image processingPoint (geometry)Quantum Physics (quant-ph)Quantum
researchProduct

Implementation of the full explicitly correlated coupled-cluster singles and doubles model CCSD-F12 with optimally reduced auxiliary basis dependence.

2008

An implementation of the full explicitly correlated coupled-cluster singles and doubles model CCSD-F12 using a single Slater-type geminal has been obtained with the aid of automated term generation and evaluation techniques. In contrast to a previously reported computer code [T. Shiozaki et al., J. Chem. Phys. 129, 071101 (2008)], our implementation features a reduced dependence on the auxiliary basis set due to the use of a reformulated evaluation of the so-called Z-intermediate rather than straight forward insertion of an auxiliary basis expansion, which allows an unambiguous comparison to more approximate CCSD-F12 models. First benchmark results for total correlation energies and reactio…

Source codeGeminalBasis (linear algebra)Chemistrymedia_common.quotation_subjectGeneral Physics and AstronomyTerm (time)Coupled clusterBenchmark (computing)Applied mathematicsTotal correlationPhysical and Theoretical ChemistryAtomic physicsBasis setmedia_commonThe Journal of chemical physics
researchProduct

Topology of correlation-based minimal spanning trees in real and model markets

2003

We present here a topological characterization of the minimal spanning tree that can be obtained by considering the price return correlations of stocks traded in a financial market. We compare the minimal spanning tree obtained from a large group of stocks traded at the New York Stock Exchange during a 12-year trading period with the one obtained from surrogated data simulated by using simple market models. We find that the empirical tree has features of a complex network that cannot be reproduced, even as a first approximation, by a random market model and by the one-factor model.

Spanning treeStatistical Mechanics (cond-mat.stat-mech)FOS: Physical sciencesTopology (electrical circuits)Complex networkMinimum spanning treeTopologyTree (graph theory)Settore FIS/02 - Fisica Teorica Modelli e Metodi MatematiciCorrelationStock exchangeSimple (abstract algebra)Condensed Matter - Statistical MechanicsMathematics
researchProduct

2018

Electrocardiographic imaging (ECGI) strongly relies on a priori assumptions and additional information to overcome ill-posedness. The major challenge of obtaining good reconstructions consists in finding ways to add information that effectively restricts the solution space without violating properties of the sought solution. In this work, we attempt to address this problem by constructing a spatio-temporal basis of body surface potentials (BSP) from simulations of many focal excitations. Measured BSPs are projected onto this basis and reconstructions are expressed as linear combinations of corresponding transmembrane voltage (TMV) basis vectors. The novel method was applied to simulations o…

Spatial correlationFocus (geometry)Basis (linear algebra)GeodesicPhysiology0206 medical engineering02 engineering and technology030204 cardiovascular system & hematologyInverse problem020601 biomedical engineeringCorrelation03 medical and health sciences0302 clinical medicinePhysiology (medical)A priori and a posterioriLinear combinationAlgorithmMathematicsFrontiers in Physiology
researchProduct

Variable fractional Fourier processor: a simple implementation

1997

A new set of optical implementations of the fractional Fourier transform (FRT) is developed by use of Wigner matrix algebra. The reinterpretation of some elementary operations that synthesize a rotation in the phase-space domain allows us to propose a lensless setup for obtaining the FRT. This compact configuration is also very flexible, because the fractional degree of the transformation can be varied continuously by shifting the input and the output planes along the optical axis by proper amounts. The above results permit one to build an optical FRT processor formed by two FRT systems in cascade, with a spatial filter between them. We present the design of such a variable FRT processor, w…

Spatial filterbusiness.industryComputer scienceTopologyAtomic and Molecular Physics and OpticsFractional Fourier transformElectronic Optical and Magnetic Materialslaw.inventionLens (optics)Optical axissymbols.namesakeFourier transformOpticsTransformation (function)CascadelawMathematics::Quantum AlgebrasymbolsComputer Vision and Pattern RecognitionbusinessRotation (mathematics)Journal of the Optical Society of America A
researchProduct

Salient Pixels and Dimensionality Reduction for Display of Multi/Hyperspectral Images

2012

International audience; Dimensionality Reduction (DR) of spectral images is a common approach to different purposes such as visualization, noise removal or compression. Most methods such as PCA or band selection use either the entire population of pixels or a uniformly sampled subset in order to compute a projection matrix. By doing so, spatial information is not accurately handled and all the objects contained in the scene are given the same emphasis. Nonetheless, it is possible to focus the DR on the separation of specific Objects of Interest (OoI), simply by neglecting all the others. In PCA for instance, instead of using the variance of the scene in each spectral channel, we show that i…

Spectral Images[ INFO.INFO-TS ] Computer Science [cs]/Signal and Image ProcessingChannel (digital image)Computer scienceMultispectral image0211 other engineering and technologiesComputingMethodologies_IMAGEPROCESSINGANDCOMPUTERVISION02 engineering and technology[ SPI.SIGNAL ] Engineering Sciences [physics]/Signal and Image processingProjection (linear algebra)[INFO.INFO-TS]Computer Science [cs]/Signal and Image Processing0202 electrical engineering electronic engineering information engineeringIAPRComputer vision021101 geological & geomatics engineeringSaliencyPixelbusiness.industryDimensionality reductionHyperspectral imagingPattern recognitionDimensionality reductionVisualizationComputer Science::Computer Vision and Pattern Recognition020201 artificial intelligence & image processingArtificial intelligenceFocus (optics)business[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
researchProduct

30 years of finite-gap integration theory

2007

The method of finite-gap integration was created to solve the periodic KdV initial problem. Its development during last 30 years, combining the spectral theory of differential and difference operators with periodic coefficients, the algebraic geometry of compact Riemann surfaces and their Jacobians, the Riemann theta functions and inverse problems, had a strong impact on the evolution of modern mathematics and theoretical physics. This article explains some of the principal historical points in the creation of this method during the period 1973–1976, and briefly comments on its evolution during the last 30 years.

Spectral theoryGeneral MathematicsRiemann surfaceMathematical analysisGeneral EngineeringGeneral Physics and AstronomyTheta functionAlgebraic geometryInverse problemAlgebraRiemann hypothesissymbols.namesakesymbolsKorteweg–de Vries equationDifferential (mathematics)MathematicsPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
researchProduct