CONSTRUCTION OF SOME KIESSWETTER-LIKE FUNCTIONS-THE CONTINUOUS BUT NON-DIFFERENTIABLE FUNCTION DEFINED BY QUINARY DECIMAL

In this paper, we construct some continuous but non-differentiable functions defined by quinary decimal, that are Kiesswetter-like functions. We discuss their properties, then investigate the Hausdorff dimensions of graphs of these functions and give a detailed proof.     

Solving of second order nonlinear PDE problems by using artificial controls with controlled error

In this paper, we find the approximate solution of a second order nonlinear partial differential equation on a simple connected region inR ². We transfer this problem to a new problem of second order nonlinear partial differential equation on a rectangle. Then, we transformed the later one to an equivalent optimization problem. Then we consider the optimization problem as a distributed parameter system with artificial controls. Finally, by using the theory of measure, we obtain the approximate solution of the original problem. In this paper also the global error inL ₁ is controlled.     

Theory of Linear Dissipative Scattering Systems with Discrete Time and with Space States of the Class π k

An arbitrary operator-valued function from the generalized Shur class is realized as the transfer function of a minimal optimal and minimal *-optimal dissipative scattering system with the Pontryagin state space. These results generalize Arov's results for the case of the Hilbert state space. Bibliography: 11 titles.     

Discrete mathematics in primary and secondary schools in the United States

This article provides a status report on discrete mathematics in America's schools, including an overview of publications and programs that have had major impact. It discusses why discrete mathematics should be introduced in the schools and the authors' efforts to advocate, facilitate, and support the adoption of discrete mathematics topics in the schools. Their perspective is that discrete mathematics should be viewed not only as a collection of new and interesting mathematical topics, but, more importantly, as a vehicle for providing teachers with a new way to think about traditional mathematical topics and new strategies for engaging their students in the study of mathematics.     

Numerical Modeling of Solitons in a Low Birefringent Optical Fiber

A numerical investigation, based on the split-step Fourier transform algorithm of all optical switching of solitons in a low birefringent optical fiber is presented. The numerical algorithm is described in detail. This revised version was published online in August 2006 with corrections to the Cover Date.     

Lot-sizing with fixed charges on stocks: the convex hull

In this paper, we examine a variant of the uncapacitated lot-sizing model of Wagner–Whitin that includes fixed charges on the stocks. Such a model is natural in a production environment where stocking is a complex operation, and appears as a subproblem in more general network design problems.

Linear-programming formulations, a dynamic program, the convex hull of integer solutions and a separation algorithm are presented. All these turn out to be very natural extensions of the corresponding results of Barany et al. (Math. Programming Stud. 22 (1984) 32) for the uncapacitated lot-sizing problem. The convex hull proof is based on showing that an extended facility location formulation is tight and by projecting it onto the original space of variables.     

The horocycle flow without minimal sets

We construct an example of a Fuchsian group such that the corresponding horocycle flow has no minimal sets. To cite this article: M. Kulikov, C. R. Acad. Sci. Paris, Ser. I 338 (2004).     

Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem

In this work, the NP-hard maximum clique problem on graphs is considered. Starting from basic greedy heuristics, modifications and improvements are proposed and combined in a two-phase heuristic procedure. In the first phase an improved greedy procedure is applied starting from each node of the graph; on the basis of the results of this phase a reduced subset of nodes is selected and an adaptive greedy algorithm is repeatedly started to build cliques around such nodes. In each restart the selection of nodes is biased by the maximal clique generated in the previous execution. Computational results are reported on the DIMACS benchmarks suite. Remarkably, the two-phase procedure successfully solves the difficult Brockington-Culberson instances, and is generally competitive with state-of-the-art much more complex heuristics.