Query: BPM Governance: An Exploratory Study in Public Organizations

Relevant passages:
Using BPM governance to align systems and practice <=SEP=> Purpose – The purpose of this paper is to propose a business process management (BPM) governance model that sets BPM decision making, along with roles and responsibilities. The setting context of the study is a government-owned corporation operating in Australia. Design/methodology/approach – A qualitative case study examined and analysed organisational documents using a content analysis approach. Results of document analysis are used to inform a series of in-depth interviews of key stakeholders in the organisation. Interviews are analysed using a constant comparison method to derive themes and build categories of description. Findings – A BPM governance model is proposed. Results of thematic analysis are interpreted against the framework of the BPM governance model, leading to findings that include implications for theory and practice. Practical implications – In practical terms, the research shows how BPM practice can be aligned and integrated with the corporate governance and management systems in the selected case study organisation. Originality/value – Despite research identifying the importance of governance, along with associated capabilities, there has been little progress on how the abovementioned capabilities can be effectively deployed across an organisation. This paper addresses a gap in the literature relating to how to deploy BPM governance in an organisation.

Evidence-based software engineering <=SEP=> Objective: Our objective is to describe how softwareengineering might benefit from an evidence-basedapproach and to identify the potential difficultiesassociated with the approach.Method: We compared the organisation and technicalinfrastructure supporting evidence-based medicine (EBM)with the situation in software engineering. We consideredthe impact that factors peculiar to software engineering(i.e. the skill factor and the lifecycle factor) would haveon our ability to practice evidence-based softwareengineering (EBSE).Results: EBSE promises a number of benefits byencouraging integration of research results with a view tosupporting the needs of many different stakeholdergroups. However, we do not currently have theinfrastructure needed for widespread adoption of EBSE.The skill factor means software engineering experimentsare vulnerable to subject and experimenter bias. Thelifecycle factor means it is difficult to determine howtechnologies will behave once deployed.Conclusions: Software engineering would benefit fromadopting what it can of the evidence approach providedthat it deals with the specific problems that arise from thenature of software engineering.

Towards a Business Process Management Maturity Model <=SEP=> Business Process Management (BPM) has been identified as the number one business priority by a recent Gartner study (Gartner, 2005). However, BPM has a plethora of facets as its origins are in Business Process Reengineering, Process Innovation, Process Modelling, and Workflow Management to name a few. Organisations increasingly recognize the requirement for an increased process orientation and require appropriate comprehensive frameworks, which help to scope and evaluate their BPM initiative. This research project aims toward the development of a holistic and widely accepted BPM maturity model, which facilitates the assessment of BPM capabilities. This paper provides an overview about the current model with a focus on the actual model development utilizing a series of Delphi studies. The development process includes separate studies that focus on further defining and expanding the six core factors within the model, i.e. strategic alignment, governance, method, Information Technology, people and culture.

Guidelines for conducting and reporting case study research in software engineering <=SEP=> Case study is a suitable research methodology for software engineering research since it studies contemporary phenomena in its natural context. However, the understanding of what constitutes a case study varies, and hence the quality of the resulting studies. This paper aims at providing an introduction to case study methodology and guidelines for researchers conducting case studies and readers studying reports of such studies. The content is based on the authors’ own experience from conducting and reading case studies. The terminology and guidelines are compiled from different methodology handbooks in other research domains, in particular social science and information systems, and adapted to the needs in software engineering. We present recommended practices for software engineering case studies as well as empirically derived and evaluated checklists for researchers and readers of case study research.

Capability maturity model, version 1.1 <=SEP=> The capability maturity model (CMM), developed to present sets of recommended practices in a number of key process areas that have been shown to enhance software-development and maintenance capability, is discussed. The CMM was designed to help developers select process-improvement strategies by determining their current process maturity and identifying the issues most critical to improving their software quality and process. The initial release of the CMM, version 1.0, was reviewed and used by the software community during 1991 and 1992. A workshop on CMM 1.0, held in April 1992, was attended by about 200 software professionals. The current version of the CMM is the result of the feedback from that workshop and ongoing feedback from the software community. The technical report that describes version 1.1. is summarised.<<ETX>>

