How do different warning signs compare with the guideline daily amount and traffic-light system?

Nutritional warnings are rapidly gaining relevance, particularly in the region of the Americas, as a front-of-package nutrition labelling scheme that facilitate the identification of products with high content of nutrients associated with non-communicable diseases (NCDs). Several graphic designs are being developed as countries discuss the implementation of nutritional warnings, which makes it necessary to develop research to evaluate their efficacy. In this context, the aim of the present work was to compare the efficacy of a series of nutritional warnings that are being considered by Brazilian national authorities for the country with two of the most studied schemes: the guidelines daily amounts (GDA) and the traffic light system. Two studies were conducted. In the first one, visual search was conducted with 62 participants to evaluate the time needed by them to identify the schemes on food labels and to identify whether a product had high nutrient content. In the second study, an online survey with 1932 participants was used to evaluate their ability to use FOP nutrition labelling schemes to correctly identify the most healthful product in a set, as well as high nutrient content in a product. In addition, the influence of FOP nutrition labelling schemes on perceived healthfulness was evaluated. Finally, consumers’ perception of the schemes was gathered using an open-ended question. Results confirmed the advantages of nutritional warnings compared to the GDA and the traffic-light system to facilitate the identification of products with high content of nutrients associated with NCDs. In addition, the use of familiar signs frequently used to convey a ‘warning message’ outperformed other unfamiliar signs in terms of their ability to facilitate the interpretation of nutrition information. Regarding colour, black signs tended to required significantly less time to be detected when included on colour food labels compared to red signs.     

谷氨酰胺(Gln)活性肽营养液的研究进展

对G1n小肽在氨基酸营养液中的使用以及G1n小肽的稳定性和代谢机制进行了论述。G1n是一种“条件必需氨基酸”，但Cln的水溶液不稳定，因而在氨基酸输液或氨基酸营养被中，用G1n小肽代替G1n单体使用。G1n小肽含有取代的α—NH2，使Cln小肽的稳定性大大增加。     

Subsoil <Superscript>15</Superscript>N-N<Subscript>2</Subscript>O Concentrations in a Sandy Soil Profile After Application of <Superscript>15</Superscript>N-fertilizer

Studies on emissions of nitrous oxide (N₂O) from agricultural soils mostly focus on fluxes between the soil and the atmosphere or are limited to the atmosphere in the topsoil. However, in soils with shallow water tables, significant N₂O formation may occur closer to the groundwater. The aims of this study were (i) to determine the importance of subsoil N₂O formation in a sandy soil; and (ii) to obtain a quantitative insight in the contribution of subsoil N₂O to the overall losses of N₂O to the environment. We applied ¹⁵N labeled fertilizer at a rate of 5.22 kg ¹⁵N ha⁻¹; 50% as Ca(NO₃)₂ and 50% as NH₄Cl, on a mesic typic Haplaquod seeded with potatoes (Solanum tuberosum L.), and traced soil N₂O concentrations and fluxes over a one-year period. Throughout the year, total N₂O and the amount of ¹⁵N recovered in soil N₂O were highest in the subsoil, with a maximum concentration at 48 cm depth in mid-February of 19900 μl m⁻³ and 24 μg ¹⁵N m⁻³, respectively. The maximum concentration coincided with the highest water-filled pore space of 71%. The cumulative flux of N₂O was 446 g N₂O-N ha⁻¹, the recovery of ¹⁵N in this flux was 0.06%. During the summer, maximum fluxes followed high soil N₂O concentrations. During winter, no such relation was found. We concluded that the formation of N₂O was the highest in the subsoil, largely controlled by water-filled pore space rather than NO₃⁻ concentration or temperature. Although high subsoil N₂O concentrations did not lead to high surface fluxes of N₂O in the winter, artificial draining may lead to high indirect N₂O emissions through supersaturated drainage water.     

烹饪工艺与营养专业校内经营教学模式的构建与实践——以重庆旅游职业学院为例

