adaptive location update mechanism for network-constrained moving objects in changeful traffic conditions

Natl Chiao Tung Univ, Dept Comp Sci

Nitrogen-15 signals of leaf-litter-soil continuum as a possible indicator of ecosystem nitrogen saturation by forest succession and N loads

National Key Research and Development Program [2010CB833502]; National Natural Science Foundation of China [30600071, 40601097, 30590381]; Chinese Academy of Sciences [KZCX2-YW-432, O7V70080SZ, LENOM07LS-01]; GUCAS [O85101PM03]

"Dual-Parallel-Channel" Shape-Gradient Surfaces: Toward Oriented and Reversible Movement of Water Droplets

In this paper, we prepared "dual-parallel-channel" shape-gradient surfaces, on which water droplets can reversibly and orientedly move between two adjacent pools under the guidance of an external voltage. Furthermore, it is found that the motion speed is governed by several parameters, including bath condition, gradient angle, and the working voltage. In this self-transportation process of water droplets, the external voltage works like a traffic light, which can give "moving", "stopping", "turning" and "straight-going" signals to the Water droplets.

Control of reproduction rhythmicity by environmental and endogenous signals in Ulva pseudocurvata (Chlorophyta)

A field population of Ulva pseudocurvata Koeman et C. Hoek (hereafter termed Ulva) at Sylt Island (North Sea, Germany) exhibited biweekly peaks of gametophytic reproduction during the colder seasons and approximately weekly peaks during summer. The reproductive events lasted 1-5 d and were separated from each other by purely vegetative phases. Under constant conditions in the laboratory, a free-running rhythm was observed with reproductive peaks occurring approximately every 7 d. When artificial moonlight was provided every 4 weeks, fewer reproductive events occurred, and the reproductive rhythm became synchronized to the environmental artificial moonlight rhythm. In the laboratory, apical disks were entirely converted into reproductive tissue after 8 d cultivation, while almost all basal disks stayed vegetative, which prevented the entire loss of the vegetative thallus during reproductive events. Seasonal size reduction of the thallus occurred from late autumn onward and was determined to be controlled by a genuine photoperiodic response, since size reduction could be induced from May onward by experimental short-day (SD) treatment but was prevented in a long-day (LD) or night-break regime (NB). A daily fine-tuning occurred with gamete release early in the morning at the first sign of daylight, following an obligatory dark ("night") period of at least 1 h duration. No release took place if the overnight dark phase was replaced by continuous light. Blue, green, or red light all triggered gamete release after a dark phase at an irradiance of 0.1 mu mol photons . m(-2) .s(-1), while 0.001 mu mol photons . m(-2) . s(-1) was equivalent to a dark control.

Time-Frequency Representations for Speech Signals

This work addresses two related questions. The first question is what joint time-frequency energy representations are most appropriate for auditory signals, in particular, for speech signals in sonorant regions. The quadratic transforms of the signal are examined, a large class that includes, for example, the spectrograms and the Wigner distribution. Quasi-stationarity is not assumed, since this would neglect dynamic regions. A set of desired properties is proposed for the representation: (1) shift-invariance, (2) positivity, (3) superposition, (4) locality, and (5) smoothness. Several relations among these properties are proved: shift-invariance and positivity imply the transform is a superposition of spectrograms; positivity and superposition are equivalent conditions when the transform is real; positivity limits the simultaneous time and frequency resolution (locality) possible for the transform, defining an uncertainty relation for joint time-frequency energy representations; and locality and smoothness tradeoff by the 2-D generalization of the classical uncertainty relation. The transform that best meets these criteria is derived, which consists of two-dimensionally smoothed Wigner distributions with (possibly oriented) 2-D guassian kernels. These transforms are then related to time-frequency filtering, a method for estimating the time-varying 'transfer function' of the vocal tract, which is somewhat analogous to ceptstral filtering generalized to the time-varying case. Natural speech examples are provided. The second question addressed is how to obtain a rich, symbolic description of the phonetically relevant features in these time-frequency energy surfaces, the so-called schematic spectrogram. Time-frequency ridges, the 2-D analog of spectral peaks, are one feature that is proposed. If non-oriented kernels are used for the energy representation, then the ridge tops can be identified, with zero-crossings in the inner product of the gradient vector and the direction of greatest downward curvature. If oriented kernels are used, the method can be generalized to give better orientation selectivity (e.g., at intersecting ridges) at the cost of poorer time-frequency locality. Many speech examples are given showing the performance for some traditionally difficult cases: semi-vowels and glides, nasalized vowels, consonant-vowel transitions, female speech, and imperfect transmission channels.

