Design of PSO-based Fuzzy Classification Systems
|
|
- Alannah Owens
- 6 years ago
- Views:
Transcription
1 Tamkang Journal of Science and Engineering, Vol. 9, No 1, pp (006) 63 Design of PSO-based Fuzzy Classification Systems Cia-Cong Cen Department of Electronics Engineering, Wufeng Institute of Tecnology, Ciayi, Taiwan 61, R.O.C. Abstract In tis paper, a metod based on te particle swarm optimization (PSO) is proposed for pattern classification to select a fuzzy classification system wit an appropriate number of fuzzy rules so tat te number of incorrectly classified patterns is minimized. In te PSO-based metod, eac individual in te population is considered to automatically generate a fuzzy classification system for an M-class classification problem. Subsequently, a fitness function is defined to guide te searc procedure to select an appropriate fuzzy classification system suc tat te number of fuzzy rules and te number of incorrectly classified patterns are simultaneously minimized. Finally, two classification problems are utilized to illustrate te effectiveness of te proposed PSO-based approac. Key Words: Particle Swarm Optimization, Fuzzy Classification System, Pattern Classification 1. Introduction *Corresponding autor. cccen@mail.wfc.edu.tw Fuzzy rule-based systems ave been successfully applied to solve many classification problems. In many classification problems, fuzzy classification rules are derived from uman experts as linguistic knowledge. Because it is not usually easy to derive fuzzy rules from uman experts, many approaces ave recently been proposed to generate fuzzy rules automatically from te training patterns of te considered classification problem [35,7,8,13]. In order to generate fuzzy rules from training patterns, fuzzy partition in te input space are generally considered to determine te premise part of a fuzzy classification system. Te grid-type fuzzy partition of te input space [3,4,7,9,11,13] and te scatter-type fuzzy partition of te input data [8,10] ave been often used to model fuzzy systems for training patterns. In [3], a euristic metod for generating fuzzy rules is applied to te grid-type fuzzy partitions, and a rule selection metod, based on genetic algoritms, is ten employed to select te relevant fuzzy rules from te generated fuzzy rules for classifying te training patterns in te considered classification problem. However, tis approac to solving classification problems wit ig-dimensional pattern spaces as a significant sortcoming: te number of fuzzy rules becomes enormous as te number of dimensions increases and te learning time for genetic algoritms is too ig. Furtermore, an adaptive grid partition in te input space is used to design te ANFIS-based fuzzy classifier in [4]. Tis approac takes te uniformly partitioned grid as te initial state. Te grid evolves as te parameters in te premise membersip functions are adjusted. However, te adaptive grid-partition sceme as two problems. First, te number of fuzzy sets for eac input variable is predetermined in advance. Second, te learning complexity suffers from an exponential explosion as te number of inputs increases. In te scatter partition for constructing fuzzy classifiers, fuzzy minmax yperbox classifiers are powerful tools for solving classification problems. Simpson [8] proposed a metod for generating te yperbox regions to construct a fuzzy classifier to te considered classification problem. In tis approac to te classification problem, te learning parameter is very critical, since it directly affects te number and position of te resulting yperboxes. Consequently, it influences te structure of te fuzzy classifier and te classification performance so tat tis approac suffers from a ig sensitivity of te classification accu-
2 64 Cia-Cong Cen racy wit respect to te skill of te user to determine te appropriate learning parameter. Besides, te fixed learning parameter of te above approac to fuzzy min-max yperbox classifier makes te same constraint on coverage resolution in te wole input space so tat some small yperboxes are generated even in te input space far from class boundaries. Tis reduces te generalization capability of te fuzzy min-max yperbox classifier. In tis paper, a metod based on te particle swarm optimization (PSO), called a PSO-based metod, is implemented to select an appropriate fuzzy classification system suc tat a low number of training patterns are misclassified by te selected fuzzy classification system. In te PSO-based approac, eac individual in te population is considered to represent a fuzzy classification system. Ten, a fitness function is implemented to guide te searc procedure to select an appropriate fuzzy classification system suc tat te number of fuzzy rules and te number of incorrectly classified patterns are simultaneously minimized. Te rest of tis paper is organized as follows. Section describes te structure of te fuzzy classification system. Section 3 proposes a PSO-based metod to select an appropriate fuzzy classification system for te considered classification problem. Section 4 considers classification problems of a syntetic data set and te Iris data set to illustrate te learning ability and te generalization ability of te proposed approac, respectively. Finally, Section 5 draws conclusions about te proposed approac to solving te classification problem.. Structure of Fuzzy Classification Systems Wen an M-class classification problem is considered, a rule base of a fuzzy classification system can be expressed as follows [3]: j t rule: If x1 is Aj1 and x is Aj and and xm is Ajm, Ten x ( x1, x,, xm) belongs to Class H j wit CF CFj, j 1,,, R, (1) were R is te number of fuzzy rules in te rule base, A ji, i = 1,,,m, are te premise fuzzy sets of te j-t fuzzy rule, H j {1,,,M}, is te consequent class output of te j-t fuzzy rule, and CF j [0,1] is te grade of certainty of te j-t fuzzy rule. In tis paper, te membersip function of te fuzzy set A ji is described by ( m, m, m ; x ) Aji ( ji,1) ( ji,) ( ji,3) i xi m ( ji,1) exp, if xi m( ji,1), m ( ji,) xi m ( ji,1) exp m ( ji,3), if x m, ( ji,1) () i1 were m (ji,1), m (ji,) and m (ji,3) determine te center position, te left and rigt widt values of te membersip function, respectively. Hence, te sape of te membersip function is determined by a parameter vector m ji = [m (ji,1) m (ji,) m (ji,3) ]. Te j-t fuzzy rule in te rule base is determined by a parameter vector r j =[m j1 m j mjm ]. Consequently, te set of parameters in te premise part of te rule base is defined as r =[r 1 r rr ]. According to (1), te set of parameters in te consequent part of te rule base is defined as a =[H 1 CF 1 H CF HR CF R ]. Wen te input x =(x 1, x,,x m ) is given, te firing strengt of te premise of te j-t rule is calculated by M q j (x)= Aji (x i ). Te class output of te fuzzy classification system wit respect to te input x can be determined by R y arg max q ( x) CF j1 j (3) According to te above description, eac parameter set consisting of te premise and consequent parameters determines a fuzzy classification system. Tus, different parameter sets determine different fuzzy classification systems so tat te generated fuzzy classification systems ave different performances. Te goal of tis paper is to find an appropriate fuzzy classification system to minimize bot of te number of incorrectly classified patterns and te number of fuzzy rules. In te next section, te PSO-based metod is applied to select an appropriate fuzzy classification system wit a low number of fuzzy rules suc tat te number of incorrectly classified patterns is minimized. 3. PSO-Based Fuzzy Classification Systems j Te PSO is an evolutionary computation tecnique i
3 Design of PSO-based Fuzzy Classification Systems 65 proposed by Kennedy and Eberart [,6]. Its development was based on observations of te social beavior of animals suc as bird flocking, fis scooling, and swarm teory. Like te GA, te PSO is initialized wit a population of random solutions. It also requires only te information about te fitness values of te individuals in te population. Tis differs from many optimization metods requiring te derivation information or te complete knowledge of te problem structure and parameter. Compared wit te GA, te PSO as memory so tat te information of good solutions is retained by all individuals. Furtermore, it as constructive cooperation between individuals, individuals in te population sare information between tem. In te PSO-based metod, eac individual is represented to determine a fuzzy classification system. Te individual is used to partition te input space so tat te rule number and te premise part of te generated fuzzy classification system are determined. Subsequently, te consequent parameters of te corresponding fuzzy system are obtained by te premise fuzzy sets of te generated fuzzy classification system. A set of L individuals, P, called population, is expressed in te following: p r 1 1 g 1 p r g P p r g p r L L g L (4) In order to evolutionarily determine te parameters of te fuzzy classification system, te individual p contains two parameter vectors: r and g. Tat is, p =[r g ]. Te parameter vector r =[r 1 r rj rb ] consists of te premise parameters of te candidate fuzzy rules, were B is a user-defined positive integer to decide te maximum number of fuzzy rules in te rule base generated by te individual p. Here, r j =[m j1 m j mji m jm ] is te parameter vector to determine te membersip functions of te j-t fuzzy rule, were m ji =[m (ji,1) m (ji,) m (ji,3)] is te parameter vector to determine te membersip function for te i-t input variable. Te parameter vector g =[g 1 g gj gb ] is used to select te fuzzy rules from te candidate rules r =[r 1 r rj rb ] so tat te fuzzy rule base is generated. g j [0,1] decides weter te j-t candidate rule r j is added to te rule base of te generated fuzzy system or not. If g j 0.5, ten te j-t candidate rule r j is added to te rule base. Consequently, te total number of g j (j = 1,,,B) wose value is greater tan or equal to 0.5 is te number of fuzzy rules in te generated rule base. In order to generate te rule base, te index j of g j (j = 1,,,B) wose value is greater tan or equal to 0.5 is defined as I r {1,,,B}, r = 1,,,r, were r represents te number of te fuzzy rules in te generated rule base. { r, I r 1 I,, r,, I r } generates te premise part of te fuzzy r Ir rule base generated by te individual p =[r g ]. For example, assume tat r and g are denoted as [r 1 r r 3 r 4 r 5 r 6 ] and [ ], respectively. According to g, te generated rule base as tree fuzzy rules and {I 1, I, I 3 } = {,3,6} so tat {r r 3 r 6 } determines te premise part of te generated rule base. Consequently, te rule base of te generated fuzzy classification system is described as follows: r t rule : If x1 is A and x 1 is A and and x, Ir Ir m is AIrm Ten x ( x1, x,, xm) belongs to Class Hr wit CF CFr, r 1,,, r, (5) were A i = 1,, I,,m, are te fuzzy sets of te generated r-t fuzzy rule. Te membersip function associ- r i ated wit te fuzzy set is described as follows: A I r i ( m, m, m ; x ) A ( Iri,1) ( Iri,) ( Iri,3) i Ir i xi m ( Ir i,1) exp if xi m ( Ir i,1) m ( Ir i,),, xi m ( Ir i,1) exp, if xi m, ( Ir i,1) m ( Ir i,3) (6) Consequently, te individual p determines te premise part of te generated fuzzy classification system. Assume tat N training patterns (x n, y n ), n = 1,,,N, are gatered from te observation of te considered M-class classification problem, were x n =(x n1, x n,, x nm ) is te input vector of te n-t training pattern
4 66 Cia-Cong Cen and y n {1,,,M} is te corresponding class output. In order to determine te consequent parameters H r and CF r of te r-t fuzzy rule, a procedure is described as follows [3]: Step 1. Calculate t, t=1,,,m for te r-t fuzzy rule as follows: Step. Determine H r for te r-t fuzzy rule by (7) (8) Step 3. Determine te grade of certainty CF r of te r-t fuzzy rule by were t r p xpclasst H r CF r q ( x ), t 1,,, M. M arg max. M t1 thr H r M t1 t1 t t. M 1 t (9) (10) Tus, te consequent parameters of te generated fuzzy classification system are determined by te above procedure. According to te above description, eac individual corresponds to a fuzzy classification system. In order to construct a fuzzy classification system wic as an appropriate number of fuzzy rules and minimize incorrectly classified patterns simultaneously, te fitness function is defined as follows: f fit( p ) g ( p ) g ( p ) 1 (11) were f is te fitness value of te individual p, g 1 (p ) and g (p ) are defined respectively as follows: NICP( p ) g1( p ) exp e and ( ) exp r g. p r (1) (13) Here, NICP(p ) is te number of incorrectly classified patterns, r is te number of fuzzy rules in te rule base of te generated fuzzy classification system, and e and r are user-defined constants for te fitness function. Consequently, te fitness function is designed to deal wit te tradeoff between te number of incorrectly classified patterns and te number of fuzzy rules. In tis way, as te fitness function value increases as muc as possible based on te guidance of te proposed fitness function, te fuzzy classification system corresponding to te individual will satisfy te desired objective as well as possible. Tat is, te selected fuzzy system as a low number of rules and a low number of incorrectly classified patterns simultaneously. Subsequently, a PSO-based metod is proposed to find an appropriate individual so tat te corresponding fuzzy classification system as te desired performance. Te procedure is described as follows: Step 1. Initialize te PSO-based metod. (a) Set te number of individuals (L), te maximum number of rules (B), te number of generations (K), te constants for te fitness function ( e and r ) and te constants for te PSO algoritm (, d 1,d,c 1, and c ). (b) Generate randomly initial population P. Eac individual of te population is expressed as follows: p =[r g ], (14) were r = [m (11,1) m (11,) m (11,3) m (1m,1) m (1m,) m (1m,3) m (B1,1) m (B1,) m (B1,3) m (Bm,1) m (Bm,) m (Bm,3)] and g =[g 1 g gb ]. m (ji,k), j {1,,,B}, i {1,,,M}, k {1,,3}, is randomly generated as follows: m m ( m m ) rand(), min max min ( ji, k ) ( ji, k ) ( ji, k ) ( ji, k ) (15) were te range of te parameter m (ji,k) is defined min max as [ m( ji, k ), m( ji, k )] and rand() is a uniformly distributed random numbers in [0,1]. g j [0,1], j {1,,,B}, is randomly generated as follows: g j = rand(). (16) (c) Generate randomly initial velocity vectors, = 1,,,L. Eac velocity vector is expressed as follows:
5 Design of PSO-based Fuzzy Classification Systems 67 =[ ], (17) p p v, 1,,, L. (1) were = [ (11,1) (11,) (11,3) (1m,1) (1m,) (1m,3) (B1,1) (B1,) (B1,3) (Bm,1) (Bm,) (Bm,3)] and = [ 1 B ]. (ji,k), j {1,,,B}, i {1,,,M}, k {1,,3}, is randomly generated as follows: m m max min ( ji, k ) ( ji, k ) ( ji, k ) rand(). 0 (18) j,j{1,,,b} is randomly generated as follows: j rand(). 0 (19) Step. Calculate te fitness value of eac individual and set initial p, f for eac individual and initial p best, f best for te initial population. (a) f = fit (p ), = 1,,...,L, Set f = f, p = p, = 1,,...,L. (b) Find te index J of te individual wit te best fitness J arg max L f. 1 Set f best = f J, p beat = p J. (c) Set gen = 1. Step 3. Update te vector g =[g 1 g g j gb ], {1,,,L}, as follows: If rand (), ten g j* =1g j*, were j* =round (B rand () + 0.5). round (B rand () + 0.5) rounds B rand () to te nearest integer. Step 4. Update p, f, and p best, f best. (a)update p, f in te following: Calculate f = fit(p ), if f > f ' ',, ten f = f, p = p, = 1,,,L, (b)update p best, f best in te following: ' If f > f best, ten f best = f ',p best = p, = 1,,,L. Step 5. Update te velocity vector v and te parameter vector p. (a) Update te velocity vectors in te following: 1 best ' v v c rand() ( p p ) c rand() ( p p ), 1,,, L. (b) Update te parameter vectors in te following: (0) Step 6. Decrease and by te constants d 1 [0,1] and d [0,1], respectively. v, 1,,,, vd1 L * d. () (3) Step 7. gen = gen+1, if gen > K ten go to Step 8; oterwise go to Step 3. Step 8. Based on te individual p best =[r best g best ] wit te best fitness f best, te desired fuzzy classification system can be determined. Eac g is randomly updated by Step 3 so tat te fuzzy classification system generated by te individual p as an appropriate number of fuzzy rules for te considered classification problem. Te adjustment by Step 5 is conceptually similar to te mutation operator utilized by te genetic algoritm. Eac individual p keeps track of its own best solution, wic is associated wit te best fitness f ', it as acieved so far in a vector p. Furtermore, te best solution among all te individuals obtained so far in te population is kept track of as te vector p best associated wit te global best fitness f best.according to Step 5, eac parameter vector p is assigned wit a randomized velocity vector according to its own and its companions flying experiences so tat te vector p searces around its best vector p and te global best vector p best. Te adjustment toward p and p best by Step 5 is conceptually similar to te crossover operator utilized by te genetic algoritm. Consequently, te parameter vector p is updated by te PSO so tat te fuzzy classification system generated by te individual p as an appropriate number of rules and a low number of incorrectly classified patterns simultaneously. 4. Simulation Results In tis section, a syntetic data set and te Iris data set are employed to examine te learning ability and te generalization ability of te proposed PSO-based fuzzy classification system, respectively. Example 1. A syntetic data set In tis example, a syntetic data set containing of tree clusters of various sizes, sapes and orientations
6 68 Cia-Cong Cen [1] is utilized to examine te learning ability of te proposed PSO-based fuzzy classification system. Te total number of patterns in tis data set is 579. Figure 1 sows te data set wit a mixture of sperical and ellipsoidal clusters. Following te proposed metod, simulation results of te proposed approac to classifying tis data set is sown in Figure, were te initial conditions for te proposed metod in Example 1 are given in te following: Te number of individuals: L = 100, te maximum number of rules: B = 0, te number of generations: K = 50, te range of m (j1,1), j {1,,,0} : [0,1], te range of m (j1,), j {1,,,0} : [0.05,0.5], te range of m (j1,3), j {1,,,0} : [0.05,0.5], te range of m (j,1), j {1,,0} : [0,1], te range of m (j,), j {1,,,0} : [0.05,0.5], te range of m (j,3), j {1,,,0} : [0.05, 0.5], te constants for te fitness function: { e, r }= {5,10} and te constants for te PSO: {, c 1,c,d 1,d }= {1,1,1,0.75,0.75}. Te rule base of te selected fuzzy classification system as four rules suc tat te number of incorrectly classified patterns is zero. Te parameters of te selected fuzzy classification system are sown in Table 1. From simulation results of tis example, it is clear te proposed PSO-based metod can select significant fuzzy rules to construct a fuzzy classification suc tat te number of incorrectly classified patterns are minimized. Example. Iris data set Te Iris data set [1] contains 150 patterns wit four features, tat belong to tree classes (Iris Setosa, Iris Versicolour and Iris Virginica). Te four features are te sepal lengt in cm, te sepal widt in cm, te petal lengt in cm and te petal widt in cm. Te data set contains tree classes, eac of 50 patterns; eac class refers to a type of iris plant. One class is linearly separable from te oter two; te latter are not linearly separable from eac oter. In tis example, te two-fold cross validation (CV) is employed to examine te generalization ability of te proposed approac to classifying te iris data. In te CV procedure, te Iris data are separated into two subsets of te same size. Tat is, eac subset consists of Table 1. Parameters of te selected fuzzy classification system by te proposed PSO-based metod in Example 1 j m (j1,1) m (j1,) m (j1,3) m (j,1) m (j,) m (j,3) H j CF j Figure 1. A syntetic data set wit a mixture of sperical and ellipsoidal clusters in Example 1. Figure. Simulation results of te proposed PSO-based metod for te syntetic data set in Example 1.
7 Design of PSO-based Fuzzy Classification Systems 69 Table. Simulation results of te proposed PSO-based metod for te Iris data set using CV metod in Example Average classification rate on training patterns Average classification rate on test patterns Average number of fuzzy rules 98.87% 96.8% 4.75 Table 3. Generalization ability for test patterns in te Iris data classification using te same CV metod Metod Average classification rate on test patterns Average number of fuzzy rules Pruning % 8.00 Multi-rule-table % GA-based % Proposed metod % patterns. One subset is used as training patterns to construct a fuzzy classification system by te proposed approac. Te oter subset is used as test patterns to evaluate te generated fuzzy classification system. Te same training-and-testing procedure is also followed after te roles of te subsets are excanged wit eac oter. Te above procedure is iterated 0 times using different partitions of te 150 patterns into two subsets for calculating te average classification rates on tese data. Te initial conditions for te proposed metod in Example are given in te following: Te number of individuals: L = 100, te maximum number of rules: B = 100, te number of generations: K = 50, te range of m (j1,1), j {1,,,0} : [4.4,7.7], te range of m (j1,), j {1,,, 0} : [0.1,1.65], te range of m (j1,3), j {1,,,0} : [0.1,1.65], te range of m (j,1), j {1,,,0} : [,4.4], te range of m (j,), j {1,,,0} : [0.1,1.], te range of m (j,3), j {1,,,0} : [0.1,1.], te range of m (j3,1), j {1,,,0} : [1.,6.7], te range of m (j3,), j {1,,, 0} : [0.1,.75], te range of m (j3,3), j {1,,,0} : [0.1,.75], te range of m (j4,1), j {1,,,0} : [0.1,.5], te range of m (j4,), j {1,,,0} : [0.1,1.], te range of m (j4,3), j {1,,,0} : [0.1,1.], te constants for te fitness function: { e, r } = {5,10} and te constants for te PSO: {,c 1,c,d 1,d } = {1,1,1,0.75,0.75}. Te average number of fuzzy rules of te selected fuzzy classification systems and te average classification rates on training patterns and test patterns are summarized in Table. Table 3 compares our results wit te results in [7] for te classification of te Iris data using te same CV metod. From simulation results for te Iris data set, it is obvious tat te proposed PSO-based fuzzy classification system as ig generalization ability for te classification problem of te Iris data set. 5. Conclusions A PSO-based metod is proposed to design an appropriate fuzzy classification system for pattern classification. In te proposed approac, eac individual p consists of two parameter vectors: r and g Te parameter vector g is updated so tat te generated fuzzy classification system as an appropriate number of fuzzy rules. Te parameter vector r is updated so tat te premise part of te generated fuzzy classification system as appropriate membersip functions for te considered classification problem. Ten, te obtained premise fuzzy sets are used to determine te consequent parameters of te corresponding fuzzy classification system. Consequently, eac individual corresponds to a fuzzy classification system. Subsequently, a fitness function is defined to guide te searcing procedure to select a fuzzy classification system wit te desired performance. Te simulation results sow tat te selected fuzzy classification system not only as an appropriate number of rules for te considered classification problem but also as a low number of incorrectly classified patterns. Acknowledgement Tis researc was supported in part by te National Science Council of te Republic of Cina under contract NSC References [1] Blake, C., Keog, E. and Merz, C. J., UCI Repository of Macine Learning Database, Univ. California, Irvine (1998). ttp:// [] Eberart, R. and Kennedy, J., A New Optimizer Using Particle Swarm Teory, Proc. Int. Sym. Micro Macine and Human Science, Nagoya Japan, Oct., pp (1995).
8 70 Cia-Cong Cen [3] Isibuci, H., Nozaki, K., Yamamoto, N. and Tanaka, H., Selecting Fuzzy If-Ten Rules for Classification Problems Using Genetic Algoritms, IEEE Trans. Fuzzy Systems, Vol. 3, pp (1995). [4] Jang, J. S., ANFIS: Adaptive-Network-Based Fuzzy Inference systems, IEEE Trans. on Systems, Man and Cybernetics, Vol. 3, pp (1993). [5] Jang, J. S., Sun, C. T. and Mizutani, E., Neuro-Fuzzy and Soft Computing, Prentice Hall, New Jersey, U.S.A. (1997). [6] Kennedy, J. and Eberart, R., Particle Swarm Optimization, Proc. IEEE Int. Conf. Neural Networks, Pert, Australia, pp (1995). [7] Nozaki, K., Isibuci, H. and Tanaka, H., Adaptive Fuzzy Rule-Based Classification Systems, IEEE Trans. on Fuzzy Systems, Vol. 4, No. 3, Aug., pp (1996). [8] Simpson, P. K., Fuzzy Min-Max Neural Networks- Part 1: Classification, IEEE Trans. Neural Networks, Vol. 3, Sep., pp (199). [9] Wang, L. X. and Mendel, J. M., Generating Fuzzy Rules by Learning from Examples, IEEE Trans. on Systems, Man and Cybernetics, Vol., pp (199). [10] Wong, C. C. and Cen, C. C., A Hybrid Clustering and Gradient Descent Approac for Fuzzy Modeling, IEEE Trans. on Systems, Man and Cybernetics-Part B: Cybernetics, Vol. 9, pp (1999). [11] Wong, C. C. and Cen, C. C., A GA-Based Metod for Constructing Fuzzy Systems Directly from Numerical Data, IEEE Trans. on Systems, Man and Cybernetics-Part B: Cybernetics, Vol. 30, pp (000). [1] Wong, C. C., Cen, C. C. and Su, M. C., A Novel Algoritm for Data Clustering, Pattern Recognition, Vol. 34, pp (001). [13] Yager, R. R. and Filev, D. P. Essentials of Fuzzy Modeling and Control, Jon Wiley, New York, U.S.A. (1994). Manuscript Received: Apr. 7, 005 Accepted: Jul. 13, 005
Takagi-Sugeno Fuzzy System Accuracy Improvement with A Two Stage Tuning
International Journal of Computing and Digital Systems ISSN (2210-142X) Int. J. Com. Dig. Sys. 4, No.4 (Oct-2015) Takagi-Sugeno Fuzzy System Accuracy Improvement with A Two Stage Tuning Hassan M. Elragal
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 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 informationComparison of the Efficiency of the Various Algorithms in Stratified Sampling when the Initial Solutions are Determined with Geometric Method
International Journal of Statistics and Applications 0, (): -0 DOI: 0.9/j.statistics.000.0 Comparison of te Efficiency of te Various Algoritms in Stratified Sampling wen te Initial Solutions are Determined
More informationApplication of Or-based Rule Antecedent Fuzzy Neural Networks to Iris Data Classification Problem
Vol.1 (DTA 016, pp.17-1 http://dx.doi.org/10.157/astl.016.1.03 Application of Or-based Rule Antecedent Fuzzy eural etworks to Iris Data Classification roblem Chang-Wook Han Department of Electrical Engineering,
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 informationA Bidirectional Subsethood Based Similarity Measure for Fuzzy Sets
A Bidirectional Subsetood Based Similarity Measure for Fuzzy Sets Saily Kabir Cristian Wagner Timoty C. Havens and Derek T. Anderson Intelligent Modelling and Analysis (IMA) Group and Lab for Uncertainty
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 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 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 informationResearch Article Applications of PCA and SVM-PSO Based Real-Time Face Recognition System
Hindawi Publising Corporation atematical Problems in Engineering, Article ID 530251, 12 pages ttp://dx.doi.org/10.1155/2014/530251 Researc Article Applications of PCA and SV-PSO Based Real-Time Face Recognition
More informationLEARNING WEIGHTS OF FUZZY RULES BY USING GRAVITATIONAL SEARCH ALGORITHM
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 4, April 2013 pp. 1593 1601 LEARNING WEIGHTS OF FUZZY RULES BY USING GRAVITATIONAL
More informationArgha Roy* Dept. of CSE Netaji Subhash Engg. College West Bengal, India.
Volume 3, Issue 3, March 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Training Artificial
More informationA Multi-objective Genetic-based Method for Design Fuzzy Classification Systems
IJCSNS International Journal of Computer Science and Network Security, VOL.6 No.8A, August 6 A Multi-obective Genetic-based Method for Design Fuzzy Classification Systems Chen Ji-lin, Hou Yuan-long, Xing
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 informationTraffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization
Traffic Signal Control Based On Fuzzy Artificial Neural Networks With Particle Swarm Optimization J.Venkatesh 1, B.Chiranjeevulu 2 1 PG Student, Dept. of ECE, Viswanadha Institute of Technology And Management,
More informationEconomic design of x control charts considering process shift distributions
J Ind Eng Int (2014) 10:163 171 DOI 10.1007/s40092-014-0086-2 ORIGINAL RESEARCH Economic design of x control carts considering process sift distributions Vijayababu Vommi Rukmini V. Kasarapu Received:
More informationMulti-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art
Multi-Objective Particle Swarm Optimizers: A Survey of te State-of-te-Art Margarita Reyes-Sierra and Carlos A. Coello Coello CINVESTAV-IPN (Evolutionary Computation Group) Electrical Engineering Department,
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 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 informationA signature analysis based method for elliptical shape
A signature analysis based metod for elliptical sape Ivana Guarneri, Mirko Guarnera, Giuseppe Messina and Valeria Tomaselli STMicroelectronics - AST Imaging Lab, Stradale rimosole 50, Catania, Italy ABSTRACT
More informationProceedings of the 8th WSEAS International Conference on Neural Networks, Vancouver, British Columbia, Canada, June 19-21,
Proceedings of te 8t WSEAS International Conference on Neural Networks, Vancouver, Britis Columbia, Canada, June 9-2, 2007 3 Neural Network Structures wit Constant Weigts to Implement Dis-Jointly Removed
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 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 informationImage Registration via Particle Movement
Image Registration via Particle Movement Zao Yi and Justin Wan Abstract Toug fluid model offers a good approac to nonrigid registration wit large deformations, it suffers from te blurring artifacts introduced
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 informationTuning MAX MIN Ant System with off-line and on-line methods
Université Libre de Bruxelles Institut de Recerces Interdisciplinaires et de Développements en Intelligence Artificielle Tuning MAX MIN Ant System wit off-line and on-line metods Paola Pellegrini, Tomas
More informationAn Efficient Method for Extracting Fuzzy Classification Rules from High Dimensional Data
Published in J. Advanced Computational Intelligence, Vol., No., 997 An Efficient Method for Extracting Fuzzy Classification Rules from High Dimensional Data Stephen L. Chiu Rockwell Science Center 049
More informationOur Calibrated Model has No Predictive Value: An Example from the Petroleum Industry
Our Calibrated Model as No Predictive Value: An Example from te Petroleum Industry J.N. Carter a, P.J. Ballester a, Z. Tavassoli a and P.R. King a a Department of Eart Sciences and Engineering, Imperial
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 informationImproving the Wang and Mendel s Fuzzy Rule Learning Method by Inducing Cooperation Among Rules 1
Improving the Wang and Mendel s Fuzzy Rule Learning Method by Inducing Cooperation Among Rules 1 J. Casillas DECSAI, University of Granada 18071 Granada, Spain casillas@decsai.ugr.es O. Cordón DECSAI,
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 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 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 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 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 informationA New Approach for Handling the Iris Data Classification Problem
International Journal of Applied Science and Engineering 2005. 3, : 37-49 A New Approach for Handling the Iris Data Classification Problem Shyi-Ming Chen a and Yao-De Fang b a Department of Computer Science
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 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 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 informationUUV DEPTH MEASUREMENT USING CAMERA IMAGES
ABCM Symposium Series in Mecatronics - Vol. 3 - pp.292-299 Copyrigt c 2008 by ABCM UUV DEPTH MEASUREMENT USING CAMERA IMAGES Rogerio Yugo Takimoto Graduate Scool of Engineering Yokoama National University
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 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 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 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 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 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 informationSoft sensor modelling by time difference, recursive partial least squares and adaptive model updating
Soft sensor modelling by time difference, recursive partial least squares adaptive model updating Y Fu 1, 2, W Yang 2, O Xu 1, L Zou 3, J Wang 4 1 Zijiang College, Zejiang University of ecnology, Hangzou
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 informationEuropean Journal of Science and Engineering Vol. 1, Issue 1, 2013 ADAPTIVE NEURO-FUZZY INFERENCE SYSTEM IDENTIFICATION OF AN INDUCTION MOTOR
ADAPTIVE NEURO-FUZZY INFERENCE SYSTEM IDENTIFICATION OF AN INDUCTION MOTOR Ahmed A. M. Emam College of Engineering Karrary University SUDAN ahmedimam1965@yahoo.co.in Eisa Bashier M. Tayeb College of Engineering
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 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 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 informationHybrid PSO-SA algorithm for training a Neural Network for Classification
Hybrid PSO-SA algorithm for training a Neural Network for Classification Sriram G. Sanjeevi 1, A. Naga Nikhila 2,Thaseem Khan 3 and G. Sumathi 4 1 Associate Professor, Dept. of CSE, National Institute
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 informationHybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques
Hybrid Particle Swarm-Based-Simulated Annealing Optimization Techniques Nasser Sadati Abstract Particle Swarm Optimization (PSO) algorithms recently invented as intelligent optimizers with several highly
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 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 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 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 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 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 informationA TWO-LEVEL COEVOLUTIONARY APPROACH TO MULTIDIMENSIONAL PATTERN CLASSIFICATION PROBLEMS. Ki-Kwang Lee and Wan Chul Yoon
Proceedings of the 2005 International Conference on Simulation and Modeling V. Kachitvichyanukul, U. Purintrapiban, P. Utayopas, eds. A TWO-LEVEL COEVOLUTIONARY APPROACH TO MULTIDIMENSIONAL PATTERN CLASSIFICATION
More informationA Statistical Approach for Target Counting in Sensor-Based Surveillance Systems
Proceedings IEEE INFOCOM A Statistical Approac for Target Counting in Sensor-Based Surveillance Systems Dengyuan Wu, Decang Cen,aiXing, Xiuzen Ceng Department of Computer Science, Te George Wasington University,
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 informationIntegrating Constraints and Metric Learning in Semi-Supervised Clustering
Integrating Constraints and Metric Learning in Semi-Supervised Clustering Mikail Bilenko MBILENKO@CS.UTEXAS.EDU Sugato Basu SUGATO@CS.UTEXAS.EDU Raymond J. Mooney MOONEY@CS.UTEXAS.EDU Department of Computer
More informationPedestrian Detection Algorithm for On-board Cameras of Multi View Angles
Pedestrian Detection Algoritm for On-board Cameras of Multi View Angles S. Kamijo IEEE, K. Fujimura, and Y. Sibayama Abstract In tis paper, a general algoritm for pedestrian detection by on-board monocular
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 informationCell-to-switch assignment in. cellular networks. barebones particle swarm optimization
Cell-to-switch assignment in cellular networks using barebones particle swarm optimization Sotirios K. Goudos a), Konstantinos B. Baltzis, Christos Bachtsevanidis, and John N. Sahalos RadioCommunications
More informationMean Shifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy.
Mean Sifting Gradient Vector Flow: An Improved External Force Field for Active Surfaces in Widefield Microscopy. Margret Keuper Cair of Pattern Recognition and Image Processing Computer Science Department
More informationExperimental Studies on SMT-based Debugging
Experimental Studies on SMT-based Debugging Andre Sülflow Görscwin Fey Rolf Drecsler Institute of Computer Science University of Bremen 28359 Bremen, Germany {suelflow,fey,drecsle}@informatik.uni-bremen.de
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 2, Issue 9, September 2012 ISSN: 2277 128X International Journal of Advanced Researc in Computer Science and Software Engineering Researc Paper Available online at: www.ijarcsse.com Performance
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 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 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 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 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 informationReconfiguration Optimization for Loss Reduction in Distribution Networks using Hybrid PSO algorithm and Fuzzy logic
Bulletin of Environment, Pharmacology and Life Sciences Bull. Env. Pharmacol. Life Sci., Vol 4 [9] August 2015: 115-120 2015 Academy for Environment and Life Sciences, India Online ISSN 2277-1808 Journal
More informationREVERSIBLE DATA HIDING USING IMPROVED INTERPOLATION TECHNIQUE
International Researc Journal of Engineering and Tecnology (IRJET) e-issn: 2395-0056 REVERSIBLE DATA HIDING USING IMPROVED INTERPOLATION TECHNIQUE Devendra Kumar 1, Dr. Krisna Raj 2 (Professor in ECE Department
More informationSimulation of Back Propagation Neural Network for Iris Flower Classification
American Journal of Engineering Research (AJER) e-issn: 2320-0847 p-issn : 2320-0936 Volume-6, Issue-1, pp-200-205 www.ajer.org Research Paper Open Access Simulation of Back Propagation Neural Network
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 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 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 informationSearch-aware Conditions for Probably Approximately Correct Heuristic Search
Searc-aware Conditions for Probably Approximately Correct Heuristic Searc Roni Stern Ariel Felner Information Systems Engineering Ben Gurion University Beer-Seva, Israel 85104 roni.stern@gmail.com, felner@bgu.ac.il
More informationCT79 SOFT COMPUTING ALCCS-FEB 2014
Q.1 a. Define Union, Intersection and complement operations of Fuzzy sets. For fuzzy sets A and B Figure Fuzzy sets A & B The union of two fuzzy sets A and B is a fuzzy set C, written as C=AUB or C=A OR
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 informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Spring
Has-Based Indexes Capter 11 Comp 521 Files and Databases Spring 2010 1 Introduction As for any index, 3 alternatives for data entries k*: Data record wit key value k
More informationTwo-Level Iterative Queuing Modeling of Software Contention
Two-Level Iterative Queuing Modeling of Software Contention Daniel A. Menascé Dept. of Computer Science George Mason University www.cs.gmu.edu/faculty/menasce.tml 2002 D. Menascé. All Rigts Reserved. 1
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 informationGenetic Tuning for Improving Wang and Mendel s Fuzzy Database
Proceedings of the 2009 IEEE International Conference on Systems, Man, and Cybernetics San Antonio, TX, USA - October 2009 Genetic Tuning for Improving Wang and Mendel s Fuzzy Database E. R. R. Kato, O.
More informationFuzzy Modeling using Vector Quantization with Supervised Learning
Fuzzy Modeling using Vector Quantization with Supervised Learning Hirofumi Miyajima, Noritaka Shigei, and Hiromi Miyajima Abstract It is known that learning methods of fuzzy modeling using vector quantization
More informationExtended Synchronization Signals for Eliminating PCI Confusion in Heterogeneous LTE
1 Extended Syncronization Signals for Eliminating PCI Confusion in Heterogeneous LTE Amed H. Zaran Department of Electronics and Electrical Communications Cairo University Egypt. azaran@eecu.cu.edu.eg
More informationIntroduction to Artificial Intelligence
Introduction to Artificial Intelligence COMP307 Machine Learning 2: 3-K Techniques Yi Mei yi.mei@ecs.vuw.ac.nz 1 Outline K-Nearest Neighbour method Classification (Supervised learning) Basic NN (1-NN)
More informationarxiv: v1 [cs.cv] 4 Aug 2016
UnitBox: An Advanced Object Detection Network Jiaui Yu 1,2 Yuning Jiang 2 Zangyang Wang 1 Zimin Cao 2 Tomas Huang 1 1 University of Illinois at Urbana Campaign 2 Megvii Inc {jyu79, zwang119, t-uang1}@illinois.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 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 informationNOTES: A quick overview of 2-D geometry
NOTES: A quick overview of 2-D geometry Wat is 2-D geometry? Also called plane geometry, it s te geometry tat deals wit two dimensional sapes flat tings tat ave lengt and widt, suc as a piece of paper.
More informationHash-Based Indexes. Chapter 11. Comp 521 Files and Databases Fall
Has-Based Indexes Capter 11 Comp 521 Files and Databases Fall 2012 1 Introduction Hasing maps a searc key directly to te pid of te containing page/page-overflow cain Doesn t require intermediate page fetces
More informationCHAPTER The elevation can be determined as. The partial derivatives can be evaluated,
1 CHAPTER 14 14.1 Te elevation can be determined as (.8,1. (.81. 1.5(1. 1.5(.8 Te partial derivatives can be evaluated,.5 (1..5(.8.4 1.5 4 (.8 1.5 4(1. 1.7 (1. 5 5.4 wic can be used to determine te gradient
More informationFeature weighting using particle swarm optimization for learning vector quantization classifier
Journal of Physics: Conference Series PAPER OPEN ACCESS Feature weighting using particle swarm optimization for learning vector quantization classifier To cite this article: A Dongoran et al 2018 J. Phys.:
More information