虫虫首页| 资源下载| 资源专辑| 精品软件
登录| 注册

a-<b>Channel</b>-Modeling-Subcommittee-R

  • The government of a small but important country has decided that the alphabet needs to be streamline

    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-09

    上传用户:weixiao99

  • Simulator for a GSM traffic channel transmission and reception This Simulink model simulates the en

    Simulator for a GSM traffic channel transmission and reception This Simulink model simulates the entire transmission and reception of voice data of a traffic channel for GSM (TCH/FS)over a multipath fading channel, and it calculates the BER of the received signal

    标签: transmission Simulator reception simulates

    上传时间: 2015-07-12

    上传用户:BIBI

  • BNB20 Finds the constrained minimum of a function of several possibly integer variables. % Usage: [

    BNB20 Finds the constrained minimum of a function of several possibly integer variables. % Usage: [errmsg,Z,X,t,c,fail] = % BNB20(fun,x0,xstatus,xlb,xub,A,B,Aeq,Beq,nonlcon,settings,options,P1,P2,...) % % BNB solves problems of the form: % Minimize F(x) subject to: xlb <= x0 <=xub % A*x <= B Aeq*x=Beq % C(x)<=0 Ceq(x)=0 % x(i) is continuous for xstatus(i)=0 % x(i) integer for xstatus(i)= 1 % x(i) fixed for xstatus(i)=2 %

    标签: constrained variables function possibly

    上传时间: 2014-01-13

    上传用户:youth25

  • We have a group of N items (represented by integers from 1 to N), and we know that there is some tot

    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

  • 单纯形法算法,int K,M,N,Q=100,Type,Get,Let,Et,Code[50],XB[50],IA,IAA[50],Indexg,Indexl,Indexe float Sum,A

    单纯形法算法,int K,M,N,Q=100,Type,Get,Let,Et,Code[50],XB[50],IA,IAA[50],Indexg,Indexl,Indexe float Sum,A[50][50],B[50],C[50]

    标签: 50 Indexg Indexe Indexl

    上传时间: 2013-12-22

    上传用户:顶得柱

  • 用盛金公式解一元三次方程aX3+bX2+cX+d=0

    用盛金公式解一元三次方程aX3+bX2+cX+d=0,(a,b,c,d∈R,且a≠0)。

    标签: aX3 bX2 方程

    上传时间: 2014-01-27

    上传用户:iswlkje

  • Subspace Projection Based Blind Channel Order Estimation of MIMO Systems m file for a classical

    Subspace Projection Based Blind Channel Order Estimation of MIMO Systems m file for a classical channel order estimation method

    标签: Projection Estimation classical Subspace

    上传时间: 2016-11-26

    上传用户:weixiao99

  • made by: kangkai data:2008.11.23 this one is used to test arm7 str71x. use a led to test

    made by: kangkai data:2008.11.23 this one is used to test arm7 str71x. use a led to test GPIO. a---------P0.0 b---------P0.1 c---------P0.2 d---------P0.3 e---------P0.4 f---------P0.5 g---------P0.6 just run it and you will see the led to show 0-9 all the time.

    标签: test kangkai made 2008

    上传时间: 2016-12-16

    上传用户:moerwang

  • 【问题描述】 在一个N*N的点阵中

    【问题描述】 在一个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

  • 开源路由器的研究

    本论文研究了开源路由器的实现方法,通过具体的实验在X O R P 上实现了R I P , O S P F , B G P 等一系列协议,在P A C K E T T R A C E R 上进行了仿真,并对开源路由器进行了性能评价。

    标签: 开源路由器

    上传时间: 2015-02-21

    上传用户:13666909595