Search results for "Mathematica"

showing 10 items of 7971 documents

A marching in space and time solver for the complete 2D shallow water equations. Application to real test cases.

2006

Test caseSpacetimeMathematical analysisSolverShallow water equationsMathematics
researchProduct

Information dynamics: Temporal behavior of uncertainty measures

2008

We carry out a systematic study of uncertainty measures that are generic to dynamical processes of varied origins, provided they induce suitable continuous probability distributions. The major technical tool are the information theory methods and inequalities satisfied by Fisher and Shannon information measures. We focus on a compatibility of these inequalities with the prescribed (deterministic, random or quantum) temporal behavior of pertinent probability densities.

Theoretical computer science03.65.taComputer sciencesmoluchowski processesQC1-999General Physics and AstronomyFOS: Physical sciencesschrödinger picture evolutionInformation theory05.40.jcfisher informationshannon entropyinformation functionalsQuantumCondensed Matter - Statistical MechanicsMathematical Physicsentropy methodsdynamics of probability densitiesQuantum PhysicsStatistical Mechanics (cond-mat.stat-mech)02.50.eyPhysicsMathematical Physics (math-ph)information theoretic inequalitiesCompatibility (mechanics)Probability distributionInformation dynamicsQuantum Physics (quant-ph)
researchProduct

Movie Script Similarity Using Multilayer Network Portrait Divergence

2020

International audience; This paper addresses the question of movie similarity through multilayer graph similarity measures. Recent work has shown how to construct multilayer networks using movie scripts, and how they capture different aspects of the stories. Based on this modeling, we propose to rely on the multilayer structure and compute different similarities, so we may compare movies, not from their visual content, summary, or actors, but actually from their own storyboard. We propose to do so using “portrait divergence”, which has been recently introduced to compute graph distances from summarizing graph characteristics. We illustrate our approach on the series of six Star Wars movies.

Theoretical computer scienceComputer science02 engineering and technologyStar (graph theory)[INFO.INFO-NE]Computer Science [cs]/Neural and Evolutionary Computing [cs.NE]computer.software_genre01 natural sciences010305 fluids & plasmas[INFO.INFO-AI]Computer Science [cs]/Artificial Intelligence [cs.AI]Similarity (network science)[INFO.INFO-LG]Computer Science [cs]/Machine Learning [cs.LG]0103 physical sciences0202 electrical engineering electronic engineering information engineering[INFO]Computer Science [cs]StoryboardDivergence (statistics)Structure (mathematical logic)Network portraitMoviesMultilayer networksNetwork similarity[INFO.INFO-MM]Computer Science [cs]/Multimedia [cs.MM]Construct (python library)Scripting languageGraph (abstract data type)020201 artificial intelligence & image processingcomputer[SPI.SIGNAL]Engineering Sciences [physics]/Signal and Image processing
researchProduct

A model of adaptive decision-making from representation of information environment by quantum fields

2017

We present the mathematical model of decision making (DM) of agents acting in a complex and uncertain environment (combining huge variety of economical, financial, behavioral, and geo-political factors). To describe interaction of agents with it, we apply the formalism of quantum field theory (QTF). Quantum fields are of the purely informational nature. The QFT-model can be treated as a far relative of the expected utility theory, where the role of utility is played by adaptivity to an environment (bath). However, this sort of utility-adaptivity cannot be represented simply as a numerical function. The operator representation in Hilbert space is used and adaptivity is described as in quantu…

Theoretical computer scienceComputer scienceGeneral MathematicsQuantum dynamicsLadderFOS: Physical sciencesGeneral Physics and AstronomyNumber operatorBayesian inference01 natural sciences050105 experimental psychology010305 fluids & plasmasPhysics and Astronomy (all)symbols.namesakeEngineering (all)0103 physical sciencesMathematics (all)0501 psychology and cognitive sciencesQuantum field theoryQuantumMathematical PhysicsGame theoryExpected utility hypothesis05 social sciencesGeneral EngineeringLaw of total probabilityHilbert spaceMathematical Physics (math-ph)ArticlesQuantum BayesianismsymbolsDecision-makingPhilosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences
researchProduct

Efficient evaluation for a subset of recursive queries

1991

Abstract We consider the efficient evaluation of recursive queries in logic databases where the queries are expressed using a Datalog program (function-free Horn-clause program) that contains only regularly or linearly recursive predicates. Using well-known results on graph traversal, we develop an efficient algorithm for evaluating relations defined by a binary-chain program. We also present a transformation by which the evaluation of a subset of queries involving nonbinary relations can be reduced to the evaluation of binary-chain queries. This transformation is guided by the choice of bound arguments in the query, and the bindings are propagated through the program so that in the evaluat…

Theoretical computer scienceComputer scienceLogic0102 computer and information sciences02 engineering and technologycomputer.software_genre01 natural sciencesDatalogSet (abstract data type)020204 information systemsGraph traversal0202 electrical engineering electronic engineering information engineeringComputer Science::Databasescomputer.programming_languageMathematicsDiscrete mathematicsProgramming languageBinary relationEfficient algorithmInformationSystems_DATABASEMANAGEMENT16. Peace & justiceTransformation (function)TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESrestrict010201 computation theory & mathematicscomputerProceedings of the sixth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '87
researchProduct

HOW SMART DOES AN AGENT NEED TO BE?

2005

The classic distributed computation is done by atoms, molecules or spins in vast numbers, each equipped with nothing more than the knowledge of their immediate neighborhood and the rules of statistical mechanics. These agents, 1023 or more, are able to form liquids and solids from gases, realize extremely complex ordered states, such as liquid crystals, and even decode encrypted messages. We will describe a study done for a sensor-array "challenge problem" in which we have based our approach on old-fashioned simulated annealing to accomplish target acquisition and tracking under the rules of statistical mechanics. We believe the many additional constraints that occur in the real problem ca…

