单片机与微机组成的树型网络远程多机通信

本文简介当前集散控制中的几种常用通信方法，并就此进行分析，然后提出一种实用性强，结构较简单，通信可靠，功能完备，使用十分灵活方便的任意两机间可通信系统     

Tree-shaped flow structures designed by minimizing path lengths

This paper outlines a direct route to the construction of effective tree-shaped flow structures. Dendritic flow structures dominate the design of natural and engineered flow systems, especially in thermal and fluid systems. The starting point is the optimization of the shape of each elemental area or volume, such that the length of the flow path housed by the element is minimized. Proceeding toward larger and more complex structures - from elements, to first constructs, second constructs, etc. - the paper develops tree-shaped flow structures between one point and a straight line, one point and a plane, a circle and its center, and a point and many points distributed uniformly over an area. In the latter, the construction method is applied to a fluid flow configuration with laminar fully developed flow. The constructions reveal several features that are supported by empirical observations of natural tree-shaped flows: asymmetry, flow rate imbalance, pairing or bifurcation, angles between branches, and Y-shaped constructs that lie in a plane. It is shown that these basic features are necessary because of “packing”, i.e., assembling optimized elements into a fixed space, and filling the space completely. For the flow between an area and one point, the best elemental shape is the regular hexagon. It is shown that the emergence of string-shaped links that connect two or more elements are necessary features, which are also required by packing. Strings cover some of the inner zones of the tree network, particularly the inner zones of large and complex trees. Dichotomous Y-shaped constructs dominate the tree structure, especially the peripheral zones of the tree canopy. The practical importance of the simplified design method is discussed.     

光链路设计的Java小程序实现

介绍光链路设计的原理和公式 ,给出光链路设计的Java小程序实现 ,以期有效解决在手工进行光链路设计及计算中存在的问题。     

XML schema, tree logic and sheaves automata

XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we define a new class of automata for unranked trees that provides decision procedures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, including recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.This work was partially supported by the French government research grant ACI TRALALA and by IST Global Computing Profundis.     

A Class of Algorithms for Collision Resolution with Multiplicity Estimation

The wireless connectivity in pervasive computing has ephemeral character and can be used for creating ad hoc networks, sensor networks, connection with RFID (Radio Frequency Identification) tags etc. The communication tasks in such wireless networks often involve an inquiry over a shared channel, which can be invoked for: discovery of neighboring devices in ad hoc networks, counting the number of RFID tags that have a certain property, estimating the mean value contained in a group of sensors etc. Such an inquiry solicits replies from possibly large number of terminals n. This necessitates the usage of algorithms for resolving batch collisions (conflicts) with unknown conflict multiplicity n. In this paper we present a novel approach to the problem of collision resolution for batch conflicts. We show how the conventional tree algorithms for collision resolution can be used to obtain progressively accurate estimation of the multiplicity. We use the estimation to propose a more efficient binary tree algorithm, termed Estimating Binary Tree (EBT) algorithm. The EBT algorithm is suited for implementation when the conflicting nodes are passive, such as e.g. RFID tags. We extend the approach to design the Interval Estimation Conflict Resolution (IECR) algorithm. For n→∞ we prove that the efficiency achieved by IECR for batch arrivals is identical with the efficiency that Gallager’s FCFS algorithm achieves for Poisson packet arrivals. For finite n, the simulation results show that IECR is, to the best of our knowledge, the most efficient batch resolution algorithm reported to date.     

The performance of foliage mass and crown radius models in forming the input of a forest reflectance model: A test on forest growth sample plots and Landsat 7 ETM+ images

Several published foliage mass and crown radius regression models were tested on the preparation of the input for the reflectance model of Kuusk and Nilson [Kuusk, A. and Nilson, T. (2000), A directional multispectral forest reflectance model. Remote Sensing of Environment, 72(2):244–252.] for 246 forest growth sample plots in Estonia. In each test, foliage mass and crown radius for trees in the sample plots were predicted with a particular pair of allometric regression models. The forest reflectance model was then run using the estimated foliage mass and crown radius values. Reflectance factors were simulated and compared with the reflectance values obtained from three atmospherically corrected Landsat 7 Enhanced Thematic Mapper (ETM+) scenes. The statistics of linear regression between the simulated and measured reflectance factors were used to assess the performance of foliage and crown radius models. The hypothesis was that the best allometric regression models should provide the best fit in reflectance. The strongest correlation between the simulated and measured reflectance factors was found in the short-wave infrared band (ETM + 5) for all the images. The highest R² = 0.71 was observed in Picea abies dominated stands. No excellent combination of foliage mass and crown radius functions was found, but the ranking based on determination coefficients showed that some linear crown radius models are not applicable to our data. Processing of raster images, reflectance measurement for small sample plots, usage of tree-species-specific fixed parameters (specific leaf area, etc.), and the ignored influence of phenology introduced additional variation into the relationships between simulated and measured reflectance factors. Further studies are needed, but these preliminary results demonstrate that the proposed method could serve as an effective way of testing the performance of foliage mass and canopy cover regressions.     

