基于IEEE1232的故障树诊断模型研究

IEEE1232对广义测试环境下的诊断知识进行了标准化描述,从而保证了诊断知识和数据的可移植和互操作;故障树分析作为被广泛应用的故障诊断方法,却很少有标准像IEEE1232一样对其具体应用进行详细规范,因此分析建立基于该标准的故障树诊断模型,是将其运用到实际故障树分析中的重中之重;首先介绍了IEEE1232标准及其模型构成,然后分析了其中一些公用模型元素的具体含义和用法;对于标准中关于故障树的描述,深入研究了其构成要素及有效的使用方法,并建立了基于这些要素的故障树诊断模型;最后给出了由EXPRESS语言描述的可交换故障树模型文件例子。     

Students’ multilingual repertoires-in-use for meaning-making: Contrasting case studies in three multilingual constellations

Mathematics education for multilingual classrooms calls for instructional approaches that build upon students’ multilingual resources. However, so far, students’ multilingual resources and the interplay of their components have only partly been disentangled and rarely compared between different multilingual contexts. This article suggests a conceptualization of multilingual repertoires-in-use as characterized by (a) what students use of certain languages, registers, and representations as sources for meaning-making in mathematics classrooms and (b) their processes of how they connect certain languages, registers, and representations. This qualitative learning-process study compares students’ multilingual repertoires-in-use in three contexts: Spanish-speaking foreign language learners of German in Colombia, Turkish- and German-speaking students born in Germany, and Arabic-speaking German language beginners recently immigrated to Germany. The analysis reveals the biggest differences not only in what the students use, but how they connect languages, registers, and representations. Some of these differences can partly be traced back to different classroom cultural practices. These findings suggest extending the conceptual framework for multilingual repertoires-in-use and including it in a social theoretical perspective. Thus, these findings have important practical consequences for multilingual mathematics classrooms: The instructional approach of relating languages, registers, and representations needs to be applied more flexibly, taking into account students’ different starting points. When doing so, students’ connection processes should be supported and explicated more systematically in order to fully exploit the students’ repertoires.     

DeepAdd: Protein function prediction from k-mer embedding and additional features

With the application of new high throughput sequencing technology, a large number of protein sequences is becoming available. Determination of the functional characteristics of these proteins by experiments is an expensive endeavor that requires a lot of time. Furthermore, at the organismal level, such kind of experimental functional analyses can be conducted only for a very few selected model organisms. Computational function prediction methods can be used to fill this gap. The functions of proteins are classified by Gene Ontology (GO), which contains more than 40,000 classifications in three domains, Molecular Function (MF), Biological Process (BP), and Cellular Component (CC). Additionally, since proteins have many functions, function prediction represents a multi-label and multi-class problem. We developed a new method to predict protein function from sequence. To this end, natural language model was used to generate word embedding of sequence and learn features from it by deep learning, and additional features to locate every protein. Our method uses the dependencies between GO classes as background information to construct a deep learning model. We evaluate our method using the standards established by the Computational Assessment of Function Annotation (CAFA) and have noticeable improvement over several algorithms, such as FFPred, DeepGO, GoFDR and other methods compared on the CAFA3 datasets.     

基于虚拟样机的回旋加速器主磁铁设计与修正

磁铁设计对于等时性回旋加速器极为关键。磁场分布需要满足粒子等时性加速和粒子径向、轴向聚集要求,同时避免危险的横向共振。提出了一种计算机辅助的自动化磁铁设计、建模和修正的方法,该方法在基于Python混合编程的虚拟样机集成设计环境中实现。详细描述了利用3维电磁场仿真软件TOSCA和自主开发的粒子束跟踪软件PTP对磁铁的优化过程,并给出了一个16 MeV负氢紧凑型回旋加速器的主磁铁设计实例。     

Exact enumeration of acyclic deterministic automata

A linear recurrence relation is derived for the number of unlabelled initially connected acyclic automata. The coefficients of this relation are determined by another, alternating, recurrence relation. The latter determines, in particular, the number of acyclic automata with labelled states. Certain simple enumerative techniques developed by the author for counting initially connected automata and acyclic digraphs are combined and applied. Calculations show that the results obtained in this paper improve recent upper bounds for the number of minimal deterministic automata (with accepting states) recognizing finite languages. Various related questions are also discussed.     

A theory,implementation and applications of human-like understanding

Operation logic is a formal logic with well-defined formulas as semantic language clauses and with modus ponens rules as a method of reasoning. Operation logic can be implemented on any database management system (as the so-called OLS) having a universal general knowledge database and enabling understanding of data stored in the database. Semantic language clauses have necessary and sufficient properties for being able to describe any process in the world. Semantic language is the deepest level of any natural language, the level of data storing, understanding and reasoning. OLS can be a tool for studying implementation possibilities of human-like consciousness, for building artificial experts and artificial encyclopedias and for constructing semantic mathematical theories of anthropoecosystems (which is such an exact theory that qualitative information can be used with meaning completely defined by the user). In the paper the theory (and complete information enabling implementation) is presented for human-like understanding, topic-focus division of clauses, for human-like problem solving (program synthesis and verification) and for semantic mathematical analyses. Many examples are presented.     

22号初等元胞自动机的演化复杂性

Cellular automata are the discrete dynamical systems of simple construction but with complex and varied behaviors. In this paper, the elementary cellular automaton of rule 22 is studied by the tools of formal language theory and symbolic dynamics. Its temporal evolution orbits are coarse-grained into evolution sequences and the evolution languages are defined. It is proved that for every n≥2 its width n evolution language is not regular.