Hamilton’s theory of turns and a new geometrical representation for polarization optics

Hamilton’s theory of turns for the group SU(2) is exploited to develop a new geometrical representation for polarization optics. While pure polarization states are represented by points on the Poincaré sphere, linear intensity preserving optical systems are represented by great circle arcs on another sphere. Composition of systems, and their action on polarization states, are both reduced to geometrical operations. Several synthesis problems, especially in relation to the Pancharatnam-Berry-Aharonov-Anandan geometrical phase, are clarified with the new representation. The general relation between the geometrical phase, and the solid angle on the Poincaré sphere, is established.

Effective action and adiabatic expansions for the 1-D and 2-D hubbard models at half-filling

We analyze here the occurrence of antiferromagnetic (AFM) correlations in the half-filled Hubbard model in one and two space dimensions using a natural fermionic representation of the model and a newly proposed way of implementing the half-filling constraint. We find that our way of implementing the constraint is capable of enforcing it exactly already at the lowest levels of approximation. We discuss how to develop a systematic adiabatic expansion for the model and how Berry's phase contributions arise quite naturally from the adiabatic expansion. At low temperatures and in the continuum limit the model gets mapped onto an O(3) nonlinear sigma model (NLsigma). A topological, Wess-Zumino term is present in the effective action of the ID NLsigma as expected, while no topological terms are present in 2D. Some specific difficulties that arise in connection with the implementation of an adiabatic expansion scheme within a thermodynamic context are also discussed, and we hint at possible solutions.

Human action recognition using a fast learning fully complex-valued classifier

In this paper, we use optical flow based complex-valued features extracted from video sequences to recognize human actions. The optical flow features between two image planes can be appropriately represented in the Complex plane. Therefore, we argue that motion information that is used to model the human actions should be represented as complex-valued features and propose a fast learning fully complex-valued neural classifier to solve the action recognition task. The classifier, termed as, ``fast learning fully complex-valued neural (FLFCN) classifier'' is a single hidden layer fully complex-valued neural network. The neurons in the hidden layer employ the fully complex-valued activation function of the type of a hyperbolic secant function. The parameters of the hidden layer are chosen randomly and the output weights are estimated as the minimum norm least square solution to a set of linear equations. The results indicate the superior performance of FLFCN classifier in recognizing the actions compared to real-valued support vector machines and other existing results in the literature. Complex valued representation of 2D motion and orthogonal decision boundaries boost the classification performance of FLFCN classifier. (c) 2012 Elsevier B.V. All rights reserved.

Subject independent human action recognition using spatio-depth information and meta-cognitive RBF network

In this paper, we present a machine learning approach for subject independent human action recognition using depth camera, emphasizing the importance of depth in recognition of actions. The proposed approach uses the flow information of all 3 dimensions to classify an action. In our approach, we have obtained the 2-D optical flow and used it along with the depth image to obtain the depth flow (Z motion vectors). The obtained flow captures the dynamics of the actions in space time. Feature vectors are obtained by averaging the 3-D motion over a grid laid over the silhouette in a hierarchical fashion. These hierarchical fine to coarse windows capture the motion dynamics of the object at various scales. The extracted features are used to train a Meta-cognitive Radial Basis Function Network (McRBFN) that uses a Projection Based Learning (PBL) algorithm, referred to as PBL-McRBFN, henceforth. PBL-McRBFN begins with zero hidden neurons and builds the network based on the best human learning strategy, namely, self-regulated learning in a meta-cognitive environment. When a sample is used for learning, PBLMcRBFN uses the sample overlapping conditions, and a projection based learning algorithm to estimate the parameters of the network. The performance of PBL-McRBFN is compared to that of a Support Vector Machine (SVM) and Extreme Learning Machine (ELM) classifiers with representation of every person and action in the training and testing datasets. Performance study shows that PBL-McRBFN outperforms these classifiers in recognizing actions in 3-D. Further, a subject-independent study is conducted by leave-one-subject-out strategy and its generalization performance is tested. It is observed from the subject-independent study that McRBFN is capable of generalizing actions accurately. The performance of the proposed approach is benchmarked with Video Analytics Lab (VAL) dataset and Berkeley Multimodal Human Action Database (MHAD). (C) 2013 Elsevier Ltd. All rights reserved.

