control features extraction and classifier algorithms

... logic unit and processor registers, a control unit containing an instruction register and program counter, a memory to store both data and instructions, external mass storage, and input and output ... Yang, and Meihui Zhang Throughout the long period of PhD study, we discuss and debate about research problems, work together and collaborate in the projects, encourage and care for each other, and ... input event handles, modify data structure, database traversal, primitive generation and utility functions The command stage feeds commands to the graphics subsystem In this stage, commands are buffered...

Ngày tải lên: 10/09/2015, 09:06

Ngày tải lên: 19/10/2014, 00:42

... được IETF đưa RFC 2328 Cisco đã thực thi cách tính cost của riêng mình sau: 108/bandwidth với giá trị bandwidth được cấu hình cho mỗi interface Ứng dụng thuật toán Dijkstra Shortest...

Ngày tải lên: 25/10/2013, 03:20

... 才能共享路由信息.把大型网络分成不同的 AS,可以有效的加快汇 聚.EIGRP 的 AD 为 90,而外部 EIGRP(external EIGRP)的 AD 为 170 VLSM Support and Summarization 之前说过 EIGRP 支持 VLSM,也支持不连续子网.什么是不连续子网?,如下图: 如图可以看到,2 个子网 172.16.10.0/24 和 172.16.20.0/24 ... 支持在任何运行 EIGRP 的 router 上 summary 的手动创建,这样可以减少路由表的体 积.EIGRP 自动把网络 summarize 到等级边界,如下图: Route Discovery and Maintenance 类似一些链路状态的协议,EIGRP 通过 Hello 信息来发现邻居;而它又和距离向量类似,使用传 闻路由的机制,即不主动去发现,而是听从别人的信息.EIGRP ... ip ospf neighbor:显示邻居的信息,如果 DR 和 BDR 存在的话,它们的信息也会被显示出 来 show ip protocols:显示配置了的所有路由协议的相关信息 OSPF and Loopback Interfaces 在配置 OSPF 路由协议的时候配置回环(loopback)接口是很重要的 件事.Cisco 建议你配置 OSPF 的时候顺便配置回环接口.所谓回环接口,是逻辑接口而非物理接口,即不是你触摸的到...

Ngày tải lên: 21/12/2013, 05:17

... đường Cách tính cost IETF đưa RFC 2328 Cisco thực thi cách tính cost riêng sau: 108/bandwidth với giá trị bandwidth cấu hình cho interface OSPF với Multi-Area Như ta biết kích thước mạng lớn số...

Ngày tải lên: 22/12/2013, 16:15

... nodes 22 and 23 fails, node 23 will belong to class D and the others to class A because of the fuse 2.4.2 Identifying the controlling disconnect/ sectionalising switches: Identifying the controlling ... Path4_1,Path4-s, Patha-13, Parh4-2o and Patha-2r are those connected to node on line between nodes and 4, to node on the line between nodes and 6, to nodes 12 on the line between nodes I and 12, to nodes ~~ ... A, and B to the source are PathA and Paths, respectively Let Patha = {A,Ai,A2, ,Ap-l,Ap, .A,+,, c} (2) Paths = { B : B I , B,, ,Bq-i,AP, .A,+,, C } (3) where parameter m is a integer and...

Ngày tải lên: 03/01/2014, 19:39

... Wang and J Crowcroft, Quality-of-Service Routing for Supporting Multimedia Applications,.IEEE JSAC,14(7):1288-1234, September 1996 [2] R.Guerin, D.Williams, and A.Orda, QoS Routing Mechanisms and ... [3] K.S Narendra and M.A.L Thathachar, On the Behavior of a Learning Automaton in a Changing Environment with Application to Telephone Traffic Routing, IEEE Trans on Systems, Man and Cybernetics, ... Systems, Man and Cybernetics, vol SMC-10, no.5, pp 262-269, May 1980 [4] K.S Narendra and P Mars, The Use of Learning Algorithms in Telephone Traffic Routing - A Methodology, Automatica, vol 19, no...

Ngày tải lên: 22/01/2014, 19:20

Ngày tải lên: 23/04/2014, 20:23

... DAM and PRG analyzed and interpreted the data; PRG designed and oversaw the study, and wrote the manuscript All authors read and approved the manuscript Acknowledgements We thank J Sodroski and ... D36E and D36L viruses were dual tropic and used CCR5 and CXCR4 for virus entry (Fig 2B) C98E, C98L, C18E and C18L viruses used CCR5 only for virus entry Replication of dual tropic D36E and D36L ... of HIV-1 isolates in Cf2Luc cells (Fig 2) The R5 ADA and R5X4 89.6 strains were included as positive controls and used CCR5 or both CCR5 and CXCR4 for virus entry, respectively (Fig 2A), as expected...

Ngày tải lên: 18/06/2014, 18:20

... initial demands, X(0) In Figure 2, we give an example of such a graph for a network of two transmitter and two receiver pairs We assume that the initial demands are d1 = bits and d2 = bits and that ... Figure A DAG construction corresponding to initial demands d1 = bits and d2 = bits and three rate control actions r1 = [3,0], r2 = [0,3], and r3 = [2,2] in the path has to be component-wise larger ... the scheduling and rate control decisions that the policy employs, and then obtain an optimal solution for this reduced problem As is commonly done, to understand the essential features of a difficult...

