Search results for "20"

showing 10 items of 37781 documents

Hybrid Equilibrium Finite Element Formulation for Cohesive Crack Propagation

2019

Equilibrium elements have been developed in hybrid formulation with independent equilibrated stress fields on each element. Traction equilibrium condition, at sides between adjacent elements and at sides of free boundary, is enforced by use of independent displacement laws at each side, assumed as Lagrangian parameters. The displacement degrees of freedom belongs to the element side, where an extrinsic interface can be embedded. The embedded interface is defined by the same stress fields of the hybrid equilibrium element and it does not require any additional degrees of freedom. The extrinsic interface is developed in the consistent thermodynamic framework of damage mechanics with internal …

010101 applied mathematics020303 mechanical engineering & transportsMaterials science0203 mechanical engineeringMechanics of MaterialsMechanical EngineeringGeneral Materials ScienceFracture mechanics02 engineering and technologyMechanics0101 mathematics01 natural sciencesFinite element methodKey Engineering Materials
researchProduct

Virtual Element Method: Micro-Mechanics Applications

2019

In this contribution we present an application of the lowest order Virtual Element Method (VEM) to the problem of material computational homogenization. Material homogenization allows retrieving material properties through suitable volume averaging procedures, starting from a detailed representation of the micro-constituents of the considered material. The representation of such microstructure constitutes a remarkable effort in terms of data/mesh preparation, especially when there is not evident microstructural regularity. For such a reason, computational micromechanics may represent a challenging benchmark for showing the potential of VEM. In this contribution, polycrystalline materials ar…

010101 applied mathematics020303 mechanical engineering & transportsMaterials science0203 mechanical engineeringMechanics of MaterialsMechanical EngineeringMechanical engineeringMicromechanicsGeneral Materials Science02 engineering and technology0101 mathematicsElement (category theory)01 natural sciencesKey Engineering Materials
researchProduct

A Model for Low-Cycle Fatigue in Micro-Structured Materials

2019

A microscale formulation for low-cycle fatigue degradation in heterogeneous materials is presented. The interface traction-separation law is modelled by a cohesive zone model for low-cycle fatigue analysis, which is developed in a consistent thermodynamic framework of elastic-plastic-damage mechanics with internal variables. A specific fatigue activation condition allows to model the material degradation related to the elastic-plastic cyclic loading conditions, with tractions levels lower than the static failure condition. A moving endurance surface, in the classic framework of kinematic hardening, enables a pure elastic behaviour without any fatigue degradation for low levels of cyclic tra…

010101 applied mathematics020303 mechanical engineering & transportsMaterials science0203 mechanical engineeringMechanics of MaterialsMechanical EngineeringMicromechanicsGeneral Materials ScienceLow-cycle fatigue02 engineering and technology0101 mathematicsComposite material01 natural sciencesKey Engineering Materials
researchProduct

A Thermodynamically Consistent CZM for Low-Cycle Fatigue Analysis

2018

A cohesive zone model for low-cycle fatigue analysis is developed in a consistent thermodynamic framework of elastic-plastic-damage mechanics with internal variable. A specific fatigue activation condition allows to model the material degradation related to the elastic-plastic cyclic loading conditions, with tractions levels lower than the damage activation condition. A moving endurance surface, in the classic framework of kinematic hardening, enables a pure elastic behavior without any fatigue degradation for low levels loading conditions.

010101 applied mathematics020303 mechanical engineering & transportsMaterials science0203 mechanical engineeringMechanics of MaterialsMechanical EngineeringThermodynamicsGeneral Materials ScienceLow-cycle fatigue02 engineering and technology0101 mathematics01 natural sciencesStrength of materialsKey Engineering Materials
researchProduct

Efficient generation of restricted growth words

2013

A length n restricted growth word is a word w=w"1w"2...w"n over the set of integers where w"1=0 and each w"i, i>1, lies between 0 and the value of a word statistics of the prefix w"1w"2...w"i"-"1 of w, plus one. Restricted growth words simultaneously generalize combinatorial objects as restricted growth functions, staircase words and ascent or binary sequences. Here we give a generic generating algorithm for restricted growth words. It produces a Gray code and runs in constant average time provided that the corresponding statistics has some local properties.

