Bird feeders and their effects on bird-window collisions at residential houses

Feeding wild birds creates an important link between homeowners and conservation. The effects of bird feeders and year-round feeding on birds have not been well studied, however, particularly in relationship to bird-window collisions. We determined effects of bird feeder presence and placement on bird-window collisions at residential homes. Paired month-long trials in which a feeder was either present or absent for one month and then removed or added for the second month were completed at 55 windows at 43 houses. In each trial, homeowners were asked to search their study window daily for evidence of a bird-window collision. During the study there were 51 collisions when there was no bird feeder and 94 when the feeder was present. The season when each trial was set up was the best individual predictor of bird-window collisions. The largest number of collisions was observed during fall migration and the lowest during the winter months. There were no collisions at 26 of the study windows. High variance was observed in the number of collisions at different houses, indicating that effects of bird feeders are context dependent. Changing the occurrence, timing, and placement of feeders can alter collision rates but is only one of many factors that influence whether a residential house is likely to have a bird window-collision or not.

Periodic Reordering

For many networks in nature, science and technology, it is possible to order the nodes so that most links are short-range, connecting near-neighbours, and relatively few long-range links, or shortcuts, are present. Given a network as a set of observed links (interactions), the task of finding an ordering of the nodes that reveals such a range-dependent structure is closely related to some sparse matrix reordering problems arising in scientific computation. The spectral, or Fiedler vector, approach for sparse matrix reordering has successfully been applied to biological data sets, revealing useful structures and subpatterns. In this work we argue that a periodic analogue of the standard reordering task is also highly relevant. Here, rather than encouraging nonzeros only to lie close to the diagonal of a suitably ordered adjacency matrix, we also allow them to inhabit the off-diagonal corners. Indeed, for the classic small-world model of Watts & Strogatz (1998, Collective dynamics of ‘small-world’ networks. Nature, 393, 440–442) this type of periodic structure is inherent. We therefore devise and test a new spectral algorithm for periodic reordering. By generalizing the range-dependent random graph class of Grindrod (2002, Range-dependent random graphs and their application to modeling large small-world proteome datasets. Phys. Rev. E, 66, 066702-1–066702-7) to the periodic case, we can also construct a computable likelihood ratio that suggests whether a given network is inherently linear or periodic. Tests on synthetic data show that the new algorithm can detect periodic structure, even in the presence of noise. Further experiments on real biological data sets then show that some networks are better regarded as periodic than linear. Hence, we find both qualitative (reordered networks plots) and quantitative (likelihood ratios) evidence of periodicity in biological networks.

Sailing through stone. Carved ships and the rockface at Revheim, southwest Norway

The relationship between rock art and the material qualities of the rock surface on which it is executed is investigated. The case study of Revheim, Rogaland, Southwest Norway, is the starting-point for a discussion on the way in which the contours of the rock, quartz outcrops and the flow of water across the rock surface affect the placement of images on the rock. It is argued that a fuller examination of the interrelationship between rock and rock art provides a more coherent interpretation of rock art images.

Römische Inschriften und Wackernagels Gesetz : Untersuchungen zur Syntax epigraphischer Texte aus republikanischer Zeit

Linguistic study of the placement of 'esse' and the unstressed personal pronoun in the Roman Republican inscriptions.

A management architecture for active networks

In this paper we present an architecture for network and applications management, which is based on the Active Networks paradigm and shows the advantages of network programmability. The stimulus to develop this architecture arises from an actual need to manage a cluster of active nodes, where it is often required to redeploy network assets and modify nodes connectivity. In our architecture, a remote front-end of the managing entity allows the operator to design new network topologies, to check the status of the nodes and to configure them. Moreover, the proposed framework allows to explore an active network, to monitor the active applications, to query each node and to install programmable traps. In order to take advantage of the Active Networks technology, we introduce active SNMP-like MIBs and agents, which are dynamic and programmable. The programmable management agents make tracing distributed applications a feasible task. We propose a general framework that can inter-operate with any active execution environment. In this framework, both the manager and the monitor front-ends communicate with an active node (the Active Network Access Point) through the XML language. A gateway service performs the translation of the queries from XML to an active packet language and injects the code in the network. We demonstrate the implementation of an active network gateway for PLAN (Packet Language for Active Networks) in a forty active nodes testbed. Finally, we discuss an application of the active management architecture to detect the causes of network failures by tracing network events in time.

