second, they capture the gross structure of the lines in the original image. They describe the end points, corners, A novel method for vectorizing line drawing images is presented. The method is based on a sequence of a standard vectorijunctions, and other special points in the image, i.e. the zation algorithm and maximum threshold morphology, which obviously important (dominant) points of a ve...

The thesis explores sparse machine learning algorithms for supervised (classification and re­ gression) and unsupervised (subspace methods) learning. For classification, we review the set covering machine (SCM) and propose new algorithms th a t directly minimise the SCMs sample compression generalisation error bounds during the training phase. Two of the resulting algo­ rithm s are proved to pr...

a tandem agv configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. each loop has at least one additional p/d station, provided as an interface between adjacent loops. this study describes the development of three tabu search algorithms for the design of tandem agv systems. the first algorithm was developed based on the basic definiti...

A tandem AGV configuration connects all cells of a manufacturing area by means of non-overlapping, sin-gle-vehicle closed loops. Each loop has at least one additional P/D station, provided as an interface between adjacent loops. This study describes the development of three tabu search algorithms for the design of tandem AGV systems. The first algorithm was developed based on the basic definiti...

In the current world, the debate on the reinstatement and reuse of consumer prod-ucts has become particularly important. Since the supply chain of the closed loop is not only a forward flow but also a reverse one; therefore, companies creating integ-rity between direct and reverse supply chain are successful. The purpose of this study is to develop a new mathematical model for closed loop suppl...

This paper presents a genetic algorithm (GA) for solving a generalized model of single-item resource-constrained aggregate production planning (APP) with linear cost functions. APP belongs to a class of pro-duction planning problems in which there is a single production variable representing the total production of all products. We linearize a linear mixed-integer model of APP subject to hiring...

This paper discusses the problem of allocation of constrained renewable resource to splittable activities of a single project. If the activities of stochastic projects can be split, these projects may be completed in shorter time when the available resource is constrained. It is assumed that the resource amount required to accom-plish each activity is a discrete quantity and deterministic. The ...

Given the amino-acid sequence of a protein, the prediction of a protein’s tertiary structure is known as the protein folding problem. The protein folding problem in the hydrophobic-hydrophilic lattice model is the problem of finding the lowest energy conformation. This is the NP-complete problem. In order to enhance the procedure performance for predicting protein structures, a hybrid genetic-b...

The level set algorithm is extended to handle the reconstruction of the shape and location of objects hidden behind a dielectric wall. The Green’s function of stratified media is used to modify the method of moments and the surface integral equation forward solver. Due to the oscillatory nature of the Sommerfeld integrals, the stationary phase approximation is implemented here to achieve fast a...

In this paper we describe an algorithm to route the class of linear complement permutations on Hy percube SIMD computers The class of linear complement permutations are extremely useful in de vising storage schemes for parallel array access The proposed algorithm is self routing and minimal that is the path established by the algorithm between each pair of source and destination processors is v...