Nonlinear edge modes in a honeycomb electrical lattice near the Dirac points

We examine - both experimentally and numerically - a two-dimensional nonlinear driven electrical lattice with honeycomb structure. Drives are considered over a range of frequencies both outside (below and above) and inside the band of linear modes. We identify a number of discrete breathers both existing in the bulk and also (predominantly) ones arising at the domain boundaries, localized either along the arm-chair or along the zig-zag edges. The types of edge-localized breathers observed and computed emerge in distinct frequency bands near the Dirac-point frequency of the dispersion surface while driving the lattice subharmonically (in a spatially homogeneous manner). These observations/computations can represent a starting point towards the exploration of the interplay of nonlinearity and topology in an experimentally tractable system such as the honeycomb electrical lattice.     

基于小波变换的图像融合新算法

针对现有图像融合技术中的尺度系数卷积法存在的边缘细节损失和对比度下降问题,提出了将Canny边缘检测算子等价于提取图像的小波变换模极大值点这一思想引入图像的低频分量融合规则以及用于高频子带融合的局部对比度结合方向方差方法.最后通过仿真试验以及熵值数据证明该算法有效改善了边缘细节的准确度,提高了分辨率,并使局部对比度信息得以保留,从而更加符合人类的视觉特性.     

扶手椅型二硫化钼纳米带的电子结构与边缘修饰

采用基于密度泛函理论的第一性原理计算方法, 研究了扶手椅型二硫化钼纳米带的几何构型与电子结构, 发现其稳定性与电子性质敏感地依赖于边缘修饰. 随着边缘修饰的H原子数增加, 纳米带变得更加稳定, 并在间接带隙半导体、半金属和直接带隙半导体之间转变. 纳米带的能带结构和电子态密度显示, 其费米能级附近的能带主要由边缘态贡献. 当二硫化钼纳米带两边用不同数目的H原子修饰时, 纳米带同时具有由这两种修饰引起的边缘态并且两种边缘态的相互影响很小. 研究了三类纳米带带隙与宽度的关系, 对于每个原胞修饰0个或8个H原子的纳米带, 带隙随宽度以3为周期振荡变化; 而对于每个原胞修饰4个H原子的纳米带, 带隙振荡不再具有周期并且振荡幅度变小.     

Halin-图的邻强边染色

图G(V,E)的正常κ-边染色f叫做图G(V,E)的κ-邻强边染色当且仅当任意uv∈E(G)满足f[u]≠f[v],其中,f[u]={f(uw)|uw∈E(G)},称f是G的κ-临强边染色,简记为κ-ASEC.并且x′_as(G)=min{k|κ-ASEC of G}叫做G(V,E)的邻强边色数.本文研究了△(G)≥5的Halin-图的邻强边色数.     

Vertex-distinguishing E-total Coloring of Complete Bipartite Graph K_(7,n) when 7≤n≤95

Let G be a simple graph. A total coloring f of G is called an E-total coloring if no two adjacent vertices of G receive the same color, and no edge of G receives the same color as one of its endpoints. For an E-total coloring f of a graph G and any vertex x of G, let C(x) denote the set of colors of vertex x and of the edges incident with x, we call C(x) the color set of x. If C(u)≠ C(v) for any two different vertices u and v of V(G), then we say that f is a vertex-distinguishing E-total coloring of G or a VDET coloring of G for short. The minimum number of colors required for a VDET coloring of G is denoted by χ_(vt)~e(G) and is called the VDET chromatic number of G. The VDET coloring of complete bipartite graph K_(7,n)(7 ≤ n ≤ 95) is discussed in this paper and the VDET chromatic number of K_(7,n)(7 ≤ n ≤ 95) has been obtained.     

一种复杂车辆图像中的多车牌定位方法

针对复杂背景中多个车牌的定位问题,提出一种新的定位方法.该方法综合利用边缘检测、连通域分析、倾斜矫正等多种方法,解决了复杂背景中定位难的问题.能够准确定位杂乱背景中的车牌,对天气、光照变化、车牌在图像中的移动和旋转等,具有良好的适应能力.该方法为后续的字符分割和字符识别提供旋转角度、字符区域定位信息.     

酒类中微量甲醛的快速测定新方法

在FeCl3存在条件下,甲醛与自制蛋白液显色剂能生成紫色化合物,藉此可以定量测定微量甲醛。方法线性范围为1~10μg/10mL,线性相关系数r2=0.996,检出限为0.05μg/mL。用该法测定经活性炭脱色的啤酒和白酒中的甲醛含量,回收率为96.46%~103.32%,相对标准偏差为1.36%~2.09%(n=6)。     

Self-organization of directed networks through asymmetric coupling

In this Letter, self-organization of directed networks is surveyed. Inspired from the results in neural networks research, we propose an asymmetric coupling scheme with simple edge deleting rules. Results show that all-to-all networks can be organized into scale-free networks with feed-forward structures. Corresponding analysis is also given.     

On some colorings of a double graph

In this note, we present some results concerning the chromatic index, the total chromatic index, the adjacent vertex distinguishing chromatic index and the adjacent vertex distinguishing total chromatic index for double graphs. In particular, we study the double graphs of class 1 and of type 1.