Theoretical computer scienceComputer sciencebusiness.industryComputationDistributed computingMulti-agent systemGeneral Physics and AstronomyStatistical and Nonlinear PhysicsStatistical mechanicsEncryptionTarget acquisitionComputer Science ApplicationsNetwork managementComputational Theory and MathematicsSimulated annealingStochastic optimizationbusinessMathematical PhysicsInternational Journal of Modern Physics C
researchProduct

Statistically validated networks in bipartite complex systems.

2011

Many complex systems present an intrinsic bipartite nature and are often described and modeled in terms of networks [1-5]. Examples include movies and actors [1, 2, 4], authors and scientific papers [6-9], email accounts and emails [10], plants and animals that pollinate them [11, 12]. Bipartite networks are often very heterogeneous in the number of relationships that the elements of one set establish with the elements of the other set. When one constructs a projected network with nodes from only one set, the system heterogeneity makes it very difficult to identify preferential links between the elements. Here we introduce an unsupervised method to statistically validate each link of the pr…

Theoretical computer scienceComputer sciencelcsh:MedicineNetwork theorySocial and Behavioral SciencesBioinformaticsQuantitative Biology - Quantitative MethodsSociologyProtein Interaction Mappinglcsh:ScienceQuantitative Methods (q-bio.QM)MultidisciplinarySystems BiologyApplied MathematicsPhysicsStatisticsComplex SystemsGenomicsLink (geometry)Social NetworksSpecialization (logic)Interdisciplinary PhysicsBipartite graphProbability distributionResearch ArticleNetwork analysisPhysics - Physics and SocietyComplex systemFOS: Physical sciencesPhysics and Society (physics.soc-ph)Type (model theory)BiologyModels BiologicalNetwork theory Statistical PhysicsStatistical MechanicsSet (abstract data type)Statistical MethodsBiologyStructure (mathematical logic)Statistical Physicslcsh:RComputational BiologyModels TheoreticalComparative GenomicsSettore FIS/07 - Fisica Applicata(Beni Culturali Ambientali Biol.e Medicin)FOS: Biological sciencesNetwork theorylcsh:QNull hypothesisMathematicsPLoS ONE
researchProduct

Algorithmic Analysis of Programs with Well Quasi-ordered Domains

2000

AbstractOver the past few years increasing research effort has been directed towards the automatic verification of infinite-state systems. This paper is concerned with identifying general mathematical structures which can serve as sufficient conditions for achieving decidability. We present decidability results for a class of systems (called well-structured systems) which consist of a finite control part operating on an infinite data domain. The results assume that the data domain is equipped with a preorder which is a well quasi-ordering, such that the transition relation is “monotonic” (a simulation) with respect to the preorder. We show that the following properties are decidable for wel…

Theoretical computer scienceFinite-state machineReachability problemData domainPreorderPetri netComputer Science ApplicationsTheoretical Computer ScienceDecidabilityComputational Theory and MathematicsReachabilityMathematical structureComputer Science::Formal Languages and Automata TheoryInformation SystemsMathematicsInformation and Computation
researchProduct

Dirac physical measures for generic diffeomorphisms

2016

We prove that, for a $C^1$ generic diffeomorphism, the only Dirac physical measures with dense statistical basin are those supported on sinks.

Theoretical computer scienceGeneral Mathematics[ MATH.MATH-DS ] Mathematics [math]/Dynamical Systems [math.DS]010102 general mathematicsDirac (software)[MATH.MATH-DS]Mathematics [math]/Dynamical Systems [math.DS]Generic diffeomorphismsMSC: 37C05 37C20 37D30Dynamical Systems (math.DS)01 natural sciencesComputer Science ApplicationsPhysical measures0103 physical sciencesFOS: Mathematics010307 mathematical physicsDiffeomorphismMathematics - Dynamical Systems0101 mathematicsPhysics::Atmospheric and Oceanic PhysicsMathematicsMathematical physics
researchProduct

On t-Conorm Based Fuzzy (Pseudo)metrics

2020

We present an alternative approach to the concept of a fuzzy (pseudo)metric using t-conorms instead of t-norms and call them t-conorm based fuzzy (pseudo)metrics or just CB-fuzzy (pseudo)metrics. We develop the basics of the theory of CB-fuzzy (pseudo)metrics and compare them with “classic” fuzzy (pseudo)metrics. A method for construction CB-fuzzy (pseudo)metrics from ordinary metrics is elaborated and topology induced by CB-fuzzy (pseudo)metrics is studied. We establish interrelations between CB-fuzzy metrics and modulars, and in the process of this study, a particular role of Hamacher t-(co)norm in the theory of (CB)-fuzzy metrics is revealed. Finally, an intuitionistic version of a CB-fu…

Theoretical computer scienceLogicComputer scienceMathematics::General MathematicsCB-fuzzy (pseudo)metric02 engineering and technology01 natural sciencesFuzzy logic0202 electrical engineering electronic engineering information engineeringCB-fuzzy (pseudo)metric; archimedian t-(co)norms; hamacher t-(co)norm; modular; modular metric; intuinionistic fuzzy metricsmodular0101 mathematicsMathematical PhysicsAlgebra and Number Theoryintuinionistic fuzzy metricslcsh:Mathematicslcsh:QA1-939010101 applied mathematicsNorm (mathematics)hamacher t-(co)normmodular metric020201 artificial intelligence & image processingGeometry and TopologyComputingMethodologies_GENERALarchimedian t-(co)normsAnalysisAxioms
researchProduct