c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.
标签： fault-tolerant algorithms redundant underlyin
上传时间： 2013-12-18
上传用户：jkhjkh1982
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
Professional Android Application Development,英文,内容详尽,适合进阶 Chapter 1: Hello, Android . . . . . . . . . . . . . . . . . . . . .. . Chapter 2: Getting Started . . . . . . . . . . . . . . . . . . . .. . Chapter 3: Creating Applications and Activities . . . . . . . . . . . Chapter 4: Creating User Interfaces . . . . . . . . . . . . . . . .. . Chapter 5: Intents, Broadcast Receivers, Adapters, and the Internet113 Chapter 6: Data Storage, Retrieval, and Sharing . . . . . . . . . .. . Chapter 7: Maps, Geocoding, and Location-Based Services . . . . . .. Chapter 8: Working in the Background . . . . . . . . . . . . . . . . . Chapter 9: Peer-to-Peer Communication . . . . . . . . . . . . . . .. . Chapter 10: Accessing Android Hardware . . . . . . . . . . . . . . . . Chapter 11: Advanced Android Development . . . . . . . . . . . . .. . Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
标签： Android Professional Application Development
上传时间： 2013-12-12
上传用户：aig85
In C Algorithms for Real-Time DSP, author Paul M. Embree presents a complete guide to digital signal processing techniques in the C programming language. This book is structured in such a way that it will be most useful to the engineer who is familiar with DSP and the C language, but who is not necessarily an expert in both. All of the example programs in this book have been tested using standard C compilers in the UNIX and MS-DOS programming environments. In addition, the examples have been compiled using the real-time programing tools of specific real-time embedded DSP microprocessors (Analog Devices ADSP-21020 and ADSP-21062 Texas Instruments TMS320C30 and TMS320C40 and AT&T DSP32C) and then tested with real-time hardware using real-world signals.
标签： M. Algorithms Real-Time complete
上传时间： 2014-01-07
上传用户：epson850
将魔王的语言抽象为人类的语言：魔王语言由以下两种规则由人的语言逐步抽象上去的：α-〉β1β2β3…βm ；θδ1δ2…-〉θδnθδn-1…θδ1 设大写字母表示魔王的语言，小写字母表示人的语言B-〉tAdA，A-〉sae，eg：B(ehnxgz)B解释为tsaedsaeezegexenehetsaedsae对应的话是：“天上一只鹅地上一只鹅鹅追鹅赶鹅下鹅蛋鹅恨鹅天上一只鹅地上一只鹅”。(t-天d-地s-上a-一只e-鹅z-追g-赶x-下n-蛋h-恨)
上传时间： 2013-12-19
上传用户：aix008
If you d like to know where visitors to your site live, add this to your feedback forms. They just choose a region, and the second menu changes appropriately, allowing them to choose their country. (If they choose USA, it allows them to select their state) Neat!
上传时间： 2017-06-11
上传用户：wfeel
I would like to thank my advisor, Dr. A. Lynn Abbott, for helping me throughout my research, Gary Fleming and the rest of the people at NASA Langley who provided all the flight information and image sequences, and my parents who supported me in my decision to enter graduate study. Also, thanks to Phichet Trisirisipal and Xiaojin Gong for helping when I had computer vision questions, and Nathan Herald for his help creating an illustration.
标签： A. throughout research advisor
上传时间： 2017-06-18
上传用户：maizezhen
FACE RECOGNITION USING PRINCIPAL COMPONENTS ANALYSIS task. To this package four options for the algorithms, the LVQ1, the LVQ2.1, the LVQ3 and the OLVQ1, have been selected.
标签： RECOGNITION COMPONENTS PRINCIPAL ANALYSIS
上传时间： 2017-06-22
上传用户：comua
本代码为编码开关代码，编码开关也就是数字音响中的 360度旋转的数字音量以及显示器上用的（单键飞梭开 关）等类似鼠标滚轮的手动计数输入设备。 我使用的编码开关为5个引脚的，其中2个引脚为按下 转轮开关（也就相当于鼠标中键）。另外3个引脚用来 检测旋转方向以及旋转步数的检测端。引脚分别为a,b,c b接地a，c分别接到P2.0和P2.1口并分别接两个10K上拉 电阻，并且a，c需要分别对地接一个104的电容，否则 因为编码开关的触点抖动会引起轻微误动作。本程序不 使用定时器，不占用中断，不使用延时代码，并对每个 细分步数进行判断，避免一切误动作，性能超级稳定。 我使用的编码器是APLS的EC11B可以参照附件的时序图 编码器控制流水灯最能说明问题，下面是以一段流水 灯来演示。
上传时间： 2017-07-03
上传用户：gaojiao1999
【问题描述】 在一个N*N的点阵中，如N=4,你现在站在（1，1），出口在（4，4）。你可以通过上、下、左、右四种移动方法，在迷宫内行走，但是同一个位置不可以访问两次，亦不可以越界。表格最上面的一行加黑数字A[1..4]分别表示迷宫第I列中需要访问并仅可以访问的格子数。右边一行加下划线数字B[1..4]则表示迷宫第I行需要访问并仅可以访问的格子数。如图中带括号红色数字就是一条符合条件的路线。 给定N，A[1..N] B[1..N]。输出一条符合条件的路线，若无解，输出NO ANSWER。（使用U，D，L，R分别表示上、下、左、右。） 2 2 1 2 （4，4） 1 （2，3） （3，3） （4，3） 3 （1，2） （2，2） 2 （1，1） 1 【输入格式】 第一行是数m (n < 6 )。第二行有n个数，表示a[1]..a[n]。第三行有n个数，表示b[1]..b[n]。 【输出格式】 仅有一行。若有解则输出一条可行路线，否则输出“NO ANSWER”。
标签： 点阵
上传时间： 2014-06-21
上传用户：llandlu
