Big Data Analysis and Reporting with Decision Tree Induction

Size: px
Start display at page:

Download "Big Data Analysis and Reporting with Decision Tree Induction"

Transcription

1 Big Data Analysis and Reporting with Deision Tree Indution PETRA PERNER Institute of Computer Vision and Applied Computer Sienes, IBaI Postbox , Leipzig GERMANY Abstrat: Data mining methods are widely used aross many disiplines to identify patterns, rules or assoiations among huge volumes of data. While in the past mostly blak box methods suh as neural nets and support vetor mahines have been heavily used in tehnial domains, methods that have explanation apability are preferred in medial domains. Nowadays, data mining methods with explanation apability are also used for tehnial domains after more work on advantages and disadvantages of the methods has been done. Deision tree indution suh as C4.5 is the most preferred method sine it works well on average regardless of the data set being used. This method an easily learn a deision tree without heavy user interation while in neural nets a lot of time is spent on training the net. Cross-validation methods an be applied to deision tree indution methods; these methods ensure that the alulated error rate omes lose to the true error rate. The error rate and the partiular goodness measures desribed in this paper are quantitative measures that provide help in understanding the quality of the model. The data olletion problem with its noise problem has to be onsidered. Speialized auray measures and proper visualization methods help to understand this problem. Sine deision tree indution is a supervised method, the assoiated data labels onstitute another problem. Re-labeling should be onsidered after the model has been learnt. This paper also disusses how to fit the learnt model to the expert s knowledge. The problem of omparing two deision trees in aordane with its explanation power is disussed. Finally, we summarize our methodology on interpretation of deision trees. Key-Words: Big Data Analysis, Reporting and Visualization, Deision Tree Indution, Comparison Deision Trees, Classifiation, Similarity Measure 1 Introdution Data mining methods are widely used aross many disiplines to identify patterns, rules or assoiations among huge volumes of data. Different methods an be applied to aomplish this. While in the past mostly blak box methods suh as neural nets and support vetor mahines (SVM) have been heavily used in tehnial domains, methods that have explanation apability have been partiularly used in medial domains sine a physiian likes to understand the outome of a lassifier and map it to his domain knowledge; otherwise, the level of aeptane of an automati system is low. Nowadays, data mining methods with explanation apability are also used for tehnial domains after more work on advantages and disadvantages of the methods has been done. The most preferred method among the methods with explanation apability is deision tree indution method [1]. This method an easily learn a deision tree without heavy user interation while in neural nets a lot of time is spent on training the net. Crossvalidation methods an be applied to deision tree indution methods; these methods ensure that the alulated error rate omes lose to the true error rate. A large number of deision tree methods exist but the method that works well on average on all kinds of data sets is still the C4.5 deision tree method and some of its variants. Although the user an easily apply this method to his data set thanks to all the different tools that are available and set up in suh a way that none omputer-siene speialist, an use them without any problem, the user is still faed with the problem of how to interpret the result of a deision tree indution method. This problem espeially arises when two different data sets for one problem are available or when the data set is olleted in temporal sequene. Then the data set grows over time and the results might hange. The aim of this paper is to give an overview of the problems that arise when interpreting deision trees. This paper is aimed at providing the user with a methodology on how to use the resulting model of deision tree indution methods. In Setion 2, we explain the data olletion problem. In Setion 3, we review how deision tree indution based on the entropy priniple works. In Setion 4, we present quantitative and qualitative ISBN:

2 measures that allow a user to judge the performane of a deision tree. Finally, in setion 5 we disuss the results ahieved so far with our methodology. 2 The Problem Many fators influene the result of the deision tree indution proess. The data olletion problem is a triky pit fall. The data might beome very noisy due to some subjetive or system-dependent problems during the data olletion proess. Newomers in data mining go into data mining step by step. First, they will aquire a small data base that allows them to test what an be ahieved by data mining methods. Then, they will enlarge the data base hoping that a larger data set will result in better data mining results. But often this is not the ase. Others may have big data olletions that have been olleted in their daily pratie suh as in marketing and finane. To a ertain point, they want to analyze these data with data mining methods. If they do this based on all data they might be faed with a lot of noise in the data sine ustomer behavior might have hanged over time due to some external fators suh as eonomi fators, limate ondition hanges in a ertain area and so on. Web data an hange severely over time. People from different geographi areas and different nations an aess a website and leave a distint trak dependent on the geographi area they are from and the nation they belong to. If the user has to label the data, then it might be apparent that the subjetive deision about the lass the data set belongs to might result in some noise. Depending on the form of the day of the expert or on his experiene level, he will label the data properly or not as well as he should. Orale-based lassifiation methods [12] [13] or similarity-based methods [14] [15] might help the user to overome suh subjetive fators. If the data have been olleted over an extended period of time, there might be some data drift. In ase of a web-based shop the ustomers frequenting the shop might have hanged beause the produts now attrat other groups of people. In a medial appliation the data might hange beause the medial treatment protool has been hanged. This has to be taken into onsideration when using the data. It is also possible that the data are olleted in time intervals. The data in time period _1 might have other harateristis than the data olleted in time period_2. In agriulture this might be true beause the weather onditions have hanged. If this is the ase, the data annot make up a single data set. The data must be kept separate with a tag indiating that they were olleted under different weather onditions. In this paper we desribe the behavior of deision tree indution under hanging onditions (see Figure 1) in order to give the user a methodology for using deision tree indution methods. The user should be able to detet suh influenes based on the results of the deision tree indution proess. Fig. 1 The Data Colletion Problem 3 Deision Tree Indution Based on the Gain Ratio (Entropy-Based Measure) The appliation of deision tree indution methods requires some basi knowledge of how deision tree indution methods work. This setion reviews the basi properties of deision tree indution[17]. Deision trees reursively split the deision spae into subspaes based on the deision rules in the nodes until the final stop riterion is reahed or the remaining sample set does not suggest further splitting (see Figure 2). For this reursive splitting proess, the tree building proess must always pik from all attributes that one that shows the best result on the attribute seletion riteria for the remaining sample set. Whereas for ategorial attributes the partition of the attribute values is given a-priori, the partition (also alled attribute disretization) of the attribute values for numerial attributes must be determined. Fig. 2 Overall Tree Indution Proedure Attribute disretization an be done before or during the tree building proess [2]. We will onsider the ase where the attribute disretization is done during the tree building proess. The disretization must be arried out before the attribute seletion ISBN:

