Common vetch (Vicia sativa L) was harvested and allowed to dry in the open air. The composition of fresh forage in non-structural carbohydrates varied markedly between years, the contents of sugars and starch in both leaves and stems being much higher in 1990-91 than 1991-92. Field drying produced a significant decrease in the amounts of these carbohydrates. The total losses of sugars and starch in hay, expressed as losses of dry matter, ranged from 28 to 15 g kg-1, depending on the year. 相似文献
A Packing problem consists in the best arrangement of several objects inside a bounded area named as the container. This arrangement must fulfill with technological constraints, for example, objects should not be overlapping. Some packing models for circular objects are typically formulated as non-convex optimization problems; where the continuous variables are the coordinates of the objects, so they are limited to not finding optimal solutions. Due to the combinatorial nature in the arrangement of such objects, heuristic methods are being used extensively which combine methods of global search and methods of local exhaustive search of local minima or their approximations. In this paper, we will address the packing problem for non-congruent (different size) circles with the binary version of the monkey algorithm which incorporates a cooperation process and a greedy strategy. We use a rectangular grid for covering the container. Every node in the grid represent potential positions for a circle. In this sense, binary monkey algorithm for the knapsack problem, can be used to solve de 0–1 approximate packing problem for non-congruet circles. The binary monkey problem uses two additional processes of the original monkey algorithm, these two processes are a greedy process and a cooperation processes.
The making of BaZrS3 thin films by molecular beam epitaxy (MBE) is demonstrated. BaZrS3 forms in the orthorhombic distorted-perovskite structure with corner-sharing ZrS6 octahedra. The single-step MBE process results in films smooth on the atomic scale, with near-perfect BaZrS3 stoichiometry and an atomically sharp interface with the LaAlO3 substrate. The films grow epitaxially via two competing growth modes: buffered epitaxy, with a self-assembled interface layer that relieves the epitaxial strain, and direct epitaxy, with rotated-cube-on-cube growth that accommodates the large lattice constant mismatch between the oxide and the sulfide perovskites. This work sets the stage for developing chalcogenide perovskites as a family of semiconductor alloys with properties that can be tuned with strain and composition in high-quality epitaxial thin films, as has been long-established for other systems including Si-Ge, III-Vs, and II-VIs. The methods demonstrated here also represent a revival of gas-source chalcogenide MBE. 相似文献
The synthesis of large‐area TiS2 thin films is reported at temperatures as low as 500 °C using a scalable two‐step method of metal film deposition followed by sulfurization in an H2S gas furnace. It is demonstrated that the lowest‐achievable sulfurization temperature depends strongly on the oxygen background during sulfurization. This dependence arises because Ti? O bonds present a substantial kinetic and thermodynamic barrier to TiS2 formation. Lowering the sulfurization temperature is important to make smooth films, and to enable integration of TiS2 and related transition metal dichalcogenides—including metastable phases and alloys—into device technology. 相似文献
We present an algorithmically-aware, high-level partitioning methodology for discrete cosine transforms (DCT) targeted to
distributed hardware architectures. The methodology relies on the exploration of alternate DCT formulations as part of the
partition optimization process. To the best of our knowledge, no previously proposed DCT algorithm exists that is capable
of consistently producing alternate regular formulations for an n-size DCT. Hence, a new Cooley-Tukey-like DCT factorization algorithm was developed to allow exploration of alternate formulations
as part of the partitioning optimization process. The use of our factorization mechanism along with a greedy strategy to explore
the space of equivalent DCT formulations yielded partitioning solutions with as much as 18% reduction in latency and 83% reduction
in run-time as compared to previously proposed regular DCT formulations.