Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - 3-opt
Search - 3-opt - List
DL : 0
光学设计软件zemax源码: This DLL models an nular aspheric surface as described in: \"Annular surfaces in annular field systems\" By Jose M. Sasian Opt. eng. 36 (12) P 3401-3401 December 1997 This surface is essentially an odd aspheric surface with an offset in the aspheric terms. The sag is given by: Z = (c*r*r) / (1+(1-((1+k)*c*c*r*r))^ 1/2 ) + a*(r-q)^2 + b*(r-q)^3 + c*(r-q)^4 + ... Note the terms a, b, c, ... have units of length to the -1, -2, -3, ... power.-optical design software zemax source : This DLL models an annular aspheric surface as d escribed in : "Annular surfaces in annular field systems" By Jose M. Sasian Opt. eng. 36 (12) P 3401-3401 Dece This inflicted 1,997 surface is essentially an odd asp heric surface with an offset in the aspheric ter ms. The sag is given by : Z = (c * r * r) / (1 (1-((a k) * c * c * r * r)) ^ 1 / 2) a * (r - q) b ^ 2 * (r-q) * c ^ 3 (r-q) ^ 4 ... Note the terms a, b, c, ... have units of length to the -1, -2, -3, ... power.
Update : 2008-10-13 Size : 42301 Publisher : 狄拉克

DL : 0
PAGES3完成了程序的 基本框架,FIFO()除了命中和置换情况外基本完成,但是修改位示图的子函数 出现问题,得不到正确的行数和列数,有时更改不了0 PAGES4修正了3中的问题,完成FIFO() PAGES5修正了FIFO()中执行置换时未将位示图中的对应块置0 PAGES6完成了LRU() PAGES7优化了界面,修正了切换算法后访问次数与上次算法相连的错误 PAGES8完成了OPT()修正了在页面置换切换时页表内存位示图不能各自初始化的错误。发现OPT()中页面置换时出现的错误。 位示图置0和置1时出错 。而且输出的页表缺失项目 PAGES9好像是修正了 8中的错误,现在还没有找到让9中OPT()发生置换的测试用例 PAGES10找到8,9中出错原因,在于置换时没有得到最久要访问的Memory[i] PAGES11修正10中的错误。完成OPT() 发现了LRU()输出界面的信息冗余,已经更正 PAGES12删除了编程过程中的测试信息 PAGES13修正了判断溢出时的一个错误。将判断的〈=改为〈-PAGES3 completed a basic framework of the procedure, FIFO () except hit and replacement of the foreign basically completed, but changes Bitmap Functions of the problem, not the correct number of rows and columns, and sometimes change can PAGES4 amended 0 of 3, completed FIFO () PAGES5 amended the FIFO () implementation replacement failed to Bitmap the corresponding block home 0 PAGES6 completed the LRU () PAGES7 optimize the interface that the handoff algorithm with the number of visits after the last algorithm linked to the wrong PAGES8 completed the OPT () of the amendment pages replacement when switching memory page table Bitmap not their initialization errors. Found OPT () replacement pages at the mistakes. Bitmap home and home 0 errors 1:00. And the output page table missing items PAG
Update : 2008-10-13 Size : 10327 Publisher : billdong

pcf8584应用实例,*** PROJEKT, bestehend aus 3 Teilen *** ** PCF8584 ** PCF8584.Opt i2c_DEF.h PCF8584.Uv2 PCF8584_lib.c PCF8584_lib.h ringbuf.h ringbuffer.c test.ini tst_I2C.c Globals.h ** Chip_Inc ** 16550.h 81C90.h phyCORE_591.h LAB537.h MCB517AC.h PCF8584.H CM517A.h PIO_8255.h RTC72421.h DEF_BOARDS.H MOD515.h I2c_Chip_Lib.h ** Inc_C51b_T2 ** LCD_DEF_LIB.h ASCII2hex.h BCD_HEX.H bcd2hex.h CG_RAM_Lib.H CRC_16.H Def_bits.h DEF_INT.H Defines.h INTELHEX.H ITOA.H ASCI_hex.h LRC.H MAKROS.H PACK_7T8.H Ram_des.h Ram_inv.h Rom_chk.h RS232_BD.h sm_printf.h SOFT_RES.H TASTEN_LIB.H tasten_matrix_lib.h TIME_OUT_lib.H centronics_lib.h I2c_Lib.h DEF_MIC.H
Update : 2008-10-13 Size : 29074 Publisher : nightwindy

