Compact Mathematical Formulation for Graph Partitioning

The graph partitioning problem consists of dividing the vertices of a graph into clusters, such that the weight of the edges crossing between clusters is minimized. We present a new compact mathematical formulation of this problem, based on the use of binary representation for the index of clusters assigned to vertices. This new formulation is almost minimal in terms of the number of variables and constraints and of the density of the constraint matrix. Its linear relaxation brings a very fast computational resolution, compared with the standard one.Experiments were conducted on classical large benchmark graphs designed for comparing heuristic methods. On one hand, these experiments show that the new formulation is surprisingly less time efficient than expected on general k-partitioning problems. On the other hand, the new formulation applied on bisection problems allows to obtain the optimum solution for about ten instances, where only best upper bounds were previously known.     

Conversion of Full-Scale Wet Scrubbers to Biotrickling Filters for H2S Control at Publicly Owned Treatment Works

Until recently, biological treatment of odors in biofilters or biotrickling filters was thought to require a longer gas contact time than chemical scrubbing, hence bioreactors for air treatment required a larger footprint. This paper discusses the conversion of chemical scrubbers to biological trickling filters. Initially, research was conducted with a laboratory-scale biotrickling filter. An effective open-pore polyurethane packing material was identified and H2S biotreatment performance was quantified. Key technical issues in determining the general suitability of converting wet scrubbers to biotrickling filters were identified, and a generic ten-step conversion procedure was developed. Following the laboratory research, five full-scale chemical scrubbers treating odorous air at the Sanitation District of Orange County, Calif., were converted to biotrickling filters. The original airflow rate was maintained, resulting in a gas contact time as low as 1.6–3.1?s. The converted biotrickling filters demonstrated an excellent capability for treating high H2S concentrations to concentrations below regulatory limits. This study shows outstanding potential for converting chemical scrubbers to biotrickling filters at publicly owned treatment works.     

Towards Pseudonymous e-Commerce

The lack of privacy is one of the main reasons that limits trust in e-commerce. Current e-commerce practice enforces a customer to disclose her identity to the e-shop and the use of credit cards makes it straightforward for an e-shop to know the real identity of its customers. Although there are some payment systems based on untraceable tokens, they are not as widely used as credit cards. Furthermore, even without buying anything, a customer is already disclosing some information about who or where she may be by just connecting to the e-shop's web server and leaving behind an IP-address. In this paper, we present novel components that enable secure pseudonymous e-commerce. On the one hand, these components allow a customer to browse through an e-shop, select goods, and pay the goods with her credit card such that neither the e-shop operator nor the credit card issuer nor an eavesdropper is able to get any information about the customer's identity. On the other hand, it is guaranteed that none of the involved parties is able to act dishonestly during the credit card payment. Such a system could greatly enhance trust in e-commerce since it overcomes the customers' privacy concerns.     

Sensitivity Analysis for Scheduling Problems

This paper represents a first attempt at a systematic study of sensitivity analysis for scheduling problems. Because schedules contain both combinatorial and temporal structures, scheduling problems present unique issues for sensitivity analysis. Some of the issues that we discuss have not been considered before. Others, while studied before, have not been explored in the context of scheduling. The applicability of these issues is illustrated using well-known scheduling models. We provide fast methods to determine when a previously optimal schedule remains optimal. Other methods restore an optimal schedule after a parameter change. The value of studying the sensitivity of an optimal sequence instead of the sensitivity of an optimal schedule is demonstrated. We show that, for some problems, sensitivity analysis results depend on the positions of jobs with changed parameters. We identify scheduling problems where performing additional or different computations during optimization facilitates sensitivity analysis. To improve the robustness of an optimal schedule, selection among multiple optimal schedules is considered. We discuss which types of sensitivity analysis questions are intractable because the scheduling problem itself is intractable. We also study how heuristic error bounds vary when the data of a scheduling problem is continuously modified. Although we focus on scheduling problems, several of the issues we discuss and our classification scheme can be extended to other optimization problems.     

Nonlinear averaging theorems, and the determination of parameter convergence rates in adaptive control

The paper presents nonlinear averaging theorems for two-time scale systems, where the dynamics of the fast system are allowed to vary with the slow system. The results are applied to the Narendra-Valavani adaptive control algorithm, and estimates of the parameter convergence rates are obtained which do not rely on a linearization of the system around the equilibrium, and therefore are valid in a larger region in the parameter space.     