Ngày tải lên: 20/06/2014, 22:20

... temperature The shape and size tunability of SnS NCs can be achieved by controlling the reaction temperature and time, and the nature of stabilizing ligands HRTEM investigation and XRD analysis showed ... EgÞn=2 hv ð1Þ In Eq 1, k and n are constants and Eg is the band gap energy of the bulk semiconductor The n value is for indirect-gap materials Values of the optical band gap for the samples were ... presence of oleic acid in the reaction mixture serves as a ligand and also plays a vital role in the formation of nanoscale tin sulfide by controlling the reactivity of precursors [26, 27] XRD analysis...

Ngày tải lên: 22/06/2014, 22:20

... temperature The shape and size tunability of SnS NCs can be achieved by controlling the reaction temperature and time, and the nature of stabilizing ligands HRTEM investigation and XRD analysis showed ... EgÞn=2 hv ð1Þ In Eq 1, k and n are constants and Eg is the band gap energy of the bulk semiconductor The n value is for indirect-gap materials Values of the optical band gap for the samples were ... presence of oleic acid in the reaction mixture serves as a ligand and also plays a vital role in the formation of nanoscale tin sulfide by controlling the reactivity of precursors [26, 27] XRD analysis...

Ngày tải lên: 22/06/2014, 22:20

... Widest Shortest Path [2] R.Guerin, D.Williams, and A.Orda, QoS Routing Mechanisms and OSPF Extensions, In Proceedings of Globecom, 1997 [3] K.S Narendra and M.A.L Thathachar, On the Behavior of a ... Traffic Routing, IEEE Trans on Systems, Man and Cybernetics, vol SMC-10, no.5, pp 262-269, May 1980 [4] K.S Narendra and P Mars, The Use of Learning Algorithms in Telephone Traffic Routing - A ... thc t ú vo ng dng ca chỳng ta s em li mt sc sng mi cho cỏc ng dng ú Ti liu tham kho [1 ] Z Wang and J Crowcroft, Quality-of-Service Routing for Supporting Multimedia Applications,.IEEE JSAC,14(7):1288-1234,...

Ngày tải lên: 22/08/2014, 16:37

Ngày tải lên: 14/12/2021, 19:51

... tuyếứn đứờờng tộứt nhậứt - Vì gói tin update đứờịc gứải theo điịnh kỳ nến mộịt lứờịng bắng thộng (bandwidth) đáng kếả seễ biị chiếứm (mắịc dù maịng khộng thay độải nhiếờu) - Do router hộịi tuị chậịm ... DR& BDR  Choịn DR & BDR đếả giaải quyếứt vậứn đếờ LSA biị gứải tràn lan maịng aảnhhứờảng đếứn bandwidth  Trong mội trứờờng đa truy cậịp, OSPF seễ choịn router đứờịc chiả điịnh(Designated Router)...

Ngày tải lên: 31/10/2014, 11:51

... freedom available to the UAV i.e x, y and z axis translation and roll, pitch and yaw, only are needed by the UAV i.e x, y and z axis translation and roll Pitch and yaw now depend on the degrees of ... position and orientation ( xk 1, yk 1, hk 1, variables, with s jk and k )2 )] T j (1 k rturn k k xk )/V ) cos-1 ( rturn sin k and dturn ), as control being defined in terms of both the state and control ... communication devices to send and receive information to and from a command post or other aircraft, and most importantly a Flight Path Planner that decides where to fly to, and uses the FCS to fly...

Ngày tải lên: 02/11/2014, 00:45

... diện xác nhận có Router ID Router OSPF khác liên kết Sau OSPF thiết lập hàng xóm gần kề OSPF Hello and Dead Intervals Trước router hình thành OSPF neighbor adjacency, chúng phải thỏa giá trị: Hello ... thông qua vùng area Một vùng mà không cho phép lượng truyền qua gọi regular are có dạng như: standard are, stub are, totally stubby are, not-so stubby area(NSSA) 2.1 Stub Area: Group – CD10CNTT3 ... external type 2, E - EGP i - IS-IS, L1 - IS-IS level-1, L2 - IS-IS level-2, ia - IS-IS inter area * - candidate default, U - per-user static route, o - ODR P - periodic downloaded static route Gateway...

Ngày tải lên: 18/03/2015, 17:55

... 2011 * * Applet for explaining graph algorithms * It currently only explains Dijkstra's shortest path algorithm, * but it can easily be extended to handle more algorithms * * Copyright 2011, Nhanntv, ... mouse in a node,"+ "and drag it to another node.\n\n"); final String weight = new String("CHANGING WEIGHTS:\n"+ "To change the weight of an arrow, click on the arrowhead and drag\n"+ "it along ... Routing weight[p1][p2]=w; // direction line between p1 and p2 dx = node[p2].x-node[p1].x; dy = node[p2].y-node[p1].y; // distance between p1 and p2 l = (float)( Math.sqrt((float)(dx*dx + dy*dy)));...

Ngày tải lên: 18/03/2015, 17:56

... trù mật O(V4) III Ưu điểm thuật toán trình bày Các đường ngắn phép nhân ma trận (Shortest paths and matrix multiplication) Phần trình bày thuật toán quy hoạch động cho toán đường ngắn cặp đồ thị...

Ngày tải lên: 11/04/2015, 22:45