Coriander is a GUI for controlling a Digital Camera (in the sense of
the IIDC specs issued by the 1394 Trade Association [1]). Due to the
properties of the IEEE1394 protocol, Coriander can control an IEEE1394
camera without interferring with the image flow from that camera. It
can thus be used to setup a camera with Coriander while the video flow
is used by another application
Program to simulate Rayleigh fading using a p-th order autoregressive model AR(p) according to
％ Baddour s work: "Autoregressive modeling for fading channel simulation"
1、 了解系統調用fork()、execl()、exit()、getpid()和waitpid()的功能和實現過程
2、 編寫一段程序實現以下功能：
a) 使用系統調用fork()創建兩個子進程
b) 父進程重復顯示字符串”parent:”，并使用函數getpid()顯示自己的進程ID。
c) 兩個子進程分別重復顯示字符串”child:”，并使用函數getpid()顯示自己的進程ID
3、 編寫一段程序實現以下功能：
a) 使用系統調用fork()創建一個子進程
b) 子進程顯示自己的進程ID和字符串": The child is calling an exec.\n"，然后通過execl()調用系統命令ps顯示當前運行的進程情況，從而更換自己的執行代碼，最后調用exit()結束。
c) 父進程顯示自己的進程ID和字符串” ": The parent is waiting for child to exit.\n "，然后調用waitpid()等待子進程結束，并在子進程結束后顯示”The parent exit.\n
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
OpenSG is a scenegraph system for realtime rendering, e.g. for Virtual Reality applications. It is just a library, not a full application.
This documentation contains descriptions of the internal classes and concepts, as well as a tutorial that explains how to use the system.
BNB20 Finds the constrained minimum of a function of several possibly integer variables.
％ Usage: [errmsg,Z,X,t,c,fail] =
％ BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...)
％
％ BNB solves problems of the form:
％ Minimize F(x) subject to: xlb <= x0 <=xub
％ A*x <= B Aeq*x=Beq
％ C(x)<=0 Ceq(x)=0
％ x(i) is continuous for xstatus(i)=0
％ x(i) integer for xstatus(i)= 1
％ x(i) fixed for xstatus(i)=2
％
* "Copyright (c) 2006 Robert B. Reese ("AUTHOR")"
* All rights reserved.
* (R. Reese, reese@ece.msstate.edu, Mississippi State University)
* IN NO EVENT SHALL THE "AUTHOR" BE LIABLE TO ANY PARTY FOR
* DIRECT, INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES ARISING OUT
* OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF THE "AUTHOR"
* HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
