Development and evaluation of an automated spray patternator using digital liquid level sensors

Citation: Luck, J. D., Schaardt, W. A., Forney, S. H., & Sharda, A. (2016). Development and evaluation of an automated spray patternator using digital liquid level sensors. Applied Engineering in Agriculture, 32(1), 47-52. doi:10.13031/aea.32.11381The purpose of this study was to develop and evaluate an automated spray pattern measurement system which utilized digital liquid level sensors to quantify the coefficient of variation (CV) for different nozzle configurations. The overall system was designed to measure nozzle effluent in 25 mm divisions from 38.1 to 76.2 cm in width for multiple nozzle configurations with a total patternator surface width of 3.05 m. The patternator surface and data collection system were designed and developed to achieve three primary goals: patternator surface division accuracy, data collection system accuracy, and data collection system repeatability. Patternator surface measurements indicated an average standard deviation of approximately 0.1 mm (0.4%) which would not contribute significantly to spray pattern CV estimates. To quantify the measurement accuracy, the automated system was compared to manual data collection using weights collected from graduated cylinders. Statistical analysis revealed no difference (p > 0.05) between CV estimates from the manual and automated data collection methods. The average difference in CV between the two methods was 0.15% which considered 12 tests per method. Repeatability was also a primary concern, the standard deviation among CV values for tests conducted with the automated system was only 0.35%. The evaluation of the system provided confidence that suitable results would be acquired for different nozzle configurations consisting of acceptable or relatively poor spray patterns. © 2016 American Society of Agricultural and Biological Engineers

Reed-Muller codes for random erasures and errors

This paper studies the parameters for which Reed-Muller (RM) codes over $GF(2)$ can correct random erasures and random errors with high probability, and in particular when can they achieve capacity for these two classical channels. Necessarily, the paper also studies properties of evaluations of multi-variate $GF(2)$ polynomials on random sets of inputs. For erasures, we prove that RM codes achieve capacity both for very high rate and very low rate regimes. For errors, we prove that RM codes achieve capacity for very low rate regimes, and for very high rates, we show that they can uniquely decode at about square root of the number of errors at capacity. The proofs of these four results are based on different techniques, which we find interesting in their own right. In particular, we study the following questions about $E(m,r)$, the matrix whose rows are truth tables of all monomials of degree $\leq r$ in $m$ variables. What is the most (resp. least) number of random columns in $E(m,r)$ that define a submatrix having full column rank (resp. full row rank) with high probability? We obtain tight bounds for very small (resp. very large) degrees $r$, which we use to show that RM codes achieve capacity for erasures in these regimes. Our decoding from random errors follows from the following novel reduction. For every linear code $C$ of sufficiently high rate we construct a new code $C'$, also of very high rate, such that for every subset $S$ of coordinates, if $C$ can recover from erasures in $S$, then $C'$ can recover from errors in $S$. Specializing this to RM codes and using our results for erasures imply our result on unique decoding of RM codes at high rate. Finally, two of our capacity achieving results require tight bounds on the weight distribution of RM codes. We obtain such bounds extending the recent \cite{KLP} bounds from constant degree to linear degree polynomials

Minimal-memory realization of pearl-necklace encoders of general quantum convolutional codes

Quantum convolutional codes, like their classical counterparts, promise to offer higher error correction performance than block codes of equivalent encoding complexity, and are expected to find important applications in reliable quantum communication where a continuous stream of qubits is transmitted. Grassl and Roetteler devised an algorithm to encode a quantum convolutional code with a "pearl-necklace encoder." Despite their theoretical significance as a neat way of representing quantum convolutional codes, they are not well-suited to practical realization. In fact, there is no straightforward way to implement any given pearl-necklace structure. This paper closes the gap between theoretical representation and practical implementation. In our previous work, we presented an efficient algorithm for finding a minimal-memory realization of a pearl-necklace encoder for Calderbank-Shor-Steane (CSS) convolutional codes. This work extends our previous work and presents an algorithm for turning a pearl-necklace encoder for a general (non-CSS) quantum convolutional code into a realizable quantum convolutional encoder. We show that a minimal-memory realization depends on the commutativity relations between the gate strings in the pearl-necklace encoder. We find a realization by means of a weighted graph which details the non-commutative paths through the pearl-necklace. The weight of the longest path in this graph is equal to the minimal amount of memory needed to implement the encoder. The algorithm has a polynomial-time complexity in the number of gate strings in the pearl-necklace encoder.Comment: 16 pages, 5 figures; extends paper arXiv:1004.5179v

Good Quantum Convolutional Error Correction Codes And Their Decoding Algorithm Exist

Quantum convolutional code was introduced recently as an alternative way to protect vital quantum information. To complete the analysis of quantum convolutional code, I report a way to decode certain quantum convolutional codes based on the classical Viterbi decoding algorithm. This decoding algorithm is optimal for a memoryless channel. I also report three simple criteria to test if decoding errors in a quantum convolutional code will terminate after a finite number of decoding steps whenever the Hilbert space dimension of each quantum register is a prime power. Finally, I show that certain quantum convolutional codes are in fact stabilizer codes. And hence, these quantum stabilizer convolutional codes have fault-tolerant implementations.Comment: Minor changes, to appear in PR

Multi-Exciton Spectroscopy of a Single Self Assembled Quantum Dot

We apply low temperature confocal optical microscopy to spatially resolve, and spectroscopically study a single self assembled quantum dot. By comparing the emission spectra obtained at various excitation levels to a theoretical many body model, we show that: Single exciton radiative recombination is very weak. Sharp spectral lines are due to optical transitions between confined multiexcitonic states among which excitons thermalize within their lifetime. Once these few states are fully occupied, broad bands appear due to transitions between states which contain continuum electrons.Comment: 12 pages, 4 figures, submitted for publication on Jan,28 199

