Search results for "Computation"

showing 10 items of 7362 documents

FT Raman and DFT Study on a Series of All-antiOligothienoacenes End-Capped with Triisopropylsilyl Groups

2009

minal a positions. These substituents aid in purification and solution processability, and can be removed under mild chemical conditions. For the first time, we have the opportunity to analyze a series of oligothienoacenes to gain insight into the fundamental structure–property relationships with respect to the addition of each ring. Furthermore, this series of compounds can be directly compared to other well-studied series of closely related oligomers, such as nonfused oligothiophenes and fully fused all-syn oligothienoacenes. [7] To gain precise insight into relationships between the structure and properties of a wide range of p-conjugated molecular Herein, we study the p-conjugational pr…

Atomic and Molecular Physics and OpticsHomologous serieschemistry.chemical_compoundsymbols.namesakeCrystallographyVibronic couplingchemistryComputational chemistryMolecular vibrationsymbolsThiopheneMolecular orbitalPhysical and Theoretical ChemistryRaman spectroscopyHOMO/LUMORaman scatteringChemPhysChem
researchProduct

3-Vinyl-1H-indoles: A conformational study, electronic aspects and reactivity predictions forDiels-Alder reactions

1995

On the basis of X-ray geometries, a theoretical conformational study of some 3-vinyl-1H-indoles was performed with quantum chemistry and molecular mechanics programs. Charge, frontier orbitals, and the molecular electrostatic potential derived from quantum chemistry calculations of 3-vinyl-1H-indoles are reliable reactivity parameters to predict the outcome of theDiels-Alder reaction.

Atomic orbitalComputational chemistryChemistryPhysical organic chemistryCharge (physics)Reactivity (chemistry)General ChemistryMolecular mechanicsQuantum chemistryMonatshefte f�r Chemie Chemical Monthly
researchProduct

Meaning and magnitude of the reduced density matrix cumulants

2012

