Free Indexation: Combinatorial Analysis and a Compositional Algorithm

In the principles-and-parameters model of language, the principle known as "free indexation'' plays an important part in determining the referential properties of elements such as anaphors and pronominals. This paper addresses two issues. (1) We investigate the combinatorics of free indexation. In particular, we show that free indexation must produce an exponential number of referentially distinct structures. (2) We introduce a compositional free indexation algorithm. We prove that the algorithm is "optimal.'' More precisely, by relating the compositional structure of the formulation to the combinatorial analysis, we show that the algorithm enumerates precisely all possible indexings, without duplicates.

Combined Analysis of the Short-Term Effects of Photochemical Air Pollutants on Mortality within the EMECAM Project

In recent years, some epidemiologic studies have attributed adverse effects of air pollutants on health not only to particles and sulfur dioxide but also to photochemical air pollutants (nitrogen dioxide and ozone). The effects are usually small, leading to some inconsistencies in the results of the studies. Furthermore, the different methodologic approaches of the studies used has made it difficult to derive generic conclusions. We provide here a quantitative summary of the short-term effects of photochemical air pollutants on mortality in seven Spanish cities involved in the EMECAM project, using generalized additive models from analyses of single and multiple pollutants. Nitrogen dioxide and ozone data were provided by seven EMECAM cities (Barcelona, Gijón, Huelva, Madrid, Oviedo, Seville, and Valencia). Mortality indicators included daily total mortality from all causes excluding external causes, daily cardiovascular mortality, and daily respiratory mortality. Individual estimates, obtained from city-specific generalized additive Poisson autoregressive models, were combined by means of fixed effects models and, if significant heterogeneity among local estimates was found, also by random effects models. Significant positive associations were found between daily mortality (all causes and cardiovascular) and NO2, once the rest of air pollutants were taken into account. A 10 μg/m3 increase in the 24-hr average 1-day NO2 level was associated with an increase in the daily number of deaths of 0.43% [95% confidence interval(CI), –0.003–0.86%] for all causes excluding external. In the case of significant relationships, relative risks for cause-specific mortality were nearly twice as much as that for total mortality for all the photochemical pollutants. Ozone was independently related only to cardiovascular daily mortality. No independent statistically significant relationship between photochemical air pollutants and respiratory mortality was found. The results in this study suggest that, given the present levels of photochemical pollutants, people living in Spanish cities are exposed to health risks derived from air pollution

Classification of packet contents for malware detection

