An Advanced Oscillation Mixing Method for Improving the Cooling Uniformity in Quenching

In quenching, the cooling uniformity is most important to diminish distortion occurring on work pieces. As a trial to accomplish uniform cooling, therefore, there exist various mixing methods of a quenchant and the quenchant circulation with an external pump has so far been the well accepted mixing method. However, this study proposes an advanced oscillation mixing method that can improve more the cooling uniformity in quenching. The proposed method includes a stirrer in oscillating motion, so that the simultaneous oscillating and mixing movements of the stirrer are considered to provide efecfively the uniform cooling characteristics for the quenchant. In comparison with the case of the circulation pump mixing, the investigation using the oscillation mixing method has demonstrated the following two experimental facts:(1) the short vapor blanket stage caused by the quick breakage of the oil vapor blanket and (2) the reduced variation of the quenching distortion.     

Chain-reaction solution update in MOEA/D and its effects on multi- and many-objective optimization

MOEA/D is one of the promising evolutionary algorithms for multi- and many-objective optimization. To improve the search performance of MOEA/D, this work focuses on the solution update method in the conventional MOEA/D and proposes its alternative, the chain-reaction solution update. The proposed method is designed to maintain and improve the variable (genetic) diversity in the population by avoiding duplication of solutions in the population. In addition, the proposed method determines the order of existing solutions to be updated depending on the location of each offspring in the objective space. Furthermore, when an existing solution in the population is replaced by a new offspring, the proposed method tries to reutilize the existing solution for other search directions by recursively performing the proposed chain-reaction update procedure. This work uses discrete knapsack and continuous WFG4 problems with 2–8 objectives. Experimental results using knapsack problems show the proposed chain-reaction update contributes to improving the search performance of MOEA/D by enhancing the diversity of solutions in the objective space. In addition, experimental results using WFG4 problems show that the search performance of MOEA/D can be further improved using the proposed method.     

SleepExplorer: a visualization tool to make sense of correlations between personal sleep data and contextual factors

Getting enough quality sleep is a key part of a healthy lifestyle. Many people are tracking their sleep through mobile and wearable technology, together with contextual information that may influence sleep quality, like exercise, diet, and stress. However, there is limited support to help people make sense of this wealth of data, i.e., to explore the relationship between sleep data and contextual data. We strive to bridge this gap between sleep-tracking and sense-making through the design of SleepExplorer, a web-based tool that helps individuals understand sleep quality through multi-dimensional sleep structure and explore correlations between sleep data and contextual information. Based on a two-week field study with 12 participants, this paper offers a rich understanding on how technology can support sense-making on personal sleep data: SleepExplorer organizes a flux of sleep data into sleep structure, guides sleep-tracking activities, highlights connections between sleep and contributing factors, and supports individuals in taking actions. We discuss challenges and opportunities to inform the work of researchers and designers creating data-driven health and well-being applications.     

Variable space diversity, crossover and mutation in MOEA solving many-objective knapsack problems

In this work, we analyze variable space diversity of Pareto optimal solutions (POS) and study the effectiveness of crossover and mutation operators in evolutionary many-objective optimization. First we examine the diversity of variables in the true POS on many-objective 0/1 knapsack problems with up to 20 items (bits), showing that variables in POS become noticeably diverse as we increase the number of objectives. We also verify the effectiveness of conventional two-point and uniform crossovers, Local Recombination that selects mating parents based on proximity in objective space, and two-point and uniform crossover operators which Controls the maximum number of Crossed Genes (CCG). We use NSGA-II, SPEA2, IBEA _??+? and MSOPS, which adopt different selection methods, and many-objective 0/1 knapsack problems with $n=\{100,250,500,750,\mbox{1,000}\}$ items (bits) and m?=?{2,4,6,8,10} objectives to verify the search performance of each crossover operator. Simulation results reveal that Local Recombination and CCG operators significantly improve search performance especially for NSGA-II and MSOPS, which have high diversity of genes in the population. Also, results show that CCG operators achieve higher search performance than Local Recombination for m?≥?4 objectives and that their effectiveness becomes larger as the number of objectives m increases. In addition, the contribution of CCG and mutation operators for the solutions search is analyzed and discussed.     

Market prediction using machine learning based on social media specific features

Artificial Life and Robotics - In recent years, unspecified messages posted on social media have significantly affected the price fluctuations of online-traded products, such as stocks and virtual...     

Chemical modification of group IV graphene analogs

Mono-elemental two-dimensional (2D) crystals (graphene, silicene, germanene, stanene, and so on), termed 2D-Xenes, have been brought to the forefront of scientific research. The stability and electronic properties of 2D-Xenes are main challenges in developing practical devices. Therefore, in this review, we focus on 2D free-standing group-IV graphene analogs (graphene quantum dots, silicane, and germanane) and the functionalization of these sheets with organic moieties, which could be handled under ambient conditions. We highlight the present results and future opportunities, functions and applications, and novel device concepts.     

Use of solid-electrolyte Galvanic cells to determine the activity of CaO in the CaO-ZrO2 system and the standard Gibbs free energies of formation of CaZrO3 from CaO and ZrO2

The activity of CaO in the CaO-ZrO₂ system has been measured at 1572 to 1877 K with a Galvanic cell composed of 4CaO ? P₂O₅ as the solid electrolyte. The activity ZrO₂ was calculated from the activity of CaO by integrating the Gibbs-Duhem relation. From the activities of CaO and ZrO₂, the standard Gibbs free energy of formation of CaO ? ZrO₂ was determined as follows: ΔG _f ⁰ /J mol^?1 = -25,200 (±150) - 17.58 (±0.085)T (1633 to 1873 K)     

A Hilbert warping method for handwriting gesture recognition

We propose a novel sequence alignment algorithm for recognizing handwriting gestures by a camera. In the proposed method, an input image sequence is aligned to the reference sequences by phase-synchronization of analytic signals which are transformed from original feature values. A cumulative distance is calculated simultaneously with the alignment process, and then used for the classification. A major benefit of this method is that over-fitting to sequences of incorrect categories is restricted. The proposed method exhibited higher recognition accuracy in handwriting gesture recognition, compared with the conventional dynamic time warping method which explores optimal alignment results for all categories.     

Virtual segment: Store–carry–forward relay-based support for wide-area non-real-time data exchange

We have proposed the concept of the virtual segment (VS), in which a global communication service is provided by combining a store–carry–forward scheme using vehicles with broadband wireless/wired network infrastructures along roads connected to the Internet. The VS can be a practical framework for non-real-time, asynchronous message transfer (especially for large messages) in a cost-effective manner. In this study, a critical implementation design issue, the message forward scheduling, in the VS approach is discussed and investigated through computer simulation by our developed VS simulator that has reflected the results of the field experiment for realistic performance evaluation.