In this paper, we describe the development of a mobile butterfly-watching learning (BWL) system to realize outdoor independent learning for mobile learners. The mobile butterfly-watching learning system was designed in a wireless mobile ad-hoc learning environment. This is FIRST result to provide a cognitive tool with supporting the independent learning by applying PDA with wireless communication technology to extend learning outside of the classroom. Independent learning consists of self-selection, self-determination, self-modification, and self-checking.
標簽： butterfly-watching development describe learning
上傳時間： 2014-11-26
上傳用戶：waizhang
CCS編程環境 使用的是匯編加C的混合編程方法： The programme of the Correlation Algorithm. Using INT2 to get the input signal. Array x, in FIRST step, is the input signal produced by programme, in next step, is the input signal get from A/D, the length is 128, 32-bit floating point. Array y, in FIRST step, is the input signal produced by programme, in next step, is the input signal get from A/D, the length is 128, 32-bit floating point. Array cor is the Correlation result, the length is 255, 32-bit floating point.
標簽： Correlation Algorithm programme the
上傳時間： 2013-12-21
上傳用戶：leixinzhuo
軟件開發工程是有趣的、多產的，甚至是大膽的。同時，它也能源源不斷地帶來商業價值，并保持在我們的掌控之下。 極限編程(XP)的構思和發展是針對小型團隊進行軟件開發時，在面對不確知的、變化的需求時所產生的特定需要的。這一新的、輕量級的方法學對許多傳統思維提出了挑戰，這其中包括一個一直以來的假設，即在軟件開發過程中，對軟件進行一個小小的改動就必然會使其開發成本大大增加。極限編程認可軟件開發工程應該節約成本，而且一旦實現了某種節約就應該加以開發利用。 你可以喜歡XP，也可以恨它，但是本書將會使你對如何開發軟件有一個全新的認識。KentBeck擁有并經營著FIRST Class軟件公司，在這里他把主要精力放在兩個最大的興趣上——模式和極限編程。他一直在研究軟件開發的先驅模式、CRC卡、HotDraw畫圖編輯器框架、xUnit單元測試框架以及測試為先的編程。他發表了五十多篇關于編程的文章，并出版了《The Smalltalk Best Practice Patterns》(Prentice-Hall出版社)和《Kent Beck’s Guide to Better Smalltalk：A Sorted Collection》(劍橋大學出版社)兩本著作，同時他還是超級暢銷書《重構——改善既有代碼的設計》(中英文版皆由中國電力出版社出版)的特約撰稿人。
上傳時間： 2015-10-02
上傳用戶：邶刖
This unit uses an array of bytes to represent a LARGE number. The number is binairy-stored in the array, with the Least Significant Byte (LSB) FIRST and the Most Significant Byte (MSB) last, like all Intel-integer types.
標簽： number binairy-stored represent LARGE
上傳時間： 2015-10-08
上傳用戶：xieguodong1234
Do your applications look a little boring? Would you like to get spectacular yet easy to use visual effects? Billenium Effects will give your applications a different touch without interfering with your existing code. For example, just by dropping two components to your Splash Screen or About form they will be shown with a professional transition effect that will delight your customers. FIRST impressions count!
標簽： applications spectacular little boring
上傳時間： 2015-10-09
上傳用戶：dreamboy36
學編譯原理時寫的一個語法分析程序 一．[目的要求] ① 對輸入文法，由程序自動構造FIRST FOLLOW集 ② 對輸入文法，由程序自動生成它的LL(1)分析表； ③ 對于給定的輸入串，應能判斷識別該串是否為給定文法的句型。 二．[題目分析] 該程序可分為如下幾步： （1）讀入文法 （2）判斷正誤 （3）若無誤，判斷是否為LL(1)文法 （4）若是，構造分析表； （5）由總控算法判斷輸入符號串是否為該文法的句型。
上傳時間： 2015-10-17
上傳用戶：ippler8
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.
上傳時間： 2015-10-18
上傳用戶：三人用菜
acm HDOJ 1051WoodenSticks Description: There is a pile of n wooden sticks. The length and weight of each stick are known in advance. The sticks are to be processed by a woodworking machine in one by one fashion. It needs some time, called setup time, for the machine to prepare processing a stick. The setup times are associated with cleaning operations and changing tools and shapes in the machine. The setup times of the woodworking machine are given as follows: (a) The setup time for the FIRST wooden stick is 1 minute. (b) Right after processing a stick of length l and weight w , the machine will need no setup time for a stick of length l and weight w if l<=l and w<=w . Otherwise, it will need 1 minute for setup.
標簽： WoodenSticks Description length wooden
上傳時間： 2014-03-08
上傳用戶：netwolf
圖的深度優先遍歷和廣度優先遍歷，以鄰接矩陣方式輸入。（按照提示輸入）！ - The chart depth FIRST spreads the calendar and the breadth FIRST spreads the calendar, is next the matrix way input. (According
標簽：
上傳時間： 2014-01-27
上傳用戶：徐孺
Learning Kernel Classifiers: Theory and Algorithms, Introduction This chapter introduces the general problem of machine learning and how it relates to statistical inference. 1.1 The Learning Problem and (Statistical) Inference It was only a few years after the introduction of the FIRST computer that one of man’s greatest dreams seemed to be realizable—artificial intelligence. Bearing in mind that in the early days the most powerful computers had much less computational power than a cell phone today, it comes as no surprise that much theoretical research on the potential of machines’ capabilities to learn took place at this time. This becomes a computational problem as soon as the dataset gets larger than a few hundred examples.
標簽： Introduction Classifiers Algorithms introduces
上傳時間： 2015-10-20
上傳用戶：aeiouetla
