Nonhomogeneous subalgebras of Lie and special Jordan superalgebras

We consider polynomial identities satisfied by nonhomogeneous subalgebras of Lie and special Jordan superalgebras: we ignore the grading and regard the superalgebra as an ordinary algebra. The Lie case has been studied by Volichenko and Baranov: they found identities in degrees 3, 4 and 5 which imply all the identities in degrees <= 6. We simplify their identities in degree 5, and show that there are no new identities in degree 7. The Jordan case has not previously been studied: we find identities in degrees 3, 4, 5 and 6 which imply all the identities in degrees <= 6, and demonstrate the existence of further new identities in degree 7. our proofs depend on computer algebra: we use the representation theory of the symmetric group, the Hermite normal form of an integer matrix, the LLL algorithm for lattice basis reduction, and the Chinese remainder theorem. (C) 2009 Elsevier Inc. All rights reserved.

Thermo-solvatochromism of merocyanine polarity probes - What are the consequences of increasing probe lipophilicity through annelation?

The question raised in the title has been answered by comparing the solvatochromism of two series of polarity probes, the lipophilicities of which were increased either by increasing the length of an alkyl group (R) attached to a fixed pyridine-based structure or through annelation (i.e., by fusing benzene rings onto a central pyridine-based structure). The following novel solvatochromic probes were synthesized: 2,6-dibromo-4-[(E)-2-(1-methylquinolinium-4-yl)ethenyl]-phenolate (MeQMBr(2)) and 2,6-dibromo-4-[(E)-2-(1-methyl-acridinium-4- yl) ethenyl)]phenolate (MeAMBr(2) The solvatochromic behavior of these probes, along with that of 2,6dibromo-4-[(E)-2-(1-methylpyridinium-4-yl)ethenyl]phenol-ate(MePMBr(2)) was analyzed in terms of increasing probe lipophilicity, through annelation. Values of the empirical solvent polarity scale [E(T)(MePMBr(2))] in kcalmol(-1) correlated linearly with ET(30), the corresponding values for the extensively employed probe 2,6-diphenyl-4-(2,4,6-triphenylpyridinium-1-yl)phenolate (RB). On the other hand, the nonlinear correlations of ET(MeQMBr(2)) or ET(MeAMBr(2)) with E(T)(30) are described by second-order polynomials. Possible reasons for this behavior include: i) self-aggregation of the probe, ii) photoinduced cis/trans isomerization of the dye, and iii) probe structure- and solvent-dependent contributions of the quinonoid and zwitterionic limiting formulas to the ground and excited states of the probe. We show that mechanisms (i) and (ii) are not operative under the experimental conditions employed; experimental evidence (NMR) and theoretical calculations are presented to support the conjecture that the length of the central ethenylic bond in the dye increases in the order MeAMBr(2) > MeQMBr(2) > MePMBr(2), That is, the contribution of the zwitterionic limiting formula predominates for the latter probe, as is also the case for RB, this being the reason for the observed linear correlation between the ET(MePMBr2) and the ET(30) scales. The effect of increasing probe lipophilicity on solvatochromic behavior therefore depends on the strategy employed. Increasing the length of R affects solvatochromism much less than annelation, because the former structural change hardly perturbs the energy of the intramolecular charge-transfer transition responsible for solvatochromism. The thermo-solvatochromic behavior (effect of temperature on solvatochromism) of the three probes was studied in mixtures of water with propanol and/or with DMSO. The solvation model used explicitly considers the presence of three ""species"" in the system: bulk solution and probe solvation shell [namely, water (W), organic solvent (Solv)], and solvent-water hydrogen-bonded aggregate (Solv-W). For aqueous propanol, the probe is efficiently solvated by Solv-W; the strong interaction of DMSO with W drastically decreases the efficiency of Solv-W in solvating the probe, relative to its precursor solvents. Temperature increases resulted in desolvation of the probes, due to the concomitant reduction in the structured characters of the components of the binary mixtures.

The determination of all syzygies for the dependent polynomial invariants of the Riemann Tensor. II. mixed invariants of Eeven degree in the Ricci Spinor

We continue our analysis of the polynomial invariants of the Riemann tensor in a four-dimensional Lorentzian space. We concentrate on the mixed invariants of even degree in the Ricci spinor Φ_ABȦḂ and show how, using constructive graph-theoretic methods, arbitrary scalar contractions between copies of the Weyl spinor ψ_ABCD, its conjugate ψ_ȦḂĊḊ and an even number of Ricci spinors can be expressed in terms of paired contractions between these spinors. This leads to an algorithm for the explicit expression of dependent invariants as polynomials of members of the complete set. Finally, we rigorously prove that the complete set as given by Sneddon [J. Math. Phys. 39, 1659-1679 (1998)] for this case is both complete and minimal.

