We present an implementation that turns out to be most efficient in practice to compute singular moduli within a fixed floating point precision. First, we show how to efficiently determine the Fourier coefficients of the modular function j and related functions γ2, f2, and η. Comparing several alternative methods for computing singular moduli, we show that in practice the computation via the η-...

Consider an i.i.d. sequence of random variables whose distribution f lies in one of a nested family of models (Mq)q∈N, Mq ⊂ Mq+1. The smallest index q such that Mq⋆ contains f is called the model order. We establish strong consistency of the penalized likelihood order estimator in a general setting with penalties of order η(q) log log n, where η(q) is a dimensional quantity. Moreover, such pena...

This paper gives an overview of cryptographically strong mass application invisibility in digital communication. It summarizes principles and methodology, clariies terminology, and deenes some new concepts. A new algorithm for hiding bit selection in digital images is proposed and an experimental implementation of the algorithm is described. Finally, the paper closes with a discussion of the im...

In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algorithms, we have observed that updating first replicas having most demand, a greater number of clients would gain access to updated content in a shorter period of time. In this work we have investigated the benefits th...

SGS is a compact sentence generation system. Inputs are the frames and specifications of a sentence. Programs attached to context free rules carry out the generation task. Output is a surface sentence with an associated derivation tree. suitable laws for a computer from lingistic phenomena. Therefore, this paper first describes the overall organization of SGS, secondly explains the linguistic s...

In west coast groundfish stock assessments, biological productivity is largely defined by a single parameter, i.e., steepness (h) of the Beverton-Holt spawner-recruit curve, which ranges from 0.20 (no compensation) to 1.00 (complete compensation). A steepness of 0.20 implies no latent surplus production and a total lack of resilience to the effects of exploitation, whereas a value of 1.0 implie...