To determine the average tenderness and sensory ratings of beef subprimal cuts sold in retail cases across the United States, retail cuts were purchased through typical retail outlets in 14 metropolitan cities and transported to Texas A&M University for sensory and Warner-Bratzler shear analysis. The overall mean shear force for all cuts was 3.65 kg, and the mean shear force values for chuck, r...

In his pioneering papers, Igor Zaslavsky started an algorithmic (constructivist) analysis of fuzzy logic. In this paper, we extend this analysis to fuzzy mathematics and fuzzy data processing. Specifically, we show that the two mathematically equivalent representations of a fuzzy number – by a membership function and by α-cuts – are not algorithmically equivalent, and only the α-cut representat...

This study analyzes the trade-off relationship between layoffs and wage cuts. If the introduction of a performance-based payment system stimulates workers’ pecuniarymotivated minds, their morale can be damaged more severely by wage cuts than prior to the introduction thereof. Utilizing this idea, we demonstrate theoretically that the more heavily wages are based on performance, the more firms, ...

We study the watersheds in edge-weighted graphs. Contrarily to previous works, we define the watersheds following the intuitive idea of drops of water flowing on a topographic surface. We establish the consistency (with respect to characterizations of the catchment basins and dividing lines) of these watersheds, prove their optimality (in terms of minimum spanning forests) and derive a linear-t...

In this paper, a novel method for ranking of fuzzy numbers are proposed. In this method, decision maker is defined based on the center of mass at some cuts of a pair of fuzzy numbers in discreet version and center of mass on all of cuts of a pair of fuzzy numbers in continuous version. Our method can rank more than two fuzzy numbers simultaneously. Also, some properties of methods are described...

With stochastic integer programming as the motivating application, we investigate techniques to use integrality constraints to obtain improved cuts within a Benders decomposition algorithm. We compare the effect of using cuts in two ways: (i) cut-and-project, where integrality constraints are used to derive cuts in the extended variable space, and Benders cuts are then used to project the resul...