The critical Neumann problem for semilinear elliptic equations with concave perturbations

We consider the semilinear Neumann problem involving the critical Sobolev exponent with an indefinite weight function and a concave purturbation. We prove the existence of two distinct solutions.      

Approximation algorithms for scheduling unrelated parallel machines

We consider the following scheduling problem. There arem parallel machines andn independent jobs. Each job is to be assigned to one of the machines. The processing of jobj on machinei requires timep _ij . The objective is to find a schedule that minimizes the makespan.Our main result is a polynomial algorithm which constructs a schedule that is guaranteed to be no longer than twice the optimum. We also present a polynomial approximation scheme for the case that the number of machines is fixed. Both approximation results are corollaries of a theorem about the relationship of a class of integer programming problems and their linear programming relaxations. In particular, we give a polynomial method to round the fractional extreme points of the linear program to integral points that nearly satisfy the constraints.In contrast to our main result, we prove that no polynomial algorithm can achieve a worst-case ratio less than 3/2 unlessP = NP. We finally obtain a complexity classification for all special cases with a fixed number of processing times.A preliminary version of this paper appeared in theProceedings of the 28th Annual IEEE Symposium on the Foundations of Computer Science (Computer Society Press of the IEEE, Washington, D.C., 1987) pp. 217–224.     

Statistical approach to the antiferromagnetic ground state problem

The statistical approach is adopted in an attempt to find the antiferromagnetic ground state. As a result an eigenstate of the Heisenberg hamiltonian is found which is not the true ground state, but which could serve as a useful starting point for other methods.The author is grateful to ing. P. Novák for valuable discussions.     

UV laser deposition of nanostructured Si/C/O/N/H from disilazane precursors and evolution to silicon oxycarbonitride

Megawatt ArF laser photolysis of gaseous methyldisilazanes [(CH₃)_nH_3?nSi]₂NH (n = 2, 3) in excess of Ar yields hydrocarbons (major volatile products), methylsilanes (minor volatile products) and allows chemical vapour deposition of solid amorphous Si/C/O/N/H powder containing Si? X (X? C, H, O, N) bonds. The incorporation of O is due to a high reactivity of the primarily formed products towards air moisture. The resulting solid materials possess nanometer‐sized texture and high specific area, contain Si‐centered radicals and anneal under argon to silicon oxycarbonitride, whose structure is described as a network of O‐ and N‐interconnected Si and C atoms. Copyright © 2006 John Wiley & Sons, Ltd.     

Strongly Exposed Points in the Ball of the Bergman Space

We investigate which boundary points in the closed unit ball of the Bergman space A¹ are strongly exposed. This requires study of the Bergman projection and its kernel, the annihilator of Bergman space. We show that all polynomials in the boundary of the unit ball are strongly exposed.     

Quantum chemical investigation of the adsorption of methanol on a cluster model of faujasite

The adsorption of methanol in zeolites of the faujasite type with sodium and calcium counter ions is studied with quantum chemical methods. The zeolite is represented with a cluster model allowing calculations at the Møller-Plesset as well as the DFT level of theory. An adsorption energy of −62.4 kJ/mol is calculated at the MP2/TZVP//BP86/TZVP level of theory for one methanol molecule at one site II sodium cation. Insight into the adsorption process is obtained with a three-body decomposition which reveals a strong destabilisation of the adsorption strength by large, positive three-body terms, which is important for force field development.     

Fine-grained forward-secure signature schemes without random oracles

We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-secure signature schemes do but, in addition, allow the signer to specify which signatures of the current time period remain valid when revoking the public key. This is an important advantage if the signer produces many signatures per time period as otherwise the signer would have to re-issue those signatures (and possibly re-negotiate the respective messages) with a new key.Apart from a formal model for fine-grained forward-secure signature schemes, we present practical schemes and prove them secure under the strong RSA assumption only, i.e., we do not resort to the random oracle model to prove security. As a side-result, we provide an ordinary forward-secure scheme whose key-update time is significantly smaller than that of known schemes which are secure without assuming random oracles.