940 resultados para Equivalence-preserving


Relevância:

20.00% 20.00%

Publicador:

Resumo:

The lack of a systematic approach in Australia to recording and preserving legal history was highlighted in the article by Catherine Hutchins in the August 2002 issue of the Australian Bar Review. This article describes the modest, albeit continuing, efforts on the part of the Supreme Court Library to meet this need in the State of Queensland. The efforts began in 1983 and have recently escalated with a series of exhibitions, talks, displays, interviews and preservations of documents (from online publication).

Relevância:

20.00% 20.00%

Publicador:

Resumo:

To estimate the mid-point of an open-ended income category and to assess the impact of two equivalence scales on income-health associations. Data were obtained from the 2010 Brazilian Oral Health Survey ( Pesquisa Nacional de Saúde Bucal – SBBrasil 2010). Income was converted from categorical to two continuous variables ( per capita and equivalized) for each mid-point. The median mid-point was R$ 14,523.50 and the mean, R$ 24,507.10. When per capita income was applied, 53% of the population were below the poverty line, compared with 15% with equivalized income. The magnitude of income-health associations was similar for continuous income, but categorized equivalized income tended to decrease the strength of association.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Journal of Algebra, 321 (2009), p. 743–757

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We examine the constraints on the two Higgs doublet model (2HDM) due to the stability of the scalar potential and absence of Landau poles at energy scales below the Planck scale. We employ the most general 2HDM that incorporates an approximately Standard Model (SM) Higgs boson with a flavor aligned Yukawa sector to eliminate potential tree-level Higgs-mediated flavor changing neutral currents. Using basis independent techniques, we exhibit robust regimes of the 2HDM parameter space with a 125 GeV SM-like Higgs boson that is stable and perturbative up to the Planck scale. Implications for the heavy scalar spectrum are exhibited.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Glasgow Mathematical Journal, nº 47 (2005), pg. 413-424

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Semigroup Forum vol. 68 (2004), p. 335–356

Relevância:

20.00% 20.00%

Publicador:

Resumo:

This paper presents a mechanically verified implementation of an algorithm for deciding the equivalence of Kleene algebra terms within the Coq proof assistant. The algorithm decides equivalence of two given regular expressions through an iterated process of testing the equivalence of their partial derivatives and does not require the construction of the corresponding automata. Recent theoretical and experimental research provides evidence that this method is, on average, more efficient than the classical methods based on automata. We present some performance tests, comparisons with similar approaches, and also introduce a generalization of the algorithm to decide the equivalence of terms of Kleene algebra with tests. The motivation for the work presented in this paper is that of using the libraries developed as trusted frameworks for carrying out certified program verification.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Linear logic has long been heralded for its potential of providing a logical basis for concurrency. While over the years many research attempts were made in this regard, a Curry-Howard correspondence between linear logic and concurrent computation was only found recently, bridging the proof theory of linear logic and session-typed process calculus. Building upon this work, we have developed a theory of intuitionistic linear logic as a logical foundation for session-based concurrent computation, exploring several concurrency related phenomena such as value-dependent session types and polymorphic sessions within our logical framework in an arguably clean and elegant way, establishing with relative ease strong typing guarantees due to the logical basis, which ensure the fundamental properties of type preservation and global progress, entailing the absence of deadlocks in communication. We develop a general purpose concurrent programming language based on the logical interpretation, combining functional programming with a concurrent, session-based process layer through the form of a contextual monad, preserving our strong typing guarantees of type preservation and deadlock-freedom in the presence of general recursion and higher-order process communication. We introduce a notion of linear logical relations for session typed concurrent processes, developing an arguably uniform technique for reasoning about sophisticated properties of session-based concurrent computation such as termination or equivalence based on our logical approach, further supporting our goal of establishing intuitionistic linear logic as a logical foundation for sessionbased concurrency.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The present paper is devoted to the study of linear maps preserving certain relations, such as the sharp partial order and the star partial order in semisimple Banach algebras and C*-algebras.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study the problem of privacy-preserving proofs on authenticated data, where a party receives data from a trusted source and is requested to prove computations over the data to third parties in a correct and private way, i.e., the third party learns no information on the data but is still assured that the claimed proof is valid. Our work particularly focuses on the challenging requirement that the third party should be able to verify the validity with respect to the specific data authenticated by the source — even without having access to that source. This problem is motivated by various scenarios emerging from several application areas such as wearable computing, smart metering, or general business-to-business interactions. Furthermore, these applications also demand any meaningful solution to satisfy additional properties related to usability and scalability. In this paper, we formalize the above three-party model, discuss concrete application scenarios, and then we design, build, and evaluate ADSNARK, a nearly practical system for proving arbitrary computations over authenticated data in a privacy-preserving manner. ADSNARK improves significantly over state-of-the-art solutions for this model. For instance, compared to corresponding solutions based on Pinocchio (Oakland’13), ADSNARK achieves up to 25× improvement in proof-computation time and a 20× reduction in prover storage space.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The publication, Approved Drug Products with Therapeutic Equivalence Evaluations (the List, commonly known as the Orange Book), identifies drug products approved on the basis of safety and effectiveness by the Food and Drug Administration (FDA) under the Federal Food, Drug, and Cosmetic Act (the Act). Drugs on the market approved only on the basis of safety (covered by the ongoing Drug Efficacy Study Implementation [DESI] review [e.g., Donnatal® Tablets and Librax® Capsules] or pre-1938 drugs [e.g., Phenobarbital Tablets]) are not included in this publication. The main criterion for the inclusion of any product is that the product is the subject of an application with an effective approval that has not been withdrawn for safety or efficacy reasons. Inclusion of products on the List is independent of any current regulatory action through administrative or judicial means against a drug product. In addition, the List contains therapeutic equivalence evaluations for approved multisource prescription drug products. These evaluations have been prepared to serve as public information and advice to state health agencies, prescribers, and pharmacists to promote public education in the area of drug product selection and to foster containment of health care costs. Therapeutic equivalence evaluations in this publication are not official FDA actions affecting the legal status of products under the Act.