Envy-free matchings with one-sided preferences and matroid constraints

In this paper, we consider the problem of checking the existence of an envy-free matching in a many-to-one matching model with one-sided preferences and matroid constraints. For this problem, we propose a polynomial-time algorithm which is a generalization of the algorithm proposed by Gan, Suksompong, and Voudouris for the one-to-one setting. Furthermore, we consider a stronger variant of envy-freeness.     

基于最小电压法的超声换能器谐振频率自动跟踪*

首先分析了最大电流法跟踪超声换能器谐振频率的原理及应用范围。研究了基于由串联电感和并联电容匹配电路下,不同频率时换能器两端电压电流的变化规律。研究表明在串联电感和并联电容匹配电路下发生谐振时,换能器两端的电压最小而电流并非最大。由此形成了采用最小电压法跟踪谐振频率的自动跟踪策略,并给出了该方法的具体实施步骤。论文研究结果为换能器谐振频率的自动跟踪方法提供了新的选择。     

ICRH射频系统二次实验匹配法的分析

本文提出了在大功率射频发射系统中对一个未知的天线负载，可用二次实验数据来确定双Ｔ调配器的参数，以达到射频源和天线负载间的匹配。文中详细地讨论了这种高配法的理论并给出了用以实验的解析公式。     

On a singular perturbation problem with two second-order turning points

In this paper, we study the singular perturbation problem

where 0<ε1 is a small positive parameter, p(x) and q(x) are sufficiently smooth and strictly positive functions. The main feature of this equation is that there are two second-order turning points in the interval (0,1). Based on the rigorous results on singular perturbation problems with one second-order turning point in our previous work, we obtain a uniform asymptotic approximation for the general solution of the above equation by means of a matching technique.     

Facets of the independent path-matching polytope

Cunningham and Geelen introduced the independent path-matching problem as a common generalization of the weighted matching problem and the weighted matroid intersection problem. Associated with an independent path-matching is an independent path-matching vector. The independent path-matching polytope of an instance of the independent path-matching problem is the convex hull of all the independent path-matching vectors. Cunningham and Geelen described a system of linear inequalities defining the independent path-matching polytope. In this paper, we characterize which inequalities in this system induce facets of the independent path-matching polytope, generalizing previous results on the matching polytope and the common independent set polytope.     

基于模糊聚类的属性匹配算法

提出了一种基于模糊聚类的属性匹配算法。该算法采用能综合反映属性名称相似性和语义相似性的模糊相似关系,提高了属性匹配的准确率;以等价闭包法对相似属性进行模糊聚类,得到多层次属性分类结果,更客观真实地反映了属性匹配的模糊性;同时,属性匹配过程中不需要设置匹配参数,避免了人为造成的误差。     

图T1,1,m与Q(3,n)中有路因子的充分必要条件及T1,1,m的匹配等价类

如果一个图的匹配多项式可以被一个路的匹配多项式整除,我们就称此路是该图的一个路因子,路因子在刻画图的匹配等价类,研究匹配唯一性方面有很重要的作用.本文得到了图T1,1.m与图Q(3,n)中有路因子的充分必要条件.     

Social norms and choice: a weak folk theorem for repeated matching games

A folk theorem which holds for all repeated matching games is established. The folk theorem holds any time the stage game payoffs of any two players are not affinely equivalent. The result is independent of population size and matching rule—including rules that depend on players choices or the history of play.      

Stability properties of numerical methods for solving delay differential equations

Stability properties of numerical methods for delay differential equations are considered. Some suitable definitions for the stability of the numerical methods are included and Runge-Kutta type methods satisfying these properties are tested on a numerical example.     

一个非严格双曲型方程组粘性逼近解的收敛性

本文讨论非严格双曲型方程组的粘性逼近解的收敛性，当ｆ满足一定条件，初值为有界可测函数时，利用补偿紧致的理论及对前进熵波的分析，在没有对粘性解导数一致界估计的情况下，证明了粘性逼近解存在一个子序列在强拓扑意义下收敛．