010102 general mathematicsBinary numberValue (computer science)0102 computer and information sciences[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesComputer Science ApplicationsTheoretical Computer SciencePrefixCombinatoricsGray code010201 computation theory & mathematics[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]Signal ProcessingPartial word0101 mathematicsConstant (mathematics)ComputingMilieux_MISCELLANEOUSWord (group theory)Information SystemsMathematicsInformation Processing Letters
researchProduct

Análisis de la utilidad del algoritmo Gradient Boosting Machine (GBM) en la predicción del fracaso empresarial

2018

Este estudio, novedoso en cuanto a la utilizacion de la metodologia basada en la cultura de los algoritmos, prueba la capacidad de la tecnica ‘Gradient Boosting Machine’ (GBM) en la prediccion de l...

010104 statistics & probabilityEconomics and EconometricsAccounting0202 electrical engineering electronic engineering information engineering020201 artificial intelligence & image processing02 engineering and technology0101 mathematics01 natural sciencesFinanceSpanish Journal of Finance and Accounting / Revista Española de Financiación y Contabilidad
researchProduct

Emotions and Digital Delivery Platforms

2021

From the global spread of the infectious disease COVID-19, in Argentina as in other states worldwide, health measures, social emergency, economic and public order measures were taken. One of the main and earliest measures of social order in the face of this disease was the delimitation of a period of population isolation, known as preventive and obligatory social isolation. The compulsory social isolation generated unprecedented growth in the demand for services to the platform economies in Argentina in general and in Buenos Aires in particular, causing the platform delivery activity to be conceived as an essential activity. The purpose of the writing is to explore the configuration of a ce…

010104 statistics & probabilityHistoryCoronavirus disease 2019 (COVID-19)Isolation (health care)0502 economics and business05 social sciencesPandemic0101 mathematicsComputer securitycomputer.software_genre01 natural sciencescomputer050205 econometrics
researchProduct

Adjacency matrices of random digraphs: singularity and anti-concentration

2017

Let ${\mathcal D}_{n,d}$ be the set of all $d$-regular directed graphs on $n$ vertices. Let $G$ be a graph chosen uniformly at random from ${\mathcal D}_{n,d}$ and $M$ be its adjacency matrix. We show that $M$ is invertible with probability at least $1-C\ln^{3} d/\sqrt{d}$ for $C\leq d\leq cn/\ln^2 n$, where $c, C$ are positive absolute constants. To this end, we establish a few properties of $d$-regular directed graphs. One of them, a Littlewood-Offord type anti-concentration property, is of independent interest. Let $J$ be a subset of vertices of $G$ with $|J|\approx n/d$. Let $\delta_i$ be the indicator of the event that the vertex $i$ is connected to $J$ and define $\delta = (\delta_1, …

0102 computer and information sciences01 natural scienceslittlewood–offord theory60C05 60B20 05C80 15B52 46B06law.inventionCombinatoricsSingularityanti-concentrationlawFOS: MathematicsMathematics - CombinatoricsAdjacency matrix0101 mathematicsMathematicsinvertibility of random matricesApplied Mathematics010102 general mathematicsProbability (math.PR)random regular graphsDirected graphsingular probabilityGraphVertex (geometry)Invertible matrix010201 computation theory & mathematicsadjacency matricesCombinatorics (math.CO)Mathematics - ProbabilityAnalysis
researchProduct

Restricted compositions and permutations: from old to new Gray codes

2011

Any Gray code for a set of combinatorial objects defines a total order relation on this set: x is less than y if and only if y occurs after x in the Gray code list. Let @? denote the order relation induced by the classical Gray code for the product set (the natural extension of the Binary Reflected Gray Code to k-ary tuples). The restriction of @? to the set of compositions and bounded compositions gives known Gray codes for those sets. Here we show that @? restricted to the set of bounded compositions of an interval yields still a Gray code. An n-composition of an interval is an n-tuple of integers whose sum lies between two integers; and the set of bounded n-compositions of an interval si…

0102 computer and information sciences02 engineering and technologyInterval (mathematics)[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesTheoretical Computer ScienceCombinatoricsGray codePermutationsymbols.namesakeInteger020204 information systems[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0202 electrical engineering electronic engineering information engineeringComputingMilieux_MISCELLANEOUSMathematicsDiscrete mathematicsExtension (predicate logic)Composition (combinatorics)Cartesian productComputer Science Applications010201 computation theory & mathematicsComputer Science::Computer Vision and Pattern RecognitionBounded functionSignal ProcessingsymbolsInformation Systems
researchProduct

Statistics-preserving bijections between classical and cyclic permutations

2012

Recently, Elizalde (2011) [2] has presented a bijection between the set C"n"+"1 of cyclic permutations on {1,2,...,n+1} and the set of permutations on {1,2,...,n} that preserves the descent set of the first n entries and the set of weak excedances. In this paper, we construct a bijection from C"n"+"1 to S"n that preserves the weak excedance set and that transfers quasi-fixed points into fixed points and left-to-right maxima into themselves. This induces a bijection from the set D"n of derangements to the set C"n"+"1^q of cycles without quasi-fixed points that preserves the weak excedance set. Moreover, we exhibit a kind of discrete continuity between C"n"+"1 and S"n that preserves at each s…

0102 computer and information sciencesFixed point[ MATH.MATH-CO ] Mathematics [math]/Combinatorics [math.CO]01 natural sciencesCombinatorial problemsTheoretical Computer ScienceCyclic permutationSet (abstract data type)CombinatoricsBijections[MATH.MATH-CO]Mathematics [math]/Combinatorics [math.CO]0101 mathematicsComputingMilieux_MISCELLANEOUSMathematicsDescent (mathematics)Discrete mathematicsStatistics on permutationsMathematics::Combinatorics010102 general mathematicsDescentComputer Science ApplicationsDerangement010201 computation theory & mathematicsExcedenceSignal ProcessingBijectionBijection injection and surjectionMaximaInformation Systems
researchProduct