Experimental validation of analytical performance models for IEEE 802.11 networks

We consider the simplest IEEE 802.11 WLAN networks for which analytical models are available and seek to provide an experimental validation of these models. Our experiments include the following cases: (i) two nodes with saturated queues, sending fixed-length UDP packets to each other, and (ii) a TCP-controlled transfer between two nodes. Our experiments are based entirely on Aruba AP-70 access points operating under Linux. We report our observations on certain non-standard behavior of the devices. In cases where the devices adhere to the standards, we find that the results from the analytical models estimate the experimental data with a mean error of 3-5%.

Variants of waters’ dual system primitives using asymmetric pairings

Waters, in 2009, introduced an important technique, called dual system encryption, to construct identity-based encryption (IBE) and related schemes. The resulting IBE scheme was described in the setting of symmetric pairing. A key feature of the construction is the presence of random tags in the ciphertext and decryption key. Later work by Lewko and Waters removed the tags and proceeding through composite-order pairings led to a more efficient dual system IBE scheme using asymmetric pairings whose security is based on non-standard but static assumptions. In this work, we have systematically simplified Waters 2009 IBE scheme in the setting of asymmetric pairing. The simplifications retain tags used in the original description. This leads to several variants, the first one of which is based on standard assumptions and in comparison to Waters’ original scheme reduces ciphertexts and keys by two elements each. Going through several stages of simplifications, we finally obtain a simple scheme whose security can be based on two standard assumptions and a natural and minimal extension of the decision Diffie-Hellman problem for asymmetric pairing groups. The scheme itself is also minimal in the sense that apart from the tags, both encryption and key generation use exactly one randomiser each. This final scheme is more efficient than both the previous dual system IBE scheme in the asymmetric setting due to Lewko and Waters and the more recent dual system IBE scheme due to Lewko. We extend the IBE scheme to hierarchical IBE (HIBE) and broadcast encryption (BE) schemes. Both primitives are secure in their respective full models and have better efficiencies compared to previously known schemes offering the same level and type of security.

Sequential Monte Carlo computation of the score and observed information matrix in state-space models with application to parameter estimation

Sequential Monte Carlo (SMC) methods are popular computational tools for Bayesian inference in non-linear non-Gaussian state-space models. For this class of models, we propose SMC algorithms to compute the score vector and observed information matrix recursively in time. We propose two different SMC implementations, one with computational complexity $\mathcal{O}(N)$ and the other with complexity $\mathcal{O}(N^{2})$ where $N$ is the number of importance sampling draws. Although cheaper, the performance of the $\mathcal{O}(N)$ method degrades quickly in time as it inherently relies on the SMC approximation of a sequence of probability distributions whose dimension is increasing linearly with time. In particular, even under strong \textit{mixing} assumptions, the variance of the estimates computed with the $\mathcal{O}(N)$ method increases at least quadratically in time. The $\mathcal{O}(N^{2})$ is a non-standard SMC implementation that does not suffer from this rapid degrade. We then show how both methods can be used to perform batch and recursive parameter estimation.

A Note on Wavelet Correlation and Cointegration

In a recent paper Leong-Huang:2010 {Journal of Applied Statistics 37, 215–233} proposed a wavelet-correlation-based approach to test for cointegration between two time series. However, correlation and cointegration are two different concepts even when wavelet analysis is used. It is known that statistics based on nonstationary integrated variables have non-standard asymptotic distributions. However, wavelet analysis offsets the integrating order of nonstationary series so that traditional asymptotics on stationary variables suffices to ascertain the statistical properties of wavelet-based statistics. Based on this, this note shows that wavelet correlations cannot be used as a test of cointegration.

Studies of Organic Molecule Recognition by Synthetic Cyclophane Receptors in Aqueous Media

