Study on distributed and dynamic resource management for delay-sensitive sensor network

The delay-aware dynamic resource management problem was investigated in sensor network,with a focus on resource allocation among the sensors and power control along the time.By taking account of average delay requirements and power constraints,the considered problem was formulated into a stochastic optimization problem.Inspired by Lyapunov optimization theory,the intractable stochastic optimization problem was transformed into a tractable deterministic optimization problem,which was a mixed-integer resource management problem.By exploiting the specific problem structure,the mixed-integer resource management problem was equivalently transformed into a single variable problem,and the cooperative distributed method was present to effectively solve it with guaranteed global optimality.Finally,a dynamic resource management algorithm was proposed to solve the original stochastic optimization problem.Simulation results show the performance of the proposed dynamic algorithm and reveal that there exists a fundamental tradeoff between delay requirements and power consumption.     

Analog Computation Using Single-Electron Circuits

Analog computation is a processing method that solves a given problem by utilizing an analogy of a physical system to the problem. An idea is presented here for relating the behavior of single-electron circuits to analog computation. As an instance, a method is proposed for solving a combinatorial problem, the three-colorability problem, by using the properties of single-electron circuits. In problem solving, a single-electron circuit is constructed that is analogous to a given problem; then, through an annealing procedure, the circuit is made to settle down to its minimun energy state. The correct solution to the problem can be obtained by checking the final arrangement of electrons in the circuit. Analog computation is a promising architecture for single-electron computing systems.     

引入D2D通信的蜂窝网上行资源分配算法

该文研究了引入Device-to-Device (D2D)通信的蜂窝网系统中的上行资源分配问题。首先将该问题建模为一个简洁的二值整数规划问题。然而整数规划仍是NP难问题。该文利用Canonical对偶理论,得到其对偶形式。该对偶问题是一个连续域内的凸问题。证明了在特定的条件下,可以通过求解对偶问题得到原问题的最优解,且对偶间隙为零。提出了一个基于Barrier方法的算法来求解对偶问题。仿真结果表明,该文的算法优于现有算法,且性能接近最优。     

Logically rearrangeable multihop lightwave networks

The optimization problem of rearrangeable multihop lightwave networks is considered. The authors formulate the flow and wavelength assignment problem, when minimizing the maximum flow in the network, as a mixed integer optimization problem subject to linear constraints. The problem is decomposed into two independent subproblems, the wavelength assignment (or connectivity problem) and the flow assignment (or routing problem). A simple heuristic provides a meaningful formulation to the connectivity problem, in a form similar to a transportation problem. An algorithm is then proposed which finds a heuristic initial logical connectivity diagram and the corresponding routing, and then iterates from that solution by applying branch-exchange operations to the connectivity diagram. The algorithm was tested on illustrative traffic matrices for an 8 node network with two transmitters and two receivers per node, and an improvement in achievable throughput over the Perfect Shuffle interconnection pattern was shown in all cases     

Continuous-time envelope constrained filter design via orthonormalfilters

The envelope constrained (EC) filtering problem is concerned with designing a filter which minimises the gain to input noise while its response to a given signal fits into a prescribed envelope. This problem had been formulated as a constrained optimisation problem in Hilbert space. By restricting these filters to the span of a finite orthonormal set, the EC filtering problem can be posed as a finite dimensional optimisation problem with a continuum of constraints. The constrained problem is approximated by an unconstrained problem which is then solved by descent direction based algorithms. It is shown that these algorithms converge globally, and one in particular has a quadratic rate of convergence. Numerical examples using the orthonormal Laguerre series approximation are studied     

Maximum-likelihood parameter estimation of discrete homogeneousrandom fields with mixed spectral distributions

This paper presents a maximum-likelihood solution to the general problem of fitting a parametric model to observations from a single realization of a real valued, 2-D, homogeneous random field with mixed spectral distribution. On the basis of a 2-D Wold-like decomposition, the field is represented as a sum of mutually orthogonal components of three types: purely indeterministic, harmonic, and evanescent. The proposed algorithm provides a complete solution to the joint estimation problem of the random field components. By introducing appropriate parameter transformations, the highly nonlinear least-squares problem that results from the maximization of the likelihood function is transformed into a separable least-squares problem. In this new problem, the solution for the unknown spectral supports of the harmonic and evanescent components reduces the problem of solving for the transformed parameters of the field to linear least squares. Solution of the transformation equations provides a complete solution of the field model parameter estimation problem     

基于本体的决策问题语义理解及精炼方法

