Exhaustive Search Research Papers - Academia.edu (original) (raw)

In this study, the potential application of hyperspectral imaging (HSI) for quality prediction of white mushroom slices during storage at 4 °C and 15 °C was investigated. Mushroom slice quality was measured in terms of moisture content,... more

In this study, the potential application of hyperspectral imaging (HSI) for quality prediction of white mushroom slices during storage at 4 °C and 15 °C was investigated. Mushroom slice quality was measured in terms of moisture content, colour (CIE Lightness, L* and yellowness, b*) and texture (hardness, H and chewiness, Ch). Hyperspectral images were obtained using a pushbroom line-scanning HSI instrument, operating in the wavelength range of 400–1,000 nm with spectroscopic resolution of 5 nm. Multiple linear regression (MLR) and Principal Component Regression (PCR) models were developed to investigate the relationship between reflectance and the various quality parameters measured. 20 optimal wavelengths for quality prediction were selected after performing an exhaustive search for the best subsets of predictor variables on a calibration set of 84 samples. PCR applied to the set of optimal wavelengths gave the best performance as compared to MLR and PCR on the entire wavelength range. When applied to an independent validation set of samples, PCR models developed on the calibration set were capable of predicting moisture content with RMSEP of 0.74% w.b. and R 2 of 0.75, L* with RMSEP of 0.47 and R 2 of 0.95, b* with RMSEP of 0.66 and R 2 of 0.75, H with RMSEP of 0.49 N and R 2 of 0.77 and Ch with RMSEP of 0.27 N and R 2 of 0.72. Virtual images showing the distribution of moisture content on the mushroom surface were generated from the estimated PCR model. Results from this study could be used for the development of a non-destructive monitoring system for prediction of sliced mushroom quality.

In this paper we address the problem of providing full connectivity in large (wide area) ad hoc networks by placing advantaged nodes like UAVs (as relay nodes) in appropriate places. We provide a formulation where we can treat the... more

In this paper we address the problem of providing full connectivity in large (wide area) ad hoc networks by placing advantaged nodes like UAVs (as relay nodes) in appropriate places. We provide a formulation where we can treat the connectivity problem as a clustering problem with a summation-form distortion function. We then adapt the Deterministic Annealing clustering algorithm to our formulation and using that we find the minimum number of UAVs required to provide connectivity and their locations. Furthermore, we describe enhancements that can be used to extend the basic connectivity problem to support notions of reliable connectivity that can lead to improved network performance. We establish the validity of our algorithm and compare its performance with optimal (exhaustive search) as well as non-opitmal (hard clustering) algorithms. We show that our algorithm is nearoptimal both for the basic connectivity problem as well as extended notions of connectivity.

This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the same signal is decoded-and-forwarded to the destination over N time... more

This paper considers a design of signal constellations for trans-modulation (constellation rearrangement: CoRe) in a relay system with the multiple links in which the same signal is decoded-and-forwarded to the destination over N time slots, each assigned to the different relay node. Demonstrating that the minimal accumulated squared Euclidean distance (MASED) is not an ultimate design metric to minimize the bit error rate (BER), we choose the BER for the joint log-likelihood ratio (LLR) combining scheme as a design metric, so as to find bit-to-symbol mapping for the multiple relay links. To handle the prohibitive amount of computational complexity associated with an exhaustive search over enumeration of all possible mappings, which grows exponentially with the number of relay links, genetic algorithm is employed for searching for the sub-optimal bitto-symbol mappings in the multiple relay links. We show that a new type of CoRe design without the gray-mapping constraint is critical ...

Abstract. The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is... more

Abstract. The security of many recently proposed cryptosystems is based on the difficulty of solving large systems of quadratic multivariate polynomial equations. This problem is NP-hard over any field. When the number of equations m is the same as the number of unknowns n the best ...

The magnetoencephalograms (MEGs) are mainly due to the source currents. However, there is a significant contribution to MEGs from the volume currents. The structure of the anatomical surfaces, e.g., gray and white matter, could severely... more

