Search results for "Crete"
showing 10 items of 2495 documents
Ultimate Shear of RC Beams with Corroded Stirrups and Strengthened with FRP
2019
Transverse reinforcement plays a key role in the response behavior of reinforced concrete beams. Therefore, corrosion of steel stirrups may change the failure mode of elements from bending to shear, leading to a brittle and catastrophic crisis. It is important to strengthen reinforced concrete beams with corroded stirrups to enhance the shear resistance. This paper presents a formulation, based on the modified compression field theory, to estimate the ultimate shear of reinforced concrete beams strengthened with FRP, because of stirrup corrosion. The detrimental effect of corrosion on steel stirrup yield strength was taken into account by introducing an empirical decay law. The effective st…
Nonlinear Analysis of Beams Reinforced in Shear with Stirrups and Steel Fibers
2012
The modified compression field theory (MCFT) and the disturbed stress field model (DSFM) are often used to predict the nonlinear behavior of reinforced concrete structures. This study presents several extensions of the MCFT and DSFM to the case of high-strength steel fiber-reinforced concrete beams subjected to transverse loads. Experimental four-point bending tests were conducted on 12 concrete beams with a different percentage of fibers and/or stirrups. To validate the updates introduced in the analytical models, numerical analysis was performed using nonlinear finite element software. Modeling of the post-peak softening branch of the tensile and compressive constitutive curves of fibrous…
Experimental Tests and FEM Model for SFRC Beams under Flexural and Shear Loads
2008
The complete load-vs-displacement curves obtained by four-point-bending tests on Steel Fiber Reinforced Concrete (SFRC) beams are predicted by using a nonlinear finite element code based on the Modified Compression Field Theory (MCFT) and the Disturbed Stress Field Model (DSFM) suitably adapted for SFRC elements. The effect of fibers on the shear-flexure response is taken into account, mainly incorporating tensile stress-strain analytical relationship for SFRC. The numerical results show the effectiveness of the model for prediction of the behavior of the tested specimens reinforced with light amount of stirrups or with fibers only. © 2008 American Institute of Physics.
Posets That Locally Resemble Distributive Lattices
2000
Abstract Let P be a graded poset with 0 and 1 and rank at least 3. Assume that every rank 3 interval is a distributive lattice and that, for every interval of rank at least 4, the interval minus its endpoints is connected. It is shown that P is a distributive lattice, thus resolving an issue raised by Stanley. Similar theorems are proven for semimodular, modular, and complemented modular lattices. As a corollary, a theorem of Stanley for Boolean lattices is obtained, as well as a theorem of Grabiner (conjectured by Stanley) for products of chains. Applications to incidence geometry and connections with the theory of buildings are discussed.
FULL MONOIDS AND MAXIMAL CODES
2012
In recent years codes that are not Uniquely Decipherable (UD) were studied partitioning them in classes that localize the ambiguities of the code. A natural question is how we can extend the notion of maximality to codes that are not UD. In this paper we give an answer to this question. To do this we introduce a partial order in the set of submonoids of a free monoid showing the existence, in this poset, of maximal elements that we call full monoids. Then a set of generators of a full monoid is, by definition, a maximal set. We show how this definition extends, in a natural way, the existing definition concerning UD codes and we find a characteristic property of a monoid generated by a max…
CODING PARTITIONS OF REGULAR SETS
2009
A coding partition of a set of words partitions this set into classes such that whenever a sequence, of minimal length, has two distinct factorizations, the words of these factorizations belong to the same class. The canonical coding partition is the finest coding partition that partitions the set of words in at most one unambiguous class and other classes that localize the ambiguities in the factorizations of finite sequences. We prove that the canonical coding partition of a regular set contains a finite number of regular classes and we give an algorithm for computing this partition. From this we derive a canonical decomposition of a regular monoid into a free product of finitely many re…
Artin monoids inject in their groups
2001
We prove that the natural homomorphism from an Artin monoid to its associated Artin group is always injective
Redundant Picard–Fuchs System for Abelian Integrals
2001
We derive an explicit system of Picard-Fuchs differential equations satisfied by Abelian integrals of monomial forms and majorize its coefficients. A peculiar feature of this construction is that the system admitting such explicit majorants, appears only in dimension approximately two times greater than the standard Picard-Fuchs system. The result is used to obtain a partial solution to the tangential Hilbert 16th problem. We establish upper bounds for the number of zeros of arbitrary Abelian integrals on a positive distance from the critical locus. Under the additional assumption that the critical values of the Hamiltonian are distant from each other (after a proper normalization), we were…
Morphometry of Middle Bronze Age palstaves by discrete cosine transform.
2009
9 pages; International audience; The Discrete Cosine Transform (DCT) is a Fourier-related transform widely used in signal processing and well suited to the analysis of open outlines. This method was applied here to evaluate the discrimination power of the inner lateral rib for two palstave populations dating from the Middle Bronze Age, excavated in northwest France. A corpus of almost 400 palstaves (bronze axes) of the Breton and Norman types was processed, and compared to specimens found at Sermizelles in Burgundy. The procedure is robust and produces a discrimination in good agreement with the traditional typology. Besides the definition of a ‘standard' shape for each population, the morp…
Avoiding patterns in irreducible permutations
2016
We explore the classical pattern avoidance question in the case of irreducible permutations, <i>i.e.</i>, those in which there is no index $i$ such that $\sigma (i+1) - \sigma (i)=1$. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary numbers. Also, we present constructive bijections between the set of Motzkin paths of length $n-1$ and the sets of irreducible permutations of length $n$ (respectively fixed point free irreducible involutions of length $2n$) avoiding a pattern $\alpha$ for $\alpha \in \{13…