Scaling limits of a model for selection at two scales

The dynamics of a population undergoing selection is a central topic in evolutionary biology. This question is particularly intriguing in the case where selective forces act in opposing directions at two population scales. For example, a fast-replicating virus strain outcompetes slower-replicating strains at the within-host scale. However, if the fast-replicating strain causes host morbidity and is less frequently transmitted, it can be outcompeted by slower-replicating strains at the between-host scale. Here we consider a stochastic ball-and-urn process which models this type of phenomenon. We prove the weak convergence of this process under two natural scalings. The first scaling leads to a deterministic nonlinear integro-partial differential equation on the interval $[0,1]$ with dependence on a single parameter, $\lambda$. We show that the fixed points of this differential equation are Beta distributions and that their stability depends on $\lambda$ and the behavior of the initial data around $1$. The second scaling leads to a measure-valued Fleming-Viot process, an infinite dimensional stochastic process that is frequently associated with a population genetics.

Scaling limits of a model for selection at two scales

The dynamics of a population undergoing selection is a central topic in evolutionary biology. This question is particularly intriguing in the case where selective forces act in opposing directions at two population scales. For example, a fast-replicating virus strain outcompetes slower-replicating strains at the within-host scale. However, if the fast-replicating strain causes host morbidity and is less frequently transmitted, it can be outcompeted by slower-replicating strains at the between-host scale. Here we consider a stochastic ball-and-urn process which models this type of phenomenon. We prove the weak convergence of this process under two natural scalings. The first scaling leads to a deterministic nonlinear integro-partial differential equation on the interval $[0,1]$ with dependence on a single parameter, $\lambda$. We show that the fixed points of this differential equation are Beta distributions and that their stability depends on $\lambda$ and the behavior of the initial data around $1$. The second scaling leads to a measure-valued Fleming-Viot process, an infinite dimensional stochastic process that is frequently associated with a population genetics.

‘Wanna do more math’: engaging underachieving Indigenous learners the YuMi Deadly way.

The Accelerating Indigenous Mathematics (AIM) Program offered by the YuMi Deadly Centre from QUT accelerates the mathematics learning of underperforming students in Years 8 - 10 by a) apportioning Years 2-10 Australian Curriculum: Mathematics content into three years, and b) provides a teaching approach that accelerates the mathematical learning. The philosophy of the YuMi Deadly teaching approach for mathematics is one that requires a ‘body’, ‘hand’, ‘mind’ pedagogy. This presentation will provide examples of the “‘body’, ‘hand’, ‘mind’” mathematics pedagogy. In AIM classrooms, mathematics is presented this approach is having a positive impact. Students are willing ‘to have a go’ without shame; and they develop the desire to learn and improve their numeracy.

DS-VBF : dual sink vector-based routing protocol for underwater wireless sensor network

Underwater wireless sensor networks (UWSNs) have become the seat of researchers' attention recently due to their proficiency to explore underwater areas and design different applications for marine discovery and oceanic surveillance. One of the main objectives of each deployed underwater network is discovering the optimized path over sensor nodes to transmit the monitored data to onshore station. The process of transmitting data consumes energy of each node, while energy is limited in UWSNs. So energy efficiency is a challenge in underwater wireless sensor network. Dual sinks vector based forwarding (DS-VBF) takes both residual energy and location information into consideration as priority factors to discover an optimized routing path to save energy in underwater networks. The modified routing protocol employs dual sinks on the water surface which improves network lifetime. According to deployment of dual sinks, packet delivery ratio and the average end to end delay are enhanced. Based on our simulation results in comparison with VBF, average end to end delay reduced more than 80%, remaining energy increased 10%, and the increment of packet reception ratio was about 70%.

Heb. U. (Hebrew University) - Einstein Math.

Digital image

BER-optimized linear parallel interference cancellers for multicarrier DS-CDMA systems

In this paper, we consider the design and bit-error performance analysis of linear parallel interference cancellers (LPIC) for multicarrier (MC) direct-sequence code division multiple access (DS-CDMA) systems. We propose an LPIC scheme where we estimate and cancel the multiple access interference (MAT) based on the soft decision outputs on individual subcarriers, and the interference cancelled outputs on different subcarriers are combined to form the final decision statistic. We scale the MAI estimate on individual subcarriers by a weight before cancellation. In order to choose these weights optimally, we derive exact closed-form expressions for the bit-error rate (BER) at the output of different stages of the LPIC, which we minimize to obtain the optimum weights for the different stages. In addition, using an alternate approach involving the characteristic function of the decision variable, we derive BER expressions for the weighted LPIC scheme, matched filter (MF) detector, decorrelating detector, and minimum mean square error (MMSE) detector for the considered multicarrier DS-CDMA system. We show that the proposed BER-optimized weighted LPIC scheme performs better than the MF detector and the conventional LPIC scheme (where the weights are taken to be unity), and close to the decorrelating and MMSE detectors.

First observation of the decay Bs --> Ds K and measurement of the ratio of branching fractions Br(Bs --> DsK)/Br(Bs --> Ds pi)

A combined mass and particle identification fit is used to make the first observation of the decay Bs --> Ds K and measure the branching fraction of Bs --> Ds K relative to Bs --> Ds pi. This analysis uses 1.2 fb^-1 integrated luminosity of pbar-p collisions at sqrt(s) = 1.96 TeV collected with the CDF II detector at the Fermilab Tevatron collider. We observe a Bs --> Ds K signal with a statistical significance of 8.1 sigma and measure Br(Bs --> Ds K)/Br(Bs --> Ds pi) = 0.097 +- 0.018(stat) +- 0.009(sys).

