The assessment of moisture loss from meat during the aging period is a critical issue for the meat industry. In this article, a non-invasive microwave ring-resonator sensor is presented to evaluate the moisture content, or more precisely water holding capacity (WHC) of broiler meat over a four-week period. The developed sensor has shown significant changes in its resonance frequency and return loss due to reduction in WHC in the studied duration. The obtained results are also confirmed by physical measurements. Further, these results are evaluated using the Fricke model, which provides a good fit for electric circuit components in biological tissue. Significant changes were observed in membrane integrity, where the corresponding capacitance decreases 30% in the early aging (0D-7D) period. Similarly, the losses associated with intracellular and extracellular fluids exhibit changed up to 42% and 53%, respectively. Ultimately, empirical polynomial models are developed to predict the electrical component values for a better understanding of aging effects. The measured and calculated values are found to be in good agreement.
The Sine-Cosine algorithm (SCA) is a population-based metaheuristic algorithm utilizing sine and cosine functions to perform search. To enable the search process, SCA incorporates several search parameters. But sometimes, these parameters make the search in SCA vulnerable to local minima/maxima. To overcome this problem, a new Multi Sine-Cosine algorithm (MSCA) is proposed in this paper. MSCA utilizes multiple swarm clusters to diversify & intensify the search in-order to avoid the local minima/maxima problem. Secondly, during update MSCA also checks for better search clusters that offer convergence to global minima effectively. To assess its performance, we tested the MSCA on unimodal, multimodal and composite benchmark functions taken from the literature. Experimental results reveal that the MSCA is statistically superior with regards to convergence as compared to recent state-of-the-art metaheuristic algorithms, including the original SCA.
Team formation (TF) in social networks exploits graphs (i.e., vertices = experts and edges = skills) to represent a possible collaboration between the experts. These networks lead us towards building cost-effective research teams irrespective of the geolocation of the experts and the size of the dataset. Previously, large datasets were not closely inspected for the large-scale distributions & relationships among the researchers, resulting in the algorithms failing to scale well on the data. Therefore, this paper presents a novel TF algorithm for expert team formation called SSR-TF based on two metrics; communication cost and graph reduction, that will become a basis for future TF's. In SSR-TF, communication cost finds the possibility of collaboration between researchers. The graph reduction scales the large data to only appropriate skills and the experts, resulting in real-time extraction of experts for collaboration. This approach is tested on five organic and benchmark datasets, i.e., UMP, DBLP, ACM, IMDB, and Bibsonomy. The SSR-TF algorithm is able to build cost-effective teams with the most appropriate experts-resulting in the formation of more communicative teams with high expertise levels.