Minimality considerations for graph energy over a class of graphs

Let G be a graph on n vertices, and let CHP(G;λ) be the characteristic polynomial of its adjacency matrix A(G). All n roots of CHP(G;λ), denoted by , are called to be its eigenvalues. The energy E(G) of a graph G, is the sum of absolute values of all eigenvalues, namely, . Let be the set of n-vertex unicyclic graphs, the graphs with n vertices and n edges. A fully loaded unicyclic graph is a unicyclic graph taken from with the property that there exists no vertex with degree less than 3 in its unique cycle. Let be the set of fully loaded unicyclic graphs. In this article, the graphs in with minimal and second-minimal energies are uniquely determined, respectively.     

Rewrite-Based Decision Procedures

The rewrite-based approach to satisfiability modulo theories consists of using generic theorem-proving strategies for first-order logic with equality. If one can prove that an inference system generates finitely many clauses from the presentation of a theory and a finite set of ground unit clauses, then any fair strategy based on that system can be used as a -satisfiability procedure. In this paper, we introduce a set of sufficient conditions to generalize the entire framework of rewrite-based -satisfiability procedures to rewrite-based -decision procedures. These conditions, collectively termed subterm-inactivity, will allow us to obtain rewrite-based -decision procedures for several theories, namely those of equality with uninterpreted functions, arrays with or without extensionality and two of its extensions, finite sets with extensionality and recursive data structures.     

An algorithm to generate all upper boundary points for in terms of minimal cuts

This paper discusses a stochastic-flow network from single-commodity case to multicommodity case. We propose a performance index, namely the probability that the upper bound of the system capacity is a given vector subject to the budget constraint, to evaluate the quality level for such a network. A simple approach based on minimal cuts is presented to generate the all upper boundary points for the demand subject to the budget B in order to evaluate the performance index.     

Output feedback control of a class of stochastic hybrid systems

This paper deals with static output feedback control of a class of reconfigurable systems with Markovian Parameters and state-dependent noise. The main contribution is to formulate conditions for multi-performance design related to this class of stochastic hybrid systems. The specifications and objectives under consideration include stochastic stability, and performances. Another problem related to a more general class of stochastic hybrid systems, known as Markovian Jump Linear Systems (MJLS), is also addressed. This problem concerns the mode-independent output feedback control of MJLS. The obtained results are illustrated on a numerical example.     

-admissibility of the right-shift semigroup on

It is shown that the right-shift semigroup on does not satisfy the weighted Weiss conjecture for α(0,1). In other words, α-admissibility of scalar valued observation operators cannot always be characterised by a simple resolvent growth condition. This result is in contrast to the unweighted case, where 0-admissibility can be characterised by a simple growth bound. The result is proved by providing a link between discrete and continuous α-admissibility and then translating a counterexample for the unilateral shift on to continuous time systems.     

A simple derivation of ARE solutions to the standard control problem based on LMI solution

In this note, a simple derivation of the Riccati equation based solutions to the standard control problem, namely the well-known Glover–Doyle solution and DGKF solution is given based on LMI solution. It is hoped that this will be helpful in deepening the understanding of Riccati equation solutions.     

An LMI approach to boundary control of semilinear parabolic and hyperbolic systems

Exponential stability analysis and L₂-gain analysis are developed for scalar uncertain distributed parameter systems, governed by semilinear partial differential equations of parabolic and hyperbolic types. Sufficient exponential stability conditions with a given decay rate are derived in the form of Linear Matrix Inequalities (LMIs) for both systems. These conditions are then utilized to synthesize  static output feedback boundary controllers of the systems in question.     

Stabilization of some fractional delay systems of neutral type

In this note, we give new stability tests which enable one to fully characterize the H_∞-stability of systems with transfer function , where h>0 and p,q,r are real polynomials in the variable s^μ for 0<μ<1.As an application of this, in the case r(s)=1 and degp=degq=1, families of H_∞-stabilizing controllers are given and a complete parametrization of all H_∞-stabilizing controllers is obtained when .     