Mycobacterium tuberculosis pantothenate kinase: possible changes in location of ligands during enzyme action

The crystal structures of complexes of Mycobacterium tuberculosis pantothenate kinase with the following ligands have been determined: (i) citrate; (ii) the nonhydrolysable ATP analogue AMPPCP and pantothenate (the initiation complex); (iii) ADP and phosphopantothenate resulting from phosphorylation of pantothenate by ATP in the crystal (the end complex); (iv) ATP and ADP, each with half occupancy, resulting from a quick soak of crystals in ATP (the intermediate complex); (v) CoA; (vi) ADP prepared by soaking and cocrystallization, which turned out to have identical structures, and (vii) ADP and pantothenate. Solution studies on CoA binding and catalytic activity have also been carried out. Unlike in the case of the homologous Escherichia coli enzyme, AMPPCP and ADP occupy different, though overlapping, locations in the respective complexes; the same is true of pantothenate in the initiation complex and phosphopantothenate in the end complex. The binding site of MtPanK is substantially preformed, while that of EcPanK exhibits considerabl plasticity. The difference in the behaviour of the E. coli and M. tuberculosis enzymes could be explained in terms of changes in local structure resulting from substitutions. It is unusual for two homologous enzymes to exhibit such striking differences in action. Therefore, the results have to be treated with caution. However, the changes in the locations of ligands exhibited by M. tuberculosis pantothenate kinase are remarkable and novel.

Xylan-Degrading Enzymes from the Thermophilic Fungus Humicola Zanuginosa (Griffon and Maublanc) Bunce: Action Pattern of Xylanase and beta-Glucosidase on Xylans, Xylooligomers and Arabinoxylooligomers

The mode of action of xylanase and beta-glucosidase purified from the culture filtrate of Humicola lanuginosa (Griffon and Maublanc) Bunce on the xylan extracted from sugarcane bagasse and on two commercially available larchwood and oat spelt xylans, on xylooligomers and on arabinoxylooligomers was studied. While larchwood and oat spelt xylans were hydrolyzed to the same extent in 24 h, sugarcane bagasse xylan was hydrolyzed to a lesser extent in the same period. It was found that the rate of hydrolysis of xylooligomers by xylanase increased with increase in chain length, while beta-glucosidase acted rather slowly on all the oligomers tested. Xylanase exhibited predominant ''endo'' action on xylooligomers attacking the xylan chain at random while beta-glucosidase had ''exo'' action, releasing one xylose residue at a time. On arabinoxylooligomers, however, xylanase exhibited ''exo'' action. Thus, it appears that the presence of the arabinose substituent has, in some way, rendered the terminal xylose-xylose linkage more susceptible to xylanase action. It was also observed that even after extensive hydrolysis with both the enzymes, substantial amounts of the parent arabinoxylooligomer remained unhydrolyzed together with the accumulation of arabinoxylobiose. It can therefore be concluded that the presence of the arabinose substituent in the xylan chain results in linkages that offer resistance to both xylanase and beta-glucosidase action.

Action of Transition Metal Oxides on Composite Solid Propellants

The catalytic effects of Fe2O3, Ni2O3, MnO2, and Co2O3 transition metal oxides (TMO) on the combustion of polystyrene and carboxyl-terminated polybutadiene were investigated. The order of activity of TMO's was explained by the presence of Co and absence of Fe and Ni in their lattice systems along with a reduced electron-transfer process; in systems which induce the metal ions to enter the lattice, the electron transfer process is much greater. The thermal decomposition of ammonium perchlorate propellants was enhanced to a greater extent by Co2O3 and MnO2 than by Fe2O3 and Ni2O3.

Space and time efficiency of the forest-of-quadtrees representation

A forest of quadtrees is a refinement of a quadtree data structure that is used to represent planar regions. A forest of quadtrees provides space savings over regular quadtrees by concentrating vital information. The paper presents some of the properties of a forest of quadtrees and studies the storage requirements for the case in which a single 2m × 2m region is equally likely to occur in any position within a 2n × 2n image. Space and time efficiency are investigated for the forest-of-quadtrees representation as compared with the quadtree representation for various cases.

Paracrine action of sFLT-1 secreted by stably-transfected Ehrlich ascites tumor cells and therapy using sFLT-1 inhibits ascites tumor growth in vivo

