Formation of Mixed Bond‐Angle Linkages in Zinc Boromolybdate Glasses

The short and medium range structure of glassy MoO₃–ZnO–B₂O₃ has been studied by neutron diffraction and reverse Monte Carlo simulation. The partial atomic pair correlation functions and coordination numbers are presented that are not yet reported for this system. We have established that the first neighbor distances do not depend on concentration within limit of error, the actual values are r_B‐O = 1.38 Å, r_Mo‐O = 1.72 Å, and r_Zn‐O = 1.97 Å. It is found that ZnO takes part in the glassy structure as network former, as ZnO₄ tetrahedral are linked both to MoO₄ and to BO₃ and BO₄ groups. It is revealed that BO₄/BO₃ increases with increasing B₂O₃ content. We have found that only small amount of boroxol ring is present, BO₃ and BO₄ groups are organized into superstructure units, and a small part is in isolated BO₃ triangles. The BO₃ and BO₄ units are linked to MoO₄ or ZnO₄ forming mixed ^[4]Mo‐O‐^[3]B, ^[4]Mo‐O‐^[4]B, ^[4]Mo‐O‐^[4]Zn, ^[3]B‐O‐^[4]Zn, ^[4]B‐O‐^[4]Zn bond linkages.     

Reactive inkjet printing of polyethylene glycol and isocyanate based inks to create porous polyurethane structures

Reactive inkjet printing offers a direct way to create polymeric structures in situ on a substrate. Therefore, two component polyurethane formulations can be utilized to be used in multicomponent inkjet printing. In this contribution, the use of polyethylene glycol (M = 200 g mol⁻¹), glycerol ethoxylate (M = 1,000 g mol⁻¹), and water (blowing agent) in combination with aliphatic 1,6-hexamethylene diisocyanate or aromatic methylene diphenyl diisocyanate for reactive inkjet printing is evaluated. The inks are jettable on a Dimatix DMP-3000 inkjet printer using a 10 pL piezo driven drop-on-demand printhead showing stable droplet formation. Solid films on glass are formed using a drop-by-drop printing strategy. Layer-by-Layer strategy gives best results on polycarbonate substrates forming porous polyurethane structures. © 2018 Wiley Periodicals, Inc. J. Appl. Polym. Sci. 2019 , 136, 46977.     

Recycling von marinen Sekundärrohstoffen

As a waste product, oyster shells pose a major environmental pollution problem and the reuse of the material is becoming increasingly important. Since the comminution process in the recycling of secondary raw materials defines the properties of the material, oyster shells were grinded using a planetary ball mill and an impact mill and the fractions obtained were analyzed in terms of size and shape and compared with each other. A comminuted material from the impact mill was used for a series of wetting experiments, which helped to demonstrate the surface free energy of the material.     

Syndiospecific polymerization of propene under different processes with different bridged [(RPh)2C(Cp)(2,7-BuFlu)]ZrCl2 metallocene catalysts

The synthesis of syndiotactic polypropene was achieved by using new C_S-symmetric ansa-metallocene catalysts of the type [Ph′₂C(Cp)(2,7-^tertBu₂Flu)]ZrCl₂ (Ph′₂=Ph₂, (4-MePh)₂, 3,4′-Me₂Ph₂, (4-OCH₃Ph)₂). Applying these catalysts, the influence of the substitution pattern of the bridge on the polymerization performance can be studied and highly syndiotactic polypropene (rrrr>99%) with high molar masses and high melting temperatures (up to 153 °C) was obtained.Propene was polymerized at different temperatures under four sets of conditions: in toluene solution, bulk, toluene slurry, and gas phase with NaCl as stirred bed material. Methylaluminoxane (MAO) and methylaluminoxane supported on silicagel (MAO/SiO₂) were used as cocatalyst, respectively. In order to estimate the influence of the process on the single site properties of the catalysts, comparisons were made between polymer properties, i.e. microstructure, melting temperature, molar mass, and polymer morphology, thus allowing the effect of the support on the catalyst to be observed.     

Information technology in Nigerian banks: The limits of expectations

In the last ten years, banks in developed countries have been investing more and more in information technology (IT) as a means to reduce costs and improve operational efficiency. An investigation of the application of IT in Nigerian banks was carried out in order to determine the expectations and success of IT implementations in the sector. The data were generated from a survey of randomly selected branches of 56 banks in Lagos, the commercial capital of Nigeria. Almost all the banks had an IT policy, the main thrusts of which where to achieve full application of IT, to be able to meet organisational goals, to secure competitive advantage, and to be up to date. Only 54.6% of them actually achieved some measure of successful implementations. The expected benefits of investment in IT were realised in only a relatively few number of banks. The consequence was that less than 40% of the banks were poised to maximise the benefits of IT through major investments, especially in the areas of online access and transactions, electronic commerce, and electronic publishing. It is estimated that at least 60% of the branches of these banks are spending less than $150,000 annually on IT. An upsurge of investment is, however, expected, first by the banks that style themselves as progressive and have already made some success in IT implementations, and later by the other banks.     

