Bibliothek

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
Materialart
Erscheinungszeitraum
Schlagwörter
Sprache
  • 1
    Digitale Medien
    Digitale Medien
    [S.l.] : American Institute of Physics (AIP)
    Physics of Fluids 10 (1998), S. 958-973 
    ISSN: 1089-7666
    Quelle: AIP Digital Archive
    Thema: Physik
    Notizen: The description of turbulent mixing and chemical reactions by Lagrangian probability density function methods offers some significant advantages over other methods, mainly due to the simulation of mixing processes and the exact treatment of chemical transformations. A key problem of such methods is the information on the time scales of processes, because they determine the dynamics and intensity of mixing. This question is considered for stratified flow. Different models are presented for the development of these time scales in time and their stationary spatial patterns in dependence on shear and stratification. The model predictions are shown to be in agreement with large-eddy simulations of stratified homogeneous shear flow. Two further applications of these models are considered: the description of transitions between flow regimes (characterized by different scaling quantities) in the stationary atmospheric surface layer and, second, the simulation of buoyant plume rise. It is shown that the predictions of the stationary frequency model agree with measured data. The consideration of limit cases of this model leads to connections between second-order closure parameters and (critical) flow numbers that characterize these transitions. These relationships are shown to be very advantageous for the application of closure models. A new flow number that characterizes the transition to free convective flow under unstable stratification is introduced here in analogy to the critical gradient Richardson number, which characterizes the onset of turbulence in stably stratified flow. The second application provides a new theory for buoyant plume rise. Two parameters that describe the turbulent mixing in the entrainment and extrainment stages of plume rise are explained as ratios of the relevant time scales. The two-thirds power law of buoyant plume rise, which is observed for nonturbulent and neutrally stratified flow, is obtained without having to make ad hoc assumptions. For turbulent flow, the plume's leveling-off is calculated in accord with measurements. © 1998 American Institute of Physics.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    [S.l.] : American Institute of Physics (AIP)
    Physics of Fluids 9 (1997), S. 703-716 
    ISSN: 1089-7666
    Quelle: AIP Digital Archive
    Thema: Physik
    Notizen: Linear and nonlinear Lagrangian equations are derived for stochastic processes that appear as solutions of the averaged hydrodynamic equations, since their moments satisfy the budgets given by these equations. These equations include the potential temperature, so that non-neutral flows can be described. They will be compared with nonlinear and non-Markovian equations that are obtained using concepts of nonequilibrium statistical mechanics. This approach permits the description of turbulent motion and buoyancy, where memory effects and driving forces with arbitrary colored noise may occur. The equations depend on assumptions that concern the dissipation and pressure redistribution. In the approximations of Kolmogorov and Rotta for these terms, the dissipation time scale remains open, which can be determined by the calculation of the production–dissipation ratio of turbulent kinetic energy. The features of these equations are illustrated by the calculation of turbulent states in the space of invariants. © 1997 American Institute of Physics.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 3
    Digitale Medien
    Digitale Medien
    Springer
    Boundary layer meteorology 81 (1996), S. 147-166 
    ISSN: 1573-1472
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Geologie und Paläontologie , Physik
    Notizen: Abstract Non-Gaussianity effects, first of all the influence of the third and fourth moments of the velocity probability density function, have to be assessed for higher-order closure models of turbulence and Lagrangian modelling of turbulent dispersion in complex flows. Whereas the role and the effects of the third moments are relatively well understood as essential for the explanation of specific observed features of the fully developed convective boundary layer, there are indications that the fourth moments may also be important, but little is known about these moments. Therefore, the effects of non-Gaussianity are considered for the turbulent motion of particles in non-neutral flows without fully developed convection, where the influence of the fourth moments may be expected to be particularly essential. The transport properties of these flows can be characterized by a diffusion coefficient which reflects these effects. It is shown, for different vertical velocity distributions, that the intensity of turbulent transport may be enhanced remarkably by non-Gaussianity. The diffusion coefficient is given as a modification of the Gaussian diffusivity, and this modifying factor is found to be determined to a very good approximation by the normalized fourth moment of the vertical velocity distribution function. This provides better insight into the effect of fourth moments and explains the varying importance of third and fourth moments in different flows.
    Materialart: Digitale Medien
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 4
    Publikationsdatum: 2020-08-05
    Schlagwort(e): ddc:080
    Sprache: Englisch
    Materialart: masterthesis , doc-type:masterThesis
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 5
    Publikationsdatum: 2020-08-05
    Beschreibung: Testing is the process of stimulating a system with inputs in order to reveal hidden parts of the system state. In the case of non-deterministic systems, the difficulty arises that an input pattern can generate several possible outcomes. Some of these outcomes allow to distinguish between different hypotheses about the system state, while others do~not. In this paper, we present a novel approach to find, for non-deterministic systems modeled as constraints over variables, tests that allow to distinguish among the hypotheses as good as possible. The idea is to assess the quality of a test by determining the ratio of distinguishing (good) and not distinguishing (bad) outcomes. This measure refines previous notions proposed in the literature on model-based testing and can be computed using model counting techniques. We propose and analyze a greedy-type algorithm to solve this test optimization problem, using existing model counters as a building block. We give preliminary experimental results of our method, and discuss possible improvements.
    Schlagwort(e): ddc:510
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 6
    Publikationsdatum: 2020-08-05
    Beschreibung: Constraint Integer Programming (CIP) is a generalization of mixed-integer programming (MIP) in the direction of constraint programming (CP) allowing the inference techniques that have traditionally been the core of \P to be integrated with the problem solving techniques that form the core of complete MIP solvers. In this paper, we investigate the application of CIP to scheduling problems that require resource and start-time assignments to satisfy resource capacities. The best current approach to such problems is logic-based Benders decomposition, a manual decomposition method. We present a CIP model and demonstrate that it achieves performance competitive to the decomposition while out-performing the standard MIP and CP formulations.
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 7
    Publikationsdatum: 2022-03-14
    Beschreibung: Pseudo-Boolean problems lie on the border between satisfiability problems, constraint programming, and integer programming. In particular, nonlinear constraints in pseudo-Boolean optimization can be handled by methods arising in these different fields: One can either linearize them and work on a linear programming relaxation or one can treat them directly by propagation. In this paper, we investigate the individual strengths of these approaches and compare their computational performance. Furthermore, we integrate these techniques into a branch-and-cut-and-propagate framework, resulting in an efficient nonlinear pseudo-Boolean solver.
    Schlagwort(e): ddc:510
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 8
    Publikationsdatum: 2020-08-05
    Beschreibung: The steel mill slab design problem from the CSPLib is a binpacking problem that is motivated by an application of the steel industry and that has been widely studied in the constraint programming community. Recently, several people proposed new models and methods to solve this problem. A steel mill slab library was created which contains 380 instances. A closely related binpacking problem called multiple knapsack problem with color constraints, originated from the same industrial problem, were discussed in the integer programming community. In particular, a simple integer programming for this problem has been given by Forrest et al. [3]. The aim of this paper is to bring these different studies together. Moreover, we adopt the model of [3] for the steel mill slab problem. Using a state of the art integer program solver, this model is capable to solve all instances of the steel mill slab library, mostly in less than one second, to optimality. We improved, thereby, the solution value of 76 instances.
    Schlagwort(e): ddc:510
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Format: application/postscript
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 9
    Publikationsdatum: 2020-08-05
    Beschreibung: In cumulative scheduling, conflict analysis seems to be one of the key ingredients to solve such problems efficiently. Thereby, the computational complexity of explanation algorithms plays an important role. Even more when we are faced with a backtracking system where explanations need to be constructed on the fly. In this paper we present extensive computational results to analyze the impact of explanation algorithms for the cumulative constraint in a backward checking system. The considered explanation algorithms differ in their quality and computational complexity. We present results for the domain propagation algorithms time-tabling, edge-finding, and energetic reasoning.
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 10
    Publikationsdatum: 2022-03-14
    Beschreibung: Large neighborhood search (LNS) heuristics are an important component of modern branch-and-cut algorithms for solving mixed-integer linear programs (MIPs). Most of these LNS heuristics use the LP relaxation as the basis for their search, which is a reasonable choice in case of MIPs. However, for more general problem classes, the LP relaxation alone may not contain enough information about the original problem to find feasible solutions with these heuristics, e.g., if the problem is nonlinear or not all constraints are present in the current relaxation. In this paper, we discuss a generic way to extend LNS heuristics that have been developed for MIP to constraint integer programming (CIP), which is a generalization of MIP in the direction of constraint programming (CP). We present computational results of LNS heuristics for three problem classes: mixed-integer quadratically constrained programs, nonlinear pseudo-Boolean optimization instances, and resource-constrained project scheduling problems. Therefore, we have implemented extended versions of the following LNS heuristics in the constraint integer programming framework SCIP: Local Branching, RINS, RENS, Crossover, and DINS. Our results indicate that a generic generalization of LNS heuristics to CIP considerably improves the success rate of these heuristics.
    Sprache: Englisch
    Materialart: reportzib , doc-type:preprint
    Format: application/pdf
    Bibliothek Standort Signatur Band/Heft/Jahr Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...