596 research outputs found
第1104回千葉医学会例会・千葉大学大学院医学研究院腫瘍内科学例会
ITSN-1s expression in emerging tumors. Immunofluorescent staining with ITSN-1 Ab followed by AF488 Ab of lung sections from mice injected retro-orbitally with A549 (A, C) and A549 + ITSN-1s (B, D) cells. Representative images of small tumors (A, B, b1) and medium/large tumors (C, D, d1) in mice injected with A549 and A549 + ITSN-1s cells respectively. 3 sections per mice (n = 3 mice) were examined and images were acquired using identical parameters. Bars: 40 μm. (TIF 3224 kb
CVD Growth of Carbon Nanotube Forest with Selective Wall-Number from Fe–Cu Catalyst
We
reported herein the chemical vapor deposition (CVD) growth of
vertically aligned carbon nanotubes (CNTs) with selective wall-number
using binary Fe–Cu catalysts. High quality single-walled carbon
nanotube (SWNT) and double-walled carbon nanotube (DWNT) forests were
predominantly produced with selectivity of ∼92% and ∼85%,
respectively. Formation of small catalyst nanoparticles with high
areal density and fully reduced state was found key for efficient
SWNT growth. Characterization of the catalysts by atomic force microanalysis
(AFM) and high resolution transmission electron microscope (HRTEM)
showed that the introduction of the proper amount of Cu into the Fe/Al<sub>2</sub>O<sub>3</sub> catalyzing system inhibited diffusion of Fe
NPs and facilitated the full reduction of Fe catalyst, thus facilitating
the selective growth of SWNTs. DWNTs were also obtained by introducing
a thick layer of Cu catalyst onto Fe/Al<sub>2</sub>O<sub>3</sub>.
Our work provides a rational way for selective growth of vertically
aligned SWNTs and DWNTs, whose remarkable electronic and mechanical
properties enable their promising application in nanoelectronics devices
Value-Optimal Sensor Network Design for Steady-State and Closed-Loop Systems Using the Generalized Benders Decomposition
The
problem of value-optimal sensor network design for linear systems
has been shown to be of the nonconvex mixed integer programming class.
While the branch and bound search procedure can be used to obtain
a global solution, such a method is limited to fairly small systems.
The bottleneck is that during each iteration of the branch and bound
search, a fairly slow semi-definite programming (SDP) problem must
be solved to its global optimum. In this paper, it is demonstrated
that an equivalent reformulation of the nonconvex mixed integer programming
problem and subsequent application of the generalized benders decomposition
(GBD) algorithm will result in massive reductions in computational
effort. While the proposed algorithm has to solve multiple mixed integer
linear programs, this increase in computational effort is significantly
outweighed by a reduction in the number of SDP problems that must
be solved
Double σ-Aromaticity in a Surface-Deposited Cluster: Pd<sub>4</sub> on TiO<sub>2</sub> (110)
We report double σ-aromaticity in a surface-deposited
cluster,
Pd<sub>4</sub>, on the TiO<sub>2</sub> (110) surface. In the gas phase,
Pd<sub>4</sub> adopts a tetrahedral structure. However, surface binding
promotes a flat, σ-aromatic cluster. This is the first time
aromaticity has been found in surface-deposited clusters. The concept
of aromaticity is expected to become instrumental in predicting and
interpreting properties of such systems, much like it is for isolated
molecules and clusters
<i>S</i><sub><i>c</i></sub> and rank of DSRABSQL and VDWOA algorithm in <i>G</i><sub><i>2</i></sub>.
Sc and rank of DSRABSQL and VDWOA algorithm in G2.</p
<i>min</i>, <i>avg</i>, <i>max</i> and <i>S</i><sub><i>td</i></sub> of fl1400 obtained by three algorithms.
min, avg, max and Std of fl1400 obtained by three algorithms.</p
The optimal route of Tsp225 output by DSRABSQL algorithm.
The optimal route of Tsp225 output by DSRABSQL algorithm.</p
The value of <i>N</i><sub><i>min</i></sub> for ch150, rat575 and fl1400 obtained by three algorithms.
The value of Nmin for ch150, rat575 and fl1400 obtained by three algorithms.</p
Simulation parameters for the QL, ABSQL and DSRABSQL algorithms.
Simulation parameters for the QL, ABSQL and DSRABSQL algorithms.</p
- …