Lehigh University

About: Lehigh University is a education organization based out in Bethlehem, Pennsylvania, United States. It is known for research contribution in the topics: Catalysis & Fracture mechanics. The organization has 12684 authors who have published 26550 publications receiving 770061 citations.

Dilution and microsegregation in dissimilar metal welds between super austenitic stainless steel and nickel base alloys

Abstract: Super austenitic stainless steels are often welded using high Mo, Ni base filler metals to maintain the corrosion resistance of the weld. An important aspect of this processing is the weld metal dilution level, which will control the composition and resultant corrosion resistance of the weld. In addition, the distribution of alloying elements within the weld will also significantly affect the corrosion resistance. Dissimilar metal welds between a super austenitic stainless steel (AL-6XN) and two Ni base alloys (IN625 and IN622) were characterised with respect to their dilution levels and microsegregation patterns. Single pass welds were produced over the entire dilution range using the gas tungsten arc welding process. Microstructural characterisation of the welds was conducted using light optical microscopy, scanning electron microscopy, and quantitative image analysis. Bulk and local chemical compositions were obtained through electron probe microanalysis. The quantitative chemical information w...

Optimal Locally Repairable Linear Codes

Abstract: Linear erasure codes with local repairability are desirable for distributed data storage systems. An [n,k,d] linear code having all-symbol (r,δ)-locality, denoted as (r,δ)_a, is considered optimal if it has the actual highest minimum distance of any code of the given parameters n,k,r and δ. A minimum distance bound is given in . The existing results on the existence and the construction of optimal (r, δ)_a linear codes are limited to only two small regions within this special case, namely, i) m=0 and ii) m≥ (v+δ-1)>(δ-1) and δ=2, where m=n mod(r+δ-1) and v=k mod r. This paper investigates the properties and existence conditions for optimal (r,δ)_a linear codes with general r and δ. First, a structure theorem is derived for general optimal (r,δ)_a codes which helps illuminate some of their structure properties. Next, the entire problem space with arbitrary n, k, r and δ is divided into eight different cases (regions) with regard to the specific relations of these parameters. For two cases, it is rigorously proved that no (r,δ)_a linear code can achieve the minimum distance bound in . For four other cases the optimal (r,δ)_a codes are shown to exist over a field of size q≥({n} {k-1}), deterministic constructions are proposed. Our new constructive algorithms not only cover more cases, but for the same cases where previous algorithms exist, the new constructions require a smaller field, which translates to potentially lower computational complexity. Our findings substantially enriches the knowledge on optimal (r,δ)_a linear codes, leaving only two cases in which the construction of optimal codes are not yet known.

Applications of SHOP and SHOP2

Abstract: We design the simple hierarchical ordered planner (SHOP) and its successor, SHOP2, with two goals in mind: to investigate research issues in automated planning and to provide some simple, practical planning tools. SHOP and SHOP2 are based on a planning formalism called hierarchical task network planning. SHOP and SHOP2 use a search-control strategy called ordered task decomposition, which breaks tasks into subtasks and generates the plan's actions in the same order that the plan executor executes them. So, throughout the planning process, the planner can tell what the state of the world at each step of the plan.