What Does the code DO? Sometimes we may desire to hide our file contents from others.One of the possible way is encrypting these files.Here a simple encryption technique is used(In VB - The same technique can be implemented in "c" also.) Program flow Explained * Open the File to be encrypted for Binary Access Read(Say Source File) * Open a temparory file where encrypted data is stored for Binary Access Write(Say Destination File) * Loop through the Source File Byte by Byte * For each byte read from the file, Complement the data. (Using Not operator (in C we have to use "~" operator) * Write Complemented Data to Destination File * Delete the Source File * Rename Destination file as Source File(Now Encryption is over)
This document contains a general overview in the first few sections as well as a more detailed reference in later sections for SVMpython. If you re already familiar with SVMpython, it s possible to get a pretty good idea of how to use the package merely by browsing through svmstruct.py and multiclass.py. This document provides a more in depth view of how to use the package.
Note that this is not a conversion of SVMstruct to Python. It is merely an embedding of Python in existing C code. All code other than the user implemented API functions is still in C, including optimization.
Triscend supports the use of the Model Technology ModelSim logic simulator for VHDL simulation of
designs implemented in the Configurable System Logic (CSL) portion of a Triscend device.
We present a particle filter construction for a system that exhibits
time-scale separation. The separation of time-scales allows two simplifications
that we exploit: i) The use of the averaging principle for the
dimensional reduction of the system needed to solve for each particle
and ii) the factorization of the transition probability which allows the
Rao-Blackwellization of the filtering step. Both simplifications can be
implemented using the coarse projective integration framework. The
resulting particle filter is faster and has smaller variance than the particle
filter based on the original system. The convergence of the new
particle filter to the analytical filter for the original system is proved
and some numerical results are provided.
cpress usb 芯片Vender 處理固件。
The purpose of this software is to demonstrate how
to implement vendor specific commands.
The following vendor specific commands are implemented:
A0 Firmware Upload/Download
A2 EEProm Load
A3 External Ram Load
A4 Set I2C Addr
A5 Get IIC Type (1 Byte or 2 Byte EEPROM)
A6 Get Chip Rev
A8 Renumerate
The algorm of viterbi. You talk to your friend three days in a row and discover that on the first day he went for a walk, on the second day he went shopping, and on the third day he cleaned his apartment. You have two questions: What is the overall probability of this sequence of observations? And what is the most likely sequence of rainy/sunny days that would explain these observations? The first question is answered by the forward algorithm the second question is answered by the Viterbi algorithm. These two algorithms are structurally so similar (in fact, they are both instances of the same abstract algorithm) that they can be implemented in a single function:
CANopen is a networking system based on the CAN serial bus.
CANopen assumes that the device’s hardware has a CAN transceiver
and CAN controller as specified in ISO 11898.
CANopen profile family specifies standardized communication
mechanisms and device functionality. The profile family is available
and maintained by CAN in Automation (CiA), the international users’
and manufacturers’ group and may be implemented license-free.
This sample provides an implementation of simple Bluetooth device discovery
via the Winsock 2 API. It provides a listbox control which, when searching
is complete, lists the discovered Bluetooth devices. Only names of the devices
are displayed, but the addresses of the devices are also retrieved, and can
be used to query the devices for more information (not implemented)
高效的k-means算法實(shí)現(xiàn)，使用了k-d樹與局部搜索等提高k-means算法的執(zhí)行效率，同時(shí)包含示例代碼，用c++代碼實(shí)現(xiàn)。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.
