Link Partition Research Articles

Research on Processing Method of Water Pollution Accident

Crops are the main victims of the accident of water pollution. The paper will discuss treatment program,investigation, crop damage symptom recognition, direct economic loss estimation of water pollution, confirmation, accident responsibility partition and arbitration of such links. It will provide principles for the other accidents. Besides, it can also be used as a handling reference to other issues of pollution and pollution accident.

Context-sensitive detection of local community structure

Local methods for detecting community structure are necessary when a graph’s size or node-expansion cost make global community detection methods infeasible. Various algorithms for local community detection have been proposed, but there has been little analysis of the circumstances under which one approach is preferable to another. This paper describes an evaluation comparing the accuracy of five alternative vertex selection policies in detecting two distinct types of community structures—vertex partitions that maximize modularity, and link partitions that maximize partition density—in a variety of graphs. In this evaluation, the vertex selection policy that most accurately identified vertex-partition community structure in a given graph depended on how closely the graph’s degree distribution approximated a power-law distribution. When the target community structure was partition-density maximization, however, an algorithm based on spreading activation generally performed best, regardless of degree distribution. These results indicate that local community detection should be context-sensitive in the sense of basing vertex selection on the graph’s degree distribution and the target community structure.

Line graphs, link partitions, and overlapping communities

In this paper, we use a partition of the links of a network in order to uncover its community structure. This approach allows for communities to overlap at nodes so that nodes may be in more than one community. We do this by making a node partition of the line graph of the original network. In this way we show that any algorithm that produces a partition of nodes can be used to produce a partition of links. We discuss the role of the degree heterogeneity and propose a weighted version of the line graph in order to account for this.

Research of Dynamic Location Referencing Method Based On Intersection and Link Partition

Research of Dynamic Location Referencing Method Based On Intersection and Link Partition

Spare capacity allocation and optimisation in a distributed GMPLS-based IP/WDM mesh network

IP over wavelength-division multiplexing (WDM) networks have been identified as promising candidates to underpin future telecommunication networks and thus industrial and academic researchers have been actively investigating key issues that affect the integration of IP and optical layers. An area of prime concern is network survivability. The main challenges within this domain are: to provide survivability schemes under different failure scenarios and to reduce the amount of required spare capacity while providing the required quality of service (QoS). Due to its flexibility and simplicity, one candidate technique is pre-allocated restoration. In this paper, the performance of pre-allocated restoration mechanisms are investigated considering a distributed GMPLS-based IP/WDM mesh network under single and dual-link failure scenarios. Several issues are considered. Firstly, two proposed spare capacity allocation schemes are investigated; link partitioning and lightpath partitioning. Secondly, the paper evaluates a retrial scheme that supports the utilisation of spare capacity. Thirdly, proposed class prioritisation scheme applied to the differentiated survivability concept with pre-allocated restoration is investigated. Finally, two load-based spare capacity optimisation schemes are proposed and evaluated; local spare capacity optimisation (LSCO) and global spare capacity optimisation (GSCO).

Supporting mobile multimedia in integrated services networks

Owing to widespread user mobility, limited radio resources, and changing network characteristics, supporting multimedia communications in a mobile internetworking environment is a challenging problem. In this paper, we present an `adaptive reserved service' framework for use in integrated services networks to support mobile connections carrying multimedia traffic. Integrated in the framework are an anticipatory handoff control mechanism which enables fast handoff, and an adaptive link partitioning scheme which enhances handoff success. Besides, bandwidth reservations in the wireline network are dynamically adjusted based on resource availability in the wireless networks. An accompanying reservation protocol not only facilitates distributed control of mobile connections but also provides network feedback to mobile hosts.

Link concepts and partitioning in model formulation

For any endeavour (application), the goal is to ensure the chance is high that the conclusions, which flow from the underlying problem-solving, are valid and realistic. The extent and structure of the information available about the application and the degree to which this information is exploited in the modelling are the keys to making the chance high. At one level, this depends on the nature and amount of the available data. At another, it relates to the quality of the modelling which connects the available data to the indicators which characterize the relevant decision-making quantitatively. The interest of this paper is principally the latter aspect. The focus is link concepts which allow a model, which connects the available data to the indicators, to be partitioned into a number of interrelated sub-models. Such partitioning has a dual role in problem-solving in that it is a strategy for the formulation process itself as well as for the implementation of a model in terms of link concepts. The discussion is illustrated with a variety of examples including the modelling developed for a Decision Support System for the management of a beef cattle station in North Queensland.

Design and analysis of a multilink access subsystem based on the Batcher-banyan network architecture

A multilink access subsystem based on the Batcher-banyan network architecture is proposed. With this subsystem, multiple physical output links connecting a pair of switching nodes can be shared in an effective way. The subsystem is also configurational so that there is no restriction on any particular partition of physical output links. This is accomplished by executing the proposed multilink access algorithm on a modified Batcher sorter. It is shown that the required hardware can be integrated into the Batcher sorter, and the multilink access algorithm can be integrated with the contention resolution three-phase algorithm. The overhead incurred due to the running of the multilink access algorithm is calculated and the asymptotic performance analyses of the resulting single queue multilink access switch are presented. Results show that the proposed architecture has higher capacity than the unilink access counterpart, has low delay, and has low packet loss probability with small buffer size. >