光學(xué)設(shè)計(jì)軟件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.
標(biāo)簽： described aspheric surfaces Annular
上傳時(shí)間： 2014-01-08
上傳用戶：yyyyyyyyyy
The Linux kernel is one of the most interesting yet least understood open-source projects. It is also a basis for developing new kernel code. That is why Sams is excited to bring you the latest Linux kernel development information from a Novell insider in the second edition of Linux Kernel Development. This authoritative, practical guide will help you better understand the Linux kernel through updated coverage of all the major subsystems, new features associated with Linux 2.6 kernel and insider information on not-yet-released developments. You ll be able to take an in-depth look at Linux kernel from both a theoretical and an applied perspective as you cover a wide range of topics, including algorithms, system call interface, paging strategies and kernel synchronization. Get the top information right from the source in Linux Kernel Development.
標(biāo)簽： interesting open-source understood projects
上傳時(shí)間： 2015-07-26
上傳用戶：mpquest
Lighthouse within the software developer heart- 《 the myth of month of person 》 , this is the edition of PDF, very convenient
標(biāo)簽： the Lighthouse developer software
上傳時(shí)間： 2015-08-14
上傳用戶：kristycreasy
Lighthouse within the software developer heart- 《 the myth of month of person 》 , this is the edition of PDF, very convenient
標(biāo)簽： the Lighthouse developer software
上傳時(shí)間： 2014-01-16
上傳用戶：xg262122
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標(biāo)簽： introduction the contains intended
上傳時(shí)間： 2013-12-23
上傳用戶：liansi
MULTIDIMENSIONAL SCALING in matlab by Mark Steyvers 1999 ％needs optimization toolbox ％Modified by Bruce Land ％--Data via globals to anaylsis programs ％--3D plotting with color coded groups ％--Mapping of MDS space to spike train temporal profiles as described in ％Aronov, et.al. "Neural coding of spatial phase in V1 of the Macaque" in ％press J. Neurophysiology
標(biāo)簽： MULTIDIMENSIONAL optimization Modified Steyvers
上傳時(shí)間： 2015-08-26
上傳用戶：kytqcool
With a worldwide community of users and more than a million dedicated programmers, Perl has proven to be the most effective language for the latest trends in computing and business. Every programmer must keep up with the latest tools and techniques. This updated version of Advanced Perl Programming from O Reilly gives you the essential knowledge of the modern Perl programmer. Whatever your current level of Perl expertise, this book will help you push your skills to the next level and become a more accomplished programmer. O Reilly s most high-level Perl tutorial to date, Advanced Perl Programming, Second Edition teaches you all the complex techniques for production-ready Perl programs. This completely updated guide clearly explains concepts such as introspection, overriding built-ins, extending Perl s object-oriented model, and testing your code for greater stability. Other topics include: Complex data structures
標(biāo)簽： programmers worldwide community dedicated
上傳時(shí)間： 2014-10-27
上傳用戶：zhoujunzhen
By Tom Christiansen and Nathan Torkington ISBN 1-56592-243-3 First Edition, published August 1998. (See the catalog page for this book.) Search the text of Perl Cookbook. Table of Contents Copyright Page Foreword Preface Chapter 1: Strings Chapter 2: Numbers Chapter 3: Dates and Times Chapter 4: Arrays Chapter 5: Hashes Chapter 6: Pattern Matching Chapter 7: File Access Chapter 8: File Contents Chapter 9: Directories Chapter 10: Subroutines Chapter 11: References and Records Chapter 12: Packages, Libraries, and Modules Chapter 13: Classes, Objects, and Ties Chapter 14: Database Access Chapter 15: User Interfaces Chapter 16: Process Management and Communication Chapter 17: Sockets Chapter 18: Internet Services Chapter 19: CGI Programming Chapter 20: Web Automation Index Colophon
標(biāo)簽： Christiansen Torkington published Edition
上傳時(shí)間： 2014-02-20
上傳用戶：yyq123456789
Perl & XML. by Erik T. Ray and Jason McIntosh ISBN 0-596-00205-X First Edition, published April 2002. (See the catalog page for this book.) Table of Contents Copyright Page Preface Chapter 1: Perl and XML Chapter 2: An XML Recap Chapter 3: XML Basics: Reading and Writing Chapter 4: Event Streams Chapter 5: SAX Chapter 6: Tree Processing Chapter 7: DOM Chapter 8: Beyond Trees: XPath, XSLT, and More Chapter 9: RSS, SOAP, and Other XML Applications Chapter 10: Coding Strategies Index Colophon --------------------------------------------------------------------------------
標(biāo)簽： T. published McIntosh Edition
上傳時(shí)間： 2013-12-24
上傳用戶：yzhl1988
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
