WordNet

wanting to eat or drink more than one can reasonably consume; "dont be greedy with the cookies"
marked by active interest and enthusiasm; "an avid sports fan" (同)zealous
(often followed by `for' (同)devouring, esurient, greedy
in an avid manner; "whatever the flavor or color of your local paper, do remember that these are read avidly for local information"
excessively gluttonous (同)too-greedy
excessive desire to acquire or possess more (especially more material wealth) than one needs or deserves

PrepTutorEJDIC

『どん欲な』,欲張りの / 『食い意地の張った』,がつがつした
どん欲な
大食漢
(…に対する)どん欲,強欲《+『for』+『名』》

Wikipedia preview

出典(authority):フリー百科事典『ウィキペディア（Wikipedia）』「2016/10/15 18:38:41」(JST)

wiki en

[Wiki en表示]

English Journal

Automating human intuition for protein design.

Nivón LG1, Bjelic S, King C, Baker D.Author information 1Department of Biochemistry, University of Washington, Seattle, Washington, 98195.AbstractIn the design of new enzymes and binding proteins, human intuition is often used to modify computationally designed amino acid sequences prior to experimental characterization. The manual sequence changes involve both reversions of amino acid mutations back to the identity present in the parent scaffold and the introduction of residues making additional interactions with the binding partner or backing up first shell interactions. Automation of this manual sequence refinement process would allow more systematic evaluation and considerably reduce the amount of human designer effort involved. Here we introduce a benchmark for evaluating the ability of automated methods to recapitulate the sequence changes made to computer-generated models by human designers, and use it to assess alternative computational methods. We find the best performance for a greedy one-position-at-a-time optimization protocol that utilizes metrics (such as shape complementarity) and local refinement methods too computationally expensive for global Monte Carlo (MC) sequence optimization. This protocol should be broadly useful for improving the stability and function of designed binding proteins. Proteins 2014; 82:858-866. © 2013 Wiley Periodicals, Inc.
Proteins.Proteins.2014 May;82(5):858-66. doi: 10.1002/prot.24463. Epub 2013 Nov 22.
In the design of new enzymes and binding proteins, human intuition is often used to modify computationally designed amino acid sequences prior to experimental characterization. The manual sequence changes involve both reversions of amino acid mutations back to the identity present in the parent scaf
PMID 24265170

Directed Acyclic Graph-Based Technology Mapping of Genetic Circuit Models.

Roehner N1, Myers CJ.Author information 1Department of Bioengineering, University of Utah , Salt Lake City 84112, United States.AbstractAs engineering foundations such as standards and abstraction begin to mature within synthetic biology, it is vital that genetic design automation (GDA) tools be developed to enable synthetic biologists to automatically select standardized DNA components from a library to meet the behavioral specification for a genetic circuit. To this end, we have developed a genetic technology mapping algorithm that builds on the directed acyclic graph (DAG) based mapping techniques originally used to select parts for digital electronic circuit designs and implemented it in our GDA tool, iBioSim. It is among the first genetic technology mapping algorithms to adapt techniques from electronic circuit design, in particular the use of a cost function to guide the search for an optimal solution, and perhaps that which makes the greatest use of standards for describing genetic function and structure to represent design specifications and component libraries. This paper demonstrates the use of our algorithm to map the specifications for three different genetic circuits against four randomly generated libraries of increasing size to evaluate its performance against both exhaustive search and greedy variants for finding optimal and near-optimal solutions.
ACS synthetic biology.ACS Synth Biol.2014 Apr 1. [Epub ahead of print]
As engineering foundations such as standards and abstraction begin to mature within synthetic biology, it is vital that genetic design automation (GDA) tools be developed to enable synthetic biologists to automatically select standardized DNA components from a library to meet the behavioral specific
PMID 24650240

Policy oscillation is overshooting.

Wagner P.Author information Department of Information and Computer Science, Aalto University, FI-00076 Aalto, Finland. Electronic address: paul.wagner@aalto.fi.AbstractA majority of approximate dynamic programming approaches to the reinforcement learning problem can be categorized into greedy value function methods and value-based policy gradient methods. The former approach, although fast, is well known to be susceptible to the policy oscillation phenomenon. We take a fresh view to this phenomenon by casting, within the context of non-optimistic policy iteration, a considerable subset of the former approach as a limiting special case of the latter. We explain the phenomenon in terms of this view and illustrate the underlying mechanism with artificial examples. We also use it to derive the constrained natural actor-critic algorithm that can interpolate between the aforementioned approaches. In addition, it has been suggested in the literature that the oscillation phenomenon might be subtly connected to the grossly suboptimal performance in the Tetris benchmark problem of all attempted approximate dynamic programming methods. Based on empirical findings, we offer a hypothesis that might explain the inferior performance levels and the associated policy degradation phenomenon, and which would partially support the suggested connection. Finally, we report scores in the Tetris problem that improve on existing dynamic programming based results by an order of magnitude.
Neural networks : the official journal of the International Neural Network Society.Neural Netw.2014 Apr;52:43-61. doi: 10.1016/j.neunet.2014.01.002. Epub 2014 Jan 21.
A majority of approximate dynamic programming approaches to the reinforcement learning problem can be categorized into greedy value function methods and value-based policy gradient methods. The former approach, although fast, is well known to be susceptible to the policy oscillation phenomenon. We t
PMID 24491826

Experimental investigations on airborne gravimetry based on compressed sensing.

Yang Y1, Wu M2, Wang J3, Zhang K4, Cao J5, Cai S6.Author information 1Department of Automatic Control, College of Mechatronics and Automation, National University of Defense Technology, Deya Street 109, Changsha 410073, China. yang830419@126.com.2Department of Automatic Control, College of Mechatronics and Automation, National University of Defense Technology, Deya Street 109, Changsha 410073, China. meipingwu@263.net.3School of Civil and Environmental Engineering, University of New South Wales, Sydney, NSW 2052, Australia. Jinling.Wang@unsw.edu.au.4Department of Automatic Control, College of Mechatronics and Automation, National University of Defense Technology, Deya Street 109, Changsha 410073, China. kdzhang@263.net.5Department of Automatic Control, College of Mechatronics and Automation, National University of Defense Technology, Deya Street 109, Changsha 410073, China. cjl.nudt@gmail.com.6Department of Automatic Control, College of Mechatronics and Automation, National University of Defense Technology, Deya Street 109, Changsha 410073, China. csk527@163.com.AbstractGravity surveys are an important research topic in geophysics and geodynamics. This paper investigates a method for high accuracy large scale gravity anomaly data reconstruction. Based on the airborne gravimetry technology, a flight test was carried out in China with the strap-down airborne gravimeter (SGA-WZ) developed by the Laboratory of Inertial Technology of the National University of Defense Technology. Taking into account the sparsity of airborne gravimetry by the discrete Fourier transform (DFT), this paper proposes a method for gravity anomaly data reconstruction using the theory of compressed sensing (CS). The gravity anomaly data reconstruction is an ill-posed inverse problem, which can be transformed into a sparse optimization problem. This paper uses the zero-norm as the objective function and presents a greedy algorithm called Orthogonal Matching Pursuit (OMP) to solve the corresponding minimization problem. The test results have revealed that the compressed sampling rate is approximately 14%, the standard deviation of the reconstruction error by OMP is 0.03 mGal and the signal-to-noise ratio (SNR) is 56.48 dB. In contrast, the standard deviation of the reconstruction error by the existing nearest-interpolation method (NIPM) is 0.15 mGal and the SNR is 42.29 dB. These results have shown that the OMP algorithm can reconstruct the gravity anomaly data with higher accuracy and fewer measurements.
Sensors (Basel, Switzerland).Sensors (Basel).2014 Mar 18;14(3):5426-40. doi: 10.3390/s140305426.
Gravity surveys are an important research topic in geophysics and geodynamics. This paper investigates a method for high accuracy large scale gravity anomaly data reconstruction. Based on the airborne gravimetry technology, a flight test was carried out in China with the strap-down airborne gravimet
PMID 24647125