Packing triangles in low degree graphs and indifference graphs

We consider the problems of finding the maximum number of vertex-disjoint triangles (VTP) and edge-disjoint triangles (ETP) in a simple graph. Both problems are NP-hard. The algorithm with the best approximation ratio known so far for these problems has ratio 3/2 + epsilon, a result that follows from a more general algorithm for set packing obtained by Hurkens and Schrijver [On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems, SIAM J. Discrete Math. 2(1) (1989) 68-72]. We present improvements on the approximation ratio for restricted cases of VTP and ETP that are known to be APX-hard: we give an approximation algorithm for VTP on graphs with maximum degree 4 with ratio slightly less than 1.2, and for ETP on graphs with maximum degree 5 with ratio 4/3. We also present an exact linear-time algorithm for VTP on the class of indifference graphs. (C) 2007 Elsevier B.V. All rights reserved.

Planar subgraphs without low-degree nodes

We study the following problem: given a geometric graph G and an integer k, determine if G has a planar spanning subgraph (with the original embedding and straight-line edges) such that all nodes have degree at least k. If G is a unit disk graph, the problem is trivial to solve for k = 1. We show that even the slightest deviation from the trivial case (e.g., quasi unit disk graphs or k = 1) leads to NP-hard problems.

Vertex Cover Gets Faster and Harder on Low Degree Graphs

The problem of finding an optimal vertex cover in a graph is a classic NP-complete problem, and is a special case of the hitting set question. On the other hand, the hitting set problem, when asked in the context of induced geometric objects, often turns out to be exactly the vertex cover problem on restricted classes of graphs. In this work we explore a particular instance of such a phenomenon. We consider the problem of hitting all axis-parallel slabs induced by a point set P, and show that it is equivalent to the problem of finding a vertex cover on a graph whose edge set is the union of two Hamiltonian Paths. We show the latter problem to be NP-complete, and also give an algorithm to find a vertex cover of size at most k, on graphs of maximum degree four, whose running time is 1.2637(k) n(O(1)).

Extensions of the cube attack based on low degree annihilators

At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an initialization vector. In a stream cipher setting where the filter function is known, we can extend it to the cube attack with annihilators: By applying the cube attack to Boolean functions for which we can find low-degree multiples (equivalently annihilators), the attack complexity can be improved. When the size of the filter function is smaller than the LFSR, we can improve the attack complexity further by considering a sliding window version of the cube attack with annihilators. Finally, we extend the cube attack to vectorial Boolean functions by finding implicit relations with low-degree polynomials.

The effects of low degree alteration on Sm-Nd and U-Pb isotope systematics in Eoarchean basalts from the Doolena Gap and Warralong Greenstone belts, Pilbara Craton, Western Australia

This research led to the discovery of one of the best preserved remnants of the Earth's surficial environment 3.47 billion years ago. These ancient volcanic and sedimentary rocks contain original minerals and textures that are rare in rocks of this age. The research concentrated on chemical analysis of volcanic rocks to differentiate secondary alteration from the primary magmatic signature. This study contributes to our understanding of melting processes and geochemical reservoirs in the early Earth, which is vital for forward modelling of Earth's geodynamic evolution.

Lower Bounds for Sums of Powers of Low Degree Univariates

We consider the problem of representing a univariate polynomial f(x) as a sum of powers of low degree polynomials. We prove a lower bound of Omega(root d/t) for writing an explicit univariate degree-d polynomial f(x) as a sum of powers of degree-t polynomials.

Structural characterization of a new dextran with a low degree of branching produced by Leuconostoc mesenteroides FT045B dextransucrase

This paper offers the physical and chemical characterization of a new dextran produced by Leuconostoc mesenteroides FT045B. The chemical structure was determined by Fourier Transform Infrared spectroscopy and 1H Nuclear Magnetic Resonance spectroscopy. The dextran was hydrolyzed by endodextranase; the products were analyzed using thin layer chromatography and compared with those of commercial B-512F dextran. The number-average molecular weight and degree of polymerization of the FT045B dextran were determined by the measurement of the reducing value using the copper bicinchoninate method and the measurement of total carbohydrate using the phenol-sulfuric acid method. The data revealed that the structure of the dextran synthesized by FT045B dextran sucrase is composed of d-glucose residues, containing 97.9% α-(1,6) linkages in the main chains and 2.1% α-(1,3) branch linkages compared with the commercial B-512F dextran, which has 95% α-(1,6) linkages in the main chains and 5% α-(1,3) branch linkages. © 2012 Elsevier Ltd. All rights reserved.

Genome-Wide Analysis in Brazilian Xavante Indians Reveals Low Degree of Admixture

