University of Hull ideal assignment process

An 'ideal' assignment submission process map from the University of Hull .

Sheffield assignment submission process

A process map from the University of Sheffield, Department of Urban Studies and Planning, documenting their 'as is' assignment submission process.

Sheffield assignment submission process - to be

A process map from the University of Sheffield, Department of Urban Studies and Planning, documenting their 'to be' assignment submission process.

Advantages and Versatility of Fluorescence-Based Methodology to Characterize the Functionality of LDLR and Class Mutation Assignment

Familial hypercholesterolemia (FH) is a common autosomal codominant disease with a frequency of 1:500 individuals in its heterozygous form. The genetic basis of FH is most commonly mutations within the LDLR gene. Assessing the pathogenicity of LDLR variants is particularly important to give a patient a definitive diagnosis of FH. Current studies of LDLR activity ex vivo are based on the analysis of I-125-labeled lipoproteins (reference method) or fluorescent-labelled LDL. The main purpose of this study was to compare the effectiveness of these two methods to assess LDLR functionality in order to validate a functional assay to analyse LDLR mutations. LDLR activity of different variants has been studied by flow cytometry using FITC-labelled LDL and compared with studies performed previously with I-125-labeled lipoproteins. Flow cytometry results are in full agreement with the data obtained by the I-125 methodology. Additionally confocal microscopy allowed the assignment of different class mutation to the variants assayed. Use of fluorescence yielded similar results than I-125-labeled lipoproteins concerning LDLR activity determination, and also allows class mutation classification. The use of FITC-labelled LDL is easier in handling and disposal, cheaper than radioactivity and can be routinely performed by any group doing LDLR functional validations.

Training and assignment of multi-skilled workers for implementing seru production systems

Confronted with high variety and low volume market demands, many companies, especially the Japanese electronics manufacturing companies, have reconfigured their conveyor assembly lines and adopted seru production systems. Seru production system is a new type of work-cell-based manufacturing system. A lot of successful practices and experience show that seru production system can gain considerable flexibility of job shop and high efficiency of conveyor assembly line. In implementing seru production, the multi-skilled worker is the most important precondition, and some issues about multi-skilled workers are central and foremost. In this paper, we investigate the training and assignment problem of workers when a conveyor assembly line is entirely reconfigured into several serus. We formulate a mathematical model with double objectives which aim to minimize the total training cost and to balance the total processing times among multi-skilled workers in each seru. To obtain the satisfied task-to-worker training plan and worker-to-seru assignment plan, a three-stage heuristic algorithm with nine steps is developed to solve this mathematical model. Then, several computational cases are taken and computed by MATLAB programming. The computation and analysis results validate the performances of the proposed mathematical model and heuristic algorithm. © 2013 Springer-Verlag London.

an empirical study on bug assignment automation using chinese bug data

Univ SE Calif, Ctr Syst & Software Engn, ABB, Microsoft Res, IEEE, ACMSIGSOFT, N Carolina State Univ Comp Sci

Assignment of absolute configuration of cyclic secondary amines by NMR techniques using Mosher's method: a general procedure exemplified with (-)-isoanabasine

A general procedure to determine the absolute configuration of cyclic secondary amines with Mosher's NMR method is demonstrated, with assignment of absolute configuration of isoanabasine as an example. Each Mosher amide can adopt two stable conformations (named rotamers) caused by hindered rotation around amide C-N bond. Via a three-step structural analysis of four rotamers, the absolute configuration of (-)-isoanabasine is deduced to be (R) on the basis of Newman projections, which makes it easy to understand and clarify the application of Mosher's method to cyclic secondary amines. Furthermore, it was observed that there was an unexpected ratio of rotamers of Mosher amide derived from (R)-isoanabasine and (R)-Mosher acid. This phenomenon implied that it is necessary to distinguish the predominant rotamer from the minor one prior to determining the absolute configuration while using this technique.

Complete assignment of H-1-NMR resonances of the king cobra neurotoxin CM-11

The king cobra(Ophiophagus hannah) neurotoxin CM-11 is long-chain peptide with 72 amino acid residues. Its complete assignment of H-1-NMR resonances was obtained using various 2D-NMR technologies, including DQF-COSY, clean-TOCSY and NOESY.

