Search results for "algorithm"

showing 10 items of 4887 documents

The intentional stance as structure learning: a computational perspective on mindreading

2015

Recent theories of mindreading explain the recognition of action, intention, and belief of other agents in terms of generative architectures that model the causal relations between observables (e.g., observed movements) and their hidden causes (e.g., action goals and beliefs). Two kinds of probabilistic generative schemes have been proposed in cognitive science and robotics that link to a "theory theory" and "simulation theory" of mindreading, respectively. The former compares perceived actions to optimal plans derived from rationality principles and conceptual theories of others' minds. The latter reuses one's own internal (inverse and forward) models for action execution to perform a look…

General Computer ScienceRationalityIntentionModels PsychologicalRecognition (Psychology)050105 experimental psychologyStructure learning03 medical and health sciences0302 clinical medicineMindreadingTheory-theoryHumansLearning0501 psychology and cognitive sciencesComputer SimulationCausal modelCognitive scienceSettore ING-INF/05 - Sistemi Di Elaborazione Delle Informazionibusiness.industry05 social sciencesComputer Science (all)Recognition PsychologySimulated realityAlgorithmIntentional stanceGenerative modelOnline learningFolk psychologyArtificial intelligencebusinessPsychology030217 neurology & neurosurgeryGenerative grammarAlgorithmsGenerative modelIntentional stanceHumanBiotechnology
researchProduct

An efficient method for fully automatic 3D digitization of unknown objects

2013

Our goal is to develop a complete and automatic scanning strategy with minimum prior information about the object shape. We aim to establish a methodology for the automation of the 3D digitization process. The paper presents a novel approach to determine the Next Best View (NBV) for an efficient reconstruction of highly accurate 3D models. Our method is based on the classification of the acquired surfaces into Well Visible and Barely Visible combined with a best view selection algorithm based on mean shift, which avoids unreachable positions. Our approach is applicable to all kinds of range sensors. To prove the efficiency and the robustness of our method, test objects are first scanned man…

General Computer Sciencebusiness.industryComputer science3D reconstructionGeneral Engineering[INFO.INFO-CV]Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]020207 software engineeringRanging02 engineering and technology[ INFO.INFO-CV ] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Automation[INFO.INFO-CV] Computer Science [cs]/Computer Vision and Pattern Recognition [cs.CV]Robustness (computer science)Fully automatic0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processingComputer visionMean-shiftArtificial intelligencebusinessSelection algorithmDigitization
researchProduct

A framework for assessing frequency domain causality in physiological time series with instantaneous effects.

2013

We present an approach for the quantification of directional relations in multiple time series exhibiting significant zero-lag interactions. To overcome the limitations of the traditional multivariate autoregressive (MVAR) modelling of multiple series, we introduce an extended MVAR (eMVAR) framework allowing either exclusive consideration of time-lagged effects according to the classic notion of Granger causality, or consideration of combined instantaneous and lagged effects according to an extended causality definition. The spectral representation of the eMVAR model is exploited to derive novel frequency domain causality measures that generalize to the case of instantaneous effects the kno…

General MathematicsGeneral Physics and AstronomyModels BiologicalCausality (physics)Physics and Astronomy (all)Engineering (all)Granger causalityEconometricsMathematics (all)Coherence (signal processing)AnimalsHumansComputer SimulationDirected coherenceMathematicsMultivariate autoregressive modelModels StatisticalSeries (mathematics)Partial directed coherenceGeneral EngineeringSystem identificationAC powerAutoregressive modelFrequency domainSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaGranger causalityDirected coherence; Granger causality; Multivariate autoregressive models; Partial directed coherence; Mathematics (all); Engineering (all); Physics and Astronomy (all)AlgorithmsPhilosophical transactions. Series A, Mathematical, physical, and engineering sciences
researchProduct

Extending the spectral decomposition of Granger causality to include instantaneous influences: application to the control mechanisms of heart rate va…

2021

