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.     

Working group report: Collider Physics

This is summary of the activities of the working group on collider physics in the IXth Workshop on High Energy Physics Phenomenology (WHEPP-9) held at the Institute of Physics, Bhubaneswar, India in January 2006. Some of the work subsequently done on these problems by the subgroups formed during the workshop is included in this report.     

Property (<Emphasis Type="Italic">T</Emphasis>) and rigidity for actions on Banach spaces

We study property (T) and the fixed-point property for actions on L ^p and other Banach spaces. We show that property (T) holds when L ² is replaced by L ^p (and even a subspace/quotient of L ^p ), and that in fact it is independent of 1≤p<∞. We show that the fixed-point property for L ^p follows from property (T) when 1<p< 2+ε. For simple Lie groups and their lattices, we prove that the fixed-point property for L ^p holds for any 1< p<∞ if and only if the rank is at least two. Finally, we obtain a superrigidity result for actions of irreducible lattices in products of general groups on superreflexive spaces. Bader partially supported by ISF grant 100146; Furman partially supported by NSF grants DMS-0094245 and DMS-0604611; Gelander partially supported by NSF grant DMS-0404557 and BSF grant 2004010; Monod partially supported by FNS (CH) and NSF (US).     

Risk and quality control in a supply chain: competitive and collaborative approaches

This paper provides a quantitative and comparative economic and risk approach to strategic quality control in a supply chain, consisting of one supplier and one producer, using a random payoff game. Such a game is first solved in a risk-neutral framework by assuming that both parties are competing with each other. We show in this case that there may be an interior solution to the inspection game. A similar analysis under a collaborative framework is shown to be trivial and not practical, with a solution to the inspection game being an ‘all or nothing’ solution to one or both the parties involved. For these reasons, the sampling random payoff game is transformed into a Neyman–Pearson risk constraints game, where the parties minimize the expected costs subject to a set of Neyman–Pearson risk (type I and type II) constraints. In this case, the number of potential equilibria can be large. A number of such solutions are developed and a practical (convex) approach is suggested by providing an interior (partial sampling) solution for the collaborative case. Numerical examples are developed to demonstrate the procedure used. Thus, unlike theoretical approaches to the solution of strategic quality control random payoff games, the approach we construct is both practical and consistent with the statistical risk Neyman–Pearson approach.     

Global Parametric Sufficient Optimality Conditions for Semi-infinite Discrete Minmax Fractional Programming Problems Involving Generalized （η,ρ）-invex Functions

In this paper,we discuss a large number of sets of global parametric sufficient optimality condi-tions under various gcneralized (η,ρ)-invexity assumptions for a semi-infinite minmax fractional programmingproblem.     

A fluid system with coupled input and output,and its application to bottlenecks in ad hoc networks

This paper studies a fluid queue with coupled input and output. Flows arrive according to a Poisson process, and when n flows are present, each of them transmits traffic into the queue at a rate c/(n+1), where the remaining c/(n+1) is used to serve the queue. We assume exponentially distributed flow sizes, so that the queue under consideration can be regarded as a system with Markov fluid input. The rationale behind studying this queue lies in ad hoc networks: bottleneck links have roughly this type of sharing policy. We consider four performance metrics: (i) the stationary workload of the queue, (ii) the queueing delay, i.e., the delay of a ‘packet’ (a fluid particle) that arrives at the queue at an arbitrary point in time, (iii) the flow transfer delay, i.e., the time elapsed between arrival of a flow and the epoch that all its traffic has been put into the queue, and (iv) the sojourn time, i.e., the flow transfer time increased by the time it takes before the last fluid particle of the flow is served. For each of these random variables we compute the Laplace transform. The corresponding tail probabilities decay exponentially, as is shown by a large-deviations analysis. F. Roijers’ work has been carried out partly in the SENTER-NOVEM funded project Easy Wireless.     

Properties of<Emphasis Type="Italic">B</Emphasis><Subscript>c</Subscript> meson

The mass spectrum ofcb meson is investigated with an effective quark-antiquark potential of the form -α_c/r +Ar ^νwith ν varying from 0.5 to 2.0. TheS andP-wave masses, pseudoscalar decay constant, weak decay partial widths in spectator model and the lifetime ofB _cmeson are computed. The properties calculated here are found to be in good agreement with other theoretical and experimental values at potential index,ν = 1     

A graphical approach to computing Selmer groups of congruent number curves

Let E _n:y ²=x ³−n ² x denote the family of congruent number elliptic curves. Feng and Xiong (2004) equate the nontriviality of the Selmer groups associated with E _n to the presence of certain types of partitions of graphs associated with the prime factorization of n. In this paper, we extend the ideas of Feng and Xiong in order to compute the Selmer groups of E _n. 2000 Mathematics Subject Classification Primary—11G05; Secondary—14H52, 14H25, 05C90