Ota-ku, Japan
Ota-ku, Japan

Kanto Gakuen University is a private university in Ota, Gunma, Japan, established in 1976. The predecessor of the school was founded in 1881. Wikipedia.

SEARCH FILTERS
Time filter
Source Type

Yaku T.,Nihon University | Anzai K.,Kanto Gakuen University | Miyadera Y.,Tokyo Gakugei University | Anada K.,Waseda University | And 2 more authors.
Proceedings of the IEEE International Conference on Industrial Technology | Year: 2016

This paper considers a multiple 3D object. In this paper, each 3D object in a multiple 3D object is dealt as a single rectangular solid dissection (a 3D world), and a multiple 3D object are dealt as a multiple rectangular solid dissection. This paper introduces a 40 degree grid graph called «a 5 times octgrid» for a model of a multiple 3D object dealt as a multiple rectangular solid dissection. This paper also provides projection, translation and rotation algorithms of specified 3D objects in multiple 3D object systems with a 40 degree grid graph model. © 2016 IEEE.


Yaku T.,Nihon University | Anada K.,Waseda University | Anzai K.,Kanto Gakuen University | Koka S.,Nihon University | And 2 more authors.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

Tabular forms are commonly used in software. Those tabular forms are represented as rectangular dissections. In rectangular dissections, ruled line oriented operations such as cell merge, line and column operations are often used. With respect to ruled line oriented operations, 8k-ary grid graphs have been introduced as models of rectangular dissections that provide fast algorithms. This paper surveys octal and hexa-decimal grid graph models of rectangular dissections. First, octal grids, called octgrids, for single layer rectangular dissections and related algorithms are introduced. Next, hexa-decimal grid graphs for multiple layer rectangular dissections, called hexadeci-grids, and related algorithms are introduced. Furthermore, tetraicosa-grid graphs for rectangular solid dissections for CG applications, called tetraicosa-grids and related algorithms are introduced. © 2014 Springer-Verlag Berlin Heidelberg.


Anzai K.,Kanto Gakuen University | Anada K.,Waseda University | Miyadera Y.,Tokyo Gakugei University | Yaku T.,Nihon University | Yokota K.,Nihon University
27th International Conference on Computer Applications in Industry and Engineering, CAINE 2014 | Year: 2014

Takeo Yaku et al proposed octal degree heterogeneous grid graphs, called octgrids[4, 6], that represent heterogeneous rectangular dissections such as spreadsheet. Meanwhile, because octgrid is very complex, it would be difficult to create octgrid application systems if you manipulate the octgrid directly. Therefore, we represent octgrid by an XML notation, and represent the octgrid on an SQL database system by storing each node of octgrid in SQL table. It will be easier to manipulate the octgrid because you can manipulate it by SQL commands. In this paper, we deal with editing for spreadsheet based on octgrids and SQL database system. Copyright ISCA, CAINE 2014.


Yaku T.,Nihon University | Anzai K.,Kanto Gakuen University | Yokota K.,Nihon University | Anada K.,Waseda University | Miyadera Y.,Tokyo Gakugei University
Proceedings - 3rd International Conference on Applied Computing and Information Technology and 2nd International Conference on Computational Science and Intelligence, ACIT-CSI 2015 | Year: 2015

This paper deals with a data structure that models time-continous 4D objects. We propose a 64-degree grid graphs by dimension hightening of tetraicosa-grids. Algorithm used for resolution reduction is also introduced. Fortheremore, 64-degree grid is compared to 16-ary trees with respect to effectiveness and efficiency. © 2015 IEEE.


Sakai H.,Kyoto University | Iwano H.,Kyoto Fission Track Co. | Danhara T.,Kyoto Fission Track Co. | Takigami Y.,Kanto Gakuen University | And 3 more authors.
Island Arc | Year: 2013

In order to decipher the origin and tectonothermal history of the Kuncha nappe, we undertook a geological investigation in the Taplejung window in eastern Nepal, and carried out multichronological analyses of zircon, apatite, and mica of the Kuncha Formation and Taplejung granites. Three granite bodies that intrude into the Kuncha Formation show fission-track (FT) ages of 6.2 to 4.8Ma for zircon and 2.9 to 2.1Ma for apatite, although the granites yielded zircon U-Pb ages of 1852±24Ma and 1877±21Ma, and muscovite 40Ar-39Ar ages of ca 1650Ma. The U-Pb intercept age of detrital zircons from the Kuncha schist is 1888±16Ma, and this age represents a probable depositional age of the lower part of the Kuncha Formation. The FT ages of zircon and apatite from the same schist are found to be 5.4 and 2.5Ma, respectively. No zircon younger than 1.6Ga was identified from any of these samples. It means that the Kuncha nappe has never undergone thermal events after 1.6Ga until the Himalayan orogeny in Miocene. The Kuncha Formation and overlying Kali Gandaki Supergroup as well as the Taplejung granites can be correlated with the Coronation Supergroup and the Hepburn intrusives in the Wopmay orogen, northwest Canada. They are interpreted to be deposits in the basins of continental rift system and subsequent passive-margin settings. All the FT age data of zircon and apatite provide evidence that both the Kuncha nappe and overlying Crystalline nappe seem to have cooled laterally from the nappe front to the north. The FT ages from the front to central part of the nappe in Taplejung suggest that isotherm of 240°C, closure temperature of zircon FT, retreated toward north at about 10mm/y during the middle to late Miocene and Pliocene. © 2013 Wiley Publishing Asia Pty Ltd.


