Silicon isotope ratios of ODP Site 177-1089 and sediment core E33-22

Reconstruction of nutrient concentrations in the deep Southern Ocean has produced conflicting results. The cadmium/calcium (Cd/Ca) data set suggests little change in nutrient concentrations during the last glacial period, whereas the carbon isotope data set suggests that nutrient concentrations were higher. We determined the silicon isotope composition of sponge spicules from the Atlantic and Pacific sectors of the Southern Ocean and found higher silicic acid concentrations in the Pacific sector during the last glacial period. We propose that this increase results from changes in the stoichiometric uptake of silicic acid relative to nitrate and phosphate by diatoms, thus facilitating a redistribution of nutrients across the Pacific and Southern Oceans. Our results are consistent with the global Cd/Ca data set and support the silicic acid leakage hypothesis.

Temperature management for heterogeneous multi-core FPGAs using adaptive evolutionary multi-objective approaches

Heterogeneous multi-core FPGAs contain different types of cores, which can improve efficiency when used with an effective online task scheduler. However, it is not easy to find the right cores for tasks when there are multiple objectives or dozens of cores. Inappropriate scheduling may cause hot spots which decrease the reliability of the chip. Given that, our research builds a simulating platform to evaluate all kinds of scheduling algorithms on a variety of architectures. On this platform, we provide an online scheduler which uses multi-objective evolutionary algorithm (EA). Comparing the EA and current algorithms such as Predictive Dynamic Thermal Management (PDTM) and Adaptive Temperature Threshold Dynamic Thermal Management (ATDTM), we find some drawbacks in previous work. First, current algorithms are overly dependent on manually set constant parameters. Second, those algorithms neglect optimization for heterogeneous architectures. Third, they use single-objective methods, or use linear weighting method to convert a multi-objective optimization into a single-objective optimization. Unlike other algorithms, the EA is adaptive and does not require resetting parameters when workloads switch from one to another. EAs also improve performance when used on heterogeneous architecture. A efficient Pareto front can be obtained with EAs for the purpose of multiple objectives.

CORE: A Multi-Purpose Programming Contest Repository System

Яни Чаушев, Милослав Средков, Красимир Манев - Всяко състезание по програмиране използва множество софтуерни инструменти за управление на процесите по време на състезанието. Въпреки че тези инструменти обикновено покриват спецификите на конкретния вид състезание задоволително, те рядко адресират трудностите на дългосрочното съхранение на данни и оперативната съвместимост. В тази статия е представен един софтуерен инструмент адресиращ тези проблеми. Вместо комплексна система, касаеща всички аспекти на състезанието, CORE е централизирано хранилище за съхраняване и поддържане на необходимите за различни състезания данни. Представени са основните му елементи, текущото състояние на реализацията и перспективите за развитие на системата.

Korrupció: mérhetőség és modellezés = In the core of our study we focus on the connection of Foreign Direct Investment and corruption.

Tanulmányunk középpontjában a közvetlen külföldi befektetések és a korrupció kapcsolata áll. Feltételezésünk az, hogy a közvetlen külföldi befektetők a kevésbé korrupt országokat kedvelik, mivel a korrupció egy további kockázati tényezőt jelent a befektetők számára, amely növelheti a befektetések költségeit. Megítélésünk szerint ezt kvantitatív módszerekkel lehet a leginkább vizsgálni, így elemzésünk során 79 országot vizsgálunk meg 10 évre vonatkozó átlagokkal a GRETL program és az OLS becslőfüggvény segítségével. Több modell lefuttatása után azt az eredményt kaptuk, hogy a közvetlen külföldi befektetők döntéseiben a korrupció szignifikáns tényező, a két változó között negatív korrelációt figyelhetünk meg. ____ We assume that investors prefer countries where corruption level is lower, as corruption an additional risk factor that might increase the cost of investment. We believe that the best way to prove the previous statement if we use quantitative methods, so we set up a model where 79 countries are tested for 10 years averages, with the help of the GRETL and OLS estimator. After running several models our finding was that corruption is a significant factor in the decisions of foreign investors, and there is a negative correlation between corruption and FDI.

The kernel is in the least core for permutation games

Permutation games are totally balanced transferable utility cooperative games arising from certain sequencing and re-assignment optimization problems. It is known that for permutation games the bargaining set and the core coincide, consequently, the kernel is a subset of the core. We prove that for permutation games the kernel is contained in the least core, even if the latter is a lower dimensional subset of the core. By means of a 5-player permutation game we demonstrate that, in sense of the lexicographic center procedure leading to the nucleolus, this inclusion result can not be strengthened. Our 5-player permutation game is also an example (of minimum size) for a game with a non-convex kernel.

Lexicographic allocations and extreme core payoffs: the case of assignment games

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationship between these allocations and obtain two hierarchies on the class of balanced games. Secondly, we focus on assignment games and sharpen some of these general relationship. Our main result is the coincidence of the sets of lemarals (vectors of lexicographic maxima over the set of dual coalitionally rational payoff vectors), lemacols (vectors of lexicographic maxima over the core) and extreme core points. As byproducts, we show that, similarly to the core and the coalitionally rational payoff set, also the dual coalitionally rational payoff set of an assignment game is determined by the individual and mixed-pair coalitions, and present an efficient and elementary way to compute these basic dual coalitional values. This provides a way to compute the Alexia value (the average of all lemacols) with no need to obtain the whole coalitional function of the dual assignment game.