Deterministic and randomized scheduling problems under the lp norm on two identical machines

Parallel machine scheduling problems, which are important discrete optimization problems, may occur in many applications. For example, load balancing in network communication channel assignment, parallel processing in large-size computing, task arrangement in flexible manufacturing systems, etc., are multiprocessor scheduling problem. In the traditional parallel machine scheduling problems, it is assumed that the problems are considered in offline or online environment. But in practice, problems are often not really offline or online but somehow in-between. This means that, with respect to the online problem, some further information about the tasks is available, which allows the improvement of the performance of the best possible algorithms. Problems of this class are called semi-online ones. In this paper, the semi-online problem P2|decr|lp (p>1) is considered where jobs come in non-increasing order of their processing times and the objective is to minimize the sum of the lp norm of every machine’s load. It is shown that LS algorithm is optimal for any lp norm, which extends the results known in the literature. Furthermore, randomized lower bounds for the problems P2|online|lp and P2|decr|lp are presented.

Mathematic modeling on flexible cooling system in hot strip mill

A novel cooling system combining ultra fast cooling rigs with laminar cooling devices was investigated.Based on the different cooling mechanisms,a serial of mathematic models were established to describe the relationship between water flow and spraying pressure and the relationship between water spraying heat flux and layout of nozzles installed on the top and bottom cooling headers.Model parameters were validated by measured data.Heat transfer models including air convection model,heat radiation model and water cooling capacity model were detailedly introduced.In addition,effects on cooling capacity by water temperature and different valve patterns were also presented.Finally,the comparison results from UFC used or not have been provided with respect to temperature evolution and mechanical properties of Q235B steel grade with thickness of 7.8 mm.Since online application of the sophisticated CTC process control system based on these models,run-out table cooling control system has been running stably and reliably to produce resource-saving,low-cost steels with smaller grain size.

Visualization and Damage Assessment for Flooded Area

A practical method for visualizing flood area and evaluating damage is presented, which consists of two technical approaches: self\|programming and adapting commercial GIS platforms. The low\|cost and easy\|to\|use GIS\|Based model developed by self\|programming can meet current requirements of most local authorities, especially in developing countries. In this model, two cases, non\|source flood and source flood, are distinguished and the Seed\|spread algorithm suitable for source\|flood is discussed; The flood damage is assessed by overlaying the flood area range with thematic maps and other related social and economic data. and all thematic maps are converted to raster format before overlay analysis. Two measures are taken to improve the operation efficiency of speed seed\|spread algorithm. The accuracy of the model mainly depends on the resolution and precision of the DEM data, and the accuracy of registering all raster layers and the quality of attribute data.

Digital Forensic Analysis on Runtime Instruction Flow

Computer system＇s runtime information is an essential part of the digital evidence. Current digital forensic approaches mainly focus on memory and I/O data, while the runtime instructions from processes are often ignored. We present a novel approach on runtime instruction forensic analysis and have developed a forensic system which collects instruction flow and extracts digital evidence. The system is based on whole-system emulation technique and analysts are allowed to define analysis strategy to improve analysis efficiency and reduce overhead. This forensic approach and system are applicable to binary code analysis, information retrieval and matware forensics.

THE CONDITIONAL DIAGNOSABILITY OF SHUFFLE-CUBES

In the application of multiple-processor systems some processors or links in a system maynot function properly,thus the fault diagnosis is one of the most important issues in the analysisand maintenance of those systems.For the practical fault diagnosis systems,the probability that allneighboring processors of a processor are faulty simultaneously is very small.Thus,the conditionaldiagnosability,which is a new metric for evaluating such systems,assumes that every fault set doesnot contain all neighbors of any processor in the system.In this paper,the authors show that then-dimensional shuffle-cube has the conditional diagnosability of 4n-15 for n = 2 (mod 4) and n ≥ 10.