Orion Philosophy and Rationale. If it really is structure, what sort of structure is it? We are asserting that it is active dynamic undirected structure.

Slides:



Advertisements
Similar presentations
Creating Computer Programs lesson 27. This lesson includes the following sections: What is a Computer Program? How Programs Solve Problems Two Approaches:
Advertisements

From Words to Knowledge ORION Active Structure. ORION Active Structure Two Approaches We could separate the process of turning words into knowledge into.
Program Management Program management has similarities to the management of an ecosystem - not just the biggest fish are important.
What is an Algorithm? (And how do we analyze one?)
Knowledge Management Using Orion Making Knowledge Active.
Data Structures Hash Tables
Introduction to Operating Systems – Windows process and thread management In this lecture we will cover Threads and processes in Windows Thread priority.
Object Oriented Programming.  OOP Basic Principles  C++ Classes  September 2004  John Edgar 22.
Multiscalar processors
Knowledge Management In the Insurance Industry Making Organisational Knowledge Active.
1. By the end of this lecture you should be able … To describe in general terms how computers function To describe the fetch-execute cycle To explain.
WEL COME PRAVEEN M JIGAJINNI PGT (Computer Science) MCA, MSc[IT], MTech[IT],MPhil (Comp.Sci), PGDCA, ADCA, Dc. Sc. & Engg.
1 ES 314 Advanced Programming Lec 2 Sept 3 Goals: Complete the discussion of problem Review of C++ Object-oriented design Arrays and pointers.
Orion Overview. We build an internal model of the world, so we can predict future behaviour - we make the model out of active structure so it is interoperable.
Software Issues Derived from Dr. Fawcett’s Slides Phil Pratt-Szeliga Fall 2009.
Chapter 8: Introduction to High-Level Language Programming Invitation to Computer Science, C++ Version, Fourth Edition.
SM3121 Software Technology Mark Green School of Creative Media.
Principle of Functional Verification Chapter 1~3 Presenter : Fu-Ching Yang.
* Problem solving: active efforts to discover what must be done to achieve a goal that is not readily attainable.
CASE Tools And Their Effect On Software Quality Peter Geddis – pxg07u.
Introduction to Java Appendix A. Appendix A: Introduction to Java2 Chapter Objectives To understand the essentials of object-oriented programming in Java.
Chapter 3 Memory Management: Virtual Memory
Testing. Definition From the dictionary- the means by which the presence, quality, or genuineness of anything is determined; a means of trial. For software.
GENERAL CONCEPTS OF OOPS INTRODUCTION With rapidly changing world and highly competitive and versatile nature of industry, the operations are becoming.
Balancing Practices: Inspections, Testing, and Others JAXA scenario (formal method) Masa Katahira Japanese Space Agency.
Chapter 14: Artificial Intelligence Invitation to Computer Science, C++ Version, Third Edition.
1.eCognition Overview. 1 eCognition eCognition is a knowledge utilisation platform based on Active Knowledge Network technology eCognition covers the.
For Wednesday Read Weiss chapter 3, sections 1-5. This should be largely review. If you’re struggling with the C++ aspects, you may refer to Savitch, chapter.
Active Structure A + B = C. Logic and Numbers IF A + B = C THEN D + E = F.
1 Debugging and Testing Overview Defensive Programming The goal is to prevent failures Debugging The goal is to find cause of failures and fix it Testing.
Department of Computer Science A Static Program Analyzer to increase software reuse Ramakrishnan Venkitaraman and Gopal Gupta.
Discussion of Assignment 9 1 CSE 2312 Computer Organization and Assembly Language Programming Vassilis Athitsos University of Texas at Arlington.
The Concept Convert free text into a structure that captures objects, relations, existential, propositional and temporal logic – the whole thing, no excuses.
Goals  Correlation/dependency: The storing of correlations and dependencies  Integration: Methodology for integrating correlated risk distributions into.
The Use of Active Structure in Biotechnology. We won’t bother to tell you how hard, how complex, how dynamic, is knowledge in the field of biotechnology.
The Logical Structure of Knowledge. Two Statements Olga is pretty and Fred is a liar Something is providing a True to the AND - let’s represent that with.
Scheduling policies for real- time embedded systems.
CE Operating Systems Lecture 11 Windows – Object manager and process management.
1 Introduction to Software Engineering Lecture 1.
MD – Object Model Domain eSales Checker Presentation Régis Elling 26 th October 2005.
Operational Logistics. Useful New Abilities The abilities to: embed alternatives, contingencies switch on/off different chains dynamically extend the.
IFS310: Module 4 11/3/2015 Structured Methodology and COBOL.
Data Structures R e c u r s i o n. Recursive Thinking Recursion is a problem-solving approach that can be used to generate simple solutions to certain.
Discovering object interaction. Use case realisation The USE CASE diagram presents an outside view of the system. The functionality of the use case is.
Computational Autonomy. Broadening the Focus Computational Autonomy is seen as a way of enlarging the narrow focus of a program, which carries out one.
SOFTWARE DESIGN. INTRODUCTION There are 3 distinct types of activities in design 1.External design 2.Architectural design 3.Detailed design Architectural.
Introduction Object oriented design is a method where developers think in terms of objects instead of procedures or functions. SA/SD approach is based.
1 CSCD 326 Data Structures I Software Design. 2 The Software Life Cycle 1. Specification 2. Design 3. Risk Analysis 4. Verification 5. Coding 6. Testing.
Learners Support Publications Object Oriented Programming.
© 2006 Pearson Addison-Wesley. All rights reserved 2-1 Chapter 2 Principles of Programming & Software Engineering.
Winter 2011SEG Chapter 11 Chapter 1 (Part 1) Review from previous courses Subject 1: The Software Development Process.
Knowledge Networks or “The Rise of the Machines”.
...But is it Scientific?. To answer that question, we need to look at the operation of a sequential machine Scientific?
CSE 311 Foundations of Computing I Lecture 28 Computability: Other Undecidable Problems Autumn 2011 CSE 3111.
3/12/2013Computer Engg, IIT(BHU)1 PARALLEL COMPUTERS- 2.
Artificial Intelligence: Research and Collaborative Possibilities a presentation by: Dr. Ernest L. McDuffie, Assistant Professor Department of Computer.
From Use Cases to Implementation 1. Structural and Behavioral Aspects of Collaborations  Two aspects of Collaborations Structural – specifies the static.
ECognition Model Components. 2. eCognition Model Components1 Model Components Variables and Constants Operators and Functions Links Logical States Messages.
Tupai Business Systems Predictive Models using eCognition TM.
An operating system for a large-scale computer that is used by many people at once is a very complex system. It contains many millions of lines of instructions.
From Use Cases to Implementation 1. Mapping Requirements Directly to Design and Code  For many, if not most, of our requirements it is relatively easy.
FILES AND EXCEPTIONS Topics Introduction to File Input and Output Using Loops to Process Files Processing Records Exceptions.
Complex Numbers and Equation Solving 1. Simple Equations 2. Compound Equations 3. Systems of Equations 4. Quadratic Equations 5. Determining Quadratic.
©Ian Sommerville 2000 Software Engineering, 6th edition. Chapter 10Slide 1 Chapter 5:Architectural Design l Establishing the overall structure of a software.
Project Management This example emphasises the embedding of logic in a model.
Definition CASE tools are software systems that are intended to provide automated support for routine activities in the software process such as editing.
Vocabulary Algorithm - A precise sequence of instructions for processes that can be executed by a computer.
Design Model Like a Pyramid Component Level Design i n t e r f a c d s
Unit 6 Assignment 2 Chris Boardley.
U3L2 The Need For Algorithms
Presentation transcript:

