Weak Delocalization in Graphene on a Ferromagnetic Insulating Film

Graphene has been predicted to develop a magnetic moment by proximity effect when placed on a ferromagnetic film, a promise that could open exciting possibilities in the fields of spintronics and magnetic data recording. In this work, the interplay between the magnetoresistance of graphene and the magnetization of an underlying ferromagnetic insulating film is studied in detail. A clear correlation between both magnitudes is observed but through a careful modeling of the magnetization and the weak localization measurements, that such correspondence can be explained by the effects of the magnetic stray fields arising from the ferromagnetic insulator is found. The results emphasize the complexity arising at the interface between magnetic and 2D materials.     

逻辑程序的一种并行执行模型

本文基于静态相关性分析和动态调整相结合的方法，提出了一种逻辑程序的执行模型，它不仅开发了“与“并行，同进也开发了一定的“或“并行，从而有效地加速了逻辑程序的执行。     

建筑制图标准中图形符号适宜性、区分性的研究

应用线段长短、间距大小视觉反应的量化规律，提出设计图形符号大小的原则——既更使其大小满足“长”“短”“大”“小”的心理要求，又要互相之间在大小上有区分性。根据图形组织的相似、接近、连续三原则提出设计图形符号形状的原则——图形符号之间尽量减少相似、接近、连续，以保证较好的区分性。通过分析发现，现行建筑制图标准中的图形符号绝大部分在大小和形状具有适宜性、区分性。     

GIS中矢量图形的结构分析与VC++中的实现

简要讨论了GIS各类矢量图形元素间的空间拓朴结构及基位置关系 ,并用VC 6 . 0及MFC具体分析了圆弧与多边形区域的相交关系及实现。为利用VC开发专用图形软件提供了有用帮助。     

转移法色交换

将图Ｇ的着色由一种变为中一种，通常用Ｋｅｍｐｅ法以交换。但是，对于某些情况，用此法无效。针对这个问题，本文提出了一种转移法色交换，它适用于平面图着色，方法直观，清晰且有效。     

Energy minimization and design for testability

The problem of fault detection in general combinational circuits is NP-complete. The only previous result on identifying easily testable circuits is due to Fujiwara who gave a polynomial time algorithm for detecting any single stuck fault inK-bounded circuits. Such circuits may only contain logic blocks with no more thanK input lines and the blocks are so connected that there is no reconvergent fanout among them. We introduce a new class of combinational circuits called the (k, K)-circuits and present a polynomial time algorithm to detect any single or multiple stuck fault in such circuits. We represent the circuit as an undirected graphG with a vertex for each gate and an edge between a pair of vertices whenever the corresponding gates have a connection. For a (k, K)-circuit,G is a subgraph of ak-tree, which, by definition, cannot have a clique of size greater thank+1. Basically, this is a restriction on gate interconnections rather than on the function of gates comprising the circuit. The (k, K)-circuits are a generalization of Fujiwara'sK-bounded circuits. Using the bidirectional neural network model of the circuit and the energy function minimization formulation of the fault detection problem, we present a test generation algorithm for single and multiple faults in (k, K)-circuits. This polynomial time aggorithm minimizes the energy function by recursively eliminating the variables.     

Linearly many faults in Cayley graphs generated by transposition trees

We prove that when linearly many vertices are deleted in a Cayley graph generated by a transposition tree, the resulting graph has a large connected component containing almost all remaining vertices.     

包装装潢中的图形创意

图形创意在商品包装装潢设计中起着重要的作用,图形的传统和现代的构成形式使产品更具风格,独创性是其生命力所在,而联想和想象又是创造力的主要源泉,这种联想和想象力通过自然形、抽象形和寓意图形来体现.所以包装设计需要突破,通过图形创意的不断完善,促销产品,使其为市场接受,被顾客赞誉.     

综合线损分析系统研究

描述了综合线损分析系统应该具有的主要功能和分析内容，介绍了系统实现中应该注意的几个问题、系统内容和实现方法。