3 proess sine the seleted partition regarding the attribute values of a numerial attribute highly influenes the predition power of that attribute. After the attribute seletion riterion has been alulated for all attributes based on the remaining sample set, the resulting values are evaluated and the attribute with the best value for the attribute seletion riterion is seleted for further splitting of the sample set. Then the tree is extended by two further nodes. To eah node the subset reated by splitting based on the attribute values is assigned and the tree building proess is repeated. Deision tree indution is a supervised method. It requires that the data is labeled by its lass. The indued deision tree tends to overfit the data. In Figure 3 we have demonstrated this situation based on a tree indued based on the well-known IRIS data set. Overfit is typially due to noise in the attribute values and lass information present in the training set. The tree building proess will produe subtrees that fit this noise. This auses an inreased error rate when lassifying unseen ases. Pruning the tree, whih means replaing subtrees with leaves, will help to avoid this problem (see Figure 4). Fig. 3 Deision Tree original In ase of the IRIS data set the pruned tree provides better auray than the unpruned tree. However, pruning is often based on a statistial model assumption that might not always fit the partiular data. Therefore, there might be a situation where the unpruned tree gives better results than the pruned tree even when heked with new data. 3.1 Attribute Splitting Criteria Following the theory of the Shannon hannel, we onsider the data set as the soure and measure the impurity of the reeived data when transmitted via the hannel. The transmission over the hannel results in partitioning of the data set into subsets based on splits on the attribute values J of the attribute A. The aim should be to transmit the signal with the least loss of information. This an be desribed by the following riterion: IF I(A)=I(C)-I(C/J)=Max THEN Selet Attribute-A where I(A) is the entropy of the soure, I(C) is the entropy of the reeiver or the expeted entropy to generate the message C1, C2,..., Cm, and I(C/J) is the lost entropy when branhing on the attribute values J of attribute A. For the alulation of this riterion we onsider first the ontingeny table in Table 1 with m the number of lasses, n the number of attribute values J, n the number of examples, Li the number of examples with the attribute value Ji, Rj the number of examples belonging to lass Cj, and xij the number of examples belonging to lass Cj and having attribute value Ai. Table 1 Contingeny Table for an Attribute Now, we an define the entropy of the lass C by: m R j R j I C) ld j 1 N N ( (1) The entropy of the lass given the feature values is: Fig. 4 Deision Tree pruned ISBN:

4 n m n n m L xij x i ij 1 I( C / J ) ld ( LildLi xijldxij) (2) N L L N i 1 j 1 i i i 1 i 1 j 1 The best feature is the one that ahieves the lowest value for (2) or, equivalently, the highest value of the "mutual information" I(C) - I(C/J). The main drawbak of this measure is its sensitivity to the number of attribute values. In the extreme, a feature that takes N distint values for N examples ahieves omplete disrimination between different lasses, giving I(C/J)=0, even though the features may onsist of random noise and may be useless for prediting the lasses of future examples. Therefore, Quinlan 3 introdued a normalization by the entropy of the attribute itself: n Li Li G(A)=I(A)/I(J) with I( J ) ld (3) N N Other normalizations have been proposed by Coppersmith et. al 4] and Lopez de Montaras 5. Comparative studies have been done by White and Lui 6. The behavior of the entropy is very interesting 7. Figure 5 shows the graph for the single term p ld p. The graph is not symmetrial. It has its maximum when 37% of the data have the same value. In that ase this value will trump all other values. 0,53 0,5 -p* ldp 0,25 i 1 0 1/e 0,37 0 0,5 p 1 Fig. 5 Diagram of p ld p; The maximum is at p=1/e; H=0.5 is assumed for p=0.25 and p=0.5 In ase of a binary split, we are faed with the situation that there are two soures with the signal probability of p and 1-p. The entropy is shown in Figure 6. It has its maximum when all values are equally distributed. The maximum value for the splitting riterion will be reahed if most of the samples fall on one side of the split. The deision tree indution algorithm will always favor splits that meet this situation. Figure 11 demonstrates this situation based of the IRIS data set. The visualization shows to the user the loation of the lass-speifi data dependent on two attributes. This helps the user to understand what hanged in the data. H(p,1-p) 1 0,8 0,6 0,4 0, ,2 0,4 0,6 0,8 1 p, 1-p Fig. 6 Behaviour of H(p,1-p) under the ondition that two soures are of the signal probability p and 1 - p 4 How to Interpret the Results of a Deision Tree 4.1 Quantitative Measures of the Quality of the Deision Tree Model One of the most important measures of the quality of a deision tree is auray. This measure is judged based on the available data set. Usually, rossvalidation is used for evaluating the model sine it is never lear if the available data set is a good representation of the entire domain. Compared to test-and-train, ross-validation an provide a measure statistially lose to the true error rate. Espeially if one has small sample sets, the predition of the error rate based on ross-validation is a must. Although this is a well-known fat by now, there are still frequently results presented that are based on testand-train and small sample sets. In ase of neural nets there is hardly any work available that judges the error rate based on ross-validation. If a larger data set is available, ross-validation is also a better hoie for the estimation of the error rate sine one an never be sure if the data set overs the property of the whole domain. Faed with the problem of omputational omplexity, n-fold ross-validation is a good hoie. It splits the whole data set into bloks of n and runs ross-validation based theorem. The output of ross-validation is mean auray. As you might know from statistis it is muh better ISBN:

5 to predit a measure based on single measures obtained from a data set split into bloks of data and to average over the measure than predit the measure based on a single shot on the whole data set. Moreover the variane of the auray gives you another hint in regard to how good the measure is: If the variane is high, there is muh noise in the data; if the variane is low, the result is muh more stable. The quality of a neural net is often not judged based on ross-validation. Cross-validation requires setting up a new model in eah loop of the yle. The mean auray over all values of the auray of the eah single yle is alulated as well as the standard deviation of auray. Neural nets are not automatially set up but deision trees are. A neural network needs a lot of training and people laim that suh a neural net one it is stable in its behavior - is the gold standard. However, the auray is judged based on the test-and-train approah and it is not sure if it is the true auray. Bootstrapping for the evaluation of auray is another hoie but it is muh more omputationally expensive than ross-validation; therefore, many tools do not provide this proedure. Auray and the standard deviation are an overall measure, respetively. The standard deviation of the auray an be taken as a measure to evaluate how stable the model is. A high standard deviation might show that the data are very noisy and that the model might hange when new data beome available. More detailed measures an be alulated that give a more detailed insight into the behavior of the model 8. The most widely used evaluation riterion for a lassifier is the error rate f r.= N f /N with N f the number of false lassified samples and N the whole number of samples. In addition, we use a ontingeny table in order to show the qualities of a lassifier, see Table 2. Table 2. Contingeny Table The table ontains the atual and the real lass distribution as well as the marginal distribution ij. The main diagonal is the number of orret lassified samples. The last row shows the number of samples assigned to the lass shown in row 1 and the last line shows the real lass distribution. Based on this table, we an alulate parameters that assess the quality of the lassifier. The orretness p is the number of orret lassified samples over the number of samples: p m ii i m m 1 (4) i 1 j 1 For the investigation of the lassifiation quality we measure the lassifiation quality p ki aording to a partiular lass i and the number of orret lassified samples p ti for one lass i: p ki ii m j 1 ji p ji ii ti m i 1 ji (5) Other riteria shown in Table 3 are also important when judging the quality of a model. Table 3. Criteria for Comparison of Learned Classifiers Generalization Capability of the Classifier Representation of the Classifier Classifiation Costs Explanation Capability Learning Performane Error Rate based on the Test Data Set Error Rate based on the Design Data Set Number of Features used for Classifiation Number of Nodes or Neurons Can a human understand the deision Learning Time Sensitivity to Class Distribution in the Sample Set One of these riteria is the ost for lassifiation expressed by the number of features and the number of deisions used during lassifiation. The other riterion is the time needed for learning. We also onsider the explanation apability of the lassifier as another quality riterion. It is also important to know if the lassifiation method an learn orretly the lassifiation funtion (the mapping of the attributes to the lasses) based on the training data set. Therefore, we not only onsider the error rate based on the test set, we also onsider the error rate based on the training data set. ISBN:

