bluuebunny/crossref_metadata_2025_split huggingface dataset:
An abstract interpretation framework for termination
Authors: Cousot Patrick , Cousot Radhia 
Published: October 2012

Proof, verification and analysis methods for termination all rely on two induction principles: (1) a variant function or induction on data ensuring progress towards the end and (2) some form of induction on the program structure. The abstract interpretation design principle is first illustrated for the design of new forward and backward proof, verification and analysis methods for safety. The safety collecting semantics defining the strongest safety property of programs is first expressed in a constructive fixpoint form. Safety proof and checking/verification methods then immediately follow by fixpoint induction. Static analysis of abstract safety properties such as invariance are constructively designed by fixpoint abstraction (or approximation) to (automatically) infer safety properties. So far, no such clear design principle did exist for termination so that the existing approaches are scattered and largely not comparable with each other.
For (1), we show that this design principle applies equally well to potential and definite termination. The trace-based termination collecting semantics is given a fixpoint definition. Its abstraction yields a fixpoint definition of the best variant function. By further abstraction of this best variant function, we derive the Floyd/Turing termination proof method as well as new static analysis methods to effectively compute approximations of this best variant function.
For (2), we introduce a generalization of the syntactic notion of struc- tural induction (as found in Hoare logic) into a semantic structural induction based on the new semantic concept of inductive trace cover covering execution traces by segments, a new basis for formulating program properties. Its abstractions allow for generalized recursive proof, verification and static analysis methods by induction on both program structure, control, and data. Examples of particular instances include Floyd's handling of loop cutpoints as well as nested loops, Burstall's intermittent assertion total correctness proof method, and Podelski-Rybalchenko transition invariants.
Programming with binders and indexed data-types
Authors: Cave Andrew , Pientka Brigitte 
Published: October 2012

We show how to combine a general purpose type system for an existing language with support for programming with binders and contexts by refining the type system of ML with a restricted form of dependent types where index objects are drawn from contextual LF. This allows the user to specify formal systems within the logical framework LF and index ML types with contextual LF objects. Our language design keeps the index language generic only requiring decidability of equality of the index language providing a modular design. To illustrate the elegance and effectiveness of our language, we give programs for closure conversion and normalization by evaluation.
Our three key technical contribution are: 1) We give a bi-directional type system for our core language which is centered around refinement substitutions instead of constraint solving. As a consequence, type checking is decidable and easy to trust, although constraint solving may be undecidable. 2) We give a big-step environment based operational semantics with environments which lends itself to efficient implementation. 3) We prove our language to be type safe and have mechanized our theoretical development in the proof assistant Coq using the fresh approach to binding.
Randomized accuracy-aware program transformations for efficient approximate computations
Authors: Zhu Zeyuan Allen , Misailovic Sasa , Kelner Jonathan A. , Rinard Martin 
Published: October 2012

Despite the fact that approximate computations have come to dominate many areas of computer science, the field of program transformations has focused almost exclusively on traditional semantics-preserving transformations that do not attempt to exploit the opportunity, available in many computations, to acceptably trade off accuracy for benefits such as increased performance and reduced resource consumption.
We present a model of computation for approximate computations and an algorithm for optimizing these computations. The algorithm works with two classes of transformations: substitution transformations (which select one of a number of available implementations for a given function, with each implementation offering a different combination of accuracy and resource consumption) and sampling transformations (which randomly discard some of the inputs to a given reduction). The algorithm produces a (1+ε) randomized approximation to the optimal randomized computation (which minimizes resource consumption subject to a probabilistic accuracy specification in the form of a maximum expected error or maximum error variance).
Clarifying and compiling C/C++ concurrency
Authors: Batty Mark , Memarian Kayvan , Owens Scott , Sarkar Susmit , Sewell Peter 
Published: October 2012

The upcoming C and C++ revised standards add concurrency to the languages, for the first time, in the form of a subtle *relaxed memory model* (the *C++11 model*). This aims to permit compiler optimisation and to accommodate the differing relaxed-memory behaviours of mainstream multiprocessors, combining simple semantics for most code with high-performance *low-level atomics* for concurrency libraries. In this paper, we first establish two simpler but provably equivalent models for C++11, one for the full language and another for the subset without consume operations. Subsetting further to the fragment without low-level atomics, we identify a subtlety arising from atomic initialisation and prove that, under an additional condition, the model is equivalent to sequential consistency for race-free programs.
We then prove our main result, the correctness of two proposed compilation schemes for the C++11 load and store concurrency primitives to Power assembly, having noted that an earlier proposal was flawed. (The main ideas apply also to ARM, which has a similar relaxed memory architecture.)
This should inform the ongoing development of production compilers for C++11 and C1x, clarifies what properties of the machine architecture are required, and builds confidence in the C++11 and Power semantics.
Self-certification
Authors: Strub Pierre-Yves , Swamy Nikhil , Fournet Cedric , Chen Juan 
Published: October 2012

