Filters








106,097 Hits in 2.2 sec

: An Archaeology of Capitalism . Matthew Johnson

Robert L. Schuyler
1996 American Anthropologist  
Matthew Johnson. Lon- don: Blackwell Publishers, 1996. 244 pp. Rosert L.  ...  Matthew Johnson attempts a new and insightful examination of this era (1400-1750) based on “archaeological” infor- mation and interpretation.  ... 
doi:10.1525/aa.1996.98.4.02a00760 fatcat:65jby4mgsffoziczuhtscfspze

: Housing Culture: Traditional Architecture in an English Landscape . Matthew Johnson

Bernard Herman
1995 American Anthropologist  
Matthew Johnson. Washington: Smith- sonian Institution Press, 1993. xi + 220 pp.  ...  In this regard especially, Johnson has advanced the study of traditional British houses.  ... 
doi:10.1525/aa.1995.97.3.02a00360 fatcat:y5sq62qemzhdhgd23pdcdliuzu

Nie tylko dla archeologów...; rec. książki: Matthew Johnson, Teoria archeologii. Wprowadzenie

Mariusz Ciesielski
2016 Studia Europaea Gnesnensia  
Johnson już na pierwszych stronicach zwraca uwagę czytelnika, jakby chcąc przygotować go zawczasu, że nie będzie to zetknięcie się z kolejnym, typowym "nudnym wykładem" o teorii.  ... 
doi:10.14746/seg.2016.13.19 fatcat:7fnbjvht5zegvebpf7hqsug6li

Wrongful Conviction in Sexual Assault: Stranger Rape, Acquaintance Rape, and Intra-Familial Child Sexual Assaults

Gethin Rees
2021 The Wrongful Conviction Law Review  
While Johnson does also include cases where Black women were victims, it is clear that the majority of wrongful convictions fit the model of white victim, Black perpetrator.  ...  In a well-evidenced, though admittedly disturbing chapter, Johnson sets out the history of conspicuous racist punishments meted out to Black men under the belief that they had raped white women.  ... 
doi:10.29173/wclawr48 fatcat:i4wlvn6qt5gjlku4ouh6h3jkgq

China's iGeneration: Cinema and Moving Image Culture for the Twenty-First Century, edited by Matthew Johnson et al. (2014)

Wing-Fai Leung, Aidan Power
2015 Alphaville: Journal of Film and Screen Media  
Matthew D. Johnson, Keith B. Wagner, Tianqi Yu, and Luke Vulpiani. New York and London: Bloomsbury, 2014 (349 pages). ISBN: 9781623565954.  ...  Suggested Citation Leung, Wing-Fai. “ China’s iGeneration: Cinema and Moving Image Culture for the Twenty-First Century , edited by Matthew D. Johnson, Keith B. Wagner, Tianqi Yu, and Luke Vulpiani.”  ... 
doi:10.33178/alpha.9.08 fatcat:2nwbnpbvpvepxfpxsxhcl43zfa

Donald R. Songer, Susan W. Johnson, C.L. Ostberg, and Matthew E. Wetstein, Law, Ideology, and Collegiality: Judicial Behaviour in the Supreme Court of Canada

Reza Barmaki
2012 Canadian journal of sociology  
Law, Ideology, and Collegiality: Judicial Behaviour in the Supreme Court of Canada. McGill-Queen's University Press, 2012, 223 pp. $29.95 paperback (978-0-7735-3929-7) is a very interesting and important book for readers of a variety of academic interests and backgrounds. Particularly, however, undergraduate and graduate students of sociology of law, law and society, and political sociology can immensely benefit from it.
doi:10.29173/cjs18510 fatcat:njgdcrselfbiteudn43jwelaiy

Rigel

