Solution approaches for the cutting stock problem with setup cost

In this paper, we study the Cutting Stock Problem with Setup Cost (CSP-S) which is a more general case of the well-known Cutting Stock Problem (CSP). In the classical CSP, one wants to minimize the number of stock items used while satisfying the demand for smaller-sized items. However, the number of patterns/setups to be performed on the cutting machine is ignored. In most cases, one has to find the trade-off between the material usage and the number of setups in order to come up with better production plans. In CSP-S, we have different cost factors for the material and the number of setups, and the objective is to minimize total production cost including both material and setup costs. We develop a mixed integer linear program and analyze a special case of the problem. Motivated by this special case, we propose two local search algorithms and a column generation based heuristic algorithm. We demonstrate the effectiveness of the proposed algorithms on the instances from the literature.     

Dynamic tensile testing of fabric–cement composites

Dynamic tensile tests were conducted using a high speed servo-hydraulic testing machine on three types of fabric reinforced cement composites. The high speed testing procedure and data processing method are presented. Quasi-static tests were also conducted on the composites. Effects of strain rate on the mechanical properties of fabric–cement composites are noted. A good correlation was found between the properties of the fabrics and the composites, with the carbon fabric exhibiting the highest strength and ductility performance in high speed tensile tests. The differences in tensile behavior of the various composites were correlated with the differences in the role of the fabric materials. Composites tested under high speed loading exhibited different responses as compared to similar composites tested under quasi-static condition.     

Integrating quality and maintenance decisions in a production-inventory model for deteriorating items

In typical production-inventory models of deteriorating items, deterioration of the production process has not been considered. In this paper, a model is proposed in which both the produced items and the production equipment deteriorate. When the production system deteriorates, it shifts to an out-of-control state and begins to produce a proportion of defective items, necessitating corrective maintenance action. A model is formulated to integrate several realistic aspects, including item and process deterioration, varying demand and production rates, quality, inspection, and maintenance. A heuristic solution algorithm is developed to determine the production and inspection schedules, and a numerical example is solved.     

β-Galactosidase in the acceleration of Ras cheese ripening

An attempt has been carried out to accelerate Ras cheese ripening by pre-treatment of cheese milk with β-galactosidase. Milk was treated with a β-galactosidase enzyme preparation, namely lactozym (1 ml/kg milk), at 33°C for 1 h or at 4°C for 18 h and used for Ras cheese making. Flavour intensity, formation of soluble nitrogen compounds, free amino acids and liberation of free fatty acids were enhanced in cheese made from β-galactosidase treated milk. In addition, the ripening period was reduced to 2 months compared with 4 months required for control cheese. Treatment of cheese milk with β-galactosidase at 4°C or 33°C showed a similar effect on the properties of cheese.     

Integer-based constellation-shaping method for PAPR reduction in OFDM systems

In this paper, the problem of reducing the peak-to-average-power ratio (PAPR) in an orthogonal frequency-division multiplexing system is considered. We design a cubic constellation, called the Hadamard constellation, whose boundary is along the bases defined by the Hadamard matrix in the transform domain. Then, we further reduce the PAPR by applying the selective-mapping technique. The encoding method, following the method introduced in the work of Kwok, is derived from a decomposition known as the Smith normal form. This new technique offers a PAPR that is significantly lower than those of the best-known techniques without any loss in terms of energy and/or spectral efficiency, and without any side information being transmitted. Moreover, it has a low computational complexity.     

Correlation of tensile and flexural responses of strain softening and strain hardening cement composites

Closed form equations for generating moment–curvature response of a rectangular beam of fiber reinforced concrete are presented. These equations can be used in conjunction with crack localization rules to predict flexural response of a beam under four point bending test. Parametric studies simulated the behavior of two classes of fiber reinforced concrete: strain softening and strain hardening materials. The simulation revealed that the direct use of uniaxial tension and compression responses under-predicted the flexural response for strain softening material while a good prediction for strain hardening material was obtained. The importance of strain softening range on the flexural response is discussed using non-dimensional post-peak parameters. Results imply that the brittleness and size effect are more pronounced in the flexural response of brittle materials, while more accurate predictions are obtained with ductile materials. It is also demonstrated that correlations of tensile and flexural results can be established using normalized uniaxial tension and compression models with a single scaling factor.     

Data Preparation for Mining World Wide Web Browsing Patterns

The World Wide Web (WWW) continues to grow at an astounding rate in both the sheer volume of traffic and the size and complexity of Web sites. The complexity of tasks such as Web site design, Web server design, and of simply navigating through a Web site have increased along with this growth. An important input to these design tasks is the analysis of how a Web site is being used. Usage analysis includes straightforward statistics, such as page access frequency, as well as more sophisticated forms of analysis, such as finding the common traversal paths through a Web site. Web Usage Mining is the application of data mining techniques to usage logs of large Web data repositories in order to produce results that can be used in the design tasks mentioned above. However, there are several preprocessing tasks that must be performed prior to applying data mining algorithms to the data collected from server logs. This paper presents several data preparation techniques in order to identify unique users and user sessions. Also, a method to divide user sessions into semantically meaningful transactions is defined and successfully tested against two other methods. Transactions identified by the proposed methods are used to discover association rules from real world data using the WEBMINER system [15].     

Fairness in Multiuser Systems With Polymatroid Capacity Region

For a wide class of multiuser systems, a subset of capacity region which includes the corner points and the sum-capacity facet has a special structure known as polymatroid. Multiple-access channels with fixed input distributions and multiple-antenna broadcast channels are examples of such systems. Any interior point of the sum-capacity facet can be achieved by time-sharing among corner points or by an alternative method known as rate-splitting. The main purpose of this paper is to find a point on the sum-capacity facet which satisfies a notion of fairness among the active users. This problem is addressed in two cases: (i) where the complexity of achieving interior points is not feasible, and (ii) where the complexity of achieving interior points is feasible. For the first case, the corner point for which the minimum rate of the active users is maximized is desired. A simple greedy algorithm is introduced to find such an optimum corner point. In addition, it is shown for single-antenna Gaussian multiple-access channels, the resulting corner point is leximin maximal with respect to the set of the corner points. For the second case, the properties of the unique leximin maximal rate vector with respect to the polymatroid are reviewed. It is shown that the problems of deriving the time-sharing coefficients or rate-splitting scheme to attain the leximin maximal vector can be solved by decomposing the problem into some lower dimensional subproblems. In addition, a fast algorithm to compute the time-sharing coefficients to attain a general point on the sum-capacity facet is presented.