A reconfigurable neural environment on active networks

This paper proposes the deployment of a neural network computing environment on Active Networks. Active Networks are packet-switched computer networks in which packets can contain code fragments that are executed on the intermediate nodes. This feature allows the injection of small pieces of codes to deal with computer network problems directly into the network core, and the adoption of new computing techniques to solve networking problems. The goal of our project is the adoption of a distributed neural network for approaching tasks which are specific of the computer network environment. Dynamically reconfigurable neural networks are spread on an experimental wide area backbone of active nodes (ABone) to show the feasibility of the proposed approach.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner Minimal Tree problem is presented here. The method described is based on the detection of particular sets of nodes in networks, the “Hot Spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used CIS comparison terms in the experimental analysis which demonstrates the goodness of the heuristic discussed in this paper.

Efficient tree construction for the multicast problem

A new heuristic for the Steiner minimal tree problem is presented. The method described is based on the detection of particular sets of nodes in networks, the “hot spot” sets, which are used to obtain better approximations of the optimal solutions. An algorithm is also proposed which is capable of improving the solutions obtained by classical heuristics, by means of a stirring process of the nodes in solution trees. Classical heuristics and an enumerative method are used as comparison terms in the experimental analysis which demonstrates the capability of the heuristic discussed

Immigration, species radiation and extinction in a highly diverse songbird lineage: white-eyes on Indian Ocean islands

Molecular phylogenetic hypotheses of species-rich lineages in regions where geological history can be reliably inferred may provide insights into the scale of processes driving diversification. Here we sample all extant or recently extinct white-eye (Zosterops) taxa of the southwest Indian Ocean, combined with samples from all principal continental lineages. Results support a high dispersal capability, with at least two independent continental sources for white-eyes of the region. An early (within 1.8 million years ago) expansion into the Indian Ocean may have originated either from Asia or Africa; the three resulting lineages show a disparate distribution consistent with considerable extinction following their arrival. Africa is supported as the origin of a later expansion into the region (within 1.2 million years ago). On two islands, a pair of Zosterops species derived from independent immigrations into the Indian Ocean co-occur or may have formerly co-occurred, providing strong support for their origin by double-island colonization rather than within-island (sympatric or microallopatric) speciation. On Mauritius and La Reunion, phylogenetic placement of sympatric white-eyes allow us to rule out a scenario in which independent within-island speciation occurred on both islands; one of the species pairs must have arisen by double colonization, while the other pair is likely to have arisen by the same mechanism. Long-distance immigration therefore appears to be responsible for much of the region's white-eye diversity. Independent immigrations into the region have resulted in lineages with mutually exclusive distributions and it seems likely that competition with congeneric species, rather than arrival frequency, may limit present-day diversity.

A grouped P2P network for scalable grid information services

Information services play a crucial role in grid environments in that the state information can be used to facilitate the discovery of resources and the services available to meet user requirements, and also to help tune the performance of a grid system. However, the large size and dynamic nature of the grid brings forth a number of challenges for information services. This paper presents PIndex, a grouped peer-to-peer network that can be used for scalable grid information services. PIndex builds on Globus MDS4, but introduces peer groups to dynamically split the large grid information search space into many small sections to enhance its scalability and resilience. PIndex is subsequently modeled with Colored Petri Nets for performance evaluation. The simulation results show that PIndex is scalable and resilient in dealing with a large number of peer nodes.

Bifidobacterium scardovii sp. nov., from human sources

