Mark-Houwink-Sakurada coefficients for conventional poly(methyl methacrylate) in tetrahydrofuran

Summary Intrinsic viscosities [] in tetrahydrofuran (THF) at 30°C are reported for ten narrow molecular weight distribution poly(methyl methacrylate) (PMMA) samples covering nearly two orders of magnitude in molecular weight. By combining the viscosity results with absolute weight-average molecular weights determined via low-angle laser light scattering (LALLS) experiments, we have accurately determined the Mark-Houwink-Sakurada (MHS) parameters for this polymer-solvent pair (K=7.56x10⁵ and a=0.731, when [] is in dL g^-1).     

Induction of DNA-double-strand breaks by auger electrons from 99mTc complexes with DNA-binding ligands

The potential of certain Auger electron emitting nuclides for systemic radiotherapeutic applications has recently gained much attention. In particular, the ability of several nuclides, including 111In, 125I, and 123I, to induce DNA double-strand breaks (dsb), a good indicator of cytotoxicity, has been extensively studied. However, this ability has never previously been shown experimentally for 99mTc, which, besides the well-known gamma radiation that is used for diagnostic applications, also emits an average of 1.1 conversion electrons and 4 Auger or Coster-Kronig electrons per decay. Owing to the short range of Auger electrons, the radionuclide needs to be located very close to the DNA for dsb to occur. We synthesized two cationic 99mTcI-tricarbonyl complexes with pendant DNA binders, pyrene and anthraquinone. The X-ray crystal structures of the two complexes could be elucidated. Linear dichroism and UV/Vis spectroscopy revealed that the complex with pyrene intercalates DNA with a stability constant, K, of 1.1 x 10(6) M(-1), while the analogous complex with anthraquinone interacts with DNA in a groove-binding mode and has an affinity value of K=8.9 x 10(4) M(-1). We showed with phiX174 double-stranded DNA that the corresponding 99mTc complexes induce a significant amount of dsb, whereas non-DNA-binding [TcO4]- and nonradioactive Re compounds did not. These results indicate that the Auger electron emitter 99mTc can induce dsb in DNA when decaying in its direct vicinity and this implies potential for systemic radiotherapy with 99mTc complexes.     

Toward a secure Kerberos key exchange with smart cards

Public key Kerberos (PKINIT) is a standard authentication and key establishment protocol. Unfortunately, it suffers from a security flaw when combined with smart cards. In particular, temporary access to a user’s card enables an adversary to impersonate that user for an indefinite period of time, even after the adversary’s access to the card is revoked. In this paper, we extend Shoup’s key exchange security model to the smart card setting and examine PKINIT in this model. Using this formalization, we show that PKINIT is indeed flawed, propose a fix, and provide a proof that this fix leads to a secure protocol.     

Effect of fillers on the compatibility of polymer blends

The effects of carbon black, talc, and ultrafine silica filler, at different filler, loading, on the compatibility of two binary blends was examined. These were, the mechanically compatible polyurethane (PU)/poly(vinyl chloride) (PVC) at 25/75 weight ratio, and the poly(ε-caprolactone) (PCL)/styrene–acylonitrile (SAN) copolymer (with 30% AN content), at the 50/50 blend composition. For the former system, both dynamic mechanical analysis (DMA) and DSC measurements indicated that, depending on the filler surface, boundary layers are formed at the filler–matrix interface shifting the PU relaxation to higher temperatures. No significant effect was observed for the PVC component. Though the mechanical spectra are also affected, essentially no T_g shifts were observed for the PCL–SAN system. A qualitative explanation of selective filler activity towards the blend components was given by invoking the matrix–filler basic–acidic nature. Overall, the fillers had no compatibilizing effect on the blend. Using available theory both DSC and the DMA techniques agree in their estimate of the boundary layer thickness. Moduli data were also analyzed using mechanics models proposed for composite systems.     

Dense subgraph maintenance under streaming edge weight updates for real-time story identification

