Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing

We show how to compute the smallest rectangle that can enclose any polygon, from a given set of polygons, in nearly linear time; we also present a PTAS for the problem, as well as a linear-time algorithm for the case when the polygons are rectangles themselves. We prove that finding a smallest convex polygon that encloses any of the given polygons is NP-hard, and give a PTAS for minimizing the perimeter of the convex enclosure. We also give efficient algorithms to find the smallest rectangle simultaneously enclosing a given pair of convex polygons.     

Capturing crossings: Convex hulls of segment and plane intersections

We give a simple O(nlogn) algorithm to compute the convex hull of the (possibly Θ(n²)) intersection points in an arrangement of n line segments in the plane. We also show an arrangement of dn hyperplanes in d-dimensions whose arrangement has Θ(nd−1) intersection points on the convex hull.     

维吾尔新文字大小写同形字母的识别

为有效识别出新维文中大小写同形字母,分析新维文的特点,提出一种基于模板匹配的大小写同形字母识别算法。根据同形字母中大写字母外轮廓大而小写字母外轮廓小的特点,统计字母外轮廓大小与全文字母外轮廓平均大小的比例值,进行字母的大小写判断。分析结果表明,该方法有效克服了传统模板匹配方法容易混淆同形字母的大小写的缺点,提高了系统的识别率。     

激光功率密度对自生磁场和电子热传导的影响

为了理解超强激光与等离子体相互作用中产生的自生磁场形成机制和电子热传导特性,采用相对论电磁粒子模拟程序,估算了不同激光功率密度下,在等离子体表面所形成的电磁不稳定性产生的自生磁场大小和空间分布,得到了超热电子和经典Spitzer-Harm理论描述的电子热流随激光功率密度的演化情形.结果表明,非Maxwell速度分布的等离子体,由于电子初始时刻的无规则热运动,在等离子体上激发电磁不稳定性,而不稳定性激发的强电磁场使电子束在非常短的距离内沉积能量,同时对在激光有质动力推开电子时形成的超热电子能量输运产生抑制作用.这一研究结果对更好理解惯性约束核聚变快点火过程中自生磁场的产生、电子热传导等方面有帮助的.     

Stochastic kinetic analysis of developmental pathway bifurcation in phage lambda-infected Escherichia coli cells

Fluctuations in rates of gene expression can produce highly erratic time patterns of protein production in individual cells and wide diversity in instantaneous protein concentrations across cell populations. When two independently produced regulatory proteins acting at low cellular concentrations competitively control a switch point in a pathway, stochastic variations in their concentrations can produce probabilistic pathway selection, so that an initially homogeneous cell population partitions into distinct phenotypic subpopulations. Many pathogenic organisms, for example, use this mechanism to randomly switch surface features to evade host responses. This coupling between molecular-level fluctuations and macroscopic phenotype selection is analyzed using the phage lambda lysis-lysogeny decision circuit as a model system. The fraction of infected cells selecting the lysogenic pathway at different phage:cell ratios, predicted using a molecular-level stochastic kinetic model of the genetic regulatory circuit, is consistent with experimental observations. The kinetic model of the decision circuit uses the stochastic formulation of chemical kinetics, stochastic mechanisms of gene expression, and a statistical-thermodynamic model of promoter regulation. Conventional deterministic kinetics cannot be used to predict statistics of regulatory systems that produce probabilistic outcomes. Rather, a stochastic kinetic analysis must be used to predict statistics of regulatory outcomes for such stochastically regulated systems.     

Mn~(2+)-H_2O_2-PAR分光光度法测定羟自由基及抗坏血酸抗氧化活性的比较

提出Mn~(2+)-H_2O_2-PAR[4-(2-吡啶偶氮)-间苯二酚]新体系并用于羟自由基的检测。pH 10的硼砂-氢氧化钠缓冲溶液中Mn~(2+)-H_2O_2体系产生羟自由基,加入偶氮染料PAR,羟自由基迅速氧化PAR-Mn~(2+)螯合物分解退色,测定500nm处吸光度的变化确定羟自由基产生的量。利用所建立的实验方法对抗坏血酸清除羟自由基的能力进行测定,其结果与DPPH·(二苯代苦味肼基自由基)分光光度法和羟自由基测定试剂盒法相比。结果表明:该方法稳定性好,操作简便,测定快速,重现性稳定,相对标准偏差为1.42%,可作为一种简便的筛选抗氧化剂的方法。3种方法中抗坏血酸的IC_(50)分别为0.013、0.005、0.2 mg/mL。     

反相高效液相色谱法同时测定果蔬中6种防腐杀菌剂

建立果蔬中6种防腐杀菌剂(噻苯咪唑、邻苯基苯酚、多菌灵、联苯胺、抑霉唑、联苯)同时测定的反相高效液相色谱法.样品用v(水):v(乙醇)=50:50超声萃取,过固相萃取小柱分离,浓缩定容,经ZORBAX Extend XDB-C18柱分离,以甲醇-水(pH8.0)为流动相,采用紫外检测器检测.6种防腐杀菌剂分离良好并排除了样品中杂质峰的干扰,加标平均回收率为95.7%～103.5%之间,相对标准偏差为0.24%～1.5%.检出限0.002～0.1 mg/L.该方法可同时简便、准确地测定果蔬中的6种防腐杀菌剂.     

Constructing desirable identities—Self-presentation in psychotherapy and daily life: Comment on Kelly (2000).

A. E. Kelly's (see record 2000-08364-001) thesis that psychotherapy clients benefit from withholding negative information is considered in flight of current social-psychological theory and research. Positive illusions about oneself are associated with indexes of mental health; this is consistent with treating therapy as positive identity development. Self-presentation can shape self-concept, even apart from the feedback that an audience might provide; the social construction of identity is a powerful process, suggesting that withholding negative and presenting only positive information is adaptive. However, evidence concerning the level of identification of one's actions suggests complexities in understanding ways clients might deal with disclosing negative information; the authors argue that the impact on self-concept is probably more complex than A. E. Kelly's characterization and that the implications are of a broader scope than indicated so far. (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Evaluating intelligent buildings according to level of service systems integration

The intelligent building is supposed to provide the environment and means for an optimal utilization of the building, according to its designation. This extended function of a building can be achieved only by means of an extensive use of building service systems, such as HVAC; electric power; communication; safety and security; transportation; sanitation, etc. Building intelligence is not related to the sophistication of service systems in a building, but rather to the integration among the various service systems, and between the systems and the building structure. Systems' integration can be accomplished through teamwork planning of the building, starting at the initial design stages of the building. This paper examines some existing buildings claimed to be “intelligent”, according to their level of systems' integration.     

Optimization Problems Related to Zigzag Pocket Machining

A fundamental problem of manufacturing is to produce mechanical parts from billets by clearing areas within specified boundaries from the material. Based on a graph-theoretical formulation, the algorithmic handling of one particular machining problem—``zigzag pocket machining'—is investigated. We present a linear-time algorithm that ensures that every region of the pocket is machined exactly once, while attempting to minimize the number of tool retractions required. This problem is shown to be -hard for pockets with holes. Our algorithm is provably good in the sense that the machining path generated for a pocket with h holes requires at most 5 . . . OPT + 6 . . . h retractions, where OPT is the (unknown) minimum number of retractions required by any algorithm. The algorithm has been implemented, and practical tests for pockets without holes suggest that one can expect an approximation factor of about 1.5 for practical examples, rather than the factor 5 as proved by our analysis. Received July 3, 1997; revised September 7, 1997.