Symmetric periodic orbits near a heteroclinic loop in R3 formed by two singular points, a semistable periodic orbit and their invariant manifolds

In this paper we consider C1 vector fields X in R3 having a “generalized heteroclinic loop” L which is topologically homeomorphic to the union of a 2–dimensional sphere S2 and a diameter connecting the north with the south pole. The north pole is an attractor on S2 and a repeller on . The equator of the sphere is a periodic orbit unstable in the north hemisphere and stable in the south one. The full space is topologically homeomorphic to the closed ball having as boundary the sphere S2. We also assume that the flow of X is invariant under a topological straight line symmetry on the equator plane of the ball. For each n ∈ N, by means of a convenient Poincar´e map, we prove the existence of infinitely many symmetric periodic orbits of X near L that gives n turns around L in a period. We also exhibit a class of polynomial vector fields of degree 4 in R3 satisfying this dynamics.

Symmetric periodic orbits near a heteroclinic loop formed by two singular points and their invariant manifolds of dimension 1 and 2

In this paper we consider vector fields in R3 that are invariant under a suitable symmetry and that posses a “generalized heteroclinic loop” L formed by two singular points (e+ and e −) and their invariant manifolds: one of dimension 2 (a sphere minus the points e+ and e −) and one of dimension 1 (the open diameter of the sphere having endpoints e+ and e −). In particular, we analyze the dynamics of the vector field near the heteroclinic loop L by means of a convenient Poincar´e map, and we prove the existence of infinitely many symmetric periodic orbits near L. We also study two families of vector fields satisfying this dynamics. The first one is a class of quadratic polynomial vector fields in R3, and the second one is the charged rhomboidal four body problem.

Influence of the diketonato ligand on the cytotoxicities of [Ru(eta(6)-p-cymene)-(R(2)acac)(PTA)](+) complexes (PTA=1,3,5-triaza-7-phosphaadamantane)

A series of compounds of general formula [Ru(eta(6)-p-cymene) (R(2)acac)(PTA)][X] (R(2)acac = Me(2)acac, tBu(2)acac, Ph(2)acac, Me(2)acac-Cl; PTA = 1,3,5-triaza-7-phosphaadamantane; X = BPh4, BF4), and the precursor to the Me2acac-Cl derivative [Ru(eta(6)-p-cymene)(Me(2)acac-Cl)Cl], have been prepared and characterised spectroscopically. Five of the compounds have also been characterised in the solid state by X-ray crystallography. The tetrafluoroborate salts are water-soluble, quite resistant to hydrolysis, and have been evaluated for cytotoxicity against A549 lung carcinoma and A2780 human ovarian cancer cells. The compounds are cytotoxic towards the latter cell line, and relative activities are discussed in terms of hydrolysis (less important) and lipophilicity, which appears to exert the dominating influence.

Functional education of invariant NKT cells by dendritic cell tuning of SHP-1.

Invariant NKT (iNKT) cells play key roles in host defense by recognizing lipid Ags presented by CD1d. iNKT cells are activated by bacterial-derived lipids and are also strongly autoreactive toward self-lipids. iNKT cell responsiveness must be regulated to maintain effective host defense while preventing uncontrolled stimulation and potential autoimmunity. CD1d-expressing thymocytes support iNKT cell development, but thymocyte-restricted expression of CD1d gives rise to Ag hyperresponsive iNKT cells. We hypothesized that iNKT cells require functional education by CD1d(+) cells other than thymocytes to set their correct responsiveness. In mice that expressed CD1d only on thymocytes, hyperresponsive iNKT cells in the periphery expressed significantly reduced levels of tyrosine phosphatase SHP-1, a negative regulator of TCR signaling. Accordingly, heterozygous SHP-1 mutant mice displaying reduced SHP-1 expression developed a comparable population of Ag hyperresponsive iNKT cells. Restoring nonthymocyte CD1d expression in transgenic mice normalized SHP-1 expression and iNKT cell reactivity. Radiation chimeras revealed that CD1d(+) dendritic cells supported iNKT cell upregulation of SHP-1 and decreased responsiveness after thymic emigration. Hence, dendritic cells functionally educate iNKT cells by tuning SHP-1 expression to limit reactivity.

Hand detection in cluttered scene images using Fourier-Mellin invariant features

This paper proposes an automatic hand detection system that combines the Fourier-Mellin Transform along with other computer vision techniques to achieve hand detection in cluttered scene color images. The proposed system uses the Fourier-Mellin Transform as an invariant feature extractor to perform RST invariant hand detection. In a first stage of the system a simple non-adaptive skin color-based image segmentation and an interest point detector based on corners are used in order to identify regions of interest that contains possible matches. A sliding window algorithm is then used to scan the image at different scales performing the FMT calculations only in the previously detected regions of interest and comparing the extracted FM descriptor of the windows with a hand descriptors database obtained from a train image set. The results of the performed experiments suggest the use of Fourier-Mellin invariant features as a promising approach for automatic hand detection.

Hand detection in cluttered scene images using Fourier-Mellin invariant features

