Analysis of oceanaut operating performance using an integrated Bayesian network aided by the fuzzy logic theory

Because the oceanaut plays a significant role in safety and capability during manned deep-diving scientific tasks, preventing oceanaut performance decline is of paramount importance. However, the factors responsible for oceanaut performance are almost entirely unexplored. To address the preceding issues, a quantitative method of fuzzy integrated Bayesian network (FIBN) was modeled within the limits of oceanaut operating procedures. To quantify the probabilities of the influencing factors, the probability of each node in the FIBN was calculated using integrated expert judgement, fuzzy logic theory, and Bayesian network. By considering a total of 28 factors related to oceanaut performance in the “Jiaolong” manned submersible, this study found that difficult sampling, long sampling times, cabin equipment failure, oceanaut physical decline, and declining decision-making ability are important factors that affect oceanaut performance. The FIBN proposed in our study fused the qualitative and quantitative methods and can be developed into a versatile tool for analysis of comprehensive systems that contain both static and dynamic factors.Relevance to industryThe results provide a powerful basis for the design of manned submersible and assignment of tasks to oceanauts, while the fuzzy integrated Bayesian network (FIBN) method proposed can be effectively applied to various quantitative assessment fields which direct researchers to deal with analysis problems of complex systems.     

基于强跟踪滤波器的开关变换器故障诊断

Buck变换器又称降压变换器、串联开关稳压电源、三端开关型降压稳压器。广泛用于计算机、家用电器、控制系统和通信系统中的电源几乎都是开关电源,具有超快速负载动态响应、高功率变换效率、高功率密度、低电压、大电流的特性.开关变换器作为它的主要电路,故障率较高,对它故障诊断研究是有意义的。基于强跟踪滤波理论,给出了一种开关变换器电路故障实时诊断的一种方法。该方法以建立一种开关变换器电路状态空间模型为基础,利用强跟踪滤波器对电路状态及元件参数进行估计,当元件参数发生软、硬型故障时,根据强跟踪滤波器对元件参数的跟踪结果及修正的Bayes分类算法,可实时诊断开关变换器电路中的元件故障。仿真结果证明了该方法的有效性。     

Contrast‐enhanced wide‐angle high‐speed polarization modulator for active‐retarder 3‐D displays

Abstract— A contrast‐enhanced wide‐angle high‐speed polarization modulator for active‐retarder 3‐D displays is proposed. By using a double liquid‐crystal‐cell structure together with a dedicated driving scheme and an external quarter‐wave retarder, a high‐performance modulator can be realized, resulting in minimized brightness loss and low cross‐talk levels in fast‐refresh time‐multiplexed 3‐D displays.     

OAZE: A network-friendly distributed zapping system for peer-to-peer IPTV

IPTV systems attracting millions of users are now commonly deployed on peer-to-peer (P2P) infrastructures and provide an appealing alternative to multicast-based systems. Typically, a P2P overlay network is associated with each channel, composed of users who receive, watch and redistribute this channel. Yet, channel surfing (aka as zapping) involves switching overlays and may introduce delays, potentially hurting the user experience when compared to multicast-based IPTV. In this paper, we present a distributed system called OAZE (Overlay Augmentation for Zapping Experience) which speeds up the switching process and reduces the overall cross-domain traffic generated by the IPTV system. In OAZE, each peer maintains connections to other peers, not only in a given channel, but also in a subset of all channels to which the associated user is likely to zap. More specifically, we focus on the channel assignment problem, i.e. determining, in a given P2P overlay, the optimal distribution of the responsibility to maintain contact peers to other channels. We propose an approximate algorithm providing guaranteed performances, and a simpler and more practical one. Our experimental results show that OAZE leads to substantial improvements on the connections between peers, resulting in less switching delay and lower network cost; it then represents an appealing add-on for existing P2P IPTV systems.     

CLP(ℜ) and some electrical engineering problems

