The entomological code. A code of nomenclature for use in entomology.

1912:May

Analysis and removal of code clones in software product lines

Magdeburg, Univ., Fak. für Informatik, Diss., 2013

Implementation of Reed-Solomon RS (255,239) Code

In this paper the construction of Reed-Solomon RS(255,239) codeword is described and the process of coding and decoding a message is simulated and verified. RS(255,239), or its shortened version RS(224,208) is used as a coding technique in Low-Power Single Carrier (LPSC) physical layer, as described in IEEE 802.11ad standard. The encoder takes 239 8-bit information symbols, adds 16 parity symbols and constructs 255-byte codeword to be transmitted through wireless communication channel. RS(255,239) codeword is defined over Galois Field GF and is used for correcting upto 8 symbol errors. RS(255,239) code construction is fully implemented and Simulink test project is constructed for testing and analyzing purposes.

Testing Cayley graph densities

We present a computer-assisted analysis of combinatorial properties of the Cayley graphs of certain finitely generated groups: Given a group with a finite set of generators, we study the density of the corresponding Cayley graph, that is, the least upper bound for the average vertex degree (= number of adjacent edges) of any finite subgraph. It is known that an m-generated group is amenable if and only if the density of the corresponding Cayley graph equals to 2m. We test amenable and non-amenable groups, and also groups for which amenability is unknown. In the latter class we focus on Richard Thompson’s group F.

Cracking the BAFF code.

The tumour necrosis factor (TNF) family members B cell activating factor (BAFF) and APRIL (a proliferation-inducing ligand) are crucial survival factors for peripheral B cells. An excess of BAFF leads to the development of autoimmune disorders in animal models, and high levels of BAFF have been detected in the serum of patients with various autoimmune conditions. In this Review, we consider the possibility that in mice autoimmunity induced by BAFF is linked to T cell-independent B cell activation rather than to a severe breakdown of B cell tolerance. We also outline the mechanisms of BAFF signalling, the impact of ligand oligomerization on receptor activation and the progress of BAFF-depleting agents in the clinical setting.

Le code-switching comme ressource stratégique pour la gestion de l'interaction multilingue : coordination et leadership dans un groupe de travail

In this article, we analyze a multilingual interaction in a students' working group and hypothesize a correlation between management of languages in interaction and leadership. We consider Codeswitching as one of the most relevant observables in multilingual interaction and attempt to analyze how it is used by speakers. After a brief presentation of three theoretical and analytical conceptions of Code-switching in interaction (Auer, Mondada & Myers Scotton), we define Code-switching as an interactional, strategical, multilingual resource exploited by speakers to achieve various interactionaland non interactional goals. We then show in two CA-like analysis how multilingual strategical resources occur in the interactional practices of the analyzed working group, and how they are exploited by speakers in order to organize interaction, work, tasks, and to construct one's leadership.We also consider the metadiscourses of the students about their own practices and multilingualism in general, in order to confront them to their actual multilingual practices. We draw the hypothesis that discrepancies observed between metadiscourses and practices can be explained through the development of (meta)discourses showing a unilingual conception in describing multilingual practices.

Bioinformática: interfaz gráfica para comparación de genomas vía web

El proyecto consiste en un entorno gráfico cuyo fin es el de visualizar, estudiar e interpretar la conservación de código genético existente entre los diferentes genomas. Una interface que permite cargar hasta ocho genomas para ser comparados en detalle, por pares o entre todos ellos a la vez. El gráfico que se muestra en la interfaz, representa los Maximal Unique Matchings entre cada par de genomas, lo que significa coincidencias de la mayor longitud posible no repetidas, en las secuencias de ADN de las especies comparadas. La finalidad es el estudio de las evoluciones que han ido apareciendo entre diferentes organismos o los genes que comparten unas especies con otras.

Theoretical aspects of graph models for MANETs

We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, different dynamic graph models of MANETs, and finally we give detailed summaries of a few selected articles. In particular, we focus on articles dealing with connectivity of mobile networks, and on articles which show that mobility can be used to propagate information between nodes of the network while at the same time maintaining small transmission distances, and thus saving energy.

A linear optimization technique for graph pebbling

Graph pebbling is a network model for studying whether or not a given supply of discrete pebbles can satisfy a given demand via pebbling moves. A pebbling move across an edge of a graph takes two pebbles from one endpoint and places one pebble at the other endpoint; the other pebble is lost in transit as a toll. It has been shown that deciding whether a supply can meet a demand on a graph is NP-complete. The pebbling number of a graph is the smallest t such that every supply of t pebbles can satisfy every demand of one pebble. Deciding if the pebbling number is at most k is NP 2 -complete. In this paper we develop a tool, called theWeight Function Lemma, for computing upper bounds and sometimes exact values for pebbling numbers with the assistance of linear optimization. With this tool we are able to calculate the pebbling numbers of much larger graphs than in previous algorithms, and much more quickly as well. We also obtain results for many families of graphs, in many cases by hand, with much simpler and remarkably shorter proofs than given in previously existing arguments (certificates typically of size at most the number of vertices times the maximum degree), especially for highly symmetric graphs. Here we apply theWeight Function Lemma to several specific graphs, including the Petersen, Lemke, 4th weak Bruhat, Lemke squared, and two random graphs, as well as to a number of infinite families of graphs, such as trees, cycles, graph powers of cycles, cubes, and some generalized Petersen and Coxeter graphs. This partly answers a question of Pachter, et al., by computing the pebbling exponent of cycles to within an asymptotically small range. It is conceivable that this method yields an approximation algorithm for graph pebbling.

Phylogenetic Code in the Cloud - Can it Meet the Expectations?

Cloud computing has recently become very popular, and several bioinformatics applications exist already in that domain. The aim of this article is to analyse a current cloud system with respect to usability, benchmark its performance and compare its user friendliness with a conventional cluster job submission system. Given the current hype on the theme, user expectations are rather high, but current results show that neither the price/performance ratio nor the usage model is very satisfactory for large-scale embarrassingly parallel applications. However, for small to medium scale applications that require CPU time at certain peak times the cloud is a suitable alternative.

IPH Response to Dept of Justice and Equality Review of the Code of Practice on the Sale and Display of Alcohol in Mixed Trading Premises

IPH responded to the Department of Justice, Equality and Defence review of the voluntary Code of Practice for the display and sale of alcohol in supermarkets, convenience stores and similar mixed trading outlets. The voluntary Code was introduced in 2008 as an alternative to the statutory rules for structural separation of alcohol products in mixed trading outlets which are set out in section 9 of the Intoxicating Liquor Act 2008. Interested bodies and individuals were invited to submit comments on the Compliance Report for 2011 and on the effectiveness of the voluntary approach to structural separation by 20th December 2011. The Minister said he intended to also seek the views of the Minister for Health and the Joint Oireachtas Committee on Justice, Defence and Equality before reaching any decision on whether to bring the statutory rules in the 2008 Act into operation.

IPH response to Broadcasting Authority of Ireland Children's Commercial Communications Code

The Broadcasting Authority of Ireland (BAI) is an independent statutory organisation responsible for certain aspects of television and radio services in Ireland, guided by the Broadcasting Act 2009. The BAI are undertaking a review of the Children’s Commercial Communications Code section 11 rules on Diet and Nutrition. This section sets down standards with which commercial communications for food and drink shown during children’s programmes and/or where these communications are for food and drink products or services that are of special interest to children.