Cooperation of categorical and behavioral learning in a practical solution to the abstraction problem

Real robots should be able to adapt autonomously to various environments in order to go on executing their tasks without breaking down. They achieve this by learning how to abstract only useful information from a huge amount of information in the environment while executing their tasks. This paper proposes a new architecture which performs categorical learning and behavioral learning in parallel with task execution. We call the architectureSituation Transition Network System (STNS). In categorical learning, it makes a flexible state representation and modifies it according to the results of behaviors. Behavioral learning is reinforcement learning on the state representation. Simulation results have shown that this architecture is able to learn efficiently and adapt to unexpected changes of the environment autonomously. Atsushi Ueno, Ph.D.: He is a research associate in the Artificial Intelligence Laboratory at the Graduate School of Information Science at the Nara Institute of Science and Technology (NAIST). He received the B.E., the M.E., and the Ph.D. degrees in aeronautics and astronautics from the University of Tokyo in 1991, 1993, and 1997 respectively. His research interest is robot learning and autonomous systems. He is a member of Japan Association for Artificial Intelligence (JSAI). Hideaki Takeda, Ph.D.: He is an associate professor in the Artificial Intelligence Laboratory at the Graduate School of Information Science at the Nara Institute of Science and Technology (NAIST). He received his Ph.D. in precision machinery engineering from the University of Tokyo in 1991. He has conducted research on a theory of intelligent computer-aided design systems, in particular experimental study and logical formalization of engineering design. He is also interested in multiagent architectures and ontologies for knowledge base systems.     

A high‐performance sorting algorithm for multicore single‐instruction multiple‐data processors

Many sorting algorithms have been studied in the past, but there are only a few algorithms that can effectively exploit both single‐instruction multiple‐data (SIMD) instructions and thread‐level parallelism. In this paper, we propose a new high‐performance sorting algorithm, called aligned‐access sort (AA‐sort), that exploits both the SIMD instructions and thread‐level parallelism available on today's multicore processors. Our algorithm consists of two phases, an in‐core sorting phase and an out‐of‐core merging phase. The in‐core sorting phase uses our new sorting algorithm that extends combsort to exploit SIMD instructions. The out‐of‐core algorithm is based on mergesort with our novel vectorized merging algorithm. Both phases can take advantage of SIMD instructions. The key to high performance is eliminating unaligned memory accesses that would reduce the effectiveness of SIMD instructions in both phases. We implemented and evaluated the AA‐sort on PowerPC 970MP and Cell Broadband Engine platforms. In summary, a sequential version of the AA‐sort using SIMD instructions outperformed IBM's optimized sequential sorting library by 1.8 times and bitonic mergesort using SIMD instructions by 3.3 times on PowerPC 970MP when sorting 32 million random 32‐bit integers. Also, a parallel version of AA‐sort demonstrated better scalability with increasing numbers of cores than a parallel version of bitonic mergesort on both platforms. Copyright © 2011 John Wiley & Sons, Ltd.     

Quantum Monte Carlo Device Simulation of Nano-Scaled SOI-MOSFETs

Quantum transport properties of nano-scaled SOI-MOSFETs are investigated based on a quantum Monte Carlo (MC) device simulation. The quantum mechanical effects are incorporated in terms of a quantum correction of potential in the well-developed particle MC computational techniques. The ellipsoidal multi-valleys of silicon conduction band are also considered in the simulation. First, the validity of the quantum MC technique is verified by comparing the simulated results with a self-consistent Schrödinger-Poisson solution at thermal equilibrium. Then, we apply the technique to non-equilibrium and quasi-ballistic quantum transport in nano-scaled SOI-MOSFETs.     

二氧化钛纳米粒子的低温合成及可见光催化性能

介绍一种低温合成二氧化钛纳米粒子的新方法.将非晶型二氧化钛加入强酸性溶液中室温搅拌数小时后得到无色透明的溶液.继续在室温搅拌数48h后,可以得到高比表面的金红石相二氧化钛纳米粒子.改变处理过程温度及酸的种类,可以得到不同组成的纤维状二氧化钛纳米粒子.对盐酸体系进行详细讨论结果表明,在低于60℃时得到的是热力学稳定的金红石单一相,而在高于120℃时得到的是热力学亚稳态的锐钛矿单一相,高于170℃时得到的是锐钛矿及金红石的混合相,显示出与众不同的结晶行为.通过此低温法制备的金红石相二氧化钛在具有较小的吸收禁带的同时,还拥有100n2·g-1以上的比表面积.与锐钛矿相相比,显示了良好的可见光催化活性.     

Objective Oriented Multistage Ring Shear Test for Shear Strength of Landslide Soil