Conditions to ensure the 2-D characteristic polynomial of uncertain matrix is very strict Hurwitz

This article derives some new conditions for the bivariate characteristic
polynomial of an uncertain matrix to be very strict Hurwitz. The uncertainties are assumed of the structured and unstructured type. Using the two-dimensional inverse Laplace transform, we derive the bounds on the uncertainties, which will ensure that the bivariate characteristic polynomial is very strict Hurwitz. Two numerical examples are given to illustrate the results.

Multi-wavelets from B-spline super-functions with approximation order

Approximation order is an important feature of all wavelets. It implies that polynomials up to degree p−1 are in the space spanned by the scaling function(s). In the scalar case, the scalar sum rules determine the approximation order or the left eigenvectors of the infinite down-sampled convolution matrix H determine the combinations of scaling functions required to produce the desired polynomial. For multi-wavelets the condition for approximation order is similar to the conditions in the scalar case. Generalized left eigenvectors of the matrix H_f; a finite portion of H determines the combinations of scaling functions that produce the desired superfunction from which polynomials of desired degree can be reproduced. The superfunctions in this work are taken to be B-splines. However, any refinable function can serve as the superfunction. The condition of approximation order is derived and new, symmetric, compactly supported and orthogonal multi-wavelets with approximation orders one, two, three and four are constructed.

Robust strictly positive real synthesis of polynomial segments for discrete time systems

By using the result of robust strictly positive real synthesis of polynomial segments for continuous time systems, it is proved that, for any two n-th order polynomials a(z) and b(z), the Schur stability of their convex combination is necessary and sufficient for the existence of an n-th order polynomial c(z) such that c(z)/a(z) and c(z)/b(z) are both strictly positive real. We also provide the construction method of c(z). Illustrative examples are provided to show the effectiveness of this method.

Necessary and sufficient conditions for robust oscillatory stability

The problem of robust oscillatory stability of uncertain systems is investigated in this article. For the uncertain systems, whose characteristic polynomial sets belong to the interval polynomial family or diamond polynomial family, sufficient and necessary conditions are given based on the stability and/or oscillation properties of some special extreme point polynomials. A systematic approach exploiting Yang's complete discrmination system is proposed to check the robust oscillatory stability of such uncertain systems. The proposed method is efficient in computation and can be easily implemented.

Syzygies of the polynomial invariants of the Riemann tensor

This thesis introduces a novel way of writing polynomial invariants as network graphs, and applies this diagrammatic notation scheme, in conjunction with graph theory, to derive algorithms for constructing relationships (syzygies) between different invariants. These algorithms give rise to a constructive solution of a longstanding classical problem in invariant theory.

Identification of nonlinear systems using hybrid functions

Most real systems have nonlinear behavior and thus model linearization may not produce an accurate representation of them. This paper presents a method based on hybrid functions to identify the parameters of nonlinear real systems. A hybrid function is a combination of two groups of orthogonal functions: piecewise orthogonal functions (e.g. Block-Pulse) and continuous orthogonal functions (e.g. Legendre polynomials). These functions are completed with an operational matrix of integration and a product matrix. Therefore, it is possible to convert nonlinear differential and integration equations into algebraic equations. After mathematical manipulation, the unknown linear and nonlinear parameters are identified. As an example, a mechanical system with single degree of freedom is simulated using the proposed method and the results are compared against those of an existing approach.

Laguerre Runge-Kutta-Fehlberg method for simulating laser pulse propagation in biological tissue

An efficient algorithm for solving the transient radiative transfer equation for laser pulse propagation in biological tissue is presented. A Laguerre expansion is used to represent the time dependency of the incident short pulse. The Runge–Kutta– Fehlberg method is used to solve the intensity. The discrete ordinates method is used to discretize with respect to azimuthal and zenith angles. This method offers the advantages of representing the intensity with a high accuracy using only a few Laguerre polynomials, and straightforward extension to inhomogeneous media. Also, this formulation can be easily extended for solving the 2-D and 3-D transient radiative transfer equations.

Key predistribution scheme using finite fields and reed muller codes

Resource constraint sensors of a Wireless Sensor Network (WSN) cannot afford the use of costly encryption techniques like public key while dealing with sensitive data. So symmetric key encryption techniques are preferred where it is essential to have the same cryptographic key between communicating parties. To this end, keys are preloaded into the nodes before deployment and are to be established once they get deployed in the target area. This entire process is called key predistribution. In this paper we propose one such scheme using unique factorization of polynomials over Finite Fields. To the best of our knowledge such an elegant use of Algebra is being done for the first time in WSN literature. The best part of the scheme is large number of node support with very small and uniform key ring per node. However the resiliency is not good. For this reason we use a special technique based on Reed Muller codes proposed recently by Sarkar, Saha and Chowdhury in 2010. The combined scheme has good resiliency with huge node support using very less keys per node.

