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
％ because we do not truncate and shift the convolved input ％ sequence, the delay of the desired output sequence wrt ％ the convolved input sequence need only be the delay ％ introduced by the ideal weight vector centred at n=5
标签： the convolved truncate sequence
上传时间： 2015-12-27
上传用户：www240697738
This example streams input from a ADC source to a DAC. An analog signal is acquired block-by-block into SDRAM from the ADC (an AD9244 in this example). The frames are then output with a one-frame delay to the DAC (an AD9744 in this example). In this example, no processing is done on the frames. They are passed unaltered.
标签： block-by-block acquired example streams
上传时间： 2015-12-29
上传用户：bjgaofei
最大流，The programs are designed to run under BSD UNIX. All programs read from the standard input and write to the standard output. Run "make" to compile the programs and generators. File "list" lists the programs produced my "make". Input files are in DIMACS format. See sample.input.
标签：
上传时间： 2015-12-30
上传用户：zhenyushaw
This program demonstrates operation of ADC0 in polled mode. The ADC0 is // configured to use writes to AD0BUSY as its start of conversion source and // to measure the output of the on-chip temperature sensor. The temperature // sensor output is converted to degrees Celsius and is transmitted out UART0
标签： ADC0 demonstrates configured operation
上传时间： 2014-01-23
上传用户：wangyi39
This program demonstrates operation of ADC0 in polled mode. The ADC0 is // configured to use writes to AD0BUSY as its start of conversion source and // to measure the output of the on-chip temperature sensor. The temperature // sensor output is converted to degrees Celsius and is transmitted out UART0
标签： ADC0 demonstrates configured operation
上传时间： 2014-08-18
上传用户：米卡
This directory contains the memtest 8051 firmware for the Anchor Chips EZ-USB chip. The purpose of this software is to test the different memory segments in the Ez-Usb chip. This example will output the string "good" on the 7 segment LED if the mem test passes, or it will output the first address where the memtest fails.
标签： directory the contains firmware
上传时间： 2013-12-16
上传用户：gdgzhym
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
