Performance Evaluation and Optimization of a Palm Kernel Cracker – A Taguchi-Grey Relational Analysis Approach
Bibliographic record
Abstract
The palm kernel cracking machine plays an important role in the palm oil and kernel oil processing industries for removing kernels from the outer shells.The parameters of the machine operation are required to be optimized to achieve the best machine efficiency.This study optimizes a palm kernel cracker using the Taguchi-Grey relational analysis approach.A L9 orthogonal array was used for the experimental design using two factors at three levels (speed -1000, 1200, and 1400 rpm; weight -2, 4, and 6 kg).Analysis of variance and regression analysis were done.The results revealed that the machine's efficiency greatly influences the rotation speed compared to the nuts' weight.The throughput capacity was higher at higher weight and lower cracking time.For most of the responses, the weight of the palm kernel nuts was ranked more important than the machine's rotation speed.For the optimization, optimum cracking efficiency was at 1000 rpm speed and 4 kg weight; optimum throughput capacity and optimum labour requirement were obtained at 1000 rpm speed and 6 kg weight, respectively.Mathematical models were developed for all responses using the input parameters.The experimental values and the predicted optimum results were determined to be close based on the processing conditions.Also, the mathematical models suitably predicted the performance of the developed palm kernel cracking machine.
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.002 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 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".