First Observation of B̅ s0→Ds±K∓ and Measurement of the Ratio of Branching Fractions B(B̅ s0→Ds±K∓)/B(B̅ s0→Ds+π-)

A combined mass and particle identification fit is used to make the first observation of the decay B̅ s0→Ds±K∓ and measure the branching fraction of B̅ s0→Ds±K∓ relative to B̅ s0→Ds+π-. This analysis uses 1.2  fb-1 integrated luminosity of pp̅ collisions at √s=1.96  TeV collected with the CDF II detector at the Fermilab Tevatron collider. We observe a B̅ s0→Ds±K∓ signal with a statistical significance of 8.1σ and measure B(B̅ s0→Ds±K∓)/B(B̅ s0→Ds+π-)=0.097±0.018(stat)±0.009(syst).

First Observation of B̅ s0→Ds±K∓ and Measurement of the Ratio of Branching Fractions B(B̅ s0→Ds±K∓)/B(B̅ s0→Ds+π-)

A combined mass and particle identification fit is used to make the first observation of the decay Bs --> Ds K and measure the branching fraction of Bs --> Ds K relative to Bs --> Ds pi. This analysis uses 1.2 fb^-1 integrated luminosity of pbar-p collisions at sqrt(s) = 1.96 TeV collected with the CDF II detector at the Fermilab Tevatron collider. We observe a Bs --> Ds K signal with a statistical significance of 8.1 sigma and measure Br(Bs --> Ds K)/Br(Bs --> Ds pi) = 0.097 +- 0.018(stat) +- 0.009(sys).

BER Analysis of Weighted Interference Cancellation in Multicarrier DS-CDMA Systems

In this paper, we present the design and bit error performance analysis of weighted linear parallel interference cancellers (LPIC) for multicarrier (MC) DS-CDMA systems. We propose an LPIC scheme where we estimate (and cancel) the multiple access interference (MAI) based on the soft outputs on individual subcarriers, and the interference cancelled outputs on different subcarriers are combined to form the final decision statistic. We scale the MAI estimate on individual subcarriers by a weight before cancellation; these weights are so chosen to maximize the signal-to-interference ratios at the individual subcarrier outputs. For this weighted LPIC scheme, using an approach involving the characteristic function of the decision variable, we derive exact bit error rate (BER) expressions for different cancellation stages. Using the same approach, we also derive exact BER expressions for the matched filter (MF) and decorrelating detectors for the considered MC DS-CDMA system. We show that the proposed weighted LPIC scheme performs better than the MF detector and the conventional LPIC (where the weights are taken to be unity), and close to the decorrelating detector.

Discovering Math APIs by Mining Unit Tests

In today's API-rich world, programmer productivity depends heavily on the programmer's ability to discover the required APIs. In this paper, we present a technique and tool, called MATHFINDER, to discover APIs for mathematical computations by mining unit tests of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code to compute the expression by mapping its subexpressions to API method calls. For each subexpression, MATHFINDER searches for a method such that there is a mapping between method inputs and variables of the subexpression. The subexpression, when evaluated on the test inputs of the method under this mapping, should produce results that match the method output on a large number of tests. We implemented MATHFINDER as an Eclipse plugin for discovery of third-party Java APIs and performed a user study to evaluate its effectiveness. In the study, the use of MATHFINDER resulted in a 2x improvement in programmer productivity. In 96% of the subexpressions queried for in the study, MATHFINDER retrieved the desired API methods as the top-most result. The top-most pseudo-code snippet to implement the entire expression was correct in 93% of the cases. Since the number of methods and unit tests to mine could be large in practice, we also implement MATHFINDER in a MapReduce framework and evaluate its scalability and response time.

Mining Unit Tests for Discovery and Migration of Math APIs

Today's programming languages are supported by powerful third-party APIs. For a given application domain, it is common to have many competing APIs that provide similar functionality. Programmer productivity therefore depends heavily on the programmer's ability to discover suitable APIs both during an initial coding phase, as well as during software maintenance. The aim of this work is to support the discovery and migration of math APIs. Math APIs are at the heart of many application domains ranging from machine learning to scientific computations. Our approach, called MATHFINDER, combines executable specifications of mathematical computations with unit tests (operational specifications) of API methods. Given a math expression, MATHFINDER synthesizes pseudo-code comprised of API methods to compute the expression by mining unit tests of the API methods. We present a sequential version of our unit test mining algorithm and also design a more scalable data-parallel version. We perform extensive evaluation of MATHFINDER (1) for API discovery, where math algorithms are to be implemented from scratch and (2) for API migration, where client programs utilizing a math API are to be migrated to another API. We evaluated the precision and recall of MATHFINDER on a diverse collection of math expressions, culled from algorithms used in a wide range of application areas such as control systems and structural dynamics. In a user study to evaluate the productivity gains obtained by using MATHFINDER for API discovery, the programmers who used MATHFINDER finished their programming tasks twice as fast as their counterparts who used the usual techniques like web and code search, IDE code completion, and manual inspection of library documentation. For the problem of API migration, as a case study, we used MATHFINDER to migrate Weka, a popular machine learning library. Overall, our evaluation shows that MATHFINDER is easy to use, provides highly precise results across several math APIs and application domains even with a small number of unit tests per method, and scales to large collections of unit tests.

Directly-modulated DS-DBR tunable laser for uncooled C-band WDM system

A tunable DS-DBR laser is demonstrated for uncooled WDM C-band channel generation with tight spacing (SOGHz) and low thermal drift (±2.5GHz) up to 70°C. 2.5Gb/s direct modulation with transmission over a 75km link is achieved. © 2000 Optical Society of America.