Location:
Search - k-l
Search list
Description: banking sector efficiency analyse
Platform: |
Size: 585728 |
Author: ismailseki
|
Hits:
Description: 一段模拟森林火灾的代码，模拟该过程，请自行甄别(a Nmm kk l l j h k jff f f gg g d d d d d w ww r f c cc)
Platform: |
Size: 929792 |
Author: 海盗pk
|
Hits:
Description: 《算法导论》原书名--Introduction to Algorithms，是2006年机械工业出版社出版出版的图书，作者是Thomas H.Cormen、Charles E.Leiserson等。
该书是一本十分经典的计算机算法书籍，与高德纳(Donald E.Knuth)的《计算机程序设计艺术》(The Art Of Computer Programming)相媲美。 《算法导论》由Thomas H.Cormen、Charles E.Leiserson、Ronald L.Rivest、Clifford Stein四人合作编著(其中Clifford Stein是第二版开始参与的合著者)。本书的最大特点就是将严谨性和全面性融入在了一起。("Introduction to Algorithms of the original title, the Introduction to Algorithms, mechanical industry publishing house published in 2006 book, the author was Thomas H.C ormen, Charles E.L eiserson, etc.
The book is a very classic algorithms books, and gartner (Donald E.K nuth) Of The Art Of Computer Programming (The Art Of Computer Programming)."Introduction to algorithms by Thomas H.C ormen, Charles E.L eiserson, Ronald their lives ivest, Clifford Stein, four people oversee (including Clifford Stein, is the second edition began to participate in co-author).The biggest characteristic of this book is to rigor and comprehensive blend in together.)
Platform: |
Size: 55279616 |
Author: 拖把
|
Hits:
Description: 数字图像中的拐点通常成为重要的信息载体，因此准确、稳定和实时地检测出拐点便成为拐点检测算法面l临的主要问题，针对该问题，提出了一种新的二值图像中拐点的实时检测算法。该算法与传统基于边界链码的拐点检测算法不同，其是首先构建像素的k(k>8)邻域，并将图像中物体的边界表示为k邻域链码；然后根据曲率定义的差分形式计算各边界点处的曲率；最后通过检测曲率直方图的局部峰值精确定位出拐点，并利用拐角内部像素的颜色统计信息迅速判断出拐点的凸凹性。(The inflection point in the digital image are important information carriers, so accurate, stable and real-time detection of the inflection point will become the main problem of inflection point detection algorithm face L, to solve this problem, we propose a new two value image in the inflection point of the real-time detection algorithm. The algorithm with the traditional inflection point algorithm of edge detection based on chain code, which is firstly constructed pixel K (k>8) neighborhood, and the image object boundary representation for K neighborhood chain code; then according to the definition of curvature curvature difference form to calculate the boundary point; precise local peak location finally tested by the curvature histogram of a turning point, and the use of internal corner pixel color statistical information to quickly determine the convexity of the inflection point.)
Platform: |
Size: 376832 |
Author: 麦田韬鹰
|
Hits:
Description: 使用迭代算法xk^-1=B*x^k+f,其中B=D^-1*(L+U)=I-D^-1*A,f=D^-1*b。(Use iterative algorithms calculate solve the linear equation)
Platform: |
Size: 9216 |
Author: youcann
|
Hits:
Description: _ _變 l器通信模 K q為RS－485 o通信模式為MODBUS o直接用C Z言編 g程序可打 _ q()
Platform: |
Size: 6144 |
Author: JZPB&9154
|
Hits:
Description: _ _變 l器通信模 K q為RS－485 o通信模式為MODBUS o直接用C Z言編 g程序可打 _ q()
Platform: |
Size: 6144 |
Author: prqmptive |
Hits:
Description: 设B是一个n×n棋盘,n 2k,(k 1,2,3,…),用分治法设计一个算法,使得：用若干个L型条块可以覆盖住B的除一个特殊方()
Platform: |
Size: 7168 |
Author: vbnwycn |
Hits:
Description: 实现了L-K光流法, 用Matlab实现，经测试可以使用。最基本的方法。(L-K optical flow, it is used by lucas-kanada method to finish it. it is simple, but useful.)
Platform: |
Size: 1024 |
Author: xing_xing |
Hits:
Description: Net is defined over a data flow graph, which is derived from the iterative pro-
cedures in Alternating Direction Method of Multipliers (ADMM) algorithm for
optimizing a CS-based MRI model. In the training phase, all parameters of the
net, e.g., image transforms, shrinkage functions, etc., are discriminatively trained
end-to-end using L-BFGS algorithm. In the testing phase, it has computational
overhead similar to ADMM but uses optimized parameters learned from the train-
ing data for CS-based reconstruction task. Experiments on MRI image reconstruc-
tion under different sampling ratios in k-space demonstrate that it significantly
improves the baseline ADMM algorith
Platform: |
Size: 81864704 |
Author: 隔壁家的熊 |
Hits:
Description: #include "stdafx.h"
#include <iostream>
using namespace std;
void main()
{
int i = 0;
int j = 8;
int l = j;
for (int k = 0; k < 9; k++)
{
for (i = 0; i < j; i++)
l = j;
j -= l - i;
for (i = 0; i < (10- j) - 1; i++)
{
cout << "*";
}
j = --l;
cout << endl;
}
system("pause");
}
Platform: |
Size: 16531456 |
Author: TWICE999 |
Hits:
Description: public static String encode(byte[] binaryData) {
if (binaryData == null) {
return null;
}
int lengthDataBits = binaryData.length * EIGHTBIT;
if (lengthDataBits == 0) {
return "";
}
int fewerThan24bits = lengthDataBits % TWENTYFOURBITGROUP;
int numberTriplets = lengthDataBits / TWENTYFOURBITGROUP;
int numberQuartet = fewerThan24bits != 0 ? numberTriplets + 1 : numberTriplets;
char encodedData[] = null;
encodedData = new char[numberQuartet * 4];
byte k = 0, l = 0, b1 = 0, b2 = 0, b3 = 0;
int encodedIndex = 0;
int dataIndex = 0;
if (fDebug) {
System.out.println("number of triplets = " + numberTriplets);
}
Platform: |
Size: 2048 |
Author: 少郎 |
Hits:
Description: _ _變 l器通信模 K q為RS－485 o通信模式為MODBUS o直接用C Z言編 g程序可打 _ q()
Platform: |
Size: 6144 |
Author: sulgroup |
Hits:
Description: 对图像进行频谱分析，已达到不同目的的图像下一步处理。(to confirm fft sdkadjlaskjd l lajsdkjal jlk jlk jlasjd k)
Platform: |
Size: 291840 |
Author: 小旭啊啊啊 |
Hits:
Description: 进行多电平脉宽调制，使用的是M A T L A B 的 s i m u l i n k(To do the multi-level PWM with MATLAB)
Platform: |
Size: 16384 |
Author: 木__木 |
Hits:
Description: TOPSIS （Technique for Order Preference by Similarity to an Ideal Solution ）法是C.L.Hwang和K.Yoon于1981年首次提出，TOPSIS法根据有限个评价对象与理想化目标的接近程度进行排序的方法，是在现有的对象中进行相对优劣的评价。(The TOPSIS (Technique for Order Preference by Similarity to an Ideal Solution) method was first proposed by CLHwang and K. Yoon in 1981. The TOPSIS method is based on how close a limited number of evaluation objects are to the idealized target.The relative merits of the object are evaluated.)
Platform: |
Size: 2048 |
Author: xiji |
Hits:
Description: {缠论}
TIM:=TDXDLL4(100,PERIOD,H,L); {初始化周期};
KX:=TDXDLL4(1,H,L,C); {解决包含K线的问题};
VALID:=TDXDLL4(15,H,L,C);
BI:=TDXDLL4(4,H,L,C); {BI类型}
KXG:=TDXDLL4(2,H,L,C); {高点}
KXD:=TDXDLL4(3,H,L,C); {低点}
BILAST:=TDXDLL4(6,H,L,C);{上一笔的距离}
{(initialization; initialize; initialise; initializtion)
Platform: |
Size: 18432 |
Author: zhaodao |
Hits:
Description: 该模型是对50kW、380V、50Hz三相三电平逆变器的两个相同电路进行建模。IGBT逆变器采用SPWM技术，(8kHz载频)将直流电源从a +/-200Vdc源转换为220V AC, 50Hz。逆变器通过75kVA 220/380V变压器输入50kW电阻负载。变频器输出采用L-C滤波器滤除主要产生于8kHz开关频率倍数(Fh=n*8000 +/-k*50Hz)附近的谐波频率Fh。逆变器所需的12个逆变脉冲由PWM发生器块产生。该系统以恒定的调制指标在开环中工作。
电路1使用三电平桥块对逆变器进行建模。电路2使用独立的IGBTs和二极管块。用开/关延时块模拟死区，仅在电路1上应用。(It is easy for us)
Platform: |
Size: 37888 |
Author: cheng0123 |
Hits:
Description: 模拟退火算法来源于固体退火原理，将固体加温至充分高，再让其徐徐冷却，加温时，固体内部粒子随温升变为无序状，内能增大，而徐徐冷却时粒子渐趋有序，在每个温度都达到平衡态，最后在常温时达到基态，内能减为最小。根据Metropolis准则，粒子在温度T时趋于平衡的概率为e(-ΔE/(kT))，其中E为温度T时的内能，ΔE为其改变量，k为Boltzmann常数。用固体退火模拟组合优化问题，将内能E模拟为目标函数值f，温度T演化成控制参数t，即得到解组合优化问题的模拟退火算法：由初始解i和控制参数初值t开始，对当前解重复“产生新解→计算目标函数差→接受或舍弃”的迭代，并逐步衰减t值，算法终止时的当前解即为所得近似最优解，这是基于蒙特卡罗迭代求解法的一种启发式随机搜索过程。退火过程由冷却进度表(Cooling Schedule)控制，包括控制参数的初值t及其衰减因子Δt、每个t值时的迭代次数L和停止条件S。(The simulated annealing algorithm is derived from the principle of solid annealing. The solid is heated to a sufficiently high temperature, and then cooled slowly. During heating, the particles in the solid become disordered with the temperature rise, and the internal energy increases.)
Platform: |
Size: 4096 |
Author: 长安Guli |
Hits:
«
1
2
...
23
24
25
26
27
28»