5,396 research outputs found

    SECaps: A Sequence Enhanced Capsule Model for Charge Prediction

    Full text link
    Automatic charge prediction aims to predict appropriate final charges according to the fact descriptions for a given criminal case. Automatic charge prediction plays a critical role in assisting judges and lawyers to improve the efficiency of legal decisions, and thus has received much attention. Nevertheless, most existing works on automatic charge prediction perform adequately on high-frequency charges but are not yet capable of predicting few-shot charges with limited cases. In this paper, we propose a Sequence Enhanced Capsule model, dubbed as SECaps model, to relieve this problem. Specifically, following the work of capsule networks, we propose the seq-caps layer, which considers sequence information and spatial information of legal texts simultaneously. Then we design a attention residual unit, which provides auxiliary information for charge prediction. In addition, our SECaps model introduces focal loss, which relieves the problem of imbalanced charges. Comparing the state-of-the-art methods, our SECaps model obtains 4.5% and 6.4% absolutely considerable improvements under Macro F1 in Criminal-S and Criminal-L respectively. The experimental results consistently demonstrate the superiorities and competitiveness of our proposed model.Comment: 13 pages, 3figures, 5 table

    Methadone, Buprenorphine, and Street Drug Interactions with Antiretroviral Medications

    Get PDF
    While street drugs appear unlikely to alter the metabolism of antiretroviral (ARV) medications, several ARVs may induce or inhibit metabolism of various street drugs. However, research on these interactions is limited. Case reports have documented life-threatening overdoses of ecstasy and gamma-hydroxybutyrate after starting ritonavir, an ARV that inhibits several metabolic enzymes. For opioid addiction, methadone or buprenorphine are the treatments of choice. Because a number of ARVs decrease or increase methadone levels, patients should be monitored for methadone withdrawal or toxicity when they start or stop ARVs. Most ARVs do not cause buprenorphine withdrawal or toxicity, even if they alter buprenorphine levels, with rare exceptions to date including atazanavir/ritonavir associated with significant increases in buprenorphine and adverse events related to sedation and mental status changes in some cases. There are newer medications yet to be studied with methadone or buprenorphine. Further, there are many frequently used medications in treatment of complications of HIV disease that have not been studied. There is need for continuing research to define these drug interactions and their clinical significance

    MSI PARENTERAL PARECOXIB FOLLOWED BY ORAL VALDECOXIB AFTER MAJOR GENERAL SURGERY REDUCES OPIOID CONSUMPTION AND OPIOID-RELATED SYMPTOMS

    Get PDF

    Updatable Blockchains

    Get PDF
    Software updates for blockchain systems become a real challenge when they impact the underlying consensus mechanism. The activation of such changes might jeopardize the integrity of the blockchain by resulting in chain splits. Moreover, the software update process should be handed over to the community and this means that the blockchain should support updates without relying on a trusted party. In this paper, we introduce the notion of updatable blockchains and show how to construct blockchains that satisfy this definition. Informally, an updatable blockchain is a secure blockchain and in addition it allows to update its protocol preserving the history of the chain. In this work, we focus only on the processes that allow securely switching from one blockchain protocol to another assuming that the blockchain protocols are correct. That is, we do not aim at providing a mechanism that allows reaching consensus on what is the code of the new blockchain protocol. We just assume that such a mechanism exists (like the one proposed in NDSS 2019 by Zhang et. al), and show how to securely go from the old protocol to the new one. The contribution of this paper can be summarized as follows. We provide the first formal definition of updatable ledgers and propose the description of two compilers. These compilers take a blockchain and turn it into an updatable blockchain. The first compiler requires the structure of the current and the updated blockchain to be very similar (only the structure of the blocks can be different) but it allows for an update process more simple, efficient. The second compiler that we propose is very generic (i.e., makes few assumptions on the similarities between the structure of the current blockchain and the update blockchain). The drawback of this compiler is that it requires the new blockchain to be resilient against a specific adversarial behaviour and requires all the honest parties to be online during the update process. However, we show how to get rid of the latest requirement (the honest parties being online during the update) in the case of proof-of-work and proof-of-stake ledgers

    T-Branes and Monodromy

    Get PDF
    We introduce T-branes, or "triangular branes," which are novel non-abelian bound states of branes characterized by the condition that on some loci, their matrix of normal deformations, or Higgs field, is upper triangular. These configurations refine the notion of monodromic branes which have recently played a key role in F-theory phenomenology. We show how localized matter living on complex codimension one subspaces emerge, and explain how to compute their Yukawa couplings, which are localized in complex codimension two. Not only do T-branes clarify what is meant by brane monodromy, they also open up a vast array of new possibilities both for phenomenological constructions and for purely theoretical applications. We show that for a general T-brane, the eigenvalues of the Higgs field can fail to capture the spectrum of localized modes. In particular, this provides a method for evading some constraints on F-theory GUTs which have assumed that the spectral equation for the Higgs field completely determines a local model.Comment: 110 pages, 5 figure

    Round-Optimal Secure Two-Party Computation from Trapdoor Permutations

    Get PDF
    In this work we continue the study on the round complexity of secure two-party computation with black-box simulation. Katz and Ostrovsky in CRYPTO 2004 showed a 5 (optimal) round construction assuming trapdoor permutations for the general case where both players receive the output. They also proved that their result is round optimal. This lower bound has been recently revisited by Garg et al. in Eurocrypt 2016 where a 4 (optimal) round protocol is showed assuming a simultaneous message exchange channel. Unfortunately there is no instantiation of the protocol of Garg et al. under standard polynomial-time hardness assumptions. In this work we close the above gap by showing a 4 (optimal) round construction for secure two-party computation in the simultaneous message channel model with black-box simulation, assuming trapdoor permutations against polynomial-time adversaries. Our construction for secure two-party computation relies on a special 4-round protocol for oblivious transfer that nicely composes with other protocols in parallel. We define and construct such special oblivious transfer protocol from trapdoor permutations. This building block is clearly interesting on its own. Our construction also makes use of a recent advance on non-malleability: a delayed-input 4-round non-malleable zero knowledge argument

    Uncertainty quantification for kinetic models in socio-economic and life sciences

    Full text link
    Kinetic equations play a major rule in modeling large systems of interacting particles. Recently the legacy of classical kinetic theory found novel applications in socio-economic and life sciences, where processes characterized by large groups of agents exhibit spontaneous emergence of social structures. Well-known examples are the formation of clusters in opinion dynamics, the appearance of inequalities in wealth distributions, flocking and milling behaviors in swarming models, synchronization phenomena in biological systems and lane formation in pedestrian traffic. The construction of kinetic models describing the above processes, however, has to face the difficulty of the lack of fundamental principles since physical forces are replaced by empirical social forces. These empirical forces are typically constructed with the aim to reproduce qualitatively the observed system behaviors, like the emergence of social structures, and are at best known in terms of statistical information of the modeling parameters. For this reason the presence of random inputs characterizing the parameters uncertainty should be considered as an essential feature in the modeling process. In this survey we introduce several examples of such kinetic models, that are mathematically described by nonlinear Vlasov and Fokker--Planck equations, and present different numerical approaches for uncertainty quantification which preserve the main features of the kinetic solution.Comment: To appear in "Uncertainty Quantification for Hyperbolic and Kinetic Equations

    Partially Supersymmetric Composite Higgs Models

    Get PDF
    We study the idea of the Higgs as a pseudo-Goldstone boson within the framework of partial supersymmetry in Randall-Sundrum scenarios and their CFT duals. The Higgs and third generation of the MSSM are composites arising from a strongly coupled supersymmetric CFT with global symmetry SO(5) spontaneously broken to SO(4), whilst the light generations and gauge fields are elementary degrees of freedom whose couplings to the strong sector explicitly break the global symmetry as well as supersymmetry. The presence of supersymmetry in the strong sector may allow the compositeness scale to be raised to ~10 TeV without fine tuning, consistent with the bounds from precision electro-weak measurements and flavour physics. The supersymmetric flavour problem is also solved. At low energies, this scenario reduces to the "More Minimal Supersymmetric Standard Model" where only stops, Higgsinos and gauginos are light and within reach of the LHC.Comment: 28 pages. v2 minor changes and Refs. adde
    • …
    corecore