Well-established dependently-typed languages like Agda and Coq provide reliable ways to build and check formal proofs. Several other dependently-typed languages such as Aura, ATS, Cayenne, Epigram, F*, F7, Fine, Guru, PCML5, and Ur also explore reliable ways to develop and verify programs. All these languages shine in their own regard, but their implementations do not themselves enjoy the degree of safety provided by machine-checked verification. We propose a general technique called self-certification that allows a typechecker for a suitably expressive language to be certified for correctness. We have implemented this technique for F*, a dependently typed language on the .NET platform. Self-certification involves implementing a typechecker for F* in F*, while using all the conveniences F* provides for the compiler-writer (e.g., partiality, effects, implicit conversions, proof automation, libraries). This typechecker is given a specification (in~F*) strong enough to ensure that it computes valid typing derivations. We obtain a typing derivation for the core typechecker by running it on itself, and we export it to Coq as a type-derivation certificate. By typechecking this derivation (in Coq) and applying the F* metatheory (also mechanized in Coq), we conclude that our type checker is correct. Once certified in this manner, the F* typechecker is emancipated from Coq.
Self-certification leads to an efficient certification scheme---we no longer depend on verifying certificates in Coq---as well as a more broadly applicable one. For instance, the self-certified F* checker is suitable for use in adversarial settings where Coq is not intended for use, such as run-time certification of mobile code.
Constructing and sampling graphs with a prescribed joint degree distribution
Authors: Stanton Isabelle , Pinar Ali 
Published: October 2012

One of the most influential recent results in network analysis is that many natural networks exhibit a power-law or log-normal degree distribution. This has inspired numerous generative models that match this property. However, more recent work has shown that while these generative models do have the right degree distribution, they are not good models for real-life networks due to their differences on other important metrics like conductance. We believe this is, in part, because many of these real-world networks have very differentjoint degree distributions, that is, the probability that a randomly selected edge will be between nodes of degreekandl. Assortativity is a sufficient statistic of the joint degree distribution, and it has been previously noted that social networks tend to be assortative, while biological and technological networks tend to be disassortative.We suggest understanding the relationship between network structure and the joint degree distribution of graphs is an interesting avenue of further research. An important tool for such studies are algorithms that can generate random instances of graphs with the same joint degree distribution. This is the main topic of this article, and we study the problem from both a theoretical and practical perspective. We provide an algorithm for constructing simple graphs from a given joint degree distribution, and a Monte Carlo Markov chain method for sampling them. We also show that the state space of simple graphs with a fixed degree distribution is connected viaendpoint switches. We empirically evaluate the mixing time of this Markov chain by using experiments based on the autocorrelation of each edge. These experiments show that our Markov chain mixes quickly on these real graphs, allowing for utilization of our techniques in practice.
Discrete range searching primitive for the GPU and its applications
Authors: Soman Jyothish , Kothapalli Kishore , Narayanan P. J. 
Published: October 2012

Graphics processing units (GPUs) provide large computational power at a very low price, which position GPUs well as an ubiquitous accelerator. However, GPUs are space constrained, and hence applications developed for GPUs are space sensitive.
Space-constrained computational devices such as GPUs can greatly benefit from representations that reduce space consumption drastically. One such representation is the succinct representation of trees. Succinct representation of trees generally allows for operations such as parent queries, least common ancestor queries, and so on. Mapping such a robust representation to the GPU for targeted applications can lead to substantial improvement in problem sizes that are processed at a given point of time. Space-saving methods such as succinct data structures remain largely unexplored on the GPU. In this work, a succinct representation of ordered trees on the GPU is explored, with application to discrete range searching (DRS).
Based on the succinct representations found applicable, a space--saving solution for DRS is presented here. In our method, DRS is mapped to a least common ancestor query on a Cartesian tree. For space-efficient DRS queries, we store the succinct representation of the Cartesian tree of an array. Our method uses a maximum of 7.5 bits of additional space per element. Furthermore, the speed-up achieved by our method is in the range of 20--25 for preprocessing and 25--35 for batch querying over a sequential implementation. Compared to an 8-threaded implementation, our preprocessing and querying methods obtain a speed-up of 6--8.
We also study the applications of the DRS on the GPU. Efficient primitives expand the range of applications performed on the GPU. DRS is one such primitive with direct applications to string processing, document and text retrieval systems, and least common ancestor queries. We suggest that graph algorithms that use the least common ancestor, can be enabled on the GPU based on DRS primitive. We also show some applications of DRS in tree queries and string querying.
Profile of male forensic psychiatric inpatients in South India
Authors: Kumar Dayachandra , Viswanath Biju , Sebestian Ami , Holla Bharath , Konduru Reddema , Chandrashekar Chanapatna Rajannachar , Math Suresh Bada 
Published: October 2012