Innovative Contactless Energy Transfer Accessory for Rotary Ultrasonic Machining and Its Circuit Compensation Based on Coil Turns <=SEP=> An innovative concentric rotary ultrasonic machining (RUM) device based on local induction is proposed. The device is used as a machine tool accessory that can add the RUM to any machining center. Rather than using a complete ring, a portion of a ring is used as the primary core in the proposed rotary transformer, which eliminates spindle speed limits. The simplified configuration provides increased safety and is convenient for material processing applications. Additionally, a circuit compensation method based on coil turns is proposed. It takes the whole circuit, reliability of electronic components, transmission efficiency, and output power into consideration. We use this method to choose the optimal number of coil turns and compensation elements required to achieve increased and safe power transmission performance. This paper also demonstrates the performance of the device through experimentation. Finally, practicability is discussed.

What Actually Wins Soccer Matches : Prediction of the 2011-2012 Premier League for Fun and Profit <=SEP=> Sports analytics is a fascinating problem area in which to apply statistical learning techniques. This thesis brings new data to bear on the problem of predicting the outcome of a soccer match. We use frequency counts of in-game events, sourced from the Manchester City Analytics program, to predict the 380 matches of the 2011-2012 Premier League season. We generate prediction models with multinomial regression and rigorously test them with betting simulations. An extensive review of prior efforts is presented, as well as a novel theoretically optimal betting strategy. We measure performance different feature sets and betting strategies. Accuracy and simulated profit far exceeding those of all earlier efforts are achieved.

The Acquisition of Reading Comprehension Skill <=SEP=> How do people acquire skill at comprehending what they read? That is the simple question to which we shall try to make a tentative answer. To begin, we have to acknowledge some complexities about the concept of reading comprehension and what it means to develop it.

Column-store support for RDF data management: not all swans are white <=SEP=> This paper reports on the results of an independent evaluation of the techniques presented in the VLDB 2007 paper “Scalable Semantic Web Data Management Using Vertical Partitioning”, authored by D. Abadi, A. Marcus, S. R. Madden, and K. Hollenbach [1]. We revisit the proposed benchmark and examine both the data and query space coverage. The benchmark is extended to cover a larger portion of the query space in a canonical way. Repeatability of the experiments is assessed using the code base obtained from the authors. Inspired by the proposed vertically-partitioned storage solution for RDF data and the performance figures using a column-store, we conduct a complementary analysis of state-of-the-art RDF storage solutions. To this end, we employ MonetDB/SQL, a fully-functional open source column-store, and a well-known – for its performance – commercial row-store DBMS. We implement two relational RDF storage solutions – triple-store and vertically-partitioned – in both systems. This allows us to expand the scope of [1] with the performance characterization along both dimensions – triple-store vs. vertically-partitioned and row-store vs. column-store – individually, before analyzing their combined effects. A detailed report of the experimental test-bed, as well as an in-depth analysis of the parameters involved, clarify the scope of the solution originally presented and position the results in a broader context by covering more systems.

Machine Learning for Intelligent Systems <=SEP=> Recent research in machine learning has focused on supervised induction for simple classification and reinforcement learning for simple reactive behaviors. In the process, the field has become disconnected from AI’s original goal of creating complete intelligent agents. In this paper, I review recent work on machine learning for planning, language, vision, and other topics that runs counter to this trend and thus holds interest for the broader AI research community. I also suggest some steps to encourage further research along these lines.

Learning narrative structure from annotated folktales <=SEP=> Narrative structure is an ubiquitous and intriguing phenomenon. By virtue of structure we recognize the presence of Villainy or Revenge in a story, even if that word is not actually present in the text. Narrative structure is an anvil for forging new artificial intelligence and machine learning techniques, and is a window into abstraction and conceptual learning as well as into culture and its influence on cognition. I advance our understanding of narrative structure by describing Analogical Story Merging (ASM), a new machine learning algorithm that can extract culturally-relevant plot patterns from sets of folktales. I demonstrate that ASM can learn a substantive portion of Vladimir Propp’s influential theory of the structure of folktale plots. The challenge was to take descriptions at one semantic level, namely, an event timeline as described in folktales, and abstract to the next higher level: structures such as Villainy, StuggleVictory, and Reward. ASM is based on Bayesian Model Merging, a technique for learning regular grammars. I demonstrate that, despite ASM’s large search space, a carefully-tuned prior allows the algorithm to converge, and furthermore it reproduces Propp’s categories with a chance-adjusted Rand index of 0.511 to 0.714. Three important categories are identified with F-measures above 0.8. The data are 15 Russian folktales, comprising 18,862 words, a subset of Propp’s original tales. This subset was annotated for 18 aspects of meaning by 12 annotators using the Story Workbench, a general text-annotation tool I developed for this work. Each aspect was doubly-annotated and adjudicated at inter-annotator F-measures that cluster around 0.7 to 0.8. It is the largest, most deeply-annotated narrative corpus assembled to date. The work has significance far beyond folktales. First, it points the way toward important applications in many domains, including information retrieval, persuasion and negotiation, natural language understanding and generation, and computational creativity. Second, abstraction from natural language semantics is a skill that underlies many cognitive tasks, and so this work provides insight into those processes. Finally, the work opens the door to a computational understanding of cultural influences on cognition and understanding cultural differences as captured in stories. Dissertation Supervisor: Patrick H. Winston Professor, Electrical Engineering and Computer Science Dissertation Committee: Whitman A. Richards Professor, Brain & Cognitive Sciences Peter Szolovits Professor, Electrical Engineering and Computer Science & Harvard-MIT Division of Health Sciences and Technology Joshua B. Tenenbaum Professor, Brain & Cognitive Sciences

