Ethics and the Awareness of Complex Individuals: Reflections on Adolf Eichmann and Oskar Schindler

Like many philosophers who favor Aristotelian virtue ethics over more legalistic and impersonal theories like those of Kant and Mill, I claim that ethics is more a matter of cultivating the right character than of living by a set of rules based on abstract principles. True to this stance, I present a certain attitude toward others as crucial to living well. This attitude involves cultivating a powerful awareness of the intricate complexity of other people and a deep appreciation of the value of such complex beings. Also with this attitude comes a sense of relation and community inspired by our understanding that other human beings, like us, as isolated within their own perspective. In support of these views, I examine the lives of two men, Adolf Eichmann and Oskar Schindler, who help reveal the importance of this attitude and the moral tendencies it inspires

Extremizers for Adjoint Restriction to a Pair of Reflected Paraboloids

We consider the adjoint restriction inequality associated to the hypersurface $\{(\tau, \xi) : \tau = \pm|\xi|^2, \;\xi \in \mathbb{R}^d\}$ at the Stein-Tomas exponent. Extremizers exist in all dimensions and extremizing sequences are precompact modulo symmetries conditional on a certain inequality, which we verify in the case $d \in \{1,2\}$

Extremizers for Adjoint Restriction to Pairs of Translated Paraboloids

Consider the adjoint restriction inequality associated with the hypersurface $\{ (\tau, \xi) \in \mathbb{R}^{d+1} : \tau = |\xi|^2 \} \cup \{(\tau, \xi) \in \mathbb{R}^{d+1} : \tau - \tau_0 = |\xi - \xi_0|^2\}$ for any $(\tau_0, \xi_0) \neq 0$. We prove that extremizers do not exist for this inequality and fully characterize extremizing sequences in terms of extremizers for the adjoint restriction inequality for the paraboloid

Existence and smoothness of extremizers for convolution with compactly supported measures

In this article, we establish various facts about extremizers for $L^p$-improving convolution operators $T\colon L^p \rightarrow L^q$ associated with compactly-supported probability measures on either $\mathbb{R}^d$ or $\mathbb{T}^d$ . If $\sigma$ has positive Fourier decay, we prove that extremizers exist and extremizing sequences are precompact modulo translation for all "non-endpoint" $(p,q)$. These extremizers also satisfy an interesting positivity property and belong to $C_{loc}^\infty \cap L^\infty$

Surface Mesh Generation based on Imprinting of S-T Edge Patches

AbstractOne of the most robust and widely used algorithms for all-hexahedral meshes is the sweeping algorithm. However, for multi- sweeping, the most difficult problems are the surface matching and interval assignment for edges on the source and target surfaces. In this paper, a new method to generate surface meshes by imprinting edge patches between the source and target surfaces is proposed. The edge patch imprinting is based on a cage-based morphing of edge patches on the different sweeping layers where deformed and undeformed cages are extracted by propagating edge patches on the linking surfaces. The imprinting results in that the source or target surfaces will be partitioned with the imprinted edge patches. After partitioning, every new source surface should be matched to a new specific target surface where surface mesh projection from one-to-one sweeping based on harmonic mapping[19] can be applied. In addition, 3D edge patches are projected onto 2D computational domains where every sweeping level is planar in order to increase the robustness of imprinting. Finally, the algorithm time complexity is discussed and examples are provided to verify the robustness of our proposed algorithm

Generating Unstructured Nuclear Reactor Core Meshes in Parallel

AbstractRecent advances in supercomputers and parallel solver techniques have enabled users to run large simulations problems using millions of processors. Techniques for multiphysics nuclear reactor core simulations are under active development in several countries. Most of these techniques require large unstructured meshes that can be hard to generate in a standalone desktop computers because of high memory requirements, limited processing power, and other complexities. We have previously reported on a hierarchical lattice-based approach for generating reactor core meshes. Here, we describe efforts to exploit coarse-grained parallelism during reactor assembly and reactor core mesh generation processes. We highlight several reactor core examples including a very high temperature reactor, a full-core model of the Korean MONJU reactor, a ¼ pressurized water reactor core, the fast reactor Experimental Breeder Reactor-II core with a XX09 assembly, and an advanced breeder test reactor core. The times required to generate large mesh models, along with speedups obtained from running these problems in parallel, are reported. A graphical user interface to the tools described here has also been developed