6 4.2 Explanation Capability of the Deision Tree Model Suppose we have a data set X with n samples. The outome of the data mining proess is a deision tree that represents the model in a hierarhial rule-based fashion. One path from the top to the leave of a tree an be desribed by a rule that ombines the deisions of eah node by a logial AND. The loser the deision is to the leave, the more noise is ontained in the deision sine the entire data set is subsequently split into two parts from the top to the bottom and in the end only a few samples are ontained in the two data sets. Pruning is performed to avoid that the model overfits the data. Pruning provides a more ompat tree and often a better model in terms of auray. The pruning algorithm is based on an assumption regarding the distribution of the data. If this assumption does not fit the data, the pruned model does not have better auray. Then it is better to stay with the unpruned tree. When users feel onfident about the data mining proess, they are often keen on getting more data. Then they apply the updated data set that is ombined of the data set X and the new data set X ontaining n+t samples (n < n+t) to the deision tree indution. If the resulting model only hanges in nodes lose to the leaf of a deision tree, the user understands why this is so. There will be onfusion when the whole struture of the deision tree has been hanged espeially, when the attribute in the root node hanges. The root node deision should be the most onfident deision. The reason for a hange an be that there were always two ompeting attributes having slightly different values for the attribute seletion riteria. Now, based on the data, the attribute ranked seond in the former proedure is now ranked first. When this happens the whole struture of the tree will hange sine a different attribute in the first node will result in a different first split of the entire data set. It is important that this situation is visually presented to the user so that he an judge what happened. Often the user has already some domain knowledge and prefers a ertain attribute to be ranked first. A way to enable suh a preferene is to allow the user to atively pik the attribute for the node. These visualization tehniques should allow to show to user the loation of the lass-speifi data dependent on two attributes, as shown in Figure 11. This helps the user to understand what hanged in the data. From a list of attributes the user an pik two attributes and the respetive graph will be presented. Another way to judge this situation is to look for the variane of the auray. If the variane is high, this means that the model is not stable yet. The data do not give enough onfidene in regard to the deision. The desribed situation an indiate that something is wrong with the data. It often helps to talk to the user and figure out how the new data set has been obtained. To give you an example: A data base ontains information about the mortality rate of patients that have been treated for breast aner. Information about the patients, suh as age, size, weight, measurements taken during the treatment, and finally the suess or failure, is reported. In the time period T1, treatment with a ertain oktail of mediine, radioative treatment and physiotherapy has taken plae; the kind of treatment is alled a protool. In the time period T2, the physiians hanged the protool sine other mediine is available or other treatment proedures have been reported in the medial literature as being more suessful. The physiians know about the hange in protool but they did not inform you aordingly. Then the whole tree might hange and as a result the deision rules are hanging and the physiians annot onfirm the resulting knowledge sine it does not fit their knowledge about the disease as established in the meantime. The resulting tree has to be disussed with the physiians; the outome may be that in the end the new protool is simply not good. 4.3 Revision of the Data Label Noisy data might be aused by wrong labels applied by the expert to the data. A review of the data with an expert is neessary to ensure that the data labels are orret. Therefore, the data are lassified by the learnt model. All data sets that are mislassified are reviewed by the domain expert. If the expert is of the opinion that the data set needs another label, then the data set is relabeled. The tree is learnt again based on the newly labeled data set. 4.4 Comparison of two Deision Trees Two data sets of the same domain that might be taken at different times, might result in two different deision trees. Then the question arises how similar these two deision trees are. If the models are not similar then something signifiant has hanged in the data set. The path from the top of a deision tree to the leaf is desribed by a rule like IF attribute A<= x and attribute B<=y and attribute C<=z and THEN Class_1. The transformation of a deision tree in a rule-like representation an be easily done. The loation of an attribute is fixed by the struture of the deision tree. ISBN:

7 Comparison of rule sets is known from rule indution methods in different domains 9. Here the indued rules are usually ompared to the humanbuilt rules Often this is done manually and should give a measure about how good the onstruted rule set is. These kinds of rules an also be automatially ompared by substruture mining. The following questions an be asked: a) How many rules are idential? b) How many of them are idential ompared to all rules? b) What rules ontain part strutures of the deision tree? We propose a first similarity measure for the differenes of the two models as follows. 1. Transform two deision trees d 1 and d 2 into a rule set. 2. Order the rules of two deision tress aording to the number n of attributes in a rule. 3. Then build substrutures of all l rules by deomposing the rules into their substrutures. 4. Compare two rules i and j of two deision trees d 1 and d 2 for eah of the n j and n i substrutures with s attributes. 5. Build similarity measure SIM ij aording to formula 6-8. Fig. 7 Deision_Tree_1, Sim d1,d1 =1 Fig. 8 Substrutures of Deision Tree_1 to Deision Tree_2; Sim d1,d2 = The similarity measure is: 1 SIMij ( Sim1 Sim2... Simk... Simn ) (6) n with n max ni, nj and Sim k 1 if substuture identity 0 if otherwise (7) If the rule ontains a numerial attribute A<=k 1 and A <=k 2 =k 1 +x then the similarity measure is Sim A A k k x x t t t Sim 0 for x t 1 1 num for x<t (8) k with t a user hosen value that allows x to be in a tolerane range of s % (e.g. 10%) of k 1. That means as long as the ut-point k 1 is within the tolerane range we onsider the term as similar, outside the tolerane range it is dissimilar. Small hanges around the first ut-point are allowed while a ut-point far from the first ut-point means that something seriously has happened with the data. Fig. 9 Substrutures of Deision Tree_1 to Deision Tree_3; Sim d1,d3 =0,375; Sim d2,d3 =0.375 Fig. 10 Deision Tree_4 dissimilar to all other Deision Trees, Sim d1,d4 =0 ISBN:

8 The similarity measure for the whole substruture is: s Simnum 1 Simk s 1 for A A (9) z 1 0 otherwise The overall similarity between two deision trees d1 and d2 is Sim d, d 1 2 l 1 max Simij l (10) i 1 j for omparing the rules i of deision d 1 with rules j of deision d 2. Note that the similarity Sim d1,d2 must not be the same. The omparison of deision tree_1 in Figure 7 with deision tree_2 in Figure 8 gives a similarity value of 0.75 based on the above desribed measure. The upper struture of deision tree_2 is similar to deision tree_1 but deision tree_2 has a few more lower leaves. The deision tree_3 in Figure 9 is similar to deision tree_1 and deision_tree_2 by a similarity value of Deision tree_3 in Figure 10 has no similarity at all ompared to all other trees. The similarity value is zero. Suh a similarity measure an help an expert to understand the developed model and also help to ompare two models that have been built based on two data set, wherein one ontains N examples and the other one ontains N+L samples. There are other options for onstruting the similarity measure [16]. 5 Conlusion The aim of this paper is to disuss how to deal with the result of data mining methods suh as deision tree indution. This paper has been prompted by the fat that domain experts are able to use the tools for deision tree indution but have a hard time interpreting the results. A lot of fators have to be taken into onsideration. The quantitative measures give a good overview in regard to the quality of the learnt model. But omputer siene experts laim that deision trees have explanation apabilities and that, ompared to neural nets and SVM, the user an understand the deision. This is only partially true. Of ourse, the user an follow the path of a deision from the top to the leaves and this provides him with a rule where the deisions in the node are ombined by logial ANDs. But often this is triky. A user likes rules that fit his domain knowledge and make sense in some way. Often this is not the ase sine the most favored attributes of the user do not appear at a high position. That makes the interpretation of a deision trees diffiult. The user s domain knowledge, even if it is only limited, is an indiator whether he aepts the tree or not. Some features a deision tree indution algorithm should have are mentioned in this paper. The deision tree indution algorithm should allow the user to interat with the indution algorithm. If two attributes are ranked more or less the same the user should be able to hoose whih one of the attributes to pik. The noise in the data should be heked with respet to different aspets. Quality measures of the model like mean auray, standard deviation and lass-speifi auray are neessary in order to judge the quality of a learnt deision tree right. The evaluation should be done by ross validation as test-and-train methods are not up-todate anymore. Among other things, explanation features are needed that show the split of the attributes and how it is represented in the deision spae. Simple visualization tehniques, like 2-d diagram plots, are often helpful to disover what happened in the data. Wrong labels have to be disovered by an oralebased lassifiation sheme. This should be supported by the tool. The omparison of two learned trees from the same domain is another important issue that a user needs in order to understand what has hanged. Therefore, proper similarity measures are needed that give a measure of goodness. Referenes: [1] Perner, P.: Data Mining on Multimedia Data. LNCS, vol. 2558, Springer Verlag (2002) [2] Dougherty, J, Kohavi, R, and Sahamin, M: Supervised and Unsupervised Disretization of Continuous Features, Mahine Learning, 14th IJCAI, pp (1995) [3] Quinlan, JR: Deision trees and multivalued attributes. In: Hayes, J.E, Mihie, D, Rihards, J. (eds.) Mahine Intelligene 11, Oxford University Press(1988), [4] Copersmith, D, Hong, SJ, Hosking, J.: Partitioning nominal attributes in deision trees. Journal of data mining and knowledge disovery 3 (2), (1999) [5] de Mantaras, R.L.: A distane-based attribute seletion measure for deision tree indution. Mahine Learning 6, (1991) ISBN:

