Artificial Intelligence
|
|
|
- Dulcie Boone
- 9 years ago
- Views:
Transcription
1 Artificial Intelligence Lab 1 Marco Piastra Lab 1-1
2 Jess? Acronym of Java Expert System Shell A small environment written in Java Author: Ernest Friedman-Hill, Sandia National Laboratories in Livermore, Canada Rule-based system: the main programming construct is the rule if <cond> then <action> It is derived from an older and much larger system: CLIPS Adopts the syntax of the LISP programming language A program in Jess is mostly made up of a set rules to be applied to a set of facts Lab 1-2
3 Java: using the CLASSPATH variable Lab 1-3 You do not know what this is? It s normal: you never used Java at all Impostazione della variabile CLASSPATH $ CLASSPATH=<value> $ is the system prompt (do not write it, the system does $ export CLASSPATH To make sure that the above worked $ echo $CLASSPATH In our case: $ CLASSPATH=/home/opt/Jess61p8 $ export CLASSPATH Make sure you respect small and capital letters! (It s Linux, not Windows Starting Jess $ java jess.main Jess> Quitting Jess Jess> (exit $ (Wow, you made it!
4 Lists (file finitestatemachine.jess The LISP syntax It could hardly be simpler: everything is either an symbol or a list. LISP: Lots of Impossible Stupid Parenthesis (deftemplate fsm (slot current-state (multislot input-stream (multislot output-stream Lists can be nested at will (make sure you balance parentheses (exit Every Jess command is a list. Every legitimate Jess expression is a list Lab 1-4
5 deftemplate (file finitestatemachine.jess It defines template for structured facts (=basic data items in Jess (deftemplate event (slot current-state (slot input-symbol (slot output-symbol (slot new-state It is the template of individual facts like this: (event (current-state even (input-symbol 1 (output-symbol 1 (new-state odd Every slot will have exactly one value Lab 1-5
6 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output The meaning: the whole Jess language could fit it in. Lab 1-6
7 (file finitestatemachine.jess The whole thing is a list ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Lab 1-7
8 (file finitestatemachine.jess Name of the rule, just an id ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Lab 1-8
9 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns Separator: just find this first " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Lab 1-9
10 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output (LHS - Left Hand Side: the logical conditions that determine the applicability of the rule Lab 1-10
11 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Think about the LHS as the description of a pattern to be applied to facts Lab 1-11
12 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output (RHS - Right Hand Side: it describes the actions to be performed when the rule is FIREd Lab 1-12
13 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Facts can be either asserted or retracted Messages can be printed Lab 1-13
14 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output This is a variable Lab 1-14
15 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output A Jess variable is always preceded by? Lab 1-15
16 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output If the overall pattern matches each variable will bind to a symbol CAUTION: matching the pattern in the LHS is an all or nothing matter Lab 1-16
17 (file finitestatemachine.jess ( state-transition A variable can also bind to a fact?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Lab 1-17
18 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output The $ operator makes the variable bind to a list of values Lab 1-18
19 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Different occurrences of the same variable in the LHS: they all bind to the same value Lab 1-19
20 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output A logical clause, part of the LHS Lab 1-20
21 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output If the pattern matches, each clause binds to a fact, not necessarily distinct Lab 1-21
22 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Another logical clause. There are two clauses in this LHS. Lab 1-22
23 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Different occurrences of the same variable define a constraint across clauses, since they all bind to the same value Lab 1-23
24 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output Another constraint Lab 1-24
25 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output This variable binds to the fact that matches the clause Lab 1-25
26 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output The binding of variables propagates from the LHS to the RHS Lab 1-26
27 (file finitestatemachine.jess ( state-transition?current <- (fsm (current-state?cs (input-stream?is $?rest (output-stream $?output (event (current-state?cs (input-symbol?is (output-symbol?os (new-state?ns " to state "?ns " output "?os crlf (modify?current (current-state?ns (input-stream?rest (output-stream?os?output More examples Lab 1-27
28 deffacts (file paritychecker-fsa.jess It is used to define the initial facts, that are in memory at the beginning The (reset command erases the working memory and re-asserts all facts defined with deffacts (deffacts test-string (fsm (current-state even (input-stream (output-stream Lab 1-28
29 deffacts (file paritychecker-fsa.jess It is used to define the initial facts, that are in memory at the beginning The (reset command erases the working memory and re-asserts all facts defined with deffacts (deffacts test-string (fsm (current-state even (input-stream (output-stream In this particular case, just an individual fact is asserted Lab 1-29
30 deffacts (file paritychecker-fsa.jess It is used to define the initial facts, that are in memory at the beginning The (reset command erases the working memory and re-asserts all facts defined with deffacts (deffacts test-string (fsm (current-state even (input-stream (output-stream In this particular case, just an individual fact is asserted In general, any number of facts can be asserted via a deffacts Lab 1-30
31 deffacts (file paritychecker-fsa.jess It is used to define the initial facts, that are in memory at the beginning The (reset command erases the working memory and re-asserts all facts defined with deffacts (deffacts test-string (fsm (current-state even (input-stream (output-stream In this particular case, just an individual fact is asserted In general, any number of facts can be asserted via a deffacts There can be many deffacts in the same program Lab 1-31
32 deffacts (file paritychecker-fsa.jess It is used to define the initial facts, that are in memory at the beginning The (reset command erases the working memory and re-asserts all facts defined with deffacts (deffacts test-string (fsm (current-state even (input-stream (output-stream In this particular case, just an individual fact is asserted In general, any number of facts can be asserted via a deffacts There can be many deffacts in the same program All of them will be executed by the command (reset Lab 1-32
33 How to load a program Start Jess first (it improves the effect $ java jess.main Jess> Loading a file (batch paritychecker-fsa.jess also (batch paritychecker-fsa.jess If it worked, Jess will say: TRUE Lab 1-33
34 How Jess works (in a first approximation Once activated, Jess repeats the same execution cycle MATCH Find all rule applications (i.e. combinations of a rule and facts matching its LHS Are there rule applications? yes no CONFLICT RESOLUTION Select one rule (always, one and only one FIRE Apply the selected rule by executing its RHS Lab 1-34
35 How to start Jess execution Reset: erases memory and re-asserts the initial facts It causes the execution of deffacts Make sure you always do a reset before a new run! (reset Jess answers: TRUE Run: starts the main execution cycle (run Jess answers: <here comes the program s output> TRUE Lab 1-35
36 A few debugging commands Execute one cycle at time (i.e. step mode (run 1 Also (run n to execute n cycles List all facts currently in memory (facts The answer is not very readable, it takes some effort to decode it List all rule applications (one rule + facts matching its LHS (agenda The answer is not very readable, it takes some effort to decode it Lab 1-36
The CLIPS environment. The CLIPS programming language. CLIPS production rules language - facts. Notes
The CLIPS environment The CLIPS environment CLIPS is an environment to develop knowledge based systems It defines a programming language that allows to represent declarative and procedural knowledge This
Open-Source, Cross-Platform Java Tools Working Together on a Dialogue System
Open-Source, Cross-Platform Java Tools Working Together on a Dialogue System Oana NICOLAE Faculty of Mathematics and Computer Science, Department of Computer Science, University of Craiova, Romania [email protected]
CLIPS User s Guide. by Joseph C. Giarratano, Ph.D. Version 6.30
CLIPS User s Guide by Joseph C. Giarratano, Ph.D. Version 6.30 Table of Contents Readme... i Just the Facts... 1 Following the Rules... 20 Adding Details... 29 Variable Interests... 36 Doing It Up In Style...
Reference Manual Volume I Basic Programming Guide
Reference Manual Volume I Basic Programming Guide Version 6.30 March 17th 2015 CLIPS Basic Programming Guide Version 6.30 March 17th 2015 CONTENTS License Information... i Preface... iii Acknowledgements...
Unix Scripts and Job Scheduling
Unix Scripts and Job Scheduling Michael B. Spring Department of Information Science and Telecommunications University of Pittsburgh [email protected] http://www.sis.pitt.edu/~spring Overview Shell Scripts
VHDL Test Bench Tutorial
University of Pennsylvania Department of Electrical and Systems Engineering ESE171 - Digital Design Laboratory VHDL Test Bench Tutorial Purpose The goal of this tutorial is to demonstrate how to automate
1 of 1 24/05/2013 10:23 AM
?Init=Y 1 of 1 24/05/2013 10:23 AM 1. Which of the following correctly defines a queue? a list of elements with a first in last out order. a list of elements with a first in first out order. (*) something
Creating a Simple Macro
28 Creating a Simple Macro What Is a Macro?, 28-2 Terminology: three types of macros The Structure of a Simple Macro, 28-2 GMACRO and ENDMACRO, Template, Body of the macro Example of a Simple Macro, 28-4
Introduction to Java Applications. 2005 Pearson Education, Inc. All rights reserved.
1 2 Introduction to Java Applications 2.2 First Program in Java: Printing a Line of Text 2 Application Executes when you use the java command to launch the Java Virtual Machine (JVM) Sample program Displays
No Solution Equations Let s look at the following equation: 2 +3=2 +7
5.4 Solving Equations with Infinite or No Solutions So far we have looked at equations where there is exactly one solution. It is possible to have more than solution in other types of equations that are
GETTING FESTIVAL TO RUN ON WINDOWS XP WITH CYGWIN
GETTING FESTIVAL TO RUN ON WINDOWS XP WITH CYGWIN Vladimir Kulyukin John Nicholson Computer Science Assistive Technology Laboratory Department of Computer Science Utah State University This document manual
Towards Rule-based System for the Assembly of 3D Bricks
Universal Journal of Communications and Network 3(4): 77-81, 2015 DOI: 10.13189/ujcn.2015.030401 http://www.hrpub.org Towards Rule-based System for the Assembly of 3D Bricks Sanguk Noh School of Computer
http://jade.tilab.com/
http://jade.tilab.com/ JADE A framework for developing multi-agent systems FIPA-compliant Written in JAVA, consists of an API with several packages Agent platform: 2 AMS and DF Agent Management System
Advanced x86: BIOS and System Management Mode Internals SPI Flash. Xeno Kovah && Corey Kallenberg LegbaCore, LLC
Advanced x86: BIOS and System Management Mode Internals SPI Flash Xeno Kovah && Corey Kallenberg LegbaCore, LLC All materials are licensed under a Creative Commons Share Alike license. http://creativecommons.org/licenses/by-sa/3.0/
A Rules Engine Experiment: Lessons Learned on When and How to use a Rules-Based Solution
Approved for Public Release; Distribution Unlimited. Case Number 14-1985 A Rules Engine Experiment: Lessons Learned on When and How to use a Rules-Based Solution June 24, 2014. 2 Agenda Discuss BRMS Rules
Implementing and Maintaining Microsoft SQL Server 2008 Integration Services
Course 6234A: Implementing and Maintaining Microsoft SQL Server 2008 Integration Services Length: 3 Days Language(s): English Audience(s): IT Professionals Level: 200 Technology: Microsoft SQL Server 2008
Integrating Secure FTP into Data Services
Integrating Secure FTP into Data Services SAP Data Services includes decently-robust native support for FTP transport, as long as you don t mind it being non-secured. However, understandably, many applications
BUSINESS RULES CONCEPTS... 2 BUSINESS RULE ENGINE ARCHITECTURE... 4. By using the RETE Algorithm... 5. Benefits of RETE Algorithm...
1 Table of Contents BUSINESS RULES CONCEPTS... 2 BUSINESS RULES... 2 RULE INFERENCE CONCEPT... 2 BASIC BUSINESS RULES CONCEPT... 3 BUSINESS RULE ENGINE ARCHITECTURE... 4 BUSINESS RULE ENGINE ARCHITECTURE...
Oracle Business Rules: Technical Overview. An Oracle White Paper February 2007
Oracle Business Rules: Technical Overview An Oracle White Paper February 2007 Oracle Business Rules: Technical Overview INTRODUCTION Changing markets, increasing competitive pressures and evolving customer
Lecture 9. Semantic Analysis Scoping and Symbol Table
Lecture 9. Semantic Analysis Scoping and Symbol Table Wei Le 2015.10 Outline Semantic analysis Scoping The Role of Symbol Table Implementing a Symbol Table Semantic Analysis Parser builds abstract syntax
Sofware Requirements Engineeing
Sofware Requirements Engineeing Three main tasks in RE: 1 Elicit find out what the customers really want. Identify stakeholders, their goals and viewpoints. 2 Document write it down (). Understandable
Integrating VoltDB with Hadoop
The NewSQL database you ll never outgrow Integrating with Hadoop Hadoop is an open source framework for managing and manipulating massive volumes of data. is an database for handling high velocity data.
Backing Up and Restoring Data
Backing Up and Restoring Data Cisco Unity Express backup and restore functions use an FTP server to store and retrieve data. The backup function copies the files from the Cisco Unity Express application
Duration Vendor Audience 5 Days Oracle End Users, Developers, Technical Consultants and Support Staff
D80198GC10 Oracle Database 12c SQL and Fundamentals Summary Duration Vendor Audience 5 Days Oracle End Users, Developers, Technical Consultants and Support Staff Level Professional Delivery Method Instructor-led
SAS 9.4 Intelligence Platform: Migration Guide, Second Edition
SAS 9.4 Intelligence Platform: Migration Guide, Second Edition SAS Documentation The correct bibliographic citation for this manual is as follows: SAS Institute Inc. 2015. SAS 9.4 Intelligence Platform:
Lab 1: Introduction to C, ASCII ART and the Linux Command Line Environment
.i.-' `-. i..' `/ \' _`.,-../ o o \.' ` ( / \ ) \\\ (_.'.'"`.`._) /// \\`._(..: :..)_.'// \`. \.:-:. /.'/ `-i-->..
C++ INTERVIEW QUESTIONS
C++ INTERVIEW QUESTIONS http://www.tutorialspoint.com/cplusplus/cpp_interview_questions.htm Copyright tutorialspoint.com Dear readers, these C++ Interview Questions have been designed specially to get
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.035, Fall 2005 Handout 7 Scanner Parser Project Wednesday, September 7 DUE: Wednesday, September 21 This
CS10110 Introduction to personal computer equipment
CS10110 Introduction to personal computer equipment PRACTICAL 4 : Process, Task and Application Management In this practical you will: Use Unix shell commands to find out about the processes the operating
Rational Rational ClearQuest
Rational Rational ClearQuest Version 7.0 Windows Using Project Tracker GI11-6377-00 Rational Rational ClearQuest Version 7.0 Windows Using Project Tracker GI11-6377-00 Before using this information, be
Using the JESS Expert system tool to implement an Online Intrusion Detection System based on Snort Rules
Using the JESS Expert system tool to implement an Online Intrusion Detection System based on Snort Rules GRADUATE PROJECT TECHNICAL REPORT Submitted to the Faculty of the Department of Computing Sciences
File by OCR Manual. Updated December 9, 2008
File by OCR Manual Updated December 9, 2008 edocfile, Inc. 2709 Willow Oaks Drive Valrico, FL 33594 Phone 813-413-5599 Email [email protected] www.edocfile.com File by OCR Please note: This program is
Regular Expressions. Abstract
Regular Expressions Sanjiv K. Bhatia Department of Mathematics & Computer Science University of Missouri St. Louis St. Louis, MO 63121 email: [email protected] Abstract Regular expressions provide a powerful
UFTP AUTHENTICATION SERVICE
UFTP Authentication Service UFTP AUTHENTICATION SERVICE UNICORE Team Document Version: 1.1.0 Component Version: 1.1.1 Date: 17 11 2014 UFTP Authentication Service Contents 1 Installation 1 1.1 Prerequisites....................................
Translating to Java. Translation. Input. Many Level Translations. read, get, input, ask, request. Requirements Design Algorithm Java Machine Language
Translation Translating to Java Introduction to Computer Programming The job of a programmer is to translate a problem description into a computer language. You need to be able to convert a problem description
Chapter 7 Configuring Trunk Groups and Dynamic Link Aggregation
Chapter 7 Configuring Trunk Groups and Dynamic Link Aggregation This chapter describes how to configure trunk groups and 802.3ad link aggregation. Trunk groups are manually-configured aggregate links containing
Simply Accounting Intelligence Tips and Tricks Booklet Vol. 1
Simply Accounting Intelligence Tips and Tricks Booklet Vol. 1 1 Contents Accessing the SAI reports... 3 Running, Copying and Pasting reports... 4 Creating and linking a report... 5 Auto e-mailing reports...
Invitation to Ezhil : A Tamil Programming Language for Early Computer-Science Education 07/10/13
Invitation to Ezhil: A Tamil Programming Language for Early Computer-Science Education Abstract: Muthiah Annamalai, Ph.D. Boston, USA. Ezhil is a Tamil programming language with support for imperative
Introduction. Chapter 1
Chapter 1 Introduction MATLAB (Matrix laboratory) is an interactive software system for numerical computations and graphics. As the name suggests, MATLAB is especially designed for matrix computations:
ACT-R: A cognitive architecture. Terese Liadal [email protected] Seminar AI Tools Universität des Saarlandes, Wintersemester 06/07
ACT-R: A cognitive architecture Terese Liadal [email protected] Seminar AI Tools Universität des Saarlandes, Wintersemester 06/07 Dozenten: A. Ndiaye, M. Kipp, D. Heckmann, M. Feld 1 If the brain were
SAP HANA Client Installation and Update Guide
PUBLIC SAP HANA Platform SPS 12 Document Version: 1.0 2016-05-11 Content 1 Introduction....3 1.1 Supported Platforms.... 3 1.2 Software Download.... 4 2 SAP HANA Client on UNIX or Linux....7 2.1 Planning
CALL MANAGER INSTALLATION
CALL MANAGER INSTALLATION and OPERATION INSTRUCTIONS JULY 17, 2006 Page 1 TABLE OF CONTENTS INTRODUCTION Use of this manual ----------------------------------------------------------------- 2 Product Overview
Installation Manual v2.0.0
Installation Manual v2.0.0 Contents ResponseLogic Install Guide v2.0.0 (Command Prompt Install)... 3 Requirements... 4 Installation Checklist:... 4 1. Download and Unzip files.... 4 2. Confirm you have
LAB THREE STATIC ROUTING
LAB THREE STATIC ROUTING In this lab you will work with four different network topologies. The topology for Parts 1-4 is shown in Figure 3.1. These parts address router configuration on Linux PCs and a
My EA Builder 1.1 User Guide
My EA Builder 1.1 User Guide COPYRIGHT 2014. MyEABuilder.com. MetaTrader is a trademark of MetaQuotes www.metaquotes.net. Table of Contents MAIN FEATURES... 3 PC REQUIREMENTS... 3 INSTALLATION... 4 METATRADER
Data Tool Platform SQL Development Tools
Data Tool Platform SQL Development Tools ekapner Contents Setting SQL Development Preferences...5 Execution Plan View Options Preferences...5 General Preferences...5 Label Decorations Preferences...6
Data Integration through XML/XSLT. Presenter: Xin Gu
Data Integration through XML/XSLT Presenter: Xin Gu q7.jar op.xsl goalmodel.q7 goalmodel.xml q7.xsl help, hurt GUI +, -, ++, -- goalmodel.op.xml merge.xsl goalmodel.input.xml profile.xml Goal model configurator
MATLAB Programming. Problem 1: Sequential
Division of Engineering Fundamentals, Copyright 1999 by J.C. Malzahn Kampe 1 / 21 MATLAB Programming When we use the phrase computer solution, it should be understood that a computer will only follow directions;
CLC Server Command Line Tools USER MANUAL
CLC Server Command Line Tools USER MANUAL Manual for CLC Server Command Line Tools 2.5 Windows, Mac OS X and Linux September 4, 2015 This software is for research purposes only. QIAGEN Aarhus A/S Silkeborgvej
COMP 356 Programming Language Structures Notes for Chapter 4 of Concepts of Programming Languages Scanning and Parsing
COMP 356 Programming Language Structures Notes for Chapter 4 of Concepts of Programming Languages Scanning and Parsing The scanner (or lexical analyzer) of a compiler processes the source program, recognizing
Oracle Database: SQL and PL/SQL Fundamentals NEW
Oracle University Contact Us: 001-855-844-3881 & 001-800-514-06-97 Oracle Database: SQL and PL/SQL Fundamentals NEW Duration: 5 Days What you will learn This Oracle Database: SQL and PL/SQL Fundamentals
Sterling Call Center. Upgrade Guide. Release 9.2
Sterling Call Center Upgrade Guide Release 9.2 Sterling Call Center Upgrade Guide Release 9.2 Note Before using this information and the product it supports, read the information in Notices on page 39.
CatDV Pro Workgroup Serve r
Architectural Overview CatDV Pro Workgroup Server Square Box Systems Ltd May 2003 The CatDV Pro client application is a standalone desktop application, providing video logging and media cataloging capability
A Knowledge-based System for Translating FOL Formulas into NL Sentences
A Knowledge-based System for Translating FOL Formulas into NL Sentences Aikaterini Mpagouli, Ioannis Hatzilygeroudis University of Patras, School of Engineering Department of Computer Engineering & Informatics,
Connecting to the Firewall Services Module and Managing the Configuration
CHAPTER 3 Connecting to the Firewall Services Module and This chapter describes how to access the command-line interface and work with the configuration. This chapter includes the following sections: Connecting
Visual Logic Instructions and Assignments
Visual Logic Instructions and Assignments Visual Logic can be installed from the CD that accompanies our textbook. It is a nifty tool for creating program flowcharts, but that is only half of the story.
Rule based programming with Drools
Rule based programming with Drools Narendra Kumar Dipti D Patil Dr. Vijay M.Wadhai BE Computer Sc., Student, ME Computer Sc., Asst. Professor, PhD Computer Sc., Principal MITCOE, Pune, INDIA MITCOE, Pune,
Moving from CS 61A Scheme to CS 61B Java
Moving from CS 61A Scheme to CS 61B Java Introduction Java is an object-oriented language. This document describes some of the differences between object-oriented programming in Scheme (which we hope you
A basic create statement for a simple student table would look like the following.
Creating Tables A basic create statement for a simple student table would look like the following. create table Student (SID varchar(10), FirstName varchar(30), LastName varchar(30), EmailAddress varchar(30));
Automated transformations from ECA rules to Jess
Automated transformations from ECA rules to Jess NAME : N.C. Maatjes STUDENT NUMBER : S0040495 PERIOD : 4-2-2006 until 3-7-2007 DATE : 3-7-2007 SUPERVISOR : L. Ferreira Pires GRADUATION COMMITTEE : L.
Using Casio Graphics Calculators
Using Casio Graphics Calculators (Some of this document is based on papers prepared by Donald Stover in January 2004.) This document summarizes calculation and programming operations with many contemporary
ECE 451 Verilog Exercises. Sept 14, 2007. James Barnes ([email protected])
ECE 451 Verilog Exercises Sept 14, 2007 James Barnes ([email protected]) Organization These slides give a series of self-paced exercises. Read the specification of each exercise and write your
1 Introduction. 2 An Interpreter. 2.1 Handling Source Code
1 Introduction The purpose of this assignment is to write an interpreter for a small subset of the Lisp programming language. The interpreter should be able to perform simple arithmetic and comparisons
OPERATING SYSTEM SERVICES
OPERATING SYSTEM SERVICES USER INTERFACE Command line interface(cli):uses text commands and a method for entering them Batch interface(bi):commands and directives to control those commands are entered
A methodology for graphical modeling of business rules
A methodology for graphical modeling of business rules Article Accepted version D. Di Bona, G. Lo Re, G. Aiello, A. Tamburo, M. Alessi In Proceedings of the Fifth UKSim European Symposium on Computer Modeling
Access Queries (Office 2003)
Access Queries (Office 2003) Technical Support Services Office of Information Technology, West Virginia University OIT Help Desk 293-4444 x 1 oit.wvu.edu/support/training/classmat/db/ Instructor: Kathy
Simple. Control Panel. for your Linux Server. Getting Started Guide. Simple Control Panel // Linux Server
Getting Started Guide Simple Control Panel for your Linux Server Getting Started Guide Page 1 Getting Started Guide: Simple Control Panel, Linux Server Version 2.1 (02.01.10) Copyright 2010. All rights
Database Programming with PL/SQL: Learning Objectives
Database Programming with PL/SQL: Learning Objectives This course covers PL/SQL, a procedural language extension to SQL. Through an innovative project-based approach, students learn procedural logic constructs
Unix Shell Scripts. Contents. 1 Introduction. Norman Matloff. July 30, 2008. 1 Introduction 1. 2 Invoking Shell Scripts 2
Unix Shell Scripts Norman Matloff July 30, 2008 Contents 1 Introduction 1 2 Invoking Shell Scripts 2 2.1 Direct Interpretation....................................... 2 2.2 Indirect Interpretation......................................
Beginner s Matlab Tutorial
Christopher Lum [email protected] Introduction Beginner s Matlab Tutorial This document is designed to act as a tutorial for an individual who has had no prior experience with Matlab. For any questions
1) Explain the following evolutionary process models: a) The spiral model. b) The concurrent development model.
(DMSIT 21) ASSIGNMENT - 1, MAY-2014. PAPER- I : SOFTWARE ENGINEERING 1) Explain the following evolutionary process models: a) The spiral model. b) The concurrent development model. 2) What are requirements
We will learn the Python programming language. Why? Because it is easy to learn and many people write programs in Python so we can share.
LING115 Lecture Note Session #4 Python (1) 1. Introduction As we have seen in previous sessions, we can use Linux shell commands to do simple text processing. We now know, for example, how to count words.
ThinLinX TLXOS NUC / Compute Stick / RePC Installation Guide Creating the Installer (Step 1)
ThinLinX TLXOS NUC / Compute Stick / RePC Installation Guide ThinLinX has created optimized versions of ThinLinX OS (TLXOS) for either the Intel NUC, Intel Compute Stick or RePC making full use of the
Command Scripts. 13.1 Running scripts: include and commands
13 Command Scripts You will probably find that your most intensive use of AMPL s command environment occurs during the initial development of a model, when the results are unfamiliar and changes are frequent.
bbc Developing Service Providers Adobe Flash Media Rights Management Server November 2008 Version 1.5
bbc Developing Service Providers Adobe Flash Media Rights Management Server November 2008 Version 1.5 2008 Adobe Systems Incorporated. All rights reserved. Adobe Flash Media Rights Management Server 1.5
1001ICT Introduction To Programming Lecture Notes
1001ICT Introduction To Programming Lecture Notes School of Information and Communication Technology Griffith University Semester 2, 2015 1 3 A First MaSH Program In this section we will describe a very
First Java Programs. V. Paúl Pauca. CSC 111D Fall, 2015. Department of Computer Science Wake Forest University. Introduction to Computer Science
First Java Programs V. Paúl Pauca Department of Computer Science Wake Forest University CSC 111D Fall, 2015 Hello World revisited / 8/23/15 The f i r s t o b l i g a t o r y Java program @author Paul Pauca
Oracle Database: SQL and PL/SQL Fundamentals
Oracle University Contact Us: 1.800.529.0165 Oracle Database: SQL and PL/SQL Fundamentals Duration: 5 Days What you will learn This course is designed to deliver the fundamentals of SQL and PL/SQL along
Programming Languages CIS 443
Course Objectives Programming Languages CIS 443 0.1 Lexical analysis Syntax Semantics Functional programming Variable lifetime and scoping Parameter passing Object-oriented programming Continuations Exception
[Refer Slide Time: 05:10]
![[Refer Slide Time: 05:10]](/thumbs/29/13447118.jpg "[Refer Slide Time: 05:10]")
Principles of Programming Languages Prof: S. Arun Kumar Department of Computer Science and Engineering Indian Institute of Technology Delhi Lecture no 7 Lecture Title: Syntactic Classes Welcome to lecture
Pwn Plug Community Edition 1.1 Installation Guide
Copyright 2012 Rapid Focus Security, LLC, DBA Pwnie Express. Revision 5.21.2012 Pwn Plug Community Edition 1.1 Installation Guide Contents: Legal stuff Release 1.1 Features Download the installation package
Monitoring BPMN-Processes with Rules in a Distributed Environment
Monitoring BPMN-Processes with Rules in a Distributed Environment Lothar Hotz 1, Stephanie von Riegen 1, Lars Braubach 2, Alexander Pokahr 2, and Torsten Schwinghammer 3 1 HITeC e.v. c/o Fachbereich Informatik,
Successful Mailings in The Raiser s Edge
Bill Connors 2010 Bill Connors, CFRE November 18, 2008 Agenda Introduction Preparation Query Mail Export Follow-up Q&A Blackbaud s Conference for Nonprofits Charleston Bill Connors, CFRE Page #2 Introduction
Name: Class: Date: 9. The compiler ignores all comments they are there strictly for the convenience of anyone reading the program.
Name: Class: Date: Exam #1 - Prep True/False Indicate whether the statement is true or false. 1. Programming is the process of writing a computer program in a language that the computer can respond to
COMP 110 Prasun Dewan 1
COMP 110 Prasun Dewan 1 12. Conditionals Real-life algorithms seldom do the same thing each time they are executed. For instance, our plan for studying this chapter may be to read it in the park, if it
ORACLE 9I / 10G / 11G / PL/SQL COURSE CONTENT
ORACLE 9I / 10G / 11G / PL/SQL COURSE CONTENT INTRODUCTION: Course Objectives I-2 About PL/SQL I-3 PL/SQL Environment I-4 Benefits of PL/SQL I-5 Benefits of Subprograms I-10 Invoking Stored Procedures
SPROG DCC Decoder Programmer
SPROG DCC Decoder Programmer Operating Manual Firmware Version 3.4 April 2004 2004 Andrew Crosland web: http://www.sheerstock.fsnet.co.uk/dcc/sprog e-mail: [email protected] Disclaimer You build,
HP Service Manager. Software Version: 9.40 For the supported Windows and Linux operating systems. Request Management help topics for printing
HP Service Manager Software Version: 9.40 For the supported Windows and Linux operating systems Request Management help topics for printing Document Release Date: December 2014 Software Release Date: December
An Approach to Eliminate Semantic Heterogenity Using Ontologies in Enterprise Data Integeration
Proceedings of Student-Faculty Research Day, CSIS, Pace University, May 3 rd, 2013 An Approach to Eliminate Semantic Heterogenity Using Ontologies in Enterprise Data Integeration Srinivasan Shanmugam and
Handle Tool. User Manual
User Manual Corporation for National Research Initiatives Version 2 November 2015 Table of Contents 1. Start the Handle Tool... 3 2. Default Window... 3 3. Console... 5 4. Authentication... 6 5. Lookup...
What is a Loop? Pretest Loops in C++ Types of Loop Testing. Count-controlled loops. Loops can be...
What is a Loop? CSC Intermediate Programming Looping A loop is a repetition control structure It causes a single statement or a group of statements to be executed repeatedly It uses a condition to control
Audit account logon events
Audit account logon events Description This security setting determines whether to audit each instance of a user logging on to or logging off from another computer in which this computer is used to validate
WFU_DICOMtk v1.0. ANSIR Laboratory Wake Forest University School of Medicine
WFU_DICOMtk v1.0 ANSIR Laboratory Wake Forest University School of Medicine REQUIREMENTS: MATLAB6.5 or greater with the Image Processing Toolbox SPM2 or SPM5 FUNDING: R01EB004673 under the Human Brain
Lab 2: PostgreSQL Tutorial II: Command Line
Lab 2: PostgreSQL Tutorial II: Command Line In the lab 1, we learned how to use PostgreSQL through the graphic interface, pgadmin. However, PostgreSQL may not be used through a graphical interface. This
Sophos Anti-Virus for Linux user manual
Sophos Anti-Virus for Linux user manual Product version: 7 Document date: January 2011 Contents 1 About this manual...3 2 About Sophos Anti-Virus for Linux...4 3 On-access scanning...7 4 On-demand scanning...10