Neural computation and self-organizing maps - an introduction <=SEP=> In this age of modern era, the use of internet must be maximized. Yeah, internet will help us very much not only for important thing but also for daily activities. Many people now, from any level can use internet. The sources of internet connection can also be enjoyed in many places. As one of the benefits is to get the on-line neural computation and self organizing maps an introduction computation neural systems series book, as the world window, as many people suggest.

Comparing NoSQL MongoDB to an SQL DB <=SEP=> NoSQL database solutions are becoming more and more prevalent in a world currently dominated by SQL relational databases. NoSQL databases were designed to provide database solutions for large volumes of data that is not structured. However, the advantages (or disadvantages) of using a NoSQL database for data that is structured, and not necessarily "Big," is not clear. There are not many studies that compare the performance of processing a modest amount of structured data in a NoSQL database with a traditional relational database. In this paper, we compare one of the NoSQL solutions, MongoDB, to the standard SQL relational database, SQL Server. We compare the performance, in terms of runtime, of these two databases for a modest-sized structured database. Results show that MongoDB performs equally as well or better than the relational database, except when aggregate functions are utilized.

A Combined Corner and Edge Detector <=SEP=> The problem we are addressing in Alvey Project MMI149 is that of using computer vision to understand the unconstrained 3D world, in which the viewed scenes will in general contain too wide a diversity of objects for topdown recognition techniques to work. For example, we desire to obtain an understanding of natural scenes, containing roads, buildings, trees, bushes, etc., as typified by the two frames from a sequence illustrated in Figure 1. The solution to this problem that we are pursuing is to use a computer vision system based upon motion analysis of a monocular image sequence from a mobile camera. By extraction and tracking of image features, representations of the 3D analogues of these features can be constructed.

Learning Natural Language Inference using Bidirectional LSTM model and Inner-Attention <=SEP=> In this paper, we proposed a sentence encoding-based model for recognizing text entailment. In our approach, the encoding of sentence is a two-stage process. Firstly, average pooling was used over word-level bidirectional LSTM (biLSTM) to generate a firststage sentence representation. Secondly, attention mechanism was employed to replace average pooling on the same sentence for better representations. Instead of using target sentence to attend words in source sentence, we utilized the sentence’s first-stage representation to attend words appeared in itself, which is called ”Inner-Attention” in our paper . Experiments conducted on Stanford Natural Language Inference (SNLI) Corpus has proved the effectiveness of ”Inner-Attention” mechanism. With less number of parameters, our model outperformed the existing best sentence encoding-based approach by a large margin.