9 [6] White, A.P., Lui, W.Z.: Bias in informationbased measures in deision tree indution. Mahine Learning 15, (1994) [7] Philipow, E.: Handbuh der Elektrotehnik, Bd 2 Grundlagen der Informationstehnik. pp , Tehnik Verlag, Berlin, (1987) [8] Perner, P., Zsherpel, U., Jaobsen, C.: A Comparision between Neural Networks and Deision Trees based on Data from Industrial Radiographi Testing, Pattern Reognition Letters 22), (2001) [9] Georg, G., Séroussi, B., Bouaud, J.: Does GEM- Enoding Clinial Pratie Guidelines Improve the Quality of Knowledge Bases? A Study with the Rule-Based Formalism. AMIA Annu Symp Pro. 2003, pp (2003) [10] Lee, S., Lee, S.H., Lee, K. C., Lee, M.H., Harashima, F.; Intelligent performane management of networks for advaned manufaturing systems, IEEE Transations on Industrial Eletronis 48 (4), (2001) [11] Bazijane, B., Gausmann, O., Turowski, K.: Parsing Effort in a B2B Integration Senario - An Industrial Case Study. Enterprise Interoperability II, Part IX, pp , Springer Verlag (2007) [12] Muggleton, S.: Due - An Orale-based Approah to Construtive Indution. Proeeding of the Tenth International Join Conferene on Artifiial Intelligene (IJCAI 87), pp (1987) [13] Wu, B., Nevatia, R.: Improving Part based Objet Detetion by Unsupervised, Online Boosting, IEEE Conferene on Computer Vision and Pattern Reognition, CVPR '07, pp. 1 8 (2007) [14] Whiteley, J.R., Davis, J.F.: A similarity-based approah to interpretation of sensor data using adaptive resonane theory. Computers & Chemial Engineering 18(7), (1994) [15] Perner, P.: Prototype-Based Classifiation. Applied Intelligene 28(3), (2008) [16] Perner, P.: A Method for Supporting the Domain Expert by the Interpretation of Different Deision Trees Learnt from the Same Domain Quality and Reliability Engineering International, Volume 30, Issue 7, pages , November [17] Perner, P., Deision Tree Indution Methods and Their Appliation to Big Data,In: Fatos Xhafa, Leonard Barolli, Admir Barolli, Petraq Papajorgji (Eds.), Modeling and Optimization in Siene and Tehnologies, Modeling and Proessing for Next-Generation Big-Data Tehnologies With Appliations and Case Studies, Volume , Springer Verlag 2015, pp ISBN:

10 Appendix Fig. 11. Deision Surfae for two Attributes on eah Level of the Deision Tree shown in Figure 3 Advanes in Information Siene and Computer Engineering ISBN:

A Holistic Method for Selecting Web Services in Design of Composite Applications

A Holistic Method for Selecting Web Services in Design of Composite Applications A Holisti Method for Seleting Web Servies in Design of Composite Appliations Mārtiņš Bonders, Jānis Grabis Institute of Information Tehnology, Riga Tehnial University, 1 Kalu Street, Riga, LV 1658, Latvia,

More information

Hierarchical Clustering and Sampling Techniques for Network Monitoring

Hierarchical Clustering and Sampling Techniques for Network Monitoring S. Sindhuja Hierarhial Clustering and Sampling Tehniques for etwork Monitoring S. Sindhuja ME ABSTRACT: etwork monitoring appliations are used to monitor network traffi flows. Clustering tehniques are

More information

Discovering Trends in Large Datasets Using Neural Networks

Discovering Trends in Large Datasets Using Neural Networks Disovering Trends in Large Datasets Using Neural Networks Khosrow Kaikhah, Ph.D. and Sandesh Doddameti Department of Computer Siene Texas State University San Maros, Texas 78666 Abstrat. A novel knowledge

More information

An integrated optimization model of a Closed- Loop Supply Chain under uncertainty

An integrated optimization model of a Closed- Loop Supply Chain under uncertainty ISSN 1816-6075 (Print), 1818-0523 (Online) Journal of System and Management Sienes Vol. 2 (2012) No. 3, pp. 9-17 An integrated optimization model of a Closed- Loop Supply Chain under unertainty Xiaoxia

More information

Sebastián Bravo López

Sebastián Bravo López Transfinite Turing mahines Sebastián Bravo López 1 Introdution With the rise of omputers with high omputational power the idea of developing more powerful models of omputation has appeared. Suppose that

More information

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules

Improved Vehicle Classification in Long Traffic Video by Cooperating Tracker and Classifier Modules Improved Vehile Classifiation in Long Traffi Video by Cooperating Traker and Classifier Modules Brendan Morris and Mohan Trivedi University of California, San Diego San Diego, CA 92093 {b1morris, trivedi}@usd.edu

More information

Computer Networks Framing

Computer Networks Framing Computer Networks Framing Saad Mneimneh Computer Siene Hunter College of CUNY New York Introdution Who framed Roger rabbit? A detetive, a woman, and a rabbit in a network of trouble We will skip the physial

More information

A Keyword Filters Method for Spam via Maximum Independent Sets

A Keyword Filters Method for Spam via Maximum Independent Sets Vol. 7, No. 3, May, 213 A Keyword Filters Method for Spam via Maximum Independent Sets HaiLong Wang 1, FanJun Meng 1, HaiPeng Jia 2, JinHong Cheng 3 and Jiong Xie 3 1 Inner Mongolia Normal University 2

More information

Neural network-based Load Balancing and Reactive Power Control by Static VAR Compensator

Neural network-based Load Balancing and Reactive Power Control by Static VAR Compensator nternational Journal of Computer and Eletrial Engineering, Vol. 1, No. 1, April 2009 Neural network-based Load Balaning and Reative Power Control by Stati VAR Compensator smail K. Said and Marouf Pirouti

More information

Deadline-based Escalation in Process-Aware Information Systems

Deadline-based Escalation in Process-Aware Information Systems Deadline-based Esalation in Proess-Aware Information Systems Wil M.P. van der Aalst 1,2, Mihael Rosemann 2, Marlon Dumas 2 1 Department of Tehnology Management Eindhoven University of Tehnology, The Netherlands

More information

Channel Assignment Strategies for Cellular Phone Systems

Channel Assignment Strategies for Cellular Phone Systems Channel Assignment Strategies for Cellular Phone Systems Wei Liu Yiping Han Hang Yu Zhejiang University Hangzhou, P. R. China Contat: wliu5@ie.uhk.edu.hk 000 Mathematial Contest in Modeling (MCM) Meritorious

More information

Recovering Articulated Motion with a Hierarchical Factorization Method

Recovering Articulated Motion with a Hierarchical Factorization Method Reovering Artiulated Motion with a Hierarhial Fatorization Method Hanning Zhou and Thomas S Huang University of Illinois at Urbana-Champaign, 405 North Mathews Avenue, Urbana, IL 680, USA {hzhou, huang}@ifpuiuedu

More information

Open and Extensible Business Process Simulator

Open and Extensible Business Process Simulator UNIVERSITY OF TARTU FACULTY OF MATHEMATICS AND COMPUTER SCIENCE Institute of Computer Siene Karl Blum Open and Extensible Business Proess Simulator Master Thesis (30 EAP) Supervisors: Luiano Garía-Bañuelos,

More information

Weighting Methods in Survey Sampling

Weighting Methods in Survey Sampling Setion on Survey Researh Methods JSM 01 Weighting Methods in Survey Sampling Chiao-hih Chang Ferry Butar Butar Abstrat It is said that a well-designed survey an best prevent nonresponse. However, no matter

More information

Pattern Recognition Techniques in Microarray Data Analysis

Pattern Recognition Techniques in Microarray Data Analysis Pattern Reognition Tehniques in Miroarray Data Analysis Miao Li, Biao Wang, Zohreh Momeni, and Faramarz Valafar Department of Computer Siene San Diego State University San Diego, California, USA faramarz@sienes.sdsu.edu

