Tutorial by Examples: ear

from sklearn import svm X = [[1, 2], [3, 4]] #Training Samples y = [1, 2] #Class labels model = svm.SVC() #Making a support vector classifier model model.fit(X, y) #Fitting the data clf.predict([[2, 3]]) #After fitting, new data can be classified by using predict()

This attribute is used to identify a method that is called immediately after each tests, it will be called even if there is any error, this is the place we can dispose our objects. [TearDown] public void CleanAfterEveryTest() { }

$a1 = array("red","green"); $a2 = array("blue","yellow"); print_r(array_merge($a1,$a2)); /* Array ( [0] => red [1] => green [2] => blue [3] => yellow ) */ Associative array: $a1=array("a"=>"red","b"=&...

JVM is an abstract computing machine or Virtual machine that resides in your RAM. It has a platform-independent execution environment that interprets Java bytecode into native machine code. (Javac is Java Compiler which compiles your Java code into Bytecode) Java program will be running inside the...

As you can see the layout of this gem is very catching and user friendly.

NSMutableArray *array = [NSMutableArray arrayWithObjects:@"Ken", @"Tim", @"Chris", @"Steve",@"Charlie",@"Melissa", nil]; NSPredicate *bPredicate = [NSPredicate predicateWithFormat:@"SELF beginswith[c] 'c'"]; NSArray ...

In the same way as in Open Terminal in current Xcode project folder example, you can add clear of derived data folder with hotkey. Create custom behavior (follow the steps in Open Terminal in current Xcode project folder). But use another script. Script text: #!/bin/bash rm -rf $HOME"/Lib...

Where command line arguments are supported they can be read in via the get_command_argument intrinsic (introduced in the Fortran 2003 standard). The command_argument_count intrinsic provides a way to know the number of arguments provided at the command line. All command-line arguments are read in ...

We can have three cases to analyze an algorithm: Worst Case Average Case Best Case #include <stdio.h> // Linearly search x in arr[]. If x is present then return the index, // otherwise return -1 int search(int arr[], int n, int x) { int i; for (i=0; i<n; i...

Example sheet Code Sub Example() Dim wks As Worksheet Set wks = ThisWorkbook.Worksheets("Sheet1") Dim units As Range Set units = ThisWorkbook.Names("Units").RefersToRange Worksheets("Sheet1").Range("Year_Max").Value =...

3.3 Instancing can be done via modifications to how vertex attributes are provided to the vertex shader. This introduces a new way of accessing attribute arrays, allowing them to provide per-instance data that looks like a regular attribute. A single instance represents one object or group of vert...

It is often necessary to execute a long-running task and use the result of that task once it has completed. In this example, we will create two classes: One which implements the Callable<T> interface (where T is the type we wish to return), and one which contains a main() method. AsyncValueT...

2009 3rd March : The project was named as "node" 1st October : First very early preview of npm, the Node package manager 8th November : Ryan Dahl's (Creator of Node.js) Original Node.js Talk at JSConf 2009 2010 Express: A Node.js web development framework Socket.io initial...

Depth First Traversal (or Search) for a graph is similar to Depth First Traversal of a tree. The only catch here is, unlike trees, graphs may contain cycles, so we may come to the same node again. To avoid processing a node more than once, we use a boolean visited array. Below algorithm presents th...

Algorithm BFS(G) Input graph G Output labeling of the edges and partition of the vertices of G for all u ∈ G.vertices() setLabel(u, UNEXPLORED) for all e ∈ G.edges() setLabel (e, UNEXPLORED) for all v ∈ G.vertices() if getLabel(v) = UNEXPLORED ...

Query to search last executed sp's in db SELECT execquery.last_execution_time AS [Date Time], execsql.text AS [Script] FROM sys.dm_exec_query_stats AS execquery CROSS APPLY sys.dm_exec_sql_text(execquery.sql_handle) AS execsql ORDER BY execquery.last_execution_time DESC Query to search thro...

SET @searchTerm= 'Database Programming'; SELECT MATCH (Title) AGAINST (@searchTerm IN NATURAL LANGUAGE MODE) Score, ISBN, Author, Title FROM book WHERE MATCH (Title) AGAINST (@searchTerm IN NATURAL LANGUAGE MODE) ORDER BY MATCH (Title) AGAINST (@searchTerm IN NATURAL LANGUA...

SET @searchTerm= 'Database Programming -Java'; SELECT MATCH (Title) AGAINST (@searchTerm IN BOOLEAN MODE) Score, ISBN, Author, Title FROM book WHERE MATCH (Title) AGAINST (@searchTerm IN BOOLEAN MODE) ORDER BY MATCH (Title) AGAINST (@searchTerm IN BOOLEAN MODE) DESC; Giv...

SET @searchTerm= 'Date Database Programming'; SELECT MATCH (Title, Author) AGAINST (@searchTerm IN NATURAL LANGUAGE MODE) Score, ISBN, Author, Title FROM book WHERE MATCH (Title, Author) AGAINST (@searchTerm IN NATURAL LANGUAGE MODE) ORDER BY MATCH (Title, Author) AGAINST (...

One of the main advantage of std::array as compared to C style array is that we can check the size of the array using size() member function int main() { std::array<int, 3> arr = { 1, 2, 3 }; cout << arr.size() << endl; }