This paper proposes an automatic hand detection system that combines the Fourier-Mellin Transform along with other computer vision techniques to achieve hand detection in cluttered scene color images. The proposed system uses the Fourier-Mellin Transform as an invariant feature extractor to perform RST invariant hand detection. In a first stage of the system a simple non-adaptive skin color-based image segmentation and an interest point detector based on corners are used in order to identify regions of interest that contains possible matches. A sliding window algorithm is then used to scan the image at different scales performing the FMT calculations only in the previously detected regions of interest and comparing the extracted FM descriptor of the windows with a hand descriptors database obtained from a train image set. The results of the performed experiments suggest the use of Fourier-Mellin invariant features as a promising approach for automatic hand detection.

Enrichment of human CD4+ V(alpha)24/Vbeta11 invariant NKT cells in intrahepatic malignant tumors.

Invariant NKT cells (iNKT cells) recognize glycolipid Ags via an invariant TCR alpha-chain and play a central role in various immune responses. Although human CD4(+) and CD4(-) iNKT cell subsets both produce Th1 cytokines, the CD4(+) subset displays an enhanced ability to secrete Th2 cytokines and shows regulatory activity. We performed an ex vivo analysis of blood, liver, and tumor iNKT cells from patients with hepatocellular carcinoma and metastases from uveal melanoma or colon carcinoma. Frequencies of Valpha24/Vbeta11 iNKT cells were increased in tumors, especially in patients with hepatocellular carcinoma. The proportions of CD4(+), double negative, and CD8alpha(+) iNKT cell subsets in the blood of patients were similar to those of healthy donors. However, we consistently found that the proportion of CD4(+) iNKT cells increased gradually from blood to liver to tumor. Furthermore, CD4(+) iNKT cell clones generated from healthy donors were functionally distinct from their CD4(-) counterparts, exhibiting higher Th2 cytokine production and lower cytolytic activity. Thus, in the tumor microenvironment the iNKT cell repertoire is modified by the enrichment of CD4(+) iNKT cells, a subset able to generate Th2 cytokines that can inhibit the expansion of tumor Ag-specific CD8(+) T cells. Because CD4(+) iNKT cells appear inefficient in tumor defense and may even favor tumor growth and recurrence, novel iNKT-targeted therapies should restore CD4(-) iNKT cells at the tumor site and specifically induce Th1 cytokine production from all iNKT cell subsets.

Local and Global Feature Extraction for Invariant Object Recognition

Perceiving the world visually is a basic act for humans, but for computers it is still an unsolved problem. The variability present innatural environments is an obstacle for effective computer vision. The goal of invariant object recognition is to recognise objects in a digital image despite variations in, for example, pose, lighting or occlusion. In this study, invariant object recognition is considered from the viewpoint of feature extraction. Thedifferences between local and global features are studied with emphasis on Hough transform and Gabor filtering based feature extraction. The methods are examined with respect to four capabilities: generality, invariance, stability, and efficiency. Invariant features are presented using both Hough transform and Gabor filtering. A modified Hough transform technique is also presented where the distortion tolerance is increased by incorporating local information. In addition, methods for decreasing the computational costs of the Hough transform employing parallel processing and local information are introduced.

A parameterization method for the computation of invariant tori and their whiskers in quasi-periodic maps: explorations and mechanisms for the breakdown of hyperbolicity

In two previous papers [J. Differential Equations, 228 (2006), pp. 530 579; Discrete Contin. Dyn. Syst. Ser. B, 6 (2006), pp. 1261 1300] we have developed fast algorithms for the computations of invariant tori in quasi‐periodic systems and developed theorems that assess their accuracy. In this paper, we study the results of implementing these algorithms and study their performance in actual implementations. More importantly, we note that, due to the speed of the algorithms and the theoretical developments about their reliability, we can compute with confidence invariant objects close to the breakdown of their hyperbolicity properties. This allows us to identify a mechanism of loss of hyperbolicity and measure some of its quantitative regularities. We find that some systems lose hyperbolicity because the stable and unstable bundles approach each other but the Lyapunov multipliers remain away from 1. We find empirically that, close to the breakdown, the distances between the invariant bundles and the Lyapunov multipliers which are natural measures of hyperbolicity depend on the parameters, with power laws with universal exponents. We also observe that, even if the rigorous justifications in [J. Differential Equations, 228 (2006), pp. 530-579] are developed only for hyperbolic tori, the algorithms work also for elliptic tori in Hamiltonian systems. We can continue these tori and also compute some bifurcations at resonance which may lead to the existence of hyperbolic tori with nonorientable bundles. We compute manifolds tangent to nonorientable bundles.

Suomalaisten osakeyhtiöiden mahdollisuus vaikuttaa verotukseensa ETA-alueella

