Partial circle geometries and antiregular quadrangles

A new and rather general definition of circle geometries is given. This definition is such that circle planes and chain spaces are circle geometries. Also the geometry of points and traces of an antiregular quadrangle is a partial circle geometry. Orthogonal quadrangles can then be characterised as those antiregular generalised quadrangles where in the associated partial circle geometry the Miquel condition is satisfied.     

Laser induced forward transfer of SnO2 for sensing applications using different precursors systems

This paper presents the transfer of SnO₂ by laser induced forward transfer (LIFT) for gas sensor applications. Different donor substrates of SnO₂ with and without triazene polymer (TP) as a dynamic release layer were prepared. Transferring these films under different conditions were evaluated by optical microscopy and functionality. Transfers of sputtered SnO₂ films do not lead to satisfactory results and transfers of SnO₂ nanoparticles are difficult. Transfers of SnO₂ nanoparticles can only be achieved when applying a second laser pulse to the already transferred material, which improves the adhesion resulting in a complete pixel. A new approach of decomposing the transfer material during LIFT transfer was developed. Donor films based on UV absorbing metal complex precursors namely, SnCl₂(acac)₂ were prepared and transferred using the LIFT technique. Transfer conditions were optimized for the different systems, which were deposited onto sensor-like microstructures. The conductivity of the transferred material at temperatures of about 400 ^°C are in a range usable for SnO₂ gas sensors. First sensing tests were carried out and the transferred material proved to change conductivity when exposed to ethanol, acetone, and methane.     

Wavelet Collocation Methods for a First Kind Boundary Integral Equation in Acoustic Scattering

In this paper we consider a wavelet algorithm for the piecewise constant collocation method applied to the boundary element solution of a first kind integral equation arising in acoustic scattering. The conventional stiffness matrix is transformed into the corresponding matrix with respect to wavelet bases, and it is approximated by a compressed matrix. Finally, the stiffness matrix is multiplied by diagonal preconditioners such that the resulting matrix of the system of linear equations is well conditioned and sparse. Using this matrix, the boundary integral equation can be solved effectively.     

Local behavior of an iterative framework for generalized equations with nonisolated solutions

 An iterative framework for solving generalized equations with nonisolated solutions is presented. For generalized equations with the structure , where is a multifunction and F is single-valued, the framework covers methods that, at each step, solve subproblems of the type . The multifunction approximates F around s. Besides a condition on the quality of this approximation, two other basic assumptions are employed to show Q-superlinear or Q-quadratic convergence of the iterates to a solution. A key assumption is the upper Lipschitz-continuity of the solution set map of the perturbed generalized equation . Moreover, the solvability of the subproblems is required. Conditions that ensure these assumptions are discussed in general and by means of several applications. They include monotone mixed complementarity problems, Karush-Kuhn-Tucker systems arising from nonlinear programs, and nonlinear equations. Particular results deal with error bounds and upper Lipschitz-continuity properties for these problems. Received: November 2001 / Accepted: November 2002 Published online: December 9, 2002 Key Words. generalized equation – nonisolated solutions – Newton's method – superlinear convergence – upper Lipschitz-continuity – mixed complementarity problem – error bounds Mathematics Subject Classification (1991): 90C30, 65K05, 90C31, 90C33     

Algorithmic Aspects of Tree Amalgamation

The amalgamation of leaf-labeled trees into a single (super)tree that “displays” each of the input trees is an important problem in classification. We discuss various approaches to this problem and show that a simple and well-known polynomial-time algorithm can be used to solve this problem whenever the input set of trees contains a minimum size subset that uniquely determines the supertree. Our results exploit a recently established combinatorial property concerning the structure of such collections of trees.     

Millisecond pulsars with r-modes as steady gravitational radiators

Millisecond pulsars (MSPs) probably achieve their fast rotation by mass transfer from their companion stars in low-mass x-ray binaries (LMXBs). The lack of MSPs and LMXBs rotating near breakup has been attributed to the accretion torque being balanced, at fast rotation, by gravitational radiation, perhaps caused by an unstable oscillation mode. It has been argued that internal dissipation involving hyperons may cause LMXBs to evolve into a quasisteady state, with nearly constant rotation rate, temperature, and mode amplitude. We show that MSPs descending from these LMXBs spend a long time in a similar state, as extremely steady sources of gravitational waves and thermal x rays, while they spin down due to gravitational radiation and the standard magnetic torque. Observed MSP braking torques already place meaningful constraints on this scenario.     

Group activity selection problem with approval preferences

We consider a setting where one has to organize one or several group activities for a set of agents. Each agent will participate in at most one activity, and her preferences over activities depend on the number of participants in the activity. The goal is to assign agents to activities based on their preferences in a way that is socially optimal and/or stable. We put forward a general model for this setting, which is a natural generalization of anonymous hedonic games. We then focus on a special case of our model where agents’ preferences are binary, i.e., each agent classifies all pairs of the form ‘(activity, group size)’ into ones that are acceptable and ones that are not. We formulate several solution concepts for this scenario, and study them from the computational point of view, providing hardness results for the general case as well as efficient algorithms for settings where agents’ preferences satisfy certain natural constraints.