一种非刚性医学图像点匹配方法

提出了一种非刚性点匹配的算法并把其运用于医学图像配准．该算法采用信号滤波的方法来获得点集间的匹配信息，并运用松弛标记法将各点邻域关系对模糊的匹配信息进行迭代获得明确的匹配关系．在此基础上，利用高斯径向基函数来描述点模式间的弹性形变，在基本的迭代框架下实现问题的求解．实验结果显示在形变程度为5％、出格点比率50％和噪声标准差为5％的情况下该算法的匹配误差能控制在0．13以下，表明了该算法的鲁棒性和有效性，较好地解决了医学非刚性形变的点匹配问题．     

研究型教学柔性评分方案研究

研究型教学的本质是培养学生创新的精神与能力,而现行的学生成绩评分体系差异度较小,不能全面反映出学生的真实掌握情况,不能适应研究型教学模式的开展.借鉴"开根乘十"的经典处理案例,提出了一种将贡献值反映到幂次上的适合研究型教学的柔性评分系统,对其进行方案设计,并推导扩展了其评分计算公式.结合升级模式,对其进行自动实现,以所见即所得的方式进行展示,活跃了课堂气氛,也充分调动了学生课后进行研究探索活动的积极性.     

多对一双方匹配市场中的最优化

在双方市场中定义的博弈概念,可以使市场同方参与者的收益同时达到最大．这种最优化存在的理论依据是选择匹配的稳定性．用博弈论的分析与证明方法研宄多对一双方匹配市场中的最优化．在替代偏好和LAD（Law of Aggregate Demend）偏好下,证明由企业作选择的选择函数一定是个稳定匹配,由工人做选择的选择函数也是一个稳定匹配．     

3-正则图的不共边的完美匹配（英文）

研究3-正则图的一个有意义的问题是它是否存在k个没有共边的完美匹配.关于这个问题有一个著名的Fan-Raspaud猜想：每一个无割边的3-正则图都有3个没有共边的完美匹配.但这个猜想至今仍未解决.设dim（P（G））表示图G的完美匹配多面体的维数.本文证明了对于无割边的3-正则图G,如果dim（P（G））≤14,那么k≤4：如果dim（P（G））≤20,那么k≤5.     

对称群上Cayley图的条件匹配排除数

一个图的条件匹配排除数是最少的边的数量,使得从图中删除这些边后形成的图既没有孤立点,也没有完美匹配和几乎完美匹配.条件匹配排除数是衡量网络在边故障情况下的鲁棒性的参数之一.本文给出了对称群上Cayley图的条件匹配排除数.     

基于人力资本优势结构的人员选拔方法

针对人员选拔主要依据职称、学历等人力资本外在因素确定评判标准,导致“名本”倾向,并且在方法上忽视不同人员个体内质优势结构差异,提出人员选拔方法。从重能力、重实绩、重民主、重优势出发,以实证研究为依托,构建包含能力与业绩两个维度的评价指标体系;给出人力资本优势结构的概念,构建优势结构群识别模型,提出基于优势结构的民主综合评价法。站在每位候选人的角度,兼顾每位候选人的优势,有助于提高人员选拔的公平性和科学性,体现人本理念。通过算例证明了方法的可行性和有效性。     

Dynamic data structures for fat objects and their applications

We present several efficient dynamic data structures for point-enclosure queries, involving convex fat objects in or. Our planar structures are actually fitted for a more general class of objects – (β,δ)-covered objects – which are not necessarily convex, see definition below. These structures are more efficient than alternative known structures, because they exploit the fatness of the objects. We then apply these structures to obtain efficient solutions to two problems: (i) finding a perfect containment matching between a set of points and a set of convex fat objects, and (ii) finding a piercing set for a collection of convex fat objects, whose size is optimal up to some constant factor.     

The stable admissions polytope

The stable admissions polytope– the convex hull of the stable assignments of the university admissions problem – is described by a set of linear inequalities. It depends on a new characterization of stability and arguments that exploit and extend a graphical approach that has been fruitful in the analysis of the stable marriage problem. Received: April 10, 1998 / Accepted: June 3, 1999?Published online January 27, 2000     

Performance of Organizational Design Models and Their Impact on Organization Learning

The performance of various organizational structures is an essential parameter in the reengineering of organizations, particularly in the current rapidly changing, competitive and information technology-dependent environment. This situation has generally resulted in a smaller workforce confronted with voluminous information-processing requirements. Naturally, the focus has been on the design of organzations that will support effective and efficient learning processes. This specific study is on the contingency modely by Ouksel et al. (1997) on the impact of organizational structure on organizational learning and performance. It expands the empirical evaluation of the model to test its robustness. This is done by conducting extensive simulations with (a) a larger number of variables in the decision tasks, and (b) a larger set of numbers for each of the numeric variables, than has been used in the past. Overall, the validity of previous results achieved has been confirmed, but the selection of the most appropriate design, that which will indeed improve learning, is even more nuanced than past studies have concluded.     

Flexible composition and execution of large scale applications on distributed e-infrastructures

Computer simulation is finding a role in an increasing number of scientific disciplines, concomitant with the rise in available computing power. Marshalling this power facilitates new, more effective and different research than has been hitherto possible. Realizing this inevitably requires access to computational power beyond the desktop, making use of clusters, supercomputers, data repositories, networks and distributed aggregations of these resources. The use of diverse e-infrastructure brings with it the ability to perform distributed multiscale simulations. Accessing one such resource entails a number of usability and security problems; when multiple geographically distributed resources are involved, the difficulty is compounded. In this paper we present a solution, the Application Hosting Environment,³ which provides a Software as a Service layer on top of distributed e-infrastructure resources. We describe the performance and usability enhancements present in AHE version 3, and show how these have led to a high performance, easy to use gateway for computational scientists working in diverse application domains, from computational physics and chemistry, materials science to biology and biomedicine.