书名：基本商业程序的建模 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