Orion Philosophy and Rationale

If it really is structure, what sort of structure is it? We are asserting that it is active dynamic undirected structure “Knowledge Is Structure”

A Simple Structure The structure can propagate a wide range of entities through its connections, and the operators can operate on analytic or experiential information, and the structure can change itself. Visible Undirected Dynamically Extensible Controllable Existence

Logical Surface Statements are written on a logical surface a = b + c

Building Structures We can combine small logical structures into larger structures without concern for how they will later be used. The directions of information flow in the structure are dynamic IF a + b = c THEN d + e = f

Argument from Similarity Real Neurons (not artificial ones) Switching Complex messages Back connections Changing connections Storing of memories Massively parallel activity Network Operators Switching Complex messages Undirected Changing connections Storing of memories Quasi-parallel activity

But Real Neurons Are Directed How can the fluidity of knowledge be built on directed structure? Back-connections throughout the neuronal structure can hide this physical directionality operating at a lower level, just as many small tasks in a queue can hide most of the limitations of a single process

Argument from Function A mental model has to represent a fast-changing world. Its attributes are no accident. The connections in different areas may be different, but the substrate is universal. A knowledge model has to represent a changing world. Can its substrate also be universal, so there are no boundaries between different aspects?

Argument from Utility - One An algorithm/data structure has one part, the data structure, that is visible and easy to change, one part, the algorithm, that is invisible to the machine and hard to change - a stream of instructions. An active structure is all of it visible all of the time. Changing the structure changes its behaviour.

