We show short time existence and uniqueness of C solutions to the mean curvature ow with obstacles, when the obstacles are of class C. If the initial interface is a periodic graph we show long time existence of the evolution and convergence to a minimal constrained hypersurface.

We study a simple, kinematical model of a galactic fountain ow and show that a horizontal eld in the galactic plane can be pumped into the halo to a height of several kiloparsecs. This pumping eeect results from the topological structure of the ow in which the updraughts (represented by hot gas) form a connected network, whereas the downdraughts (associated with isolated cool clouds) are discon...

We describe an algorithm that generates prime implicates of equational clause sets without variables and function symbols. The procedure is based on constrained superposition rules, where constraints are used to store literals that are asserted as additional axioms (or hypotheses) during the proof search. This approach is sound and deductive-complete, and it is more e cient than previous algori...

We introduce the concept of a trust network—a decentralized payment infrastructure in which payments are routed as IOUs between trusted entities. The trust network has directed links between pairs of agents, with capacities that are related to the credit an agent is willing to extend another; payments may be routed between any two agents that are connected by a path in the network. The network ...

By means of He's homotopy perturbation method (HPM) an approximate solution of velocity eld is derived for the ow in straight pipes of non-Newtonian uid obeying the Sisko model. The nonlinear equations governing the ow in pipe are for- mulated and analyzed, using homotopy perturbation method due to He. Furthermore, the obtained solutions for velocity eld is graphically sketched...

Many code generator generators use tree pattern matching and dynamic programming. This note describes a simple program that generates matchers that are fast, compact, and easy to understand. It is simpler than common alternatives: 200{700 lines of Icon versus 3000 lines of C for Twig and 5000 for burg. Its matchers run up to 25 times faster than Twig's. They are necessarily slower than burg's B...

The recently introduced compressed sensing (CS) framework enables low complexity video acquisition via subNyquist rate sampling. In practice, the resulting CS samples are quantized and indexed by finitely many bits (bit-depth) for transmission. In applications where the bit-budget for video transmission is constrained, ratedistortion optimization (RDO) is essential for quality video reconstruct...

Real-time bidding (RTB) is almost the most important mechanism in online display advertising, where proper bid for each page view plays a vital and essential role for good marketing results. Budget constrained bidding is a typical scenario in RTB mechanism where the advertisers hope to maximize total value of winning impressions under a pre-set budget constraint. However, the optimal strategy i...

We examine the local dynamics of nonisothermal viscous ows in the neighborhood of the constant equilibria using the thermomechanically consistent constrained theory for materials with prescribed temperature-dependent density developed by Cao et al. (1996). We discover that the linearized growth rate of small length scale, innnitesimal disturbances near the equilibria is proportional to the reci...

Kalyanmoy Deb and Samir Agrawal Kanpur Genetic Algorithms Laboratory (KanGAL), Department of Mechanical Engineering, Indian Institute of Technology Kanpur, PIN 208 016, India E-mail: deb,samira @iitk.ac.in Abstract Most applications of genetic algorithms (GAs) in handling constraints use a straightforward penalty function method. Such techniques involve penalty parameters which must be set righ...