Self-assembly of three new coordination complexes: Formation of 2-D square grid, 1-D chain and tape structures

Three distinct coordination complexes, viz., [Co(imi)(2)(tmb)(2)] (1) [where imi = imidazole], {[Ni(tmb)(2)(H2O)(3)]center dot 2H(2)O}(n) (2) and [Cu-2(mu-tmb)(4)(CH3OH)(2)] (3), have been synthesized hydrothermally by the reactions of metal acetates,2,4,6-trimethylbenzoic acid (Htmb) and with or without appropriate amine. The Ni analogue of 1 and the Co analogue of 2 have also been synthesized. X-ray single-crystal diffraction suggests that complex 1 represents discrete mononuclear species and complex 2 represents a 1D chain coordination polymer in which the Ni(H) ions are connected by the bridging water molecules. Complex 3 represents a neutral dinuclear complex. In 1, the central metal ions are associated by the carboxylate moiety and imidazole ligands, whereas the central metal atom is coordinated to the carboxylate moiety and the respective solvent molecules in 2 and 3. In 3, the four 2,4,6-trimethylbenzoate moieties act as a bridge connecting two copper (11) ions and the 0 atoms of methanol coord geometry, with the methanol molecule at the apical position. In all the three structures the central metal atom sits on a crystallographic inversion centre. In all the cases, the coordination entities are further organized via hydrogen bonding interactions to generate multifarious supramolecular networks. Complexes 1, 2 and 3 have also been characterized by spectroscopic (UV/Vis and IR) and thermal analysis (TGA). In addition, the complexes were found to exhibit antimicrobial activity. The magnetic susceptibility measurements, measured from 8 to 300 K, revealed antiferromagnetic interactions between the Co(II) ions in compound 1 and the Ni(II) ions in la, respectively.

A hybrid clustering procedure for concentric and chain-like clusters

K-means algorithm is a well known nonhierarchical method for clustering data. The most important limitations of this algorithm are that: (1) it gives final clusters on the basis of the cluster centroids or the seed points chosen initially, and (2) it is appropriate for data sets having fairly isotropic clusters. But this algorithm has the advantage of low computation and storage requirements. On the other hand, hierarchical agglomerative clustering algorithm, which can cluster nonisotropic (chain-like and concentric) clusters, requires high storage and computation requirements. This paper suggests a new method for selecting the initial seed points, so that theK-means algorithm gives the same results for any input data order. This paper also describes a hybrid clustering algorithm, based on the concepts of multilevel theory, which is nonhierarchical at the first level and hierarchical from second level onwards, to cluster data sets having (i) chain-like clusters and (ii) concentric clusters. It is observed that this hybrid clustering algorithm gives the same results as the hierarchical clustering algorithm, with less computation and storage requirements.

Precise Values of the "C Component Vicinal Coupling Constants for Calculating Side-Chain Conformations in Amino Acids

From consideration of 'H-lH vicinal coupling constants and '"G'H long-range coupling constants in a series of amino acid derivatives, the precise values of uC component vicinal coupling constants have been calculated for the three minimum energy staggered rotamers for the C(or)H-C(P)H, side-chains of amino acids.

A linear ramp control circuit using two LM 556 dual timers

A simple linear ramp control circuit, suitable for use with force-commutated thyrister circuits is discussed here. The circuit is based on only two IM 558 dual timer iCs, operating from a single 15 V supply. The reset terminals facilitate inhibition of the output of any stage. The use of this circuit in a thyristor chopper operating at 400 Hz 13 described.

A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

A branch and bound type algorithm is presented in this paper to the problem of finding a transportation schedule which minimises the total transportation cost, where the transportation cost over each route is assumed to be a piecewice linear continuous convex function with increasing slopes. The algorithm is an extension of the work done by Balachandran and Perry, in which the transportation cost over each route is assumed to beapiecewise linear discontinuous function with decreasing slopes. A numerical example is solved illustrating the algorithm.

A Gaussian quadrature analysis of linear sweep voltammetry

The application of Gaussian Quadrature (GQ) procedures to the evaluation of i—E curves in linear sweep voltammetry is advocated. It is shown that a high degree of precision is achieved with these methods and the values obtained through GQ are in good agreement with (and even better than) the values reported in literature by Nicholson-Shain, for example. Another welcome feature with GQ is its ability to be interpreted as an elegant, efficient analytic approximation scheme too. A comparison of the values obtained by this approach and by a recent scheme based on series approximation proposed by Oldham is made and excellent agreement is shown to exist.

Self-tuning control of a class of multivariable non-linear systems

Self-tuning is applied to the minimum variance control of non-linear multivariable systems which can be characterized by a ' multivariable Hammerstein model '. It is also shown that such systems are not amenable to self-tuning control if control costing is to be included in the performance criterion.

