New Deterministic Algorithms for Solving Parity Games

We study parity games in which one of the two players controls only a small number $k$ of nodes and the other player controls the $n-k$ other nodes of the game. Our main result is a fixed-parameter algorithm that solves bipartite parity games in time $k^{O(\sqrt{k})}\cdot O(n^3)$, and general parity games in time $(p+k)^{O(\sqrt{k})} \cdot O(pnm)$, where $p$ is the number of distinct priorities and $m$ is the number of edges. For all games with $k = o(n)$ this improves the previously fastest algorithm by Jurdzi{\'n}ski, Paterson, and Zwick (SICOMP 2008). We also obtain novel kernelization results and an improved deterministic algorithm for graphs with small average degree

Efeito da calagem e da adubação com fósforo e potássio sobre a produção de matéria seca, nodulação e teores de proteína bruta, fósforo e cálcio de leguminosas tropicais.

Foram estudados, em casa de vegetação, em Teresina, PI, a produção de nódulos, o peso da parte aérea e da raiz e os teores de PB, P e Ca das leguminosas forrageiras arbóreas angico-de-bezerro (P. moniliformis Benth.) e caneleiro (C. macrophyllum Tul.). Utilizaram-se vasos com duas plantas, e os tratamentos: testemunha, K, P, P + K, Cal, Cal + k, Cal + P e Cal + P + K. O solo foi coletado sob a copa de árvores de cada espécie..

A Multilayer Approach to Fabricate Bioactive Glass Coatings on Ti Alloys

Glasses in the system Si-Ca-Na-Mg-P-K-O with thermal expansion coefficients close to that of Ti6Al4V were used to coat the titanium alloy by a simple enameling technique. Firings were done in air at temperatures between 800 and 840 C and times up to 1 minute. Graded compositions were obtained by firing multilayered glass coatings. Hydroxyapatite (HA) particles were mixed with the glass powder and the mixture was placed on the outer surface of the coatings to render them more bioactive. Coatings with excellent adhesion to the substrate and able to form apatite when immersed in a simulated body fluid (SBF) can be fabricated by this methodology

Adubação NPK do algodoeiro adensado de safrinha no cerrado de Goiás.

Esse estudo foi realizado com dois experimentos de campo conduzidos na safra 2009/10 com o objetivo de definir doses e níveis de adubação NPK para o algodão de safrinha adensado, nas condições do Cerrado de Goiás. O primeiro experimento constou de um fatorial NPK 3x3x3+3 resultante da combinação de três doses de nitrogênio (40, 80 e 120 kg/ha de N), três doses de fósforo (30, 60 e 90 kg/ha de P2O5) e três doses de potássio (40, 80 e 120 kg/ha de K2O), mais três tratamentos adicionais (0-0-0 N-P-K, 60-60-60 N-P-K, e 60-0-60 N-P-K). O outro experimento foi disposto no campo em esquema fatorial 4x4: 4 densidades de plantas (8, 10, 12 e 14 plantas por metro) e 4 níveis de adubação NPK (50, 75, 100 e 125 % da adubação recomendada para a cultura de algodão safra). Utilizou-se delineamento de blocos ao acaso com 4 repetições. Concluiu-se que: 1) Não há influência de população de plantas na resposta da cultura à adubação; e 2) A adubação de manutenção com 60 a 90 kg/ha de N, 60 kg/ha de P2O5 e 60 kg/ha de K2O garantem produtividade de até 3.500 kg/ha de algodão em caroço, em solos com a fertilidade corrigida

Gaya Bahasa Hiperbola dalam Novel Jatuh dan Cinta dan Sebuah Usaha Melupakan Karya Boy Candra Serta Implikasinya dalam Pelajaran Bahasa Indonesia di SMA

This research aims to describe the syntactic form, the language function and the role of hyperbolic language style in the novel Jatuh dan Cinta dan Sebuah Usaha Melupakan as well as the implications in Indonesian language in high school. The type of research is descriptive qualitative. The data in this study are hyperbolic style languages. The source of this research data is taken from the novel Jatuh dan Cinta dan Sebuah Usaha Melupakan. Techniques of data collection using techniques refer, and the technique of note. Data analysis technique in this research using method of agih and method of padan. The validity of the data using a degree of trust technique. The results of the study showed that 60 data containing hyperbolic language styles contained 23 bound clauses, 12 free clauses, 12 verb phrases, 5 preposition phrases, 5 nominal phrases, and 3 adjective phrases. The syntactic functions of S-P-O-K, S-P-O-Pel, S-P-K-O, S-P-O, K-S-P-O, K-S-P-Pel, S-P-O, S-P-K, S-P-Pel and K-S-P. Construction inversion of P-S-O-K, P-S-Pel, P-S-K, and P-S. The language functions are 30 emotive functions, 12 poetic functions, 9 referential functions, 7 cognitive functions, and 2 fatigue functions. The role of hyperbole expressions are 21 expressions of disappointment, 14 expressions of hope, 11 expressions of counsel, 9 sarcastic expressions, and 5 expressions of intimacy

Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size

The development of a satisfying and rigorous mathematical understanding of the performance of neural networks is a major challenge in artificial intelligence. Against this background, we study the expressive power of neural networks through the example of the classical NP-hard Knapsack Problem. Our main contribution is a class of recurrent neural networks (RNNs) with rectified linear units that are iteratively applied to each item of a Knapsack instance and thereby compute optimal or provably good solution values. We show that an RNN of depth four and width depending quadratically on the profit of an optimum Knapsack solution is sufficient to find optimum Knapsack solutions. We also prove the following tradeoff between the size of an RNN and the quality of the computed Knapsack solution: for Knapsack instances consisting of $n$ items, an RNN of depth five and width $w$ computes a solution of value at least $1-\mathcal{O}(n^2/\sqrt{w})$ times the optimum solution value. Our results build upon a classical dynamic programming formulation of the Knapsack Problem as well as a careful rounding of profit values that are also at the core of the well-known fully polynomial-time approximation scheme for the Knapsack Problem. A carefully conducted computational study qualitatively supports our theoretical size bounds. Finally, we point out that our results can be generalized to many other combinatorial optimization problems that admit dynamic programming solution methods, such as various Shortest Path Problems, the Longest Common Subsequence Problem, and the Traveling Salesperson Problem.Comment: A short version of this paper appears in the proceedings of AAAI 202