This book is for systems architects who are interested in building security into their applications. The book is designed to be useful to architects in three ways: as an introduction to security architecture, as a handbook on security issues for architecture review, and as a catalog of designs to look for within a security product.
标签： application architects interested building
上传时间： 2014-01-24
上传用户：xwd2010
使用FPGA/CPLD设置语音AD、DA转换芯片AIC23，FPGA/CPLD系统时钟为24.576MHz 1、AIC系统时钟为12.288MHz，SPI时钟为6.144MHz 2、AIC处于主控模式 3、input bit length 16bit output bit length 16bit MSB first 4、帧同步在96KHz
上传时间： 2013-12-20
上传用户：二驱蚊器
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
Write a program to decide if a graph has a cycle or not. The given graph can be a directed or undirected graph, which is indicated at the time of reading the input (0 for directed graph and 1 for undirected graphs). The input is given as an adjacency list.
标签： graph directed program decide
上传时间： 2013-12-23
上传用户：cursor
Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.
标签： Multiplicative undirected Shortest measured
上传时间： 2017-04-08
上传用户：邶刖
In some graphs, the shortest path is given by optimizing two different metrics: the sum of weights of the edges and the number of edges. For example: if two paths with equal cost exist then, the path with the least number of edges is chosen as the shortest path. Given this metric, you have find out the shortest path between a given pair of vertices in the input graph. The output should be the number of edges on the path, the cost of the shortest path, and the path itself. Input is the adjacency matrix and the two vertices.
标签： optimizing different the shortest
上传时间： 2014-10-25
上传用户：1159797854
Java Media APIs: Cross-Platform Imaging, Media, and Visualization presents integrated Java media solutions that demonstrate the best practices for using this diverse collection. According to Sun MicroSystems, "This set of APIs supports the integration of audio and video clips, animated presentations, 2D fonts, graphics, and images, as well as speech input/output and 3D models." By presenting each API in the context of its appropriate use within an integrated media application, the authors both illustrate the potential of the APIs and offer the architectural guidance necessary to build compelling programs.
标签： Media Java Cross-Platform Visualization
上传时间： 2013-12-04
上传用户：hanli8870
This code implements the arithmetic coding algorithm used for text compression. At present it takes an input of fixed length but that can be modified in the code as required.
标签： compression arithmetic implements algorithm
上传时间： 2017-04-18
上传用户：wangzhen1990
pHash is an implementation of various perceptual hashing algorithms. A perceptual hash is a fingerprint of an audio, video, or image file that is mathematically based on the audio or visual content contained within. Unlike cryptographic hash functions that rely on the avalanche effect of small changes in input leading to drastic changes in the output, perceptual hashes are "close" to one another if the inputs are visually or auditorily similar. As a result, perceptual hashes must also be robust enough to take into account transformations that could have been performed on the input.
标签： perceptual implementation algorithms fingerpr
上传时间： 2013-12-08
上传用户：星仔
windows xp 的DOS批命令中接受一个键盘输入的字符（... ? C语言，如何给下面代码加一个是否继续计算Y/N? ? 运行时please input the name:，然后直接是are you s... ? 输入Y？N？后的值为？
上传时间： 2013-11-28
上传用户：15071087253
