Second-order negative-curvature methods for box-constrained and general constrained optimization

A Nonlinear Programming algorithm that converges to second-order stationary points is introduced in this paper. The main tool is a second-order negative-curvature method for box-constrained minimization of a certain class of functions that do not possess continuous second derivatives. This method is used to define an Augmented Lagrangian algorithm of PHR (Powell-Hestenes-Rockafellar) type. Convergence proofs under weak constraint qualifications are given. Numerical examples showing that the new method converges to second-order stationary points in situations in which first-order methods fail are exhibited.

Perfect Simulation of a Coupling Achieving the (d)over-bar-distance Between Ordered Pairs of Binary Chains of Infinite Order

We explicitly construct a stationary coupling attaining Ornstein`s (d) over bar -distance between ordered pairs of binary chains of infinite order. Our main tool is a representation of the transition probabilities of the coupled bivariate chain of infinite order as a countable mixture of Markov transition probabilities of increasing order. Under suitable conditions on the loss of memory of the chains, this representation implies that the coupled chain can be represented as a concatenation of i.i.d. sequences of bivariate finite random strings of symbols. The perfect simulation algorithm is based on the fact that we can identify the first regeneration point to the left of the origin almost surely.

Influence diagnostics for linear models with first-order autoregressive elliptical errors

We introduce in this paper the class of linear models with first-order autoregressive elliptical errors. The score functions and the Fisher information matrices are derived for the parameters of interest and an iterative process is proposed for the parameter estimation. Some robustness aspects of the maximum likelihood estimates are discussed. The normal curvatures of local influence are also derived for some usual perturbation schemes whereas diagnostic graphics to assess the sensitivity of the maximum likelihood estimates are proposed. The methodology is applied to analyse the daily log excess return on the Microsoft whose empirical distributions appear to have AR(1) and heavy-tailed errors. (C) 2008 Elsevier B.V. All rights reserved.

Learning in and through drama : The necessity to use multiple theoretical perspectives in order to understand how learning takes place in drama

The complexity of learning implies that learning seldom is about just one thing. It can be said that learning processes are interdisciplinary. Within educational contexts, learning is not limited to constructed school subjects. In drama education, learning is simultaneously about drama as aesthetic expression and content because drama always is about something. The mainly focus can be on form, content or social aspects. The different aspects are always present, but may be more or less foreground or the background depending on the purpose of education. How do development concerning understanding of form, content, and social interaction, interact in a learning process in drama? My research is based on the view that learning at the same time takes place as an individual, internal process and a socially situated, inter-subjective process. Can learning in drama imply learning that can be transferred between different situations, a transformative learning and if so, how? Transformative learning includes cognitive, affective and corporal and social action aspects and means that the individual's frames of reference are transformed, evolved, to become more insightful and flexible which implies a change of personality. It leads to an integrated knowledge that can be applied in different contexts.   In the paper that will be presented at the conference, theories about how we learn in drama will be discussed in relation to my empirical research concerning drama and learning.

Towards a post-patriarchal gender order : Confronting the universality and the particularity of violence against women

The issues of gender equality and women’s human rights have become major spheres of academic debate, policy and activism in virtually every corner of the globe. Violence against women, a relative latecomer to the international gender agenda, has provided a particularly critical entry point in challenging long standing gender ideologies and taboos as well as the gender biased mainstream human rights framework that kept, until recently, the gender specific abuses women experience outside of public scrutiny.

1945 - A new order of centuries? : Hannah Arendt and Hermann Broch’s “The Death of Virgil”

Sociologisk Forsknings digitala arkiv

Compositional Model Repositories via Dynamic Constraint Satisfaction with Order-of-Magnitude Preferences

The predominant knowledge-based approach to automated model construction, compositional modelling, employs a set of models of particular functional components. Its inference mechanism takes a scenario describing the constituent interacting components of a system and translates it into a useful mathematical model. This paper presents a novel compositional modelling approach aimed at building model repositories. It furthers the field in two respects. Firstly, it expands the application domain of compositional modelling to systems that can not be easily described in terms of interacting functional components, such as ecological systems. Secondly, it enables the incorporation of user preferences into the model selection process. These features are achieved by casting the compositional modelling problem as an activity-based dynamic preference constraint satisfaction problem, where the dynamic constraints describe the restrictions imposed over the composition of partial models and the preferences correspond to those of the user of the automated modeller. In addition, the preference levels are represented through the use of symbolic values that differ in orders of magnitude.

Mechanising first-order temporal resolution

First-order temporal logic is a concise and powerful notation, with many potential applications in both Computer Science and Artificial Intelligence. While the full logic is highly complex, recent work on monodic first-order temporal logics has identified important enumerable and even decidable fragments. Although a complete and correct resolution-style calculus has already been suggested for this specific fragment, this calculus involves constructions too complex to be of practical value. In this paper, we develop a machine-oriented clausal resolution method which features radically simplified proof search. We first define a normal form for monodic formulae and then introduce a novel resolution calculus that can be applied to formulae in this normal form. By careful encoding, parts of the calculus can be implemented using classical first-order resolution and can, thus, be efficiently implemented. We prove correctness and completeness results for the calculus and illustrate it on a comprehensive example. An implementation of the method is briefly discussed.