Detection of curved edges at subpixel accuracy using deformable models

One approach to the detection of curves at subpixel accuracy involves the reconstruction of such features from subpixel edge data points. A new technique is presented for reconstructing and segmenting curves with subpixel accuracy using deformable models. A curve is represented as a set of interconnected Hermite splines forming a snake generated from the subpixel edge information that minimizes the global energy functional integral over the set. While previous work on the minimization was mostly based on the Euler-Lagrange transformation, the authors use the finite element method to solve the energy minimization equation. The advantages of this approach over the Euler-Lagrange transformation approach are that the method is straightforward, leads to positive m-diagonal symmetric matrices, and has the ability to cope with irregular geometries such as junctions and corners. The energy functional integral solved using this method can also be used to segment the features by searching for the location of the maxima of the first derivative of the energy over the elementary curve set.

Direct method for optimal power management in hybrid electric vehicles

Hybrid electric vehicles are powered by an electric system and an internal combustion engine. The components of a hybrid electric vehicle need to be coordinated in an optimal manner to deliver the desired performance. This paper presents an approach based on direct method for optimal power management in hybrid electric vehicles with inequality constraints. The approach consists of reducing the optimal control problem to a set of algebraic equations by approximating the state variable which is the energy of electric storage, and the control variable which is the power of fuel consumption. This approximation uses orthogonal functions with unknown coefficients. In addition, the inequality constraints are converted to equal constraints. The advantage of the developed method is that its computational complexity is less than that of dynamic and non-linear programming approaches. Also, to use dynamic or non-linear programming, the problem should be discretized resulting in the loss of optimization accuracy. The propsed method, on the other hand, does not require the discretization of the problem producing more accurate results. An example is solved to demonstrate the accuracy of the proposed approach. The results of Haar wavelets, and Chebyshev and Legendre polynomials are presented and discussed. © 2011 The Korean Society of Automotive Engineers and Springer-Verlag Berlin Heidelberg.

Analyzing track sprint cyclists' performances using position-specific maximal-torque and power-cadence relationships

Previous studies have demonstrated the importance of maximal Torque-Cadence (T-C) and Power-Cadence (P-C) relationships, for the performances of world class track sprint cyclists. If these relationships are affected by the function of the lower limb muscles, the ability of cyclists to generate torque and power at a given cadence may vary depending on their riding position. During sprint events (individual and team sprints and Keirin), cyclists alternate between standing and seated positions. The T-C and P-C relationships may change with the position adopted by the cyclists. PURPOSE: The aim of this study was to evaluate the necessity to define position specific maximal T-C and P-C relationships. METHODS: Eight junior elite track cyclists from the National Talent Identification squad undertook two inertial-load tests that consisted of four all-out sprints each. One test was undertaken at the velodrome in a standing position on a carbon fibre track bike, and the other test was completed in a seated position on an air-braked stationary ergometer. A calibrated SRM power meter interfaced to a custom instrumentation package was used for all mechanical measurements. Maximal T-C and P-C relationships were analysed to calculate maximal Torque (T0), maximal Power (Pmax) and optimal pedalling cadence (PCopt). RESULTS: All individual T-C and P-C relationships obtained for both body positions were fitted by linear regressions (r2=0.95 ± 0.02) and second order polynomials (r2=0.96 ± 0.01), respectively. T0 was higher (209 ± 2.2N.m vs. 177.0 ± 3.9N.m, p<0.05), PCopt was lower (112.5 ± 11.4rpm vs. 120.1 ± 6.7rpm, p<0.05), and Pmax was higher (1261 ± 235W vs. 1076 ± 183W, p<0.05) in standing position compared to seated position. CONCLUSION: Analysis of track sprint cyclists’ performances can be improved by the determination of position-specific maximal T-C and P-C relationships .

A data mining application of the incidence semirings

This paper is devoted to a combinatorial problem for incidence semirings, which can be viewed as sets of polynomials over graphs, where the edges are the unknowns and the coefficients are taken from a semiring. The construction of incidence rings is very well known and has many useful applications. The present article is devoted to a novel application of the more general incidence semirings. Recent research on data mining has motivated the investigation of the sets of centroids that have largest weights in semiring constructions. These sets are valuable for the design of centroid-based classification systems, or classifiers, as well as for the design of multiple classifiers combining several individual classifiers. Our article gives a complete description of all sets of centroids with the largest weight in incidence semirings.