341 research outputs found

    Pengaruh Komposisi Media Tanam Dan Konsentrasi Paklobutrazol Terhadap Keragaan Tanaman Cabai (Capsicum Annuum L.) CV “Candlelight” Pada Budidaya Tanaman Secara Hidroponik

    Full text link
    Capsicum annuumL. CV. “Candlelight” atau sering disebut cabai rawit tumpuk memiliki buah beraturan seperti kumpulan lilin yang menyala, cocok untuk ditanam di pot. Tanaman cabai Candlelight memiliki potensi menjadi tanaman hias, dengan membuat tinggi tanaman lebih pendek, daun lebih hijau, cabang dan jumlah daun lebih banyak melalui pemberian paklobutrazol dan penggunaan media tanam yang tepat melalui budidaya tanaman secara hidroponik. Penelitian ini bertujuan untuk mengetahui pengaruh komposisi media tanam, konsentrasi paklobutrazol dan interaksi keduanya terhadap keragaan tanaman cabai Candlelight pada budidaya tanaman secara hidroponik. Penelitian dilaksanakan pada bulan Desember 2015 sampai Juni 2016 di Rumah Kaca Universitas Lampug dengan Rancangan Acak Kelompok. Perlakuan disusun faktorial 2 x 5 dengan 3 kelompok yang terdapat 2 sub sampel. Faktor pertama adalah komposisi media tanam (M) terdiri dari; sekam bakar (m 1 ), dan sekam bakar + sekam mentah 1:1 (m 2 ). Faktor kedua konsentrasi paklobutrazol (D) terdiri; dari 0 ppm (d 0 ), 25 ppm (d 1 ), 50 ppm (d 2 ), 75 ppm (d 3 ), dan 100 ppm (d 4 ). Homogenitas ragamn diuji dengan Uji Bartlett dan aditivitas dengan Uji Tukey. Pemisahan nilai tengah diuji dengan Uji Polinomial Ortogonal pada taraf 5%. Hasil penelitian menunjukan media sekam bakar hasil lebih baik dibandingkan sekam campuran. Konsentrasi paklobutrazol 50 ppm berpengaruh terhadap jumlah daun total, tinggi tanaman, jumlah tunas, muncul bunga pertama, jumlah bunga, jumlah cabang, jumlah buah, umur buah di tanaman, panjang buah, dan kehijauan daun. Jumlah buah pada media sekam bakar tidak ada pengaruh paklobutrazol tetapi pada media campuran pengaruh konsentrasi paklobutrazol memberikan pengaruh. Pada media sekam bakar setiap penambahan konsentrasi 1 ppm paklobutrazol menurunkan tinggi tanaman sebesar 0,2 cm, sedangkan pada media sekam campuran paklobutrazol menurunkan tinggi tanaman sebesar 0,36 cm

    Orienteering with One Endomorphism

    Get PDF
    In supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is known that a small endomorphism enables polynomial-time path-finding and endomorphism ring computation (Love-Boneh [36]). An endomorphism gives an explicit orientation of a supersingular elliptic curve. In this paper, we use the volcano structure of the oriented supersingular isogeny graph to take ascending/descending/horizontal steps on the graph and deduce path-finding algorithms to an initial curve. Each altitude of the volcano corresponds to a unique quadratic order, called the primitive order. We introduce a new hard problem of computing the primitive order given an arbitrary endomorphism on the curve, and we also provide a sub-exponential quantum algorithm for solving it. In concurrent work (Wesolowski [54]), it was shown that the endomorphism ring problem in the presence of one endomorphism with known primitive order reduces to a vectorization problem, implying path-finding algorithms. Our path-finding algorithms are more general in the sense that we don't assume the knowledge of the primitive order associated with the endomorphism.Comment: 40 pages, 1 figure; 3rd revision implements small corrections and expositional improvement

    Phosphoinositide binding and phosphorylation act sequentially in the activation mechanism of ezrin

    Get PDF
    Ezrin, a membrane–actin cytoskeleton linker, which participates in epithelial cell morphogenesis, is held inactive in the cytoplasm through an intramolecular interaction. Phosphatidylinositol 4,5-bisphosphate (PIP2) binding and the phosphorylation of threonine 567 (T567) are involved in the activation process that unmasks both membrane and actin binding sites. Here, we demonstrate that ezrin binding to PIP2, through its NH2-terminal domain, is required for T567 phosphorylation and thus for the conformational activation of ezrin in vivo. Furthermore, we found that the T567D mutation mimicking T567 phosphorylation bypasses the need for PIP2 binding for unmasking both membrane and actin binding sites. However, PIP2 binding and T567 phosphorylation are both necessary for the correct apical localization of ezrin and for its role in epithelial cell morphogenesis. These results establish that PIP2 binding and T567 phosphorylation act sequentially to allow ezrin to exert its cellular functions

    Bright, Coherent, Ultrafast Soft X-Ray Harmonics Spanning the Water Window from a Tabletop Light Source

    Full text link
    We demonstrate fully phase matched high-order harmonic generation with emission spanning the water window spectral region important for bio- and nano-imaging and a breadth of materials and molecular dynamics studies. We also generate the broadest bright coherent bandwidth (~300eV) to date obtained from any light source, small or large. The harmonic photon flux at 0.5 keV is 10^3 higher than demonstrated previously, making it possible for the first time to demonstrate spatial coherence in the water window. The continuum emission is consistent with a single attosecond burst, that extends bright attosecond pulses into the soft x-ray region.Comment: 4 figures, 18 pages. Submitted for publicatio

    Cycles and Cuts in Supersingular L-Isogeny Graphs

    Get PDF
    Supersingular elliptic curve isogeny graphs underlie isogeny-based cryptography. For isogenies of a single prime degree \ell, their structure has been investigated graph-theoretically. We generalise the notion of \ell-isogeny graphs to LL-isogeny graphs (studied in the prime field case by Delfs and Galbraith), where LL is a set of small primes dictating the allowed isogeny degrees in the graph. We analyse the graph-theoretic structure of LL-isogeny graphs. Our approaches may be put into two categories: cycles and graph cuts. On the topic of cycles, we provide: a count for the number of non-backtracking cycles in the LL-isogeny graph using traces of Brandt matrices; an efficiently computable estimate based on this approach; and a third ideal-theoretic count for a certain subclass of LL-isogeny cycles. We provide code to compute each of these three counts. On the topic of graph cuts, we compare several algorithms to compute graph cuts which minimise a measure called the edge expansion, outlining a cryptographic motivation for doing so. Our results show that a greedy neighbour algorithm out-performs standard spectral algorithms for computing optimal graph cuts. We provide code and study explicit examples. Furthermore, we describe several directions of active and future research

    Cycles and Cuts in Supersingular L-Isogeny Graphs

    Get PDF
    Supersingular elliptic curve isogeny graphs underlie isogeny-based cryptography. For isogenies of a single prime degree \ell, their structure has been investigated graph-theoretically. We generalise the notion of \ell-isogeny graphs to LL-isogeny graphs (studied in the prime field case by Delfs and Galbraith), where LL is a set of small primes dictating the allowed isogeny degrees in the graph. We analyse the graph-theoretic structure of LL-isogeny graphs. Our approaches may be put into two categories: cycles and graph cuts. On the topic of cycles, we provide: a count for the number of non-backtracking cycles in the LL-isogeny graph using traces of Brandt matrices; an efficiently computable estimate based on this approach; and a third ideal-theoretic count for a certain subclass of LL-isogeny cycles. We provide code to compute each of these three counts. On the topic of graph cuts, we compare several algorithms to compute graph cuts which minimise a measure called the \textit{edge expansion}, outlining a cryptographic motivation for doing so. Our results show that a \emph{greedy neighbour} algorithm out-performs standard spectral algorithms for computing optimal graph cuts. We provide code and study explicit examples. Furthermore, we describe several directions of active and future research

    Orientations and cycles in supersingular isogeny graphs

    Get PDF
    The paper concerns several theoretical aspects of oriented supersingular \ell-isogeny volcanoes and their relationship to closed walks in the supersingular \ell-isogeny graph. Our main result is a bijection between the rims of the union of all oriented supersingular \ell-isogeny volcanoes over Fp\overline{\mathbb{F}}_p (up to conjugation of the orientations), and isogeny cycles (non-backtracking closed walks which are not powers of smaller walks) of the supersingular \ell-isogeny graph over Fp\overline{\mathbb{F}}_p. The exact proof and statement of this bijection are made more intricate by special behaviours arising from extra automorphisms and the ramification of pp in certain quadratic orders. We use the bijection to count isogeny cycles of given length in the supersingular \ell-isogeny graph exactly as a sum of class numbers of these orders, and also give an explicit upper bound by estimating the class numbers

    Tribological investigation of graphene as lubricant additive in vegetable oil

    Get PDF
    In this study, the tribological behaviours of graphene nanoparticles as lubricant additive in vegetable oil were investigated as a function of nanoparticle concentration. Graphene nanoparticles were added at 25 ppm, 50 ppm and 100 ppm as additive into vegetable oil as lubricant through hydrodynamic and acoustic cavitation as homogenising mechanism. The tribological properties of each homogenised solution were tested using a four-ball machine according to ASTM D4172. Wear scar diameter and friction coefficient were the determining parameters in this study. The results showed that 50 ppm is the optimum concentration that recorded the lowest wear scar diameter and friction coefficient as compared to control sample
    corecore