Degree of Smartness Contributions from: Ville Harkke, Minna Kallio, Jonas Karlsson, Antonina Kloptchenko, Vladimir Kvassov, Pär Landor, Shuhua Liu, Ruggero.

Slides:



Advertisements
Similar presentations
Our school: typical Greek school traditional models of education in its daily instructive practice. Past few years: efforts to modernize these instructive.
Advertisements

Time Management By Zahira Gonzalez.
Acoustic Echo Cancellation for Low Cost Applications
Risk Modeling The Tropos Approach PhD Lunch Meeting 07/07/2005 Yudistira Asnar –
Perceptron Learning Rule
Guide to HUM 210 Concept Map When we learn, several levels of learning take place, sometimes at the same time. But basically, most of what happens can.
Artificial Intelligence and Lisp TDDC65 Course leader: Erik Sandewall Lab assistants: Henrik Lundberg, John Olsson Administrator: Anna Grabska Eklund Webpage:
What is a run-on sentence?
Numerical Analysis 1 EE, NCKU Tien-Hao Chang (Darby Chang)
Careers in CS & Engineering. CS & Engineering careers are not all this….
Andrew Courter Texas Tech University CS5331.  PKS Why PKS? STRIPS The Databases Inference Algorithm Extended Features  PKS Examples  Conclusion and.
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
Algorithms and Problem Solving-1 Algorithms and Problem Solving.
Lecture 2: Fundamental Concepts
1 Module 2: Fundamental Concepts Problems Programs –Programming languages.
Knowledge Acquisitioning. Definition The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
Brent Dingle Marco A. Morales Texas A&M University, Spring 2002
Algorithms and Problem Solving. Learn about problem solving skills Explore the algorithmic approach for problem solving Learn about algorithm development.
Case-based Reasoning System (CBR)
School of Computer ScienceG53FSP Formal Specification1 Dr. Rong Qu Introduction to Formal Specification
Building Knowledge-Driven DSS and Mining Data
The Elements of Gameplay by Richard Rouse III Ayşegül Bakar.
THE TRANSITION FROM ARITHMETIC TO ALGEBRA: WHAT WE KNOW AND WHAT WE DO NOT KNOW (Some ways of asking questions about this transition)‏
Introduction 01_intro.ppt
Introducing Java.
Misunderstood Minds 1.
Number Sense Standards Measurement and Geometry Statistics, Data Analysis and Probability CST Math 6 Released Questions Algebra and Functions 0 Questions.
Business Analysis and Essential Competencies
 Knowledge Acquisition  Machine Learning. The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
11 C H A P T E R Artificial Intelligence and Expert Systems.
ROBOTICS VOCAB AND FLOWCHARTING. ROBOTICS VOCABULARY Robot- a machine capable of carrying out a complex series of actions automatically, especially one.
STOP DOING MATH LONG ENOUGH TO LEARN IT How to Study Math –Short Version Delano P. Wegener, Ph.D. Spring 2005.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
CLICK THIS BUTTON FOR THE ANSWER  THIS PRESENTATION PREPARED BY MALTEPE GIRL TECHINCAL AND VOCATIONAL HIGH SCHOOL IT DEPT.
Fundamentals of Information Systems, Third Edition2 Principles and Learning Objectives Artificial intelligence systems form a broad and diverse set of.
Prioritizing and Goal Setting for Academic Success.
CMPF144 FUNDAMENTALS OF COMPUTING THEORY Module 2: Abilities of Computers.
IS2210: Systems Analysis, Systems Design and Change Twitter:
Applications in Acquisition Decision-Making Process.
The System and Software Development Process Instructor: Dr. Hany H. Ammar Dept. of Computer Science and Electrical Engineering, WVU.
University of Windsor School of Computer Science Topics in Artificial Intelligence Fall 2008 Sept 11, 2008.
Transfer Like a Champ! By Michelle Brazeal. Transfer Training Why do we teach?
Motion in still photography There are two primary ways of recording motion or suggesting motion in still photography. 1.Use a shutter speed slow enough.
Neural Network Implementation of Poker AI
Generic Tasks by Ihab M. Amer Graduate Student Computer Science Dept. AUC, Cairo, Egypt.
Chapter 4 Decision Support System & Artificial Intelligence.
Instructional Objective  Define an agent  Define an Intelligent agent  Define a Rational agent  Discuss different types of environment  Explain classes.
Computer Science, Algorithms, Abstractions, & Information CSC 2001.
A Puzzle for You. Puzzle Someone is working for you for 7 days You have a gold bar, which is segmented into 7 pieces, but they are all CONNECTED You have.
International Conference on Fuzzy Systems and Knowledge Discovery, p.p ,July 2011.
Definition Essay WIT Comp 2. Definition A definition essay is an essay that defines a word, term, or concept. In this essay you should not define a term.
Finite State Machines (FSM) OR Finite State Automation (FSA) - are models of the behaviors of a system or a complex object, with a limited number of defined.
Algorithms CS280 – 10/20/05. Announcement  Part 1 of project 2 due.  Read chapters 10, 7 for this unit  Tuesday we will also be in the classroom We.
CSCI N201 Programming Concepts and Database 2 - STAIR Lingma Acheson Department of Computer and Information Science, IUPUI.
#1 Make sense of problems and persevere in solving them How would you describe the problem in your own words? How would you describe what you are trying.
 Knowledge Acquisition  Machine Learning. The transfer and transformation of potential problem solving expertise from some knowledge source to a program.