John H. Kelm, Daniel R. Johnson, Matthew R. Johnson, Neal C. Crago, William Tuohy, Aqeel Mahesri, Steven S. Lumetta, Matthew I. Frank, Sanjay J. Patel
2009 SIGARCH Computer Architecture News  
This paper considers Rigel, a programmable accelerator architecture for a broad class of data-and task-parallel computation. Rigel comprises 1000+ hierarchically-organized cores that use a fine-grained, dynamically scheduled single-program, multiple-data (SPMD) execution model. Rigel's low-level programming interface adopts a single global address space model where parallel work is expressed in a task-centric, bulk-synchronized manner using minimal hardware support. Compared to existing
more » ... tors, which contain domain-specific hardware, specialized memories, and/or restrictive programming models, Rigel is more flexible and provides a straightforward target for a broader set of applications. We perform a design analysis of Rigel to quantify the compute density and power efficiency of our initial design. We find that Rigel can achieve a density of over 8 single-precision GF LOP S mm 2 in 45nm, which is comparable to high-end GPUs scaled to 45nm. We perform experimental analysis on several applications ported to the Rigel low-level programming interface. We examine scalability issues related to work distribution, synchronization, and load-balancing for 1000-core accelerators using software techniques and minimal specialized hardware support. We find that while it is important to support fast task distribution and barrier operations, these operations can be implemented without specialized hardware using flexible hardware primitives.
doi:10.1145/1555815.1555774 fatcat:54qfxxi6mbgtbplw7eypcw5cui

Stevens-Johnson Syndrome: A Case Study

Matthew Smelik
2002 The Permanente Journal  
Care for patients with Stevens-Johnson syndrome consists of treating the presenting symptoms.  ...  One such potential complication of drugs-including tetracycline-is Stevens-Johnson syndrome, a potentially fatal condition that manifests mainly on the skin and mucosal surfaces but also affects other  ...  Stevens-Johnson syndrome commonly affects multiple organs, and esophageal strictures develop in some patients. 6 Ocular complications occur in about 70% of patients with Stevens-Johnson syndrome. 7  ... 
pmid:30313009 pmcid:PMC6220622 fatcat:iksf77kxunelhba64nxuf6zoqu

Extended flux maps on surfaces and the contracted Johnson homomorphism [article]

Matthew B. Day
2009 arXiv   pre-print
This construction uses the topology of the Jacobian of the surface and a correction factor related to the Johnson homomorphism.  ...  The following is Lemma 2D of Johnson [7] . Theorem 2.4.2 (Johnson [8]).  ...  The Johnson homomorphism The Johnson homomorphism is a map from the Torelli group I * to an abelian group. Johnson introduced this homomorphism in [7] .  ... 
arXiv:0808.1695v2 fatcat:rttb2zqzlrcynhvszf7hvgpuri

Selfish Knapsack [article]

Itai Feigenbaum, Matthew P. Johnson
2016 arXiv   pre-print
We consider a selfish variant of the knapsack problem. In our version, the items are owned by agents, and each agent can misrepresent the set of items she owns---either by avoiding reporting some of them (understating), or by reporting additional ones that do not exist (overstating). Each agent's objective is to maximize, within the items chosen for inclusion in the knapsack, the total valuation of her own chosen items. The knapsack problem, in this context, seeks to minimize the worst-case
more » ... oximation ratio for social welfare at equilibrium. We show that a randomized greedy mechanism has attractive strategic properties: in general, it has a correlated price of anarchy of 2 (subject to a mild assumption). For overstating-only agents, it becomes strategyproof; we also provide a matching lower bound of 2 on the (worst-case) approximation ratio attainable by randomized strategyproof mechanisms, and show that no deterministic strategyproof mechanism can provide any constant approximation ratio. We also deal with more specialized environments. For the case of 2 understating-only agents, we provide a randomized strategyproof 5+4√(2)/7≈ 1.522-approximate mechanism, and a lower bound of 5√(5)-9/2≈ 1.09. When all agents but one are honest, we provide a deterministic strategyproof 1+√(5)/2≈ 1.618-approximate mechanism with a matching lower bound. Finally, we consider a model where agents can misreport their items' properties rather than existence. Specifically, each agent owns a single item, whose value-to-size ratio is publicly known, but whose actual value and size are not. We show that an adaptation of the greedy mechanism is strategyproof and 2-approximate, and provide a matching lower bound; we also show that no deterministic strategyproof mechanism can provide a constant approximation ratio.
arXiv:1510.07358v2 fatcat:pmzt6jbnwjfujc32jlrcq2mhxe

The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM [article]

Ardavan Saeedi, Matthew Hoffman, Matthew Johnson, Ryan Adams
2016 arXiv   pre-print
We empirically compare our model with two main baselines: 1) a two-level Bayesian nonparametric hierarchical HMM (HHMM) introduced by Johnson (2014) that models high-level dynamics as an infinite hidden  ...  Variational factors For q(z 1:T , s 1:T ), the "direct assignment" truncation used in (Johnson & Willsky, 2014) , sets q(z 1:T , s 1:T ) = 0 if for any of z 1 to z T we have z t = k and k > K; here K  ... 
arXiv:1602.06349v1 fatcat:l7km2667ivddhkxsds2utreyvu

