Evaluation of antioxidant level and protein oxidation of rainbow trout (Oncorhynchus mykiss) fillets during rigor and post-rigor

In this study, the relationship between stunning techniques and protein oxidation which are accepted as the main cause of food spoilage was investigated. For this purpose, the antioxidant status, in vivo myofibrillary protein (MP) oxidation and sensitivity, and postmortem oxidation (inducted with hydroxyl radical system) of rainbow trout (Oncorhynchus mykiss) fillets killed by hitting to head (T1), neck crushing (T2), and convulsion (T3) methods, were investigated. Statistically significant differences (p < .05) were found among all parameters examined and it was observed that the most stressing technique was the convulsion method. It was determined that in protein profiles myosin were influenced too much from stunning technique and in actin observed oxidation-induced reductions. Reductions in S-S and S-H were also found to be increased in carbonyl concentrations, but the most effective values in both processes were determined by the convulsive technique. Our results show that short-term stunning techniques (hitting to head, neck crushing) give better meat quality results in terms of O. mykiss welfare and low MP oxidation rates. In general, we can say that T3 group fillets are more sensitive to oxidative damage, while T1 and T2 groups give better results in maintaining meat quality with low MP oxidation rates.     

Efficient fault-tolerant collision-free data aggregation scheduling for wireless sensor networks

This paper investigates the design of fault-tolerant TDMA-based data aggregation scheduling (DAS) protocols for wireless sensor networks (WSNs). DAS is a fundamental pattern of communication in wireless sensor networks where sensor nodes aggregate and relay data to a sink node. However, any such DAS protocol needs to be cognisant of the fact that crash failures can occur. We make the following contributions: (i) we identify a necessary condition to solve the DAS problem, (ii) we introduce a strong and weak version of the DAS problem, (iii) we show several impossibility results due to the crash failures, (iv) we develop a modular local algorithm that solves stabilising weak DAS and (v) we show, through simulations and an actual deployment on a small testbed, how specific instantiations of parameters can lead to the algorithm achieving very efficient stabilisation.     

Infrared spectroscopic investigation of tannins

Infrared spectroscopy is suggested as a diagnostic method for the characterisation and qualitative estimation of the two classes of tannins. Gallic acid, tannic acid and chebulinic acid have been taken as model compounds for the hydrolysable and catechin for the condensed tannins. The former class is marked by the presence of strong absorption maxima at 1710 – 35 cm^?1. The two classes have characteristic pattern of absorption, from which it is possible to characterise the particular type of tannin.     

Transfer learning in deep neural network-based receiver coil sensitivity map estimation

Magnetic Resonance Materials in Physics, Biology and Medicine - The success of parallel Magnetic Resonance Imaging algorithms like SENSitivity Encoding (SENSE) depends on an accurate estimation of...     

Detection of COVID-19 and its pulmonary stage using Bayesian hyperparameter optimization and deep feature selection methods

Since the first case of COVID-19 was reported in December 2019, many studies have been carried out on artificial intelligence for the rapid diagnosis of the disease to support health services. Therefore, in this study, we present a powerful approach to detect COVID-19 and COVID-19 findings from computed tomography images using pre-trained models using two different datasets. COVID-19, influenza A (H1N1) pneumonia, bacterial pneumonia and healthy lung image classes were used in the first dataset. Consolidation, crazy-paving pattern, ground-glass opacity, ground-glass opacity and consolidation, ground-glass opacity and nodule classes were used in the second dataset. The study consists of four steps. In the first two steps, distinctive features were extracted from the final layers of the pre-trained ShuffleNet, GoogLeNet and MobileNetV2 models trained with the datasets. In the next steps, the most relevant features were selected from the models using the Sine–Cosine optimization algorithm. Then, the hyperparameters of the Support Vector Machines were optimized with the Bayesian optimization algorithm and used to reclassify the feature subset that achieved the highest accuracy in the third step. The overall accuracy obtained for the first and second datasets is 99.46% and 99.82%, respectively. Finally, the performance of the results visualized with Occlusion Sensitivity Maps was compared with Gradient-weighted class activation mapping. The approach proposed in this paper outperformed other methods in detecting COVID-19 from multiclass viral pneumonia. Moreover, detecting the stages of COVID-19 in the lungs was an innovative and successful approach.     

Scientific Workflow Makespan Minimization in Edge Multiple Service Providers Environment

The edge computing model offers an ultimate platform to support scientific and real-time workflow-based applications over the edge of the network. However, scientific workflow scheduling and execution still facing challenges such as response time management and latency time. This leads to deal with the acquisition delay of servers, deployed at the edge of a network and reduces the overall completion time of workflow. Previous studies show that existing scheduling methods consider the static performance of the server and ignore the impact of resource acquisition delay when scheduling workflow tasks. Our proposed method presented a meta-heuristic algorithm to schedule the scientific workflow and minimize the overall completion time by properly managing the acquisition and transmission delays. We carry out extensive experiments and evaluations based on commercial clouds and various scientific workflow templates. The proposed method has approximately 7.7% better performance than the baseline algorithms, particularly in overall deadline constraint that gives a success rate.