115 resultados para Assignment
Resumo:
A detailed analysis of the 1H and 13C NMR spectra of C-2 aryl and alkyl/desalkyl substituted isomeric exo- and endo-5-methylbicyclo[3.2.1]octane-6,8-diones is presented. The chemical shift of the C-5 angular methyl, the C-2 alkyl/olefinic (C-10)/C-2 methine protons, the aromatic proton shieldings and the characteristic AMX and ABX spectral pattern of the ketomethylene and bridgehead protons were found to be sensitive to the phenyl ring orientation (anisotropy). These distinctive features could be used for configurational distinction for this class of compounds. With increasing ortho-methoxy substitution on the phenyl ring, considerable deshilelding of the bridgehead proton was observed (ca. 0.6 ppm). Absence of the C-2 alkyl group in the desalkyl isomers resulted in substantial changes in the chemical shifts of different protons. A study of the NMR spectra of the corresponding bicyclic compounds with C-2 methoxy/hydroxy substitution instead of the aryl group revealed that the anisotropy of the phenyl ring and the electronegative oxygen substituents have opposite effects. The 13C NMR spectral assignment of each carbon resonance of C-2 aryl and alkyl/desalkyl substituted isomeric exo- and endo-5-methylbicyclo[3.2.1]octane-6,8-diones and the corresponding C-2 methoxy/hydroxy/chloro and methyl bicyclic compounds are reported. Additional ortho-methoxy substitution on the phenyl ring was found to produce considerable high field shifts of the C-10 and C-1 carbon resonances. A high-field shift was observed for the C-6 and C-8 carbonyl carbons, presumably due to 1,3-dicarbonyl interactions. The chemical shifts of C-1 aromatic, C-10 alkyl and C-2 carbons, which are sensitive to exo/endo isomerism, could be utilized in differentiating a pair of isomers.
Resumo:
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
Resumo:
The i.r. spectra of some Ln2BO4 and LnSrBO4 compounds (Ln = La, Pr, Nd, Sm or Gd;B = Fe, Al, Co or Cu) with K2NiF4 or related structures have been studied in the range 800-300 cm−1. The BO6 octahedra in compounds with K2NiF4 structure are elongated. The assignment of the bands in terms of internal modes of sheets of bridged BO6 octahedra or square-planar BO4 sheets has been considered. The observed spectra are correlated with those of solid solutions of these oxides and of LnBO3 perovskites. Unusually high stretching frequencies found in some of the oxides are discussed in terms of the short B---O bonds in the basal plane and the Ln---O bonds along the c axis.
Resumo:
The i.r. spectra of some Ln2BO4 and LnSrBO4 compounds (Ln = La, Pr, Nd, Sm or Gd;B = Fe, Al, Co or Cu) with K2NiF4 or related structures have been studied in the range 800-300 cm−1. The BO6 octahedra in compounds with K2NiF4 structure are elongated. The assignment of the bands in terms of internal modes of sheets of bridged BO6 octahedra or square-planar BO4 sheets has been considered. The observed spectra are correlated with those of solid solutions of these oxides and of LnBO3 perovskites. Unusually high stretching frequencies found in some of the oxides are discussed in terms of the short B---O bonds in the basal plane and the Ln---O bonds along the c axis.
Resumo:
This paper recasts the multiple data path assignment problem solved by Torng and Wilhelm by the dynamic programming method [1] into a minimal covering problem following a switching theoretic approach. The concept of bus compatibility for the data transfers is used to obtain the various ways of interconnecting the circuit modules with the minimum number of buses that allow concurrent data transfers. These have been called the feasible solutions of the problem. The minimal cost solutions are obtained by assigning weights to the bus-compatible sets present in the feasible solutions. Minimization of the cost of the solution by increasing the number of buses is also discussed.
Resumo:
α-Cyanothioacetamide (CTAM) complexes of cuprous chloride CuCl–2CTAM and cuprous bromide CuBr–2CTAM have been prepared. The infrared spectra of CTAM and its complexes, and the laser Raman spectrum of CTAM have been recorded. Assignment of the frequencies of the ligand has been made on the basis of a normal coordinate analysis using the Urey-Bradley force field. The copper (I) complexes are inferred to have thiocarbonyl sulfur and amide nitrogen bonded CTAM as evidenced from infrared and electronic spectra.
Resumo:
The i.r. spectra of a primary dithiocarbamate ester namely, S-methyl dithiocarbamate (SMDTC) and its N-dideuterated compound have been measured between 4000 and 30 cm−1. Spectra in solution and at liquid nitrogen temperature have also been obtained. Assignment of all the fundamentals has been proposed and supported from a full normal coordinate analysis. The band assignments for SMDTC have been compared with those of related molecules and the characteristic bands of primary thioamides are derived. Conformational flexibility of SMDTC has been examined by i.r. and proton NMR spectroscopy. The hindered rotation around the C---N bond has been studied by a complete line shape analysis. The magnitude of ---NH2 and ---CH3 torsional barriers is also estimated from vibrational frequencies and force constants.
Location of concentrators in a computer communication network: a stochastic automation search method
Resumo:
The following problem is considered. Given the locations of the Central Processing Unit (ar;the terminals which have to communicate with it, to determine the number and locations of the concentrators and to assign the terminals to the concentrators in such a way that the total cost is minimized. There is alao a fixed cost associated with each concentrator. There is ail upper limit to the number of terminals which can be connected to a concentrator. The terminals can be connected directly to the CPU also In this paper it is assumed that the concentrators can bo located anywhere in the area A containing the CPU and the terminals. Then this becomes a multimodal optimization problem. In the proposed algorithm a stochastic automaton is used as a search device to locate the minimum of the multimodal cost function . The proposed algorithm involves the following. The area A containing the CPU and the terminals is divided into an arbitrary number of regions (say K). An approximate value for the number of concentrators is assumed (say m). The optimum number is determined by iteration later The m concentrators can be assigned to the K regions in (mk) ways (m > K) or (km) ways (K>m).(All possible assignments are feasible, i.e. a region can contain 0,1,…, to concentrators). Each possible assignment is assumed to represent a state of the stochastic variable structure automaton. To start with, all the states are assigned equal probabilities. At each stage of the search the automaton visits a state according to the current probability distribution. At each visit the automaton selects a 'point' inside that state with uniform probability. The cost associated with that point is calculated and the average cost of that state is updated. Then the probabilities of all the states are updated. The probabilities are taken to bo inversely proportional to the average cost of the states After a certain number of searches the search probabilities become stationary and the automaton visits a particular state again and again. Then the automaton is said to have converged to that state Then by conducting a local gradient search within that state the exact locations of the concentrators are determined This algorithm was applied to a set of test problems and the results were compared with those given by Cooper's (1964, 1967) EAC algorithm and on the average it was found that the proposed algorithm performs better.
Resumo:
The infrared spectra of 2,4-dithiobiuret(DTB), N-deuterated dithiobiuret(DTB-d5) and the laser Raman spectrum of DTB are reported. Normal coordinate treatments of DTB and DTB-d5 have been carried out to aid the assignment of the vibrational frequencies. A trans—cis conformation is favoured for DTB molecule in the solid state.
Resumo:
Hydrologic impacts of climate change are usually assessed by downscaling the General Circulation Model (GCM) output of large-scale climate variables to local-scale hydrologic variables. Such an assessment is characterized by uncertainty resulting from the ensembles of projections generated with multiple GCMs, which is known as intermodel or GCM uncertainty. Ensemble averaging with the assignment of weights to GCMs based on model evaluation is one of the methods to address such uncertainty and is used in the present study for regional-scale impact assessment. GCM outputs of large-scale climate variables are downscaled to subdivisional-scale monsoon rainfall. Weights are assigned to the GCMs on the basis of model performance and model convergence, which are evaluated with the Cumulative Distribution Functions (CDFs) generated from the downscaled GCM output (for both 20th Century [20C3M] and future scenarios) and observed data. Ensemble averaging approach, with the assignment of weights to GCMs, is characterized by the uncertainty caused by partial ignorance, which stems from nonavailability of the outputs of some of the GCMs for a few scenarios (in Intergovernmental Panel on Climate Change [IPCC] data distribution center for Assessment Report 4 [AR4]). This uncertainty is modeled with imprecise probability, i.e., the probability being represented as an interval gray number. Furthermore, the CDF generated with one GCM is entirely different from that with another and therefore the use of multiple GCMs results in a band of CDFs. Representing this band of CDFs with a single valued weighted mean CDF may be misleading. Such a band of CDFs can only be represented with an envelope that contains all the CDFs generated with a number of GCMs. Imprecise CDF represents such an envelope, which not only contains the CDFs generated with all the available GCMs but also to an extent accounts for the uncertainty resulting from the missing GCM output. This concept of imprecise probability is also validated in the present study. The imprecise CDFs of monsoon rainfall are derived for three 30-year time slices, 2020s, 2050s and 2080s, with A1B, A2 and B1 scenarios. The model is demonstrated with the prediction of monsoon rainfall in Orissa meteorological subdivision, which shows a possible decreasing trend in the future.
Resumo:
The sequence distribution studies on the acrylonitrile-methylmethacrylate copolymer of high methylmethacrylate (M) content (30%
Resumo:
Oxidation of spiroketones 3a–f with DDQ in dry benzene gave tropone derivatives 4a–f and DDHQ esters 5a–f (cis -cis isomer 6a–f, (cis -cis isomer 7a–f). While the aryl substituted spirokeone 17a gave a 2:1 mixture of 19a and the corresponding trans -trans isomer, the aryl substituted spiroketones 17b–d gave exclusively trans-trans isomers 19b–d. Heating acid chloride of acid 9c with DDHQ resulted in compounds 4a and 7a, thus confirming the structures assigned. Mechanism of formation of these compounds has been rationalised. A detailed study of 2D 1H-1H COSY, 1H-13C COSY, HMBC and 2D NOESY of compound 7d led to complete assignment of 1H and 13C NMR signals and its solution conformation.
Resumo:
Rate-constrained power minimization (PMIN) over a code division multiple-access (CDMA) channel with correlated noise is studied. PMIN is. shown to be an instance of a separable convex optimization problem subject to linear ascending constraints. PMIN is further reduced to a dual problem of sum-rate maximization (RMAX). The results highlight the underlying unity between PMIN, RMAX, and a problem closely related to PMIN but with linear receiver constraints. Subsequently, conceptually simple sequence design algorithms are proposed to explicitly identify an assignment of sequences and powers that solve PMIN. The algorithms yield an upper bound of 2N - 1 on the number of distinct sequences where N is the processing gain. The sequences generated using the proposed algorithms are in general real-valued. If a rate-splitting and multi-dimensional CDMA approach is allowed, the upper bound reduces to N distinct sequences, in which case the sequences can form an orthogonal set and be binary +/- 1-valued.
Resumo:
The stepwise synthesis of amino terminal pentapeptide of alamethicin, Z-Aib-Pro-Aib-Ala-Aib-OMe, by the dicyclohexylcarbodiimide mediated couplings leads to extensive racemization at the Ala and Pro residues. Racemization is largely suppressed by the use of additives like N-hydroxysuccinimide and 1-hydroxybenzotriazole. The presence of diastereomeric peptides may be detected by the observation of additional methyl ester and benzylic methylene signals in the 270 MHz 1H NMR spectra. Unambiguous spectral assignment of the signals to the diastereomers has been carried out by the synthesis and NMR studies of the D-Ala tetra and pentapeptides. The racemization at Pro is of particular relevance in view of the reported lack of inversion at C-terminal Pro on carboxyl activation.
Resumo:
In this paper, new results and insights are derived for the performance of multiple-input, single-output systems with beamforming at the transmitter, when the channel state information is quantized and sent to the transmitter over a noisy feedback channel. It is assumed that there exists a per-antenna power constraint at the transmitter, hence, the equal gain transmission (EGT) beamforming vector is quantized and sent from the receiver to the transmitter. The loss in received signal-to-noise ratio (SNR) relative to perfect beamforming is analytically characterized, and it is shown that at high rates, the overall distortion can be expressed as the sum of the quantization-induced distortion and the channel error-induced distortion, and that the asymptotic performance depends on the error-rate behavior of the noisy feedback channel as the number of codepoints gets large. The optimum density of codepoints (also known as the point density) that minimizes the overall distortion subject to a boundedness constraint is shown to be the same as the point density for a noiseless feedback channel, i.e., the uniform density. The binary symmetric channel with random index assignment is a special case of the analysis, and it is shown that as the number of quantized bits gets large the distortion approaches the same as that obtained with random beamforming. The accuracy of the theoretical expressions obtained are verified through Monte Carlo simulations.