Recent years have witnessed an unprecedented proliferation of social media. People around the globe author, everyday, millions of blog posts, social network status updates, etc. This rich stream of information can be used to identify, on an ongoing basis, emerging stories, and events that capture popular attention. Stories can be identified via groups of tightly coupled real-world entities, namely the people, locations, products, etc, that are involved in the story. The sheer scale and rapid evolution of the data involved necessitate highly efficient techniques for identifying important stories at every point of time. The main challenge in real-time story identification is the maintenance of dense subgraphs (corresponding to groups of tightly coupled entities) under streaming edge weight updates (resulting from a stream of user-generated content). This is the first work to study the efficient maintenance of dense subgraphs under such streaming edge weight updates. For a wide range of definitions of density, we derive theoretical results regarding the magnitude of change that a single edge weight update can cause. Based on these, we propose a novel algorithm, DynDens, which outperforms adaptations of existing techniques to this setting and yields meaningful, intuitive results. Our approach is validated by a thorough experimental evaluation on large-scale real and synthetic datasets.     

Correction to: How to model and prove hybrid systems with KeYmaera: a tutorial on safety

International Journal on Software Tools for Technology Transfer -     

Accelerating SPARQL queries by exploiting hash-based locality and adaptive partitioning

State-of-the-art distributed RDF systems partition data across multiple computer nodes (workers). Some systems perform cheap hash partitioning, which may result in expensive query evaluation. Others try to minimize inter-node communication, which requires an expensive data preprocessing phase, leading to a high startup cost. Apriori knowledge of the query workload has also been used to create partitions, which, however, are static and do not adapt to workload changes. In this paper, we propose AdPart, a distributed RDF system, which addresses the shortcomings of previous work. First, AdPart applies lightweight partitioning on the initial data, which distributes triples by hashing on their subjects; this renders its startup overhead low. At the same time, the locality-aware query optimizer of AdPart takes full advantage of the partitioning to (1) support the fully parallel processing of join patterns on subjects and (2) minimize data communication for general queries by applying hash distribution of intermediate results instead of broadcasting, wherever possible. Second, AdPart monitors the data access patterns and dynamically redistributes and replicates the instances of the most frequent ones among workers. As a result, the communication cost for future queries is drastically reduced or even eliminated. To control replication, AdPart implements an eviction policy for the redistributed patterns. Our experiments with synthetic and real data verify that AdPart: (1) starts faster than all existing systems; (2) processes thousands of queries before other systems become online; and (3) gracefully adapts to the query load, being able to evaluate queries on billion-scale RDF data in subseconds.     

Probabilistic motion-compensated prediction in distributed video coding

Distributed video coding (DVC) constitutes an original coding framework to meet the stringent requirements imposed by uplink-oriented and low-power mobile video applications. The quality of the side information available to the decoder and the efficiency of the employed channel codes are primary factors determining the success of a DVC system. This contribution introduces two novel techniques for probabilistic motion compensation in order to generate side information at the Wyner-Ziv decoder. The employed DVC scheme uses a base layer, serving as a hash to facilitate overlapped block motion estimation at the decoder side. On top of the base layer, a supplementary Wyner-Ziv layer is coded in the DCT domain. Both proposed probabilistic motion compensation techniques are driven by the actual correlation channel statistics and reuse information contained in the hash. Experimental results report significant rate savings caused by the novel side information generation methods compared to previous techniques. Moreover, the compression performance of the presented DVC architecture, featuring the proposed side-information generation techniques, delivers state-of-the-art compression performance.     

Spatial inverse query processing

Traditional spatial queries return, for a given query object q, all database objects that satisfy a given predicate, such as epsilon range and k-nearest neighbors. This paper defines and studies inverse spatial queries, which, given a subset of database objects Q and a query predicate, return all objects which, if used as query objects with the predicate, contain Q in their result. We first show a straightforward solution for answering inverse spatial queries for any query predicate. Then, we propose a filter-and-refinement framework that can be used to improve efficiency. We show how to apply this framework on a variety of inverse queries, using appropriate space pruning strategies. In particular, we propose solutions for inverse epsilon range queries, inverse k-nearest neighbor queries, and inverse skyline queries. Furthermore, we show how to relax the definition of inverse queries in order to ensure non-empty result sets. Our experiments show that our framework is significantly more efficient than naive approaches.