Investigation of the grain coarsening behavior of some Aluminum alloys

Grain coarsening tests were carried out on Al-4.5 pct Cu and Al-4.5 pct Si alloys. The effects of three variables, melt composition, pour temperature, and mold temperature, were determined. It was found that the macrostructure generally coarsened with increased pour and mold temperatures. Coarsening was extreme in the unrefined alloys but was retarded by the active grain refiners like titanium and columbium. The effect of boron was spectacular in suppressing coarsening tendencies. The results of the investigation support the carbide theory of nucleation as opposed to the peritectic theory.     

Chromium distribution between liquid iron and molten basic slags

An equilibrium study was made of the distribution of chromium and oxygen between liquid iron, containing less than 1 pct Cr, and simple slags of the CaO(MgO)-SiO₂-FeO-Cr₂O₃ type in the temperature range 1526° to 1734°C The effects of slag oxidation, temperature, and basicity were observed.     

External sorting on flash storage: reducing cell wearing and increasing efficiency by avoiding intermediate writes

This paper studies the problem of how to conduct external sorting on flash drives while avoiding intermediate writes to the disk. The focus is on sort in portable electronic devices, where relations are only larger than the main memory by a small factor, and on sort as part of distributed processes where relations are frequently partially sorted. In such cases, sort algorithms that refrain from writing intermediate results to the disk have three advantages over algorithms that perform intermediate writes. First, on devices in which read operations are much faster than writes, such methods are efficient and frequently outperform Merge Sort. Secondly, they reduce flash cell degradation caused by writes. Thirdly, they can be used in cases where there is not enough disk space for the intermediate results. Novel sort algorithms that avoid intermediate writes to the disk are presented. An experimental evaluation, on different flash storage devices, shows that in many cases the new algorithms can extend the lifespan of the devices by avoiding unnecessary writes to the disk, while maintaining efficiency, in comparison with Merge Sort.     

Strong Convergence Analysis of Batch Gradient-Based Learning Algorithm for Training Pi-Sigma Network Based on TSK Fuzzy Models

By combining of the benefits of high-order network and TSK (Tagaki-Sugeno-Kang) inference system, Pi-Sigma network is capable to dispose with the nonlinear problems much more effectively, which means it has a compacter construction, and quicker computational speed. The aim of this paper is to present a gradient-based learning method for Pi-Sigma network to train TSK fuzzy inference system. Moreover, some strong convergence results are established based on the weak convergence outcomes, which indicates that the sequence of weighted fuzzy parameters gets to a fixed point. Simulation results show the modified learning algorithm is effective to support the theoretical results.     

Image inpainting algorithm based on TV model and evolutionary algorithm

With the development of modern image processing techniques, the numbers of images increase at a high speed in network. As a new form of visual communication, image is widely used in network transmission. However, the image information would be lost after transmission. In view of this, we are motivated to restore the image to make it complete in an effective and efficient way in order to save the network bandwidth. At present, there are two main methods for digital image restoration, texture-based method and non-textured-based method. In the texture-based method, Criminisi algorithm is a widely used algorithm. However, the inaccurate completion order and the inefficiency in searching matching patches are two main limitations of Criminisi algorithm. To overcome these shortcomings, in this paper, an exemplar image completion based on evolutionary algorithm is proposed. In the non-textured-based method, total variation method is a typical algorithm. An improved total variation algorithm is proposed in this paper. In the improved algorithm, the diffusion coefficients are defined according to the distance and direction between the damaged pixel and its neighborhood pixel. Experimental results show that the proposed algorithms have better general performance in image completion. And these two new algorithms could improve the experience of network surfing and reduce the network communication cost.     

A Model of Green Acceptance and Intentions to Use Bike-Sharing: YouBike Users in Taiwan

With the emphasis on sustainability in transportation, bike-sharing systems are gaining popularity. This paper investigates the attitudes of users of a bike-sharing system with the aim of identifying their priorities, thus allowing local governments to focus their efforts most effectively on enhancing users’ intentions to use such systems. The relationships among green perceived usefulness (the extent to which individuals believe that a bike-sharing system will improve the environmental performance of some part of their life within a specific context), user attitude and perceived ease of use with green intentions, and the mediation effect of user attitude towards bike-sharing are explored. The focus of the study is on how to enhance green intentions via perceived usefulness, perceived ease of use and user attitude of the green technology acceptance model (green TAM) (Davis 1989). The two-step approach of structural equation modeling was applied to analyze the empirical results, which indicated that green perceived usefulness and user attitude have positive influences on the green intentions of 262 users and 262 non-users from ten sampled bike-sharing sites around the central administrative districts of Taipei. However, user attitude has the highest mediation effect on green intentions, and perceived ease of use does not have a significant effect on intentions for either users or non-users. Therefore, governmental institutions can strive to improve the attitudes of bike-sharing users and non-users, their green perceived usefulness, and perceived ease of use to strengthen their intentions to use this mode of sustainable transportation.     

One-step implementation of a Toffoli gate of separated superconducting qubits via quantum Zeno dynamics

Based on the quantum Zeno dynamics, a scheme is presented to implement a Toffoli gate of three separated superconducting qubits (SQs) by one step. Three separated SQs are connected by two resonators. The scheme is insensitive to the resonator decay because the Zeno subspace does not include the state of the resonators being excited. Numerical simulations indicate that the scheme is robust to the fluctuation of the parameters and the Toffoli gate can be implemented with high fidelity.     

Minimal output unstable configurations in chemical reaction networks and deciders

We study the set of output stable configurations of chemical reaction deciders (CRDs). It turns out that CRDs with only bimolecular reactions (which are almost equivalent to population protocols) have a special structure that allows for an algorithm to efficiently compute their finite set of minimal output unstable configurations. As a consequence, a relatively large set of configurations may be efficiently checked for output stability. We also provide a number of observations regarding the semilinearity result of Angluin et al. (Distrib Comput 20(4):279–304, 2007) from the context of population protocols (which is a central result for output stable CRDs). In particular, we observe that the computation-friendly class of totally stable CRDs has equal expressive power as the larger class of output stable CRDs.