Modified Shifting Bottleneck Heuristic for Scheduling Problems of Large-Scale Job Shops

A modified shifting bottleneck algorithm was proposed to solve scheduling problems of a large-scale job shop.Firstly,a new structured algorithm was employed for sub-problems so as to reduce the computational burden and suit for large-scale instances more effectively.The modified cycle avoidance method,incorporating with the disjunctive graph model and topological sort algorithm,was applied to guaranteeing the feasibility of solutions with considering delayed precedence constraints.Finally,simulation experiments were carried out to verify the feasibility and effectiveness of the modified method.The results demonstrate that the proposed algorithm can solve the large-scale job shop scheduling problems(JSSPs) within a reasonable period of time and obtaining satisfactory solutions simultaneously.

AVirtual Cloud Storage Architecture for Enhanced Data Security

The sensitive data stored in the public cloud by privileged users,such as corporate companies and government agencies are highly vulnerable in the hands of cloud providers and hackers.The proposed Virtual Cloud Storage Archi-tecture is primarily concerned with data integrity and confidentiality,as well as availability.To provide confidentiality and availability,thefile to be stored in cloud storage should be encrypted using an auto-generated key and then encoded into distinct chunks.Hashing the encoded chunks ensured thefile integrity,and a newly proposed Circular Shift Chunk Allocation technique was used to determine the order of chunk storage.Thefile could be retrieved by performing the opera-tions in reverse.Using the regenerating code,the model could regenerate the missing and corrupted chunks from the cloud.The proposed architecture adds an extra layer of security while maintaining a reasonable response time and sto-rage capacity.Experimental results analysis show that the proposed model has been tested with storage space and response time for storage and retrieval.The VCSA model consumes 1.5x(150%)storage space.It was found that total storage required for the VCSA model is very low when compared with 2x Replication and completely satisfies the CIA model.The response time VCSA model was tested with different sizedfiles starting from 2 to 16 MB.The response time for storing and retrieving a 2 MBfile is 4.96 and 3.77 s respectively,and for a 16 MBfile,the response times are 11.06 s for storage and 5.6 s for retrieval.

Implementation of the parallel mean shift-based imagesegmentation algorithm on a GPU cluster

The mean shift image segmentation algorithm is very computationintensive. To address the need to deal with a large number of remotesensing (RS) image segmentations in real-world applications, this studyhas investigated the parallelization of the mean shift algorithm on asingle graphics processing unit (GPU) and a task-scheduling methodwith message passing interface (MPI)+OpenCL programming model on aGPU cluster platform. This paper presents the test results of the parallelmean shift image segmentation algorithm on Shelob, a GPU clusterplatform at Louisiana State University, with different datasets andparameters. The experimental results show that the proposed parallelalgorithm can achieve good speedups with different configurations andRS data and can provide an effective solution for RS image processingon a GPU cluster.

An adaptive segmentation method combining MSRCR and mean shift algorithm with K-means correction of green apples in natural environment

During the recognition and localization process of green apple targets,problems such as uneven illumination,occlusion of branches and leaves need to be solved.In this study,the multi-scale Retinex with color restoration(MSRCR)algorithm was applied to enhance the original green apple images captured in an orchard environment,aiming to minimize the impacts of varying light conditions.The enhanced images were then explicitly segmented using the mean shift algorithm,leading to a consistent gray value of the internal pixels in an independent fruit.After that,the fuzzy attention based on information maximization algorithm(FAIM)was developed to detect the incomplete growth position and realize threshold segmentation.Finally,the poorly segmented images were corrected using the K-means algorithm according to the shape,color and texture features.The users intuitively acquire the minimum enclosing rectangle localization results on a PC.A total of 500 green apple images were tested in this study.Compared with the manifold ranking algorithm,the K-means clustering algorithm and the traditional mean shift algorithm,the segmentation accuracy of the proposed method was 86.67%,which was 13.32%,19.82%and 9.23%higher than that of the other three algorithms,respectively.Additionally,the false positive and false negative errors were 0.58%and 11.64%,respectively,which were all lower than the other three compared algorithms.The proposed method accurately recognized the green apples under complex illumination conditions and growth environments.Additionally,it provided effective references for intelligent growth monitoring and yield estimation of fruits.

Rapid and robust medical image elastic registration using mean shift algorithm

In landmark-based image registration, estimating the landmark correspondence plays an important role. In this letter, a novel landmark correspondence estimation technique using mean shift algorithm is proposed. Image corner points are detected as landmarks and mean shift iterations are adopted to find the most probable corresponding point positions in two images. Mutual information between intensity of two local regions is computed to eliminate mis-matching points to improve the stability of corresponding estimation correspondence landmarks is exact. The proposed experiments of various mono-modal medical images. Multi-level estimation （MLE） technique is proposed Experiments show that the precision in location of technique is shown to be feasible and rapid in the