Targeted destruction of murine macrophage cells with bioconjugated gold nanorods

Gold nanorods manifest a readily tunable longitudinal plasmon resonance with light and consequently have potential for use in photothermal therapeutics. Recent work by others has shown how gold nanoshells and rods can be used to target cancer cells, which can then be destroyed using relatively high power laser radiation (∼1×10⁵ to 1×10¹⁰ W/m²). Here we extend this concept to demonstrate how gold nanorods can be modified to bind to target macrophage cells, and show that high intensity laser radiation is not necessary, with even 5×10² W/m² being sufficient, provided that a total fluence of ∼30 J/cm² is delivered. We used the murine cell line RAW 264.7 and the monoclonal antibody CD11b, raised against murine macrophages, as our model system and a 5 mW solid state diode laser as our energy source. Exposure of the cells labeled with gold nanorods to a laser fluence of 30 J/cm² resulted in 81% cell death compared to only 0.9% in the control, non-labeled cells.     

Image sequence inpainting: Towards numerical software for detection and removal of local missing data via motion estimation

Film restoration aims to remove or reduce various types of film and video defects in order to provide visual enhancements of image sequences. The automatic treatment of these defects is a challenge. Restoration is still performed by hand even if by using numerical techniques for retouching. This is a very intensive activity and great improvements, both in quality and in speed, can be obtained by using automatic or semiautomatic software.     

On sequential commitment in the price-dependent newsvendor model

We investigate the effect of sequential commitment in the decentralized newsvendor model with price-dependent demand. Sequential commitment allows the self-profit maximizing parties to commit to contract parameters (e.g., wholesale price, retail price, buyback price and order quantity) sequentially and alternately, and we investigate its effect on the equilibrium profits of the channel and its members. Sequential commitment introduces more flexibility to contracting in the supply chain and our analysis can provide some insight to channel members who follow a bargaining process to determine the values of contract parameters. We show that the introduction of sequential commitment to the price-dependent (PD) newsvendor model with buybacks can significantly improve the manufacturer’s and the channel expected profits, but it can also decrease the retailer’s expected profit. Finally, we demonstrate that with sequential commitment, under some conditions, the choice of the first mover is endogenized and we identify the unique sequence of commitments by channel members that would arise in equilibrium.     

遍历序列在动力系统平均方法定量研究中的应用

主要研究了遍历序列及其应用.在遍历函数的基础上,引入了遍历序列的概念.然后,从两个方面来研究离散情况下的遍历问题,从中得到了一些遍历序列的性质,并利用平均方法得到了离散情况下的动力系统的解的定量性质.     

Orlicz序列空间的弱收敛序列系数

本文给出了Orlicz序列空间的弱收敛序列系数的表达式.     

加热对自然转捩湍斑产生影响的实验研究

本文利用流动显示和高速摄像技术，在湍流度为1％的水洞中，对加热的细长旅成体鱼雷模型表面的流动转捩过程进行了实验研究。实验发现，加热对自然转捩过程中湍流斑的猝发有明显影响，加热减小了湍斑产生的频率，增加了湍斑间的展向间距，使转捩过程中层流转变为完全湍流的过渡区延长．加热对瑞斑产生的纵向位置无明显影响。本文的实验结果正好解释在较高湍流庭环境中的加热减阻机理．     

Some string matching problems from Bioinformatics which still need better solutions

Bioinformatics, the discipline which studies the computational problems arising from molecular biology, poses many interesting problems to the string searching community. We will describe two problems arising from Bioinformatics, their preliminary solutions, and the more general problem that they pose. The first problem is searching for α-helices in protein sequences. This particular instance of the search is based on matching of hydrophobicity/hydrophilicity. We find an algorithm which is linear in the sequence length for fixed helix length and is O(nlogn) for any helix length. The second problem is on matching probabilistic sequences against sequences or against other probabilistic sequences. In both cases we derive efficient formulas to compute scores according to a Markovian model of evolution.     

Extreme problems on classes of polynomials and splines

By the methods of the theory of extremum problems, existence theorems for functions with given sequence of extreme values are proved.Translated fromMatematicheskie Zametki, Vol. 63, No. 4, pp. 494–502, April, 1998.The author wishes to express his sincere gratitude to Professor V. M. Tikhomirov for setting the problem and for his permanent attention and help and also to the referee for the remarks, which aided in the amelioration of the present paper.     

Three-term recurrence relations with matrix coefficients. The completely indefinite case

In the space {ol _p ² of vector sequences, we consider the symmetric operatorL generated by the expression (lu)j:=Bj ^uj+1+Aj ^uj+ _B ^j−1/* uj−1, whereu−1 = 0,u ₀,u ₁, … ∈ ℂ ^p ,A _j andB _j arep × p matrices with entries from ℂ,A _j ^* =A_j, and the inversesB _j ⁻¹ (j = 0, 1, …) exist. We state a necessary and sufficient condition for the deficiency numbers of the operatorL to be maximal; this corresponds to the completely indefinite case for the expressionl. Tests for incomplete indefiniteness and complete indefiniteness forl in terms of the coefficientsA _j andB _j are derived. Translated fromMatematicheskie Zametki, Vol. 63, No. 5, pp. 709–716, May, 1998. This research was supported by the Russian Foundation for Basic Research under grant No. 96-01-00333.     

相容工件系统的最小化最大延迟与误工和的重新排序

在单机重新排序问题中,一个原始工件集已经排好顺序,使得给定的目标函数最小．当一个新的工件集到来时就会产生一些错位,决策者需要插入新工件到原来排序中而还不能过分打乱它们的顺序．该论文首先研究了当工件加工时间和工期相容时,在错位量限制的条件下最小化最大延迟问题;也研究了当工件加工时间相同或工件工期相同时,在错位量限制的条件下最小化误工和问题．对这些问题,给出了好的算法．