A generalized setting for fixpoint theory

The mathematical semantics of programming languages is based largely on certain algebraic structures, usually complete lattices or complete partial orders. The usefulness of these structures is based on the existence of fixpoints of functions defined on the structures, and the fact that these classes of structures are closed under such operations as taking cross-products, disjoint unions or function spaces.This paper proposes more general versions of these structures which still retain the above desirable properties. Thus the techniques of mathematical semantics should become applicable in a wider context than heretofore.One important application is given, which in fact motivated the whole development. It is shown that in the generalized setting the existence of unique minimal solutions for recursive definitions of functions are guaranteed without having to resort to informal arguments of any sort.     

一种有机质谱检索的匹配算法

本文针对现有质谱匹配算法在实现物质的相似性检索方面存在的问题,提出了以权重m/z·I为峰的重要性因子的质谱匹配新算法。该算法充分强调了m/z和I的重要性,其权重能很好的反映谱图的特征。将该算法应用在NIST02谱库的检索中,其检索结果令人满意。     

A new approach for generation of generalized basic probability assignment in the evidence theory

Pattern Analysis and Applications - The process of information fusion needs to deal with a large number of uncertain information with multi-source, heterogeneity, inaccuracy, unreliability, and...     

频谱分析仪混频原理深层解析

为了更好的学习、理解及使用频谱分析仪,本文从频谱仪前端的混频器着手,依频段从低到高划分为三部分,重点分析了各个频段混频的原理及特点。并就其混频实现方法进行了详细的比较说明。     

Elements of generalized ultrametric domain theory

Generalized ultrametric spaces are a common generalization of preorders and ordinary ultrametric spaces, as was observed by Lawvere (1973). Guided by his enriched-categorical view on (ultra)metric spaces, we generalize the standard notions of Cauchy sequence and limit in an (ultra)metric space, and of adjoint pair between preorders. This leads to a solution method for recursive domain equations that combines and extends the standard order-theoretic (Smyth and Plotkin, 1982) and metric (America and Rutten, 1989) approaches.     

A comprehensive comparison between generalized incidence calculus and the Dempster-Shafer theory of evidence

Dealing with uncertainty problems in intelligent systems has attracted a lot of attention in the AI community. Quite a few techniques have been proposed. Among them, the Dempster-Shafer theory of evidence (DS theory) has been widely appreciated. In DS theory, Dempster's combination rule plays a major role. However, it has been pointed out that the application domains of the rule are rather limited and the application of the theory sometimes gives unexpected results. We have previously explored the problem with Dempster's combination rule and proposed an alternative combination mechanism in generalized incidence calculus. In this paper we give a comprehensive comparison between generalized incidence calculus and the Dempster-Shafer theory of evidence. We first prove that these two theories have the same ability in representing evidence and combining DS-independent evidence. We then show that the new approach can deal with some dependent situations while Dempster's combination rule cannot. Various examples in the paper show the ways of using generalized incidence calculus in expert systems.     

A Fuzzy set based approach to generalized landscape theory of aggregation

In this paper, we firstly reformulate the landscape theory of aggregation (Axelrod and Bennett, 1993) in terms of an optimization problem, and then straightforwardly propose a fuzzy-set-theoretic based extension for it. To illustrate efficiency of the proposal, we make a simulation with the proposed framework for the international alignment of the Second World War in Europe. It is shown that the obtained results are essentially comparable to those given by the original theory. Consequently, the fuzzy-set-theoretic based extension of landscape theory can allow us to analyze a wide variety of aggregation processes in politics, economics, and society in a more flexible manner. Shigemasa Suganuma: He received the M.S. degree in knowledge science from Japan Advanced Institute of Science and Technology,, Ishikawa, Japan in 2000. He currently takes a doctor's course in School of Knowledge Science, Japan Advanced Institute of Science and Technology (JAIST). His research interest includes agent based simulation and its application to social and political concerns, industry and environmental behavior. Van-Nam Huynh, Ph.D.: He received the B.S. in Mathematics (1990) and Ph.D. (1999) from University of Quinhon, Vietnam and Institute of Information Technology, Vietnam Academy of Science and Technology, respectively. From April 2001 to March 2002, he was a postdoctoral fellow awarded by INOUE Foundation for Science at JAIST. He is currently a Research Associate in School of Knowledge Science, JAIST, Japan. His current research interests include fuzzy logic and approximate reasoning, uncertainty formalisms in knowledge-based systems, decision making. Yoshiteru Nakamori, Ph.D.: He received the B.S., M.S., and Ph.D. degrees all in applied mathematics and physics from Kyoto University, Kyoto, Japan. He is currently a Professor in School of Knowledge Science, JAIST. His research interests include development of modeling methodology based on hard as well as soft data, and support systems for soft thinking around hard data. Shouyang Wang, Ph.D.: He received the Ph.D. degree in Operations Research from Chinsese Academy of Sciences (CAS), Beijing in 1986. He is currently a Bairen distinguished professor of Management Science at Academy of Mathematics and Systems Sciences of CAS and a Lotus chair professor of Hunan University in Changsha. He is the editor-in-chief or a co-editor of 12 journals. He has published 120 journal articles. His current research interest includes decision analysis, system engineering and knowledge management.     

Software for designing and modeling the diffraction Gratings within the rigorous electromagnetic theory

