The Building Blocks of a PaaS

Traditional cloud computing providers enable developers to program and deploy applications in the cloud by using platform as a service (PaaS) providers. Despite the benefits of such an approach, this service model usually comes with a high level of the lock in effect into the service provider. The lock in effect occurs when a software developer needs to change its cloud provider. When this happens, it usually means a major application rewrite, specific for the new PaaS. This paper details the initial results of a project whose goal is to build a PaaS where vendor lock in does not occur. With this PaaS, developers wishing to deploy their applications into the cloud may continue to program using their usual development environments. There are no necessary changes required to make the application PaaS compatible. As a proof of concept, we developed an open source PaaS management application as a regular web application and then deployed it on the cloud.     

Rheological and extrusion characteristics of glass fiber-reinforced polycarbonate

An experimental investigation of the rheological properties of glass fiber-reinforced polycarbonate melts and the extrusion of such compounds through capillary and slit dies is presented. The viscosity–shear rate function seems independent of instrument for cone-plate and capillary investigations. The presence of fibers increases the level of the viscosity. Normal stresses at fixed shear stress are also increased by the presence of fibers. The extrudate swell is decreased by the presence of fibers and surface roughness is increased. Fiber orientation increases and surface roughness decreases with increasing extrusion rate.     

Boundary scan test,test methodology,and fault modeling

The test technique called boundary scan test (BST) offers new opportunities in testing but confronts users with new problems too. The implementation of BST in a chip has become an IEEE standard and users on board level are the next group to begin thinking about using the new possibilities. This article addresses some of the questions about changes in board-level testing and fault diagnosis. The fault model itself is also affected by using BST. Trivial items are extended with more sophisticated details in order to complete the fault model. Finally, BST appears to be a test technique that offers a high degree of detectability on board level, but for diagnosis, some additional effort has to be made.     

Capture device identification from digital images using Kullback-Leibler divergence

Multimedia Tools and Applications - It is proposed a forensic method for the capture device identification from digital images, which requires two elements: i) a digital image subject to...     

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

International Journal on Software Tools for Technology Transfer -     

A finite volume–finite difference method with a stiff ordinary differential equation solver for advection–diffusion–reaction equation

A model for atmospheric pollutant transport is proposed considering an advection–diffusion–reaction equation. A splitting method is used to decouple the advection, diffusion and reaction parts. A scheme based on finite volume, finite difference and backward differentiation formula is used for solving an atmospheric transport-chemistry problem.     

Probabilistic consensus clustering using evidence accumulation

Machine Learning - Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence...     

Quantum commitments from complexity assumptions

Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and in the quantum regime, we examine computationally secure commitment schemes. In this paper we study worst-case complexity assumptions that imply quantum bit commitment schemes. First, we show that QSZK \({\not\subseteq}\) QMA implies a computationally hiding and statistically binding auxiliary-input quantum commitment scheme. We then extend our result to show that the much weaker assumption QIP \({\not\subseteq}\) QMA (which is weaker than PSPACE \({\not\subseteq}\) PP) implies the existence of auxiliary-input commitment schemes with quantum advice. Finally, to strengthen the plausibility of the separation QSZK \({\not\subseteq}\) QMA, we find a quantum oracle relative to which honest-verifier QSZK is not contained in QCMA, the class of languages that can be verified using a classical proof in quantum polynomial time.     

Design complexity control in truss optimization

Truss optimization based on the ground structure approach often leads to designs that are too complex for practical purposes. In this paper we present an approach for design complexity control in truss optimization. The approach is based on design complexity measures related to the number of bars (similar to Asadpoure et al. Struct Multidisc Optim 51(2):385–396 2015) and a novel complexity measure related to the number of nodes of the structure. Both complexity measures are continuously differentiable and thus can be used together with gradient based optimization algorithms. The numerical examples show that the proposed approach is able to reduce design complexity, leading to solutions that are more fit for engineering practice. Besides, the examples also indicate that in some cases it is possible to significantly reduce design complexity with little impact on structural performance. Since the complexity measures are non convex, a global gradient based optimization algorithm is employed. Finally, a detailed comparison to a classical approach is presented.