VeriCon: towards verifying controller programs in software-defined networks <=SEP=> Software-defined networking (SDN) is a new paradigm for operating and managing computer networks. SDN enables logically-centralized control over network devices through a "controller" software that operates independently from the network hardware, and can be viewed as the network operating system. Network operators can run both inhouse and third-party SDN programs (often called applications) on top of the controller, e.g., to specify routing and access control policies. SDN opens up the possibility of applying formal methods to prove the correctness of computer networks. Indeed, recently much effort has been invested in applying finite state model checking to check that SDN programs behave correctly. However, in general, scaling these methods to large networks is challenging and, moreover, they cannot guarantee the absence of errors.
 We present VeriCon, the first system for verifying that an SDN program is correct on all admissible topologies and for all possible (infinite) sequences of network events. VeriCon either confirms the correctness of the controller program on all admissible network topologies or outputs a concrete counterexample. VeriCon uses first-order logic to specify admissible network topologies and desired network-wide invariants, and then implements classical Floyd-Hoare-Dijkstra deductive verification using Z3. Our preliminary experience indicates that VeriCon is able to rapidly verify correctness, or identify bugs, for a large repertoire of simple core SDN programs. VeriCon is compositional, in the sense that it verifies the correctness of execution of any single network event w.r.t. the specified invariant, and can thus scale to handle large programs. To relieve the burden of specifying inductive invariants from the programmer, VeriCon includes a separate procedure for inferring invariants, which is shown to be effective on simple controller programs. We view VeriCon as a first step en route to practical mechanisms for verifying network-wide invariants of SDN programs.

Diversifying trending topic discovery via Semidefinite Programming <=SEP=> Discovering trending topics from the Web has attracted much attention in recent years, due to users' increasing need for time-sensitive information. A large body of the existing research focuses on detecting trends by examining search traffic fluctuations, and the queries with large traffic increments would be detected as trends. The weakness of this approach is that the trends are dominated by popular fields such as celebrities, as those related queries have large search traffic. Consequently, other topics such as travel and shopping are rarely regarded as trends. In this paper, we present a scalable diversified trending topic discovery system with a MapReduce implementation. The trending topics are discovered based on three criteria: diversity, representativeness, and popularity. We explicitly model these three factors in our objective function and propose an efficient Semidefinite Programming algorithm to solve the corresponding optimization problem. To the best of our knowledge, no prior work in the literature tackles trending topic diversification. We conduct a comprehensive set of experiments with case studies to demonstrate the effectiveness of our approach. The proposed system has been successfully tested in the real-world operational environment, yielding significant improvement in traffic over the existing production system.

Deep Learning for Detection of Object-Based Forgery in Advanced Video <=SEP=> Passive video forensics has drawn much attention in recent years. However, research on detection of object-based forgery, especially for forged video encoded with advanced codec frameworks, is still a great challenge. In this paper, we propose a deep learning-based approach to detect object-based forgery in the advanced video. The presented deep learning approach utilizes a convolutional neural network (CNN) to automatically extract high-dimension features from the input image patches. Different from the traditional CNN models used in computer vision domain, we let video frames go through three preprocessing layers before being fed into our CNN model. They include a frame absolute difference layer to cut down temporal redundancy between video frames, a max pooling layer to reduce computational complexity of image convolution, and a high-pass filter layer to enhance the residual signal left by video forgery. In addition, an asymmetric data augmentation strategy has been established to get a similar number of positive and negative image patches before the training. The experiments have demonstrated that the proposed CNN-based model with the preprocessing layers has achieved excellent results.

Sample size estimation in diagnostic test studies of biomedical informatics <=SEP=> OBJECTIVES
This review provided a conceptual framework of sample size calculations in the studies of diagnostic test accuracy in various conditions and test outcomes.


METHODS
The formulae of sample size calculations for estimation of adequate sensitivity/specificity, likelihood ratio and AUC as an overall index of accuracy and also for testing in single modality and comparing two diagnostic tasks have been presented for desired confidence interval.


RESULTS
The required sample sizes were calculated and tabulated with different levels of accuracies and marginal errors with 95% confidence level for estimating and for various effect sizes with 80% power for purpose of testing as well. The results show how sample size is varied with accuracy index and effect size of interest.


CONCLUSION
This would help the clinicians when designing diagnostic test studies that an adequate sample size is chosen based on statistical principles in order to guarantee the reliability of study.

An ant colony algorithm for the multi-compartment vehicle routing problem <=SEP=> We demonstrate the use of Ant Colony System (ACS) to solve the capacitated vehicle routing problem associated with collection of recycling waste from households, treated as nodes in a spatial network. For networks where the nodes are concentrated in separate clusters, the use of k-means clustering can greatly improve the efficiency of the solution. The ACS algorithm is extended to model the use of multi-compartment vehicles with kerbside sorting of waste into separate compartments for glass, paper, etc. The algorithm produces high-quality solutions for two-compartment test problems.

