An instantaneous rigid force model for prediction of cutting forces in ball-end milling of  sculptured surfaces is presented in this paper. A commercially available geometric engine is used to represent the cutting edge, cutter and updated part geometries. The cutter used in this work is an insert type ball-end mill. Intersecting an inclined plane with the cutter ball nose generates the cutting...

The stability behavior of low immersion helical end milling processes is investigated in this paper. Low radial immersion milling operations involve interrupted cutting which induces chatter vibration under certain cutting conditions. Time Finite Element Analysis (TFEA) is suggested for an approximate solution for delayed differential equations encountered during interrupted milling. An improve...

For decades researchers have struggled with the problem of envy-free cake cutting: how to divide a divisible good between multiple agents so that each agent likes his own allocation best. Although an envy-free cake cutting protocol was ultimately devised, it is unbounded, in the sense that the number of operations can be arbitrarily large, depending on the preferences of the agents. We ask whet...

I) Given a segment-cuttable polygon P drawn on a planar piece of material Q, we show how to cut P out of Q by a (short) segment saw with a total length of the cuts no more than 2.5 times the optimal. We revise the algorithm of Demaine et al. (2001) so as to achieve this ratio. (II) We prove that any collection R of n disjoint1 axis-parallel rectangles drawn on a planar piece of material Q is cu...

This paper proposes a cake-cutting protocol using cryptography when the cake is a heterogeneous good that is represented by an interval on a real line. Although the Dubins-Spanier moving-knife protocol with one knife achieves simple fairness, all players must execute the protocol synchronously. Thus, the protocol cannot be executed on asynchronous networks such as the Internet. We show that the...

With the objective of minimizing the total execution time of a parallel program on a distributed memory parallel computer, this paper discusses how to nd an optimal supernode size and optimal supernode relative side lengths of a supernode transformation (also known as tiling). We identify three parameters of supernode transformation: supernode size, relative side lengths, and cutting hyperplane...