DL : 0
操作系统实验(LINUX): 设计一个虚拟存储区和内存工作区,并使用下列算法计算访问命中率. (1) 进先出的算法(FIFO) (2) 最近最少使用的算法(LRU) (3) 最佳淘汰算法(OPT) (4) 最少访问页面算法(LFU) (5) 最近最不经常使用算法(NUR) 命中率=(1-页面失效次数)/页地址流长度
Update : 2008-10-13 Size : 2296 Publisher : zengzl

DL : 3
本版本为专门定做版,服务器端需要存放的文件:update.ini、hxmoli.rar(新版本登录器压缩文件)、cg.rar(魔力宝贝客户端启动文件)这3个文件,当然,可以自己进行设置,设置好后,拥有自动升级的功能了哦,同时,反外挂方面已经可以抵挡90%的外挂了。 客户端文件是:幻想魔力.exe(登录器运行文件,可以改为自己设置的)、update.exe(自动升级的调用文件)、两个opt设置文件。 发布新版本后,需要更新update.ini里的版本号(此版本利用的是自己设置的版本号实现更新的,正式专用版本使用的文件MD5验证进行在线更新)。
Update : 2008-10-13 Size : 307973 Publisher : ikki0531

TSP算法 1.C语言TSP算法 2.2-OPT,orOPT摄动 3.Main单独执行
Update : 2008-10-13 Size : 2206 Publisher : DuDu Ch

DL : 0
程序功能主要分为3个部分,分别是对OPT、FIFO、LRU三种页面置换算法的实现。要求3部分的设计应该尽可能使用近似的实现方法。-procedures main function is divided into three parts, namely the OPT, FIFO, three pages replacement LRU algorithm implementation. Part of the three requirements should be designed as far as possible to use similar methods to achieve.
Update : 2008-10-13 Size : 10103 Publisher : gjb

DL : 0
任务 设计一个虚拟存储区和内存工作区,并使用下述算法计算访问命中率。 (1)先进先出的算法(FIFO) (2)最近最少使用算法(LRU) (3)最佳淘汰算法(OPT) (4)最少访问页面算法(LFU) (5)最近最不经常使用算法(NUR) 命中率=(1 – 页面失效次数)/页地址流长度-mission design a virtual memory storage area and the work area and to use the following algorithm to visit the hit rate. (1) FIFO algorithm (FIFO) (2) at least recently used algorithm (LRU) (3) eliminated the best algorithm (OPT) (4) at least visit pages algorithm (LFU) (5) most recently used algorithm (NUR) life China rate = (1-pages failure number) / page-length addre
Update : 2008-10-13 Size : 2639 Publisher : 东方少秋

DL : 0
程序功能主要分为3个部分,分别是对OPT、FIFO、LRU三种页面置换算法的实现。要求3部分的设计应该尽可能使用近似的实现方法。-procedures main function is divided into three parts, namely the OPT, FIFO, three pages replacement LRU algorithm implementation. Part of the three requirements should be designed as far as possible to use similar methods to achieve.
Update : 2024-05-06 Size : 10240 Publisher : gjb

数据结构所有实验\02824523 .cpp 数据结构所有实验\02824523 .ds w 数据结构所有实验\02824523 .ncb 数据结构所有实验\02824523\02824523.opt 数据结构所有实验\02824523\02824523.plg 数据结构所有实验\02824523\Debug 数据结构所有实验\02824523\ReadMe.txt 数据结构所有实验\02824523\StdAfx.cpp 数据结构所有实验\02824523\StdAfx.h 数据结构所有实验\02824523Wanglili -all experimental data structure \ 02824523 .cpp all data structure Experimental \ 02824523 .dsp all experimental data structure \ 0282452 3 \ 02824523.dsw all experimental data structure \ 02824523 . NCB all experimental data structure \ 02824523 .opt all data structure Experimental \ 02824523 .plg all experimental data structure \ 0282452 3 \ Debug all experimental data structure \ 02824523 \ ReadMe.txt file data structure there experimental \ 02824523 \ StdAfx.cpp all experimental data structure \ 02824523 \ StdAfx.h all experimental data structure \ 02824523Wang
Update : 2024-05-06 Size : 6144 Publisher : 周文强

