荞麦中苯丙氨酸解氨酶活力与黄酮含量的关系

荞麦幼苗及幼苗不同器官中黄酮含量随着苯丙氨酸解氨酶（PAL）活力变化而变化。X射线处理可增强荞麦幼苗中苯丙烷类代谢途径,致使黄酮含量提高。由此推测,苯丙氨酸解氨酶活力与黄酮类次生物质的形成具有密切关系。     

一类四阶非线性常微分方程的两点边值问题解的存在性与唯一性

本文利用Hammerstein型积分算子和上下解方法,研究了一类四阶非线性常微分方程的两点边值问题     

宽带卫星通信和星际链路间激光通信的应用前景

提出了由于信息化社会、Ｉｎｔｅｒｎｅｔ、Ｉｎｔｒａｎｅｔ和多媒体技术的出现,从而要求卫星通信向多体制、多功能发展。文中着重分析了具有独特优点的激光通信在宽带卫星通信和星际链路中的现实商用前景。     

半导体激光器的光学准直

对半导体激光器进行光学准直是空间光通信系统必须进行的重要工作。文中简述了准直通常使用的方法,测试了使用单透镜对一种３５ｍＷ半导体激光器的准直结果,准直效率约为６０％,准直后的发射角为０４～０７５ｍｒａｄ。     

中国西部开发与美国西部开发的对比研究

通过对美国西部开发和中国西部开发的对比及借鉴美国西部的经济开发策略,对中国西部的经济发展提出了采取“梯度转移”与有条件的“增长极核发展”相结合的经济发展战略模式的建议。     

Going to Pieces: Paul Monette and the Fragments of the Tribe

Author of the highly acclaimed Borrowed Time: An AIDS Memoir (1988) and winner of the 1992 National Book Award for his autobiography Becoming a Man: Half a Life Story, Paul Monette died of complications from AIDS in Los Angeles on February 12, 1995. His most recent work, Last Watch of the Night: Essays Too Personal and Otherwise (1994), is his third volume in a trilogy of autobiographical writing on growing up gay, coming-out, and living with AIDS. A graduate of Phillips Academy and Yale University, Monette received a number of awards for his writing and his work as an outspoken voice in the battle against AIDS, including the National Book Award, three Lambda Literary awards, the PEN Center West Freedom to Write Award, and three honorary doctorate degrees, from Wesleyan University, the City University of New York, and the State University of New York at Oswego. A memorial service was held for Monette on Sunday, February 19, 1995, at the Directors Guild of America on Sunset Boulevard in Los Angeles. Paul Monette was 49.     

分销商的客户价值评价及其应用研究

分销商通常被认为是企业的中间客户,本文运用客户价值理论对分销商的价值贡献进行了分析,建立了分销商的货币价值测度模型和非货币价值测度模型,并以云南白药公司对其主分销商重庆医药的评价为例,说明了模型的应用方法并验证了模型的实用性.     

Sensitivity of the Optimum to Perturbations of the Profit or Weight of an Item in the Binary Knapsack Problem

In the binary single constraint Knapsack Problem, denoted KP, we are given a knapsack of fixed capacity c and a set of n items. Each item j, j = 1,...,n, has an associated size or weight w_j and a profit p_j. The goal is to determine whether or not item j, j = 1,...,n, should be included in the knapsack. The objective is to maximize the total profit without exceeding the capacity c of the knapsack. In this paper, we study the sensitivity of the optimum of the KP to perturbations of either the profit or the weight of an item. We give approximate and exact interval limits for both cases (profit and weight) and propose several polynomial time algorithms able to reach these interval limits. The performance of the proposed algorithms are evaluated on a large number of problem instances.     

Buchbesprechungen

Ohne Zusammenfassung