Assessing Granger causality (GC) intended as the influence, in terms of reduction of variance of surprise, that a driver variable exerts on a given target, requires a suitable treatment of ‘instantaneous’ effects, i.e. influences due to interactions whose time scale is much faster than the time resolution of the measurements, due to unobserved confounders or insufficient sampling rate that cannot be increased because the mechanism of generation of the variable is inherently slow (e.g. the heartbeat). We exploit a recently proposed framework for the estimation of causal influences in the spectral domain and include instantaneous interactions in the modelling, thus obtaining (i) a novel index…

General MathematicsGeneral Physics and AstronomyVector autoregressionMatrix decompositionCausality (physics)granger causalityGranger causalityHeart RateEconometricsvector autoregressionMedicine and Health SciencesHeart rate variabilitycardiorespiratory systemComputer SimulationTime seriesMathematicsinformation theoryGeneral Engineeringheart rate variabilityVariance (accounting)BaroreflexScience Generalspectral analysisCausalityVariable (computer science)Mathematics and Statisticstime series analysisAlgorithmsPhilosophical transactions. Series A, Mathematical, physical, and engineering sciences
researchProduct

Fundamental isomorphism theorems for quantum groups

2017

The lattice of subgroups of a group is the subject of numerous results revolving around the central theme of decomposing the group into "chunks" (subquotients) that can then be compared to one another in various ways. Examples of results in this class would be the Noether isomorphism theorems, Zassenhaus' butterfly lemma, the Schreier refinement theorem for subnormal series of subgroups, the Dedekind modularity law, and last but not least the Jordan-H\"older theorem. We discuss analogues of the above-mentioned results in the context of locally compact quantum groups and linearly reductive quantum groups. The nature of the two cases is different: the former is operator algebraic and the latt…

General MathematicsGroup Theory (math.GR)01 natural sciences0103 physical sciencesMathematics - Quantum AlgebraQuantum no-deleting theoremFOS: MathematicsQuantum Algebra (math.QA)Compact quantum groupLocally compact space0101 mathematicsOperator Algebras (math.OA)MathematicsZassenhaus lemmaLocally compact quantum group010102 general mathematicsMathematics - Operator AlgebrasFunctional Analysis (math.FA)AlgebraMathematics - Functional Analysis46L89 46L85 46L52 16T20 20G42Isomorphism theoremQuantum algorithmSchreier refinement theorem010307 mathematical physicsMathematics - Group Theory
researchProduct

Real quadrics in C n , complex manifolds and convex polytopes

2006

In this paper, we investigate the topology of a class of non-Kähler compact complex manifolds generalizing that of Hopf and Calabi-Eckmann manifolds. These manifolds are diffeomorphic to special systems of real quadrics Cn which are invariant with respect to the natural action of the real torus (S1)n onto Cn. The quotient space is a simple convex polytope. The problem reduces thus to the study of the topology of certain real algebraic sets and can be handled using combinatorial results on convex polytopes. We prove that the homology groups of these compact complex manifolds can have arbitrary amount of torsion so that their topology is extremely rich. We also resolve an associated wall-cros…

General MathematicsHolomorphic functionSubspace arrangementsPolytope52C35Combinatorics52B05Ricci-flat manifoldTheoryofComputation_ANALYSISOFALGORITHMSANDPROBLEMCOMPLEXITYConvex polytopeComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONMathematics::Symplectic Geometry32Q55Mathematics32M17Equivariant surgeryTopology of non-Kähler compact complex manifoldsMathematics::Geometric TopologyManifoldAffine complex manifoldsMathematics::Differential GeometryDiffeomorphismComplex manifoldCombinatorics of convex polytopesSingular homologyReal quadrics
researchProduct

Algorithms for permutability in finite groups

2013

In this paper we describe some algorithms to identify permutable and Sylow-permutable subgroups of finite groups, Dedekind and Iwasawa finite groups, and finite T-groups (groups in which normality is transitive), PT-groups (groups in which permutability is transitive), and PST-groups (groups in which Sylow permutability is transitive). These algorithms have been implemented in a package for the computer algebra system GAP.

