How to bring together fault tolerance and data consistency to enable Grid data sharing

One of the predominant themes in the criminal justice literature is that prosecutors dominate the justice system. Over seventy-five years ago, Attorney General Robert Jackson famously proclaimed that the “prosecutor has more control over life, liberty, and reputation than any other person in America.” In one of the most cited law review articles of all time, Bill Stuntz added that prosecutors—not legislators, judges, or police—“are the criminal justice system’s real lawmakers.” And an unchallenged modern consensus holds that prosecutors “rule the criminal justice system.” This Article applies a critical lens to longstanding claims of prosecutorial preeminence. It reveals a curious echo chamber enabled by a puzzling lack of dissent. With few voices challenging ever-more-strident prosecutor-dominance rhetoric, academic claims became uncritical, imprecise, and ultimately incorrect. An unchallenged consensus that “prosecutors are the criminal justice system” and that the “institution of the prosecutor has more power than any other in the criminal justice system” has real consequences for criminal justice discourse. Portraying prosecutors as the system’s iron-fisted rulers obscures the complex interplay that actually determines criminal justice outcomes. The overheated rhetoric of prosecutorial preeminence fosters a superficial understanding of the criminal justice system, overlooks the powerful forces that can and do constrain prosecutors, and diverts attention from the most promising sources of reform (legislators, judges, and police) to the least (prosecutors)

SUMMARY

How to bring together fault tolerance and data consistenc

Experimental validation of quasi-one-dimensional and two-dimensional steady glottal flow models

Physical modelling of phonation requires a mechanical description of the vocal fold coupled to a description of the flow within the glottis. In this study, an in-vitro set-up, allowing to reproduce flow conditions comparable to those of human glottal flow is used to systematically verify and discuss the relevance of the pressure and flow-rate predictions of several laminar flow models. The obtained results show that all the considered flow models underestimate the measured flow-rates and that flow-rates predicted with the one-dimensional model are most accurate. On the contrary, flow models based on boundary-layer theory and on the two-dimensional numerical resolution of Navier–Stokes equations yield most accurate pressure predictions. The influence of flow separation on the predictions is discussed since these two models can estimate relevant flow separation positions whereas this phenomenon is treated in a simplified ad-hoc way in the one-dimensional flow modelling. Laminar flow models appear to be unsuitable to describe the flow downstream of the glottal constriction. Therefore, the use of flow models taking into account three-dimensional effects as well as turbulence is motivated

Chinese Negotiators’ Subjective Variations in Intercultural Negotiations

confucianism, Chinese, negotiation, culture, conjoint, accommodation,

Data cache organization for accurate timing analysis

Caches are essential to bridge the gap between the high latency main memory and the fast processor pipeline. Standard processor architectures implement two first-level caches to avoid a structural hazard in the pipeline: an instruction cache and a data cache. For tight worst-case execution times it is important to classify memory accesses as either cache hit or cache miss. The addresses of instruction fetches are known statically and static cache hit/miss classification is possible for the instruction cache. The access to data that is cached in the data cache is harder to predict statically. Several different data areas, such as stack, global data, and heap allocated data, share the same cache. Some addresses are known statically, other addresses are only known at runtime. With a standard cache organization all those different data areas must be considered by worst-case execution time analysis. In this paper we propose to split the data cache for the different data areas. Data cache analysis can be performed individually for the different areas. Access to an unknown address in the heap does not destroy the abstract cache state for other data areas. Furthermore, we propose to use a small, highly associative cache for the heap area. We designed and implemented a static analysis for this cache, and integrated it into a worst-case execution time analysis tool