Microbial Metabolism of the Diterpene Sclareol: Oxidation of the A Ring by Septomyxa affinis

Microbial metabolism of the diterpene sclareol ( 1 ) was studied. Screening studies have shown a number of microorganisms capable of metabolizing 1 . Preparative-scale fermentation with Septomyxa affinis ATCC 6737 has resulted in the production of three fungal metabolites that have been characterized by 2D-NMR techniques and chemical reactions. These metabolites have been identified as 8α,13β-dihydroxylabd-14-en-3-one ( 2 ), labd-14-ene-3β.8α,13β-triol ( 4 ), and labd-14-ene-2α,8α,13β-triol ( 6 ).     

Studies in sesquiterpenes—LVI: Isolongifolene (part 7): mechanism of rearrangement of longifolene to isolongifolene—II

The question of possible neutral intermediates which may lie on the reaction pathway in going from longifolene to isolongifolene has been investigated using BF₃·Et₂O-AcOD and D₃PO₄-dioxane, as reagents. It has been found that longicyclene is not an obligatory intermediate. The mode of cleavage of cyclopropane ring in longicyclene has been investigated.     

First-order inertial algorithms involving dry friction damping

We present a Branch-and-Cut algorithm for a class of nonlinear chance-constrained mathematical optimization problems with a finite number of scenarios. Unsatisfied scenarios can enter a recovery mode. This class corresponds to problems that can be reformulated as deterministic convex mixed-integer nonlinear programming problems with indicator variables and continuous scenario variables, but the size of the reformulation is large and quickly becomes impractical as the number of scenarios grows. The Branch-and-Cut algorithm is based on an implicit Benders decomposition scheme, where we generate cutting planes as outer approximation cuts from the projection of the feasible region on suitable subspaces. The size of the master problem in our scheme is much smaller than the deterministic reformulation of the chance-constrained problem. We apply the Branch-and-Cut algorithm to the mid-term hydro scheduling problem, for which we propose a chance-constrained formulation. A computational study using data from ten hydroplants in Greece shows that the proposed methodology solves instances faster than applying a general-purpose solver for convex mixed-integer nonlinear programming problems to the deterministic reformulation, and scales much better with the number of scenarios.

     

On the Stable Radical of Some Non-Domestic String Algebras

Algebras and Representation Theory - We introduce the concept of a prime band in a string algebra Λ and use it to associate to Λ its finite bridge quiver. Then we introduce a new...     

A post quantum secure construction of an authentication protocol for satellite communication

Satellite's communication system is used to communicate under significant distance and circumstances where the other communication systems are not comfortable. Since all the data are exchanged over a public channel, so the security of the data is an essential component for the communicating parties. Both key exchange and authentication are two cryptographic tools to establish a secure communication between two parties. Currently, various kinds of authentication protocols are available to establish a secure network, but all of them depend on number–theoretical (discrete logarithm problem/factorization assumption) hard assumptions. Due to Shor's and Grover's computing algorithm number theoretic assumptions are breakable by quantum computers. Although Kumar and Garg have proposed a quantum attack-resistant protocol for satellite communication, it cannot resist stolen smart card attack. We have analyzed that how Kumar and Garg is vulnerable to the stolen smart card attack using differential power analysis attack described in He et al and Chen and Chen. We have also analyzed the modified version of signal leakage attack and sometimes called improved signal leakage attack on Kumar and Garg's protocol. We have tried to construct a secure and efficient authentication protocol for satellites communication that is secure against quantum computing. This is more efficient as it requires only three messages of exchange. This paper includes security proof and performance of the proposed authentication and key agreement protocol.     

Comparative Study of the Different Variants of the DV-Hop Based Node Localization Algorithms for Wireless Sensor Networks

Wireless Personal Communications - Node localization is one of the essential services where sensor nodes in the wireless sensor network collaborate to provide location information of sensor nodes...     

A characterization of certain discrete exponential families

For independent random variables X and Y, define % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaabofaruWrL9MCNLwyaGqbciaa-bcacqGHHjIUcaWFGaGaa8hw% aiaa-TcacaWFzbaaaa!4551!\[{\rm{S}} \equiv X + Y\]. When the conditional expectations % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaadweacaGGBbqefCuzVj3zPfgaiuGajaaqcaWFNbGccaGGOaGa% amiwaiaacMcacaGG8bGaam4uaiaac2facqGHHjIUcaWGHbGaaiikai% aadofacaGGPaaaaa!4BC4!\[E[g(X)|S] \equiv a(S)\]and % MathType!MTEF!2!1!+-% feaafeart1ev1aaatCvAUfeBSjuyZL2yd9gzLbvyNv2CaerbuLwBLn% hiov2DGi1BTfMBaeXafv3ySLgzGmvETj2BSbqefm0B1jxALjhiov2D% aebbfv3ySLgzGueE0jxyaibaiGc9yrFr0xXdbba91rFfpec8Eeeu0x% Xdbba9frFj0-OqFfea0dXdd9vqaq-JfrVkFHe9pgea0dXdar-Jb9hs% 0dXdbPYxe9vr0-vr0-vqpWqaaeaabiGaciaacaqabeaadaqaaqGaaO% qaaiaadweacaGGBbGaamiAaiaacIcacaWGybGaaiykaiaacYhacaWG% tbGaaiyxaiabggMi6kaadkgacaGGOaGaam4uaiaacMcaaaa!4894!\[E[h(X)|S] \equiv b(S)\]are given, then under certain assumptions, the density function of X has the form of u(x)k()e^ax, where u(x) is uniquely determined by the functions a(·) and b(·).