Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers

This paper addresses the integration of the lot-sizing problem and the one-dimensional cutting stock problem with usable leftovers (LSP-CSPUL). This integration aims to minimize the cost of cutting items from objects available in stock, allowing the bringing forward production of items that have known demands in a future planning horizon. The generation of leftovers, that will be used to cut future items, is also allowed and these leftovers are not considered waste in the current period. Inventory costs for items and leftovers are also considered. A mathematical model for the LSP-CSPUL is proposed to represent this problem and an approach, using the simplex method with column generation, is proposed to solve the linear relaxation of this model. A heuristic procedure, based on a relax-and-fix strategy, was also proposed to find integer solutions. Computational tests were performed and the results show the contributions of the proposed mathematical model, as well as, the quality of the solutions obtained using the proposed method.

     

Complementary-reference and complementary-scene for real-time fingerprint verification using joint transform correlator

In this paper, a new configuration for the input joint images in the joint transform correlator is proposed for fast real-time binary characters and fingerprints verification. In the proposed scheme, the input joint image has a complementary-reference image and a complementary target image in addition to the reference and the target images. We use the cross-correlation peak value between the reference and the complementary target image and the cross-correlation peak value between the complementary reference and the target images as the criteria to perform the recognition of the target in the input scene. It is shown that these two cross-correlation peak values will be zero if and only if the input target matches the reference image. One advantage of using the proposed scheme is the elimination of the usual and necessary time-consuming normalization of the input images in the general correlation-based matching processes. Another advantage of the proposed scheme is the insensitive to light-sources intensity fluctuations that usually limits the matched-based recognition approaches. The scheme is employed to verify binary characters and fingerprints images; further, it is employed to verify occluded fingerprints target images on one hand, and to determine if a specific part or pattern exists in the target fingerprint image on the other hand.     

The one-dimensional cutting stock problem with usable leftover – A heuristic approach

In this work we consider a one-dimensional cutting stock problem in which the non-used material in the cutting patterns may be used in the future, if large enough. This feature introduces difficulties in comparing solutions of the cutting problem, for example, up to what extent a minimum leftover solution is the most interesting one when the leftover may be used. Some desirable characteristics of good solutions are defined and classical heuristic methods are modified, so that cutting patterns with undesirable leftover (not large enough to be used, nor too small to be acceptable waste) are redesigned. The performance of the modified heuristics is observed by solving instances from the literature, practical instances and randomly generated instances.     

Measurement of a broad range of Gaussian laser beam diameters using various periodic and aperiodic rulings

A novel analytical approach is proposed for an accurate estimation of a broad range of Gaussian laser beam diameters. The new approach, based on the Fourier transform and the convolution operations, is used to study the performance of most recently proposed periodic and aperiodic rulings. Further, for applications that require extremely small beam diameter measurements, a new Ronchi-like ruling is proposed; while for applications requiring large beam diameters measurements, various aperiodic non-Ronchi rulings are proposed. Furthermore, for spot-size measurement applications, which range from very small to very large beam diameters, a new single aperiodic exponential ruling is proposed. This new ruling eliminates the necessity of using a large number of rulings for measuring a broad range of beam diameters.     

Symbolic substitution based flagged arithmetic unit design using polarization-encoded optical shadow-casting system

An extremely efficient modified-signed digit arithmetic unit based on symbolic substitution scheme is designed using the polarization-encoded optical shadow-casting system. Alternate design characteristics for both addition and subtraction are also presented.     

The one-dimensional cutting stock problem with usable leftovers – A survey

In this article, we review published studies that consider the solution of the one-dimensional cutting stock problem (1DCSP) with the possibility of using leftovers to meet future demands, if long enough. The one-dimensional cutting stock problem with usable leftovers (1DCSPUL) is a problem frequently encountered in practical settings but often, it is not dealt with in an explicit manner. For each work reviewed, we present the application, the mathematical model if one is proposed and comments on the computational results obtained. The approaches are organized into three classes: heuristics, item-oriented, or cutting pattern-oriented.     

One-step optical trinary signed-digit arithmetic using redundant bit representations

A simple one-step fully parallel trinary signed-digit arithmetic is proposed for parallel optical computing. This technique performs multidigit carry-free addition and borrow-free subtraction in constant time. The trinary signed-digit arithmetic operations are based on redundant bit representation of the digits. Optical implementation of the proposed arithmetic can be carried out using correlation or matrix multiplication based schemes. An efficient matrix multiplication based optical implementation that employs a fixed number of minterms for any operand length is developed. It is shown that only 30 minterms (less than recently reported techniques) are enough for implementing the one-step trinary addition and subtraction.     

Photonic crystal-based all-optical arithmetic circuits without SOA-based switches

Various proposed optical computing devices involve nonlinear optical operation and use semiconductor optical amplifier (SOA)-based switches as fundamental elements for logic operations. Due to the nonlinear operation, these devices suffer from high power that causes problems in very large-scale optical integration. In this paper, a method is proposed to implement arithmetic operations using a photonic crystal (PhC) cell and eliminate the SOA-based switches altogether. The proposed method is employed on designing an all-optical full adder/subtractor circuit that requires only beam combiners and photonic crystal NOT gates.     

Optoelectronic symbolic substitution based canonical modified signed-digit arithmetic

A single-step optoelectronics symbolic substitution scheme to handle parallel modified signed-digit (MSD) arithmetic operations is proposed. Conversion algorithms from MSD numbers into a canonical MSD representation are provided. The canonical MSD numbers have the property that no two consecutive digits are non-zero. The addition operation of two CMSD numbers is performed in one step. It will be shown that through the use of CMSD representation, the number of symbolic substitution rules in an optical content-addressable memory (CAM) based system is significantly reduced. The number of symbolic substitution rules can be further reduced to an optimum value through a proposed shared content-addressable memory optical set-up. Further, the proposed optical scheme doubles the storage efficiency of the shared content-addressable memory.