Aluminide coatings for nickel base alloys

The metalliding process was used to aluminide IN-100 and TD NiCr. Aluminum was deposited over a broad range of deposition rates, with two types of coating structures resulting. Chromium, silicon, titanium and yttrium were also individually deposited simutaneously with aluminum on IN-100. None of these had a marked effect on the oxidation resistance of the aluminide coating. Porosity-free aluminide coatings with good oxidation resistance were formed on TD NiCr providing the aluminum concentration did not exceed 8 percent, the limit of solubility in the gamma phase

Generalized modularity matrices

Various modularity matrices appeared in the recent literature on network analysis and algebraic graph theory. Their purpose is to allow writing as quadratic forms certain combinatorial functions appearing in the framework of graph clustering problems. In this paper we put in evidence certain common traits of various modularity matrices and shed light on their spectral properties that are at the basis of various theoretical results and practical spectral-type algorithms for community detection

Using risk to inform overtopping protection decisions

Presented at the Protections 2016: 2nd international seminar on dam protection against overtopping: concrete dams, embankment dams, levees, tailings dams held on 7th-9th September, 2016, at Colorado State University in Fort Collins, Colorado, USA. The increasing demand for dam and levee safety and flood protection has motivated new research and advancements and a greater need for cost-effective measures in overtopping protection as a solution for overtopping concerns at levees and dams. This seminar will bring together leading experts from practice, research, development, and implementation for two days of knowledge exchange followed by a technical tour of the Colorado State University Hydraulic Laboratory with overtopping flume and wave simulator. This seminar will focus on: Critical issues related to levees and dams; New developments and advanced tools; Overtopping protection systems; System design and performance; Applications and innovative solutions; Case histories of overtopping events; Physical modeling techniques and recent studies; and Numerical modeling methods.Includes bibliographical references.The decision to implement overtopping protection as a dam safety modification alternative can be difficult. The decision involves a conscious decision to allow a dam to overtop for floods above a threshold flood. If a large flood occurs that initiates dam overtopping, there is no turning back, and the dam and the overtopping protection must be able to resist the overtopping flows. The chance of intervention being successful for a dam that is already overtopping, should erosion initiate, would be very unlikely. There is more of a comfort level among many dam engineers in providing conventional solutions to a dam overtopping issue. These traditional measures include raising the dam crest to provide additional surcharge space to store a portion of the flood inflows or providing additional spillway capacity to more closely match the peak flood inflows. There is often the perception among experienced dam engineers that these traditional measures provide a safer solution and pose less risk than an overtopping solution. This paper will present scenarios that demonstrate that in some cases, overtopping protection may be just as safe or the safer alternative, by exposing the downstream population to equal or less risk of dam failure during a large flood event. These scenarios will consist of an embankment dam where a replacement gated spillway alternative will be compared to overtopping protection and a concrete dam where raising of the dam will be compared to providing overtopping protection for the dam foundation

Encoding dynamics for multiscale community detection: Markov time sweeping for the Map equation

The detection of community structure in networks is intimately related to finding a concise description of the network in terms of its modules. This notion has been recently exploited by the Map equation formalism (M. Rosvall and C.T. Bergstrom, PNAS, 105(4), pp.1118--1123, 2008) through an information-theoretic description of the process of coding inter- and intra-community transitions of a random walker in the network at stationarity. However, a thorough study of the relationship between the full Markov dynamics and the coding mechanism is still lacking. We show here that the original Map coding scheme, which is both block-averaged and one-step, neglects the internal structure of the communities and introduces an upper scale, the `field-of-view' limit, in the communities it can detect. As a consequence, Map is well tuned to detect clique-like communities but can lead to undesirable overpartitioning when communities are far from clique-like. We show that a signature of this behavior is a large compression gap: the Map description length is far from its ideal limit. To address this issue, we propose a simple dynamic approach that introduces time explicitly into the Map coding through the analysis of the weighted adjacency matrix of the time-dependent multistep transition matrix of the Markov process. The resulting Markov time sweeping induces a dynamical zooming across scales that can reveal (potentially multiscale) community structure above the field-of-view limit, with the relevant partitions indicated by a small compression gap.Comment: 10 pages, 6 figure