High modulus of isotactic polypropylene attained by coextrusion with atactic polystyrene

Orientation-induced crystallization of crystallizable polymer melts can occur, under certain conditions, during flow through converging channels. Attempts have been made to achieve this phenomenon in a two-phase system, i.e., during simultaneous extrusion of a continuous concentric core of polypropylene within a polystyrene matrix through a conical duct. On one occasion, using Carlona P SY6100 (MFI = 11.0) with Hostyren N2000-V-01 (MFI = 25.0), a highly oriented polypropylene thread with a modulus of 14.6 GPa and a melting point of 178°C was extruded at a die temperature of approximately 170°C and a pressure lower than 40 MPa. It is, in principle, possible to form highly oriented, fiber-like structures as reinforcing elements in a polymer matrix.     

Iterative method for the design of DFT filter Bank

Multirate adaptive filters have numerous advantages such as low computational load, fast convergence, and parallelism in the adaptation. Drawbacks when using multirate processing are mainly related to aliasing and reconstruction effects. These effects can be minimized by introducing appropriate problem formulation and employing sophisticated optimization techniques. In this paper, we propose a formulation for the design of a filter bank which controls the distortion level for each frequency component directly and minimizes the inband aliasing and the residual aliasing between different subbands. The advantage of this problem formulation is that the distortion level can be weighted for each frequency depending on the particular practical application. A new iterative algorithm is proposed to optimize simultaneously over both the analysis and the synthesis filter banks. This algorithm is shown to have a unique solution for each iteration. For a fixed distortion level, the proposed algorithm yields a significant reduction in both the inband aliasing and the residual aliasing levels compared to existing methods applied to the numerical examples.     

Immersive electronic books for surgical training

Immersive electronic books (IEBooks) for surgical training will let surgeons explore previous surgical procedures in 3D. The authors describe the techniques and tools for creating a preliminary IEBook, embodying some of the basic concepts.     

Quantum Algorithms for Weighing Matrices and Quadratic Residues

Abstract. In this article we investigate how we can employ the structure of combinatorial objects like Hadamard matrices and weighing matrices to devise new quantum algorithms. We show how the properties of a weighing matrix can be used to construct a problem for which the quantum query complexity is significantly lower than the classical one. It is pointed out that this scheme captures both Bernstein and Vazirani's inner-product protocol, as well as Grover's search algorithm. In the second part of the article we consider Paley's construction of Hadamard matrices, which relies on the properties of quadratic characters over finite fields. We design a query problem that uses the Legendre symbol χ (which indicates if an element of a finite field F _q is a quadratic residue or not). It is shown how for a shifted Legendre function f _s (i)=χ(i+s) , the unknown s ∈ F _q can be obtained exactly with only two quantum calls to f _s . This is in sharp contrast with the observation that any classical, probabilistic procedure requires more than log q + log ((1-ɛ )/2) queries to solve the same problem.     

Provably correct runtime monitoring

Runtime monitoring is an established technique to enforce a wide range of program safety and security properties. We present a formalization of monitoring and monitor inlining, for the Java Virtual Machine. Monitors are security automata given in a special-purpose monitor specification language, ConSpec. The automata operate on finite or infinite strings of calls to a fixed API, allowing local dependencies on parameter values and heap content. We use a two-level class file annotation scheme to characterize two key properties: (i) that the program is correct with respect to the monitor as a constraint on allowed program behavior, and (ii) that the program has a copy of the given monitor embedded into it. As the main application of these results we sketch a simple inlining algorithm and show how the two-level annotations can be completed to produce a fully annotated program which is valid in the standard sense of Floyd/Hoare logic. This establishes the mediation property that inlined programs are guaranteed to adhere to the intended policy. Furthermore, validity can be checked efficiently using a weakest precondition based annotation checker, thus preparing the ground for on-device checking of policy adherence in a proof-carrying code setting.     