光学设计软件zemax源码: This DLL models an nular aspheric surface as described in: "Annular surfaces in annular field systems" By Jose M. Sasian Opt. eng. 36 (12) P 3401-3401 December 1997 This surface is essentially an odd aspheric surface with an offset in the aspheric terms. The sag is given by: Z = (c*r*r) / (1+(1-((1+k)*c*c*r*r))^ 1/2 ) + a*(r-q)^2 + b*(r-q)^3 + c*(r-q)^4 + ... Note the terms a, b, c, ... have units of length to the -1, -2, -3, ... power.-optical design software zemax source : This DLL models an annular aspheric surface as d escribed in : "Annular surfaces in annular field systems" By Jose M. Sasian Opt. eng. 36 (12) P 3401-3401 Dece This inflicted 1,997 surface is essentially an odd asp heric surface with an offset in the aspheric ter ms. The sag is given by : Z = (c* r* r)/(1 (1-((a k)* c* c* r* r)) ^ 1/2) a* (r- q) b ^ 2* (r-q)* c ^ 3 (r-q) ^ 4 ... Note the terms a, b, c, ... have units of length to the-1,-2,-3, ... power.
Update : 2024-05-06 Size : 41984 Publisher : 狄拉克

DL : 0
PAGES3完成了程序的 基本框架,FIFO()除了命中和置换情况外基本完成,但是修改位示图的子函数 出现问题,得不到正确的行数和列数,有时更改不了0 PAGES4修正了3中的问题,完成FIFO() PAGES5修正了FIFO()中执行置换时未将位示图中的对应块置0 PAGES6完成了LRU() PAGES7优化了界面,修正了切换算法后访问次数与上次算法相连的错误 PAGES8完成了OPT()修正了在页面置换切换时页表内存位示图不能各自初始化的错误。发现OPT()中页面置换时出现的错误。 位示图置0和置1时出错 。而且输出的页表缺失项目 PAGES9好像是修正了 8中的错误,现在还没有找到让9中OPT()发生置换的测试用例 PAGES10找到8,9中出错原因,在于置换时没有得到最久要访问的Memory[i] PAGES11修正10中的错误。完成OPT() 发现了LRU()输出界面的信息冗余,已经更正 PAGES12删除了编程过程中的测试信息 PAGES13修正了判断溢出时的一个错误。将判断的〈=改为〈-PAGES3 completed a basic framework of the procedure, FIFO () except hit and replacement of the foreign basically completed, but changes Bitmap Functions of the problem, not the correct number of rows and columns, and sometimes change can PAGES4 amended 0 of 3, completed FIFO () PAGES5 amended the FIFO () implementation replacement failed to Bitmap the corresponding block home 0 PAGES6 completed the LRU () PAGES7 optimize the interface that the handoff algorithm with the number of visits after the last algorithm linked to the wrong PAGES8 completed the OPT () of the amendment pages replacement when switching memory page table Bitmap not their initialization errors. Found OPT () replacement pages at the mistakes. Bitmap home and home 0 errors 1:00. And the output page table missing items PAG
Update : 2024-05-06 Size : 10240 Publisher : billdong

