A new GRASS GIS fuzzy inference system for massive data analysis

GIS systems are frequently coupled with fuzzy logic systems implemented in statistical packages. For large GIS data sets including millions or tens of millions of cells, such an approach is relatively time-consuming. For very large data sets there is also an input/output bottleneck between the GIS and external software. The aim of this paper is to present low-level implementation of Mamdani’s fuzzy inference system designed to work with massive GIS data sets, using the GRASS GIS raster data processing engine.     

An automated,objective and open source tool for stream threshold selection and upstream riparian corridor delineation

The extraction of stream networks from digital elevation models (DEMs) and delineation of upstream riparian corridors (URCs) for stream sampling points (SSPs) are frequently used techniques in freshwater and environmental research. Selection of an accumulation threshold (AT) for stream extraction and delineation of URCs are often done manually. Two algorithms are introduced in this paper that allow for automated AT selection and URC delineation. ATs are selected to yield the highest overlap of DEM-derived and traditionally mapped streams as well as to assure extraction of all mapped streams from DEMs. URCs are delineated after snapping SSPs to DEM-derived streams. The new tool showed similar or better performance than comparable algorithms and is freely available, interfacing the open source software packages R and GRASS GIS. It will improve the extraction of stream networks and the assessment of magnitude and scale of effects from riparian stressors (e.g. landuse) on freshwater ecosystems.     

基于GIS平台的R树索引模型研究与实现

本文阐述了一种GIS平台-GRASS平台的基本结构和特点,分析了GRASS矢量图的文件结构及空间索引的几种基本算法,阐明了建立R树索引机制的一些基本思路和方法,提出了在GRASS平台上建立R树索引模型的实现策略。     

透射率全局估计航空影像去雾算法

针对雾霾天气会导致航空影像的色彩失真、信息损失，对影像的后期处理和判读造成了负面影响，以暗原色先验为理论基础，结合航空影像的成像特点和景物内容特点提出一种针对航空影像的去雾算法。首先，获取航空影像透射率图并对其自动分割；其次，对影像透射率全局估计和局部优化；最后，根据大气物理模型对影像恢复处理。选取了山区、村镇、城市等各种场景近20组航空影像进行试验，从主观和客观两方面对算法效果进行评价，结果表明该算法具有处理效果稳定、鲁棒性强的特点。     

Dynamic demultiplexing in network calculus—Theory and application

During the last two decades, starting with the seminal work by Cruz, network calculus has evolved as a new theory for the performance analysis of networked systems. In contrast to classical queueing theory, it deals with performance bounds instead of average values and thus has been the theoretical basis of quality of service proposals such as the IETF’s Integrated and Differentiated Services architectures. Besides these it has, however, recently seen many other application scenarios as, for example, wireless sensor networks, switched Ethernets, avionic networks, Systems-on-Chip, or even to speed-up simulations, to name a few.In this article, we extend network calculus by adding a new versatile modeling element: a demultiplexer. Conventionally, demultiplexing has been either neglected or assumed to be static, i.e., fixed at the setup time of a network. This is restrictive for many potential applications of network calculus. For example, a load balancing based on current link loads in a network could not be modeled with conventional network calculus means. Our demultiplexing element is based on stochastic scaling. Stochastic scaling allows one to put probabilistic bounds on how a flow is split inside the network. Fundamental results on network calculus with stochastic scaling are therefore derived in this work. We illustrate the benefits of the demultiplexer in a sample application of uncertain load balancing.     

Energy-efficient distributed clustering in wireless sensor networks

The deployment of wireless sensor networks in many application areas requires self-organization of the network nodes into clusters. Clustering is a network management technique, since it creates a hierarchical structure over a flat network. Quite a lot of node clustering techniques have appeared in the literature, and roughly fall into two families: those based on the construction of a dominating set and those which are based solely on energy considerations. The former family suffers from the fact that only a small subset of the network nodes are responsible for relaying the messages, and thus cause rapid consumption of the energy of these nodes. The latter family uses the residual energy of each node in order to decide about whether it will elect itself as a leader of a cluster or not. This family’s methods ignore topological features of the nodes and are used in combination with the methods of the former family. We propose an energy-efficient distributed clustering protocol for wireless sensor networks, based on a metric for characterizing the significance of a node, w.r.t. its contribution in relaying messages. The protocol achieves small communication complexity and linear computation complexity. Experimental results attest that the protocol improves network longevity.     

