线路方案比选多目标决策分析

本文通过对线路方案比选的多目标决策分析，建立了线路方案比选的 ＴＯＰＳＩＳ模型，对线路方案非劣解集进行排序，提供方案的优先顺序．     

Accurate Design of Finline Tapers for Millimeter Wave Applications

The design of nonuniform bilateral finlines on anisotropic substrates for millimeter wave applications is presented. The taper consists of a planar circuit with smooth variation of the slot width profile along the structure. The spectral domain method and Galerkin procedure are combined with the transmission line theory for studying the behavior of tapered bilateral finlines and evaluation of their design parameters. The influence of the substrate anisotropy on the propagation characteristics of these structures is also examined. This technique is general and can be applied to investigate a broad class of planar transmission line tapers.     

IDENTIFICATION OF MEMBRANE PROTEINS IMAGED BY ATOMIC FORCE MICROSCOPY USING A TEMPLATE MATCHING ALGORITHM

The atomic force microscope allows to image biological samples in their native environment. But the identification and the topography of individual randomly distributed membrane proteins is still a challenge. We used membranes of isolated vacuoles of barley mesophyll cells. Images at low resolution indicate that vacuoles spontaneously attach, rupture and finally adsorb completely as planar membrane to mica. Height profiles indicate that the membrane at the peripheral boundary exposes the extravacuolar surface to the scanning tip. At molecular resolution a template matching correlation algorithm was used to identify the most abundant membrane protein, the vacuolar H⁺-ATPase by the characteristic extravacuolar head of the transport molecule. The data indicate the possibility to analyse single randomly distributed membrane proteins in their native environment with the knowledge of a suitable template.     

全固态激光器抽运的PPLN光参变振荡

用全固态1064nm调Q激光输出，抽运多周期PPLN，实现了宽调谐的准相位匹配光参变振荡，振荡阈值10．3μJ（脉宽22ns)，信号光最高输出平均功率为42．5mW，斜率效率为12．5％。     

On the performance of the ICP algorithm

We present upper and lower bounds for the number of iterations performed by the Iterative Closest Point (ICP) algorithm. This algorithm has been proposed by Besl and McKay as a successful heuristic for matching of point sets in d-space under translation, but so far it seems not to have been rigorously analyzed. We consider two standard measures of resemblance that the algorithm attempts to optimize: The RMS (root mean squared distance) and the (one-sided) Hausdorff distance. We show that in both cases the number of iterations performed by the algorithm is polynomial in the number of input points. In particular, this bound is quadratic in the one-dimensional problem, under the RMS measure, for which we present a lower bound construction of Ω(nlogn) iterations, where n is the overall size of the input. Under the Hausdorff measure, this bound is only O(n) for input point sets whose spread is polynomial in n, and this is tight in the worst case.We also present several structural geometric properties of the algorithm under both measures. For the RMS measure, we show that at each iteration of the algorithm the cost function monotonically and strictly decreases along the vector Δt of the relative translation. As a result, we conclude that the polygonal path π, obtained by concatenating all the relative translations that are computed during the execution of the algorithm, does not intersect itself. In particular, in the one-dimensional problem all the relative translations of the ICP algorithm are in the same (left or right) direction. For the Hausdorff measure, some of these properties continue to hold (such as monotonicity in one dimension), whereas others do not.     

Finding more perfect matchings in leapfrog fullerenes

We use some recent results on the existence of long cycles in leapfrog fullerenes to establish new exponential lower bounds on the number of perfect matchings in such graphs. The new bounds are expressed in terms of Fibonacci numbers.     

GLOBAL SUPERCONVERGENCES OF THE DOMAIN DECOMPOSITION METHODS WITH NONMATCHING GRIDS

1. IlltroductionA nonconforming domain decomposition method with Lagrangian multipliers was proposedin [13]. The basic idea of this method is to deal with the nonconforming of nonmatching gridsby illtroducing the Lagrangian multipliers on interfaces of subdomains and its advalltages arethat it allows not only the incompatibility of the internal variables on the interface betweensubdomains, but also the discolltinuity of the boundary variables on the common venices ofsubdomains. Thus one can c…     

q-Weighted log-concavity and q-product theorem on the normality of posets

We show that q-weighted log-concavity and the strict normalized matching property are preserved under the q-direct product over weighted posets. As consequences, two classes of weighted posets including the finite linear lattices are strictly q-weighted log-concave and strictly normal.     

Minimally non-Pfaffian graphs

We consider the question of characterizing Pfaffian graphs. We exhibit an infinite family of non-Pfaffian graphs minimal with respect to the matching minor relation. This is in sharp contrast with the bipartite case, as Little [C.H.C. Little, A characterization of convertible (0,1)-matrices, J. Combin. Theory Ser. B 18 (1975) 187–208] proved that every bipartite non-Pfaffian graph contains a matching minor isomorphic to K_3,3. We relax the notion of a matching minor and conjecture that there are only finitely many (perhaps as few as two) non-Pfaffian graphs minimal with respect to this notion.We define Pfaffian factor-critical graphs and study them in the second part of the paper. They seem to be of interest as the number of near perfect matchings in a Pfaffian factor-critical graph can be computed in polynomial time. We give a polynomial time recognition algorithm for this class of graphs and characterize non-Pfaffian factor-critical graphs in terms of forbidden central subgraphs.     

FTRLIM: Distributed Instance Matching Framework for Large-Scale Knowledge Graph Fusion

Instance matching is a key task in knowledge graph fusion, and it is critical to improving the efficiency of instance matching, given the increasing scale of knowledge graphs. Blocking algorithms selecting candidate instance pairs for comparison is one of the effective methods to achieve the goal. In this paper, we propose a novel blocking algorithm named MultiObJ, which constructs indexes for instances based on the Ordered Joint of Multiple Objects’ features to limit the number of candidate instance pairs. Based on MultiObJ, we further propose a distributed framework named Follow-the-Regular-Leader Instance Matching (FTRLIM), which matches instances between large-scale knowledge graphs with approximately linear time complexity. FTRLIM has participated in OAEI 2019 and achieved the best matching quality with significantly efficiency. In this research, we construct three data collections based on a real-world large-scale knowledge graph. Experiment results on the constructed data collections and two real-world datasets indicate that MultiObJ and FTRLIM outperform other state-of-the-art methods.