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

given

  • This gives examples of Session Description Protocol (SDP) offer/answer exchanges. Examples include

    This gives examples of Session Description Protocol (SDP) offer/answer exchanges. Examples include codec negotiation and selection, hold and resume, and addition and deletion of media streams. The examples show multiple media types, bidirectional, unidirectional, inactive streams, and dynamic payload types. Common Third Party Call Control (3pcc) examples are also given.

    标签: Description exchanges Protocol Examples

    上传时间: 2014-01-02

    上传用户:450976175

  • In this paper, a new family of Cassinian wave-guides is proposed, simulating and calculation are fi

    In this paper, a new family of Cassinian wave-guides is proposed, simulating and calculation are finished with CST Microwave Studio that based on Finite Integral Technique (FIT), and some results are given. Electromagnetic field mode type of it is TE, electromagnetic field is stronger near neck region, and some resonance frequencies appear. The new Cassinian curve wave-guides will possess higher power than ones of the rectangular and elliptic wave-guides because the height at the position where maximal electric field occurs is smaller.

    标签: calculation wave-guides simulating Cassinian

    上传时间: 2014-01-18

    上传用户:netwolf

  • 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

  • This program compress and recostruct using wavelets. We can select level of decomposition(here maxim

    This program compress and recostruct using wavelets. We can select level of decomposition(here maximum 4 levels are given) of images using selected wavelet. For eg:-wavelets can be haar, db1, db2,dmey............... Decomposition can be viewed in figure. (Please note that select 256X256 image for better result.) Then compression can performed, PERFL2 give compression score. Then reconstruction can be performed. Each decompsition we can choose different threshold values. For each threshold value we can calculate mse,psnr,pq(picture quality), bit ratio etc. To get pq install pqs function .

    标签: decomposition recostruct compress wavelets

    上传时间: 2016-01-22

    上传用户:liuchee

  • This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS

    This directory contains code implementing the K-means algorithm. Source code may be found in KMEANS.CPP. Sample data isfound in KM2.DAT. The KMEANS program accepts input consisting of vectors and calculates the given number of cluster centers using the K-means algorithm. Output is directed to the screen.

    标签: code implementing directory algorithm

    上传时间: 2014-01-15

    上传用户:woshini123456

  • Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optim

    Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.

    标签: interesting Traveling classical Salesman

    上传时间: 2016-02-06

    上传用户:rocwangdp

  • Make a graph from database record and either send it to a printer directly selecting many print op

    Make a graph from database record and either send it to a printer directly selecting many print options or copy it in any file on disc. This project also gives you print preview option for A4 size paper and you can set your graph anywhere on the page.Also if you want to change graph s height or width you can change.Zooming effect is also given using hsrollbar.

    标签: selecting database directly printer

    上传时间: 2016-02-06

    上传用户:s363994250

  • The XML Toolbox converts MATLAB data types (such as double, char, struct, complex, sparse, logical)

    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

  • map identification laquo yuan Problem description : the digital image processing of an image often e

    map identification laquo yuan Problem description : the digital image processing of an image often expressed as a macute M pixel matrix. Each pixel value is 0 or 1. The value of 0 pixel image, said background, and the value of a pixel image, said a map of a million, usually called map million pixels. When a pixel in another pixels above, below, left or right, said that two adjacent pixels of the pixel. An image of the pixels belonging to the same map yuan, instead of adjacent pixels belonging to different map yuan. Figure yuan identification of problems is right for the given image pixel map marking yuan, making the same map billion yuan pixel map of the same markings and different map billion yuan pixel map of their marks are different. Trial queue abstract data type design solut

    标签: image identification description processing

    上传时间: 2013-12-15

    上传用户:15736969615

  • Bold index entries have corresponding pages in the main body of the guide. The remaining index entr

    Bold index entries have corresponding pages in the main body of the guide. The remaining index entries are followed by a list of appropriate page references in the alphabetical reference sections, given in order of importance.

    标签: index corresponding the remaining

    上传时间: 2014-06-05

    上传用户:huql11633