More information

Supply chain coordination; A Game Theory approach

Supply chain coordination; A Game Theory approach aepted for publiation in the journal "Engineering Appliations of Artifiial Intelligene" 2008 upply hain oordination; A Game Theory approah Jean-Claude Hennet x and Yasemin Arda xx x LI CNR-UMR 668 Université

More information

Behavior Analysis-Based Learning Framework for Host Level Intrusion Detection

Behavior Analysis-Based Learning Framework for Host Level Intrusion Detection Behavior Analysis-Based Learning Framework for Host Level Intrusion Detetion Haiyan Qiao, Jianfeng Peng, Chuan Feng, Jerzy W. Rozenblit Eletrial and Computer Engineering Department University of Arizona

More information

Robust Classification and Tracking of Vehicles in Traffic Video Streams

Robust Classification and Tracking of Vehicles in Traffic Video Streams Proeedings of the IEEE ITSC 2006 2006 IEEE Intelligent Transportation Systems Conferene Toronto, Canada, September 17-20, 2006 TC1.4 Robust Classifiation and Traking of Vehiles in Traffi Video Streams

More information

FIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero

FIRE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero FE DETECTION USING AUTONOMOUS AERIAL VEHICLES WITH INFRARED AND VISUAL CAMERAS. J. Ramiro Martínez-de Dios, Luis Merino and Aníbal Ollero Robotis, Computer Vision and Intelligent Control Group. University

More information

Chapter 1 Microeconomics of Consumer Theory

Chapter 1 Microeconomics of Consumer Theory Chapter 1 Miroeonomis of Consumer Theory The two broad ategories of deision-makers in an eonomy are onsumers and firms. Eah individual in eah of these groups makes its deisions in order to ahieve some

More information

Intelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds

Intelligent Measurement Processes in 3D Optical Metrology: Producing More Accurate Point Clouds Intelligent Measurement Proesses in 3D Optial Metrology: Produing More Aurate Point Clouds Charles Mony, Ph.D. 1 President Creaform in. mony@reaform3d.om Daniel Brown, Eng. 1 Produt Manager Creaform in.

More information

An Efficient Network Traffic Classification Based on Unknown and Anomaly Flow Detection Mechanism

An Efficient Network Traffic Classification Based on Unknown and Anomaly Flow Detection Mechanism An Effiient Network Traffi Classifiation Based on Unknown and Anomaly Flow Detetion Mehanism G.Suganya.M.s.,B.Ed 1 1 Mphil.Sholar, Department of Computer Siene, KG College of Arts and Siene,Coimbatore.

More information

Granular Problem Solving and Software Engineering

Granular Problem Solving and Software Engineering Granular Problem Solving and Software Engineering Haibin Zhu, Senior Member, IEEE Department of Computer Siene and Mathematis, Nipissing University, 100 College Drive, North Bay, Ontario, P1B 8L7, Canada

More information

Customer Efficiency, Channel Usage and Firm Performance in Retail Banking

Customer Efficiency, Channel Usage and Firm Performance in Retail Banking Customer Effiieny, Channel Usage and Firm Performane in Retail Banking Mei Xue Operations and Strategi Management Department The Wallae E. Carroll Shool of Management Boston College 350 Fulton Hall, 140

More information

Henley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD)

Henley Business School at Univ of Reading. Pre-Experience Postgraduate Programmes Chartered Institute of Personnel and Development (CIPD) MS in International Human Resoure Management For students entering in 2012/3 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date of speifiation:

More information

A Survey of Usability Evaluation in Virtual Environments: Classi cation and Comparison of Methods

A Survey of Usability Evaluation in Virtual Environments: Classi cation and Comparison of Methods Doug A. Bowman bowman@vt.edu Department of Computer Siene Virginia Teh Joseph L. Gabbard Deborah Hix [ jgabbard, hix]@vt.edu Systems Researh Center Virginia Teh A Survey of Usability Evaluation in Virtual

More information

Improved SOM-Based High-Dimensional Data Visualization Algorithm

Improved SOM-Based High-Dimensional Data Visualization Algorithm Computer and Information Siene; Vol. 5, No. 4; 2012 ISSN 1913-8989 E-ISSN 1913-8997 Published by Canadian Center of Siene and Eduation Improved SOM-Based High-Dimensional Data Visualization Algorithm Wang

More information

A Comparison of Service Quality between Private and Public Hospitals in Thailand

A Comparison of Service Quality between Private and Public Hospitals in Thailand International Journal of Business and Soial Siene Vol. 4 No. 11; September 2013 A Comparison of Servie Quality between Private and Hospitals in Thailand Khanhitpol Yousapronpaiboon, D.B.A. Assistant Professor

More information

Capacity at Unsignalized Two-Stage Priority Intersections

Capacity at Unsignalized Two-Stage Priority Intersections Capaity at Unsignalized Two-Stage Priority Intersetions by Werner Brilon and Ning Wu Abstrat The subjet of this paper is the apaity of minor-street traffi movements aross major divided four-lane roadways

More information

Learning Curves and Stochastic Models for Pricing and Provisioning Cloud Computing Services

Learning Curves and Stochastic Models for Pricing and Provisioning Cloud Computing Services T Learning Curves and Stohasti Models for Priing and Provisioning Cloud Computing Servies Amit Gera, Cathy H. Xia Dept. of Integrated Systems Engineering Ohio State University, Columbus, OH 4310 {gera.,

More information

Static Fairness Criteria in Telecommunications

Static Fairness Criteria in Telecommunications Teknillinen Korkeakoulu ERIKOISTYÖ Teknillisen fysiikan koulutusohjelma 92002 Mat-208 Sovelletun matematiikan erikoistyöt Stati Fairness Criteria in Teleommuniations Vesa Timonen, e-mail: vesatimonen@hutfi

More information

Agile ALM White Paper: Redefining ALM with Five Key Practices

Agile ALM White Paper: Redefining ALM with Five Key Practices Agile ALM White Paper: Redefining ALM with Five Key Praties by Ethan Teng, Cyndi Mithell and Chad Wathington 2011 ThoughtWorks ln. All rights reserved www.studios.thoughtworks.om Introdution The pervasiveness

More information

3 Game Theory: Basic Concepts

3 Game Theory: Basic Concepts 3 Game Theory: Basi Conepts Eah disipline of the soial sienes rules omfortably ithin its on hosen domain: : : so long as it stays largely oblivious of the others. Edard O. Wilson (1998):191 3.1 and and

More information

RATING SCALES FOR NEUROLOGISTS

RATING SCALES FOR NEUROLOGISTS RATING SCALES FOR NEUROLOGISTS J Hobart iv22 WHY Correspondene to: Dr Jeremy Hobart, Department of Clinial Neurosienes, Peninsula Medial Shool, Derriford Hospital, Plymouth PL6 8DH, UK; Jeremy.Hobart@

More information

An Enhanced Critical Path Method for Multiple Resource Constraints

An Enhanced Critical Path Method for Multiple Resource Constraints An Enhaned Critial Path Method for Multiple Resoure Constraints Chang-Pin Lin, Hung-Lin Tai, and Shih-Yan Hu Abstrat Traditional Critial Path Method onsiders only logial dependenies between related ativities

More information

AUDITING COST OVERRUN CLAIMS *

AUDITING COST OVERRUN CLAIMS * AUDITING COST OVERRUN CLAIMS * David Pérez-Castrillo # University of Copenhagen & Universitat Autònoma de Barelona Niolas Riedinger ENSAE, Paris Abstrat: We onsider a ost-reimbursement or a ost-sharing

More information

Suggested Answers, Problem Set 5 Health Economics

Suggested Answers, Problem Set 5 Health Economics Suggested Answers, Problem Set 5 Health Eonomis Bill Evans Spring 2013 1. The graph is at the end of the handout. Fluoridated water strengthens teeth and redues inidene of avities. As a result, at all

More information

Parametric model of IP-networks in the form of colored Petri net

Parametric model of IP-networks in the form of colored Petri net Parametri model of IP-networks in the form of olored Petri net Shmeleva T.R. Abstrat A parametri model of IP-networks in the form of olored Petri net was developed; it onsists of a fixed number of Petri

More information

Henley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD)