pcf8584应用实例,*** PROJEKT, bestehend aus 3 Teilen *** ** PCF8584 ** PCF8584.Opt i2c_DEF.h PCF8584.Uv2 PCF8584_lib.c PCF8584_lib.h ringbuf.h ringbuffer.c test.ini tst_I2C.c Globals.h ** Chip_Inc ** 16550.h 81C90.h phyCORE_591.h LAB537.h MCB517AC.h PCF8584.H CM517A.h PIO_8255.h RTC72421.h DEF_BOARDS.H MOD515.h I2c_Chip_Lib.h ** Inc_C51b_T2 ** LCD_DEF_LIB.h ASCII2hex.h BCD_HEX.H bcd2hex.h CG_RAM_Lib.H CRC_16.H Def_bits.h DEF_INT.H Defines.h INTELHEX.H ITOA.H ASCI_hex.h LRC.H MAKROS.H PACK_7T8.H Ram_des.h Ram_inv.h Rom_chk.h RS232_BD.h sm_printf.h SOFT_RES.H TASTEN_LIB.H tasten_matrix_lib.h TIME_OUT_lib.H centronics_lib.h I2c_Lib.h DEF_MIC.H-pcf8584 application,*** PROJEKT, bestehend aus 3 Teilen***** PCF8584** PCF8584.Opti2c_DEF.hPCF8584.Uv2PCF8584_lib.cPCF8584_lib.hringbuf.hringbuffer.ctest.initst_I2C.cGlobals.h** Chip_Inc** 16550.h81C90 . hphyCORE_591.hLAB537.hMCB517AC.hPCF8584.HCM517A.hPIO_8255.hRTC72421.hDEF_BOARDS.HMOD515.hI2c_Chip_Lib.h** Inc_C51b_T2** LCD_DEF_LIB.hASCII2hex.hBCD_HEX.Hbcd2hex.hCG_RAM_Lib.HCRC_16.HDef_bits.hDEF_INT.HDefines.hINTELHEX.HITOA.HASCI_hex . hLRC.HMAKROS.HPACK_7T8.HRam_des.hRam_inv.hRom_chk.hRS232_BD.hsm_printf.hSOFT_RES.HTASTEN_LIB.Htasten_matrix_lib.hTIME_OUT_lib.Hcentronics_lib.hI2c_Lib.hDEF_MIC.H
Update : 2024-05-06 Size : 28672 Publisher : nightwindy

DL : 3
本版本为专门定做版,服务器端需要存放的文件:update.ini、hxmoli.rar(新版本登录器压缩文件)、cg.rar(魔力宝贝客户端启动文件)这3个文件,当然,可以自己进行设置,设置好后,拥有自动升级的功能了哦,同时,反外挂方面已经可以抵挡90%的外挂了。 客户端文件是:幻想魔力.exe(登录器运行文件,可以改为自己设置的)、update.exe(自动升级的调用文件)、两个opt设置文件。 发布新版本后,需要更新update.ini里的版本号(此版本利用的是自己设置的版本号实现更新的,正式专用版本使用的文件MD5验证进行在线更新)。-err
Update : 2024-05-06 Size : 307200 Publisher : ikki0531

DL : 0
哈夫曼编码/译码器 1)问题描述 设计一个利用哈夫曼算法的编码,重复地显示并处理以下项目,直到选择退出为止。 2)基本要求 (1)初始化:键盘输入字符集大小n、n个字符和n个权值,建立哈夫曼树; (2)编码:利用建好的哈夫曼树生成哈夫曼编码; (3)输出编码; -Huffman Encoder/Decoder 1) Description of the problem to design an algorithm using Huffman coding, repeat show and deal with the following items until the opt-out so far. 2) the basic requirements (1) Initialization: keyboard input character set size of n, n and n characters of the right value, the establishment of Huffman tree (2) Coding: Using the built Huffman Huffman tree generated coding (3) the output coding
Update : 2024-05-06 Size : 1024 Publisher : 龚海泉

DL : 0
程序说明:浮点数变为压缩BCD码,保存在以数组中 第1字节的位7:0正,1负.位6:0(位5--0代表小数点前的位数),1(位5--0代表小数 点后0的位数) 2--4字节为压缩BCD码,有效位为7位,3个半字节,最后半个字节请使用者自行放 弃 程序占用资源PSW,A,B,DPTR,R0--R7,SP深度6,RAM 5个放数据 keil 兼容,调用KEIL 的FPMUL子程序。 程序作者:*************陈远征************** 目 的:追求更快的执行速度,与最小的程序代码 发布时间:2003--05--08 编写背景:精通汇编,研究C51半个月。身感C51方便中的不便 研究了几种汇编及KEIL的浮点算法,特做此程序. 声 明:转载时请保留以上的信息 -Procedure Description: BCD floating-point numbers into a compression code, stored in the array in the first 1-bit byte is 7:0, one negative. Bit 6:0 (bit 5 0 on behalf of the decimal point in front of the median), 1 (bit 5 0 on behalf of the digit after the decimal point 0) 2 4 bytes for the compressed BCD code, valid for 7-bit, three semi-byte, the last half-byte user to opt-out procedure, please occupied resources PSW, A, B, DPTR , R0 R7, SP depth of 6, RAM 5 months keil release data compatibility, subprogram call KEIL the FPMUL. Procedures Author :************* Chen expedition************** Objective: To pursue the implementation of faster speed, with the smallest code Published: 2003 05 08 the preparation of background: proficient in the compilation, research C51 half a month. C51 body to facilitate a sense of inconvenience in study and compilation of several of the floating-point arithmetic KEIL, special procedures to do this. Disclaimer: Please retain the above reprint information
Update : 2024-05-06 Size : 2048 Publisher : 第三代

