The ccbar Pentaquarks by a Quark Model

Recent LHCb experiments have shown us that there are two resonances in the $J/\psi p$ channel in the $\Lambda_b$ decay, whose spin and parity are most probably (3/2$^-$ 5/2$^+$). In this work, we investigate the $I(J^P)=1/2(1/2^-)$, $1/2(3/2^-)$, and $1/2(5/2^-)$ $uudc{\bar c}$ pentaquark states by employing the quark cluster model. It is found that the color-octet isospin-1/2 spin-3/2 $uud$ configuration gives an attraction to such five-quark systems. This configuration together with the color-octet $c{\bar c}$ pair gives structures around the $\Sigma_c^{(*)}{\bar D}{}^{(*)}$ thresholds: one bound state, two resonances, and one large cusp are found in the $uudc{\bar c}$ negative parity channels. We argue that these resonances and cusp may correspond to, or combine to form, the negative parity pentaquark peak observed by LHCb.Comment: 4 pages, 4 figures, Proceedings of the 14th International Conference on Meson-Nucleon Physics and the Structure of the Nucleon (MENU2016

U_A(1) Breaking Effects on the Light Scalar Meson Spectrum

Effects of the U_A(1) breaking interaction on the low-lying nonet scalar mesons are studied using the extended Nambu-Jona-Lasinio model. The strength of the U_A(1) breaking interaction is determined by the electromagnetic decays of the eta meson. We find that the U_A(1) breaking interaction gives rise to about 150 MeV mass difference between the sigma and a_0 mesons. We also find that the strangeness content in the \sigma meson is about 15%. The calculated mass of the I=1/2 state is about 200 MeV heavier than that of the I=1 state. The order of these masses is not likely to change within this model.Comment: 10 pages, 3 figure

On the origin of the narrow peak and the isospin symmetry breaking of the XX(3872)

The $X$(3872) formation and decay processes in the $B$-decay are investigated by a $c\bar c$-two-meson hybrid model. The two-meson state consists of the $D^0{\bar D}^*{}^0$, $D^+D^{*-}$, $J/\psi\rho$, and $J/\psi\omega$ channels. The energy-dependent decay widths of the $\rho$ and $\omega$ mesons are introduced. The $D$-${\bar D}^*$ interaction is taken to be consistent with a lack of the $B{\bar B}^*$ bound state. The coupling between the $D{\bar D}^*$ and $J/\psi\rho$ or the $D{\bar D}^*$ and $J/\psi\omega$ channels is obtained from a quark model. The $c{\bar c}$-$D{\bar D}^*$ coupling is taken as a parameter to fit the $X$(3872) mass. The spectrum is calculated up to 4 GeV. It is found that very narrow $J/\psi\rho$ and $J/\psi\omega$ peaks appear around the $D^0{\bar D}^*{}^0$ threshold. The size of the $J/\psi\pi^3$ peak we calculated is 1.29-2.38 times as large as that of the $J/\psi\pi^2$. The isospin symmetry breaking in the present model comes from the mass difference of the charged and neutral $D$ and $D^*$ mesons, which gives a sufficiently large isospin mixing to explain the experiments. It is also found that values of the ratios of the transfer strengths can give the information on the $X$(3872) mass or the size of the $c{\bar c}$-$D{\bar D}^*$ coupling.Comment: 33 pages, 12 figure

Time evolution of galactic warps in prolate haloes

A recent observation with the Hipparcos satellite and some numerical simulations imply that the interaction between an oblate halo and a disc is inappropriate for the persistence of galactic warps. Then, we have compared the time evolution of galactic warps in a prolate halo with that in an oblate halo. The haloes were approximated as fixed potentials, while the discs were represented by N-body particles. We have found that the warping in the oblate halo continues to wind up, and finally disappears. On the other hand, for the prolate halo model, the precession rate of the outer disc increases when the precession of the outer disc recedes from that of the inner disc, and vice versa. Consequently, the warping in the prolate halo persisted to the end of the simulation by retaining the alignment of the line of nodes of the warped disc. Therefore, our results suggest that prolate haloes could sustain galactic warps. The physical mechanism of the persistence of warp is discussed on the basis of the torque between a halo and a disc and that between the inner and outer regions of the disc.Comment: 8 pages, 8 figures. Accepted for publication in MNRA

Performance evaluation of WMN-GA for different mutation and crossover rates considering number of covered users parameter

Node placement problems have been long investigated in the optimization field due to numerous applications in location science and classification. Facility location problems are showing their usefulness to communication networks, and more especially from Wireless Mesh Networks (WMNs) field. Recently, such problems are showing their usefulness to communication networks, where facilities could be servers or routers offering connectivity services to clients. In this paper, we deal with the effect of mutation and crossover operators in GA for node placement problem. We evaluate the performance of the proposed system using different selection operators and different distributions of router nodes considering number of covered users parameter. The simulation results show that for Linear and Exponential ranking methods, the system has a good performance for all rates of crossover and mutation.Peer ReviewedPostprint (published version

A Tabu Search algorithm for ground station scheduling problem

(c) 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other users, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works for resale or redistribution to servers or lists, or reuse of any copyrighted components of this work in other works.Mission planning plays an important role in satellite control systems. Satellites are not autonomously operated in many cases but are controlled by tele-commands transmitted from ground stations. Therefore, mission scheduling is crucial to efficient satellite control systems, especially with increase of number of satellites and more complex missions to be planned. In a general setting, the satellite mission scheduling consists in allocating tasks such as observation, communication, etc. to resources (spacecrafts (SCs), satellites, ground stations). One common version of this problem is that of ground station scheduling, in which the aim is to compute an optimal planning of communications between satellites and operations teams of Ground Station (GS). Because the communication between SCs and GSs can be done during specific window times, this problem can also be seen as a window time scheduling problem. The required communication time is usually quite smaller than the window of visibility of SCs to GSs, however, clashes are produced, making the problem highly constrained. In this paper we present a Tabu Search (TS) algorithm for the problem, while considering several objective functions, namely, windows fitness, clashes fitness, time requirement fitness, and resource usage fitness. The proposed algorithm is evaluated by a set of problem instances of varying size and complexity generated with the STK simulation toolkit. The computational results showed the efficacy of TS for solving the problem on all considered objectives.Peer ReviewedPostprint (author's final draft

QoS routing in ad-hoc networks using GA and multi-objective optimization

Much work has been done on routing in Ad-hoc networks, but the proposed routing solutions only deal with the best effort data traffic. Connections with Quality of Service (QoS) requirements, such as voice channels with delay and bandwidth constraints, are not supported. The QoS routing has been receiving increasingly intensive attention, but searching for the shortest path with many metrics is an NP-complete problem. For this reason, approximated solutions and heuristic algorithms should be developed for multi-path constraints QoS routing. Also, the routing methods should be adaptive, flexible, and intelligent. In this paper, we use Genetic Algorithms (GAs) and multi-objective optimization for QoS routing in Ad-hoc Networks. In order to reduce the search space of GA, we implemented a search space reduction algorithm, which reduces the search space for GAMAN (GA-based routing algorithm for Mobile Ad-hoc Networks) to find a new route. We evaluate the performance of GAMAN by computer simulations and show that GAMAN has better behaviour than GLBR (Genetic Load Balancing Routing).Peer ReviewedPostprint (published version

Design and Evaluation of Reliable Data Transmission Protocol in Wireless Sensor Networks

A wireless sensor-actuator network (WSAN) is composed of sensor modes and actuator modes which are interconnected in wireless networks. A sensor node collects information on the physical world and sends a sensed value in a wireless network. Another sensor node forwards the sensed value to deliver to an actuator node. A sensor node can deliver messages with sensed values to only nearby nodes due to weak radio. Messages are forwarded by sensor nodes to an actuator node by a type of flooding protocol. A sensor mode senses an event and sends a message with the sensed value. In addition, on receipt of a message with a sensed value from another sensor mode, a sensor node forwards the sensed value. Messages transmitted by sensor nodes might be lost due to noise and collisions. In this paper, we discuss a redundant data transmission (RT) protocol to reliably and efficiently deliver sensed values sensed by sensor nodes to an actuator node. Here, a sensor node sends a message with not only its sensed value but also sensed values received from other sensor nodes. The more number of sensed values are included in a message, the more frequently the message is lost. Each message carries so many number of sensed values that the message loss ratio is not increased. Even if a message with a sensed value v is lost in the wireless network, an actuator node can receive the sensed value v from a message sent by another sensor node. Thus, each sensed value is redundantly carried in multiple messages. The redundancy of a sensed value is in nature increased since the sensed value is broadcast. In order to reduce the redundancy of sensed value, we take a strategy that the farther sensor nodes from an actuator node forward the fewer number of sensed values. We evaluate the RT protocol in terms of loss ratio, redundancy, and delay time of a sensed value. We show that about 80% of sensed values can be delivered to an actuator node even if 95% of messages are lost due to noise and collision

Reliable and Efficient Way to Broadcast Messages in a Group by Trust-Based Broadcast (TBB) Scheme

Nowadays information systems are being shifted to distributed architectures, i.e. Grid and Peer-to-peer (P2P) models to obtain the benefits like scalability, autonomy, and fault-tolerance. We consider the P2P model as a fully distributed, scalable system, which is composed of peer processes (peers). Here, a group of multiple peers cooperate with each other. Peers have to efficiently and flexibly deliver messages to every peer of the group in P2P overlay networks. In order to efficiently and reliably broadcast messages in a scalable group, we take advantage of the multipoint relaying (MPR) mechanism. Here, each peer sends messages to only a subset of its acquaintances. However, if a peer which forwards messages to other peers is faulty, the peers cannot receive messages. In this paper, we newly discuss a trustworthiness-based broadcast (TBB) algorithm where only trustworthy peers forward messages. That is, untrustworthy peers are peers which cannot forward the messages due to some faults. Here, the transmission fault implied by faults of untrustworthy peers can be reduced. We evaluate the TBB algorithm in terms of the number of messages transmitted