Patent-Eligible Processes: An Audience Perspective

Many of the problems with modern patent-eligibility analysis can be traced back to a fundamental philosophical divide between judges who treat eligibility as the primary tool for effectuating patent policy and those who take patent-eligibility as nothing more than a coarse filter to be invoked in rare cases. After several years in which the coarse filter approach seemed to have the upper hand, the eligibility-as-king approach now is firmly in ascendancy. This Article resists that trend, exploring more centrist approaches to patent-eligibility, particularly in the context of process inventions. This Article first examines the practice of undertaking an eligibility analysis with no antecedent claim construction; then concludes that this practice is problematic, drawing on the authors\u27 prior work concerning the design of patent law rules in view of the audience for those rules. This Article also assesses the unfortunate renaissance of the inventive concept inquiry, arguing that the Court\u27s new embrace of that inquiry is a mistake that permits judges to privilege eligibility to the virtual exclusion of all other patentability doctrines

Patent-Eligible Processes: An Audience Perspective

Many of the problems with modern patent-eligibility analysis can be traced back to a fundamental philosophical divide between judges who treat eligibility as the primary tool for effectuating patent policy and those who take patent-eligibility as nothing more than a coarse filter to be invoked in rare cases. After several years in which the coarse filter approach seemed to have the upper hand, the eligibility-as-king approach now is firmly in ascendancy. This Article, resists that trend, exploring more centrist approaches to patent-eligibility, particularly in the context of process inventions. This Article first examines the practice of undertaking an eligibility analysis with no antecedent claim construction; then concludes that this practice is problematic, drawing on the authors\u27 prior work concerning the design of patent law rules in view of the audience for those rules. This Article also assesses the unfortunate renaissance of the inventive concept inquiry, arguing that the Court\u27s new embrace of that inquiry is a mistake that permits judges to privilege eligibility to the virtual exclusion of all other patentability doctrines

Talking Nets: A Multi-Agent Connectionist Approach to Communication and Trust between Individuals

A multi-agent connectionist model is proposed that consists of a collection of individual recurrent networks that communicate with each other, and as such is a network of networks. The individual recurrent networks simulate the process of information uptake, integration and memorization within individual agents, while the communication of beliefs and opinions between agents is propagated along connections between the individual networks. A crucial aspect in belief updating based on information from other agents is the trust in the information provided. In the model, trust is determined by the consistency with the receiving agents’ existing beliefs, and results in changes of the connections between individual networks, called trust weights. Thus activation spreading and weight change between individual networks is analogous to standard connectionist processes, although trust weights take a specific function. Specifically, they lead to a selective propagation and thus filtering out of less reliable information, and they implement Grice’s (1975) maxims of quality and quantity in communication. The unique contribution of communicative mechanisms beyond intra-personal processing of individual networks was explored in simulations of key phenomena involving persuasive communication and polarization, lexical acquisition, spreading of stereotypes and rumors, and a lack of sharing unique information in group decisions

Lightweight compilation of (C)LP to JavaScript

We present and evaluate a compiler from Prolog (and extensions) to JavaScript which makes it possible to use (constraint) logic programming to develop the client side of web applications while being compliant with current industry standards. Targeting JavaScript makes (C)LP programs executable in virtually every modern computing device with no additional software requirements from the point of view of the user. In turn, the use of a very high-level language facilitates the development of high-quality, complex software. The compiler is a back end of the Ciao system and supports most of its features, including its module system and its rich language extension mechanism based on packages. We present an overview of the compilation process and a detailed description of the run-time system, including the support for modular compilation into separate JavaScript code. We demonstrate the maturity of the compiler by testing it with complex code such as a CLP(FD) library written in Prolog with attributed variables. Finally, we validate our proposal by measuring the performance of some LP and CLP(FD) benchmarks running on top of major JavaScript engines

Neutral coding - A report based on an NRP work session

Neural coding by impulses and trains on single and multiple channels, and representation of information in nonimpulse carrier