BRST invariant theory of a generalized 1+1 Dimensional nonlinear sigma model with topological term

We give a generalized Lagrangian density of 1 + 1 Dimensional O( 3) nonlinear sigma model with subsidiary constraints, different Lagrange multiplier fields and topological term, find a lost intrinsic constraint condition, convert the subsidiary constraints into inner constraints in the nonlinear sigma model, give the example of not introducing the lost constraint. N = 0, by comparing the example with the case of introducing the lost constraint, we obtain that when not introducing the lost constraint, one has to obtain a lot of various non-intrinsic constraints. We further deduce the gauge generator, give general BRST transformation of the model under the general conditions. It is discovered that there exists a gauge parameter beta originating from the freedom degree of BRST transformation in a general O( 3) nonlinear sigma model, and we gain the general commutation relations of ghost field.

alpha decay half-lives of new superheavy nuclei within a generalized liquid drop model

The alpha decay half-lives of the recently produced isotopes of the 112, 114, 116 and 118 nuclei and decay products have been calculated in the quasi-molecular shape path using the experimental Q(alpha) value and a Generalized Liquid Drop Model including the proximity effects between nucleons in the neck or the gap between the nascent fragments. Reasonable estimates are obtained for the observed alpha decay half-lives. The results are compared with calculations using the Density-Dependent M3Y effective interaction and the Viola-Seaborg-Sobiczewski formulae. Generalized Liquid Drop Model predictions are provided for the alpha decay half-lives of other superheavy nuclei using the Finite Range Droplet Model Q(alpha) and compared with the values derived from the VSS formulae.

Properties of the superheavy nuclei (288)115 and its alpha-decay chain in a generalized liquid-drop model

The properties of the nuclei belonging to the newly observed nuclei starting from (288)115 have been studied with the generalized liquid drop model connected with WKB approximation. The calculated results have been compared with the results of the DDM3Y theory and the experimental data. The half lives of this new alpha decay chain have been well tested from the consistence of the macroscopic, microscopic and the experimental data.

Dynamical horizon entropy and equilibrium thermodynamics of generalized gravity theories

We study the relation between the thermodynamics and field equations of generalized gravity theories on the dynamical trapping horizon with sphere symmetry. We assume the entropy of a dynamical horizon as the Noether charge associated with the Kodama vector and point out that it satisfies the second law when a Gibbs equation holds. We generalize two kinds of Gibbs equations to Gauss-Bonnet gravity on any trapping horizon. Based on the quasilocal gravitational energy found recently for f(R) gravity and scalar-tensor gravity in some special cases, we also build up the Gibbs equations, where the nonequilibrium entropy production, which is usually invoked to balance the energy conservation, is just absorbed into the modified Wald entropy in the Friedmann-Robertson-Walker spacetime with slowly varying horizon. Moreover, the equilibrium thermodynamic identity remains valid for f(R) gravity in a static spacetime. Our work provides an alternative treatment to reinterpret the nonequilibrium correction and supports the idea that the horizon thermodynamics is universal for generalized gravity theories.

Applications of generalized torsion angles in studies on quantitative structure-activity relationship

In this article, generalized torsion angles of derivatives of 1-[(2-hydroxyethoxy)methy1]-6(phenylthio)thymine(HEPT) were calculated, which include abundant three dimensional information of molecules. Molecular similarity matrix was built based on the calculated generalized torsion angles. These similarities were taken as the new variables, and the new variables were selected by using Leaps-and-Bounds regression analysis. Multiple regression analysis and neural networks were performed, and the satisfactory results were achieved by using the neural networks.

Formalizing Triggers: A Learning Model for Finite Spaces

In a recent seminal paper, Gibson and Wexler (1993) take important steps to formalizing the notion of language learning in a (finite) space whose grammars are characterized by a finite number of parameters. They introduce the Triggering Learning Algorithm (TLA) and show that even in finite space convergence may be a problem due to local maxima. In this paper we explicitly formalize learning in finite parameter space as a Markov structure whose states are parameter settings. We show that this captures the dynamics of TLA completely and allows us to explicitly compute the rates of convergence for TLA and other variants of TLA e.g. random walk. Also included in the paper are a corrected version of GW's central convergence proof, a list of "problem states" in addition to local maxima, and batch and PAC-style learning bounds for the model.

Generalized Low-Rank Approximations

We study the frequent problem of approximating a target matrix with a matrix of lower rank. We provide a simple and efficient (EM) algorithm for solving {\\em weighted} low rank approximation problems, which, unlike simple matrix factorization problems, do not admit a closed form solution in general. We analyze, in addition, the nature of locally optimal solutions that arise in this context, demonstrate the utility of accommodating the weights in reconstructing the underlying low rank representation, and extend the formulation to non-Gaussian noise models such as classification (collaborative filtering).

Computational Structure of GPSG Models: Revised Generalized Phrase Structure Grammar

The primary goal of this report is to demonstrate how considerations from computational complexity theory can inform grammatical theorizing. To this end, generalized phrase structure grammar (GPSG) linguistic theory is revised so that its power more closely matches the limited ability of an ideal speaker--hearer: GPSG Recognition is EXP-POLY time hard, while Revised GPSG Recognition is NP-complete. A second goal is to provide a theoretical framework within which to better understand the wide range of existing GPSG models, embodied in formal definitions as well as in implemented computer programs. A grammar for English and an informal explanation of the GPSG/RGPSG syntactic features are included in appendices.

Transformation Based Interpolation with Generalized Representative Values

Z. Huang and Q. Shen. Transformation Based Interpolation with Generalized Representative Values. Proceedings of the 14th International Conference on Fuzzy Systems, pages 821-826.

Fuzzy interpolation with generalized representative values

Z. Huang and Q. Shen. Fuzzy interpolation with generalized representative values. Proceedings of the 2004 UK Workshop on Computational Intelligence, pages 161-171.

From Limen to Lumen: computing students in liminal spaces.From Limen to Lumen: computing students in liminal spaces

Eckerdal, A., McCartney, R., Mostr?m, J. E., Sanders, K., Thomas, L., and Zander, C. 2007. From Limen to Lumen: computing students in liminal spaces. In Proceedings of the Third international Workshop on Computing Education Research (Atlanta, Georgia, USA, September 15 - 16, 2007). ICER '07. ACM, New York, NY, 123-132.

Generalized semi-geostrophic theory on a sphere

Douglas, Robert; Cullen, M.J.P.; Roulston, I.; Sewell, M.J., (2005) 'Generalized semi-geostrophic theory on a sphere', Journal of Fluid Mechanics 531 pp.123-157 RAE2008

Twierdzenia o punktach stałych pewnych klas operatorów nieliniowych wraz z ich zastosowaniami

Wydział Matematyki i Informatyki

itmBench: Generalized API for Internet Traffic Managers

Internet Traffic Managers (ITMs) are special machines placed at strategic places in the Internet. itmBench is an interface that allows users (e.g. network managers, service providers, or experimental researchers) to register different traffic control functionalities to run on one ITM or an overlay of ITMs. Thus itmBench offers a tool that is extensible and powerful yet easy to maintain. ITM traffic control applications could be developed either using a kernel API so they run in kernel space, or using a user-space API so they run in user space. We demonstrate the flexibility of itmBench by showing the implementation of both a kernel module that provides a differentiated network service, and a user-space module that provides an overlay routing service. Our itmBench Linux-based prototype is free software and can be obtained from http://www.cs.bu.edu/groups/itm/.