Comparison of Sexual Risk Behaviors Between Junior Male and Female Students at Pierz High School

The purpose of the study was to conduct a secondary analysis of Minnesota Student Survey data to compare selected sexual risk behavior of male and female eleventh grade students at Pierz High School. The secondary analysis revealed that the males and females are not significantly different with respect to the selected sexual risk behaviors. The conclusion can be reached that there is no need to tailor the sexual health instruction to students based on gender

Der Design-Analyzer - decision support im Designprozeß

Die Entwicklung moderner Industrieprodukte erfordert schon in der Designphase viele frühzeitige Entscheidungen mit weitreichenden Konsequenzen. Verschiedenartige Informationsquellen wie fachspezifische Informationssysteme, Fachexperten und die Anforderungsliste des Kunden stellen sowohl die notwendigen Daten als auch die Bewertungsgrundlage für eine optimale Designentscheidung bereit. Die Arbeit stellt einen Ansatz zur Unterstützung der Auswahl eines besten Konstruktionsvorschlags unter Berücksichtigung der verschiedenen Informationsquellen vor. Die Formalisierung der Produktanforderungen stützt sich auf Methoden des Maschinenbaus. Alle kompetenten Experten und relevanten Daten werden in einer Mehr-Kriterien-Gruppenentscheidung integriert. Der Entscheidungsalgorithmus basiert auf einer Nutzwertanalyse aus der klassischen Entscheidungstheorie. Die Implementation des DESIGN-ANALYZERS orientiert sich an der Dreiteilung von entscheidungsunterstützenden Systemen nach dem DDM-Paradigma.Modern industrial product development necessitates already during the design phase lots of early decisions with farreaching consequences. Various information resources like domain specific information systems, technical experts, and customer\u27s product requirements contribute both the necessary data and the valuation background for the optimal design. This document presents a basic approach to support the selection of a best design suggestion using the different information resources. The formalization of the product requirements is based on engineering methods. All competent experts and all relevant data are integrated in a multi-criteria multi-participants decision. The decision algorithm is based on an utility analysis taken from classical decision theory. The implementation of the DESIGN-ANALYZER follows the trisection of decision support systems according to the DDM-Paradigma

Parallel paving: An algorithm for generating distributed, adaptive, all-quadrilateral meshes on parallel computers

Paving is an automated mesh generation algorithm which produces all-quadrilateral elements. It can additionally generate these elements in varying sizes such that the resulting mesh adapts to a function distribution, such as an error function. While powerful, conventional paving is a very serial algorithm in its operation. Parallel paving is the extension of serial paving into parallel environments to perform the same meshing functions as conventional paving only on distributed, discretized models. This extension allows large, adaptive, parallel finite element simulations to take advantage of paving`s meshing capabilities for h-remap remeshing. A significantly modified version of the CUBIT mesh generation code has been developed to host the parallel paving algorithm and demonstrate its capabilities on both two dimensional and three dimensional surface geometries and compare the resulting parallel produced meshes to conventionally paved meshes for mesh quality and algorithm performance. Sandia`s {open_quotes}tiling{close_quotes} dynamic load balancing code has also been extended to work with the paving algorithm to retain parallel efficiency as subdomains undergo iterative mesh refinement

Generation of multi-million element meshes for solid model-based geometries: The Dicer algorithm

The Dicer algorithm generates a fine mesh by refining each element in a coarse all-hexahedral mesh generated by any existing all-hexahedral mesh generation algorithm. The fine mesh is geometry-conforming. Using existing all-hexahedral meshing algorithms to define the initial coarse mesh simplifies the overall meshing process and allows dicing to take advantage of improvements in other meshing algorithms immediately. The Dicer algorithm will be used to generate large meshes in support of the ASCI program. The authors also plan to use dicing as the basis for parallel mesh generation. Dicing strikes a careful balance between the interactive mesh generation and multi-million element mesh generation processes for complex 3D geometries, providing an efficient means for producing meshes of varying refinement once the coarse mesh is obtained