Five strains of an unusual catalase-negative Gram-positive asporogenous rod-shaped bacterium from human sources were subjected to a polyphasic taxonomic study. The presence of fructose-6-phosphate phosphoketolase, a key enzyme of bifidobacterial hexose metabolism, indicated the strains were members of the genus Bifidobacterium but they did not correspond to any of the recognized species of this genus on the basis of biochemical profiles and whole-cell protein analyses. Comparative 16S rRNA gene sequencing confirmed the placement of the isolates in the genus Bifidobacterium, and demonstrated they represent a hitherto unknown subline within the genus displaying > 5% sequence divergence with recognized species. Based on both phenotypic and phylogenetic criteria, it is proposed that the isolates recovered from human sources be classified as a new species, Bifidobacterium scardovii sp. nov.; the type strain is CCUG 13008T (= DSM 13734T).

Minimum neighbour and extended Kalman filter estimator: a practical distributed channel assignment scheme for dense wireless local area networks

Dense deployments of wireless local area networks (WLANs) are becoming a norm in many cities around the world. However, increased interference and traffic demands can severely limit the aggregate throughput achievable unless an effective channel assignment scheme is used. In this work, a simple and effective distributed channel assignment (DCA) scheme is proposed. It is shown that in order to maximise throughput, each access point (AP) simply chooses the channel with the minimum number of active neighbour nodes (i.e. nodes associated with neighbouring APs that have packets to send). However, application of such a scheme to practice depends critically on its ability to estimate the number of neighbour nodes in each channel, for which no practical estimator has been proposed before. In view of this, an extended Kalman filter (EKF) estimator and an estimate of the number of nodes by AP are proposed. These not only provide fast and accurate estimates but can also exploit channel switching information of neighbouring APs. Extensive packet level simulation results show that the proposed minimum neighbour and EKF estimator (MINEK) scheme is highly scalable and can provide significant throughput improvement over other channel assignment schemes.

On-demand hd video using Jini based grid

This research establishes the feasibility of using a network centric technology, Jini, to provide a grid framework on which to perform parallel video encoding. A solution was implemented using Jini and obtained real-time on demand encoding of a 480 HD video stream. Further, a projection is made concerning the encoding of 1080 HD video in real-time, as the current grid was not powerful enough to achieve this above 15fps. The research found that Jini is able to provide a number of tools and services highly applicable in a grid environment. It is also suitable in terms of performance and responds well to a varying number of grid nodes. The main performance limiter was found to be the network bandwidth allocation, which when loaded with a large number of grid nodes was unable to handle the traffic.

Online modeling with tunable RBF network

In this paper, we propose a novel online modeling algorithm for nonlinear and nonstationary systems using a radial basis function (RBF) neural network with a fixed number of hidden nodes. Each of the RBF basis functions has a tunable center vector and an adjustable diagonal covariance matrix. A multi-innovation recursive least square (MRLS) algorithm is applied to update the weights of RBF online, while the modeling performance is monitored. When the modeling residual of the RBF network becomes large in spite of the weight adaptation, a node identified as insignificant is replaced with a new node, for which the tunable center vector and diagonal covariance matrix are optimized using the quantum particle swarm optimization (QPSO) algorithm. The major contribution is to combine the MRLS weight adaptation and QPSO node structure optimization in an innovative way so that it can track well the local characteristic in the nonstationary system with a very sparse model. Simulation results show that the proposed algorithm has significantly better performance than existing approaches.

Dendritic cells interact with CD4 T cells in intestinal mucosa

Absence of lymph nodes in nonmammalian species, expression of MHCII by APCs in the periphery, and the recent findings that T cells can change their polarization status after presentation in the lymph nodes imply a role for MHCII-mediated presentation outside the organized lymphoid tissue. This study shows that MHCII+ ECs and DCs from the intestinal mucosa of the pig can present antigen to T cells in vitro. In vivo, APCs colocalize with T cells in pig and mouse intestinal mucosa. In the pig, endothelium is involved in these interactions in neonates but not in adults, indicating different roles for stromal and professional APCs in the neonate compared with the adult. The ratio of expression of DQ and DR MHCII locus products was lower on ECs than on other mucosal APCs, indicating that the two types of cells present different peptide sets. Adult nonendothelial APCs expressed a higher ratio of DQ/DR than in neonates. These results suggest that mucosal DCs can present antigen locally to primed T cells and that stromal APCs are recruited to these interactions in some cases. This raises the possibility that local presentation may influence T cell responses at the effector stage after initial presentation in the lymph node.