Neural Networks A Model of Boolean Functions
|
|
- Emory Melton
- 6 years ago
- Views:
Transcription
1 Neural Networks A Model of Boolea Fuctios Berd Steibach, Roma Kohut Freiberg Uiversity of Miig ad Techology Istitute of Computer Sciece D Freiberg, Germay s: steib@iformatik.tu-freiberg.de kohut@math.tu-freiberg.de Abstract This paper deals with the represetatio of Boolea fuctios usig artificial eural etworks ad poits out three importat results. First, usig a polyomial as trasfer fuctio, a sigle euro is able to represet a o-mootoous Boolea fuctio. Secod, the umber of iputs i the eural etwork ca be decreased if the biary values of the Boolea variables are ecoded. This approach simplifies sigificatly the ecessary umber of euros i the artificial eural etwork. Fially, a algorithm to compute the miimal umber of euros was developed. The lower boud, calculated by this algorithm, correspods to a suggested structure of artificial eural etworks. A eample shows, how such a simple artificial eural etwork may represet a Boolea fuctio. Itroductio The rapid developmet of computer systems is oe of the reasos why theoretical ad practical researches of the priciples of the ature were forced. May ew scietific ad techological bruches, which have coectio both with biological laws of the ature ad applied techical methods, appeared i the last fifty years, e.g. bioelectroics, artificial ielegace. Especially methods of the artificial itelligece are widely used i moder techologies. New waves of developmet such methods like data miig [8], fuzzy logic, cluster aalysis, epert systems, geetic algorithms, ad visual data recogitio were caused by the computer sciece. Some of these methods base o eural etworks. The coectio betwee eural etworks ad Boolea fuctio is ot ew. Oe of the pessimistic results i the history of eural etworks was the coclusio of Misky ad Papert about impossibility of represetatio of all fuctioal depedece. They proved this property o the Boolea fuctio eclusive OR (XOR) [4, 8, 0]. This statemet is correct oly for simplest artificial eural etwork, amed Perceptro of Roseblatt [6]. The result of Misky ad Papert has bee later by Mkrttschja disproved [5]. I geeral, all types of fuctioal depedece icludig Boolea fuctios ca be represeted usig eural etworks. This paper gives a itroductio, how artificial eural etworks ca model Boolea fuctios. The rest of this paper is orgaized as follows. Sectio itroduces both Boolea fuctios ad euros. Sectio 3 shows, how o-mootoous Boolea fuctio may represet by sigle euros. Sectio 4 describes, how the ecodig of the Boolea values ca be used to miimize the size of a artificial eural etwork. A algorithm to calculate a strog lower boud of euros is preseted i sectio 5. Fially, sectio 6 cocludes the paper. Prelimiaries Let,, 3,,, be Boolea variables, i {0, } = B. A Boolea fuctio f is defied by f B : B, where B = {(0...00),(0...0),(0...0),...,(...)} [, 7]. The umber of vectors i the Boolea space B is N =. The simplest represetatio of a Boolea fuctio is a table that defies the fuctio value for each of the iput vectors, see eample i figure a.
2 There are may other represetatios of Boolea fuctios. Oe of them is the visualizatio of the Boolea fuctio as - dimesioal hypercube [, 7]. Each iput vector of the Boolea fuctio correspods to eactly oe verte i - dimesioal space. The fuctio values are labeled by if f = or о if f = 0. The visualizatio of the fuctio f = ( + 3 ) shows figure b. 3 f a) b) Figure. The Boolea fuctio f = ( + 3 ), a) Fuctio Table, b) Visualizatio Net, the artificial eural etwork is iputs itroduced. These etworks models are weights of syaptic coectios simple way biological eural etworks. w addig elemet A artificial eural etwork is a w coectio of simple processig w 3 ao output elemets, called euros, which operates 3 Y S i parallel [, 3, 4, 6, 0]. I this paper w artificial eural etworks are restricted to feed forward etworks, which ca be = S w i i Y=F(S) syapses represeted by directed acyclic graphs (DAG), see figures 4, 6. The structure of Figure. Geeral structure of euro a euro is show i figure. The mathematical descriptio of euro is: Y = F i w i () where Y - output sigal of euro, F - activatio fuctio, i - sigal from the iput і to the syapse i, w i - weight coefficiet of the iput і, - umber of iputs. I geeral, the coditio to activate a euro is (), where θ is threshold of trasfer fuctio. w i i θ 0 () The uequatio () icludes the equatio (3) of a -dimesioal hyper-plae that divides the vertices of the hypercube ito two part sets. w i i θ = 0 (3) The output of a euro may be coected to several syapses of other euros. The activatio fuctio is sometimes called a trasfer fuctio. I the case of a bouded rages the activatio fuctios are called squashig fuctios, such as the commoly used tah (hyperbolic taget) ad the logistic fuctio (+ e ) [3, 0], see figure 3. Y Y Y Y 0 T 0 - a) b) c) 0 d) Figure 3. Activatio fuctios: a) jump, b) threshold, c) hyperbolic taget, d) logistic fuctio
3 3 Neural Networks of No-mootoous Boolea Fuctios 3. The Problem We cosider elemetary Boolea fuctios NOT, OR, AND, XOR. Table shows these fuctios. Table. Elemetary Boolea fuctios The basic questio is, whether oe euro is eough to represet each of these Boolea fuctios. The eural etworks to represet the first three fuctios are show i figure 4. w y w y a) w b) Figure 4. Neural etwork s structures: a) for NOT fuctio; b) for OR-, or AND - fuctios The fuctios NOT, OR, or AND ca be represeted usig oe euro. A simple eplaatio for that is show i figure 5. The activatio fuctios from figure 3 distiguish the areas havig the output zero or oe. Based o the sum of the weighted iputs oly mootoous Boolea fuctios may calculate directly by such simple activatio fuctios. If the Boolea fuctio is depeded o oe variable there eist a cut poit, see figure 5 a. I case of two variables i the Boolea fuctio, a lie separates all vertees labeled by 0 from the all other vertees labeled by, see figures 5 b ad c. Geerally, if there are more the two Boolea variables, a plae or hyper-plae separates both areas. For the XOR-fuctio such a lie or hyper-plae does ot eist, see figure 5 d. Eactly o this eample Misky ad Papert proved impossibility of represetatio some fuctioal depedeces usig oe euro [4]. I the case of eural elemet with two iputs ad threshold θ, we have from (3) the equatio of the lie i the plae - : w + w = θ (4) NOT 00 OR 0 00 AND 0 00 XOR 0 Figure 5. Visualizatio the separator of eural etworks i the Boolea space a) NOT-fuctio; b) OR-fuctio; c) AND-fuctio; d) XOR-fuctio 3. Kow Approaches for No-mootoous Boolea Fuctios The simplest approach is to epress the o-mootoous Boolea fuctio as disjuctive ormal form, which icludes oly mootoous operatios. Each of these mootoous operatios is mapped to
4 Y oe euro. This simple method is useable for each Boolea fuctio, but already the simplest o-mootoous Boolea fuctio (5) eeds more the oe euro. The figure 6 shows the eural etwork, associated to the XOR-fuctio (5). Figure 6. Neural etwork of the XOR-fuctio usig mootoous euros Y = XOR( = = + (5), ) The secod kow method uses oe additioal iput ito oe sigle euro i order to realize the XOR-fuctio. This method eeds a additioal OR-gate ad was proposed by Mkrttschja [5]. The mai idea is the trasformatio of the two valued Boolea fuctio ito the three dimesioal Boolea space, which chages (4) ito the equatio (6), where w =, w =, w 3 =, θ = 0,5 ad a =, a =, a 3 = OR i order to model the XOR-fuctio (5). w a + w a + w 3 a 3 = θ (6) The equatio (6) substitutes the lie (4) ito a plae; see figure 7 a. Correspodigly, The Boolea fuctio f ( ) = + is trasformed ito f ( α ) = αα α 3 + αα α 3 + αα α3. a) b) Figure 7. The represetatio of the XOR-fuctio, a) plae defied by (6), b) projectio of the plae i the two-dimesioal space The chose parameter of (6) map the four vertices of B ito the vertices labeled by a dotted circle i figure 7 a. Thus, the ais ca be modeled i the plae a a 3 ad the ais i the plae a a 3. The retur trasformatio of the separatio pla, defied by (6) ad visualized i figure 7 a, leads to the broke lie, visualized i figure 7 b. This broke lie separates the vertices labeled by 0 form that vertices labeled. Note, usig this approach, the XOR-fuctio eeds two euros i the etwork, the first two syapses euro calculates the OR-fuctio ad the secod three syapses euro computes the fial XOR-fuctio. 3.3 Polyomial Trasfer Fuctios The two methods, discussed i sectio 3., eed more tha oe euro to realize a o-mootoous Boolea fuctio. These methods icrease umber of sigals, modeled i a lager dimesioal space. Alteratively, a sigle euro ca realize the o-mootoous Boolea fuctio, if this euro takes advatages of a more comple activatio fuctio, like a polyomial (7) or trigoometrical (8) fuctio.
5 Figure 8. Represetatio of the XOR-fuctio usig sigle euros that evaluates a polyomial trasfer fuctio d 0 0 w + w i i θ (7) tf 0 0 w + w i i θ (8) The advatage of this method is a oe to oe mappig of the Boolea fuctio to the eural etwork. I case of the XOR-fuctio we chose d = w 0 = -, w = w =, k =, ad θ = -0.5, ad get the formula (9), which is true oly if, the XOR-fuctio is equal to oe i (9) Figure 8 illustrates the valid area of the uequatio (9). k 4 Ecodig the Iputs of Boolea Fuctios Now the case of more comple Boolea fuctios depedig o a large umber of variables is cosidered. I geeral there are three methods to create the euroal etwork that describes a comple Boolea fuctio. First, the Boolea fuctio is mapped to a special euroal etwork usig such euros that realizes the NOT-, AND-, ad OR-fuctio. I a secod step, mergig of selected euros ca miimize the umber of euros of this euroal etwork. This is a time cosumig process. Secod, a geeral artificial euroal etwork is used. This euroal etwork has oe iput for each Boolea variable ad a sufficiet umber of layers. The advatage of such simple structure of the euroal etwork is coected with the disadvatage of a etremely time cosumig traiig process. For eample, a Boolea fuctio with 30 argumets has 30 = differet biary vectors. Each of them must apply to trai the artificial euroal etwork. Usig the traiig method Back Propagatio this task may eed approimately oe year. A quick algorithm, like Fuctioal o the sets of tabled fuctios [8, 9] to trai the eural etwork, speed up this procedure 50 times, but this algorithms required byte = 3 Gigabyte radom access memory (RAM). The both methods, described above, are restricted i the time, eeded to specify all details of the artificial euroal etwork. Alteratively, we suppose the ecodig of a certai umber of Boolea variables ito real umber. A euro is able to process real umbers up to a give precisio. A possible ecodig for two or Boolea variable ito the iterval [0, ] is show i table 3. The umber of iputs ad the umber of euros as well is decreased, usig this ecodig. Table 3. Ecodig iput biary vectors for eural etwork = =/3 0 For geeral case = /3 0 4 = For istace, a 8-bits umber represetatio of a sigal allow to distiguish betwee 8 values. Uder this assumptio, a Boolea fuctio of 6 argumets ca be realized by a eural etwork with two iputs ( 8 8 = 6 ). This decreases the umber of iputs by oe magitude (from 6 to ), ad cosequetly the umber of layers ad the umber of ecessary euros is decreases as well. The smaller umber of euros speeds-up of traiig process sigificatly. This approach allows to epress very comple Boolea fuctios i much simpler structures of eural etworks. The restrictio of this method is sesitivity of euros.
6 5 Lower Boud of the Number Neuros i the Neural Network I this sectio we propose a algorithm, which calculates the lower boud of euros o each layer of eural etwork. Thus, this algorithm fids the structure of the smallest possible eural etworks of Boolea fuctios i terms of the umber of layers ad the umber of euros i each layer as well. The algorithm uses the followig assumptio. The iterval of the sigals level is [0, ]. The sesitivity of euros is labeled by, which meas that the euro ca distiguish betwee N s = - differet values of a sigal. A Boolea fuctio of m argumets eeds a sesitivity, defied by (0). (0) m Algorithm (Number of Neuros ad Layers). Assume, the Boolea fuctio may be represeted by oe hidde layer, r =.. Compute the miimal umber of euros K r o the layer r usig the formula (). The special brackets deote the smallest iteger value that is lager the the eclosed real value. if >, the log K r = else K r = 0 () log Kr 3. If NS, the the assumptio of step is true ad miimal umber of euros to represetatio Boolea fuctio ca be calculated by (). ma M = + () z K r r = r Otherwise, the assumptio of step is false, the umber of hidde layers r is icremeted by oe, the ecessary sesitivity for et layer is elarged by (3). : = K r (3) Eample ad the steps ad 3 must be repeated for the et hidde layer. What is the miimal euroal etwork of the o-mootoous Boolea fuctio (4)? = 8 f We assume, that the sesitivity of the available euros is = 4, so that the euro ca distiguish betwee N s = - = 4 values of a sigal. Because the Boolea fuctio has = 8 argumets, the ecessary sesitivity is = 8. A sigle hidde layer is assumed ad the umber of euros i this hidde layer K is calculated (5). i (4) log 8 log 8 K = = = = 4 log 4. (5) log K Sice 4 N = 6, the algorithm fids i step 3 the miimal umber of euros (6). = S M z = + K = + = 3. (6) The simplest feed forward eural etwork to represet the Boolea fuctio (4) eeds oe iput layer, oly oe hidig layer, ad a oe-euro output layer, see figure 9. Three euros havig a sesitivity = -4 determie the Boolea fuctio which depeds o 8 variables.
7 f 8 = i = i Figure 9. Simple architecture of feed forward eural etwork to represet the Boolea fuctio (4) 6 Coclusio ad Future Work Each Boolea fuctio ca represet by several artificial eural etworks. Usig Boolea sigals o the syapses ad oe of the traditioal activatio fuctios, a sigle euro is oly able to realize a mootoous Boolea fuctio. There eist a oe-to-oe mappig of NOT-, AND- or OR-gates to such simple euros. Artificial eural etworks created by this simple oe-to-oe mappig describe a upper boud of euroal etworks ad have o beefit compared to correspodig gate circuit. The reaso for that is the more comple structure of the euros i compariso to the logic gates. Two approaches to simplify such euroal etworks were suggested. First, usig polyomial or trigoometrical activatio fuctios, a sigle euro ca represet o-mootoous Boolea fuctios, which covers a certai set of logic gates. This approach reduces the umber of euros sigificatly ad a real beefit of such artificial eural etworks i terms of space ad time is possible. The secod way to take advatages of the capability of euros cosists i the ecodig of a lager umber of Boolea variables ito each iput sigal of the euro. This approach is oly limited by the sesitivity of the used euros ad reduces the umber of euros ad layers of the artificial eural etwork drastically. Thus, both the memory space to store eural etwork ad the time of the learig ad usig phase are decreased. I the future we will eted the theory artificial eural etworks i order fid a optimal represetatio of Boolea fuctios usig such etworks. Based o these results we will desig ad implemet a package, that uses artificial eural etworks for compact represetatio ad fast computatios ad evaluatios of Boolea fuctios. 7 Refereces [] Bochma, D.: Steibach, B.: Logiketwurf mit XBOOLE. Verlag Techik, Berli, 99. [] Gschwedter A. B. DARPA Neural Network Study. AFCEA Iteratioal Press, p. 60, 988. [3] Kröse, B.; v. d. Smagt P.: A itroductio to Neural Networks. Uiversity of Amsterdam, 996. [4] Misky M. ad Papert S. Perceptros: A Itroductio to Computatioal Geometry. MIT Press, Cambridge, MA, 969. [5] Mkrttschja S.O. Neuros ad eural etworks - Itroductio i the theory of formal euros. (I Russia), Eergy, Moscow, 97. [6] Roseblatt F. Priciples of Neurodyamics. Sparta, New York, 96. [7] Steibach, B.: XBOOLE - A Toolbo for Modelig, Simulatio, ad Aalysis of Large Digital Systems. System Aalysis ad Modelig Simulatio, Gordo & Breach Sciece Publishers, 9(99), Number 4, pp. 97-3, 99. [8] Tkacheko, R.: Kohut, R.: Feed forward eural etworks: the problems of sythesis ad usig. (I Ukraiia), Bulleti of Lviv Polytechic Natioal Uiversity: Computer Egieerig ad Iformatio Techologies, 433, Lviv, pp. 66-7, 00. [9] Tkacheko, R.: Kohut, R.: Fuctioal etesio of iputs i feed forward eural etwork with o-iteratio learig. (I Ukraiia), Techical ews (), (3), Lviv, pp. 9-94, 00. [0] Wasserma P.D.: Neural Computig Theory ad Practice. Va Nostrad Reihold, New York, 989.
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON
A SOFTWARE MODEL FOR THE MULTILAYER PERCEPTRON Roberto Lopez ad Eugeio Oñate Iteratioal Ceter for Numerical Methods i Egieerig (CIMNE) Edificio C1, Gra Capitá s/, 08034 Barceloa, Spai ABSTRACT I this work
More informationA New Morphological 3D Shape Decomposition: Grayscale Interframe Interpolation Method
A ew Morphological 3D Shape Decompositio: Grayscale Iterframe Iterpolatio Method D.. Vizireau Politehica Uiversity Bucharest, Romaia ae@comm.pub.ro R. M. Udrea Politehica Uiversity Bucharest, Romaia mihea@comm.pub.ro
More informationBOOLEAN MATHEMATICS: GENERAL THEORY
CHAPTER 3 BOOLEAN MATHEMATICS: GENERAL THEORY 3.1 ISOMORPHIC PROPERTIES The ame Boolea Arithmetic was chose because it was discovered that literal Boolea Algebra could have a isomorphic umerical aspect.
More informationThe isoperimetric problem on the hypercube
The isoperimetric problem o the hypercube Prepared by: Steve Butler November 2, 2005 1 The isoperimetric problem We will cosider the -dimesioal hypercube Q Recall that the hypercube Q is a graph whose
More informationANN WHICH COVERS MLP AND RBF
ANN WHICH COVERS MLP AND RBF Josef Boští, Jaromír Kual Faculty of Nuclear Scieces ad Physical Egieerig, CTU i Prague Departmet of Software Egieerig Abstract Two basic types of artificial eural etwors Multi
More informationChapter 3 Classification of FFT Processor Algorithms
Chapter Classificatio of FFT Processor Algorithms The computatioal complexity of the Discrete Fourier trasform (DFT) is very high. It requires () 2 complex multiplicatios ad () complex additios [5]. As
More informationEuclidean Distance Based Feature Selection for Fault Detection Prediction Model in Semiconductor Manufacturing Process
Vol.133 (Iformatio Techology ad Computer Sciece 016), pp.85-89 http://dx.doi.org/10.1457/astl.016. Euclidea Distace Based Feature Selectio for Fault Detectio Predictio Model i Semicoductor Maufacturig
More informationPattern Recognition Systems Lab 1 Least Mean Squares
Patter Recogitio Systems Lab 1 Least Mea Squares 1. Objectives This laboratory work itroduces the OpeCV-based framework used throughout the course. I this assigmet a lie is fitted to a set of poits usig
More informationUniversity of Waterloo Department of Electrical and Computer Engineering ECE 250 Algorithms and Data Structures
Uiversity of Waterloo Departmet of Electrical ad Computer Egieerig ECE 250 Algorithms ad Data Structures Midterm Examiatio ( pages) Istructor: Douglas Harder February 7, 2004 7:30-9:00 Name (last, first)
More informationMATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fitting)
MATHEMATICAL METHODS OF ANALYSIS AND EXPERIMENTAL DATA PROCESSING (Or Methods of Curve Fittig) I this chapter, we will eamie some methods of aalysis ad data processig; data obtaied as a result of a give
More informationBehavioral Modeling in Verilog
Behavioral Modelig i Verilog COE 202 Digital Logic Desig Dr. Muhamed Mudawar Kig Fahd Uiversity of Petroleum ad Mierals Presetatio Outlie Itroductio to Dataflow ad Behavioral Modelig Verilog Operators
More informationDesigning a learning system
CS 75 Itro to Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@pitt.edu 539 Seott Square, -5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please
More informationOnes Assignment Method for Solving Traveling Salesman Problem
Joural of mathematics ad computer sciece 0 (0), 58-65 Oes Assigmet Method for Solvig Travelig Salesma Problem Hadi Basirzadeh Departmet of Mathematics, Shahid Chamra Uiversity, Ahvaz, Ira Article history:
More informationLecturers: Sanjam Garg and Prasad Raghavendra Feb 21, Midterm 1 Solutions
U.C. Berkeley CS170 : Algorithms Midterm 1 Solutios Lecturers: Sajam Garg ad Prasad Raghavedra Feb 1, 017 Midterm 1 Solutios 1. (4 poits) For the directed graph below, fid all the strogly coected compoets
More informationImproving Template Based Spike Detection
Improvig Template Based Spike Detectio Kirk Smith, Member - IEEE Portlad State Uiversity petra@ee.pdx.edu Abstract Template matchig algorithms like SSE, Covolutio ad Maximum Likelihood are well kow for
More informationBOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM
MATEC Web of Cofereces 79, 01014 (016) DOI: 10.1051/ mateccof/0167901014 T 016 BOOLEAN DIFFERENTIATION EQUATIONS APPLICABLE IN RECONFIGURABLE COMPUTATIONAL MEDIUM Staislav Shidlovskiy 1, 1 Natioal Research
More informationNew HSL Distance Based Colour Clustering Algorithm
The 4th Midwest Artificial Itelligece ad Cogitive Scieces Coferece (MAICS 03 pp 85-9 New Albay Idiaa USA April 3-4 03 New HSL Distace Based Colour Clusterig Algorithm Vasile Patrascu Departemet of Iformatics
More information3D Model Retrieval Method Based on Sample Prediction
20 Iteratioal Coferece o Computer Commuicatio ad Maagemet Proc.of CSIT vol.5 (20) (20) IACSIT Press, Sigapore 3D Model Retrieval Method Based o Sample Predictio Qigche Zhag, Ya Tag* School of Computer
More informationCSC 220: Computer Organization Unit 11 Basic Computer Organization and Design
College of Computer ad Iformatio Scieces Departmet of Computer Sciece CSC 220: Computer Orgaizatio Uit 11 Basic Computer Orgaizatio ad Desig 1 For the rest of the semester, we ll focus o computer architecture:
More informationAccuracy Improvement in Camera Calibration
Accuracy Improvemet i Camera Calibratio FaJie L Qi Zag ad Reihard Klette CITR, Computer Sciece Departmet The Uiversity of Aucklad Tamaki Campus, Aucklad, New Zealad fli006, qza001@ec.aucklad.ac.z r.klette@aucklad.ac.z
More informationCSC165H1 Worksheet: Tutorial 8 Algorithm analysis (SOLUTIONS)
CSC165H1, Witer 018 Learig Objectives By the ed of this worksheet, you will: Aalyse the ruig time of fuctios cotaiig ested loops. 1. Nested loop variatios. Each of the followig fuctios takes as iput a
More informationWhat are we going to learn? CSC Data Structures Analysis of Algorithms. Overview. Algorithm, and Inputs
What are we goig to lear? CSC316-003 Data Structures Aalysis of Algorithms Computer Sciece North Carolia State Uiversity Need to say that some algorithms are better tha others Criteria for evaluatio Structure
More information. Written in factored form it is easy to see that the roots are 2, 2, i,
CMPS A Itroductio to Programmig Programmig Assigmet 4 I this assigmet you will write a java program that determies the real roots of a polyomial that lie withi a specified rage. Recall that the roots (or
More informationReversible Realization of Quaternary Decoder, Multiplexer, and Demultiplexer Circuits
Egieerig Letters, :, EL Reversible Realizatio of Quaterary Decoder, Multiplexer, ad Demultiplexer Circuits Mozammel H.. Kha, Member, ENG bstract quaterary reversible circuit is more compact tha the correspodig
More informationBezier curves. Figure 2 shows cubic Bezier curves for various control points. In a Bezier curve, only
Edited: Yeh-Liag Hsu (998--; recommeded: Yeh-Liag Hsu (--9; last updated: Yeh-Liag Hsu (9--7. Note: This is the course material for ME55 Geometric modelig ad computer graphics, Yua Ze Uiversity. art of
More informationOn Infinite Groups that are Isomorphic to its Proper Infinite Subgroup. Jaymar Talledo Balihon. Abstract
O Ifiite Groups that are Isomorphic to its Proper Ifiite Subgroup Jaymar Talledo Baliho Abstract Two groups are isomorphic if there exists a isomorphism betwee them Lagrage Theorem states that the order
More informationHow do we evaluate algorithms?
F2 Readig referece: chapter 2 + slides Algorithm complexity Big O ad big Ω To calculate ruig time Aalysis of recursive Algorithms Next time: Litterature: slides mostly The first Algorithm desig methods:
More informationElementary Educational Computer
Chapter 5 Elemetary Educatioal Computer. Geeral structure of the Elemetary Educatioal Computer (EEC) The EEC coforms to the 5 uits structure defied by vo Neuma's model (.) All uits are preseted i a simplified
More informationx x 2 x Iput layer = quatity of classificatio mode X T = traspositio matrix The core of such coditioal probability estimatig method is calculatig the
COMPARATIVE RESEARCHES ON PROBABILISTIC NEURAL NETWORKS AND MULTI-LAYER PERCEPTRON NETWORKS FOR REMOTE SENSING IMAGE SEGMENTATION Liu Gag a, b, * a School of Electroic Iformatio, Wuha Uiversity, 430079,
More informationOptimal Mapped Mesh on the Circle
Koferece ANSYS 009 Optimal Mapped Mesh o the Circle doc. Ig. Jaroslav Štigler, Ph.D. Bro Uiversity of Techology, aculty of Mechaical gieerig, ergy Istitut, Abstract: This paper brigs out some ideas ad
More informationcondition w i B i S maximum u i
ecture 10 Dyamic Programmig 10.1 Kapsack Problem November 1, 2004 ecturer: Kamal Jai Notes: Tobias Holgers We are give a set of items U = {a 1, a 2,..., a }. Each item has a weight w i Z + ad a utility
More informationHarris Corner Detection Algorithm at Sub-pixel Level and Its Application Yuanfeng Han a, Peijiang Chen b * and Tian Meng c
Iteratioal Coferece o Computatioal Sciece ad Egieerig (ICCSE 015) Harris Corer Detectio Algorithm at Sub-pixel Level ad Its Applicatio Yuafeg Ha a, Peijiag Che b * ad Tia Meg c School of Automobile, Liyi
More informationAppendix D. Controller Implementation
COMPUTER ORGANIZATION AND DESIGN The Hardware/Software Iterface 5 th Editio Appedix D Cotroller Implemetatio Cotroller Implemetatios Combiatioal logic (sigle-cycle); Fiite state machie (multi-cycle, pipelied);
More informationLower Bounds for Sorting
Liear Sortig Topics Covered: Lower Bouds for Sortig Coutig Sort Radix Sort Bucket Sort Lower Bouds for Sortig Compariso vs. o-compariso sortig Decisio tree model Worst case lower boud Compariso Sortig
More informationSolving Fuzzy Assignment Problem Using Fourier Elimination Method
Global Joural of Pure ad Applied Mathematics. ISSN 0973-768 Volume 3, Number 2 (207), pp. 453-462 Research Idia Publicatios http://www.ripublicatio.com Solvig Fuzzy Assigmet Problem Usig Fourier Elimiatio
More informationStone Images Retrieval Based on Color Histogram
Stoe Images Retrieval Based o Color Histogram Qiag Zhao, Jie Yag, Jigyi Yag, Hogxig Liu School of Iformatio Egieerig, Wuha Uiversity of Techology Wuha, Chia Abstract Stoe images color features are chose
More informationAPPLICATION NOTE PACE1750AE BUILT-IN FUNCTIONS
APPLICATION NOTE PACE175AE BUILT-IN UNCTIONS About This Note This applicatio brief is iteded to explai ad demostrate the use of the special fuctios that are built ito the PACE175AE processor. These powerful
More informationEE260: Digital Design, Spring /16/18. n Example: m 0 (=x 1 x 2 ) is adjacent to m 1 (=x 1 x 2 ) and m 2 (=x 1 x 2 ) but NOT m 3 (=x 1 x 2 )
EE26: Digital Desig, Sprig 28 3/6/8 EE 26: Itroductio to Digital Desig Combiatioal Datapath Yao Zheg Departmet of Electrical Egieerig Uiversity of Hawaiʻi at Māoa Combiatioal Logic Blocks Multiplexer Ecoders/Decoders
More informationCreating Exact Bezier Representations of CST Shapes. David D. Marshall. California Polytechnic State University, San Luis Obispo, CA , USA
Creatig Exact Bezier Represetatios of CST Shapes David D. Marshall Califoria Polytechic State Uiversity, Sa Luis Obispo, CA 93407-035, USA The paper presets a method of expressig CST shapes pioeered by
More informationPseudocode ( 1.1) Analysis of Algorithms. Primitive Operations. Pseudocode Details. Running Time ( 1.1) Estimating performance
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Pseudocode ( 1.1) High-level descriptio of a algorithm More structured
More informationBig-O Analysis. Asymptotics
Big-O Aalysis 1 Defiitio: Suppose that f() ad g() are oegative fuctios of. The we say that f() is O(g()) provided that there are costats C > 0 ad N > 0 such that for all > N, f() Cg(). Big-O expresses
More informationOutline and Reading. Analysis of Algorithms. Running Time. Experimental Studies. Limitations of Experiments. Theoretical Analysis
Outlie ad Readig Aalysis of Algorithms Iput Algorithm Output Ruig time ( 3.) Pseudo-code ( 3.2) Coutig primitive operatios ( 3.3-3.) Asymptotic otatio ( 3.6) Asymptotic aalysis ( 3.7) Case study Aalysis
More informationDesigning a learning system
CS 75 Machie Learig Lecture Desigig a learig system Milos Hauskrecht milos@cs.pitt.edu 539 Seott Square, x-5 people.cs.pitt.edu/~milos/courses/cs75/ Admiistrivia No homework assigmet this week Please try
More informationForce Network Analysis using Complementary Energy
orce Network Aalysis usig Complemetary Eergy Adrew BORGART Assistat Professor Delft Uiversity of Techology Delft, The Netherlads A.Borgart@tudelft.l Yaick LIEM Studet Delft Uiversity of Techology Delft,
More informationCubic Polynomial Curves with a Shape Parameter
roceedigs of the th WSEAS Iteratioal Coferece o Robotics Cotrol ad Maufacturig Techology Hagzhou Chia April -8 00 (pp5-70) Cubic olyomial Curves with a Shape arameter MO GUOLIANG ZHAO YANAN Iformatio ad
More informationImproved Random Graph Isomorphism
Improved Radom Graph Isomorphism Tomek Czajka Gopal Paduraga Abstract Caoical labelig of a graph cosists of assigig a uique label to each vertex such that the labels are ivariat uder isomorphism. Such
More informationVisualization of Gauss-Bonnet Theorem
Visualizatio of Gauss-Boet Theorem Yoichi Maeda maeda@keyaki.cc.u-tokai.ac.jp Departmet of Mathematics Tokai Uiversity Japa Abstract: The sum of exteral agles of a polygo is always costat, π. There are
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045 Oe Brookigs Drive St. Louis, Missouri 63130-4899, USA jaegerg@cse.wustl.edu
More informationPerhaps the method will give that for every e > U f() > p - 3/+e There is o o-trivial upper boud for f() ad ot eve f() < Z - e. seems to be kow, where
ON MAXIMUM CHORDAL SUBGRAPH * Paul Erdos Mathematical Istitute of the Hugaria Academy of Scieces ad Reu Laskar Clemso Uiversity 1. Let G() deote a udirected graph, with vertices ad V(G) deote the vertex
More informationAn Anomaly Detection Method Based On Deep Learning
Sed Orders for Reprits to reprits@bethamsciece.ae 734 The Ope Automatio ad Cotrol Systems Joural, 05, 7, 734-739 A Aomaly Detectio Method Based O Deep Learig Ope Access Hog-li Deg *, Tao yag ad Jiag-i
More informationImage Segmentation EEE 508
Image Segmetatio Objective: to determie (etract) object boudaries. It is a process of partitioig a image ito distict regios by groupig together eighborig piels based o some predefied similarity criterio.
More informationMath Section 2.2 Polynomial Functions
Math 1330 - Sectio. Polyomial Fuctios Our objectives i workig with polyomial fuctios will be, first, to gather iformatio about the graph of the fuctio ad, secod, to use that iformatio to geerate a reasoably
More informationAn Efficient Algorithm for Graph Bisection of Triangularizations
Applied Mathematical Scieces, Vol. 1, 2007, o. 25, 1203-1215 A Efficiet Algorithm for Graph Bisectio of Triagularizatios Gerold Jäger Departmet of Computer Sciece Washigto Uiversity Campus Box 1045, Oe
More informationEvaluation scheme for Tracking in AMI
A M I C o m m u i c a t i o A U G M E N T E D M U L T I - P A R T Y I N T E R A C T I O N http://www.amiproject.org/ Evaluatio scheme for Trackig i AMI S. Schreiber a D. Gatica-Perez b AMI WP4 Trackig:
More informationThe Counterchanged Crossed Cube Interconnection Network and Its Topology Properties
WSEAS TRANSACTIONS o COMMUNICATIONS Wag Xiyag The Couterchaged Crossed Cube Itercoectio Network ad Its Topology Properties WANG XINYANG School of Computer Sciece ad Egieerig South Chia Uiversity of Techology
More informationImprovement of the Orthogonal Code Convolution Capabilities Using FPGA Implementation
Improvemet of the Orthogoal Code Covolutio Capabilities Usig FPGA Implemetatio Naima Kaabouch, Member, IEEE, Apara Dhirde, Member, IEEE, Saleh Faruque, Member, IEEE Departmet of Electrical Egieerig, Uiversity
More informationFast Fourier Transform (FFT) Algorithms
Fast Fourier Trasform FFT Algorithms Relatio to the z-trasform elsewhere, ozero, z x z X x [ ] 2 ~ elsewhere,, ~ e j x X x x π j e z z X X π 2 ~ The DFS X represets evely spaced samples of the z- trasform
More informationTHIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS. Roman Szewczyk
THIN LAYER ORIENTED MAGNETOSTATIC CALCULATION MODULE FOR ELMER FEM, BASED ON THE METHOD OF THE MOMENTS Roma Szewczyk Istitute of Metrology ad Biomedical Egieerig, Warsaw Uiversity of Techology E-mail:
More informationStudy on effective detection method for specific data of large database LI Jin-feng
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 205) Study o effective detectio method for specific data of large database LI Ji-feg (Vocatioal College of DogYig, Shadog
More informationComputer Systems - HS
What have we leared so far? Computer Systems High Level ENGG1203 2d Semester, 2017-18 Applicatios Sigals Systems & Cotrol Systems Computer & Embedded Systems Digital Logic Combiatioal Logic Sequetial Logic
More informationData Structures and Algorithms. Analysis of Algorithms
Data Structures ad Algorithms Aalysis of Algorithms Outlie Ruig time Pseudo-code Big-oh otatio Big-theta otatio Big-omega otatio Asymptotic algorithm aalysis Aalysis of Algorithms Iput Algorithm Output
More informationA Comparative Study on Modeling Methods for Switched Reluctance Machines
Computer ad Iformatio Sciece Vol. 3, No. 2; May 21 A Comparative Study o Modelig Methods for Switched Reluctace Machies Shouju Sog & Weiguo iu School of Automatio, Northwester Polytechical Uiversity PO
More informationRunning Time ( 3.1) Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time ( 3.1) Aalysis of Algorithms Iput Algorithm Output A algorithm is a step- by- step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects.
More informationAnalysis of Algorithms
Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Ruig Time Most algorithms trasform iput objects ito output objects. The
More informationCIS 121 Data Structures and Algorithms with Java Fall Big-Oh Notation Tuesday, September 5 (Make-up Friday, September 8)
CIS 11 Data Structures ad Algorithms with Java Fall 017 Big-Oh Notatio Tuesday, September 5 (Make-up Friday, September 8) Learig Goals Review Big-Oh ad lear big/small omega/theta otatios Practice solvig
More informationFundamentals of Media Processing. Shin'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dinh Le
Fudametals of Media Processig Shi'ichi Satoh Kazuya Kodama Hiroshi Mo Duy-Dih Le Today's topics Noparametric Methods Parze Widow k-nearest Neighbor Estimatio Clusterig Techiques k-meas Agglomerative Hierarchical
More informationImage Processing Using Cellular Neural Networks Based on Multi-Valued and Universal Binary Neurons
Image Processig Usig Cellular Neural Networks Based o Multi-Valued ad Uiversal Biary Neuros Igor Aizeberg ad Costatie Butakoff Neural Networks Techologies Ltd., 55, Bialik str., Ramat-Ga, 553, Israel e-mail:
More informationDETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION
Proceedigs, 11 th FIG Symposium o Deformatio Measuremets, Satorii, Greece, 2003. DETECTION OF LANDSLIDE BLOCK BOUNDARIES BY MEANS OF AN AFFINE COORDINATE TRANSFORMATION Michaela Haberler, Heribert Kahme
More informationAutomatic Generation of Polynomial-Basis Multipliers in GF (2 n ) using Recursive VHDL
Automatic Geeratio of Polyomial-Basis Multipliers i GF (2 ) usig Recursive VHDL J. Nelso, G. Lai, A. Teca Abstract Multiplicatio i GF (2 ) is very commoly used i the fields of cryptography ad error correctig
More informationRunning Time. Analysis of Algorithms. Experimental Studies. Limitations of Experiments
Ruig Time Aalysis of Algorithms Iput Algorithm Output A algorithm is a step-by-step procedure for solvig a problem i a fiite amout of time. Most algorithms trasform iput objects ito output objects. The
More informationMobile terminal 3D image reconstruction program development based on Android Lin Qinhua
Iteratioal Coferece o Automatio, Mechaical Cotrol ad Computatioal Egieerig (AMCCE 05) Mobile termial 3D image recostructio program developmet based o Adroid Li Qihua Sichua Iformatio Techology College
More informationHomework 1 Solutions MA 522 Fall 2017
Homework 1 Solutios MA 5 Fall 017 1. Cosider the searchig problem: Iput A sequece of umbers A = [a 1,..., a ] ad a value v. Output A idex i such that v = A[i] or the special value NIL if v does ot appear
More informationSection 7.2: Direction Fields and Euler s Methods
Sectio 7.: Directio ields ad Euler s Methods Practice HW from Stewart Tetbook ot to had i p. 5 # -3 9-3 odd or a give differetial equatio we wat to look at was to fid its solutio. I this chapter we will
More informationLecture 5. Counting Sort / Radix Sort
Lecture 5. Coutig Sort / Radix Sort T. H. Corme, C. E. Leiserso ad R. L. Rivest Itroductio to Algorithms, 3rd Editio, MIT Press, 2009 Sugkyukwa Uiversity Hyuseug Choo choo@skku.edu Copyright 2000-2018
More informationBASED ON ITERATIVE ERROR-CORRECTION
A COHPARISO OF CRYPTAALYTIC PRICIPLES BASED O ITERATIVE ERROR-CORRECTIO Miodrag J. MihaljeviC ad Jova Dj. GoliC Istitute of Applied Mathematics ad Electroics. Belgrade School of Electrical Egieerig. Uiversity
More information1.2 Binomial Coefficients and Subsets
1.2. BINOMIAL COEFFICIENTS AND SUBSETS 13 1.2 Biomial Coefficiets ad Subsets 1.2-1 The loop below is part of a program to determie the umber of triagles formed by poits i the plae. for i =1 to for j =
More informationAnalysis Metrics. Intro to Algorithm Analysis. Slides. 12. Alg Analysis. 12. Alg Analysis
Itro to Algorithm Aalysis Aalysis Metrics Slides. Table of Cotets. Aalysis Metrics 3. Exact Aalysis Rules 4. Simple Summatio 5. Summatio Formulas 6. Order of Magitude 7. Big-O otatio 8. Big-O Theorems
More informationNew Fuzzy Color Clustering Algorithm Based on hsl Similarity
IFSA-EUSFLAT 009 New Fuzzy Color Clusterig Algorithm Based o hsl Similarity Vasile Ptracu Departmet of Iformatics Techology Tarom Compay Bucharest Romaia Email: patrascu.v@gmail.com Abstract I this paper
More informationFuzzy Membership Function Optimization for System Identification Using an Extended Kalman Filter
Fuzzy Membership Fuctio Optimizatio for System Idetificatio Usig a Eteded Kalma Filter Srikira Kosaam ad Da Simo Clevelad State Uiversity NAFIPS Coferece Jue 4, 2006 Embedded Cotrol Systems Research Lab
More informationAn Improved Shuffled Frog-Leaping Algorithm for Knapsack Problem
A Improved Shuffled Frog-Leapig Algorithm for Kapsack Problem Zhoufag Li, Ya Zhou, ad Peg Cheg School of Iformatio Sciece ad Egieerig Hea Uiversity of Techology ZhegZhou, Chia lzhf1978@126.com Abstract.
More informationCHAPTER IV: GRAPH THEORY. Section 1: Introduction to Graphs
CHAPTER IV: GRAPH THEORY Sectio : Itroductio to Graphs Sice this class is called Number-Theoretic ad Discrete Structures, it would be a crime to oly focus o umber theory regardless how woderful those topics
More informationSorting in Linear Time. Data Structures and Algorithms Andrei Bulatov
Sortig i Liear Time Data Structures ad Algorithms Adrei Bulatov Algorithms Sortig i Liear Time 7-2 Compariso Sorts The oly test that all the algorithms we have cosidered so far is compariso The oly iformatio
More informationA Very Simple Approach for 3-D to 2-D Mapping
A Very Simple Approach for -D to -D appig Sadipa Dey (1 Ajith Abraham ( Sugata Sayal ( Sadipa Dey (1 Ashi Software Private Limited INFINITY Tower II 10 th Floor Plot No. - 4. Block GP Salt Lake Electroics
More informationAlgorithms for Disk Covering Problems with the Most Points
Algorithms for Disk Coverig Problems with the Most Poits Bi Xiao Departmet of Computig Hog Kog Polytechic Uiversity Hug Hom, Kowloo, Hog Kog csbxiao@comp.polyu.edu.hk Qigfeg Zhuge, Yi He, Zili Shao, Edwi
More informationLecture 1: Introduction and Strassen s Algorithm
5-750: Graduate Algorithms Jauary 7, 08 Lecture : Itroductio ad Strasse s Algorithm Lecturer: Gary Miller Scribe: Robert Parker Itroductio Machie models I this class, we will primarily use the Radom Access
More informationAN OPTIMIZATION NETWORK FOR MATRIX INVERSION
397 AN OPTIMIZATION NETWORK FOR MATRIX INVERSION Ju-Seog Jag, S~ Youg Lee, ad Sag-Yug Shi Korea Advaced Istitute of Sciece ad Techology, P.O. Box 150, Cheogryag, Seoul, Korea ABSTRACT Iverse matrix calculatio
More informationA Polynomial Interval Shortest-Route Algorithm for Acyclic Network
A Polyomial Iterval Shortest-Route Algorithm for Acyclic Network Hossai M Akter Key words: Iterval; iterval shortest-route problem; iterval algorithm; ucertaity Abstract A method ad algorithm is preseted
More informationIMP: Superposer Integrated Morphometrics Package Superposition Tool
IMP: Superposer Itegrated Morphometrics Package Superpositio Tool Programmig by: David Lieber ( 03) Caisius College 200 Mai St. Buffalo, NY 4208 Cocept by: H. David Sheets, Dept. of Physics, Caisius College
More informationarxiv: v2 [cs.ds] 24 Mar 2018
Similar Elemets ad Metric Labelig o Complete Graphs arxiv:1803.08037v [cs.ds] 4 Mar 018 Pedro F. Felzeszwalb Brow Uiversity Providece, RI, USA pff@brow.edu March 8, 018 We cosider a problem that ivolves
More informationHash Tables. Presentation for use with the textbook Algorithm Design and Applications, by M. T. Goodrich and R. Tamassia, Wiley, 2015.
Presetatio for use with the textbook Algorithm Desig ad Applicatios, by M. T. Goodrich ad R. Tamassia, Wiley, 2015 Hash Tables xkcd. http://xkcd.com/221/. Radom Number. Used with permissio uder Creative
More informationA Boolean Query Processing with a Result Cache in Mediator Systems
A Boolea Query Processig with a Result Cache i Mediator Systems Jae-heo Cheog ad Sag-goo Lee * Departmet of Computer Sciece Seoul Natioal Uiversity Sa 56-1 Shillim-dog Kwaak-gu, Seoul Korea {cjh, sglee}cygus.su.ac.kr
More informationProperties and Embeddings of Interconnection Networks Based on the Hexcube
JOURNAL OF INFORMATION PROPERTIES SCIENCE AND AND ENGINEERING EMBEDDINGS OF 16, THE 81-95 HEXCUBE (2000) 81 Short Paper Properties ad Embeddigs of Itercoectio Networks Based o the Hexcube JUNG-SING JWO,
More information6.854J / J Advanced Algorithms Fall 2008
MIT OpeCourseWare http://ocw.mit.edu 6.854J / 18.415J Advaced Algorithms Fall 2008 For iformatio about citig these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 18.415/6.854 Advaced Algorithms
More informationChapter 1. Introduction to Computers and C++ Programming. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 1 Itroductio to Computers ad C++ Programmig Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 1.1 Computer Systems 1.2 Programmig ad Problem Solvig 1.3 Itroductio to C++ 1.4 Testig
More informationName of the Student: Unit I (Logic and Proofs) 1) Truth Table: Conjunction Disjunction Conditional Biconditional
SUBJECT NAME : Discrete Mathematics SUBJECT CODE : MA 2265 MATERIAL NAME : Formula Material MATERIAL CODE : JM08ADM009 (Sca the above QR code for the direct dowload of this material) Name of the Studet:
More informationChapter 9. Pointers and Dynamic Arrays. Copyright 2015 Pearson Education, Ltd.. All rights reserved.
Chapter 9 Poiters ad Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Overview 9.1 Poiters 9.2 Dyamic Arrays Copyright 2015 Pearso Educatio, Ltd.. All rights reserved. Slide 9-3
More informationConvergence results for conditional expectations
Beroulli 11(4), 2005, 737 745 Covergece results for coditioal expectatios IRENE CRIMALDI 1 ad LUCA PRATELLI 2 1 Departmet of Mathematics, Uiversity of Bologa, Piazza di Porta Sa Doato 5, 40126 Bologa,
More informationData-Driven Nonlinear Hebbian Learning Method for Fuzzy Cognitive Maps
Data-Drive Noliear Hebbia Learig Method for Fuzzy Cogitive Maps Wociech Stach, Lukasz Kurga, ad Witold Pedrycz Abstract Fuzzy Cogitive Maps (FCMs) are a coveiet tool for modelig of dyamic systems by meas
More informationComputational Geometry
Computatioal Geometry Chapter 4 Liear programmig Duality Smallest eclosig disk O the Ageda Liear Programmig Slides courtesy of Craig Gotsma 4. 4. Liear Programmig - Example Defie: (amout amout cosumed
More informationAlpha Individual Solutions MAΘ National Convention 2013
Alpha Idividual Solutios MAΘ Natioal Covetio 0 Aswers:. D. A. C 4. D 5. C 6. B 7. A 8. C 9. D 0. B. B. A. D 4. C 5. A 6. C 7. B 8. A 9. A 0. C. E. B. D 4. C 5. A 6. D 7. B 8. C 9. D 0. B TB. 570 TB. 5
More information