A branch-and-bound method for the minimum k−enclosing ball problem

The minimum k-enclosing ball problem seeks the ball with smallest radius that contains at least k of m given points. This problem is NP-hard. We present a branch-and-bound algorithm on the tree of the subsets of k points to solve this problem. Our method is able to solve the problem exactly in a short amount of time for small and medium sized datasets.     

Nano-sized Cu(II) and Zn(II) complexes and their use as a precursor for synthesis of CuO and ZnO nanoparticles: A study on their sonochemical synthesis,characterization, and DNA-binding/cleavage,anticancer, and antimicrobial activities

Two new divalent copper (C1) and zinc (C2) chelates having the formulae [M(PIMC)₂] (where M = Cu(II), Zn(II) and PIMC = Ligand [(E)-3-(((3-hydroxypyridin-2-yl)imino)methyl)-4H-chromen-4-one] were obtained and characterized by several techniques. Structures and geometries of the synthesized complexes were judged based on the results of alternative analytical and spectral tools supporting the proposed formulae. IR spectral data confirmed the coordination of the ligands to the copper and zinc centers as monobasic tridentate in the enol form. Thermal analysis, UV-Vis spectra and magnetic moment confirmed the geometry around the copper center to be tetrahedral, square pyramidal and octahedral. Study of the binding ability of the synthesized compounds with Circulating tumor DNA (CT-DNA) bas been evaluated applying UV-Vis spectral titration and viscosity measurements. The copper and zinc oxides were achieved from the copper and zinc nano-particles structures Schiff base complexes as the raw material after calcination for 5 hr at 600°C. On the other hand, synthesized of C1 and C2 NPs were used as suitable precursors to the preparation of CuO and ZnO NPs. Finally, the synthesized of the two complexes exhibited enhanced activity against the tested bacterial (Staphylococcus aureus and Escherichia Coli) and fungal strains (Candida albicans and Aspergillus fumigatus) as compared to HPIMC. Among all these synthesized compounds, C1 exhibits good cleaving ability compared to other newly synthesized C2.     

Perturbative manifolds and the Noether generators of nth-order Poisson equations

A manifold that contains small perturbations will induce a perturbed partial differential equation. The partial differential equation that we select is the Poisson equation – in order to explore the interplay between the geometry of the manifold and the perturbations. Specifically, we show how the problem of symmetry determination, for higher-order perturbations, can be elegantly expressed via geometric conditions.     

Heisenberg群上Laplace算子的离散谱

本文证明了Heisenberg群上Laplace算子的Dirichlet特征值的存在性，给出了特征值的估计     

Congruence criteria for finite subsets of complex projective and complex hyperbolic spaces

We investigate congruence classes and direct congruence classes of m-tuples in the complex projective space ℂP ⁿ . For direct congruence one allows only isometries which are induced by linear (instead of semilinear) mappings. We establish a canonical bijection between the set of direct congruence classes of m-tuples of points in ℂP ⁿ and the set of equivalence classes of positive semidefinite Hermitean m×m-matrices of rank at most n+1 with 1's on the diagonal. As a corollary we get that the direct congruence class of an m-tuple is uniquely determined by the direct congruence classes of all of its triangles, provided that no pair of points of the m-tuple has distance π/2. Examples show that the situation changes drastically if one replaces direct congruence classes by congruence classes or if distances π/2 are allowed. Finally we do the same kind of investigation also for the complex hyperbolic space ℂH ⁿ . Most of the results are completely analogous, however, there are also some interesting differences. Received: 15 January 1996     

A dual graph-norm refinement indicator for finite volume approximations of the Euler equations

Summary. We generalise and apply a refinement indicator of the type originally designed by Mackenzie, Süli and Warnecke in [15] and [16] for linear Friedrichs systems to the Euler equations of inviscid, compressible fluid flow. The Euler equations are symmetrized by means of entropy variables and locally linearized about a constant state to obtain a symmetric hyperbolic system to which an a posteriori error analysis of the type introduced in [15] can be applied. We discuss the details of the implementation of the refinement indicator into the DLR--Code which is based on a finite volume method of box type on an unstructured grid and present numerical results. Received May 15, 1995 / Revised version received April 17, 1996     

A posteriori error estimation with finite element methods of lines for one-dimensional parabolic systems

Summary Consider the solution of one-dimensional linear initial-boundary value problems by a finite element method of lines using a piecewiseP ^th -degree polynomial basis. A posteriori estimates of the discretization error are obtained as the solutions of either local parabolic or local elliptic finite element problems using piecewise polynomial corrections of degreep+1 that vanish at element ends. Error estimates computed in this manner are shown to converge in energy under mesh refinement to the exact finite element discretization error. Computational results indicate that the error estimates are robust over a wide range of mesh spacings and polynomial degrees and are, furthermore, applicable in situations that are not supported by the analysis.This research was partially supported by the U.S. Air Force Office of Scientific Research, Air Force Systems Command, USAF, under Grant Number AFOSR 90-0194; by the U.S. Army Research Office under Contract Number DAAL03-91-G-0215; and by the National Science Foundation under Institutional Infrastructure Grant Number CDA-8805910     

On the Moments of Overflow and Freed Carried Traffic for the GI/M/C/0 System

In circuit-switched networks call streams are characterized by their mean and peakedness (two-moment method). The GI/M/C/0 system is used to model a single link, where the GI-stream is determined by fitting moments appropriately. For the moments of the overflow traffic of a GI/M/C/0 system there are efficient numerical algorithms available. However, for the moments of the freed carried traffic, defined as the moments of a virtual link of infinite capacity to which the process of calls accepted by the link (carried arrival process) is virtually directed and where the virtual calls get fresh exponential i.i.d. holding times, only complex numerical algorithms are available. This is the reason why the concept of the freed carried traffic is not used. The main result of this paper is a numerically stable and efficient algorithm for computing the moments of freed carried traffic, in particular an explicit formula for its peakedness. This result offers a unified handling of both overflow and carried traffics in networks. Furthermore, some refined characteristics for the overflow and freed carried streams are derived.