Sitting l-r Rabbi Dudley Weinberg, Leo Baeck, Joseph H. Cohen, Dr. Joshua Liebman; Standing l-r Max Feldberg, Louis Salvage, Rabbi Beryl D. Cohon, Harry Penn, Abraham Schiller; Boston Portraits; Groups; Men

Page 58 of the "American Jewish Cavalcade" scrapbook of Leo Baeck in New York found in ROS 10 Folder 3

Portrait of Max Boehm ( 1871-1944 ).

The model is seated, facing the viewer and looking straight at him. He is wearing a business suit and holding a cigar. The pose is relaxed abd the color tonalities warm, with the yellow background dominant. Heavy impasto is used for face and hands. Neg. 37599 Signed upper right, also dated

Max James Kohler papers, 1888-1934.

Contains scrapbooks, correspondence and reports relating to Kohler's extensive activities on behalf of liberal immigration and naturalization laws in the United States, his opposition to the registration of aliens, the problems of Chinese immigration to the United States, his opposition to the use of the term "Hebrew Race" in the classification of immigrants, the drafting of minority clauses at the Paris Peace Conference in 1919, Jewish and Christian relations in the U.S., and the condition of Jews in Russia, Roumania, Poland and Nazi-Germany with the following institutions: the American Civil Liberties Union, 1926-1934, the American Jewish Committee, 1909-1934, B'nai Brith, 1930-1933, the Union of American Hebrew Congregations - Board of Delegates on Civil Rights, the Committee on Ellis Island, the Foreign Language Information Service, the Hebrew Benevolent Society of Baltimore, the Hebrew Sheltering and Immigrant Aid Society, the Jewish Immigrants' Information Bureau in Galveston, Texas, the Industrial Removal Office, the National Conference of Jews and Christians, the National Council of Jewish Women, the National Council on Naturalization and Citizenship, the Bureau of Immigration to the United States Department of Laborm the United States Department of Commerce and Labor, the Department of State and individual United States Congressmen.

Max Michel Collection. 1933-1986 Bulk dates: 1933-1937

The bulk of the collections consists of correspondence from the 1930s relating to Michels’s job applications in the U.S. in different academic institutions and activities of the Hilfsverein der Juden in Deutschland. Also included is a 36 p. typescript, ‘Geschichte der Familie Wertheimer’; pamphlets by Juda Magnes and Kurt Blumenfeld on the university in Jerusalem; as well as family trees.

Max Strauss Collection 1911-1935

Documents, medals, and photos pertaining to Max Strauss' service in the German Army before and during World War I:

Portraits of Max Pallenberg, No 9.

Pallenberg is represented in No 9 representing himself

Enhancement of (BH)(max) in a hard-soft-ferrite nanocomposite using exchange spring mechanism

We have observed the exchange spring behavior in the soft (Fe3O4)-hard (BaCa2Fe16O27)-ferrite composite by tailoring the particle size of the individual phases and by suitable thermal treatment of the composite. The magnetization curve for the nanocomposite heated at 800 degrees C shows a single loop hysteresis showing the existence of the exchange spring phenomena in the composite and an enhancement of 13% in (BH)(max) compared to the parent hard ferrite (BaCa2Fe16O27). The Henkel plot provides the proof of the presence of the exchange interaction between the soft and hard grains as well as its dominance over the dipolar interaction in the nanocomposite.

Preparation of reticulated MAX-phase support with morphology-controllable nanostructured ceria coating for gas exhaust catalyst devices

Reticulated porous Ti3AlC2 ceramic, a member of the MAX-phase family (Mn+1AXn phases, where M is an early transition metal, A is an A-group element, and X is carbon and/or nitrogen), was prepared from the highly dispersed aqueous suspension by a replica template method. Through a cathodic electrogeneration method, nanocrystalline catalytic CeO2 coatings were deposited on the conductive porous Ti 3AlC2 supports. By adjusting the pH value and cathodic deposition current, coatings exhibiting nanocellar, nanosheets-like, or bubble-free morphologies can be obtained. This work expects to introduce a novel practically feasible material system and a catalytic coating preparation technique for gas exhaust catalyst devices.

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V, E) with a non-negative weight function w on V such that Sigma(k)(i=1) max(v epsilon Ci) w(v(i)) is minimized, where C-1, ... , C-k are the various color classes. Max-coloring general graphs is as hard as the classical vertex coloring problem, a special case where vertices have unit weight. In fact, in some cases it can even be harder: for example, no polynomial time algorithm is known for max-coloring trees. In this paper we consider the problem of max-coloring paths and its generalization, max-coloring abroad class of trees and show it can be solved in time O(vertical bar V vertical bar+time for sorting the vertex weights). When vertex weights belong to R, we show a matching lower bound of Omega(vertical bar V vertical bar log vertical bar V vertical bar) in the algebraic computation tree model.

