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.
The source code for this package is located in src/gov/nist/sip/proxy. The proxy
is a pure JAIN-SIP application: it does not need proprietary nist-sip
classes in addition of those defined in JAIN-SIP 1.1, you can substitute
the NIST-SIP stack by another JAIN-SIP-1.1 compliant stack and it should
interoperate.
he proxy can act as presence server and be able to process NOTIFY and
SUBSCRIBE requests. If this parameter is disabled, the proxy will simply
forward those kind of requests following the appropriate routing decision.
This a small hack I wrote to bypass the "No previous installation!" error of Microchip s C18 Upgrade.
simply run C18Fake and select your C18 installation directory (create if necessary) and click Save button. A "fake" file will now be created into that directory, and this will fool the Upgrade into thinking you already have a former legit installation.
After that you run the C18 Upgrade setup and select the same directory you created/selected before.
Your installation will now begin installing the full C18 package.
dkcs_ddos_bot, written on VC++ 7.10
with admin panel on PHP (MqSQL as database server).
Command list in archive, simply inject into explorer.exe. Create an army of bots. You can manage every bot, or all bots/bots in selected country
Abstract
The Lucene Server project is an attempt to extend the Jakarta Lucene tool with server capabilities.
Lucene is a robust Java API that enables you creating indexes from text sources and perform powerful searches on these indexes. With Lucene, creating an index must be done programmatically and there are almost no possibilities of integrating index management in a distributed environment. In other words, out of the box, Lucene is suitable for integrating indexing and searching possibilities in a single application but not for providing index/search services for multiple applications.
The Lucene Server project comes with a Java API that propose the following
make it easy to create indexes in a declarative way by simply providing an XML configuration document.
make it easy to personalize the way Lucene must handle different kind of data sources.
provide services for index management and searching that can be accessed from several applications.
enable batch tasks scheduling.
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
This directory contains the Genetic Algorithm Optimization Toolbox for
Matlab
To use this, if you are local to NCSU and have AFS access to this
directory, simply extend the matlab path using the following command.
You can also place this command in a file called startup.m. Everytime
you start Matlab in the directory containing this file, the path will
always be extended.
Synthesizable FIFO Model
This example describes a synthesizable implementation of a FIFO. The FIFO depth and FIFO width in bits can be modified by simply changing the value of two parameters, `FWIDTH and `FDEPTH. For this example, the FIFO depth is 4 and the FIFO width is 32 bits.
Hibernate: A Developer s Notebook shows you how to use Hibernate to automate persistence: you write natural Java objects and some simple configuration files, and Hibernate automates all the interaction between your objects and the database. You don t even need to know the database is there, and you can change from one database to another simply by changing a few statements in a configuration file. If you ve needed to add a database backend to your application, don t put it off. It s much more fun than it used to be, and Hibernate: A Developer s Notebook shows you why.
// This Communications Component is implemented using separate Read and Write
// threads. Messages from the threads are posted to the Comm control which is
// an invisible window. To handle data from the comm port, simply
// attach a handler to OnReceiveData . There is no need to free the memory
// buffer passed to this handler. If TAPI is used to open the comm port, some
// changes to this component are needed ( StartComm currently opens the comm
// port). The OnRequestHangup event is included to assist this.
//
// David Wann
// Stamina Software
// 28/02/96
// davidwann@hunterlink.net.au
