亚洲欧美第一页_禁久久精品乱码_粉嫩av一区二区三区免费野_久草精品视频

蟲蟲首頁| 資源下載| 資源專輯| 精品軟件
登錄| 注冊

e-a

  • 3G Mobile Open Wide Door For E-commerce The 3G mobile Internet business in 3G era will obtain rapid

    3G Mobile Open Wide Door For E-commerce The 3G mobile Internet business in 3G era will obtain rapid development, but it still cannot become the ma in 3G era. In the age of 3G speech business, but is still a subject of value-added business will have great development, the 3G mobile Internet business.

    標簽: E-commerce 3G Internet business

    上傳時間: 2017-03-23

    上傳用戶:zjf3110

  • c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlyin

    c pgm to find redundant paths in a graph.Many fault-tolerant network algorithms rely on an underlying assumption that there are possibly distinct network paths between a source-destination pair. Given a directed graph as input, write a program that uses depth-first search to determine all such paths. Note that, these paths are not vertex-disjoint i.e., the vertices may repeat but they are all edge-disjoint i.e., no two paths have the same edges. The input is the adjacency matrix of a directed acyclic graph and a pair(s) of source and destination vertices and the output should be the number of such disjoint paths and the paths themselves on separate lines. In case of multiple paths the output should be in order of paths with minimum vertices first. In case of tie the vertex number should be taken in consideration for ordering.

    標簽: fault-tolerant algorithms redundant underlyin

    上傳時間: 2013-12-18

    上傳用戶:jkhjkh1982

  • Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a

    Shortest Paths with Multiplicative Cost. In a given undirected graph, the path cost is measured as a product of all the edges in the path. The weights are rational numbers (e.g., 0.25, 0.75, 3.75 etc) or integers (2, 3). There are no negative edges. Given such a graph as input, you are to output the shortest path between any two given vertices. Input is the adjacency matrix and the two vertices. You must output the path.

    標簽: Multiplicative undirected Shortest measured

    上傳時間: 2017-04-08

    上傳用戶:邶刖

  • this is a digital intercom projects using ADC PWM and UART interrupt. you take the value from mic e

    this is a digital intercom projects using ADC PWM and UART interrupt. you take the value from mic enter it to ADC and then send serially to the other microcontroller which receives the data and transform the digital data into analog data by PWM which is connected to speaker

    標簽: interrupt intercom projects digital

    上傳時間: 2017-04-19

    上傳用戶:亞亞娟娟123

  • Each exploration in this book is a mixture of text and interactive exercises. The exercises are unl

    Each exploration in this book is a mixture of text and interactive exercises. The exercises are unlike anything you鈥檝e seen in other books. Instead of multiple choice, fill-in-the-blank, or simple Q&A exercises, lessons are interactive explorations of key C++ features.

    標簽: exercises exploration interactive mixture

    上傳時間: 2017-05-14

    上傳用戶:whenfly

  • Tiny Planet is small device connected to a GSM cell phone. When the mobile receives a predefined SMS

    Tiny Planet is small device connected to a GSM cell phone. When the mobile receives a predefined SMS (text message), like "Activate burglar alarm" or "Start backup pump", the circuit automatically recognizes it as a command, and switches the output port accordingly. Besides switching the port on or off, the user can pulse it for a short period (e.g. 鈥淩eboot remote server鈥?.

    標簽: predefined connected receives Planet

    上傳時間: 2017-05-17

    上傳用戶:fanboynet

  • Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/

    Generate Possion Dis. step1:Generate a random number between [0,1] step2:Let u=F(x)=1-[(1/e)x] step3:Slove x=1/F(u) step4:Repeat Step1~Step3 by using different u,you can get x1,x2,x3,...,xn step5:If the first packet was generated at time [0], than the second packet will be generated at time [0+x1],The third packet will be generated at time [0+x1+x2], and so on …. Random-number generation 1.static method random from class Math -Returns doubles in the range 0.0 <= x < 1.0 2.class Random from package java.util -Can produce pseudorandom boolean, byte, float, double, int, long and Gaussian values -Is seeded with the current time of day to generate different sequences of numbers each time the program executes

    標簽: Generate Possion between random

    上傳時間: 2017-05-25

    上傳用戶:bibirnovis

  • This is a simple algorithm that downloads trading data from yahoo database. It is basically a large

    This is a simple algorithm that downloads trading data from yahoo database. It is basically a large scale application of sqq.m which was originally submitted by Michael Boldin, link at acknowledgements. Some of the functionalities of the package: - User defined ticker list. - Function for downloading most recent SP500 composition in ticker list. - Control for bad data (e.g. a certain percentage of prices missing). - Choice of frequency of data (e.g. weekly prices). - Choice of starting and ending data. - Function for saving the whole data in a pre-formatted excel file together with a full reports on missing data.

    標簽: algorithm downloads basically database

    上傳時間: 2017-06-03

    上傳用戶:啊颯颯大師的

  • Uma modelagem de um cenario basico para quem esta aprendendo a usar open/gl na plataforma C++. Utili

    Uma modelagem de um cenario basico para quem esta aprendendo a usar open/gl na plataforma C++. Utilizando comandos basicos como setas direcionais e teclas especiais como home, end, page up e page down voce pode navegar por todo o ambiente 3D com muita facilidade.

    標簽: aprendendo plataforma modelagem cenario

    上傳時間: 2014-12-19

    上傳用戶:ynwbosss

  • The Hilbert Transform is an important component in communication systems, e.g. for single sideband m

    The Hilbert Transform is an important component in communication systems, e.g. for single sideband modulation/demodulation, amplitude and phase detection, etc. It can be formulated as filtering operation which makes it possible to approximate the Hilbert Transform with a digital filter. Due to the non-causal and infinite impulse response of that filter, it is not that easy to get a good approximation with low hardware resource usage. Therefore, different filters with different complexities have been implemented. The detailed discussion can be found in "Digital Hilbert Transformers or FPGA-based Phase-Locked Loops" (http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=4629940). The design is fully pipelined for maximum throughput.

    標簽: e.g. communication Transform important

    上傳時間: 2017-06-25

    上傳用戶:gxf2016

主站蜘蛛池模板: 都安| 双辽市| 木里| 城步| 扬中市| 遵义市| 敦煌市| 唐河县| 西乌| 漳州市| 西充县| 南澳县| 巴东县| 昌乐县| 都昌县| 永吉县| 克东县| 宣武区| 郓城县| 巴塘县| 富顺县| 邓州市| 慈利县| 瑞丽市| 菏泽市| 黄梅县| 阆中市| 赤城县| 德惠市| 海晏县| 乐至县| 织金县| 牟定县| 邵阳市| 保山市| 新野县| 灵璧县| 高州市| 兰坪| 依安县| 建瓯市|