Alcohol Marketing, Communications and Sponsorship Codes of Practice

In 2002 the Minister for Health and Children met with representative organisations from the Advertising Industry, the Association of Advertisers in Ireland (AAI), representing advertisers, the Institute of Advertising Practitioners in Ireland (IAPI), representing the advertising agencies and Drinks Industry Group Ireland (DIGI) representing the Alcohol Drinks Industry. The discussions centred on the Ministerâ?Ts concerns about some of the content, weight of exposure and placement of alcohol advertising. In addition, issues were discussed on activities involved in the sponsorship of, and activities surrounding, music and sports events. Download document here

Exploring the use of the Swiss medical tariffication codes (TARMED) in the establishment of the frequency of radiodiagnostic examinations.

In population surveys of the exposure to medical X-rays both the frequency of examinations and the effective dose per examination are required. The use of the Swiss medical tariffication system (TARMED) for establishing the frequency of X-ray medical examinations was explored. The method was tested for radiography examinations performed in 2008 at the Lausanne University Hospital. The annual numbers of radiographies determined from the "TARMED" database are in good agreement with the figures extracted from the local RIS (Radiology Information System). The "TARMED" is a reliable and fast method for establishing the frequency of radiography examination, if we respect the context in which the "TARMED" code is used. In addition, this billing context provides most valuable information on the average number of radiographs per examination as well as the age and sex distributions. Radiographies represent the major part of X-ray examinations and are performed by about 4,000 practices and hospitals in Switzerland. Therefore this method has the potential to drastically simplify the organisation of nationwide surveys. There are still some difficulties to overcome if the method is to be used to assess the frequency of computed tomography or fluoroscopy examinations; procedures that deliver most of the radiation dose to the population. This is due to the poor specificity of "TARMED" codes concerning these modalities. However, the use of CT and fluoroscopy installations is easier to monitor using conventional survey methods since there are fewer centres. Ways to overcome the "TARMED" limitations for these two modalities are still being explored.

Four whole-istic aspects of schistosome granuloma biology: fractal arrangement, internal regulation, autopoietic component and closure

This paper centers on some whole-istic organizational and functional aspects of hepatic Schistosoma mansoni granuloma, which is an extremely complex system. First, it structurally develops a collagenic topology, originated bidirectionally from an inward and outward assembly of growth units. Inward growth appears to be originated from myofibroblasts derived from small portal vessel around intravascular entrapped eggs, while outward growth arises from hepatic stellate cells. The auto-assembly of the growth units defines the three-dimensional scaffold of the schistosome granulomas. The granuloma surface irregularity and its border presented fractal dimension equal to 1.58. Second, it is internally regulated by intricate networks of immuneneuroendocrine stimuli orchestrated by leptin and leptin receptors, substance P and Vasoactive intestinal peptide. Third, it can reach the population of ± 40,000 cells and presents an autopoietic component evidenced by internal proliferation (Ki-67+ Cells), and by expression of c-Kit+ Cells, leptin and leptin receptor (Ob-R), granulocyte-colony stimulating factor (G-CSF-R), and erythropoietin (Epo-R) receptors. Fourth, the granulomas cells are intimately connected by pan-cadherins, occludin and connexin-43, building a state of closing (granuloma closure). In conclusion, the granuloma is characterized by transitory stages in such a way that its organized structure emerges as a global property which is greater than the sum of actions of its individual cells and extracellular matrix components.

QRP: An improved secure authentication method using QR codes

This paper presents the design and implementation of QRP, an open source proof-of-concept authentication system that uses a two-factorauthentication by combining a password and a camera-equipped mobile phone, acting as an authentication token. QRP is extremely secure asall the sensitive information stored and transmitted is encrypted, but it isalso an easy to use and cost-efficient solution. QRP is portable and can be used securely in untrusted computers. Finally, QRP is able to successfully authenticate even when the phone is offline.

Reliable and persistent storage for CoDeS a distributed collaborative system

This research is aimed to find a solution for a distributed storage system adapted for CoDeS. By studying how DSSs work and how they are implemented, we can conclude how we can implement a DSS compatible with CoDeS requirements.

On codes, matroids, and secure multiparty computation from linear secret-sharing schemes

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sharing schemes (LSSSs), are studied. Such schemes are known to enable multiparty computation protocols secure against general (nonthreshold) adversaries.Two open problems related to the complexity of multiplicative LSSSs are considered in this paper. The first one deals with strongly multiplicative LSSSs. As opposed to the case of multiplicative LSSSs, it is not known whether there is an efficient method to transform an LSSS into a strongly multiplicative LSSS for the same access structure with a polynomial increase of the complexity. A property of strongly multiplicative LSSSs that could be useful in solving this problem is proved. Namely, using a suitable generalization of the well-known Berlekamp–Welch decoder, it is shown that all strongly multiplicative LSSSs enable efficient reconstruction of a shared secret in the presence of malicious faults. The second one is to characterize the access structures of ideal multiplicative LSSSs. Specifically, the considered open problem is to determine whether all self-dual vector space access structures are in this situation. By the aforementioned connection, this in fact constitutes an open problem about matroid theory, since it can be restated in terms of representability of identically self-dual matroids by self-dual codes. A new concept is introduced, the flat-partition, that provides a useful classification of identically self-dual matroids. Uniform identically self-dual matroids, which are known to be representable by self-dual codes, form one of the classes. It is proved that this property also holds for the family of matroids that, in a natural way, is the next class in the above classification: the identically self-dual bipartite matroids.