Search results for "civil"
showing 10 items of 4663 documents
The Arab - Norman civil architecture in Palermo: enhancement strategies
2013
This contribution aims to deepen the knowledge of a historical and artistic heritage of the city of Palermo, i.e. the Arab-Norman civil architecture, yet not adequately utilized, despite its importance as a World Heritage Site'. Within the three royal parks (the Old, the New and the Genoardo), the Norman kings built the palaces of Maredolce, Zisa, Cuba and Scibene, always accompanied by water, both as a lake or as a fishpond, whose purpose was primarily hedonistic as well as productive. The transmission of the architectural heritage to the future presupposes its promotion through the creation of an appropriate strategy helping to spread its knowledge and enjoyment. For example, Sicily has f…
Le bien-fondé de la recevabilité ou de l'irrecevabilité d'une fin de non-recevoir ne relève pas du contrôle du juge de l'annulation de la sentence
2020
International audience; (Civ. 1re, 11 juill. 2019, n° 17-20.423, Sté Damietta International Port Company c/ Sté Archidodron Construction, inédit, D. 2019. 1499 ; ibid. 2435, obs. T. Clay)
L'article 48 du code de procédure civile est inapplicable aux clauses d'arbitrage et la clause d'arbitrage, stipulée dans un contrat d'assurance, n'e…
2019
International audience; (Cass. 5 sept. 2018, n° S 17-13.837, F-D, Soc. RSUI Indemnity Company c/ Soc. Tenergie Developpement et autres, inédit)
L'accès du plaideur impécunieux à la justice arbitrale
2019
International audience; (Civ. 1re, 17 oct. 2018, n° 17-21.411, FD, Soc. Youstina moda c/ Soc. Marex SPA, D. 2018. 2448, obs. T. Clay)
L'impécuniosité de l'une des parties ne rend pas inapplicable la convention d'arbitrage
2018
International audience; (Civ. 1re, 13 juill. 2016, Sté MJA c/ Sté Airbus Hélicoptères, FS- P+B, n° 15-19.389, D. 2016. 1575 ; ibid. 2484, obs. Centre de droit de la concurrence Yves Serra ; ibid. 2589, obs. T. Clay ; Rev. arb. 2016. 859, obs. M. Boucaron-Nardetto)
Arbitrarily shaped plates analysis via Line Element-Less Method (LEM)
2018
Abstract An innovative procedure is introduced for the analysis of arbitrarily shaped thin plates with various boundary conditions and under generic transverse loading conditions. Framed into Line Element-less Method, a truly meshfree method, this novel approach yields the solution in terms of the deflection function in a straightforward manner, without resorting to any discretization, neither in the domain nor on the boundary. Specifically, expressing the deflection function through a series expansion in terms of harmonic polynomials, it is shown that the proposed method requires only the evaluation of line integrals along the boundary parametric equation. Further, minimization of appropri…
L'immunité juridictionnelle de l'arbitre et ses limites
2014
International audience; (Civ. 1re, 15 janvier 2014, n° 11-17.196, FS+B+R+I, A et Sté Consultaudit, D. 2014. 219, obs. X. Delpech ; JCP 2014. 231 et l'avis de Pierre Chevalier, avocat général et l'étude d'Éric Loquin, ibid. 255)
La responsabilité civile des arbitres en cas de dépassement du délai de l'arbitrage
2006
International audience; (Cass. 1re civ., 6 déc. 2005, pourvoi n° 03-13.116, D. 2006, Jur. p. 274, note P.-Y. Gautier ; RTD civ. 2006, p. 144, obs. P. Théry ; J. Paillusseau, L'arbitre responsable du délai d'arbitrage, JCP E, 2006, n° 1395, p. 460 ; G. Chabot, JCP 2006, 1284)
Branch-Price-and-Cut for the Soft-Clustered Capacitated Arc-Routing Problem
2021
The soft-clustered capacitated arc-routing problem (SoftCluCARP) is a variant of the classical capacitated arc-routing problem. The only additional constraint is that the set of required edges, that is, the streets to be serviced, is partitioned into clusters, and feasible routes must respect the soft-cluster constraint, that is, all required edges of the same cluster must be served by the same vehicle. In this article, we design an effective branch-price-and-cut algorithm for the exact solution of the SoftCluCARP. Its new components are a metaheuristic and branch-and-cut-based solvers for the solution of the column-generation subproblem, which is a profitable rural clustered postman tour …
The Windy clustered prize-collecting arc-routing problem
2011
This paper introduces the windy clustered prize-collecting arc-routing problem. It is an arc-routing problem where each demand edge is associated with a profit that is collected once if the edge is serviced, independent of the number of times the edge is traversed. It is further required that if a demand edge is serviced, then all the demand edges of its component are also serviced. A mathematical programming formulation is given and some polyhedral results including several facet-defining and valid inequalities are presented. The separation problem for the different families of inequalities is studied. Numerical results from computational experiments are analyzed. © 2011 INFORMS.