On JB-Rings

A ring R is a QB-ring provided that aR bR=R with a,b∈R implies that there exists a y∈R such that a by∈R_q~(-1).It is said that a ring R is a JB-ring provided that R/J(R)is a QB-ring,where J(R)is the Jacobson radical of R.In this paper,various necessary and sufficient conditions,under which a ring is a JB-ring,are established.It is proved that JB-rings can be characterized by pseudo-similarity.Furthermore,the author proves that R is a JB-ring iff so is R/J(R)~2.     

Performance safety enforcement in stochastic event graphs against boost and slow attacks

This paper studies a performance safety enforcing problem in stochastic event graphs, a subclass of stochastic Petri net models. We assume that an intruder can attack part of the transitions to increase/decrease their firing rate such that the performance of the system violates a given safety interval. The difficulty in solving this problem is that the capability of the intruder, i.e., the number of transitions that can be simultaneously attacked, is limited. The control aim is to find a protecting policy such that the performance of the protected plant is guaranteed to be in a given safety interval. We show that this problem can be formulated as a two-player game between the intruder and the operator of the plant. By using mixed integer linear programming technique, we develop a heuristic method to compute a protecting policy that is locally optimal.     

Totally compatible associative and Lie dialgebras, tridendriform algebras and PostLie algebras

This paper studies the concepts of a totally compatible dialgebra and a totally compatible Lie dialgebra,defined to be a vector space with two binary operations that satisfy individual and mixed associativity conditions and Lie algebra conditions respectively.We show that totally compatible dialgebras are closely related to bimodule algebras and semi-homomorphisms.More significantly,Rota-Baxter operators on totally compatible dialgebras provide a uniform framework to generalize known results that Rota-Baxter related operators give tridendriform algebras.Free totally compatible dialgebras are constructed.We also show that a Rota-Baxter operator on a totally compatible Lie dialgebra gives rise to a PostLie algebra,generalizing the fact that a Rota-Baxter operator on a Lie algebra gives rise to a PostLie algebra.     

The Max-Flow Min-Cut theorem for countable networks

We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are “orthogonal” to each other, in the sense that the flow saturates the cut and is zero on the reverse cut. If the network does not contain infinite trails then this flow can be chosen to be mundane, i.e. to be a sum of flows along finite paths. We show that in the presence of infinite trails there may be no orthogonal pair of a cut and a mundane flow. We finally show that for locally finite networks there is an orthogonal pair of a cut and a flow that satisfies Kirchhoff's first law also for ends.     

Star partitions on graphs

Given an undirected graph, a star partition is a partition of the nodes into subsets with at least two nodes so that the subgraph induced by each subset has a spanning star. Star partitions are related to well-known problems concerning domination in graphs and edge covering. We focus on the Constrained Star Partition Problem (CSP) that asks for finding a star partition of given cardinality. The problem is new and presents interesting peculiarities. We explore the relation between the cardinalities of star partitions and domatic bipartitions, showing that there are star partitions of any cardinality between minimum and maximum values, and that a similar but weaker result holds for domatic bipartitions. We study the computational complexity of different versions of star partition and domatic bipartition problems, proving that most of them, in particular CSP, constrained domatic bipartition and balanced domatic bipartition, are NP-complete. We also show that star partition problems are polynomial on trees and, more generally, on bounded treewidth graphs. We introduce an integer linear programming formulation that defines a polytope containing all the star partitions of a graph, showing that its vertices have only integral components for trees, which implies that linear programming can be used to solve weighted star partition problems on trees.     

Center projections for smooth difference equations of mixed type

We study a class of mixed type difference equations that enjoy a special smoothening property, in the sense that solutions automatically satisfy an associated functional differential equation of mixed type. Using this connection, a finite dimensional center manifold is constructed that captures all solutions that remain sufficiently close to an equilibrium. The results enable a rigorous analysis of a recently developed model in economic theory, that exhibits periodic oscillations in the interest rates of a simple economy of overlapping generations.     

Uniqueness for a seismic inverse source problem modeling a subsonic rupture

We consider an inverse source problem for an inhomogeneous wave equation with discrete-in-time sources, modeling a seismic rupture. The inverse source problem, with an arbitrary source term on the right-hand side of the wave equation, is not uniquely solvable. Here we formulate conditions on the source term that allow us to show uniqueness and that provide a reasonable model for the application of interest. We assume that the source term is supported on a finite set of times and that the support in space moves with subsonic velocity. Moreover, we assume that the spatial part of the source is singular on a hypersurface, an application being a seismic rupture along a fault plane. Given data collected over time on a detection surface that encloses the spatial projection of the support of the source, we show how to recover the times and locations of sources microlocally and then reconstruct the smooth part of the source assuming that it is the same at each source location.     

Mathematical models of innovation diffusion with stage structure

