The problem with the IID_s is solved ! File-Structure: ~~~~~~~~~~~~~~~ DirectDraw.pas = DDraw.h + DVP.h (+ MultiMon.h) Direct3D.pas = D3D.h + D3DTypes.h + D3DCaps.h + D3DVec.inl + DXFile.h Direct3DRM.pas = D3DRM.h + D3DRMDef.h + D3DRMObj.h + D3DRMWin.h + RMXFGUID.h + RMXFTmpl.h DirectInput.pas = DInput.h (+ DinputD.h) DirectPlay.pas = DPlay.h + DPLobby.h DirectSound.pas = DSound.h DirectMusic.pas = DLS1.h + DLS2.h + DMDLS.h + DMError.h + DMKSCtrl.h + DMusicC.h + DMusicF.h + DMusicI.h + DMusBuff.h DirectSetup.pas = DSetup.h No Unit = dxsdk.inc
标签: File-Structure DirectDraw problem solved
上传时间: 2015-09-04
上传用户:kikye
请下载方正Apabi Reader进行阅读。http://www.skycn.com/soft/5531.html
上传时间: 2015-09-05
上传用户:czl10052678
This paper deals with the problem of speech enhancement when a corrupted speech signal with an additive colored noise is the only information available for processing. Kalman filtering is known as an effective speech enhancement technique, in which speech signal is usually modeled as autoregressive (AR) process and represented in the state-space domain.
标签: speech with enhancement corrupted
上传时间: 2015-09-06
上传用户:zhangyi99104144
This paper deals with the problem of speech enhancement when only a corrupted speech signal is available for processing. Kalman filtering is known as an effective speech enhancement technique, in which speech signal is usually modeled as autoregressive (AR) model and represented in the state-space domain.
标签: speech enhancement corrupted problem
上传时间: 2013-12-20
上传用户:569342831
This the project README file. Here, you should describe your project. Tell the reader (someone who does not know anything about this project) all he/she needs to know.
标签: project the describe someone
上传时间: 2013-12-22
上传用户:CSUSheep
车辆行驶路线优化(Vehicle Routing Problem)
标签: Vehicle Routing Problem 车辆行驶
上传时间: 2014-10-12
上传用户:561596
this m file can Find a (near) optimal solution to the Traveling Salesman Problem (TSP) by setting up a Genetic Algorithm (GA) to search for the shortest path (least distance needed to travel to each city exactly once) Notes: 1. Input error checking included 2. Inputs can be specified in any order, so long as the parameter pairs are specified as a parameter , value
标签: Traveling Salesman solution Problem
上传时间: 2013-12-21
上传用户:ruixue198909
算法的许多例子都是最优化问题( optimization problem),每个最优化问题都包含一组限制条件( c o n s t r a i n t)和一个优化函数( optimization function),符合限制条件的问题求解方案称为可行解( feasible solution),使优化函数取得最佳值的可行解称为最优解(optimal solution)。
标签: optimization problem 算法
上传时间: 2014-08-25
上传用户:123456wh
Problem Statement You are given a string input. You are to find the longest substring of input such that the reversal of the substring is also a substring of input. In case of a tie, return the string that occurs earliest in input. Definition Class: ReverseSubstring Method: findReversed Parameters: string Returns: string Method signature: string findReversed(string input) (be sure your method is public) Notes The substring and its reversal may overlap partially or completely. The entire original string is itself a valid substring (see example 4). Constraints input will contain between 1 and 50 characters, inclusive. Each character of input will be an uppercase letter ( A - Z ). Examples 0) "XBCDEFYWFEDCBZ" Returns: "BCDEF" We see that the reverse of BCDEF is FEDCB, which appears later in the string. 1)
上传时间: 2015-09-20
上传用户:sunjet
比较好的ASP入门级和拓展级教材。用Adobe Reader或者超星阅读器就可阅览。
上传时间: 2015-09-27
上传用户:youlongjian0