Background Vascular endothelial growth factor (VEGF) is known to play a major role in angiogenesis. A soluble form of Flt-1, a VEGF receptor, is potentially useful as an antagonist of VEGF, and accumulating evidence suggests the applicability of sFlt-1 in tumor suppression. In the present study, we have developed and tested strategies targeted specifically to VEGF for the treatment of ascites formation.Methods As an initial strategy, we produced recombinant sFLT-1 in the baculovirus expression system and used it as a trap to sequester VEGF in the murine ascites carcinoma model. The effect of the treatment on the weight of the animal, cell number, ascites volume and proliferating endothelial cells was studied. The second strategy involved, producing Ehrlich ascites tumor (EAT) cells stably transfected with vectors carrying cDNA encoding truncated form of Flt-1 and using these cells to inhibit ascites tumors in a nude mouse model. Results The sFLT-1 produced by the baculovirus system showed potent antiangiogenic activity as assessed by rat cornea and tube formation assay. sFLT-1 treatment resulted in reduced peritoneal angiogenesis with a concomitant decrease in tumor cell number, volume of ascites, amount of free VEGF and the number of invasive tumor cells as assayed by CD31 staining. EAT cells stably transfected with truncated form of Flt-1 also effectively reduced the tumor burden in nude mice transplanted with these cells, and demonstrated a reduction in ascites formation and peritoneal angiogenesis. Conclusions The inhibition of peritoneal angiogenesis and tumor growth by sequestering VEGF with either sFlt-1 gene expression by recombinant EAT cells or by direct sFLT-1 protein therapy is shown to comprise a potential therapy. Copyright (C) 2009 John Wiley & Sons, Ltd.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Comment on path integration of a quadratic action with a generalized memory

Using the promeasure technique, we give an alternative evaluation of a path integral corresponding to a quadratic action with a generalized memory.

Linear time geometrical design rule checker based on quadtree representation of VLSI mask layouts

An efficient geometrical design rule checker is proposed, based on operations on quadtrees, which represent VLSI mask layouts. The time complexity of the design rule checker is O(N), where N is the number of polygons in the mask. A pseudoPascal description is provided of all the important algorithms for geometrical design rule verification.

Reflexive Incidence Matrx (RIM) Representation of Petr Nets

Although incidence matrix representation has been used to analyze the Petri net based models of a system, it has the limitation that it does not preserve reflexive properties (i.e., the presence of selfloops) of Petri nets. But in many practical applications self-loops play very important roles. This paper proposes a new representation scheme for general Petri nets. This scheme defines a matrix called "reflexive incidence matrix (RIM) c which is a combination of two matrices, a "base matrix Cb,,, and a "power matrix CP." This scheme preserves the reflexive and other properties of the Petri nets. Through a detailed analysis it is shown that the proposed scheme requires less memory space and less processing time for answering commonly encountered net queries compared to other schemes. Algorithms to generate the RIM from the given net description and to decompose RIM into input and output function matrices are also given. The proposed Petri net representation scheme is very useful to model and analyze the systems having shared resources, chemical processes, network protocols, etc., and to evaluate the performance of asynchronous concurrent systems.

Representation of functional dependencies in relational databases using linear graphs

Functional dependencies in relational databases are investigated. Eight binary relations, viz., (1) dependency relation, (2) equipotence relation, (3) dissidence relation, (4) completion relation, and dual relations of each of them are described. Any one of these eight relations can be used to represent the functional dependencies in a database. Results from linear graph theory are found helpful in obtaining these representations. The dependency relation directly gives the functional dependencies. The equipotence relation specifies the dependencies in terms of attribute sets which functionally determine each other. The dissidence relation specifies the dependencies in terms of saturated sets in a very indirect way. Completion relation represents the functional dependencies as a function, the range of which turns out to be a lattice. Depletion relation which is the dual of the completion relation can also represent functional dependencies and similarly can the duals of dependency, equipotence, and dissidence relations. The class of depleted sets, which is the dual of saturated sets, is defined and used in the study of depletion relations.

Comment on “path integration of a quadratic action with a generalized memory

Using the promeasure technique, we give an alternative evaluation of a path integral corresponding to a quadratic action with a generalized memory.