The behaviors of six new cyclophane receptors for organic guest molecules in aqueous media are reported. These new hosts are modifications of more basic parent structures, and the main goal of their examination has been to determine how the modifications affect host selectivity for cationic guests. In particular, we have been interested in determining how additional non-covalent binding interactions can complement the cation-π interactions active in the parent systems. Three types of modifications were made to these systems. Firstly, neutral methoxy and bromine substituents were added to produce four of the six new macrocycles. Secondly, two additional aromatic rings (relative to the parent host) capable of making cation-π interactions with charged guest species were appended. Thirdly, a negatively charged carboxyl group was attached to produce a cavity in which electrostatic interactions should enhance cationic guest binding. ^1H-NMR and circular dichroic techniques were employed to determine the binding affinities of a wide variety of organic guests for the parent and modified structures in aqueous media.

Bromination of the parent host greatly enhances its binding in a general fashion, primarily as the result of hydrophobic interactions. The addition of methoxy groups does not enhance binding, apparently as a result of a collapse of the hosts into a conformation that is not suitable for binding. The appendage of extra aromatic rings enhances the binding of positively charged guests, most likely in response to more complete encapsulation of guest species. The addition of a negatively charged carboxylate enhances the binding to only selective groups of cationic guests. AM1 calculations of the electrostatic potentials of several guests molecules suggests that the enhancements seen with the modified receptor compared to the parent are most likely the result of close contact between regions of highest potential on the guest and the appended carboxylate.

Condições de contorno albedo para cálculos globais de reatores nucleares térmicos com o modelo de ordenadas discretas a dois grupos de energia

Como eventos de fissão induzida por nêutrons não ocorrem nas regiões nãomultiplicativas de reatores nucleares, e.g., moderador, refletor, e meios estruturais, essas regiões não geram potência e a eficiência computacional dos cálculos globais de reatores nucleares pode portanto ser aumentada eliminando os cálculos numéricos explícitos no interior das regiões não-multiplicativas em torno do núcleo ativo. É discutida nesta dissertação a eficiência computacional de condições de contorno aproximadas tipo albedo na formulação de ordenadas discretas (SN) para problemas de autovalor a dois grupos de energia em geometria bidimensional cartesiana. Albedo, palavra de origem latina para alvura, foi originalmente definido como a fração da luz incidente que é refletida difusamente por uma superfície. Esta palavra latina permaneceu como o termo científico usual em astronomia e nesta dissertação este conceito é estendido para reflexão de nêutrons. Este albedo SN nãoconvencional substitui aproximadamente a região refletora em torno do núcleo ativo do reator, pois os termos de fuga transversal são desprezados no interior do refletor. Se o problema, em particular, não possui termos de fuga transversal, i.e., trata-se de um problema unidimensional, então as condições de contorno albedo, como propostas nesta dissertação, são exatas. Por eficiência computacional entende-se analisar a precisão dos resultados numéricos em comparação com o tempo de execução computacional de cada simulação de um dado problema-modelo. Resultados numéricos para dois problemas-modelo com de simetria são considerados para ilustrar esta análise de eficiência.

Ikasleen jokaera problema matematiko ez estadarren aurrean

[eus] Ikerketa honen helburu nagusia Euskal Herriko bi ikastetxe ezberdinetako Lehen Hezkuntzako umeek problema matematiko ez estandarren aurrean ze nolako erantzun mota ematen dituzten aztertzea da. Horretarako, Laura Jiménezek eta Lieven Verschaffelek egindako lanean oinarrituz, umeei 6 problema (4 ez estandarrak eta 2 estandarrak) dituen froga bat egin diet, ondorio hauek lortuz: Ikasleen %3,29k erantzun zuzena eman dio erantzun gabeko problemari, %7,69k erantzun zuzena eman dio erantzun bat baino gehiago duen problemari, %45,05ek erantzun zuzena eman dio erantzuna enuntziatuan duen problemari eta azkenik, ikasleen %46,15ek erantzun zuzena eman dio datuak soberan dituen problemari. Gainera, nahiz eta ikastetxeen metodologia ezberdina izan, ateratako emaitzak antzekoak dira, beraz, metodologiak ez duela eraginik ondorioztatzen da.

Estudo de crenças e preconceito linguístico em alunos do sexto ano de uma escola do município de Paracambi (RJ)

