Light traffic for workload in queues

General exact light traffic limit theorems are given for the distribution of steadystate workloadV, in open queueing networks having as input a general stationary ergodic marked point process {(t _n ,K _n )n0 (where t_n denotes the arrival time and K_n the routing and service times of the nth customer). No independence assumptions of any kind are required of the input. As the light traffic regime, it is only required that the Palm distribution for the exogenous interarrival time converges weakly to infinity (while the service mechanism is not allowed to change much). As is already known in the context of a single-server queue, work is much easier to deal with mathematically in light traffic than is customer delayD, and consequently, our results are far more general than existing results forD. We obtain analogous results for multi-channel and infinite-channel queues. In the context of open queueing networks, we handle both the total workload in the network as well as the workload at isolated nodes.Research supported in part by the Japan Society for the Promotion of Science during the author's fellowship in Tokyo, and by NSF Grant DDM 895 7825.     

A multineuron interaction model for neural networks

A multineuron interaction model (RS model) with an energy function given by the product of the squared distances in phase space between the state of the net and the stored patterns is studied in detail within a mean-field approach. Two limits are considered: when the patterns and antipatterns are stored (as in the Hopfield model), PAS case, and when only the patterns are taken into account, OPS case. TheT=0 solutions for the proper memories are exactly obtained for all finite values of, as a consequence of the energy function: whenever one of the overlaps is exactly one the corresponding equations decouple and no configuration average is required. Special interest is focused on the OPS situation, which presents a peculiar phase space topology. On the other hand, the PAS configuration recovers the Hopfield model in the appropriate limit, while keeping associative memory abilities far beyond the critical values of other models when the full Hamiltonian is considered.     

Phenomenology of nonlocal cellular automata

Dynamical systems with nonlocal connections have potential applications to economic and biological systems. This paper studies the dynamics of nonlocal cellular automata. In particular, all two-state, three-input nonlocal cellular automata are classified according to the dynamical behavior starting from random initial configurations and random wirings, although it is observed that sometimes a rule can have different dynamical behaviors with different wirings. The nonlocal cellular automata rule space is studied using a mean-field parametrization which is ideal for the situation of random wiring. Nonlocal cellular automata can be considered as computers carrying out computation at the level of each component. Their computational abilities are studied from the point of view of whether they contain many basic logical gates. In particular, I ask the question of whether a three-input cellular automaton rule contains the three fundamental logical gates: two-input rules AND and OR, and one-input rule NOT. A particularly interesting edge-of-chaos nonlocal cellular automaton, the rule 184, is studied in detail. It is a system of coupled selectors or multiplexers. It is also part of the Fredkin's gate—a proposed fundamental gate for conservative computations. This rule exhibits irregular fluctuations of density, large coherent structures, and long transient times.     

Solid-State NMR Study of Phase Separation and Order of Water Molecules and Silanol Groups in Polysiloxane Networks

Homogeneity and structure of organically modified polysiloxane networks prepared by sol-gel co-condensation, as well as location and nature of water molecules and silanol groups were studied by 1D and 2D solid-state NMR. ¹H–²⁹Si and ¹H–¹H interatomic distances were estimated from variable contact-time CP/MAS experiments, ¹H NMR chemical shifts and off-resonance WISE NMR. A structure model of these networks is proposed and discussed. The fraction of proton-inaccessible units Q⁴ in the networks decreases with increasing amounts of dimethylsiloxane (D) and methylsiloxane (T) units. In contrast to systems prepared by co-condensation of tetraethoxysilane (TEOS) with dimethyl(diethoxy)silane (DMDEOS), proton-inaccessible units form essential fraction in networks prepared by co-condensation of TEOS with methyl(triethoxy)silane (MTEOS). The proton-accessible part of the networks with high O/Si ratios is nano-heterogeneous phase, which is composed of water containing Q ⁱ particles separated by copolymer domains. The overall homogeneity and uniformity of binding sites around silanol groups increases by co-condensation TEOS with DMDEOS or MTEOS, while the amount of physisorbed water as well as the hydrogen bond strength decreases, as compared with neat silica gel prepared by polycondensation of TEOS.     

Hierarchical multicast techniques and scalability in mobile Ad Hoc networks

Many potential applications of Mobile Ad Hoc Networks (MANETs) involve group communications among the nodes. Multicasting is an useful operation that facilitates group communications. Efficient and scalable multicast routing in MANETs is a difficult issue. In addition to the conventional multicast routing algorithms, recent protocols have adopted the following new approaches: overlays, backbone-based, and stateless. In this paper, we study these approaches from the protocol state management point of view, and compare their scalability behaviors.To enhance performance and enable scalability, we have proposed a framework for hierarchical multicasting in MANET environments. Two classes of hierarchical multicasting approaches, termed as domain-based and overlay-driven, are proposed. We have considered a variety of approaches that are suitable for different scenarios such as multicast group sizes and number of groups. Results obtained through simulations demonstrate enhanced performance and scalability of the proposed techniques.     

On routing in large WDM networks

An important problem in WDM network design is to construct a logical topology and determine an optimal routing over that topology. Mixed Integer Linear Program (MILP) formulations to generate optimal solutions for this problem have been presented. Such formulations are computationally intractable, even for moderate sized networks. A standard approach is to decouple the problem of logical topology design and the problem of routing the traffic on this logical topology. Heuristics for finding the logical topology exist and a straight-forward linear program (LP), based on the node-arc formulation can be used to solve the routing problem over a given logical topology. We have found that such LP formulations become computationally infeasible for large networks. In this paper, we present a new formulation, based on the arc-chain representation, for optimally routing the specified traffic over a given logical topology to minimize the congestion of the network. We have used the revised simplex method incorporating an implicit column generation technique, and exploited the special Generalized Upper Bounding structure as well as the possibility of eta-factorization for efficiently updating the dual variables and finding the solution. Experimental results on a number of networks demonstrate the suitability of this approach.     

纳入城市规划、规范移动通信基站建设

本文分析了目前移动基站建设存在的主要问题及其产生根源,提出规范移动通信基站建设,将其作为城市公用设施纳入城市规划的观点.并根据国家及政府有关部门的政策法规及国内先行城市的成功经验,结合本市的实际情况,对规范移动通信基站建设的本地立法工作提出了建议.     

一种用于波长路由光网络的分布式快速波长预留协议

波长预留协议用于在光通道建立过程中预留和配置波长.目前已有的波长预留协议都把协议设计的目标定为降低网络阻塞率,没有一种协议设计把目标定为缩短光通道的建立时间和简化协议处理过程.然而更短的建立时间和更小的协议复杂度对于未来极其动态的光网络却是非常重要的.提出了一种新颖的用于波长路由光网络的分布式快速波长预留协议-目的端预留协议,它在保证网络阻塞率可以接受的前提下,不仅可以降低连接建立时间,还可以减少控制节点处理器需要处理的信令消息数量.仿真结果证明了这一点.     

基于双信道的一种ad hoc网络路由策略

利用多个信道接口来改善ad hoc网络信道容量。即一个信道周期性的广播节点状态信息分组来维护全网所有节点的状态信息，而另一个信道利用此信息采用最短路径搜寻算法来获得到目的节点的路由并完成数据传输。这样充分结合了表驱动路由方法和按需式路由方法的优点。另外，信息维护与数据分组分别在两个信道内同时进行，避免了信息维护对数据分组传输的影响，提高了网络性能。     

A Family of Fitness Landscapes Modeled through Gene Regulatory Networks

Fitness landscapes are a powerful metaphor for understanding the evolution of biological systems. These landscapes describe how genotypes are connected to each other through mutation and related through fitness. Empirical studies of fitness landscapes have increasingly revealed conserved topographical features across diverse taxa, e.g., the accessibility of genotypes and “ruggedness”. As a result, theoretical studies are needed to investigate how evolution proceeds on fitness landscapes with such conserved features. Here, we develop and study a model of evolution on fitness landscapes using the lens of Gene Regulatory Networks (GRNs), where the regulatory products are computed from multiple genes and collectively treated as phenotypes. With the assumption that regulation is a binary process, we prove the existence of empirically observed, topographical features such as accessibility and connectivity. We further show that these results hold across arbitrary fitness functions and that a trade-off between accessibility and ruggedness need not exist. Then, using graph theory and a coarse-graining approach, we deduce a mesoscopic structure underlying GRN fitness landscapes where the information necessary to predict a population’s evolutionary trajectory is retained with minimal complexity. Using this coarse-graining, we develop a bottom-up algorithm to construct such mesoscopic backbones, which does not require computing the genotype network and is therefore far more efficient than brute-force approaches. Altogether, this work provides mathematical results of high-dimensional fitness landscapes and a path toward connecting theory to empirical studies.