Predicting interpretability of metabolome models based on behavior, putative identity, and biological relevance of explanatory signals

Enot, D. P., Beckmann, M., Overy, D., Draper, J. (2006). Predicting interpretability of metabolome models based on behavior, putative identity, and biological relevance of explanatory signals. Proceedings of the National Academy of Sciences of the USA, 103(40), 14865-14870. Sponsorship: BBSRC RAE2008

Dialogic Signals In Argumentative Discussions of Advanced Polish Learners Of English

The first part of the paper deals with characteristics of classroom interaction as a type of institutional talk in a conversational analytic perspective. Next, the thesis is discussed concerning developing learners' interactional competence to foster learner discursive independence in argumentative discussions in English as a foreign language. Finally, after a short review of dialogic signals, the article presents a preliminary analysis of selected dialogic signals: evaluating reformulations and piggybacking as the ways of achieving reciprocity in argumentative discussions.

Dialogic Signals In Argumentative Discussions of Advanced Polish Learners Of English

The first part of the paper deals with characteristics of classroom interaction as a type of institutional talk in a conversational analytic perspective. Next, the thesis is discussed concerning developing learners' interactional competence to foster learner discursive independence in argumentative discussions in English as a foreign language. Finally, after a short review of dialogic signals, the article presents a preliminary analysis of selected dialogic signals: evaluating reformulations and piggybacking as the ways of achieving reciprocity in argumentative discussions.

On the Convergence of Statistical Techniques for Inferring Network Traffic Demands

Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a complete set of these demands is prohibitively expensive because of the huge amounts of data that must be collected and the performance impact that such measurements would impose on the regular behavior of the network. As a consequence, we must rely on statistical techniques to produce estimates of actual traffic demands from partial information. The performance of such techniques is however limited due to their reliance on limited information and the high amount of computations they incur, which limits their convergence behavior. In this paper we study strategies to improve the convergence of a powerful statistical technique based on an Expectation-Maximization iterative algorithm. First we analyze modeling approaches to generating starting points. We call these starting points informed priors since they are obtained using actual network information such as packet traces and SNMP link counts. Second we provide a very fast variant of the EM algorithm which extends its computation range, increasing its accuracy and decreasing its dependence on the quality of the starting point. Finally, we study the convergence characteristics of our EM algorithm and compare it against a recently proposed Weighted Least Squares approach.

Structural Analysis of Network Traffic Flows

Network traffic arises from the superposition of Origin-Destination (OD) flows. Hence, a thorough understanding of OD flows is essential for modeling network traffic, and for addressing a wide variety of problems including traffic engineering, traffic matrix estimation, capacity planning, forecasting and anomaly detection. However, to date, OD flows have not been closely studied, and there is very little known about their properties. We present the first analysis of complete sets of OD flow timeseries, taken from two different backbone networks (Abilene and Sprint-Europe). Using Principal Component Analysis (PCA), we find that the set of OD flows has small intrinsic dimension. In fact, even in a network with over a hundred OD flows, these flows can be accurately modeled in time using a small number (10 or less) of independent components or dimensions. We also show how to use PCA to systematically decompose the structure of OD flow timeseries into three main constituents: common periodic trends, short-lived bursts, and noise. We provide insight into how the various constituents contribute to the overall structure of OD flows and explore the extent to which this decomposition varies over time.

