1,558 research outputs found
Numerical simulations of strong wind situations near the Mediteranean French Coast: comparison with FETCH data
No full textA detailed analysis is made of some typical strong wind situations near the French Mediterranean coast. Special attention has been paid to the wind from the north-northwest in the Gulf of Lion, also called the mistral. The analysis is made from both the synoptic and mesoscale point of view with the aid of numerical simulations carried out with the Regional Atmospheric Modeling System (RAMS) to study the main atmospheric, climatic, and meteorological characteristics of this wind in the Gulf of Lion. Simulations were made with this model during the periods of 20-22 March and 24-26 March 1998. Afterward, a comparison was made with the meteorological measurements collected during the international Flux, Etat de la Mer et Te´le´de´tection en Condition de Fetch Variable (FETCH) campaign (Gulf of Lion, March-April 1998). The comparison between the simulated wind fields and the values measured by the coastal meteorological stations, an oceanographic buoy, and the ship Atalante at sea help to give full understanding of the complicated physical processes that characterize strong wind situations in coastal zone
The Global Art Gallery Report with Richard Taittinger, Magnus Resch, Stefania Bortolami, and James Fuentes
No full textModerator: Magnus Resch Book Author and Art Entrepreneur
Panelists:
Stefania Bortolami, Gallery Owner
James Fuentes, Gallery Owner
Richard Taittinger, Gallery Owner
The Global Art Gallery Report is the first and the most wide-ranging report on today\u27s commercial art galleries. Published by Phaidon, it is the first insight of its kind, presenting a detailed and comprehensive portrait of today\u27s gallery scene. In a panel discussion, Magnus Resch will discuss his findings with gallerists Jeffrey Deitch, Stefania Bortolami and James Fuentes. Panelists will shine a light on the future of the art gallery.
Founded in 1969, the Sotheby’s Institute of Art is the first and foremost graduate school for the study of art and its markets. With more than 6,000 alumni working internationally in art fairs, galleries, museums, auction houses, and nonprofits, the Institute’s alumni are shaping the future of the art industry. Past guest speakers at the Institute have included artists, such as: Ulay and Jaša, Dan Graham, Alexandre Singh, Glenn Ligon, Sanford Biggers, Carolee Schneemann, Dara Birnbaum, Alfredo Jaar, Ahmed Alsoudani; and art industry experts from Sotheby’s, Art Basel, Paddle8, Auctionata, Armory Show, Artsy, Whitney Museum, Swiss Institute, MoMA, and others.https://digitalcommons.sia.edu/speaker/1007/thumbnail.jp
Ron Resch: patrones de doblado. El diseño topológico desde la geometría computarizada
No full textEl doblez proyectado es indisoluble de la geometría que lo hace posible. Para establecer un claro control sobre el doblez es necesario realizar un documento proyectivo, un plano. Es por eso que los asuntos ligados a la geometría y al control matemático de los patrones de doblado han sido siempre fundamentales en la construcción de este tipo de diseños. Nos acercamos aquí a uno de los principales referentes y precursores sobre el estudio y desarrollo de los patrones de doblado para fines volumétricos, Ron Resch. Se trata de un desconocido artista y científico computacional norteamericano cuyo trabajo se menciona de modo repetido cuando se habla de arquitectos contemporáneos como Greg Lynn, quien ha aplicado también el uso del ordenador como herramienta de control y desarrollo geométrico. Para situar el momento, veremos el trabajo didáctico de Josef Albers y su manera de “abrir los ojos” mediante la experiencia con la manipulación restringida de la materia. El trabajo de Ron Resch establece una manera científica de aproximarse al problema y de aplicar las por aquel entonces incipientes herramientas computacionales, como son la elaboración de modelos 3D o la utilización de maquinaria CNC para el corte o el marcado. Los sistemas topológicos de Resch son en gran medida el origen de lo que hoy es el diseño paramétrico y la arquitectura de desarrollo con ordenadores
Optimally rescheduling jobs with a Last-In-First-Out buffer
No full textThis paper considers single-machine scheduling problems in which a given solution, i.e., an ordered set of jobs, has to be improved as much as possible by re-sequencing the jobs. The need for rescheduling may arise in different contexts, e.g., due to changes in the job data or because of the local objective in a stage of a supply chain that is not aligned with the given sequence. A common production setting entails the movement of jobs (or parts) on a conveyor. This is reflected in our model by facilitating the re-sequencing of jobs via a buffer of limited capacity accessible by a LIFO policy. We consider the classical objective functions of total weighted completion time, maximum lateness and (weighted) number of late jobs and study their complexity. For three of these problems, we present strictly polynomial-time dynamic programming algorithms, while for the case of minimizing the weighted number of late jobs NP-hardness is proven and a pseudo-polynomial algorithm is given
Linear Pyrazole‐bridged Tetra(N‐heterocyclic carbene) Ligands and Their Hexanuclear Silver(I) Complexes
No full textAlgorithms for rescheduling jobs with a LIFO buffer to minimize the weighted number of late jobs
No full textRescheduling can help to improve the quality of a schedule with respect to an initially given sequence. In this paper, we consider the possibility of rescheduling jobs arriving for processing at a single machine under the following limitations: (a) jobs can only be moved toward the end of the schedule and not toward the front, and (b) when a job is taken out of the sequence, it is put on a buffer of limited capacity before being reinserted in its new position closer to the end of the sequence. The buffer is organized as a stack with a last-in/first-out policy. As an objective function, we consider the minimization of the weighted number of late jobs. For this NP-hard problem, we first provide two different integer linear programming (ILP) formulations. Furthermore, we develop a branch-and-bound algorithm with a branching rule based on the movement of jobs. Then a new pseudo-polynomial dynamic programming algorithm is presented which utilizes dominance criteria and an efficient handling of states. Our computational experiments with up to 100 jobs show that this algorithm performs remarkably well and can be seen as the current method of choice
Importance of correcting wind input for wave simulations: analysis of a Mistral event in the French Mediterranean Coastal Zone
No full text
- …
