A simulation-based algorithm for solving the resource-assignment problem in satellite telecommunication networks

This paper proposes an heuristic for the scheduling of capacity requests and the periodic assignment of radio resources in geostationary (GEO) satellite networks with star topology, using the Demand Assigned Multiple Access (DAMA) protocol in the link layer, and Multi-Frequency Time Division Multiple Access (MF-TDMA) and Adaptive Coding and Modulation (ACM) in the physical layer.

Ab initio absorption spectrum of NiO combining molecular dynamics with the embedded cluster approach in a discrete reaction field

We developed a procedure that combines three complementary computational methodologies to improve the theoretical description of the electronic structure of nickel oxide. The starting point is a Car-Parrinello molecular dynamics simulation to incorporate vibrorotational degrees of freedom into the material model. By means ofcomplete active space self-consistent field second-order perturbation theory (CASPT2) calculations on embedded clusters extracted from the resulting trajectory, we describe localized spectroscopic phenomena on NiO with an efficient treatment of electron correlation. The inclusion of thermal motion into the theoretical description allowsus to study electronic transitions that, otherwise, would be dipole forbidden in the ideal structure and results in a natural reproduction of the band broadening. Moreover, we improved the embedded cluster model by incorporating self-consistently at the complete active space self-consistent field (CASSCF) level a discrete (or direct) reaction field (DRF) in the cluster surroundings. The DRF approach offers an efficient treatment ofelectric response effects of the crystalline embedding to the electronic transitions localized in the cluster. We offer accurate theoretical estimates of the absorption spectrum and the density of states around the Fermi level of NiO, and a comprehensive explanation of the source of the broadening and the relaxation of the charge transferstates due to the adaptation of the environment

Full Exploration of the Diels–Alder Cycloaddition on Metallofullerenes M3N@C80 (M=Sc, Lu, Gd): The D5h versus Ih Isomer and the Influence of the Metal Cluster

In this work a detailed investigation of the exohedral reactivity of the most important and abundant endohedral metallofullerene (EMF) is provided, that is, Sc3N@Ih-C80 and its D5h counterpart Sc3N@D5h-C80, and the (bio)chemically relevant lutetium- and gadolinium-based M3N@Ih/D5h-C80 EMFs (M=Sc, Lu, Gd). In particular, we analyze the thermodynamics and kinetics of the Diels–Alder cycloaddition of s-cis-1,3-butadiene on all the different bonds of the Ih-C80 and D5h-C80 cages and their endohedral derivatives. First, we discuss the thermodynamic and kinetic aspects of the cycloaddition reaction on the hollow fullerenes and the two isomers of Sc3N@C80. Afterwards, the effect of the nature of the metal nitride is analyzed in detail. In general, our BP86/TZP//BP86/DZP calculations indicate that [5,6] bonds are more reactive than [6,6] bonds for the two isomers. The [5,6] bond D5h-b, which is the most similar to the unique [5,6] bond type in the icosahedral cage, Ih-a, is the most reactive bond in M3N@D5h-C80 regardless of M. Sc3N@C80 and Lu3N@C80 give similar results; the regioselectivity is, however, significantly reduced for the larger and more electropositive M=Gd, as previously found in similar metallofullerenes. Calculations also show that the D5h isomer is more reactive from the kinetic point of view than the Ih one in all cases which is in good agreement with experiments

Algorithm creation and optimization for the crew pairing problem

Algoritmo que optimiza y crea pairings para tripulaciones de líneas aéreas mediante la posterior programación en Java.

A genetic algorithm to ensemble feature selection

We are going to implement the "GA-SEFS" by Tsymbal and analyse experimentally its performance depending on the classifier algorithms used in the fitness function (NB, MNge, SMO). We are also going to study the effect of adding to the fitness function a measure to control complexity of the base classifiers.

Entorn web per a l'administració d'un cluster de computació distribuïda

S'ha creat un entorn web que permet executar les tasques d'administració que comporta un cluster, de firma gràfica. Algunes d'aquestes tasques són la creació de còpies seguretat o la gestió d'usuaris i grups. A més, des d'aquest entorn es permet la monitorització del cluster, per veure els seus recursos i l'estat dels nodes.

Disseny i implementació d'un algorisme predictiu de coscheduling dins l'espai d'usuari en un cluster Linux

Dissenyar i implementar un planificador en l'espai d'usuari basant-se en la tècnica de coscheduling, en concret s'utilitzarà coscheduling predictive. L'objectiu és intentar obtenir un rendiment similar al que es va assolir en implementacions de la mateixa tècnica realitzada en l'espai de kernel.

Algorithm optimization for solving crew scheduling problems

In this paper, we are proposing a methodology to determine the most efficient and least costly way of crew pairing optimization. We are developing a methodology based on algorithm optimization on Eclipse opensource IDE using the Java programming language to solve the crew scheduling problems.

Development and validation of AMANDA, a new algorithm for selecting highly relevant regions in Molecular Interaction Fields

Descriptors based on Molecular Interaction Fields (MIF) are highly suitable for drug discovery, but their size (thousands of variables) often limits their application in practice. Here we describe a simple and fast computational method that extracts from a MIF a handful of highly informative points (hot spots) which summarize the most relevant information. The method was specifically developed for drug discovery, is fast, and does not require human supervision, being suitable for its application on very large series of compounds. The quality of the results has been tested by running the method on the ligand structure of a large number of ligand-receptor complexes and then comparing the position of the selected hot spots with actual atoms of the receptor. As an additional test, the hot spots obtained with the novel method were used to obtain GRIND-like molecular descriptors which were compared with the original GRIND. In both cases the results show that the novel method is highly suitable for describing ligand-receptor interactions and compares favorably with other state-of-the-art methods.

