Comparative Economics of Maize Grain and Seed Production in Okhaldhunga District, Nepal

Maize cultivation is the one the major farm activities among Nepalese farmers. Basically, in the rural hills of Nepal like Okhaldhunga, it dominates any other crop production. The study was conducted for comparative assessment of economics, marketing and identification of major problems of maize seed and grain production in the hilly eastern district, Okhaldhunga during June of 2017. The data were obtained through the interview of 66 producers (33 each of maize grain and seed producers) with a pre-tested semi-structured questionnaire. Descriptive statistics and parametric tests (-test, t-test) were applied. Both the grain and the seed producers were similar in terms of socio-demographic characteristics, marketing accessibilities but the seed producers were significantly benefited from the training, the extension services, credit facilities despite having 0.14 ha lesser landholding than grain producers. The inputs (manures, fertilizers and the seed) contributed 48% and 50% of the total cost incurred for grain and seed production respectively and the pre-sowing and sowing activities contributed more than 77% of cost in both cases. Despite higher cost for seed production (NRs. 24,969 more than grain production), the benefit-cost ratio of seed production was found higher (1.31) than grain production (1.05). Only 24% of the total harvest was processed and marketed as seed and using optimum quantity (66% middle portion of the cob) for seed production could further increase the income by 23.35%, the improved B:C ratio being 1.51 . The major production problems were scarce farm labor followed by lack of infrastructures while low seasonal price followed by low volume of production ranked the first and second most important marketing related problems

Economics of Rice Production in Pyuthan District of Nepal

A research was conducted at Pyuthan district in order to access the profitability of rice production in Pyuthan during the summer season of 2018-2019. Altogether of 70 respondents were selected randomly and surveyed with semi-structured interview schedule. The results revealed that the average land holding was 0.45 hectare, and the average rice cultivation area was 0.34 hectare. On the basis of average rice cultivation area, farmers were categorized as small (39) and large (31). The cost and return was calculated among both the category. t- test was used to compare the mean costs of inputs between small and large farmers. Cost for agronomic operations was found far higher (more than 70%) in both the category in compared to the cost of inputs. Contribution of rice grains and straw to overall return was 72.65% and 27.35% respectively. Benefit Cost ratio was found greater among large farmers. The average B:C ratio was 1.51, which was fairly higher than 1.14 in Dang district indicating the investment of rice production is expected to deliver a positive net return to the farmers of the study area. In a nutshell, rice cultivation is an important enterprise that should be encouraged, considering the fact that it is a major staple crop

Constraining phases of quark matter with studies of r-mode damping in neutron stars

The r-mode instability in rotating compact stars is used to constrain the phase of matter at high density. The color-flavor-locked phase with kaon condensation (CFL-K0) and without (CFL) is considered in the temperature range 10^8K < T <10^{11} K. While the bulk viscosity in either phase is only effective at damping the r-mode at temperatures T > 10^{11} K, the shear viscosity in the CFL-K0 phase is the only effective damping agent all the way down to temperatures T > 10^8 K characteristic of cooling neutron stars. However, it cannot keep the star from becoming unstable to gravitational wave emission for rotation frequencies f ~ 56-11 Hz at T ~ 10^8-10^9 K. Stars composed almost entirely of CFL or CFL-K0 matter are ruled out by observation of rapidly rotating neutron stars, indicating that dissipation at the quark-hadron interface or nuclear crust interface must play a key role in damping the instability.Comment: 8 pages, 2 figure

Radiative Neutron Capture on Carbon-14 in Effective Field Theory

The cross section for radiative capture of neutron on carbon-14 is calculated using the model-independent formalism of halo effective field theory. The dominant contribution from E1 transition is considered, and the cross section is expressed in terms of elastic scattering parameters of the effective range expansion. Contributions from both resonant and non-resonant interaction are calculated. Significant interference between these leads to a capture contribution that deviates from simple Breit-Wigner resonance form.Comment: 14 pages, 6 figure

Rabin Games and Colourful Universal Trees

We provide an algorithm to solve Rabin and Streett games over graphs with $n$ vertices, $m$ edges, and $k$ colours that runs in $\tilde{O}\left(mn(k!)^{1+o(1)} \right)$ time and $O(nk\log k \log n)$ space, where $\tilde{O}$ hides poly-logarithmic factors. Our algorithm is an improvement by a super quadratic dependence on $k!$ from the currently best known run time of $O\left(mn^2(k!)^{2+o(1)}\right)$, obtained by converting a Rabin game into a parity game, while simultaneously improving its exponential space requirement. Our main technical ingredient is a characterisation of progress measures for Rabin games using \emph{colourful trees} and a combinatorial construction of succinctly-represented, universal colourful trees. Colourful universal trees are generalisations of universal trees used by Jurdzi\'{n}ski and Lazi\'{c} (2017) to solve parity games, as well as of Rabin progress measures of Klarlund and Kozen (1991). Our algorithm for Rabin games is a progress measure lifting algorithm where the lifting is performed on succinct, colourful, universal trees.Comment: 31 pages, 4 figures. Accepted at TACAS 202

General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond

The model of asynchronous programming arises in many contexts, from low-level systems software to high-level web programming. We take a language-theoretic perspective and show general decidability and undecidability results for asynchronous programs that capture all known results as well as show decidability of new and important classes. As a main consequence, we show decidability of safety, termination and boundedness verification for higher-order asynchronous programs -- such as OCaml programs using Lwt -- and undecidability of liveness verification already for order-2 asynchronous programs. We show that under mild assumptions, surprisingly, safety and termination verification of asynchronous programs with handlers from a language class are decidable iff emptiness is decidable for the underlying language class. Moreover, we show that configuration reachability and liveness (fair termination) verification are equivalent, and decidability of these problems implies decidability of the well-known "equal-letters" problem on languages. Our results close the decidability frontier for asynchronous programs

The Complexity of Bounded Context Switching with Dynamic Thread Creation

Dynamic networks of concurrent pushdown systems (DCPS) are a theoretical model for multi-threaded recursive programs with shared global state and dynamical creation of threads. The (global) state reachability problem for DCPS is undecidable in general, but Atig et al. (2009) showed that it becomes decidable, and is in 2EXPSPACE, when each thread is restricted to a fixed number of context switches. The best known lower bound for the problem is EXPSPACE-hard and this lower bound follows already when each thread is a finite-state machine and runs atomically to completion (i.e., does not switch contexts). In this paper, we close the gap by showing that state reachability is 2EXPSPACE-hard already with only one context switch. Interestingly, state reachability analysis is in EXPSPACE both for pushdown threads without context switches as well as for finite-state threads with arbitrary context switches. Thus, recursive threads together with a single context switch provide an exponential advantage. Our proof techniques are of independent interest for 2EXPSPACE-hardness results. We introduce transducer-defined Petri nets, a succinct representation for Petri nets, and show coverability is 2EXPSPACE-hard for this model. To show 2EXPSPACE-hardness, we present a modified version of Lipton's simulation of counter machines by Petri nets, where the net programs can make explicit recursive procedure calls up to a bounded depth