Scalable Parallel Numerical Constraint Solver Using Global Load Balancing

We present a scalable parallel solver for numerical constraint satisfaction problems (NCSPs). Our parallelization scheme consists of homogeneous worker solvers, each of which runs on an available core and communicates with others via the global load balancing (GLB) method. The parallel solver is implemented with X10 that provides an implementation of GLB as a library. In experiments, several NCSPs from the literature were solved and attained up to 516-fold speedup using 600 cores of the TSUBAME2.5 supercomputer.Comment: To be presented at X10'15 Worksho

Automated CPX support system preliminary design phase

The development of the Distributed Command and Control System (DCCS) is discussed. The development of an automated C2 system stimulated the development of an automated command post exercise (CPX) support system to provide a more realistic stimulus to DCCS than could be achieved with the existing manual system. An automated CPX system to support corps-level exercise was designed. The effort comprised four tasks: (1) collecting and documenting user requirements; (2) developing a preliminary system design; (3) defining a program plan; and (4) evaluating the suitability of the TRASANA FOURCE computer model

Reality Versus Grant Application Research “Plans”

This article describes the implementation of the American Indian mHealth Smoking Dependence Study focusing on the differences between what was written in the grant application compared to what happened in reality. The study was designed to evaluate a multicomponent intervention involving 256 participants randomly assigned to one of 15 groups. Participants received either a minimal or an intense level of four intervention components: (1) nicotine replacement therapy, (2) precessation counseling, (3) cessation counseling, and (4) mHealth text messaging. The project team met via biweekly webinars as well as one to two in-person meetings per year throughout the study. The project team openly shared progress and challenges and collaborated to find proactive solutions to address challenges as compared to what was planned in the original grant application. The project team used multiple strategies to overcome unanticipated intervention issues: (1) cell phone challenges, (2) making difficult staffing decisions, (3) survey lessons, (4) nicotine replacement therapy, (5) mHealth text messages, (6) motivational interviewing counseling sessions, and (7) use of e-cigarettes. Smoking cessation studies should be designed based on the grant plans. However, on the ground reality issues needed to be addressed to assure the scientific rigor and innovativeness of this study

Tau Be or not Tau Be? - A Perspective on Service Compatibility and Substitutability

One of the main open research issues in Service Oriented Computing is to propose automated techniques to analyse service interfaces. A first problem, called compatibility, aims at determining whether a set of services (two in this paper) can be composed together and interact with each other as expected. Another related problem is to check the substitutability of one service with another. These problems are especially difficult when behavioural descriptions (i.e., message calls and their ordering) are taken into account in service interfaces. Interfaces should capture as faithfully as possible the service behaviour to make their automated analysis possible while not exhibiting implementation details. In this position paper, we choose Labelled Transition Systems to specify the behavioural part of service interfaces. In particular, we show that internal behaviours (tau transitions) are necessary in these transition systems in order to detect subtle errors that may occur when composing a set of services together. We also show that tau transitions should be handled differently in the compatibility and substitutability problem: the former problem requires to check if the compatibility is preserved every time a tau transition is traversed in one interface, whereas the latter requires a precise analysis of tau branchings in order to make the substitution preserve the properties (e.g., a compatibility notion) which were ensured before replacement.Comment: In Proceedings WCSI 2010, arXiv:1010.233

Certainty Closure: Reliable Constraint Reasoning with Incomplete or Erroneous Data

Constraint Programming (CP) has proved an effective paradigm to model and solve difficult combinatorial satisfaction and optimisation problems from disparate domains. Many such problems arising from the commercial world are permeated by data uncertainty. Existing CP approaches that accommodate uncertainty are less suited to uncertainty arising due to incomplete and erroneous data, because they do not build reliable models and solutions guaranteed to address the user's genuine problem as she perceives it. Other fields such as reliable computation offer combinations of models and associated methods to handle these types of uncertain data, but lack an expressive framework characterising the resolution methodology independently of the model. We present a unifying framework that extends the CP formalism in both model and solutions, to tackle ill-defined combinatorial problems with incomplete or erroneous data. The certainty closure framework brings together modelling and solving methodologies from different fields into the CP paradigm to provide reliable and efficient approches for uncertain constraint problems. We demonstrate the applicability of the framework on a case study in network diagnosis. We define resolution forms that give generic templates, and their associated operational semantics, to derive practical solution methods for reliable solutions.Comment: Revised versio

