Filters








122 Hits in 8.5 sec

The OpenModelica Integrated Environment for Modeling, Simulation, and Model-Based Development

Peter Fritzson, Adrian Pop, Karim Abdelhak, Adeel Ashgar, Bernhard Bachmann, Willi Braun, Daniel Bouskela, Robert Braun, Lena Buffoni, Francesco Casella, Rodrigo Castro, Rüdiger Franke (+15 others)
2020 Modeling, Identification and Control  
The environment is based on the equation-based object-oriented Modelica language and currently uses the MetaModelica extended version of Modelica for its model compiler implementation.  ...  Python, Julia, and Matlab; efficient simulation and co-simulation of FMI-based models; compilation for embedded systems; Modelica-UML integration; requirement verification; and generation of parallel code  ...  The development of Spoken Tutorials and text-book companions was funded by the Ministry of Education, Govt. of India, through a grant given to FOSSEE and Spoken Tutorial projects.  ... 
doi:10.4173/mic.2020.4.1 fatcat:dwy2tmx7gzhflj2bm3yew3pzpy

Finding All Pure-Strategy Equilibria in Games with Continuous Strategies

Kenneth L. Judd, Philipp J. Renner, Karl H. Schmedders
2010 Social Science Research Network  
Moreover, we apply these techniques to two stochastic dynamic games of industry competition and check for equilibrium uniqueness. for helpful discussions on the subject.  ...  We are very grateful to Jonathan Hauenstein for providing us with many details on the software package Bertini and his patient explanations of the underlying mathematical theory.  ...  Therefore, if we focus only on the nonsingular solutions, we have 358 × 4510 = 1,614,580 paths to track when we combine the two subsystems via a parameter continuation homotopy.  ... 
doi:10.2139/ssrn.1703417 fatcat:nu4sttydszcwncwzc6b7h3qw34

Finding all pure-strategy equilibria in games with continuous strategies

Kenneth L. Judd, Philipp Renner, Karl Schmedders
2012 Quantitative Economics  
Moreover, we apply these techniques to two stochastic dynamic games of industry competition and check for equilibrium uniqueness. for helpful discussions on the subject.  ...  We are very grateful to Jonathan Hauenstein for providing us with many details on the software package Bertini and his patient explanations of the underlying mathematical theory.  ...  Therefore, if we focus only on the nonsingular solutions, we have 358 × 4510 = 1,614,580 paths to track when we combine the two subsystems via a parameter continuation homotopy.  ... 
doi:10.3982/qe165 fatcat:bzxj7ousybdobkvbahdv7ymf2a

Persistent Homology for Path Planning in Uncertain Environments

Subhrajit Bhattacharya, Robert Ghrist, Vijay Kumar
2015 IEEE Transactions on robotics  
We address the fundamental problem of goal-directed path planning in an uncertain environment represented as a probability (of occupancy) map.  ...  We instead suggest a persistent homology approach to the problem -a topological approach in which we seek the homology class of trajectories that is most persistent for the given probability map.  ...  via the homology classes in U α ∪ U β .  ... 
doi:10.1109/tro.2015.2412051 fatcat:4mynpdhonfagvdjvlt4juexdx4

On the algebraicK-theory of higher categories

Clark Barwick
2016 Journal of Topology  
Using this, we give new, higher categorical proofs of both the additivity and fibration theorems of Waldhausen.  ...  As applications of this technology, we study the algebraic K-theory of associative ring spectra and spectral Deligne-Mumford stacks.  ...  There are a lot of people to thank. Without the foundational  ... 
doi:10.1112/jtopol/jtv042 fatcat:fs3aimwjo5dm3gbrysbxogzi5u

Multiprecision path tracking [article]

Daniel J. Bates, Andrew J. Sommese, Charles W. Wampler
2006 arXiv   pre-print
The behavior of the method is illustrated on several examples arising as homotopies for solving systems of polynomial equations.  ...  By adjusting the level of precision in accordance with the numerical conditioning of the path, the algorithm achieves high reliability with less computational cost than would be incurred by raising precision  ...  model as one of its parameters is varied.  ... 
arXiv:math/0605105v1 fatcat:c5fmenu24jcvxnphkvu47hnoua

Lectures on Factorization Homology, Infinity-Categories, and Topological Field Theories [article]

Araminta Amabel, Artem Kalmykov, Lukas Müller, Hiro Lee Tanaka
2019 arXiv   pre-print
The target audience was imagined to be graduate students who are not homotopy theorists.  ...  These are notes from an informal mini-course on factorization homology, infinity-categories, and topological field theories.  ...  One declares a vertex to be a smooth embedding : −→ . One declares an edge to be the data of a smooth embedding × Δ 1 −→ × Δ 1 which respects the projection to Δ 1 .  ... 
arXiv:1907.00066v1 fatcat:l6kynk6r25d2dp5qpqoxeg64dq

Special issue on information reuse and integration