A systolic array for linear MIMO detection based on an all-swap lattice reduction algorithm

A systolic array to implement lattice-reduction-aided lineardetection is proposed for a MIMO receiver. The lattice reductionalgorithm and the ensuing linear detections are operated in the same array, which can be hardware-efficient. All-swap lattice reduction algorithm (ASLR) is considered for the systolic design.ASLR is a variant of the LLL algorithm, which processes all lattice basis vectors within one iteration. Lattice-reduction-aided linear detection based on ASLR and LLL algorithms have very similarbit-error-rate performance, while ASLR is more time efficient inthe systolic array, especially for systems with a large number ofantennas.

Pot modificar un canvi urbanístic l'economia d'un barri? : El cas de Ciutat Vella i el cluster cultural

Tots hem sentit a parlar del canvi del Raval en aquests últims anys. Actualment la majoria del jovent no només hi estudia sinó que hi passa la major part del seu tempsd’oci, en bars, restaurants, museus, galeries d’art, comerços...Nosaltres ens hem preguntat: Per què el Raval ha canviat tant? S’han fet molts treballs, molts estudis, s’han intentat trobar les diverses causes que han produït aquest fenòmen.Més específicament ens hem preguntat: Pot ser que degut a la construcció del cluster cultural format pel MACBA i el CCCB, entre d’altres, s’hagi produït aquest canvi?Així doncs, en aquest treball intentarem contestar ambdues preguntes. Intentarem ser precisos, concisos, breus i clars; esperem que us resulti interessant.

ILS-ESP An efficient, simple, and parameter-free algorithm for solving the permutation flow-shop problem

From a managerial point of view, the more effcient, simple, and parameter-free (ESP) an algorithm is, the more likely it will be used in practice for solving real-life problems. Following this principle, an ESP algorithm for solving the Permutation Flowshop Sequencing Problem (PFSP) is proposed in this article. Using an Iterated Local Search (ILS) framework, the so-called ILS-ESP algorithm is able to compete in performance with other well-known ILS-based approaches, which are considered among the most effcient algorithms for the PFSP. However, while other similar approaches still employ several parameters that can affect their performance if not properly chosen, our algorithm does not require any particular fine-tuning process since it uses basic "common sense" rules for the local search, perturbation, and acceptance criterion stages of the ILS metaheuristic. Our approach defines a new operator for the ILS perturbation process, a new acceptance criterion based on extremely simple and transparent rules, and a biased randomization process of the initial solution to randomly generate different alternative initial solutions of similar quality -which is attained by applying a biased randomization to a classical PFSP heuristic. This diversification of the initial solution aims at avoiding poorly designed starting points and, thus, allows the methodology to take advantage of current trends in parallel and distributed computing. A set of extensive tests, based on literature benchmarks, has been carried out in order to validate our algorithm and compare it against other approaches. These tests show that our parameter-free algorithm is able to compete with state-of-the-art metaheuristics for the PFSP. Also, the experiments show that, when using parallel computing, it is possible to improve the top ILS-based metaheuristic by just incorporating to it our biased randomization process with a high-quality pseudo-random number generator.

A polynomial algorithm for special case of the one-machine scheduling problem with time-lags

The standard one-machine scheduling problem consists in schedulinga set of jobs in one machine which can handle only one job at atime, minimizing the maximum lateness. Each job is available forprocessing at its release date, requires a known processing timeand after finishing the processing, it is delivery after a certaintime. There also can exists precedence constraints between pairsof jobs, requiring that the first jobs must be completed beforethe second job can start. An extension of this problem consistsin assigning a time interval between the processing of the jobsassociated with the precedence constrains, known by finish-starttime-lags. In presence of this constraints, the problem is NP-hardeven if preemption is allowed. In this work, we consider a specialcase of the one-machine preemption scheduling problem with time-lags, where the time-lags have a chain form, and propose apolynomial algorithm to solve it. The algorithm consist in apolynomial number of calls of the preemption version of the LongestTail Heuristic. One of the applicability of the method is to obtainlower bounds for NP-hard one-machine and job-shop schedulingproblems. We present some computational results of thisapplication, followed by some conclusions.

On the efficiency and sensitivity of a pyramidal classification algorithm

In this paper we propose a Pyramidal Classification Algorithm,which together with an appropriate aggregation index producesan indexed pseudo-hierarchy (in the strict sense) withoutinversions nor crossings. The computer implementation of thealgorithm makes it possible to carry out some simulation testsby Monte Carlo methods in order to study the efficiency andsensitivity of the pyramidal methods of the Maximum, Minimumand UPGMA. The results shown in this paper may help to choosebetween the three classification methods proposed, in order toobtain the classification that best fits the original structureof the population, provided we have an a priori informationconcerning this structure.

A simple randomized algorithm for consistent sequential prediction of ergodic time series

We present a simple randomized procedure for the prediction of a binary sequence. The algorithm uses ideas from recent developments of the theory of the prediction of individual sequences. We show that if thesequence is a realization of a stationary and ergodic random process then the average number of mistakes converges, almost surely, to that of the optimum, given by the Bayes predictor.