Argument from Utility - Two One algorithm/data structure does not easily merge with another - each has been built for a purpose. One active structure easily merges with another - the phasing lies in the structure, so connecting new structure changes the phasing to suit.

Argument from Visibility Procedures on a stack are invisible to everything but the stack handler. Nothing else can see what is happening and respond to it - the machine is blind to its own workings. This prevents quasi-parallelism. States being propagated in a network are always visible - anything that can be connected to a point of interest can respond to change or influence it, down to the limit of operator granularity.

Argument from Dynamism All knowledge has dynamic aspects - aspects we can’t avoid. If a paradigm can handle the most dynamic, it can handle the least dynamic or the static on its ear. A = B + C Static structure X = SUM(List) Dynamic structure The quake struck early Thursday. Ultimate dynamism

Nowhere to Start This is typical - knowledge is used everywhere - no start, no end, lots of loops - it is definitely not a DAG Attempts to enforce some predetermined structure quickly result in irrelevance

Orion Principles Destroy no inference in the transformation from text to structure Discover universal substrate by continual extension of problem space The activity is only in the structure, not outside it Invisible activity (within operators) is minimised by fine granularity Accrete the structure where simple operators are inadequate

Examples

Project Management Development projects have a life of their own. There is uncertainty in what you are doing, and whether and when you will be doing it. Critical Path Method doesn’t allow you to plan what to do, only when to do it - the activities in a knowledge model have both logical and existential control, and the design model can sit in the same model as the activities and resources, all made out of the same stuff and communicating with each other

Reinsurance Simulation Generated Commercial Property Claims A Surplus treaty Claims paid after the Surplus recoveries Household Risk Excess treaty Claims paid after the Surplus and RiskXs Combine with Household Claims after Quota Share (into Catastrophe treaty) The structure generated for Commercial Property (each column represents a policy) The structure of the reinsurance program is in the form that insurance people understand it – claims flow into a reinsurance treaty, which recovers some of the payments. What remains can be combined and flow into another treaty. The structure is easily modifiable and extensible because it is self-phasing

Combining Knowledge Domains Assemble Pieces of Knowledge Into an Active Object Which Itself Can be Assembled... Airframe Performance Avionics

Section b(ii). An occupies relation, with Tenant as a subject and portion as an object, and a logical control structure controlling 2 pay relations. Portion is part (contained in) Space, which is the local dictionary object for Swing Space. The occupy relation gets its TimePeriod from the Extended Swing Space Term – the new TimePeriod of the occupy relation. The StartDate of both pay relations is 01/09/2005. Extracting Meaning from Text

Linking In Bioinformatics The structure is used to understand the text - then the text is used to extend the structure

How Practical Is The Approach Creation of model is fast if knowledge is available Incremental growth of model topology suits typical knowledge acquisition cycle Large simulation models have similar execution times to more simplistic programmatic versions Dynamic Constraint Reasoning models have similar solving times to other more static methods

But Is It Easy In one way, creating a knowledge structure is an iron discipline - unlike a program, effects can only occur through connections - so connections must be made and states propagated - no lazy reaching out to assign a value. And yet, is there another way - how can we be sure we are in the correct state unless everything that is relevant can see and contribute to the current state.

Why Do This As applications move towards the use of knowledge, the limitations of a single point of control machine, with so little in its focus, become increasingly burdensome. Still limited to a single point, the propagation of states through network connections, the continuous visibility, the fine granularity and the self-modifiability increase the size of the apparent focus and permit us to move closer to the full use of knowledge.