itmBench: Generalized API for Internet Traffic Managers

Internet Traffic Managers (ITMs) are special machines placed at strategic places in the Internet. itmBench is an interface that allows users (e.g. network managers, service providers, or experimental researchers) to register different traffic control functionalities to run on one ITM or an overlay of ITMs. Thus itmBench offers a tool that is extensible and powerful yet easy to maintain. ITM traffic control applications could be developed either using a kernel API so they run in kernel space, or using a user-space API so they run in user space. We demonstrate the flexibility of itmBench by showing the implementation of both a kernel module that provides a differentiated network service, and a user-space module that provides an overlay routing service. Our itmBench Linux-based prototype is free software and can be obtained from http://www.cs.bu.edu/groups/itm/.

Diagnosing Network-Wide Traffic Anomalies

Anomalies are unusual and significant changes in a network's traffic levels, which can often involve multiple links. Diagnosing anomalies is critical for both network operators and end users. It is a difficult problem because one must extract and interpret anomalous patterns from large amounts of high-dimensional, noisy data. In this paper we propose a general method to diagnose anomalies. This method is based on a separation of the high-dimensional space occupied by a set of network traffic measurements into disjoint subspaces corresponding to normal and anomalous network conditions. We show that this separation can be performed effectively using Principal Component Analysis. Using only simple traffic measurements from links, we study volume anomalies and show that the method can: (1) accurately detect when a volume anomaly is occurring; (2) correctly identify the underlying origin-destination (OD) flow which is the source of the anomaly; and (3) accurately estimate the amount of traffic involved in the anomalous OD flow. We evaluate the method's ability to diagnose (i.e., detect, identify, and quantify) both existing and synthetically injected volume anomalies in real traffic from two backbone networks. Our method consistently diagnoses the largest volume anomalies, and does so with a very low false alarm rate.

A Two-step Statistical Approach for Inferring Network Traffic Demands (Revises Technical Report BUCS-2003-003)

Accurate knowledge of traffic demands in a communication network enables or enhances a variety of traffic engineering and network management tasks of paramount importance for operational networks. Directly measuring a complete set of these demands is prohibitively expensive because of the huge amounts of data that must be collected and the performance impact that such measurements would impose on the regular behavior of the network. As a consequence, we must rely on statistical techniques to produce estimates of actual traffic demands from partial information. The performance of such techniques is however limited due to their reliance on limited information and the high amount of computations they incur, which limits their convergence behavior. In this paper we study a two-step approach for inferring network traffic demands. First we elaborate and evaluate a modeling approach for generating good starting points to be fed to iterative statistical inference techniques. We call these starting points informed priors since they are obtained using actual network information such as packet traces and SNMP link counts. Second we provide a very fast variant of the EM algorithm which extends its computation range, increasing its accuracy and decreasing its dependence on the quality of the starting point. Finally, we evaluate and compare alternative mechanisms for generating starting points and the convergence characteristics of our EM algorithm against a recently proposed Weighted Least Squares approach.

Characterization of Network-Wide Anomalies in Traffic Flows

Detecting and understanding anomalies in IP networks is an open and ill-defined problem. Toward this end, we have recently proposed the subspace method for anomaly diagnosis. In this paper we present the first large-scale exploration of the power of the subspace method when applied to flow traffic. An important aspect of this approach is that it fuses information from flow measurements taken throughout a network. We apply the subspace method to three different types of sampled flow traffic in a large academic network: multivariate timeseries of byte counts, packet counts, and IP-flow counts. We show that each traffic type brings into focus a different set of anomalies via the subspace method. We illustrate and classify the set of anomalies detected. We find that almost all of the anomalies detected represent events of interest to network operators. Furthermore, the anomalies span a remarkably wide spectrum of event types, including denial of service attacks (single-source and distributed), flash crowds, port scanning, downstream traffic engineering, high-rate flows, worm propagation, and network outage.