Shusuke Okamoto

本研究で使用している対話型アニメーションは、JavaScriptで書かれており、対話処理とアニメーションの描画処理を逐次的に処理していた。そのため、アニメーション内にあるキャラクタの数が増加すると、アニメーションの描画間隔が間延びする問題があった。そこで、本研究ではJavaScriptの機能の1つである、Web Workersを使用し、この対話型アニメーションの並列化を行う。そのとき、対話処理とアニメーションの描画処理の分割に注目した。本発表では、その並列化のアプローチと評価について報告する。

近年、多くの文書をPDF ファイルとしてインターネット上から取得することが容易となった。そこで、本研究ではその膨大な量の文書ファイルを自動的に分類する、ドキュメント分類アルゴリズムを提案する。そのアルゴリズムは各文書から複数の単語を抽出し、単語間の類似度をweb 検索エンジンによるAND 検索のヒット数を基準にして計算する。そして、求めた各単語間の類似度をクラスタ分析手法の一つであるK-平均法に適用させることで、文書ファイルの分類を行う。本発表では提案したアルゴリズムの詳細と、その精度を評価するために行った実験とその結果について報告する。

In this paper, we propose a system for a robot simulation environment with augmented reality. This system puts a virtual robot on a real space virtually and allows to make an interaction between the robot and its surroundings, such as lights, sounds, and real objects. Therefore, the user can simulate robot behavior using real space without any risks and costs for using real robot. We have implemented a case of robot simulation using this system and conducted experiments for checking proper operations. From the results, we have confirmed that the interaction between the virtual robot and real objects can be made in real-time.

近年、ソーシャルネットワーキングサービス (SNS) の中でも、Twitter は特に注目を集めている。我々は、Twitter のリアルタイム性の高さに着目し、Twitter に投稿されたメッセージの中から、文化祭を楽しむ上で有効な情報のみを抽出し、ユーザに提供するサーバを構築した。2010年度秋に行われた文化祭においてつぶやきを抽出して、出店、イベント内容で分類し、人気の単語と統計情報などを提供した。本発表ではこの結果を受けて、リアルタイム情報の収集と文化祭に有効な情報の提供において Twitter を使用することの有効性を考察する。

We evaluate a robot control programming environment in an elementary school. The programming in our environment is a visual programming which is written in terms of a state transition diagram. A diagram allows a user to describe a robotic behavior intuitively. Our programming environment is for two kinds of programmers. The first is a programmer who designs the robot and defines the actions and events to construct the diagram. The second kind of programmer writes a final robot control program. We tested our environment at the PC club in an elementary school. The students addressed the challenge of the robot control as a latter programmer. In this presentation, we evaluate our environment as well as the content of the challenge and its result.

We have been studying a robot programming environment in which users can describe a robot control program intuitively. The program is written in terms of state transition diagram. This environment allows for definition of higher-level macro actions in terms of state diagrams. By referring to a macro action as a state in a higher-level diagram, we can express complicated control procedures by hierarchical and rather simple diagrams. The target machine is the mindstorms NXT Robot developed by the LEGO group of companies. In our example, the robot distinguishes balls by color and sorts them in line. This presentation shows the state transition diagram for the example task as well as the Java program converted from the diagram. It also describes our consideration whether it is easier for users to describe a complicated robot control program.

This paper describes a programming tool for authoring Web-based multiuser RPG. The design goal is to make this tool simple and powerful. Prospected users include programming novices and schoolchildren. The tool is comprised of a GUI editor and a code generator. The GUI editor is used to write state-transition diagrams, each of which defines the behavior of the character in RPG. The generator generates a set of codes written in C, PHP, JavaScript and HTML from the diagrams. The output RPG system can be viewed by the usual Web browser, such as Firefox, Safari and IE. On click or key input by a game user, the web browser sends it to the web server to reflect its consequence on the screens which other users are looking at. The state-transition diagram doesn't depend on a specific programming language. Its structure is not only suitable for the definition of a character behavior but also intuitive to help novices understand. Therefore, the tool user can easily make multiuer RPG on the Web-based system.

The demand of the tool to make simple animation for the Web page and presentation exists since before, and various tools have been proposed. However, the easiness of expectation of the quality of generated animation was not discussed enough. We developed a new method of creating animation. Our method is designed for ease of use and allows user to expect animation generated. We call this proposing tool Schematic morPHINg expression (SPHINX). SPHINX dynamically places meshes on r-θ coordinate system. And do not need user to consider about how to place meshes.

