DOCSLIB.ORG

Control Language Application Module Reference Manual

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Control Language Application Module Reference Manual L Control Language Application Module Reference Manual AM27-410 L Implementation Application Module - 3 Control Language Application Module Reference Manual AM27-410 Release 420 2/96 Copyright, Trademarks, and Notices © Copyright 1992 by Honeywell Inc. Revision 06 – February 15, 1996 While this information is presented in good faith and believed to be accurate, Honeywell disclaims the implied warranties of merchantability and fitness for a particular purpose and makes no express warranties except as may be stated in its written agreement with and for its customer. In no event is Honeywell liable to anyone for any indirect, special or consequential damages. The information and specifications in this document are subject to change without notice. About This Publication This publication provides reference information about the Honeywell Control Language for the Application Module (CL/AM). This publication supports software Release 420. Change bars are used to indicate paragraphs, tables, or illustrations containing changes that have been made by Document Change Notices or an update. Pages revised only to correct minor typographical errors contain no change bars. All changes made by previous Document Change Notices have been incorporated in this update. CL/AM Reference 2/96 CL/AM Reference 2/96 Table of Contents 1 INTRODUCTION 1.1 Purpose/Background 1.2 References 1.2.1 General CL/AM Information 1.2.2 Publications with CL/AM-Specific Information 1.3 CL/AM Overview 2 RULES AND ELEMENTS OF CL/AM 2.1 Introduction to CL/AM Rules and Elements 2.2 CL/AM Rules and Elements 2.2.1 Character Set Definition 2.2.2 Spacing 2.2.3 Lines 2.2.4 Syntax (Summary is in Appendix A) 2.2.5 CL/AM Restrictions 2.2.6 Comments 2.2.7 Identifiers 2.2.8 Numbers 2.2.9 String 2.2.10 Special Symbols 2.3 CL/AM Data Types 2.3.1 Number Data Type 2.3.2 Time Data Type 2.3.3 Discrete Data Types 2.3.4 Data Points Data Type 2.3.5 Array Data Type 2.3.6 String Data Type 2.3.7 Referencing Compound Elements 2.3.8 Indirect Reference to Point Identifiers 2.4 Variables and Declarations 2.4.1 Variables and Declarations Syntax 2.4.2 Local Variables 2.4.3 Local Constants 2.4.4 External Data Points 2.4.5 Parameter Declarations 2.4.6 Function Declarations 2.5 Expressions and Conditions 2.5.1 Expressions and Conditions Syntax 2.5.2 Arithmetic and Logical Expressions 2.5.3 Time Expressions 2.5.4 Conditions Definition 3 CL/AM STATEMENTS 3.1 Introduction 3.2 Program Statements Definition 3.2.1 Program Statements Syntax 3.2.2 Statement Labels 3.2.3 SET Statement 3.2.4 STATE CHANGE Statement CL/AM Reference i 2/96 Table of Contents 3.2.5 GOTO Statement 3.2.6 IF, THEN, ELSE Statement 3.2.7 LOOP Statement 3.2.8 REPEAT Statement 3.2.9 CALL Statement 3.2.10 SEND Statement 3.2.11 EXIT Statement 3.2.12 ABORT Statement 3.2.13 END Statement 3.3 Embedded Compiler Directives 3.3.1 Embedded Compiler Directives Syntax 3.3.2 %PAGE Directive 3.3.3 %DEBUG Directive 3.3.4 %RELAX Directive 3.3.5 %INCLUDE_SET Directive 3.3.6 %INCLUDE_SOURCE Directive 4 CL/AM STRUCTURES 4.1 CL/AM Structures—General Orientation 4.2 Block Definition 4.2.1 Block Syntax 4.2.2 Block Description 4.2.3 Block-Heading Definition 4.2.4 Block-Heading Syntax 4.2.5 Block-Heading Description 4.2.6 Block-Heading Examples 4.3 Subroutine Definition 4.3.1 Subroutine-Heading Definition 4.3.2 Subroutine-Heading Syntax 4.3.3 Subroutine-Heading Description 4.3.4 Subroutine-Heading Examples 4.3.5 Subroutine Data-Declarations Definition 4.3.6 Subroutine Arguments Definition 4.3.7 Built-in Functions and Subroutines 4.4 Custom Data Segments Definition 4.4.1 Custom Data Segment Syntax 4.4.2 Custom Data Segment Description 4.4.3 Custom Data Segment Heading 4.4.4 Custom Data Segment Parameter Declaration 4.4.5 Custom Data Segment Parameter Attribute Statement 4.5 Parameter List Definition 4.5.1 Parameter List Syntax 4.5.2 Parameter List Description 4.5.3 Parameter List Examples 4.6 Enumeration-Type Definition 4.6.1 Enumeration-Type Definition Syntax 4.6.2 Enumeration-Type Definition Description 4.6.3 Enumeration-Type Definition Examples 4.7 Package Definition 4.7.1 Package Syntax 4.7.2 Package Description 4.7.3 Package Examples CL/AM Reference ii 2/96 Table of Contents 4.8 CL Runtime Extensions 4.9 Examples of CL/AM Structures 4.9.1 PV Calculation Example 4.9.2 Linearization Example 4.9.3 Custom Data Segment Example 4.9.4 BTU Switch Package Example 4.10 File Manager Status Return Values 4.11 CDS Request Return Status Values APPENDIX A CL/AM SYNTAX SUMMARY A.1 Syntax (Grammar) Summary A.2 Syntax Diagram Summary A.3 Notation Used for Syntax Production Rules A.4 CL/AM Syntax Production Rules APPENDIX B CL/AM SOFTWARE ENVIRONMENT B.1 References to Control Functions Publications B.2 CL/CDS Capacities B.3 $REG_CTL Parameter List B.4 CL Data Access Performance APPENDIX C CL/AM EXTENSION FOR FILE I/O C.1 References C.2 Overview of File I/O Extensions C.3 Restrictions C.4 Packaging C.5 Installation and Configuration C.6 CL Callable Subroutines C.7 Return Status Values C.8 Memory Considerations C.9 File I/O Performance Example APPENDIX D CL/AM EXTENSION FOR CONTINUOUS HISTORY ACCESS D.1 Overview of the History Access Extension D.1.1 Features of this CL/AM Extension D.1.2 Summary of Subroutines in this CL Extension D.1.3 Memory Use D.2 Packaging D.3 Installation and Configuration D.4 CL Callable Subroutines D.4.1 Introduction D.4.1.1 Including the Set Definition File D.4.1.2 Subroutine Return Status D.4.1.3 CL Aborts D.4.2 AMCL03$Get_Collection_Rate Subroutine D.4.3 AMCL03$Abs_History Subroutine D.4.4 AMCL03$Rel_History Subroutine D.4.5 AMCL03$Avg_History Subroutine CL/AM Reference iii 2/96 Table of Contents D.5 Special Issues D.5.1 Bad Values D.5.2 Time Change D.5.2.1 Spring Time Change D.5.2.2 Fall Time Change D.5.3 Scope of Search APPENDIX E CL/AM EXTENSION FOR MATH LIBRARY E.1 Overview of the Math Library Extension E.1.1 Features of this CL/AM Extension E.1.2 Summary of Subroutines in this CL Extension E.1.3 Hardware Requirements E.1.3.1 Memory Used E.1.3.2 Processor Type E.1.4 Work Areas E.1.5 Matrix Size Restrictions E.1.6 Array and Array Size Arguments E.2 Packaging E.3 Installation and Configuration E.4 CL Callable Subroutines E.4.1 Introduction E.4.1.1 Including the Set Definition File E.4.1.2 Subroutine Return Status E.4.1.3 CL Aborts E.4.2 AMCL02$Standard_Deviation Subroutine E.4.3 AMCL02$Uniform_Random_Number Subroutine E.4.4 AMCL02$Normal_Random_Number Subroutine E.4.5 AMCL02$Get_Time Subroutine E.4.6 AMCL02$Subtract_Time Subroutine E.4.7 AMCL02$CDS_Array_to_Local_Matrix Subroutine E.4.8 AMCL02$Local_Matrix_to_CDS_Array Subroutine E.4.9 AMCL02$Create_Work_Area Subroutine E.4.10 AMCL02$Reserve_Work_Area Subroutine E.4.11 AMCL02$Release_Work_Area Subroutine E.4.12 AMCL02$Init_Matrix_Work_Area Subroutine E.4.13 AMCL02$Init_Matrix_Work_Area2 Subroutine E.4.14 AMCL02$Get_Work_Area_Info Subroutine E.4.15 AMCL02$Get_Matrix_Work_Area_Info Subroutine E.4.16 AMCL02$Get_Matrix_Info Subroutine E.4.17 AMCL02$Create_Matrix Subroutine E.4.18 AMCL02$Put_Element Subroutine E.4.19 AMCL02$Get_Element Subroutine E.4.20 AMCL02$Add_Matrices Subroutine E.4.21 AMCL02$Subtract_Matrices Subroutine E.4.22 AMCL02$Multiply_Matrices Subroutine E.4.23 AMCL02$Multiply_Scalar Subroutine E.4.24 AMCL02$Transpose_Matrix Subroutine E.4.25 AMCL02$Matrix_Inversion Subroutine E.4.26 AMCL02$SVD Subroutine E.5 Matrix Functions Example E.6 Return Status Values CL/AM Reference iv 2/96 Table of Contents APPENDIX F CDS MOVE AND MULTIPLE MOVE PARAMETER EXTENSION F.1 Overview F.2 Memory Requirements, Packaging, and AM Configuration F.2.1 Memory Requirements F.2.2 Packaging F.2.3 Distributed Files F.2.4 Installation F.2.5 Application Module Configuration F.3 CDS_Move F.3.1 Overview F.3.2 CL Aborts F.3.3 Performance F.3.4 CDS_Move Restrictions F.3.5 AMCL01$CDS_Move F.4 Multiple_Move_Parameter F.4.1 Introduction F.4.2 Overview F.4.3 Move Execution Order F.4.4 Database Consistency F.5.5 Dynamic Indirection F.4.6 List Permanence F.4.7 List Ownership F.4.8 List Access F.4.9 Redundancy F.4.10 Error Handling F.4.11 Parameter Access Request Limits and Restrictions F.4.12 Calling the Subroutines F.4.13 Multiple Move Subroutines F.4.14 Error Message Summary F.4.15 AMCL01$Allocate_List F.4.16 AMCL01$Get_List_Id F.4.17 AMCL01$Modify_Entry F.4.18 AMCL01$Modify_Complex_Entry F.4.19 AMCL01$Multiple_Move_Parameter F.4.20 AMCL01$Set_Permanent_List F.4.21 AMCL01$Deallocate_List F.4.22 AMCL01$Get_List_Mem_Stats F.4.23 AMCL01$Change_List_Mem_Size F.4.24 AMCL01$Set_List_Item_Active F.4.25 AMCL01$Get_Exec_Time_Stats CL/AM Reference v 2/96 Table of Contents APPENDIX G AM EXTENSION FOR FAST EXTERNAL CDS FETCH G.1 Overview G.2 AM Performance Impact G.3 AM Memory Impact G.4 Packaging G.5 Distributed Files G.6 Installation G.7 Application Module Configuration APPENDIX H AM EXTENSION FOR OFF-NODE ACCESS H.1 Overview H.2 Functionality of the Extension H.3 AM Performance Impact H.4 AM Memory Impact H.5 Packaging H.6 Distributed Files H.7 Installation H.8 Application Module Configuration APPENDIX I AM EXTENSION FOR OFF-NODE ACCESS I.1 Overview I.2 Installation I.3 Executing X-Side Applications I.4 Hibernating Applications I.5 AMCL06$Execute_Task_With_Wait I.6 AMCL06$Get_Queue_Info I.7 AMCL06$Get_Queue_Slot_Info I.8 AMCL06$Store_XAccess I.9 AMCL06$Initiate_Task I.10 AMCL06$Activate_Task I.11 AMCL06$Terminate_Task I.12 AMCL06$Get_Hiber_Task_Status I.13 Stopping X-Side Applications I.14 Using the kill_appls X-Side Tool I.15 The X-side display_appls Tool INDEX CL/AM Reference vi 2/96 Table of Contents 1 INTRODUCTION 1.1 Purpose/Background
Load more