Ultraviolet photodetectors and readout based on a-IGZO semiconductor technology

In this work, real-time ultraviolet photodetectors are realized through metal–semiconductor–metal (MSM) structures. Amorphous indium gallium zinc oxide (a-IGZO) is used as semiconductor material and gold as metal electrodes. The readout of an individual sensor is implemented by a transimpedance amplifier (TIA) consisting of an all-enhancement a-IGZO thin-film transistor (TFT) operational amplifier and a switched capacitor (SC) as feedback resistance. The photosensor and the transimpedance amplifier are both manufactured on glass substrates. The measured photosensor possesses a high responsivity R , a low response time t _{R E S} , and a good noise equivalent power value NEP .     

Automated property verification for large scale B models with ProB

In this paper we describe the successful application of the ProB tool for data validation in several industrial applications. The initial case study centred on the San Juan metro system installed by Siemens. The control software was developed and formally proven with B. However, the development contains certain assumptions about the actual rail network topology which have to be validated separately in order to ensure safe operation. For this task, Siemens has developed custom proof rules for Atelier B. Atelier B, however, was unable to deal with about 80 properties of the deployment (running out of memory). These properties thus had to be validated by hand at great expense, and they need to be revalidated whenever the rail network infrastructure changes. In this paper we show how we were able to use ProB to validate all of the about 300 properties of the San Juan deployment, detecting exactly the same faults automatically in a few minutes that were manually uncovered in about one man-month. We have repeated this task for three ongoing projects at Siemens, notably the ongoing automatisation of the line 1 of the Paris Métro. Here again, about a man month of effort has been replaced by a few minutes of computation. This achievement required the extension of the ProB kernel for large sets as well as an improved constraint propagation algorithm. We also outline some of the effort and features that were required in moving from a tool capable of dealing with medium-sized examples towards a tool able to deal with actual industrial specifications. We also describe the issue of validating ProB, so that it can be integrated into the SIL4 development chain at Siemens.     

Model-based cloud resource management with TOSCA and OCCI

Software and Systems Modeling - With the advent of cloud computing, different cloud providers with heterogeneous cloud services (compute, storage, network, applications, etc.) and their related...     

Wann sind Lieferaufträge profitabel?

The paper aims to optimize the final part of a firm’s value chain with regard to attended last-mile deliveries. It is assumed that to be profitable, e-commerce businesses need to maximize the overall value of fulfilled orders (rather than their number), while also limiting costs of delivery. To do so, it is essential to decide which delivery requests to accept and which time windows to offer to which consumers. This is especially relevant for attended deliveries, as delivery fees usually cannot fully compensate costs of delivery given tight delivery time windows. The literature review shows that existing order acceptance techniques often ignore either the order value or the expected costs of delivery. The paper presents an iterative solution approach: after calculating an approximate transport capacity based on forecasted are accepted or rejected expected delivery requests and a cost-minimizing routing, actual delivery requests aiming to maximize the overall value of orders given the computed transport capacity. With the final set of accepted requests, the routing solution is updated to minimize costs of delivery. The presented solution approach combines well-known methods from revenue management and time-dependent vehicle routing. In a computational study for a German metropolitan area, the potential and the limits of value-based demand fulfillment as well as its sensitivity regarding forecast accuracy and demand composition are investigated.     

Distributed Approximation of Capacitated Dominating Sets

We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph G=(V,E), and a capacity cap(v)∈ℕ for each node v∈V, the CapMDS problem asks for a subset S⊆V of minimal cardinality, such that every network node not in S is covered by at least one neighbor in S, and every node v∈S covers at most cap(v) of its neighbors. We prove that in general graphs and even with uniform capacities, the problem is inherently non-local, i.e., every distributed algorithm achieving a non-trivial approximation ratio must have a time complexity that essentially grows linearly with the network diameter. On the other hand, if for some parameter ε>0, capacities can be violated by a factor of 1+ε, CapMDS becomes much more local. Particularly, based on a novel distributed randomized rounding technique, we present a distributed bi-criteria algorithm that achieves an O(log Δ)-approximation in time O(log ³ n+log (n)/ε), where n and Δ denote the number of nodes and the maximal degree in G, respectively. Finally, we prove that in geometric network graphs typically arising in wireless settings, the uniform problem can be approximated within a constant factor in logarithmic time, whereas the non-uniform problem remains entirely non-local.