Using airborne laser scanning to monitor tree migration in the boreal-alpine transition zone

The boreal tree line is expected to advance upwards into the mountains and northwards into the tundra due to global warming. The major objective of this study was to find out if it is possible to use high-resolution airborne laser scanner data to detect very small trees — the pioneers that are pushing the tree line up into the mountains and out onto the tundra. The study was conducted in a sub-alpine/alpine environment in southeast Norway. A total of 342 small trees of Norway spruce, Scots pine, and downy birch with tree heights ranging from 0.11 to 5.20 m were precisely georeferenced and measured in field. Laser data were collected with a pulse density of 7.7 m^− 2. Three different terrain models were used to process the airborne laser point cloud in order to assess the effects of different pre-processing parameters on small tree detection. Greater than 91% of all trees > 1 m tall registered positive laser height values regardless of terrain model. For smaller trees (< 1 m), positive height values were found in 5-73% of the cases, depending on the terrain model considered. For this group of trees, the highest rate of trees with positive height values was found for spruce. The more smoothed the terrain model was, the larger the portion of the trees that had positive laser height values. The accuracy of tree height derived from the laser data indicated a systematic underestimation of true tree height by 0.40 to 1.01 m. The standard deviation for the differences between laser-derived and field-measured tree heights was 0.11-0.73 m. Commission errors, i.e., the detection of terrain objects — rocks, hummocks — as trees, increased significantly as terrain smoothing increased. Thus, if no classification of objects into classes like small trees and terrain objects is possible, many non-tree objects with a positive height value cannot be separated from those actually being trees. In a monitoring context, i.e., repeated measurements over time, we argue that most other objects like terrain structures, rocks, and hummocks will remain stable over time while the trees will change as they grow and new trees are established. Thus, this study indicates that, given a high laser pulse density and a certain density of newly established trees, it would be possible to detect a sufficient portion of newly established trees over a 10 years period to claim that tree migration is taking place.     

数据挖掘在现代作战中的应用研究

随着装备技术的发展,现代作战具有作战单元种类数量多、攻防战术复杂、干扰性欺骗性数据充斥等特点,尤其是协同作战能力和数据交换能力逐步增强,以上都使得现代作战中涉及的信息呈现＂海量＂特征。为了取得理想的作战效果,指挥员必须对以上海量信息进行处理,从中提取出有用的信息和知识。近年来迅速发展的数据挖掘技术,在处理海量信息方面具有非常明显的优势。文章在介绍现代作战特点和数据挖掘技术的基础上,对数据挖掘技术在现代作战中的应用做了初步的研究。     

基于决策树的数据挖掘算法优化研究

决策树模型是数据挖掘中最常用的一种方法,具有较好的分类预测能力,并能方便提取决策规则。基于相似性原理,以测试属性和决策属性的相似度作为启发规则构建决策树。提出了一种新的决策树生成算法。并在高校教师综合考评系统中采用了这种新算法,实验结果表明这种新的决策树生成算法预测精度较高,计算也比较简便。     

An efficient algorithm for maxdominance, with applications

Given a planar setS ofn points,maxdominance problems consist of computing, for everyp S, some function of the maxima of the subset ofS that is dominated byp. A number of geometric and graph-theoretic problems can be formulated as maxdominance problems, including the problem of computing a minimum independent dominating set in a permutation graph, the related problem of finding the shortest maximal increasing subsequence, the problem of enumerating restricted empty rectangles, and the related problem of computing the largest empty rectangle. We give an algorithm for optimally solving a class of maxdominance problems. A straightforward application of our algorithm yields improved time bounds for the above-mentioned problems. The techniques used in the algorithm are of independent interest, and include a linear-time tree computation that is likely to arise in other contexts.The research of this author was supported by the Office of Naval Research under Grants N00014-84-K-0502 and N00014-86-K-0689, and the National Science Foundation under Grant DCR-8451393, with matching funds from AT&T.This author's research was supported by the National Science Foundation under Grant DCR-8506361.