Analytical formula for the cross section of hadron production from e+e−e^+ e^- collisions around the narrow charmouinum resonances

An analytical formula of the production cross section for $e^+ e^-$ annihilates to hadrons considering the initial state radiation is reported in the paper. Comparisons between the analytical formula and the direct integration of ISR shows good accuracy which satisfy the current experimental requirements. Besides, comparison in the cross section between the analytical formula and the calculation with ConExc Monte Carlo generator is also presented. The analytical formula greatly shorten the computing time which could be used for fitting procedure to extract the parameters of narrow charmonium resonances.Comment: 11 pages, 9 figure

Root Herbivory has More Influence on Arabidopsis thaliana Survival Rates than Leaf Herbivory

Hypothesis: We hypothesize that the hypocotyl length, leaves number and survival rate will be greater in plants with cut leaves than cut roots. Background: Plants rely on root absorption and leaf photosynthesis to grow. Roots not only absorb nutrition from soil but also function in nutrient storage and reproduction. We exposed Arabidopsis thaliana to three different treatments: cutting leaves, cutting roots and a control group. We observed their growth, morphology and the survival rate

The Landscape of Histone Modification in Cancer Metastasis

Metastasis represents one of the most devastating aspects of cancer. Epithelial to mesenchymal transition (EMT) has been shown to play a critical role in tumorigenic metastasis. During metastatic progression, both genetic and epigenetic modifications endow cancer cells with properties that modulate the capacity for metastatic success. Histone modification is profoundly altered in cancer cells and contributes to cancer metastasis by controlling different metastatic phenotypes. Here, we first review histone modifications and discuss their roles in EMT and metastasis, with a particular focus on histone methylation and acetylation. Second, we review the major histone modification enzymes that control chromatin in cancer metastasis. Third, we discuss the transcriptional regulation concerted by these enzymes with EMT transcription factors at different molecular layers. Finally, we discuss pharmacologic manipulation of histone modification enzymes for metastasis treatment. A comprehensive understanding of histone modification in metastasis will not only provide new insights into our knowledge of cancer progression and metastasis, but also offer a novel approach for the development of innovative therapeutic strategies

Ubiquitin Regulation: The Histone Modifying Enzyme\u27s Story

Histone post-translational modifications influence many fundamental cellular events by regulating chromatin structure and gene transcriptional activity. These modifications are highly dynamic and tightly controlled, with many enzymes devoted to the addition and removal of these modifications. Interestingly, these modifying enzymes are themselves fine-tuned and precisely regulated at the level of protein turnover by ubiquitin-proteasomal processing. Here, we focus on recent progress centered on the mechanisms regulating ubiquitination of histone modifying enzymes, including ubiquitin proteasomal degradation and the reverse process of deubiquitination. We will also discuss the potential pathophysiological significance of these processes

A Benefit-Cost Analysis of Benefit-Cost Analysis

Benefit/Cost Analysis (BCA) has a long history of being used as the primary tool aiding public decision-making. Two primary questions motivate this dissertation: 1. Do the results output by BCA add value and impact decision-making? and 2. Is BCA trustworthy enough that decision-makers should use it? Grounded on more than 100 transport projects completed in Asian developing countries, the US, and Australia, this dissertation aims to understand and examine the benefits (if any) created by using BCA via five dimensions: accuracy, appropriateness & consistency, fiscal sustainability, transparency & replicability, and comprehensive. Nemours practical issues related to BCA are observed and corroborated in this dissertation. These issues are classified into three categories: deficiencies in the inputs to BCA, the technique and empirical basis of BCA itself, as well as the limited role of BCA in decision-making. The research and findings in this thesis are not challenging the theoretical basis for BCA. Rather, this thesis proves that there are gaps between the theory and the practice. In theory, theory should have precisely captured the truly additional benefits ascribed to transport investment. However in practice, as demonstrated by numerous findings presented in this thesis, the empirical implementation of the theoretical practices, alongside the idealized assumptions, confronted many challenges. In a nutshell, as the quote says, ``In theory, theory and practice are the same. But in practice, they are different"

Improving Channel Throughput of WLANs and Ad Hoc Networks Using Explicit Denial of Requests

