Improving the Fundamental Theorem of Algebra

Theorems 2 and 3 establish the minimum algebraic conditions necessary for a field to be algebraically closed, and they can therefore be said to “optimize” the Fundamental Theorem of Algebra. But each specific“degree implication” is a first-order consequence of the axioms for fields, and could have been discovered two centuries ago; the existence of these finitary relationships appears to have been unsuspected by practically everyone, with one important exception.     

A TVD Type Wavelet-Galerkin Method for Hamilton-Jacobi Equations

In this paper,we use Daubechies scaling functions as test functions for the Galerkin method,and discuss Wavelet-Galerkin solutions for the Hamilton-Jacobi equations.It can be proved that the schemesare TVD schemes.Numerical tests indicate that the schemes are suitable for the Hamilton-Jacobi equations.Furthermore,they have high-order accuracy in smooth regions and good resolution of singularities.     

A Characterization of Graphs without Even Factors

In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived. This paper was accomplished while the second author was visiting the Center for Combinatorics, Nankai University. The research is supported by NSFC     

Network externalities in a dynamic monopoly

We reconsider the role of network externalities in a dynamic spatial monopoly where the firm must invest in order to accumulate capacity, while consumers may have either linear or quadratic preferences. We (1) characterise saddle point equilibria, (2) prove that the extent of market coverage is increasing in the network effect and (3) unlike the existing static literature on the same problem, the monopolist may not make introductory price offers. Then, we briefly deal with the socially optimal solution, showing that, in general, a planner would serve more consumers than a profit-seeking monopolist.      

Developing professional judgement with the aid of a ‘low-profile’ group support system

This paper reports positive results from an application of one type of group support system (GSS) to a training application. Reviews of the findings of other trials of GSS have been mixed, and inconclusive. We describe the results of a series of seven training sessions in a field-based application of group process support. The subjects were professionals working in various agencies concerned with the welfare of older people. A ‘low-profile’ type of group support system, based on wireless handsets, was used. This design enabled responses from each participant to be input and displayed anonymously. Each session was aimed at stimulating a dialogue focused on the reasons for differences of judgement, as displayed on a single projected feedback screen. Changes of individual judgements were recorded for subsequent analysis and comparison with already known ‘expert judgements’. Frequent changes of judgement were recorded. A significant proportion of these were related to an improvement, which could not be explained as simply the result of conforming behaviour. We propose that the mode of operation and design of a ‘low-profile’ GSS have the potential to create a learning environment by reducing personal anxieties while encouraging group-based learning with focussed conversation. We conclude that this type of GSS design is particularly suited to ‘selective’-type tasks in groups.     

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.     

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.     

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.