DESIGN of a VARIABLE HIGH LEVEL LANGUAGE COMPUTER USING PARALLEL PROCESSING. the Ohio State University, Ph.D., 1977 Engineering, Electronics and Electrical

Total Page:16

File Type:pdf, Size:1020Kb

DESIGN of a VARIABLE HIGH LEVEL LANGUAGE COMPUTER USING PARALLEL PROCESSING. the Ohio State University, Ph.D., 1977 Engineering, Electronics and Electrical I I 78-5896 MOONEY, James Donald, 1946- DESIGN OF A VARIABLE HIGH LEVEL LANGUAGE COMPUTER USING PARALLEL PROCESSING. The Ohio State University, Ph.D., 1977 Engineering, electronics and electrical University Microfilms International,Ann Arbor, Michigan 48106 DESIGN OF A VARIABLE HIGH LEVEL LANGUAGE COMPUTER USING PARALLEL PROCESSING DISSERTATION Presented in Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the Graduate School of the Ohio State University By James Donald Mooney, B.S.E.E., M.Sc, The Ohio State University 1977 Reading Committee: Appr Prof. K.J. Breeding, Chairman Prof, M.T. Liu Adva.se r Prof0 R.B. McGhee Department of Electrical Engineering ACKNOWLEDGMENTS I wish to thank my adviser, Dr, Kenneth Breeding, for his help and encouragement over the extended time of preparing for this dissertation. Thanks to Dr. Breeding and Dr, M.T. Liu for some fruitful discussions and good advice, and also to Dr. R.B. McGhee for his service on the reading committee. I am grateful to The Ohio State University for supporting me in most of my graduate studies with a University Fellowship and a Graduate Research Associateship. This work was also supported in part by the U.S. Air Force Office of Scientific Research, under Grant No. AFOSR-77-3400. Thanks are due to my employer, Dymo Graphic Systems, for providing time to complete my studies and the use of equipment and facilities. My last and deepest thanks are to my wife Joani, for years of patience and encouragement, for extensive help in preparing the drawings, and for being there to make it all worthwhile. VITA November 29, 1946 . Born - Jersey City, New Jersey 1968........... oo.oo B.S.E.E., University of Notre Dame, Notre Dame, Indiana 1969.. .................. .. M.SCo, The Ohio State University, Columbus, Ohio 1969-1971 .............. Graduate Research. Associate, Computing Center, The Ohio State University, Columbus, Ohio 1971-1977 . ............ Systems Programmer, Programming Manager, Dymo Graphic Systems, Wilmington, Massachusetts FIELDS OF STUDY Major Field: Electrical Engineering Studies in Digital Systems. Professor Kenneth J. Breeding Studies in Computer Science. Professor Ming T. Liu Studies in Control Theory. Professor John Bacon Studies in Mathematics. Professor Henry D. Colson TABLE OF CONTENTS ACKNOWLEDGMENTS ................................... ii VITA ............................................... iii LIST OF T A B L E S ..................................... vii LIST OF F I G U R E S ....................................... viii Chapter Page I. INTRODUCTION.................... 1 1.1 Background and Motivation ............. 1 1.2 Organization of the Dissertation .... 4 II. SURVEY OF PREVIOUS W O R K ............. 7 2.1 High-Level Language Machines ........... 7 2a2 Related Research .......... 26 2.2.1 Languages and Theory ....... 26 2.2.2 Computer Architecture ........... 29 III. O V E R V I E W ................................ 33 301 Design Considerations ................. 33 3.2 The Proposed S y s t e m ............. 39 IV. THEORETICAL MODEL .......................... 44 4.1 The Language C l a s s ............... 44 4.2 The Directed Graphs of a Grammar .... 47 4.3 Further Definitions .......... 54 4.4 Syntactic Analysis ............ 62 iv TABLE OF CONTENTS (continued) Chapter Page 4.5 The Execution T r e e .............. 69 4.6 Semantic Processing ................... 73 4.7 Execution .......................... 80 4.8 Extensions to the Model ........... 92 4.9 Summary ............................ 97 V. PROCESSOR FOR A SMALL LANGUAGE ............. 99 5.1 Language Definition and Representation . 99 5.2 Analysis Section ........................ 117 5.2.1 General Features......... 118 5.2.2 The Analysis Control Unit .... 120 5.2.3 The Token Processors............. 126 5o3 Execution Section ..................... 139 5.3.1 General Features... ............... 139 5.3.2 The Operand Evaluators.......... 141 5.3.3 The Execution Processors........ 149 5.4 Example of Program Flow ........ 151 5.5 Simulation and Performance ...... 159 5.6 Summary .. ......... .......... 165 VI. PROCESSORS FOR REAL PROGRAMMING LANGUAGES . 166 6.1 FORTRAN I V ....................... 166 6.1.1 General ............... 167 6.1.2 Token Classes ........... 169 6.1.3 Syntax and Analysis ....... 170 v TABLE OF CONTENTS (continued) Chapter Page 6.1.4 Execution ................. 178 6.1.5 Summary .......................... 179 6.2 ALGOL 6 0 ................................ 179 6.2.1 G e n e r a l .......................... 179 6.2.2 Token Classes ................. 181 6.2.3 Syntax and Analysis ........... 182 6.2.4 Execution ....... ......... 187 6.2.5 Summary ........ ........ 189 6.3 Other Languages ........................ 190 VII. CONCLUSIONS AND FUTURE DIRECTIONS ......... 193 7.1 Summary and Evaluation ......... 193 7.2 Suggestions for Future Work ...... 198 APPENDIX A: THE UPPER BOUND PROBLEM ............... 200 APPENDIX B: MEMORY SYSTEM STRUCTURE ............... 214 APPENDIX C: LANGUAGE DEFINITION TABLES .......... 222 APPENDIX D: ANALYSIS MODULE PROGRAM LISTING.... 237 APPENDIX E: EXECUTION MODULE PROGRAM LISTING . 259 APPENDIX F: FORTRAN IV SYNTAX GRAPHS ............ 284 APPENDIX G: ALGOL 60 SYNTAX GRAPHS ............... 291 REFERENCES ............................. 296 LIST OF TABLES Table Page 2.1 Chronology of HLL Machines . 25 5.1 Execution Processor Functions for SLANG . 112 5.2 ACU Signal Descriptions .......... 124 5.3 ACU Register Equations ............. 125 5.4 TP Register Equations ..... 129 6.1 Extended Primitive Functions for FORTRAN • 180 6.2 Extended Primitive Functions for ALGOL . 190 A. 1 Count for FORTRAN Graphs ........ 212 vii LIST OF FIGURES Figure Page 2.1 Anderson ALGOL 60 System ........ 8 2.2 Bashkow et al FORTRAN machine ........... 12 2.3 Tree-Structured Store of Iliffe ......... 15 2.4 Direct PL/I Processor of Sugimoto .... 16 2.5 Cellular APL Computer .................... 18 2.6 SYMBOL Computer System ......... 20 2.7 Fournier's GPM System .................... 24 3.1 Proposed System Block Diagram...... 40 4.1 Grammar Graph Format 49 4.2 Example Graph System .................... 51 4.3 Equivalent Grammar Graphs ................ 55 4.4 Further Example of Equivalence ..... 56 405 Token Processor Syntactic Recognition . 66 4.6 An Execution Tree ........................ 71 4.7 Primitive Steps in Tree Building .... 75 4.8 TP Flow with Semantic Processing .... 79 4.9 Operand Evaluator Basic Flowchart .... 83 4.10 Function Decomposition ......... 89 4.11 Operand Evaluator Complete Flowchart . 90 5.1 Graph Syntax for SLANG ...••.••• 102 5.2 Tree Cell Prototypes for SLANG ..... 107 viii LIST OF FIGURES (continued) Figure Page 5.3 Factorial Program in SLANG ........ 113 5.4 Data Structure for Factorial Program . • 114 5»5 New and Modified Graphs for SLANG ..... 116 5.6 Analysis Section Block Diagram ........... 119 5.7 Analysis Control Unit Flowchart ........... 122 5.8 ACU Signal Diagram ............ 123 5.9 Token Processor Block Diagram ....... 128 5.10 Token Recognizer Flowchart . ........... 133 5.11 Semantic Processor Flowchart ......... 134 5.12 Task Generator Flowchart .................. 135 5.13 Execution Section Block Diagram ...... 14.0 5.14 Operand Evaluator Overall Flowchart .... 142 5.15 OE Normal Process Flowchart ................ 143 5.16 OE Conditional Process Flowchart ......... 144 5.17 Operand Evaluator Block Diagram ........... 145 5.18 Execution Processor General Flowchart . 152 5.19 Snapshot of Analysis ...................... 157 5.20 Simulator Block Diagram .................... 160 6.1 FORTRAN Preprocessing Example .............. 168 6.2 Execution Tree for a DO-loop ............. 173 6.3 Subprogram Definition and Call ......... 176 6.4 Johnston Contour Model .......... 183 6.5 Execution Tree for Johnston Algorithm . 184 ix LIST OF FIGURES (continued) Figure Page A.1 Splitting of Partial P a t h s ....... ...... 203 A„2 Non-closure of Graphs .......... 204 A.3 Modification to IGLIST ......... 209 A.4 Modified Expression Graphs ....... 211 B.1 Memory System Block Diagram ....... 215 B.2 Data Entities .................. 218 B.3 Structure Cells ...................... 220 x CHAPTER I INTRODUCTION 1.1 Background and Motivation Shortly after the earliest stored-program computers were developed, it became clear that their potential as problem solvers depended on effective communication between man and machine. The earliest programs had to be expressed manually in binary machine code. Before long, assemblers appeared, allowing programs to be written in a more reason­ able notation. But the usefulness of the computers took a giant step forward with the development of the first high-level language interpreters, beginning with FORTRAN. From then on, the goal was to write problems in a notation convenient for the subject, and have the computer itself do the translation. As computing evolved, a vast array of high-level languages was conceived and implemented on various com­ puters. Until recently, however, computing hardware was scarce and extremely expensive. It was inconceivable to redesign the hardware to support new languages when soft­ ware compilers could produce the same results. Economics also made it impractical to build new computers which required very complex logic in hardware, or differed radically from earlier designs. Almost all machines built conformed to the principles of a "von Neumann" design. They processed a linear sequence of instructions through a single central processor, allowing no parallel activity. Any possibility
Recommended publications
  • Practice Test Version 1.8 LPI 117-101: Practice Exam QUESTION NO: 1 CORRECT TEXT
    LPI 117-101 117-101 LPI 101 General Linux, Part I Practice Test Version 1.8 LPI 117-101: Practice Exam QUESTION NO: 1 CORRECT TEXT You suspect that a new ethernet card might be conflicting with another device. Which file should you check within the /proc tree to learn which IRQs are being used by which kernel drives? Answer: interrupts QUESTION NO: 2 How many SCSI ids for peripherals can SCSI-1 support? A. 5 B. 6 C. 7 D. 8 Answer: C Explanation: SCSI-1 support total 7 peripherals. There are several different types of SCSI devices. The original SCSI specification is commonly referred to as SCSI-1. The newer specification, SCSI-2, offers increased speed and performance, as well as new commands. Fast SCSI increases throughput to more than 10MB per second. Fast-Wide SCSI provides a wider data path and throughput of up to 40MB per second and up to 15 devices. There there are Ultra-SCSI and Ultra-Wide-SCSI QUESTION NO: 3 You need to install a fax server. Which type of fax/modem should you install to insure Linux compatibility? Test-King.com A. External Serial Fax/modem B. External USB Fax/modem C. Internal ISA Fax/modem D. Internal PCI Fax/modem Answer: A QUESTION NO: 4 You are running Linux 2.0.36 and you need to add a USB mouse to your system. Which of the following statements is true? "Welcome to Certification's Main Event" - www.test-king.com 2 LPI 117-101: Practice Exam A. You need to rebuild the kernel.
    [Show full text]
  • Control of Protein Orientation on Gold Nanoparticles † ∥ † § † ∥ ⊥ Wayne Lin, Thomas Insley, Marcus D
    Article pubs.acs.org/JPCC Control of Protein Orientation on Gold Nanoparticles † ∥ † § † ∥ ⊥ Wayne Lin, Thomas Insley, Marcus D. Tuttle, Lingyang Zhu, Deborah A. Berthold, Petr Kral,́, † ‡ # † Chad M. Rienstra,*, , , and Catherine J. Murphy*, † ‡ Department of Chemistry and Department of Biochemistry, University of Illinois at Urbana−Champaign, 600 South Matthews Avenue, Urbana, Illinois 61801, United States § School of Chemical Sciences, University of Illinois at Urbana−Champaign, 505 South Matthews Avenue, Urbana, Illinois 61801, United States ∥ ⊥ Department of Chemistry and Department of Physics, University of Illinois at Chicago, 845 West Taylor Street, Chicago, Illinois 60607, United States # Center for Biophysics and Computational Biology, University of Illinois at Urbana−Champaign, 607 South Matthews Avenue, Urbana, Illinois 61801, United States *S Supporting Information ABSTRACT: Gold nanoparticles (Au NPs) have attracted much attention due to their potential applications in nanomedicine. While numerous studies have quantified biomolecular adsorption to Au NPs in terms of equilibrium binding constants, far less is known about biomolecular orientation on nanoparticle surfaces. In this study, the binding of the protein α-synuclein to citrate and (16- mercaptohexadecyl)trimethylammonium bromide (MTAB)-coated 12 nm Au NPs is examined by heteronuclear single quantum coherence NMR spectroscopy to provide site-specific measurements of protein−nanoparticle binding. Molecular dynamics simulations support the orientation assignments, which
    [Show full text]
  • File System, Files, and *Tab /Etc/Fstab
    File system, files, and *tab File system files directories volumes, file systems mounting points local versus networked file systems 1 /etc/fstab Specifies what is to be mounted where and how fs_spec: describes block special device for remote filesystem to be mounted fs_file: describes the mount point fs_vfstype: describes the type of file system fs_mntops: describes the mount options associated with the filesystem 2 /etc/fstab cont. fs_freq: used by the dump command fs_passno: used by fsck to determine the order in which checks are done at boot time. Root file systems should be specified as 1, others should be 2. Value 0 means that file system does not need to be checked 3 /etc/fstab 4 from blocks to mounting points metadata inodes directories superblocks 5 mounting file systems mounting e.g., mount -a unmounting manually or during shutdown umount 6 /etc/mtab see what is mounted 7 Network File System Access file system (FS) over a network looks like a local file system to user e.g. mount user FS rather than duplicating it (which would be a disaster) Developed by Sun Microsystems (mid 80s) history for NFS: NFS, NFSv2, NFSv3, NFSv4 RFC 3530 (from 2003) take a look to see what these RFCs are like!) 8 Network File System How does this actually work? server needs to export the system client needs to mount the system server: /etc/exports file client: /etc/fstab file 9 Network File System Security concerns UID GID What problems could arise? 10 Network File System example from our raid system (what is a RAID again?) Example of exports file from
    [Show full text]
  • Filesystem Hierarchy Standard
    Filesystem Hierarchy Standard LSB Workgroup, The Linux Foundation Filesystem Hierarchy Standard LSB Workgroup, The Linux Foundation Version 3.0 Publication date March 19, 2015 Copyright © 2015 The Linux Foundation Copyright © 1994-2004 Daniel Quinlan Copyright © 2001-2004 Paul 'Rusty' Russell Copyright © 2003-2004 Christopher Yeoh Abstract This standard consists of a set of requirements and guidelines for file and directory placement under UNIX-like operating systems. The guidelines are intended to support interoperability of applications, system administration tools, development tools, and scripts as well as greater uniformity of documentation for these systems. All trademarks and copyrights are owned by their owners, unless specifically noted otherwise. Use of a term in this document should not be regarded as affecting the validity of any trademark or service mark. Permission is granted to make and distribute verbatim copies of this standard provided the copyright and this permission notice are preserved on all copies. Permission is granted to copy and distribute modified versions of this standard under the conditions for verbatim copying, provided also that the title page is labeled as modified including a reference to the original standard, provided that information on retrieving the original standard is included, and provided that the entire resulting derived work is distributed under the terms of a permission notice identical to this one. Permission is granted to copy and distribute translations of this standard into another language, under the above conditions for modified versions, except that this permission notice may be stated in a translation approved by the copyright holder. Dedication This release is dedicated to the memory of Christopher Yeoh, a long-time friend and colleague, and one of the original editors of the FHS.
    [Show full text]
  • Advanced Bash-Scripting Guide
    Advanced Bash−Scripting Guide An in−depth exploration of the art of shell scripting Mendel Cooper <[email protected]> 2.2 31 October 2003 Revision History Revision 0.1 14 June 2000 Revised by: mc Initial release. Revision 0.2 30 October 2000 Revised by: mc Bugs fixed, plus much additional material and more example scripts. Revision 0.3 12 February 2001 Revised by: mc Another major update. Revision 0.4 08 July 2001 Revised by: mc More bugfixes, much more material, more scripts − a complete revision and expansion of the book. Revision 0.5 03 September 2001 Revised by: mc Major update. Bugfixes, material added, chapters and sections reorganized. Revision 1.0 14 October 2001 Revised by: mc Bugfixes, reorganization, material added. Stable release. Revision 1.1 06 January 2002 Revised by: mc Bugfixes, material and scripts added. Revision 1.2 31 March 2002 Revised by: mc Bugfixes, material and scripts added. Revision 1.3 02 June 2002 Revised by: mc 'TANGERINE' release: A few bugfixes, much more material and scripts added. Revision 1.4 16 June 2002 Revised by: mc 'MANGO' release: Quite a number of typos fixed, more material and scripts added. Revision 1.5 13 July 2002 Revised by: mc 'PAPAYA' release: A few bugfixes, much more material and scripts added. Revision 1.6 29 September 2002 Revised by: mc 'POMEGRANATE' release: some bugfixes, more material, one more script added. Revision 1.7 05 January 2003 Revised by: mc 'COCONUT' release: a couple of bugfixes, more material, one more script. Revision 1.8 10 May 2003 Revised by: mc 'BREADFRUIT' release: a number of bugfixes, more scripts and material.
    [Show full text]
  • Oracle® Linux 7 Managing File Systems
    Oracle® Linux 7 Managing File Systems F32760-07 August 2021 Oracle Legal Notices Copyright © 2020, 2021, Oracle and/or its affiliates. This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish, or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this is software or related documentation that is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Government, then the following notice is applicable: U.S. GOVERNMENT END USERS: Oracle programs (including any operating system, integrated software, any programs embedded, installed or activated on delivered hardware, and modifications of such programs) and Oracle computer documentation or other Oracle data delivered to or accessed by U.S. Government end users are "commercial computer software" or "commercial computer software documentation" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental regulations. As such, the use, reproduction, duplication, release, display, disclosure, modification, preparation of derivative works, and/or adaptation of i) Oracle programs (including any operating system, integrated software, any programs embedded, installed or activated on delivered hardware, and modifications of such programs), ii) Oracle computer documentation and/or iii) other Oracle data, is subject to the rights and limitations specified in the license contained in the applicable contract.
    [Show full text]
  • Name Synopsis Description Options
    UMOUNT(8) System Administration UMOUNT(8) NAME umount − unmount file systems SYNOPSIS umount −a [−dflnrv][−t fstype][−O option...] umount [−dflnrv]{directory|device}... umount −h|−V DESCRIPTION The umount command detaches the mentioned file system(s) from the file hierarchy. A file system is spec- ified by giving the directory where it has been mounted. Giving the special device on which the file system livesmay also work, but is obsolete, mainly because it will fail in case this device was mounted on more than one directory. Note that a file system cannot be unmounted when it is ’busy’ - for example, when there are open files on it, or when some process has its working directory there, or when a swap file on it is in use. The offending process could evenbe umount itself - it opens libc, and libc in its turn may open for example locale files. Alazy unmount avoids this problem, but it may introduce another issues. See −−lazy description below. OPTIONS −a, −−all All of the filesystems described in /proc/self/mountinfo (or in deprecated /etc/mtab) are un- mounted, except the proc, devfs, devpts, sysfs, rpc_pipefs and nfsd filesystems. This list of the filesystems may be replaced by −−types umount option. −A, −−all−targets Unmount all mountpoints in the current namespace for the specified filesystem. The filesystem can be specified by one of the mountpoints or the device name (or UUID, etc.). When this option is used together with −−recursive,then all nested mounts within the filesystem are recursively un- mounted. This option is only supported on systems where /etc/mtab is a symlink to /proc/mounts.
    [Show full text]
  • Managing Network File Systems in Oracle® Solaris 11.4
    Managing Network File Systems in ® Oracle Solaris 11.4 Part No: E61004 August 2021 Managing Network File Systems in Oracle Solaris 11.4 Part No: E61004 Copyright © 2002, 2021, Oracle and/or its affiliates. This software and related documentation are provided under a license agreement containing restrictions on use and disclosure and are protected by intellectual property laws. Except as expressly permitted in your license agreement or allowed by law, you may not use, copy, reproduce, translate, broadcast, modify, license, transmit, distribute, exhibit, perform, publish, or display any part, in any form, or by any means. Reverse engineering, disassembly, or decompilation of this software, unless required by law for interoperability, is prohibited. The information contained herein is subject to change without notice and is not warranted to be error-free. If you find any errors, please report them to us in writing. If this is software or related documentation that is delivered to the U.S. Government or anyone licensing it on behalf of the U.S. Government, then the following notice is applicable: U.S. GOVERNMENT END USERS: Oracle programs (including any operating system, integrated software, any programs embedded, installed or activated on delivered hardware, and modifications of such programs) and Oracle computer documentation or other Oracle data delivered to or accessed by U.S. Government end users are "commercial computer software" or "commercial computer software documentation" pursuant to the applicable Federal Acquisition Regulation and agency-specific supplemental regulations. As such, the use, reproduction, duplication, release, display, disclosure, modification, preparation of derivative works, and/or adaptation of i) Oracle programs (including any operating system, integrated software, any programs embedded, installed or activated on delivered hardware, and modifications of such programs), ii) Oracle computer documentation and/or iii) other Oracle data, is subject to the rights and limitations specified in the license contained in the applicable contract.
    [Show full text]
  • On-Demand Host-Container Filesystem Sharing
    TECHNION – ISRAEL INSTITUTE OF TECHNOLOGY On-Demand Host-Container Filesystem Sharing Bassam Yassin and Guy Barshatski Supervisor: Noam Shalev NSSL Labs Winter 2016 Implementing and adding a new feature to Docker open source project which allows a host to add extra volume to a running container 1 Contents List Of Figures ............................................................................................................................ 3 1 Abstract ................................................................................................................................. 4 2 Introduction ........................................................................................................................... 5 3 Background Theory ................................................................................................................ 6 3.1 Device .............................................................................................................................. 6 3.1.1 Character devices ..................................................................................................... 6 3.1.2 Block devices ............................................................................................................ 6 3.2 Unix-Like Filesystem ....................................................................................................... 7 3.3 Namespaces and Cgroups ............................................................................................... 9 3.3.1 Namespaces .............................................................................................................
    [Show full text]
  • Effects of Surfactants and Polyelectrolytes on the Interaction
    Article pubs.acs.org/Langmuir Effects of Surfactants and Polyelectrolytes on the Interaction between a Negatively Charged Surface and a Hydrophobic Polymer Surface † † ‡ § ∥ Michael V. Rapp, Stephen H. Donaldson, Jr., Matthew A. Gebbie, Yonas Gizaw, Peter Koenig, § † ‡ Yuri Roiter, and Jacob N. Israelachvili*, , † Department of Chemical Engineering, University of California, Santa Barbara, California 93106-5080, United States ‡ Materials Department, University of California, Santa Barbara, California 93106-5050, United States § Winton Hill Business Center, The Procter & Gamble Company, 6210 Center Hill Avenue, Cincinnati, Ohio 45224, United States ∥ Modeling and Simulation/Computational Chemistry, The Procter & Gamble Company, 8611 Beckett Road, West Chester, Ohio 45069, United States *S Supporting Information ABSTRACT: We have measured and characterized how three classes of surface-active molecules self-assemble at, and modulate the interfacial forces between, a negatively charged mica surface and a hydrophobic end-grafted polydimethylsiloxane (PDMS) polymer surface in solution. We provide a broad overview of how chemical and structural properties of surfactant molecules result in different self-assembled structures at polymer and mineral surfaces, by studying three characteristic surfactants: (1) an anionic aliphatic surfactant, sodium dodecyl sulfate (SDS), (2) a cationic aliphatic surfactant, myristyltrimethylammonium bro- mide (MTAB), and (3) a silicone polyelectrolyte with a long-chain PDMS midblock and multiple cationic end groups.
    [Show full text]
  • Unix Programmer's Manual
    There is no warranty of merchantability nor any warranty of fitness for a particu!ar purpose nor any other warranty, either expressed or imp!ied, a’s to the accuracy of the enclosed m~=:crials or a~ Io ~helr ,~.ui~::~::.j!it’/ for ~ny p~rficu~ar pur~.~o~e. ~".-~--, ....-.re: " n~ I T~ ~hone Laaorator es 8ssumg$ no rO, p::::nS,-,,.:~:y ~or their use by the recipient. Furln=,, [: ’ La:::.c:,:e?o:,os ~:’urnes no ob~ja~tjon ~o furnish 6ny a~o,~,,..n~e at ~ny k:nd v,,hetsoever, or to furnish any additional jnformstjcn or documenta’tjon. UNIX PROGRAMMER’S MANUAL F~ifth ~ K. Thompson D. M. Ritchie June, 1974 Copyright:.©d972, 1973, 1974 Bell Telephone:Laboratories, Incorporated Copyright © 1972, 1973, 1974 Bell Telephone Laboratories, Incorporated This manual was set by a Graphic Systems photo- typesetter driven by the troff formatting program operating under the UNIX system. The text of the manual was prepared using the ed text editor. PREFACE to the Fifth Edition . The number of UNIX installations is now above 50, and many more are expected. None of these has exactly the same complement of hardware or software. Therefore, at any particular installa- tion, it is quite possible that this manual will give inappropriate information. The authors are grateful to L. L. Cherry, L. A. Dimino, R. C. Haight, S. C. Johnson, B. W. Ker- nighan, M. E. Lesk, and E. N. Pinson for their contributions to the system software, and to L. E. McMahon for software and for his contributions to this manual.
    [Show full text]
  • Unix Programmer's Manual
    - UNIX PROGRAMMER'S MANUAL Sixth Edition K. Thompson D. M. Ritchie May, 1975 - This manual was set by a Graphic Systems phototypeset- ter driven by the troff formatting program operating un- der the UNIX system. The text of the manual was pre- pared using the ed text editor. - PREFACE to the Sixth Edition We are grateful to L. L. Cherry, R. C. Haight, S. C. Johnson, B. W. Kernighan, M. E. Lesk, and E. N. Pin- son for their contributions to the system software, and to L. E. McMahon for software and for his contribu- tions to this manual. We are particularly appreciative of the invaluable technical, editorial, and administra- tive efforts of J. F. Ossanna, M. D. McIlroy, and R. Morris. They all contributed greatly to the stock of UNIX software and to this manual. Their inventiveness, thoughtful criticism, and ungrudging support in- creased immeasurably not only whatever success the UNIX system enjoys, but also our own enjoyment in its creation. i - INTRODUCTION TO THIS MANUAL This manual gives descriptions of the publicly available features of UNIX. It provides neither a general overview ߝ see ‘‘The UNIX Time-sharing System’’ (Comm. ACM 17 7, July 1974, pp. 365-375) for that ߝ nor details of the implementation of the system, which remain to be disclosed. Within the area it surveys, this manual attempts to be as complete and timely as possible. A conscious de- cision was made to describe each program in exactly the state it was in at the time its manual section was prepared. In particular, the desire to describe something as it should be, not as it is, was resisted.
    [Show full text]