Henley Business School at Univ of Reading. Chartered Institute of Personnel and Development (CIPD) MS in International Human Resoure Management (full-time) For students entering in 2015/6 Awarding Institution: Teahing Institution: Relevant QAA subjet Benhmarking group(s): Faulty: Programme length: Date

More information

THE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES

THE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES Proeedings of FEDSM 98 998 ASME Fluids Engineering Division Summer Meeting June 2-25, 998 Washington DC FEDSM98-529 THE PERFORMANCE OF TRANSIT TIME FLOWMETERS IN HEATED GAS MIXTURES John D. Wright Proess

More information

protection p1ann1ng report

protection p1ann1ng report f1re~~ protetion p1ann1ng report BUILDING CONSTRUCTION INFORMATION FROM THE CONCRETE AND MASONRY INDUSTRIES Signifiane of Fire Ratings for Building Constrution NO. 3 OF A SERIES The use of fire-resistive

More information

WORKFLOW CONTROL-FLOW PATTERNS A Revised View

WORKFLOW CONTROL-FLOW PATTERNS A Revised View WORKFLOW CONTROL-FLOW PATTERNS A Revised View Nik Russell 1, Arthur H.M. ter Hofstede 1, 1 BPM Group, Queensland University of Tehnology GPO Box 2434, Brisbane QLD 4001, Australia {n.russell,a.terhofstede}@qut.edu.au

More information

Chapter 6 A N ovel Solution Of Linear Congruenes Proeedings NCUR IX. (1995), Vol. II, pp. 708{712 Jerey F. Gold Department of Mathematis, Department of Physis University of Utah Salt Lake City, Utah 84112

More information

How To Fator

How To Fator CHAPTER hapter 4 > Make the Connetion 4 INTRODUCTION Developing seret odes is big business beause of the widespread use of omputers and the Internet. Corporations all over the world sell enryption systems

More information

Software Ecosystems: From Software Product Management to Software Platform Management

Software Ecosystems: From Software Product Management to Software Platform Management Software Eosystems: From Software Produt Management to Software Platform Management Slinger Jansen, Stef Peeters, and Sjaak Brinkkemper Department of Information and Computing Sienes Utreht University,

More information

Price-based versus quantity-based approaches for stimulating the development of renewable electricity: new insights in an old debate

Price-based versus quantity-based approaches for stimulating the development of renewable electricity: new insights in an old debate Prie-based versus -based approahes for stimulating the development of renewable eletriity: new insights in an old debate uthors: Dominique FINON, Philippe MENNTEU, Marie-Laure LMY, Institut d Eonomie et

More information

A Context-Aware Preference Database System

A Context-Aware Preference Database System J. PERVASIVE COMPUT. & COMM. (), MARCH 005. TROUBADOR PUBLISHING LTD) A Context-Aware Preferene Database System Kostas Stefanidis Department of Computer Siene, University of Ioannina,, kstef@s.uoi.gr Evaggelia

More information

i_~f e 1 then e 2 else e 3

i_~f e 1 then e 2 else e 3 A PROCEDURE MECHANISM FOR BACKTRACK PROGRAMMING* David R. HANSON + Department o Computer Siene, The University of Arizona Tuson, Arizona 85721 One of the diffiulties in using nondeterministi algorithms

More information

Classical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk

Classical Electromagnetic Doppler Effect Redefined. Copyright 2014 Joseph A. Rybczyk Classial Eletromagneti Doppler Effet Redefined Copyright 04 Joseph A. Rybzyk Abstrat The lassial Doppler Effet formula for eletromagneti waves is redefined to agree with the fundamental sientifi priniples

More information

The Application of Mamdani Fuzzy Model for Auto Zoom Function of a Digital Camera

The Application of Mamdani Fuzzy Model for Auto Zoom Function of a Digital Camera (IJCSIS) International Journal of Computer Siene and Information Seurity, Vol. 6, No. 3, 2009 The Appliation of Mamdani Fuzzy Model for Auto Funtion of a Digital Camera * I. Elamvazuthi, P. Vasant Universiti

More information

Findings and Recommendations

Findings and Recommendations Contrating Methods and Administration Findings and Reommendations Finding 9-1 ESD did not utilize a formal written pre-qualifiations proess for seleting experiened design onsultants. ESD hose onsultants

More information

Scalable Hierarchical Multitask Learning Algorithms for Conversion Optimization in Display Advertising

Scalable Hierarchical Multitask Learning Algorithms for Conversion Optimization in Display Advertising Salable Hierarhial Multitask Learning Algorithms for Conversion Optimization in Display Advertising Amr Ahmed Google amra@google.om Abhimanyu Das Mirosoft Researh abhidas@mirosoft.om Alexander J. Smola

More information

Performance Analysis of IEEE 802.11 in Multi-hop Wireless Networks

Performance Analysis of IEEE 802.11 in Multi-hop Wireless Networks Performane Analysis of IEEE 80.11 in Multi-hop Wireless Networks Lan Tien Nguyen 1, Razvan Beuran,1, Yoihi Shinoda 1, 1 Japan Advaned Institute of Siene and Tehnology, 1-1 Asahidai, Nomi, Ishikawa, 93-19

More information

Context-Sensitive Adjustments of Cognitive Control: Conflict-Adaptation Effects Are Modulated by Processing Demands of the Ongoing Task

Context-Sensitive Adjustments of Cognitive Control: Conflict-Adaptation Effects Are Modulated by Processing Demands of the Ongoing Task Journal of Experimental Psyhology: Learning, Memory, and Cognition 2008, Vol. 34, No. 3, 712 718 Copyright 2008 by the Amerian Psyhologial Assoiation 0278-7393/08/$12.00 DOI: 10.1037/0278-7393.34.3.712

More information

Criminal Geographical Profiling: Using FCA for Visualization and Analysis of Crime Data

Criminal Geographical Profiling: Using FCA for Visualization and Analysis of Crime Data Criminal Georaphial rofilin: Usin FCA for Visualization and Analysis of Crime Data Quist-Aphetsi Kester, MIEEE Leturer, Faulty of Informatis Ghana Tehnoloy University Collee Ara, Ghana Email: kquist-aphetsi@tu.edu.h

More information

The Basics of International Trade: A Classroom Experiment

The Basics of International Trade: A Classroom Experiment The Basis of International Trade: A Classroom Experiment Alberto Isgut, Ganesan Ravishanker, and Tanya Rosenblat * Wesleyan University Abstrat We introdue a simple web-based lassroom experiment in whih

More information

Trade Information, Not Spectrum: A Novel TV White Space Information Market Model

Trade Information, Not Spectrum: A Novel TV White Space Information Market Model Trade Information, Not Spetrum: A Novel TV White Spae Information Market Model Yuan Luo, Lin Gao, and Jianwei Huang 1 Abstrat In this paper, we propose a novel information market for TV white spae networks,

More information

Interpretable Fuzzy Modeling using Multi-Objective Immune- Inspired Optimization Algorithms

Interpretable Fuzzy Modeling using Multi-Objective Immune- Inspired Optimization Algorithms Interpretable Fuzzy Modeling using Multi-Objetive Immune- Inspired Optimization Algorithms Jun Chen, Mahdi Mahfouf Abstrat In this paper, an immune inspired multi-objetive fuzzy modeling (IMOFM) mehanism

More information

Dataflow Features in Computer Networks

Dataflow Features in Computer Networks Magyar Kutatók 1. Nemzetközi Szimpóziuma 1 th International Symposium of Hungarian Researhers on Computational Intelligene and Informatis Gyula Max Budapest University of Tehnology and Eonomis, Department

More information

1.3 Complex Numbers; Quadratic Equations in the Complex Number System*

