222 resultados para Eutectoid decompositions
Resumo:
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Resumo:
The eutectoid transformation may be defined as a solid-state diffusion-controlled decomposition process of a high-temperature phase into a two-phase lamellar aggregate behind a migrating boundary on cooling below the eutectoid temperature. In substitutional solid solutions, the eutectoid reaction involves diffusion of the solute atoms either through the matrix or along the boundaries or ledges. The effect of Ag on the non-isothermal kinetics of the reverse eutectoid reaction in the Cu-9 mass%Al, Cu-10 mass%Al, and Cu-11 mass%Al alloys were studied using differential scanning calorimetry (DSC), X-ray diffraction (XRD), and scanning electron microscopy (SEM). The activation energy for this reaction was obtained using the Kissinger and Ozawa methods. The results indicated that Ag additions to Cu-Al alloys interfere on the reverse eutectoid reaction, increasing the activation energy values for the Cu-9 mass%Al and Cu-10 mass%Al alloys and decreasing these values for the Cu-11 mass%Al alloy for additions up to 6 mass%Ag. The changes in the activation energy were attributed to changes in the reaction solute and in Ag solubility due to the increase in Al content.
Resumo:
The kinetics of eutectoid decomposition beta(1)' --> gamma(2) + (alpha + gamma(2)) in Cu-12.86 wt% Al and Cu-12.84 wt% Al-1.98 wt% Ag alloys was studied by hardness measurements, using the Johnson-Mehl-Avrami equation. The results indicate that the presence of silver seems to influence the nucleation rate and the activation energy of the reaction.
Resumo:
This paper investigates the major similarities and discrepancies of three important current decompositions proposed for the interpretation of unbalanced and/or non linear three-phase four-wire circuits. The considered approaches were the so-called FBD Theory, the pq-Theory and the CPT. Although the methods are based on different concepts, the results obtained under ideal conditions (sinusoidal and balanced signals) are very similar. The main differences appear in the presence of unbalanced and non linear load conditions. It will be demonstrated and discussed how the choice of the voltage referential and the return conductor impedance can influence in the resulting current components, as well as, the way of interpreting a power circuit with return conductor. Under linear unbalanced conditions, both FBD and pq-Theory suggest that the some current components contain a third-order harmonic. Besides, neither pq-Theory nor FBD method are able to provide accurate information for reactive current under unbalanced and distorted conditions, what seems to be done by means of the CPT. © 2009 IEEE.
Resumo:
This paper investigates the major similarities and discrepancies among three important current decompositions proposed for the interpretation of unbalanced and/or non linear three-phase four-wire power circuits. The considered approaches were the so-called FBD Theory, the pq-Theory and the CPT. Although the methods are based on different concepts, the results obtained under ideal conditions (sinusoidal and balanced signals) are very similar. The main differences appear in the presence of unbalanced and non linear load conditions. It will be demonstrated and discussed how the choice of the voltage referential and the return conductor impedance can influence in the resulting current components, as well as, the way of interpreting a power circuit with return conductor. Under linear unbalanced conditions, both FBD and pq-Theory suggest that the some current components contain a third-order harmonic. Besides, neither pq-Theory nor FBD method are able to provide accurate information for reactive current under unbalanced and distorted conditions, what can be done by means of the CPT. © 2009 IEEE.
Resumo:
Chapter 1 introduces the tools and mechanics necessary for this report. Basic definitions and topics of graph theory which pertain to the report and discussion of automorphic decompositions will be covered in brief detail. An automorphic decomposition D of a graph H by a graph G is a G-decomposition of H such that the intersection of graph (D) @H. H is called the automorhpic host, and G is the automorphic divisor. We seek to find classes of graphs that are automorphic divisors, specifically ones generated cyclically. Chapter 2 discusses the previous work done mainly by Beeler. It also discusses and gives in more detail examples of automorphic decompositions of graphs. Chapter 2 also discusses labelings and their direct relation to cyclic automorphic decompositions. We show basic classes of graphs, such as cycles, that are known to have certain labelings, and show that they also are automorphic divisors. In Chapter 3, we are concerned with 2-regular graphs, in particular rCm, r copies of the m-cycle. We seek to show that rCm has a ρ-labeling, and thus is an automorphic divisor for all r and m. we discuss methods including Skolem type difference sets to create cycle systems and their correlation to automorphic decompositions. In the Appendix, we give classes of graphs known to be graceful and our java code to generate ρ-labelings on rCm.
Resumo:
A k-cycle decomposition of order n is a partition of the edges of the complete graph on n vertices into k-cycles. In this report a backtracking algorithm is developed to count the number of inequivalent k-cycle decompositions of order n.
Resumo:
In 1969, Lovasz asked whether every connected, vertex-transitive graph has a Hamilton path. This question has generated a considerable amount of interest, yet remains vastly open. To date, there exist no known connected, vertex-transitive graph that does not possess a Hamilton path. For the Cayley graphs, a subclass of vertex-transitive graphs, the following conjecture was made: Weak Lovász Conjecture: Every nontrivial, finite, connected Cayley graph is hamiltonian. The Chen-Quimpo Theorem proves that Cayley graphs on abelian groups flourish with Hamilton cycles, thus prompting Alspach to make the following conjecture: Alspach Conjecture: Every 2k-regular, connected Cayley graph on a finite abelian group has a Hamilton decomposition. Alspach’s conjecture is true for k = 1 and 2, but even the case k = 3 is still open. It is this case that this thesis addresses. Chapters 1–3 give introductory material and past work on the conjecture. Chapter 3 investigates the relationship between 6-regular Cayley graphs and associated quotient graphs. A proof of Alspach’s conjecture is given for the odd order case when k = 3. Chapter 4 provides a proof of the conjecture for even order graphs with 3-element connection sets that have an element generating a subgroup of index 2, and having a linear dependency among the other generators. Chapter 5 shows that if Γ = Cay(A, {s1, s2, s3}) is a connected, 6-regular, abelian Cayley graph of even order, and for some1 ≤ i ≤ 3, Δi = Cay(A/(si), {sj1 , sj2}) is 4-regular, and Δi ≄ Cay(ℤ3, {1, 1}), then Γ has a Hamilton decomposition. Alternatively stated, if Γ = Cay(A, S) is a connected, 6-regular, abelian Cayley graph of even order, then Γ has a Hamilton decomposition if S has no involutions, and for some s ∈ S, Cay(A/(s), S) is 4-regular, and of order at least 4. Finally, the Appendices give computational data resulting from C and MAGMA programs used to generate Hamilton decompositions of certain non-isomorphic Cayley graphs on low order abelian groups.
Resumo:
The effects of the temperature and stretching levels used in the stress-relieving treatment of cold-drawn eutectoid steel wires are evaluated with the aim of improving the stress relaxation behavior and the resistance to hydrogen embrittlement. Five industrial treatments are studied, combining three temperatures (330, 400, and 460 °C) and three stretching levels (38, 50 and 64% of the rupture load). The change of the residual stress produced by the treatments is taken into consideration to account for the results. Surface residual stresses allow us to explain the time to failure in standard hydrogen embrittlement tests
Resumo:
We show the existence of sets with n points (n ? 4) for which every convex decomposition contains more than (35/32)n?(3/2) polygons,which refutes the conjecture that for every set of n points there is a convex decomposition with at most n+C polygons. For sets having exactly three extreme pointswe show that more than n+sqr(2(n ? 3))?4 polygons may be necessary to form a convex decomposition.
Resumo:
We work with Besov spaces Bp,q0,b defined by means of differences, with zero classical smoothness and logarithmic smoothness with exponent b. We characterize Bp,q0,b by means of Fourier-analytical decompositions, wavelets and semi-groups. We also compare those results with the well-known characterizations for classical Besov spaces Bp,qs.
Resumo:
The transitions and reactions involved in the thermal treatment of several commercial azodicarbonamides (ADC) in an inert atmosphere have been studied by dynamic thermogravimetry analysis (TGA), mass spectrometry and Fourier transform infrared (FTIR) spectroscopy. A pseudo-mechanistic model, involving several competitive and non-competitive reactions, has been suggested and applied to the correlation of the weight loss data. The model applied is capable of accurately representing the different processes involved, and can be of great interest in the understanding and quantification of such phenomena, including the simulation of the instantaneous amount of gases evolved in a foaming process. In addition, a brief discussion on the methodology related to the mathematical modeling of TGA data is presented, taking into account the complex thermal behaviour of the ADC.
Resumo:
Given the results from two regressions (one for each of two groups), decompose computes several decompositions of the outcome variable differential. The decompositions shows how much of the gap is due to differing endowments between the two groups, and how much is due to discrimination. Usually this is applied to wage differentials using Mincer type earnings equations.
Resumo:
The FANOVA (or “Sobol’-Hoeffding”) decomposition of multivariate functions has been used for high-dimensional model representation and global sensitivity analysis. When the objective function f has no simple analytic form and is costly to evaluate, computing FANOVA terms may be unaffordable due to numerical integration costs. Several approximate approaches relying on Gaussian random field (GRF) models have been proposed to alleviate these costs, where f is substituted by a (kriging) predictor or by conditional simulations. Here we focus on FANOVA decompositions of GRF sample paths, and we notably introduce an associated kernel decomposition into 4 d 4d terms called KANOVA. An interpretation in terms of tensor product projections is obtained, and it is shown that projected kernels control both the sparsity of GRF sample paths and the dependence structure between FANOVA effects. Applications on simulated data show the relevance of the approach for designing new classes of covariance kernels dedicated to high-dimensional kriging.
Resumo:
Mode of access: Internet.