Efficient Solution of Language Equations Using Partitioned Representations

A class of discrete event synthesis problems can be reduced to solving language equations f . X ⊆ S, where F is the fixed component and S the specification. Sequential synthesis deals with FSMs when the automata for F and S are prefix closed, and are naturally represented by multi-level networks with latches. For this special case, we present an efficient computation, using partitioned representations, of the most general prefix-closed solution of the above class of language equations. The transition and the output relations of the FSMs for F and S in their partitioned form are represented by the sets of output and next state functions of the corresponding networks. Experimentally, we show that using partitioned representations is much faster than using monolithic representations, as well as applicable to larger problem instances.Comment: Submitted on behalf of EDAA (http://www.edaa.com/

Analysis Dictionary Learning: An Efficient and Discriminative Solution

Discriminative Dictionary Learning (DL) methods have been widely advocated for image classification problems. To further sharpen their discriminative capabilities, most state-of-the-art DL methods have additional constraints included in the learning stages. These various constraints, however, lead to additional computational complexity. We hence propose an efficient Discriminative Convolutional Analysis Dictionary Learning (DCADL) method, as a lower cost Discriminative DL framework, to both characterize the image structures and refine the interclass structure representations. The proposed DCADL jointly learns a convolutional analysis dictionary and a universal classifier, while greatly reducing the time complexity in both training and testing phases, and achieving a competitive accuracy, thus demonstrating great performance in many experiments with standard databases.Comment: ICASSP 201

Investigation of highly efficient satellite solution methods

Methods for analyzing the stability of satellites are discussed. The subjects considered are: (1) time elements, (2) stabilization by external energy corrections, and (3) long term global solutions for the synchronous satellite. A set of canonical two-body elements referred to as Delaunay-similar elements is presented. In contrast to the classical Delaunay theory which has time as the independent variable, the D-S theory uses an independent variable which is a generalized true anomaly. The numerical integration of the canonical perturbation equations of these elements is developed

An efficient and fair solution for communication graph games\ud

We introduce an efficient solution for games with communication graph structures and show that it is characterized by efficiency, fairness and a new axiom called component balancedness. This latter axiom compares for every component in the communication graph the total payo to the players of this component in the game itself to the total payoff of these players when applying the solution to the subgame induced by this component

Efficient formulation of the periodic corrections in Brouwer's gravity solution

The periodic terms of Brouwer's gravity solution are reconstructed in a nonsingular set of variables which are derived from the well-known polar-nodal variables. This change does not affect the essence of the solution, which still keeps all the benefits of the action-angle variables approach, and yields two major improvements. Namely, the periodic corrections of Brouwer's solution are now valid for any eccentricity below one and any inclination except the critical inclination, and, besides, are significantly simpler than the nonsingular corrections in Lydanne's reformulation of Brouwer's theory.Comment: 19 page