1.3 Complex Numbers; Quadratic Equations in the Complex Number System* 04 CHAPTER Equations and Inequalities Explaining Conepts: Disussion and Writing 7. Whih of the following pairs of equations are equivalent? Explain. x 2 9; x 3 (b) x 29; x 3 () x - 2x - 22 x - 2 2 ; x

More information

FOOD FOR THOUGHT Topical Insights from our Subject Matter Experts

FOOD FOR THOUGHT Topical Insights from our Subject Matter Experts FOOD FOR THOUGHT Topial Insights from our Sujet Matter Experts DEGREE OF DIFFERENCE TESTING: AN ALTERNATIVE TO TRADITIONAL APPROACHES The NFL White Paper Series Volume 14, June 2014 Overview Differene

More information

Impact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities

Impact Simulation of Extreme Wind Generated Missiles on Radioactive Waste Storage Facilities Impat Simulation of Extreme Wind Generated issiles on Radioative Waste Storage Failities G. Barbella Sogin S.p.A. Via Torino 6 00184 Rome (Italy), barbella@sogin.it Abstrat: The strutural design of temporary

More information

GABOR AND WEBER LOCAL DESCRIPTORS PERFORMANCE IN MULTISPECTRAL EARTH OBSERVATION IMAGE DATA ANALYSIS

GABOR AND WEBER LOCAL DESCRIPTORS PERFORMANCE IN MULTISPECTRAL EARTH OBSERVATION IMAGE DATA ANALYSIS HENRI COANDA AIR FORCE ACADEMY ROMANIA INTERNATIONAL CONFERENCE of SCIENTIFIC PAPER AFASES 015 Brasov, 8-30 May 015 GENERAL M.R. STEFANIK ARMED FORCES ACADEMY SLOVAK REPUBLIC GABOR AND WEBER LOCAL DESCRIPTORS

More information

TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS

TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS TECHNOLOGY-ENHANCED LEARNING FOR MUSIC WITH I-MAESTRO FRAMEWORK AND TOOLS ICSRiM - University of Leeds Shool of Computing & Shool of Musi Leeds LS2 9JT, UK +44-113-343-2583 kia@i-maestro.org www.i-maestro.org,

More information

RISK-BASED IN SITU BIOREMEDIATION DESIGN JENNINGS BRYAN SMALLEY. A.B., Washington University, 1992 THESIS. Urbana, Illinois

RISK-BASED IN SITU BIOREMEDIATION DESIGN JENNINGS BRYAN SMALLEY. A.B., Washington University, 1992 THESIS. Urbana, Illinois RISK-BASED IN SITU BIOREMEDIATION DESIGN BY JENNINGS BRYAN SMALLEY A.B., Washington University, 1992 THESIS Submitted in partial fulfillment of the requirements for the degree of Master of Siene in Environmental

More information

Optimal Sales Force Compensation

Optimal Sales Force Compensation Optimal Sales Fore Compensation Matthias Kräkel Anja Shöttner Abstrat We analyze a dynami moral-hazard model to derive optimal sales fore ompensation plans without imposing any ad ho restritions on the

More information

NOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES

NOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES The 9 th International Days of Statistis and Eonomis, Prague, September 10-1, 015 NOMCLUST: AN R PACKAGE FOR HIERARCHICAL CLUSTERING OF OBJECTS CHARACTERIZED BY NOMINAL VARIABLES Zdeněk Šul Hana Řezanková

More information

From a strategic view to an engineering view in a digital enterprise

From a strategic view to an engineering view in a digital enterprise Digital Enterprise Design & Management 2013 February 11-12, 2013 Paris From a strategi view to an engineering view in a digital enterprise The ase of a multi-ountry Telo Hervé Paault Orange Abstrat In

More information

Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes

Asymmetric Error Correction and Flash-Memory Rewriting using Polar Codes 1 Asymmetri Error Corretion and Flash-Memory Rewriting using Polar Codes Eyal En Gad, Yue Li, Joerg Kliewer, Mihael Langberg, Anxiao (Andrew) Jiang and Jehoshua Bruk Abstrat We propose effiient oding shemes

More information

A Comparison of Default and Reduced Bandwidth MR Imaging of the Spine at 1.5 T

A Comparison of Default and Reduced Bandwidth MR Imaging of the Spine at 1.5 T 9 A Comparison of efault and Redued Bandwidth MR Imaging of the Spine at 1.5 T L. Ketonen 1 S. Totterman 1 J. H. Simon 1 T. H. Foster 2. K. Kido 1 J. Szumowski 1 S. E. Joy1 The value of a redued bandwidth

More information

State of Maryland Participation Agreement for Pre-Tax and Roth Retirement Savings Accounts

State of Maryland Participation Agreement for Pre-Tax and Roth Retirement Savings Accounts State of Maryland Partiipation Agreement for Pre-Tax and Roth Retirement Savings Aounts DC-4531 (08/2015) For help, please all 1-800-966-6355 www.marylandd.om 1 Things to Remember Complete all of the setions

More information

A novel active mass damper for vibration control of bridges

A novel active mass damper for vibration control of bridges IABMAS 08, International Conferene on Bridge Maintenane, Safety and Management, 3-7 July 008, Seoul, Korea A novel ative mass damper for vibration ontrol of bridges U. Starossek & J. Sheller Strutural

More information

RESEARCH SEMINAR IN INTERNATIONAL ECONOMICS. Discussion Paper No. 475. The Evolution and Utilization of the GATT/WTO Dispute Settlement Mechanism

RESEARCH SEMINAR IN INTERNATIONAL ECONOMICS. Discussion Paper No. 475. The Evolution and Utilization of the GATT/WTO Dispute Settlement Mechanism RESEARCH SEMINAR IN INTERNATIONAL ECONOMICS Shool of Publi Poliy The University of Mihigan Ann Arbor, Mihigan 48109-1220 Disussion Paper No. 475 The Evolution and Utilization of the GATT/WTO Dispute Settlement

More information

arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA

arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrence Berkeley National Laboratory One Cyclotron Road Berkeley, CA 94720 USA LBNL-52402 Marh 2003 On the Speed of Gravity and the v/ Corretions to the Shapiro Time Delay Stuart Samuel 1 arxiv:astro-ph/0304006v2 10 Jun 2003 Theory Group, MS 50A-5101 Lawrene Berkeley National Laboratory

More information

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS Virginia Department of Taxation INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS www.tax.virginia.gov 2614086 Rev. 07/14 * Table of Contents Introdution... 1 Important... 1 Where to Get Assistane... 1 Online

More information

REDUCTION FACTOR OF FEEDING LINES THAT HAVE A CABLE AND AN OVERHEAD SECTION

REDUCTION FACTOR OF FEEDING LINES THAT HAVE A CABLE AND AN OVERHEAD SECTION C I E 17 th International Conferene on Eletriity istriution Barelona, 1-15 May 003 EUCTION FACTO OF FEEING LINES THAT HAVE A CABLE AN AN OVEHEA SECTION Ljuivoje opovi J.. Elektrodistriuija - Belgrade -

More information

A Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems

A Three-Hybrid Treatment Method of the Compressor's Characteristic Line in Performance Prediction of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition of Power Systems A Three-Hybrid Treatment Method of the Compressor's Charateristi Line in Performane Predition

More information

Electrician'sMathand BasicElectricalFormulas

Electrician'sMathand BasicElectricalFormulas Eletriian'sMathand BasiEletrialFormulas MikeHoltEnterprises,In. 1.888.NEC.CODE www.mikeholt.om Introdution Introdution This PDF is a free resoure from Mike Holt Enterprises, In. It s Unit 1 from the Eletrial

More information

Availability, Reliability, Maintainability, and Capability

Availability, Reliability, Maintainability, and Capability Availability, Reliability, Maintainability, and Capability H. Paul Barringer, P.E. Barringer & Assoiates, In. Humble, TX Triplex Chapter Of The Vibrations Institute Hilton Hotel Beaumont, Texas February

