Parametric identification of the dynamics of inter-sectoral balance: modelling and forecasting

This work is devoted to modelling and identification of the dynamics of the inter-sectoral balance of a macroeconomic system. An approach to the problem of specification and identification of a weakly formalized dynamical system is developed. A matching procedure for parameters of a linear stationary Cauchy problem with a decomposition of its upshot trend and a periodic component, is proposed. Moreover, an approach for detection of significant harmonic waves, which are inherent to real macroeconomic dynamical systems, is developed.Comment: This is a preprint of a paper accepted for publication 29-March-2019 as a book chapter in 'Advances in Intelligent Systems and Computing' [https://www.springer.com/series/11156], Springe

A nonmonotone GRASP

A greedy randomized adaptive search procedure (GRASP) is an itera- tive multistart metaheuristic for difficult combinatorial optimization problems. Each GRASP iteration consists of two phases: a construction phase, in which a feasible solution is produced, and a local search phase, in which a local optimum in the neighborhood of the constructed solution is sought. Repeated applications of the con- struction procedure yields different starting solutions for the local search and the best overall solution is kept as the result. The GRASP local search applies iterative improvement until a locally optimal solution is found. During this phase, starting from the current solution an improving neighbor solution is accepted and considered as the new current solution. In this paper, we propose a variant of the GRASP framework that uses a new “nonmonotone” strategy to explore the neighborhood of the current solu- tion. We formally state the convergence of the nonmonotone local search to a locally optimal solution and illustrate the effectiveness of the resulting Nonmonotone GRASP on three classical hard combinatorial optimization problems: the maximum cut prob- lem (MAX-CUT), the weighted maximum satisfiability problem (MAX-SAT), and the quadratic assignment problem (QAP)

A simplified method for determining convective heat-transfer coefficients

Convective heat transfer coefficients are determined by measuring temperatures of hot and cold fluids separated by wall, and temperature of wall at single point. Method is applicable to heat exchangers and rocket engines

Applications of Bee Colony Optimization

Many computationally difficult problems are attacked using non-exact algorithms, such as approximation algorithms and heuristics. This thesis investigates an ex- ample of the latter, Bee Colony Optimization, on both an established optimization problem in the form of the Quadratic Assignment Problem and the FireFighting problem, which has not been studied before as an optimization problem. Bee Colony Optimization is a swarm intelligence algorithm, a paradigm that has increased in popularity in recent years, and many of these algorithms are based on natural pro- cesses. We tested the Bee Colony Optimization algorithm on the QAPLIB library of Quadratic Assignment Problem instances, which have either optimal or best known solutions readily available, and enabled us to compare the quality of solutions found by the algorithm. In addition, we implemented a couple of other well known algorithms for the Quadratic Assignment Problem and consequently we could analyse the runtime of our algorithm. We introduce the Bee Colony Optimization algorithm for the FireFighting problem. We also implement some greedy algorithms and an Ant Colony Optimization al- gorithm for the FireFighting problem, and compare the results obtained on some randomly generated instances. We conclude that Bee Colony Optimization finds good solutions for the Quadratic Assignment Problem, however further investigation on speedup methods is needed to improve its performance to that of other algorithms. In addition, Bee Colony Optimization is effective on small instances of the FireFighting problem, however as instance size increases the results worsen in comparison to the greedy algorithms, and more work is needed to improve the decisions made on these instances

Aerospace medicine and biology: A continuing bibliography with indexes (supplement 359)

This bibliography lists 164 reports, articles and other documents introduced into the NASA Scientific and Technical Information System during Jan. 1992. Subject coverage includes: aerospace medicine and physiology, life support systems and man/system technology, protective clothing, exobiology and extraterrestrial life, planetary biology, and flight crew behavior and performance

Weak Coulomb blockade effect in quantum dots

We develop the general non-equilibrium theory of transport through a quantum dot, including Coulomb Blockade effects via a 1/N expansion, where N is the number of scattering channels. At lowest order we recover the Landauer formula for the current plus a self-consistent equation for the dot potential. We obtain the leading corrections and compare with earlier approaches. Finally, we show that to leading and next leading order in 1/N there is no interaction correction to the weak localization, in contrast to previous theories, but consistent with experiments by Huibers et al. [Phys. Rev. Lett. 81, 1917 (1998)], where N=4.Comment: 4 pages, 2 figures. Published versio

Semidefinite Programming Approach for the Quadratic Assignment Problem with a Sparse Graph

The matching problem between two adjacency matrices can be formulated as the NP-hard quadratic assignment problem (QAP). Previous work on semidefinite programming (SDP) relaxations to the QAP have produced solutions that are often tight in practice, but such SDPs typically scale badly, involving matrix variables of dimension $n^2$ where n is the number of nodes. To achieve a speed up, we propose a further relaxation of the SDP involving a number of positive semidefinite matrices of dimension $\mathcal{O}(n)$ no greater than the number of edges in one of the graphs. The relaxation can be further strengthened by considering cliques in the graph, instead of edges. The dual problem of this novel relaxation has a natural three-block structure that can be solved via a convergent Augmented Direction Method of Multipliers (ADMM) in a distributed manner, where the most expensive step per iteration is computing the eigendecomposition of matrices of dimension $\mathcal{O}(n)$. The new SDP relaxation produces strong bounds on quadratic assignment problems where one of the graphs is sparse with reduced computational complexity and running times, and can be used in the context of nuclear magnetic resonance spectroscopy (NMR) to tackle the assignment problem.Comment: 31 page

Coulomb blockade oscillations of conductance in the regime of strong tunneling

We study the transport through a quantum dot coupled to two leads by single-mode point contacts. The linear conductance is calculated analytically as a function of a gate voltage and temperature T in the case when transmission coefficients of the contacts are close to unity. As a function of the gate voltage, the conductance shows Coulomb blockade oscillations. At low temperatures, the off-resonance conductance vanishes as T^2, in agreement with the theory of inelastic co-tunneling. Near a resonance, the low-energy physics is governed by a multi-channel Kondo fixed point.Comment: Revtex, 8 pages, 2 figure