理解复杂决策问题的关键在于使决策问题所包含的领域、目标、状态、结构等信息被系统所“读懂”.本文利用本体表达语义,实现了问题语义关系表示和语义计算.在保持理解结果不变的原则上,本文提出利用语义迭代方法将计算机无法理解的问题语义转化为可完全理解的语义.本文给出了语义精炼方法并形成最优闭合问题空间,在结构复杂度和内容复杂度两方面具有最低复杂度.实验分析表明,本文提出的复杂决策问题语义理解方法是有效的.     

安全向量优势协议及其应用

百万富翁问题是安全多方计算研究的热点问题之一,也是其他安全多方计算协议的基本构成模块.安全向量优势统计问题是百万富翁问题的推广,用于两方在不泄漏自己保密向量信息的前提下统计出满足大于关系的分量的数目.本文基于同态加密算法,通过对保密的数据进行编码,设计了一个计算百万富翁问题的协议,并利用模拟范例对协议进行安全性证明.然后利用这个新的协议作为基本模块,设计了一个向量优势统计协议,通过效率分析显示我们的方案是简单、高效的.最后将向量优势统计协议应用到整除判定问题和点与若干直线关系判定问题.     

人工神经网络在航迹关联中的应用研究

在分布式多传感器系统中的多节点情况下,航迹关联问题可以转化为多维分配问题。而多维分配问题是典型的组合优化问题,很难找到问题的最优解,而且其计算量随着问题规模的增加易出现指数爆炸现象。该文提出了一种三维神经网络模型,用以解决三节点情况下航迹关联的三维分配问题,并进行了实验仿真。仿真结果表明,三维人工神经劂络模型能够有效地求解此三维分配问题,并且具有较高的航迹关联正确率。另外三维神经网络模型同样可以推广到多维,用以解决航迹关联的多维分配问题。     

基于无线供能反向散射通信系统安全性的稳健机会约束优化算法设计

针对无线供能反向散射通信系统中信道不确定性以及安全性问题,提出一种考虑系统安全性的稳健机会约束优化算法。首先,在考虑窃听数据传输速率约束、最小能量收集约束和设备反射率约束条件下,建立一个基于信道不确定性的最大化系统传输速率最小值的优化问题。为求解该问题,应用基于伯恩斯坦型不等式的安全近似方法,将原不确定性问题转换为确定性优化问题。然后,结合不等式的性质,引入相应的辅助变量,将确定性优化问题转换为凸优化问题,并利用标准的凸优化算法进行求解。最后,仿真结果表明了所提算法的有效性。     

无线传感器网络中新的最小暴露路径问题及其求解算法

无线传感器网络中原始的最小暴露路径问题没有考虑对路径的实际限制条件,提出一种要求经过某一特别保护区域部分边界的最小暴露路径问题。由于无法建立相应的图模型,原有求解最小暴露路径问题的经典方法（网格法和维诺图法）对提出的新问题不再起效。先将该问题转化成带约束条件的优化问题,然后针对转化后的数学模型高度非线性、高维度而不好用确定性优化方法的特点,结合问题实际背景设计出混合人工蜂群求解算法。通过在多种情况下的仿真实验发现,设计的带约束条件优化模型和混合人工蜂群求解算法能有效解决提出的最小暴露路径问题。     

Subhierarchical method for solving problems of diffraction of electromagnetic waves by a dielectric body in a rectangular waveguide

The problem of diffraction of an external electromagnetic field by a locally inhomogeneous body placed in a rectangular waveguide with perfectly conducting walls is considered. The formulated problem is reduced to a volume singular integral equation. The problem is solved with the use of the numerical collocation method. A subhierarchical method is applied to analyze the problem for structures of a complex geometric shape. Because of a large amount of computation, the problem is solved with the use of parallel algorithms realized on a supercomputer complex.     

背包问题——之最优性价比法

背包问题是算法分析中的一个典型的问题,已经得到了各种解决方法。但是一个问题在学术上的研究是无止境的,本文正是基于这样的一种精神,提出了最优性价比法来重新研究和解决这个问题。     

The rate-distortion function for the quadratic Gaussian CEO problem