Aim: The study explored the socio-demographic, clinical and legal profile of forensic psychiatric inpatients in an attempt to improve the existing mental health services for prisoners within the prison and in psychiatric hospitals. Methodology: A chart review of 135 forensic psychiatric inpatients admitted between January 2005 and December 2009 was done. A structured data-extraction tool was used for data collection and a descriptive approach for analyses. Results: Subjects were referred either directly from prison (62.2%) or from court (37.8%) for diagnosis, treatment or certification. References to the Mental Health Act 1987, charges and inclusion of first investigation report and behavioural observation report was lacking in most. The majority of prisoners (85.7%) were under trial, murder being the most common charge. Psychiatric diagnosis was made in 90.3%, the most common being psychosis. Substance use (nicotine, alcohol, cannabis) and high-risk behaviours were also common. Conclusion: There is a need to streamline the procedure of referral and to sensitize the referral authorities about the Mental Health Act and mental illnesses, and the need to enclose first investigation reports and behavioural observation reports. De-addiction services and facilities need to be established within prison premises so that the inmates get the benefit of treatment at the earliest opportunity.
Do alternative methods of reporting non-controlling interests really matter?
Authors: Lopes Ana I , Lourenço Isabel , Soliman Mark 
Published: October 2012

Researchers have long been interested in whether the classification of various items on the balance sheet matters to investors. This paper provides evidence on whether reporting non-controlling interests (NCI) as equity or as non-equity matters in terms of value relevance. We use a sample of German firms that voluntary adopted International Financial Reporting Standards early. This adoption required them to change their reporting of NCI from the non-equity to the equity portion of the balance sheet. After conducting sensitivity tests for self-selection bias and controlling for weight of NCI, firm size and leverage, our results suggest that NCI are priced by the market in the same manner irrespectively of being reported as equity or non-equity. This finding reinforces the notion that equity markets are efficient in their processing of information, regardless of the classification by standard setters. JEL Classification: M41-Accounting.
Randomised multicentre trial on safety and efficacy of rivastigmine in cognitively impaired multiple sclerosis patients
Authors: Mäurer M , Ortler S , Baier M , Meergans M , Scherer P , Hofmann WE , Tracik F 
Published: October 2012

Background: Cognitive decline has been recognised as a frequent symptom in multiple sclerosis (MS). Cholinesterase inhibitors (ChEIs) are employed for the treatment of Alzheimer’s disease, but there is some evidence that ChEIs might also be effective in MS patients with cognitive deficits, particularly deficits of memory function. Objective: The aim of this study was to evaluate efficacy on memory function and safety of the ChEI rivastigmine in MS patients with cognitive deficits as measured by the change from baseline of the total recall score of the selective reminding test (SRT) after 16 weeks of treatment. Methods: Efficacy and safety of rivastigmine were analysed in a 16-week, multicentre, double-blind, randomised, placebo-controlled study, followed by an optional one-year open-label treatment phase. Effects of rivastigmine and placebo were compared by an analysis of covariance. Results: In total, 86 patients were enrolled. Patients who received rivastigmine ( n = 43) showed a non-significant increase in total recall score (sum of all words immediately recalled over all six trials) over placebo ( n = 38) after 16 weeks of treatment ( p = 0.2576). Other outcome measures provided no evidence supporting benefits of rivastigmine. Treatment with rivastigmine was well tolerated. Conclusions: With the results of this study, the need for an effective therapy in cognitively impaired MS patients is still required. Thus, intensive and continued clinical research is required to explore therapeutic options for cognitive deficits in MS patients.
Human basophils interact with memory T cells to augment Th17 responses
Authors: Wakahara Keiko , Baba Nobuyasu , Van Vu Quang , Bégin Philippe , Rubio Manuel , Ferraro Pasquale , Panzini Benoît , Wassef Ramses , Lahaie Raymond , Caussignac Yves , Tamaz Raja , Richard Carole , Soucy Geneviève , Delespesse Guy , Sarfati Marika 
Published: October 2012

