What I did with this class is to automatize (not MS s automation) several processes to do a search in a MS Sql Server database, and show the results, retaining the data on an internal structure
The goal of this library is to make ODBC recordsets look just like an STL container. As a user, you can move through our containers using standard STL iterators and if you insert(), erase() or replace() records in our containers changes can be automatically committed to the database for you. The library s compliance with the STL iterator and container standards means you can plug our abstractions into a wide variety of STL algorithms for data storage, searching and manipulation. In addition, the C++ reflection mechanism used by our library to bind to database tables allows us to add generic indexing and lookup properties to our containers with no special code required from the end-user. Because our code takes full advantage of the template mechanism, it adds minimal overhead compared with using raw ODBC calls to access a database.
penMesh is a generic and efficient data structure for representing and manipulating polygonal meshes. OpenMesh is developed at the Computer Graphics Group, RWTH Aachen , as part of the OpenSGPlus project, is funded by the German Ministry for Research and Education ( BMBF), and will serve as geometry kernel upon which the so-called high level primitives (e.g. subdivision surfaces or progressive meshes) of OpenSGPlus are built.
It was designed with the following goals in mind :
Flexibility : provide a basis for many different algorithms without the need for adaptation.
Efficiency : maximize time efficiency while keeping memory usage as low as possible.
Ease of use : wrap complex internal structure in an easy-to-use interface.
In 1960, R.E. Kalman published his famous paper describing a recursive solution
to the discrete-data linear filtering problem. Since that time, due in large part to advances
in digital computing, the Kalman filter has been the subject of extensive research
and application, particularly in the area of autonomous or assisted
navigation.
Streaming refers to the ability of an application to play synchronised media streams like audio and video streams in a continuous way while those streams are being transmitted to the client over a data network.
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.
This simulation script set allows for an OFDM transmission to be
simulated. Imagetx.m generates the OFDM signal, saving it as a
windows WAV file. This allows the OFDM signal to be played out a sound
card and recorded back. Imagerx.m decodes the WAV to extract the
data.
settings.m contains all the common settings to specify all the
simulation parameters such as FFT size, number of carriers,
input data source file, input and output WAV files, etc.
This book is the most accurate and up-to-date source of information the STL currently available. ... It has an approach and appeal of its own: it explains techniques for building data structures and algorithms on top of the STL, and in this way appreciates the STL for what it is - a framework. Angelika Langer, Independent Consultant and C++ Report Columnist "A superbly authored treatment of the STL......an excellent book which belongs in any serious C++ developer s library." Jim Armstrong, President 2112 F/X, Texas. \n
The C++ Standard Template Library (STL) represents a breakthrough in C++ programming techniques. With it, software developers can achieve vast improvements in the reliability of their software, and increase their own productivity.
Developers use algorithms and data structures every day of their working lives. Having a good under-standing of these algorithms and knowledge of when to apply them is essential to producing softwarethat not only works correctly, but also performs efficiently.
This book aims to explain those algorithms and data structures most commonly encountered in day-to-day software development, while remaining at all times practical, concise, and to the point, with little orno verbiage to distract from the core concepts and examples.
