The government of a small but important country has decided that the alphabet needs to be streamlined and reordered. Uppercase letters will be eliminated. They will issue a royal decree in the form of a String of B and A characters. The first character in the decree specifies whether a must come ( B )Before b in the new alphabet or ( A )After b . The second character determines the relative placement of b and c , etc. So, for example, "BAA" means that a must come Before b , b must come After c , and c must come After d . Any letters beyond these requirements are to be excluded, so if the decree specifies k comparisons then the new alphabet will contain the first k+1 lowercase letters of the current alphabet. Create a class Alphabet that contains the method choices that takes the decree as input and returns the number of possible new alphabets that conform to the decree. If more than 1,000,000,000 are possible, return -1. Definition
标签： government streamline important alphabet
上传时间： 2015-06-08
上传用户：weixiao99
电力系统在台稳定计算式电力系统不正常运行方式的一种计算。它的任务是已知电力系统某一正常运行状态和受到某种扰动，计算电力系统所有发电机能否同步运行 1运行说明： 请输入初始功率S0，形如a+bi 请输入无限大系统母线电压V0 请输入系统等值电抗矩阵B 矩阵B有以下元素组成的行矩阵 1正常运行时的系统直轴等值电抗Xd 2故障运行时的系统直轴等值电抗X d 3故障切除后的系统直轴等值电抗 请输入惯性时间常数Tj 请输入时段数N 请输入哪个时段发生故障Ni 请输入每时段间隔的时间dt
上传时间： 2015-06-13
上传用户：it男一枚
上下文无关文法（Context-Free Grammar, CFG）是一个4元组G=(V, T, S, P)，其中，V和T是不相交的有限集，S∈V，P是一组有限的产生式规则集，形如A→α，其中A∈V，且α∈(V∪T)*。V的元素称为非终结符，T的元素称为终结符，S是一个特殊的非终结符，称为文法开始符。 设G=(V, T, S, P)是一个CFG，则G产生的语言是所有可由G产生的字符串组成的集合，即L(G)={x∈T* | Sx}。一个语言L是上下文无关语言（Context-Free Language, CFL），当且仅当存在一个CFG G，使得L=L(G)。 *⇒ 例如，设文法G：S→AB A→aA|a B→bB|b 则L(G)={a^nb^m | n,m>=1} 其中非终结符都是大写字母，开始符都是S，终结符都是小写字母。
标签： Context-Free Grammar CFG
上传时间： 2013-12-10
上传用户：gaojiao1999
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-16
上传用户：jeffery
获取计算机IP地址等网络参数 UDP聊天程序 TCP聊天程序 浏览器的实现
标签： 获取计算机的名称和IP地址 基本C/S模式的通信实验
上传时间： 2015-04-12
上传用户：scnbyh
基于FPGA的机器人视觉系统模块的设计 关键字： 机器人 视觉系统 集成电路 FPGA 一、概述 视觉技术是近几十年来发展的一门新兴技术。机器视觉可以代替人类的视觉从事检验、目标跟踪、机器人导向等方面的工作，特别是在那些需要重复、迅速的从图象中获取精确信息的场合。尽管在目前硬件和软件技术条件下，机器视觉功能还处于初级水平，但其潜在的应用价值引起了世界各国的高度重视，发达国家如美国、日本、德国、法国等都投入了大量的人力物力进行研究，近年来已经在机器视觉的某些方面获得了突破性的进展，机器视觉在车辆安全技术、自动化技术等应用中也越来越显示出其重要价值。本文根据最新的CMOS图像采集芯片设计了一种通用的视觉系统模块，经过编制不同的图像处理、模式识别算法程序本模块可以应用到足球机器人，无人车辆等各种场合。
标签： FPGA的机器人视觉系统
上传时间： 2015-04-25
上传用户：justgo123
NFS服务器实现文件共享
上传时间： 2015-05-13
上传用户：yangkang1192
Use the fast Fourier transform function fft to analyse following signal. Plot the original signal, and the magnitude of its spectrum linearly and logarithmically. Apply Hamming window to reduce the leakage. . The hamming window can be coded in Matlab as for n=1:N hamming(n)=0.54+0.46*cos((2*n-N+1)*pi/N); end; where N is the data length in the FFT.
标签： matlab fft
上传时间： 2015-11-23
上传用户：石灰岩123
Use fft to analyse signal by plotting the original signal and its spectrum.
标签： matlab fft
上传时间： 2015-11-23
上传用户：石灰岩123
实验十 子程序结构设计实验
上传时间： 2016-05-11
上传用户：txzdll
