Welcome![Sign In][Sign Up]
Location:
Search - cbq

Search list

[GDI-Bitmapcbq

Description: 包括图像的灰度变换,阈值风格,彩色空间变换,彩条制作,傅里叶变换等源代码-including the gray image transformation, the threshold style, color space conversion, color of the production, such as Fourier transform source code
Platform: | Size: 224389 | Author: Rabbit | Hits:

[ADO-ODBCpartition1

Description: 实验描述:分布式数据库的算法partition的具体实现。即通过该算法找到关系数据库最优分裂点,使得结果最优。 算法思想: 1、 首先根据所输入的attribute usage matrix得到AQ( ) 2、 对CA矩阵中划分点预先设在n-1处,并将属性列分成两个集合,TA和BA,TA中的元为:{ A1 、A2 …… An-1 },BA中的元素为:{ An} 3、 确定集合TQ、BQ和OQ,其中TQ={ qj| AQ(qi) TA},BQ= TQ={ qj| AQ(qi) BA}, OQ=Q-{TQ BQ}。 4、 计算出CTQ、CBQ、COQ这些值,其中CTQ= ,CBQ= ,COQ= 5、 通过划分点的第次移动分别计算出z=CTQ*CBQ-COQ2 6、 对取到的z的最大值处标记,为分割点 7、 对CA进行调整,重复计算得到最终z的最大值点,对CA矩阵进行划分 8、 对上述算法进行修改,将得到的最大z值的分割点和次大的分割点都记录下来,得到两个分割,则将原有的属性集划分成三部分。 该算法的目的是找到独立存取的属性集合或者分别的应用集。比如说,如果可以找到两个属性A1,A2,他们只是被q1读取,而A3,A4被q2,q3读取,这样在分裂的时候可以确定。算法就是找到这些组。另外为了简单化起见,我命令refj(qi)全部等于1.
Platform: | Size: 9772 | Author: 孙东一 | Hits:

[ADO-ODBCpartition2

Description: 实验描述:分布式数据库的算法partition的具体实现。即通过该算法找到关系数据库最优分裂点(2个),使得结果最优。 1、 首先根据所输入的attribute usage matrix得到AQ( ) 2、 对CA矩阵中划分点预先设在n-1处,并将属性列分成3个集合,TA和BA和MA, 3、 确定集合TQ、BQ,MQ和OQ,其中TQ={ qj| AQ(qi) TA},BQ= TQ={ qj| AQ(qi) BA}, MQ={ qj| AQ(qi) MA},OQ=Q-{TQ BQ}。 4、 计算出CTQ、CBQ、CMQ、COQ这些值,其中CTQ= ,CBQ= ,CMQ= ,COQ= 5、 通过划分点的第次移动分别计算出z=CTQ*CBQ*CMQ-COQ3 6、 对取到的z的最大值处标记,为分割点 7、 对CA进行调整,重复计算得到最终z的最大值点,对CA矩阵进行划分 对上述算法进行修改,将得到的最大z值的分割点和次大的分割点都记录下来,得到两个分割,则将原有的属性集划分成三部分。
Platform: | Size: 10474 | Author: 孙东一 | Hits:

[Internet-Networkcbq

Description: CBQ的源代码,头文件和 源文件 是分开的
Platform: | Size: 8324 | Author: zhengyp | Hits:

[GDI-Bitmapcbq

Description: 包括图像的灰度变换,阈值风格,彩色空间变换,彩条制作,傅里叶变换等源代码-including the gray image transformation, the threshold style, color space conversion, color of the production, such as Fourier transform source code
Platform: | Size: 4118528 | Author: | Hits:

[Database systempartition1

Description: 实验描述:分布式数据库的算法partition的具体实现。即通过该算法找到关系数据库最优分裂点,使得结果最优。 算法思想: 1、 首先根据所输入的attribute usage matrix得到AQ( ) 2、 对CA矩阵中划分点预先设在n-1处,并将属性列分成两个集合,TA和BA,TA中的元为:{ A1 、A2 …… An-1 },BA中的元素为:{ An} 3、 确定集合TQ、BQ和OQ,其中TQ={ qj| AQ(qi) TA},BQ= TQ={ qj| AQ(qi) BA}, OQ=Q-{TQ BQ}。 4、 计算出CTQ、CBQ、COQ这些值,其中CTQ= ,CBQ= ,COQ= 5、 通过划分点的第次移动分别计算出z=CTQ*CBQ-COQ2 6、 对取到的z的最大值处标记,为分割点 7、 对CA进行调整,重复计算得到最终z的最大值点,对CA矩阵进行划分 8、 对上述算法进行修改,将得到的最大z值的分割点和次大的分割点都记录下来,得到两个分割,则将原有的属性集划分成三部分。 该算法的目的是找到独立存取的属性集合或者分别的应用集。比如说,如果可以找到两个属性A1,A2,他们只是被q1读取,而A3,A4被q2,q3读取,这样在分裂的时候可以确定。算法就是找到这些组。另外为了简单化起见,我命令refj(qi)全部等于1.-err
Platform: | Size: 77824 | Author: 孙东一 | Hits:

[Database systempartition2

Description: 实验描述:分布式数据库的算法partition的具体实现。即通过该算法找到关系数据库最优分裂点(2个),使得结果最优。 1、 首先根据所输入的attribute usage matrix得到AQ( ) 2、 对CA矩阵中划分点预先设在n-1处,并将属性列分成3个集合,TA和BA和MA, 3、 确定集合TQ、BQ,MQ和OQ,其中TQ={ qj| AQ(qi) TA},BQ= TQ={ qj| AQ(qi) BA}, MQ={ qj| AQ(qi) MA},OQ=Q-{TQ BQ}。 4、 计算出CTQ、CBQ、CMQ、COQ这些值,其中CTQ= ,CBQ= ,CMQ= ,COQ= 5、 通过划分点的第次移动分别计算出z=CTQ*CBQ*CMQ-COQ3 6、 对取到的z的最大值处标记,为分割点 7、 对CA进行调整,重复计算得到最终z的最大值点,对CA矩阵进行划分 对上述算法进行修改,将得到的最大z值的分割点和次大的分割点都记录下来,得到两个分割,则将原有的属性集划分成三部分。 -err
Platform: | Size: 78848 | Author: 孙东一 | Hits:

[Internet-Networkcbq

Description: CBQ的源代码,头文件和 源文件 是分开的 -CBQ s source code, header files and source files are separate
Platform: | Size: 8192 | Author: zhengyp | Hits:

[Other systemscbq

Description: Powerbuilder开发的抄表器接口程序-Powerbuilder development of meter-reading interface procedures
Platform: | Size: 27648 | Author: dali | Hits:

[Linux-Unixcbq

Description: bandwidth limiting on linux this file can be help fu-bandwidth limiting on linux this file can be help full
Platform: | Size: 38912 | Author: habib | Hits:

[Internet-Networkfw.tar

Description: Simple iptables firewall with cbq support
Platform: | Size: 16384 | Author: miki | Hits:

[Software Engineeringns2aodv

Description: NS (Version 2) is an open source network simulation tool. It is an object oriented, discrete event driven simulator written in C++ and Otcl. The primary use of NS is in network researches to simulate various types of wired/wireless local and wide area networks to implement network protocols such as TCP and UPD, traffic source behavior such as FTP, Telnet, Web, CBR and VBR, router queue management mechanism such as Drop Tail, RED and CBQ, routing algorithms such as Dijkstra, and many more. -NS (Version 2) is an open source network simulation tool. It is an object oriented, discrete event driven simulator written in C++ and Otcl. The primary use of NS is in network researches to simulate various types of wired/wireless local and wide area networks to implement network protocols such as TCP and UPD, traffic source behavior such as FTP, Telnet, Web, CBR and VBR, router queue management mechanism such as Drop Tail, RED and CBQ, routing algorithms such as Dijkstra, and many more.
Platform: | Size: 536576 | Author: mahadev gawas | Hits:

[Internet-Networksample-codes

Description: NS (Version 2) is an open source network simulation tool. It is an object oriented, discrete event driven simulator written in C++ and Otcl. The primary use of NS is in network researches to simulate various types of wired/wireless local and wide area networks to implement network protocols such as TCP and UPD, traffic source behavior such as FTP, Telnet, Web, CBR and VBR, router queue management mechanism such as Drop Tail, RED and CBQ, routing algorithms such as Dijkstra, and many more. -NS (Version 2) is an open source network simulation tool. It is an object oriented, discrete event driven simulator written in C++ and Otcl. The primary use of NS is in network researches to simulate various types of wired/wireless local and wide area networks to implement network protocols such as TCP and UPD, traffic source behavior such as FTP, Telnet, Web, CBR and VBR, router queue management mechanism such as Drop Tail, RED and CBQ, routing algorithms such as Dijkstra, and many more.
Platform: | Size: 9216 | Author: mahadev gawas | Hits:

[Linux-Unixtc_cbq

Description: CBQ maintanance routines for Linux Driver.
Platform: | Size: 1024 | Author: cahenxang | Hits:

CodeBus www.codebus.net