NetGUI v0.4.1 INSTALL Instructions Pedro de las Heras Quiros pheras@gmail.com 1. Install netkit (www.netkit.org) 2. Compile src/*java 3. mv src/*class bin 4. Edit and adapt bin/netgui.sh 5. RUN bin/netgui.sh
标签： Instructions INSTALL NetGUI Pedro
上传时间： 2013-12-20
上传用户：虫虫虫虫虫虫
Main program RUNning when workpiece is ready on deferent belt(deferent_ready=ture). * Call Square_Wave subroutine to generate 0.5ms square wave on P1.2 to drive * electromotor,then drive deferent belt step forward. When it steps to the measure * zone, it stops to be measured. Then call A_D subroutine to transform analog * signals to digital signals , after then call serial subroutine to transfer * digital signals to PC. Call square wave subroutine to drive deferent belt step to * original position waitting for defere ready flag to RUN the next circle.
标签： deferent_ready workpiece deferent program
上传时间： 2017-08-31
上传用户：baiom
谭浩强C语言word版 1 C语言概述 2 1.1 Ｃ语言的发展过程 2 1.2 当代最优秀的程序设计语言 2 1.3 Ｃ语言版本 2 1.4 Ｃ语言的特点 3 1.5 面向对象的程序设计语言 3 1.6 Ｃ和Ｃ＋＋ 3 1.7 简单的Ｃ程序介绍 4 1.8 输入和输出函数 5 1.9 Ｃ源程序的结构特点 6 1.10 书写程序时应遵循的规则 6 1.11 Ｃ语言的字符集 6 1.12 Ｃ语言词汇 7 1.13 Turbo C 2.0集成开发环境的使用 8 1.13.1 Turbo C 2.0简介和启动 8 1.13.2 Turbo C 2.0集成开发环境 8 1.13.3 File菜单 9 1.13.4 Edit菜单 10 1.13.5 RUN菜单 11 1.13.6 Compile菜单 12 1.13.7 Project菜单 13 1.13.8 Options菜单 14 1.13.9 Debug菜单 18 1.13.10 Break/watch菜单 19 1.13.11 Turbo C 2.0的配置文件 20
上传时间： 2014-01-20
上传用户：奇奇奔奔
The RUNning time of quicksort can be improved in practice by taking advantage of the fast RUNning time of insertion sort when its input is “nearly” sorted. When quicksort is called on a subarray with fewer than k elements, let it simply return without sorting the subarray. After the top-level call to quicksort returns, RUN insertion sort on the entire array to finish the sorting process.
标签： RUNning advantage quicksort improved
上传时间： 2013-12-01
上传用户：梧桐
TdcHintEx Provides your users with a cool transparent hint. It replaces standard Delphi hint window. Just drop a TdcHintEx in your main form. Set Enabled to True. And RUN your application. Oh btw, please set ShowHint to True.. :) Drop me a line, and tell me what you think of it. Antony Hoon antony7777@telkom.net
标签： hint transparent TdcHintEx Provides
上传时间： 2014-01-12
上传用户：181992417
svd 算法代码 This directory contains instrumented SVDPACKC Version 1.0 (ANSI-C) programs for compiling within the "svdRUN" script. The "svdsum" script can be RUN after all output files of the form <dataset>.outN, where N=1,2,... have been produced by svdRUN. more details please read the file readme!
标签： instrumented directory compiling SVDPACKC
上传时间： 2017-09-24
上传用户：manking0408
SharpPcap c#抓包实现时时获取网卡信息 SharpPcap tutorial: a step by step guide to using SharpPcap The text of this tutorial is taken directly from WinPcap's official tutorial but is modified to show the C# use of the SharpPcap library. All examples can be downloaded together with SharpPcap source code from SharpPcap 's homepage. The WinPcap library must be installed before attempting to RUN any of these examples, so please download and install the latest version from WinPcap's download page. SharpPcap was written and tested using .NET v1.1 and Windows 2000/XP. I have no idea about other .NET and Windows versions. If you do try it, please report your results. The following topics are covered in this tutorial: Obtaining the device list Obtaining advanced information about installed devices Opening an adapter and capturing packets Capturing packets without the event handler Filtering the traffic Interpreting the packets Handling offline dump files Sending Packets Gathering Statistics on the network traffic 1. Obtaining the device list
上传时间： 2015-07-06
上传用户：muzongda
matlab有限元网格划分程序 DistMesh is a simple MATLAB code for generation of unstructured triangular and tetrahedral meshes. It was developed by Per-Olof Persson (now at UC Berkeley) and Gilbert Strang in the Department of Mathematics at MIT. A detailed description of the program is provided in our SIAM Review paper, see documentation below. One reason that the code is short and simple is that the geometries are specified by Signed Distance Functions. These give the shortest distance from any point in space to the boundary of the domain. The sign is negative inside the region and positive outside. A simple example is the unit circle in 2-D, which has the distance function d=r-1, where r is the distance from the origin. For more complicated geometries the distance function can be computed by interpolation between values on a grid, a common representation for level set methods. For the actual mesh generation, DistMesh uses the Delaunay triangulation routine in MATLAB and tries to optimize the node locations by a force-based smoothing procedure. The topology is regularly updated by Delaunay. The boundary points are only allowed to move tangentially to the boundary by projections using the distance function. This iterative procedure typically results in very well-shaped meshes. Our aim with this code is simplicity, so that everyone can understand the code and modify it according to their needs. The code is not entirely robust (that is, it might not terminate and return a well-shaped mesh), and it is relatively slow. However, our current research shows that these issues can be resolved in an optimized C++ code, and we believe our simple MATLAB code is important for demonstration of the underlying principles. To use the code, simply download it from below and RUN it from MATLAB. For a quick demonstration, type "meshdemo2d" or "meshdemond". For more details see the documentation.
标签： matlab有限元网格划分程序
上传时间： 2015-08-12
上传用户：凛风拂衣袖
Computational models are commonly used in engineering design and scientific discovery activities for simulating complex physical systems in disciplines such as fluid mechanics, structural dynamics, heat transfer, nonlinear structural mechanics, shock physics, and many others. These simulators can be an enormous aid to engineers who want to develop an understanding and/or predictive capability for complex behaviors typically observed in the corresponding physical systems. Simulators often serve as virtual prototypes, where a set of predefined system parameters, such as size or location dimensions and material properties, are adjusted to improve the performance of a system, as defined by one or more system performance objectives. Such optimization or tuning of the virtual prototype requires executing the simulator, evaluating performance objective(s), and adjusting the system parameters in an iterative, automated, and directed way. System performance objectives can be formulated, for example, to minimize weight, cost, or defects; to limit a critical temperature, stress, or vibration response; or to maximize performance, reliability, throughput, agility, or design robustness. In addition, one would often like to design computer experiments, RUN parameter studies, or perform uncertainty quantification (UQ). These approaches reveal how system performance changes as a design or uncertain input variable changes. Sampling methods are often used in uncertainty quantification to calculate a distribution on system performance measures, and to understand which uncertain inputs contribute most to the variance of the outputs. A primary goal for Dakota development is to provide engineers and other disciplinary scientists with a systematic and rapid means to obtain improved or optimal designs or understand sensitivity or uncertainty using simulationbased models. These capabilities generally lead to improved designs and system performance in earlier design stages, alleviating dependence on physical prototypes and testing, shortening design cycles, and reducing product development costs. In addition to providing this practical environment for answering system performance questions, the Dakota toolkit provides an extensible platform for the research and rapid prototyping of customized methods and meta-algorithms
标签： Optimization and Uncertainty Quantification
上传时间： 2016-04-08
上传用户：huhu123456
该代码用于视频中背景与前景的分离 RUN "TestGoDec" firstly for testing the background modeling by GoDec on Hall dataset. RUN "TestSSGoDec" firstly for testing the background modeling by Semi-Soft GoDec on Hall dataset. The time cost on my PC is 8.75s, which is >4 times faster than ordinary GoDec.
标签： GoDec
上传时间： 2016-04-25
上传用户：shiaijianjun
