Quark-gluon vertex dressing and meson masses beyond ladder-rainbow truncation

We include a generalized infinite class of quark-gluon vertex dressing diagrams in a study of how dynamics beyond the ladder-rainbow truncation influences the Bethe-Salpeter description of light quark pseudoscalar and vector mesons. The diagrammatic specification of the vertex is mapped into a corresponding specification of the Bethe-Salpeter kernel, which preserves chiral symmetry. This study adopts the algebraic format afforded by the simple interaction kernel used in previous work on this topic. The new feature of the present work is that in every diagram summed for the vertex and the corresponding Bethe-Salpeter kernel, each quark-gluon vertex is required to be the self-consistent vertex solution. We also adopt from previous work the effective accounting for the role of the explicitly non-Abelian three gluon coupling in a global manner through one parameter determined from recent lattice-QCD data for the vertex. With the more consistent vertex used here, the error in ladder-rainbow truncation for vector mesons is never more than 10% as the current quark mass is varied from the u/d region to the b region.Comment: 15 pages, 12 figure

Linearization of CIF Through SOS

Linearization is the procedure of rewriting a process term into a linear form, which consist only of basic operators of the process language. This procedure is interesting both from a theoretical and a practical point of view. In particular, a linearization algorithm is needed for the Compositional Interchange Format (CIF), an automaton based modeling language. The problem of devising efficient linearization algorithms is not trivial, and has been already addressed in literature. However, the linearization algorithms obtained are the result of an inventive process, and the proof of correctness comes as an afterthought. Furthermore, the semantic specification of the language does not play an important role on the design of the algorithm. In this work we present a method for obtaining an efficient linearization algorithm, through a step-wise refinement of the SOS rules of CIF. As a result, we show how the semantic specification of the language can guide the implementation of such a procedure, yielding a simple proof of correctness.Comment: In Proceedings EXPRESS 2011, arXiv:1108.407

Specification format and a verification method of fault-tolerant quantum circuits

© 2018 American Physical Society. Quantum computations are expressed in general as quantum circuits, which are specified by ordered lists of quantum gates. The resulting specifications are used during the optimization and execution of the expressed computations. However, the specification format makes it difficult to verify that optimized or executed computations still conform to the initial gate list specifications: showing the computational equivalence between two quantum circuits expressed by different lists of quantum gates is exponentially complex in the worst case. In order to solve this issue, this work presents a derivation of the specification format tailored specifically for fault-tolerant quantum circuits. The circuits are considered a form consisting entirely of single qubit initializations, cnot gates, and single qubit measurements (ICM form). This format allows, under certain assumptions, to efficiently verify optimized (or implemented) computations. Two verification methods based on checking stabilizer circuit structures are presented

Mapping the NGSI-LD Context Model on Top of a SPARQL Event Processing Architecture: Implementation Guidelines

NGSI-LD is an open specification released by ETSI which proposes an information model and an API for an easy to use and standard management of context information. The NGSI-LD information model is framed within an ontology and adopts JSON-LD as serialization format for context information. This paper presents an approach to the implementation of the NGSI-LD specification over a SPARQL Event Processing Architecture. This work is being developed within the European-Brasilian H2020 SWAMP project focused on implementing an Internet of Things platform providing services for smart water management in agriculture

Inductive-data-type Systems

