Spectral distributions in nuclei: General principles and applications

The subject of spectral distribution methods where one derives and applies the locally smoothed forms of observables in nuclei is briefly reviewed. It is well understood that the local forms (with respect to energy) of the level density function, expectation values and strength densities are Gaussian, linear (or ratio of Gaussians) and a bivariate Gaussian respectively. To accomodate symmetries in the above forms, one has to deal with multivariate distributions in general; for example the angular-momentum (J) decomposition leads to a bivariate Gaussian form for the level density. These results extend to indefinitely large spaces by method of partitioning and they generate convolution forms. The origin of these remarkable spectral properties is discussed and shell model examples are given to substantiate their applicability to nuclear systems. Spectral distribution theory is a practical, usable theory because the smoothed forms are defined in terms of traces of low particle-rank operators, and the trace information propagates. Finally we discuss the application of the spectral methods for a wide range of nuclear problems; these include binding energies, orbit occupancies, electromagnetic andβ-decay sum rule quantities, analysis of operators, symmetry breaking, numerical level densities, and determination of bounds on time-reversal non-invariant part of nucleon-nucleon interaction.     

The Nonchiral Fusion Rules in Rational Conformal Field Theories

We introduce a general method in order to construct the nonchiral fusion rules which determine the operator content of the operator product algebra for rational conformal field theories. We are particularly interested in the models of the complementary D-like solutions of the modular invariant partition functions with cyclic center Z _N . We find that the nonchiral fusion rules have a Z _N -grading structure.     

Decomposition Method with a Variable Parameter for a Class of Monotone Variational Inequality Problems

In this paper, we focus on a useful modification of the decomposition method by He et al. (Ref. 1). Experience on applications has shown that the number of iterations of the original method depends significantly on the penalty parameter. The main contribution of our method is that we allow the penalty parameter to vary automatically according to some self-adaptive rules. As our numerical simulations indicate, the modified method is more flexible and efficient in practice. A detailed convergence analysis of our method is also included.     

基于粗糙集的经济预警规则发现

应用粗糙集的理论和方法对经济预警有关数据进行分析,挖掘其中隐含的有用信息,提取规则并对规则进行约简,从而求取表达经济预警信息的最小决策规则,为经济预警有用信息的获取提供一种有效的方法.     

Macroscopic modelling of transport phenomena in porous media. 1: The continuum approach

This is the first of two papers presenting a systematic development of a continuum model of a porous medium and of transport processes occurring in it. The concept of a Representative Elementary Volume (REV) as opposed to any arbitrary volume of averaging quantities at the micro-scale, is quantified. A universal criterion for selecting the size of an REV as a function of measurable characteristics of a porous medium and selected tolerance levels of estimation errors, is developed. The rules of spatial averaging are extended by including the effects of both the configuration of the solid matrix and of interphase transfer phenomena within an REV.     

Simple ingredients leading to very efficient heuristics for the maximum clique problem

Starting from an algorithm recently proposed by Pullan and Hoos, we formulate and analyze iterated local search algorithms for the maximum clique problem. The basic components of such algorithms are a fast neighbourhood search (not based on node evaluation but on completely random selection) and simple, yet very effective, diversification techniques and restart rules. A detailed computational study is performed in order to identify strengths and weaknesses of the proposed algorithms and the role of the different components on several classes of instances. The tested algorithms are very fast and reliable: most of the DIMACS benchmark instances are solved within very short CPU times. For one of the hardest tests, a new putative optimum was discovered by one of our algorithms. Very good performances were also shown on recently proposed and more difficult instances. It is important to remark that the heuristics tested in this paper are basically parameter free (the appropriate value for the unique parameter is easily identified and was, in fact, the same value for all problem instances used in this paper).     

MV-Algebra for Cultural Rules

This paper reports preliminary results on a new area of application of quantum structures, motivated by a reading of the 2004 monograph Reasoning in Quantum Theory. Ethnographers often describe a particular culture by describing rules of social relations that they assert characterize that culture. Viable cultures exist over periods of time, that is, over sequences of “generations”. To embody this, we define a suitable set of objects and relations, and a structure on which cultural rules act as “operators” on a set of “configurations” on generations. This yields an MV-algebra of those operators. This implies that culture theory might be studied as an example of the theory of quantum structures. The author acknowledges Dick Greechie in appreciation for the many comments he offered on this paper and on the development of this line of research. Useful comments of an unidentified reviewer helped clarify results. Only the author is responsible for any errors, and for the ideas asserted. This paper was delivered at the meetings of the International Quantum Structures Association, IQSA-Malta 2006.     

Bounded rational expectations and the stability of interest rate policy

The New Keynesian model has recently been subject to two serious criticisms: the model cannot produce plausible inflation and output dynamics following a monetary shock, and the stability of its dynamics suffers from indeterminacy. The procedures that have been proposed to eliminate these two shortcomings fall into two categories: the introduction of some sort of backward price indexation into the standard model and/or other forms of stickiness (like sticky information); and the adoption of some form of policy rule that completely offsets the effects of forward looking dynamics in the optimization process. In this paper we do not eradicate forward looking behavior from the dynamics of the New Keynesian model, neither do we impose some form of backward price indexation. We assume that private economic agents have forward looking behavior and that they do try to optimize with all available information; the only novelty is that they are allowed to make small mistakes near the rational expectations equilibrium, in a fully deterministic setup. These “near rational” or “bounded rational” expectations show that the dynamics of the model with active interest rate rules is much richer than the simple problem of local indeterminacy as is usually found in the literature.     

Categorical Abstract Algebraic Logic: Structurality,protoalgebraicity, and correspondence

The notion of an ? ‐matrix as a model of a given π ‐institution ? is introduced. The main difference from the approach followed so far in Categorical Abstract Algebraic Logic (CAAL) and the one adopted here is that an ? ‐matrix is considered modulo the entire class of morphisms from the underlying N ‐algebraic system of ? into its own underlying algebraic system, rather than modulo a single fixed (N,N ′)‐logical morphism. The motivation for introducing ? ‐matrices comes from a desire to formulate a correspondence property for N ‐protoalgebraic π ‐institutions closer in spirit to the one for sentential logics than that considered in CAAL before. As a result, in the previously established hierarchy of syntactically protoalgebraic π ‐institutions, i. e., those with an implication system, and of protoalgebraic π ‐institutions, i. e., those with a monotone Leibniz operator, the present paper interjects the class of those π ‐institutions with the correspondence property, as applied to ? ‐matrices. Moreover, this work on ? ‐matrices enables us to prove many results pertaining to the local deduction‐detachment theorems, paralleling classical results in Abstract Algebraic Logic formulated, first, by Czelakowski and Blok and Pigozzi. Those results will appear in a sequel to this paper. (© 2009 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Linguistic modelling and information coarsening based on prototype theory and label semantics

The theory of prototypes provides a new semantic interpretation of vague concepts. In particular, the calculus derived from this interpretation results in the same calculus as label semantics proposed by Lawry. In the theory of prototypes, each basic linguistic label L has the form ‘about P’, where P is a set of prototypes of L and the neighborhood size of the underlying concept is described by the word ‘about’ which represents a probability density function δ on [0,+∞). In this paper we propose an approach to vague information coarsening based on the theory of prototypes. Moreover, we propose a framework for linguistic modelling within the theory of prototypes, in which the rules are concise and transparent. We then present a linguistic rule induction method from training data based on information coarsening and data clustering. Finally, we apply this linguistic modelling method to some benchmark time series prediction problems, which show that our linguistic modelling and information coarsening methods are potentially powerful tools for linguistic modelling and uncertain reasoning.