Characterization of population genetic variation and structure can be used as tools for research in human genetics and population isolates are of great interest. The aim of the present study was to characterize the genetic structure of Xavante Indians and compare it with other populations. The Xavante, an indigenous population living in Brazilian Central Plateau, is one of the largest native groups in Brazil. A subset of 53 unrelated subjects was selected from the initial sample of 300 Xavante Indians. Using 86,197 markers, Xavante were compared with all populations of HapMap Phase III and HGDP-CEPH projects and with a Southeast Brazilian population sample to establish its population structure. Principal Components Analysis showed that the Xavante Indians are concentrated in the Amerindian axis near other populations of known Amerindian ancestry such as Karitiana, Pima, Surui and Maya and a low degree of genetic admixture was observed. This is consistent with the historical records of bottlenecks experience and cultural isolation. By calculating pair-wise F-st statistics we characterized the genetic differentiation between Xavante Indians and representative populations of the HapMap and from HGDP-CEPH project. We found that the genetic differentiation between Xavante Indians and populations of Ameridian, Asian, European, and African ancestry increased progressively. Our results indicate that the Xavante is a population that remained genetically isolated over the past decades and can offer advantages for genome-wide mapping studies of inherited disorders.

Edge-preserving self-healing: Keeping network backbones densely connected