More information

Procurement auctions are sometimes plagued with a chosen supplier s failing to accomplish a project successfully.

Procurement auctions are sometimes plagued with a chosen supplier s failing to accomplish a project successfully. Deision Analysis Vol. 7, No. 1, Marh 2010, pp. 23 39 issn 1545-8490 eissn 1545-8504 10 0701 0023 informs doi 10.1287/dea.1090.0155 2010 INFORMS Managing Projet Failure Risk Through Contingent Contrats

More information

) ( )( ) ( ) ( )( ) ( ) ( ) (1)

) ( )( ) ( ) ( )( ) ( ) ( ) (1) OPEN CHANNEL FLOW Open hannel flow is haraterized by a surfae in ontat with a gas phase, allowing the fluid to take on shapes and undergo behavior that is impossible in a pipe or other filled onduit. Examples

More information

' R ATIONAL. :::~i:. :'.:::::: RETENTION ':: Compliance with the way you work PRODUCT BRIEF

' R ATIONAL. :::~i:. :'.:::::: RETENTION ':: Compliance with the way you work PRODUCT BRIEF ' R :::i:. ATIONAL :'.:::::: RETENTION ':: Compliane with the way you work, PRODUCT BRIEF In-plae Management of Unstrutured Data The explosion of unstrutured data ombined with new laws and regulations

More information

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS

INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS Virginia Department of Taxation INCOME TAX WITHHOLDING GUIDE FOR EMPLOYERS www.tax.virginia.gov 2614086 Rev. 01/16 Table of Contents Introdution... 1 Important... 1 Where to Get Assistane... 1 Online File

More information

5.2 The Master Theorem

5.2 The Master Theorem 170 CHAPTER 5. RECURSION AND RECURRENCES 5.2 The Master Theorem Master Theorem In the last setion, we saw three different kinds of behavior for reurrenes of the form at (n/2) + n These behaviors depended

More information

university of illinois library AT URBANA-CHAMPAIGN BOOKSTACKS

university of illinois library AT URBANA-CHAMPAIGN BOOKSTACKS university of illinois library AT URBANA-CHAMPAIGN BOOKSTACKS CENTRAL CIRCULATION BOOKSTACKS The person harging this material is responsible for its renewal or its return to the library from whih it was

More information

Solving the Game of Awari using Parallel Retrograde Analysis

Solving the Game of Awari using Parallel Retrograde Analysis Solving the Game of Awari using Parallel Retrograde Analysis John W. Romein and Henri E. Bal Vrije Universiteit, Faulty of Sienes, Department of Mathematis and Computer Siene, Amsterdam, The Netherlands

More information

UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE

UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE UNIVERSITY AND WORK-STUDY EMPLOYERS WEB SITE USER S GUIDE September 8, 2009 Table of Contents 1 Home 2 University 3 Your 4 Add 5 Managing 6 How 7 Viewing 8 Closing 9 Reposting Page 1 and Work-Study Employers

More information

Effectiveness of a law to reduce alcohol-impaired driving in Japan

Effectiveness of a law to reduce alcohol-impaired driving in Japan Effetiveness of a law to redue alohol-impaired driving in Japan T Nagata, 1,2 S Setoguhi, 3 D Hemenway, 4 M J Perry 5 Original artile 1 Takemi Program, Department of International Health, Harvard Shool

More information

AT 6 OF 2012 GAMBLING DUTY ACT 2012

AT 6 OF 2012 GAMBLING DUTY ACT 2012 i e AT 6 OF 2012 GAMBLING DUTY ACT 2012 Gambling Duty At 2012 Index i e GAMBLING DUTY ACT 2012 Index Setion Page PART 1 INTRODUCTORY 5 1 Short title... 5 2 Commenement... 5 3 General interpretation...

More information

Impedance Method for Leak Detection in Zigzag Pipelines

Impedance Method for Leak Detection in Zigzag Pipelines 10.478/v10048-010-0036-0 MEASUREMENT SCIENCE REVIEW, Volume 10, No. 6, 010 Impedane Method for Leak Detetion in igzag Pipelines A. Lay-Ekuakille 1, P. Vergallo 1, A. Trotta 1 Dipartimento d Ingegneria

More information

Design Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis

Design Implications for Enterprise Storage Systems via Multi-Dimensional Trace Analysis Design Impliations for Enterprise Storage Systems via Multi-Dimensional Trae Analysis Yanpei Chen, Kiran Srinivasan, Garth Goodson, Randy Katz University of California, Berkeley, NetApp In. {yhen2, randy}@ees.berkeley.edu,

More information

A Design Environment for Migrating Relational to Object Oriented Database Systems

A Design Environment for Migrating Relational to Object Oriented Database Systems To appear in: 1996 International Conferene on Software Maintenane (ICSM 96); IEEE Computer Soiety, 1996 A Design Environment for Migrating Relational to Objet Oriented Database Systems Jens Jahnke, Wilhelm

More information

BUILDING A SPAM FILTER USING NAÏVE BAYES. CIS 391- Intro to AI 1

BUILDING A SPAM FILTER USING NAÏVE BAYES. CIS 391- Intro to AI 1 BUILDING A SPAM FILTER USING NAÏVE BAYES 1 Spam or not Spam: that is the question. From: "" Subjet: real estate is the only way... gem oalvgkay Anyone an buy real estate with no

More information

Chapter 5 Single Phase Systems

Chapter 5 Single Phase Systems Chapter 5 Single Phase Systems Chemial engineering alulations rely heavily on the availability of physial properties of materials. There are three ommon methods used to find these properties. These inlude

More information

Combining refractive and topographic data in corneal refractive surgery for astigmatism

Combining refractive and topographic data in corneal refractive surgery for astigmatism Combining refrative and topographi data in orneal refrative surgery for astigmatism A new method based on polar value analysis and mathematial optimization Kristian Næser Department of Ophthalmology, Randers

More information

Intuitive Guide to Principles of Communications By Charan Langton www.complextoreal.com

Intuitive Guide to Principles of Communications By Charan Langton www.complextoreal.com Intuitive Guide to Priniples of Communiations By Charan Langton www.omplextoreal.om Understanding Frequeny Modulation (FM), Frequeny Shift Keying (FSK), Sunde s FSK and MSK and some more The proess of

More information

10.1 The Lorentz force law

10.1 The Lorentz force law Sott Hughes 10 Marh 2005 Massahusetts Institute of Tehnology Department of Physis 8.022 Spring 2004 Leture 10: Magneti fore; Magneti fields; Ampere s law 10.1 The Lorentz fore law Until now, we have been

More information

ROSE SCHOOL A SIMPLIFIED MECHANICS BASED PROCEDURE FOR THE SEISMIC RISK ASSESSMENT OF UNREINFORCED MASONRY BUILDINGS

ROSE SCHOOL A SIMPLIFIED MECHANICS BASED PROCEDURE FOR THE SEISMIC RISK ASSESSMENT OF UNREINFORCED MASONRY BUILDINGS I.U.S.S. Istituto Universitario di Studi Superiori di Pavia Università degli Studi di Pavia EUROPEAN SCHOOL OF ADVANCED STUDIES IN REDUCTION OF SEISMIC RISK ROSE SCHOOL A SIMPLIFIED MECHANICS BASED PROCEDURE

More information

Account Contract for Card Acceptance

Account Contract for Card Acceptance Aount Contrat for Card Aeptane This is an Aount Contrat for the aeptane of debit ards and redit ards via payment terminals, on the website and/or by telephone, mail or fax. You enter into this ontrat with

More information

MATE: MPLS Adaptive Traffic Engineering

MATE: MPLS Adaptive Traffic Engineering MATE: MPLS Adaptive Traffi Engineering Anwar Elwalid Cheng Jin Steven Low Indra Widjaja Bell Labs EECS Dept EE Dept Fujitsu Network Communiations Luent Tehnologies Univ. of Mihigan Calteh Pearl River,

More information