Local Minimizers of the Ginzburg-Landau Energy with Magnetic Field in Three Dimensions

We establish the existence of locally minimizing vortex solutions to the full Ginzburg-Landau energy in three dimensional simply-connected domains with or without the presence of an applied magnetic field. The approach is based upon the theory of weak Jacobians and applies to nonconvex sample geometries for which there exists a configuration of locally shortest line segments with endpoints on the boundary.Research partially supported by NSERC grant number 261955     

Continuously coupled parametric generators and their quantum statistics

In this paper the quantum-statistical properties of light beams propagating in a directional nonlinear coupler are investigated. This device is composed of a pair of linearly coupled nonlinear waveguides operating by means of degenerate parametric downconversion. The possibility of generation of nonclassical states of light in single and compound modes, using the short-length approximation, is discussed. Influence of linear and nonlinear mismatches for generation of nonclassical light is taken into account. This work was supported by Project LN00A015, Research Project No. CEZ: J14/98 and the COST project OC P11.003 of the Czech Ministry of Education.     

Loading aircraft for military operations

In this paper, we describe an aircraft loading problem submitted by the French military agency (DGA) as part of a more general military airlift planning problem. It can be viewed as a kind of bi-dimensional bin-packing problem, with heterogeneous bins and several additional constraints. We introduce two-phase methods for solving this NP-hard problem. The first phase consists in building good initial solutions, thanks to two fast algorithms: a list-based heuristic and a loading pattern generation method. Both algorithms call a constraint-based subroutine, able to determine quickly if the items already loaded can be reshuffled to accommodate a new object. The second phase improves these preliminary solutions using local search techniques. Results obtained on real data sets are presented.     

ON THE RATE OF WEIGHTED Lp CONVERGENCE BY THE GRUENWALD INTERPOLATORY OPERATORS

This paper gives the weighted Lp convergence rate estimations of the Gruenwald interpolatory polynomials based on the zeros of Chebyshev polymomials of the first kind,and proves that the order of the estimations is optimal for p≥1.     

Reply to Nathan: How to reconstruct the causal argument

Nicholas Nathan tries to resist the current version of the causal argument for sense-data in two ways. First he suggests that, on what he considers to be the correct re-construction of the argument, it equivocates on the sense of proximate cause. Second he defends a form of disjunctivism, by claiming that there might be an extra mechanism involved in producing veridical hallucination, that is not present in perception. I argue that Nathan’s reconstruction of the argument is not the appropriate one, and that, properly interpreted, the argument does not equivocate on proximate cause. Furthermore, I claim that his postulation of a modified mechanism for hallucinations is implausibly ad hoc.     

On the bounded version of Hilbert's tenth problem

 The paper establishes lower bounds on the provability of 𝒟=NP and the MRDP theorem in weak fragments of arithmetic. The theory I ⁵ E ₁ is shown to be unable to prove 𝒟=NP. This non-provability result is used to show that I ⁵ E ₁ cannot prove the MRDP theorem. On the other hand it is shown that I ¹ E ₁ proves 𝒟 contains all predicates of the form (∀i≤|b|)P(i,x)^Q(i,x) where ^ is =, <, or ≤, and I ⁰ E ₁ proves 𝒟 contains all predicates of the form (∀i≤b)P(i,x)=Q(i,x). Here P and Q are polynomials. A conjecture is made that 𝒟 contains NLOGTIME. However, it is shown that this conjecture would not be sufficient to imply 𝒟=N P. Weak reductions to equality are then considered as a way of showing 𝒟=NP. It is shown that the bit-wise less than predicate, ≤₂, and equality are both co-NLOGTIME complete under FDLOGTIME reductions. This is used to show that if the FDLOGTIME functions are definable in 𝒟 then 𝒟=N P. Received: 13 July 2001 / Revised version: 9 April 2002 / Published online: 19 December 2002 Key words or phrases: Bounded Arithmetic – Bounded Diophantine Complexity     

Automorphisms with only infinite orbits on non-algebraic elements

 This paper generalizes results of F. K?rner from [4] where she established the existence of maximal automorphisms (i.e. automorphisms moving all non-algebraic elements). An ω-maximal automorphism is an automorphism whose powers are maximal automorphisms. We prove that any structure has an elementary extension with an ω-maximal automorphism. We also show the existence of ω-maximal automorphisms in all countable arithmetically saturated structures. Further we describe the pairs of tuples (ˉa,ˉb) for which there is an ω-maximal automorphism mapping ˉa to ˉb. Received: 12 December 2001 / Published online: 10 October 2002 Supported by the ``Fonds pour la Formation à la Recherche dans l'Industrie et dans l'Agriculture' Mathematics Subject Classification (2000): Primary: 03C50; Secondary: 03C57 Key words or phrases: Automorphism – Recursively saturated structure     

On a compromise social choice correspondence

This paper analyzes the compromise social choice correspondence derived from the τ-value of digraph games. Monotonicity of this correspondence is shown. A connection between several properties of social choice correspondences based on game theoretical solutions and game theoretical properties of the underlying solutions is given. Applications to several game theoretic solutions are provided.     

Study on the Binding Characteristic of S-Naproxen Imprinted Polymer and the Interactions between Templates and Monomers

S-naproxen imprinted polymer was prepared with acrylamide as a functional monomer, 1,4-butanediyl diacrylate as a new kind of crossliner, and 2,4,6-trimethylbenzoylphenyl-phosphinic acid ethyl ester as photoinitiator. Their UV and IR spectra were applied to study the interactions between the template and the monomer. Binding experiments showed that the S-naproxen imprinted polymer had better recognition capability for the template than that of a blank polymer. The adsorption distribution coefficient KD of S-naproxen on molecularly-imprinted polymer was 153.2 g/mL, and the separation factor was 1.95 when the initial concentration of substrate was 2.0 mmol/L. Scatchard curves suggested that there were two classes of binding sites in the imprinted polymer and only one class in the blank polymer. Computer simulation using Hyperchem showed the existence of the interactions between the template and the functional monomer as well as the models of the complexes formed by the template and the monomer.