烹饪工艺与营养专业的校内经营是通过学院提供校园餐厅,在课堂内完成专业培养方案的教学任务,组织学生进入校园餐厅顶岗实训,形成教学经营一体化校内经营运行模式。文章阐述了校内经营教学模式的基本思路、校内餐厅的要求和管理,总结了校内经营模式运行过程中出现的问题,并针对如何进一步完善校内经营模式提出新思路。     

一种光斑图像的阈值分割和光斑中心坐标的计算方法

工业测量中经常需要从获取的光斑图像中提取光斑区域,计算光斑中心的坐标。针对光斑图像具有背景区域较暗且面积大,目标(光斑)区域较亮且面积小的特点,提出了一种适用于光斑图像的阈值分割方法,计算单个光斑中心坐标的重心法,以及采用连通区域标记和区域大小排序计算多个光斑中心坐标的方法。与其他阈值分割方法比较后的实验结果表明,所提出的方法可更好地分割光斑图像,与期望的人工选取的阈值最接近,计算得到的光斑中心坐标准确,且运行时间较短。     

A NEW BATO COMPLEX^99mTcCl（4—MCDO）3MeB FOR MYOCARDIAL IMAGING

A new nertral complex,^99mTcCl(4-MCDO)3MEB,((Bis[4-methyl-1,2-cyclohex-anedionedioximato(1-)-O]-[4-methyl-1,2-cyclohexanedione-dioximato(2-)-O] methyl-borato(2-)-N,N‘,N″,N‘‘‘,N‘‘‘‘0-chlorotechnetium,generally called BATO(Boronic acid adducts of technitium dioximes),has been synthesized and evaluated for potential use in myocardial perfusion imaging,It has intrinsic affinity for the blood clearance.The uptake of heart.lung and blood in mice at 2min separately are 1.12,2.48 and 6.66%ID.The complex formation is rapid,simple and highly yielded(≥93%).This process is easy to kit formation.     

Effect of particle size on quality of crab meatballs using enzymatically deproteinized crab by-products

The production of crab meatballs generates large amount of crab shell waste, it is therefore necessary to develop a green, economical and environmentally friendly process to vaporize the waste. This study was aimed at investigating the applicability of microwave heating combined with ultrasonic field-assisted alkaline protease (MUSED) (50 ℃, pH = 9.0, 14025.67 U/g, 4.21 h and liquid/material = 14.41:1) for pretreatment of ball-milled crab shells. The ball milling efficiency of the crab shell powder pretreated by MUSED was observed to increase by 50 % compared to the control group, with the final average particle size of D₄ = 4.88 ± 0.20 um. High calcium solubility and low energy consumption of the ball-milled powder increased dietary calcium bioavailability and reduced the potential for high calorie intake. The addition of 6 % (w/w) crab shell powder treated by MUSED improved the texture of the crab meatballs (CM-D₄) and gave the product enhanced crab flavor relative to the control group. Moreover, the lower cooking loss of CM-D₄ resulted in significant retention of nutrients (p < 0.05). The crab shell powder treated by MUSED method was more efficient in ball milling, which improved the quality of crab meatballs while relieving environmental pressure.     

Building a database for product design knowledge retrieval—A case study in robotic design database

In product design process, when dealing with technical problems or initiating a new design, R&D personnel would often turn to technical database to seek inspiration. The building of a database with such documents has not been systematically dealt with. In this paper, several issues on how to build up a product design database are investigated: input source, sampling scheme and quality control. A case study of building a database for robotic design is used to demonstrate the concept. It is an archive of more than 1500 relevant technical papers. A total of 16 graduates are employed as operators in the labeling process and subsequently the hypothesis tests are utilized to process the labeling results. To ensure this database quality, the labeling consistency of each operator and the understanding of each category are tested. With the use of statistical methods, this work proposes a feasible and practical way to create such a database for product design.     

Labeling Schemes for Tree Representation

This paper deals with compact label-based representations for trees. Consider an n-node undirected connected graph G with a predefined numbering on the ports of each node. The all-ports tree labeling ℒ _all gives each node v of G a label containing the port numbers of all the tree edges incident to v. The upward tree labeling ℒ _up labels each node v by the number of the port leading from v to its parent in the tree. Our measure of interest is the worst case and total length of the labels used by the scheme, denoted M _up (T) and S _up (T) for ℒ _up and M _all (T) and S _all (T) for ℒ _all . The problem studied in this paper is the following: Given a graph G and a predefined port labeling for it, with the ports of each node v numbered by 0,…,deg (v)−1, select a rooted spanning tree for G minimizing (one of) these measures. We show that the problem is polynomial for M _up (T), S _up (T) and S _all (T) but NP-hard for M _all (T) (even for 3-regular planar graphs). We show that for every graph G and port labeling there exists a spanning tree T for which S _up (T)=O(nlog log n). We give a tight bound of O(n) in the cases of complete graphs with arbitrary labeling and arbitrary graphs with symmetric port labeling. We conclude by discussing some applications for our tree representation schemes. A preliminary version of this paper has appeared in the proceedings of the 7th International Workshop on Distributed Computing (IWDC), Kharagpur, India, December 27–30, 2005, as part of Cohen, R. et al.: Labeling schemes for tree representation. In: Proceedings of 7th International Workshop on Distributed Computing (IWDC), Lecture Notes of Computer Science, vol. 3741, pp. 13–24 (2005). R. Cohen supported by the Pacific Theaters Foundation. P. Fraigniaud and D. Ilcinkas supported by the project “PairAPair” of the ACI Masses de Données, the project “Fragile” of the ACI Sécurité et Informatique, and by the project “Grand Large” of INRIA. A. Korman supported in part by an Aly Kaufman fellowship. D. Peleg supported in part by a grant from the Israel Science Foundation.     

General compact labeling schemes for dynamic trees

Let F be a function on pairs of vertices. An F-labeling scheme is composed of a marker algorithm for labeling the vertices of a graph with short labels, coupled with a decoder algorithm allowing one to compute F(u, v) for any two vertices u and v directly from their labels. As applications for labeling schemes concern mainly large and dynamically changing networks, it is of interest to study distributed dynamic labeling schemes. This paper investigates labeling schemes for dynamic trees. We consider two dynamic tree models, namely, the leaf-dynamic tree model in which at each step a leaf can be added to or removed from the tree and the leaf-increasing tree model in which the only topological event that may occur is that a leaf joins the tree. A general method for constructing labeling schemes for dynamic trees (under the above mentioned dynamic tree models) was previously developed in Korman et al. (Theory Comput Syst 37:49–75, 2004). This method is based on extending an existing static tree labeling scheme to the dynamic setting. This approach fits many natural functions on trees, such as distance, separation level, ancestry relation, routing (in both the adversary and the designer port models), nearest common ancestor etc.. Their resulting dynamic schemes incur overheads (over the static scheme) on the label size and on the communication complexity. In particular, all their schemes yield a multiplicative overhead factor of Ω(log n) on the label sizes of the static schemes. Following (Korman et al., Theory Comput Syst 37:49–75, 2004), we develop a different general method for extending static labeling schemes to the dynamic tree settings. Our method fits the same class of tree functions. In contrast to the above paper, our trade-off is designed to minimize the label size, sometimes at the expense of communication. Informally, for any function k(n) and any static F-labeling scheme on trees, we present an F-labeling scheme on dynamic trees incurring multiplicative overhead factors (over the static scheme) of on the label size and on the amortized message complexity. In particular, by setting for any , we obtain dynamic labeling schemes with asymptotically optimal label sizes and sublinear amortized message complexity for the ancestry relation, the id-based and label-based nearest common ancestor relation and the routing function. Supported in part at the Technion by an Aly Kaufman fellowship.