Let f(z) be a function analytic in the complex domain C+∪C−∪(−1,+∞), real for real z and such that f(z), f2(z) are anti-Herglotz functions. In this paper we show that f(z) possesses simple upper and lower bounds given by rational functions. Our main tool is the analytic theory of continued fractions. An application to the theory of solutions of the Feigenbaum-Cvitanović equation is given.

We present a simple protocol for two-player secure circuit evaluation. The protocol enables players C and D to cooperate in the computation of f(x) while D conceals her data x from C and C conceals his circuit for f from D. The protocol is based on the technique of hiding information from an oracle [Abadi, Feigenbaum, Kilian, J. Comput. System Sci. 39(1):21{50, August, 1989].

In this paper, we develop a new approach to the construction of solutions of the Feigenbaum-Cvitanović equation whose existence was shown by H. Epstein. Our main tool is the analytic theory of continued fractions.

We build a Markov partition of the Feigenbaum dynamical plane, and a system of “external rays”, which are invariant under rescaling. Applications to geometry of the Feigenbaum map are given.

the acid-base equilibrium of lorazepam was studied by means of potentiometry andmultiwavelengths spectrophotometry. the stoichiometric equilibrium constants were determinedat 25 °c and constant ionic strength 0.1 mol l-1 (nacl). the acidity constants pk1=1.58±0.05and pk2=11.67±0.07 were found by potentiometry, and pk1=1.54±0.02 and pk2=11.61±0.03 bymulti-wavelengths spectrophotometry. potentiom...

Remotely keyed encryption (RKE) schemes provide fast symmetric encryption and decryption using a small-bandwidth security module and a powerful host. Such schemes keep the key inside the security module to prevent key compromise. Shin, Shin, and Rhee proposed a length-preserving as well as a length-increasing RKE scheme that both use only a single round of interaction between host and security ...

An essential problem in music information retrieval is to determine the similarity between two given melodies; there are several melodic similarity measures that have been proposed, among others, the Mongeau-Sankoff measure. In this work we implemented a modified version of the Mongeau-Sankoff measure. We conducted an experimental study to compare the implemented measure with other similarity m...

It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over an alphabet of size σ converges to a constant γσ,d. We disprove a speculation by Steele regarding a possible relation between γ2,d and γ2,2. In order to do that we also obtain some new lower bounds for γσ,d, when both σ and d are small integers.