On Lattices of Uniformities

We study lattice theoretical properties of lattices of uniformities such as modularity, distributive laws and the existence of (relative) complements. For this the concepts of permutable uniformities (see Definition 3.1) and independent uniformities (see Definition 4.1) are important. Moreover, we show that e.g. the lattice of all lattice uniformities on a lattice L is a closed sublattice of the lattice of all uniformities on L.     

Quotient probabilistic normed spaces and completeness results

We introduce the concept of quotient in PN spaces and give some examples. We prove some theorems with regard to the completeness of a quotient.     

A dynamic scorecard for monitoring baseline performance with application to tracking a mortgage portfolio

A principled technique for monitoring the performance of a consumer credit scorecard through time is derived from Kalman filtering. Standard approaches sporadically compare certain characteristics of the new applicants with those predicted from the scorecard. The new approach systematically updates the scorecard combining new applicant information with the previous best estimate. The dynamically updated scorecard is tracked through time and compared to limits calculated by sequential simulation from the baseline scorecard. The observation equation of the Kalman filter is tailored to take the results of fitting local scorecards by logistic regression to batches of new clients that arrive in the current time interval. The states in the Kalman filter represent the true or underlying score for each attribute in the card: the parameters of the logistic regression. Their progress in time is modelled by a random walk and the filter provides the best estimate of the scores using past and present information. We illustrate the technique using a commercial mortgage portfolio and the results indicate significant emerging deficiencies in the baseline scorecard.     

通过平均场处理的严格重正化群变换方法对Potts模型的应用

本文运用作者所发展的严格docimation- 平均场近似方法对Potts 模型的临界指数作了计算.所得结果与严格解符合得很好, 而与计算工作量相当的重正化群方法相比, 精确度大为提高。 关键词：     

Completeness and compactness for varieties over a local field

This paper shows that for a local field K, a subfield k ⊂ K and a variety X over k, X is complete if and only if for every finite field extension Kʹ | K, the set X(Kʹ) is compact in its strong topology. The author likes to thank Florian Pop, Jakob Stix, Stefan Wewers, Gunther Cornelissen and his own parents for their support. Received: 13 April 2006     

Area,coarea, and approximation in <Emphasis Type="Italic">W</Emphasis><Superscript>1,1</Superscript>

Let Ω⊂ℝ ⁿ be an arbitrary open set. We characterize the space W ^1,1 _loc(Ω) using variants of the classical area and coarea formulas. We use these characterizations to obtain a norm approximation and trace theorems for functions in the space W ^1,1(ℝ ⁿ ).     

Group-valued measures on coarse-grained quantum logics

In [3] it was shown that a (real) signed measure on a cyclic coarse-grained quantum logic can be extended, as a signed measure, over the entire power algebra. Later ([9]) this result was re-proved (and further improved on) and, moreover, the non-negative measures were shown to allow for extensions as non-negative measures. In both cases the proof technique used was the technique of linear algebra. In this paper we further generalize the results cited by extending group-valued measures on cyclic coarse-grained quantum logics (or non-negative group-valued measures for lattice-ordered groups). Obviously, the proof technique is entirely different from that of the preceding papers. In addition, we provide a new combinatorial argument for describing all atoms of cyclic coarse-grained quantum logics.     

Choice of modelling technique for evaluating health care interventions

Economic evaluation, such as cost effectiveness analysis, provides a method for comparing healthcare interventions. These evaluations often use modelling techniques such as decision trees, Markov processes and discrete event simulations (DES). With the aid of examples from coronary heart disease, the use of these techniques in different health care situations is discussed. Guidelines for the choice of modelling technique are developed according to the characteristics of the health care intervention.The choice of modelling technique is shown to depend on the acceptance of the modelling technique, model ‘error’, model appropriateness, dimensionality and ease and speed of model development. Generally decision trees are suitable for acute interventions but they cannot model recursion and Markov models are suitable for simple chronic interventions. It is further recommended that population based models be used in order to provide health care outcomes for the likely cost, health benefits and cost effectiveness of the intervention. The population approach will complicate the construction of the model. DES will allow the modeller to construct more complex, dynamic and accurate systems but these may involve a corresponding increase in development time and expense. The modeller will need to make a judgement on the necessary complexity of the model in terms of interaction of individuals and model size and whether queuing for resources, resource constraints or the interactions between individuals are significant issues in the health care system.     

Mixed Elastico-Plasticity Problems with Partially Unknown Boundaries

In this paper,we study mixed elastico-plasticity problems in which part of the boundary is known,while the other part of the boundary is unknown and is a free boundary.Under certain conditions,this problemcan be transformed into a Riemann-Hilbert boundary value problem for analytic functions and a mixed boundaryvalue problem for complex equations.Using the theory of generalized analytic functions,the solvability of theproblem is discussed.     

Finding the best visualization of an ontology

An ontology is a classification model for a given domain. In information retrieval, ontologies are used to perform broad searches. An ontology can be visualized as nodes and edges. Each node represents an element and each edge a relation between a parent and a child element. Working with an ontology becomes easier with a visual representation. An idea is to use the expressive power of 3D representation to provide visualization for the user. In this paper, we propose a new method for positioning the elements of the visualized concept lattice in the 3D world based on operations research (OR) methods. One method uses a discrete location model to create an initial solution and we propose heuristic methods to further improve the visual result. We evaluate the visual results according to our success criteria and the feedback from users. Running times of the heuristic indicate that an improved version should be feasible for on-line processing and what-if analysis of ontologies.