6,988 research outputs found

    Magnetic and axial-vector transitions of the baryon antidecuplet

    Full text link
    We report the recent results of the magnetic transitions and axial-vector transitions of the baryon antidecuplet within the framework of the chiral quark-soliton model. The dynamical model parameters are fixed by experimental data for the magnetic moments of the baryon octet, for the hyperon semileptonic decay constants, and for the singlet axial-vector constant. The transition magnetic moments μΛΣ\mu_{\Lambda\Sigma} and μNΔ\mu_{N\Delta} are well reproduced and other octet-decuplet and octet-antidecuplet transitions are predicted. In particular, the present calculation of μΣΣ∗\mu_{\Sigma\Sigma^*} is found to be below the upper bound 0.82μN0.82\mu_N that the SELEX collaboration measured very recently. The results explains consistently the recent findings of a new N∗N^* resonance from the GRAAL and Tohoku LNS group. We also obtain the transition axial-vector constants for the Θ+→KN\Theta^+\to KN from which the decay width of the Θ+\Theta^{+} pentaquark baryon is determined as a function of the pion-nucleon sigma term ΣπN\Sigma_{\pi N}. We investigate the dependence of the decay width of the Θ+\Theta^{+} on the gA(0)g_{A}^{(0)}, with the gA(0)g_{A}^{(0)} varied within the range of the experimental uncertainty. We show that a small decay width of the Θ+→KN\Theta^{+}\to KN, i.e. ΓΘKN≤1\Gamma_{\Theta KN} \leq 1 MeV, is compatible with the values of all known semileptonic decays with the generally accepted value of gA(0)≈0.3g_{A}^{(0)} \approx 0.3 for the proton.Comment: 8 pages, 5 figures, Talk given at the Yukawa International Seminar (YKIS) 2006, "New frontiers in QCD", Kyoto, Japan, 20 Nov. - 8 Dec. 200

    Magnetic moments of exotic pentaquark baryons

    Full text link
    In this talk, we present our recent investigation on the magnetic moments of the exotic pentaquark states, based on the chiral quark-soliton model, all relevant intrinsic parameters being fixed by using empirical data.Comment: 5 pages, 1 figure, a talk presented at the 10th International Conference on Baryons (Baryons04), Palaiseau, October 25-29, 200

    Fault tolerant decentralized H∞ control for symmetric composite systems

    Get PDF
    This note discusses a class of large-scale systems composed of symmetrically interconnected identical subsystems. We consider the decentralized H∞ control design problem and study the fault tolerance of the resulting system. By exploiting the special structure of the systems, a sufficient condition for the existence of a decentralized H∞ controller is derived. Moreover, for the nominal case as well as for contingent situations characterized by control channel failures, the poles and the H∞-norm of the closed-loop system can be calculated easily based on certain systems of reduced dimensions. Consequently, the tolerance to actuator failure can be easily tested.published_or_final_versio

    Blind symbol synchronization based on cyclic prefix for OFDM systems

    Get PDF
    In this paper, a blind symbol synchronization algorithm is presented for orthogonal frequency-division multiplexing (OFDM) systems, and a new timing function based on the redundancy of the cyclic prefix (CP) is introduced. It proves that the maximum of this function necessarily points to the correct timing offset, irrespective of channel conditions when the signal-to-noise ratio is high. Using the timing function, the timing offset is estimated through a searching algorithm. Channel power profile and channel length information are unnecessary. Simulation results show that the proposed algorithm is robust and outperforms the existing CP-based algorithms, particularly in frequency-selective fading channels. © 2008 IEEE.published_or_final_versio

    The early Japanese translations of Sigmund Freud's works an annotated list /

    Get PDF
    published_or_final_versio

    Systems approaches and algorithms for discovery of combinatorial therapies

    Full text link
    Effective therapy of complex diseases requires control of highly non-linear complex networks that remain incompletely characterized. In particular, drug intervention can be seen as control of signaling in cellular networks. Identification of control parameters presents an extreme challenge due to the combinatorial explosion of control possibilities in combination therapy and to the incomplete knowledge of the systems biology of cells. In this review paper we describe the main current and proposed approaches to the design of combinatorial therapies, including the empirical methods used now by clinicians and alternative approaches suggested recently by several authors. New approaches for designing combinations arising from systems biology are described. We discuss in special detail the design of algorithms that identify optimal control parameters in cellular networks based on a quantitative characterization of control landscapes, maximizing utilization of incomplete knowledge of the state and structure of intracellular networks. The use of new technology for high-throughput measurements is key to these new approaches to combination therapy and essential for the characterization of control landscapes and implementation of the algorithms. Combinatorial optimization in medical therapy is also compared with the combinatorial optimization of engineering and materials science and similarities and differences are delineated.Comment: 25 page

    Towards segmentation and spatial alignment of the human embryonic brain using deep learning for atlas-based registration

    Full text link
    We propose an unsupervised deep learning method for atlas based registration to achieve segmentation and spatial alignment of the embryonic brain in a single framework. Our approach consists of two sequential networks with a specifically designed loss function to address the challenges in 3D first trimester ultrasound. The first part learns the affine transformation and the second part learns the voxelwise nonrigid deformation between the target image and the atlas. We trained this network end-to-end and validated it against a ground truth on synthetic datasets designed to resemble the challenges present in 3D first trimester ultrasound. The method was tested on a dataset of human embryonic ultrasound volumes acquired at 9 weeks gestational age, which showed alignment of the brain in some cases and gave insight in open challenges for the proposed method. We conclude that our method is a promising approach towards fully automated spatial alignment and segmentation of embryonic brains in 3D ultrasound

    Palaeoecological assessment of freshwaters in SACs and ASSIs in Northern Ireland

    Get PDF
    This is the final report to the Environment and Heritage Service (EHS) in Northern Ireland on the ‘Palaeoecological investigation of the past biological structure and function in Freshwaters in SACs and ASSIs

    Using standard typing algorithms incrementally

    Get PDF
    Modern languages are equipped with static type checking/inference that helps programmers to keep a clean programming style and to reduce errors. However, the ever-growing size of programs and their continuous evolution require building fast and efficient analysers. A promising solution is incrementality, aiming at only re-typing the diffs, i.e. those parts of the program that change or are inserted, rather than the entire codebase. We propose an algorithmic schema that drives an incremental usage of existing, standard typing algorithms with no changes. Ours is a grey-box approach: just the shape of the input, that of the results and some domain-specific knowledge are needed to instantiate our schema. Here, we present the foundations of our approach and the conditions for its correctmess. We show it at work to derive two different incremental typing algorithms. The first type checks an imperative language to detect information flow and non-interference, and the second infers types for a functional language. We assessed our proposal on a prototypical imple- mentation of an incremental type checker. Our experiments show that using the type checker incrementally is (almost) always rewardin
    • …
    corecore