In a previous work ("Abstract Data Type Systems", TCS 173(2), 1997), the last two authors presented a combined language made of a (strongly normalizing) algebraic rewrite system and a typed lambda-calculus enriched by pattern-matching definitions following a certain format, called the "General Schema", which generalizes the usual recursor definitions for natural numbers and similar "basic inductive types". This combined language was shown to be strongly normalizing. The purpose of this paper is to reformulate and extend the General Schema in order to make it easily extensible, to capture a more general class of inductive types, called "strictly positive", and to ease the strong normalization proof of the resulting system. This result provides a computation model for the combination of an algebraic specification language based on abstract data types and of a strongly typed functional language with strictly positive inductive types.Comment: Theoretical Computer Science (2002

Using EPUB 3 and the open web platform for enhanced presentation and machine-understandable metadata for digital comics

Various methods are needed to extract information from current (digital) comics. Furthermore, the use of different (proprietary) formats by comic distribution platforms causes an overhead for authors. To overcome these issues, we propose a solution that makes use of the EPUB 3 specification, additionally leveraging the Open Web Platform to support animations, reading assistance, audio and multiple languages in a single format, by using our JavaScript library comicreader.js. We also provide administrative and descriptive metadata in the same format by introducing a new ontology: Dicera. Our solution is complementary to the current extraction methods, on the one hand because they can help with metadata creation, and on the other hand because the machine-understandable metadata alleviates their use. While the reading system support for our solution is currently limited, it can offer all features needed by current comic distribution platforms. When comparing comics generated by our solution to EPUB 3 textbooks, we observed an increase in file size, mainly due to the use of images. In future work, our solution can be further improved by extending the presentation features, investigating different types of comics, studying the use of new EPUB 3 extensions, and by incorporating it in digital book authoring environments

Question and test interoperability: introducing version 2 of the IMS QTI specification

The Question and Test Interoperability (QTI) specification describes an XML-based technical format for the coding and exchange of assessment content from individual questions through to complete tests. The specification was first published by the IMS Global Learning Consortium in June 2000 and since then an increasing number of developers have used it as a guide to implementing assessment functionality in their e-learning systems, in addition to the more established assessment tool providers who have added QTI export/import facilities to their products. In September 2003, IMS approved a project to develop version 2 of the specification, concentrating on the format of individual 'items' and the way they can be packaged and integrated into authored learning experiences based on the companion specifications known as Simple Sequencing and Learning Design. At the time of writing, a draft of version 2 is being prepared for public review and should be available for review from the IMS website two weeks before the CAA 2004 Conference. Version 2 will represent a significant step forward for the specification, addressing many of the issues that have been raised by developers and providing some powerful new capabilities based on some of the extensions to version 1 that have developed within the community. Readers are encouraged to review the public draft for detailed technical information. This paper will concentrate on the more general issues raised with version 1 of the specification and how they are being addressed. It also attempts to address some more general criticisms of technical standardization work as a whole

A formal MIM specification and tools for the common exchange of MIM diagrams: an XML-Based format, an API, and a validation method

<p>Abstract</p> <p>Background</p> <p>The Molecular Interaction Map (MIM) notation offers a standard set of symbols and rules on their usage for the depiction of cellular signaling network diagrams. Such diagrams are essential for disseminating biological information in a concise manner. A lack of software tools for the notation restricts wider usage of the notation. Development of software is facilitated by a more detailed specification regarding software requirements than has previously existed for the MIM notation.</p> <p>Results</p> <p>A formal implementation of the MIM notation was developed based on a core set of previously defined glyphs. This implementation provides a detailed specification of the properties of the elements of the MIM notation. Building upon this specification, a machine-readable format is provided as a standardized mechanism for the storage and exchange of MIM diagrams. This new format is accompanied by a Java-based application programming interface to help software developers to integrate MIM support into software projects. A validation mechanism is also provided to determine whether MIM datasets are in accordance with syntax rules provided by the new specification.</p> <p>Conclusions</p> <p>The work presented here provides key foundational components to promote software development for the MIM notation. These components will speed up the development of interoperable tools supporting the MIM notation and will aid in the translation of data stored in MIM diagrams to other standardized formats. Several projects utilizing this implementation of the notation are outlined herein. The MIM specification is available as an additional file to this publication. Source code, libraries, documentation, and examples are available at <url>http://discover.nci.nih.gov/mim</url>.</p

SBMLPkgSpec: a LaTeX style file for SBML package specification documents

Objective: The Systems Biology Markup Language (SBML) is a popular open format for storing and exchanging computational models in biology. The definition of SBML is captured in formal specification documents. SBMLPkgSpec is a LaTeX document style intended to fill the need for a standard format for writing such specification documents. Results: Specification documents for SBML Level 3 extensions (known as packages in SBML) are made more uniform with the use of a standard template. SBMLPkgSpec is a LaTeX class that provides a document framework for SBML Level 3 package specifications, to simplify the work of document authors while improving the overall quality of the family of SBML specifications