Proceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
|
|
- Emery Banks
- 5 years ago
- Views:
Transcription
1 Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed Non-Convex (DJRNC) Decision Regions: Part A - Properties, Model, and Simple Case CHE-CHERN LIN National Kaosiung Normal University Department of Industrial Tecnology Education 6 Ho Ping First Road, Kaosiung, TAIWAN, R.O.C. cclin@nknucc.nknu.edu.tw Abstract - Tis is a series of studies to discuss te partitioning capabilities of multi-layer perceptrons on dis-jointly removed non-convex (DJRNC) decision regions. Tere are two papers proposed in te series of studies including part A and part B. In part A, we propose a network structure to implement DJRNC decision regions using multi-layer perceptrons. In te proposed structure, all weigts and te parameters of te activation functions are pre-determined wen a DJRNC decision region is establised. No constructive algoritm is needed for implementing te DJRNC decision regions and eac weigt determined by tis paper is eiter or. Tis makes te ardware implementations of te proposed network structures easy. Tree cases are discussed in tis paper including single, nested, and disconnected decision regions. Te first case is sown in part A, and te rest of two are demonstrated in part B. We also provide tree multi-layer perceptrons to implement te tree decision regions and prove te implementation feasibilities of te proposed model Key-Words: - Multi-layer perceptron; Nested decision region; Non-convex decision region; Disconnected decision region.. Introduction A multi-perceptron is one of popular neural network structures for implementing classification problems. Adjustable weigts are used to connect te nodes between adjacent layers and optimized by training algoritms to get te desired classification results. However, using training algoritm to optimize te weigts probably needs tousands of iterations and ence spends a lot of computational time. Related studies about partitioning capabilities of multi-layer perceptrons on vertical and orizontal partitioning ave been discussed in [-4]. Te rest of studies on te partitioning capabilities of multi-layer perceptrons, see [5-3]. Te implementation feasibility of convex recursive deletion regions as been discussed in [9] were te autors proposed a constructive algoritm to determine te parameters (weigts and tresolds) of two layer perceptrons.to implement te convex recursive deletion decision regions. Non-convex decision regions are more complicated case. In tis paper, te autor presents a network structure to implement Dis-Jointly Removed Non-Convex (DJRNC) decision regions using multi-layer perceptrons. In te proposed structure, all weigts and te parameters of te activation functions are pre-determined wen a DJRNC decision region is establised. No constructive algoritm is needed for implementing te DJRNC decision regions and eac weigt determined by tis paper is eiter or. In te following, we present an illustrative example to explain ow a two-layer perceptron implements a convex decision region. For te visual reason, in tis paper we use two-dimensional examples. It is easy to generalize tem to multi-dimensional cases. Fig. (a) is a convex decision region containing a convex polyedron (C) wic is bounded by 5 yper-planes: z,, z 3, z 4, and z 5. In tis figure, te dotted rectangular box indicates te input space of te convex decision region were te saded area belongs to class A wile te blank area belongs to class B. We call te yper-planes bounding te convex polyedron bounding yper-planes. A bounding yper-plane divides te input space into two linearly separable alf yper-planes. Te side of a bounding yper-plane is te alf yper-plane containing te convex polyedron, and 0 side is te oter alf yper-plane, as indicated in Fig. (a). In a convex decision region, a pattern is said to be in te convex polyedron if and only if it is on te sides of all bounding yper-planes of te convex polyedron. It as been known tat a convex decision region can be implemented by a two-layer
2 Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, perceptron were te first layer forms te convex decision region and te second layer performs te classifications. Te first layer weigts are pre-determined wen te decision region is formed. Te second layer weigts are all s. We use a ard limiter as an activation function in te second layer node to get te desired classification results. Te ard limiter is of te form [, 8] if θ θ y= g( θ ) = () 0 if θ < θ wereθ is te tresold and set to be equal to te number of te bounding yper-planes of te convex polyedron. For example, te convex decision region sown in Fig. (a) can be implemented by te two-layer perceptron sown in Fig. (b) were te tresold ( θ ) of te ard limiter in te second layer is set to 5 since te convex polyedron is bounded by 5 bounding yper-planes (z to z 5 ). Nested convex decision region (or convex recursive deletion region) problems ave been solved by a constructive algoritm via two-layer perceptrons [5]. Next, we give some definitions necessary for te paper. A DJRNC polyedron D is a polyedron obtained by dis-jointly removing a series of convex polyedrons (C, C 2,, C n ) from an original convex polyedron (C 0 ), given by D= C0 C C 2 C n (2) were C 0 (te original convex polyedron) is called te minimum containing convex polyedron (MCCP) of D; C 0, C,, and C n are called te removed convex polyedrons (RCPs) of D. Te word dis-jointly means tat any two of te RCPs do not ave any common bounding yper-planes except for te bounding yper-planes of te MCCP. Fig. 2(a) sows a DJRNC polyedron (D) in a single DJRNC decision region (defined in te next section). Fig. 2(b) sows te MCCP and te tree RCPs of te DJRNC polyedron (RCP, RCP2, and RCP3). Fig. 2(c) demonstrates te bounding yper-planes of te MCCP and te tree RCPs. Te 0 sides and sides of tese bounding yper-planes are also displayed in Fig. 2(c). 2. Model and Feasibility 2. Single DJRNC decision region Model A single DJRNC decision region is a region containing only one DJRNC polyedron. Fig. 2 (a) is also an example of a single DJRNC decision region. A single DJRNC decision region can be implemented by a tree-layer perceptron were all of te parameters (weigts and tresolds) are constants. In te tree-layer perceptron, te first layer serves to form te decision region, te second layer detects weter a pattern resides in te MCCP or a particular RCP, and te tird layer makes te final classification. Eac node in te second layer is associated wit te MCCP or a particular RCP wit one-to-one correspondence. We use te same notation to present a node of te second layer and its corresponding MCCP or RCP. Te weigts of te second layer are all s. Eac of te tird layer weigts is determined as follows: if it is connecting te MCCP node wit te tird layer node, te weigts is set to ; if it is connecting any of te RCPs nodes wit te tird layer node, te weigt is set to. Te tresold for a particular node of te second layer is equal to te number of te bounding yper-planes of te MCCP or an RCP associated wit te particular node. Te tresold ( θ ) for te tird layer node (te output node) is. 2.2 Feasibility We prove te implementation feasibility by considering te following cases: () If te pattern doesn t reside in te MCCP, te final classification result is 0 (class B). (2) If te pattern resides in te DJRNC polyedron, only te MCCP node produces a. Te final classification result is (class A). (3) If te pattern resides in a particular RCP, bot te MCCP and te particular RCP produce s. Te weigt connecting te MCCP node wit te tird layer node is, and te weigt connecting te particular RCP wit te tird layer node is. Te sum of tem is 0. Terefore te final classification is 0 (class B). Fig. 3 is te tree-layer perceptron to implement te single DJRNC decision region sown in Fig. 2 (a). 3. Conclusions We proposed a neural network model to solve te DJRNC decision regions using multi-layer perceptrons. In te proposed multi-layer perceptrons, all weigts and te parameters of te activation functions are pre-determined wen a DJRNC decision region is establised. No constructive algoritm is needed for implementing te above tree decision regions. Eac weigt determined by
3 Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, tis paper is eiter or. We presented tree cases to discuss, in practical, te capabilities of multi-layer perceptrons on DJRNC decision regions including single, nested, and disconnected DJRNC decision regions. Tere are two papers proposed in te series of studies including part A and part B. In tis paper (part A), we defined single DJRNC decision regions and presented te implementing multi-layer perceptrons for te DJRNC decision regions. We also proved te implementation feasibility for te single DJRNC decision region. References [] C. Lin, Partitioning Capabilities of Multi-layer Perceptrons on Nested Rectangular Decision Regions Part I: Algoritm, WSEAS Transactions on Information Science and Applications, Issue 9, Volume 3, September, 2006, pp [2] C. Lin, Partitioning Capabilities of Multi-layer Perceptrons on Nested Rectangular Decision Regions Part II: Properties and Feasibility, WSEAS Transactions on Information Science and Applications, Issue 9, Volume 3, September, 2006, pp [3] C. Lin, Partitioning Capabilities of Multi-layer Perceptrons on Nested Rectangular Decision Regions Part III: Applications, WSEAS Transactions on Information Science and Applications, Issue 9, Volume 3, September, 2006, pp [4] C. Lin, A Constructive Algoritm to Implement Celled Decision Regions Using Two-Layer Perceptrons, WSEAS Transactions on Information Science and Applications, Issue 9, Volume 3, September, 2006, pp [5] J. Makoul, A. El-Jaroudi, R. Scwartz, Partitioning Capabilities of Two-layer Neural Networks, IEEE Trans. on Signal Processing, Vol. 39, No. 6, 99, pp [6] R. P. Lippmann, An Introduction to Computing wit Neural Nets, IEEE ASSP Mag., Vol.4, 987, pp [7] R. Sonkwiler, Separating te Vertices of N-cubes by Hyperplanes and its Application to Artificial Neural Networks, IEEE Trans. on Neural Networks, Vol. 4, No. 2, 993, pp [8] C. Lin, A. El-Jaroudi, An Algoritm to Determine te Feasibilities and Weigts of Two-Layer Perceptrons for Partitioning and Classification, Pattern Recognition, Vol. 3, No., 998, pp [9] C. Cabrelli, U. Molter, R. Sonkwiler, A Constructive Algoritm to Solve Convex recursive deletion (CoRD) Classification Problems via Two-layer Perceptron Networks, IEEE Trans. On Neural Networks, Vol., No 3, 2000, pp [0] W. Fan, L Zang, Applying SP-MLP to Complex Classification Problems, Pattern Recognition Letters, 2, 2000, pp [] V. Deolalikar, A Two-layer Paradigm Capable of Forming Arbitrary Decision Regions in Input Space, IEEE Trans. On Neural Networks, Vol. 3, No., 2002, pp [2] G. Huang, Y Cen, H. A. Babri, Classification Ability of Single Hidden Layer Feedforward Neural Networks, IEEE Trans. On Neural Networks, Vol., No. 3, 2000, pp [3] S. Dragici, Te Constraint Based Decomposition (CBD) Training Arcitecture, Neural Networks 4, 200, pp
4 Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, z =0 z z = z 5 z 5 =0 z 5 = z z 5 z 3 z 3 = Convex polyedron C z 3 =0 z 4 = z 4 z 4 =0 Te input space of te convex decision region z 3 z 4 (a) Te convex decision region. y Te second layer node (output node) tresold (θ ) = 5 Te second layer weigts z z 3 z 4 z 5 Te first layer nodes Te first layer weigts x x 2 Te inputs (b) Te two-layer perceptron to implement te convex decision region sown in (a). Fig. : An illustrative example of a convex decision region implemented by a two-layer perceptron.
5 Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, DJRNC polyedron D Te input space of te single DJRNC decision region (a) Te single DJRNC decision region RCP DJRNC polyedron D RCP2 RCP3 Te MCCP (te solid lines) (b) Te MCCP and te tree RCPs (RCP, RCP2, and RCP3) of DJRNC polyedron D. z z =0 z = =0 = z 6 = z 6 z 6 =0 z RCP z 7 = z z 7 =0 7 z 8 =0 z8 = z 8 DJRNC polyedron D z 5 z 5 = z 5=0 RCP2 z 9 = z 9 =0 z 9 z 5 z 3 z 3 = z 3 =0 z 0 z z 0 =0 z 0 = RCP3 z 3 z =0 z = z 4 (c) Te bounding yper-planes z 4 = z 4 =0 z 4 Fig. 2: An illustrative example of a single DJRNC decision region
6 Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, y Te 3 rd layer node (output node),θ = Te 3 rd layer weigts MCCP θ = 5 RCP θ = 3 RCP2 θ = 3 RCP3 θ = 3 Te 2 nd layer nodes Te 2 nd layer weigts z z 3 z 4 z 5 z 6 z 7 z 8 z 9 z 0 z Te st layer nodes Te st layer weigts x x 2 Te inputs Fig. 3: Te tree-layer perceptron to implement te single DJRNC decision region sown in Fig. 2(a).
Implementation Feasibility of Convex Recursive Deletion Regions Using Multi-Layer Perceptrons
Implementation Feasibility of Convex Recursive Deletion Regions Using Multi-Layer Perceptrons CHE-CHERN LIN National Kaohsiung Normal University Department of Industrial Technology Education 116 HePing
More informationSection 2.3: Calculating Limits using the Limit Laws
Section 2.3: Calculating Limits using te Limit Laws In previous sections, we used graps and numerics to approimate te value of a it if it eists. Te problem wit tis owever is tat it does not always give
More informationUnsupervised Learning for Hierarchical Clustering Using Statistical Information
Unsupervised Learning for Hierarcical Clustering Using Statistical Information Masaru Okamoto, Nan Bu, and Tosio Tsuji Department of Artificial Complex System Engineering Hirosima University Kagamiyama
More informationMore on Functions and Their Graphs
More on Functions and Teir Graps Difference Quotient ( + ) ( ) f a f a is known as te difference quotient and is used exclusively wit functions. Te objective to keep in mind is to factor te appearing in
More information2.8 The derivative as a function
CHAPTER 2. LIMITS 56 2.8 Te derivative as a function Definition. Te derivative of f(x) istefunction f (x) defined as follows f f(x + ) f(x) (x). 0 Note: tis differs from te definition in section 2.7 in
More informationTwo Modifications of Weight Calculation of the Non-Local Means Denoising Method
Engineering, 2013, 5, 522-526 ttp://dx.doi.org/10.4236/eng.2013.510b107 Publised Online October 2013 (ttp://www.scirp.org/journal/eng) Two Modifications of Weigt Calculation of te Non-Local Means Denoising
More informationMATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2
MATH 5a Spring 2018 READING ASSIGNMENTS FOR CHAPTER 2 Note: Tere will be a very sort online reading quiz (WebWork) on eac reading assignment due one our before class on its due date. Due dates can be found
More informationMulti-Stack Boundary Labeling Problems
Multi-Stack Boundary Labeling Problems Micael A. Bekos 1, Micael Kaufmann 2, Katerina Potika 1 Antonios Symvonis 1 1 National Tecnical University of Atens, Scool of Applied Matematical & Pysical Sciences,
More informationBounding Tree Cover Number and Positive Semidefinite Zero Forcing Number
Bounding Tree Cover Number and Positive Semidefinite Zero Forcing Number Sofia Burille Mentor: Micael Natanson September 15, 2014 Abstract Given a grap, G, wit a set of vertices, v, and edges, various
More informationHaar Transform CS 430 Denbigh Starkey
Haar Transform CS Denbig Starkey. Background. Computing te transform. Restoring te original image from te transform 7. Producing te transform matrix 8 5. Using Haar for lossless compression 6. Using Haar
More informationVector Processing Contours
Vector Processing Contours Andrey Kirsanov Department of Automation and Control Processes MAMI Moscow State Tecnical University Moscow, Russia AndKirsanov@yandex.ru A.Vavilin and K-H. Jo Department of
More information4.1 Tangent Lines. y 2 y 1 = y 2 y 1
41 Tangent Lines Introduction Recall tat te slope of a line tells us ow fast te line rises or falls Given distinct points (x 1, y 1 ) and (x 2, y 2 ), te slope of te line troug tese two points is cange
More informationAll truths are easy to understand once they are discovered; the point is to discover them. Galileo
Section 7. olume All truts are easy to understand once tey are discovered; te point is to discover tem. Galileo Te main topic of tis section is volume. You will specifically look at ow to find te volume
More information12.2 Investigate Surface Area
Investigating g Geometry ACTIVITY Use before Lesson 12.2 12.2 Investigate Surface Area MATERIALS grap paper scissors tape Q U E S T I O N How can you find te surface area of a polyedron? A net is a pattern
More informationSymmetric Tree Replication Protocol for Efficient Distributed Storage System*
ymmetric Tree Replication Protocol for Efficient Distributed torage ystem* ung Cune Coi 1, Hee Yong Youn 1, and Joong up Coi 2 1 cool of Information and Communications Engineering ungkyunkwan University
More informationClassify solids. Find volumes of prisms and cylinders.
11.4 Volumes of Prisms and Cylinders Essential Question How can you find te volume of a prism or cylinder tat is not a rigt prism or rigt cylinder? Recall tat te volume V of a rigt prism or a rigt cylinder
More information3.6 Directional Derivatives and the Gradient Vector
288 CHAPTER 3. FUNCTIONS OF SEVERAL VARIABLES 3.6 Directional Derivatives and te Gradient Vector 3.6.1 Functions of two Variables Directional Derivatives Let us first quickly review, one more time, te
More information, 1 1, A complex fraction is a quotient of rational expressions (including their sums) that result
RT. Complex Fractions Wen working wit algebraic expressions, sometimes we come across needing to simplify expressions like tese: xx 9 xx +, xx + xx + xx, yy xx + xx + +, aa Simplifying Complex Fractions
More informationVOLUMES. The volume of a cylinder is determined by multiplying the cross sectional area by the height. r h V. a) 10 mm 25 mm.
OLUME OF A CYLINDER OLUMES Te volume of a cylinder is determined by multiplying te cross sectional area by te eigt. r Were: = volume r = radius = eigt Exercise 1 Complete te table ( =.14) r a) 10 mm 5
More informationMean Waiting Time Analysis in Finite Storage Queues for Wireless Cellular Networks
Mean Waiting Time Analysis in Finite Storage ueues for Wireless ellular Networks J. YLARINOS, S. LOUVROS, K. IOANNOU, A. IOANNOU 3 A.GARMIS 2 and S.KOTSOOULOS Wireless Telecommunication Laboratory, Department
More informationTraffic Sign Classification Using Ring Partitioned Method
Traffic Sign Classification Using Ring Partitioned Metod Aryuanto Soetedjo and Koici Yamada Laboratory for Management and Information Systems Science, Nagaoa University of Tecnology 603- Kamitomioamaci,
More informationTHE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM
THE POSSIBILITY OF ESTIMATING THE VOLUME OF A SQUARE FRUSTRUM USING THE KNOWN VOLUME OF A CONICAL FRUSTRUM SAMUEL OLU OLAGUNJU Adeyemi College of Education NIGERIA Email: lagsam04@aceondo.edu.ng ABSTRACT
More informationCHAPTER 7: TRANSCENDENTAL FUNCTIONS
7.0 Introduction and One to one Functions Contemporary Calculus 1 CHAPTER 7: TRANSCENDENTAL FUNCTIONS Introduction In te previous capters we saw ow to calculate and use te derivatives and integrals of
More information4.2 The Derivative. f(x + h) f(x) lim
4.2 Te Derivative Introduction In te previous section, it was sown tat if a function f as a nonvertical tangent line at a point (x, f(x)), ten its slope is given by te it f(x + ) f(x). (*) Tis is potentially
More informationYou Try: A. Dilate the following figure using a scale factor of 2 with center of dilation at the origin.
1 G.SRT.1-Some Tings To Know Dilations affect te size of te pre-image. Te pre-image will enlarge or reduce by te ratio given by te scale factor. A dilation wit a scale factor of 1> x >1enlarges it. A dilation
More information19.2 Surface Area of Prisms and Cylinders
Name Class Date 19 Surface Area of Prisms and Cylinders Essential Question: How can you find te surface area of a prism or cylinder? Resource Locker Explore Developing a Surface Area Formula Surface area
More informationTHANK YOU FOR YOUR PURCHASE!
THANK YOU FOR YOUR PURCHASE! Te resources included in tis purcase were designed and created by me. I ope tat you find tis resource elpful in your classroom. Please feel free to contact me wit any questions
More informationAnnouncements SORTING. Prelim 1. Announcements. A3 Comments 9/26/17. This semester s event is on Saturday, November 4 Apply to be a teacher!
Announcements 2 "Organizing is wat you do efore you do someting, so tat wen you do it, it is not all mixed up." ~ A. A. Milne SORTING Lecture 11 CS2110 Fall 2017 is a program wit a teac anyting, learn
More informationRECONSTRUCTING OF A GIVEN PIXEL S THREE- DIMENSIONAL COORDINATES GIVEN BY A PERSPECTIVE DIGITAL AERIAL PHOTOS BY APPLYING DIGITAL TERRAIN MODEL
IV. Évfolyam 3. szám - 2009. szeptember Horvát Zoltán orvat.zoltan@zmne.u REONSTRUTING OF GIVEN PIXEL S THREE- DIMENSIONL OORDINTES GIVEN Y PERSPETIVE DIGITL ERIL PHOTOS Y PPLYING DIGITL TERRIN MODEL bsztrakt/bstract
More informationSORTING 9/26/18. Prelim 1. Prelim 1. Why Sorting? InsertionSort. Some Sorting Algorithms. Tonight!!!! Two Sessions:
Prelim 1 2 "Organizing is wat you do efore you do someting, so tat wen you do it, it is not all mixed up." ~ A. A. Milne SORTING Tonigt!!!! Two Sessions: You sould now y now wat room to tae te final. Jenna
More informationANTENNA SPHERICAL COORDINATE SYSTEMS AND THEIR APPLICATION IN COMBINING RESULTS FROM DIFFERENT ANTENNA ORIENTATIONS
NTNN SPHRICL COORDINT SSTMS ND THIR PPLICTION IN COMBINING RSULTS FROM DIFFRNT NTNN ORINTTIONS llen C. Newell, Greg Hindman Nearfield Systems Incorporated 133. 223 rd St. Bldg. 524 Carson, C 9745 US BSTRCT
More informationLinear Interpolating Splines
Jim Lambers MAT 772 Fall Semester 2010-11 Lecture 17 Notes Tese notes correspond to Sections 112, 11, and 114 in te text Linear Interpolating Splines We ave seen tat ig-degree polynomial interpolation
More informationIntroduction to Computer Graphics 5. Clipping
Introduction to Computer Grapics 5. Clipping I-Cen Lin, Assistant Professor National Ciao Tung Univ., Taiwan Textbook: E.Angel, Interactive Computer Grapics, 5 t Ed., Addison Wesley Ref:Hearn and Baker,
More informationInvestigating an automated method for the sensitivity analysis of functions
Investigating an automated metod for te sensitivity analysis of functions Sibel EKER s.eker@student.tudelft.nl Jill SLINGER j..slinger@tudelft.nl Delft University of Tecnology 2628 BX, Delft, te Neterlands
More informationSome Handwritten Signature Parameters in Biometric Recognition Process
Some Handwritten Signature Parameters in Biometric Recognition Process Piotr Porwik Institute of Informatics, Silesian Uniersity, Bdziska 39, 41- Sosnowiec, Poland porwik@us.edu.pl Tomasz Para Institute
More information( ) ( ) Mat 241 Homework Set 5 Due Professor David Schultz. x y. 9 4 The domain is the interior of the hyperbola.
Mat 4 Homework Set 5 Due Professor David Scultz Directions: Sow all algebraic steps neatly and concisely using proper matematical symbolism. Wen graps and tecnology are to be implemented, do so appropriately.
More informationA Cost Model for Distributed Shared Memory. Using Competitive Update. Jai-Hoon Kim Nitin H. Vaidya. Department of Computer Science
A Cost Model for Distributed Sared Memory Using Competitive Update Jai-Hoon Kim Nitin H. Vaidya Department of Computer Science Texas A&M University College Station, Texas, 77843-3112, USA E-mail: fjkim,vaidyag@cs.tamu.edu
More information2 The Derivative. 2.0 Introduction to Derivatives. Slopes of Tangent Lines: Graphically
2 Te Derivative Te two previous capters ave laid te foundation for te study of calculus. Tey provided a review of some material you will need and started to empasize te various ways we will view and use
More informationSection 1.2 The Slope of a Tangent
Section 1.2 Te Slope of a Tangent You are familiar wit te concept of a tangent to a curve. Wat geometric interpretation can be given to a tangent to te grap of a function at a point? A tangent is te straigt
More informationFast Calculation of Thermodynamic Properties of Water and Steam in Process Modelling using Spline Interpolation
P R E P R N T CPWS XV Berlin, September 8, 008 Fast Calculation of Termodynamic Properties of Water and Steam in Process Modelling using Spline nterpolation Mattias Kunick a, Hans-Joacim Kretzscmar a,
More informationCoarticulation: An Approach for Generating Concurrent Plans in Markov Decision Processes
Coarticulation: An Approac for Generating Concurrent Plans in Markov Decision Processes Kasayar Roanimanes kas@cs.umass.edu Sridar Maadevan maadeva@cs.umass.edu Department of Computer Science, University
More information12.2 TECHNIQUES FOR EVALUATING LIMITS
Section Tecniques for Evaluating Limits 86 TECHNIQUES FOR EVALUATING LIMITS Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing tecnique to evaluate its of
More information13.5 DIRECTIONAL DERIVATIVES and the GRADIENT VECTOR
13.5 Directional Derivatives and te Gradient Vector Contemporary Calculus 1 13.5 DIRECTIONAL DERIVATIVES and te GRADIENT VECTOR Directional Derivatives In Section 13.3 te partial derivatives f x and f
More informationA Practical Approach of Selecting the Edge Detector Parameters to Achieve a Good Edge Map of the Gray Image
Journal of Computer Science 5 (5): 355-362, 2009 ISSN 1549-3636 2009 Science Publications A Practical Approac of Selecting te Edge Detector Parameters to Acieve a Good Edge Map of te Gray Image 1 Akram
More informationDensity Estimation Over Data Stream
Density Estimation Over Data Stream Aoying Zou Dept. of Computer Science, Fudan University 22 Handan Rd. Sangai, 2433, P.R. Cina ayzou@fudan.edu.cn Ziyuan Cai Dept. of Computer Science, Fudan University
More informationDesign of PSO-based Fuzzy Classification Systems
Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp. 6370 (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology,
More information12.2 Techniques for Evaluating Limits
335_qd /4/5 :5 PM Page 863 Section Tecniques for Evaluating Limits 863 Tecniques for Evaluating Limits Wat ou sould learn Use te dividing out tecnique to evaluate its of functions Use te rationalizing
More informationAuthor's personal copy
Autor's personal copy Information Processing Letters 09 (009) 868 875 Contents lists available at ScienceDirect Information Processing Letters www.elsevier.com/locate/ipl Elastic tresold-based admission
More informationCESILA: Communication Circle External Square Intersection-Based WSN Localization Algorithm
Sensors & Transducers 2013 by IFSA ttp://www.sensorsportal.com CESILA: Communication Circle External Square Intersection-Based WSN Localization Algoritm Sun Hongyu, Fang Ziyi, Qu Guannan College of Computer
More informationMTH-112 Quiz 1 - Solutions
MTH- Quiz - Solutions Words in italics are for eplanation purposes onl (not necessar to write in te tests or. Determine weter te given relation is a function. Give te domain and range of te relation. {(,
More informationClassification of Osteoporosis using Fractal Texture Features
Classification of Osteoporosis using Fractal Texture Features V.Srikant, C.Dines Kumar and A.Tobin Department of Electronics and Communication Engineering Panimalar Engineering College Cennai, Tamil Nadu,
More informationFault Localization Using Tarantula
Class 20 Fault localization (cont d) Test-data generation Exam review: Nov 3, after class to :30 Responsible for all material up troug Nov 3 (troug test-data generation) Send questions beforeand so all
More informationUtilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks
Utilizing Call Admission Control to Derive Optimal Pricing of Multiple Service Classes in Wireless Cellular Networks Okan Yilmaz and Ing-Ray Cen Computer Science Department Virginia Tec {oyilmaz, ircen}@vt.edu
More informationThe (, D) and (, N) problems in double-step digraphs with unilateral distance
Electronic Journal of Grap Teory and Applications () (), Te (, D) and (, N) problems in double-step digraps wit unilateral distance C Dalfó, MA Fiol Departament de Matemàtica Aplicada IV Universitat Politècnica
More informationAn Algorithm for Loopless Deflection in Photonic Packet-Switched Networks
An Algoritm for Loopless Deflection in Potonic Packet-Switced Networks Jason P. Jue Center for Advanced Telecommunications Systems and Services Te University of Texas at Dallas Ricardson, TX 75083-0688
More informationAn Effective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Chiming Huang and Rei-Heng Cheng
An ffective Sensor Deployment Strategy by Linear Density Control in Wireless Sensor Networks Ciming Huang and ei-heng Ceng 5 De c e mbe r0 International Journal of Advanced Information Tecnologies (IJAIT),
More informationAn Interactive X-Ray Image Segmentation Technique for Bone Extraction
An Interactive X-Ray Image Segmentation Tecnique for Bone Extraction Cristina Stolojescu-Crisan and Stefan Holban Politenica University of Timisoara V. Parvan 2, 300223 Timisoara, Romania {cristina.stolojescu@etc.upt.ro
More informationThe Euler and trapezoidal stencils to solve d d x y x = f x, y x
restart; Te Euler and trapezoidal stencils to solve d d x y x = y x Te purpose of tis workseet is to derive te tree simplest numerical stencils to solve te first order d equation y x d x = y x, and study
More informationHASH ALGORITHMS: A DESIGN FOR PARALLEL CALCULATIONS
HASH ALGORITHMS: A DESIGN FOR PARALLEL CALCULATIONS N.G.Bardis Researc Associate Hellenic Ministry of te Interior, Public Administration and Decentralization 8, Dragatsaniou str., Klatmonos S. 0559, Greece
More informationNotes: Dimensional Analysis / Conversions
Wat is a unit system? A unit system is a metod of taking a measurement. Simple as tat. We ave units for distance, time, temperature, pressure, energy, mass, and many more. Wy is it important to ave a standard?
More informationHidden Layer Training via Hessian Matrix Information
Hidden Layer Training ia Hessian atrix Information Cangua Yu, icael T. anry, Jiang Li Department of Electrical Engineering Uniersity of Texas at Arlington, TX 7609 E-mail: cangua_yu@uta.edu; manry@uta.edu;
More informationPYRAMID FILTERS BASED ON BILINEAR INTERPOLATION
PYRAMID FILTERS BASED ON BILINEAR INTERPOLATION Martin Kraus Computer Grapics and Visualization Group, Tecnisce Universität Müncen, Germany krausma@in.tum.de Magnus Strengert Visualization and Interactive
More informationComputing geodesic paths on manifolds
Proc. Natl. Acad. Sci. USA Vol. 95, pp. 8431 8435, July 1998 Applied Matematics Computing geodesic pats on manifolds R. Kimmel* and J. A. Setian Department of Matematics and Lawrence Berkeley National
More informationwrobot k wwrobot hrobot (a) Observation area Horopter h(θ) (Virtual) horopters h(θ+ θ lim) U r U l h(θ+ θ) Base line Left camera Optical axis
Selective Acquisition of 3-D Information Enoug for Finding Passable Free Spaces Using an Active Stereo Vision System Atsusi Nisikawa, Atsusi Okubo, and Fumio Miyazaki Department of Systems and Human Science
More informationPiecewise Polynomial Interpolation, cont d
Jim Lambers MAT 460/560 Fall Semester 2009-0 Lecture 2 Notes Tese notes correspond to Section 4 in te text Piecewise Polynomial Interpolation, cont d Constructing Cubic Splines, cont d Having determined
More informationAn Explicit Formula for Generalized Arithmetic-Geometric Sum
Applied Matematical Sciences, Vol. 9, 2015, no. 114, 5687-5696 HIKARI Ltd, www.m-ikari.com ttp://dx.doi.org/10.12988/ams.2015.57481 An Explicit Formula for Generalized Aritmetic-Geometric Sum Roberto B.
More informationThe impact of simplified UNBab mapping function on GPS tropospheric delay
Te impact of simplified UNBab mapping function on GPS troposperic delay Hamza Sakidin, Tay Coo Cuan, and Asmala Amad Citation: AIP Conference Proceedings 1621, 363 (2014); doi: 10.1063/1.4898493 View online:
More informationReal-Time Wireless Routing for Industrial Internet of Things
Real-Time Wireless Routing for Industrial Internet of Tings Cengjie Wu, Dolvara Gunatilaka, Mo Sa, Cenyang Lu Cyber-Pysical Systems Laboratory, Wasington University in St. Louis Department of Computer
More information8/6/2010 Assignment Previewer
Week 4 Friday Homework (1321979) Question 1234567891011121314151617181920 1. Question DetailsSCalcET6 2.7.003. [1287988] Consider te parabola y 7x - x 2. (a) Find te slope of te tangent line to te parabola
More informationDesign of a Pipelined Architecture for Ray/Bézier Patch Intersection Computation
esign of a Pipelined Arcitecture for Ray/Bézier Patc Intersection Computation Robert R. Lewis Renwei ang onald Hung Scool of EECS Scool of EECS ept. of Computer Engineering asington State University asington
More informationSoftware Fault Prediction using Machine Learning Algorithm Pooja Garg 1 Mr. Bhushan Dua 2
IJSRD - International Journal for Scientific Researc & Development Vol. 3, Issue 04, 2015 ISSN (online): 2321-0613 Software Fault Prediction using Macine Learning Algoritm Pooja Garg 1 Mr. Busan Dua 2
More informationRedundancy Awareness in SQL Queries
Redundancy Awareness in QL Queries Bin ao and Antonio Badia omputer Engineering and omputer cience Department University of Louisville bin.cao,abadia @louisville.edu Abstract In tis paper, we study QL
More informationOptimal In-Network Packet Aggregation Policy for Maximum Information Freshness
1 Optimal In-etwork Packet Aggregation Policy for Maimum Information Fresness Alper Sinan Akyurek, Tajana Simunic Rosing Electrical and Computer Engineering, University of California, San Diego aakyurek@ucsd.edu,
More informationGeorge Xylomenos and George C. Polyzos. with existing protocols and their eæciency in terms of
IP MULTICASTING FOR WIRELESS MOBILE OSTS George Xylomenos and George C. Polyzos fxgeorge,polyzosg@cs.ucsd.edu Computer Systems Laboratory Department of Computer Science and Engineering University of California,
More informationChapter K. Geometric Optics. Blinn College - Physics Terry Honan
Capter K Geometric Optics Blinn College - Pysics 2426 - Terry Honan K. - Properties of Ligt Te Speed of Ligt Te speed of ligt in a vacuum is approximately c > 3.0µ0 8 mês. Because of its most fundamental
More informationA Novel QC-LDPC Code with Flexible Construction and Low Error Floor
A Novel QC-LDPC Code wit Flexile Construction and Low Error Floor Hanxin WANG,2, Saoping CHEN,2,CuitaoZHU,2 and Kaiyou SU Department of Electronics and Information Engineering, Sout-Central University
More informationAnnouncements. Lilian s office hours rescheduled: Fri 2-4pm HW2 out tomorrow, due Thursday, 7/7. CSE373: Data Structures & Algorithms
Announcements Lilian s office ours resceduled: Fri 2-4pm HW2 out tomorrow, due Tursday, 7/7 CSE373: Data Structures & Algoritms Deletion in BST 2 5 5 2 9 20 7 0 7 30 Wy migt deletion be arder tan insertion?
More informationWrap up Amortized Analysis; AVL Trees. Riley Porter Winter CSE373: Data Structures & Algorithms
CSE 373: Data Structures & Wrap up Amortized Analysis; AVL Trees Riley Porter Course Logistics Symposium offered by CSE department today HW2 released, Big- O, Heaps (lecture slides ave pseudocode tat will
More informationBrief Contributions. A Hybrid Flash File System Based on NOR and NAND Flash Memories for Embedded Devices 1 INTRODUCTION
1002 IEEE TRANSACTIONS ON COMPUTERS, VOL. 57, NO. 7, JULY 2008 Brief Contributions A Hybrid Flas File System Based on NOR and NAND Flas Memories for Embedded Devices Cul Lee, Student Member, IEEE, Sung
More informationOn the Use of Radio Resource Tests in Wireless ad hoc Networks
Tecnical Report RT/29/2009 On te Use of Radio Resource Tests in Wireless ad oc Networks Diogo Mónica diogo.monica@gsd.inesc-id.pt João Leitão jleitao@gsd.inesc-id.pt Luis Rodrigues ler@ist.utl.pt Carlos
More informationAreas of Triangles and Parallelograms. Bases of a parallelogram. Height of a parallelogram THEOREM 11.3: AREA OF A TRIANGLE. a and its corresponding.
11.1 Areas of Triangles and Parallelograms Goal p Find areas of triangles and parallelograms. Your Notes VOCABULARY Bases of a parallelogram Heigt of a parallelogram POSTULATE 4: AREA OF A SQUARE POSTULATE
More informationHaptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages
Haptic Rendering of Topological Constraints to Users Manipulating Serial Virtual Linkages Daniela Constantinescu and Septimiu E Salcudean Electrical & Computer Engineering Department University of Britis
More informationAnalytical CHEMISTRY
ISSN : 974-749 Grap kernels and applications in protein classification Jiang Qiangrong*, Xiong Zikang, Zai Can Department of Computer Science, Beijing University of Tecnology, Beijing, (CHINA) E-mail:
More informationAsynchronous Power Flow on Graphic Processing Units
1 Asyncronous Power Flow on Grapic Processing Units Manuel Marin, Student Member, IEEE, David Defour, and Federico Milano, Senior Member, IEEE Abstract Asyncronous iterations can be used to implement fixed-point
More informationNetwork Coding to Enhance Standard Routing Protocols in Wireless Mesh Networks
Downloaded from vbn.aau.dk on: April 7, 09 Aalborg Universitet etwork Coding to Enance Standard Routing Protocols in Wireless Mes etworks Palevani, Peyman; Roetter, Daniel Enrique Lucani; Fitzek, Frank;
More informationTilings of rectangles with T-tetrominoes
Tilings of rectangles wit T-tetrominoes Micael Korn and Igor Pak Department of Matematics Massacusetts Institute of Tecnology Cambridge, MA, 2139 mikekorn@mit.edu, pak@mat.mit.edu August 26, 23 Abstract
More informationImplementation of Integral based Digital Curvature Estimators in DGtal
Implementation of Integral based Digital Curvature Estimators in DGtal David Coeurjolly 1, Jacques-Olivier Lacaud 2, Jérémy Levallois 1,2 1 Université de Lyon, CNRS INSA-Lyon, LIRIS, UMR5205, F-69621,
More informationOn Calibrating a Camera Network Using Parabolic Trajectories of a Bouncing Ball
On Calibrating a Camera Network Using Parabolic rajectories of a ouncing all Kuan-Wen Cen, Yi-Ping Hung,, Yong-Seng Cen 3 Department of Computer Science and Information Engineering, National aiwan Uniersity,
More informationCS 234. Module 6. October 25, CS 234 Module 6 ADT Dictionary 1 / 22
CS 234 Module 6 October 25, 2016 CS 234 Module 6 ADT Dictionary 1 / 22 Case study Problem: Find a way to store student records for a course, wit unique IDs for eac student, were records can be accessed,
More informationTraffic Pattern-based Adaptive Routing for Intra-group Communication in Dragonfly Networks
Traffic Pattern-based Adaptive Routing for Intra-group Communication in Dragonfly Networks Peyman Faizian, Md Safayat Raman, Md Atiqul Molla, Xin Yuan Department of Computer Science Florida State University
More informationDraXRouter: Global Routing in X-Architecture with Dynamic Resource Assignment*
DraXRouter: Global Routing in X-Arcitecture wit Dynamic Resource Assignment* Zen Cao 1, Tong Jing 1, Yu Hu 2, Yiyu Si 2, Xianlong Hong 1, Xiaodong Hu 3, Guiying Yan 3 1 Computer Science & Tecnology Department
More informationAlternating Direction Implicit Methods for FDTD Using the Dey-Mittra Embedded Boundary Method
Te Open Plasma Pysics Journal, 2010, 3, 29-35 29 Open Access Alternating Direction Implicit Metods for FDTD Using te Dey-Mittra Embedded Boundary Metod T.M. Austin *, J.R. Cary, D.N. Smite C. Nieter Tec-X
More information1.4 RATIONAL EXPRESSIONS
6 CHAPTER Fundamentals.4 RATIONAL EXPRESSIONS Te Domain of an Algebraic Epression Simplifying Rational Epressions Multiplying and Dividing Rational Epressions Adding and Subtracting Rational Epressions
More informationMinimizing Memory Access By Improving Register Usage Through High-level Transformations
Minimizing Memory Access By Improving Register Usage Troug Hig-level Transformations San Li Scool of Computer Engineering anyang Tecnological University anyang Avenue, SIGAPORE 639798 Email: p144102711@ntu.edu.sg
More informationData Structures and Programming Spring 2014, Midterm Exam.
Data Structures and Programming Spring 2014, Midterm Exam. 1. (10 pts) Order te following functions 2.2 n, log(n 10 ), 2 2012, 25n log(n), 1.1 n, 2n 5.5, 4 log(n), 2 10, n 1.02, 5n 5, 76n, 8n 5 + 5n 2
More informationCSCE476/876 Spring Homework 5
CSCE476/876 Spring 2016 Assigned on: Friday, Marc 11, 2016 Due: Monday, Marc 28, 2016 Homework 5 Programming assignment sould be submitted wit andin Te report can eiter be submitted wit andin as a PDF,
More informationCS211 Spring 2004 Lecture 06 Loops and their invariants. Software engineering reason for using loop invariants
CS211 Spring 2004 Lecture 06 Loops and teir invariants Reading material: Tese notes. Weiss: Noting on invariants. ProgramLive: Capter 7 and 8 O! Tou ast damnale iteration and art, indeed, ale to corrupt
More informationA UPnP-based Decentralized Service Discovery Improved Algorithm
Indonesian Journal of Electrical Engineering and Informatics (IJEEI) Vol.1, No.1, Marc 2013, pp. 21~26 ISSN: 2089-3272 21 A UPnP-based Decentralized Service Discovery Improved Algoritm Yu Si-cai*, Wu Yan-zi,
More informationand installation instructions Power Converter DLU 02
Always read te operating and installation instructions before start-up! Work on automatic burner control systems may only be carried out by trained specialist personnel! Operating and installation instructions
More informationNumerical solution of hybrid fuzzy differential equations by fuzzy neural network
Available online at ttp://ijimsrbiauacir/ Int J Industrial Matematics (ISSN 2008-5621) Vol 6, No 2, 2014 Article ID IJIM-00371, 15 pages Researc Article Numerical solution of ybrid fuzzy differential equations
More information