Ring shear tests were conducted on five samples of different nature with a modified Imperial College type ring shear machine. The three different testing methods used, (1) individual sample testing for each normal stress, (2) increasing load multistage ring shear test, and (3) reducing load multistage ring shear test, all showed similar effective residual internal friction angle for the samples, irrespective of testing method. However, effective residual shear intercept was different according to the testing methodology. The internal friction angle did not vary, particularly after the first minimum point in the stress displacement curve, although the residual shear intercept decreased with increase in the displacement. The thickness of the shearing zone increased along with the displacement. The remolded peak shear strength for saturated conditions at field dry density varied with the consolidation history. Measurement of remolded peak shear strength was possible in a single sample using the increasing load multistage ring shear test at normal consolidation. The equilibrium water content of the sample after the ring shear test was nearly equal to the plastic limit.     

Semantic Web: A road to the knowledge infrastructure on the internet

In this article, I describe the basic technologies for Semantic Web and relationship between Semantic Web and Knowledge Representation in Artificial Intelligence. Semantic Web is planned as an extension of the current web in order to help cooperation between computers and humans, i.e., computers and humans are expected to understand each other in the knowledge level. I first describe the vision of the Semantic Web, then introduce the current Semantic Web technologies, i.e., RDF, RDFS, and OWL. I describe relationship between the trend of Semantic Web and Knowledge Representation, and clarify challenges and difficulties of Semantic Web from the point of view of Knowledge Representation. Hideaki Takeda: He is a professor at National Institute of Informatics (NII) and a professor in Department of Informatics at the Graduate University of Advanced Studies (Sokendai). He received his Ph.D. from the University of Tokyo in 1991. His research interest in computer science includes ontology engineering, community informatics and knowledge sharing systems.     

Partial redundancy elimination for access expressions by speculative code motion

We present a new memory access optimization for Java to perform aggressive code motion for speculatively optimizing memory accesses by applying partial redundancy elimination (PRE) techniques. First, to reduce as many barriers as possible and to enhance code motion, we perform alias analysis to identify all the regions in which each object reference is not aliased. Secondly, we find all the possible barriers. Finally, we perform code motions in three steps. For the first step, we apply a non‐speculative PRE algorithm to move load instructions and their following instructions in the backwards direction of the control flow graph. For the second step, we apply a speculative PRE algorithm to move some of them aggressively before the conditional branches. For the third step, we apply our modified version of a non‐speculative PRE algorithm to move store instructions in the forward direction of the control flow graph and to even move some of them after the merge points. We implemented our new algorithm in our production‐level Java just‐in‐time compiler. Our experimental results show that our speculative algorithm improves the average (maximum) performance by 13.1% (90.7%) for jBYTEmark and 1.4% (4.4%) for SPECjvm98 over the fastest algorithm previously described, while it increases the average (maximum) compilation time by 0.9% (2.9%) for both benchmark suites. Copyright © 2004 John Wiley & Sons, Ltd.     

基于实际运行数据的不同气候区冬季空气源热泵结霜特征分析

空气源热泵运行中存在的突出问题是室外机结霜而导致的机组性能下降。在实际应用中,当地气候条件下空气源热泵结霜的难易程度决定了大多数除霜技术的适用性。空气源热泵结霜的难易程度除了受气候影响外,还受系统运行性能甚至用户使用习惯的影响,难以做出定量的判断。因此本文提出结霜度时数的概念,以专门表征气候条件对结霜的影响。通过在国内多地采集空气源热泵实际运行数据,使得结霜度时数的计算更接近实际情况,再对运行数据进行拟合分析得到了不同功率类型的热泵系统的蒸发温度与室外干球温度之间的特征温差,此温差可以用来修正传统设计上所假设的某个定值。最后,根据不同特征温差下的结霜度时数分析,结合不同功率类型的热泵系统在国内275个城市的结霜特征,对这些城市进行了结霜气候分区,为空气源热泵系统进行气候适应性的设计以及控制策略开发提供参考。     

Self-assembly of three dimensional micro mechanisms using thermal shrinkage of polyimide

This paper describes three-dimensional microstructures fabricated using a simple self-assembly process involving the thermal shrinkage of polyimide. The proposed method enables hinged structures to be automatically rotated out of the wafer plane and to remain bent without the need to use any interlocking mechanisms. The hinged structures were fabricated using surface micromachining techniques involving heating in a furnace. An increase in the bending angle due to the shrinkage of polyimide was observed with increasing heating temperature, heating time, and length of the polyimide hinge. Of these three parameters, the heating time was found to be the most suitable for precise control of the bending angle. Furthermore, microcubes were fabricated by this method and the self-assembly process was successfully visualized using a CCD camera.