Approaches to the chemical synthesis of food

Conversion of human wastes, carbon dioxide water, and urea into food for space ration

Impact of Technology and Innovation Advisory Services

This report identifies and reviews literature that evaluates the impacts of technology and innovation advisory services. These services provide information, technical assistance, consulting, mentoring, and other services to support enterprises in adopting and deploying new technologies and in commercialising innovations. Examples include the: Manufacturing Advisory Service (UK), the Manufacturing Extension Partnership (USA), and the Industrial Research Assistance Program (Canada). Technology and innovation advisory services are also provided by technology centres and other business assistance programmes. Such services are typically targeted at small and medium-sized enterprises. A defining capability of technology and innovation advisory services is the offer of expert one-on-one guidance to individual companies through extension staff, field offices, or dispersed technology centres. The available studies generally find that technology and innovation advisory services provide positive benefits for participating firms. The types of benefits achieved include reductions in costs, improved quality, reduced waste and improved environmental performance, higher productivity, and new product development and innovation. Net benefits achieved are typically relatively modest, although commensurate with the relatively small amounts of public funding usually invested in technology and innovation advisory services. More intense and customised services can improve results. Applying best practices in the operation and delivery of technology and innovation services, including attention to outreach, staff capability, long-term engagement, flexibility, organisational stability, and linkage with other services, increases the likelihood of programme effectiveness and impact

Online Pattern Matching for String Edit Distance with Moves

Edit distance with moves (EDM) is a string-to-string distance measure that includes substring moves in addition to ordinal editing operations to turn one string to the other. Although optimizing EDM is intractable, it has many applications especially in error detections. Edit sensitive parsing (ESP) is an efficient parsing algorithm that guarantees an upper bound of parsing discrepancies between different appearances of the same substrings in a string. ESP can be used for computing an approximate EDM as the L1 distance between characteristic vectors built by node labels in parsing trees. However, ESP is not applicable to a streaming text data where a whole text is unknown in advance. We present an online ESP (OESP) that enables an online pattern matching for EDM. OESP builds a parse tree for a streaming text and computes the L1 distance between characteristic vectors in an online manner. For the space-efficient computation of EDM, OESP directly encodes the parse tree into a succinct representation by leveraging the idea behind recent results of a dynamic succinct tree. We experimentally test OESP on the ability to compute EDM in an online manner on benchmark datasets, and we show OESP's efficiency.Comment: This paper has been accepted to the 21st edition of the International Symposium on String Processing and Information Retrieval (SPIRE2014

Return to Sport and Athletic Function in an Active Population After Primary Arthroscopic Labral Reconstruction of the Hip

Background: Labral reconstruction has been advocated as an alternative to debridement for the treatment of irreparable labral tears, showing favorable short-term results. However, literature is scarce regarding outcomes and return to sport in the nonelite athletic population. Purpose: To report minimum 1-year clinical outcomes and the rate of return to sport in athletic patients who underwent primary hip arthroscopy with labral reconstruction in the setting of femoroacetabular impingement syndrome and irreparable labral tears. Study Design: Case series; Level of evidence, 4. Methods: Data were prospectively collected and retrospectively analyzed for patients who underwent an arthroscopic labral reconstruction between August 2012 and December 2017. Patients were included if they identified as an athlete (high school, college, recreational, or amateur); had follow-up on the following patient-reported outcomes (PROs): modified Harris Hip Score (mHHS), Nonarthritic Hip Score (NAHS), Hip Outcome Score–Sport Specific Subscale (HOS-SSS), and visual analog scale (VAS); and completed a return-to-sport survey at 1 year postoperatively. Patients were excluded if they underwent any previous ipsilateral hip surgery, had dysplasia, or had prior hip conditions. The proportions of patients who achieved the minimal clinically important difference (MCID) and patient acceptable symptomatic state (PASS) for mHHS and HOS-SSS were calculated. Statistical significance was set at P =.05. Results: There were 32 (14 females) athletes who underwent primary arthroscopic labral reconstruction during the study period. The mean age and body mass index of the group were 40.3 years (range, 15.5-58.7 years) and 27.9 kg/m2 (range, 19.6-40.1 kg/m2), respectively. The mean follow-up was 26.4 months (range, 12-64.2 months). All patients demonstrated significant improvement in mHHS, NAHS, HOS-SSS, and VAS (P \u3c.001) at latest follow-up. Additionally, 84.4% achieved MCID and 81.3% achieved PASS for mHHS, and 87.5% achieved MCID and 75% achieved PASS for HOS-SSS. VAS pain scores decreased from 4.4 to 1.8, and the satisfaction with surgery was 7.9 out of 10. The rate of return to sport was 78%. Conclusion: At minimum 1-year follow-up, primary arthroscopic labral reconstruction, in the setting of femoroacetabular impingement syndrome and irreparable labral tears, was associated with significant improvement in PROs in athletic populations. Return to sport within 1 year of surgery was 78%

