885 resultados para Systems Simulation
Resumo:
Die erzielbare Fördergeschwindigkeit bei Vibrationsförderern hängt maßgeblich von der Bewegungsfunktion des Förderorganes ab. Für die gezielte Simulation dieser Anlagen mittels der diskreten Elemente Methode (DEM) ist es notwendig die geometrisch vernetzen Förderorgannachbildungen mit praxisrelevanten Bewegungsfunktionen zu beaufschlagen. Der Artikel beschreibt die Einbindung dieser Bewegungsfunktionen in die quellenoffene DEM-Software LIGGGHTS. Während des Simulationsprozesses wird eine Bewegung vernetzter CAD-Modelle durch trigonometrische Reihen ermöglicht.
Resumo:
Nutzfahrzeuge müssen oft durch sehr unebenes Gelände gefahren werden. In diesem Fall wird der Fahrer starken Vibrationen ausgesetzt, die von der Fahrzeugkarosserie durch die Sitzaufhängung auf ihn wirken. Um diese Schwingungen zu verringern, werden die Sitzaufhängungen in der Regel mit Feder-Dämpfer-Systemen ausgerüstet. Jedoch erreichen die passiven Systeme vor allem bei niederfrequenten Schwingungen ihre physikalischen Grenzen. Eine wesentliche Verbesserung des Sitzkomforts kann unter solchen Anregungsbedingungen nur mit einer aktiven Sitzaufhängung erreicht werden. In diesem Beitrag wird ein neuartiges aktives System für die Sitzaufhängung auf Basis von elektrorheologischen Flüssigkeiten vorgestellt. Außerdem werden die theoretischen Grundlagen für die Modellierung der beschriebenen aktiven Sitzaufhängung dargestellt. Anschließend werden die Simulationsergebnisse mit den Messergebnissen unter realen Betriebsbedingungen verglichen. Die Repräsentation der Ergebnisse mit Hilfe der im Bereich der Sitztechnik weit verbreiteten SEAT-Werten (Seat Effective Amplitude Transmissibility) zeigt das Potenzial des entwickelten Systems zur aktiven Reduktion der Schwingungsbelastung des Fahrers und ermöglicht seine objektive Bewertung.
Resumo:
Energy efficiency has become an important research topic in intralogistics. Especially in this field the focus is placed on automated storage and retrieval systems (AS/RS) utilizing stacker cranes as these systems are widespread and consume a significant portion of the total energy demand of intralogistical systems. Numerical simulation models were developed to calculate the energy demand rather precisely for discrete single and dual command cycles. Unfortunately these simulation models are not suitable to perform fast calculations to determine a mean energy demand value of a complete storage aisle. For this purpose analytical approaches would be more convenient but until now analytical approaches only deliver results for certain configurations. In particular, for commonly used stacker cranes equipped with an intermediate circuit connection within their drive configuration there is no analytical approach available to calculate the mean energy demand. This article should address this research gap and present a calculation approach which enables planners to quickly calculate the energy demand of these systems.
Resumo:
Simulation techniques are almost indispensable in the analysis of complex systems. Materials- and related information flow processes in logistics often possess such complexity. Further problem arise as the processes change over time and pose a Big Data problem as well. To cope with these issues adaptive simulations are more and more frequently used. This paper presents a few relevant advanced simulation models and intro-duces a novel model structure, which unifies modelling of geometrical relations and time processes. This way the process structure and their geometric relations can be handled in a well understandable and transparent way. Capabilities and applicability of the model is also presented via a demonstrational example.
Resumo:
Using ultracold alkaline-earth atoms in optical lattices, we construct a quantum simulator for U(N) and SU(N) lattice gauge theories with fermionic matter based on quantum link models. These systems share qualitative features with QCD, including chiral symmetry breaking and restoration at nonzero temperature or baryon density. Unlike classical simulations, a quantum simulator does not suffer from sign problems and can address the corresponding chiral dynamics in real time.
Resumo:
With the observation that stochasticity is important in biological systems, chemical kinetics have begun to receive wider interest. While the use of Monte Carlo discrete event simulations most accurately capture the variability of molecular species, they become computationally costly for complex reaction-diffusion systems with large populations of molecules. On the other hand, continuous time models are computationally efficient but they fail to capture any variability in the molecular species. In this study a hybrid stochastic approach is introduced for simulating reaction-diffusion systems. We developed an adaptive partitioning strategy in which processes with high frequency are simulated with deterministic rate-based equations, and those with low frequency using the exact stochastic algorithm of Gillespie. Therefore the stochastic behavior of cellular pathways is preserved while being able to apply it to large populations of molecules. We describe our method and demonstrate its accuracy and efficiency compared with the Gillespie algorithm for two different systems. First, a model of intracellular viral kinetics with two steady states and second, a compartmental model of the postsynaptic spine head for studying the dynamics of Ca+2 and NMDA receptors.
Resumo:
The development of electrophoretic computer models and their use for simulation of electrophoretic processes has increased significantly during the last few years. Recently, GENTRANS and SIMUL5 were extended with algorithms that describe chemical equilibria between solutes and a buffer additive in a fast 1:1 interaction process, an approach that enables simulation of the electrophoretic separation of enantiomers. For acidic cationic systems with sodium and H3 0(+) as leading and terminating components, respectively, acetic acid as counter component, charged weak bases as samples, and a neutral CD as chiral selector, the new codes were used to investigate the dynamics of isotachophoretic adjustment of enantiomers, enantiomer separation, boundaries between enantiomers and between an enantiomer and a buffer constituent of like charge, and zone stability. The impact of leader pH, selector concentration, free mobility of the weak base, mobilities of the formed complexes and complexation constants could thereby be elucidated. For selected examples with methadone enantiomers as analytes and (2-hydroxypropyl)-β-CD as selector, simulated zone patterns were found to compare well with those monitored experimentally in capillary setups with two conductivity detectors or an absorbance and a conductivity detector. Simulation represents an elegant way to provide insight into the formation of isotachophoretic boundaries and zone stability in presence of complexation equilibria in a hitherto inaccessible way.
Resumo:
GENTRANS, a comprehensive one-dimensional dynamic simulator for electrophoretic separations and transport, was extended for handling electrokinetic chiral separations with a neutral ligand. The code can be employed to study the 1:1 interaction of monovalent weak and strong acids and bases with a single monovalent weak or strong acid or base additive, including a neutral cyclodextrin, under real experimental conditions. It is a tool to investigate the dynamics of chiral separations and to provide insight into the buffer systems used in chiral capillary zone electrophoresis (CZE) and chiral isotachophoresis. Analyte stacking across conductivity and buffer additive gradients, changes of additive concentration, buffer component concentration, pH, and conductivity across migrating sample zones and peaks, and the formation and migration of system peaks can thereby be investigated in a hitherto inaccessible way. For model systems with charged weak bases and neutral modified β-cyclodextrins at acidic pH, for which complexation constants, ionic mobilities, and mobilities of selector-analyte complexes have been determined by CZE, simulated and experimentally determined electropherograms and isotachopherograms are shown to be in good agreement. Simulation data reveal that CZE separations of cationic enantiomers performed in phosphate buffers at low pH occur behind a fast cationic migrating system peak that has a small impact on the buffer composition under which enantiomeric separation takes place.
Resumo:
We use quantum link models to construct a quantum simulator for U(N) and SU(N) lattice gauge theories. These models replace Wilson’s classical link variables by quantum link operators, reducing the link Hilbert space to a finite number of dimensions. We show how to embody these quantum link models with fermionic matter with ultracold alkaline-earth atoms using optical lattices. Unlike classical simulations, a quantum simulator does not suffer from sign problems and can thus address the corresponding dynamics in real time. Using exact diagonalization results we show that these systems share qualitative features with QCD, including chiral symmetry breaking and we study the expansion of a chirally restored region in space in real time.
Resumo:
Cloud Computing has evolved to become an enabler for delivering access to large scale distributed applications running on managed network-connected computing systems. This makes possible hosting Distributed Enterprise Information Systems (dEISs) in cloud environments, while enforcing strict performance and quality of service requirements, defined using Service Level Agreements (SLAs). {SLAs} define the performance boundaries of distributed applications, and are enforced by a cloud management system (CMS) dynamically allocating the available computing resources to the cloud services. We present two novel VM-scaling algorithms focused on dEIS systems, which optimally detect most appropriate scaling conditions using performance-models of distributed applications derived from constant-workload benchmarks, together with SLA-specified performance constraints. We simulate the VM-scaling algorithms in a cloud simulator and compare against trace-based performance models of dEISs. We compare a total of three SLA-based VM-scaling algorithms (one using prediction mechanisms) based on a real-world application scenario involving a large variable number of users. Our results show that it is beneficial to use autoregressive predictive SLA-driven scaling algorithms in cloud management systems for guaranteeing performance invariants of distributed cloud applications, as opposed to using only reactive SLA-based VM-scaling algorithms.
Resumo:
N. Bostrom’s simulation argument and two additional assumptions imply that we are likely to live in a computer simulation. The argument is based upon the following assumption about the workings of realistic brain simulations: The hardware of a computer on which a brain simulation is run bears a close analogy to the brain itself. To inquire whether this is so, I analyze how computer simulations trace processes in their targets. I describe simulations as fictional, mathematical, pictorial, and material models. Even though the computer hardware does provide a material model of the target, this does not suffice to underwrite the simulation argument because the ways in which parts of the computer hardware interact during simulations do not resemble the ways in which neurons interact in the brain. Further, there are computer simulations of all kinds of systems, and it would be unreasonable to infer that some computers display consciousness just because they simulate brains rather than, say, galaxies.
Resumo:
The traditional Newton method for solving nonlinear operator equations in Banach spaces is discussed within the context of the continuous Newton method. This setting makes it possible to interpret the Newton method as a discrete dynamical system and thereby to cast it in the framework of an adaptive step size control procedure. In so doing, our goal is to reduce the chaotic behavior of the original method without losing its quadratic convergence property close to the roots. The performance of the modified scheme is illustrated with various examples from algebraic and differential equations.