Preventive replacement policies with time of operations,mission durations,minimal repairs and maintenance triggering approaches

When a mission arrives at a random time and lasts for a duration, it becomes an interesting problem to plan replacement policies according to the health condition and repair history of the operating unit, as the reliability is required at mission time and no replacement can be done preventively during the mission duration. From this viewpoint, this paper proposes that effective replacement policies should be collaborative ones gathering data from time of operations, mission durations, minimal repairs and maintenance triggering approaches. We firstly discuss replacement policies with time of operations and random arrival times of mission durations, model the policies and find optimum replacement times and mission durations to minimize the expected replacement cost rates analytically. Secondly, replacement policies with minimal repairs and mission durations are discussed in a similar analytical way. Furthermore, the maintenance triggering approaches, i.e., replacement first and last, are also considered into respective replacement policies. Numerical examples are illustrated when the arrival time of the mission has a gamma distribution and the failure time of the unit has a Weibull distribution. In addition, simple case illustrations of maintaining the production system in glass factories are given based on the assumed data.     

基于事例学习的建筑结构的虚拟实现

提出基于事例学习的目标规划问题,并进一步研究了建模思想的可行性和建模方法的可操作性。利用知识工程、机器学习理论,人工智能技术来存贮和运用专家的经验,实现了在虚拟环境中建筑结构设计、施工,设备的仿真试验,并可对初学者或尚无经验的设计、施工者进行培训学习。该项研究为目标规划问题开辟了基于事例学习的模型生成途径。     

A stochastic realization algorithm via block LQ decomposition in Hilbert space

A stochastic realization problem of a stationary stochastic process is re-visited, and a new stochastically balanced realization algorithm is derived in a Hilbert space generated by second-order stationary processes. The present algorithm computes a stochastically balanced realization by means of the singular value decomposition of a weighted block Hankel matrix derived by a “block LQ decomposition”. Extension to a stochastic subspace identification method explains how the proposed abstract algorithm is implemented in system identification.     

Maximum Cardinality Search for Computing Minimal Triangulations of Graphs

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.     

Some results on generalized residual entropy

Shannon’s entropy plays an important role in the context of information theory. Since this entropy is not applicable to a system which has survived for some units of time, the concept of residual entropy has been developed in the literature. Here we generalize the residual entropy by choosing a convex function ? with ?(1) = 0. In this paper, some orderings and aging properties have been defined in terms of the generalized residual entropy function and their properties have been studied. Quite a few results available in the literature have been generalized and some distributions (viz. uniform, exponential, Pareto, power series, finite range) have been characterized through the generalized residual entropy.     

某半导体产品的设计和快速实现研究

研究了产品开发及快速实现过程中任务获取、任务分配、进度的协调、信息传输等相关问题,并以某半导体产品为例,进行了产品的设计和快速实现,为缩短产品开发和上市周期、提高产品的市场竞争力积累经验。     

静电火灾的产生及其防治

文章详细分析了静电产生的机理，指出积聚静电电荷的多少与材料的电阻率和介电常数有关。讨论了静电火灾发生的条件，指出静电火灾的发生具有隐蔽性、复杂性和突发性。但只要对其规律进行深入地研究，可以找到有效地防止静电火灾发生的办法。     

Bridging the generation gap between text planning and linguistic realization

Text planning is traditionally done as a separate process, independent of linguistic realization. However, I show in this paper that it is essential for a text planner to know the linguistic consequences of its actions. The choice of how to realize an element affects how much information is conveyed (e.g., “Floyd arrived safely in Boston” vs. “Floyd landed safely at Logan”) and what other information can be added (e.g., “Peter was deciding for an hour” vs. *“Peter made a decision for an hour”). The choice of realization also affects how the relative salience of the elements being expressed will be perceived (e.g., “The green car is in the garage” vs. “The car in the garage is green”). I have defined an intermediate level of representation for text planning, called the Text Structure. It is an abstract linguistic level that reflects germane linguistic constraints while abstracting away from syntactic detail. This representation allows the text planner to have greater control over the decisions, so that it can take advantage of the expressiveness of language to convey subtleties of meaning. More importantly, the Text Structure allows the generation process overall to be incremental, since it ensures that the text plan being composed will always be expressible in the language. La planification de textes est habituellement réalisée séparément, sans tenir compte de la réalisation linguistique. Cependant, ľauteur demontre dans cet article qu'il est essentiel à un planificateur de textes de connai̊tre les conséquences linguistiques de ses actions. Le choix de la méhode de réalisation ?un élément influe sur la quantité?informations qui est transmise (par ex.: 〈〈 Floyd est arrivé sain et sauf à Boston 〉〉 et 〈〈 Floyd a atterri sain et sauf àľaéroport Logan 〉〉) et sur quelle autre information peut ětre ajoutée. Le choix de la méthode de réalisation influe également sur la façon dont les caractères saillants des ééments qui sont exprimés seront perçus (par ex.: 〈〈 la voiture verte est dans le garage 〉〉 et 〈〈 la voiture dans le garage est verte 〉〉). L'auteur a défini un niveau intérmediaire de représentation pour la planification de textes qu'il a appelé structure de texte. Il; s'agit ?'un niveau linguistique abstrait qui refléte les contraintes linguistiques appropriées tout en s'éloignant du détail syntaxique. Cette représentation permet au planificateur de textes ?avoir un meilleur contrǒle des décisions, et done de tirer profit de la force ?expression du langage afin de tenir compte des subtiliés de sens. Plus important encore, la structure de texte permet au processus de génération ?ětre incrémentiel, car elle s'assure que le plan de texte en voie de composition soit toujours exprimable dans le langage.     

The Problem of Estimating the Uncertainty of the Fixed Point Temperature Due to the Presence of Impurities

The main problems in estimating the uncertainty due to the presence of impurities in the material: the absence in the documents of a unique definition of the quantity being measured – the fixed point temperature, the lack of agreed methods of realizing the fixed points and the insufficient justification of the equations used for the estimate, are analyzed. The results of a measurement of the melting point of gallium are presented, which differ in the conditions in which they were realized – with one and two liquid-solid interfaces and different solidification conditions, are presented. The reasons for the considerable difference between the values of the temperatures obtained in these experiments are discussed.     

数字振荡器的实现原理与仿真编程

鉴于数字信号处理中的实时应用问题，探讨了数字滤波器的实时实现原理，包括离散时间网络结构的作用和离散时间信号处理的特点，重点介绍了实时应用中实现数字滤波器的基本思想，运用MATLAB和所导出的通用数字振荡器的系统函数对一个非正弦数字振荡器进行了仿真编程，还讨论了有关实时处理的几个重要的系统性质，表达了作者对于当前学习和应用数字信号处理方法的观点。