http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Remarks on Four-Dimensional Probabilistic Finite Automata
Makoto Sakamoto,Yasuo Uchida,Makoto Nagatomo,Tuo Zhang,Hikaru Susaki,Takao Ito,Tsunehiro Yoshinaga,Satoshi Ikeda,Masahiro Yokomichi,Hiroshi Furutani 보안공학연구지원센터 2015 International Journal of Software Engineering and Vol.9 No.6
This paper deals with the study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image processing, computer animation, augmented reality (AR), and so on, it is useful for analyzing computation of four-dimensional information processing (three-dimensional pattern processing with time axis) to explicate the properties of four-dimensional automata. From this point of view, we have investigated many properties of four-dimensional automata and computational complexity. On the other hand, the class of sets accepted by probabilistic machines have been studied extensively. As far as we know, however, there is no results concerned with four-dimensional probabilistic machines. In this paper, we introduce four-dimensional probabilistic finite automata, and investigate some accepting powers of them.
Remarks on Four-Dimensional Probabilistic Finite Automata
Makoto Sakamoto,Yasuo Uchida,Makoto Nagatomo,Tuo Zhang,Hikaru Susaki,Takao Ito,Tsunehiro Yoshinaga,Satoshi Ikeda,Masahiro Yokomichi,Hiroshi Furutani 보안공학연구지원센터 2015 International Journal of Software Engineering and Vol.9 No.4
This paper deals with the study of four-dimensional automata. Recently, due to the advances in many application areas such as dynamic image processing, computer animation, augmented reality (AR), and so on, it is useful for analyzing computation of four-dimensional information processing (three-dimensional pattern processing with time axis) to explicate the properties of four-dimensional automata. From this point of view, we have investigated many properties of four-dimensional automata and computational complexity. On the other hand, the class of sets accepted by probabilistic machines have been studied extensively. As far as we know, however, there is no results concerned with four-dimensional probabilistic machines. In this paper, we introduce four-dimensional probabilistic finite automata, and investigate some accepting powers of them.
Possible Translocation of Periodontal Pathogens into the Lymph Nodes Draining the Oral Cavity
G. Amodini Rajakaruna,Makoto Umeda,Keisuke Uchida,Asuka Furukawa,Bae Yuan,Yoshimi Suzuki,Ebe Noriko,Yuichi Izumi,Yoshinobu Eishi 한국미생물학회 2012 The journal of microbiology Vol.50 No.5
Numerous publications have reported the presence of periodontopathogenic bacteria in peripheral and central vascular lesions. However, it is unclear how this bacterial translocation occurs. The objective of this study was to investigate whether periodontopathic bacteria are translocated to lymph nodes proximal to the oral cavity. Obtaining lymph node samples is not ethically feasible unless they are excised as part of the surgical management of patients with cancer. This study analyzed formalin-fixed and paraffin-embedded lymph nodes, histologically negative for cancer cell invasion, that were excised from 66 patients with histories of head and neck cancer. Real-time PCR was performed to amplify the 16S ribosomal DNA fragments from Porphyromonas gingivalis,Treponema denticola, Aggregatibacter actinomycetemcomitans,Tannerella forsythia, and Prevotella intermedia. The relationship between bacterial detection and cancer severity,gender, and the use of anti-cancer therapy was examined by Fisher’s exact test. P. gingivalis, T. forsythia, and P. intermedia were present in 17%, 8%, and 8% of the samples of submandibular and submental lymph nodes, respectively. There were no significant relationships between bacterial detection and the cancer disease status, patient gender or use of anticancer therapy. According to these data, it appears that the translocation of periodontopathic bacteria may occur via lymphatic drainage, irrespective of the cancer disease status, gender or anticancer therapy.
Real-time Railway Network Simulation and Alleviating Congestion of Crowded Trains
Akiyasu Tomoeda,Mitsuhito Komatsu,Il Yun Yoo,Makoto Uchida,Ryo Takayama,Rui Jiang,Katsuhiro Nishinari 제어로봇시스템학회 2009 제어로봇시스템학회 국제학술대회 논문집 Vol.2009 No.8
In the railway transportation service, on-time operation of trains is important. However, once an accident occurs, on-time operation be comes difficult due to a change of the passenger flow pattern. In this case, it is crucial to estimate the changing pattern. This paper presents a real-time Tokyo Metro Rail way Network simulator “KUTTY”, which can immediately estimate the change of the passenger flow pattern even if an accident occurs at the busiest area. Moreover, we have presented are scheduling method of homogenization to all eviate congestion of crowded train. It is found that our method is more efficient than the conventional one.