書名：基本商業程序的建模 Essential Business Process Modeling (Paperback) 作者： Mike Havey 出版商：O Reilly 1 edition (August 18, 2005) 內容介紹： Ten years ago, groupware bundled with email and calendar applications helped track the flow of work from person to person within an organization. Workflow in today s enterprise means more monitoring and orchestrating massive systems. A new technology called Business Process Management, or BPM, helps software architects and developers design, code, run, administer, and monitor complex network-based business processes. BPM replaces those sketchy flowchart diagrams that business analysts draw on whiteboards with a precise model that uses standard graphical and XML representations, and an architecture that allows it converse with other services, systems, and users.
標簽： Essential Paperback Business Modeling
上傳時間： 2015-10-21
上傳用戶：zhangyigenius
Yet another Java implementation for the addictive Minesweeper game. This game comes with a number of options unavailable in Windows s version, such as allowing more than one mines in a square.
標簽： game implementation Minesweeper addictive
上傳時間： 2014-01-06
上傳用戶：zhaiyanzhong
We have a group of N items (represented by integers from 1 to N), and we know that there is some total order defined for these items. You may assume that no two elements will be equal (for all a, b: a<b or b<a). However, it is expensive to compare two items. Your task is to make a number of comparisons, and then output the sorted order. The cost of determining if a < b is given by the bth integer of element a of costs (space delimited), which is the same as the ath integer of element b. Naturally, you will be judged on the total cost of the comparisons you make before outputting the sorted order. If your order is incorrect, you will receive a 0. Otherwise, your score will be opt/cost, where opt is the best cost anyone has achieved and cost is the total cost of the comparisons you make (so your score for a test case will be between 0 and 1). Your score for the problem will simply be the sum of your scores for the individual test cases.
標簽： represented integers group items
上傳時間： 2016-01-17
上傳用戶：jeffery
The XML Toolbox converts MATLAB data types (such as double, char, struct, complex, sparse, logical) of any level of nesting to XML format and vice versa. For example, >> project.name = MyProject >> project.id = 1234 >> project.param.a = 3.1415 >> project.param.b = 42 becomes with str=xml_format(project, off ) "<project> <name>MyProject</name> <id>1234</id> <param> <a>3.1415</a> <b>42</b> </param> </project>" On the other hand, if an XML string XStr is given, this can be converted easily to a MATLAB data type or structure V with the command V=xml_parse(XStr).
標簽： converts Toolbox complex logical
上傳時間： 2016-02-12
上傳用戶：a673761058
The GP kernel is a C++ class library that can be used to apply genetic programming techniques to all kinds of problems. The library defines a class hierarchy. An integral component is the ability to produce automatically defined functions as found in Koza s "Genetic Programming II".
標簽： programming techniques genetic library
上傳時間： 2016-08-17
上傳用戶：zhengzg
漢諾塔！！！ Simulate the movement of the Towers of Hanoi puzzle Bonus is possible for using animation eg. if n = 2 A→B A→C B→C if n = 3 A→C A→B C→B A→C B→A B→C A→C
標簽： the animation Simulate movement
上傳時間： 2017-02-11
上傳用戶：waizhang
The purpose of this book is to provide experienced software developers with the means to quickly become productive in Microsoft s Visual Basic .NET development environment.
標簽： experienced developers software purpose
上傳時間： 2013-12-22
上傳用戶：Ants
Game programmers, check out the only book on data structures written especially for you! Described in layman s terms, this book will explain all of the essential data structures that are used in video game programming. It will also go over some of the more advanced and specialized data structures, too. Data Structures for Game Programmers is written in C++, and any special skills required to understand the book will be explained within it. The CD will include source code of the book, compiled demo s of the source, graphical demo code, plus tools such as Visual C++ 5, SDL, STLPort, Paint Shop Pro, and an SDL Primer by Ernest Pazera.
標簽： programmers especially structures Described
上傳時間： 2013-12-25
上傳用戶：lixinxiang
本代碼為編碼開關代碼，編碼開關也就是數字音響中的 360度旋轉的數字音量以及顯示器上用的（單鍵飛梭開 關）等類似鼠標滾輪的手動計數輸入設備。 我使用的編碼開關為5個引腳的，其中2個引腳為按下 轉輪開關（也就相當于鼠標中鍵）。另外3個引腳用來 檢測旋轉方向以及旋轉步數的檢測端。引腳分別為a,b,c b接地a，c分別接到P2.0和P2.1口并分別接兩個10K上拉 電阻，并且a，c需要分別對地接一個104的電容，否則 因為編碼開關的觸點抖動會引起輕微誤動作。本程序不 使用定時器，不占用中斷，不使用延時代碼，并對每個 細分步數進行判斷，避免一切誤動作，性能超級穩定。 我使用的編碼器是APLS的EC11B可以參照附件的時序圖 編碼器控制流水燈最能說明問題，下面是以一段流水 燈來演示。
上傳時間： 2017-07-03
上傳用戶：gaojiao1999
【問題描述】 在一個N*N的點陣中，如N=4,你現在站在（1，1），出口在（4，4）。你可以通過上、下、左、右四種移動方法，在迷宮內行走，但是同一個位置不可以訪問兩次，亦不可以越界。表格最上面的一行加黑數字A[1..4]分別表示迷宮第I列中需要訪問并僅可以訪問的格子數。右邊一行加下劃線數字B[1..4]則表示迷宮第I行需要訪問并僅可以訪問的格子數。如圖中帶括號紅色數字就是一條符合條件的路線。 給定N，A[1..N] B[1..N]。輸出一條符合條件的路線，若無解，輸出NO ANSWER。（使用U，D，L，R分別表示上、下、左、右。） 2 2 1 2 （4，4） 1 （2，3） （3，3） （4，3） 3 （1，2） （2，2） 2 （1，1） 1 【輸入格式】 第一行是數m (n < 6 )。第二行有n個數，表示a[1]..a[n]。第三行有n個數，表示b[1]..b[n]。 【輸出格式】 僅有一行。若有解則輸出一條可行路線，否則輸出“NO ANSWER”。
標簽： 點陣
上傳時間： 2014-06-21
上傳用戶：llandlu
