About: hamsterdb is a database engine written in ANSI C. It supports a B+Tree index structure, uses memory mapped I/O (if available), supports cursors, and can create in-memory databases. Release focus: Major feature enhancements Changes: This release comes with many changes and new features. It can manage multiple databases in one file. A new flag (HAM_LOCK_EXCLUSIVE) places an exclusive lock on the file. hamsterdb was ported to Windows CE, and the Solution file for Visual Studio 2005 now supports builds for x64. Several minor bugs were fixed, performance was improved, and small API changes occurred. Pre-built libraries for Windows (32-bit and 64-bit) are available for download. Author: cruppstahl
标签： C. hamsterdb structure database
上传时间： 2013-12-11
上传用户：LouieWu
xl2tpd a Layer 2 Tunneling Protocol (L2TP) daemon. It supports IPsec SA reference tracking, which enables the IPsec stacks to support multiple l2tp clients behind the same NAT router and multiple l2tp clients on the same internal IP address. It is a fork of "l2tpd". Release focus: Minor feature enhancements Changes: Support for passwordfd, a workaround for some Cisco routers, and extended logging.
标签： Tunneling reference Protocol supports
上传时间： 2014-01-20
上传用户：541657925
已知：Sn= 1＋1／2＋1／3＋…＋1／n。显然对于任意一个整数K，当n足够大的时候，Sn大于K。 现给出一个整数K（1<=k<=15），要求计算出一个最小的n；使得Sn＞K。 Input 键盘输入 k Output 屏幕输出 n Sample Input 1 Sample Output 2 Source
上传时间： 2014-01-25
上传用户：ruixue198909
这是一个ACM中的题请大家看以下哈 如果有问题请多多指教 n个猴子围坐一圈并按照顺时针方向从1到n编号，从第s个猴子开始进行1到m的报数，报数到第m的猴子 退出报数，从紧挨它的下一个猴子重新开始1到m的报数，如此进行下去知道所有的猴子都退出为止。 求给出这n个猴子的退出的顺序表。 Input 有做组测试数据．每一组数据有两行，第一行输入n（表示猴子的总数）第二行输入数据s(从第s 个猴子开 始报数)和数据m(第m个猴子退出报数)．当输入０ ０ ０时表示程序结束． Output 输出中，每组数据的输出结果为一行，中间用逗号间隔。
上传时间： 2014-01-01
上传用户：脚趾头
A stochastic-flow network consists of a set of nodes, including source nodes which supply various resources and sink nodes at which resource demands take place, and a collection of arcs whose capacities have multiple operational states.
标签： nodes stochastic-flow including consists
上传时间： 2013-12-22
上传用户：wlcaption
An AHB system is made of masters slaves and interconnections. A general approach to include all possible "muxed" implementation of multi layered AHB systems and arbitrated AHB ones can be thought as an acyclic graph where every source node is a master, every destination node is a slave and every internal node is an arbiter there must be one and only one arc exiting a master and one or more entering a slave (single slave verus multi-slave or arbitrated slave) an arbiter can have as many input and output connections as needed. A bridge is a special node that collapses one or more slave nodes and a master node in a new "complex" node.
标签： interconnections approach general include
上传时间： 2015-12-12
上传用户：lyy1234
In a preemptive priority based RTOS, priority inversion problem is among the major sources of deadline violations. Priority inheritance protocol is one of the approaches to reduce priority inversion. Unfortunately, RTOS like uC/OS can’t support priority inheritance protocol since it does not allow kernel to have multiple tasks at the same priority. Although it has different ways to avoid priority inversion such as priority ceiling protocol, developers still have some difficulties in programming real time applications with it. In this paper, we redesign the uC/OS kernel to provide the ability to support round robin scheduling and implement priority inheritance semaphore on the modified kernel. As result, we port new kernel with priority inheritance semaphore to evaluation board, and evaluate the execution time of each of the kernel service as well as verify the operations of our implementation.
标签： priority preemptive inversion problem
上传时间： 2015-12-14
上传用户：气温达上千万的
this a pack include source code for quartus 2. It is an implementation of the LC2. The LC-2 computer is described in Introduction to Computing Systems from Bits & Gates to C & Beyond by Yale Patt and Sanjay Patel, McGraw Hill, 2001. The LC2 model can be run as a simulation or downloaded to the UP3 in a larger model, TOP_LC2 that adds video output. Push buttons reset and single step the processor and a video output display of registers is generated. This state machine VHDL-based model of the LC-2 includes all source files. Currently compiled for a Cyclone EP1C6Q240 FPGA.
标签： implementation include quartus source
上传时间： 2013-12-25
上传用户：坏坏的华仔
« 问题描述： 假设要在足够多的会场里安排一批活动，并希望使用尽可能少的会场。设计一个有效的 贪心算法进行安排。(这个问题实际上是著名的图着色问题。若将每一个活动作为图的一个 顶点，不相容活动间用边相连。使相邻顶点着有不同颜色的最小着色数，相应于要找的最小 会场数。) « 编程任务： 对于给定的k个待安排的活动，编程计算使用最少会场的时间表。 « 数据输入： 由文件input.txt给出输入数据。第一行有1 个正整数k，表示有k个待安排的活动。接 下来的k行中，每行有2个正整数，分别表示k个待安排的活动开始时间和结束时间。时间 以0 点开始的分钟计。 « 结果输出: 将编程计算出的最少会场数输出到文件output.txt。
标签： laquo
上传时间： 2013-12-20
上传用户：LIKE
ICP fit points in data to the points in model. Fit with respect to minimize the sum of square errors with the closest model points and data points. Ordinary usage: [R, T] = icp(model,data) INPUT: model - matrix with model points, data - matrix with data points, OUTPUT: R - rotation matrix and T - translation vector accordingly so newdata = R*data + T . newdata are transformed data points to fit model see help icp for more information
标签： points the minimize respect
上传时间： 2014-01-02
上传用户：gyq