Mathematical models with stage structures are proposed to describe the process of awareness, evaluation and decision-making. First, a system of ordinary differential equations is presented that incorporates the awareness stage and the decision-making stage. If the adoption rate is bilinear and imitations are dominant, we find a threshold above which innovation diffusion is successful. Further, if the adoption rate has a higher nonlinearity, it is shown that there exist bistable equilibria and a region such that an innovation diffusion is successful inside and is unsuccessful outside. Secondly, a model with a time delay is proposed that includes an evaluation stage of a product. It is proved that the system exhibits stability switches. The bifurcation direction of equilibria is also discussed.     

Convergence to a second-order point of a trust-region algorithm with a nonmonotonic penalty parameter for constrained optimization

In a recent paper (Ref. 1), the author proposed a trust-region algorithm for solving the problem of minimizing a nonlinear function subject to a set of equality constraints. The main feature of the algorithm is that the penalty parameter in the merit function can be decreased whenever it is warranted. He studied the behavior of the penalty parameter and proved several global and local convergence results. One of these results is that there exists a subsequence of the iterates generated by the algorithm that converges to a point that satisfies the first-order necessary conditions.In the current paper, we show that, for this algorithm, there exists a subsequence of iterates that converges to a point that satisfies both the first-order and the second-order necessary conditions.This research was supported by the Rice University Center for Research on Parallel Computation, Grant R31853, and the REDI Foundation.     

Generalising a characterisation of Hermitian curves

This article proves a characterisation of the classical unital that is a generalisation of a characterisation proved in 1982 by Lefèvre-Percsy. It is shown that if is a Buekenhout-Metz unital with respect to a line in such that a line of not through meets in a Baer subline, then is classical. An immediate corollary is that if is a unital in PG such that is Buekenhout-Metz with respect to two distinct lines, then is classical. Received 5 August 1999; revised 15 February 2000.     

Oscillations in three-reaction quadratic mass-action systems

It is known that rank-two bimolecular mass-action systems do not admit limit cycles. With a view to understanding which small mass-action systems admit oscillation, in this paper we study rank-two networks with bimolecular source complexes but allow target complexes with higher molecularities. As our goal is to find oscillatory networks of minimal size, we focus on networks with three reactions, the minimum number that is required for oscillation. However, some of our intermediate results are valid in greater generality. One key finding is that an isolated periodic orbit cannot occur in a three-reaction, trimolecular, mass-action system with bimolecular sources. In fact, we characterize all networks in this class that admit a periodic orbit; in every case, all nearby orbits are periodic too. Apart from the well-known Lotka and Ivanova reactions, we identify another network in this class that admits a center. This new network exhibits a vertical Andronov–Hopf bifurcation. Furthermore, we characterize all two-species, three-reaction, bimolecular-sourced networks that admit an Andronov–Hopf bifurcation with mass-action kinetics. These include two families of networks that admit a supercritical Andronov–Hopf bifurcation and hence a stable limit cycle. These networks necessarily have a target complex with a molecularity of at least four, and it turns out that there are exactly four such networks that are tetramolecular.     

Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace

We present a logspace algorithm that constructs a canonical intersection model for a given proper circular-arc graph, where canonical means that isomorphic graphs receive identical models. This implies that the recognition and the isomorphism problems for these graphs are solvable in logspace. For the broader class of concave-round graphs, which still possess (not necessarily proper) circular-arc models, we show that a canonical circular-arc model can also be constructed in logspace. As a building block for these results, we design a logspace algorithm for computing canonical circular-arc models of circular-arc hypergraphs. This class of hypergraphs corresponds to matrices with the circular ones property, which play an important role in computational genomics. Our results imply that there is a logspace algorithm that decides whether a given matrix has this property.Furthermore, we consider the Star System Problem that consists in reconstructing a graph from its closed neighborhood hypergraph. We show that this problem is solvable in logarithmic space for the classes of proper circular-arc, concave-round, and co-convex graphs.Note that solving a problem in logspace implies that it is solvable by a parallel algorithm of the class AC¹. For the problems under consideration, at most AC² algorithms were known earlier.     

A consistent set of infinite-order probabilities

Some philosophers have claimed that it is meaningless or paradoxical to consider the probability of a probability. Others have however argued that second-order probabilities do not pose any particular problem. We side with the latter group. On condition that the relevant distinctions are taken into account, second-order probabilities can be shown to be perfectly consistent.May the same be said of an infinite hierarchy of higher-order probabilities? Is it consistent to speak of a probability of a probability, and of a probability of a probability of a probability, and so on, ad infinitum? We argue that it is, for it can be shown that there exists an infinite system of probabilities that has a model. In particular, we define a regress of higher-order probabilities that leads to a convergent series which determines an infinite-order probability value. We demonstrate the consistency of the regress by constructing a model based on coin-making machines.     

Distributional radius of curvature

