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
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
本文是以數位訊號處理器DSP（Digital Singal Processor）之核心架構為主體的數位式溫度控制器開發，而其主要分為硬體電路與軟體程式兩部分來完成。而就硬體電路來看分為量測電路模組、DSP周邊電路及RS232通訊模組、輸出模組三個部分，其中在輸出上可分為電流輸出、電壓輸出以及binary command給加熱驅動裝置, RS232 除了可以與PC聯絡外也可以與具有CPU的熱能驅動器做命令傳輸。在計畫中分析現有工業用加熱驅動裝置和溫度曲線的關係，並瞭解其控制情況。軟體方面即是溫控器之中央處理器程式，亦即DSP控制程式，其中包括控制理論、感測器線性轉換程式、I/O介面及通訊協定相關程式。在控制法則上，提出一個新的加熱體描述模型，然後以前饋控制為主並輔以PID控制，得到不錯的控制結果。
标签： Processor Digital Singal DSP
上传时间： 2013-12-24
上传用户：zjf3110
Huffman codes In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0’s and 1’s? To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. This problem can by solved by using an extended binary tree which is used in the 2- way merging problem.
标签： telecommunication represent messages Huffman
上传时间： 2014-01-04
上传用户：x4587
All of Java s Input/Output (I/O) facilities are based on streams, which provide simple ways to read and write data of different types. Java provides many different kinds of streams, each with its own application. The universe of streams is divided into four large categories: input streams and output streams, for reading and writing binary data and readers and writers, for reading and writing textual (character) data. You re almost certainly familiar with the basic kinds of streams--but did you know that there s a CipherInputStream for reading encrypted data? And a ZipOutputStream for automatically compressing data? Do you know how to use buffered streams effectively to make your I/O operations more efficient? Java I/O, 2nd Edition has been updated for Java 5.0 APIs and tells you all you ever need to know about streams--and probably more.
标签： facilities streams provide Output
上传时间： 2013-12-17
上传用户：6546544
HDFDUMP and BRFDUMP are utility programs developed for use with MISR data files. HDFDUMP will extract data from a MISR file in the HDF-EOS grid format (MISR Level 1B2 and Level 2 files) and writes unformatted binary files. BRFDUMP calculates radiances and bidirectional reflectance factors (BRF) from MISR Level 1B2 files and creates unformatted binary files.
标签： HDFDUMP developed programs BRFDUMP
上传时间： 2017-04-02
上传用户：yy541071797
Very good Java Applet used to animate Inserting, Deleting and Searching (Preorder & Postorder algorithm) nodes in Binary Trees. This is a part of mine students project. You can use and redistribute the source code absolutelly free!
标签： Inserting Searching Postorder Deleting
上传时间： 2014-01-25
上传用户：虫虫虫虫虫虫
OTSU Gray-level image segmentation using Otsu s method. Iseg = OTSU(I,n) computes a segmented image (Iseg) containing n classes by means of Otsu s n-thresholding method (Otsu N, A Threshold Selection Method from Gray-Level Histograms, IEEE Trans. Syst. Man Cybern. 9:62-66 1979). Thresholds are computed to maximize a separability criterion of the resultant classes in gray levels. OTSU(I) is equivalent to OTSU(I,2). By default, n=2 and the corresponding Iseg is therefore a binary image. The pixel values for Iseg are [0 1] if n=2, [0 0.5 1] if n=3, [0 0.333 0.666 1] if n=4, ... [Iseg,sep] = OTSU(I,n) returns the value (sep) of the separability criterion within the range [0 1]. Zero is obtained only with images having less than n gray level, whereas one (optimal value) is obtained only with n-valued images.
标签： OTSU segmentation Gray-level segmented
上传时间： 2017-04-24
上传用户：yuzsu
A few drivers for the Motorola C380 s celluar phone hardware with a simple test application. It s configured to build a binary that is to be uploaded at 0x03fd0000 and run at 0x03fd0010
标签： application Motorola hardware drivers
上传时间： 2017-05-01
上传用户：zhangzhenyu
This is a Stack Class with Funtions Push,Pop, check Stack is Full or Empty Application: Change a number from Decimal to Binary
标签： Stack Application Funtions Change
上传时间： 2014-12-06
上传用户：变形金刚
Huffman codes 1.In telecommunication, how do we represent a set of messages, each with an access frequency, by a sequence of 0 s and 1 s? 2.To minimize the transmission and decoding costs, we may use short strings to represent more frequently used messages. 3.This problem can be solved by using an extended binary tree which is used in the 2-way merging problem. the sourse code is to encode and decode the Huffman.
标签： telecommunication represent messages Huffman
上传时间： 2013-12-22
上传用户：ztj182002