The Deubiquitinating Enzyme USP48 Interacts with the Retinal Degeneration-Associated Proteins UNC119a and ARL3

Proteins related to the ubiquitin-proteasome system play an important role during the differentiation and ciliogenesis of photoreceptor cells. Mutations in several genes involved in ubiquitination and proteostasis have been identified as causative of inherited retinal dystrophies (IRDs) and ciliopathies. USP48 is a deubiquitinating enzyme whose role in the retina is still unexplored although previous studies indicate its relevance for neurosensory organs. In this work, we describe that a pool of endogenous USP48 localises to the basal body in retinal cells and provide data that supports the function of USP48 in the photoreceptor cilium. We also demonstrate that USP48 interacts with the IRD-associated proteins ARL3 and UNC119a, and stabilise their protein levels using different mechanisms. Our results suggest that USP48 may act in the regulation/stabilisation of key ciliary proteins for photoreceptor function, in the modulation of intracellular protein transport, and in ciliary trafficking to the photoreceptor outer segment.     

Spatial–Spectral Analysis of Hyperspectral Images Reveals Early Detection of Downy Mildew on Grapevine Leaves

Downy mildew is a highly destructive disease of grapevine. Currently, monitoring for its symptoms is time-consuming and requires specialist staff. Therefore, an automated non-destructive method to detect the pathogen before the visible symptoms appear would be beneficial for early targeted treatments. The aim of this study was to detect the disease early in a controlled environment, and to monitor the disease severity evolution in time and space. We used a hyperspectral image database following the development from 0 to 9 days post inoculation (dpi) of three strains of Plasmopara viticola inoculated on grapevine leaves and developed an automatic detection tool based on a Support Vector Machine (SVM) classifier. The SVM obtained promising validation average accuracy scores of 0.96, a test accuracy score of 0.99, and it did not output false positives on the control leaves and detected downy mildew at 2 dpi, 2 days before the clear onset of visual symptoms at 4 dpi. Moreover, the disease area detected over time was higher than that when visually assessed, providing a better evaluation of disease severity. To our knowledge, this is the first study using hyperspectral imaging to automatically detect and show the spatial distribution of downy mildew on grapevine leaves early over time.     

Membrane Targeting and GTPase Activity of Rab7 Are Required for Its Ubiquitination by RNF167

Rab7 is a GTPase that controls late endosome and lysosome trafficking. Recent studies have demonstrated that Rab7 is ubiquitinated, a post-translational modification mediated by an enzymatic cascade. To date, only one ubiquitin E3 ligase and one deubiquitinase have been identified in regulating Rab7 ubiquitination. Here, we report that RNF167, a transmembrane endolysosomal ubiquitin ligase, can ubiquitinate Rab7. Using immunoprecipitation and in vitro ubiquitination assays, we demonstrate that Rab7 is a direct substrate of RNF167. Subcellular fractionation indicates that RNF167 activity maintains Rab7′s membrane localization. Epifluorescence microscopy in HeLa cells shows that Rab7-positive vesicles are larger under conditions enabling Rab7 ubiquitination by RNF167. Characterization of its ubiquitination reveals that Rab7 must be in its GTP-bound active form for membrane anchoring and, thus, accessible for RNF167-mediated ubiquitin attachment. Cellular distribution analyses of lysosome marker Lamp1 show that vesicle positioning is independent of Rab7 and RNF167 expression and that Rab7 endosomal localization is not affected by RNF167 knockdown. However, both Rab7 and RNF167 depletion affect each other’s lysosomal localization. Finally, this study demonstrates that the RNF167-mediated ubiquitination of Rab7 GTPase is impaired by variants of Charcot–Marie–Tooth Type 2B disease. This study identified RNF167 as a new ubiquitin ligase for Rab7 while expanding our knowledge of the mechanisms underlying the ubiquitination of Rab7.     

Representing Animations by Principal Components

In this paper, we present a representation for three-dimensional geometric animation sequences. Different from standard key-frame techniques, this approach is based on the determination of principal animation components and decouples the animation from the underlying geometry. The new representation supports progressive animation compression with spatial, as well as temporal, level-of-detail and high compression ratios. The distinction of animation and geometry allows for mapping animations onto other objects.