Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 2

Liczba wyników na stronie

Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

Slot machining of TI6AL4V with trochoidal milling technique

Patil P., Polishetty A., Goldberg M., Littlefair G., Nomani J.

Journal of Machine Engineering

2014

Vol. 14, No. 4

42--54

Titanium usage for aerospace growing day by day as application of titanium and its alloys covers wide range. Most of the aerospace components made up of wall structure involves lot of pocket slot milling since those components are monolithic components, eliminating need to manufacture multiple pieces for assembly into one final part. The increasing complexity of titanium parts used in aviation industry, increasing demand for productive manufacturing methods like trochoidal milling. This paper aims at evaluating its potential in slot milling for Ti6Al4V component by conducting experiments on 5-axis CNC machine. This study focuses on Productivity, Quality and Machine Tool Dynamics.

There and Back Again

Danvy O., Goldberg M.

Fundamenta Informaticae

2005

Vol. 66, nr 4

397--413

We present a programming pattern where a recursive function defined over a data structure traverses another data structure at return time. The idea is that the recursive calls get us `there' by traversing the first data structure and the returns get us `back again' while traversing the second data structure. We name this programming pattern of traversing a data structure at call time and another data structure at return time "There And Back Again" (TABA). The TABA pattern directly applies to computing symbolic convolutions and to multiplying polynomials. It also blends well with other programming patterns such as dynamic programming and traversing a list at double speed. We illustrate TABA and dynamic programming with Catalan numbers. We illustrate TABA and traversing a list at double speed with palindromes and we obtain a novel solution to this traditional exercise. Finally, through a variety of tree traversals, we show how to apply TABA to other data structures than lists. A TABA-based function written in direct style makes full use of an ALGOL-like control stack and needs no heap allocation. Conversely, in a TABA-based function written in continuation-passing style and recursively defined over a data structure (traversed at call time), the continuation acts as an iterator over a second data structure (traversed at return time). In general, the TABA pattern saves one from accumulating intermediate data structures at call time.