西文编目中的CNMARC到USMARC转换系统的设计与实现

在分析编目数据从CNMARC格式到USMARC格式自动转换可行性的基础上,研究了两种MARC的字段和字符内容对应关系,找出其中的对应规律,编制出转换关系对应表,设计了西文编目中的CNMARC到USMARC的转换软件,实现了两种MARC格式的平滑转换。     

一种基于二分图故障检测模型的软件故障定位方法研究

软件故障诊断过程中代价最昂贵和最耗时的活动之一就是软件故障定位.为了辅助测试人员进行软件故障的定位,在设计分层思想的指导下,在分析软件及其各个模块以及模块中代码之间复杂关系的基础上,通过分析历史数据中软件故障与现象之间的对应关系,建立了基于拓扑图的软件故障传播模型,使得软件故障诊断人员能够利用该拓扑图模型描述具体的软件故障现象.通过该拓扑图模型,软件故障传播模型可转换成更容易进行问题求解的基于二分图的故障检测模型.然后针对该模型设计了基于贪心策略的算法,该算法解决了基于二分图故障检测模型的最小覆盖求解问题,这一问题的求解结果描述了软件故障原因假设集合,通过故障原因与软件模块关系分析可找出与该故障原因对应的相应模块,从而实现故障定位.实验表明,本研究方案能够有效处理软件故障定位问题.     

某型导弹仿真软件开发与应用

随着制导控制系统设计技术的发展,仿真技术也迅速发展,并且贯穿制导系统研制全过程。结合某型号仿真软件的研制,详细介绍了在YHSim环境下开发仿真软件的方法,同时介绍了软件研制过程中的一些难点问题和对应的解决措施,最后,对仿真结果进行了简要的分析。     

一种提高集群系统可用性的方法及其应用

文中将一种预防性的容错方法——软件再生引入集群系统中，分析两种软件老化模型，提出了对应的软件再生策略，最后在Web集群服务器中实现。从实验结果可以看出软件再生技术较好地提高了集群系统的软件容错性能和系统可用性。     

软件开发中面向对象的方法

在分析传统的软件工程不足的基础上,介绍了软件开发中面向对象的方法的主要内容.对应于软件的生存周期各个阶段具体分析了软件工程开发中面向对象的方法.     

ClearBug一种改进的自动化漏洞分析工具

随着软件漏洞的危害性不断增强,软件漏洞分析已经成为了国内外安全研究的热点。已有的工作大致可以分为静态分析和动态分析两类。本文在开源的软件漏洞静态分析工具Bugscam的基础上,提出了一种建立漏洞模型,映射漏洞模型为分析程序,并进行漏洞分析的思路。对于大量的软件漏洞,我们提出,将其分为函数漏洞和逻辑漏洞两类,并分别探讨了两种模型与程序之间的对应关系。最后,对我们编写的一个改进的自动化漏洞分析工具clearBug进行了介绍,并用实验验证了模型与程序的正确性和有效性。     

次件开发中面向对象的方法

在分析传统的软件工程不足的基础上，介绍了软件开发中面向对象的方法的主要内容。对应于软件的生存周期各个阶段具体分析了软件工程开发中面向对象的方法。     

基于Ansys的压电式四臂加速度计模拟分析

介绍了压电式四臂微加速度计的工作原理,耦合场分析原理以及ANSYS软件在压电分析中的具体应用.以压电式四臂加速度计为例,使用ANSYS软件对其进行了静态,模态等分析,得出了压电层厚度、悬臂厚度、长度对加速度计灵敏度的影响.在模态分析中得出了加速度计的前三阶固有频率和与之对应的振动形态.本文的结果可以直接应用到加速度计结构的优化设计.     

基于工作过程的高职软件课程体系改革的研究与实践

本文探讨了在高职院校中开展软件外包服务的目的和意义,提出组建和管理软件外包服务中心的办法:通过软件外包中心业务的开展,分析软件企业实际的工作过程,根据工作过程深入企业调研,有针对性地了解高职学生能胜任的职业岗位群以及所对应的工作任务和职业能力,与企业技术专家共同制定以工作过程为导向的软件专业课程体系。     

对三极管分压式偏置放大电路的研究

本文首先进行理论分析,在基尔霍夫定律的基础上分别对分压式偏置电路直流通路进行精确法计算和近似法计算.随后搭建电路进行实验测量,得出对应数据.最后利用LTspice XVII软件进行仿真检验,并将所得数据与实验数据对比,得出对应结论.     

Diagnostics for regression dependence in tables re-ordered by the dominant correspondence analysis solution

Correspondence analysis is an exploratory technique for analyzing the interaction in a contingency table. Tables with meaningful orders of the rows and columns may be analyzed using a model-based correspondence analysis that incorporates order constraints. However, if there exists a permutation of the rows and columns of the contingency table so that the rows are regression dependent on the columns and, vice versa, the columns are regression dependent on the rows, then both implied orders are reflected in the first dimension of the unconstrained correspondence analysis [Schriever, B.F., 1983. Scaling of order dependent categorical variables with correspondence analysis. International Statistical Review 51, 225-238]. Thus, using unconstrained correspondence analysis, we may still find that the data fit an ordinal stochastic model. Fit measures are formulated that may be used to verify whether the re-ordered contingency table is regression dependent in either the rows or columns. Using several data examples, it is shown that the fit indices may complement the usual geometric interpretation of the unconstrained correspondence analysis solution in low-dimensional space.     

Tree-Oriented Analysis of Brain Artery Structure