AbstractBasophils are a rare population of granulocytes that have long been associated with IgE-mediated and Th2-associated allergic diseases. However, the role of basophils in Th17 and/or Th1 diseases has not been reported. In the present study, we report that basophils can be detected in the mucosa of Th17-associated lung and inflammatory bowel disease and accumulate in inflamed colons containing large quantities of IL-33. We also demonstrate that circulating basophils increased memory Th17 responses. Accordingly, IL-3– or IL-33–activated basophils amplified IL-17 release in effector memory T cells (TEM), central memory T cells (TCM), and CCR6+ CD4 T cells. More specifically, basophils promoted the emergence of IL-17+IFN-γ− and IL-17+IFN-γ+, but not IL-17−IFN-γ+ CD4 T cells in TEM and TCM. Mechanistic analysis revealed that the enhancing effect of IL-17 production by basophils in TEM involved the ERK1/2 signaling pathway, occurred in a contact-independent manner, and was partially mediated by histamine via H2 and H4 histamine receptors. The results of the present study reveal a previously unknown function for basophils in augmenting Th17 and Th17/Th1 cytokine expression in memory CD4 T cells. Because basophils accumulated in inflamed inflammatory bowel disease tissues, we propose that these cells are key players in chronic inflammatory disorders beyond Th2.
Gene number determination and genetic polymorphism of the gamma delta T cell co-receptor WC1 genes
Authors: Chen Chuang , Herzig Carolyn TA , Alexander Leeson J , Keele John W , McDaneld Tara G , Telfer Janice C , Baldwin Cynthia L 
Published: October 2012

AbstractBackgroundWC1 co-receptors belong to the scavenger receptor cysteine-rich (SRCR) superfamily and are encoded by a multi-gene family. Expression of particular WC1 genes defines functional subpopulations of WC1+γδ T cells. We have previously identified partial or complete genomic sequences for thirteen different WC1 genes through annotation of the bovine genome Btau_3.1 build. We also identified two WC1 cDNA sequences from other cattle that did not correspond to sequences in the Btau_3.1 build. Their absence in the Btau_3.1 build may have reflected gaps in the genome assembly or polymorphisms among animals. Since the response of γδ T cells to bacterial challenge is determined by WC1 gene expression, it was critical to understand whether individual cattle or breeds differ in the number of WC1 genes or display polymorphisms.ResultsReal-time quantitative PCR using DNA from the animal whose genome was sequenced (“Dominette”) and sixteen other animals representing ten breeds of cattle, showed that the number of genes coding for WC1 co-receptors is thirteen. The complete coding sequences of those thirteen WC1 genes is presented, including the correction of an error in theWC1-2gene due to mis-assembly in the Btau_3.1 build. All other cDNA sequences were found to agree with the previous annotation of complete or partial WC1 genes. PCR amplification and sequencing of the most variable N-terminal SRCR domain (domain 1 which has the SRCR “a” pattern) of each of the thirteen WC1 genes showed that the sequences are highly conserved among individuals and breeds. Of 160 sequences of domain 1 from three breeds of cattle, no additional sequences beyond the thirteen described WC1 genes were found. Analysis of the complete WC1 cDNA sequences indicated that the thirteen WC1 genes code for three distinct WC1 molecular forms.ConclusionThe bovine WC1 multi-gene family is composed of thirteen genes coding for three structural forms whose sequences are highly conserved among individual cattle and breeds. The sequence diversity necessary for WC1 genes to function as a multi-genic pattern recognition receptor array is encoded in the genome, rather than generated by recombinatorial diversity or hypermutation.
Rapidly progressing subperiosteal orbital abscess: an unexpected complication of a group-A streptococcal pharyngitis in a healthy young patient
Authors: Costantinides Fulvia , Luzzati Roberto , Tognetto Daniele , Bazzocchi Gabriele , Biasotto Matteo , Tirelli Gian Carlo 
Published: October 2012

AbstractIntroductionComplications associated to group-A streptococcal pharyingitis include non-suppurative complications such as acute rheumatic fever and glomerulonephritis and suppurative complications such as peritonsillar or retropharyngeal abscess, sinusitis, mastoiditis, otitis media, meningitis, brain abscess, or thrombosis of the intracranial venous sinuses.Case presentationWe described a case of a 15-year-old patient with a history of acute pharyngodinia early followed by improvise fever and a progressive formation of a diffuse orbital edema, corneal hyperaemia, diplopia and severe decrease of visual acuity.The patient was surgically treated with functional endoscopic sinus surgery (FESS) after the response of a maxillofacial computed tomography scans that showed a pansinusitis complicated by a left orbital cellulites. Numerous colonies ofStreptococcus pyogeneswere found in the samples of pus and an antibiotic therapy with meropenem was initiated on the basis of the sensitivity test to antibiotics. The patient was finally discharged with diagnosis of left orbital cellulites with periorbital abscess, endophtalmitis and acute pansinusitis as a consequence of streptococcal pharyngitis.ConclusionThe case highlights the possible unusual complication of a group-A streptococcal pharyingitis in a immunocompetent child and the needing of a prompt surgical and medical approach toward the maxillofacial complications associated to the infection.