Algebraic connectivity metric for spare capacity allocation problem in survivable networks

For studying survivability of telecommunication networks, one should be able to differentiate topologies of networks by means of a robust numerical measure that can characterize the degree of immunity of a given network to possible failures of its elements. An ideal metric should be also sensitive to such topological features as the existence of nodes or links whose failures are catastrophic in that they lead to disintegration of a given network structure. In this paper, we show that the algebraic connectivity, adopted from spectral graph theory, namely the second smallest eigenvalue of the Laplacian matrix of the network topology, is a numerical index that characterizes a network’s survivability better than the average node degree that has been traditionally used for this purpose. This proposition is validated by extensive studies involving solutions of the spare capacity allocation problem for a variety of networks.     

Stability analysis and decentralized control of a class of complex dynamical networks

In this paper, stability analysis and decentralized control problems are addressed for linear and sector-nonlinear complex dynamical networks. Necessary and sufficient conditions for stability and stabilizability under a special decentralized control strategy are given for linear networks. Especially, two types of linear regular networks, star-shaped networks and globally coupled networks, are studied in detail. A dynamical network is viewed as a large-scale system composing of some subsystems, based on which the relationship between the stability of a network and the stability of its corresponding subsystems is investigated. It is pointed out that some subsystems must be unstable for the whole network to be stable in some special cases. Moreover, a controller design method based on a parameter-dependent Lyapunov function is provided. Furthermore, interconnected Lur’e systems and symmetrical networks of Lur’e systems are similarly studied. The test of absolute stability of a network of Lur’e systems is separated into the test of absolute stability of several independent Lur’e systems. Finally, several numerical examples are given to illustrate the theoretical results.     

组合网--第三代网络之上的一个台阶

由于当今技术的发展 ,形形色色基于数据通信的服务也相应而出。例如 ,基于多媒体的远程教育或影视节目、可视电话以及基于网络的交互式电子游戏。然而目前所有的无线网络都是针对某种特定的服务而设计及优化的 ,各个无线网络有着不同的特性。例如 ,不同的无线网支持的带宽不同 ,对应用软件提供的服务质量不同 ,对终端移动性支持的程度不同 ,以及为传输每比特所花费的代价不同。每一个无线网可有效地支持一种或几种数据服务。然而 ,没有一个无线网络可有效地支持所有基于数据通信的服务。不仅如此 ,在欧洲、美洲及亚洲即将推出的第三代无线网络也不能满足所有数据通信的要求。因此 ,如今科技发展的方向是 :将各种用于不同服务的无线网络融合成一体来支持形形色色的数据服务[1～ 3 ] 。将阐述组合网的概念 ,描述组合网的结构 ,并且提出一个基于第三代无线网络之上的组合网。     

Ecosystems as evolutionary complex systems: Network analysis of fitness models

Understanding and managing ecosystems as biocomplex wholes is the compelling scientific challenge of our times. Several different system-theoretic approaches have been proposed to study biocomplexity and two in particular, Kauffman's NK networks and Patten's ecological network analysis, have shown promising results. This research investigates the similarities between these two approaches, which to date have developed separately and independently. Kauffman (1993) has demonstrated that networks of non-equilibrium, open thermodynamic systems can exhibit profound order (subcritical complexity) or profound chaos (fundamental complexity). He uses Boolean NK networks to describe system behavior, where N is the number of nodes in the network and K the number of connections at each node. Ecological network analysis uses a different Boolean network approach in that the pair-wise node interactions in an ecosystem food web are scaled by the throughflow (or storage) to determine the probability of flow along each pathway in the web. These flow probabilities are used to determine system-wide properties of ecosystems such as cycling index, indirect-to-direct effects ratio, and synergism. Here we modify the NK model slightly to develop a fitness landscape of interacting species and calculate how the network analysis properties change as the model's species coevolve. We find that, of the parameters considered, network synergism increases modestly during the simulation whereas the other properties generally decrease. Furthermore, we calculate several ecosystem level goal functions and compare their progression during increasing fitness and determine that at least at this stage there is not a good correspondence between the reductionistic and holistic drivers for the system. This research is largely a proof of concept test and will lay the foundation for future integration and model scenario analysis between two important network techniques.     

