Optimal assembly plan generation: a simplifying approach

The main difficulty in the overall process of optimal assembly plan generation is the great number of different ways to assemble a product (typically thousands of solutions). This problem confines the application of most existing automated planning methods to products composed of only a limited number of components. The presented method of assembly plan generation belongs to the approach called “disassembly” and is founded on a new representation of the assembly process, with introduction of a new concept, the equivalence of binary trees. This representation allows to generate the minimal list of all non-redundant (really different) assembly plans. Plan generation is directed by assembly operation constraints and plan-level performance criteria. The method was tested for various assembly applications and compared to other generation approaches. Results show a great reduction in the combinatorial explosion of the number of plans. Therefore, this simplifying approach of assembly sequence modeling allows to handle more complex products with a large number of parts.     

Blind digital watermarking in PDF documents using Spread Transform Dither Modulation

In this paper, a blind digital watermarking scheme for Portable Document Format (PDF) documents is proposed. The proposed method is based on a variant Quantization Index Modulation (QIM) method called Spread Transform Dither Modulation (STDM). Each bit of the secret message is embedded into a group of characters, more specifically in their x-coordinate values. The method exhibits experiments of two opposite objectives: transparency and robustness, and is motivated to present an acceptable distortion value that shows sufficient robustness under high density noises attacks while preserving sufficient transparency.     

Fragile base-class problem,problem?

The fragile base-class problem (FBCP) has been described in the literature as a consequence of “misusing” inheritance and composition in object-oriented programming when (re)using frameworks. Many research works have focused on preventing the FBCP by proposing alternative mechanisms for reuse, but, to the best of our knowledge, there is no previous research work studying the prevalence and impact of the FBCP in real-world software systems. The goal of our work is thus twofold: (1) assess, in different systems, the prevalence of micro-architectures, called FBCS, that could lead to two aspects of the FBCP, (2) investigate the relation between the detected occurrences and the quality of the systems in terms of change and fault proneness, and (3) assess whether there exist bugs in these systems that are related to the FBCP. We therefore perform a quantitative and a qualitative study. Quantitatively, we analyse multiple versions of seven different open-source systems that use 58 different frameworks, resulting in 301 configurations. We detect in these systems 112,263 FBCS occurrences and we analyse whether classes playing the role of sub-classes in FBCS occurrences are more change and–or fault prone than other classes. Results show that classes participating in the analysed FBCS are neither more likely to change nor more likely to have faults. Qualitatively, we conduct a survey to confirm/infirm that some bugs are related to the FBCP. The survey involves 41 participants that analyse a total of 104 bugs of three open-source systems. Results indicate that none of the analysed bugs is related to the FBCP. Thus, despite large, rigorous quantitative and qualitative studies, we must conclude that the two aspects of the FBCP that we analyse may not be as problematic in terms of change and fault-proneness as previously thought in the literature. We propose reasons why the FBCP may not be so prevalent in the analysed systems and in other systems in general.     

Predicted Virtual Soft Shadow Maps with High Quality Filtering

In this paper we present a novel image based algorithm to render visually plausible anti‐aliased soft shadows in a robust and efficient manner. To achieve both high visual quality and high performance, it employs an accurate shadow map filtering method which guarantees smooth penumbrae and high quality anisotropic anti‐aliasing of the sharp transitions. Unlike approaches based on pre‐filtering approximations, our approach does not suffer from light bleeding or losing contact shadows. Discretization artefacts are avoided by creating virtual shadow maps on the fly according to a novel shadow map resolution prediction model. This model takes into account the screen space frequency of the penumbrae via a perceptual metric which has been directly established from an appropriate user study. Consequently, our algorithm always generates shadow maps with minimal resolutions enabling high performance while guarantying high quality. Thanks to this perceptual model, our algorithm can sometimes be faster at rendering soft shadows than hard shadows. It can render game‐like scenes at very high frame rates, and extremely large and complex scenes such as CAD models at interactive rates. In addition, our algorithm is highly scalable, and the quality versus performance trade‐off can be easily tweaked.     

Adaptive records for volume irradiance caching

In this paper, we present a new irradiance caching scheme using Monte Carlo ray tracing for efficiently rendering participating media. The irradiance cache algorithm is extended to participating media. Our method allows to adjust the density of cached records depending on illumination changes. Direct and indirect contributions can be stored in the records but also multiple scattering. An adaptive shape of the influence zone of records, depending on geometrical features and irradiance variations, is introduced. To avoid a high density of cached records in low interest areas, a new method controls the density of the cache when adding new records. This record density control depends on the interpolation quality and on the photometric characteristics of the medium. Reducing the number of records accelerates both the computation pass and the rendering pass by decreasing the number of queries to the cache data structure (Kd-tree). Finally, instead of using an expensive ray marching to find records that cover the ray, we gather all the contributive records along the ray. With our method, pre-computing and rendering passes are significantly speeded-up.     

A Proof-Planning Framework with explicit Abstractions based on Indexed Formulas

A major motivation of proof-planning is to bridge the gap between high-level, cognitively adequate reasoning for specific domains, and calculus-level reasoning to ensure soundness. For high reasoning levels the cognitive adequacy of representation and reasoning techniques is a major issue, while for lower reasoning levels the adequacy wrt. the modelled domain is important. Furthermore, proof construction is an engineering task and there is a need to support the design and application of proof-search engineering methods. To this end we present a framework to explicitly support different reasoning levels. To structure reasoning levels the framework allows for an explicit representation of abstractions and proof-search refinement techniques. In order to ensure soundness within a reasoning level, we use techniques developed in the context of matrix characterisation relying on the notion of indexed formulas. Furthermore, we introduce a uniform concept for contextual reasoning, and sketch basic tacticals for the definition of tactics to organise the overall proof-search inside and across different reasoning levels.     

Food vacuole proteome of the malarial parasite Plasmodium falciparum

The Plasmodium falciparum food vacuole (FV) is a lysosome-like organelle where erythrocyte hemoglobin digestion occurs. It is a favorite target in the development of antimalarials. We have used a tandem mass spectrometry approach to investigate the proteome of an FV-enriched fraction and identified 116 proteins. The electron microscopy analysis and the Western blot data showed that the major component of the fraction was the FV and, as expected, the majority of previously known FV markers were recovered. Of particular interest, several proteins involved in vesicle-mediated trafficking were identified, which are likely to play a key role in FV biogenesis and/or FV protein trafficking. Recovery of parasite surface proteins lends support to the cytostomal pathway of hemoglobin ingestion as a FV trafficking route. We have identified 32 proteins described as hypothetical in the databases. This insight into FV protein content provides new clues towards understanding the biological function of this organelle in P. falciparum.     

Oxidation of proteins: Basic principles and perspectives for blood proteomics

Protein oxidation mechanisms result in a wide array of modifications, from backbone cleavage or protein crosslinking to more subtle modifications such as side chain oxidations. Protein oxidation occurs as part of normal regulatory processes, as a defence mechanism against oxidative stress, or as a deleterious processes when antioxidant defences are overcome. Because blood is continually exposed to reactive oxygen and nitrogen species, blood proteomics should inherently adopt redox proteomic strategies. In this review, we recall the biochemical basis of protein oxidation, review the proteomic methodologies applied to analyse redox modifications, and highlight some physiological and in vitro responses to oxidative stress of various blood components.