Welcome to Beginning Algorithms, a step-by-step introduction to computing algorithms for the real world.
Developers use algorithms and data structures every day of their working lives. Having a good understanding
of these algorithms and knowledge of when to apply them is essential to producing software
that not only works correctly, but also performs efficiently.
This book aims to explain those algorithms and data structures most commonly encountered in day-today
software development, while remaining at all times practical, concise, and to the point, with little or
no verbiage to distract from the core concepts and examples.
I ve written some many years ago dynamic Huffman algorithm to compress and decompress data. It is mainly targeted to data with some symbols occuring more often than the rest (e.g. Having some data file consisted of 3 different symbols and their total number of occurence in that file s1(1000), s2(200), s3(30) so the total length of file is 1000+200+30=1230 bytes, it will be encoded assigning one bit to s1 and 2 bits to s2, s3 so the encoded length will be 1*1000+2*(200+30)=1460 bits=182 bytes). In the best case the file consisted of just one symbol will be encoded with compression ratio as 1:8. Huffman coding is used in image compression, however in JPEG2000 arithmetic codec is imployed.
JLAB is a set of Matlab functions I have written or co-written over the past fifteen years for the purpose of analyzing data. It consists of four hundred m-files spanning thirty thousand lines of code. JLAB includes functions ranging in complexity from one-line aliases to high-level algorithms for certain specialized tasks. These have been collected together and made publicly available for you to use, modify, and --- subject to certain very reasonable constraints --- to redistribute.
Some of the highlights are: a suite of functions for the rapid manipulation of multi-component, potentially multi-dimensional datasets a systematic way of dealing with datasets Having components of non-uniform length tools for fine-tuning figures using compact, straightforward statements and specialized functions for spectral and time / frequency analysis, including advanced wavelet algorithms developed by myself and collaborators.
MS-Clustering is designed to rapidly cluster large MS/MS datasets. The program merges similar spectra (Having similar m/z values ?within a given tolerance), and creates a single consensus spectrum as a representative. The input formats accepted are: dta, mgf, mzXML. The output format is mgf.
mastering dojo
The book really rolls out the red carpet for Dojo to emerge with guns
blazing! The authors show you how easy it is to use impressive
widgets without installing a thing. I was amazed to discover that
JavaScript is not just a toy language, how Dojo is built on top of it,
and how both are invaluable in any web development project. Buy
this book. It’s the next best thing to Having the authors working at
your side.
The Cryptography API: Next Generation(CNG) is a new and agile framework in Windows Vista, which implements an extensible provider model that allows you to load a provider by specifying the required cryptographic algorithm rather than Having to hardcode a specific provider.
Whenever there is an application to write, breaking it up to small pieces is a great idea. The smallest piece of any application would probably be a data object, or a simple Bean in Java. Java Beans are simple Java classes that have a distinctive look and behavior. Their simplest purpose is to contain data and they accomplish this by Having properties. Each property is actually a data-member containing/referencing the actual data and a couple of methods, a getter method and a setter method. Thus, the simplest data-bean describing a person could be expressed as such:
實(shí)現(xiàn)：SELECT [ALL|DISTINCT] <屬性表達(dá)式>[，<屬性表達(dá)式>…] FROM <表名或視圖名>[，<表名或視圖名>…] [WHERE <條件>] [GROUP BY <屬性1>[Having<條件>]] [ORDER BY <屬性2> [ASC|DEC]
mkdosfs - Make DOS file system utilty.
I wrote this, partially to complement the dosfsck utility written by Werner
Almesberger (who graciously gave me some pointers when I asked for some
advice about writing this code), and also to avoid me Having to boot DOS
just to create data partitions (I use Linux to back up DOS :-) ).
Using the idea from Seam Carving for Content-Aware Image Resizing, the codes enables a selected image to resize without Having distortion of important object in the image file.