The Grating software for the design and simulation of diffraction gratings within the rigorous electromagnetic theory is presented. The software is compared with the well-known commercial software GSolver in terms of computation speed. The comparison is based on the examples of 1D and 2D diffraction problem solutions. The application of Grating to the solution of diffraction problem on lens array is also considered. The text was submitted by the authors in English.     

The theory of interactive generalized semi-Markov processes

In this paper we introduce the calculus of interactive generalized semi-Markov processes (IGSMPs), a stochastic process algebra which can express probabilistic timed delays with general distributions and synchronizable actions with zero duration, and where choices may be probabilistic, non-deterministic and prioritized. IGSMP is equipped with a structural operational semantics which generates semantic models in the form of generalized semi-Markov processes (GSMPs), i.e. probabilistic systems with generally distributed time, extended with action transitions representing interaction among system components. This is obtained by expressing the concurrent execution of delays through a variant of ST semantics which is based on dynamic names. The fact that names for delays are generated dynamically by the semantics makes it possible to define a notion of observational congruence for IGSMP (that abstracts from internal actions with zero duration) simply as a combination of standard observational congruence and probabilistic bisimulation. We also present a complete axiomatization for observational congruence over IGSMP. Finally, we show how to derive a GSMP from a given IGSMP specification in order to evaluate the system performance and we present a case study.     

Generalization of the Hoyle-Narlikar theory and connection between electromagnetism and gravitation in the generalized theory

A generalization of the Hoyle-Narlikar theory is proposed, allowing for inclusion of electromagnetism into the scheme of this theory. This is carried out by modifying the equation for the scalar Green function. Electromagnetism is considered as direct particle interaction which is known to be equivalent to field electrodynamics from the viewpoint of experimentally observable results. The resulting generalized theory reduces to general relativity (GR) and to conventional electrodynamics in Minkowski space in the corresponding limiting cases. In the general case electromagnetism and gravitation turn out to be connected with each other in a nontrivial way which is of interest for further investigation.     

A generalized formulation for the performability indicator

The main objective of this paper is to propose a generalized form of the performability measure, which has been initially defined for the purpose of studying the performance and reliability analysis of fault tolerant systems. This generalized form takes into account more detailed rewards and can be used in general for maintenance cost analysis as well as in the modeling of the website users behavior. We give different formulations by means of a homogeneous Markov chain and a cyclic nonhomogeneous Markov chain and their asymptotic expression.     

The algebraic structures of generalized rough set theory

Rough set theory is an important technique for knowledge discovery in databases, and its algebraic structure is part of the foundation of rough set theory. In this paper, we present the structures of the lower and upper approximations based on arbitrary binary relations. Some existing results concerning the interpretation of belief functions in rough set backgrounds are also extended. Based on the concepts of definable sets in rough set theory, two important Boolean subalgebras in the generalized rough sets are investigated. An algorithm to compute atoms for these two Boolean algebras is presented.     

电磁场理论教学中典型疑难问题的研究

本文就电磁场中的典型疑难问题--麦克斯韦方程组进行分析、讨论,从静态场理论的基础上,加以推广,得出时变场中的情形,并对方程组中的每一个方程从物理学的角度给以解释,从理论上预言了电磁波的存在。最后强调了在实际教学环节中应注意的问题。     

mzXML在质谱数据共享中的应用

要实现分析仪器数据的共享,首先应建立一套统一的数据交换标准,以规范数据格式;XML在共享性、开放性和扩展性等方面的诸多优点,因而更适用于质谱数据的存储与交换。本文解析MS文件的存储结构,介绍基于XML的mzXML标准,达到从MS到mzXML文件的转换目的,并以随机访问的形式解析mzXML文件,以提高mzXML文件的解析速度。     

Evolutionary fitting methods for the extraction of mass spectra in lattice field theory

We present an application of evolutionary algorithms to the curve-fitting problems commonly encountered when trying to extract particle masses from correlators in lattice QCD. Harnessing the flexibility of evolutionary methods in global optimization allows us to dynamically adapt the number of states to be fitted along with their energies so as to minimize overall χ²/(d.o.f.), leading to a promising new way of extracting the mass spectrum from measured correlation functions.     

A generalized structure-preserving doubling algorithm for generalized discrete-time algebraic Riccati equations

In Chu et al. (), an efficient structure-preserving doubling algorithm (SDA) was proposed for the solution of discrete-time algebraic Riccati equations (DAREs). In this paper, we generalize the SDA to the G-SDA, for the generalized DARE: E ^T XE?=?A ^T XA???(A ^T XB…+C ^TS )(R?+?B ^T XB)^?1(B ^T XA?+?S ^TC )?+?C ^T QC. Using Cayley transformation twice, we transform the generalized DARE to a DARE in a standard symplectic form without any explicit inversions of (possibly ill-conditioned) R and E. The SDA can then be applied. Selected numerical examples illustrate that the G-SDA is efficient, out-performing other algorithms.     

A generalized upper bounding algorithm for large-scale generalized goal programming problems

This paper considers solutions to large-scale generalized goal-programming problems using a variant of the generalized upper bounding algorithm.

The method outlined takes advantage of the structural features of the problem by maintaining a small working basis and partitioned block inverses in the execution of the revised simplex operations.