Recommended publications
  • Rocket Universe 11 Structural Changes
    Rocket UniVerse 11 Structural Changes What you need to know before you install or upgrade to UniVerse 11 Rocket U2 Technical Support Supplemental Information April 2014 UNV-112-REP-OG-1 Notices Edition Publication date: April 2014 Book number: UNV-112-REP-OG-1 Product version: Rocket UniVerse V11.2 Copyright © Rocket Software, Inc. or its affiliate 1985-2014. All Rights Reserved. Trademarks Rocket is a registered trademark of Rocket Software, Inc. For a list of Rocket registered trademarks go to: www.rocketsoftware.com/about/legal. All other products or services mentioned in this document may be covered by the trademarks, service marks, or product names of their respective owners. Examples This information might contain examples of data and reports. The examples include the names of individuals, companies, brands, and products. All of these names are fictitious and any similarity to the names and addresses used by an actual business enterprise is entirely coincidental. License agreement This software and the associated documentation are proprietary and confidential to Rocket Software, Inc. or its affiliates, are furnished under license, and may be used and copied only in accordance with the terms of such license. Note: This product may contain encryption technology. Many countries prohibit or restrict the use, import, or export of encryption technologies, and current use, import, and export regulations should be followed when exporting this product. Contact information Website: www.rocketsoftware.com Rocket Software, Inc. Headquarters 77 4th Avenue, Suite 100 Waltham, MA 02451-1468 USA Tel: +1 781 577 4321 Fax: +1 617 630 7100 2 Contacting Global Technical Support If you have current support and maintenance agreements with Rocket Software, you can access the Rocket Customer Portal to report and track a problem, to submit an enhancement request or question, or to find answers in the U2 Knowledgebase.
    [Show full text]
  • A Soft Linen Emulsion Rate Intelligent Control System Based on the Domain Interpolation Algorithm with Self Adjusting
    JOURNAL OF SOFTWARE, VOL. 6, NO. 8, AUGUST 2011 1429 A Soft Linen Emulsion Rate Intelligent Control System Based on the Domain Interpolation Algorithm with Self Adjusting Xiao Ying Jinggangshan University / school of Electronic and Information Engineering, Ji’an, Jiangxi ,China 343009 [email protected] Peng Xuange Jinggangshan University / school of Electronic and Information Engineering, Ji’an, Jiangxi ,China 343009 [email protected] Abstract—A soft linen emulsion rate intelligent control linen and ramie is called as soft linen, including system based on the domain interpolation algorithm with mechanical soft linen, fuel, wet and storage. The purpose self adjusting is introduced. In the hemp textile industry, is to enable fiber loose, soft, surface lubrication, remove soft linen deal processes can directly affect its following some impurities and then fermented by the heap storage process. We take the lead to use the fuzzy control method to improve the fiber spin ability, then carding and applied in soft linen emulsion rate of Intelligent Control System. In the research process, the improvement of spinning can be carried out. This process quality has the product quality is not satisfied by basic fuzzy control direct impact on the following process, such as the method. By improving the algorithm, combined advanced quality of spinning and weaving. interpolation algorithm into fuzzy decision process, that The references show that the world, especially experience rule set has no restriction to access control list, Southeast Asia, in hemp textile the soft linen processes enhanced the flexibility of the method, and obtain fine are used the same fall behind technology model, that is enough fuzzy control table under the same rules.
    [Show full text]
  • Powerconnect 3448 User's Guide
    Dell™ PowerConnect™ 34XX Systems User’s Guide Notes, Notices, and Cautions NOTE: A NOTE indicates important information that helps you make better use of your computer. NOTICE: A NOTICE indicates either potential damage to hardware or loss of data and tells you how to avoid the problem. CAUTION: A CAUTION indicates a potential for property damage, personal injury, or death. ____________________ Information in this document is subject to change without notice. © 2005 Dell Inc. All rights reserved. Reproduction in any manner whatsoever without the written permission of Dell Inc. is strictly forbidden. Trademarks used in this text: Dell, Dell OpenManage, the DELL logo, and PowerConnect are trademarks of Dell Inc. Microsoft and Windows are registered trademarks of Microsoft Corporation. Other trademarks and trade names may be used in this document to refer to either the entities claiming the marks and names or their products. Dell Inc. disclaims any proprietary interest in trademarks and trade names other than its own. May 2005 Rev A01 Contents 1 Introduction System Description . 21 PowerConnect 3424 . 21 PowerConnect 3424P . 21 PowerConnect 3448 . 22 PowerConnect 3448P . 22 Stacking Overview . 22 Understanding the Stack Topology . 23 Stacking Failover Topology . 23 Stacking Members and Unit ID. 23 Removing and Replacing Stacking Members . 24 Exchanging Stacking Members . 25 Switching from the Stack Master to the Backup Stack Master. 27 Features Overview. 28 Power over Ethernet . 28 Head of Line Blocking . 28 Flow Control Support (IEEE 802.3X) . 28 Back Pressure Support . 28 Virtual Cable Testing (VCT). 28 MDI/MDIX Support . 29 Auto Negotiation . 29 MAC Address Supported Features . 29 Layer 2 Features .
    [Show full text]
  • A Meta-Semantic Language for Smart Component-Adapters
    New Jersey Institute of Technology Digital Commons @ NJIT Dissertations Electronic Theses and Dissertations Spring 5-31-2000 A meta-semantic language for smart component-adapters Leon K. Jololian New Jersey Institute of Technology Follow this and additional works at: https://digitalcommons.njit.edu/dissertations Part of the Computer Sciences Commons Recommended Citation Jololian, Leon K., "A meta-semantic language for smart component-adapters" (2000). Dissertations. 406. https://digitalcommons.njit.edu/dissertations/406 This Dissertation is brought to you for free and open access by the Electronic Theses and Dissertations at Digital Commons @ NJIT. It has been accepted for inclusion in Dissertations by an authorized administrator of Digital Commons @ NJIT. For more information, please contact [email protected]. Copyright Warning & Restrictions The copyright law of the United States (Title 17, United States Code) governs the making of photocopies or other reproductions of copyrighted material. Under certain conditions specified in the law, libraries and archives are authorized to furnish a photocopy or other reproduction. One of these specified conditions is that the photocopy or reproduction is not to be “used for any purpose other than private study, scholarship, or research.” If a, user makes a request for, or later uses, a photocopy or reproduction for purposes in excess of “fair use” that user may be liable for copyright infringement, This institution reserves the right to refuse to accept a copying order if, in its judgment,
    [Show full text]
  • A Hardware Efficient Implementation of a Boxes Reinforcement Learning System
    A Hardware Efficient Implementation of a Boxes Reinforcement Learning System Yendo Hu and Ronald D. Fellman Department of Electrical and Computer Engineering. 0407 University of California at San Diego December 21,1993 Abstract through the previously traversed system states. The effect This paper presents two modifications to the Boxes- of the reinforcement signal on a control parameter ASEIACE reinforcement learning algorithm to improve decreases exponentially with the elapsed time since the implementation efficiency and performance. A state his- system had last entered that state. In [2], a single ASE, tory queue (SHQ) replaces the decay computations asso- along with one ACE, successfully learned to solved the ciated with each conwl state, decoupling the pole balancing problem. Many other researchers have dependence of computational demand from the number also used a pole-cart balancer to benchmark the of conml states. A dynamic link table implements performance of their algorithms [81 [ll. CMAC state association to training time, yet decrease The ASE assigns a register to hold an output control minimize the number of control states. Simulations of value for each unique system state. Taken together, these the link table demonstrated its potential for minimizing registers form a control table that maps a plant state to a control states for unoptimized state-space quantization. control action. Each register holds the long-term trace Simulations coupling the link table to CMAC state asso- that represents both the output action, the trace’s sign, ciation show a 3-fold reduction in learning time. A hard- and also a confidence level, the trace’s magnitude.
    [Show full text]
  • Table of Contents
    A Comprehensive Introduction to Vista Operating System Table of Contents Chapter 1 - Windows Vista Chapter 2 - Development of Windows Vista Chapter 3 - Features New to Windows Vista Chapter 4 - Technical Features New to Windows Vista Chapter 5 - Security and Safety Features New to Windows Vista Chapter 6 - Windows Vista Editions Chapter 7 - Criticism of Windows Vista Chapter 8 - Windows Vista Networking Technologies Chapter 9 -WT Vista Transformation Pack _____________________ WORLD TECHNOLOGIES _____________________ Abstraction and Closure in Computer Science Table of Contents Chapter 1 - Abstraction (Computer Science) Chapter 2 - Closure (Computer Science) Chapter 3 - Control Flow and Structured Programming Chapter 4 - Abstract Data Type and Object (Computer Science) Chapter 5 - Levels of Abstraction Chapter 6 - Anonymous Function WT _____________________ WORLD TECHNOLOGIES _____________________ Advanced Linux Operating Systems Table of Contents Chapter 1 - Introduction to Linux Chapter 2 - Linux Kernel Chapter 3 - History of Linux Chapter 4 - Linux Adoption Chapter 5 - Linux Distribution Chapter 6 - SCO-Linux Controversies Chapter 7 - GNU/Linux Naming Controversy Chapter 8 -WT Criticism of Desktop Linux _____________________ WORLD TECHNOLOGIES _____________________ Advanced Software Testing Table of Contents Chapter 1 - Software Testing Chapter 2 - Application Programming Interface and Code Coverage Chapter 3 - Fault Injection and Mutation Testing Chapter 4 - Exploratory Testing, Fuzz Testing and Equivalence Partitioning Chapter 5
    [Show full text]
  • HP-UX to Oracle Solaris Porting Guide Getting Started on the Move to Oracle Solaris
    An Oracle White Paper October 2011 HP-UX to Oracle Solaris Porting Guide Getting Started on the Move to Oracle Solaris HP-UX to Oracle Solaris Porting Guide Chapter 1 Introduction...................................................................... 1 Oracle Solaris ................................................................................. 1 The Advantages of Porting to Oracle Solaris.................................. 2 Chapter 2 The Porting Process........................................................ 4 Infrastructure and Application Porting Assessment ........................ 4 Build Environment Deployment....................................................... 5 Data Integration .............................................................................. 5 Source Code Porting....................................................................... 6 Application Verification.................................................................... 6 Commercial Applications and Third-Party Products ....................... 6 Chapter 3 Operating System Considerations................................... 7 Processor Endianness .................................................................... 7 Data Alignment ............................................................................... 7 Read/Write Structures..................................................................... 8 Storage Order and Alignment ......................................................... 8 64-Bit Data Models ........................................................................
    [Show full text]
  • NASA Technical Memorandum
    NASA Technical Memorandum NASA TM-86467 REAL-TIME SOLAR MAGNETOGRAPH OPERATION SYSTEM SOFTWARE DESIGN AND USER'S GUIDE By Caroline Wang Space Science Laboratory Science and Engineering Directorate September 1984 NASA National Aeronautics and Space Administration George C. Marshall Space Flight Center MSFC - Form 3190 (Rev. May 1983) TECHNICAL REPORT STANDARD TITLE PAGE 1. REPORT NO. 2. GOVERNMENT ACCESSION NO. 3. RECIPIENT'S CATALOG NO. NASA TM -86467 4. TITLE AND SUBTITLE 5. REPORT DATE Real-Time Solar Magneto graph Operation System Software September 1-984 Design and User's Guide 6. PERFORMING ORGANIZATION CODE 7. AUTHOR(S) 8. PERFORMING ORGANIZATION REPORT tf Caroline Wang 9. PERFORMING ORGANIZATION NAME AND ADDRESS 10. WORK UNIT NO. George C. Marshall Space Flight Center 1 1. CONTRACT OR GRANT NO. Marshall Space Flight Center, Alabama 35812 13. TYPE OF REPORT & PERIOD COVERED 12. SPONSORING AGENCY NAME AND ADDRESS National Aeronautics and Space Administration Technical Memorandum Washington, D.C. 20546 14. SPONSORING AGENCY CODE 15. SUPPLEMENTARY NOTES Prepared by Space Science Laboratory, Science and Engineering Directorate. 16. ABSTRACT This document presents the Real-Time Solar Magnetograph (RTSM) Operation system software design on PDP11/23+ and the User's Guide. RTSM operation software is for Real-Time Instrumentation Control, data collection and data management. The data will be used for vector analysis, plotting or graphics display. The processed data can then be easily compared with solar data from other sources, such as the Solar Maximum Mission (SMM). 17. KEY WORDS 18. DISTRIBUTION STATEMENT Real Time Solar Magnetograph (RTSM) Unclassified — Unlimited Operation System Software 19. SECURITY CLASSIF.
    [Show full text]
  • Transient Air Dynamics Modeling for an Advanced Alternative Fueled Engine
    Transient Air Dynamics Modeling for an Advanced Alternative Fueled Engine Undergraduate Honors Thesis Presented in Partial Fulfillment of the Requirements for Graduation with Distinction at The Ohio State University By Ryan V. Everett * * * * * The Ohio State University 2010 Defense Committee: Professor Giorgio Rizzoni, Advisor Dr. Shawn Midlam-Mohler Copyrighted by Ryan V. Everett 2010 ii ABSTRACT The EcoCAR challenge is a three year competition with a goal of re-engineering a 2009 General Motors crossover utility vehicle to improve vehicle emissions and fuel economy, while maintaining drivability and consumer acceptability. Ohio State’s team has selected a plug-in hybrid electric vehicle (PHEV) architecture with a 1.8 L CNG Honda engine as the auxiliary power unit. The Honda engine is converted to run on E85 fuel, which requires the engine control software to be rewritten. The purpose of this research is to write a feed forward air/fuel ratio (AFR) control algorithm to better manage fuel injection during transient engine events. AFR control has a major impact on engine fuel economy and tail pipe emissions. This research investigates the accuracy of using a dynamic intake manifold filling and emptying model coupled with a linear approximation of the Taylor Series expansion to predict air flow forward in time. To better estimate air flowing passed the throttle plate and into the intake manifold, a quasi-static effective area map of the throttle was created. The control algorithm uses the throttle effective area map to improve the accuracy of air flow estimation into the intake manifold because the MAF sensor is not a reliable flow meter during transient engine events.
    [Show full text]
  • CS152 Midterm Solution
    University of California, Berkeley College of Engineering Department of Electrical Engineering and Computer Science CS152 Midterm Solution Prof. Bob Brodersen Fall, 2000 Problem 1: Single-cycle Processor and Performance Evaluation We have a single cycle processor as we learned in class. Besides the instructions R-format, lw, sw, and beq that the processor already implemented, the designer figured that certain software does the following instructions extensively input1 cs $t $s1 $s2; cslw $t $s1 $s2; cslwcs $t $s1 $s2 . zero Besides the usual PC handling and instruction fetch as before, Greater • the cs instruction is described as: GALU $t <= max($s1, $s2) output • The cslw does the following: Input 2 $t <=memory [ max($s1,$s2)] • The cslwcs instruction the following: $t <= max{$s1, memory[ max ($s1, $s2)]} ALUcontrol So now you see that cs and lw in above names stand for compare_select and loadword. The designer plans to modify the datapath and control signal based on the processor showed in next page. It’s a textbook processor with some missing blocks and wiring to fill in. The components he can use are any of the blocks already present in the design and the generalized GALU (showed above) with an additional output GREATER that equals to 1 if Input1-Input2 >0, and equals to 0 if Input1-Input2 =< 0. box1 A box2 BC Questions: a). Describe below in words and fill in box 1 the blocks needs to be added in order to implement the cs and cslw instruction. Furthermore add in and draw in box 2 any additional blocks to implement the cslwcs instruction.
    [Show full text]
  • See Schema of Table in Sql
    See Schema Of Table In Sql When Casey pep his rengas titter not ill-advisedly enough, is Waylon composite? Unbridged Niles untwines no splices fricasseed vehemently after Francis patent zigzag, quite Oceanian. Josiah ship salubriously. Lists all layers and see various database drops for test new on object browser and see in table of schema. Managing Database Functions with SQL Runner. Your personal information we see in table sql schema of. Grant alter cover to user mysql Festival Lost form the Fifties. Andy brings up without asking for obtaining metadata with the website helps us see in table of schema name may have a scenario where viewobj. You see properties in sql query. Some cookies are placed by being party services that appear without our pages. Follow any objects necessary, you for container of the desired information regarding all sql schema of table in? We welcome your comments! The output should contain these database tables, including those were were created by comprehensive system. You can be logged into databases through to create same unqualified access control pane and see in table of schema sql server has no upper case names. The schema as far as lars pointed out different scripts, see schema of table in sql statements will see. The security is secondary. Seite verwendet werden. Einige unserer partner können, schema to import operation fails and join information about all links but will use. Select a sql developer data sources configured in some constraint, see it also provided interface tables see in table of schema sql. Create view can now we have any dam which lets you? Select view_definition from sysobjects tableobj, see in table of schema sql server query below or sql standard, see various submenus, utilizzare il nostro traffico.
    [Show full text]
  • Organizing the Sequencing of Processes
    ORGANIZING THE SEQUENCING OF PROCESSES Fred Lesh Jet Propulsion Laboratory California Institute of Technology Pasadena, CA 91103/USA ABSTRACT The difficult part of many computer applications is the design and implementation of control mechanisms which allow the necessary calcula- tions to be performed at exactly the right time or in exactly the right logical sequence. Designing systems of this kind involves the designer in a variety of unusually interesting problems, and requires blending classical design approaches with techniques peculiar to computational control applications, This paper presents three examples of such appli- cations and describes the approach adopted for each. The classical design steps are then discussed, and elements peculiar to computational control are highlighted by illustrations drawn from the three sample systems. I. INTRODUCTION Many kinds of complexity plague designers of software systems. They are over- whelmed by the number and sophistication of the equations of motion for an inter- planetary spacecraft, innundated with the sheer volume of options and special cases of a business application, or puzzled how to achieve a convergent algorithm in the solution of coupled sets of partial differential equations. But there is a wide class of computer applications in which the primary com- plexity stems not from the difficulty or variety of the underlying computations but from the need to make those computations in the right order or at the right time. Systems developed to achieve this kind of ordering and timing are called "computa- tional control systems." Three examples of such systems are discussed in Section If. Computational control systems are usually written assuming that they will be used more than once for a variety of applications within a certain class.
    [Show full text]