cometadata/datacite-rtg-text-other-reclassification-records huggingface dataset:
COMPETITIVE GRANTS AND THE FUNDING OF AGRICULTURAL RESEARCH IN THE U.S.
Creators: name: Day-Rubenstein, Kelly A.
name: Heisey, Paul W.
name: Klotz-Ingram, Cassandra
name: Frisvold, George B.
name: Day-Rubenstein, Kelly A.
name: Heisey, Paul W.
name: Klotz-Ingram, Cassandra
name: Frisvold, George B.
Publisher: name: Unknown
Year: 2000
Subjects: Research and Development/Tech Change/Emerging Technologies

description: To increase the efficiency of the public agricultural R&D system, expanded use of competitive grants to fund state institutions has been advocated. This paper characterizes different funding instruments and empirically assesses the effects of changes in mechanism use. Factors associated with greater levels of competitive grants are modeled.
IMPACTS OF NEW AGRICULTURAL TECHNOLOGIES ON RURAL MALIAN HOUSEHOLDS
Creators: name: Vitale, Jeffrey D.
name: Sanders, John H.
name: Vitale, Jeffrey D.
name: Sanders, John H.
Publisher: name: Unknown
Year: 2000
Subjects: Research and Development/Tech Change/Emerging Technologies

description: A need in Sahelian agriculture is to transform from traditional farming to more modern systems. This paper presents a safety-first type of risk programming model, using complementary programming, to assess the impacts of new agricultural technology. Model results indicate that some new technologies are economically attractive to Malian households.
THE EVOLUTION OF FARMING SYSTEMS IN NORTHERN COTE D'IVOIRE: BOSERUP VERSUS MALTHUS AND COMPETITION VERSUS COMPLEMENTARITY
Creators: name: Demont, Matty
name: Jouve, Philippe
name: Stessens, Johan
name: Tollens, Eric
name: Demont, Matty
name: Jouve, Philippe
name: Stessens, Johan
name: Tollens, Eric
Publisher: name: Unknown
Year: 2000
Subjects: International Development

description: A socio-economic analysis of a sample of farms in Northern Côte d'Ivoire revisits two debates about the evolution of farming systems in sub-Saharan Africa. Taking into account the diversity of farming systems, the debates "Boserup vs. Malthus" and "competition vs. complementarity" between cotton and food crops become better informed and less straightforward.
Using Qubits to Measure Fidelity in Mesoscopic Systems
Creators: name: Lesovik, G. B.
name: Hassler, F.
name: Blatter, G.
Publisher: name: arXiv
Year: 2005
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: Quantum Physics (quant-ph)
subject: FOS: Physical sciences

