Tool Wear Improvement in Face-Hobbing of Bevel Gears by Re-designing the Cutting Blades
Bibliographic record
Abstract
Bevel and hypoid gears are manufactured by two main processes, face-milling and face-hobbing. In both processes, blade sticks on the cutter head are prone to be worn out at the corner of the cutting edges. Tool wear can cause unpredictable shut down in production line. By controlling and improving the tool wear, the manufacturing efficiency can be increased. A few researches on the tool wear in bevel gear manufacturing processes were done and the only suggested way to improve the tool wear characteristic was to change the gear design which applies limitations in the gear design stage. Large changes in gradients of the working rake and relief angles along the cutting edge are the important geometrical related factor in the tool wear. In this paper, first, full mathematical representation of the blade including the cutting edge and rake and relief surfaces are presented which it cannot be found in literature. Then, a new method is presented to improve the tool wear characteristics by decreasing the gradients of the working rake and relief angles. In order to validate the better tool wear characteristic of the new blade, FEA machining simulations are conducted on both the proposed and conventional blades. The simulations show great improvements in the tool wear characteristics of the new designed blade in comparison with conventional one.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".