Statistical analysis of magnetic resonance angiography (MRA) brain artery trees is performed using two methods for mapping brain artery trees to points in phylogenetic treespace: cortical landmark correspondence and descendant correspondence. The differences in end-results based on these mappings are highlighted to emphasize the importance of correspondence in tree-oriented data analysis. Representation of brain artery systems as points in phylogenetic treespace, a mathematical space developed in (Billera et al. Adv. Appl. Math 27:733–767, 2001), facilitates this analysis. The phylogenetic treespace is a rich setting for tree-oriented data analysis. The Fréchet sample mean or an approximation is reported. Multidimensional scaling is used to explore structure in the data set based on pairwise distances between data points. This analysis of MRA data shows a statistically significant effect of age and sex on brain artery structure. Variation in the proximity of brain arteries to the cortical surface results in strong statistical difference between sexes and statistically significant age effect. That particular observation is possible with cortical correspondence but did not show up in the descendant correspondence.     

Finding trajectories of feature points in a monocular image sequence

Identifying the same physical point in more than one image, the correspondence problem, is vital in motion analysis. Most research for establishing correspondence uses only two frames of a sequence to solve this problem. By using a sequence of frames, it is possible to exploit the fact that due to inertia the motion of an object cannot change instantaneously. By using smoothness of motion, it is possible to solve the correspondence problem for arbitrary motion of several nonrigid objects in a scene. We formulate the correspondence problem as an optimization problem and propose an iterative algorithm to find trajectories of points in a monocular image sequence. A modified form of this algorithm is useful in case of occlusion also. We demonstrate the efficacy of this approach considering synthetic, laboratory, and real scenes.     

Multiple factor analysis and clustering of a mixture of quantitative, categorical and frequency data

Analysing and clustering units described by a mixture of sets of quantitative, categorical and frequency variables is a relevant challenge. Multiple factor analysis is extended to include these three types of variables in order to balance the influence of the different sets when a global distance between units is computed. Suitable coding is adopted to keep as close as possible to the approach offered by principal axes methods, that is, principal component analysis for quantitative sets, multiple correspondence analysis for categorical sets and correspondence analysis for frequency sets. In addition, the presence of frequency sets poses the problem of selecting the unit weighting, since this is fixed by the user (usually uniform) in principal component analysis and multiple correspondence analysis, but imposed by the table margin in correspondence analysis. The method's main steps are presented and illustrated by an example extracted from a survey that aimed to cluster respondents to a questionnaire that included both closed and open-ended questions.     

A method for system reliability analysis with change-over operation

Abstract

When fault tree analysis (FTA) is used in analysing the system reliability including human functions, the correspondence between an abnormal event and the human reaction against it may become ambiguous. In order to supplement this defect, a case study has been conducted in this research to develop a new technique termed ‘Corrective Operation Diagram Analysis’, and an attempt has been made to establish the correspondence between the reliability analysis of equipment/hardware using FTA and human reliability analysis.     

Exploring contingency tables with correspondence analysis

An algorithm for correspondence analysis is described and implemented in SAS/IML (SAS Institute, 1985a). The technique is shown, through the analysis of several biological examples, to supplement the log-linear models approach to the analysis of contingency tables, both in the model identification and model interpretation stages of analysis. A simple two-way contingency table of tumor data is analyzed using correspondence analysis. This example emphasises the relationships between the parameters of the log-linear model for the table and the graphical correspondence analysis results. The technique is also applied to a three-way table of survey data concerning ulcer patients to demonstrate applications of simple correspondence analysis to higher dimensional tables with fixed margins. Finally, the diets and foraging behaviors of birds of the Hubbard Brook Forest are each analyzed and then a simultaneous display of the two separate but related tables is constructed to highlight relationships between the tables.     

A Survey on Shape Correspondence

We review methods designed to compute correspondences between geometric shapes represented by triangle meshes, contours or point sets. This survey is motivated in part by recent developments in space–time registration, where one seeks a correspondence between non‐rigid and time‐varying surfaces, and semantic shape analysis, which underlines a recent trend to incorporate shape understanding into the analysis pipeline. Establishing a meaningful correspondence between shapes is often difficult because it generally requires an understanding of the structure of the shapes at both the local and global levels, and sometimes the functionality of the shape parts as well. Despite its inherent complexity, shape correspondence is a recurrent problem and an essential component of numerous geometry processing applications. In this survey, we discuss the different forms of the correspondence problem and review the main solution methods, aided by several classification criteria arising from the problem definition. The main categories of classification are defined in terms of the input and output representation, objective function and solution approach. We conclude the survey by discussing open problems and future perspectives.     

A Method for Improving String Pattern Matching Machines

This correspondence describes an efficient string pattern matching machine to locate all occurrences of any of a finite number of keywords and phrases in an arbitrary text string. Some conditions are defined on the states of the machine in order to improve the speed and size of the machine by Aho and Corasick [1]. The pattern matching algorithm is partitioned into various cases by combining these conditions. Finally, the correspondence illustrates the proposed approach by applying it to the analysis of the machines for a simple search.     

Morphable Surface Models

We describe a novel automatic technique for finding a dense correspondence between a pair of n-dimensional surfaces with arbitrary topologies. This method employs a different formulation than previous correspondence algorithms (such as optical flow) and includes images as a special case. We use this correspondence algorithm to build Morphable Surface Models (an extension of Morphable Models) from examples. We present a method for matching the model to new surfaces and demonstrate their use for analysis, synthesis, and clustering.