A necessidade de basear as aulas de Língua Portuguesa na gramática normativa é muito defendida no ambiente escolar. As universidades, por outro lado, aceitam a ideia de que os princípios da Sociolinguística laboviana devem ser introduzidos na educação básica. Dessa maneira, há uma lacuna entre o que se aprende na teoria pedagógica e o que, de fato, ocorre em sala de aula. Buscando encurtar a distância existente entre a teoria linguística e a prática pedagógica, esta pesquisa teve como objetivo apresentar um roteiro de atividades que se relacionam à reflexão por parte dos alunos no que tange a suas crenças linguísticas, principalmente as que apresentam uma vertente preconceituosa. Para isso, foi aplicado um teste de crenças linguísticas com alunos do sexto ano do ensino fundamental de uma escola pública, localizada no município de Paracambi, RJ. Depois foram ministradas quatro aulas a fim de demonstrar aos alunos que a norma popular apresenta uma regularidade, portanto, não é linguisticamente inferior à norma de prestígio. Para finalizar, o mesmo teste de crenças linguísticas foi aplicado nos mesmos alunos. Essa pesquisa, baseada em Cyranka (2007), verificou a viabilidade de um trabalho com a Sociolinguística na escola, procurando avaliar a capacidade de os alunos refletirem sociolinguisticamente

Condições de contorno tipo albedo para cálculos globais de reatores nucleares com o modelo de dois grupos de energia na formulação de transporte SN em geometria bidimensional cartesiana

Os eventos de fissão nuclear, resultados da interação dos nêutrons com os núcleos dos átomos do meio hospedeiro multiplicativo, não estão presentes em algumas regiões dos reatores nucleares, e.g., moderador, refletor, e meios estruturais. Nesses domínios espaciais não há geração de potência nuclear térmica e, além disso, comprometem a eficiência computacional dos cálculos globais de reatores nucleares. Propomos nesta tese uma estratégia visando a aumentar a eficiência computacional dessas simulações eliminando os cálculos numéricos explícitos no interior das regiões não-multiplicativas (baffle e refletor) em torno do núcleo ativo. Apresentamos algumas modelagens e discutimos a eficiência da aplicação dessas condições de contorno aproximadas tipo albedo para uma e duas regiões nãomultiplicativas, na formulação de ordenadas discretas (SN) para problemas de autovalor a dois grupos de energia em geometria bidimensional cartesiana. A denominação Albedo, palavra de origem latina para alvura, foi originalmente definida como a fração da luz incidente que é refletida difusamente por uma superfície. Esta denominação latina permaneceu como o termo científico usual em astronomia e, nesta tese, este conceito é estendido para reflexão de nêutrons. Estas condições de contorno tipo albedo SN não-convencional substituem aproximadamente as regiões de baffle e refletor no em torno do núcleo ativo do reator, desprezando os termos de fuga transversal no interior dessas regiões. Se o problema, em particular, não possui termos de fuga transversal, i.e., trata-se de um problema unidimensional, então as condições de contorno albedo, como propostas nesta tese, são exatas. Por eficiência computacional entende-se a análise da precisão dos resultados numéricos em comparação com o tempo de execução computacional de cada simulação de um dado problema-modelo. Resultados numéricos considerando dois problemas-modelo com de simetria são considerados para ilustrar esta análise de eficiência.

Pb isotope shifts in the relativistic mean field theory

The ground state properties of the Pb isotopic are studied by using the axially deformed relativistic mean field (RMF) calculation with the parameter set TM1. The pairing correlation is treated by the BCS method and the isospin dependent pairing force is used. The 'blocking' method is used to deal with unpaired nucleons. The theoretical results show that the relativistic mean field theory with non-linear self-interactions of mesons provides a good description of the binding energy and neutron separation energy. The present paper focus on the physical mechanism of the Pb isotope shifts.

Natural Language Syntax and First Order Preference

We have argued elsewhere that first order inference can be made more efficient by using non-standard syntax for first order logic. In this paper we show how a fragment of English syntax under Montague semantics provides the foundation of a new inference procedure. This procedure seems more effective than corresponding procedures based on either classical syntax of our previously proposed taxonomic syntax. This observation may provide a functional explanation for some of the syntactic structure of English.

A Connection Between GRBF and MLP

