摘要 :
Optimum nitrogen (N) fertilizer rates and application timing have not been clearly established for papaya plants in north central Florida. Annual N application rates vary from 160 to 500 kg'ha-1 and papaya growers in Florida often...
展开
Optimum nitrogen (N) fertilizer rates and application timing have not been clearly established for papaya plants in north central Florida. Annual N application rates vary from 160 to 500 kg'ha-1 and papaya growers in Florida often band fertilizer within the row before and after planting. ‘Red Lady’ papaya (Carica papaya L.) seedlings were transplanted to the field in Gainesville, Florida. For the N rate study, granular fertilizer was applied to the soil. Nitrogen was applied at 50,100, 200, or 300kg/treated ha per year to determine the N rate for optimum papaya growth and yields. A second set of experiments compared the effects of various application timings on papaya growth and yields. Treatments consisted of all fertilizer (N at 223 kg-ha~(-1))applied prior to planting (preplant); 2/3 preplant and 1/3 applied after planting (post-plant); 1/3 preplant and 2/3 post-plant; and all fertilizer applied post-plant three times per year. Total plant vegetative fresh weights increased linearly from the50 to the 300 kg/treated ha annual N rate in both years and stem diameter also increased linearly with time but independent of treatment. Total fruit yield per plant, fruit weight, and fruit number increased, reaching a maximum level at the 223 kg/treated ha rate. In the fertilizer application timing study, there were no significant treatment effects on growth of any plant part except root fresh weight. Root fresh weight was lowest when fertilizer was applied entirely pre-plant in 2005. Application timing generally had no effect on growth, yields, or petiole N content.
收起
摘要 :
This short paper describes the Web-based questionnaire that was made available for users of the PAW (Physics Analysis Workstation) program. Over three hundred replies to the questionnaire have been received, and they are summarise...
展开
This short paper describes the Web-based questionnaire that was made available for users of the PAW (Physics Analysis Workstation) program. Over three hundred replies to the questionnaire have been received, and they are summarised with the help of data from PAW session monitoring. Following this, some requirements for a second generation tool that would replace PAW are proposed.
收起
摘要 :
This short paper describes the Web-based questionnaire that was made available for users of the PAW (Physics Analysis Workstation) program. Over three hundred replies to the questionnaire have been received, and they are summarise...
展开
This short paper describes the Web-based questionnaire that was made available for users of the PAW (Physics Analysis Workstation) program. Over three hundred replies to the questionnaire have been received, and they are summarised with the help of data from PAW session monitoring. Following this, some requirements for a second generation tool that would replace PAW are proposed.
收起
摘要 :
For a graph property Π, Subgraph Complementation to Π is the problem to find whether there is a subset S of vertices of the input graph G such that modifying G by complementing the subgraph induced by S results in a graph satisf...
展开
For a graph property Π, Subgraph Complementation to Π is the problem to find whether there is a subset S of vertices of the input graph G such that modifying G by complementing the subgraph induced by S results in a graph satisfying the property Π. We prove that the problem of Subgraph Complementation to T-free graphs is NP-Complete, for T being a tree, except for 41 trees of at most 13 vertices (a graph is T-free if it does not contain any induced copies of T). This result, along with the 4 known polynomial-time solvable cases (when T is a path on at most 4 vertices), leaves behind 37 open cases. Further, we prove that these hard problems do not admit any subexponential-time algorithms, assuming the Exponential Time Hypothesis. As an additional result, we obtain that Subgraph Complementation to paw-free graphs can be solved in polynomial-time.
收起
摘要 :
This paper describes a simple approach to generate an efficient hybrid word/Part-of-Arabic-Word (PAW) Language Model (LM). More precisely, less frequent words in a full word vocabulary are decomposed into PAWs. The resulted PAWs a...
展开
This paper describes a simple approach to generate an efficient hybrid word/Part-of-Arabic-Word (PAW) Language Model (LM). More precisely, less frequent words in a full word vocabulary are decomposed into PAWs. The resulted PAWs are incorporated with the most frequent words to generate a hybrid word-PAW vocabulary which is used to estimate a hybrid flat n-gram statistical language model. For comparison purposes, language models with full PAW decomposition of the word vocabulary are generated. To assess the quality of the three types of LMs (i.e. full word, hybrid word/PAW and full PAW LMs), evaluation experiments are conducted under three different tasks using two benchmarking databases, namely Maurdor and Khatt. Results in terms of word error rate show that systems using the full PAW and the proposed hybrid LMs perform equally the same, and both of them, systematically, outperform systems using word LMs. However, systems using hybrid LMs require less memory than those using full PAW LMs.
收起
摘要 :
A three-dimensional mathematical model has been established to research the relation between the plasma reflection and status of keyhole during the keyhole PAW processing. It has been found that the strength of the plasma reflecti...
展开
A three-dimensional mathematical model has been established to research the relation between the plasma reflection and status of keyhole during the keyhole PAW processing. It has been found that the strength of the plasma reflection is related to the keyhole dimension. Another condition to make the plasma refection appearance is that the keyhole or concave in the pool must be unsymmetrical about the axis of the plasma arc. The mechanism of detecting circuit designed based on the fact that the plasma refection is able to indicate the status of keyhole is mathematically studied. The result shows that the voltage signal in the detecting circuit can be used to indicate the status of keyhole.
收起
摘要 :
A three-dimensional mathematical model has been established to research the relation between the plasma reflection and status of keyhole during the keyhole PAW processing. It has been found that the strength of the plasma reflecti...
展开
A three-dimensional mathematical model has been established to research the relation between the plasma reflection and status of keyhole during the keyhole PAW processing. It has been found that the strength of the plasma reflection is related to the keyhole dimension. Another condition to make the plasma refection appearance is that the keyhole or concave in the pool must be unsymmetrical about the axis of the plasma arc. The mechanism of detecting circuit designed based on the fact that the plasma refection is able to indicate the status of keyhole is mathematically studied. The result shows that the voltage signal in the detecting circuit can be used to indicate the status of keyhole.
收起
摘要 :
Many authors have suggested that behavioural lateralisation increases neural capacity to carry out simultaneous processing (Vallortigara and Rogers, 2005). The aim of this study is to investigate the relationship between strength ...
展开
Many authors have suggested that behavioural lateralisation increases neural capacity to carry out simultaneous processing (Vallortigara and Rogers, 2005). The aim of this study is to investigate the relationship between strength of paw preference andproblem-solving ability in domestic cats.
收起
摘要 :
Let H be a fixed graph. Given a graph G and an integer k, the H-free edge modification problem asks whether it is possible to modify at most k edges in G to make it H-free. Sandeep and Sivadasan (IPEC 2015) asks whether the paw-fr...
展开
Let H be a fixed graph. Given a graph G and an integer k, the H-free edge modification problem asks whether it is possible to modify at most k edges in G to make it H-free. Sandeep and Sivadasan (IPEC 2015) asks whether the paw-free completion problem and the paw-free edge deletion problem admit polynomial kernels. We answer both questions affirmatively by presenting, respectively, O(k)-vertex and O(k~4)-vertex kernels for them. This is part of an ongoing program that aims at understanding compressibility of H-free edge modification problems.
收起
摘要 :
Let H be a fixed graph. Given a graph G and an integer k, the H-free edge modification problem asks whether it is possible to modify at most k edges in G to make it H-free. Sandeep and Sivadasan (IPEC 2015) asks whether the paw-fr...
展开
Let H be a fixed graph. Given a graph G and an integer k, the H-free edge modification problem asks whether it is possible to modify at most k edges in G to make it H-free. Sandeep and Sivadasan (IPEC 2015) asks whether the paw-free completion problem and the paw-free edge deletion problem admit polynomial kernels. We answer both questions affirmatively by presenting, respectively, O(k)-vertex and O(k~4)-vertex kernels for them. This is part of an ongoing program that aims at understanding compressibility of H-free edge modification problems.
收起
原文获取