CommonJS
On the CommonJS project was to establish conventions for the module ecosystem for JavaScript outside the browser. The main reason for its creation was the main drawback of the conventional form of JavaScript modules that can be reusable in enviro ...
CSSinJS
CSSinJS is a method of styling when JavaScript is used to style components. When this is handled by JavaScript, CSS will be created and attached to the house. This allows you to abstract CSS for the component level, we use JavaScript to describ ...
JavaScript engine
JavaScript is a computer program that executes JavaScript code. The first JavaScript engines were just translators but all relevant modern engines are only used at compile time to improve performance. JavaScript engines are, as a rule, is develop ...
Isomorphic JavaScript
Isomorphic JavaScript code runs in the context of single page application SPA. In a typical SPA, a large part of the application logic, including routing, is encapsulated by the included JavaScript file that is sent to the client. While this free ...
Userscript
In your custom script is a program usually written in JavaScript to modify web pages to increase viewing. On desktop browsers, such as Firefox, they are enabled by using browser extensions Manager user scripts, like Greasemonkey. In Presto Opera ...
Clitic climbing
Clitic climbing is a phenomenon first identified in the romance languages, in which there is a pronominal object of the embedded infinitive is attached to the matrix verb. Pronominal objects in romance languages are usually expressed as clitics. ...
FrancoItalian
FrancoItalian, also known as the FrancoVenetian or FrancoLombard, literary language is used in some parts of Northern Italy, since the mid 13th century to late 14th century. It hired writers, including Brunetto Latini and Rustichello da Pisa. ...
Judy array
In computer science, Judy array is a data structure of type implements an associative array with high performance and low memory consumption. Unlike most other "keyvalue" stores, the Judy arrays use hashing, compression, leverage on your keys, a ...
2–3 tree
In computer science, a 23 tree is a tree data structure where each node with children or two children and one data element or three children and two data elements. According to Knuth, "a Btree of order 3 is a 23 tree." Nodes outside of the tre ...
2–3–4 tree
In computer science, 234 trees are selfbalancing data structure that is commonly used to implement dictionaries. Numbers mean a tree where every node with children, or two, three, or four child nodes: In a 3node has two data elements, and if ...
Bxtree
The basic structure of the b xtree a B  tree in which internal nodes serve as a directory, each of which contains a pointer to its right sibling. In an earlier version of the b xtree, leaf nodes contain the moving object is indexed and the cor ...
Binary tree
In computer science, a binary tree is a tree data structure in which each node has at most two children, called left child and right child. A recursive definition using just set theory notions is that a binary tree is a tuple, where L and R are b ...
Interleave lower bound
In the theory of optimal binary search trees, interleave lower bound the lower bound of the number of operations required in the binary search tree to perform a specified sequence of operations. Several variants of this lower boundary was proved. ...
Leftchild rightsibling binary tree
Each Multiway or Kary tree structure studied in computer science, admits the representation as a binary tree, which goes by various names, including children dogodkov representation, leftchild, rightbrother binary tree doubly chained tree, or ...
Optimal binary search tree
In computer science, an optimal binary search tree, sometimes called weightbalanced binary tree is a binary search tree that provides the minimum possible seek time for the given sequence of requests. Optimal Bsts are generally divided into two ...
Ttree
In computer science a Ttree type data structure binary tree which is used in memory databases such as address datablitz, EXtremeDB, MySQL cluster, Oracle TimesTen and Etc Ttree is a balanced index tree data structure optimized for cases where b ...
Tango tree
A tango tree is a type of binary search tree proposed by Erik D. Demaine, Dion Harmon, John Iacono, and Mihai Patrașcu in 2004. It is named after Buenos Aires, where tango is a symbol. Is an online binary search tree that achieves an output log ...
Threaded binary tree
In computing, threaded binary tree is a binary tree that facilitates the passage in a certain order. Integer binary tree sort can easily be traversed in the order of the main key, but given only a pointer to the node to find the node which may be ...
Tree rotation
In discrete mathematics, tree rotation is an operation on a binary tree that changes the structure without disturbing the order of the elements. Tree rotation moves one node in the tree and one node down. It is used to change the shape of the tre ...
WAVL tree
In computer science, a tree or WAVL weak AVL tree is a selfbalancing binary search tree. WAVL trees named in honor of AVL trees, another type of balanced search tree, and closely related to AVL trees and red–black trees, which fall in the overal ...
AA tree
An AA tree in computer science is a form of balanced tree used to store and efficiently retrieve ordered data. AA trees are named for Arne Andersson, their inventor. AA trees are a variation of redblack tree as binary search tree, which enables ...
Interval tree
In computer science, an interval tree is a tree data structure to hold intervals. In particular, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for example, t ...
Weightbalanced tree
In computer science, weightbalanced binary trees are a type of selfbalancing binary search trees that can be used to implement dynamic sets, dictionaries, and sequences. These trees was introduced by Nievergelt and Reingold in 1970e years, as ...
Nearest neighbor value interpolation
In mathematics applied to computer graphics, nearest neighbor value interpolation is an advanced method of image interpolation. This method uses the pixel value corresponding to the smallest absolute difference when a set of four known value pixe ...
Tricubic interpolation
In the mathematical subfield numerical analysis, tricubic interpolation is a method for obtaining values at arbitrary points in the 3D space of functions defined on a regular grid. The approach involves approximating the function locally an expre ...
Bogacki–Shampine method
Method Bogacki–Shampine method is a method for the numerical solution of ordinary differential equations, which was proposed by Przemyslaw Bogacki and Lawrence F. Shampine in 1989. Method Bogacki–Shampine method is a Runge–Kutta method of order t ...
Gauss–Legendre method
In numerical analysis and scientific computing, Gauss–Legendre methods are a family of numerical methods for ordinary differential equations. Gauss–Legendre methods implicit methods Runge–Kutta methods. More specifically, they are methods based o ...
Trapezoidal rule (differential equations)
In numerical analysis and scientific computing, the trapezoidal rule is a numerical method of solving ordinary differential equations obtained from the Formula for trapezium rule for calculating integrals. The trapezoidal rule is an implicit seco ...
Crout matrix decomposition
In linear algebra, a matrix decomposition Kraut is the Lu decomposition, which decomposes the matrix into a lower triangular matrix, upper triangular matrix, and although not always necessary matrix permutations. It was designed by Prescott Duran ...
Symbolic Cholesky decomposition
In the mathematical subfield of numerical analysis the symbolic Cholesky decomposition is an algorithm used to determine the nonzero pattern of L {\the style property display the value of l} the coefficients of a symmetric sparse matrix when appl ...
Bluefire Supercomputer
Fastest supercomputer is the IBM supercomputer installed in may 2008 at the National center for atmospheric research. It is used for the development of scientific research in severe weather and the future climate of the Earth.
IBM Deep Thunder
Thunder is a research project of IBM, which aims to improve shortterm local weather forecasting through the use of high performance computing. It is part of a complex of deep computing initiative that also produced the deep blue chess computer. ...
Mira (supercomputer)
Mira is a blue gene petaflops / m supercomputer. As of November 2017, it is listed on Top500 as of 11 fastest supercomputer in the world, while it debuted in June 2012 at the 3rd place. It has a performance of 8.59 petaflops and consumes a 3.9 MW ...
Yellowstone (supercomputer)
Yellowstone was the first supercomputer in ncaiWyoming supercomputing center in Cheyenne, Wyoming. It has been installed, tested and prepared for production in the summer of 2012. Supercomputer cluster Yellowstone was decommissioned on 31 Decemb ...
Cheyenne (supercomputer)
Cheyenne supercomputer in ncaiWyoming supercomputing center in Cheyenne, Wyoming began its work one of the most powerful and energy efficient computers. In November 2016, as most 20thpowerful computer in the world on the Top500 of the World, in ...
Altix
Altix is a line of computers, servers and supercomputers produced by Silicon graphics based on Intel processors. Succeeded IMPI / of iriksbased origin 3000 servers.
page 60

