Image reconstruction with laterally truncated projections in helical cone-beam CT: Linear prediction based projection completion techniques

Lateral or transaxial truncation of cone-beam data can occur either due to the field of view limitation of the scanning apparatus or iregion-of-interest tomography. In this paper, we Suggest two new methods to handle lateral truncation in helical scan CT. It is seen that reconstruction with laterally truncated projection data, assuming it to be complete, gives severe artifacts which even penetrates into the field of view. A row-by-row data completion approach using linear prediction is introduced for helical scan truncated data. An extension of this technique known as windowed linear prediction approach is introduced. Efficacy of the two techniques are shown using simulation with standard phantoms. A quantitative image quality measure of the resulting reconstructed images are used to evaluate the performance of the proposed methods against an extension of a standard existing technique.

Minimizing total completion time on a batch processing machine with job families

We consider the problem of minimizing the total completion time on a single batch processing machine. The set of jobs to be scheduled can be partitioned into a number of families, where all jobs in the same family have the same processing time. The machine can process at most B jobs simultaneously as a batch, and the processing time of a batch is equal to the processing time of the longest job in the batch. We analyze that properties of an optimal schedule and develop a dynamic programming algorithm of polynomial time complexity when the number of job families is fixed. The research is motivated by the problem of scheduling burn-in ovens in the semiconductor industry

Minimizing total completion time on batch processing machines

We study the problem of minimizing total completion time on single and parallel batch processing machines. A batch processing machine is one which can process up to B jobs simultaneously. The processing time of a batch is equal to the largest processing time among all jobs in the batch. This problem is motivated by burn-in operations in the final testing stage of semiconductor manufacturing and is expected to occur in other production environments. We provide an exact solution procedure for the single-machine problem and heuristic algorithms for both single and parallel machine problems. While the exact algorithms have limited applicability due to high computational requirements, extensive experiments show that the heuristics are capable of consistently obtaining near-optimal solutions in very reasonable CPU times.

Conceptualization of a Behavior Modification Tool for University Systems and Doctoral Students

This paper describes a university based system relevant to doctoral students who have problems with themselves, their peers and research supervisors. Doctoral students have various challenges to solve and these challenges contribute to delays in their thesis submission. This tool aims at helping them think through their problem in a pre-counseling stage. The tool uses narratives and hypothetical stories to walk a doctoral student through options of responses he or she can make given the situation in the narrative. Narratives were developed after a preliminary survey (n=57) of doctoral students. The survey indicated that problems they experienced were: busy supervisors, negative competition from peers and laziness with self. The narrative scenarios in the tool prompt self-reflection and provide for options to chose from leading to the next scenario that will ensue. The different stages of the stimulus-response cycles are designed based on Thomas-Kilmann conflict resolution techniques (collaboration and avoidance). Each stimulus-response cycle has a score attached that reflects the student's ability to judge a collaborative approach. At the end of all the stages a scorecard is generated indicating either a progressive or regressive outcome of thesis submission.