Many existing schemes for malware detection are signature-based. Although they can effectively detect known malwares, they cannot detect variants of known malwares or new ones. Most network servers do not expect executable code in their in-bound network traffic, such as on-line shopping malls, Picasa, Youtube, Blogger, etc. Therefore, such network applications can be protected from malware infection by monitoring their ports to see if incoming packets contain any executable contents. This paper proposes a content-classification scheme that identifies executable content in incoming packets. The proposed scheme analyzes the packet payload in two steps. It first analyzes the packet payload to see if it contains multimedia-type data (such as . If not, then it classifies the payload either as text-type (such as or executable. Although in our experiments the proposed scheme shows a low rate of false negatives and positives (4.69% and 2.53%, respectively), the presence of inaccuracies still requires further inspection to efficiently detect the occurrence of malware. In this paper, we also propose simple statistical and combinatorial analysis to deal with false positives and negatives.

A transient assay for recombination demonstrates that Arabidopsis SNM1 and XRCC3 enhance non-homologous recombination

Replacement of endogenous genes by homologous recombination is rare in plants; the majority of genetic modifications are the result of transforming DNA molecules undergoing random genomic insertion by way of non-homologous recombination. Factors that affect chromatin remodeling and DNA repair are thought to have the potential to enhance the frequency of homologous recombination in plants. Conventional tools to study the frequencies of genetic recombination often rely on stable transformation-based approaches, with these systems being rarely capable of high-throughput or combinatorial analysis. We developed a series of vectors that use chemiluminescent (LUC and REN) reporter genes to assay the relative frequency of homologous and non-homologous recombination in plants. These transient assay vectors were used to screen 14 candidategenes for their effects on recombination frequencies in Nicotiana benthamiana plants. Over-expression of Arabidopsis genes with sequence similarity to SNM1 from yeast and XRCC3 from humans enhanced the frequency of non-homologous recombination when assayed using two different donor vectors. Transient N. benthamiana leaf systems were also used in an alternative assay for preliminary measurements of homologous recombination frequencies, which were found to be enhanced by over-expression of RAD52, MIM and RAD51 from yeast, as well as CHR24 from Arabidopsis. The findings for the assays described here are in line with previous studies that analyzed recombination frequencies using stable transformation. The assays we report have revealed functions in non-homologous recombination for the Arabidopsis SNM1 and XRCC3 genes, so the suppression of these genes' expression offers a potential means to enhance the gene targeting frequency in plants. Furthermore, our findings also indicate that plant gene targeting frequencies could be enhanced by over-expression of RAD52, MIM, CHR24, and RAD51 genes.

Combinatória: abordagem precisa

O objetivo central deste projeto é precisar matematicamente certos objetos combinatórios que servem como ponto de partida nas apresentações usuais da Análise Combinatória e são comumente apresentados de maneira informal e intuitiva. Estabelecido este referencial teórico preciso, pretendemos, a partir dele, reapresentar os conceitos de Análise Combinatória de modo mais rigoroso privilegiando sempre a apresentação mais natural possível. Mais precisamente, estaremos interessados em reapresentar os resultados referentes ao capítulo dois do livro do professor Augusto C. Morgado a partir de uma versão matematicamente mais precisa dos Princípios Aditivo e Multiplicativo. Além disso, pretendemos que os argumentos usados em nossas deduções usem predominantemente indução ou construção de bijeções, o que é um dos grandes objetos de estudo da combinatória moderna

Fifty years of scheduling: a survey of milestones

Scheduling has become a major field within operational research with several hundred publications appearing each year. This paper explores the historical development of the subject since the mid-1950s when the landmark publications started to appear. A discussion of the main topics of scheduling research for the past five decades is provided, highlighting the key contributions that helped shape the subject. The main topics covered in the respective decades are combinatorial analysis, branch and bound, computational complexity and classification, approximate solution algorithms and enhanced scheduling models.

Zero-sum problems in finite cyclic groups

The purpose of this thesis is to investigate some open problems in the area of combinatorial number theory referred to as zero-sum theory. A zero-sequence in a finite cyclic group G is said to have the basic property if it is equivalent under group automorphism to one which has sum precisely IGI when this sum is viewed as an integer. This thesis investigates two major problems, the first of which is referred to as the basic pair problem. This problem seeks to determine conditions for which every zero-sequence of a given length in a finite abelian group has the basic property. We resolve an open problem regarding basic pairs in cyclic groups by demonstrating that every sequence of length four in Zp has the basic property, and we conjecture on the complete solution of this problem. The second problem is a 1988 conjecture of Kleitman and Lemke, part of which claims that every sequence of length n in Zn has a subsequence with the basic property. If one considers the special case where n is an odd integer we believe this conjecture to hold true. We verify this is the case for all prime integers less than 40, and all odd integers less than 26. In addition, we resolve the Kleitman-Lemke conjecture for general n in the negative. That is, we demonstrate a sequence in any finite abelian group isomorphic to Z2p (for p ~ 11 a prime) containing no subsequence with the basic property. These results, as well as the results found along the way, contribute to many other problems in zero-sum theory.

Termoestatística quântica: uma abordagem via estatísticas não-gaussianas

Considering a quantum gas, the foundations of standard thermostatistics are investigated in the context of non-Gaussian statistical mechanics introduced by Tsallis and Kaniadakis. The new formalism is based on the following generalizations: i) Maxwell- Boltzmann-Gibbs entropy and ii) deduction of H-theorem. Based on this investigation, we calculate a new entropy using a generalization of combinatorial analysis based on two different methods of counting. The basic ingredients used in the H-theorem were: a generalized quantum entropy and a generalization of collisional term of Boltzmann equation. The power law distributions are parameterized by parameters q;, measuring the degree of non-Gaussianity of quantum gas. In the limit q

Uma ferramenta didática para ajudar na fixação dos conceitos introdutórios de análise combinatória

Humans, as well as some animals are born gifted with the ability to perceive quantities. The needs that came from the evolution of societies and technological resources make the the optimization of such counting methods necessary. Although necessary and useful, there are a lot of diculties in the teaching of such methods.In order to broaden the range of available tools to teach Combinatorial Analysis, a owchart is presented in this work with the goal of helping the students to x the initial concepts of such subject via pratical exercises

Um novo jogo para o estudo do raciocínio combinatório e do cálculo de probabilidade

We present an educational proposal for the study of combinatorial reasoning and calculation of probabilities based on a game and problem solving methodology, aiming to support the teaching of mathematical content. A review of the literature related to the teaching and learning of the concepts of combinatorial reasoning and probability is presented. The game is original, using a board game similar to Tic-tac-toe, and the movements of its parts have some similarities, in particular those made with the rook and pawn pieces of the game of chess. We formulate various activities (problems) involving the game which, in the process of solving them, using the problem solving methodology and with the appropriate intervention of the teacher, encourage students to develop strategies for counting, an indispensable tool in the initial study of Combinatorial Analysis and Calculation of Probabilities.

O uso da Geometria do Táxi no ensino de Análise Combinatória

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

O jogo de escopa adaptado para o uso em sala de aula

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)

Mapeamento geológico-geotécnico por meio de análise integrada no Parque Estadual do Juquery - Franco da Rocha-SP

Pós-graduação em Geociências e Meio Ambiente - IGCE

Computing a perfect strategy for n x [i.e. superscript] n chess requires time exponential in n /

"UILU-ENG 79 1716."

Sperner's theorem on maximal-sized antichains and its generation /

Includes bibliographical references.