Leveraging personal photos to inferring friendships in social network services

Social network services have become widely used as an important tool to share rich information; in such networks, making new friends is the most basic functionality to enable users to take advantage of their social networks. In this paper we look into personal photos as an additional source for social network analysis and analyze the potential of people tags in the photos for friend recommendations. We also propose a new compact data structure, collectively called Face Co-Occurrence Networks (FCON), which stores crucial and quantitative information about people’s appearance in photos. We discover strong associative relationships among people and recommend reliable social friends by utilizing FCON. Experimental results demonstrate the effectiveness and efficiency of our method for recommending friends in social network services.     

Performance improvement for applying network virtualization in fiber-wireless （FiWi） access networks

Fiber-wireless （FiWi） access networks, which are a combination of fiber networks and wireless networks, have the advantages of both networks, such as high bandwidth, high security, low cost, and flexible access. However, with the increasing need for bandwidth and types of service from users~ FiWi networks are still relatively incapable and ossified. To alleviate bandwidth tension and facilitate new service deployment, we attempt to apply network virtualization in FiWi networks, in which the network＇s control plane and data plane are separated from each other. Based on a previously proposed hierarchical model and service model for FiWi network virtualization, the process of service implementation is described. The performances of the FiWi access networks applying network virtualization are analyzed in detail, including bandwidth for links, throughput for nodes, and multipath flow transmission. Simulation results show that the FiWi network with virtualization is superior to that without.     

Radio resource management in emerging heterogeneous wireless networks

Deployment of heterogeneous wireless networks is spreading throughout the world as users want to be connected anytime, anywhere, and anyhow. Meanwhile, these users are increasingly interested in multimedia applications such as video streaming and Voice over IP (VoIP), which require strict Quality of Service (QoS) support. Provisioning network resources with such constraints is a challenging task. In fact, considering the availability of various access technologies (WiFi, WiMAX, or cellular networks), it is difficult for a network operator to find reliable criteria to select the best network that ensures user satisfaction while maximizing network utilization. Designing an efficient Radio Resource Management (RRM), in this type of environment, is mandatory for solving such problems. In order to provide a better understanding of RRM’s design, this paper presents a detailed investigation of key challenges that constitute an efficient RRM framework. More importantly, an overview with a classification of recent solutions, in terms of decision making, is provided along with the discussion.     

A multi-path mechanism for reliable VoIP transmission over wireless networks

With the advances in audio encoding standards and wireless access networks, voice over IP (VoIP) is becoming quite popular. However, real-time voice data over lossy networks (such as WLAN and UMTS), still posses several challenging problems because of the adverse effects caused by complex network dynamics. One approach to provide QoS for VoIP applications over the wireless networks is to use multiple paths to deliver VoIP data destined for a particular receiver. This paper introduced cmpSCTP, a transport layer solution for concurrent multi-path transfer that modifies the standard stream control transmission protocol (SCTP). The cmpSCTP aims at exploiting SCTP’s multi-homing capability by selecting several best paths among multiple available network interfaces to improve data transfer rate to the same multi-homed device. Through the use of path monitoring and packet allotment techniques, cmpSCTP tries to transmit an amount of packets corresponding to the path’s ability. At the same time, cmpSCTP updates the transmission strategy based on the real-time information of all of paths. Using cmpSCTP’s flexible path management capability, we may switch the flow between multiple paths automatically to realize seamless path handover. The theoretical analysis evaluated the model of cmpSCTP and formulated optimal traffic fragmentation of VoIP data. Extensive simulations under different scenarios using OPNET verified that cmpSCTP can effectively enhance VoIP transmission efficiency and highlighted the superiority of cmpSCTP against the other SCTP’s extension implementations under performance indexes such as throughput, handover latency, packet delay, and packet loss.     

A network flow based approach for network selection in dynamic spectrum access networks