Improving the SMAC atmospheric correction code by analysis of Meteosat Second Generation NDVI and surface reflectance data

In order to obtain high quality data, the correction of atmospheric perturbations acting upon land surface reflectance measurements recorded by a space-based sensor is an important topic within remote sensing. For many years the Second Simulation of the Satellite Signal in the Solar Spectrum (6S) radiative transfer model and the Simplified Method for Atmospheric Correction (SMAC) codes have been used for this atmospheric correction, but previous studies have shown that in a number of situations the quality of correction provided by the SMAC is low. This paper describes a method designed to improve the quality of the SMAC atmospheric correction algorithm through a slight increase in its computational complexity. Data gathered from the SEVIRI aboard Meteosat Second Generation (MSG) is used to validate the additions to SMAC, both by comparison to simulated data corrected using the highly accurate 6S method and by comparison to in-situ and 6S corrected SEVIRI data gathered for two field sites in Africa. The additions to the SMAC are found to greatly increase the quality of atmospheric correction performed, as well as broaden the range of atmospheric conditions under which the SMAC can be applied. When examining the Normalised Difference Vegetation Index (NDVI), the relative difference between SMAC and in-situ values decreases by 1.5% with the improvements in place. Similarly, the mean relative difference between SMAC and 6S reflectance values decreases by a mean of 13, 14.5 and 8.5% for Channels 1, 2 and 3 respectively. Furthermore, the processing speed of the SMAC is found to remain largely unaffected, with only a small increase in the time taken to process a full SEVIRI scene. Whilst the method described within this paper is only applicable to SEVIRI data, a similar approach can be applied to other data sources than SEVIRI, and should result in a similar accuracy improvement no matter which instrument supplies the original data.     

Service Composition Issues in Pervasive Computing

Providing new services by combining existing ones—or service composition—is an idea pervading pervasive computing. Pervasive computing technologies seek to concurrently exhibit context awareness, manage contingencies, leverage device heterogeneity, and empower users. These four goals prompt service-composition-mechanism design requirements that are unique to pervasive computing. This article catalogs service composition mechanisms and describes their variation points, which indicate how well the resulting compositions meet the four goals.     

A generalization of Paillier’s public-key system with applications to electronic voting

We propose a generalization of Paillier’s probabilistic public-key system, in which the expansion factor is reduced and which allows to adjust the block length of the scheme even after the public key has been fixed, without losing the homomorphic property. We show that the generalization is as secure as Paillier’s original system and propose several ways to optimize implementations of both the generalized and the original scheme. We construct a threshold variant of the generalized scheme as well as zero-knowledge protocols to show that a given ciphertext encrypts one of a set of given plaintexts, and protocols to verify multiplicative relations on plaintexts. We then show how these building blocks can be used for applying the scheme to efficient electronic voting. This reduces dramatically the work needed to compute the final result of an election, compared to the previously best known schemes. We show how the basic scheme for a yes/no vote can be easily adapted to casting a vote for up to t out of L candidates. The same basic building blocks can also be adapted to provide receipt-free elections, under appropriate physical assumptions. The scheme for 1 out of L elections can be optimized such that for a certain range of the other parameter values, the ballot size is logarithmic in L.     

Incidental Exposure,Selective Exposure,and Political Information Sharing: Integrating Online Exposure Patterns and Expression on Social Media

Political information sharing in social media offers citizens opportunities to engage with news and express their political views, but how do different patterns of online political information exposure, including both incidental and selective exposure, affect sharing? Using two‐wave panel survey data collected in the United States, we examine the relationship between incidental and selective exposure and their consequent links to political information sharing, across different levels of strength of political party affiliation. Our results demonstrate that incidental exposure to counter‐attitudinal information drives stronger partisans to more actively seek out like‐minded political content, which subsequently encourages political information sharing on social media. The results highlight the need to consider both types of political information exposure when modeling citizens' political behavior online.