This set of simulation files performs a computational complexity performance comparison of the two methods mentioned in the paper. The source is ANSI-C compliant, hence any C-compiler can be used to compile the source code. It has been tested using Visual Studio.net C++ and TI code composer studio C compiler for the TMS320C6701. Note that the performance comparison may be different for different platforms.
This version of malloc for VxWorks contains two different algorithms. One is the BSD based Kingsley "bucket" allocator which has some unique fragmentation behavior. The other is Doug Lea s well tested allocator that tries to minimize fragmentation while keeping the speed/space requirements.
非常實用,可移植用作實現跨平臺的嵌入式的內存分配機制.
this file turber_code.rar have two file,file STBC.h is parameter,file STBC.cpp is computer.file STBC.cpp has very clean chinese explain
,so you can easy understand
CarSim is an application for the simulating the (simplified) movement of cars on a two-dimensional surface.
Package ope.carsim contains classes that represent the problem domain: cars and locations.
Package ope.carsim.gui contains a user interface for the application.
The LM158 series consists of two independent, high gain,
internally frequency compensated operational amplifiers
which were designed specifically to operate from a single
power supply over a wide range of voltages. Operation from
split power supplies is also possible and the low power
supply current drain is independent of the magnitude of the
power supply voltage.
If we have two individually sorted vectors "a" and "b" but they are not sorted with respect to each other and we want to merge them into vector "c" such that "c" is also a sorted vector. Then c=mergesorted(a,b) can be used.
Two functions, num2bin and bin2num are provided. num2bin takes a double and converts it to a binary string representation. bin2num is its inverse operation. It can be used in a numerical analysis course when floating point arithmetic is discussed.
This a two node test, requires a Coordinator
and an RFD. The coordinator and node simply
ping-pong a packet back and forth, and print
out the RSSI byte. The RFD waits before
bouncing it back, while the coordinator responds
immediately.