A new Multiple Access Control scheme for wireless ad hoc networks and WLANs is proposed. This scheme uses explicit denial of channel requests and a busy tone to improve channel throughput. Performance analysis shows significant improvement when the network is under heavy traffic load

Linear codes with few weights from non-weakly regular plateaued functions

Linear codes with few weights have significant applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. There are a number of methods to construct linear codes, one of which is based on functions. Furthermore, two generic constructions of linear codes from functions called the first and the second generic constructions, have aroused the research interest of scholars. Recently, in \cite{Nian}, Li and Mesnager proposed two open problems: Based on the first and the second generic constructions, respectively, construct linear codes from non-weakly regular plateaued functions and determine their weight distributions. Motivated by these two open problems, in this paper, firstly, based on the first generic construction, we construct some three-weight and at most five-weight linear codes from non-weakly regular plateaued functions and determine the weight distributions of the constructed codes. Next, based on the second generic construction, we construct some three-weight and at most five-weight linear codes from non-weakly regular plateaued functions belonging to $\mathcal{NWRF}$ (defined in this paper) and determine the weight distributions of the constructed codes. We also give the punctured codes of these codes obtained based on the second generic construction and determine their weight distributions. Meanwhile, we obtain some optimal and almost optimal linear codes. Besides, by the Ashikhmin-Barg condition, we have that the constructed codes are minimal for almost all cases and obtain some secret sharing schemes with nice access structures based on their dual codes.Comment: 52 pages, 34 table

Weighted General Group Lasso for Gene Selection in Cancer Classification

[EN] Relevant gene selection is crucial for analyzing cancer gene expression datasets including two types of tumors in cancer classification. Intrinsic interactions among selected genes cannot be fully identified by most existing gene selection methods. In this paper, we propose a weighted general group lasso (WGGL) model to select cancer genes in groups. A gene grouping heuristic method is presented based on weighted gene co-expression network analysis. To determine the importance of genes and groups, a method for calculating gene and group weights is presented in terms of joint mutual information. To implement the complex calculation process of WGGL, a gene selection algorithm is developed. Experimental results on both random and three cancer gene expression datasets demonstrate that the proposed model achieves better classification performance than two existing state-of-the-art gene selection methods.This work was supported in part by the National Natural Science Foundation of China under Grant 61572127, in part by the National Key Research and Development Program of China under Grant 2017YFB1400801, in part by the Key Research and Development Program in Jiangsu Province under Grant BE2015728, and in part by the Collaborative Innovation Center of Wireless Communications Technology. The work of R. Ruiz was supported by the Spanish Ministry of Economy and Competitiveness through the Project "SCHEYARD-Optimization of Scheduling Problems in Container Yards" partly financed with FEDER funds under Grant DPI2015-65895-R. This paper was recommended by Associate Editor S. Yang.Wang, Y.; Li, X.; Ruiz García, R. (2019). Weighted General Group Lasso for Gene Selection in Cancer Classification. IEEE Transactions on Cybernetics. 49(8):2860-2873. https://doi.org/10.1109/TCYB.2018.2829811S2860287349

A Further Study of Vectorial Dual-Bent Functions

Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent partitions and linear codes. In this paper, we further study vectorial dual-bent functions $F: V_{n}^{(p)}\rightarrow V_{m}^{(p)}$, where $2\leq m \leq \frac{n}{2}$, $V_{n}^{(p)}$ denotes an $n$-dimensional vector space over the prime field $\mathbb{F}_{p}$. We give new characterizations of certain vectorial dual-bent functions (called vectorial dual-bent functions with Condition A) in terms of amorphic association schemes, linear codes and generalized Hadamard matrices, respectively. When $p=2$, we characterize vectorial dual-bent functions with Condition A in terms of bent partitions. Furthermore, we characterize certain bent partitions in terms of amorphic association schemes, linear codes and generalized Hadamard matrices, respectively. For general vectorial dual-bent functions $F: V_{n}^{(p)}\rightarrow V_{m}^{(p)}$ with $F(0)=0, F(x)=F(-x)$ and $2\leq m \leq \frac{n}{2}$, we give a necessary and sufficient condition on constructing association schemes. Based on such a result, more association schemes are constructed from vectorial dual-bent functions