Sakai H.,Kyoto University | Iwano H.,Kyoto Fission Track Co. | Danhara T.,Kyoto Fission Track Co. | Hirata T.,Kyoto University | Takigami Y.,Kanto Gakuen University
Island Arc | Year: 2013

A multichronological study of the weakly metamorphosed Early Miocene fluvial Dumri Formation and the overlying Kuncha and Lesser Himalayan Crystalline nappes has helped to clarify the timing and heat source of the metamorphism, as well as the history of emplacement and cooling of the nappes. U-Pb ages of detrital zircons from the Dumri Formation show peaks at ca 1Ga and 500-600Ma, and fission-track dating indicates a thermal imprint on the formation at 11-10Ma. In the Naudanda Quartzite, overlying the Kuncha Formation, reset fission-track detrital zircon ages are 9.5Ma, but the U-Pb ages are older than 1.7Ga. The differences in the U-Pb ages for detrital zircons from the Dumri and Kuncha Formations indicate that the Kuncha nappe was never exposed at the surface during the Early Miocene when the Dumri Formation was deposited. Two-mica garnet schists of the Main Central Thrust (MCT) zone have fission-track detrital zircon ages of 7.8Ma and 40Ar-39Ar muscovite ages of 19Ma, though the zircons have U-Pb ages older than 600Ma. Our interpretation is that the heat for the Dumri Formation metamorphism came from the overlying nappes. The timing of the thermal imprint on the Dumri Formation indicates that the metamorphic nappe reached its present position before ca 10Ma. The Parajul Khola granite in the frontal zone of the Kuncha nappe yields U-Pb zircon ages of 1.89Ga, and it underwent an Early Miocene thermal event, cooling below 240°C at 14.7Ma and below 100°C at 10.3Ma. These thermochronological data suggest that the frontal part of the Kuncha nappe was exposed at the surface around 15-14Ma and cooled immediately, but inner parts of the nappe were still hot during its emplacement. © 2013 Wiley Publishing Asia Pty Ltd.


Shindo Y.,Nihon University | Anzai K.,Kanto Gakuen University | Anada K.,Waseda University | Koka S.,Nihon University | Yaku T.,Nihon University
Proceedings - 2011 IEEE Symposium on Visual Languages and Human Centric Computing, VL/HCC 2011 | Year: 2011

We deal with a formalization of financial statements. In order to formalize financial statements, we have to specify the spatial order of items, and specify calculation methods. In this paper, we construct a context sensitive graph grammar to specify the order of items of financial statement. Furthermore we also append attribute rules to the context-sensitive graph grammar to specify calculation methods © 2011 IEEE.


Anada K.,Waseda University | Anzai K.,Kanto Gakuen University | Yokota K.,Nihon University | Yaku T.,Nihon University
2016 IEEE/ACIS 15th International Conference on Computer and Information Science, ICIS 2016 - Proceedings | Year: 2016

Heterogeneous rectangular dissections are frequently used in information processing such as multiple paged books in spread sheet languages and multi-layer image data. In previous studies, a hexadecimal grid graph model was proposed for multilayer rectangular dissections and certain algorithms were provided. In this paper, we propose a 16-ary list structure to implement their algorithms for the hexadecimal grid graph model. The list structure has limited number of fields in a record, so the computation time is low. Furthermore, it has one record for each node in the given hexadecimal grid, and 48 fields for each record. We also show a data format of the whole structure of the list. © 2016 IEEE.


Anzai K.,Kanto Gakuen University | Yaku T.,Nihon University | Yokota K.,Nihon University
2015 IEEE/ACIS 16th International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2015 - Proceedings | Year: 2015

We deal with a formalization of financial statements which is a type of business documents. In order to formalize financial statements, we have to specify the order and number of items, and specify calculation methods. In this paper, we construct a context-sensitive graph grammar to specify the order of items of financial statement with heterogeneous parts. We also show examples of derivation. © 2015 IEEE.


Indo K.,Kanto Gakuen University
ICAART 2014 - Proceedings of the 6th International Conference on Agents and Artificial Intelligence | Year: 2014

Classical social choice theory provides axiomatic modeling for collective decision making in multi-agent situations as functions of a set of profiles (i.e., tuples of transitive orderings). The celebrated Arrow's impossibility theorem (for unanimity-and-independence-obeying preference aggregation) and the Gibbard- Satterthwaite theorem (for strategy-proof voting procedures) assume the unrestricted domain as well as the transitivity of orderings. This paper presents a distribution map of all Arrow-type aggregation rules without the unrestricted domain axiom for the two-individual three-alternative case in parallel with non-imposed strategy-proof voting procedures by using a Prolog program that systematically removes profiles in the super-Arrovian domains. Copyright © 2014 SCITEPRESS.

Loading Kanto Gakuen University collaborators
Loading Kanto Gakuen University collaborators