Healing algorithms play a crucial part in distributed peer-to-peer networks where failures occur continuously and frequently. Whereas there are approaches for robustness that rely largely on built-in redundancy, we adopt a responsive approach that is more akin to that of biological networks e.g. the brain. The general goal of self-healing distributed graphs is to maintain certain network properties while recovering from failure quickly and making bounded alterations locally. Several self-healing algorithms have been suggested in the recent literature [IPDPS'08, PODC'08, PODC'09, PODC'11]; they heal various network properties while fulfilling competing requirements such as having low degree increase while maintaining connectivity, expansion and low stretch of the network. In this work, we augment the previous algorithms by adding the notion of edge-preserving self-healing which requires the healing algorithm to not delete any edges originally present or adversarialy inserted. This reflects the cost of adding additional edges but more importantly it immediately follows that edge preservation helps maintain any subgraph induced property that is monotonic, in particular important properties such as graph and subgraph densities. Density is an important network property and in certain distributed networks, maintaining it preserves high connectivity among certain subgraphs and backbones. We introduce a general model of self-healing, and introduce xheal+, an edge-preserving version of xheal[PODC'11]. © 2012 IEEE.

Low-weight coordination polymers derived from the self-assembly reactions of Pd(II) pyrazolyl compounds and azide ion

The low-weight Pd(II) coordination polymers [(N(3))(HL)Pd {Pd(3)(mu-N(3))(mu-L)(5)}10(mu-L)(2)Pd(L)(HL)]{L = Pz(-) (1); mPz(-) (2), IPz(-)(3)} and [(N(3))(HPz)Pd{Pd(6)(mu-N(3))(2)(mu-PZ)(5)(mu-L)(5)}(10)(mu-L)(2)Pd(Pz)(HPz)] {L = mPz(-) (4), dmPz(-) (5); IPz(-) (6)} {L = pyrazolate (Pz(-)), 4-methylpyrazolate(mPz(-)), 4-iodopyrazo late (IPz(-)), 3,5-dimethylpyrazolate (dmPz(-))} have been prepared in this work. IR spectra clearly indicated the exobidentate nature of pyrazolato ligands as well the end-on coordination mode of the azido group. The molecular weight determinations by osmometry indicated that the species have a low degree of polymerization (n = 10). NMR experiments showed two pyrazolate environments in a 2:1 ratio, being assigned to the six-membered ring Pd(mu-L)(2)Pd and the Pd(mu-N(3))(mu-L)Pd metallocycle, respectively. UV-visible spectroscopy gave further evidences for the oligomeric structures of 1-6. Some alternative structures for the isostructural polymers have been suggested. (c) 2005 Elsevier Ltd. All rights reserved.

Análise de propriedades topológicas das redes biológicas integradas da Escherichia coli e da Saccharomyces cerevisiae

Biological processes are complex and possess emergent properties that can not be explained or predict by reductionism methods. To overcome the limitations of reductionism, researchers have been used a group of methods known as systems biology, a new interdisciplinary eld of study aiming to understand the non-linear interactions among components embedded in biological processes. These interactions can be represented by a mathematical object called graph or network, where the elements are represented by nodes and the interactions by edges that link pair of nodes. The networks can be classi- ed according to their topologies: if node degrees follow a Poisson distribution in a given network, i.e. most nodes have approximately the same number of links, this is a random network; if node degrees follow a power-law distribution in a given network, i.e. small number of high-degree nodes and high number of low-degree nodes, this is a scale-free network. Moreover, networks can be classi ed as hierarchical or non-hierarchical. In this study, we analised Escherichia coli and Saccharomyces cerevisiae integrated molecular networks, which have protein-protein interaction, metabolic and transcriptional regulation interactions. By using computational methods, such as MathematicaR , and data collected from public databases, we calculated four topological parameters: the degree distribution P(k), the clustering coe cient C(k), the closeness centrality CC(k) and the betweenness centrality CB(k). P(k) is a function that calculates the total number of nodes with k degree connection and is used to classify the network as random or scale-free. C(k) shows if a network is hierarchical, i.e. if the clusterization coe cient depends on node degree. CC(k) is an indicator of how much a node it is in the lesse way among others some nodes of the network and the CB(k) is a pointer of how a particular node is among several ...(Complete abstract click electronic access below)

Algebraic attacks on clock-controlled stream ciphers

Stream ciphers are encryption algorithms used for ensuring the privacy of digital telecommunications. They have been widely used for encrypting military communications, satellite communications, pay TV encryption and for voice encryption of both fixed lined and wireless networks. The current multi year European project eSTREAM, which aims to select stream ciphers suitable for widespread adoptation, reflects the importance of this area of research. Stream ciphers consist of a keystream generator and an output function. Keystream generators produce a sequence that appears to be random, which is combined with the plaintext message using the output function. Most commonly, the output function is binary addition modulo two. Cryptanalysis of these ciphers focuses largely on analysis of the keystream generators and of relationships between the generator and the keystream it produces. Linear feedback shift registers are widely used components in building keystream generators, as the sequences they produce are well understood. Many types of attack have been proposed for breaking various LFSR based stream ciphers. A recent attack type is known as an algebraic attack. Algebraic attacks transform the problem of recovering the key into a problem of solving multivariate system of equations, which eventually recover the internal state bits or the key bits. This type of attack has been shown to be effective on a number of regularly clocked LFSR based stream ciphers. In this thesis, algebraic attacks are extended to a number of well known stream ciphers where at least one LFSR in the system is irregularly clocked. Applying algebriac attacks to these ciphers has only been discussed previously in the open literature for LILI-128. In this thesis, algebraic attacks are first applied to keystream generators using stop-and go clocking. Four ciphers belonging to this group are investigated: the Beth-Piper stop-and-go generator, the alternating step generator, the Gollmann cascade generator and the eSTREAM candidate: the Pomaranch cipher. It is shown that algebraic attacks are very effective on the first three of these ciphers. Although no effective algebraic attack was found for Pomaranch, the algebraic analysis lead to some interesting findings including weaknesses that may be exploited in future attacks. Algebraic attacks are then applied to keystream generators using (p; q) clocking. Two well known examples of such ciphers, the step1/step2 generator and the self decimated generator are investigated. Algebraic attacks are shown to be very powerful attack in recovering the internal state of these generators. A more complex clocking mechanism than either stop-and-go or the (p; q) clocking keystream generators is known as mutual clock control. In mutual clock control generators, the LFSRs control the clocking of each other. Four well known stream ciphers belonging to this group are investigated with respect to algebraic attacks: the Bilateral-stop-and-go generator, A5/1 stream cipher, Alpha 1 stream cipher, and the more recent eSTREAM proposal, the MICKEY stream ciphers. Some theoretical results with regards to the complexity of algebraic attacks on these ciphers are presented. The algebraic analysis of these ciphers showed that generally, it is hard to generate the system of equations required for an algebraic attack on these ciphers. As the algebraic attack could not be applied directly on these ciphers, a different approach was used, namely guessing some bits of the internal state, in order to reduce the degree of the equations. Finally, an algebraic attack on Alpha 1 that requires only 128 bits of keystream to recover the 128 internal state bits is presented. An essential process associated with stream cipher proposals is key initialization. Many recently proposed stream ciphers use an algorithm to initialize the large internal state with a smaller key and possibly publicly known initialization vectors. The effect of key initialization on the performance of algebraic attacks is also investigated in this thesis. The relationships between the two have not been investigated before in the open literature. The investigation is conducted on Trivium and Grain-128, two eSTREAM ciphers. It is shown that the key initialization process has an effect on the success of algebraic attacks, unlike other conventional attacks. In particular, the key initialization process allows an attacker to firstly generate a small number of equations of low degree and then perform an algebraic attack using multiple keystreams. The effect of the number of iterations performed during key initialization is investigated. It is shown that both the number of iterations and the maximum number of initialization vectors to be used with one key should be carefully chosen. Some experimental results on Trivium and Grain-128 are then presented. Finally, the security with respect to algebraic attacks of the well known LILI family of stream ciphers, including the unbroken LILI-II, is investigated. These are irregularly clock- controlled nonlinear filtered generators. While the structure is defined for the LILI family, a particular paramater choice defines a specific instance. Two well known such instances are LILI-128 and LILI-II. The security of these and other instances is investigated to identify which instances are vulnerable to algebraic attacks. The feasibility of recovering the key bits using algebraic attacks is then investigated for both LILI- 128 and LILI-II. Algebraic attacks which recover the internal state with less effort than exhaustive key search are possible for LILI-128 but not for LILI-II. Given the internal state at some point in time, the feasibility of recovering the key bits is also investigated, showing that the parameters used in the key initialization process, if poorly chosen, can lead to a key recovery using algebraic attacks.