Delay-dependent filtering for time-delayed LPV systems

The present paper addresses the parameter-dependent filter design problem for output estimation in linear parameter varying (LPV) plants that include constant delays in the state. We develop LMI-based delay-dependent conditions to guarantee stability and an induced gain bound performance for the filtering error system. An explicit characterization of the filters’ state–space representation is given in terms of the solutions to a convex optimization problem associated with the synthesis conditions. By taking the output estimation error into account as the criterion, the developed filters are shown to be capable of tracking the desired outputs of the time-delayed parameter varying system in the presence of external disturbances. Two families of filters are examined: memoryless and state-delayed filters. The latter one which involves a delay term in its dynamics has the benefit of reducing the conservatism in the design and improving performance. Illustrative examples are provided to demonstrate the feasibility and advantages of the proposed methodologies for memoryless and state-delayed filter design and to validate the superiority of using the state-delayed configuration compared to the conventional memoryless filters.     

An iterative algorithm for solving a pair of matrix equations over generalized centro-symmetric matrices

A matrix is said to be a symmetric orthogonal matrix if . A matrix is said to be generalized centro-symmetric (generalized central anti-symmetric) with respect to P, if A=PAP (A=−PAP). The generalized centro-symmetric matrices have wide applications in information theory, linear estimate theory and numerical analysis. In this paper, we propose a new iterative algorithm to compute a generalized centro-symmetric solution of the linear matrix equations . We show, when the matrix equations are consistent over generalized centro-symmetric matrix Y, for any initial generalized centro-symmetric matrix Y₁, the sequence {Y_k} generated by the introduced algorithm converges to a generalized centro-symmetric solution of matrix equations . The least Frobenius norm generalized centro-symmetric solution can be derived when a special initial generalized centro-symmetric matrix is chosen. Furthermore, the optimal approximation generalized centro-symmetric solution to a given generalized centro-symmetric matrix can be derived. Several numerical examples are given to show the efficiency of the presented method.     

Polyomino coloring and complex numbers

Usually polyominoes are represented as subsets of the lattice . In this paper we study a representation of polyominoes by Gaussian integers. Polyomino is represented by the set

Then we consider functions of type from the set of all polyominoes to an abelian group G, given by , where v is prime in (N(v) is the norm of v). Using the arithmetic of the ring we find necessary and sufficient conditions for such a function to be a coloring map.     

Structural properties of oracle classes

Denote by the class of oracles relative to which (collapsing oracles), and by the class of oracles relative to which (separating oracles). We present structural results on and . Using a diagonalization argument, we show that neither nor is closed under disjoint union, also known as join. We show that this implies that neither nor is closed under union, intersection, or symmetric difference. Consequently , the first level of the extended low hierarchy, is not closed under join.     

Reconstruction of a word from a multiset of its factors

Let be the multiset containing all factors of w of length k including repetitions. One of the main results is that if for all , then w=v. The bound is optimal; however we will also show that if for all , then w and v are structurally similar.     

Combining OWL ontologies using -Connections

The standardization of the Web Ontology Language (OWL) leaves (at least) two crucial issues for Web-based ontologies unsatisfactorily resolved, namely how to represent and reason with multiple distinct, but linked ontologies, and how to enable effective knowledge reuse and sharing on the Semantic Web.In this paper, we present a solution for these fundamental problems based on -Connections. We aim to use -Connections to provide modelers with suitable means for developing Web ontologies in a modular way and to provide an alternative to the owl:imports construct.With such motivation, we present in this paper a syntactic and semantic extension of the Web Ontology language that covers -Connections of OWL-DL ontologies. We show how to use such an extension as an alternative to the owl:imports construct in many modeling situations. We investigate different combinations of the logics , and for which it is possible to design and implement reasoning algorithms, well-suited for optimization.Finally, we provide support for -Connections in both an ontology editor, SWOOP, and an OWL reasoner, Pellet.     

