Digital Commons Network^™

Third Country Deportation, Sarah R. Sherman-Stokes

Faculty Scholarship

The large-scale deportation of noncitizens from the United States is not new. However, the speed, and secrecy, by which many of these deportations are carried out is unprecedented. Deportations are, increasingly, executed not through a legal court process, but rather, extrajudicially—in detention centers and at border crossings, outside the purview of judges or neutral adjudicators. One kind of this “shadow deportation” is what I term “third country deportation”—the removal of noncitizens to a country other than that designated by an Immigration Judge, after relief to the designated country has been granted, and after the court proceeding has concluded.

This article …

Route Exploration And Synthesis Of The Reported Pyridone-Based Pdi Inhibitor Stk076545, Eric Greve, Sergey V. Lindeman, Christina Scartelli, Lin Lin, Robert Flaumenhaft, Chris Dockendorff

Chemistry Faculty Research and Publications

The enzyme protein disulfide isomerase (PDI) is essential for the correct folding of proteins and the activation of certain cell surface receptors, and is a promising target for the treatment of cancer and thrombotic conditions. A previous high-throughput screen identified the commercial compound STK076545 as a promising PDI inhibitor. To confirm its activity and support further biological studies, a resynthesis was pursued of the reported β-keto-amide with an N-alkylated pyridone at the α-position. Numerous conventional approaches were complicated by undesired fragmentations or rearrangements. However, a successful 5-step synthetic route was achieved using an aldol reaction with an α-pyridone allyl …

Uniformly Resolvable Decompositions Of Kv In 1-Factors And 4-Stars, Melissa S. Keranen, Donald L. Kreher, Salvatore Milici, Antoinette Tripodi

Michigan Tech Publications, Part 1

If X is a connected graph, then an X-factor of a larger graph is a spanning subgraph in which all of its components are isomorphic to X. A uniformly resolvable {X, Y }-decomposition of the complete graph K_v is an edge decomposition of K_v into exactly r X-factors and s Y -factors. In this article we determine necessary and sufficient conditions for when the complete graph K_v has a uniformly resolvable decompositions into 1-factors and K_1,4-factors.