MemoryMonitor demonstrates the use of the java.lang.management API in observing the memory usage of all memory pools consumed by the application. This simple demo program queries the memory usage of each memory pool and plots the memory usage history graph. To run the MemoryMonitor demo java -jar <JDK_HOME>/demo/management/MemoryMonitor.jar
标签： the MemoryMonitor demonstrates management
上传时间： 2015-12-04
上传用户：bcjtao
An AHB system is made of masters slaves and interconnections. A general approach to include all possible "muxed" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph where every source node is a master, every destination node is a slave and every internal node is an arbiter there must be one and only one arc exiting a master and one or more entering a slave (single slave verus multi-slave or arbitrated slave) an arbiter can have as many input and output connections as needed. A bridge is a special node that collapses one or more slave nodes and a master node in a new "complex" node.
标签： interconnections approach general include
上传时间： 2015-12-12
上传用户：lyy1234
out< "please input the number of the nodes"<<endl cin>>nodesNum cout<<"please input the graph"<<endl for( i = 1 i<=nodesNum i++) for( j = 1 j <= nodesNum j++) cin>>graph[i][j] */
上传时间： 2013-11-29
上传用户：libinxny
All programs were tested using a breadboard containing a DS80C320, 32K Program memory, 32K Data memory, two 8-segment bar graph LEDs/drivers, and an 11.0592 MHz crystal. The four 8-segment bar graph LEDs/drivers were connected to ports 1, and 3 to display their pins states.
标签： breadboard containing 32K programs
上传时间： 2016-03-29
上传用户：qq1604324866
Intro/: Directory containing introductory examples. HelloWorld.c A simple program that draws a box and writes "Hello World" in HelloWorld.f it. data The data file for the introductory progressive example. Lines.c Reads the data from file "data" and plots just the curve with Lines.f no labels, viewport or anything indicating quantity or units. Viewport.c Restricts the graph to a viewport and frames the viewport, Viewport.f leaving the remainder of the area for labels, etc. CharLbls.c Adds labels for the chart title, X-axis title, and Y-axis CharLbls.f title. Tics.c Adds tic marks to the viewport edges, but since clipping was Tics.f not set correctly, tics extend outside the viewport. Clip.c Sets clipping such that tic marks are clipped at the viewport Clip.f boundaries. TicLabels.c Adds numeric tic labels to the graph this is the final TicLabels.f installment of the progressive example.
标签： introductory HelloWorld containing Directory
上传时间： 2016-03-29
上传用户：exxxds
％％％ Demos for PUMA algorithms ％％％ We present four matlab demos for PUMA. demo1, demo2, demo3, and demo4 illustrate PUMA working with different parameters and with four different images. All you need to do is to run each of the demos. Please be sure that all the files are put on an accessible path for matlab. Notice that this code is intended for research purposes only. For further reference see "Phase Unwrapping via graph Cuts, IEEE Transactions on Image Processing, 2007
标签： demo PUMA algorithms for
上传时间： 2016-04-23
上传用户：fhzm5658
a sample WDM stream class video capture driver that supports two IEEE 1394 digital cameras. The same driver may be able to support other digital cameras that conform to 1394-based Digital Camera Specification from 1394 Trade Association. Digital camera supported by dcam.sys is a data source that produces digital image data without any other input connection. It manifests itself in a DirectShow graph as a WDM Streaming Capture Device and as a capture filter that has output capture stream supporting image sizes of 320x240 with a UYVY color space. Its de-compressor, Msyuv.dll, is part of the OS delivery, and it can convert image data format from UYVY to RGB16, RGB8, or to a Direct Draw surface if the video card supports UYVY format.
标签： supports capture cameras digital
上传时间： 2014-01-13
上传用户：yph853211
图的遍历算法cpp程序，有类graph，可以直接创建对象调用相关函数，ACM比赛适用
上传时间： 2016-09-02
上传用户：stampede
图论算法库，包括以下算法： 单源最短路径 Dijkstra 算法 单源最短路径 Bellman-Ford 算法 最小生成树 Prim 算法 每对节点间最短路径 Flod-Warshall 算法 程序用C++语言编写，在VisualAge C++ 4.0下调试通过。压缩包内的graph.h文件包含所有的库函数，其调用接口见程序内注释。其他的文件是用来测试算法的测试程序，在VisualAge C++ 4.0下编译运行。 该算法是为参加ACM/ICPC竞赛而准备的资料，由于竞赛的对编程速度要求较高，所以为了将代码写的短一点，为了便于调试，代码的写的并不是最优的。 该代码在VisualAge C++ 4.0下写成，但是很容易将其移植到MS Visual C++上。
上传时间： 2016-10-28
上传用户：wangyi39
We propose a technique that allows a person to design a new photograph with substantially less effort. This paper presents a method that generates a composite image when a user types in nouns, such as “boat” and “sand.” The artist can optionally design an intended image by specifying other constraints. Our algorithm formulates the constraints as queries to search an automatically annotated image database. The desired photograph, not a collage, is then synthesized using graph-cut optimization, optionally allowing for further user interaction to edit or choose among alternative generated photos. An implementation of our approach, shown in the associated video, demonstrates our contributions of (1) a method for creating specific images with minimal human effort, and (2) a combined algorithm for automatically building an image library with semantic annotations from any photo collection.
标签： substantially photograph technique propose
上传时间： 2016-11-24
上传用户：三人用菜