The magnetoencephalograms (MEGs) are mainly due to the source currents. However, there is a significant contribution to MEGs from the volume currents. The structure of the anatomical surfaces, e.g., gray and white matter, could severely influence the flow of volume currents in a head model. This, in turn, will also influence the MEGs and the inverse source localizations. This was examined in detail with three different human head models. Three finite element head models constructed from segmented MR images of an adult male subject were used for this study. These models were: (1) Model 1: full model with eleven tissues that included detailed structure of the scalp, hard and soft skull bone, CSF, gray and white matter and other prominent tissues, (2) the Model 2 was derived from the Model 1 in which the conductivity of gray matter was set equal to the white matter, i.e., a ten tissuetype model, (3) the Model 3 consisted of scalp, hard skull bone, CSF, gray and white matter, i.e., a fi...

A method of solving a version of the two-dimensional cutting-stock problem is presented. In this version of the problem one is given a number of rectangular sheets and an order for a specified number of each of certain types of... more

A method of solving a version of the two-dimensional cutting-stock problem is presented. In this version of the problem one is given a number of rectangular sheets and an order for a specified number of each of certain types of rectangular shapes. The goal is to cut the shapes out of the sheets in such a way as to minimize the waste. However, in many practical applications computation time is also an important economic consideration. For such applications the goal may be to obtain the best solution possible without using excessive amounts of computation time. The method of solution described here avoids exhaustive search procedures by employing an approach utilizing a constrained dynamic programming algorithm to lay out groups of rectangles called strips. This paper also describes the results obtained when the algorithm was tested with some typical rectangular layout problems.

The Data Encryption Standard (DES) is the best known and most widely used cryptosystem for civilian applications. It was developed at IBM and adopted by the National Buraeu of Standards in the mid 70’s, and has successfully withstood all... more

The Data Encryption Standard (DES) is the best known and most widely used cryptosystem for civilian applications. It was developed at IBM and adopted by the National Buraeu of Standards in the mid 70’s, and has successfully withstood all the attacks published so far in the open literature. In this paper we develop a new type of cryptanalytic attack which can break DES with up to eight rounds in a few minutes on a PC and can break DES with up to 15 rounds faster than an exhaustive search. The new attack can be applied to a variety of DES-like substitution/permutation cryptosystems, and demonstrates the crucial role of the (unpublished) design rules.

We present an algorithm for computing the set of all coset leaders of a binary code mathcalCsubsetmathbbF2n\mathcal C \subset \mathbb{F}_2^nmathcalCsubsetmathbbF2n. The method is adapted from some of the techniques related to the computation of Gr\"obner representations associated... more

We present an algorithm for computing the set of all coset leaders of a binary code mathcalCsubsetmathbbF2n\mathcal C \subset \mathbb{F}_2^nmathcalCsubsetmathbbF2n. The method is adapted from some of the techniques related to the computation of Gr\"obner representations associated with codes. The algorithm provides a Gr\"obner representation of the binary code and the set of coset leaders mathrmCL(mathcalC)\mathrm{CL}(\mathcal C)mathrmCL(mathcalC). Its efficiency stands of the fact that its complexity is linear on the number of elements of mathrmCL(mathcalC)\mathrm{CL}(\mathcal C)mathrmCL(mathcalC), which is smaller than exhaustive search in mathbbF2n\mathbb{F}_2^nmathbbF2n.

We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the VC-dimension values of... more

We propose an exhaustive search algorithm that calculates the VC-dimension of univariate decision trees with binary features. The VC-dimension of the univariate decision tree with binary features depends on (i) the VC-dimension values of the left and right subtrees,(ii) the number of inputs, and (iii) the number of nodes in the tree. From a training set of example trees whose VC-dimensions are calculated by exhaustive search, we fit a general regressor to estimate the VC-dimension of any binary tree. These VC-dimension ...