有19-(4,f)型自同构的二元自对偶码

应用二元自对偶码可看成几个自对偶码的直和理论,研究了具有19-(4,f)型自同构、码长在100以内的的二元自对偶码。这种对偶码都可看成一个码长为4的收缩码和GF(2)n上一些偶重量多项式的直和。证明了码长大于80且小于100时,不存在19-(4,f)型的二元自对偶码。根据码长较短的自对偶码分别构造出了码长为76、78和80的二元自对偶码,并给出其生成矩阵。由码的等价得到了这几类码可能的分类情况。运行Matlab程序,证明了具有19-(4,2)型和19-(4,4)型的二元自对偶码在等价情况下都有11个,19-(4,0)型的二元自对偶码在等价情况下是不存在的。     

State and Output Feedback Certainty Equivalence M‐MRAC for Systems with Unmatched Uncertainties

The paper presents a certainty equivalence indirect adaptive control design method for parametric strict feedback nonlinear systems of any relative degree with unmatched uncertainties in state and output feedback settings. The approach is based on the parameter identification (estimation) model, which is completely separated from the control design and is capable of producing parameter estimates as fast as the computing power allows. It is shown that the system's input and output tracking errors can be systematically decreased by the proper choice of the design parameters.     

Not All Sources Are Created Equal: Student Research,Source Equivalence

ABSTRACT

With the emergence of the browser searchable Internet in the early 1990s, accessing the World Wide Web has become commonplace. In regards to its impact on student research, current undergraduates have become savvy searchers when it comes to accessing and integrating Internet documents into their research papers. However, this ease of use has come at a price. The overall quality of research being submitted by our students has suffered. Many incoming undergraduates don't make the distinction between documents located via a typical Internet search engine and full-text information generated from academic proprietary databases housed on the library's home page.     

Computing the Maximum Degree of Minors in Matrix Pencils via Combinatorial Relaxation

   Abstract. This paper presents a new algorithm for computing the maximum degree δ _k (A) of a minor of order k in a matrix pencil A(s) . The problem is of practical significance in the field of numerical analysis and systems control. The algorithm adopts a general framework of ``combinatorial relaxation' due to Murota. It first solves the weighted bipartite matching problem to obtain an estimate

Conceptual equivalence for contrast mining in classification learning

Learning often occurs through comparing. In classification learning, in order to compare data groups, most existing methods compare either raw instances or learned classification rules against each other. This paper takes a different approach, namely conceptual equivalence, that is, groups are equivalent if their underlying concepts are equivalent while their instance spaces do not necessarily overlap and their rule sets do not necessarily present the same appearance. A new methodology of comparing is proposed that learns a representation of each group’s underlying concept and respectively cross-exams one group’s instances by the other group’s concept representation. The innovation is fivefold. First, it is able to quantify the degree of conceptual equivalence between two groups. Second, it is able to retrace the source of discrepancy at two levels: an abstract level of underlying concepts and a specific level of instances. Third, it applies to numeric data as well as categorical data. Fourth, it circumvents direct comparisons between (possibly a large number of) rules that demand substantial effort. Fifth, it reduces dependency on the accuracy of employed classification algorithms. Empirical evidence suggests that this new methodology is effective and yet simple to use in scenarios such as noise cleansing and concept-change learning.     

社会网络信息的本体论建模与可视化

本体论是共享概念模型的明确的形式化规范说明,基于本体论对社会网络信息建模能够提供客观存在的本质认识,发挥本体论在信息表示与组织上的优势.提出一种针对社会网络信息的领域本体模型,将社会网络信息领域的客观存在抽象为3个主要本体:行动者、关系网络和群组,能够方便地定义各种社会网络分析与可视化方法,为社会网络信息可视化应用提供支持.着眼于社会网络结构分析中的需求,在上述模型框架下提出了基于规则对等组的群组分析方法和基于群组、角色分析的力导引布点算法.最后结合恐怖活动信息可视化实例,阐述了文中提出的领域模型与可视化方法的应用.     

A static view of localities

This paper proposes alternative, effective characterizations for nets of automata of the location equivalence and preorder presented by Boudol et al. in the companion paper [BCHK]. Contrary to the technical development in the above given reference, where locations are dynamically associated to the subparts of a process in the operational semantics, the equivalence and preorder we propose are based on a static association of locations to the parallel components of a net. Following this static approach, it is possible to give these distributed nets a standard operational semantics which associates with each net a finite labelled transition system. Using this operational semantics for distributed nets, we introduce effective notions of equivalence and preorder which are shown to coincide with those proposed in [BCHK].     

适用于次同步振荡分析的直驱式风电场等值方法

为解决大规模直驱式风电场阻抗建模困难和数值仿真节点限制的问题,基于阻抗分析法的核心原理,以等值前、后直驱式风电场外阻抗特性相一致为目标,提出了适用于次同步振荡分析的直驱式风电场等值方法。该方法包括基于阻抗灵敏度分析的分群聚合和基于遗传算法的等值降阶2个步骤。分别以风电场含相同型号直驱风机和不同型号直驱风机为例,对等值前、后的直驱式风电场外阻抗特性进行对比分析。结果表明,所提方法能够实现大规模直驱式风电场模型的等值降阶,等值前、后的直驱式风电场外阻抗特性较为接近,其等值误差能够被量化。     

The subsequence composition of a string

Words that appear as constrained subsequences in a text-string are considered as possible indicators of the host string structure, hence also as a possible means of sequence comparison and classification. The constraint consists of imposing a bound on the number ω$\omega$ of positions in the text that may intervene between any two consecutive characters of a subsequence. A subset of such ω$\omega$-sequences is then characterized that consists, in intuitive terms, of sequences that could not be enriched with more characters without losing some occurrence in the text. A compact spatial representation is then proposed for these representative sequences, within which a number of parameters can be defined and measured. In the final part of the paper, such parameters are empirically analyzed on a small collection of text-strings endowed with various degrees of structure.