Analysis and Verification of Service Interaction Protocols - A Brief Survey

Modeling and analysis of interactions among services is a crucial issue in Service-Oriented Computing. Composing Web services is a complicated task which requires techniques and tools to verify that the new system will behave correctly. In this paper, we first overview some formal models proposed in the literature to describe services. Second, we give a brief survey of verification techniques that can be used to analyse services and their interaction. Last, we focus on the realizability and conformance of choreographies.Comment: In Proceedings TAV-WEB 2010, arXiv:1009.330

Diagnosing and measuring incompatibilities between pairs of services

International audienceThis text presents a tool, from its design to its implementation, which detects all behavioural incompatibilities between two service interfaces. Unlike prior work, the proposed solution does not simply check whether two services are incompatible or not, it rather provides detailed diagnosis, including the incompatibilities and for each one the location in the service interfaces where these incompatibilities occur. A measure of similarity between interfaces which considers outputs from the detection algorithm is proposed too. A visual report of the comparison analysis is also provided which pinpoints a set of incompatibilities that cause a behavioural interface not to simulate another one

Conifer DBMagic: a database housing multiple de novo transcriptome assemblies for 12 diverse conifer species

Conifers comprise an ancient and widespread plant lineage of enormous commercial and ecological value. However, compared to model woody angiosperms, such as Populus and Eucalyptus, our understanding of conifers remains quite limited at a genomic level. Large genome sizes (10,000–40,000 Mbp) and large amounts of repetitive DNA have limited efforts to produce a conifer reference genome, and genomic resource development has focused primarily on characterization of expressed sequences. Here, we report the completion of a conifer transcriptome sequencing project undertaken in collaboration with the U.S. DOE Joint Genome Institute that resulted in production of almost 12 million sequence reads. Five loblolly pine (Pinus taeda) cDNA libraries representing multiple tissues, treatments, and genotypes produced over four million sequence reads that, along with available Sanger expressed sequence tags, were used to create contig assemblies using three different assembly algorithms: Newbler, MiraEST, and NGen. In addition, libraries from 11 other conifer species, as well as one member of the Gnetales (Gnetum gnemon), produced 0.4 to 1.2 million sequence reads each. Among the selected conifer species were representatives of each of the seven phylogenetic families in the Coniferales: Araucariaceae, Cephalotaxaceae, Cupressaceae, Pinaceae, Podocarpaceae, Sciadopityaceae, and Taxaceae. Transcriptome builds for each species were generated using each of the three assemblers. All contigs for every species generated using each assembler can be obtained from Conifer DBMagic, a public database for searching, viewing, and downloading contig sequences, the associated sequence reads, and their annotations.Keywords: Database, Gene models, Pinus, Comparative phylogenomics, Annotation, Transcriptome, Coniferale

Distribution of Alarin Immunoreactivity in the Mouse Brain

Alarin is a 25 amino acid peptide that belongs to the galanin peptide family. It is derived from the galanin-like peptide gene by a splice variant, which excludes exon 3. Alarin was first identified in gangliocytes of neuroblastic tumors and later shown to have a vasoactive function in the skin. Recently, alarin was demonstrated to stimulate food intake as well as the hypothalamic–pituitary–gonadal axis in rodents, suggesting that it might be a neuromodulatory peptide in the brain. However, the individual neurons in the central nervous system that express alarin have not been identified. Here, we determined the distribution of alarin-like immunoreactivity (alarin-LI) in the adult murine brain. The specificity of the antibody against alarin was demonstrated by the absence of labeling after pre-absorption of the antiserum with synthetic alarin peptide and in transgenic mouse brains lacking neurons expressing the GALP gene. Alarin-LI was observed in different areas of the murine brain. A high intensity of alarin-LI was detected in the accessory olfactory bulb, the medial preoptic area, the amygdala, different nuclei of the hypothalamus such as the arcuate nucleus and the ventromedial hypothalamic nucleus, the trigeminal complex, the locus coeruleus, the ventral chochlear nucleus, the facial nucleus, and the epithelial layer of the plexus choroideus. The distinct expression pattern of alarin in the adult mouse brain suggests potential functions in reproduction and metabolism