Preference and Similaritybased Behavioral Discovery of Services
|
|
- Gyles Henderson
- 8 years ago
- Views:
Transcription
1 Preference and Similaritybased Behavioral Discovery of Services Farhad Arbab 1 and Francesco Santini 1,2 1 Centrum Wiskunde & Informatica, Amsterdam, Netherlands 2 Dipartimento di Matematica e Informatica, University of Perugia, Italy
2 Intro and Motivations è We focus on the discovery process of Web Services (WSs) " Satisfactory alternatives for the user " Over-constrained queries è A formal tool to model queries " Constraint Automata (CA) to represent the desired behavior " Soft Constraints to represent user s preferences è Classical CA operators to reason on queries è Practical advantages " Expressivity of (soft) constraints " A parametric computational framework where to solve the problem " Techniques from AI to tackle the complexity
3 In a glimpse Soft constraints Soft constraint automata constraints Constraint automata preferences automata services A preference/similarity-based behavioral query language for services
4 Outline è Semirings è Semiring-based Soft Constraints è Soft Constraint Automata (SCA) è SCA as preference-based queries è SCA as similarity-based queries è SCA operators (Join/Hide) è A sketch of an implementation è Future Work / Conclusion
5 C-semirings (for preferences) è A c-semiring is a tuple " A is the (possibly infinite) set of preference values " 0 and 1 represent the bottom and top preference values " + defines a partial order ( S ) over A such that a S b iff a+b = a " + is commutative, associative, and idempotent, it is closed, 0 is its unit element and 1 is its absorbing element " closed, associative, commutative, and distributes over +, 1 is its unit element and 0 is its absorbing element ha, apple S i " is a complete lattice ha, +,, 0, 1i to compose the preferences and + to find the best one
6 Classical instantiations è Weighted è Fuzzy è Probabilistic è Boolean hr + [{+1}, min, ˆ+, 1, 0i h[0..1], max, min, 0, 1i h[0..1], max, ˆ, 0, 1i h{false, true}, _, ^, false, truei è Boolean semirings can be used to represent classical crisp problems è The Cartesian product is still a semiring h[0..1], R + [{+1}i, hmax, mini, hmin, ˆ i, h0, +1i, h1, 0ii
7 Soft Constraints è A constraint where each instantiation of its variables has an associated preference " Assignment : V! D C :! A " Constraint è Example of a binary soft constraint è Sum: (c 1 c 2 ) = c 1 + c 2 è Combination: (c 1 c 2 ) = c 1 c 2 è Projection: è Entailment: c x,y : V! D! A c + (V\{v}) c 0 = P d2d c [v := d] c 1 v S c 2 () c 1 apple S c 2 ( )
8 Examples c 1 :({x}!n)! R + s.t. c(x) = 2x + 8 c 2 :({x}!n)! R + s.t. c(x) = x + 5 c 3 :({x}!n)! R + s.t. c(x) = x + 3 c 4 :({x, y}!n)! R + s.t. c(x, y) = x + y + 5 c 2 c 3 = c 1 c 4 + {x} = c 2 c 1 v c 2 v c 3
9 Example of a SCSP <a,a> 11 <a,b> 7 <b,a> 16 <b,b> 16 The best level of consistency is 7
10 Soft Constraint Automata
11 Timed Weighted Data Streams è They represent the languages recognized by our SCA " Data stream λ " Time stream l " Preference stream a ha, +,, 0, 1i h, l, ai 2Data! R! + A! such that, 8k 0:l(k) < l(k + 1) and lim k!+1 l(k) =+1 A is a I/O port name {A} c yes/no preference! q o q 1
12 Simple Reo Circuit Writer A B Reader = 1-FIFO channel {A} c 1 q o s q 1 {B} c 2
13 Soft Data Constraints è Soft constraints used by SCA (labels of the transitions) c {dn n2n} = 0 1 c 1 c 2 c 1 c 2 c è d n are the variables corresponding to names in N è A soft constraint is a function defined as c :({d n n 2 N}!Data)! A
14 Soft Constraint Automata Query: i) States represent the states of our stateful service, ii) Transitions represent the operations that can be invoked on the service iii) Names are operation names, data elements are operation parameters
15 Preference-based query (Ex.) DB
16 A more complex example
17 Similarity-based query Variables now represent operations names!
18 Join and Hide Join T 1 S./ T 2 S = (Q 1 Q 2, N 1 [N 2,!, Q 0,1 Q 0,2, S) q 1 N 1,c 1! 1 p 1, q 2 N 2,c 2! 2 p 2, N 1 \N 2 = N 2 \N 1 hq 1, q 2 i N 1[N 2,c 1 c 2! hp1, p 2 i q 1 N,c! 1 p 1, N \N 2 = ; hq 1, q 2 i N,c! h p 1, q 2 i Hide 9O[T S ] = (Q, N\O,! O, Q 0,O, S) q p, p N,c! r, N 0 = N\O, ;, c 0 = c + {dn n2n 0 } q N0,c 0! O r
19 Practical applications
20 Implementation Automaton-structure constraints: q a N l! qb q a, q b 2Q DB c xi,y i (x i = q a, y i = q b ) = 1, and 0 otherwise Name preference constraints: q a N l! qb 2 DB c xi,y i,z i (x i = q a, y i = q b, z i = N l ) = a Ex. c x1,y 1,z 1 (x 1 = q a, y 1 = q b, z 1 = {Login}) = 0.8
21 Solving the SCSP DB = {T 1, T 2,...,T h } Q 1 [Q 2 [ [Q h = Q DB P = hs, V, D, Ci [ V = {x i, y i, z i }
22 Conclusion and FW è An evolution of classical Constraint Automata " Returning a preference value for the data used in the service operations " Returning a similarity value for the service operation-names (I/O) è A natural application of it as a " Preference/similarity based, " and behavioral query language for services è An implementation with standard (soft) solvers è A full implementation of the framework (on the way) è Further study on Simulation/Bisimulation, Join/Hide
23 Thank you for your time! Contacts:
Parametric Attack Graph Construction and Analysis
Parametric Attack Graph Construction and Analysis Leanid Krautsevich Department of Computer Science, University of Pisa Largo Bruno Pontecorvo 3, Pisa 56127, Italy Istituto di Informatica e Telematica,
More informationSummary. Operations on Fuzzy Sets. Zadeh s Definitions. Zadeh s Operations T-Norms S-Norms. Properties of Fuzzy Sets Fuzzy Measures
Summary Operations on Fuzzy Sets Zadeh s Operations T-Norms S-Norms Adriano Cruz 00 NCE e IM/UFRJ adriano@nce.ufrj.br Properties of Fuzzy Sets Fuzzy Measures One should not increase, beyond what is necessary,
More informationModelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming
QAPL 2007 Modelling Multicast QoS Routing by using Best-Tree Search in And-or Graphs and Soft Constraint Logic Programming 1,2,3 Stefano Bistarelli Department of Sciences University G. d Annunzio of Chieti-Pescara
More informationHow To Solve Factoring Problems
05-W4801-AM1.qxd 8/19/08 8:45 PM Page 241 Factoring, Solving Equations, and Problem Solving 5 5.1 Factoring by Using the Distributive Property 5.2 Factoring the Difference of Two Squares 5.3 Factoring
More informationTowards a Tight Finite Key Analysis for BB84
The Uncertainty Relation for Smooth Entropies joint work with Charles Ci Wen Lim, Nicolas Gisin and Renato Renner Institute for Theoretical Physics, ETH Zurich Group of Applied Physics, University of Geneva
More informationSatisfiability Checking
Satisfiability Checking SAT-Solving Prof. Dr. Erika Ábrahám Theory of Hybrid Systems Informatik 2 WS 10/11 Prof. Dr. Erika Ábrahám - Satisfiability Checking 1 / 40 A basic SAT algorithm Assume the CNF
More informationMARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore
MARTINGALES AND GAMBLING Louis H. Y. Chen Department of Mathematics National University of Singapore 1. Introduction The word martingale refers to a strap fastened belween the girth and the noseband of
More informationObservability and Controllability Issues in Conformance Testing of Web Service Compositions
Observability and Controllability Issues in Conformance Testing of Web Service Compositions Jose Pablo Escobedo 1, Christophe Gaston 2, Pascale Le Gall 3 and Ana Cavalli 1 1 TELECOM & Management SudParis
More informationDynamic workflow. Adam Belloum Systems and Networking Engineering research group Institute of Informatics University of Amsterdam
Dynamic workflow Adam Belloum Systems and Networking Engineering research group Institute of Informatics University of Amsterdam Outline Definition of workflows (Business, Scientific, Dynamic) Make the
More informationUsing the ac Method to Factor
4.6 Using the ac Method to Factor 4.6 OBJECTIVES 1. Use the ac test to determine factorability 2. Use the results of the ac test 3. Completely factor a trinomial In Sections 4.2 and 4.3 we used the trial-and-error
More informationDynamic Process/Service Composition/Combination
INFINT 2009 - Bertinoro Workshop on Data and Service Integration Bertinoro, March 15-20, 2009 Dynamic Process/Service Composition/Combination Ugo Montanari Dipartimento di Informatica Università di Pisa
More informationMatrix Algebra. Some Basic Matrix Laws. Before reading the text or the following notes glance at the following list of basic matrix algebra laws.
Matrix Algebra A. Doerr Before reading the text or the following notes glance at the following list of basic matrix algebra laws. Some Basic Matrix Laws Assume the orders of the matrices are such that
More informationDecember 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B. KITCHENS
December 4, 2013 MATH 171 BASIC LINEAR ALGEBRA B KITCHENS The equation 1 Lines in two-dimensional space (1) 2x y = 3 describes a line in two-dimensional space The coefficients of x and y in the equation
More informationMathematics Review for MS Finance Students
Mathematics Review for MS Finance Students Anthony M. Marino Department of Finance and Business Economics Marshall School of Business Lecture 1: Introductory Material Sets The Real Number System Functions,
More informationCS91.543 MidTerm Exam 4/1/2004 Name: KEY. Page Max Score 1 18 2 11 3 30 4 15 5 45 6 20 Total 139
CS91.543 MidTerm Exam 4/1/2004 Name: KEY Page Max Score 1 18 2 11 3 30 4 15 5 45 6 20 Total 139 % INTRODUCTION, AI HISTORY AND AGENTS 1. [4 pts. ea.] Briefly describe the following important AI programs.
More informationThe Degrees of Freedom of Compute-and-Forward
The Degrees of Freedom of Compute-and-Forward Urs Niesen Jointly with Phil Whiting Bell Labs, Alcatel-Lucent Problem Setting m 1 Encoder m 2 Encoder K transmitters, messages m 1,...,m K, power constraint
More informationThe confidence-probability semiring Günther J. Wirsching Markus Huber Christian Kölbl
UNIVERSITÄT AUGSBURG The confidence-probability semiring Günther J. Wirsching Markus Huber Christian Kölbl Report 2010-04 April 2010 INSTITUT FÜR INFORMATIK D-86135 AUGSBURG 2 Copyright c Günther J. Wirsching,
More information3. The Junction Tree Algorithms
A Short Course on Graphical Models 3. The Junction Tree Algorithms Mark Paskin mark@paskin.org 1 Review: conditional independence Two random variables X and Y are independent (written X Y ) iff p X ( )
More informationCloud and Big Data Summer School, Stockholm, Aug., 2015 Jeffrey D. Ullman
Cloud and Big Data Summer School, Stockholm, Aug., 2015 Jeffrey D. Ullman To motivate the Bloom-filter idea, consider a web crawler. It keeps, centrally, a list of all the URL s it has found so far. It
More information6 Commutators and the derived series. [x,y] = xyx 1 y 1.
6 Commutators and the derived series Definition. Let G be a group, and let x,y G. The commutator of x and y is [x,y] = xyx 1 y 1. Note that [x,y] = e if and only if xy = yx (since x 1 y 1 = (yx) 1 ). Proposition
More information1 Introduction to Matrices
1 Introduction to Matrices In this section, important definitions and results from matrix algebra that are useful in regression analysis are introduced. While all statements below regarding the columns
More informationRelational Databases
Relational Databases Jan Chomicki University at Buffalo Jan Chomicki () Relational databases 1 / 18 Relational data model Domain domain: predefined set of atomic values: integers, strings,... every attribute
More informationSolving WCSP by Extraction of Minimal Unsatisfiable Cores
Solving WCSP by Extraction of Minimal Unsatisfiable Cores Christophe Lecoutre Nicolas Paris Olivier Roussel Sébastien Tabary CRIL - CNRS, UMR 8188 Université Lille-Nord de France, Artois rue de l université,
More informationOn the Algebraic Structures of Soft Sets in Logic
Applied Mathematical Sciences, Vol. 8, 2014, no. 38, 1873-1881 HIKARI Ltd, www.m-hikari.com http://dx.doi.org/10.12988/ams.2014.43127 On the Algebraic Structures of Soft Sets in Logic Burak Kurt Department
More informationEquilibrium computation: Part 1
Equilibrium computation: Part 1 Nicola Gatti 1 Troels Bjerre Sorensen 2 1 Politecnico di Milano, Italy 2 Duke University, USA Nicola Gatti and Troels Bjerre Sørensen ( Politecnico di Milano, Italy, Equilibrium
More informationInformatique Fondamentale IMA S8
Informatique Fondamentale IMA S8 Cours 1 - Intro + schedule + finite state machines Laure Gonnord http://laure.gonnord.org/pro/teaching/ Laure.Gonnord@polytech-lille.fr Université Lille 1 - Polytech Lille
More informationSo let us begin our quest to find the holy grail of real analysis.
1 Section 5.2 The Complete Ordered Field: Purpose of Section We present an axiomatic description of the real numbers as a complete ordered field. The axioms which describe the arithmetic of the real numbers
More informationTELEIOS FP7-257662. Deliverable D10.2. TELEIOS Web Site. Kostis Kyzirakos, Michael Sioutis, Stavros Vassos, Manolis Koubarakis.
TELEIOS FP7-257662 Deliverable D10.2 TELEIOS Web Site Kostis Kyzirakos, Michael Sioutis, Stavros Vassos, Manolis Koubarakis and Consortium Partners 30/11/2010 Status: final Scheduled Delivery Date: 30/11/2010
More informationCSE140: Midterm 1 Solution and Rubric
CSE140: Midterm 1 Solution and Rubric April 23, 2014 1 Short Answers 1.1 True or (6pts) 1. A maxterm must include all input variables (1pt) True 2. A canonical product of sums is a product of minterms
More information6.3 FACTORING ax 2 bx c WITH a 1
290 (6 14) Chapter 6 Factoring e) What is the approximate maximum revenue? f) Use the accompanying graph to estimate the price at which the revenue is zero. y Revenue (thousands of dollars) 300 200 100
More informationBoolean Algebra Part 1
Boolean Algebra Part 1 Page 1 Boolean Algebra Objectives Understand Basic Boolean Algebra Relate Boolean Algebra to Logic Networks Prove Laws using Truth Tables Understand and Use First Basic Theorems
More informationTowards Visualising Security with Arguments
ICTCS 2015 Towards Visualising Security with Arguments Stefano Bistarelli, Fabio Rossi, Francesco Santini, Carlo Taticchi Dipartimento di Matematica e Informatica Università di Perugia, Italy E-mail: firstname.lastname@dmi.unipg.it
More informationFUNDAMENTALS OF ENGINEERING (FE) EXAMINATION REVIEW
FE: Electric Circuits C.A. Gross EE1-1 FUNDAMENTALS OF ENGINEERING (FE) EXAMINATION REIEW ELECTRICAL ENGINEERING Charles A. Gross, Professor Emeritus Electrical and Comp Engineering Auburn University Broun
More informationKLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning
KLMLean 2.0: A Theorem Prover for KLM Logics of Nonmonotonic Reasoning Laura Giordano 1, Valentina Gliozzi 2, and Gian Luca Pozzato 2 1 Dipartimento di Informatica - Università del Piemonte Orientale A.
More informationLights and Darks of the Star-Free Star
Lights and Darks of the Star-Free Star Edward Ochmański & Krystyna Stawikowska Nicolaus Copernicus University, Toruń, Poland Introduction: star may destroy recognizability In (finitely generated) trace
More informationA Workbench for Prototyping XML Data Exchange (extended abstract)
A Workbench for Prototyping XML Data Exchange (extended abstract) Renzo Orsini and Augusto Celentano Università Ca Foscari di Venezia, Dipartimento di Informatica via Torino 155, 30172 Mestre (VE), Italy
More informationSSL Enablement of the DB2 Web Query for System i Server
SSL Enablement of the DB2 Web Query for System i Server By default the DB2 Web Query server listens on a non-secure port of 12331. In order to change the server to make the 12331 port SSL enabled, the
More informationAutomating Software Development Process Using Fuzzy Logic
Automating Software Development Process Using Fuzzy Logic Francesco Marcelloni 1 and Mehmet Aksit 2 1 Dipartimento di Ingegneria dell Informazione, University of Pisa, Via Diotisalvi, 2-56122, Pisa, Italy,
More informationApplication Note RMF Magic 5.1.0: EMC Array Group and EMC SRDF/A Reporting. July 2009
Application Note RMF Magic 5.1.0: EMC Array Group and EMC SRDF/A Reporting July 2009 Summary: This Application Note describes the new functionality in RMF Magic 5.1 that enables more effective monitoring
More informationRigorous Software Development CSCI-GA 3033-009
Rigorous Software Development CSCI-GA 3033-009 Instructor: Thomas Wies Spring 2013 Lecture 11 Semantics of Programming Languages Denotational Semantics Meaning of a program is defined as the mathematical
More informationDiagnosis of Large Software Systems Based on Colored Petri Nets
Diagnosis of Large Software Systems Based on Colored Petri Nets Supervised by Tarek Melliti 2 and Philippe Dague 1 Yingmin Li 1 1 LRI IASI, Univ. Paris-Sud, CNRS/INRIA Saclay, France 2 IBISC, Univ. d Evry
More informationTowards an Automated Deployment Planner for Composition of Web Services as Software Components
FACS 05 Preliminary Version Towards an Automated Deployment Planner for Composition of Web Services as Software Components Abbas Heydarnoori 1 School of Computer Science University of Waterloo, Canada
More informationHow to Implement Transport Layer Security in PowerCenter Web Services
How to Implement Transport Layer Security in PowerCenter Web Services 2008 Informatica Corporation Table of Contents Introduction... 2 Security in PowerCenter Web Services... 3 Step 1. Create the Keystore
More informationBorne inférieure de circuit : une application des expanders
Borne inférieure de circuit : une application des expanders Simone Bova 1 Florent Capelli 2 Friedrich Slivovski 1 Stefan Mengel 3 1 TU Wien, 2 IMJ-PRG, Paris 7, 3 CRIL, Lens 6 Novembre 2015 JGA 2015 Motivation
More informationLine and Polygon Clipping. Foley & Van Dam, Chapter 3
Line and Polygon Clipping Foley & Van Dam, Chapter 3 Topics Viewing Transformation Pipeline in 2D Line and polygon clipping Brute force analytic solution Cohen-Sutherland Line Clipping Algorithm Cyrus-Beck
More information1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.
File: chap04, Chapter 04 1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1. 2. True or False? A gate is a device that accepts a single input signal and produces one
More informationAlgebraic Recognizability of Languages
of Languages LaBRI, Université Bordeaux-1 and CNRS MFCS Conference, Prague, August 2004 The general problem Problem: to specify and analyse infinite sets by finite means The general problem Problem: to
More information15-381: Artificial Intelligence. Probabilistic Reasoning and Inference
5-38: Artificial Intelligence robabilistic Reasoning and Inference Advantages of probabilistic reasoning Appropriate for complex, uncertain, environments - Will it rain tomorrow? Applies naturally to many
More informationSemantic Description of Distributed Business Processes
Semantic Description of Distributed Business Processes Authors: S. Agarwal, S. Rudolph, A. Abecker Presenter: Veli Bicer FZI Forschungszentrum Informatik, Karlsruhe Outline Motivation Formalism for Modeling
More informationApplication Note 83 Fundamentals of RS 232 Serial Communications
Application Note 83 Fundamentals of Serial Communications Due to it s relative simplicity and low hardware overhead (as compared to parallel interfacing), serial communications is used extensively within
More informationOmega Automata: Minimization and Learning 1
Omega Automata: Minimization and Learning 1 Oded Maler CNRS - VERIMAG Grenoble, France 2007 1 Joint work with A. Pnueli, late 80s Summary Machine learning in general and of formal languages in particular
More informationUsing Microsoft Active Directory for Checkpoint NG AI SecureClient
Using Microsoft Active Directory for Checkpoint NG AI SecureClient Dave Crowfoot www.works4me.com dave@works4me.com This is the solution that I came up with to utilize MS Active directory to authenticate
More informationCalculation of Valu-Trac Statuses
Calculation of Intrinsic Value Yield Latest Cash Earnings (Net Income + Depreciation and Amortization) (put aside) Dividend (subtract) Provision for Depreciation (Net Assets x Inflation Rate) (subtract)
More informationUncertainty evaluations in EMC measurements
Uncertainty evaluations in EMC measurements Carlo Carobbi Dipartimento di Elettronica e Telecomunicazioni Università degli Studi di Firenze Istituto di Fisica Applicata "Nello Carrara" - 3 Luglio 2009
More informationFabio Patrizi DIS Sapienza - University of Rome
Fabio Patrizi DIS Sapienza - University of Rome Overview Introduction to Services The Composition Problem Two frameworks for composition: Non data-aware services Data-aware services Conclusion & Research
More informationPattern Co. Monkey Trouble Wall Quilt. Size: 48" x 58"
.............................................................................................................................................. Pattern Co..........................................................................................
More informationSome Special Artex Spaces Over Bi-monoids
Some Special Artex Spaces Over Bi-monoids K.Muthukumaran (corresponding auther) Assistant Professor PG and Research Department Of Mathematics, Saraswathi Narayanan College, Perungudi Madurai-625022,Tamil
More informationINF5140: Specification and Verification of Parallel Systems
INF5140: Specification and Verification of Parallel Systems Lecture 7 LTL into Automata and Introduction to Promela Gerardo Schneider Department of Informatics University of Oslo INF5140, Spring 2007 Gerardo
More informationInteractive Timetabling
Interactive Timetabling Tomáš Müller, Roman Barták * Charles University Department of Theoretical Computer Science Malostranské náměstí 2/25, Praha 1, Czech Republic tomas.muller@st.mff.cuni.cz bartak@kti.mff.cuni.cz
More informationFrom Factorial Designs to Hilbert Schemes
From Factorial Designs to Hilbert Schemes Lorenzo Robbiano Università di Genova Dipartimento di Matematica Lorenzo Robbiano (Università di Genova) Factorial Designs and Hilbert Schemes Genova, June 2015
More informationINFINEA TAB USER MANUAL. INFINEA ipad TAB
INFINEA TAB USER MANUAL INFINEA ipad TAB CONTACT INFORMATION National Sales Headquarters: Infinite Peripherals, Inc. 1124 Main Street Suite B Irvine, CA 92614 Toll Free: (866) 278-7860 Office: (949) 222-0300
More informationexclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576
exclusive-or and Binary Adder R eouven Elbaz reouven@uwaterloo.ca Office room: DC3576 Outline exclusive OR gate (XOR) Definition Properties Examples of Applications Odd Function Parity Generation and Checking
More informationOptimal Planning with ACO
Optimal Planning with ACO M.Baioletti, A.Milani, V.Poggioni, F.Rossi Dipartimento Matematica e Informatica Universit di Perugia, ITALY email: {baioletti, milani, poggioni, rossi}@dipmat.unipg.it Abstract.
More informationThe Model Checker SPIN
The Model Checker SPIN Author: Gerard J. Holzmann Presented By: Maulik Patel Outline Introduction Structure Foundation Algorithms Memory management Example/Demo SPIN-Introduction Introduction SPIN (Simple(
More informationNeighborhood Data and Database Security
Neighborhood Data and Database Security Kioumars Yazdanian, FrkdCric Cuppens e-mail: yaz@ tls-cs.cert.fr - cuppens@ tls-cs.cert.fr CERT / ONERA, Dept. of Computer Science 2 avenue E. Belin, B.P. 4025,31055
More informationDigital circuits make up all computers and computer systems. The operation of digital circuits is based on
Digital Logic Circuits Digital circuits make up all computers and computer systems. The operation of digital circuits is based on Boolean algebra, the mathematics of binary numbers. Boolean algebra is
More informationTreebank Search with Tree Automata MonaSearch Querying Linguistic Treebanks with Monadic Second Order Logic
Treebank Search with Tree Automata MonaSearch Querying Linguistic Treebanks with Monadic Second Order Logic Authors: H. Maryns, S. Kepser Speaker: Stephanie Ehrbächer July, 31th Treebank Search with Tree
More informationFactoring (pp. 1 of 4)
Factoring (pp. 1 of 4) Algebra Review Try these items from middle school math. A) What numbers are the factors of 4? B) Write down the prime factorization of 7. C) 6 Simplify 48 using the greatest common
More informationLecture 2: Universality
CS 710: Complexity Theory 1/21/2010 Lecture 2: Universality Instructor: Dieter van Melkebeek Scribe: Tyson Williams In this lecture, we introduce the notion of a universal machine, develop efficient universal
More informationBOOLEAN CONSENSUS FOR SOCIETIES OF ROBOTS
Workshop on New frontiers of Robotics - Interdep. Research Center E. Piaggio June 2-22, 22 - Pisa (Italy) BOOLEAN CONSENSUS FOR SOCIETIES OF ROBOTS Adriano Fagiolini DIEETCAM, College of Engineering, University
More informationCH3 Boolean Algebra (cont d)
CH3 Boolean Algebra (cont d) Lecturer: 吳 安 宇 Date:2005/10/7 ACCESS IC LAB v Today, you ll know: Introduction 1. Guidelines for multiplying out/factoring expressions 2. Exclusive-OR and Equivalence operations
More informationUsing EXCEL Solver October, 2000
Using EXCEL Solver October, 2000 2 The Solver option in EXCEL may be used to solve linear and nonlinear optimization problems. Integer restrictions may be placed on the decision variables. Solver may be
More informationA Bayesian Approach for on-line max auditing of Dynamic Statistical Databases
A Bayesian Approach for on-line max auditing of Dynamic Statistical Databases Gerardo Canfora Bice Cavallo University of Sannio, Benevento, Italy, {gerardo.canfora,bice.cavallo}@unisannio.it ABSTRACT In
More informationLiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen 2007-05-24
LiTH, Tekniska högskolan vid Linköpings universitet 1(7) IDA, Institutionen för datavetenskap Juha Takkinen 2007-05-24 1. A database schema is a. the state of the db b. a description of the db using a
More informationSTIC-AMSUD project meeting, Recife, Brazil, July 2008. Quality Management. Current work and perspectives at InCo
InCo Universidad de la República STIC-AMSUD project meeting, Recife, Brazil, July 2008 Quality Management Current work and perspectives at InCo Lorena Etcheverry, Laura González, Adriana Marotta, Verónika
More informationClass XII (Theory) C++
Class XII (Theory) C++ Duration: 3 hours Total Marks: 70 Unit No. Unit Name Marks 1. OBJECT ORIENTED PROGRAMMING IN C++ 30 2. DATA STRUCTURE 14 3. DATABASE MANAGEMENT SYSTEM AND SQL 8 4. BOOLEAN ALGEBRA
More informationsimplicity hides complexity
flow of control backtracking reasoning in logic and in Prolog 1 simplicity hides complexity simple and/or connections of goals conceal very complex control patterns Prolog programs are not easily represented
More informationLMS is a simple but powerful algorithm and can be implemented to take advantage of the Lattice FPGA architecture.
February 2012 Introduction Reference Design RD1031 Adaptive algorithms have become a mainstay in DSP. They are used in wide ranging applications including wireless channel estimation, radar guidance systems,
More informationEmail setup information for most domains hosted with InfoRailway.
Email setup information for most domains hosted with InfoRailway. Incoming server (POP3): pop.secureserver.net port 995 (SSL) Incoming server (IMAP): imap.secureserver.net port 993 (SSL) Outgoing server
More informationTL074 TL074A - TL074B
A B LOW NOISE JFET QUAD OPERATIONAL AMPLIFIERS WIDE COMMONMODE (UP TO V + CC ) AND DIFFERENTIAL VOLTAGE RANGE LOW INPUT BIAS AND OFFSET CURRENT LOW NOISE e n = 15nV/ Hz (typ) OUTPUT SHORTCIRCUIT PROTECTION
More informationFundamentele Informatica II
Fundamentele Informatica II Answer to selected exercises 1 John C Martin: Introduction to Languages and the Theory of Computation M.M. Bonsangue (and J. Kleijn) Fall 2011 Let L be a language. It is clear
More informationFIND ALL LONGER AND SHORTER BOUNDARY DURATION VECTORS UNDER PROJECT TIME AND BUDGET CONSTRAINTS
Journal of the Operations Research Society of Japan Vol. 45, No. 3, September 2002 2002 The Operations Research Society of Japan FIND ALL LONGER AND SHORTER BOUNDARY DURATION VECTORS UNDER PROJECT TIME
More informationChapter 1. Computation theory
Chapter 1. Computation theory In this chapter we will describe computation logic for the machines. This topic is a wide interdisciplinary field, so that the students can work in an interdisciplinary context.
More informationThe Halting Problem is Undecidable
185 Corollary G = { M, w w L(M) } is not Turing-recognizable. Proof. = ERR, where ERR is the easy to decide language: ERR = { x { 0, 1 }* x does not have a prefix that is a valid code for a Turing machine
More information3 1. Note that all cubes solve it; therefore, there are no more
Math 13 Problem set 5 Artin 11.4.7 Factor the following polynomials into irreducible factors in Q[x]: (a) x 3 3x (b) x 3 3x + (c) x 9 6x 6 + 9x 3 3 Solution: The first two polynomials are cubics, so if
More informationAdding Semantics to Business Intelligence
Adding Semantics to Business Intelligence Denilson Sell 1,2, Liliana Cabral 2, Enrico Motta 2, John Domingue 2 and Roberto Pacheco 1,3 1 Stela Group, Universidade Federal de Santa Catarina, Brazil 2 Knowledge
More informationFor supervised classification we have a variety of measures to evaluate how good our model is Accuracy, precision, recall
Cluster Validation Cluster Validit For supervised classification we have a variet of measures to evaluate how good our model is Accurac, precision, recall For cluster analsis, the analogous question is
More informationAttachment "A" - List of HP Inkjet Printers
HP Deskjet 350c Printer HP Deskjet 350cbi Printer HP Deskjet 350cbi Printer w/roller-case HP Deskjet 420 Printer HP Deskjet 420c Printer HP Deskjet 610c Printer HP Deskjet 610cl Printer HP Deskjet 612c
More informationCIS 631 Database Management Systems Sample Final Exam
CIS 631 Database Management Systems Sample Final Exam 1. (25 points) Match the items from the left column with those in the right and place the letters in the empty slots. k 1. Single-level index files
More informationCAs and Turing Machines. The Basis for Universal Computation
CAs and Turing Machines The Basis for Universal Computation What We Mean By Universal When we claim universal computation we mean that the CA is capable of calculating anything that could possibly be calculated*.
More informationSQL INJECTION ATTACKS By Zelinski Radu, Technical University of Moldova
SQL INJECTION ATTACKS By Zelinski Radu, Technical University of Moldova Where someone is building a Web application, often he need to use databases to store information, or to manage user accounts. And
More informationOptimization under fuzzy if-then rules
Optimization under fuzzy if-then rules Christer Carlsson christer.carlsson@abo.fi Robert Fullér rfuller@abo.fi Abstract The aim of this paper is to introduce a novel statement of fuzzy mathematical programming
More informationTutorial on Using Excel Solver to Analyze Spin-Lattice Relaxation Time Data
Tutorial on Using Excel Solver to Analyze Spin-Lattice Relaxation Time Data In the measurement of the Spin-Lattice Relaxation time T 1, a 180 o pulse is followed after a delay time of t with a 90 o pulse,
More informationDEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS
DEGREES OF ORDERS ON TORSION-FREE ABELIAN GROUPS ASHER M. KACH, KAREN LANGE, AND REED SOLOMON Abstract. We construct two computable presentations of computable torsion-free abelian groups, one of isomorphism
More informationA Tutorial on Data Integration
A Tutorial on Data Integration Maurizio Lenzerini Dipartimento di Informatica e Sistemistica Antonio Ruberti, Sapienza Università di Roma DEIS 10 - Data Exchange, Integration, and Streaming November 7-12,
More information2D Geometrical Transformations. Foley & Van Dam, Chapter 5
2D Geometrical Transformations Fole & Van Dam, Chapter 5 2D Geometrical Transformations Translation Scaling Rotation Shear Matri notation Compositions Homogeneous coordinates 2D Geometrical Transformations
More informationTeaching Scheme. Theory Practical Course Code L T P Credits Max. Min. Max. Min. ISE 10. -- -- 1MA201 Linear Algebra 3 1-4
Teaching and for Second Year B.Tech Program in Information Technology I Semester With Effective from 201213 Theory Practical Scheme Marks Marks L T P Credits Max. Min. Max. Min. 1MA201 Linear Algebra 3
More information2D Geometric Transformations
2D Geometric Transformations (Chapter 5 in FVD) 2D Geometric Transformations Question: How do we represent a geometric object in the plane? Answer: For now, assume that objects consist of points and lines.
More informationThe Entity-Relationship Model
The Entity-Relationship Model 221 After completing this chapter, you should be able to explain the three phases of database design, Why are multiple phases useful? evaluate the significance of the Entity-Relationship
More information