Quasiequilibrium problem in H-spaces

In the present paper, we study the quasiequilibrium problem and generalized quasiequilibrium problem of generalized quasi-variational inequality in H-spaces by a new method. Some new equilibrium existence theorems are given. Our results are different from corresponding given results or contain some recent results as their special cases. (C) 2003 Elsevier Science Ltd. All rights reserved.

Lanczos subspace filter diagonalization: Homogeneous recursive filtering and a low-storage method for the calculation of matrix elements

We develop a new iterative filter diagonalization (FD) scheme based on Lanczos subspaces and demonstrate its application to the calculation of bound-state and resonance eigenvalues. The new scheme combines the Lanczos three-term vector recursion for the generation of a tridiagonal representation of the Hamiltonian with a three-term scalar recursion to generate filtered states within the Lanczos representation. Eigenstates in the energy windows of interest can then be obtained by solving a small generalized eigenvalue problem in the subspace spanned by the filtered states. The scalar filtering recursion is based on the homogeneous eigenvalue equation of the tridiagonal representation of the Hamiltonian, and is simpler and more efficient than our previous quasi-minimum-residual filter diagonalization (QMRFD) scheme (H. G. Yu and S. C. Smith, Chem. Phys. Lett., 1998, 283, 69), which was based on solving for the action of the Green operator via an inhomogeneous equation. A low-storage method for the construction of Hamiltonian and overlap matrix elements in the filtered-basis representation is devised, in which contributions to the matrix elements are computed simultaneously as the recursion proceeds, allowing coefficients of the filtered states to be discarded once their contribution has been evaluated. Application to the HO2 system shows that the new scheme is highly efficient and can generate eigenvalues with the same numerical accuracy as the basic Lanczos algorithm.

Generalized optimal lattice covering of finite-dimensional Euclidean space

A generalization of the classical problem of optimal lattice covering of R-n is considered. Solutions to this generalized problem are found in two specific classes of lattices. The global optimal solution of the generalization is found for R-2. (C) 1998 Elsevier Science Inc. All rights reserved.

The Alcohol Helplessness Scale and its prediction of depression among problem drinkers

Event-specific scales commonly have greater power than generalized scales in prediction of specific disorders and in testing mediator models for predicting such disorders. Therefore, in a preliminary study, a 6-item Alcohol Helplessness Scale was constructed and found to be reliable for a sample of 98 problem drinkers. Hierarchical multiple regression and its derivative path analysis were used to test whether helplessness and self-efficacy moderate or mediate the link between alcohol dependence and depression, A test of a moderation model was not supported, whereas a test of a mediation model was supported. Helplessness and self-efficacy both significantly and independently mediated between alcohol dependence and depression. Nevertheless, a significant direct effect of alcohol dependence on depression also remained, (C) 2001 John Wiley & Sons, Inc.

Non-compact generalized variational inequalities for quasi-monotone and hemi-continuous operators with applications

Some results are obtained for non-compact cases in topological vector spaces for the existence problem of solutions for some set-valued variational inequalities with quasi-monotone and lower hemi-continuous operators, and with quasi-semi-monotone and upper hemi-continuous operators. Some applications are given in non-reflexive Banach spaces for these existence problems of solutions and for perturbation problems for these set-valued variational inequalities with quasi-monotone and quasi-semi-monotone operators.

Reflections on the statistical analysis of personality and norms in war, peace, and prejudice: Are deviant minorities the problem?

The compelling quality of the Global Change simulation study (Altemeyer, 2003), in which high RWA (right-wing authoritarianism)/high SDO (social dominance orientation) individuals produced poor outcomes for the planet, rests on the inference that the link between high RWA/SDO scores and disaster in the simulation can be generalized to real environmental and social situations. However, we argue that studies of the Person × Situation interaction are biased to overestimate the role of the individual variability. When variables are operationalized, strongly normative items are excluded because they are skewed and kurtotic. This occurs both in the measurement of predictor constructs, such as RWA, and in the outcome constructs, such as prejudice and war. Analyses of normal linear statistics highlight personality variables such as RWA, which produce variance, and overlook the role of norms, which produce invariance. Where both normative and personality forces are operating, as in intergroup contexts, the linear analysis generates statistics for the sample that disproportionately reflect the behavior of the deviant, antinormative minority and direct attention away from the baseline, normative position. The implications of these findings for the link between high RWA and disaster are discussed.

