968 resultados para ASSIGNMENT
Resumo:
A chitooligosaccharide specific lectin (Luffa acutangula agglutinin) has been purified from the exudate of ridge gourd fruits by affinity chromatography on soybean agglutininglycopeptides coupled to Sepharose-6B. The affinity purified lectin was found homogeneous by polyacrylamide gel electrophoresis, in sodium dodecyl sulphate-polyacrylamide gels, by gel filtration on Sephadex G-100 and by sedimentation velocity experiments. The relative molecular weight of this lectin is determined to be 48,000 ± 1,000 by gel chromatography and sedimentation equilibrium experiments. The sedimentation coefficient (S20, w) was obtained to be 4·06 S. The Stokes’ radius of the protein was found to be 2·9 nm by gel filtration. In sodium dodecyl sulphate-polyacrylamide gel electrophoresis the lectin gave a molecular weight of 24,000 in the presence as well as absence of 2-mercaptoethanol. The subunits in this dimeric lectin are therefore held by non-covalent interactions alone. The lectin is not a glycoprotein and circular dichroism spectral studies indicate that this lectin has 31% α-helix and no ß-sheet. The lectin is found to bind specifically to chitooligosaccharides and the affinity of the lectin increases with increasing oligosaccharide chain length as monitored by near ultra-violetcircular dichroism and intrinsic fluorescence titration. The values of ΔG, ΔΗ and ΔS for the binding process showed a pronounced dependence on the size of the oligosaccharide. The values for both ΔΗ and ΔS show a significant increase with increase in the oligosaccharide chain length showing that the binding of higher oligomers is progressively more favoured thermodynamically than chitobiose itself. The thermodynamic data is consistent with an extended binding site in the lectin which accommodates a tetrasaccharide. Based on the thermodynamic data, blue shifts and fluorescence enhancement, spatial orientation of chitooligosaccharides in the combining site of the lectin is assigned.
Resumo:
Rotational isomerism of S-methyl N-methyl dithiocarbamate (MMDTC) has been investigated by means of variable temperature proton NMR and i.r. spectroscopy. The i.r. spectra of MMDTC as neat, solution and at sub-ambient temperatures have been examined. Normal vibrational analysis of all the fundamentals of MMDTC has been carried out, the vibrational assignment has been compared with those of related secondary thioamides to note the consistency in the assignments and to obtain the pattern characteristic of the secondary thioamide vibrations.
Resumo:
The time minimising assignment problem is the problem of finding an assignment of n jobs to n facilities, one to each, which minimises the total time for completing all the jobs. The usual assumption made in these problems is that all the jobs are commenced simultaneously. In this paper two generalisations of this assumption are considered, and algorithms are presented to solve these general problems. Numerical examples are worked out illustrating the algorithms.
Resumo:
Analysis of the 1H NMR spectra of several monothiocarbonohydrazones, some of them synthesized for the first time, shows that they exist as two structural isomers. Whereas, in general, the derivatives of aromatic aldehydes conform to a linear structure, the aliphatic carbonyl derivatives conform to heterocyclic or linear structures, depending on the size of the substituent groups. This dual behaviour is explained in terms of extended conjugation and steric hindrance.
Resumo:
The problem of assigning customers to satellite channels is considered. Finding an optimal allocation of customers to satellite channels is a difficult combinatorial optimization problem and is shown to be NP-complete in an earlier study. We propose a genetic algorithm (GA) approach to search for the best/optimal assignment of customers to satellite channels. Various issues related to genetic algorithms such as solution representation, selection methods, genetic operators and repair of invalid solutions are presented. A comparison of this approach with the standard optimization method is presented to show the advantages of this approach in terms of computation time
Resumo:
One of the key problems in the design of any incompletely connected multiprocessor system is to appropriately assign the set of tasks in a program to the Processing Elements (PEs) in the system. The task assignment problem has proven difficult both in theory and in practice. This paper presents a simple and efficient heuristic algorithm for assigning program tasks with precedence and communication constraints to the PEs in a Message-based Multiple-bus Multiprocessor System, M3, so that the total execution time for the program is minimized. The algorithm uses a cost function: “Minimum Distance and Parallel Transfer” to minimize the completion time. The effectiveness of the algorithm has been demonstrated by comparing the results with (i) the lower bound on the execution time of a program (task) graph and (ii) a random assignment.
Resumo:
A new case of the uncommon cis-trans enantiomerism is presented. The titled anhydride adducts were prepared in good yields by the known reaction of three 6-arylfulvenes with maleic anhydride (aryl = phenyl, p-tolyl and p-anisyl). The exo adducts were converted to the corresponding imides by reaction with (1S)-1-(naphth-1-yl)ethylamine in similar to 80% yields, and the resulting diastereomeric imides separated by silica gel column chromatography. They were hydrolysed and recyclised to the chiral anhydrides, in `one-pot' with 10% NaOH-EtOH, followed by treatment with 2 M HCl, in similar to 40% yields. The titled anhydrides were thus obtained in homochiral form, in enantiomeric purities (generally) of similar to 90% as indicated by chiral HPLC. The chiral anhydrides were also converted to the corresponding imides (presumably stereospecifically), by treatment with ammonia solution in excellent yields. The crystal structure of one of the above diastereomeric imides (derived from 6-phenylfulvene) was determined, and based on the known (S)-configuration of the naphthylethylamine moiety, the `configurations' of the original anhydride adducts were assigned. (c) 2005 Elsevier Ltd. All rights reserved.
Resumo:
The Infrared spectra of carbohydrazide, diprotonated carbohydrazide and their deuterated compounds have been measured in the solid state. From the results on thio- and selenocarbohydrazides and other related molecules and normal coordinate analyses using a Urey-Bradley force field assignments of the fundamental vibrational frequencies and a description of the normal modes of carbohydrazide, diprotonated carbohydrazide and their deuterated species are given.
Resumo:
A neural network approach for solving the two-dimensional assignment problem is proposed. The design of the neural network is discussed and simulation results are presented. The neural network obtains 10-15% lower cost placements on the examples considered, than the adjacent pairwise exchange method.
Resumo:
Channel assignment in multi-channel multi-radio wireless networks poses a significant challenge due to scarcity of number of channels available in the wireless spectrum. Further, additional care has to be taken to consider the interference characteristics of the nodes in the network especially when nodes are in different collision domains. This work views the problem of channel assignment in multi-channel multi-radio networks with multiple collision domains as a non-cooperative game where the objective of the players is to maximize their individual utility by minimizing its interference. Necessary and sufficient conditions are derived for the channel assignment to be a Nash Equilibrium (NE) and efficiency of the NE is analyzed by deriving the lower bound of the price of anarchy of this game. A new fairness measure in multiple collision domain context is proposed and necessary and sufficient conditions for NE outcomes to be fair are derived. The equilibrium conditions are then applied to solve the channel assignment problem by proposing three algorithms, based on perfect/imperfect information, which rely on explicit communication between the players for arriving at an NE. A no-regret learning algorithm known as Freund and Schapire Informed algorithm, which has an additional advantage of low overhead in terms of information exchange, is proposed and its convergence to the stabilizing outcomes is studied. New performance metrics are proposed and extensive simulations are done using Matlab to obtain a thorough understanding of the performance of these algorithms on various topologies with respect to these metrics. It was observed that the algorithms proposed were able to achieve good convergence to NE resulting in efficient channel assignment strategies.