Numerical simulation of typical contact situations of brake friction materials

In the paper, a model typical for contact situations of automotive brakes is established based on the method of movable cellular automata. The processes taking place at local contacts in an automotive brake system are analysed. Based on microscopic and micro-analytical observations, the following contact situations were simulated: (i) a couple of ferritic steel against pearlitic steel, both covered by an oxide layer mixed with graphite nanoparticles and (ii) the same situation but without oxide layers. The results of calculated mean coefficients of friction of the oxide-on-oxide contact correspond well to expected values for a real braking system, whereas steel-on-steel contact are twice as high. This allows one to make some conclusions; for example, oxide formation will take place more quickly than friction layer elimination, and finally this is responsible for the stabilisation of the coefficient of friction.     

从水淬渣中回收镓的试验研究

对鼓风炉（ISP法）或烟化炉水淬渣中回收镓的工艺进行了研究。结果表明，利用浓硫酸恒温熟化的独特浸出工艺，克服硅对液固分离的影响；以伯胺N9123作为萃取剂在硫酸介质中萃取镓；获得了含镓品位为2.82%的富集物。     

Obtaining shorter regular expressions from finite-state automata

We consider the use of state elimination to construct shorter regular expressions from finite-state automata (FAs). Although state elimination is an intuitive method for computing regular expressions from FAs, the resulting regular expressions are often very long and complicated. We examine the minimization of FAs to obtain shorter expressions first. Then, we introduce vertical chopping based on bridge states and horizontal chopping based on the structural properties of given FAs. We prove that we should not eliminate bridge states until we eliminate all non-bridge states to obtain shorter regular expressions. In addition, we suggest heuristics for state elimination that leads to shorter regular expressions based on vertical chopping and horizontal chopping.     

Model checker aided design of a controller for a wafer scanner

For a case-study of a wafer scanner from the semiconductor industry it is shown how model checking techniques can be used to compute (1) a simple yet optimal deadlock avoidance policy, and (2) an infinite schedule that optimizes throughput. in the absence of errors. Deadlock avoidance is studied based on a simple finite state model using Smv, and for throughput analysis a more detailed timed automaton model has been constructed and analyzed using the Uppaal tool. The Smv and Uppaal models are formally related through the notion of a stuttering bisimulation. The results were obtained within 2 weeks, which confirms once more that model checking techniques may help to improve the design process of realistic, industrial systems. Methodologically, the case study is interesting since two models were used to obtain results that could not have been obtained using only a single model. Supported by the European Community Project IST-2001-35304 (Ametist), http://ametist.cs.utwente.nl/.     

A hybrid PC/PLC architecture for manufacturing-system control—theory and implementation

This paper presents a novel and generic PC/PLC-based software/hardware architecture for the control of flexible manufacturing workcells. The proposed implementation methodology is based on the utilization of any one of the available formal discrete-event-system control theories in conjunction with state-of-the-art industrial programmable-logic controllers (PLCs). The methodology has been illustrated to be a viable technique through its actual implementation in our laboratory using a robotic-workcell testbed. The specific control theory used is a combination of Extended Moore Automata and Ramadge-Wonham Automata that has been developed by our research group. The modular control software architecture has been developed for MS-Windows environments (running on one PC interfaced to the PLCs) and allows the use of different formal control theories as well as different commercial PLC hardware. The effective graphical user interface provides a transparent programming environment, where users are not expected to have a full knowledge of the formal control theory used.     

Cellular automata model of gravity-driven granular flows

A cellular automata model is used to simulate a variety of granular chute flows. The model is tested against several case studies: flow down a chute, flow past an obstacle, chute flow in which complex, counter-rotating vortices result in streamwise surface stripes and flow near a boundary. The model successfully reproduces experimental observations in all of these cases. These results lead us to propose that simple, rule-based, models such as this can improve our detailed understanding of dynamics and flow within an opaque granular bed.     

XML schema, tree logic and sheaves automata

XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we define a new class of automata for unranked trees that provides decision procedures for the basic questions about SL: model-checking; satisfiability; entailment. The same class of automata is also used to answer basic questions about WXS, including recursive schemas: decidability of type-checking documents; testing the emptiness of schemas; testing that a schema subsumes another one.This work was partially supported by the French government research grant ACI TRALALA and by IST Global Computing Profundis.     

专家系统技术在采煤决策及设备选型的应用

专家系统的研究越来越受到人们的重视，它在综合机械化采煤中的应用刚刚起步，文章详细地论述了ＺＪＸＴ系统的知识获取与知识库构造，推理机的特点及系统的功能。     

Cryptanalysis of an involutional block cipher using cellular automata

In 2006, an involutional block cipher using cellular automata was proposed. A self-invertible CA-based structure allows for an efficient hardware implementation. This paper analyzes the insecurity of the cipher due to its conjugate property. The results of this study will make it possible to construct a decryption process without knowledge of the secret key.