Nondifferentiable optimization via smooth approximation: General analytical approach

In this paper we present a method for nondifferentiable optimization, based on smoothed functionals which preserve such useful properties of the original function as convexity and continuous differentiability. We show that smoothed functionals are convenient for implementation on computers. We also show how some earlier results in nondifferentiable optimization based on smoothing-out of kink points can be fitted into the framework of smoothed functionals. We obtain polynomial approximations of any order from smoothed functionals with kernels given by Beta distributions. Applications of smoothed functionals to optimization of min-max and other problems are also discussed.     

Robust method of manufacturing rubber waste‐based water repellent surfaces

A novel method of rubber waste recycling is presented. Shredded rubber is processed into a biomimetic superhydrophobic material demonstrating high apparent contact angles (APCAs). Wetting properties of the obtained surfaces are reported. The presented method of rubber waste processing is robust, inexpensive and promises a good potential for building industry. Copyright © 2008 John Wiley & Sons, Ltd.     

The Gibbs Cloner for Combinatorial Optimization, Counting and Sampling

We present a randomized algorithm, called the cloning algorithm, for approximating the solutions of quite general NP-hard combinatorial optimization problems, counting, rare-event estimation and uniform sampling on complex regions. Similar to the algorithms of Diaconis–Holmes–Ross and Botev–Kroese the cloning algorithm is based on the MCMC (Gibbs) sampler equipped with an importance sampling pdf and, as usual for randomized algorithms, it uses a sequential sampling plan to decompose a “difficult” problem into a sequence of “easy” ones. The cloning algorithm combines the best features of the Diaconis–Holmes–Ross and the Botev–Kroese. In addition to some other enhancements, it has a special mechanism, called the “cloning” device, which makes the cloning algorithm, also called the Gibbs cloner fast and accurate. We believe that it is the fastest and the most accurate randomized algorithm for counting known so far. In addition it is well suited for solving problems associated with the Boltzmann distribution, like estimating the partition functions in an Ising model. We also present a combined version of the cloning and cross-entropy (CE) algorithms. We prove the polynomial complexity of a particular version of the Gibbs cloner for counting. We finally present efficient numerical results with the Gibbs cloner and the combined version, while solving quite general integer and combinatorial optimization problems as well as counting ones, like SAT.     

Energy Mechanism of Charges Analyzed in Real Current Environment

We analyze in this work the energy transfer process of accelerated charges, the mass fluctuations accompanying this process, and their inertial properties. Based on a previous work, we use here the dipole antenna, which is a very convenient framework for such analysis, for analyzing those characteristics. We show that the radiation process can be viewed by two energy transfer processes: one from the energy source to the charges and the second from the charges into the surrounding space. Those processes, not being in phase, result in mass fluctuations. The same principle is true during absorption. We show that in a transient period between absorption and radiation the dipole antenna gains mass according to the amount of absorbed energy and loses this mass as radiated energy. We rigorously prove that the gain of mass, resulting from electrical interaction has inertial properties in the sense of Newton's third low. We arrive to this result by modeling the reacting spacetime region by an electric dipole.     

Exploiting locality: approximating sorting buffers

The sorting buffers problem is motivated by many applications in manufacturing processes and computer science, among them car-painting and file servers architecture. The input is a sequence of items of various types. All the items must be processed, one by one, by a service station. We are given a random-access sorting buffer with a limited capacity. Whenever a new item arrives it may be moved directly to the service station or stored in the buffer. Also, at any time items can be removed from the buffer and assigned to the service station. Our goal is to give the service station a sequence of items with minimum type transitions. We generalize the problem to allow items with different sizes and type transitions with different costs. We give a polynomial-time 9-approximation algorithm for the maximization variant of this problem, which improves the best previously known 20-approximation algorithm.     

Scale-free networks are ultrasmall

We study the diameter, or the mean distance between sites, in a scale-free network, having N sites and degree distribution p(k) proportional, variant k(-lambda), i.e., the probability of having k links outgoing from a site. In contrast to the diameter of regular random networks or small-world networks, which is known to be d approximately ln(N, we show, using analytical arguments, that scale-free networks with 23, d approximately ln(N. We also show that, for any lambda>2, one can construct a deterministic scale-free network with d approximately ln(ln(N, which is the lowest possible diameter.     

Fluorescence Polarization as a Functional Parameter in Monitoring Living Cells: Theory and Practice

The use of fluorescence polarization as a functional parameter in monitoring cellular activation calls for the reliable and accurate measurement of the fluorescence intensity and polarization (FI and FP) of microscopic objects. The relevant experimental parameters that enter such measurements are thoroughly discussed. The possibility of executing FP measurements properly by flow-through systems is compared with that of static cytometry. Remarks on the effects of high-power excitation on markers and cells conclude the paper.     

Computer simulation of an energy transfer dye laser (ETDL)

Computer calculations of an energy transfer dye laser (ETDL) performance are presented. It is shown that the ETDL output can be manipulated by varying the donor or acceptor concentrations. Experiments done on the anthracene-perylene ETDL are in agreement with the predictions of the present calculation.     

Archetypical Conductive Polymer Structure for Specific Interaction with Proteins

A series of 2,4-dinitrophenyl (DNP) functionalized polypyrrole terpolymers, capable of specific binding to IgE antibodies (proteins), have been synthesized using oxidizing initiator, ammonium persulfate and were characterized by ¹H-NMR, IR, DSC, Light Scattering etc. The terpolymers were composed of monomers and macromonomers: monomer (pyrrole), macromonomer A (pyrrole with pendant ethylene glycol) and macromonomer B (pyrrole with pendant DNP) with specific functionality of conductance, processiblity and binding, respectively. The terpolymers are found to be semiconductive, (5 × 10^?6 S cm^?1) by itself without the addition of doping agents. Molecular dynamics simulation of terpolymer shows that the DNP-(2,4-dinitrophenyl) functional group extends out from the polymer backbone and thus, is available for binding. The DNP functional groups on the terpolymer achieve steady state binding with anti-DNP IgE proteins at nanomolar concentrations in solution. The terpolymer was blended with sulfonated polystyrene and processed in fibers which exhibited effective specific binding to fluorescently tagged IgE proteins and therefore, possessed the potential to be an active component in biosensor.