基于libsvm，開發的支持向量機圖形界面(初級水平)應用程序，并提供了關于C和sigma的新的參數選擇方法，使得SVM的使用更加簡單直觀.參考文章 Fast and Efficient Strategies for Model Selection of Gaussian Support Vector Machine 可google之。
This paper studies the problem of categorical data clustering,
especially for transactional data characterized by high
dimensionality and large volume. Starting from a heuristic method
of increasing the height-to-width ratio of the cluster histogram, we
develop a novel algorithm – CLOPE, which is very Fast and
scalable, while being quite effective. We demonstrate the
performance of our algorithm on two real world
Delphi and C++ Builder component for direct access to IO ports on Windows 95, Windows 98 and Windows NT/2000. Provides properties for reading and writing bytes, words and doublewords from/to IO ports. New Fast block data transfer methods enable to read and write megabytes of data per second.
OpenSS7 This the fourth public release of the OpenSS7 Master Package. See README in the release for a sub-package listing. Most of the sub-packages in the release are production grade for Linux Fast-STREAMS. All existing validation test suites run clean on supported distributions and architectures.
It is unlikely that the OpenSS7 Master Package will be released as frequently as before. Sub-packages will be released more often. To rebuild the master package with a new sub-package release, simply replace the directory to which the sub-package belongs with the unpacked sub-package release and then rebuild the master package. This release provides support for recent distributions and tool chains.
Web technology is not evolving in comfortable and incremental steps, but i s turbulent, erratic, and often rather uncomfortable. It is estimated that the Internet, arguably the most important part of the new technological environment, has expanded by about 2000 ％ and that is doubling in size every six to ten months. In recent years, the advance in computer and web technologies and the decrease in their cost have expanded the means available to collect and store data. As an intermediate consequence, the amount of information (Meaningful data) stored has been increasing at a very Fast pace.
The Game:
Make the snake grow longer by directing it to the food.
Extra bonus points are given from hearts, eat them as Fast as possible as amount of bonus points decreases with time.
Higher level gives more points for the food but will also make it tougher to steer a long snake as speed increaces.
Five different mazes as well as play w/o maze are possible.
The ability to write efficient, high-speed arithmetic routines ultimately depends
upon your knowledge of the elements of arithmetic as they exist on a computer. That
conclusion and this book are the result of a long and frustrating search for
information on writing arithmetic routines for real-time embedded systems.
With instruction cycle times coming down and clock rates going up, it would
seem that speed is not a problem in writing Fast routines. In addition, math
coprocessors are becoming more popular and less expensive than ever before and are
readily available. These factors make arithmetic easier and Faster to use and
implement. However, for many of you the systems that you are working on do not
include the latest chips or the Faster processors. Some of the most widely used
microcontrollers used today are not Digital Signal Processors (DSP), but simple
eight-bit controllers such as the Intel 8051 or 8048 microprocessors.
SmallSQL is a 100％ pure Java DBMS, a relational database for Java desktop applications. It has a JDBC 3.0 interface and offering many ANSI SQL 92 and ANSI SQL 99 features. It is very small and Fast Java library. It does not have a network interface.
Feature selection is a preprocessing technique frequently used in data mining and machine learning tasks. It can reduce dimensionality, remove irrelevant data, increase learning accuracy, and improve results comprehensibility. FCBF is a Fast correlation-based filter algorithm designed for high-dimensional data and has been shown effective in removing both irrelevant features and redundant features
