31 research outputs found

    Linear approach to the orbiting spacecraft thermal problem

    Get PDF
    We develop a linear method for solving the nonlinear differential equations of a lumped-parameter thermal model of a spacecraft moving in a closed orbit. Our method, based on perturbation theory, is compared with heuristic linearizations of the same equations. The essential feature of the linear approach is that it provides a decomposition in thermal modes, like the decomposition of mechanical vibrations in normal modes. The stationary periodic solution of the linear equations can be alternately expressed as an explicit integral or as a Fourier series. We apply our method to a minimal thermal model of a satellite with ten isothermal parts (nodes) and we compare the method with direct numerical integration of the nonlinear equations. We briefly study the computational complexity of our method for general thermal models of orbiting spacecraft and conclude that it is certainly useful for reduced models and conceptual design but it can also be more efficient than the direct integration of the equations for large models. The results of the Fourier series computations for the ten-node satellite model show that the periodic solution at the second perturbative order is sufficiently accurate.Comment: 20 pages, 11 figures, accepted in Journal of Thermophysics and Heat Transfe

    Regularity of Edge Ideals and Their Powers

    Full text link
    We survey recent studies on the Castelnuovo-Mumford regularity of edge ideals of graphs and their powers. Our focus is on bounds and exact values of  reg I(G)\text{ reg } I(G) and the asymptotic linear function  reg I(G)q\text{ reg } I(G)^q, for q≥1,q \geq 1, in terms of combinatorial data of the given graph G.G.Comment: 31 pages, 15 figure

    Elementary landscape decomposition of the 0-1 unconstrained quadratic optimization

    Get PDF
    Journal of Heuristics, 19(4), pp.711-728Landscapes’ theory provides a formal framework in which combinatorial optimization problems can be theoretically characterized as a sum of an especial kind of landscape called elementary landscape. The elementary landscape decomposition of a combinatorial optimization problem is a useful tool for understanding the problem. Such decomposition provides an additional knowledge on the problem that can be exploited to explain the behavior of some existing algorithms when they are applied to the problem or to create new search methods for the problem. In this paper we analyze the 0-1 Unconstrained Quadratic Optimization from the point of view of landscapes’ theory. We prove that the problem can be written as the sum of two elementary components and we give the exact expressions for these components. We use the landscape decomposition to compute autocorrelation measures of the problem, and show some practical applications of the decomposition.Spanish Ministry of Sci- ence and Innovation and FEDER under contract TIN2008-06491-C04-01 (the M∗ project). Andalusian Government under contract P07-TIC-03044 (DIRICOM project)

    Adaptive access and rate control of CSMA for energy, rate and delay optimization

    Get PDF
    In this article, we present a cross-layer adaptive algorithm that dynamically maximizes the average utility function. A per stage utility function is defined for each link of a carrier sense multiple access-based wireless network as a weighted concave function of energy consumption, smoothed rate, and smoothed queue size. Hence, by selecting weights we can control the trade-off among them. Using dynamic programming, the utility function is maximized by dynamically adapting channel access, modulation, and coding according to the queue size and quality of the time-varying channel. We show that the optimal transmission policy has a threshold structure versus the channel state where the optimal decision is to transmit when the wireless channel state is better than a threshold. We also provide a queue management scheme where arrival rate is controlled based on the link state. Numerical results show characteristics of the proposed adaptation scheme and highlight the trade-off among energy consumption, smoothed data rate, and link delay.This study was supported in part by the Spanish Government, Ministerio de Ciencia e Innovación (MICINN), under projects COMONSENS (CSD2008-00010, CONSOLIDER-INGENIO 2010 program) and COSIMA (TEC2010-19545-C04-03), in part by Iran Telecommunication Research Center under contract 6947/500, and in part by Iran National Science Foundation under grant number 87041174. This study was completed while M. Khodaian was at CEIT and TECNUN (University of Navarra)

    Inexact Matching of Large and Sparse Graphs Using Laplacian Eigenvectors

    Get PDF
    Abstract. In this paper we propose an inexact spectral matching algorithm that embeds large graphs on a low-dimensional isometric space spanned by a set of eigenvectors of the graph Laplacian. Given two sets of eigenvectors that correspond to the smallest non-null eigenvalues of the Laplacian matrices of two graphs, we project each graph onto its eigenenvectors. We estimate the histograms of these one-dimensional graph projections (eigenvector histograms) and we show that these histograms are well suited for selecting a subset of significant eigenvectors, for ordering them, for solving the sign-ambiguity of eigenvector computation, and for aligning two embeddings. This results in an inexact graph matching solution that can be improved using a rigid point registration algorithm. We apply the proposed methodology to match surfaces represented by meshes.
    corecore