Both multilayer perceptrons (MLP) and Generalized Radial Basis Functions (GRBF) have good approximation properties, theoretically and experimentally. Are they related? The main point of this paper is to show that for normalized inputs, multilayer perceptron networks are radial function networks (albeit with a non-standard radial function). This provides an interpretation of the weights w as centers t of the radial function network, and therefore as equivalent to templates. This insight may be useful for practical applications, including better initialization procedures for MLP. In the remainder of the paper, we discuss the relation between the radial functions that correspond to the sigmoid for normalized inputs and well-behaved radial basis functions, such as the Gaussian. In particular, we observe that the radial function associated with the sigmoid is an activation function that is good approximation to Gaussian basis functions for a range of values of the bias parameter. The implication is that a MLP network can always simulate a Gaussian GRBF network (with the same number of units but less parameters); the converse is true only for certain values of the bias parameter. Numerical experiments indicate that this constraint is not always satisfied in practice by MLP networks trained with backpropagation. Multiscale GRBF networks, on the other hand, can approximate MLP networks with a similar number of parameters.

A Linearization of the Lambda-Calculus and Consequences

If every lambda-abstraction in a lambda-term M binds at most one variable occurrence, then M is said to be "linear". Many questions about linear lambda-terms are relatively easy to answer, e.g. they all are beta-strongly normalizing and all are simply-typable. We extend the syntax of the standard lambda-calculus L to a non-standard lambda-calculus L^ satisfying a linearity condition generalizing the notion in the standard case. Specifically, in L^ a subterm Q of a term M can be applied to several subterms R1,...,Rk in parallel, which we write as (Q. R1 \wedge ... \wedge Rk). The appropriate notion of beta-reduction beta^ for the calculus L^ is such that, if Q is the lambda-abstraction (\lambda x.P) with m\geq 0 bound occurrences of x, the reduction can be carried out provided k = max(m,1). Every M in L^ is thus beta^-SN. We relate standard beta-reduction and non-standard beta^-reduction in several different ways, and draw several consequences, e.g. a new simple proof for the fact that a standard term M is beta-SN iff M can be assigned a so-called "intersection" type ("top" type disallowed).

Phylotastic! Making tree-of-life knowledge accessible, reusable and convenient.

BACKGROUND: Scientists rarely reuse expert knowledge of phylogeny, in spite of years of effort to assemble a great "Tree of Life" (ToL). A notable exception involves the use of Phylomatic, which provides tools to generate custom phylogenies from a large, pre-computed, expert phylogeny of plant taxa. This suggests great potential for a more generalized system that, starting with a query consisting of a list of any known species, would rectify non-standard names, identify expert phylogenies containing the implicated taxa, prune away unneeded parts, and supply branch lengths and annotations, resulting in a custom phylogeny suited to the user's needs. Such a system could become a sustainable community resource if implemented as a distributed system of loosely coupled parts that interact through clearly defined interfaces. RESULTS: With the aim of building such a "phylotastic" system, the NESCent Hackathons, Interoperability, Phylogenies (HIP) working group recruited 2 dozen scientist-programmers to a weeklong programming hackathon in June 2012. During the hackathon (and a three-month follow-up period), 5 teams produced designs, implementations, documentation, presentations, and tests including: (1) a generalized scheme for integrating components; (2) proof-of-concept pruners and controllers; (3) a meta-API for taxonomic name resolution services; (4) a system for storing, finding, and retrieving phylogenies using semantic web technologies for data exchange, storage, and querying; (5) an innovative new service, DateLife.org, which synthesizes pre-computed, time-calibrated phylogenies to assign ages to nodes; and (6) demonstration projects. These outcomes are accessible via a public code repository (GitHub.com), a website (http://www.phylotastic.org), and a server image. CONCLUSIONS: Approximately 9 person-months of effort (centered on a software development hackathon) resulted in the design and implementation of proof-of-concept software for 4 core phylotastic components, 3 controllers, and 3 end-user demonstration tools. While these products have substantial limitations, they suggest considerable potential for a distributed system that makes phylogenetic knowledge readily accessible in computable form. Widespread use of phylotastic systems will create an electronic marketplace for sharing phylogenetic knowledge that will spur innovation in other areas of the ToL enterprise, such as annotation of sources and methods and third-party methods of quality assessment.