L132
Major Opioid Maker to Pay for Overdose-Antidote Development
A company whose prescription opioid marketing practices are being blamed for sparking the addiction and overdose crisis says it's helping to fund an effort to make a lower-cost overdose antidote.
OxyContin maker Purdue Pharma announced Wednesday that it's making a $3.4 million grant to Harm Reduction Therapeutics, a Pittsburgh-based nonprofit, to help develop a low-cost naloxone nasal spray.
The announcement comes as lawsuits from local governments blaming Purdue, based in Stamford, Connecticut, and other companies in the drug industry for using deceptive marketing practices to encourage heavy prescribing of the powerful and addictive painkillers. Last week, the number of lawsuits against the industry being overseen by a federal judge topped 1,000.
The Cleveland-based judge, Dan Polster, is pushing the industry to settle with the plaintiffs — mostly local governments and Native American tribes — and with state governments, most of which have sued in state court or are conducting a joint investigation. Hundreds of other local governments are also suing in state courts across the country.
The sides have had regular settlement discussions, but it's not clear when a deal might be struck in the case, which is complicated by the number of parties and questions on how to assign blame.
The U.S. Centers for Disease Control and Prevention reported that drug overdoses killed a record 72,000 Americans last year. The majority of the deaths involved opioids. But a growing number of them are from illicit synthetic drugs, including fentanyl, rather than prescription opioids such as OxyContin or Vicodin.
Governments are asking for changes in how opioids are marketed, and for help paying for treatment and the costs of ambulance runs, child welfare systems, jails and other expenses associated with the opioid crisis.
Polster is expected to rule in coming weeks on motions from drugmakers, distributors and pharmacies to dismiss thee claims. Trials in some of the cases — being used to test issues common to many of them — are now scheduled to begin in September 2019.
Purdue agreed to pay $634 million in fines back in 2007 to settle charges that the company downplayed the risk of addiction and abuse of its blockbuster painkiller OxyContin starting in the 1990s.
L132的更多相关文章
- 细化如何安装LNMP + Zabbix 监控安装文档以及故障排除
1.LNMP所需安装包: 上传如下软件包到/soft目录中 mysql- (centos6. 64位自带)也可根据版本自行挑选,前提你了解这个版本 pcre-8.36.tar.gz nginx-.ta ...
- dmalloc 原文 翻译整理
http://blog.csdn.net/cardinal_508/article/details/5553387 L13 从快速入门开始(Quickstart) 这个库是一个文件中所有简化用法中最常 ...
- WPF控件NumericUpDown (转)
WPF控件NumericUpDown示例 (转载请注明出处) 工具:Expression Blend 2 + Visual Studio 2008 语言:C# 框架:.Net Framework 3. ...
- C语言程序设计(十三) 文件操作
第十三章 文件操作 文本文件:将数值型数据的每一位数字作为一个字符以其ASCII码的形式存储(每一位数字都单独占用一个字节的存储空间) 二进制文件:数据值是以二进制形式存储的 文本文件可以方便地被其他 ...
随机推荐
- [笔记]使用Go语言Redigo包在Docker容器内连接Redis容器的方法
Docker容器之间的连接可以带来不少方便,下面记录下如何在自己容器内通过环境变量连接与之连接的Redis容器的方法. 先起一个Redis的Docker容器,命名为 redis,再起一个自己的Dock ...
- POJ_2533 Longest Ordered Subsequence【DP】【最长上升子序列】
POJ_2533 Longest Ordered Subsequence[DP][最长递增子序列] Longest Ordered Subsequence Time Limit: 2000MS Mem ...
- Javascript中call()和apply()的用法 ----1
1.方法定义 call方法: 语法:call([thisObj[,arg1[, arg2[, [,.argN]]]]]) 定义:调用一个对象的一个方法,以另一个对象替换当前对象. 说明: call ...
- Linux curl命令参数详解(6/23)
linux curl是通过url语法在命令行下上传或下载文件的工具软件,它支持http,https,ftp,ftps,telnet等多种协议,常被用来抓取网页和监控Web服务器状态. 在Linux中c ...
- 20145201《Java程序设计》课程总结
每周读书笔记链接汇总 第一周读书笔记:http://www.cnblogs.com/20145201lzx/p/5249064.html 第二周读书笔记:http://www.cnblogs.com/ ...
- String创建方式的区别
String str0 = "abc"; String str1 = new String("abc"); 第一句执行后,会在String pool中创建一个& ...
- 函数:生成1-n的随机数组,
方法很笨,不过可行: #include <stdio.h> /** 功能:获取一个1-n的随机数数组,这些随机数都互不相同 ** 入参:n-表示最大随机数: *randArray -用于储 ...
- 20162326 齐力锋 2017-2018学期 Bag类的补写博客
要求: 代码运行在命令行中,路径要体现学号信息,IDEA中,伪代码要体现个人学号信息 参见Bag的UML图,用Java继承BagInterface实现泛型类Bag,并对方法进行单元测试(JUnit), ...
- JavaWeb Filter
1. 过滤器概述 1.1. 什么是过滤器 Filter译为过滤器,是JavaWeb的三大组件之一,用于在Servlet之外对Request或者Response进行修改.对于Web应用程序来说,过滤器是 ...
- 广度优先搜索 BFS算法
广度优先搜索算法(Breadth-First-Search,BFS),又称作宽度优先搜索.BFS算法是从根节点开始,沿着树的宽度遍历树的节点.如果所有节点均被访问,则算法中止. 算法思想 1.首先将根 ...