Rounding Up the Best Javascript WYSIWYG and Markup Editor WYSIWYG Editor is the first requirement if you want to develop a web application which involved HTML editing and you want your user see a real time preview of what they are editing. Most of the available Content Management System and other publishing platform in the web are using WYSIWYG editor for easy page editing. So I will rounding up to you the best JS WYSIWYG editor in the web. TinyMCE – Javascript WYSIWYG Editor TinyMCE is a platform independent web based Javascript HTML WYSIWYG editor control released as Open Source under LGPL by Moxiecode Systems AB. TinyMCE is my personal choice. TinyMCE Features: Easy to integrate – Only a few lines of code needed.Customizable - Themes and plugins, block invalid elements and force attributes.Browserfriendly - Mozilla, MSIE, FireFox, Opera, Safari and Chrome.Lightweight - PHP/.NET/JSP/Coldfusion GZip compressor, Makes TinyMCE 75% smaller and a lot faster to load.AJAX Compatible – You can easily use AJAX to save and load content! FCKeditor jwysiwyg
AI4R :: Artificial Intelligence for Ruby x86 Assembly x86 Assembly This book covers assembly language programming for the x86 family of microprocessors. The objective is to teach how to program in x86 assembly, as well as the history and basic architecture of x86 processor family. When referring to x86 we address the complete range of x86-based processors (since the original Intel 8086 in 1978). This includes: IA-32 assembly, also commonly referred to as x86-32 assembly (Intel architecture 32-bit, since the Intel 80386), a 32-bit extension of the original 16-bit Intel x86 processor architecture (used in Intel 8086 - 80286 CPUs). Throughout the book these terms may be used interchangeably when appropriate. Introduction Basic FAQ x86 Basics x86 Family x86 Architecture and Register Description Comments 16, 32, and 64 Bits Intrinsic Data Types x86 Instruction Set x86 Instructions Data Transfer Instructions Control Flow Instructions Arithmetic Instructions Logic Instructions Shift and Rotate Instructions Other Instructions x86 Interrupts Syntaxes and Assemblers
List of algorithms The following is a along with one-line descriptions for each. Combinatorial algorithms General combinatorial algorithms Brent's algorithm : finds cycles in iterations using only two iterators Floyd's cycle-finding algorithm : finds cycles in iterations Gale–Shapley algorithm : solves the stable marriage problem Pseudorandom number generators (uniformly distributed): Blum Blum Shub Lagged Fibonacci generator Linear congruential generator Mersenne twister Graph algorithms Coloring algorithm : Graph coloring algorithm. Hopcroft–Karp algorithm : convert a bipartite graph to a maximum cardinality matching Hungarian algorithm : algorithm for finding a perfect matching Prüfer coding : conversion between a labeled tree and its Prüfer sequence Tarjan's off-line least common ancestors algorithm : compute lowest common ancestors for pairs of nodes in a tree Topological sort : finds linear order of nodes (e.g. jobs) based on their dependencies. Graph drawing Spectral layout Network theory Network analysis PageRank