The combinatorial core of the OVSF code ASSIGNment problem
that arises in UMTS is to ASSIGN some nodes of a complete binary
tree of height h (the code tree) to n simultaneous connections, such that
no two ASSIGNed nodes (codes) are on the same root-to-leaf path. Each
connection requires a code on a specified level. The code can change over
time as long as it is still on the same level. We consider the one-step code
ASSIGNment problem: Given an ASSIGNment, move the minimum number of
codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm
to solve the problem optimally. We show that DCA does not
always return an optimal solution, and that the problem is NP-hard.
We give an exact nO(h)-time algorithm, and a polynomial time greedy
algorithm that achieves approximation ratio Θ(h). Finally, we consider
the online code ASSIGNment problem for which we derive several results
Your application should never ASSIGN a seat that has already been ASSIGNed. When the economy
section is full, your application should ask the person if it is acceptable to be placed in
the first-class section (and vice versa). If yes, make the appropriate seat ASSIGNment.
6小時學會labview,
labview Six Hour Course – Instructor Notes
This zip file contains material designed to give students a working knowledge of labview in a 6 hour timeframe. The contents are:
Instructor Notes.doc – this document.
labviewIntroduction-SixHour.ppt – a PowerPoint presentation containing screenshots and notes on the topics covered by the course.
Convert C to F (Ex1).vi – Exercise 1 solution VI.
Convert C to F (Ex2).vi – Exercise 2 solution subVI.
Thermometer-DAQ (Ex2).vi – Exercise 2 solution VI.
Temperature Monitor (Ex3).vi – Exercise 3 solution VI.
Thermometer (Ex4).vi – Exercise 4 solution subVI.
Convert C to F (Ex4).vi – Exercise 4 solution subVI.
Temperature Logger (Ex4).vi – Exercise 4 solution VI.
Multiplot Graph (Ex5).vi – Exercise 5 solution VI.
Square Root (Ex6).vi – Exercise 6 solution VI.
State Machine 1 (Ex7).vi – Exercise 7 solution VI.
The slides can be presented in two three hour labs, or six one hour lectures. Depending on the time and resources available in class, you can choose whether to ASSIGN the exercises as homework or to be done in class. If you decide to ASSIGN the exercises in class, it is best to ASSIGN them in order with the presentation. This way the students can create VI’s while the relevant information is still fresh. The notes associated with the exercise slide should be sufficient to guide the students to a solution. The solution files included are one possible solution, but by no means the only solution.
Explain how to open the Waveform Viewer for Verification
? State how to insert nodes into the Waveform Viewer
? Tell how to ASSIGN Stimulus with the Stimulator Selector
