LaTiO高k栅介质Ge MOS电容电特性及Ti含量优化

采用共反应溅射法将Ti添加到La_2O_3中,制备了LaTiO/Ge金属-氧化物-半导体电容,并就Ti含量对器件电特性的影响进行了仔细研究.由于Ti-基氧化物具有极高的介电常数,LaTiO栅介质能够获得高k值;然而由于界面/近界面缺陷随着Ti含量的升高而增加,添加Ti使界面质量恶化,进而使栅极漏电流增大、器件可靠性降低.因此,为了在器件电特性之间实现协调,对Ti含量进行优化显得尤为重要.就所研究的Ti/La_2O_3比率而言,18.4%的Ti/La_2O_3比率最合适.该比率导致器件呈现出高k值(22.7)、低D_(it)(5.5×10~(11)eV~(-1)·cm~(-2))、可接受的J_g(V_g=1V,J_g=7.1×10~(-3)A·cm~(-2))和良好的器件可靠性.     

Supercontinuum generation and nonlinear pulse propagation in photonic crystal fiber: influence of the frequency-dependent effective mode area

Numerical simulations are used to study the effect of the frequency dependence of the effective mode area in photonic crystal fiber on supercontinuum generation. We quantify how the frequency dependence of the effective area influences the propagation characteristics through a modified optical shock term and identify the major consequence as a reduction in the extreme long-wavelength edge of the supercontinuum spectrum. Our results show that, for the parameter regimes used in many previous supercontinuum generation experiments using near-infrared femtosecond pump sources around 800 nm, this effect would be expected to be negligible. However, for pumps in the 1000–1500 nm range, the inclusion of this effect would be expected to be crucial for accurate comparison of simulations with experiment.     

Silver: a novel growth catalyst for Ge nanoislands on Si(113)

The impact of silver pre‐adsorption on germanium growth on Si(113) was investigated using in‐situ low‐energy electron microscopy (LEEM) as well as low‐energy electron diffraction (LEED). The adsorption of silver leads to the formation of a regular pattern of nanofacets along the [1 0] direction. The periodicity of this pattern in [33 ] direction was determined to (44 ± 4) nm. From LEED series at different energies the facets were identified to be of (111) and (115) orientation. While the (111) facets show a (√3 × √3)‐R30° reconstruction, the (115) facets exhibit a (2 × n) superstructure. The subsequent growth of Ge results in the formation of nanoislands that are aligned along the facets. These Ge islands have an anisotropic shape with typical sizes of about 100 nm in [33 ] direction and 400 nm in [1 0] direction. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Optically S-polarized surface waves in symmetrical nonlinear sensors: Thermal effects

A surface wave in a planar nonlinear waveguide is a current problem that has several applications in modern electronics and optics such as optical sensors design. The effect of thermal stress on the optical performance of a nonlinear symmetrical sensor is studied. The mathematical forms of the dispersion equation and thermal-stress sensitivity are analytically derived and plotted numerically. It is found that the thermal sensitivity of the sensor can be controlled by tuning the core size, by changing the loading materials, and by carefully selecting the materials.     

Hydrogenation of carbon fragments after femtosecond laser ablation of solid C60

We have observed several kinds of hydrocarbon cations after the nanosecond and the femtosecond laser ablation (nsLA and fsLA) of solid C₆₀. The observation indicates that the carbon fragments produced just after laser ablation of the C₆₀ molecule react with the hydrogen atoms and ions coexisting in the ablation plume. In the case of fsLA, clear dependence of the product hydrocarbon species on the ablation laser power has been observed although the dependence is not clearly observed in nsLA. The production of C_nH₅⁺ (n = 8, 10, and 12) is only observed in fsLA suggesting the unique nature of the transient carbon fragments produced by fsLA.     

L（1, 2）-edge-labelings for lattices

For a graph G and two positive integers j and k, an m-L(j, k)-edge-labeling of G is an assignment on the edges to the set {0, 1, 2,..., m}, such that adjacent edges which receive labels differ at least by j, and edges which are distance two apart receive labels differ at least by kThe λ j,k-number of G is the minimum m such that an m-L(j, k)-edge-labeling is admitted by GIn this article, the L(1, 2)-edge-labeling for the hexagonal lattice, the square lattice and the triangular lattice are studied, and the bounds for λ j,k-numbers of these graphs are obtained.     

On the Number of k‐Dominating Independent Sets

We study the existence and the number of k‐dominating independent sets in certain graph families. While the case namely the case of maximal independent sets—which is originated from Erd?s and Moser—is widely investigated, much less is known in general. In this paper we settle the question for trees and prove that the maximum number of k‐dominating independent sets in n‐vertex graphs is between and if , moreover the maximum number of 2‐dominating independent sets in n‐vertex graphs is between and . Graph constructions containing a large number of k‐dominating independent sets are coming from product graphs, complete bipartite graphs, and finite geometries. The product graph construction is associated with the number of certain Maximum Distance Separable (MDS) codes.     

Disjoint Paths in Decomposable Digraphs

The k‐linkage problem is as follows: given a digraph and a collection of k terminal pairs such that all these vertices are distinct; decide whether D has a collection of vertex disjoint paths such that is from to for . A digraph is k‐linked if it has a k‐linkage for every choice of 2k distinct vertices and every choice of k pairs as above. The k‐linkage problem is NP‐complete already for [11] and there exists no function such that every ‐strong digraph has a k‐linkage for every choice of 2k distinct vertices of D [17]. Recently, Chudnovsky et al. [9] gave a polynomial algorithm for the k‐linkage problem for any fixed k in (a generalization of) semicomplete multipartite digraphs. In this article, we use their result as well as the classical polynomial algorithm for the case of acyclic digraphs by Fortune et al. [11] to develop polynomial algorithms for the k‐linkage problem in locally semicomplete digraphs and several classes of decomposable digraphs, including quasi‐transitive digraphs and directed cographs. We also prove that the necessary condition of being ‐strong is also sufficient for round‐decomposable digraphs to be k‐linked, obtaining thus a best possible bound that improves a previous one of . Finally we settle a conjecture from [3] by proving that every 5‐strong locally semicomplete digraph is 2‐linked. This bound is also best possible (already for tournaments) [1].     

Maximizing H‐Colorings of Connected Graphs with Fixed Minimum Degree

For graphs G and H , an H‐coloring of G is a map from the vertices of G to the vertices of H that preserves edge adjacency. We consider the following extremal enumerative question: for a given H , which connected n‐vertex graph with minimum degree δ maximizes the number of H‐colorings? We show that for nonregular H and sufficiently large n , the complete bipartite graph is the unique maximizer. As a corollary, for nonregular H and sufficiently large n the graph is the unique k‐connected graph that maximizes the number of H‐colorings among all k‐connected graphs. Finally, we show that this conclusion does not hold for all regular H by exhibiting a connected n‐vertex graph with minimum degree δ that has more ‐colorings (for sufficiently large q and n ) than .     

空间多样化约束下的移动k近邻查询

考虑为移动中的查询对象连续返回k个距离近并且满足空间多样化约束的对象,提出了空间多样化约束下的移动k近邻(SDC-MkNN)查询.在此,满足空间多样化约束代表对象之间的相互距离大于距离阈值.为了高效处理SDC-MkNN查询问题,提出了两种基于安全区域技术的算法.算法均通过减少重新计算查询结果的次数来提高查询效率.其中一种为精确算法EA,可连续返回精确的查询结果;另一种为近似算法ρAA,可连续返回具有近似率保障的近似查询结果.采用真实数据集验证了所提出算法的有效性.