We show that any continuous plane path that turns to the left has a well‐defined distribution that corresponds to the radius of curvature of smooth paths. We show that the distributional radius of curvature determines the path uniquely except for a translation. We show that Dirac delta contributions in the radius of curvature correspond to facets, that is, flat sections of the path, and show how a path can be deformed into a facet by letting the radius of curvature approach a delta function. Copyright © 2005 John Wiley & Sons, Ltd.     

On sequences of Hurwitz polynomials related to orthogonal polynomials

ABSTRACT

In this contribution, we explore the well-known connection between Hurwitz and orthogonal polynomials. Namely, given a Hurwitz polynomial, it is shown that it can be decomposed into two parts: a polynomial that is orthogonal with respect to some positive measure supported in the positive real axis and its corresponding second-kind polynomial. Conversely, given a sequence of orthogonal polynomials with respect to a positive measure supported in the positive real axis, a sequence of Hurwitz polynomials can be constructed. Based on that connection, we construct sequences of Hurwitz polynomials that satisfy a recurrence relation, in a similar way as the orthogonal polynomials do. Even more, we present a way to construct families of Hurwitz polynomials using two sequences of parameters and a recurrence relation that constitutes an analogue of Favard's theorem in the theory of orthogonal polynomials.     

Stock repurchase with an adaptive reservation price: A study of the greedy policy

We consider the problem of stock repurchase over a finite time horizon. We assume that a firm has a reservation price for the stock, which is the highest price that the firm is willing to pay to repurchase its own stock. We characterize the optimal policy for the trader to maximize the total number of shares that they can buy over a fixed time horizon. In particular, we study a greedy policy, which involves in each period buying a quantity that drives stock price to the reservation price.     

Stepsize analysis for descent methods

The convergence rates of descent methods with different stepsize rules are compared. Among the stepsize rules considered are: constant stepsize, exact minimization along a line, Goldstein-Armijo rules, and stepsize equal to that which yields the minimum of certain interpolatory polynomials. One of the major results shown is that the rate of convergence of descent methods with the Goldstein-Armijo stepsize rules can be made as close as desired to the rate of convergence of methods that require exact minimization along a line. Also, a descent algorithm that combines a Goldstein-Armijo stepsize rule with a secant-type step is presented. It is shown that this algorithm has a convergence rate equal to the convergence of descent methods that require exact minimization along a line and that, eventually (i.e., near the minimum), it does not require a search to determine an acceptable stepsize.     

Analytical Formulation of the Classical Friction Model for Motion Analysis and Simulation

Starting from a precise definition of friction torque when velocity vanishes that distinguishes the case of instantaneous zero crossing from that where the velocity is zero over a time interval, this paper proposes a compact analytical formulation of the classical discontinuous friction model that is useful for motion analysis. A finite state machine that allows a numerically robust computation of motion equations when velocity vanishes or motion restarts is then defined. Simulation results show that the discontinuous model can be seen as an asymptotic approximation, infinitely fast, of a recently proposed continuous, dynamic friction model.     

Weakly supercyclic operators

Inspired by a recent result that a weakly hypercyclic operator may fail to be norm hypercyclic, we show there exists a weakly supercyclic operator that fails to be norm supercyclic. Moreover, despite a classical result of Hilden and Wallen that every unilateral weighted backward shift is supercyclic, we show such an operator may have a weakly supercyclic vector that is not a norm supercyclic vector. In addition to these results, we extend a result of Kitai by showing a hyponormal operator cannot be weakly hypercyclic.     

Optimization in “self‐modeling” complex adaptive systems

When a dynamical system with multiple point attractors is released from an arbitrary initial condition, it will relax into a configuration that locally resolves the constraints or opposing forces between interdependent state variables. However, when there are many conflicting interdependencies between variables, finding a configuration that globally optimizes these constraints by this method is unlikely or may take many attempts. Here, we show that a simple distributed mechanism can incrementally alter a dynamical system such that it finds lower energy configurations, more reliably and more quickly. Specifically, when Hebbian learning is applied to the connections of a simple dynamical system undergoing repeated relaxation, the system will develop an associative memory that amplifies a subset of its own attractor states. This modifies the dynamics of the system such that its ability to find configurations that minimize total system energy, and globally resolve conflicts between interdependent variables, is enhanced. Moreover, we show that the system is not merely “recalling” low energy states that have been previously visited but “predicting” their location by generalizing over local attractor states that have already been visited. This “self‐modeling” framework, i.e., a system that augments its behavior with an associative memory of its own attractors, helps us better understand the conditions under which a simple locally mediated mechanism of self‐organization can promote significantly enhanced global resolution of conflicts between the components of a complex adaptive system. We illustrate this process in random and modular network constraint problems equivalent to graph coloring and distributed task allocation problems. © 2010 Wiley Periodicals, Inc. Complexity 16: 17–26, 2011