sugar beet as an industrial crop plays a main role in satisfying domestic demand of sugar. study on the production efficiency of sugar beet is important because this is a factor that influences production without additional cost. in this study, data envelopment analysis approach (dea), was implemented to calculate technical, administrative and scale efficiency of sugar beet production. also opt...

In this paper, we conduct a fitness landscape analysis for multiobjective combinatorial optimization, based on the local optima of multiobjective NK-landscapes with objective correlation. In singleobjective optimization, it has become clear that local optima have a strong impact on the performance of metaheuristics. Here, we propose an extension to the multiobjective case, based on the Pareto d...

We study the recognized open problem of designing revenuemaximizing combinatorial auctions. It is unsolved even for two bidders and two items for sale. Rather than pursuing the pure economic approach of attempting to characterize the optimal auction, we explore techniques for automatically modifying existing mechanisms in a way that increase expected revenue. We introduce a general family of au...

This paper presents the optimum combination of major parameters for high mechanical efficiency of a compact scroll compressor with a fixed cylinder diameter. The mechanical efficiency was calculated for a number of cylinder volumes, where the cylinder diameter and the scroll thickness were fixed at a constant value of 75.7 mm and 4 mm, respectively, and combinations of the involute base circle ...

A K-user pseudo-orthogonal (PO) randomly spread CDMA system, equivalent to transmission over a subset of K ′ ≤ K single-user Gaussian channels, is introduced. The high signal-to-noise ratio performance of the PO-CDMA is analyzed by rigorously deriving its asymptotic multiuser efficiency (AME) in the large system limit. Interestingly, the K -optimized PO-CDMA transceiver scheme yields an AME whi...

New methods make it possible to do approximate steepest descent in O(1) time per move for k-bounded pseudo-Boolean functions using stochastic local search. It is also possible to use the average fitness over the Hamming distance 2 neighborhood as a surrogate fitness function and still retain the O(1) time per move. These are average complexity results. In light of these new results, we examine ...

The goal of this contribution1 is twofold: i) an overview on the vast literature on recent advances related to OFDM modulators is given: Cyclic-Prefix OFDM, Zero-Padded OFDM, PseudoRandom-Postfix OFDM and IOTA-OFDM; these are identified to be potential candidates for fourth generation mobile communication networks in the framework of the IST-WINNER project. ii) The advantages/disadvantages of t...

Low-rank tensor learning has many applications in machine learning. A series of batch learning algorithms have achieved great successes. However, in many emerging applications, such as climate data analysis, we are confronted with largescale tensor streams, which pose significant challenges to existing solutions. In this paper, we propose an accelerated online low-rank tensor learning algorithm...

We present a model of decentralisation of organisational search activity in NK fitness landscapes. The degree of decentralisation is expressed as the number of elements within a patch P. We derive analytical results for landscapes of maximum complexity (K = N-1) for the expected number of local optima for different degrees of decentralisation. The ruggedness of a landscape depends on the search...

Analysis and design of trellis codes optimized for a binary symmetric markov source with maximum a posteriori detection , " IEEE Trans. , " Source-channel optimized trellis codes for bitonal image transmission over AWGN channels, " IEEE Trans. [20] P. J. Lee, " Computation of bit error rate of coherent M-ary PSK with gray code bit mapping, " IEEE Trans. A unified approach to the performance ana...