Rigel

John H. Kelm, Daniel R. Johnson, Matthew R. Johnson, Neal C. Crago, William Tuohy, Aqeel Mahesri, Steven S. Lumetta, Matthew I. Frank, Sanjay J. Patel
2009 Proceedings of the 36th annual international symposium on Computer architecture - ISCA '09  
This paper considers Rigel, a programmable accelerator architecture for a broad class of data-and task-parallel computation. Rigel comprises 1000+ hierarchically-organized cores that use a fine-grained, dynamically scheduled single-program, multiple-data (SPMD) execution model. Rigel's low-level programming interface adopts a single global address space model where parallel work is expressed in a task-centric, bulk-synchronized manner using minimal hardware support. Compared to existing
more » ... tors, which contain domain-specific hardware, specialized memories, and/or restrictive programming models, Rigel is more flexible and provides a straightforward target for a broader set of applications. We perform a design analysis of Rigel to quantify the compute density and power efficiency of our initial design. We find that Rigel can achieve a density of over 8 single-precision GF LOP S mm 2 in 45nm, which is comparable to high-end GPUs scaled to 45nm. We perform experimental analysis on several applications ported to the Rigel low-level programming interface. We examine scalability issues related to work distribution, synchronization, and load-balancing for 1000-core accelerators using software techniques and minimal specialized hardware support. We find that while it is important to support fast task distribution and barrier operations, these operations can be implemented without specialized hardware using flexible hardware primitives.
doi:10.1145/1555754.1555774 dblp:conf/isca/KelmJJCTMLFP09 fatcat:ij2j3e7vonfe3eimjlijvq6fqm

Hecke Eigenforms as Products of Eigenforms [article]

Matthew L. Johnson
2011 arXiv   pre-print
We investigate when the product of two Hecke eigenforms for Γ_1(N) is again a Hecke eigenform. In this paper we prove that the product of two normalized eigenforms for Γ_1(N), of weight greater than 1, is an eigenform only 61 times, and give a complete list. Duke [Duk99] and Ghate [Gha00] independently proved that with eigenforms for SL_2(Z), there are only 16 such product identities. Ghate [Gha02] also proved related results for Γ_1(N), with N square free. Emmons [Emm05] proved results for
more » ... nforms away from the level, for prime level. The methods we use are elementary and effective, and do not rely on the Rankin-Selberg convolution method used by both Duke and Ghate.
arXiv:1110.6430v1 fatcat:zim7wzwtbveknhrk3dhcdkb5ve

Ned K. Johnson Young Investigator Award 2017, to Michael Butler

Matthew Johnson
2018 The AUK: A Quarterly Journal of Ornithology  
Johnson Fund of the AOS. To learn more about eligibility, go to http:// www.americanornithology.org/content/aos-johnsonaward.  ...  Johnson Young Investigator Award to recognize outstanding and promising work by a researcher early in his or her career (up to five years post-Ph.D.) in any field of ornithology.  ... 
doi:10.1642/auk-17-167.1 fatcat:5asniyvn5nfkvlk3pmey5uvgh4

A Serial Multilevel Hypergraph Partitioning Algorithm [article]

Foad Lotfifar, Matthew Johnson
2016 arXiv   pre-print
The graph partitioning problem has many applications in scientific computing such as computer aided design, data mining, image compression and other applications with sparse-matrix vector multiplications as a kernel operation. In many cases it is advantageous to use hypergraphs as they, compared to graphs, have a more general structure and can be used to model more complex relationships between groups of objects. This motivates our focus on the less-studied hypergraph partitioning problem. In
more » ... is paper, we propose a serial multi-level bipartitioning algorithm. One important step in current heuristics for hypergraph partitioning is clustering during which similar vertices must be recognized. This can be particularly difficult in irregular hypergraphs with high variation of vertex degree and hyperedge size; heuristics that rely on local vertex clustering decisions often give poor partitioning quality. A novel feature of the proposed algorithm is to use the techniques of rough set clustering to address this problem. We show that our proposed algorithm gives on average between 18.8 per cent and 71.1 per cent better quality on these irregular hypergraphs by comparing it to state-of-the-art hypergraph partitioning algorithms on benchmarks taken from real applications.
arXiv:1601.01336v1 fatcat:5fxf3b6zkvagho4lchkufteeam
« Previous Showing results 1 — 15 out of 106,097 results