A new multiterminal source coding problem called the CEO problem was presented and investigated by Berger, Zhang, and Viswanathan. Recently, Viswanathan and Berger have investigated an extension of the CEO problem to Gaussian sources and call it the quadratic Gaussian CEO problem. They considered this problem from a statistical viewpoint, deriving some interesting results. In this paper, we consider the quadratic Gaussian CEO problem from a standpoint of multiterminal rate-distortion theory. We regard the CEO problem as a certain multiterminal remote source coding problem with infinitely many separate encoders whose observations are conditionally independent if the remote source is given. This viewpoint leads us to a complete solution to the problem. We determine the tradeoff between the total amount of rate and squared distortion, deriving an explicit formula of the rate-distortion function. The derived function has the form of a sum of two nonnegative functions. One is a classical rate-distortion function for single Gaussian source and the other is a new rate-distortion function which dominates the performance of the system for a relatively small distortion. It follows immediately from our result that the conjecture of Viswanathan and Berger on the asymptotic behavior of minimum squared distortion for large rates is true     

Cross-layer network planning for multi-radio multi-channel cognitive wireless networks

We propose a general network planning framework for multi-radio multi-channel wireless networks. Under this framework, data routing, resource allocation, and scheduling are jointly designed to maximize a network utility function. We first treat such a cross-layer design problem with fixed radio distributions across the nodes and formulate it as a large-scale convex optimization problem. A primal-dual method together with the column-generation technique is proposed to efficiently solve this problem. We then consider the radio allocation problem, i.e., the optimal placement of radios within the network to maximize the network utility function. This problem is formulated as a large- scale combinatorial optimization problem. We derive the necessary conditions that the optimal solution should satisfy, and then develop a sequential optimization scheme to solve this problem. Simulation studies are carried out to assess the performance of the proposed cross-layer network planning framework. It is seen that the proposed approach can significantly enhance the overall network performance.     

Routing of multipoint connections

The author addresses the problem of routing connections in a large-scale packet-switched network supporting multipoint communications. He gives a formal definition of several versions of the multipoint problem, including both static and dynamic versions. He looks at the Steiner tree problem as an example of the static problem and considers the experimental performance of two approximation algorithms for this problem. A weighted greedy algorithm is considered for a version of the dynamic problem which allows endpoints to come and go during the life of a connection. One of the static algorithms serves as a reference to measure the performance of the proposed weighted greedy algorithm in a series of experiments     

NETCAP: a capacity planning tool for practical content distribution network designs

This paper describes a capacity planning tool NETCAP, which is a prototype software program for automatically planning and integrating application‐specific content‐distribution networks (CDNs). The CDN integration problem consists of two problems: data management system design problem and network topology design problem. The data management system design problem comprises of the server placement and file allocation problems, where the network topology design problem involves determining the network topology with network technology considerations. The CDN integration problem has been formulated as an optimization problem; where the objective function is to optimize a network topology that satisfies both the servers' access requirements and clients' communications. An evolutionary technique is used in NETCAP to search the design space. The experimental results for a CDN integration problem described here demonstrate the effectiveness of NETCAP in finding good CDN designs from a large design space in a few minutes. Copyright © 2006 John Wiley & Sons, Ltd.     

Diverse routing in optical mesh networks

We study the diverse routing problem in optical mesh networks. We use a general framework based on shared risk link groups to model the problem. We prove that the diverse routing problem is indeed NP-complete, a result that has been conjectured by several researchers previously. In fact, we show that even the fiber-span-disjoint paths problem, a special case of the diverse routing problem, is also NP-complete. We then develop an integer linear programming formulation and show through numerical results that it is a very viable method to solve the diverse routing problem for most optical networks found in many applications which typically have no more than a few hundred nodes and fiber spans.     

浅谈基于问题的创新性研究与教学

分析了基于问题的创新性研究和研究性教学的内涵,特别强调了如何提出科学问题的重要性以及应遵循的需求牵引、问题驱动和问题求解的科学研究特征。并且以信息化和网络化环境下多飞行器协同作战为实例,分析了多飞行器网络化协同控制的需求和特点,进而详细论述了如何分析问题和提出问题的详细过程,并说明了不同学科知识交叉和融合应用的重要性,便于领会如何在实际中提出问题并开展基于问题的创新性研究和研究性教学。     

Closed form approximations to the inverse black body radiation problem

The inverse black body radiation problem is the problem of determining the unknown area-temperature distribution of a black body from its radiated electromagnetic power spectrum. An exact iterative solution to this problem (the inverse Planck problem) was derived by this author in 1982. Recently Hamid and Ragheb derived a closed form approximation to this problem claimed to be valid for the Rayleigh-Jeans regime (the inverse Rayleigh-Jeans problems). It is shown that this Hamid-Ragheb solution is actually far superior to an inverse Rayleigh-Jeans approximation. A closed form approximation to the inverse black body radiation problem valid for the Wien regime (the inverse Wien problem) is presented, and shown to be equivalent to the leading term of the exact iterative solution of this author.