Location:
Search - sequence t
Search list
Description: 该程序实现了图的先序、后序遍历和拓扑排序等，而且是界面输出。-the program to achieve the plan's first sequence, after the preorder and topological sorting, but it is the output interface.
Platform: |
Size: 30783 |
Author: 苏艳 |
Hits:
Description: WinCE环境下检测SD卡序列号，编程环境：
eVC4.0 + PPC2003。
文件清单：
newres.h
ReadMe.txt
Resource.h
SDTest.aps
SDTest.cpp
SDTest.h
SDTest.rc
SDTest.vcc
SDTest.vcl
SDTest.vcp
SDTestDlg.cpp
SDTestDlg.h
StdAfx.cpp
StdAfx.h-WinCE environment Sequence Detection SD card, programming environment : eVC4.0 PPC2003. The list of documents : newres.h ReadMe.txt file Resource.h SDTest.aps SD Test.cpp SDTest.h SDTest.rc SDTest.vcc SDTes t.vcl SDTest.vcp SDTestDlg.cpp SDTestDlg.h S tdAfx.cpp StdAfx.h
Platform: |
Size: 135375 |
Author: water1974 |
Hits:
Description: 附有本人超级详细解释（看不懂的面壁十天！）
一、 实际问题:
希尔排序(Shell Sort)是插入排序的一种。因D．L．Shell于1959年提出而得名。它又称“缩小增量分类法”，在时间效率上比插入、比较、冒泡等排序算法有了较大改进。能对无序序列按一定规律进行排序。
二、数学模型:
先取一个小于n的整数d1作为第一个增量，把文件的全部记录分成d1个组。所有距离为dl的倍数的记录放在同一个组中。先在各组内进行直接插人排序；然后，取第二个增量d2<d1重复上述的分组和排序，直至所取的增量dt=1(dt<dt-l<…<d2<d1)，即所有记录放在同一组中进行直接插入排序为止。该方法实质上是一种分组插入方法。
三、算法设计:
1、将相隔某个增量dlta[k]的元素构成一个子序列。在排序过程中，逐次减小这个增量，最后当h减到1时，进行一次插入排序，排序就完成。增量序列一般采用：dlta[k]=2t-k+1-1,其中t为排序趟数，1≤k≤t≤[log2 (n+1)]，其中n为待排序序列的长度。按增量序列dlta[0..t-1]。
2、按增量dlta[k]（1≤k≤t≤[log2 (n+1)]）进行一趟希尔插入排序。
3、在主函数中控制程序执行流程。
4、时间复杂度：1≤k≤t≤[log2 (n+1)]时为O（n3/2）。
-with super detailed explanation (not read the Wall for 10 days!) A practical question : Sort Hill (Shell Sort) is inserted into a sort. By D. L. Shell made in 1959 and named after. It is also known as the "narrow incremental method" in the time-efficient than inserted, such as sorting algorithms and bubbling there has been a big improvement. The disorder can sequence by law must rank. Two mathematical models : first getting a less than n integers d1 as an increment. all documents should be recorded into d1 groups. All distance dl in multiples of record on the same group. In the first group for direct insertion sorting; Then, take a second increment d2
Platform: |
Size: 19421 |
Author: 乐乐 |
Hits:
Description: [问题描述]
设计一个电梯模拟系统。这是一个离散的模拟程序，因为电梯系统是乘客和电梯等
“活动体”构成的集合，虽然他们彼此交互作用，但他们的行为是基本独立的。在离散的模拟中，以模拟时钟决定每个活动体的动作发生的时刻和顺序．系统在某个模拟瞬间处理有待完成的各种事情，然后把模拟时钟推进到某个动作预定要发生的下一个时刻。
[基本要求]
（1） 模拟某校五层教学楼的电梯系统。该楼有一个自动电梯，能在每层停留。五个楼层由下至上依次称为地下层、第一层、第二层、第三层和第四层，其个第一层是大楼的进出层，即是电梯的“本垒层”，电梯“空闲”时，将来到该层候命。
（2） 乘客可随机地进出于任何层。对每个入来说，他有一个能容忍的最长等待时间，一旦等候电梯时间过长，他将放弃。
（3） 模拟时钟从0开始，时间单位为0.1秒。人和电梯的各种动作均要耗费一定的时间单位(简记为t)，比如：
有人进出时，电梯每隔40t测试一次，若无人进出，则关门。
关门和开门各需要20t
每个人进出电梯均需要25t
如果电梯在某层静止时间超过300t，则驶回1层候命。
（4） 按时序显示系统状态的变化过程：发生的全部人和电梯的动作序列。-[Problem description : design an elevator simulation system. This is a discrete simulation program, because the lift system for passengers and elevators "body" form of assembly, Although the interaction between them, but their behavior is a basic independent. The discrete simulation, simulation clock to decide on the activities of each of the action takes time and sequence. A simulation system in an instant to be done to deal with the matter, then analog clock advance to a certain action is scheduled to take place the next time. [Basic requirements] (1) simulation of a school teaching floor of the five-story elevator system. Even with an escalator, will stay in the library. Five floors from the bottom to the lower deck were called, the first-, second-, third - and fourth layer, i
Platform: |
Size: 49780 |
Author: 孙锋志 |
Hits:
Description: 光通传奇III，最新外卦源码。可涨钱，漂移，挂机，等。
文件说明：
bindef.h 二进制定义文件，看看就知道了,就是定义了一些B00001111类似的序列，方便二进制操作
mircode.cpp 消息解码相关
mircode.h 消息解码相关头文件
mircore.cpp 开始做测试用代码，现在都转移到MIRGAME.CPP中了。
mircore.h
mirgame.cpp 消息处理，动作处理的核心代码
mirgame.h
mirgamemap.cpp 游戏地图的处理，障碍地图的绘制
mirgamemap.h
mirgroup.cpp 对GROUP.DAT的处理，得到服务器和区域列表，并且有个接口可以将列表输出到COMBOBOX控件
mirgroup.h
mirgroup1.cpp 本来想把上面的处理写到类里面，可是时间问题，我就。。。。
mirgroup1.h
mirgui.cpp 界面处理，
mirgui.h
mirminimap.cpp 小地图处理和绘制类
mirminimap.h
mirmsg.cpp 消息发送接收等处理的类
mirmsg.h
mirprocmsg.cpp 本来想把消息处理独立开，不过后来没时间就。。。。
mirprocmsg.h
mirsocket.cpp 对socket得简单封装。。。。
mirsocket.h
-Optisp Legend III, the latest Gua outside source. The money can be gained, drift, a stored so. File Description : bindef.h binary definition files to see if it knows, is the definition of a number B00001111 similar sequence convenient operation mircode.cpp binary decoding information related mircode.h related news first decoder documents mircore.cpp started testing code now transferred to MIRGAME.CPP a statement. Mircore.h mirgame.cpp news, action to deal with the core code mirgame.h mirgamemap.cpp game map, obstacles map drawing mirgamemap.h mirgroup.cpp right GROUP.DA T, a server and regional lists, and there is a list of interfaces can be output to control mirgroup.h mirgro COMBOBOX up1.cpp intended to address the above categories wrote, but a matter of time, I would. . . . Mirgroup1.h
Platform: |
Size: 492324 |
Author: 小亮 |
Hits:
Description: HMM(Hidden Markov Model)，狀態數目N=3，觀察符號數目M=2，時間長度T=3。
(a) Probability Evaluation: 給定狀態轉換機率A、狀態符號觀察機率B、和起始機率 ，求觀察序列 出現的機率。
(b) Optimal State Sequence: 給定狀態轉換機率A、狀態符號觀察機率B、起始機率 、和觀察序列 ，求一個狀態序列 使得O出現的機率最大。
(c) Parameter Estimation: 給定狀態轉換機率A、狀態符號觀察機率B、起始機率 、和觀察序列 ，求新的A、B、 ，使得O出現的機率最大。
-HMM (Hidden Markov Model), state the number of N = 3, Observation number of symbols M = 2, T = length of three. (A) Probability Evaluation : given state transition probability A, Observer status symbol probability of B, and initial probability for observation sequence in the octave. (B) Optimal State Sequence : given state transition probability A, Observer status symbol probability of B, the initial probability, and observation sequence, for a state sequence of O makes the greatest risk. (C) Parameter Estimation : given state transition probability A, Observer status symbol probability of B, the initial probability, and observation sequence, the way the A, B, and O makes the greatest risk.
Platform: |
Size: 146567 |
Author: 章勝鈞 |
Hits:
Description: 该程序实现了图的先序、后序遍历和拓扑排序等，而且是界面输出。-the program to achieve the plan's first sequence, after the preorder and topological sorting, but it is the output interface.
Platform: |
Size: 30720 |
Author: 苏艳 |
Hits:
Description: HMM(Hidden Markov Model)，狀態數目N=3，觀察符號數目M=2，時間長度T=3。
(a) Probability Evaluation: 給定狀態轉換機率A、狀態符號觀察機率B、和起始機率 ，求觀察序列 出現的機率。
(b) Optimal State Sequence: 給定狀態轉換機率A、狀態符號觀察機率B、起始機率 、和觀察序列 ，求一個狀態序列 使得O出現的機率最大。
(c) Parameter Estimation: 給定狀態轉換機率A、狀態符號觀察機率B、起始機率 、和觀察序列 ，求新的A、B、 ，使得O出現的機率最大。
-HMM (Hidden Markov Model), state the number of N = 3, Observation number of symbols M = 2, T = length of three. (A) Probability Evaluation : given state transition probability A, Observer status symbol probability of B, and initial probability for observation sequence in the octave. (B) Optimal State Sequence : given state transition probability A, Observer status symbol probability of B, the initial probability, and observation sequence, for a state sequence of O makes the greatest risk. (C) Parameter Estimation : given state transition probability A, Observer status symbol probability of B, the initial probability, and observation sequence, the way the A, B, and O makes the greatest risk.
Platform: |
Size: 146432 |
Author: 章勝鈞 |
Hits:
Description: 设n个不同的整数排好序后存于T[0:n-1]中。若存在一个下标I,0<I<n,使得t[I]=I,设计一个有效算法找到这个下标。要求算法在最坏情况下的计算时间为O(logn).-Let n different integer sequence after arranging deposit T [0 : n-1]. If there is a subscript I, 0
Platform: |
Size: 1024 |
Author: 33 |
Hits:
Description: 建立Fuzzy模型－序列预测matlab代码-Fuzzy model-building- sequence prediction matlab code
Platform: |
Size: 11264 |
Author: 林盈 |
Hits:
Description: TCP序列号和确认号详解，可以帮助学习TCP协议以及排查通讯故障，如通过查看序列号和确认号可以确定数据传输是否乱序。-TCP sequence number and acknowledgment number explain, can help learning TCP protocol as well as the investigation of communication failures, such as by checking the serial number and confirmation number to determine whether the out-of-order data.
Platform: |
Size: 232448 |
Author: 风帆 |
Hits:
Description: 1．产生[0,1]均匀分布的白噪声序列
(1) 打印出前50个数 (2) 分布检验
(3) 均值检验 (4) 方差检验
(5) 计算相关函数 Bx(i),i=0,±1,±2,…, ±10
-1. Generated [0,1] uniformly distributed white noise sequence (1) print out the top 50 the number of (2) the distribution of test (3) the mean test (4) of variance test (5) calculating the correlation function Bx (i), i = 0 , ± 1, ± 2, ..., ± 10
Platform: |
Size: 1024 |
Author: yanxiaoying |
Hits:
Description: 图形化多序列比对编辑器,能够读各种比对格式(MSF, CLUSTAL, FASTA, PHYLIP, MASE),可手动编辑队列。-Graphical multiple sequence alignment editor, able to read various alignment formats (MSF, CLUSTAL, FASTA, PHYLIP, MASE), you can manually edit the queue.
Platform: |
Size: 2657280 |
Author: sxy |
Hits:
Description: G.711使用64Kbps的带宽，可将14bits转换成8bits。目前G.711有两个编码方式，A-law以及Mu-law。-G.711 defines two main compression algorithms, the µ -law algorithm (used in North America & Japan) and A-law algorithm (used in Europe and the rest of the world). Both are logarithmic, but A-law was specifically designed to be simpler for a computer to process. The standard also defines a sequence of repeating code values which defines the power level of 0 dB.
The µ -law and A-law algorithms encode 14-bit and 13-bit signed linear PCM samples (respectively) to logarithmic 8-bit samples. Thus, the G.711 encoder will create a 64 kbit/s bitstream for a signal sampled at 8 kHz.[5]
G.711 μ-law tends to give more resolution to higher range signals while G.711 A-law provides more quantization levels at lower signal levels. When using μ-law G.711 in networks where suppression of the all 0 character signal is required, the character signal corresponding to negative input values between decision values numbers 127 and 128 should be 00000010 and the value at the decoder output is-
Platform: |
Size: 915456 |
Author: coco |
Hits:
Description: In this paper, we introduce a 2D/3D mixed service
in Terrestrial Digital Multimedia Broadcasting (T-DMB) system
using depth-image-based rendering (DIBR). The 2D/3D mixed
service is the 3D service type that 3D contents are shown
partially while a 2D video sequence is displayed in the entire
screen, or vice versa. This service is very attractive because
partial display of 3D contents can maximize the effect of 3D
services and can reduce the viewer’s fatigue while watching a 3D
display. Especially, we can provide more flexible 3D services with
a low amount of data by using DIBR. Moreover, 3D contents can
Platform: |
Size: 263168 |
Author: ali |
Hits:
Description: 求解序列比对得分矩阵，对于两个序列S和T，令[S]和[T]分别为序列S和T的长度，S[i]和T[j](其中正整数i，j满足0≤j< [S]和0≤j <[T])都属于字符集Ω={A,T,C,G,-},对Ω中的任何元素和空符号。
设计S[i]和T[j]两两之间的一个记分值来比较序列间的同一性的优劣,用记分函数σ(x，y)表示，
σ(S[i],T[j])=2 ( S[i]=T[j]≠-)；σ(S[i],T[j])= -1 ( S[i]≠T[j],S[i]≠-,T[j]≠-)；σ(S[i],T[j])= -2 (S[i]orT[j]=-)。-Solve the sequence alignment score matrix for two sequences S and T, so [S] and [T] S and T respectively, sequence length, S [i] and T [j] (which is an integer i, j satisfying 0 ≤ j < [S] and 0 ≤ j < [T]) belong to the character set Ω = {A, T, C, G,-}, any element of Ω, and the empty symbols. Design S [i] and T [j] between any two of a record score to compare the sequence identity between the pros and cons, with the score function σ (x, y) that, σ (S [i], T [j ]) = 2 (S [i] = T [j] ≠-) σ (S [i], T [j]) =-1 (S [i] ≠ T [j], S [i] ≠- , T [j] ≠-) σ (S [i], T [j]) =-2 (S [i] orT [j ]=-)。
Platform: |
Size: 4096 |
Author: zhouyanghua |
Hits:
Description: A Discrete 3-Phase ProgrammableSource block is used to generate a 1 pu, 15 degrees positive sequence voltage. At t = 0.05 s the positive sequence voltage is increased to 1.5 pu. At t = 0.1 s an unbalance is introduced by adding a 0.3 pu negative sequence component with a phase of -30 degrees.
The magnitude and phase of the positive-sequence component is evaluated in two diiferent ways: 1) Sequence calculation of phasors using Fourier analysis and
2) abc to dq0 transformation.
Math Function and Trigonometric Function blocks are used to evaluate the magnitude and phase of the positive sequence from the d and q components:
V1 = sqrt(Vd^2 + Vq^2) , Phi1 = atan(Vq/Vd))
-A Discrete 3-Phase ProgrammableSource block is used to generate a 1 pu, 15 degrees positive sequence voltage. At t = 0.05 s the positive sequence voltage is increased to 1.5 pu. At t = 0.1 s an unbalance is introduced by adding a 0.3 pu negative sequence component with a phase of -30 degrees.
The magnitude and phase of the positive-sequence component is evaluated in two diiferent ways: 1) Sequence calculation of phasors using Fourier analysis and
2) abc to dq0 transformation.
Math Function and Trigonometric Function blocks are used to evaluate the magnitude and phase of the positive sequence from the d and q components:
V1 = sqrt(Vd^2 + Vq^2) , Phi1 = atan(Vq/Vd))
Platform: |
Size: 7168 |
Author: jurifa |
Hits:
Description: 针对带有交货期窗口硬约束，并对提前/拖期零件进行惩罚的一类作业车间调度问题，设计了一种改进型遗传算法EGA。交货期窗口硬约束是指每个零件均有交货期和deadline，零件可以在交货期后完工，但绝不能超出deadline。EGA采用“逆向后推”和“顺向前拉”相结合的两阶段求解策略。针对部分染色体在解码过程中违反交货期窗口硬约束而产生非法解的问题，采用基于关键路径的染色体修复方法来调整染色体基因序列，以期实现在满足交货期窗口硬约束的同时降低零件拖期成本；在保持第一调度阶段拖期成本不变的基础上，采用基于逆向重调度的目标值修订方法来延迟零件开工时间，以减小成品提前库存成本。-This paper deals with the job shop scheduling problem with due window to minimize the sum of weighted earliness and weighted tardiness of jobs. This due window is a time duration between the due date and the latest acceptable completion date, namely dealine, of a job. Penalties are incurred if jobs are completed within the due window and the illegal schedule will occur if one job is finished after its deadline. A new Enhanced Genetic Algorithm (EGA), based on a two phase schedule mechanism was introduced. To avoid the violations of due window constraint and simultaneously reduce tardiness costs, a chromosome repair method based on critical paths was designed to adjust chromogene sequence. Then, on keeping tardiness costs unchanged, an objective value revision method based on reverse rescheduling was put forward to delay job release date for reducing earliness costs introduced by each job.
Platform: |
Size: 25600 |
Author: 孙启峰 |
Hits:
Description: 该函数用快速傅里叶变换计算序列平均周期，方法简便快捷-The function is calculated using the fast Fourier transform sequence average cycle, the method is simple and quick
Platform: |
Size: 1024 |
Author: 赵莹 |
Hits:
Description: 在matlab中利用滑动t检验法检验序列是否突变(Whether the test sequence is mutated or not)
Platform: |
Size: 9216 |
Author: zoujing456 |
Hits: