siptapi
A TAPI driver for SIP. With this TAPI driver you have a click2dial feature with any TAPI enabled application (e.g. MS Outlook) and any SIP account (e.g. freeworlddialup or iptel.org).
UC Library Extensions
UnderC comes with a pocket implementation of the standard C++ libraries, which is a reasonably faithful subset. This documentation describes those UnderC functions and classes which are not part of the C++ standard.
UC Library
Builtin functions:
Most of these are standard C functions, but there are a few unique to the UnderC system which give you runtime access to the compiler. You may evaluate expressions, execute commands, compile code, etc.
* Expands the text in expr using the UnderC preprocessor, putting the result
into buff.
void uc_macro_subst(const char* expr, char* buff, int buffsize)
* Executes a UC #-command, like #l or #help.
uc_cmd() expects the name of the command, _without_ the hash,
e.g. uc_cmd("l fred.cpp") or uc_cmd("help").
void uc_cmd(const char* cmd)
* Evaluates any C++ expression or statement will return non-zero if
unsuccessful.
today bought a book, reflected good to upload source code package. 1. Based on the struts of customer information management system 2. Struts-based personnel management system 3. Office log system 4. E-government management system 5. Food industry Invoicing System 6 SMS Data Acquisition System
TFIND
searches for one or more strings (boolean AND) in a text file.
TFIND reports all lines where the string(s) were found (or NOT found
by option).
The search can be limited to a field in a fixed field (i.e. column
oriented) list.
An extended search mode is available, where only letters and digits
are relevant.
Other options:
case sensitive search,
alternative errorlevel with number of hits,
header line with file name, LFN, custom prefix
這是一個模擬第3類模式地震波的matlab腳本。
This a collection of Matlab scripts that solve the antiplane
(mode III) earthquake dynamic problem with slip-weakening friction,
on a 1D fault embedded in a 2D homogeneous elastic unbounded medium.
The problem is formulated as a boundary integral equation
and the elastodynamic kernels are analytically derived in
the spectral domain (spatial wavenumber).
The method is explained e.g. by Morrysey and Geubelle (1997),
and has been improved and extensively used by Nadia Lapusta,
Alain Cochard, etc.
Floyd-Warshall算法描述
1)適用范圍：
a)APSP(All Pairs Shortest Paths)
b)稠密圖效果最佳
c)邊權可正可負
2)算法描述：
a)初始化：dis[u,v]=w[u,v]
b)For k:=1 to n
For i:=1 to n
For j:=1 to n
If dis[i,j]>dis[i,k]+dis[k,j] Then
Dis[I,j]:=dis[I,k]+dis[k,j]
c)算法結束：dis即為所有點對的最短路徑矩陣
3)算法小結：此算法簡單有效，由于三重循環結構緊湊，對于稠密圖，效率要高于執行|V|次Dijkstra算法。時間復雜度O(n^3)。
考慮下列變形：如(I,j)∈E則dis[I,j]初始為1,else初始為0，這樣的Floyd算法最后的最短路徑矩陣即成為一個判斷I,j是否有通路的矩陣。更簡單的，我們可以把dis設成boolean類型，則每次可以用“dis[I,j]:=dis[I,j]or(dis[I,k]and dis[k,j])”來代替算法描述中的藍色部分，可以更直觀地得到I,j的連通情況。
