http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Soft Modes in SrTi18O3 Studied by Light Scattering and Dielectric Measurements
Yohei Nakata,Mika Kobayashi,Mitsuru Itoh,Ruiping Wang,Toshirou Yagi,Yuhji Tsujimi 한국물리학회 2005 THE JOURNAL OF THE KOREAN PHYSICAL SOCIETY Vol.46 No.1
Light-scattering and dielectric easurements have been carried out, mainly in SrTi18O3, to clarify the physical origin of the two modes (Eu1 and Eu2) which were supposed to originate from a doubly degenerated ferroelectric Eu soft mode. The combined results of both measurements strongly suggest that the Eu1 and Eu2 modes correspond to the polarization uctuation parallel to the spontaneous polarization Ps (the mode of A1 symmetry) and to that perpendicular to Ps (the mode of B2 symmetry), respectively.
A Method of Handwritten Character Recognition by Feature Graphs
Shuichi Nishida,Mitsuru Nakata,Qi-Wei Ge,Makoto Yoshimura 대한전자공학회 2009 ITC-CSCC :International Technical Conference on Ci Vol.2009 No.7
In this paper, we propose a method of handwritten character recognition by using graph (called future graph) that expresses the structure of a handwritten character. Our method is composed of two stages: “Generating feature graph” and “Calculation of character fitness”. However, our previous generating method of feature graph has some problems: 1) vertices representing a curve (called curve vertex) are generated more than necessary; 2) 4-degree vertex representing an intersection is divided into a pair of 3-degree vertices. These problems lower the precision of our character recognition. Therefore, we firstly improve our previous method by modifying conditions for processing inflection point and adding the second-clustering. And then we show our character recognition method by using the new generated feature graphs.
A Problem and Its Solution for Multi-Car Elevator Group Control
Yuki Kuroda,Mitsuru Nakata,Shingo Yamaguchi 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
Multi-car elevator (MCE for short) systems have been receiving increasing attention these days. An MCE has two or more cars in one shaft. It is difficult to control MCEs by using algorithms developed for single-car elevator systems, because MCEs need to avoid collision of the cars of the same shaft. In this paper, we propose an algorithm to control MCE systems, and show the effectiveness of our algorithm through computer simulation.
Similar Subgraph Retrieving for Japanese Historical Document Search System
Hiroaki Nagaoka,Mitsuru Nakata,Qi-Wei Ge,Makoto Yoshimura 대한전자공학회 2015 ITC-CSCC :International Technical Conference on Ci Vol.2015 No.6
In this paper, we propose a retrieval method of similar subgraphs in order to obtain similar partial images used in Japanese historical documents image retrieval system. In our system, the structure of characters is represented by a feature graph, and the structure of a string of each line of Japanese historical documents is stored as a feature graph which is called “document graph”. The structure of a string to be searched is specified as a feature graph that is called “search graph”. A search graph contains an “essential graph”, which shows an indispensable structure included in search results. The processes to search similar partial images are as follows: (1) get subgraphs of document graphs that are isomorphic to the essential graph, and construct candidates of search result from these subgraphs; (2) remove improper candidates based on some conditions; (3) calculate the similarities between remaining candidates and the search graph (these remaining candidates are called “similar subgraph”); (4) clip the partial areas as the search results, which correspond to similar subgraphs with high similarity from Japanese historical document images.
Masaki Hayashi,Shuichi Nishida,Mitsuru Nakata,Qi-Wei Ge,Makoto Yoshimura 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
In this paper, we propose a method of generating feature graphs for recognition of handwritten characters in Japanese historical documents. The feature graph represents structure of a handwritten character. In our method, the feature graph is generated as follows: (1) a rough graph is generated by thinning, clustering and other processes; (2) connections between vertices are retrieved with edge trace; (3) the curve vertices, which express curved strokes of a character, are added into the graph; (4) relative locations between vertices are calculated.
A Model of Multiprocessor System with Communication Delays and Its Scheduling Method
Takashi Otsuka,Hironori Youhata,Qi-Wei Ge,Mitsuru Nakata,Yuu Moriyama,Hirotoshi Tonou 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
This paper aims at developing a scheduling method for multiprocessor systems with communication time. In this paper, we firstly propose a model of multiprocessor system with communication time occurring in reading data. Then, for the proposed model, we propose a scheduling method (called AMCN scheduling method) that (ⅰ) divides a task graph to subgraphs so that a task (called node hereafter) and its successors and predecessors are as much as possible included in the same subgraph to shorten communication time; and (ⅱ) uses a fixed processor to execute all the nodes of a subgraph. Finally, we do computational simulation experiments to evaluate our scheduling method.
Ryo Yamaguchi,Qi-Wei Ge,Mitsuru Nakata 대한전자공학회 2008 ITC-CSCC :International Technical Conference on Ci Vol.2008 No.7
This paper aims at automatically generating Petri nets that are used as key generator of a public-key cryptography MEPKC. MEPKC is different from general public-key cryptography, which opens a key-generator to the public and uses the elementary T-invariants as the encryption keys to repeatedly encrypt a plain text stage by stage, and so that the its security can be as strong as expected. The Petri net used as a key generator must include a lot of elementary T-invariants, and the creator of the Petri net must be able to grasp all the elementary T-invariants. In this paper, we propose a method of generating Petri nets whose complexity is enough to be a key generator and obtaining all its the elementary T-invariants.