TWO-WAY COMMUNICATION CHANNELS <=SEP=> input at terminal 2 and Y2 the corresponding output. Once each second, say, new inputs xi and x2 may be chosen from corresponding input alphabets and put into the channel; outputs yi and Y2 may then be observed. These outputs will be related statistically to the inputs and perhaps historically to previous inputs and outputs if the channel has memory. The problem is to communicate in both directions through the channel as effectively as possible. Particularly, we wish to determine what pairs of signalling rates R1 and R2 for the two directions can be approached with arbitrarily small error probabilities.

Stopping GAN Violence: Generative Unadversarial Networks <=SEP=> While the costs of human violence have attracted a great deal of attention from the research community, the effects of the network-on-network (NoN) violence popularised by Generative Adversarial Networks have yet to be addressed. In this work, we quantify the financial, social, spiritual, cultural, grammatical and dermatological impact of this aggression and address the issue by proposing a more peaceful approach which we term Generative Unadversarial Networks (GUNs). Under this framework, we simultaneously train two models: a generator G that does its best to capture whichever data distribution it feels it can manage, and a motivator M that helps G to achieve its dream. Fighting is strictly verboten and both models evolve by learning to respect their differences. The framework is both theoretically and electrically grounded in game theory, and can be viewed as a winner-shares-all two-player game in which both players work as a team to achieve the best score. Experiments show that by working in harmony, the proposed model is able to claim both the moral and log-likelihood high ground. Our work builds on a rich history of carefully argued position-papers, published as anonymous YouTube comments, which prove that the optimal solution to NoN violence is more GUNs. Takes skill to be real, time to heal each other Tupac Shakur, Changes, 1998

Discontinuous-Current Mode Operation of a Two-Phase Interleaved Boost DC–DC Converter With Coupled Inductor <=SEP=> A two-phase interleaved boost dc–dc converter with an inversely coupled inductor in a discontinuous-current mode (DCM) is analyzed by the equivalent inductance method. Coupling effects on the circuit statuses are described, and a forced conduction of the power diode or reverse-paralleled diode of MOSFET is caused by coupling. As a result, three major circuit statuses are figured out according to the physical relationship between the input–output voltage ratio and the coupling coefficient, and their condition boundaries are used to classify the DCM operation modes. Then, considering the load (duty cycle) variation, ten DCM operation modes are comprehensively analyzed. The analysis can be used to make an easy prediction of operation modes, and extended to the analysis of an interleaved buck converter or buck/boost bidirectional converter with a coupled inductor in DCM. At last, a 300-W prototype is built and tested in the lab to verify the analysis.

Key2Vec: Automatic Ranked Keyphrase Extraction from Scientific Articles using Phrase Embeddings <=SEP=> Keyphrase extraction is a fundamental task in natural language processing that facilitates mapping of documents to a set of representative phrases. In this paper, we present an unsupervised technique (Key2Vec) that leverages phrase embeddings for ranking keyphrases extracted from scientific articles. Specifically, we propose an effective way of processing text documents for training multi-word phrase embeddings that are used for thematic representation of scientific articles and ranking of keyphrases extracted from them using theme-weighted PageRank. Evaluations are performed on benchmark datasets producing state-of-the-art results.

The Democratization of Personal Consumer Loans? Determinants of Success in Online Peer-to-peer Loan Auctions <=SEP=> Online peer-to-peer (P2P) loan auctions enable individual consumers to borrow from, and lend money to, one another directly. We study the borrowerand auction-related determinants of funding success in these auctions by conceptualizing auction decision variables (loan amount, starting interest rate, duration) as mediators between borrower characteristics such as their demographic attributes, financial strength, and effort prior to the auction, and the likelihood of funding success. Borrower characteristics are also treated as moderators of the effects of auction decision variables on funding success. The results of our empirical study, conducted using a database of 5,370 completed P2P loan auctions, provide support for the proposed conceptual framework, and reveal a strong democratization of lending practices in P2P loan auctions. Although demographic attributes such as race and gender affect likelihood of the auction’s funding success, their effects are small when compared to those of borrowers’ financial strength and effort when listing and publicizing the auction. These results are substantially different from the documented discriminatory practices of regulated financial institutions in the US, suggesting that individual lenders bid more rationally when their own investment money is at stake. The paper concludes with specific suggestions to borrowers to increase their chances of receiving funding in P2P loan auctions, and a discussion of future research opportunities.