2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400

Slot A 

Socket 754 

Socket 939 

Socket A 
Socket AM1 

Socket AM2 

Socket AM2+ 

Socket AM3 

Socket AM3+ 

Socket AM4 
Socket FM2+ 
Socket sTRX4 

Socket TR4 

Super Socket 7 
Advanced Micro Devices mobile sockets 
Advanced Micro Devices server sockets 
Intel Socket G3 

Socket J 

Socket T 

LGA 1150 

LGA 1155 

LGA 1156 

LGA 1248 
LGA 1356 

Socket B 

Socket R 

LGA 2066 

Slot 1 

Socket 1 

Socket 2 

Socket 4 

Socket 6 

Socket 8 

Socket 370 

Socket 423 

Socket 478 

Socket 479 

Socket 495 

Socket 603 

Socket 604 
Socket B 

Socket G1 

Socket G2 
Socket J 

Socket P 
Socket R 
Socket T 
Intel 8061 

Intel MCS51 

Intel MCS96 
Intel MCS296 

Intel Quark 

H8 Family 
Mitsubishi 740 
R8C 

R8C Tiny 
RL78 
RX microcontroller family 

Assembly shell 
Commodore 2031 

Commodore 4040 
Commodore 8060 
Commodore 8280 
AMD Dragon 
HP 520 Notebook 

IBM 5x86C 
Intel SHA extensions 
LatticeMico8 
Lynnfield (microprocessor) 

Motorola 68012 
Nios embedded processor 
Regency Systems R2C 
Sandy BridgeE 

SCELBI 

Sharp PC1401 

Sharp PC1403 

Sharp PC1600 
AMD Spider 
Tandy 10 Business Computer System 

Telmac 1800 

Telmac TMC600 

Thomson computers 

Thomson MO5 

Thomson TO7 

Thomson TO8 

TI PLT SHH1 
TI7 MathMate 
TI12 Math Explorer 
TI32 Math Explorer Plus 

TI55 

TI80 
TI1030 
TI1031 
Microsoft stubs 

Commodore 128 
Thomson TO7/70 

Commodore CBMII 
Commodore 116 

Commodore Educator 64 

KIM1 
no need to download or install
Pino  logical board game which is based on tactics and strategy. In general this is a remix of chess, checkers and corners. The game develops imagination, concentration, teaches how to solve tasks, plan their own actions and of course to think logically. It does not matter how much pieces you have, the main thing is how they are placement!
online intellectual game →