description: We point out the similarities in the definition of the `fidelity' of a quantum system and the generating function determining the full counting statistics of charge transport through a quantum wire and suggest to use flux- or charge qubits for their measurement. As an application we use the notion of fidelity within a first-quantized formalism in order to derive new results and insights on the generating function of the full counting statistics.
description: 5 pages, 1 figure
RAW MATERIALS, PROCESSING INCENTIVES AND FOREIGN OWNERSHIP
Creators: name: Gilbert, John
name: Gilbert, John
Publisher: name: Unknown
Year: 2000
Subjects: International Relations/Trade
Productivity Analysis

description: The effect of foreign ownership on trade policy outcomes has long been a topic of interest, but only recently have the consequences of multiple levels of production been considered. We examine processing incentives in a simplified general equilibrium framework with foreign ownership of a primary factor. Second-best considerations mean non-intervention is sub-optimal, but multiple levels of production can lead to an investment terms-of-trade effect of indeterminate sign, depending critically on the production structure. We illustrate how this may change standard conclusions regarding the effect of trade restrictions where there is foreign ownership, and optimal intervention to achieve specific policy objectives.
The one-way communication complexity of dynamic time warping distance
Creators: name: Braverman, Vladimir
name: Charikar, Moses
name: Kuszmaul, William
name: Yang, Lin F
Publisher: name: Journal of Computational Geometry
Year: 2021

description: We resolve the randomized one-way communication complexity of Dynamic Time Warping (DTW) distance. We show that there is an efficient one-way communication protocol using $\widetilde{O}(n/\alpha)$ bits for the problem of computing an $\alpha$-approximation for DTW between strings $x$ and $y$ of length $n$, and we prove a lower bound of $\Omega(n / \alpha)$ bits for the same problem. Our communication protocol works for strings over an arbitrary metric of polynomial size and aspect ratio, and we optimize the logarithmic factors depending on properties of the underlying metric, such as when the points are low-dimensional integer vectors equipped with various metrics or have bounded doubling dimension. We also consider linear sketches of DTW, showing that such sketches must have size $\Omega(n)$.
description: Journal of Computational Geometry, Vol. 11 No. 2: Special Issue of Selected Papers from SoCG 2019
THE MINIMUM SEMI-VARIANCE HEDGE FOR FOOD MANUFACTURERS IN KOREA
Creators: name: Lee, Sang-Hak
name: Yang, Seung-Ryong
name: Lee, Sang-Hak
name: Yang, Seung-Ryong
Publisher: name: Unknown
Year: 2000
Subjects: Agribusiness

description: This paper derives downside risk minimizing hedge ratios for Korean food manufacturers who face commodity price risks and exchange rate risk simultaneously. The results show that the minimum semivariance hedge (MSVH) effectively reduces risks. The MSVH rule is evidently more efficient than the conventional minimum variance hedge.
Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons
Creators: name: De Berg, Mark
name: Knauer, Christian
Publisher: name: Journal of Computational Geometry
Year: 2020

description: This note corrects an error in the paper Approximating minimum-area rectangular and convex containers for packing convex polygons, which appeared in JoCG, Vol.~8(1), pages~1--10.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
Searching for the closest-pair in a query translate
Creators: name: Xue, Jie
name: Li, Yuan
name: Rahul, Saladi
name: Janardan, Ravi
Publisher: name: Journal of Computational Geometry
Year: 2020

description: We consider a range-search variant of the closest-pair problem. Let $\varGamma$ be a fixed shape in the plane. We are interested in storing a given set of $n$ points in the plane in some data structure such that for any specified translate of $\varGamma$, the closest pair of points contained in the translate can be reported efficiently. We present results on this problem for two important settings: when $\varGamma$ is a polygon (possibly with holes) and when $\varGamma$ is a general convex body whose boundary is smooth. When $\varGamma$ is a polygon, we present a data structure using $O(n)$ space and $O(\log n)$ query time, which is asymptotically optimal. When $\varGamma$ is a general convex body with a smooth boundary, we give a near-optimal data structure using $O(n \log n)$ space and $O(\log^2 n)$ query time. Our results settle some open questions posed by Xue et al. [SoCG 2018].
description: Journal of Computational Geometry, Vol. 11 No. 2: Special Issue of Selected Papers from SoCG 2019
IMPACT OF GATT IN THE FUNCTIONING OF AGRICULTURAL MARKETS: AN EXAMINATION OF MARKET INTEGRATION AND EFFICIENCY IN THE WORLD BEEF AND WHEAT MARKET UNDER THE PRE-GATT AND POST-GATT REGIMES
Creators: name: Fabiosa, Jacinto F.
name: Fabiosa, Jacinto F.
Publisher: name: Unknown
Year: 2000
Subjects: International Relations/Trade

description: Although the GATT compliance record is mixed, this study finds consistent evidence that GATT reforms improved market efficiency and integration in the beef and wheat market. Cointegration analysis shows much improved price transmission and speed of adjustment. Variance decomposition analysis reveals larger and quicker impacts in prices of non-fundamental shocks originating from other markets. Results make a stronger case for more reforms in the current revisitation of the Agreement.
Induced planet formation in stellar clusters - a parameter study of star-disk encounters
Creators: name: Thies, Ingo
name: Kroupa, Pavel
name: Theis, Christian
Publisher: name: arXiv
Year: 2005
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: We present a parameter study of the possibility of tidally triggered disk instability. Using a restricted N-body model which allows for a survey of an extended parameter space, we show that a passing dwarf star with a mass between 0.1 and 1 M_sun can probably induce gravitational instabilities in the pre-planetary solar disk for prograde passages with minimum separations below 80-170 AU for isothermal or adiabatic disks. Inclined and retrograde encounters lead to similar results but require slightly closer passages. Such encounter distances are quite likely in young moderately massive star clusters (Scally & Clarke 2001; Bonnell et al. 2001). The induced gravitational instabilities may lead to enhanced planetesimal formation in the outer regions of the protoplanetary disk, and could therefore be relevant for the existence of Uranus and Neptune, whose formation timescale of about 100 Myr (Wuchterl, Guillot & Lissauer 2000) is inconsistent with the disk lifetimes of about a few Myr according to observational data by Haisch, Lada & Lada (2001). The relatively small gas/solid ratio in Uranus and Neptune can be matched if the perturbing fly-by occurred after early gas depletion of the solar system, i.e. when the solar system was older than about 5 Myr. We also confirm earlier results by Heller (1993) that the observed 7 degree tilt of the solar equatorial plane relative to the ecliptic plane could be the consequence of such a close encounter.
description: 11 pages, 9 figures, using aas_macros.sty. MNRAS, accepted
Photohadronic model for the neutrino and $γ$-ray emission from TXS 0506+056
Creators: name: Sahu, Sarira
name: Fortin, Carlos Eduardo Lopez
name: Nagataki, Shigehiro
Publisher: name: arXiv
Year: 2020
Subjects: subject: High Energy Astrophysical Phenomena (astro-ph.HE)
subject: High Energy Physics - Phenomenology (hep-ph)
subject: FOS: Physical sciences

description: The detection of a high energy muon neutrino on 22 September 2017 by IceCube neutrino detector coincides with the multiwavelength flaring from the BL Lac object TXS 0506+056, most likely confirming AGN as a source of high energy cosmic rays and neutrinos. Using the photohadronic model, we have explained the very high energy $γ$-rays observed by MAGIC telescopes few days after the neutrino event and extend the model to calculate the neutrino flux at different windows consistent with the flaring period of TXS 0506+056 and compared with the IceCube and MAGIC estimates. We also use this model to estimate the neutrino flux from the flaring of FSRQ PKS B1424-418 which is believed to be associated with the 2 PeV neutrino event observed by IceCube.
description: 10 pages, 2 figures, accepted in Astrophysical Journal
COMMAND-AND-CONTROL OR EFFLUENT ALLOWANCE MARKETS: ROLES OF ECONOMIC ANALYSIS
Creators: name: Speir, Cameron
name: Stephenson, Kurt
name: Shabman, Leonard A.
name: Speir, Cameron
name: Stephenson, Kurt
name: Shabman, Leonard A.
Publisher: name: Unknown
Year: 2000
Subjects: Resource /Energy Economics and Policy

description: Economists and economic analysis can play different roles in the development of water quality management programs. Economists may develop cost analysis for improving regulatory program implementation or design institutional arrangements for market-like program. We argue that cost analysis may be incompatible with effective advocacy for market-like systems.
Approximate greedy clustering and distance selection for graph metrics
Creators: name: Eppstein, David
name: Har-Peled, Sariel
name: Sidiropoulos, Anastasios
Publisher: name: Journal of Computational Geometry
Year: 2020

description: In this paper, we consider two important problems defined on finite metric spaces, and provide efficient new algorithms and approximation schemes for these problems on inputs given as graph shortest path metrics or high-dimensional Euclidean metrics. The first of these problems is the greedy permutation (or farthest-first traversal) of a finite metric space: a permutation of the points of the space in which each point is as far as possible from all previous points. We describe randomized algorithms to compute $(1+\varepsilon)$-approximate greedy permutations of any graph with $n$ vertices and $m$ edges in expected time $O\bigl(\varepsilon^{-1}(m+n)\log n\log(n/\varepsilon) \bigr)$. We also present an algorithm that computes a $(1+\varepsilon)$-approximate greedy permutations of points in high-dimensional Euclidean spaces in expected time $O(\varepsilon^{-2} n^{1+1/(1+\varepsilon)^2 + o(1)})$. Additionally we describe a deterministic algorithm to find exact greedy permutations of any graph with $n$ vertices and treewidth $O(1)$ in worst-case time $O(n^{3/2}\log^{O(1)} n)$. The second problem we consider is distance selection: given $k \le \binom{n}{2}$, we are interested in computing the $k$th smallest distance in the given metric space. We show that for planar graph metrics one can approximate this distance, up to a constant factor, in near linear time.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
An explicit PL-embedding of the square flat torus into $\mathbb{E}^3$
Creators: name: Quintanar, Tanessi
Publisher: name: Journal of Computational Geometry
Year: 2020

description: We present an explicit PL-embedding of the flat square torus $\mathbb{T}^2=\mathbb{E}^2/\mathbb{Z}^2$ into $\mathbb{E}^3$, with 40 vertices and 80 faces.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
A Multitask Learning Approach for Diacritic Restoration
Creators: name: Alqahtani, Sawsan
name: Mishra, Ajay
name: Diab, Mona
Publisher: name: arXiv
Year: 2020
Subjects: subject: Computation and Language (cs.CL)
subject: Machine Learning (cs.LG)
subject: FOS: Computer and information sciences

description: In many languages like Arabic, diacritics are used to specify pronunciations as well as meanings. Such diacritics are often omitted in written text, increasing the number of possible pronunciations and meanings for a word. This results in a more ambiguous text making computational processing on such text more difficult. Diacritic restoration is the task of restoring missing diacritics in the written text. Most state-of-the-art diacritic restoration models are built on character level information which helps generalize the model to unseen data, but presumably lose useful information at the word level. Thus, to compensate for this loss, we investigate the use of multi-task learning to jointly optimize diacritic restoration with related NLP problems namely word segmentation, part-of-speech tagging, and syntactic diacritization. We use Arabic as a case study since it has sufficient data resources for tasks that we consider in our joint modeling. Our joint models significantly outperform the baselines and are comparable to the state-of-the-art models that are more complex relying on morphological analyzers and/or a lot more data (e.g. dialectal data).
Generation of scale-free networks using a simple preferential rewiring dynamics
Creators: name: Ree, Suhan
Publisher: name: arXiv
Year: 2006
Subjects: subject: Statistical Mechanics (cond-mat.stat-mech)
subject: FOS: Physical sciences

description: We propose a simple dynamical model that generates networks with power-law degree distributions with the exponent 2 through rewiring only. At each time step, two nodes, i and j, are randomly selected, and one incoming link to i is redirected to j with the rewiring probability R, determined only by degrees of two nodes, k_i and k_j, while giving preference to high-degree nodes. To take the structure of networks into account, we also consider what types of networks are of interest, whether links are directed or not, and how we choose a rewiring link out of all incoming links to i, as a result, specifying 24 different cases of the model. We then observe numerically that networks will evolve to steady states with power-law degree distributions when parameters of the model satisfy certain conditions.
description: 10 pages, 4 figures
Optimal search strategies for hidden targets
Creators: name: Benichou, O.
name: Coppey, M.
name: Moreau, M.
name: Suet, P-H.
name: Voituriez, R.
Publisher: name: arXiv
Year: 2005
Subjects: subject: Statistical Mechanics (cond-mat.stat-mech)
subject: Biological Physics (physics.bio-ph)
subject: Populations and Evolution (q-bio.PE)
subject: FOS: Physical sciences
subject: FOS: Biological sciences

description: What is the fastest way of finding a randomly hidden target? This question of general relevance is of vital importance for foraging animals. Experimental observations reveal that the search behaviour of foragers is generally intermittent: active search phases randomly alternate with phases of fast ballistic motion. In this letter, we study the efficiency of this type of two states search strategies, by calculating analytically the mean first passage time at the target. We model the perception mecanism involved in the active search phase by a diffusive process. In this framework, we show that the search strategy is optimal when the average duration of "motion phases" varies like the power either 3/5 or 2/3 of the average duration of "search phases", depending on the regime. This scaling accounts for experimental data over a wide range of species, which suggests that the kinetics of search trajectories is a determining factor optimized by foragers and that the perception activity is adequately described by a diffusion process.
description: 4 pages, 5 figures. to appear in Phys. Rev. Lett
Exact computation of the matching distance on 2-parameter persistence modules
Creators: name: Kerber, Michael
name: Lesnick, Michael
name: Oudot, Steve
Publisher: name: Journal of Computational Geometry
Year: 2020

description: The matching distance is a pseudometric on multi-parameter persistence modules, defined in terms of the weighted bottleneck distance on the restriction of the modules to affine lines. It is known that this distance is stable in a reasonable sense, and can be efficiently approximated, which makes it a promising tool for practical applications. In this work, we show that in the 2-parameter setting, the matching distance can be computed exactly in polynomial time. Our approach subdivides the space of affine lines into regions, via a line arrangement. In each region, the matching distance restricts to a simple analytic function, whose maximum is easily computed. As a byproduct, our analysis establishes that the matching distance is a rational number, if the bigrades of the input modules are rational.
description: Journal of Computational Geometry, Vol. 11 No. 2: Special Issue of Selected Papers from SoCG 2019
Halving balls by a hyperplane in deterministic linear time
Creators: name: Hoffmann, Michael
name: Kusters, Vincent
name: Miltzow, Tillmann
Publisher: name: Journal of Computational Geometry
Year: 2020

description: Let $D$ be a set of $n$ pairwise disjoint unit balls in $R^d$ and $P$ the set of their centers. A hyperplane $H$ is an $m$-separator for $D$ if every closed halfspace bounded by $H$ contains at least $m$ points from $P$. This generalizes the notion of halving hyperplanes, which correspond to $n/2$-separators. The analogous notion for point sets is well studied. Separators have various applications, for instance, in divide-and-conquer schemes. In such a scheme, any ball that is intersected by the separating hyperplane may still interact with both sides of the partition. Therefore it is desirable that the separating hyperplane intersects a small number of balls only. We present three deterministic algorithms to bisect a given set of pairwise disjoint unit balls by a hyperplane. Firstly, we present a simple linear-time algorithm to construct an $\alpha n$-separator for balls in $R^d$, for any $0
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
The Coughing Pulsar Magnetosphere
Creators: name: Contopoulos, Ioannis
Publisher: name: arXiv
Year: 2005
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: Polar magnetospheric gaps consume a fraction of the electric potential that develops accross open field lines. This effect modifies significantly the structure of the axisymmetric pulsar magnetosphere. We present numerical stead-state solutions for various values of the gap potential. We show that a charge starved magnetosphere contains significantly less electric current than one with freely available electric charges. As a result, electromagnetic neutron star braking becomes inefficient. We argue that the magnetosphere may spontaneously rearrange itself to a lower energy configuration through a dramatic release of electromagnetic field energy and magentic flux. Our results might be relevant in understanding the recent December 27, 2004 burst observed in SGR 1806-20.
description: 8 pages, 8 figures
Real-space renormalization-group approach to the integer quantum Hall effect
Creators: name: Cain, Philipp
name: Roemer, Rudolf A.
Publisher: name: arXiv
Year: 2005
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: FOS: Physical sciences

description: We review recent results based on an application of the real-space renormalization group (RG) approach to a network model for the integer quantum Hall (QH) transition. We demonstrate that this RG approach reproduces the critical distribution of the power transmission coefficients, i.e., two-terminal conductances, P_c(G), with very high accuracy. The RG flow of P(G) yields a value of the critical exponent nu that agrees with most accurate large-size lattice simulations. A description of how to obtain other relevant transport coefficients such as R_L and R_H is given. From the non-trivial fixed point of the RG flow we extract the critical level-spacing distribution (LSD) which is close, but distinctively different from the earlier large-scale simulations. We find that the LSD obeys scaling behavior around the QH transition with nu=2.37\pm 0.02. Away from the transition it changes towards the Poisson distribution. We next investigate the plateau-to-insulator transition. For a fully quantum coherent situation, we find a quantized Hall insulator with R_H ~ h/e^2 up to R_L ~ 20 h/e^2 when interpreting the results in terms of the most probable value of the distribution P(R_H). Upon further increasing R_L, the Hall insulator with diverging R_H ~ R_L^kappa is seen. This crossover depends on the precise nature of the averaging of P(R_L) and P(R_H). We also study the effect of long-ranged inhomogeneities on the critical properties of the QH transition modeled by a power law correlation in the random potential. Similar to the classical percolation, we observe an enhancement of nu with decreasing correlation range. These results exemplify the surprising fact that a small RG unit, containing five nodes, accurately captures most of the correlations responsible for the QH transition.
description: 35 pages, 14 figures, submitted to Int. J. Mod. Phys. B
Spin anisotropy effects in dimer single molecule magnets
Creators: name: Efremov, Dmitri V.
name: Klemm, Richard A.
Publisher: name: arXiv
Year: 2006
Subjects: subject: Mesoscale and Nanoscale Physics (cond-mat.mes-hall)
subject: Statistical Mechanics (cond-mat.stat-mech)
subject: FOS: Physical sciences

description: We present a model of equal spin $s_1$ dimer single molecule magnets. The spins within each dimer interact via the Heisenberg and the most general set of four quadratic anisotropic spin interactions with respective strengths $J$ and $\{J_j\}$, and with the magnetic induction ${\bf B}$. We solve the model exactly for $s_1=1/2, 1, 5/2$, and for antiferromagnetic Heisenberg couplings ($J<0$), present ${\bf M}({\bf B})$ curves at low $T$ for these cases. Low-$T$ $C_V({\bf B})$ curves for $s_1=1/2$ and electron paramagnetic susceptibility $χ({\bf B},ω)$ for $s_1=1$ are also provided. For weak anisotropy interactions, we employ a perturbative treatment, and show that the Hartree and extended Hartree approximations lead to reliable analytic results at low $T$ and large $B$ for these quantities and for the inelastic neutron scattering cross-section $S({\bf B}, {\bf q},ω)$. Our results are discussed with regard to existing ${\bf M}({\bf B})$ experiments on $s_1=5/2$ Fe$_2$ dimer single molecule magnets, and suggest that one of them contains a substantial amount of single-ion anisotropy, without any sizeable global spin anisotropy. We urge further experiments of the above types on single crystals of Fe$_2$ and on some $s_=9/2$ [Mn$_4$]$_2$ dimers, in order to elucidate the precise values of the various microscopic interactions.
description: 30 pages, 25 figures, submitted to Phys. Rev. B
Local theta correspondence: the basic theory
Creators: name: Sun, Binyong
name: Zhu, Chen-Bo
Publisher: name: arXiv
Year: 2020
Subjects: subject: Representation Theory (math.RT)
subject: FOS: Mathematics
subject: 22E46, 22E50

description: We give an elementary introduction to Classical Invariant Theory and its modern extension "Transcending Classical Invariant Theory", commonly known as the theory of local theta correspondence. We explain the two fundamental assertions of the theory: the Howe duality conjecture and the Kudla-Rallis conservation relation conjecture. We give a status report on the problem of explicitly describing local theta correspondence in terms of Langlands-Vogan parameters. We conclude with a discussion on a certain problem of automatic continuity, which manifests unity of the theory in algebraic and smooth settings.
description: To appear in the Proceedings of the International Congress of Chinese Mathematicians, 2018
ENVIRONMENTAL ACCOUNTING IN AGRICULTURE: A THEORETICAL OVERVIEW WITH SPECIAL REFERENCE TO TUSCANY
Creators: name: Pacini, Cesare
name: Wossink, Ada
name: Vazzana, Concetta
name: Omodei-Zorini, Luigi
name: Pacini, Cesare
name: Wossink, Ada
name: Vazzana, Concetta
name: Omodei-Zorini, Luigi
Publisher: name: Unknown
Year: 2000
Subjects: Environmental Economics and Policy

description: This paper addresses its specifics of environmental accounting for agriculture. Particularly it focuses on (a) data collecting/presenting or the environmental accounting methodology in agriculture, and. (b) indicators to measure the environmental consequences of agricultural production. The paper takes farming systems in the Tuscany Region in Italy and its specific environmental policy and management issues as a back drop. A new Environmental Accounting Information System (EAIS) is exposed that comprises both a set of environmental indicators for the evaluation of the farm externalities and the estimate of the farm environmental capital, a data collection system (the Environmental Accounting Questionnaire) and a set of elaboration methodologies for the indicators calculation. Examples about how to collect data and indicators elaboration methodology application are presented with special concern to ecological-environmental models and yardsticks (GLEAMS, EPRIP), biodiversity indicators and landscape evaluation.
Long-Wavelength Modes of Cosmological Scalar Fields
Creators: name: Jankiewicz, Marcin
name: Kephart, Thomas W.
Publisher: name: arXiv
Year: 2005
Subjects: subject: High Energy Physics - Phenomenology (hep-ph)
subject: Astrophysics (astro-ph)
subject: General Relativity and Quantum Cosmology (gr-qc)
subject: FOS: Physical sciences

description: We give a numerical analysis of long-wavelength modes in the WKB approximation of cosmological scalar fields coupled to gravity via $ξϕ^{2}R$. Massless fields are coupled conformally at $ξ=1/6$. Conformality can be preserved for fields of nonzero mass by shifting $ξ$. We discuss implications for density perturbations.
description: 10 pages, 10 figures, several stylistic improvements
PRODUCTION ECONOMICS AND THE MODERNIZATION OF TRADITIONAL AGRICULTURES
Creators: name: Mellor, John W.
name: Mellor, John W.
Publisher: name: Unknown
Year: 1969
Subjects: Production Economics

description: A traditional agriculture operates in a relatively static physical, economic and cultural environment and as a consequence becomes relatively well adjusted to that environment. Modernization of agriculture occurs when substantial and continuing change in the decision-making environment provides incentives to make new farming decisions. Farming then becomes dynamic as farmers attempt to reach constantly shifting points of equilibrium. Agricultural production economics in low income countries has been too much applied to a search for disequilibria within the given static environment and not enough to the possibilities and results of deliberately changing that environment.
Sources of high leverage in linear regression model
Creators: name: Kim, Myung Geun
Publisher: name: arXiv
Year: 2020
Subjects: subject: Statistics Theory (math.ST)
subject: FOS: Mathematics

description: Some reasons for high leverage are analytically investigated by decomposing leverage into meaningful components. The results in this work can be used for remedial action as a next step of data analysis.
On the classification of motions of paradoxically movable graphs
Creators: name: Grasegger, Georg
name: Legerský, Jan
name: Schicho, Josef
Publisher: name: Journal of Computational Geometry
Year: 2020

description: Edge lengths of a graph are called flexible if there exist infinitely many non-congruent realizations of the graph in the plane satisfying these edge lengths. It has been shown recently that a graph has flexible edge lengths if and only if the graph has a special type of edge coloring called NAC-coloring. We address the question how to determine paradoxical motions of a generically rigid graph, namely, proper flexible edge lengths of the graph. We do so using the set of all NAC-colorings of the graph and restrictions to 4-cycle subgraphs.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
Delocalized fermions in underdoped cuprates
Creators: name: Sutherland, Mike
name: Li, S. Y.
name: Hawthorn, D. G.
name: Hill, R. W.
name: Ronning, F.
name: Tanatar, M. A.
name: Paglione, J.
name: Zhang, H.
name: Taillefer, Louis
name: DeBenedictis, J.
name: Liang, Ruixing
name: Bonn, D. A.
name: Hardy, W. N.
Publisher: name: arXiv
Year: 2005
Subjects: subject: Superconductivity (cond-mat.supr-con)
subject: FOS: Physical sciences

description: Low temperature heat transport was used to investigate the ground state of high-purity single crystals of the lightly-doped cuprate YBa$_{2}$Cu$_{3}$O$_{6.33}$. Samples were measured on either side of the superconducting phase boundary, in both zero and applied magnetic field. We report the observation of delocalized fermionic excitations at zero energy in the non-superconducting state, which shows that the ground state of underdoped cuprates is metallic. Its low-energy spectrum appears to be similar to that of the d-wave superconductor, i.e. nodal. The insulating ground state observed in underdoped La$_{2-x}$Sr$_{x}$CuO$_4$ is attributed to the competing spin-density-wave order present in that system.
description: 4 pages, 3 figures; published in Physical Review Letters
Time-space trade-offs for computing Euclidean minimum spanning trees
Creators: name: Banyassady, Bahareh
name: Barba, Luis
name: Mulzer, Wolfgang
Publisher: name: Journal of Computational Geometry
Year: 2020

description: $\newcommand{\EMST}{\mathrm{EMST}}\newcommand{\RNG}{\mathrm{RNG}}$We present time-space trade-offs for computing the Euclidean minimum spanning tree of a set $S$ of $n$ point-sites in the plane. More precisely, we assume that $S$ resides in a random-access memory that can only be read. The edges of the Euclidean minimum spanning tree $\EMST(S)$ have to be reported sequentially, and they cannot be accessed or modified afterwards. There is a parameter $s \in \{1, \dots, n\}$ so that the algorithm may use $O(s)$ cells of read-write memory (called the workspace) for its computations. Our goal is to find an algorithm that has the best possible running time for any given $s$ between $1$ and $n$. We show how to compute $\EMST(S)$ in $O\big((n^3/s^2)\log s \big)$ time with $O(s)$ cells of workspace, giving a smooth trade-off between the two best known bounds $O(n^3)$ for $s = 1$ and $O(n \log n)$ for $s = n$. For this, we run Kruskal's algorithm on the relative neighborhood graph (RNG) of $S$. It is a classic fact that the minimum spanning tree of $\RNG(S)$ is exactly $\EMST(S)$. To implement Kruskal's algorithm with $O(s)$ cells of workspace, we define \emph{$s$-nets}, a compact representation of planar graphs. This allows us to efficiently maintain and update the components of the current minimum spanning forest as the edges are being inserted.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
Nominally forbidden transitions in the interband optical spectrum of quantum dots
Creators: name: Narvaez, Gustavo A.
name: Zunger, Alex
Publisher: name: arXiv
Year: 2006
Subjects: subject: Materials Science (cond-mat.mtrl-sci)
subject: FOS: Physical sciences

description: We calculate the excitonic optical absorption spectra of (In,Ga)As/GaAs self-assembled quantum dots by adopting an atomistic pseudopotential approach to the single-particle problem followed by a configuration-interaction approach to the many-body problem. We find three types of allowed transitions that would be naively expected to be forbidden. (i) Transitions that are parity forbidden in simple effective mass models with infinite confining wells (e.g. 1S-2S, 1P-2P) but are possible by finite band-offsets and orbital-mixing effects; (ii) light-hole--to--conduction transitions, enabled by the confinement of light-hole states; and (iii) transitions that show and enhanced intensity due to electron-hole configuration mixing with allowed transitions. We compare these predictions with results of 8-band k.p calculations as well as recent spectroscopic data. Transitions in (i) and (ii) explain recently observed satellites of the allowed P-P transitions.
description: Version published in Phys. Rev. B
A simple randomized $O(n \log n)$–time closest-pair algorithm in doubling metrics
Creators: name: Smid, Michiel
name: Maheshwari, Anil
name: Mulzer, Wolfgang
Publisher: name: Journal of Computational Geometry
Year: 2020

description: Consider a metric space $(P,dist)$ with $N$ points whose doubling dimension is a constant. We present a simple, randomized, and recursive algorithm that computes, in $O(N \log N)$ expected time, the closest-pair distance in $P$. To generate recursive calls, we use previous results of Har-Peled and Mendel, and Abam and Har-Peled for computing a sparse annulus that separates the points in a balanced way.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
4-Connected triangulations on few lines
Creators: name: Felsner, Stefan
Publisher: name: Journal of Computational Geometry
Year: 2020

description: We show that 4-connected plane triangulations can be redrawn such that edges are represented by straight segments and the vertices are covered by a set of at most $\sqrt{2n}$ lines each of them horizontal or vertical. The same holds for all subgraphs of such triangulations. The proof is based on a corresponding result for diagrams of planar lattices which makes use of orthogonal chain and antichain families.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
CH stars at High Galactic Latitudes
Creators: name: Goswami, Aruna
Publisher: name: arXiv
Year: 2005
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: In the present work we report on several CH stars identified in a sample of Faint High Latitude Carbon stars from Hamburg survey and discuss their medium resolution spectra covering a wavelength range 4000 - 6800 Å. Estimation of the depths of bands (1,0) $^{12}$C$^{12}$C $λ$4737 and (1,0) $^{12}$C$^{13}$C $λ$4744 in these stars indicate isotopic ratio $^{12}$C/$^{13}$C ${\sim}$ 3, except for a few exceptions; these ratios are consistent with existing theories of CH stars evolution. The stars of Hamburg survey, a total of 403 objects were reported to be carbon star candidates with strong C$_{2}$ and CN molecular bands. In the first phase of observation, we have acquired spectra of ninety one objects. Inspection of the objects spectra show fifty one objects with C$_{2}$ molecular bands in their spectra of which thirteen stars have low flux below about 4300 Å. Twenty five objects show weak or moderate CH and CN bands, twelve objects show weak but detectable CH bands in their spectra and there are three objects which do not show any molecular bands due to C$_{2}$, CN or CH in their spectra. Objects with C$_{2}$ molecular bands and with good signals bluewards of 4300 Åwhich show prominent CH bands in their spectra are potential candidate CH stars. Thirty five such candidates are found in the present sample of ninty one objects observed so far. The set of CH stars identified could be the targets of subsequent observation at high resolution for a detail and comprehensive analysis for understanding their role in early Galactic chemical evolution.
description: 14 pages including 9 figures
Drawing graphs on few lines and few planes
Creators: name: Chaplick, Steven
name: Fleszar, Krzysztof
name: Lipp, Fabian
name: Ravsky, Alexander
name: Verbitsky, Oleg
name: Wolff, Alexander
Publisher: name: Journal of Computational Geometry
Year: 2020

description: We investigate the problem of drawing graphs in 2D and 3D such that their edges (or only their vertices) can be covered by few lines or planes. We insist on straight-line edges and crossing-free drawings. This problem has many relations to other challenging graph-drawing problems such as small-area or small-volume drawings,layered or track drawings, and drawing graphs with low visual complexity. While some facts about our problem are implicit in previous work, this is the first treatment of the problem in its full generality. Our contribution is as follows. We show lower and upper bounds for the numbers of lines and planes needed for covering drawings of graphs in certain graph classes. In some cases our bounds are asymptotically tight; in some cases we are able to determine exact values. We relate our parameters to standard combinatorial characteristics of graphs (such as the chromatic number, treewidth, or arboricity) and to parameters that have been studied in graph drawing (such as the track number or the number of segments appearing in a drawing). We pay special attention to planar graphs. For example, we show that there are planar graphs that can be drawn in 3-space on asymptotically fewer lines than in the plane.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
Faster algorithms for some optimization problems on collinear points
Creators: name: Biniaz, Ahmad
name: Bose, Prosenjit
name: Carmi, Paz
name: Maheshwari, Anil
name: Munro, Ian
name: Smid, Michiel
Publisher: name: Journal of Computational Geometry
Year: 2020

description: We propose faster algorithms for the following three optimization problems on $n$ collinear points, i.e., points in dimension one. The first two problems are known to be NP-hard in higher dimensions. 1- Maximizing total area of disjoint disks: In this problem the goal is to maximize the total area of nonoverlapping disks centered at the points. Acharyya, De, and Nandy (2017) presented an $O(n^2)$-time algorithm for this problem. We present an optimal $\Theta(n)$-time algorithm. 2- Minimizing sum of the radii of client-server coverage: The n points are partitioned into two sets, namely clients and servers. The goal is to minimize the sum of the radii of disks centered at servers such that every client is in some disk, i.e., in the coverage range of some server. Lev-Tov and Peleg (2005) presented an $O(n^3)$-time algorithm for this problem. We present an $O(n^2)$-time algorithm, thereby improving the running time by a factor of $\Theta(n)$. 3- Minimizing total area of point-interval coverage: The $n$ input points belong to an interval $I$. The goal is to find a set of disks of minimum total area, covering $I$, such that every disk contains at least one input point. We present an algorithm that solves this problem in $O(n^2)$ time.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)
Die Bedeutung der Mitgliedschaft im ökumenischen Rat der Kirchen
Creators: name: W. A. Visser 'Thooft
Publisher: name: Ökumenische Rundschau
Year: 2025

description: Ökumenische Rundschau, Bd. 12 Nr. 3 (1963): Ökumenische Rundschau, Band 12, Heft 3
IS THE CONCEPT OF THE HOME MAINTENANCE AREA OUTMODED?
Creators: name: Lewis, Jack Neville
name: Lewis, Jack Neville
Publisher: name: Unknown
Year: 1963
Subjects: Land Economics/Use

description: The home maintenance area or living area has played an important part in closer settlement programmes in Australia during the last fifty years. It has been applied in Australian land policy in a number of ways:- (i) as a maximum in restricting transfers of land to prevent aggregation into large holdings; ( ii) as a minimum in determining the size of farms to be allotted in closer settlement programmes; (iii) as a measure in determining the area for retention by an original holder, when land is resumed or surrendered for closer settlement.
GRB 050117: Simultaneous Gamma-ray and X-ray Observations with the Swift Satellite
Creators: name: Hill, J. E.
name: Morris, D. C.
name: Sakamoto, T.
name: Sato, G.
name: Burrows, D. N.
name: Angelini, L.
name: Pagani, C.
name: Moretti, A.
name: Abbey, A. F.
name: Barthelmy, S.
name: Beardmore, A. P.
name: Biryukov, V. V.
name: Campana, S.
name: Capalbi, M.
name: Cusumano, G.
name: Giommi, P.
name: Ibrahimov, M. A.
name: Kennea, J.
name: Kobayashi, S.
name: Ioka, K.
name: Markwardt, C.
name: Meszaros, P.
name: O'Brien, P. T.
name: Osborne, J. P.
name: Pozanenko, A. S.
name: Perri, M.
name: Rumyantsev, V. V.
name: Shady, P.
name: Sharapov, D. A.
name: Tagliaferri, G.
name: Zhang, B.
name: Chincarini, G.
name: Gehrels, N.
name: Wells, A.
name: Nousek, J. A.
Publisher: name: arXiv
Year: 2005
Subjects: subject: Astrophysics (astro-ph)
subject: FOS: Physical sciences

description: The Swift Gamma-Ray Burst Explorer performed its first autonomous, X-ray follow-up to a newly detected GRB on 2005 January 17, within 193 seconds of the burst trigger by the Swift Burst Alert Telescope. While the burst was still in progress, the X-ray Telescope obtained a position and an image for an un-catalogued X-ray source; simultaneous with the gamma-ray observation. The XRT observed flux during the prompt emission was 1.1 x 10^{-8} ergs cm^{-2} s^{-1} in the 0.5-10 keV energy band. The emission in the X-ray band decreased by three orders of magnitude within 700 seconds, following the prompt emission. This is found to be consistent with the gamma-ray decay when extrapolated into the XRT energy band. During the following 6.3 hours, the XRT observed the afterglow in an automated sequence for an additional 947 seconds, until the burst became fully obscured by the Earth limb. A faint, extremely slowly decaying afterglow, alpha=-0.21$, was detected. Finally, a break in the lightcurve occurred and the flux decayed with alpha
description: 27 pages, 6 figures. Accepted for publication in ApJ
Boys’ masculinities in play : in dialogue with anti-violence teachers and students
Creators: name: Wang, Athena L. Y.
Publisher: name: University of British Columbia
Year: 2009

description: Feminist and other scholars have begun to examine masculinity and boys' schooling, as well as the connection between masculinity and male violence. However, research that looks at anti-violence instructors' and their students' discussions about masculinity and male violence within the context of anti-violence education remains sparse. In addition, the limited work on boys' own views of masculinity has focused primarily on White boys' experiences with hegemonic masculinity. This latter research is also Australian, British, and American, with litde in the Canadian context. The purpose of this study is to explore, through semi-structured interviews, the talk of a small multiethnic sample of anti-violence teachers, boys, and girls on masculinity and male violence within the context of their gender, culture, and "race." Twenty-six grade 10 students (12 male, 14 female) who completed a school-sponsored violence prevention program in two Canadian high schools and six (three male, three female) anti-violence instructors who taught the program were interviewed. All interviews were tape recorded and transcribed for analysis. Drawing on a feminist poststructuralist framework in my analysis, four main themes emerged. First, many boys played hegemonic masculinity in certain situations due to their perception that it was necessary, while engaging in non-oppressive masculinities in other situations. Second, girls not only reinforced, albeit sometimes unintentionally, boys' hegemonic masculinity talk and practices, but many also struggled with challenging a dominant image of manhood. Third, "race" and culture were found to play a significant role in considerations of masculinity. Fourth, everyone's talk revealed the connection between hegemonic masculinity and male violence. The findings from this study suggest that drawing on feminist poststructuralism in developing a framework for conceptualizing masculinity would serve as a useful tool in teaching anti-violence programs to diverse groups of boys (and girls).
SO(2,C) Invariant Discrete Gauge States in Liouville Gravity Coupled to Minimal Conformal Matter
Creators: name: Lee, Jen-Chi
Publisher: name: arXiv
Year: 2005
Subjects: subject: High Energy Physics - Theory (hep-th)
subject: FOS: Physical sciences

description: We contruct the general formula for a set of discrete gauge states (DGS) in c<1 Liouville theory. This formula reproduces the previously found c=1 DGS in the appropriate limiting case. We also demonstrate the SO(2,C) invariant structure of these DGS in the old covariant quantization of the theory. This is in analogy to the SO(2,C) invariant ring structure of BRST cohomology of the theory.
Face flips in origami tessellations
Creators: name: Akitaya, Hugo A.
name: Dujmović, Vida
name: Eppstein, David
name: Hull, Thomas C.
name: Jain, Kshitij
name: Lubiw, Anna
Publisher: name: Journal of Computational Geometry
Year: 2020

description: Given a flat-foldable origami crease pattern $G=(V,E)$ (a straight-line drawing of a planar graph on a region of the plane) with a mountain-valley (MV) assignment $\mu:E\to\{-1,1\}$ indicating which creases in $E$ bend convexly (mountain) or concavely (valley), we may flip a face $F$ of $G$ to create a new MV assignment $\mu_F$ which equals $\mu$ except for all creases $e$ bordering $F$, where we have $\mu_F(e)=-\mu(e)$. In this paper we explore the configuration space of face flips for a variety of crease patterns $G$ that are tilings of the plane, proving examples where $\mu_F$ results in a MV assignment that is either never, sometimes, or always flat-foldable for various choices of $F$. We also consider the problem of finding, given two foldable MV assignments $\mu_1$ and $\mu_2$ of a given crease pattern $G$, a minimal sequence of face flips to turn $\mu_1$ into $\mu_2$. We find polynomial-time algorithms for this in the cases where $G$ is either a square grid or the Miura-ori, and show that this problem is NP-hard in the case where $G$ is the triangle lattice.
description: Journal of Computational Geometry, Vol. 11 No. 1 (2020)