The Constraint Logic Programming Scheme defines a class of languages designed for programming with constraints using a logic programming approach. These languages are soundly based on a unified framework of formal semantics. In particular, as an instance of this scheme with real arithmetic constraints, the CLP() language facilitates and encourages a concise and declarative style of programming for problems involving a mix of numeric and non-numeric computation.In this paper we illustrate the practical applicability of CLP() with examples of programs to solve electrical engineering problems. This field is particularly rich in problems that are complex and largely numeric, enabling us to demonstrate a number of the unique features of CLP(). A detailed look at some of the more important programming techniques highlights the ability of CLP() to support well-known, powerful techniques from constraint programming. Our thesis is that CLP() is an embodiment of these techniques in a language that is more general, elegant and versatile than the earlier languages, and yet is practical.An earlier version of this paper appeared in the proceedings of the 4th International Conference on Logic Programming, Melbourne, May 1987. Much of this work was carried out while the authors were at Monash University, Melbourne, Australia.     

Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization

Certain tasks, such as formal program development and theorem proving, fundamentally rely upon the manipulation of higher-order objects such as functions and predicates. Computing tools intended to assist in performing these tasks are at present inadequate in both the amount of knowledge they contain (i.e., the level of support they provide) and in their ability to learn (i.e., their capacity to enhance that support over time). The application of a relevant machine learning technique—explanation-based generalization (EBG)—has thus far been limited to first-order problem representations. We extend EBG to generalize higher-order values, thereby enabling its application to higher-order problem encodings.Logic programming provides a uniform framework in which all aspects of explanation-based generalization and learning may be defined and carried out. First-order Horn logics (e.g., Prolog) are not, however, well suited to higher-order applications. Instead, we employ Prolog, a higher-order logic programming language, as our basic framework for realizing higher-order EBG. In order to capture the distinction between domain theory and training instance upon which EBG relies, we extend Prolog with the necessity operator of modal logic. We develop a meta-interpreter realizing EBG for the extended language, Prolog, and provide examples of higher-order EBG.     

A Universal Method of Scientific Inquiry

A paradigm of scientific discovery is defined within a first-order logical framework. Within this paradigm, the concept of successful scientific inquiry is formalized and investigated. Among other results, it is shown that a simple method of scientific inquiry is universal in the sense that it leads to success on every problem for which success is in principle possible.     

Modal logic as metalogic

The goal of this paper is to show how modal logic may be conceived as recording the derived rules of a logical system in the system itself. This conception of modal logic was propounded by Dana Scott in the early seventies. Here, similar ideas are pursued in a context less classical than Scott's.First a family of propositional logical systems is considered, which is obtained by gradually adding structural rules to a variant of the nonassociative Lambek calculus. In this family one finds systems that correspond to the associative Lambek calculus, linear logic, relevant logics, BCK logic and intuitionistic logic. Above these basic systems, sequent systems parallel to the basic systems are constructed, which formalize various notions of derived rules for the basic systems. The deduction theorem is provable for the basic systems if, and only if, they are at least as strong as systems corresponding to linear logic, or BCK logic, depending on the language, and their deductive metalogic is not stronger than they are.However, though we do not always have the deduction theorem, we may always obtain a modal analogue of the deduction theorem for conservative modal extensions of the basic systems. Modal postulates which are necessary and sufficient for that are postulates of S4 plus modal postulates which mimic structural rules. For example, the modal postulates which Girard has recently considered in linear logic are necessary and sufficient for the modal analogue of the deduction theorem.All this may lead towards results about functional completeness in categories. When functional completeness, which is analogous to the deduction theorem, fails, we may perhaps envisage a modal analogue of functional completeness in a modal category, of which our original category is a full subcategory.     

The quantifier structure of sentences that characterize nondeterministic time complexity

For every nondeterministic Turing machineM of time complexityT(n), there is a second-order sentence of a very restricted form, whose set of finite models encodes the set of strings recognized byM. Specifically, has a relational symbol which is interpreted as addition restricted to finite segments of the natural numbers, and a prefix consisting of existentially quantified unary second-order variables followed by a universal-existential first-order part. Here, every input stringx is encoded by a model of sizeT(|x|). Using a closely related encoding of strings as models where the size of the model is the length of the string, a consequence is that ifT(n)=n ^d, then there is a sentence with a similar prefix but whose second-order variables ared-ary and whose finite models encode the strings accepted byM. Potential applications to low-level complexity are discussed.