Bounds on Slow Roll at the Boundary of the Landscape

We present strong evidence that the tree level slow roll bounds of arXiv:1807.05193 and arXiv:1810.05506 are valid, even when the tachyon has overlap with the volume of the cycle wrapped by the orientifold. This extends our previous results in the volume-dilaton subspace to a semi-universal modulus. Emboldened by this and other observations, we investigate what it means to have a bound on (generalized) slow roll in a multi-field landscape. We argue that for $any$ point $\phi_0$ in an $N$-dimensional field space with $V(\phi_0) > 0$, there exists a path of monotonically decreasing potential energy to a point $\phi_1$ within a path length $\lesssim {\cal O}(1)$, such that $\sqrt{N}\ln \frac{V(\phi_1)}{V(\phi_0)} \lesssim - {\cal O} (1)$. The previous de Sitter swampland bounds are specific ways to realize this stringent non-local constraint on field space, but we show that it also incorporates (for example) the scenario where both slow roll parameters are intermediate-valued and the Universe undergoes a small number of e-folds, as in the Type IIA set up of arXiv:1310.8300. Our observations are in the context of tree level constructions, so we take the conservative viewpoint that it is a characterization of the classical "boundary" of the string landscape. To emphasize this, we argue that these bounds can be viewed as a type of Dine-Seiberg statement.Comment: v4: one more referenc

जलकृषि में हरित जल प्रौद्योगिकी

कृपया पूरा लेखा पढ

Pd-catalyzed enantioselective aerobic oxidation of secondary alcohols: Applications to the total synthesis of alkaloids

Enantioselective syntheses of the alkaloids (-)-aurantioclavine, (+)-amurensinine, (-)-lobeline, and (-)- and (+)-sedamine are described. The syntheses demonstrate the effectiveness of the Pd-catalyzed asymmetric oxidation of secondary alcohols in diverse contexts and the ability of this methodology to set the absolute configuration of multiple stereocenters in a single operation. The utility of an aryne C-C insertion reaction in accessing complex polycyclic frameworks is also described

Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees

Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the approximation version of this problem, a $\tilde{O}(mn)$ time algorithm that computes a spanning tree of degree at most $\Delta^* +1$ is previously known [F\"urer \& Raghavachari 1994]; here $\Delta^*$ denotes the minimum tree degree of all the spanning trees. In this paper we give the first near-linear time approximation algorithm for this problem. Specifically speaking, we propose an $\tilde{O}(\frac{1}{\epsilon^7}m)$ time algorithm that computes a spanning tree with tree degree $(1+\epsilon)\Delta^* + O(\frac{1}{\epsilon^2}\log n)$ for any constant $\epsilon \in (0,\frac{1}{6})$. Thus, when $\Delta^*=\omega(\log n)$, we can achieve approximate solutions with constant approximate ratio arbitrarily close to 1 in near-linear time.Comment: 17 page

Modeling and Analysis of Perishable Inventory System with Retrial demands in Supply Chain

In this article, we consider a continuous review perishable inventory system with poisson demands. The maximum storage capacity at lower echelon (retailer) is S and the upper Echelon (Distribution Center) is M (= nQ). The life time of each item is assumed to be exponential. The operating policy is (s, S) policy, that is, whenever the inventory level drops to s, an order for Q = (S - s > s) item is placed. The ordered items are received after a random time which is distributed as exponential. We assume that demands occurring during the stock-out period enter into the orbit. These orbiting demands send out signal to complete for their demand which is distributed as exponential. The joint probability distribution of the inventory level at retailer, inventory level at DC and the number of demands in the orbit are obtained in the steady state case. Various system performance measures are derived and the results are illustrated numerically

Modeling the Human Kinetic Adjustment Factor for Inhaled Volatile Organic Chemicals: Whole Population Approach versus Distinct Subpopulation Approach

The objective of this study was to evaluate the impact of whole- and sub-population-related variabilities on the determination of the human kinetic adjustment factor (HKAF) used in risk assessment of inhaled volatile organic chemicals (VOCs). Monte Carlo simulations were applied to a steady-state algorithm to generate population distributions for blood concentrations (CAss) and rates of metabolism (RAMs) for inhalation exposures to benzene (BZ) and 1,4-dioxane (1,4-D). The simulated population consisted of various proportions of adults, elderly, children, neonates and pregnant women as per the Canadian demography. Subgroup-specific input parameters were obtained from the literature and P3M software. Under the “whole population” approach, the HKAF was computed as the ratio of the entire population's upper percentile value (99th, 95th) of dose metrics to the median value in either the entire population or the adult population. Under the “distinct subpopulation” approach, the upper percentile values in each subpopulation were considered, and the greatest resulting HKAF was retained. CAss-based HKAFs that considered the Canadian demography varied between 1.2 (BZ) and 2.8 (1,4-D). The “distinct subpopulation” CAss-based HKAF varied between 1.6 (BZ) and 8.5 (1,4-D). RAM-based HKAFs always remained below 1.6. Overall, this study evaluated for the first time the impact of underlying assumptions with respect to the interindividual variability considered (whole population or each subpopulation taken separately) when determining the HKAF

Lawyers Seeking Clients, Clients Seeking Lawyers: Sources of Contingency Fee Cases and Their Implications for Case Handling

This paper examines the ways that Wisconsin contingency fee lawyers obtain clients. It draws upon a survey of Wisconsin practitioners, three months of observation in lawyers\u27 offices, semi-structured interviews with practitioners, a survey of recipients of direct mail solicitations from Wisconsin contingency fee practitioners, and a survey of Wisconsin residents about whether they had predilections concerning which lawyer or law firm they would use should they have an injury claim. The analyses show that most lawyers draw the vast majority of their cases from a combination of referrals from prior clients, referrals from other lawyers (mostly uncompensated referrals), and repeat clients. Relatively few clients come through media advertising or direct mail solicitation, even for most of those lawyers who aggressively employ media and direct mail. The key factor for obtaining clients is the lawyer\u27s (or firm\u27s) reputation. The need to maintain a reputation that will bring in clients serves to limit the ability of contingency fee lawyers to pursue courses of action that run counter to their clients\u27 interests