An optimal local approximation algorithm for max-min linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0 for nonnegative matrices A and C. We present a local algorithm (constant-time distributed algorithm) for approximating max-min LPs. The approximation ratio of our algorithm is the best possible for any local algorithm; there is a matching unconditional lower bound.

Local approximability of max-min and min-max linear programs

In a max-min LP, the objective is to maximise ω subject to Ax ≤ 1, Cx ≥ ω1, and x ≥ 0. In a min-max LP, the objective is to minimise ρ subject to Ax ≤ ρ1, Cx ≥ 1, and x ≥ 0. The matrices A and C are nonnegative and sparse: each row ai of A has at most ΔI positive elements, and each row ck of C has at most ΔK positive elements. We study the approximability of max-min LPs and min-max LPs in a distributed setting; in particular, we focus on local algorithms (constant-time distributed algorithms). We show that for any ΔI ≥ 2, ΔK ≥ 2, and ε > 0 there exists a local algorithm that achieves the approximation ratio ΔI (1 − 1/ΔK) + ε. We also show that this result is the best possible: no local algorithm can achieve the approximation ratio ΔI (1 − 1/ΔK) for any ΔI ≥ 2 and ΔK ≥ 2.

MAX: A Multi Objective Memory Architecture eXploration Framework for Embedded Systems-on-Chip

Today's feature-rich multimedia products require embedded system solution with complex System-on-Chip (SoC) to meet market expectations of high performance at a low cost and lower energy consumption. The memory architecture of the embedded system strongly influences these parameters. Hence the embedded system designer performs a complete memory architecture exploration. This problem is a multi-objective optimization problem and can be tackled as a two-level optimization problem. The outer level explores various memory architecture while the inner level explores placement of data sections (data layout problem) to minimize memory stalls. Further, the designer would be interested in multiple optimal design points to address various market segments. However, tight time-to-market constraints enforces short design cycle time. In this paper we address the multi-level multi-objective memory architecture exploration problem through a combination of Multi-objective Genetic Algorithm (Memory Architecture exploration) and an efficient heuristic data placement algorithm. At the outer level the memory architecture exploration is done by picking memory modules directly from a ASIC memory Library. This helps in performing the memory architecture exploration in a integrated framework, where the memory allocation, memory exploration and data layout works in a tightly coupled way to yield optimal design points with respect to area, power and performance. We experimented our approach for 3 embedded applications and our approach explores several thousand memory architecture for each application, yielding a few hundred optimal design points in a few hours of computation time on a standard desktop.

Estimation of design basis earthquake using region-specific M-max, for the NPP site at Kalpakkam, Tamil Nadu, India

The objective of the paper is to estimate Safe Shutdown Earthquake (SSE) and Operating/Design Basis Earthquake (OBE/DBE) for the Nuclear Power Plant (NPP) site located at Kalpakkam, Tamil Nadu, India. The NPP is located at 12.558 degrees N, 80.175 degrees E and a 500 km circular area around NPP site is considered as `seismic study area' based on past regional earthquake damage distribution. The geology, seismicity and seismotectonics of the study area are studied and the seismotectonic map is prepared showing the seismic sources and the past earthquakes. Earthquake data gathered from many literatures are homogenized and declustered to form a complete earthquake catalogue for the seismic study area. The conventional maximum magnitude of each source is estimated considering the maximum observed magnitude (M-max(obs)) and/or the addition of 0.3 to 0.5 to M-max(obs). In this study maximum earthquake magnitude has been estimated by establishing a region's rupture character based on source length and associated M-max(obs). A final source-specific M-max is selected from the three M-max values by following the logical criteria. To estimate hazard at the NPP site, ten Ground-Motion Prediction Equations (GMPEs) valid for the study area are considered. These GMPEs are ranked based on Log-Likelihood (LLH) values. Top five GMPEs are considered to estimate the peak ground acceleration (PGA) for the site. Maximum PGA is obtained from three faults and named as vulnerable sources to decide the magnitudes of OBE and SSE. The average and normalized site specific response spectrum is prepared considering three vulnerable sources and further used to establish site-specific design spectrum at NPP site.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.