Solitary waves and their stability in colloidal media: semi-analytical solutions

Spatial solitary waves in colloidal suspensions of spherical dielectric nanoparticles are considered. The interaction of the nanoparticles is modelled as a hard-sphere gas, with the Carnahan-Starling formula used for the gas compressibility. Semi-analytical solutions, for both one and two spatial dimensions, are derived using an averaged Lagrangian and suitable trial functions for the solitary waves. Power versus propagation constant curves and neutral stability curves are obtained for both cases, which illustrate that multiple solution branches occur for both the one and two dimensional geometries. For the one-dimensional case it is found that three solution branches (with a bistable regime) occur, while for the two-dimensional case two solution branches (with a single stable branch) occur in the limit of low background packing fractions. For high background packing fractions the power versus propagation constant curves are monotonic and the solitary waves stable for all parameter values. Comparisons are made between the semi-analytical and numerical solutions, with excellent comparison obtained.Comment: Paper to appear in Dynamics of Continuous, Discrete and Impulsive Systems, Series

User evaluation outside the lab: the trial of Físchlár-News

A user study of Físchlár-News system was conducted in Spring 2004 with 16 users, each user using the system for a 1-month period. Físchlár-News is an experimental online news archive that incorporates various automatic content-based video indexing techniques and a news story recommender algorithm to process and index the daily 9 o’clock broadcast news from TV and allows its users to browse, search, be recommended, and play news stories on a conventional web browser. Pre and post-trial questionnaires, interaction logging and incident diary methods collected both qualitative and quantitative usage data during the trial period. While the details of the findings from this evaluation is reported elsewhere, in this paper we report the details of the methodology taken and our experience of conducting this evaluation

On the Parikh-de-Bruijn grid

We introduce the Parikh-de-Bruijn grid, a graph whose vertices are fixed-order Parikh vectors, and whose edges are given by a simple shift operation. This graph gives structural insight into the nature of sets of Parikh vectors as well as that of the Parikh set of a given string. We show its utility by proving some results on Parikh-de-Bruijn strings, the abelian analog of de-Bruijn sequences.Comment: 18 pages, 3 figures, 1 tabl

Inferring an Indeterminate String from a Prefix Graph

An \itbf{indeterminate string} (or, more simply, just a \itbf{string}) \s{x} = \s{x}[1..n] on an alphabet $\Sigma$ is a sequence of nonempty subsets of $\Sigma$. We say that \s{x}[i_1] and \s{x}[i_2] \itbf{match} (written \s{x}[i_1] \match \s{x}[i_2]) if and only if \s{x}[i_1] \cap \s{x}[i_2] \ne \emptyset. A \itbf{feasible array} is an array \s{y} = \s{y}[1..n] of integers such that \s{y}[1] = n and for every $i \in 2..n$, \s{y}[i] \in 0..n\- i\+ 1. A \itbf{prefix table} of a string \s{x} is an array \s{\pi} = \s{\pi}[1..n] of integers such that, for every $i \in 1..n$, \s{\pi}[i] = j if and only if \s{x}[i..i\+ j\- 1] is the longest substring at position $i$ of \s{x} that matches a prefix of \s{x}. It is known from \cite{CRSW13} that every feasible array is a prefix table of some indetermintate string. A \itbf{prefix graph} \mathcal{P} = \mathcal{P}_{\s{y}} is a labelled simple graph whose structure is determined by a feasible array \s{y}. In this paper we show, given a feasible array \s{y}, how to use \mathcal{P}_{\s{y}} to construct a lexicographically least indeterminate string on a minimum alphabet whose prefix table \s{\pi} = \s{y}.Comment: 13 pages, 1 figur

Computing Covers Using Prefix Tables

An \emph{indeterminate string} $x = x[1..n]$ on an alphabet $\Sigma$ is a sequence of nonempty subsets of $\Sigma$; $x$ is said to be \emph{regular} if every subset is of size one. A proper substring $u$ of regular $x$ is said to be a \emph{cover} of $x$ iff for every $i \in 1..n$, an occurrence of $u$ in $x$ includes $x[i]$. The \emph{cover array} $\gamma = \gamma[1..n]$ of $x$ is an integer array such that $\gamma[i]$ is the longest cover of $x[1..i]$. Fifteen years ago a complex, though nevertheless linear-time, algorithm was proposed to compute the cover array of regular $x$ based on prior computation of the border array of $x$. In this paper we first describe a linear-time algorithm to compute the cover array of regular string $x$ based on the prefix table of $x$. We then extend this result to indeterminate strings.Comment: 14 pages, 1 figur

Data management study, volume 5. Appendix E - Contractor data package quality assurance /QA/ Final report

Manufacturing verification tests for quality assurance and control data management on Voyager spacecraf

Transcritical shallow-water flow past topography: finite-amplitude theory

We consider shallow-water flow past a broad bottom ridge, localized in the flow direction, using the framework of the forced SuGardner (SG) system of equations, with a primary focus on the transcritical regime when the Froude number of the oncoming flow is close to unity. These equations are an asymptotic long-wave approximation of the full Euler system, obtained without a simultaneous expansion in the wave amplitude, and hence are expected to be superior to the usual weakly nonlinear Boussinesq-type models in reproducing the quantitative features of fully nonlinear shallow-water flows. A combination of the local transcritical hydraulic solution over the localized topography, which produces upstream and downstream hydraulic jumps, and unsteady undular bore solutions describing the resolution of these hydraulic jumps, is used to describe various flow regimes depending on the combination of the topography height and the Froude number. We take advantage of the recently developed modulation theory of SG undular bores to derive the main parameters of transcritical fully nonlinear shallow-water flow, such as the leading solitary wave amplitudes for the upstream and downstream undular bores, the speeds of the undular bores edges and the drag force. Our results confirm that most of the features of the previously developed description in the framework of the unidirectional forced Kortewegde Vries (KdV) model hold up qualitatively for finite amplitude waves, while the quantitative description can be obtained in the framework of the bidirectional forced SG system. Our analytic solutions agree with numerical simulations of the forced SG equations within the range of applicability of these equations