EV-DO Rev.A在日本风头渐旺将盖过HSDPA

2006年8月31日,NTT DoCoMo开始在日本东京的中心地带提供HSDPA服务,NEC为该服务提供了惟一的一款终端,支持最高可达3.6Mbit/s的数据下载,这一速度10倍于以前FOMA手机可支持的速度。NTT DoCoMo的用户使用HSDPA服务,不需要支付额外的费用。这一举措使原本已经非常激烈的日本三大移动运营商之间的竞争又步入了一个新阶段。KDDI对此做出回应,宣布将在今年12月份推出世界上第一个商用的EV-DO Rev.A服务,KDDI目前已经推出了两款支持该服务的终端。K DDI过去所取得的成功在很大程度上归功于其采用了CDMA,这使得KDDI有效地将…     

智能功率控制产品的设计

构建和维护合适的功率环境对系统的正确运行非常关键。对功率的控制和管理越来越受到重视，无论是简单的手持式便携设备，还是多服务器机架系统，都希望能够节省能耗、降低成本。     

能消除RGB差分视频传输线上共模噪声的放大器

5类网络电缆由四对双绞线组成,并有耐用的外套,这种电缆能为分量视频信号的传输提供一种通用而有良好性价比的选择。三个线对可以承载RGB视频信号,而第四对线可以承载音频信号、同步信号和其它传输信号。不幸的是,5类电缆缺乏屏蔽,因此容易遭受共模噪声耦合     

Peeling phylogenetic ‘oranges’

We investigate the combinatorics of a topological space that is generated by the set of edge-weighted finite trees. This space arises by multiplying the weights of edges on paths in trees and is closely connected to tree reconstruction problems involving finite state Markov processes. We show that this space is a contractible finite CW-complex whose face poset can be described via a partial order on semilabelled forests. We then describe some combinatorial properties of this poset, showing that, for example, it is pure, thin and contractible.     

On the Curvature of the Central Path of Linear Programming Theory

We prove a linear bound on the average total curvature of the central path of linear programming theory in terms of the number of independent variables of the primal problem, and independent of the number of constraints.     

Flips and the Hilbert scheme over an exterior algebra

We study the tangent space at a monomial point M in the Hilbert scheme that parameterizes all ideals with the same Hilbert function as M over an exterior algebra.     

Fire containment in grids of dimension three and higher

We consider a deterministic discrete-time model of fire spread introduced by Hartnell [Firefighter! an application of domination, Presentation, in: 20th Conference on Numerical Mathematics and Computing, University of Manitoba in Winnipeg, Canada, September 1995] and the problem of minimizing the number of burnt vertices when a fixed number of vertices can be defended by firefighters per time step. While only two firefighters per time step are needed in the two-dimensional lattice to contain any outbreak, we prove a conjecture of Wang and Moeller [Fire control on graphs, J. Combin. Math. Combin. Comput. 41 (2002) 19-34] that 2d-1 firefighters per time step are needed to contain a fire outbreak starting at a single vertex in the d-dimensional square lattice for d?3; we also prove that in the d-dimensional lattice, d?3, for each positive integer f there is some outbreak of fire such that f firefighters per time step are insufficient to contain the outbreak. We prove another conjecture of Wang and Moeller that the proportion of elements in the three-dimensional grid P_n×P_n×P_n which can be saved with one firefighter per time step when an outbreak starts at one vertex goes to 0 as n gets large. Finally, we use integer programming to prove results about the minimum number of time steps needed and minimum number of burnt vertices when containing a fire outbreak in the two-dimensional square lattice with two firefighters per time step.