Given a set V of n points in a two-dimensional plane, we give an O(n log n)-time centralized algorithm that constructs a planar t-spanner for V , for t = ρ(α) = max{2 , π sin α 2 + 1} · Cdel, such that the degree of each node is bounded from above by 19 + d 2π α e, where 0 < α < π/2 is an adjustable parameter. Here Cdel is the spanning ratio of the Delaunay triangulation, which is at most 4 √ 3...

This paper presents a novel training algorithm for computationally intelligent architectures, whose outputs are differentiable with respect to the adjustable design parameters. The algorithm combines the gradient descent technique with variable structure systems approach. The combination is performed by expressing the conventional weight update rule in continuous time and application of sliding...

Kinetic analysis of the dynamics as measured in multiequilibria systems is readily attained by curve-fitting methodologies, a treatment that can accurately retrace the shape of the measured signal. Still, these reconstructions are not related to the detailed mechanism of the process. In this study we subjected multiple proton transfer reactions to rigorous kinetic analysis, which consists of so...

The coupled processes of intermolecular photoinduced forward electron transfer and geminate recombination between the (hole) donor (Rhodamine 3B) and (hole) acceptors (N,N-dimethylaniline) are studied in three molecular liquids: acetonitrile, butyronitrile, and benzonitrile. Two color pump-probe experiments on time scales from approximately 100 fs to hundreds of picoseconds give information abo...

Models in computational biology, such as those used in binding, docking, and folding, are often empirical and have adjustable parameters. Because few of these models are yet fully predictive, the problem may be nonoptimal choices of parameters. We describe an algorithm called ENPOP (energy function parameter optimization) that improves-and sometimes optimizes-the parameters for any given model ...

Concepts of the modified and the excess Walden products are introduced and discussed when applied together with the ordinary Walden product. The existence of the universal curves of limiting conductances for electrolytes (or for ions) in a given pair of solvents are further examined for a number of mixtures which include ethanol, 2-propanol, 1,1,1,3,3,3hexafluoro-2-propanol, N,N,-dimethylformam...

Standard particle swarm optimization (SPSO) algorithm was modified by escape strategy of the particle velocity, and an escape PSO (EPSO) was proposed to overcome the shortcomings of being trapped in local optima because of premature convergence. To enhance the performance of radial basis function (RBF) neural network, the EPSO is combined with RBF neural network to form a EPSON hybrid algorithm...

Given a set V of n points in a two-dimensional plane, we give an O(n logn)-time centralized algorithm that constructs a planar t-spanner for V , for t ≤ max{2 , π sin α2 +1} ·Cdel, such that the degree of each node is bounded from above by 19+ 2π α , and the total edge length is proportional to the weight of the minimum spanning tree of V , where 0 < α < π/2 is an adjustable parameter. Here Cde...

In this article, we propose a practicable quantized sampled velocity data coupling protocol for synchronization of set harmonic oscillators. The is designed in way via interconnecting the velocities encoded by uniform quantizer with zooming parameter either fixed or an adjustable form over directed communication network. By constructing suitable norm to measure convergence errors, establish suf...

This paper proposes an adaptive approximation-based controller for uncertain strict-feedback nonlinear systems with unknown dead-zone nonlinearity. Dead-zone constraint is represented as a combination of a linear system with a disturbance-like term. This work invokes neural networks (NNs) as a linear-in-parameter approximator to model uncertain nonlinear functions that appear in virtual and act...