Multiaction learning automata possessing ergodicity of the mean

Multiaction learning automata which update their action probabilities on the basis of the responses they get from an environment are considered in this paper. The automata update the probabilities according to whether the environment responds with a reward or a penalty. Learning automata are said to possess ergodicity of the mean if the mean action probability is the state probability (or unconditional probability) of an ergodic Markov chain. In an earlier paper [11] we considered the problem of a two-action learning automaton being ergodic in the mean (EM). The family of such automata was characterized completely by proving the necessary and sufficient conditions for automata to be EM. In this paper, we generalize the results of [11] and obtain necessary and sufficient conditions for the multiaction learning automaton to be EM. These conditions involve two families of probability updating functions. It is shown that for the automaton to be EM the two families must be linearly dependent. The vector defining the linear dependence is the only vector parameter which controls the rate of convergence of the automaton. Further, the technique for reducing the variance of the limiting distribution is discussed. Just as in the two-action case, it is shown that the set of absolutely expedient schemes and the set of schemes which possess ergodicity of the mean are mutually disjoint.

Biosynthesis of Long-Chain Alcohols by Developing and Regenerating Rat Sciatic Nerve

Cell-free preparations of rat sciatic nerve were found to catalyze the reduction of fatty acid to alcohol in the presence of NADPH as reducing cofactor. The reductase was membrane-bound and associated primarily with the microsomal fraction. When fatty acid was the substrate, ATP, coenzyme A (CoA), and Mg2+ were required, indicating the formation of acyl CoA prior to reduction. When acyl CoA was used as substrate, the presence of albumin was required to inhibit acyl CoA hydro-lase activity. Fatty acid reductase activity was highest with palmitic and stearic acids, and somewhat lower with lauric and myristic acids. It was inhibited by sulfhydryl reagents, indicating the participation of thiol groups in the reduction. Only traces of long-chain aldehyde could be detected or trapped as semicarbazone. Fatty acid reductase activity in rat sciatic nerve was highest between the second and tenth days after birth and decreased substantially thereafter. Microsomal preparations of sciatic nerve from 10-day-old rats exhibited about four times higher fatty acid reductase activity than brain or spinal cord microsomes from the same animals. Wallerian degeneration and regeneration of adult rat sciatic nerve resulted in enhanced fatty acid reductase activity, which reached a maximum at about 12 days after crush injury.

Observers for linear systems with unknown inputs

This paper presents a constructive solution to the problem of designing a reduced-order Luenberger observer for linear systems subject to arbitrary unknown inputs.

A Fredholm-type theory for third-kind linear integral equations

The third-kind linear integral equation Image where g(t) vanishes at a finite number of points in (a, b), is considered. In general, the Fredholm Alternative theory [[5.]] does not hold good for this type of integral equation. However, imposing certain conditions on g(t) and K(t, t′), the above integral equation was shown [[1.], 49–57] to obey a Fredholm-type theory, except for a certain class of kernels for which the question was left open. In this note a theory is presented for the equation under consideration with some additional assumptions on such kernels.

Approximate analysis of coupled non-linear non-conservative systems subjected to step-function excitation

The paper deals with the approximate analysis of non-linear non-conservative systems oftwo degrees of freedom subjected to step-function excitation. The method of averaging of Krylov and Bogoliubov is used to arrive at the approximate equations for amplitude and phase. An example of a spring-mass-damper system is presented to illustrate the method and a comparison with numerical results brings out the validity of the approach.

Identification of a class of non-linear systems

This paper considers the on-line identification of a non-linear system in terms of a Hammerstein model, with a zero-memory non-linear gain followed by a linear system. The linear part is represented by a Laguerre expansion of its impulse response and the non-linear part by a polynomial. The identification procedure involves determination of the coefficients of the Laguerre expansion of correlation functions and an iterative adjustment of the parameters of the non-linear gain by gradient methods. The method is applicable to situations involving a wide class of input signals. Even in the presence of additive correlated noise, satisfactory performance is achieved with the variance of the error converging to a value close to the variance of the noise. Digital computer simulation establishes the practicability of the scheme in different situations.

Linear description of electrical networks for computer analysis

A parentheses-free code is suggested for the description of two-terminal electrical networks for computer analysis.

Paraxial Maxwell beams: transformation by general linear optical systems

Extending the work of earlier papers on the relativistic-front description of paraxial optics and the formulation of Fourier optics for vector waves consistent with the Maxwell equations, we generalize the Jones calculus of axial plane waves to describe the action of the most general linear optical system on paraxial Maxwell fields. Several examples are worked out, and in each case it is shown that the formalism leads to physically correct results. The importance of retaining the small components of the field vectors along the axis of the system for a consistent description is emphasized.