Tutkielmassa on selvitetty suomalaisten osakeyhtiöiden mahdollisuuksia vaikuttaa liiketoimintansa Euroopan talousalueella (ETA). Tutkielmassa on tarkasteltu EY:n sääntelyä, EY-tuomioistuimen tuomitsemia ennakkotapauksia ja niiden vaikutuksia Suomen lainsäädäntöön suomalaisten osakeyhtiöiden kannalta. Tutkielma osoittaa yhteisön ylikansallisen ohjauksen vaikuttaneen kansalliseen lainsäädäntöön, mikä on tarjonnut suomalaisille osakeyhtiöille uusia mahdollisuuksia kehittää liiketoimintaansa verotuksen ja veroneutraalien yritysjärjestelyiden osalta ETA-alueella. EY-tuomioistuin on tuomioissaan kuitenkin jättänyt tiettyjä oikeuttamisperusteita jäsenvaltioille. Niiden perusteella valtiot voivat vaikuttaa osakeyhtiöiden verotukseen ja veroneutraaleihin yritysjärjestelyihin ETA-alueella, vaikka oikeuttamisperusteet lähtökohtaisesti rikkovat ylikansallista sääntelyä. EY:n ylikansallinen ohjaus tulee myös tulevaisuudessa vaikuttaa merkittävästi suomalaisten osakeyhtiöiden mahdollisuuteen harjoittaa liiketoimintaansa ETA-alueella. Ylikansallisen sääntelyn hyödyntäminen täysimääräisesti mahdollistuu suomalaisissa osakeyhtiöissä vasta, kun yhteisön alueelle luodaan yhtenäinen sääntely kaikkia osakeyhtiöitä kohtaan.

On the computation of reducible invariant tori on a parallel computer

We present an algorithm for the computation of reducible invariant tori of discrete dynamical systems that is suitable for tori of dimensions larger than 1. It is based on a quadratically convergent scheme that approximates, at the same time, the Fourier series of the torus, its Floquet transformation, and its Floquet matrix. The Floquet matrix describes the linearization of the dynamics around the torus and, hence, its linear stability. The algorithm presents a high degree of parallelism, and the computational effort grows linearly with the number of Fourier modes needed to represent the solution. For these reasons it is a very good option to compute quasi-periodic solutions with several basic frequencies. The paper includes some examples (flows) to show the efficiency of the method in a parallel computer. In these flows we compute invariant tori of dimensions up to 5, by taking suitable sections.

Tool-supported invariant-based programming

The development of correct programs is a core problem in computer science. Although formal verification methods for establishing correctness with mathematical rigor are available, programmers often find these difficult to put into practice. One hurdle is deriving the loop invariants and proving that the code maintains them. So called correct-by-construction methods aim to alleviate this issue by integrating verification into the programming workflow. Invariant-based programming is a practical correct-by-construction method in which the programmer first establishes the invariant structure, and then incrementally extends the program in steps of adding code and proving after each addition that the code is consistent with the invariants. In this way, the program is kept internally consistent throughout its development, and the construction of the correctness arguments (proofs) becomes an integral part of the programming workflow. A characteristic of the approach is that programs are described as invariant diagrams, a graphical notation similar to the state charts familiar to programmers. Invariant-based programming is a new method that has not been evaluated in large scale studies yet. The most important prerequisite for feasibility on a larger scale is a high degree of automation. The goal of the Socos project has been to build tools to assist the construction and verification of programs using the method. This thesis describes the implementation and evaluation of a prototype tool in the context of the Socos project. The tool supports the drawing of the diagrams, automatic derivation and discharging of verification conditions, and interactive proofs. It is used to develop programs that are correct by construction. The tool consists of a diagrammatic environment connected to a verification condition generator and an existing state-of-the-art theorem prover. Its core is a semantics for translating diagrams into verification conditions, which are sent to the underlying theorem prover. We describe a concrete method for 1) deriving sufficient conditions for total correctness of an invariant diagram; 2) sending the conditions to the theorem prover for simplification; and 3) reporting the results of the simplification to the programmer in a way that is consistent with the invariantbased programming workflow and that allows errors in the program specification to be efficiently detected. The tool uses an efficient automatic proof strategy to prove as many conditions as possible automatically and lets the remaining conditions be proved interactively. The tool is based on the verification system PVS and i uses the SMT (Satisfiability Modulo Theories) solver Yices as a catch-all decision procedure. Conditions that were not discharged automatically may be proved interactively using the PVS proof assistant. The programming workflow is very similar to the process by which a mathematical theory is developed inside a computer supported theorem prover environment such as PVS. The programmer reduces a large verification problem with the aid of the tool into a set of smaller problems (lemmas), and he can substantially improve the degree of proof automation by developing specialized background theories and proof strategies to support the specification and verification of a specific class of programs. We demonstrate this workflow by describing in detail the construction of a verified sorting algorithm. Tool-supported verification often has little to no presence in computer science (CS) curricula. Furthermore, program verification is frequently introduced as an advanced and purely theoretical topic that is not connected to the workflow taught in the early and practically oriented programming courses. Our hypothesis is that verification could be introduced early in the CS education, and that verification tools could be used in the classroom to support the teaching of formal methods. A prototype of Socos has been used in a course at Åbo Akademi University targeted at first and second year undergraduate students. We evaluate the use of Socos in the course as part of a case study carried out in 2007.