Readers can pick up this book and become familiar with C++ in a short time. Stan has taken a very broad and complicated topic and reduced it to the essentials that budding C++ programmers need to know to write real programs. His case study is effective and provides a familiar thread throughout the book.
標(biāo)簽： familiar Readers become short
上傳時(shí)間： 2015-07-20
上傳用戶：thinode
zemax源碼： This DLL models a standard ZEMAX surface type, either plane, sphere, or conic The surface also demonstrates a user-defined apodization filter The filter is defined as part of the real ray trace, case 5 The filter can be used at the stop to produce x-y Gaussian apodization similar to the Gaussian pupil apodization in ZEMAX but separate in x and y. The amplitude apodization is of the form EXP[-(Gx(x/R)^2 + Gy(y/R)^2)] The transmission is of the form EXP[-2(Gx(x/R)^2 + Gy(y/R)^2)] where x^2 + y^2 = r^2 R = semi-diameter The tranmitted intensity is maximum in the center. T is set to 0 if semi-diameter < 1e-10 to avoid division by zero.
標(biāo)簽： standard surface models either
上傳時(shí)間： 2013-12-05
上傳用戶：003030
ORACLE公司自86年推出版本5開始,系統(tǒng)具有分布數(shù)據(jù)庫處理功能.88年推出版本6,ORACLE RDBMS(V6.0)可帶事務(wù)處理選項(xiàng)(TPO),提高了事務(wù)處理的速度.1992年推出了版本7,在ORACLE RDBMS中可帶過程數(shù)據(jù)庫選項(xiàng)(procedural database option)和并行服務(wù)器選項(xiàng)（parallel server option）,稱為ORACLE7數(shù)據(jù)庫管理系統(tǒng)，它釋放了開放的關(guān)系型系統(tǒng)的真正潛力。ORACLE7的協(xié)同開發(fā)環(huán)境提供了新一代集成的軟件生命周期開發(fā)環(huán)境，可用以實(shí)現(xiàn)高生產(chǎn)率、大型事務(wù)處理及客戶/服務(wù)器結(jié)構(gòu)的應(yīng)用系統(tǒng)。協(xié)同開發(fā)環(huán)境具有可移植性，支持多種數(shù)據(jù)來源、多種圖形用戶界面及多媒體、多民族語言、CASE等協(xié)同應(yīng)用系統(tǒng)。
標(biāo)簽： ORACLE RDBMS 1992 版本
上傳時(shí)間： 2015-08-11
上傳用戶：xzt
ORACLE7的協(xié)同開發(fā)環(huán)境提供了新一代集成的軟件生命周期開發(fā)環(huán)境，可用以實(shí)現(xiàn)高生產(chǎn)率、大型事務(wù)處理及客戶/服務(wù)器結(jié)構(gòu)的應(yīng)用系統(tǒng)。協(xié)同開發(fā)環(huán)境具有可移植性，支持多種數(shù)據(jù)來源、多種圖形用戶界面及多媒體、多民族語言、CASE等協(xié)同應(yīng)用系統(tǒng)。
標(biāo)簽： ORACLE7 協(xié)同開發(fā) 環(huán)境 開發(fā)環(huán)境
上傳時(shí)間： 2015-08-21
上傳用戶：問題問題
Listed below are the typographical conventions used in this guide. – Example C++ code and commands to be typed by the user are in non-bold characters in typewriter font. – Items where the user has to supply a name or number are given in lower-case italic characters in typewriter font. – Sections marked with a ‡ describe features that are also available in ANSI C.
標(biāo)簽： typographical conventions commands Example
上傳時(shí)間： 2013-12-20
上傳用戶：xiaoxiang
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)
標(biāo)簽： input Statement You are
上傳時(shí)間： 2015-09-21
上傳用戶：sunjet
本文就采用面對對象的方法以UML為建模語言，使用PowerDesigner這個(gè)case工具分析設(shè)計(jì)一個(gè)分布式的B/S結(jié)構(gòu)的基于COM+和XML的網(wǎng)絡(luò)考試系統(tǒng)。并使用Delphi、VBScript、ADO、XML、HTML等編程工具、語言和技術(shù)實(shí)現(xiàn)了這個(gè)系統(tǒng)。
上傳時(shí)間： 2015-09-25
上傳用戶：sy_jiadeyi
This review classifies genetic algorithm environments into application-oriented systems,algorithmoriented systems, and toolkits. It also presents detailed case studies of leading environments.
標(biāo)簽： application-oriented algorithmori environments classifies
上傳時(shí)間： 2013-12-19
上傳用戶：tyler
本壓縮包中包含了有關(guān)RUP的文檔資料，包括use-case-用例實(shí)現(xiàn)規(guī)約、軟件架構(gòu)文檔；相關(guān)業(yè)務(wù)規(guī)約；配置管理計(jì)劃；部署計(jì)劃；管理、測試相關(guān)等內(nèi)容
上傳時(shí)間： 2015-10-09
上傳用戶：bcjtao
HDOJ ACM input:The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. Each test case begins with a line containing an integer N , 1<=N<=200 , that represents the number of tables to move. Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t (each room number appears at most once in the N lines). From the N+3-rd line, the remaining test cases are listed in the same manner as above.
標(biāo)簽： input cases test The
上傳時(shí)間： 2015-10-18
上傳用戶：三人用菜
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