Jointly radial and translation homothetic preferences: generalized constant risk aversion

The paper identifies the structural restrictions on preferences required for them to exhibit both translation homotheticity in particular direction and radial homotheticity. The results are illustrated by an application to an asset allocation problem in the absence of riskless asset.

Linking Agentive Objects in Mandarin Chinese

This paper is concerned with the problem of argument-function mismatch observed in the apparent subject-object inversion in Chinese consumption verbs, e.g., chi 'eat' and he 'drink', and accommodation verbs, e.g., zhu 'live' and shui 'sleep'. These verbs seem to allow the linking of [agent-SUBJ theme-OBJ] as well as [agent-OBJ theme-SUBJ], but only when the agent is also the semantic role denoting the measure or extent of the action. The account offered is formulated within LFG's lexical mapping theory. Under the simplest and also the strictest interpretation of the one-to-one argument-function mapping principle (or the theta-criterion), a composite role such as ag-ext receives syntactic assignment via one composing role only. One-to-one linking thus entails the suppression of the other composing role. Apparent subject-object inversion occurs when the more prominent agent role is suppressed and thus allows the less prominent extent role to dictate the linking of the entire ag-ext composite role. This LMT account also potentially facilitates a natural explanation of markedness among the competing syntactic structures.

Least energy solutions of a critical Neumann problem with a weight

We investigate the effect of the coefficient of the critical nonlinearity for the Neumann problem on the existence of least energy solutions. As a by-product we establish a Sobolev inequality with interior norm.

What is the Problem of Ad Hoc Hypotheses?

The received view of an ad hoc hypothesis is that it accounts for only the observation(s) it was designed to account for, and so non-adhocness is generally held to be necessary or important for an introduced hypothesis or modification to a theory. Attempts by Popper and several others to convincingly explicate this view, however, prove to be unsuccessful or of doubtful value, and familiar and firmer criteria for evaluating the hypotheses or modified theories so classified are characteristically available. These points are obscured largely because the received view fails to adequately separate psychology from methodology or to recognise ambiguities in the use of 'ad hoc'.

Watkins and the Pragmatic Problem of Induction

Watkins proposes a neo-Popperian solution to the pragmatic problem of induction. He asserts that evidence can be used non-inductively to prefer the principle that corroboration is more successful over all human history than that, say, counter-corroboration is more successful either over this same period or in the future. Watkins's argument for rejecting the first counter-corroborationist alternative is beside the point. However, as whatever is the best strategy over all human history is irrelevant to the pragmatic problem of induction since we are not required to act in the past, and his argument for rejecting the second presupposes induction.

On the nonlinear Neumann problem with critical and supercritical nonlinearities

We investigate the solvability of the Neumann problem (1.1) involving a critical Sobolev exponent. In the first part of this work it is assumed that the coeffcients Q and h are at least continuous. Moreover Q is positive on overline Omega and lambda > 0 is a parameter. We examine the common effect of the mean curvature and the shape of the graphs of the coeffcients Q and h on the existence of low energy solutions. In the second part of this work we consider the same problem with Q replaced by - Q. In this case the problem can be supercritical and the existence results depend on integrability conditions on Q and h.

Sampling phylogenetic tree space with the generalized Gibbs sampler

The generalized Gibbs sampler (GGS) is a recently developed Markov chain Monte Carlo (MCMC) technique that enables Gibbs-like sampling of state spaces that lack a convenient representation in terms of a fixed coordinate system. This paper describes a new sampler, called the tree sampler, which uses the GGS to sample from a state space consisting of phylogenetic trees. The tree sampler is useful for a wide range of phylogenetic applications, including Bayesian, maximum likelihood, and maximum parsimony methods. A fast new algorithm to search for a maximum parsimony phylogeny is presented, using the tree sampler in the context of simulated annealing. The mathematics underlying the algorithm is explained and its time complexity is analyzed. The method is tested on two large data sets consisting of 123 sequences and 500 sequences, respectively. The new algorithm is shown to compare very favorably in terms of speed and accuracy to the program DNAPARS from the PHYLIP package.