Claiming Computer-Related Inventions As Articles of Manufacture
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
COM 113 INTRO to COMPUTER PROGRAMMING Theory Book
1 [Type the document title] UNESCO -NIGERIA TECHNICAL & VOCATIONAL EDUCATION REVITALISATION PROJECT -PHASE II NATIONAL DIPLOMA IN COMPUTER TECHNOLOGY Computer Programming COURSE CODE: COM113 YEAR I - SE MESTER I THEORY Version 1: December 2008 2 [Type the document title] Table of Contents WEEK 1 Concept of programming ................................................................................................................ 6 Features of a good computer program ............................................................................................ 7 System Development Cycle ............................................................................................................ 9 WEEK 2 Concept of Algorithm ................................................................................................................... 11 Features of an Algorithm .............................................................................................................. 11 Methods of Representing Algorithm ............................................................................................ 11 Pseudo code .................................................................................................................................. 12 WEEK 3 English-like form .......................................................................................................................... 15 Flowchart ..................................................................................................................................... -
Defining Computer Program Parts Under Learned Hand's Abstractions Test in Software Copyright Infringement Cases
Michigan Law Review Volume 91 Issue 3 1992 Defining Computer Program Parts Under Learned Hand's Abstractions Test in Software Copyright Infringement Cases John W.L. Ogilive University of Michigan Law School Follow this and additional works at: https://repository.law.umich.edu/mlr Part of the Computer Law Commons, Intellectual Property Law Commons, and the Judges Commons Recommended Citation John W. Ogilive, Defining Computer Program Parts Under Learned Hand's Abstractions Test in Software Copyright Infringement Cases, 91 MICH. L. REV. 526 (1992). Available at: https://repository.law.umich.edu/mlr/vol91/iss3/5 This Note is brought to you for free and open access by the Michigan Law Review at University of Michigan Law School Scholarship Repository. It has been accepted for inclusion in Michigan Law Review by an authorized editor of University of Michigan Law School Scholarship Repository. For more information, please contact [email protected]. NOTE Defining Computer Program Parts Under Learned Hand's Abstractions Test in Software Copyright Infringement Cases John W.L. Ogilvie INTRODUCTION Although computer programs enjoy copyright protection as pro tectable "literary works" under the federal copyright statute, 1 the case law governing software infringement is confused, inconsistent, and even unintelligible to those who must interpret it.2 A computer pro gram is often viewed as a collection of different parts, just as a book or play is seen as an amalgamation of plot, characters, and other familiar parts. However, different courts recognize vastly different computer program parts for copyright infringement purposes. 3 Much of the dis array in software copyright law stems from mutually incompatible and conclusory program part definitions that bear no relation to how a computer program is actually designed and created. -
Text Editing in UNIX: an Introduction to Vi and Editing
Text Editing in UNIX A short introduction to vi, pico, and gedit Copyright 20062009 Stewart Weiss About UNIX editors There are two types of text editors in UNIX: those that run in terminal windows, called text mode editors, and those that are graphical, with menus and mouse pointers. The latter require a windowing system, usually X Windows, to run. If you are remotely logged into UNIX, say through SSH, then you should use a text mode editor. It is possible to use a graphical editor, but it will be much slower to use. I will explain more about that later. 2 CSci 132 Practical UNIX with Perl Text mode editors The three text mode editors of choice in UNIX are vi, emacs, and pico (really nano, to be explained later.) vi is the original editor; it is very fast, easy to use, and available on virtually every UNIX system. The vi commands are the same as those of the sed filter as well as several other common UNIX tools. emacs is a very powerful editor, but it takes more effort to learn how to use it. pico is the easiest editor to learn, and the least powerful. pico was part of the Pine email client; nano is a clone of pico. 3 CSci 132 Practical UNIX with Perl What these slides contain These slides concentrate on vi because it is very fast and always available. Although the set of commands is very cryptic, by learning a small subset of the commands, you can edit text very quickly. What follows is an outline of the basic concepts that define vi. -
Patentable Software: Analyzing Alice Under a Law-And-Economics Framework and Proposing a New Approach to Software Claims
THIS VERSION MAY CONTAIN INACCURATE OR INCOMPLETE PAGE NUMBERS. PLEASE CONSULT THE PRINT OR ONLINE DATABASE VERSIONS FOR THE PROPER CITATION INFORMATION. NOTE PATENTABLE SOFTWARE: ANALYZING ALICE UNDER A LAW-AND-ECONOMICS FRAMEWORK AND PROPOSING A NEW APPROACH TO SOFTWARE CLAIMS Christian R. Ruiz I. INTRODUCTION Software is a pervasive component in modern inventions, and companies are interested in using patents to protect software. By the early 1990s, the Court of Appeals for the Federal Circuit (the “Federal Circuit”) established that software was patentable.1 This article analyzes the discernable contours of what falls within patentable subject matter regarding software technology in view of Alice v. CLS Bank2 and its precedent. This note also applies policy arguments and a cost-benefit analysis to argue what patent doctrine should dictate regarding the patentability of software. Today, after Alice, what may constitute a patentable software claim is not en- tirely clear. Alice made it harder to patent software technology.3 The majority opinion in Alice indicates that attaching an abstract method to a computer, which is a physical machine, is not enough to render a claim patentable.4 Further, the Supreme Court (the “Court”) subjected patent claims containing software ele- ments to a higher scrutiny than the scrutiny used for patent claims that do not 1 See Diamond v. Diehr, 450 U.S. 175, 192-93 (1981) (affirming the Federal Circuit de- cision that a claim for technology including computer software is patent eligible); In re Lowry, 32 F.3d 1579, 1582 (Fed. Cir. 1994) (finding that a memory containing a data structure should be considered patentable subject matter); State St. -
User Manual for Ox: an Attribute-Grammar Compiling System Based on Yacc, Lex, and C Kurt M
Computer Science Technical Reports Computer Science 12-1992 User Manual for Ox: An Attribute-Grammar Compiling System based on Yacc, Lex, and C Kurt M. Bischoff Iowa State University Follow this and additional works at: http://lib.dr.iastate.edu/cs_techreports Part of the Programming Languages and Compilers Commons Recommended Citation Bischoff, Kurt M., "User Manual for Ox: An Attribute-Grammar Compiling System based on Yacc, Lex, and C" (1992). Computer Science Technical Reports. 21. http://lib.dr.iastate.edu/cs_techreports/21 This Article is brought to you for free and open access by the Computer Science at Iowa State University Digital Repository. It has been accepted for inclusion in Computer Science Technical Reports by an authorized administrator of Iowa State University Digital Repository. For more information, please contact [email protected]. User Manual for Ox: An Attribute-Grammar Compiling System based on Yacc, Lex, and C Abstract Ox generalizes the function of Yacc in the way that attribute grammars generalize context-free grammars. Ordinary Yacc and Lex specifications may be augmented with definitions of synthesized and inherited attributes written in C syntax. From these specifications, Ox generates a program that builds and decorates attributed parse trees. Ox accepts a most general class of attribute grammars. The user may specify postdecoration traversals for easy ordering of side effects such as code generation. Ox handles the tedious and error-prone details of writing code for parse-tree management, so its use eases problems of security and maintainability associated with that aspect of translator development. The translators generated by Ox use internal memory management that is often much faster than the common technique of calling malloc once for each parse-tree node. -
NTP V. RIM: the Diverging Law Between System and Method Claim Infringement
The University of New Hampshire Law Review Volume 5 Number 2 Pierce Law Review Article 7 January 2007 NTP v. RIM: The Diverging Law Between System and Method Claim Infringement Stephen P. Cole Franklin Pierce Law Center, Concord, NH Follow this and additional works at: https://scholars.unh.edu/unh_lr Part of the Intellectual Property Law Commons Repository Citation Stephen P. Cole, NTP v. RIM: The Diverging Law Between System and Method Claim Infringement, 5 Pierce L. Rev. 347 (2007), available at http://scholars.unh.edu/unh_lr/vol5/iss2/7 This Notes is brought to you for free and open access by the University of New Hampshire – Franklin Pierce School of Law at University of New Hampshire Scholars' Repository. It has been accepted for inclusion in The University of New Hampshire Law Review by an authorized editor of University of New Hampshire Scholars' Repository. For more information, please contact [email protected]. NTP v. RIM: The Diverging Law Between System and Method Claim Infringement STEPHEN P. COLE* I. INTRODUCTION Almost thirty years after the landmark decision of Decca Ltd. v. United States,1 the Federal Circuit had an opportunity to reevaluate the extraterri- torial limits of U.S. patent law in NTP, Inc. v. Research in Motion, Ltd.2 After withdrawing its initial opinion (“NTP I”) and issuing a second opin- ion (“NTP II”), the court held that a system having a component located outside U.S. jurisdiction could be subject to U.S. patent law.3 The court held as a matter of law, however, that a process in which a step is per- formed outside U.S. -
The “Article of Manufacture” Today
Harvard Journal of Law & Technology Volume 31, Number 2 Spring 2018 THE “ARTICLE OF MANUFACTURE” TODAY Sarah Burstein* TABLE OF CONTENTS I. INTRODUCTION .............................................................................. 782 II. BACKGROUND .............................................................................. 785 A. Design Patentable Subject Matter ............................................ 785 B. Design Patent Claiming & Infringement ................................. 786 C. Remedies for Design Patent Infringement ............................... 788 III. WHAT IS THE “ARTICLE OF MANUFACTURE” IN § 289?.............. 789 A. The Apple/Nordock Rule .......................................................... 791 B. The Supreme Court Weighs In ................................................. 791 IV. WHY COURTS SHOULD NOT ADOPT THE GOVERNMENT’S APPROACH .................................................................................... 793 A. The Test .................................................................................... 794 1. The Underlying Premise ........................................................ 795 2. The Factors ............................................................................ 797 B. The Nature of the Inquiry ......................................................... 802 1. A Case-by-Case Inquiry? ...................................................... 802 2. Is it a Question of Fact or Law? ............................................ 807 C. The Burden of Proof................................................................ -
Language Translators
Student Notes Theory LANGUAGE TRANSLATORS A. HIGH AND LOW LEVEL LANGUAGES Programming languages Low – Level Languages High-Level Languages Example: Assembly Language Example: Pascal, Basic, Java Characteristics of LOW Level Languages: They are machine oriented : an assembly language program written for one machine will not work on any other type of machine unless they happen to use the same processor chip. Each assembly language statement generally translates into one machine code instruction, therefore the program becomes long and time-consuming to create. Example: 10100101 01110001 LDA &71 01101001 00000001 ADD #&01 10000101 01110001 STA &71 Characteristics of HIGH Level Languages: They are not machine oriented: in theory they are portable , meaning that a program written for one machine will run on any other machine for which the appropriate compiler or interpreter is available. They are problem oriented: most high level languages have structures and facilities appropriate to a particular use or type of problem. For example, FORTRAN was developed for use in solving mathematical problems. Some languages, such as PASCAL were developed as general-purpose languages. Statements in high-level languages usually resemble English sentences or mathematical expressions and these languages tend to be easier to learn and understand than assembly language. Each statement in a high level language will be translated into several machine code instructions. Example: number:= number + 1; 10100101 01110001 01101001 00000001 10000101 01110001 B. GENERATIONS OF PROGRAMMING LANGUAGES 4th generation 4GLs 3rd generation High Level Languages 2nd generation Low-level Languages 1st generation Machine Code Page 1 of 5 K Aquilina Student Notes Theory 1. MACHINE LANGUAGE – 1ST GENERATION In the early days of computer programming all programs had to be written in machine code. -
13. Stored-Program Computers
13. Stored-Program Computers 13.1 Introduction This chapter concentrates on the low-level usage and structure of stored program computers. We focus on a particular hypothetical machine known as the ISC, describing its programming in assembly language. We show how recursion and switch statements are compiled into machine language, and how memory-mapped overlapped I/O is achieved. We also show the logic implement of the ISC, in terms of registers, buses, and finite-state machine controllers. 13.2 Programmer's Abstraction for a Stored-Program Computer By stored-program computer, we mean a machine in which the program, as well as the data, are stored in memory, each word of which can be accessed in uniform time. Most of the high-level language programming the reader has done will likely have used this kind of computer implicitly. However, the program that is stored is not high-level language text. If it were, then it would be necessary to constantly parse this text, which would slow down execution immensely. Instead one of two other forms of storage is used: An abstract syntax representation of the program could be stored. The identifiers in this representation are pre-translated, and the structure is traversed dynamically as needed during execution. This is the approach used by an interpreter for the language. A second approach is to use a compiler for the language. The compiler translates the program into the very low-level language native to the machine, appropriately called machine language. The native machine language acts as a least-common-denominator language for the computer. -
A Brief Introduction to Unix-2019-AMS
A Brief Introduction to Linux/Unix – AMS 2019 Pete Pokrandt UW-Madison AOS Systems Administrator [email protected] Twitter @PTH1 Brief Intro to Linux/Unix o Brief History of Unix o Basics of a Unix session o The Unix File System o Working with Files and Directories o Your Environment o Common Commands Brief Intro to Unix (contd) o Compilers, Email, Text processing o Image Processing o The vi editor History of Unix o Created in 1969 by Kenneth Thompson and Dennis Ritchie at AT&T o Revised in-house until first public release 1977 o 1977 – UC-Berkeley – Berkeley Software Distribution (BSD) o 1983 – Sun Workstations produced a Unix Workstation o AT&T unix -> System V History of Unix o Today – two main variants, but blended o System V (Sun Solaris, SGI, Dec OSF1, AIX, linux) o BSD (Old SunOS, linux, Mac OSX/MacOS) History of Unix o It’s been around for a long time o It was written by computer programmers for computer programmers o Case sensitive, mostly lowercase abbreviations Basics of a Unix Login Session o The Shell – the command line interface, where you enter commands, etc n Some common shells Bourne Shell (sh) C Shell (csh) TC Shell (tcsh) Korn Shell (ksh) Bourne Again Shell (bash) [OSX terminal] Basics of a Unix Login Session o Features provided by the shell n Create an environment that meets your needs n Write shell scripts (batch files) n Define command aliases n Manipulate command history n Automatically complete the command line (tab) n Edit the command line (arrow keys in tcsh) Basics of a Unix Login Session o Logging in to a unix -
Journal of Legal Technology Risk Management
THIRD CIRCUIT USES PROCEDURAL GROUNDS i JOURNAL OF LEGAL TECHNOLOGY RISK MANAGEMENT 1. THIRD CIRCUIT USES PROCEDURAL GROUNDS TO REJECT FCC’S WEAKENING OF MEDIA CROSS-OWNERSHIP RULES FOR A SECOND TIME IN PROMETHEUS RADIO PROJECT V. FCC 2. WHEN PARALLEL TRACKS CROSS: APPLICATION OF THE NEW INSIDER TRADING REGULATIONS UNDER DODD-FRANK DERAILS 3. ELECTRONIC DISCOVERY AND THE CONSTITUTION: INACCESSIBLE JUSTICE 4. RENEWING THE BAYH-DOLE ACT AS A DEFAULT RULE IN THE WAKE OF STANFORD V. ROCHE Volume 6 | Summer 2012 | Issue 1 (c) 2006-2012 Journal of Legal Technology Risk Management. All Rights Reserved. ISSN 1932-5584 (Print) | ISSN 1932-5592 (Online) | ISSN 1932-5606 (CD-ROM) www.ltrm.org II J. OF LEGAL TECH. AND RISK MGMT [Vol. 6 Editor-in-Chief Daniel B. Garrie, Esq. (USA) Guest Editor Kelly Merkel, Esq. (USA) Publications Editor Candice M. Lang, Esq. (USA) Executive Editors Matthew Armstrong, Esq. (USA) Dr. Sylvia Mercado Kierkegaard (Denmark) Scientific Council Stephanie A. “Tess” Blair, Esq. (USA) Hon. Amir Ali Majid (UK) Hon. Maureen Duffy-Lewis (USA) Micah Lemonik (USA) Andres Guadamuz (UK ) Carlos Rohrmann, Esq. (Brazil) Camille Andrews, Esq. (USA) Gary T. Marx (USA) William Burdett (USA) Eric A. Capriloi (France) Donald P. Harris (USA) Hon. Justice Ivor Archie (Trinidad & Tobago) ii Members Janet Coppins (USA) Eleni Kosta (Belgium) Dr. Paolo Balboni (Italy) Salvatore Scibetta, Esq. (USA) Ygal Saadoun (France/Egypt) Steve Williams, Esq. (USA) Rebecca Wong (United Kingdom) iii IV J. OF LEGAL TECH. AND RISK MGMT [Vol. 6 FOREWORD In this edition, we explore seemingly disparate realms of regulation and legislation and discover shared nuances in growing concern for current legal framework in all facets of legal practice and scholarship. -
UNIX (Solaris/Linux) Quick Reference Card Logging in Directory Commands at the Login: Prompt, Enter Your Username
UNIX (Solaris/Linux) QUICK REFERENCE CARD Logging In Directory Commands At the Login: prompt, enter your username. At the Password: prompt, enter ls Lists files in current directory your system password. Linux is case-sensitive, so enter upper and lower case ls -l Long listing of files letters as required for your username, password and commands. ls -a List all files, including hidden files ls -lat Long listing of all files sorted by last Exiting or Logging Out modification time. ls wcp List all files matching the wildcard Enter logout and press <Enter> or type <Ctrl>-D. pattern Changing your Password ls dn List files in the directory dn tree List files in tree format Type passwd at the command prompt. Type in your old password, then your new cd dn Change current directory to dn password, then re-enter your new password for verification. If the new password cd pub Changes to subdirectory “pub” is verified, your password will be changed. Many systems age passwords; this cd .. Changes to next higher level directory forces users to change their passwords at predetermined intervals. (previous directory) cd / Changes to the root directory Changing your MS Network Password cd Changes to the users home directory cd /usr/xx Changes to the subdirectory “xx” in the Some servers maintain a second password exclusively for use with Microsoft windows directory “usr” networking, allowing you to mount your home directory as a Network Drive. mkdir dn Makes a new directory named dn Type smbpasswd at the command prompt. Type in your old SMB passwword, rmdir dn Removes the directory dn (the then your new password, then re-enter your new password for verification.