2007 IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)  
Learners were evaluated using analysis of variance models based on their performance as the level of injected noise, the number of attributes with noise, and the percentage of minority instances containing  ...  Based on our results, we recommend using the random forest ensemble learning technique for building classification models from software measurement data, regardless of the quality and class distribution  ...  Maria Ganzha, for her consideration of this paper. Acknowledgement The author would like to thank Szymon Grabowski and Jakub Swacha for suggestions of possible improvements.  ... 
doi:10.1109/tsmcb.2007.912701 fatcat:xvhlaf4m3vhcdb2cicqtfrug6m

Beyond Simulation: Computer Aided Control System Design using Equation-based Object-oriented Modelling for the Next Decade

Francesco Casella, Filippo Donida, Marco Lovera
2009 SNE Simulation Notes Europe  
, automatic derivation of simplified transfer functions, automatic derivation of LFT models, automatic generation of inverse models for robotic systems, and support for nonlinear model predictive control  ...  Following a brief review of the current state of the art in this field, the paper presents some proposals for future developments: open model exchange formats, automatic model-order reduction techniques  ...  Exchange formats for model equations and for simulation data should probably be based on the XML language, for several reasons: • the tree structure of XML documents easily allows to represent complex  ... 
doi:10.11128/sne.19.tn.09925 fatcat:km5vq2effjct5gxj3qm5gzr3he

Adaptive Multiprecision Path Tracking

Daniel J. Bates, Jonathan D. Hauenstein, Andrew J. Sommese, Charles W. Wampler
2008 SIAM Journal on Numerical Analysis  
We then test the relative merits of reactive and proactive adaptation on several examples arising as homotopies for solving systems of polynomial equations.  ...  In current practice, one must either choose a conservatively large numerical precision at the outset or re-run paths multiple times in successively higher precision until success is achieved.  ...  model as one of its parameters is varied.  ... 
doi:10.1137/060658862 fatcat:e3b4beazfve5vbzivxrmzpsurm

Twisted Spin cobordism and positive scalar curvature [article]

Fabian Hebestreit, Michael Joachim
2017 arXiv   pre-print
We show how a suitably twisted Spin-cobordism spectrum connects to the question of existence of metrics of positive scalar curvature on closed, smooth manifolds by building on fundamental work of Gromov  ...  Along the way we also describe the mod 2-cohomology of various twisted, connective covers of real K-theory.  ...  via the unit of a commutative multiplication on KO.  ... 
arXiv:1311.3164v3 fatcat:5q73tgsa75eovkxo3v35ug7mj4

Mixture Components Inference for Sparse Regression: Introduction and Application for Estimation of Neuronal Signal from fMRI BOLD [article]

Anna Pidnebesna and Iveta Fajnerova and Jiri Horacek and Jaroslav Hlinka
2022 arXiv   pre-print
This is mainly due to the avoidance of overfitting and underfitting that commonly plague the solutions based on sparse regression combined with model selection methods, including the corrected Akaike Information  ...  Namely, their ensemble provides a first approximation of probability of activation at each time-point, and together with the conditional neuronal activity distributions estimated with the theory of mixtures  ...  We thank David Tomeček for sample fMRI data and Jessica Barilone for helping with language and style editing.  ... 
arXiv:2203.07209v1 fatcat:mol5xg3j3fc2xdfe5xjevegyxa

Path Planning Technologies for Autonomous Underwater Vehicles-A Review

Daoliang Li, Peng Wang, Ling Du
2019 IEEE Access  
Challenges exist in terms of online obstacle avoidance, three-dimensional environment path planning, and the robustness of the algorithms.  ...  The most prominent feature of this paper is to summarize the improvement methods of various technical shortcomings and improve the original methods, such as dynamic obstacle avoidance, optimization path  ...  ACKNOWLEDGMENT The authors would like to thank American Journal Experts for providing an English-language edit of this article.  ... 
doi:10.1109/access.2018.2888617 fatcat:hmqygjyavbcx3nl6ydhgqvg7cm

American society of heating, refrigerating and air-conditioning engineers

1979 International journal of refrigeration  
This makes it difficult to understand and improve the implemented models, also for the original developers.  ...  Among them are: algebraic solution techniques, field models, implementation form and languages, equation based model description languages, modelling language translatability, and access to foreign subroutine  ...  ACKNOWLEDGEMENTS The basic ideas behind the NMF came forth during a series of discussions at the Swedish Institute of Applied Mathematics. The authors have merely put it all on paper.  ... 
doi:10.1016/0140-7007(79)90114-2 fatcat:dv7t2mpik5hldkifohlu3yvhay

Newton polytopes and numerical algebraic geometry [article]

Taylor Brysiewicz
2020 arXiv   pre-print
The first algorithm we develop functions as a numerical oracle for the Newton polytope of a hypersurface and is based on ideas of Hauenstein and Sottile.  ...  Based on recent results of Esterov, we give an algorithm which recursively solves a sparse polynomial system when the support of that system is either lacunary or triangular.  ...  : under any probability measure on the space C × C of choices for γ in (6.5), the probability that γ is chosen so that H(τ γ (t); x) is a homotopy is one.  ... 
arXiv:2004.12177v1 fatcat:mfkodyanyrhctorz5aseri7j7y
« Previous Showing results 1 — 15 out of 122 results