Experimental study on mechanical properties of pumpkin tissue

Purpose: The purpose of this study was to calculate mechanical properties of tough skinned vegetables as a part of Finite Element Modelling (FEM) and simulation of tissue damage during mechanical peeling of tough skinned vegetables. Design/methodology: There are some previous studies on mechanical properties of fruits and vegetables however, behaviour of tissue under different processing operations will be different. In this study indentation test was performed on Peel, Flesh and Unpeeled samples of pumpkin as a tough skinned vegetable. Additionally, the test performed in three different loading rates for peel: 1.25, 10, 20 mm/min and 20 mm/min for flesh and unpeeled samples respectively. The spherical end indenter with 8mm diameter used for the experimental tests. Samples prepare from defect free and ripped pumpkin purchased from local shops in Brisbane, Australia. Humidity and temperature were 20-55% and 20-250C respectively. Findings: Consequently, force deformation and stress and strain of samples were calculated and shown in presented figures. Relative contribution (%) of skin to different mechanical properties is computed and compared with data available from literature. According the results, peel samples had the highest value of rupture force (291N) and as well as highest value of firmness (1411Nm-1). Research limitations/implications: The proposed study focused on one type of tough skinned vegetables and one variety of pumpkin however, more tests will give better understandings of behaviours of tissue. Additionally, the behaviours of peel, unpeeled and flesh samples in different speed of loading will provide more details of tissue damages during mechanical loading. Originality/value: Mechanical properties of pumpkin tissue calculated using the results of indentation test, specifically the behaviours of peel, flesh and unpeeled samples were explored which is a new approach in Finite Element Modelling (FEM) of food processes. Keywords: Finite Element Modelling (FEM), relative contribution, firmness, toughness and rupture force

Synchronizing Data Words for Register Automata

Register automata (RAs) are finite automata extended with a finite set of registers to store and compare data from an infinite domain. We study the concept of synchronizing data words in RAs: does there exist a data word that sends all states of the RA to a single state? For deterministic RAs with k registers (k-DRAs), we prove that inputting data words with 2k+1 distinct data from the infinite data domain is sufficient to synchronize. We show that the synchronization problem for DRAs is in general PSPACE-complete, and it is NLOGSPACE-complete for 1-DRAs. For nondeterministic RAs (NRAs), we show that Ackermann(n) distinct data (where n is the size of the RA) might be necessary to synchronize. The synchronization problem for NRAs is in general undecidable, however, we establish Ackermann-completeness of the problem for 1-NRAs. Another main result is the NEXPTIME-completeness of the length-bounded synchronization problem for NRAs, where a bound on the length of the synchronizing data word, written in binary, is given. A variant of this last construction allows to prove that the length-bounded universality problem for NRAs is co-NEXPTIME-complete

On cohomological dimension and depth under linkage

Some relations between cohomological dimensions and depths of linked ideals are investigated and discussed by various examples.Comment: 7 page

Infinite Synchronizing Words for Probabilistic Automata (Erratum)

In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the decidability result of [1-3] for the emptiness problem of weakly synchronizing language is incorrect.Comment: 5 pages, 3 figure

Revisiting Reachability in Timed Automata

We revisit a fundamental result in real-time verification, namely that the binary reachability relation between configurations of a given timed automaton is definable in linear arithmetic over the integers and reals. In this paper we give a new and simpler proof of this result, building on the well-known reachability analysis of timed automata involving difference bound matrices. Using this new proof, we give an exponential-space procedure for model checking the reachability fragment of the logic parametric TCTL. Finally we show that the latter problem is NEXPTIME-hard