Fraud and Enforceability: Potential Implications for Federal Circuit Litigation

Should fraudulent litigation tactics and testimony affect the validity of underlying patents? What results are possible if the enforceability of a patent turns on the conduct of the applying party not only before the Patent and Trademark Office, but also before circuit courts? The author of the following article considers these questions in light of the recent Aptix Corp. case

Fraud and Enforceability: Potential Implications for Federal Circuit Litigation

Should fraudulent litigation tactics and testimony affect the validity of underlying patents? What results are possible if the enforceability of a patent turns on the conduct of the applying party not only before the Patent and Trademark Office, but also before circuit courts? The author of the following article considers these questions in light of the recent Aptix Corp. case

Towards Language-Universal End-to-End Speech Recognition

Building speech recognizers in multiple languages typically involves replicating a monolingual training recipe for each language, or utilizing a multi-task learning approach where models for different languages have separate output labels but share some internal parameters. In this work, we exploit recent progress in end-to-end speech recognition to create a single multilingual speech recognition system capable of recognizing any of the languages seen in training. To do so, we propose the use of a universal character set that is shared among all languages. We also create a language-specific gating mechanism within the network that can modulate the network's internal representations in a language-specific way. We evaluate our proposed approach on the Microsoft Cortana task across three languages and show that our system outperforms both the individual monolingual systems and systems built with a multi-task learning approach. We also show that this model can be used to initialize a monolingual speech recognizer, and can be used to create a bilingual model for use in code-switching scenarios.Comment: submitted to ICASSP 201

A non-linear Renewal Theorem with stationary and slowly changing perturbations

Non-linear renewal theory is extended to include random walks perturbed by both a slowly changing sequence and a stationary one. Main results include a version of the Key Renewal Theorem, a derivation of the limiting distribution of the excess over a boundary, and an expansion for the expected first passage time. The formulation is motivated by problems in sequential analysis with staggered entry, where subjects enter a study at random times.Comment: Published at http://dx.doi.org/10.1214/074921706000000680 in the IMS Lecture Notes--Monograph Series (http://www.imstat.org/publications/lecnotes.htm) by the Institute of Mathematical Statistics (http://www.imstat.org

Patent Amendments and Prosecution History Estoppel Under Festo

On November 29, 2000, the Federal Circuit retroactively reduced the value of nearly 1.2 million unexpired United States patents by announcing a new rule for the somewhat obscure doctrine of prosecution history estoppel. Designed to foster clarity in patent applications, this new pronouncement in Festo Corp v. Shoketsu Kinzoku Kogyo Kabushiki Co. allows for easy copying of some patented inventions and reduces patent owner\u27s ability to prove infringement. This article outlines the change in the law and discusses the positive and negative consequences of the decision