Abstract Within the framework of a generalized normal ordering (GNO), invented by Mukherjee [1] , the reduced density matrix cumulants of the (multiconfigurational) reference wave function play a central role, as they arise directly from the contraction rules. The extended Wick theorem allows contractions of an arbitrary number of active annihilators and creators through a cumulant of corresponding rank. Because the cumulant rank truncates naturally only at the number of active spin orbitals, practical applications of the GNO concept seem to rely on a fast convergence of the cumulant series, allowing one to neglect cumulants with high rank. By computing cumulant norms for selected systems (…

Atomic orbitalExponential growthComputational chemistryChemistryGeneral Physics and AstronomySinglet stateReduced density matrixStatistical physicsElectronPhysical and Theoretical ChemistryEdgeworth seriesNotationCumulantChemical Physics
researchProduct

Dissociative adsorption of water on Au/MgO/Ag(001) from first principles calculations

2015

Abstract The molecular and dissociative adsorption of water on a Ag-supported 1 ML, 2 ML and 3 ML-a six atomic layer-thick MgO films with a single Au adatom is investigated using density functional theory calculations. The obtained results are compared to a bulk MgO(001) surface with an Au atom. On thin films the negatively charged Au strengthens the binding of the polar water molecule due to the attractive Au–H interaction. The adsorption energy trends of OH and H with respect to the film thickness depend on an adsorption site. In the case OH or H binds atop Au on MgO/Ag(001), the adsorption becomes more exothermic with the increasing film thickness, while the reverse trend is seen when th…

Au adatomsExothermic reactionta114Chemistrydissociation of waterSurfaces and InterfacesDFT calculationsCondensed Matter PhysicsRedoxSurfaces Coatings and FilmsAdsorptionComputational chemistryAtomMaterials ChemistryCoulombadsorption of waterMoleculePhysical chemistryDensity functional theoryThin filmta116Ag-supported MgO thin filmsSurface Science
researchProduct

Adaptive Mid-Term Representations for Robust Audio Event Classification

2018

Low-level audio features are commonly used in many audio analysis tasks, such as audio scene classification or acoustic event detection. Due to the variable length of audio signals, it is a common approach to create fixed-length feature vectors consisting of a set of statistics that summarize the temporal variability of such short-term features. To avoid the loss of temporal information, the audio event can be divided into a set of mid-term segments or texture windows. However, such an approach requires to estimate accurately the onset and offset times of the audio events in order to obtain a robust mid-term statistical description of their temporal evolution. This paper proposes the use of…

Audio signalAcoustics and UltrasonicsComputer sciencebusiness.industryFeature vectorPattern recognition01 natural sciences030507 speech-language pathology & audiology03 medical and health sciencesComputational MathematicsNonlinear systemFraming (construction)Acoustic event detection0103 physical sciencesAudio analyzerComputer Science (miscellaneous)SegmentationArtificial intelligenceElectrical and Electronic Engineering0305 other medical sciencebusiness010301 acousticsTemporal informationIEEE/ACM Transactions on Audio, Speech, and Language Processing
researchProduct

Enabling Real-Time Computation of Psycho-Acoustic Parameters in Acoustic Sensors Using Convolutional Neural Networks

2020

Sensor networks have become an extremely useful tool for monitoring and analysing many aspects of our daily lives. Noise pollution levels are very important today, especially in cities where the number of inhabitants and disturbing sounds are constantly increasing. Psycho-acoustic parameters are a fundamental tool for assessing the degree of discomfort produced by different sounds and, combined with wireless acoustic sensor networks (WASNs), could enable, for example, the efficient implementation of acoustic discomfort maps within smart cities. However, the continuous monitoring of psycho-acoustic parameters to create time-dependent discomfort maps requires a high computational demand that …

Audio signalComputer scienceNoise pollutionbusiness.industryComputation010401 analytical chemistryReal-time computing01 natural sciencesConvolutional neural network0104 chemical sciencesWirelessElectrical and Electronic EngineeringbusinessInstrumentationWireless sensor networkIEEE Sensors Journal
researchProduct

Fuzzy Fusion in Multimodal Biometric Systems

2007

Multimodal authentication systems represent an emerging trend for information security. These systems could replace conventional mono-modal biometric methods using two or more features for robust biometric authentication tasks. They employ unique combinations of measurable physical characteristics: fingerprint, facial features, iris of the eye, voice print, hand geometry, vein patterns, and so on. Since these traits are hardly imitable by other persons, the aim of these multibiometric systems is to achieve a high reliability to determine or verify person's identity. In this paper a multimodal biometric system using two different fingerprints is proposed. The matching module integrates fuzzy…

AuthenticationBiometricsComputational geometryData fusionFeature extractionSecurity of dataSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazioni
researchProduct

Multitasking in Driving as Optimal Adaptation Under Uncertainty

2021

Objective The objective was to better understand how people adapt multitasking behavior when circumstances in driving change and how safe versus unsafe behaviors emerge. Background Multitasking strategies in driving adapt to changes in the task environment, but the cognitive mechanisms of this adaptation are not well known. Missing is a unifying account to explain the joint contribution of task constraints, goals, cognitive capabilities, and beliefs about the driving environment. Method We model the driver’s decision to deploy visual attention as a stochastic sequential decision-making problem and propose hierarchical reinforcement learning as a computationally tractable solution to it. The…

Automobile Drivingreinforcement learningComputer sciencevisuaalinen ympäristöHuman Factors and Ergonomicshuomiokyky050105 experimental psychologyBehavioral NeuroscienceCognitionHuman–computer interactiondrivingHumansHuman multitaskingReinforcement learning0501 psychology and cognitive sciencesajotapamultitaskingAdaptation (computer science)050107 human factorsApplied Psychologycomputational rationalitykuljettajattask interleaving05 social sciencesUncertaintyliikennekäyttäytyminenAutomobile drivingkognitiiviset prosessithavainnot
researchProduct

A NEW COMPLEXITY FUNCTION FOR WORDS BASED ON PERIODICITY

2013

Motivated by the extension of the critical factorization theorem to infinite words, we study the (local) periodicity function, i.e. the function that, for any position in a word, gives the size of the shortest square centered in that position. We prove that this function characterizes any binary word up to exchange of letters. We then introduce a new complexity function for words (the periodicity complexity) that, for any position in the word, gives the average value of the periodicity function up to that position. The new complexity function is independent from the other commonly used complexity measures as, for instance, the factor complexity. Indeed, whereas any infinite word with bound…

Average-case complexityDiscrete mathematicsFibonacci numberSettore INF/01 - InformaticaGeneral Mathematicscomplexity functionComputer Science::Computation and Language (Computational Linguistics and Natural Language and Speech Processing)Function (mathematics)periodicitycritical factorization theoremCombinatoricsComplexity indexCombinatorics on wordsBounded functionComplexity functionComputer Science::Formal Languages and Automata TheoryWord (computer architecture)Combinatorics on wordMathematicsInternational Journal of Algebra and Computation
researchProduct

Learning-Graph-Based Quantum Algorithm for k-distinctness

2012

We present a quantum algorithm solving the $k$-distinctness problem in $O(n^{1-2^{k-2}/(2^k-1)})$ queries with a bounded error. This improves the previous $O(n^{k/(k+1)})$-query algorithm by Ambainis. The construction uses a modified learning graph approach. Compared to the recent paper by Belovs and Lee arXiv:1108.3022, the algorithm doesn't require any prior information on the input, and the complexity analysis is much simpler. Additionally, we introduce an $O(\sqrt{n}\alpha^{1/6})$ algorithm for the graph collision problem where $\alpha$ is the independence number of the graph.

Average-case complexityQuantum PhysicsTheoretical computer scienceComputational complexity theoryWorst-case complexityGraph (abstract data type)FOS: Physical sciencesQuantum algorithmSimon's problemQuantum Physics (quant-ph)Time complexityMathematicsQuantum complexity theory
researchProduct