A Minimum-Labeling Approach for Reconstructing Protein Networks across Multiple Conditions

The sheer amounts of biological data that are generated in recent years have driven the development of network analysis tools to facilitate the interpretation and representation of these data. A fundamental challenge in this domain is the reconstruction of a protein-protein subnetwork that underlies a process of interest from a genome-wide screen of associated genes. Despite intense work in this area, current algorithmic approaches are largely limited to analyzing a single screen and are, thus, unable to account for information on condition-specific genes, or reveal the dynamics (over time or condition) of the process in question. Here we propose a novel formulation for network reconstruction from multiple-condition data and devise an efficient integer program solution for it. We apply our algorithm to analyze the response to influenza infection in humans over time as well as to analyze a pair of ER export related screens in humans. By comparing to an extant, single-condition tool we demonstrate the power of our new approach in integrating data from multiple conditions in a compact and coherent manner, capturing the dynamics of the underlying processes.Comment: Peer-reviewed and presented as part of the 13th Workshop on Algorithms in Bioinformatics (WABI2013

Noise effect on Grover algorithm

The decoherence effect on Grover algorithm has been studied numerically through a noise modelled by a depolarizing channel. Two types of error are introduced characterizing the qubit time evolution and gate application, so the noise is directly related to the quantum network construction. The numerical simulation concludes an exponential damping law for the successive probability of the maxima as time increases. We have obtained an allowed-error law for the algorithm: the error threshold for the allowed noise behaves as Eth(N) ~ 1/N1.1 (N being the size of the data set). As the power of N is almost one, we consider the Grover algorithm as robust to a certain extent against decoherence. This law also provides an absolute threshold: if the free evolution error is greater than 0.043, Grover algorithm does not work for any number of qubits affected by the present error model. The improvement in the probability of success, in the case of two qubits has been illustrated by using a fault-tolerant encoding of the initial state by means of the [[7,1,3]] quantum code.Comment: Accepted to be published in Eur. Phys. J. D (2008

Magnetization steps in a diluted Heisenberg antiferromagnetic chain: Theory and experiments on TMMC:Cd

A theory for the equilibrium low-temperature magnetization M of a diluted Heisenberg antiferromagnetic chain is presented. The magnetization curve, M versus B, is calculated using the exact contributions of finite chains with 1 to 5 spins, and the "rise and ramp approximation" for longer chains. Some non-equilibrium effects that occur in a rapidly changing B, are also considered. Specific non-equilibrium models based on earlier treatments of the phonon bottleneck, and of spin flips associated with cross relaxation and with level crossings, are discussed. Magnetization data on powders of TMMC diluted with cadmium [i.e., (CH_3)_4NMn_xCd_(1-x)Cl_3, with 0.16<=x<=0.50 were measured at 0.55 K in 18 T superconducting magnets. The field B_1 at the first MST from pairs is used to determine the NN exchange constant, J, which changes from -5.9 K to -6.5 K as x increases from 0.16 to 0.50. The magnetization curves obtained in the superconducting magnets are compared with simulations based on the equilibrium theory. Data for the differential susceptibility, dM/dB, were taken in pulsed magnetic fields (7.4 ms duration) up to 50 T, with the powder samples in a 1.5 K liquid-helium bath. Non-equilibrium effects, which became more severe as x decreased, were observed. The non-equilibrium effects are tentatively interpreted using the "Inadequate Heat Flow Scenario," or to cross-relaxation, and crossings of energy levels, including those of excited states.Comment: 16 pages, 14 figure