A NEW SCHEME FOR ASSIGNMENT OF A CANONICAL CONNECTION TABLE

A new algorithm for deriving canonical numbering of atoms in a molecular graph has been developed. Some graph invariants, such as node properties, degree (connectivity), topological path, the smallest node ring index, etc., are encoded together to partit

ASSIGNMENT OF C-13 NMR-SPECTRA OF POLYMER WITH SEMIEMPIRICAL METHOD - SURVEY OF SPECTRUM OF SECONDARY CARBON OF 1,2-PBD

In chain molecules of 1, 2-PBD, there are two kinds of gauche arrangements, which is the cause of making the spectrum of the secondary carbon in main chain of the polymer split. In such a complex system, the gauche arrangements of the secondary carbon and the tertiary carbon occupy an important position. Hence, the contribution of the tertiary carbon to the chemical shifts of the secondary carbon has a decisive effect on the sequence structure distribution. In comparison the contribution of vinyl groups is ...

Automatic 3d free form shape matching using the graduated assignment algorithm.

Liu, Yonghuai. Automatic 3d free form shape matching using the graduated assignment algorithm. Pattern Recognition, vol. 38, no. 10, pp. 1615-1631, 2005.

The rapid assignment of ruminal fungi to presumptive genera using ITS1 and ITS2 RNA secondary structures to produce group-specific fingerprints

Danny S. Tuckwell, Matthew J. Nicholson, Christopher S. McSweeney, Michael K. Theodorou and Jayne L. Brookman (2005). The rapid assignment of ruminal fungi to presumptive genera using ITS1 and ITS2 RNA secondary structures to produce group-specific fingerprints. Microbiology, 151 (5) pp.1557-1567 Sponsorship: BBSRC / Stapledon Memorial Trust RAE2008

Task Assignment in a Distributed System: Improving Performance by Unbalancing Load

We consider the problem of task assignment in a distributed system (such as a distributed Web server) in which task sizes are drawn from a heavy-tailed distribution. Many task assignment algorithms are based on the heuristic that balancing the load at the server hosts will result in optimal performance. We show this conventional wisdom is less true when the task size distribution is heavy-tailed (as is the case for Web file sizes). We introduce a new task assignment policy, called Size Interval Task Assignment with Variable Load (SITA-V). SITA-V purposely operates the server hosts at different loads, and directs smaller tasks to the lighter-loaded hosts. The result is that SITA-V provably decreases the mean task slowdown by significant factors (up to 1000 or more) where the more heavy-tailed the workload, the greater the improvement factor. We evaluate the tradeoff between improvement in slowdown and increase in waiting time in a system using SITA-V, and show conditions under which SITA-V represents a particularly appealing policy. We conclude with a discussion of the use of SITA-V in a distributed Web server, and show that it is attractive because it has a simple implementation which requires no communication from the server hosts back to the task router.

Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment

The paper considers the single machine due date assignment and scheduling problems with n jobs in which the due dates are to be obtained from the processing times by adding a positive slack q. A schedule is feasible if there are no tardy jobs and the job sequence respects given precedence constraints. The value of q is chosen so as to minimize a function ϕ(F,q) which is non-decreasing in each of its arguments, where F is a certain non-decreasing earliness penalty function. Once q is chosen or fixed, the corresponding scheduling problem is to find a feasible schedule with the minimum value of function F. In the case of arbitrary precedence constraints the problems under consideration are shown to be NP-hard in the strong sense even for F being total earliness. If the precedence constraints are defined by a series-parallel graph, both scheduling and due date assignment problems are proved solvable in time, provided that F is either the sum of linear functions or the sum of exponential functions. The running time of the algorithms can be reduced to if the jobs are independent. Scope and purpose We consider the single machine due date assignment and scheduling problems and design fast algorithms for their solution under a wide range of assumptions. The problems under consideration arise in production planning when the management is faced with a problem of setting the realistic due dates for a number of orders. The due dates of the orders are determined by increasing the time needed for their fulfillment by a common positive slack. If the slack is set to be large enough, the due dates can be easily maintained, thereby producing a good image of the firm. This, however, may result in the substantial holding cost of the finished products before they are brought to the customer. The objective is to explore the trade-off between the size of the slack and the arising holding costs for the early orders.