Robust PID controller tuning based on the heuristic Kalman algorithm

This paper presents a simple but effective tuning strategy for robust PID controllers satisfying multiple performance criteria. Finding such a controller is known to be computationally intractable via the conventional techniques. This is mainly due to the non-convexity of the resulting control problem which is of the fixed order/structure type. To solve this kind of control problem easily and directly, without using any complicated mathematical manipulations and without using too many “user defined” parameters, we utilize the heuristic Kalman algorithm (HKA) for the resolution of the underlying constrained non-convex optimization problem. The resulting tuning strategy is applicable both to stable and unstable systems, without any limitation concerning the order of the process to be controlled. Various numerical studies are conducted to demonstrate the validity of the proposed tuning procedure. Comparisons with previously published works are also given.     

Matrices of 3-iet preserving morphisms

We study matrices of morphisms preserving the family of words coding 3-interval exchange transformations. It is well known that matrices of morphisms preserving Sturmian words (i.e. words coding 2-interval exchange transformations with the maximal possible factor complexity) form the monoid , where .We prove that in the case of exchange of three intervals, the matrices preserving words coding these transformations and having the maximal possible subword complexity belong to the monoid , where .     

Nonnegative matrices with prescribed extremal singular values

We consider the problem of constructing nonnegative matrices with prescribed extremal singular values. In particular, given 2n−1 real numbers and , we construct an n×n nonnegative bidiagonal matrix B and an n×n nonnegative semi-bordered diagonal matrix C, such that and are, respectively, the minimal and the maximal singular values of certain submatrices B_j and C_j of B and C, respectively. By using a singular value perturbation result, we also construct an n×n nonnegative matrix with prescribed singular values σ₁≥≥σ_n.     

How many servers are best in a dual-priority system?

We ask the question, “for minimizing mean response time (sojourn time), which is preferable: one fast server of speed 1, or k slow servers each of speed 1/k?” Our setting is the system with two priority classes of customers, high priority and low priority, where PH is a phase-type distribution. We find that multiple slow servers are often preferable, and we demonstrate exactly how many servers are preferable as a function of the load and service time distribution. In addition, we find that the optimal number of servers with respect to the high priority jobs may be very different from that preferred by low priority jobs, and we characterize these preferences. We also study the optimal number of servers with respect to overall mean response time, averaged over high and low priority jobs. Lastly, we ascertain the effect of the service demand variability of high priority jobs on low priority jobs.     

On global continuity of Coons mappings in patching CAD surfaces

We tessellate a closed surface bounding a solid into four-sided patches . Each patch is the image of the unit square by which is the composition of a 2D Coons mapping and a bivariate function coming from a trimmed surface. Here, we concentrate on the analysis of the global continuity of the mappings over the whole surface. While using Coons functions to generate the mappings , arc length parametrization ensures that the images of the functions match pointwise at surface joints independently of the blending functions. We will describe a reparametrization technique based on cubic Bézier whose goal is to keep the shape of the initial curves while achieving arc length parametrization. The required accuracy of length computation is shown in L^∞-norm in order not to deteriorate the accuracy of the cubic spline approximation. Practical results from simulated and real CAD data which come from IGES files are reported.     

Comparison between a measurement error model and a linear model without measurement error

The regression of a response variable on an explanatory variable from observations on , where is a measurement of , is a special case of errors-in-variables model or measurement error model (MEM). In this work we attempt to answer the following question: given the data under a MEM, is it possible to not consider the measurement error on the covariable in order to use a simpler model? To the best of our knowledge, this problem has not been treated in the Bayesian literature. To answer that question, we compute Bayes factors, the deviance information criterion and the posterior mean of the logarithmic discrepancy. We apply these Bayesian model comparison criteria to two real data sets obtaining interesting results. We conclude that, in order to simplify the MEM, model comparison criteria can be useful to compare structural MEM and a random effect model, but we would also need other statistic tools and take into account the final goal of the model.