Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

非线性干涉滤光片开关特性及逻辑功能

应用干涉滤光片作为一种光学双稳器件,演示了光学逻辑开关功能。     

Multicriteria decision making under uncertainty

Formalization for problems of multicriteria decision making under uncertainty is constructed in terms of guaranteed and weak estimates. A relevant definition of the vector maximinimax value is given. Parameterization and approximation of maximum, minimax, and maximinimax values based on the inverse logical convolution are suggested. An application for multicommodity networks is considered. Received: December 13, 2000 / Accepted: August 21, 2001?Published online May 8, 2002     

多进制数字调相系统分析与设计方法的探讨

对数字通信中MPSK系统的调制与解调问题进行了较为的分析，并以8PSK和循环码16PSK系统为例，阐述其调制器电路的逻辑设计方法。在此基础上给出了8PSK系统调制与解调的一种方案，讨论了循环码和自然二进制码16PSK系统的调制器的具体设计过程，该设计方法可应用于一般MPSK系统的逻辑设计。     

浅谈合情推理的教学

论述了合情推理与逻辑推理的关系、在高等数学教学中渗透合情推理的意义 ,并结合教学实践就通过合情推理引入数学理论 ,探求问题结论 ,探索解题方法作了初步探讨     

硅光电负阻器件的构成原理与分类

将三端负阻器件与硅光电探测器相结合 ,通过新的构思成功地提出并构成了一类新型光电器件——硅光电负阻器件。文中报道了该器件构成的一般性原理 ,以及依据此构成原理确定的分类方法     

在UNIX工作站上实现SYBASE数据库的空间扩展

七号信令网管系统的数据库服务器采用惠普UNIX工作站及SYBASE数据库。由于采集的数据量增大，原先设计的数据库空间不能满足数据存储三个月的要求．因此采用一块外置硬盘对数据库空间进行扩展。详细地介绍了SYBASE数据库空间扩展的全过程。     

Managing logical channel configurations in complex satellite architectures

As a result of the increased switching complexity of many communications satellites, often transponders are available with a variety of configuration options offering flexibility in power, bandwidth, and coverage. Many of these configurations share resources that prevent them from being simultaneously active, making it a challenge to understand and manage the satellite capacity inventory. In this paper we define the logical channel configuration (LCC) as an unambiguous unit of the inventory and present a novel method of modelling the interdependencies between these LCCs using linear algebra. In particular, a projector matrix is defined which can be used to update the activation state of all LCCs when the state of one or more of these is changed. As a result, a number of valid LCC scenarios can be easily generated and evaluated for optimal use of the satellite resources. Copyright © 2005 John Wiley & Sons, Ltd.     

Research and Design of Network Management Construction Based on Mobile AGENT

The technical characters of mobile agent （MA） originated in the distributional artificial intelligence domain is introduced. A network management construction based on agent （NMCA） is then proposed. The NMCA structure features are elaborated in detail. A prototype design of NMCA is given by using the jKQML programming. The establishment of NMCA platform will be helpful to reduce the correspondence load of network management and improves the efficiency and the expansion ability of network management systems.     

Level of nodes in increasing trees revisited

Simply generated families of trees are described by the equation T(z) = ϕ(T(z)) for their generating function. If a tree has n nodes, we say that it is increasing if each node has a label ∈ { 1,…,n}, no label occurs twice, and whenever we proceed from the root to a leaf, the labels are increasing. This leads to the concept of simple families of increasing trees. Three such families are especially important: recursive trees, heap ordered trees, and binary increasing trees. They belong to the subclass of very simple families of increasing trees, which can be characterized in 3 different ways. This paper contains results about these families as well as about polynomial families (the function ϕ(u) is just a polynomial). The random variable of interest is the level of the node (labelled) j, in random trees of size n ≥ j. For very simple families, this is independent of n, and the limiting distribution is Gaussian. For polynomial families, we can prove this as well for j,n → ∞ such that n − j is fixed. Additional results are also given. These results follow from the study of certain trivariate generating functions and Hwang's quasi power theorem. They unify and extend earlier results by Devroye, Mahmoud, and others. © 2007 Wiley Periodicals, Inc. Random Struct. Alg., 2007