This EIC message brings attention to a cybercrime worse than having your identity stolen—catfishing attempts toward children while they are playing video games. Our (and parents) need be warned.

A set U of vertices of a graph G is called a geodetic set if the union of all the geodesics joining pairs of points of U is the whole graph G. One result in this paper is a tight lower bound on the minimum number of vertices in a geodetic set. In order to obtain that result, the following extremal set problem is solved. Find the minimum cardinality of a collection S of subsets of 1⁄2n 1⁄4 f1; 2...

The goal of this work is to clarify images of traffic scenes that are degraded by natural causes such as fog, rain and limited visibility during the night. For these applications, it is next to impossible to get pixel perfect pairs of the same scene, with and without the degrading conditions. This makes it unsuitable for conventional supervised learning approaches. It is however easy to collect...

In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super-simple designs are also useful in constructing codes and designs such as superimposed codes and perfect hash families. The existence of super-simple (v, 4, λ)BIBDs have been determined for λ = 2, 3, 4, 5, 6. In this paper, we investigate the existence...

Let S be a set of functions with common domain D. We say X, a subset of D, an interpolation set for S if the values on X uniquely determine a function f in S. Recently, Piotr Indyk gave an explicit construction of interpolation sets of size O(k log n) for the family of boolean functions on n variables which depend symmetrically on at most k variables. Using perfect hash families, we have a vari...

We discuss a relative of the perfect numbers for which it is possible to prove that there are infinitely many examples. Call a natural number n prime-perfect if n and σ(n) share the same set of distinct prime divisors. For example, all even perfect numbers are prime-perfect. We show that the count Nσ(x) of prime-perfect numbers in [1, x] satisfies estimates of the form exp((log x) log log log )...

In this study, a steady, incompressible, and laminar-free convective flow of a two-dimensional electrically conducting viscoelastic fluid over a moving stretching surface through a porous medium is considered. The boundary-layer equations are derived by considering Boussinesq and boundary-layer approximations. The nonlinear ordinary differential equations for the momentum and energy equations a...

This paper describes the development of an experience factory in an Australian organization involved in the field of telecommunications. Faced with improvement needs, in 1998 the organization placed special attention on approaches to support improvement activities. Towards the end of 1998 a project was started between the company and the Centre for Advanced Empirical Software Research (CAESAR) ...

In this chapter, we focus on finite two-player non-zero-sum stochastic games. Following the notations used in earlier chapters, we let S be the state space, and A and B be the action sets of players 1 and 2 respectively. All three sets S,A and B are finite. Generic elements of S, A and B will be denoted by z, a and b. We let p(·|z, a, b) be the transition function of the game and r : S × A× B →...