自從Access新添“項(xiàng)目數(shù)據(jù)庫”這一概念，并強(qiáng)化Access與后端數(shù)據(jù)庫系統(tǒng)的整合后，長久以來，Access提供的功能與特色便與日俱增；Access 2003推出后，更改善了Internet 上電子數(shù)據(jù)交換的整合能力，并且提供了更強(qiáng)的錯(cuò)誤檢查、控件排序、自動(dòng)校正、備份/壓縮數(shù)據(jù)庫與導(dǎo)入/導(dǎo)出功能等，整體來看提高了使用與操作Access的管理性能，同時(shí)更易于Office家族的其他成員整合。本書的特點(diǎn)： 1.簡易學(xué)習(xí)為主線；從基本操作開始介紹，輔以圖文并茂的解說及相關(guān)的實(shí)際操作，讓您輕松地邁進(jìn)高手殿堂； 2.實(shí)務(wù)應(yīng)用為主線；以實(shí)際范例step ty step,手把手教會(huì)您各項(xiàng)功能及用法，宛如現(xiàn)場(chǎng)專家對(duì)您言傳身教； 3.重點(diǎn)學(xué)習(xí)為主線；本書針對(duì)各章節(jié)中的內(nèi)容，總結(jié)出重點(diǎn)并輔以習(xí)題讓您在閱讀后能夠立即上手。
標(biāo)簽： Access 項(xiàng)目 數(shù)據(jù)庫
上傳時(shí)間： 2013-12-18
上傳用戶：jjj0202
In this example we solve the following single ODE Program Name: RKG-1.FOR (Runge-Kutta-Gill algorithm, fixed step size)
標(biāo)簽： Runge-Kutta-Gill following example Program
上傳時(shí)間： 2014-01-16
上傳用戶：maizezhen
Threads are essential to Java programming, but learning to use them effectively is a nontrivial task. This new edition of the classic Java Threads shows you how to take full advantage of Java s threading facilities and brings you up-to-date with the watershed changes in Java 2 Standard Edition version 5.0 (J2SE 5.0). It provides a thorough, step-by-step approach to threads programming.
標(biāo)簽： effectively programming nontrivial essential
上傳時(shí)間： 2016-03-20
上傳用戶：hn891122
This document is designed to aid anyone considering whether to write an emulator for an arcade game machine. It will attempt to answer frequently asked questions, give a step by step tutorial, and provide the resources necessary for a capable programmer to begin work on an emulator for an arcade game.
標(biāo)簽： considering document designed emulator
上傳時(shí)間： 2014-01-05
上傳用戶：caixiaoxu26
In just 24 lessons of one hour or less, you will be able to build dynamic Web sites using JavaServer Pages. Using a straightforward, step-by-step approach, each lesson builds on the previous ones, enabling you to learn the essentials of JavaServer Pages 2.0 from the ground up. The book includes Apache Tomcat, Sun s reference implementation of JSP, so you can start developing applications immediately.
標(biāo)簽： JavaServer dynamic lessons build
上傳時(shí)間： 2014-11-25
上傳用戶：TRIFCT
This guide describes Freescale’s BeeKit Wireless Connectivity Toolkit configuration tool used for ZigBee, 802.15.4, or SMAC application development. The guide describes system requirements, installation, and how to launch BeeKit. The book then guides users through a simple step-by-step process of how to open and load a demonstration project through the CodeWarrior IDE without further modification. This allows for a quick evaluation of Freescale’s ZigBee technology.
標(biāo)簽： configuration Connectivity Freescale describes
上傳時(shí)間： 2013-12-24
上傳用戶：偷心的海盜
java的一個(gè)源代碼，、 public class ThunderBoltAct extends Canvas implements Runnable { private int TIMEOUT = 0 private final static int NUMERIC = 10000 //總分 private final static int INERRGAL = 60 //頻率 private final static int MAXBATTLE = 3 //最大飛機(jī)數(shù) private final static int MAXBALLNUM = 30 //最多飛機(jī)子彈數(shù) private final static int MAXCOPTERNUM = 16 //最大敵機(jī)數(shù) private final static int MAXCOPTERBALLNUM = 16 //最多敵機(jī)子彈數(shù) private final static int STEP = 1 private final static int MINCOPTER = 2 //最小敵機(jī)數(shù)
上傳時(shí)間： 2016-04-26
上傳用戶：jichenxi0730
The Ruby Way takes a "how-to" approach to Ruby programming with the bulk of the material consisting of more than 400 examples arranged by topic. Each example answers the question "How do I do this in Ruby?" Working along with the author, you are presented with the task description and a discussion of the technical constraints. This is followed by a step-by-step presentation of one good solution. Along the way, the author provides detailed commentary and explanations to aid your understanding.
標(biāo)簽： Ruby programming consisting the
上傳時(shí)間： 2013-12-13
上傳用戶：yoleeson
8puzzle game by Java This program can automatically solve 8 puzzle games with Manhattan approach and show each step.
標(biāo)簽： automatically Manhattan approach 8puzzle
上傳時(shí)間： 2016-07-24
上傳用戶：change0329
首先從起始點(diǎn)開始看它的八個(gè)方向中有幾個(gè)方向可以走，假如有5個(gè)方向可走，再看這5個(gè)位置下一步分別有幾步可走，把這個(gè)值賦給一個(gè)數(shù)組s[]，再對(duì)數(shù)組進(jìn)行從小到大排序，然后從5步中s[]值最小的走，依次遞歸，每次從s[]值最小的走，如果步驟號(hào)step等于棋盤規(guī)格m*n，則說明全部走完了；如果遇到無路可走的情況，step--，退回到上一步，當(dāng)一直退到起始點(diǎn)時(shí)候，說明無法全部遍歷。
上傳時(shí)間： 2016-07-25
上傳用戶：cursor
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
