一款可以收看电视的手机软件。工程模式：*#55*#,触摸IC：Tsc2046，TV IC：TLG1100GC，cpu：mt6225a，Flash：71PL127NBOHFW4U，电源：mt6318a；射频：mt6139bn，双卡切换：mt6302n
上传时间： 2013-12-24
上传用户：时代电子小智
自己做的数据结构实验题（合并链表，huffman tree,表达式求值）
上传时间： 2016-12-31
上传用户：redmoons
专家点评: Y P7 `. @ {$ r％ pa.功能很强大，可以看出花了很多心血在算法上，非常好。算法上还有一点瑕疵，例如在删除一个员工的同时没有办法自动建立其他员工的上下级关系，必须删除全部下级员工，不是非常合理。此外，界面设计过于简单，应该加强. " W" R+ b* g$ a$ Sb.程序运用了自己的算法来提高Tree控件显示的速度和资源分配，这个非常值得肯定和鼓励。* C. c4 D0 e9 ` J$ w# U c.基本实现所有规定的功能，在所有参赛者中唯一熟 : O) l- F6 F9 f) S7 Q. l练使用面向对象设计方式开发程序的工程师，很不错！程序体现了作者非常扎实的数据结构功底，值得大家学习。工程管理也做得非常好，体现了作者在软件工程方面也有很深入的研究，该代码是很好的学习范例。 ％ G* H$ ~3 W1 ]. e! id.算法的创新是独特之处(hashtable算法建立),可见作者在数据结构方面的熟练掌握.此程序是很多专家会员学习典范.
上传时间： 2017-01-19
上传用户：奇奇奔奔
IDL中用于显示二维图像的函数，可直接调用。IDL中已有的TV函数可显示二维图像。本函数。是在TV基础上功能的加强。如可利用position指定图像在窗口的的位置等。
上传时间： 2013-12-30
上传用户：时代电子小智
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
其乐达(Cheertek)LCD驱动芯片(CT675)的C51源代码，代码结构清晰，可读性强。该芯片整合了Video-Decoder, Scalar, T-con及LED Backlight Driver，可驱动3.5~10.2”模拟/数字屏；接收输入信号CVBS/S-video/RGB/YCbCr/CCIR656。目前该方案主要应用产品有Portable DVD/Portable TV/Car TV/数码相框/可视门铃等中小尺寸视频产品。
上传时间： 2013-12-12
上传用户：风之骄子
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
读取XML信息，显示在tree上。并且提供各种控制功能
上传时间： 2013-12-19
上传用户：gououo
This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe [1]. Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. Comparably as efficient as hashing, trie also provides flexibility on incremental matching and key spelling manipulation. This makes it ideal for lexical analyzers, as well as spelling dictionaries. See the details of the implementation at [2]: http://linux.thai.net/~thep/datrie/datrie.html Historically, this was first implemented as C++ classes in a library called midatrie [2], but later simplified and rewritten from scratch in C.
标签： implementation double-array representing structure
上传时间： 2013-12-10
上传用户：shinesyh
spoj dtree. Count the number of distinct elements in a given range. Usage is done using fenwick trees. Offline algorithm for queries
标签： distinct elements fenwick number
上传时间： 2014-01-20
上传用户：lhw888