DL : 0
设计一个虚拟存储区和内存工作区,并使用下列算法计算页面失效次数. (1) 进先出的算法(FIFO) (2) 最近最少使用的算法(LRU) (3) 最佳淘汰算法(OPT) 在本实验中,页地址流长度为320,页面失效次数为每次访问相应指令时,该指令所对应的页不在内存的次数。 -Design of a virtual memory storage area and work area, and use the following algorithm for calculating the number of page failure. (1) into the algorithm, first-out (FIFO) (2) at least recently used algorithm (LRU) (3) the best out of algorithm (OPT ) In this experiment, the page address stream length of 320, the page number for each failure to visit the corresponding instructions, the instructions corresponding to the number of pages is not memory.
Update : 2024-05-06 Size : 2048 Publisher : lishuai

DL : 0
憧憬计数器v0.99,功能: 1.显示在线 2.今日浏览 3.本月浏览 4.全部浏览 5.排行 6.可以选择计数器是否显示,可选择计数器在线人数统计精确性 7.用户注册时其资料将同时提交到sohu搜索引擎 8.可设定有效刷新间隔时间,一定程度的防止作弊 网络编程。-Looking forward to Counter v0.99, feature: 1. Shows online 2. Today browser 3. This month browsing 4. All browser 5. Top 6. Can choose whether to display counters can opt for the accuracy of statistics on the number of counters online 7. Users when they register their At the same time, information will be submitted to the sohu search engine 8. refresh interval can be set effective time, a certain degree of network programming to prevent cheating.
Update : 2024-05-06 Size : 90112 Publisher : abc

DL : 0
【问题描述】 设计一个利用哈夫曼算法的编码和译码系统,重复地显示并处理以下项目,直到选择退出为止。 【基本要求】 (1)初始化:键盘输入字符集大小n、n个字符和n个权值,建立哈夫曼树; (2)编码:利用建好的哈夫曼树生成哈夫曼编码; (3)输出编码; (4)设字符集及频度如下表: 字符:A B C D E F 频度:4 9 23 2 17 15 字符:G H I J K 频度:1 2 3 3 4 -【Description】 design a question of the use of Huffman coding and decoding algorithm system, repeat the show and deal with the following items until the opt-out so far. The basic requirements 【】 (1) Initialization: keyboard input character set size of n, n and n characters of the right value, set up Huffman tree (2) Coding: Using the built Huffman Huffman tree generated coding (3) the output coding (4) based character set and the frequency of the following table: characters: ABCDEF frequency: 492,321,715 characters: GHIJK frequency: 12,334
Update : 2024-05-06 Size : 1024 Publisher : Fiona

SCM10to
DL : 0
基于单片机的10根线束线缆检测器的源程序 #pragma sfr #pragma DI #pragma EI #pragma NOP //#pragma interrupt INTTM010 isr_INTTM000 #pragma interrupt INTTM80 isr_INTTM80 //#pragma interrupt INTTMH1 isr_INTTMH1 #pragma section @@CNST OPT AT 80H const char OPTION=0x94 typedef unsigned char uchar typedef unsigned int uint //==PORT DEFINE== #define SEND1_P P4.1 #define SEND2_P P4.2 #define SEND3_P P4.3 #define SEND4_P P4.4 #define SEND5_P P4.5 #define SEND6_P P4.6 #define SEND7_P P4.7 #define SEND8_P P13.0 #define SEND9_P P2.3 #define SEND10_P P2.2 -10TO
Update : 2024-05-06 Size : 6144 Publisher :
« 1 2 3 45 6 »
DSSZ is the largest source code store in internet!
Contact us :
1999-2046 DSSZ All Rights Reserved.