113 research outputs found
Advances in Modeling Methodology for Agricultural Research
Keynote Lecture
Parameter-Based Estimation of Unknown Reservoir Bathymetry for 2d Dam-Break Modeling
Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchiv
REPRESENTATION OF DAM-BREACH GEOMETRY ON AREGULAR 2-D MESH USING QUADTREE LOCAL MESHREFINEMENT
River hydrodynamicsUnsteady open channel flow and dam brea
Turbidity Currents, Revisited
Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchiv
GMUSTA method for numerical simulation of dam break flow on mobile bed
River hydrodynamicsUnsteady open channel flow and dam brea
Simulations of Wave-Current Interaction using an Integrated Coastal and Estuarine Processes Model
Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchiv
Laboratory Measurements of Dam-Break Flow Using High-Speed Video Capture
Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchiv
ComplexitĂ© et cassage de symĂ©trie pour le problĂšme de la dĂ©ficience dâun graphe
RĂSUMĂ : Une coloration dâarĂȘte dâun graphe G=(V,E) est une fonction c qui assigne un entier c(e) (appelĂ© une couleur) dans {0, 1, 2,...} Ă chaque arĂȘte e dans E de sorte que des couleurs diffĂ©rentes soient assignĂ©es Ă des arĂȘtes adjacentes. Une coloration dâarĂȘte est compacte si les couleurs des arĂȘtes incidentes Ă chaque sommet forment un ensemble dâentiers consĂ©cutifs. Le problĂšme appelĂ© dĂ©ficience consiste Ă dĂ©terminer le nombre minimum dâarĂȘtes pendantes Ă rajouter au graphe pour que le graphe rĂ©sultant ait une coloration dâarĂȘte compacte. Parmi les variations de ce problĂšme, on compte le problĂšme de la coloration dâarĂȘte compacte linĂ©aire (kâLCCP) oĂč il est possible dâutiliser uniquement les k couleurs dans {0, 1, ... , kâ1}, et le problĂšme de la coloration dâarĂȘte compacte cyclique (kâCCCP) oĂč additionnellement la couleur 0 est considĂ©rĂ©e consĂ©cutive Ă la couleur kâ1. Nous proposons une rĂ©duction polynomiale du kâLCCP (optionnellement avec des couleurs imposĂ©es ou interdites sur certaines arĂȘtes) au kâCCCP lorsque kâ„12, et au 12-CCCP lorsque k<12. Nous proposons et comparons Ă©galement la performance de 3 modĂ©lisations en Programmation en Nombres Entiers et un modĂšle en Programmation par Contraintes pour le problĂšme de la dĂ©ficience, et dĂ©terminons le dernier comme Ă©tant le plus appropriĂ© pour ce problĂšme. En raison des symĂ©tries, une instance du problĂšme de dĂ©ficience peut avoir de nombreuses solutions optimales Ă©quivalentes. Nous prĂ©sentons une approche pour gĂ©nĂ©rer un petit ensemble de contraintes, appelĂ©es GAMBLLE, destinĂ©e Ă casser la symĂ©trie, qui peuvent ĂȘtre incorporĂ©es au modĂšle en programmation par contrainte. Les contraintes GAMBLLE sont inspirĂ©es des contraintes de Lex-Leader, basĂ©es sur les automorphismes de graphe, et agissent sur des familles de variables permutables. Nous analysons leur impact sur la rĂ©duction du nombre de solutions optimales, ainsi que le gain de temps obtenu lors de la rĂ©solution dâune modĂ©lisation en programmation par contrainte.----------ABSTRACT : An edge-coloring of a graph G=(V,E) is a function c that assigns an integer c(e) (called color) in {0, 1, 2,...} to every edge e in E so that adjacent edges are assigned different colors. An edge-coloring is compact if the colors of the edges incident to every vertex form a set of consecutive integers. The deficiency problem is to determine the minimum number of pendant edges that must be added to a graph such that the resulting graph admits a compact edge-coloring. Variations of this problem include the linear compact k-edge-coloring problem (kâLCCP) where there are only the k colors of {0, 1, ... , kâ1} available, and the cyclic compact k-edge-coloring problem (kâCCCP) where additionally color 0 is considered consecutive to color kâ1. We demonstrate a polynomial reduction of the kâLCCP (with optionally additional imposed or forbidden colors on some edges) to the kâCCCP when kâ„12, and to the 12âCCCP when k<12. We also propose and compare the performance of three integer programming models and one constraint programming model for the deficiency problem, and determine the latter to be the best suited to model this problem. Because of symmetries, an instance of the deficiency problem can have many equivalent optimal solutions. We present a way to generate a small set of symmetry breaking constraints, called GAMBLLE constraints, that can be added to a constraint programming model. The GAMBLLE constraints are inspired by the Lex-Leader ones, based on automorphisms of graphs, and act on families of permutable variables. We analyze their impact on the reduction of the number of optimal solutions as well as on the speed-up of the constraint programming model
Rainfall Runoff Modeling of Walnut Creek Watershed using Two-dimensional Shallow Water Equations
Source: ICHE Conference Archive - https://mdi-de.baw.de/icheArchiv
Representation of dam-breach geometry on a regular 2-D mesh using quadtree local mesh refinement
River hydrodynamicsUnsteady open channel flow and dam brea
- âŠ