In this paper, we present a network flow based approach for dynamic network and channel selection for secondary users in dynamic spectrum access networks. Most approaches in the current literature on dynamic spectrum access networks do not consider dynamic network and channel selection. We present a network flow framework for network selection. We show that our approach can enable re-assignment of networks to secondary users and also re-assignment of channels to secondary users within the same network. The assignments and re-assignments take into account, the interference caused to primary users, the price each secondary user is willing to pay and the quality of service (QoS) obtained by each secondary user. We obtain a bound for the maximum number of re-assignments.     

一种基于GIS的网络层次化地图模型及实现算法

大型计算机网络地域分布广,网元数目众多,传统网络管理系统以网络拓扑这种虚拟空间的方式实现网络的监控管理,没有充分利用网元的地理位置信息,网络监控和管理存在不便之处.地理信息系统(GIS)的应用能够赋予网络监控管理系统清晰直观、易于监控和管理的特性.通过建立一种基于GIS的网络层次化地图模型,系统解决了网络拓扑与GIS地图有效结合这一问题,实现了在GIS地图中网络拓扑与运行状态信息的层次化管理,给出了网络GIS地图的生成、维护的非递归算法.模型和算法的有效性和完备性在大型网络性能监测与分析系统NIPMAS中得到了实际验证.     

恶劣气象条件下高速公路NN控制系统的研究

各种恶劣气象条件下的高速公路的交通流控制是目前急需要解决的重要问题。就此问题,利用Markos Papageorgiou的高速公路交通流模型对各种气象条件进行分析,使用神经网络方法,建立了一套适合各种气象条件的交通流模型和匝道入口控制系统,有效地控制恶劣气象条件下的高速公路交通事故。其次,利用BP神经网络的算法进行了仿真,对其中的参数进行辩识。仿真的结果与实际情况能很好地吻合,为在恶劣气象条件下控制高速公路的交通流奠定了理论和实践基础。     

Recall and Reasoning—an information theoretical model of cognitive processes

Cognitive Psychology studies humans’ capabilities to memorize and recall knowledge and images, among others. Connectionistic, propositional and conceptual models are a means to survey these phenomenons. This paper proposes an information theoretical network for simulating stimulus and response in categorical structures. A stimulus triggers an information flow throughout the whole network and generates for all ideas representing vertices an impact in the information theoretical unit [bit], thus measuring the recall intensity and producing a response. The method is shown to yield results of high performance even for complex taxonomies and connectionistic models. Reasoning is the logical counterpart of recall. Once an idea is associated with a stimulus, logical dependencies between both must be established, if required. Information theoretical networks allow to switch between a recall mode and a reasoning mode, also permitting logical reasoning within the same framework. Both capabilities are demonstrated by suitable examples.     

基于最短路径查询的城市公交网络拓扑建模研究

最短路径分析是地理信息系统（GIS）中网络分析的一项重要功能，等价于图论中的节点间求解最短路径问题。对地理网络进行地理分析和建模，以实现最短路径搜索已经有大量论文讨论。但是专门针对城市公交网络的建模和路径寻优，则少鲜有研究，而且已有的一些网络模型也不能直接应用到公交网络寻优中，本文应用图论理论，讨论公共交通网络的拓扑建模，实现公交网络最优路径的查询。     

A GPS/GIS method for travel mode detection in New York City

Handheld GPS provides a new technology to trace people’s daily travels and has been increasingly used for household travel surveys in major cities worldwide. However, methodologies have not been developed to successfully manage the enormous amount of data generated by GPS, especially in a complex urban environment such as New York City where urban canyon effects are significant and transportation networks are complicated. We develop a GIS algorithm that automatically processes the data from GPS-based travel surveys and detects five travel modes (walk, car, bus, subway, and commuter rail) from a multimodal transportation network in New York City. The mode detection results from the GIS algorithm are checked against the travel diaries from two small handheld GPS surveys. The combined success rate is a promising 82.6% (78.9% for one survey and 86.0% for another). Challenges we encountered in the mode detection process, ways we developed to meet these challenges, as well as possible future improvement to the GPS/GIS method are discussed in the paper, in order to provide a much-needed methodology to process GPS-based travel data for other cities.