DSMA 0393/1414 Comments of Students. Co-requisite Model Student Comments Students were given this request on their final examination: Write a statement.
Mental Ability Tests Dr. K. Mangayarkarasi Dept of Career Guidance & Extension, Bhrathiar University Coimabatore.
Done by Fazlun Satya Saradhi. INTRODUCTION The main concept is to use different types of agent models which would help create a better dynamic and adaptive.
Mathematical Practice Standards
Algorithms and Problem Solving
Mathematical Competencies A Framework for Mathematics Curricula in Engineering Education SEFI MWG Steering committee Burkhard ALPERS, Marie DEMLOVÁ,
New Key Stage 3 Assessment
MULTIPLE INTELLIGENCES
Unit# 9: Computer Program Development
Introduction Artificial Intelligent.
Algorithms.
Algorithms and Problem Solving
Psychology Chapter 9:Inelligence Section 1: What is Intelligence
Effective Leadership Skills
Presentation transcript:

Degree of Smartness Contributions from: Ville Harkke, Minna Kallio, Jonas Karlsson, Antonina Kloptchenko, Vladimir Kvassov, Pär Landor, Shuhua Liu, Ruggero Rossi de Mio, Haiyi Zhang

Degree of Smartness Smartness in general and its meaning to IT Smartness Qualities/Capabilities Degree of Smartness: the five levels

What is Smartness? The Oxford English Dictionary Sharp discipline; Severity (of something); strict or sterness; Vivacity (quickness and liveliness) and wit in conversation or writing; Trimness or fashionableness in dress, etc. Briskness, activity, alertness. Neatness of dress and person combined with brisk orderly bearing. Extreme cleverness or shrewdness, esp. for one's own advantage.

Smartness of IT/IS: Qualities (1) Knows about itself: what it can do and what it can not do. Can sense what is happening Can react fast enough and properly Can accomplish the same task with less resources or achieve specified goal with the least effort Can understand people & even know them well Easy to use

Smartness of IT/IS: Qualities (2) Can take inititives instead of just following orders Runs and functions smoothly, without problems and utilising the easiest way to solve a problem. Can determine the right actions to solve rising problems and questions Can deal with unspecific situations (unknown situations?)

Smartness of IT/IS: Capabilities Logical reasoning: yes General knowledge: yes Memory: yes Ability to recognize analogies: yes Ability to see relations among concepts: yes Ability to identify exceptions: yes Intuition: impossible Visual apprehension: not basic Math skills: not smartness? Computational speed: smartness/not smartness? Ability to think: impossible?

Degree of Smarness: the Different Levels Not Smart / Dumb / Dull Kind of Smart / So-So Smart / Slightly Smart Smart Very Smart Outstandingly Smart / Really Smart Highest Level of Smart

Not Smart / Dull / Dumb Systems is able to process data but can not solve the problems for those it was designed or build inability to achieve the specified goal no matter how much efforts is made

Slightly Smart / So-So Smart / Kind of Smart / Not Very Smart / The most basic level of smartness - must have capabilities: have enough knowledge know the rules to handle it correctly able to solve the problems it was designed for by choosing the algorithms implemented in it can achieve specified goal but with great effort, certain difficulties and risk of failure can consolidate input data in to a form that can be used.(by a system or whatever)

Smart The Second Level - must have capabilities: can achieve specified goal with the least effort independence (autonomous) can operate with imprecise or incomplete data can recognize patterns in data. can find hiddent pattern of input

Very Smart Third Level - must have capabilities: can identify the relevant algorithm and data to solve the particular real-world problems, by the means of the algorithms that were particularly assigned to the presented types of problems. can find hiddent pattern of input can define the right goal and to achieve it with the least effort can recognize patterns that are similar in non- predetermined ways.

Outstandingly Smart / Really Smart Fourth Level - must have capabilities: can create the new algorithm and notice new pattern in the data, that were not observed earlier, so that they can be used into solving the next problems. can comment on the difference between the presented problem and the reference problems the system has an algorithms for. can suggest models or solutions to imprecisely defined situations, and to compare the models with each other.

Highest Level of Smart Can recognize complex concepts based on various types of data, including the application's own ability to solve the problem at hand. Able to point out what is missing from the data or the application's abilities (and to try and find the needed components - requires a vast knowledge base of what does exist

Degree of Smartness: Formal Definitions Given a domain D and a set S = {1, 2, 3, 4,5}. A function f : D  S For every x  D, f (x) = 1 if 0   0.2 f (x) = 2 if 0.2   0.4 f (x) = 3 if 0.4   0.6 f (x) = 4 if 0.6   0.8 f (x) = 5 if 0.8   1. 0 Here, 1 stands for most basic level of smartness (Dumb) 2 stands for medium smart 3 stands for somewhat smart 4 stands for smart 5 stands for the highest level of smartness

More on Smartness Tarja Meristö and CoFi group similar discussion next week