Location:
Search - clos
Search list
Description: 在一个450*350的窗体上在下面放置两个按钮“Start”和“Close”,连续点击“Start”按钮会在窗体上显示多个彩色的小球，分别有红、绿、蓝三种颜色，小球不停的跳跃，碰到窗体的边缘则反弹。单击“Close”按钮则关闭整个程序-in a 450 * 350 on the Form placed in the following two button "Start" and "Clos e ", consecutive click on the" Start "button in the window showing the various colorful balls, red, green, three colors of blue, the ball kept jumping up and face were on the brink of Form rebound. Click "Close" button to turn off the whole process
Platform: |
Size: 2133 |
Author: wangyue |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 30955 |
Author: clark |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 34213 |
Author: clark |
Hits:
Description: 在一个450*350的窗体上在下面放置两个按钮“Start”和“Close”,连续点击“Start”按钮会在窗体上显示多个彩色的小球，分别有红、绿、蓝三种颜色，小球不停的跳跃，碰到窗体的边缘则反弹。单击“Close”按钮则关闭整个程序-in a 450* 350 on the Form placed in the following two button "Start" and "Clos e ", consecutive click on the" Start "button in the window showing the various colorful balls, red, green, three colors of blue, the ball kept jumping up and face were on the brink of Form rebound. Click "Close" button to turn off the whole process
Platform: |
Size: 2048 |
Author: wangyue |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 30720 |
Author: clark |
Hits:
Description: A program to find frequent itemsets with the relim algorithm (recursive elimination), which is inspired by the FP-growth algorithm, but does its work without prefix trees or any other complicated data structures. The main strength of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some data sets!), but the simplicity of its structure. Basically all the work is done in one recursive function of about 60-70 lines of code. The current version can only find free item sets. An extension to closed and maximal item sets is possible and may be available in the future.-A program to find frequent itemsets with th e relim algorithm (recursive elimination). which is inspired by the FP-growth algorithm, but does its work without prefix trees or any oth er complicated data structures. The main stren gth of this algorithm is not its speed (although it is not slow, but even outperforms apriori and eclat on some d was observed sets!) , but the simplicity of its structure. Basically all the work is done in one of recursive function about 60-70 lines of code. The current version c an only find free item sets. An extension to clos ed and maximal item sets is possible and may be av ailable in the future.
Platform: |
Size: 33792 |
Author: clark |
Hits:
Description: 4输入，4输出，clos网络所用，有利于连接处理器和处理器，处理器和存储器传输数据。-4 inputs, 4 outputs, clos network use is conducive to connecting the processor and processor, processor and memory to transfer data.
Platform: |
Size: 1024 |
Author: davidsun |
Hits:
Description: 通过引入特征点和改进最近点迭代法, 提出了一种
在三维扫描系统中对三维点云数据进行配准的方法。该方法
通过对特征点的提取, 首先得到一组匹配点对, 然后运用
SVD 矩阵分解算法求出转换参数R 和T, 进而以此作为最
近点迭代法的初始值, 并对最近点的求法和迭代截止条件作
了改进, 得到了很好的配准效果。该文论述了该方法的基本
原理, 并通过不同视觉下物体三维测量点云数据配准的应用
实例证明了该方法的有效性。-A 3-D meas uring dat a r egis trat ion method for 3-D
scann ing syst em was developed based on feature point s an d it erat ive
closet point ( ICP) algorithm. T he feature p oin ts are firs t ident ified
an d mat ched. T hen, the rot at ion mat rix R an d the t rans lat ion vector
T are fou nd usin g the s ingul ar value decomposit ion algorithm.
T hus, init ialized b y the former resul t , the ICP algorithm then leads
to a perfect regis t rat ion aft er improving on fin ding clos et d ist an ce
an d d ecid ing wh en to terminat e th e iterations . T he basic principle of
this method is discuss ed, and a regist rat ion applicat ion example of
3-D meas uring data taken from differen t viewpoint s is carried out to
sh ow the perfect feasibil ity of this approach
Platform: |
Size: 155648 |
Author: jack |
Hits:
Description: 还是关于阴影的文档资料。nvidia--关于使用hlsl语言的。-Shadows are an important visual cue. Unfortunately, most real-time techniques f
computing shadows generate hard and, in the case of shadow-maps, aliased
shadows. We can soften the edges of the shadows by employing percentage-clos
filtering. In fact, a sufficiently large percentage-closer filter approximates soft
shadow boundaries well. High quality soft shadows, however, require a large
number of samples.
Platform: |
Size: 466944 |
Author: lilinx |
Hits:
Description: How to Freeze Clos Menu of Application with use delphi programming
Platform: |
Size: 134144 |
Author: dadang |
Hits:
Description: Clos Image With Test On Finger Picture
Platform: |
Size: 52224 |
Author: Mohammad |
Hits:
Description: clos网文献综述的ppt，中文版，可以在最短时间对clos网有初步的了解-literature review ppt clos network, the Chinese version, you can in the shortest time of clos networks have a preliminary understanding
Platform: |
Size: 651264 |
Author: false2010 |
Hits:
Description: Command to Line-of-Sight Guidance
Platform: |
Size: 12288 |
Author: mo |
Hits:
Description: CLLIB is a varied collection of Common lisp tools and routines in CLOCC.
-CLLIB is a varied collection of Common lisp tools and routines in CLOCC.
Includes:
■ "guess the animal" game simple neural net (AI)
■ autoload function and snarfing autoloads from other files
■ basic definitions: package and path
■ base64 encoding and decoding (data format)
■ Rolodex: BBDB/vCard handling
■ check values and types of the elements of a list
■ Common Lisp HyperSpec access
■ read/write CLOS objects (serialization)
■ read/write comma-separated values
■ CVS diff and log parsing (version control)
■ data analysis and visualization
■ date/time
■ dated lists
■ answer questions automatically requires metering.lisp
■ Load and run Emacs-Lisp ELisp code in Common Lisp
■ read/write lists etc
■ Financial functions: mortgage calculations, Luhn algorithm, Black-Scholes, Solow (mathematics)
■ geography, weather, etc (units)
■ command line option processing- for Lisp scripting
■ Gnuplot interface (plotting)
■ GetQuote- stock quotes over the In
Platform: |
Size: 456704 |
Author: 张茜 |
Hits:
Description: 14 bus system with upfc and without upfc in order to stabilize the voltage with presence of upfc.
(1) clos.mdl(with upfc)
(2) without.mdl(without upfc)
(3) checked and verified in matab 2011 series without error and fully work conditon
Platform: |
Size: 28672 |
Author: vignesh |
Hits:
Description: 一键关闭指定进程E语言教程(附易语言源码示例)里面附带一键管理已登录QQ，限用于QQ2011版本,易语言编写,源码比较复杂就不公布了，另外教大家用易语言编写批量关进程教程，用到命令&ldquo 终止进-close clos
Platform: |
Size: 2201600 |
Author: chuy |
Hits:
Description: 对交换结构的仿真，主要是对三级clos网络的仿真-A simulation of switch structure
Platform: |
Size: 12288 |
Author: 万里 |
Hits: