An oracle approach for interaction neighborhood estimation in random fields

We consider the problem of interaction neighborhood estimation from the partial observation of a finite number of realizations of a random field. We introduce a model selection rule to choose estimators of conditional probabilities among natural candidates. Our main result is an oracle inequality satisfied by the resulting estimator. We use then this selection rule in a two-step procedure to evaluate the interacting neighborhoods. The selection rule selects a small prior set of possible interacting points and a cutting step remove from this prior set the irrelevant points. We also prove that the Ising models satisfy the assumptions of the main theorems, without restrictions on the temperature, on the structure of the interacting graph or on the range of the interactions. It provides therefore a large class of applications for our results. We give a computationally efficient procedure in these models. We finally show the practical efficiency of our approach in a simulation study.

TOWARD SEMANTIC WEB SERVICES AS MVC APPLICATIONS: FROM OWL-S VIA UML

OWL-S is an application of OWL, the Web Ontology Language, that describes the semantics of Web Services so that their discovery, selection, invocation and composition can be automated. The research literature reports the use of UML diagrams for the automatic generation of Semantic Web Service descriptions in OWL-S. This paper demonstrates a higher level of automation by generating complete complete Web applications from OWL-S descriptions that have themselves been generated from UML. Previously, we proposed an approach for processing OWL-S descriptions in order to produce MVC-based skeletons for Web applications. The OWL-S ontology undergoes a series of transformations in order to generate a Model-View-Controller application implemented by a combination of Java Beans, JSP, and Servlets code, respectively. In this paper, we show in detail the documents produced at each processing step. We highlight the connections between OWL-S specifications and executable code in the various Java dialects and show the Web interfaces that result from this process.

Upgrading a TCABR data analysis and acquisition system for remote participation using Java, XML, RCP and modern client/server communication/authentication

The TCABR data analysis and acquisition system has been upgraded to support a joint research programme using remote participation technologies. The architecture of the new system uses Java language as programming environment. Since application parameters and hardware in a joint experiment are complex with a large variability of components, requirements and specification solutions need to be flexible and modular, independent from operating system and computer architecture. To describe and organize the information on all the components and the connections among them, systems are developed using the extensible Markup Language (XML) technology. The communication between clients and servers uses remote procedure call (RPC) based on the XML (RPC-XML technology). The integration among Java language, XML and RPC-XML technologies allows to develop easily a standard data and communication access layer between users and laboratories using common software libraries and Web application. The libraries allow data retrieval using the same methods for all user laboratories in the joint collaboration, and the Web application allows a simple graphical user interface (GUI) access. The TCABR tokamak team in collaboration with the IPFN (Instituto de Plasmas e Fusao Nuclear, Instituto Superior Tecnico, Universidade Tecnica de Lisboa) is implementing this remote participation technologies. The first version was tested at the Joint Experiment on TCABR (TCABRJE), a Host Laboratory Experiment, organized in cooperation with the IAEA (International Atomic Energy Agency) in the framework of the IAEA Coordinated Research Project (CRP) on ""Joint Research Using Small Tokamaks"". (C) 2010 Elsevier B.V. All rights reserved.

AcMus: an open, integrated platform for room acoustics research

This article describes the design, implementation, and experiences with AcMus, an open and integrated software platform for room acoustics research, which comprises tools for measurement, analysis, and simulation of rooms for music listening and production. Through use of affordable hardware, such as laptops, consumer audio interfaces and microphones, the software allows evaluation of relevant acoustical parameters with stable and consistent results, thus providing valuable information in the diagnosis of acoustical problems, as well as the possibility of simulating modifications in the room through analytical models. The system is open-source and based on a flexible and extensible Java plug-in framework, allowing for cross-platform portability, accessibility and experimentation, thus fostering collaboration of users, developers and researchers in the field of room acoustics.

Herbage accumulation, growth and structural characteristics of Mombasa grass (Panicum maximum Jacq.) harvested at different cutting intervals

The objective of the present study was to evaluate herbage accumulation, morphological composition, growth rate and structural characteristics in Mombasa grass swards subject to different cutting intervals (3, 5 and 7 wk) during the rainy and dry seasons of the year. Treatments were assigned to experimental units (17.5 m(2)) according to a complete randomised block design, with four replicates. Herbage accumulation was greater in the rainy than in the dry season (83 and 17%, respectively). Herbage accumulation (24,300 kg DM ha(-1)), average growth rate (140 kg DM ha(-1) d(-1)) and sward height (111 cm) were highest in the 7 wk cutting interval, but leaf proportion (56%), leaf:stem (1.6) and leaf:non leaf (1.3) ratios decreased. Herbage accumulation, morphological composition and sward structure of Mombasa grass sward may be manipulated through defoliation frequency. The highest leaf proportion was recorded in the 3-wk cutting interval. Longer cutting intervals affected negatively sward structure, with potential negative effects on utilization efficiency, animal intake and performance.

ISOLATION OF Rickettsia bellii FROM Amblyomma ovale AND Amblyomma incisum TICKS FROM SOUTHERN BRAZIL

Objective. To isolate and characterize rickettsiae from the ticks Amblyomma ovale and Amblyomma incisum collected in the state of Sao Paulo. Materials and methods. Adult, free-living A. ovale and A. incisum were collected in an Atlantic rainforest area in the state of Sao Paulo, Brazil. Each tick was tested using the hemolymph assay; samples from positive ticks were placed in shell vials in order to isolate rickettsiae and subsequently grown in Vero cells. Amplification of three rickettsial genes ( gltA, htrA and ompA) was attempted using polymerase chain reaction (PCR) for each isolate obtained. Amplicons were subsequently sequenced. Results. A total of 388 A. incisum and 50 A. ovale were collected. Only one A. incisum and one A. ovale were hemolymph-test positive. Rickettsiae were successfully isolated from these ticks; however establishment in Vero cell culture was successful only for the isolate from A. ovale. Bacterial contamination in the first cell passage of the A. incisum isolate precluded successful isolation of the organism. PCR products were obtained with the gltA and htrA primers for the two isolates, but no product was obtained with the ompA primers. By BLAST analysis, partial gltA and htrA sequences of isolates from A. ovale and A. incisum were similar to the corresponding sequences of R. bellii. Conclusions. This is the first report of R. bellii infecting A. incisum and the first successful isolation from A. ovale.

Bayesian online algorithms for learning in discrete Hidden Markov Models

We propose and analyze two different Bayesian online algorithms for learning in discrete Hidden Markov Models and compare their performance with the already known Baldi-Chauvin Algorithm. Using the Kullback-Leibler divergence as a measure of generalization we draw learning curves in simplified situations for these algorithms and compare their performances.

One-time signature scheme from syndrome decoding over generic error-correcting codes

We describe a one-time signature scheme based on the hardness of the syndrome decoding problem, and prove it secure in the random oracle model. Our proposal can be instantiated on general linear error correcting codes, rather than restricted families like alternant codes for which a decoding trapdoor is known to exist. (C) 2010 Elsevier Inc. All rights reserved,

Proposal for DICOM Multiframe Medical Image Integrity and Authenticity

This paper presents a novel algorithm to successfully achieve viable integrity and authenticity addition and verification of n-frame DICOM medical images using cryptographic mechanisms. The aim of this work is the enhancement of DICOM security measures, especially for multiframe images. Current approaches have limitations that should be properly addressed for improved security. The algorithm proposed in this work uses data encryption to provide integrity and authenticity, along with digital signature. Relevant header data and digital signature are used as inputs to cipher the image. Therefore, one can only retrieve the original data if and only if the images and the inputs are correct. The encryption process itself is a cascading scheme, where a frame is ciphered with data related to the previous frames, generating also additional data on image integrity and authenticity. Decryption is similar to encryption, featuring also the standard security verification of the image. The implementation was done in JAVA, and a performance evaluation was carried out comparing the speed of the algorithm with other existing approaches. The evaluation showed a good performance of the algorithm, which is an encouraging result to use it in a real environment.