General MathematicsS-permutable subgroupIwasawa groups-permutable subgrouppermutable subgroupiwasawa groupdedekind grouppt-group20-04CombinatoricsMathematics::Group TheoryT-grouppst-groupT-groupQA1-93920d10MathematicsFinite groupDedekind groupMathematics::CombinatoricsalgorithmGroup (mathematics)Sylow theoremsGrups Teoria deDedekind groupAlgorithmt-groupPST-groupIwasawa groupfinite groupPermutable subgroup [Finite group]Classification of finite simple groupsCA-groupPT-groupÀlgebraFinite group: Permutable subgroupMATEMATICA APLICADAAlgorithm20d20MathematicsOpen Mathematics
researchProduct

Minimal forbidden patterns of multi-dimensional shifts

2005

We study whether the entropy (or growth rate) of minimal forbidden patterns of symbolic dynamical shifts of dimension 2 or more, is a conjugacy invariant. We prove that the entropy of minimal forbidden patterns is a conjugacy invariant for uniformly semi-strongly irreducible shifts. We prove a weaker invariant in the general case.

General Mathematics[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS][INFO.INFO-DS] Computer Science [cs]/Data Structures and Algorithms [cs.DS]020206 networking & telecommunications0102 computer and information sciences02 engineering and technology01 natural sciencesCombinatoricsConjugacy class010201 computation theory & mathematics0202 electrical engineering electronic engineering information engineeringMulti dimensionalComputingMilieux_MISCELLANEOUSMathematics
researchProduct

Large-scale calculations of excitation energies in coupled cluster theory: The singlet excited states of benzene

1996

Algorithms for calculating singlet excitation energies in the coupled cluster singles and doubles (CCSD) model are discussed and an implementation of an atomic-integral direct algorithm is presented. Each excitation energy is calculated at a cost comparable to that of the CCSD ground-state energy. Singlet excitation energies are calculated for benzene using up to 432 basis functions. Basis-set effects of the order of 0.2 eV are observed when the basis is increased from augmented polarized valence double-zeta (aug-cc-pVDZ) to augmented polarized valence triple-zeta (aug-cc-pVTZ) quality. The correlation problem is examined by performing calculations in the hierarchy of coupled cluster models…

General Physics and AstronomyElectronic structurePhysics and Astronomy (all)Physics::Atomic and Molecular ClustersSinglet statePhysical and Theoretical Chemistry:FÍSICA::Química física [UNESCO]Calculation MethodsValence (chemistry)TripletsElectronic correlationChemistryBenzeneExcited StatesConfiguration interactionUNESCO::FÍSICA::Química físicaConfiguration InteractionCoupled clusterElectronic StructureExcited stateElectron CorrelationBenzene ; Excited States ; Calculation Methods ; Algorithms ; Triplets ; Electronic Structure ; Configuration Interaction ; Correlation Functions ; Electron CorrelationAtomic physicsCorrelation FunctionsExcitationAlgorithms
researchProduct

Excited states of the water molecule: Analysis of the valence and Rydberg character

2008

The excited states of the water molecule have been analyzed by using the extended quantum-chemical multistate CASPT2 method, namely, MS-CASPT2, in conjunction with large one-electron basis sets of atomic natural orbital type. The study includes 13 singlet and triplet excited states, both valence and 3s-, 3p-, and 3d-members of the Rydberg series converging to the lowest ionization potential and the 3s- and 3p-Rydberg members converging to the second low-lying state of the cation, 1 math. The research has been focused on the analysis of the valence or Rydberg character of the low-lying states. The computation of the 1 math state of water at different geometries indicates that it has a predom…

General Physics and AstronomyElectronssymbols.namesakeAb initio quantum chemistry methodsMoleculePhysics::Atomic PhysicsSinglet statePhysical and Theoretical Chemistry:FÍSICA::Química física [UNESCO]Valence (chemistry)ChemistryAb initio calculations ; Molecular configurations ; Orbital calculations ; Quantum chemistry ; Rydberg states ; SCF calculations ; Valency ; WaterValencyWaterRydberg statesMolecular configurationsUNESCO::FÍSICA::Química físicaOrbital calculationsExcited stateRydberg atomRydberg formulasymbolsQuantum TheorySCF calculationsAb initio calculationsIonization energyAtomic physicsQuantum chemistryAlgorithmsThe Journal of Chemical Physics
researchProduct