Homo- and copolymerizations of 3-(N-carbazolyl)-1-propyne and its homologues by Mo and W catalysts

Summary 3-(N-Carbazolyl)-1-propyne polymerized with MoCl₅- and WCl₆-based catalysts to produce a polymer in high yields. The MoCl₅ and MoCl₅-n-Bu₄Sn catalysts were the most effective (the systems solidified immediately after initiation of polymerization with these catalysts). The product polymer was a yellow solid insoluble in any solvent. Copolymerization of the present monomer with tert-butylacetylene by MoCl₅-n-Bu₄Sn produced a copolymer; it had a high molecular weight (M _w 350,000), completely dissolved in toluene, CHCl₃ etc, and formed a free-standing film by solution casting. -N-Carbazolyl-1-hexyne and-1-octyne produced toluene-insoluble polymers with WCl₆-Ph₄Sn.     

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.     

Efficient Leave-<Emphasis Type="Italic">m</Emphasis>-out Cross-Validation of Support Vector Regression by Generalizing Decremental Algorithm

We propose a computationally efficient method for cross-validation of the Support Vector Regression (SVR) by generalizing the decremental algorithm of SVR. Incremental and decremental algorithm of Support Vector Machines (SVM) ^{2, 8, 9)} efficiently update the trained SVM model when a single data point is added to or removed from the training set. The computational cost of leave-one-out cross-validation can be reduced using the decremental algorithm. However, when we perform leave-m-out cross-validation (m > 1), we have to repeatedly apply the decremental algorithm for each data point. In this paper, we extend the decremental algorithm of SVR^{8, 9)} in such a way that several data points can be removed more efficiently. Experimental results indicate that the proposed approach can reduce the computational cost. In particular, we observed that the number of breakpoints, which is the main computational cost of the involved path-following, were reduced from \({\mathcal O}(m)\) to \({\mathcal O}(\sqrt{m})\).     

Integrable multimode interference distributed Bragg reflector laser all-optical flip-flops

A novel fully integrable all-optical flip-flop has been created using distributed Bragg reflector multimode interference bistable laser diodes. The single metal-organic vapor phase epitaxy regrowth offset quantum well structure active/passive integrated flip-flop lases in single mode at 1554 nm and is compatible with standard fabrication methods of InP photonic integrated circuits (PICs). All-optical reset switching through cross-gain saturation was demonstrated over a 52-nm range, at 1522-1574 nm. An optical set has been achieved with -3 dBm and optical reset with less than -5-dBm external light injection. The flip-flop will be useful for integration in PICs of future photonic systems for self-routing and optical memories or buffers.     

Static Coarse Grain Task Scheduling with Cache Optimization Using OpenMP

Effective use of cache memory is getting more important with increasing gap between the processor speed and memory access speed. Also, use of multigrain parallelism is getting more important to improve effective performance beyond the limitation of loop iteration level parallelism. Considering these factors, this paper proposes a coarse grain task static scheduling scheme considering cache optimization. The proposed scheme schedules coarse grain tasks to threads so that shared data among coarse grain tasks can be passed via cache after task and data decomposition considering cache size at compile time. It is implemented on OSCAR Fortran multigrain parallelizing compiler and evaluated on Sun Ultra80 four-processor SMP workstation using Swim and Tomcatv from the SPEC fp 95. As the results, the proposed scheme gives us 4.56 times speedup for Swim and 2.37 times on 4 processors for Tomcatv respectively against the Sun Forte HPC Ver. 6 update 1 loop parallelizing compiler.     

Work-time optimal k-merge algorithms on the PRAM

For 2⩽k⩽n, the k-merge problem is to merge a collection of ksorted sequences of total length n into a new sorted sequence. The k-merge problem is fundamental as it provides a common generalization of both merging and sorting. The main contribution of this work is to give simple and intuitive work-time optimal algorithms for the k-merge problem on three PRAM models, thus settling the status of the k-merge problem. We first prove that Ω(n log k) work is required to solve the k-merge problem on the PRAM models. We then show that the EREW-PRAM and both the CREW-PRAM and the CRCW require Ω(log n) time and Ω(log log n+log k) time, respectively, provided that the amount of work is bounded by O(n log k). Our first k-merge algorithm runs in Θ(log n) time and performs Θ(n log k) work on the EREW-PRAM. Finally, we design a work-time optimal CREW-PRAM k-merge algorithm that runs in Θ(log log n+log k) time and performs Θ(n log k) work. This latter algorithm is also work-time optimal on the CREW-PRAM model. Our algorithms completely settle the status of the k-merge problem on the three main PRAM models     

Robust comprehension of natural language instructions by a domestic service robot

We present a method through which domestic service robots can comprehend natural language instructions. For each action type, a variety of natural language expressions can be used, for example, the instruction, ‘Go to the kitchen’ can also be expressed as ‘Move to the kitchen.’ We are of the view that natural language instructions are intuitive and, therefore, constitute one of the most user-friendly robot instruction methods. In this paper, we propose a method that enables robots to comprehend instructions spoken by a human user in his/her natural language. The proposed method combines action-type classification, which is based on a support vector machine, and slot extraction, which is based on conditional random fields, both of which are required in order for a robot to execute an action. Further, by considering the co-occurrence relationship between the action type and the slots along with the speech recognition score, the proposed method can avoid degradation of the robot’s comprehension accuracy in noisy environments, where inaccurate speech recognition can be problematic. We conducted experiments using a Japanese instruction data-set collected using a questionnaire-based survey. Experimental results show that the robot’s comprehension accuracy is higher in a noisy environment using our method than when using a baseline method with only a 1-best speech recognition result.     

Analysis of spatial smoothing effect of short‐term fluctuation of global solar radiation based on data including quantization error

Photovoltaic (PV) systems are attracting attention as one of the promising countermeasures against global warming and the environmental issues. However, the generation output from PV systems is generally unstable and unpredictable. Therefore, large penetration of PV systems may cause some serious impacts on power system operation, such as load frequency control, voltage regulation, etc. Estimation of the influences of PV system installation is becoming important, but it requires simultaneous multipoint solar radiation measurements. The Japan Meteorological Business Support Center has provided 1‐minute meteorological data observed in Japan, but its solar radiation data includes quantization errors. This paper proposes a regeneration method for solar radiation data including quantization errors. It also analyzes the spatial smoothing effect of global solar radiation fluctuations. © 2012 Wiley Periodicals, Inc. Electr Eng Jpn, 180(3): 55–63, 2012; Published online in Wiley Online Library ( wileyonlinelibrary.com ). DOI 10.1002/eej.21274