at t ringback tones

considered as a bubble with weight, scanning the array from bottom up, where a light bubble that violates the principle is scanned, it will "float" up ". this is repeated. until the last two of the above are light, the severe ones. The code is as follows: /*** Bubble sort (one-dimensional array)* Compare the size of the elements to be sorted. if the two data elements are in the opposite order, they are exchanged until there is no data element in the

match the remaining string once or multiple times --The number of the remaining strings 1 is an integer multiple of the number of the preceding strings 1.). It can be seen that this regular expression is a non-prime number. To obtain a prime number, you must reverse the entire expression. Through the above analysis, we know that the second part is the most important. For the second part, let's give a few examples, Example 1: Determine the natural number 8. We can know that 8 is converted into

minimum error rate minerror to +∞ for each feature of the dataset (the first loop) for each step (the second loop) for each of the equal (third-tier loops): Create a single-layer decision tree and test it with a weighted dataset if the error rate is less than minerror, the current Single-layer decision tree is set as optimal single-layer decision tree to return to the best single-layer decision treeAdaBoost algorithm pseudo-code:For each iteration: Find the best single-layer decision tree to ad

This article mainly introduces the Kmeans and kmeans ++ algorithms, explains the shortcomings of the Kmeans algorithm and the implementation ideas of the kmeans ++ algorithm, as well as the Kmeans ++ algorithms implemented in Python and matlab, for more information, see 1. start with Kmeans Kmeans is a very basic clustering algorithm that uses the idea of iteration. we will not talk about its principles here. The following describes how to use the kmeans algorithm in matlab. Create seven two-di

Tomorrow the first class 8.55 only, or the things you see today to tidy up.Today is mainly to see Ng in the first few chapters of the single-line regression, multi-linear regression, logistic regression of the MATLAB implementation, before thought those things understand well, but write code is very difficult to look, but today, Daniel's code found really easy ... But it is a very skillful use of the matrix to achieve.For example, the single-line regression inside the j=0 and j=1 The two cases,

Linear regression ExercisesFollow Andrew Ng and do the exercises: http://openclassroom.stanford.edu/MainFolder/DocumentPage.php?course=DeepLearningdoc= Exercises/ex2/ex2.htmlThis section does a little exercise in linear regression, with data from the Web site above, where X is the height of the little boy,Y is the age of the little boy, and the dataset consists of 50 training data sets.1, pretreatmentby x = Load (' Ex2x.dat ');y = Load (' Ex2y.dat ');Loading data;Then generate the unit vector fo

some permissions is too much higher than centos. use centos for servers. of course, ubuntu servers are really good, and the foreign share has exceeded other Linux series. however, IDC in China also supports centos. ------ Solution -------------------- In fact, they are all the same... whatever you want .... Whether to install them on your own machine or popular ones like fedora/ubuntu ------ Solution -------------------- Discussion In fact, the

Random gradient Rise Method--Update the regression coefficients with only one sample point at a time (because the classifier can be incrementally updated when a new sample arrives, thus belonging to an online learning algorithm)The gradient rise method needs to traverse the entire data set each time the regression system is updated, which is good for processing 100 or so data sets, but if there are billions of samples and thousands of features, the computational complexity of the method is too h

Question: Look for the median of 5 numbers, 5 numbers may have the same number, assuming that the number is stored in a[0] a[1] a[2] a[3] a[4], in order to easily remember as A0,A1,A2,A3,A4Idea: Define the Compare_swap (int* a,int* B) method, this method compares the size of a A, a two number, if a is greater than B to exchange two number, that is, the smaller of two number is stored in a, the larger person is stored in B. Compare in the following order:Compare A0 A1 with smaller

UDP operations.Ten # Updated from RFC 1700, ' Assigned Numbers ' (October 1994). Not all PO ten RTS# is included, only the more common ones.12 #The latest IANA port assignments can be gotten from# http://www.iana.org/assignments/port-numbersThe well known Ports is those from 0 through 1023.Registered Ports is those from 1024x768 through 49151# the Dynamic and/or Private Ports is those from 49152 through 6553518 #Describes one service, and is of the f

136. Single numberBecause a xor a = 0, and the XOR operation is exchangeable, there is a result for the instance {2,1,4,5,2,4,1}:(2^1^4^5^2^4^1) => ((2^2)^(1^1)^(4^4)^(5)) => (0^0^0^5) => 5XOR: 1137. Single number II (Black question mark face)For all integers except one occurrence, the number of occurrences of each digit in the binary representation of 1 is an integer multiple of 3, all of these 1 are zeroed, and the remainder is the final number. With ones