Complexity of Discrete Energy Minimization Problems

Discrete energy minimization is widely-used in computer vision and machine learning for problems such as MAP inference in graphical models. The problem, in general, is notoriously intractable, and finding the global optimal solution is known to be NP-hard. However, is it possible to approximate this problem with a reasonable ratio bound on the solution quality in polynomial time? We show in this paper that the answer is no. Specifically, we show that general energy minimization, even in the 2-label pairwise case, and planar energy minimization with three or more labels are exp-APX-complete. This finding rules out the existence of any approximation algorithm with a sub-exponential approximation ratio in the input size for these two problems, including constant factor approximations. Moreover, we collect and review the computational complexity of several subclass problems and arrange them on a complexity scale consisting of three major complexity classes -- PO, APX, and exp-APX, corresponding to problems that are solvable, approximable, and inapproximable in polynomial time. Problems in the first two complexity classes can serve as alternative tractable formulations to the inapproximable ones. This paper can help vision researchers to select an appropriate model for an application or guide them in designing new algorithms.Comment: ECCV'16 accepte

The impact of predation by marine mammals on Patagonian toothfish longline fisheries

Predatory interaction of marine mammals with longline fisheries is observed globally, leading to partial or complete loss of the catch and in some parts of the world to considerable financial loss. Depredation can also create additional unrecorded fishing mortality of a stock and has the potential to introduce bias to stock assessments. Here we aim to characterise depredation in the Patagonian toothfish (Dissostichus eleginoides) fishery around South Georgia focusing on the spatio-temporal component of these interactions. Antarctic fur seals (Arctocephalus gazella), sperm whales (Physeter macrocephalus), and orcas (Orcinus orca) frequently feed on fish hooked on longlines around South Georgia. A third of longlines encounter sperm whales, but loss of catch due to sperm whales is insignificant when compared to that due to orcas, which interact with only 5% of longlines but can take more than half of the catch in some cases. Orca depredation around South Georgia is spatially limited and focused in areas of putative migration routes, and the impact is compounded as a result of the fishery also concentrating in those areas at those times. Understanding the seasonal behaviour of orcas and the spatial and temporal distribution of “depredation hot spots” can reduce marine mammal interactions, will improve assessment and management of the stock and contribute to increased operational efficiency of the fishery. Such information is valuable in the effort to resolve the human-mammal conflict for resources

Reliability of Rapid Diagnostic Tests in Diagnosing Pregnancy-Associated Malaria in North-Eastern Tanzania.

Accurate diagnosis and prompt treatment of pregnancy-associated malaria (PAM) are key aspects in averting adverse pregnancy outcomes. Microscopy is the gold standard in malaria diagnosis, but it has limited detection and availability. When used appropriately, rapid diagnostic tests (RDTs) could be an ideal diagnostic complement to microscopy, due to their ease of use and adequate sensitivity in detecting even sub-microscopic infections. Polymerase chain reaction (PCR) is even more sensitive, but it is mainly used for research purposes. The accuracy and reliability of RDTs in diagnosing PAM was evaluated using microscopy and PCR. A cohort of pregnant women in north-eastern Tanzania was followed throughout pregnancy for detection of plasmodial infection using venous and placental blood samples evaluated by histidine rich protein 2 (HRP-2) and parasite lactate dehydrogenase (pLDH) based RDTs (Parascreen™) or HRP-2 only (Paracheck Pf® and ParaHIT®f), microscopy and nested Plasmodium species diagnostic PCR. From a cohort of 924 pregnant women who completed the follow up, complete RDT and microscopy data was available for 5,555 blood samples and of these 442 samples were analysed by PCR. Of the 5,555 blood samples, 49 ((proportion and 95% confidence interval) 0.9% [0.7 -1.1]) samples were positive by microscopy and 91 (1.6% [1.3-2.0]) by RDT. Forty-six (50.5% [40.5 - 60.6]) and 45 (49.5% [39.4 - 59.5]) of the RDT positive samples were positive and negative by microscopy, respectively, whereas nineteen (42.2% [29.0 - 56.7]) of the microscopy negative, but RDT positive, samples were positive by PCR. Three (0.05% [0.02 - 0.2]) samples were positive by microscopy but negative by RDT. 351 of the 5,461 samples negative by both RDT and microscopy were tested by PCR and found negative. There was no statistically significant difference between the performances of the different RDTs. Microscopy underestimated the real burden of malaria during pregnancy and RDTs performed better than microscopy in diagnosing PAM. In areas where intermittent preventive treatment during pregnancy may be abandoned due to low and decreasing malaria risk and instead replaced with active case management, screening with RDT is likely to identify most infections in pregnant women and out-performs microscopy as a diagnostic tool

Quantum Convolutional Coding with Shared Entanglement: General Structure

We present a general theory of entanglement-assisted quantum convolutional coding. The codes have a convolutional or memory structure, they assume that the sender and receiver share noiseless entanglement prior to quantum communication, and they are not restricted to possess the Calderbank-Shor-Steane structure as in previous work. We provide two significant advances for quantum convolutional coding theory. We first show how to "expand" a given set of quantum convolutional generators. This expansion step acts as a preprocessor for a polynomial symplectic Gram-Schmidt orthogonalization procedure that simplifies the commutation relations of the expanded generators to be the same as those of entangled Bell states (ebits) and ancilla qubits. The above two steps produce a set of generators with equivalent error-correcting properties to those of the original generators. We then demonstrate how to perform online encoding and decoding for a stream of information qubits, halves of ebits, and ancilla qubits. The upshot of our theory is that the quantum code designer can engineer quantum convolutional codes with desirable error-correcting properties without having to worry about the commutation relations of these generators.Comment: 23 pages, replaced with final published versio