A review and analysis of churn prediction methods for customer retention in telecom industries <=SEP=> Customer churn prediction has gathered greater interest in business especially in telecommunications industries. Many authors have presented different versions of the churn prediction models greatly based on the data mining concepts employing the machine learning and meta-heuristic algorithms. This aim of this paper is to study some of the most important churn prediction techniques developed over the recent years. The primary objective is on the churn in telecom industries to accurately estimate the customer survival and customer hazard functions to gain the complete knowledge of churn over the customer tenure. Another objective is the identification of the customers who are at the blink of churn and approximating the time they will churn. This paper focuses on analyzing the churn prediction techniques to identify the churn behavior and validate the reasons for customer churn. This paper summarizes the churn prediction techniques in order to have a deeper understanding of the customer churn and it shows that most accurate churn prediction is given by the hybrid models rather than single algorithms so that telecom industries become aware of the needs of high risk customers and enhance their services to overturn the churn decision.

Anomaly Detection Algorithms in Business Process Logs <=SEP=> In some domains of application, like software development and health care processes, a normative business process system (e.g. workflow management system) is not appropriate because a flexible support is needed to the participants. On the other hand, while it is important to support flexibility of execution in these domains, security requirements can not be met whether these systems do not offer extra control, which characterizes a trade off between flexibility and security in such domains. This work presents and assesses a set of anomaly detection algorithms in logs of Process Aware Systems (PAS). The detection of an anomalous instance is based on the “noise” which an instance makes in a process model discovered by a process mining algorithm. As a result, a trace that is an anomaly for a discovered model will require more structural changes for this model fit it than a trace that is not an anomaly. Hence, when aggregated to PAS, these methods can support the coexistence of security and flexibility.

Bayesian Biosurveillance of Disease Outbreaks <=SEP=> Early, reliable detection of disease outbreaks is a critical problem today. This paper reports an investigation of the use of causal Bayesian networks to model spatio-temporal patterns of a non-contagious disease (respiratory anthrax infection) in a population of people. The number of parameters in such a network can become enormous, if not carefully managed. Also, inference needs to be performed in real time as population data stream in. We describe techniques we have applied to address both the modeling and inference challenges. A key contribution of this paper is the explication of assumptions and techniques that are sufficient to allow the scaling of Bayesian network modeling and inference to millions of nodes for real-time surveillance applications. The results reported here provide a proof-of-concept that Bayesian networks can serve as the foundation of a system that effectively performs Bayesian biosurveillance of disease outbreaks.

Unsupervised induction and filling of semantic slots for spoken dialogue systems using frame-semantic parsing <=SEP=> Spoken dialogue systems typically use predefined semantic slots to parse users' natural language inputs into unified semantic representations. To define the slots, domain experts and professional annotators are often involved, and the cost can be expensive. In this paper, we ask the following question: given a collection of unlabeled raw audios, can we use the frame semantics theory to automatically induce and fill the semantic slots in an unsupervised fashion? To do this, we propose the use of a state-of-the-art frame-semantic parser, and a spectral clustering based slot ranking model that adapts the generic output of the parser to the target semantic space. Empirical experiments on a real-world spoken dialogue dataset show that the automatically induced semantic slots are in line with the reference slots created by domain experts: we observe a mean averaged precision of 69.36% using ASR-transcribed data. Our slot filling evaluations also indicate the promising future of this proposed approach.

Existential consistency: measuring and understanding consistency at Facebook <=SEP=> Replicated storage for large Web services faces a trade-off between stronger forms of consistency and higher performance properties. Stronger consistency prevents anomalies, i.e., unexpected behavior visible to users, and reduces programming complexity. There is much recent work on improving the performance properties of systems with stronger consistency, yet the flip-side of this trade-off remains elusively hard to quantify. To the best of our knowledge, no prior work does so for a large, production Web service.
 We use measurement and analysis of requests to Facebook's TAO system to quantify how often anomalies happen in practice, i.e., when results returned by eventually consistent TAO differ from what is allowed by stronger consistency models. For instance, our analysis shows that 0.0004% of reads to vertices would return different results in a linearizable system. This in turn gives insight into the benefits of stronger consistency; 0.0004% of reads are potential anomalies that a linearizable system would prevent. We directly study local consistency models---i.e., those we can analyze using requests to a sample of objects---and use the relationships between models to infer bounds on the others.
 We also describe a practical consistency monitoring system that tracks &phis;-consistency, a new consistency metric ideally suited for health monitoring. In addition, we give insight into the increased programming complexity of weaker consistency by discussing bugs our monitoring uncovered, and anti-patterns we teach developers to avoid.