Animations provide an efficient means for presenting information as practiced on modern Web pages. Interactive animations are especially attractive, because these can show variable scenarios according to key and mouse inputs by viewers. Author of an interactive animation is required of two different abilities. 0ne is the artistic imagination as ahy artistic work requires. The other is highly advanced knowledge and skill in programming and graphics. The latter requirement is a strong barrier for potential authors who have good imagination and no programming skills. In this paper, design and implementation of a tool for authoring interactive animations are reported. To make it intuitively comprehensible for non-programmers, the modern paradigm of object-oriented modeling and the classical state-transition diagram are employed. An animation is constructed as a collection of characters. Behavior of each character is specified by a state-transition diagram and pictures to express its appearance. The tool consists of GUI editors for diagrams and pictures, a built-in interpreter to test the animation, and a translator into target codes including Java and JavaScript. The translation mechanism keeps the coherency between diagrams and target codes, by utilizing inner classes in Java and function pointers in JavaScript. As a side effect, the present tool works also as an educational material for enlightening children on computer science. They may learn how to define dynamical objects while having fun with animations.

This paper describes a new moving home method for home-based software Distributed Shared Memory systems and its evaluations. In our system, a home node uses records for access to the shared page to determine the moving its role of home. Each time a home node receives a service request for the shared page from a non-home node, it records the node ID and the type of access. If the number of the access records exceeds the threshold of request counts, the home node decides whether the non-home node which sends the request is suitable for a new home node of the page. To evaluate our moving method, we have implemented a, prototype of DSM system from scratch. The result of our performance evaluation, using SPLASH2 benchmark programs shows that our method improved the performance of the system by 2.25 times over the fixed home node method.

Instructions for fetching instruction is the replacement of conventional branch instructions, which we have recently introduced. An instruction of this type gives information of next basic block to be fetched. It is recognized by processor without decoding, and is processed in parallel with the other types of instructions. It is also used as the special instruction to prefech instructions. This report shows that the processor using instructions of this type can reduce the instruction miss penalty by prefetching.

キューマシン計算モデルは、式の木構造を幅優先に探索することで命令列を作り、式の中間結果をFIFOのキューに格納する計算モデルである。これまでにこの計算モデルの特徴を利用したスーパスカラプロセッサのモデル設計がなされてきた。本報告ではプログラム中の繰り返し操作・手続き呼び出しなどにおいて、データ順序の入れ替えやインデックス計算などを行う際に有用なデータ退避用のキューを導入した。まずキューマシン計算モデルに基づいたスーパスカラプロセッサの動作原理について説明し、続いてデータ退避用のキューについて言及し、PLD化を目指した設計・シミュレーションの結果について述べる。

This paper describes a program controlled instruction fetching mechanism, which is called the Fetch Instruction Method. In this mechanism, the special instruction to control instruction fetching are inserted into programs. They are processed in parallel with the other types of instructions. The results of performance evaluations show that many of branches are processed in parallel, and the performance is more improved by only increasing the number of fetched instructions per clock cycle.

The 64-bit architectures can provide huge address space to operating systems and application programs. Then, some opearting systems appeared that support the single virtual address space model. In this model, data sharing between processes is simplified because all processes share the single virtual address space. On the other hand, additional access control mechanism is required to make protection domains and avoid non-authorized data refernces. We applied originally extended key/lock scheme to access control mechanism in a single virtual address space model operating system.

The queue machine model of execution is an evaluation scheme for expression trees, in which input operands of operations are taken from head of queue, and its result is put onto tail of queue. The previous study with this model is the automatic parallel execution of functional programming languages. In this paper, we describe a design of superscalar processor. Our processor adopts this model to calculate expressions, and it adopts usual software stack for procedure calls. We also describe a possibility of fast threads switch on our processor.

To reduce the cache miss penalty, which becomes heavy bottleneck for processors, we have proposed new hierarchical memory system, we call this UPCHMS. UPCHMS enables memory latency to be reduced more than cache memory system. The reason why UPCHMS can do this shows follow. In UPCHMS, data transfer program controls the data on the HM, which corresoponds to cache memory and has no tag memory but has its own linear address. It is possible for program-control to use the data on HM more efficiently. In this paper, we describe the principle and hardware organization of pipelined UPCHMS. And then, we evaluate the pipelined UPCHMS. It is reported that the pipelined UPCHMS can execute benchmark program 2 times faster than a computer with conventional cache.