Updated on 2024/02/01

写真a

 
TAMURA Hiroshi
 
Organization
Faculty of Science and Engineering Professor
Other responsible organization
Electrical, Electronic, and Communication Engineering Course of Graduate School of Science and Engineering, Master's Program
Electrical Engineering and Information Systems Course of Graduate School of Science and Engineering, Doctoral Program
Contact information
The inquiry by e-mail is 《here
External link

Degree

  • 学術博士 ( 新潟大学 )

  • 理学修士 ( 新潟大学 )

Education

  • 1990.3
     

    Niigata University   Graduate School, Division of National Science and Technology   doctor course   completed

  • 1986.3
     

    Niigata University   Graduate School, Division of Natural Science   master course   completed

  • 1984.3
     

    Niigata University   Faculty of Education   others

  • 1982.3
     

    Niigata University   Faculty of Education   graduated

  • 1978.3
     

    埼玉県立秩父高等学校   graduated

Research History

  • 2012.4 - Now

    中央大学理工学部教授

  • 2012.4 - 2022

    新潟大学大学院自然科学研究科非常勤講師

  • 2002.4 - 2012.3

    新潟大学工学部非常勤講師

  • 1999.4 - 2012.3

    新潟工科大学工学部教授

  • 2001.3 - 2001.12

    イリノイ大学シカゴ校客員研究員

  • 1991.10 - 2001.3

    新潟大学工学部非常勤講師

  • 1990.4 - 2001.3

    新潟工業短期大学自動車工業科非常勤講師

  • 1995.4 - 1999.3

    新潟工科大学工学部助教授

  • 1994.10 - 1995.3

    財団法人新潟工科大学設立準備財団職員

  • 1991.7 - 1994.9

    新潟大学地域共同研究センター助教授

  • 1990.4 - 1991.6

    新潟大学大学院自然科学研究科助手

▼display all

Professional Memberships

  • 日本数学会

  • 情報処理学会

  • 日本シミュレーション学会

  • IEEE

  • The Institute of Electronics, Information and Communication Engineers (IEICE)

Research Interests

  • Multihop wireless network graph theory

Research Areas

  • Manufacturing Technology (Mechanical Engineering, Electrical and Electronic Engineering, Chemical Engineering) / Communication and network engineering  / 通信・ネットワーク工学

Papers

  • Evaluation of Virtual Accumulation and Reaccumulation by Information Floating in a Crossroad Network Reviewed

    Keisuke Nakano, Yuhei Nemoto, Kazuyuki Miyakita, Naoyuki Karasawa, Hiroshi Tamura

    The 42nd JSST Annual Conf.,   33 - 36   2023.8

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • On Graph Coloring and Its Appearance Probability for Wireless Communication Reviewed

    The 42nd JSST Annual Conf.   73 - 75   2023.8

     More details

    Authorship:Lead author, Corresponding author   Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • On Closeness Centrality Functions Reviewed

    78 - 81   2023.8

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • チャネル干渉を考慮したグラフの点彩色とGrundy Coloringについて Reviewed

    田村 裕, 中野 敬介

    電子情報通信学会和文論文誌   106-A ( 7 )   201 - 207   2023.7

     More details

    Authorship:Lead author  

    researchmap

  • Performance Characterization of Virtual Accumulation and Reaccumulation by Information Floating Reviewed

    Miyakita Kazuyuki, Tamura Hiroshi, Nakano Keisuke

    Transaction of the Japan Society for Simulation Technology   14 ( 2 )   104 - 113   2022.10

     More details

    Language:Japanese   Publisher:Japan Society for Simulation Technology  

    Information Floating (IF) is a method of delivering information to mobile nodes in target areas preventing unnecessary transmissions by permitting mobile nodes to transmit data via wireless direct links only in Transmittable Areas (TAs). IF can virtually accumulate data by making mobile nodes transmit multiple different data in the same TAs. In addition, the cooperation of multiple TAs reaccumulates temporarily lost data. In this paper, we first consider reaccumulation with the cooperation of two TAs while assuming that these TAs are points on a road. We classify the system states into two kinds based on how well the reaccumulation works using simulation results and estimate the node density representing the boundary between these two states using approximate theoretical analysis. The numerical and simulation results show that we can estimate node density to realize sufficient reaccumulation. We then show how to extend the TAs based on the above results to achieve sufficient reaccumulation and show that the proposed method is effective.

    DOI: 10.11308/tjsst.14.104

    CiNii Research

    researchmap

  • A Consideration on Mobility Models for Evaluation of Delay Tolerant Networks in Road Networks Reviewed

    Kazuyuki Miyakita, Hiroshi Tamura, Keisuke Nakano

    The 41st JSST Annual Conf.   206 - 209   2022.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • A study on information floating in a one-dimensional street considering effects of shadowing and side trips of pedestrians Reviewed

    Naoyuki Karasawa, Kazuyuki Miyakita, Takuma Kobayashi, Hiroshi Tamura, Keisuke Nakano

    The 41st JSST Annual Conf.   202 - 205   2022.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • Distance Coloring and Grundy Number of Graphs Reviewed

    Hiroshi Tamura, Keisuke Nakano

    The 41st JSST Annual Conf.   210 - 213   2022.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • 歩行者自身が障害物になる影響を考慮した情報フローティングの理論解析 Reviewed

    柄沢 直之, 宮北 和之, 田村 裕, 中野 敬介

    日本シミュレーション学会論文誌   14 ( 1 )   9 - 19   2022.1

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:Japan Society for Simulation Technology  

    If mobile nodes such as vehicles and pedestrians deliver information by direct wireless communication between mobile nodes and movement of mobile nodes carrying information, disordered and unnecessary spread of information arises. To overcome this problem, a method to permit mobile nodes to transmit information only in transmittable areas has been considered. This method is called Information Floating. Theoretical analysis of Information Floating is important because it is necessary for some purposes such as control of the size of a transmittable area, and has been studied in various situations. In this paper, we consider Information Floating by pedestrians walking toward opposite directions along a street, and theoretically analyze performance of Information Floating under the assumption that the communication range changes due to the positional relationship between mobile nodes because the mobile nodes themselves become obstacles. From the numerical results, we show that degree of effects of the assumption that mobile nodes themselves become obstacles on performance of Information Floating depends on the densities of mobile nodes and the difference between the densities of mobile nodes moving toward the opposite directions, and show effectiveness of the proposed theoretical method. Based on these results, we show a method to decide the size of a transmittable area suitable to the situation where mobile nodes themselves become obstacles.

    DOI: 10.11308/tjsst.14.9

    CiNii Research

    researchmap

  • Analysis of information floating at an intersection considering traffic lights

    Kazuyuki Miyakita, Naoyuki Karasawa, Hiroshi Tamura, Keisuke Nakano

    The 40th JSST Annual Conf.   134 - 137   2021.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • Effects of human body shadowing and entering and leaving of mobile nodes on information float- ing in a one-dimensional street Reviewed

    Naoyuki Karasawa, Kazuyuki Miyakita, Hiroshi Tamura, Keisuke Nakano

    The 40th JSST Annual Conf.   138 - 141   2021.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • On the edge Grundy number and the number of vertices in grid graphs Reviewed

    Hiroshi Tamura, Keisuke Nakano

    The 40th JSST Annual Conf.   142 - 145   2021.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • On a Grundy Coloring Divided into Two Steps in Graphs Reviewed

    Hiroshi Tamura, Keisuke Nakano, Masakazu Sengoku

    ITC-CSCC2018   145 - 148   2020.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • Information Floating for Sensor Networking to Provide Available Routes in Disaster Situations Reviewed

    KARASAWA Naoyuki, MIYAKITA Kazuyuki, INAGAWA Yuto, KOBAYASHI Kodai, TAMURA Hiroshi, NAKANO Keisuke

    IEICE Transactions on Communications   103 ( 4 )   321 - 334   2020.4

     More details

    Language:English   Publisher:The Institute of Electronics, Information and Communication Engineers  

    <p>Information floating (IF) permits mobile nodes to transmit information to other nodes by direct wireless communication only in transmittable areas (TAs), thus avoiding unneeded and inefficient information distribution to irrelevant areas, which is a problem with the so-called epidemic communication used in delay tolerant networks. In this paper, we propose applying IF to sensor networking to find and share available routes in disaster situations. In this proposal, IF gathers and shares information without any assistance from gateways, which is normally required for conventional wireless sensor networks. A performance evaluation based on computer simulation results is presented. Furthermore, we demonstrate that the proposed method is effective by highlighting its advantageous properties and directly comparing it with a method based on epidemic communication. Our findings suggest that the proposed method is a promising step toward more effective countermeasures against restricted access in disaster zones.</p>

    DOI: 10.1587/transcom.2019NRP0006

    researchmap

  • On the number of colors in graph coloring and channel assignment in wireless communication Reviewed

    Hiroshi Tamura, Shohei Tomita, Iori Yuhara, Keisuke Nakano

    The 38th JSST Annual Conf.   174 - 177   2019.11

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • A consideration on dynamic control of transmittable areas of information floating for generation of a map of available routes Reviewed

    Naoyuki Karasawa, Kodai Kobayashi, Kazuyuki Miyakita, Hiroshi Tamura, Keisuke Nakano

    The 38th JSST Annual Conf.   170 - 173   2019.11

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • On Graph Coloring with Relation to Channel Assignment in Wireless Networks Reviewed

    Hiroshi TAMURA, Shun MATSUMOTO, Keisuke NAKANO, Masakazu SENGOKU

    IEICE Trans. Fundamentals   J102-A ( 7 )   214 - 223   2019.7

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)  

    researchmap

  • Coloring to Matchings of Graphs and Channel Assignment on Wulti-hop Wireless Networks Reviewed

    Shun MATSUMOTO, Hiroshi TAMURA, Keisuke NAKANO, Masakazu SENGOKU

    IEICE Trans. Fundamentals   102-A ( 6 )   194 - 200   2019.6

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)  

    researchmap

  • A Consideration of Method of Information Sources' Moving with Covering Problem for Distribution of Regional Information Reviewed

    Mamoru Takano, Atsushi Kashiwabara, Hiroshi Tamura, Keisuke Nakano, Masakazu Sengoku

    Transaction of the Japan Society for Simulation Technology   11 ( 2 )   15 - 22   2019.5

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)  

    researchmap

  • A study on information floating considering human body shadowing and mobility characteristics of nodes Reviewed

    Naoyuki Karasawa, Kazuyuki Miyakita, Keisuke Nakano, Hiroshi Tamura

    The 37th JSST Annual Conf.   159 - 162   2018.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:日本シミュレーション学会  

    researchmap

  • Graph coloring corresponding to channel assignment in wireless communication Reviewed

    Hiroshi Tamura, Takashi Nomura, Keisuke Nakano

    The 37th JSST Annual Conf.   155 - 158   2018.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:日本シミュレーション学会  

    researchmap

  • Experimental Evaluation of Fundamental Characteristics of Information|rn|Floating in a Prototypic System Reviewed

    aoyuki Karasawa, Kento Nakayachi, Kazuyuki Miyakita, Keisuke Nakano, Hiroshi Tamura

    ITC-CSCC2018   561 - 564   2018.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • On a channel assignment problem to regularly arranged sensor terminals Reviewed

    Hiroshi Tamura, Keisuke Nakano, Masakazu Sengoku

    Proc. ITC-CSCC2018   547 - 550   2018.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • On a Hierarchical Food Delivery System using UAVs Reviewed

    Hiroshi Tamura, Daisuke Suganuma, Keisuke Nakano

    The 36th JSST Annual Conf.   218 - 221   2017.10

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • A Consideration on Applying a Covering Problem in Network Theory to Information Floating Reviewed

    Atsushi Kashiwabara, Shun Matsumoto, Hiroshi Tamura, Keisuke Nakano, Masakazu Sengoku

    Transaction of the Japan Society for Simulation Technology   9 ( 4 )   73 - 78   2017.9

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:Japan Society for Simulation Technology  

    &nbsp;&nbsp;Epidemic routing can deliver messages in the case where there is never a connected path from source to destination. By using Epidemic routing repeatedly, the technique called Information Floating can maintain information in specific area. Information Floating is more effective when there are many mobile nodes. We consider effect of public space on information floating. A public space is a social space and mobile nodes are easy to gather in the space. If we can identify a place that is not a public space but where information tends to stay, it will maintain more information. We introduce to use a covering problem to identify this place. A covering problem is one of location problems that find the best place on road networks, communication networks, etc. In this paper, we identify where to put the fixed stations with information by applying a covering problem, and we show its effectiveness in computer simulation.<br>

    DOI: 10.11308/tjsst.9.73

    researchmap

  • On Information Floating using Epidemic Communication and Covering Problem in Flow Networks Reviewed

    Hiroshi Tamura, Atsushi Kashiwabara, Keisuke Nakano

    The 35th JSST Annual Conf.   408 - 411   2016.10

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:JSST  

    researchmap

  • Simulation study of relief goods delivery and information sharing by epidemic transmission in disaster areas Reviewed

    Kazuyuki Miyakita, Keisuke Nakano, Masashi Yamashita, Hiroshi Tamura

    Journal of Advanced Simulation in Science and Engineering (JASSE)   3 ( 1 )   114 - 135   2016.8

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:Japan Society for Simulation Technology  

    <p>During large-scale disasters, some regions can become isolated from critical information exchanges due to problems with communication infrastructures. In this paper, we consider information exchange among isolated shelters in such cases using epidemic transmission, which distributes information without infrastructure by direct communication between nodes and their movements. As mobile nodes for epidemic transmission, we consider transport vehicles that are leaving a distribution center to deliver relief goods to shelters. These transport vehicles receive information from the shelters and distribute it to other shelters together with the relief goods. As a result, information is shared by the shelter. Suppose that transport vehicles move along different traveling paths and exchange information at the distribution center. Transport vehicles can also get new information from other transport vehicles while they wait for new relief goods to arrive at the distribution center. Transport vehicles might be able to receive more new information by waiting for a longer time, although such additional waiting time causes a greater delay of the delivery of relief goods. In this paper, we consider the relation between relief goods delivery and information sharing by transport vehicles with epidemic transmission and analyze how the additional waiting time affects the delay of relief goods and the time needed for information sharing by computer simulation.</p>

    DOI: 10.15748/jasse.3.114

    researchmap

  • Study on Several Graph Coloring Problems related with Wireless Networks Reviewed

    Shun Matsumoto, Hiroshi Tamura

    The 31st International Technical Conference on Circuits/Systems, Computers and Communications   515 - 518   2016.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • A Consideration on Evaluation of Epidemic Information Sharing by Multiple UAVs Reviewed

    Naoyuki Karasawa, Keisuke Nakano, Kazuyuki Miyakita, Hiroshi Tamura

    The 31st International Technical Conference on Circuits/Systems, Computers and Communications   519 - 522   2016.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • On Information Floating by Probe Epidemic Transmission Reviewed

    Naoyuki Karasawa, Keisuke Nakano, Kazuyuki Miyakita, Kyosuke Kasagi, Hiroshi Tamura

    Transaction of the Japan Society for Simulation Technology   7 ( 4 )   85 - 97   2015.11

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:the Japan Society for Simulation Technology  

    Epidemic transmission can distribute information over the service area by direct wireless communication between mobile nodes and mobility of the mobile nodes. By using epidemic transmission repeatedly, we can send information to mobile nodes entering a specific area. This is called Information Floating (IF). In this paper, we consider IF to distribute an advertisement to guide customers to a target place (shopping place). The purpose of advertisement delivery is to deliver an advertisement to mobile nodes before they arrive at the target place and to guide mobile nodes to the target place. We divide a service area into some small areas, and consider how to decide the areas where the advertisement is virtually floated. To do this, we use probe data such as traffic volume entering each small area. We consider three methods to decide the areas for IF, and evaluate these methods by computer simulation. Two of the three methods use probe data. In computer simulation, we consider uniform and non-uniform traffic distributions, and small and large traffic volumes to assume various situations. We show effective methods in the various situations.<br>

    DOI: 10.11308/tjsst.7.85

    researchmap

  • Consideration of the restrictive route search using the location information in ad -hoc network Reviewed

    Atsushi Kashiwabara, Hiroshi Tamura

    Transaction of the Japan Society for Simulation Technology   7 ( 4 )   115 - 123   2015.11

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:the Japan Society for Simulation Technology  

    Ad-hoc network is expected as a network in place of the cellular network, has been researched widely. The development of routing protocol is one of the problems in an ad-hoc network. Since the flooding packets cause decrease of performance of the network, wasteful communications should refrain. FORP (Flow Oriented Routing Protocol) is one of routing protocols in Ad-hoc network, which uses the mobility information (e.g. location, speed and direction), and chooses the longest expiration route for source and destination pairs. In the flooding of the route search, the packets explode, as the number of nodes increases in the service area. However, FORP doesn't take explosion-control. In this paper, we discuss the effect to the destruction of extra control packets in the route search using the mobility information.<br>

    DOI: 10.11308/tjsst.7.115

    researchmap

  • A Consideration on Arrangement of Places where Information is Floated Reviewed

    Naoyuki Karasawa, Keisuke Nakano, Kazuyuki Miyakita, Hiroshi Tamura

    The 34th JSST Annual Conf.   104 - 107   2015.10

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • Effectiveness of fixed channel assignment strategy on multi-hop wireless networks Reviewed

    Hiroshi Tamura, Takashi Nomura, Shoji Shinoda

    The 34th JSST Annual Conf.   92 - 95   2015.10

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • Theoretical Analysis of A Consideration on Information Floating by Probe Data Reviewed

    Naoyuki KARASAWA, Keisuke NAKANO, Kazuyuki MIYAKITA, Kyosuke KASAGI, Hiroshi TAMURA

    roc. The 30th International Technical Conference on Circuits/Systems, Computers and Communications(ITC-CSCC2015)   SS - 1-4   2015.6

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • Theoretical Analysis of Pure Waiting Time for Battery Charging While Doing Something Reviewed

    Kazuyuki Miyakita, Keisuke Nakano, Hiroshi Tamura

    2015 IEEE 12TH INTERNATIONAL SYMPOSIUM ON AUTONOMOUS DECENTRALIZED SYSTEMS ISADS 2015   242 - 247   2015

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Recently, Electric Vehicle (EV) is considered as one of important technologies of smart grid; however, there are some problems for spreading EVs. One of these problems is that charging the battery of an EV needs a longer time than refueling of gasoline vehicles. To overcome these problems, for example, some local governments in Japan started projects in which restaurants and shops rent outlets for charging EV of their customers while doing something such as eating or shopping. Under such projects, if an EV driver knows information on chargers such as the locations of chargers and the mean waiting times for using chargers, the driver may be able to reduce the time spent only for charging (pure waiting time). In this paper, we theoretically analyze the mean of the pure waiting time in cases where drivers know and do not know the above information. From the numerical results, we discuss what information is important to reduce the pure waiting time.

    DOI: 10.1109/ISADS.2015.50

    Web of Science

    researchmap

  • Upper bounds of the number of channels on multi-hop wireless networks and the estimation with computer simulation Reviewed

    Hiroshi Tamura, Takashi Nomura, Shoji Shinoda

    The 33rd Japan Society for Simulation Technology Annual Conference   2014.10

     More details

    Language:Japanese   Publishing type:Research paper (international conference proceedings)   Publisher:日本シミュレーション学会  

    researchmap

  • A Consideration on Efficient Message Delivery of Probe Epidemic Transmission in Delay Tolerant Networks Reviewed

    Naoyuki KARASAWA, Arata KATO, Kazuyuki MIYAKITA, Keisuke NAKANO, Hiroshi TAMURA

    Proc.The 29th International Technical Conference on Circuit/Systems Computers and Communications (ITC-CSCC2014)   815 - 818   2014.7

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    researchmap

  • Relations on the bounds of the number of channels on multi-hop wireless networks Reviewed

    Hiroshi Tamura, Kaoru Watanabe, Shoji Shinoda

    2014 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS (APCCAS)   379 - 382   2014

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    For multi-hop wireless networks, we assign channels to communication between terminals. For this assignment problem, modeling using the edge coloring of the graph theory has been proposed. In the modeling, all edges of the graph are assigned colors. In this paper, we assign colors to edges in a subset of the edge set as the other modeling, and we consider the number of assigned colors in the graph. We show some theoretical results and examine this modeling with computer simulation.

    Web of Science

    researchmap

  • Relations with the modeling of channel assignment problems on multi-hop wireless networks and edge coloring problems of graphs Reviewed

    Hiroshi TAMURA, Kazuyuki MIYAKITA, Keisuke NAKANO, Masakazu SENGOKU, Shoji SHINODA

    The 32th JSST Annual Conf.   2013.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:日本シミュレーション学会  

    researchmap

  • Generalization of an edge coloring of graphs and channel|rn|assignment problem on multi-hop wireless networks Reviewed

    Hiroshi Tamura, Kazuyuki Miyakita, Keisuke Nakano, Masakazu Sengoku, Shoji Shinoda

    Proc. JSST2012 International Conference on Simulation Technology   2012.9

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Japan Society for Simulation Technology  

    researchmap

  • Scheduling Algorithms of the Multihop Wireless Networks Using the Network Coding in Consideration of Cochannel Interferences Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 2011 Int. Conf. Modeling and Simulation Tech.   30th ( 26 )   2011.10

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:日本シミュレーション学会  

    researchmap

  • On an Edge Coloring between Conventional Edge Coloring and Strong Edge Coloring for Wireless Communications Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 2011 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   57 - 60   2011.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEK  

    researchmap

  • On Applications of Graph/Network Theory to Problems in Communication Systems Reviewed

    Hiroshi Tamura, Keisuke Nakano, Masakazu Sengoku, Shoji Shinoda

    ECTI Transaction CIT   5 ( 1 )   8 - 14   2011.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:ECTI  

    researchmap

  • 拡張された辺彩色問題の点彩色問題への変換について Reviewed

    田村裕, 中野敬介, 仙石正和, 篠田庄司

    電子情報通信学会論文誌   J93-A ( 11 )   782 - 784   2010.11

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33634

  • Relation Between Extended Edge Coloring and Vertex Coloring of Graphs Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Keisuke Nakano, Shoji Shinoda

    Proc. 2010 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   1121 - 1124   2010.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE/IEEK  

    researchmap

  • The Shortest Step Algorithm with Network Coding on Multihop Wireless Cyclic Network Reviewed

    Hiroshi Tamura, Yuki Shimizu, Masakazu Sengoku, Shoji Shinoda

    Proc. 2009 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   38 - 41   2009.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEK  

    researchmap

  • 地震からの復興に向けて—新潟県中越沖地震被災地から— Reviewed

    宮澤正幸, 田口太郎, 田村裕

    電子情報通信学会誌   91 ( 10 )   845 - 847   2008.10

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/31694

  • Edge Coloring Problem of Graph Theory Considering Interference on Network Coding Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 2008 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   301 - 304   2008.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • Network Coding on Wireless Multihop Networks and an Edge Coloring Problem in Graph Theory Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc.2007 IEEE VTS Asia Pacific Wireless Communications   S6 - 06   2007.8

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE  

    researchmap

  • On an assignment problem for wireless LAN and the voronoi diagram Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    SYSTEMS MODELING AND SIMULATION: THEORY AND APPLICATIONS, ASIA SIMULATION CONFERENCE 2006   445 - +   2007

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:SPRINGER-VERLAG TOKYO  

    In wireless LAN, like IEEE802.11x, the number of accessible terminal is limited for each access point. Therefore, it is necessary to assign each terminal to the access points under the limitation. It is well-known that this problem can be solved in polynomial time by solving a maximum flow problem in graph theory.
    However, there is a weak point in the above solution. If a terminal newly tries to access an access point, many terminals may change the access points. Therefore, this solution is not realistic. It is important to minimize the number of terminals that change the access points. In this paper, we propose a polynomial algorithm to solve the problem.

    Web of Science

    researchmap

  • Formulation of an Assignment Problem in Wireless LANs Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 2006 Int. Symp. Nonlinear Theory and its Applications   587 - 590   2006.9

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • Vertex Disjoint Paths and Location Problems on Networks Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 2005 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   1163 - 1164   2005.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEK  

    researchmap

  • PHS with Ad Hoc Networking Function Reviewed

    Shoji Shinoda, Masakazu Sengoku, Keisuke Nakano, Kenichi Mase, Hiroshi Tamura

    The 18th PHS MoU Group General Meeting & Seminar   2005.4

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    researchmap

  • Broadcast scheduling for wide-area parallel distributed systems Reviewed

    Futoshi Tasaki, Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)   88 ( 4 )   11 - 23   2005.4

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    Parallel distributed systems in which multiple computers are connected through LAN and WAN are widely used at present. One of the important functions of parallel distributed systems is broadcasting to distribute data over an entire system. Broadcast processing greatly affects the performance of parallel distributed systems, and it is desirable to develop a distribution procedure that completes the processing in a short time. Consequently, there have been many approaches to the minimum broadcast time problem, aiming at the optimal distribution procedure. However, not many past studies of this problem consider a wide-area system in which multiple parallel distributed systems are connected. In this context, this paper considers the minimum broadcast time problem for a wide-area parallel distributed system whose topology can be represented by a certain kind of split graph. It is shown that the problem can be solved in polynomial time in the homogeneous parallel distributed system in which the time required for communication is uniform. In addition, a heuristic algorithm is proposed for a heterogeneous parallel distributed system in which the time required for communication is not uniform. Simulation results reveal that an efficient distribution procedure can be derived in a short time. © 2004 Wiley Periodicals, Inc.

    DOI: 10.1002/ecjc.20137

    Scopus

    researchmap

  • Scheduling problems for a class of parallel distributed systems Reviewed

    H Tamura, F Tasaki, M Sengoku, S Shinoda

    2005 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS (ISCAS), VOLS 1-6, CONFERENCE PROCEEDINGS   176 - 179   2005

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Parallel distributed systems in which multiple computers are connected through LAN and WAN are widely used at present. One of the important function of parallel distributed systems is broadcasting to deliver data over an entire system. Multicasting is an expanded function of broadcasting. Broadcast/multicast processing greatly affects the performance of parallel distributed systems, and it is desirable to develop a delivering procedure that completes the processing in a short time. There have been many approaches to the minimum broadcast time problem, aiming at the optimal delivering procedure. In this paper, we consider the minimum broadcast/multicast time problem for a parallel distributed system whose topology can be represented by a subclass of split graphs.

    Web of Science

    researchmap

  • Scheduling Problems for a Class of Parallel Distributed Systems Reviewed

    Hiroshi Tamura, Futoshi Tasaki, Masakazu Sengoku, Shoji Shinoda

    Proceedings - IEEE International Symposium on Circuits and Systems   176 - 179   2005

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)  

    Parallel distributed systems in which multiple computers are connected through LAN and WAN are widely used at present. One of the important function of parallel distributed systems is broadcasting to deliver data over an entire system. Multicasting is an expanded function of broadcasting. Broadcast/multicast processing greatly affects the performance of parallel distributed systems, and it is desirable to develop a delivering procedure that completes the processing in a short time. There have been many approaches to the minimum broadcast time problem, aiming at the optimal delivering procedure. In this paper, we consider the minimum broadcast/multicast time problem for a parallel distributed system whose topology can be represented by a subclass of split graphs.©2005 IEEE.

    DOI: 10.1109/ISCAS.2005.1464553

    Scopus

    researchmap

  • 広域並列分散システムのブロードキャストスケジューリングについて Reviewed

    田崎太, 田村裕, 仙石正和, 篠田庄司

    電子情報通信学会論文誌   J87-A ( 5 )   642 - 653   2004.5

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33635

  • Effect of a new channel assignment strategy on multihop wireless networks Reviewed

    F Tasaki, F Uta, H Tamura, M Sengoku, S Shinoda

    IEICE TRANSACTIONS ON COMMUNICATIONS   E87B ( 5 )   1095 - 1103   2004.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Recently, the mulitihop wireless network system attracts the interest of many people as a communication network system of the next generation. The multihop wireless network has unique features in which neither base stations nor wired backbone networks are required and a terminal can communicate with the other terminal beyond the transmission range by multihopping. In this network, a communication link between two terminals which can communicate directly is required a channel. Since cochannel interference may occur, we need to assign channels to communication links carefully. In this paper, we describe a channel assignment strategy which takes the degree of cochannel interference into consideration, and we evaluate an effectiveness of this strategy by computer simulations. We show that this strategy is more effective than a strategy which does not take the degree of cochannel interference into consideration. And we also consider a few channel assignment algorithms briefly.

    Web of Science

    researchmap

  • A channel assignment problem in multihop wireless networks and graph theory Reviewed

    H Tamura, K Watanabe, M Sengoku, S Shinoda

    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS   13 ( 2 )   375 - 385   2004.4

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:WORLD SCIENTIFIC PUBL CO PTE LTD  

    Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message and then send it to another terminal. In these networks, it is important to assign channels for communications to each terminal efficiently. There are some studies on this assignment problem using a conventional edge coloring in graph theory. In this paper, we propose a new edge coloring problem in graph and network theory on this assignment problem and we discuss the computational complexity of the problem. This edge coloring problem takes the degree of interference into consideration. Therefore, we can reuse the channels more efficiently compared with the conventional method.

    Web of Science

    researchmap

  • A new channel assignment strategy towards the wireless mesh networks Reviewed

    F Tasaki, H Tamura, M Sengoku, S Shinoda

    2004 JOINT CONFERENCE OF THE 10TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS AND THE 5TH INTERNATIONAL SYMPOSIUM ON MULTI-DIMENSIONAL MOBILE COMMUNICATIONS, VOLS 1 AND 2, PROCEEDINGS   71 - 75   2004

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Recently, the wireless mesh network attracts the interest of many people as a new broadband network of the next generation. The wireless mesh network only consists terminals, then a terminal in the network can communicate with the other terminal beyond the transmission range by multihopping as same as ad hoc networks. In this network, a communication link between two terminals which can communicate directly is required a channel. Since cochannel interference may occur, we need to assign channels to communication links carefully. In this paper, we describe a channel assignment strategy which takes the degree of cochannel interference into consideration, and we evaluate. an effectiveness of this strategy by computer simulations. We show that this strategy is more effective than a strategy which does not take the degree of cochannel interference into consideration.

    Web of Science

    researchmap

  • New scheduling problems in a multi-hop network, and their complexity results Reviewed

    K Watanabe, H Tamura, M Sengoku

    2004 47TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL II, CONFERENCE PROCEEDINGS   489 - 491   2004

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    The link scheduling problem and broadcast scheduling problem have been discussed as graph theory. These scheduling problems are channels/time-slots assignment problems in a multi-hop network. It is known that the scheduling problems are NP-hard. We propose new extended scheduling problems. These scheduling problems can be applied to CDMA system. We show that the extended scheduling problems are NP-hard.

    Web of Science

    researchmap

  • Evaluation of a Channel Assignment Strategy on Multihop Wireless Networks Reviewed

    Futoshi Tasaki

    Proc. 2003 Int. Symp.Wireless Personal Multimedia Comm.   ( 1 )   137 - 141   2003.10

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:NICT/YRP  

    researchmap

  • 最新グラフネットワーク理論とその応用 Reviewed

    仙石正和, 田村裕, 篠田庄司

    電子情報通信学会誌   86 ( 9 )   683 - 688   2003.9

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33627

  • A New Total Coloring Problem in Multi-hop Networks Reviewed

    Kaoru Watanabe

    Proc. 2002 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   1375 - 1377   2002.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE/IEEK  

    researchmap

  • Graph Theoretical Considerations of a Channel Assignment Problem on Multihop Wireless Networks Reviewed

    Hiroshi Tamura, Kaoru Watanabe, Masakazu Sengoku, Shoji Shinoda

    Proc. 2002 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   967 - 970   2002.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE/IEEK  

    researchmap

  • Effectiveness of Routing Algorithms for a Short Message on Multihop Wireless Networks Reviewed

    Hiroshi Tamura

    Proc. 2002 Int. Conf. Fundamentals of Electronics, Comm. and Computer Sciences   S3 - 39-S3-42   2002.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • New Digraph Coloring Problems, their Complexity Results, and Application to a Multi-hop Network Reviewed

    Kaoru Watanabe

    Proc. 2002 Int. Conf. Fundamentals of Electronics, Comm. and Computer Sciences   S3 - 1-S3-5   2002.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • On a new edge coloring related to multihop wireless networks Reviewed

    H Tamura, K Watanabe, M Sengoku, S Shinoda

    APCCAS 2002: ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, VOL 2, PROCEEDINGS   357 - 360   2002

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Multihop wireless networks consist of mobile terminals with personal communication devices. Each terminal can receive a message from a terminal and send it to the other terminal. In this paper, we discuss a new edge coloring problem on graph & network theory on multihop wireless networks. This edge coloring problem takes the degree of interference into consideration. Then, we discuss this problem about computational complexity.

    Web of Science

    researchmap

  • A Scheduling Problem in a Multi-hop Network for CDMA System Reviewed

    Kaoru Watanabe

    Proc. 2001 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   752 - 754   2001.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • All-to-All Transmission Schemes in Wireless Open Community Networks Considering Geometric Reviewed

    Hiroomi Murahata, Kyung Sup Kwak, Keisuke Nakano, Kenichi Mase, Masakazu Sengoku

    Proceedings of the 4th International Conference on Multi-Dimensional Mobile Communications (MDMC'01)   182 - 189   2001.6

     More details

    Language:English   Publishing type:Research paper (other academic)  

    researchmap

  • 無向フローネットワークのminimax実現問題のある一般化について Reviewed

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    電子情報通信学会論文誌   J84-A ( 5 )   614 - 623   2001.5

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33636

  • A study of minimum-cost tree problem with response-time bound in information network Reviewed

    N Shinomiya, H Tamura, H Watanabe

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E84A ( 2 )   638 - 646   2001.2

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    This paper deals with a study of a problem for finding the minimum-cost spanning tree with a response-time bound. The relation of cost and response-time is given as a monotonous decreasing and convex function. Regarding communication bandwidth as cost in an information network, this problem means a minimum-cost tree shaped routing for response-time constrained broadcasting, where any response-time from a root vertex to other vertex is less than a given time bound. This problem is proven to be NP-hard and consists of the minimum-cost assignment to a rooted tree and the minimum-cost tree finding. A nonlinear programming algorithm solves the former problem for the globally optimal solution. For the latter problem, different types of heuristic algorithms evaluate to find a near optimal solution experimentally.

    Web of Science

    researchmap

  • On a realization problem from non-terminal capacity matrices on undirected flow networks Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)   84 ( 12 )   28 - 39   2001

     More details

    Language:English   Publishing type:Research paper (scientific journal)  

    The problem of realizing a given matrix on an undirected flow network has been studied and various results have been obtained. Most of these results consist of necessary and sufficient conditions for methods of realization in which the maximum good flow between the two points and the matrix components coincide. However, there are cases in which coincidence is not required as long as they are close to each other. In this paper, we consider the realization under certain conditions when values not necessarily realizable as maximum good flows of the flow network are given between two points. First, the upper and lower bounds of the maximum good flow are given. The problem of realization between these two extremes is studied and the necessary and sufficient condition is given. Next, by means of this result, we consider the problem of minimizing the difference between the given value and the maximum good flow in the undirected flow network. A realization method is studied.

    DOI: 10.1002/ecjc.1054

    Scopus

    researchmap

  • Routing algorithms on wireless multihop networks and their modifications Reviewed

    Hiroshi Tamura, Toshiyuhi Moriyama, Noriyoshi Matsumoto, Masakazu Sengoku, Kenichi Mase, Shoji Shinoda

    ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings   4 ( 4 )   874 - 877   2001

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    The demand for communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. The wireless multihop network system is the one of the important systems in the near future. There exist various problems to which graph theory is applicable in mobile communication services. In this paper, we formulate a routing problem, named information delivering problem, on wireless multihop networks using graph theory. We propose heuristic algorithms for the problem and modify the algorithms for efficient reuse of spectrum. © 2001 IEEE.

    DOI: 10.1109/ISCAS.2001.922377

    Scopus

    researchmap

  • Graph problems in multi-hop networks Reviewed

    K. Watanabe, M. Sengoku, H. Tamura, K. Nakano, S. Shinoda

    ISCAS 2001 - 2001 IEEE International Symposium on Circuits and Systems, Conference Proceedings   4 ( 4 )   894 - 897   2001

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    In a multihop network, radio packets are often relayed through inter-mediate nodes (repeaters) in order to transfer a message. We consider a scheduling problem in a multihop network using two graph theoretical models. In this report, we prove that this problem is NP-hard, and we propose approximation algorithms for it. © 2001 IEEE.

    DOI: 10.1109/ISCAS.2001.922382

    Scopus

    researchmap

  • Algorithms for a Routing Problem on Wireless Ad-hoc Networks Reviewed

    Hiroshi Tamura

    Proc. 2000 JSST Int. Conf. Modeling, Control and Computation in Simulation   417 - 420   2000.10

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:日本シミュレーション学会  

    researchmap

  • A scheduling problem in multihop networks Reviewed

    K Watanabe, M Sengoku, H Tamura, K Nakano, S Shinoda

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E83A ( 6 )   1222 - 1227   2000.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    In a multihop network, radio packets are of ten relayed through inter-mediate stations (repenters) in order to transfer a radio packet from a source to its destination. We consider a scheduling problem in a multihop network using a graphtheoretical model. Let D = (V, A) be the digraph with a vertex set V and an are set A. Let f be a labeling of positive integers on the arcs of A. The value of f(u, v) means a frequency band assigned on the link from u to v. We call f antitransitive if S(u, v) not equal f(v, w) for any adjacent arcs (u, v) and (v, w) of D. The minimum antitransitive-labeling problem is the problem of finding a minimum antitransitive-labeling such that the number of integers assigned in an antitransitive labeling is minimum. In this paper, we prove that this problem is NP-hard, and we propose a simple distributed approximation algorithm for it.

    Web of Science

    researchmap

  • A routing problem on ad-hoc networks and graph theory Reviewed

    M Sengoku, H Tamura, K Mase, S Shinoda

    2000 INTERNATIONAL CONFERENCE ON COMMUNICATION TECHNOLOGY PROCEEDINGS, VOLS. I & II   ( 2 )   1710 - 1713   2000

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:PUBLISHING HOUSE ELECTRONICS INDUSTRY  

    The demand for communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. There exist various problems to which graph & network theory is applicable in mobile communication services. For example, it is well known that coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we introduce a graph theoretical approach for an information delivering problem in ad-hoc networks.

    Web of Science

    researchmap

  • On a generalized minimax realization problem on flow networks Reviewed

    H Tamura, M Sengoku, S Shinoda, T Abe

    2000 IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS   634 - 637   2000

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    If a matrix, which represents capacities between vertices for every vertex pair, are given, we have known the necessary and sufficient conditions for existence of networks satisfying given conditions. However, it is rare that capacities between all vertex pairs are given. Therefore, in previous papers, we give matrix which is not always terminal capacity matrix, and we consider realization of the matrix. In this case, we consider minimizing differences between capacities in the network and elements of the matrix. In this paper, we generalize the concept of difference and we propose an algorithm to construct the network.

    Web of Science

    researchmap

  • 端子容量行列とは限らない行列からの無向フローネットワークの実現について Reviewed

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    電子情報通信学会論文誌   J82-A ( 11 )   1719 - 1730   1999.11

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33637

  • The k-Spanner Problem in a Flow Network Reviewed

    Kaoru Watanabe, Masakazu Sengoku, Hiroshi Tamura, Shoji Shinoda

    Proc. 1999 Int. Symp. Nonlinear Theory and its Applications   687 - 688   1999.11

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • 周波数の有効利用技術におけるグラフネットワーク理論の適用 Reviewed

    佐藤拓朗, 田村裕, 阿部武雄

    電子情報通信学会誌   82 ( 9 )   922 - 926   1999.9

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • A Covering Problem on Mesh Type Graphs Reviewed

    Hiroomi Murahata

    Proc. 1999 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   2 ( 6 )   880 - 883   1999.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • Graph theoretic or computational geometric research of cellular mobile communications Reviewed

    H Tamura, M Sengoku, K Nakano, S Shinoda

    ISCAS '99: PROCEEDINGS OF THE 1999 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL 6   153 - 156   1999

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    The demand for communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anl one. There exist various problems to which computational geometry and graph & network theory is applicable in mobile communication services. For example, it is well known that coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we show new results in graph theoretic or computational geometric research of cellular mobile communications.

    Web of Science

    researchmap

  • On a minimax realization problem on flow networks Reviewed

    H. Tamura, M. Sengoku, S. Shinoda, T. Abe

    IEEE Region 10 Annual International Conference, Proceedings/TENCON   2   801 - 804   1999

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:Institute of Electrical and Electronics Engineers Inc.  

    We consider a realization problem of an undirected flow network N from a matrix M. We assume that M is not always a terminal capacity matrix. In our previous study, we considered a problem to minimize the differences between capacities between vertex pairs in N, and elements of M. We called this problem "minimax realization problem." In this paper, we propose another minimax realization problem and propose an algorithm to minimize the differences.

    DOI: 10.1109/TENCON.1999.818539

    Scopus

    researchmap

  • A Scheduling Problem in Multihop Networks Reviewed

    Kaoru Watanabe, Hiroshi Tamura, Keisuke Nakano, Masakazu Sengoku

    Proc.1998 Int. Symp. Multi-dimensional Mobile Communications   180 - 184   1998.9

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE/IEICE  

    researchmap

  • A Performance of an Algorithm Using the Set Division on a Delivery Problem Reviewed

    Takahiro Namimatu

    Proc.1998 Int. Symp. Multi-dimensional Mobile Communications   306 - 310   1998.9

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE/IEICE  

    researchmap

  • On an Effective Marking with Sychronic Distance Reviewed

    Atsuko Ito

    Proc.1998 Int. Symp. Multi-dimensional Mobile Communications   300 - 304   1998.9

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE/IEICE  

    researchmap

  • 無向フローネットワークにおける総合被覆問題について Reviewed

    田村裕, 菅原秀仁, 仙石正和, 篠田庄司

    電子情報通信学会論文誌   J81-A ( 5 )   863 - 869   1998.5

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33638

  • Covering problems in the p-collection problems Reviewed

    K Watanabe, M Sengoku, H Tamura, S Shinoda

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E81A ( 3 )   470 - 475   1998.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.

    Web of Science

    researchmap

  • Realization of flow networks from non-terminal capacity matrices Reviewed

    H Tamura, M Sengoku, S Shinoda, T Abe

    APCCAS '98 - IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS   467 - 470   1998

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    In this paper, we consider a realization problem of an undirected flow network N from a matrix M. We assume that M is not always a terminal capacity matrix. In this condition, we consider a problem to minimize differences between capacities between vertex pairs in N, and elements of M. And we propose a method to construct N. Next, we consider a problem to minimize the number of such vertex pairs. Then, we show the problem is NP-hard.

    Web of Science

    researchmap

  • Cut cover problem in directed graphs Reviewed

    K Watanabe, M Sengoku, H Tamura, S Shinoda

    APCCAS '98 - IEEE ASIA-PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS   703 - 706   1998

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:IEEE  

    Let D = (V, A) be the digraph with a vertex set Ir and an are set A. A cut cover in D is a family of (directed) cuts such that each are of A belongs to some cut of this family. A minimum cut cover in D is one of the minimum size. We say the problem of finding a minimum cut cover of a given digraph to be the minimum cut cover problem for digraphs. In this paper we consider the problem for digraphs, and show that this problem is NP-complete.

    Web of Science

    researchmap

  • A Scheduling Problem for Mobile Radio Networks with Multihop Type Reviewed

    Kaoru Watanabe

    Proc. 1997 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   877 - 880   1997.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • The p-collection problem in a flow network with lower bounds Reviewed

    K Watanabe, H Tamura, K Nakano, M Sengoku

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E80A ( 4 )   651 - 657   1997.4

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    In this paper we extend the p-collection problem to a flow network with lower bounds, and call the extended problem the lower-bounded p-collection problem. First we discuss the complexity of this problem to show NP-hardness for a network with path structure. Next we present a linear time algorithm for the lower-bounded 1-collection problem in a network with tree structure, and a pseudo-polynomial time algorithm with dynamic programming type for the lower-bounded p-collection problem in a network with tree structure. Using the pseudo-polynomial time algorithm, we show an exponential algorithm, which is efficient in a connected network with few cycles, for the lower-bounded p-collection problem.

    Web of Science

    researchmap

  • On a generalization of a covering problem called single cover on undirected flow networks Reviewed

    H Tamura, H Sugawara, M Sengoku, S Shinoda

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E80A ( 3 )   544 - 550   1997.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. In a previous paper, we have considered location problems, called covering problems and proposed polynomial time algorithms for these problems. These problems are applicable to assigning files to some computers in a computer network. This paper is concerned with a covering problem called the single cover problem defined in the previous paper. First, we define a generalized single cover problem and show that an algorithm proposed in the previous paper can be applicable to solving the generalized single cover problem. Then, we define a single cover problem satisfying cardinality constrains and show that the problem is solved in a polynomial time.

    Web of Science

    researchmap

  • Channel Assignment in Cellular Systems Using the Channel Offset Scheme

    Yoshihiro Fujita

    Proc. 1997 Int. Symp. Teletraffic Modeling of Multimedia Mobile Comm. Systems   53 - 62   1997.3

     More details

    Language:English   Publisher:TAO  

    researchmap

  • Cover problem corresponding to the p-collection problem Reviewed

    K Watanabe, M Sengoku, H Tamura, S Shinoda

    ISCAS '97 - PROCEEDINGS OF 1997 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS I - IV   1656 - 1659   1997

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:I E E E  

    The lower-bounded p-collection problem is the problem where to locate p sinks in a flow network with lower bounds such that the value of a maximum flow is maximum. This paper discusses the cover problems corresponding to the lower bounded p-collection problem. We consider the complexity of the cover problem, and we show polynomial time algorithms for its subproblems in a network with tree structure.

    Web of Science

    researchmap

  • The problem of where to locate p-sinks in a flow network: Complexity approach Reviewed

    K Watanabe, H Tamura, M Sengoku

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E79A ( 9 )   1495 - 1503   1996.9

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The p-collection problem is where to locate p sinks in a flow network such that the value of a maximum flow is maximum. In this paper we show complexity results of the p-collection problem. We prove that the decision problem corresponding to the p-collection problem is strongly NP-complete. Although location problems (the p-center problem and the p-median problem) in networks and flow networks with tree structure is solvable in polynomial time, we prove that the decision problem of the p-collection problem in networks with tree structure, is weakly NP-complete. And we show a polynomial lime algorithm for the subproblem of the p-collection problem such that the degree sum of vertices with degree greater than or equal to 3 in a network, is bound to some constant K greater than or equal to 0.

    Web of Science

    researchmap

  • Some of Classes of the Marked Graph with Given Synchronic Distance Matrix Reviewed

    Yoshikazu Oda, Kaoru Watanabe, Hiroshi Tamura, Masakazu Sengoku

    Proc. 1996 Int. Tech. Conf. Circuits/Systems, Computers and Comm.   705 - 708   1996.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEK  

    researchmap

  • Base Station Location in Cellular Mobile Communication Systems Reviewed

    Jiro Ishiguri

    Proc. 1996 Int. WS Multi-dimensional Mobile Communications   289 - 292   1996.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE/IEICE  

    researchmap

  • Roles of Computational Geometry and Graph Theory in Cellular Mobile Communications Reviewed

    Masakazu Sengoku, Hiroshi Tamura, Shoji Shinoda

    Proc. 1996 Int. WS Multi-dimensional Mobile Communications   372 - 375   1996.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE/IEICE  

    researchmap

  • A Study on Clusters in Cellular Mobile Communication Systems with the Channel Offset Scheme Reviewed

    Yoshihiro Fujita

    Proc. 1996 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   537 - 740   1996.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEK  

    researchmap

  • On a generalization of a covering problem on undirected flow networks Reviewed

    H Tamura, H Sugawara, M Sengoku, S Shinoda

    APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96   460 - 463   1996

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:I E E E  

    Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. We have studied location theory from the standpoint of measuring the closeness between two vertices by the capacity (maximum now value) between two vertices. In the previous paper, we have considered location problems, called covering problems and proposed polynomial time algorithms for these problems. These problems are applicable to assigning files to some computers in a computer network. This paper concerns a problem called plural cover problem defined in the previous paper. We define a generalized plural cover problem and we propose an efficient algorithm for the generalized plural cover problem.

    Web of Science

    researchmap

  • New applications of computational geometry and graph theory to cellular mobile communications Reviewed

    H Tamura, M Sengoku, S Shinoda

    APCCAS '96 - IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS '96   199 - 202   1996

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:I E E E  

    The demand for mobile communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. There exist various problems to which computational geometry and graph & network theory is applicable in mobile communication services. For example, it is well-known that Coloring algorithms of graphs are applicable in channel assignment algorithms in cellular systems. In this paper, we show some examples of new applications of computational geometry and graph theory to cellular mobile communications.

    Web of Science

    researchmap

  • フローネットワークの出口配置問題 Reviewed

    渡辺郁, 田村裕, 仙石正和

    電子情報通信学会論文誌   J78-A ( 8 )   938 - 946   1995.8

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • マークグラフにおける同期距離に関する性質について Reviewed

    田村裕他

    電子情報通信学会論文誌   J78-A ( 8 )   929 - 937   1995.8

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    researchmap

  • Problems of Where to Locate Capacitated p-sinks in Flow Networks

    Kaoru Watanabe, Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 1995 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   758 - 761   1995.7

     More details

    Language:English   Publisher:電子情報通信学会  

    researchmap

  • The structure of networks realized from terminal capacity matrices Reviewed

    H TAMURA, R SATO, M SENGOKU, S SHINODA, T ABE

    1995 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3   ( 1 )   159 - 162   1995

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:I E E E  

    Web of Science

    researchmap

  • DEVELOPMENT IN GRAPH-THEORETIC AND OR NETWORK-THEORETIC RESEARCH OF CELLULAR MOBILE COMMUNICATION CHANNEL ASSIGNMENT PROBLEMS Reviewed

    M SENGOKU, H TAMURA, S SHINODA, T ABE

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E77A ( 7 )   1117 - 1126   1994.7

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The demand for mobile communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. The development of economic and social activities is a primary factor of the increasing demand for mobile communication services. The demand stimulates the development of technology in mobile communication including personal communication services. Thus mobile communication has been one of the most active research in communications in the last several years. There exist various problems to which graph & network theory is applicable in mobile communication services [1]. (for example, channel assignment algorithm in cellular system, protocol in mobile communication networks and traffic control in mobile communication). A model of a cellular system has been formulated using a graph and it is known that the channel assignment problem is equivalent to the coloring problem of graph theory. Recently, two types of coloring problems on graphs or networks related to the channel assignment problem were proposed. Mainly, we introduce these coloring problems and show some results on these problems in this paper.

    Web of Science

    researchmap

  • On a Coloring of Graphs for Efficient Use of Spectrum

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    Proc. 1994 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   534 - 539   1994.7

     More details

    Language:English   Publisher:IEEK  

    researchmap

  • REALIZATION PROBLEMS OF A TREE WITH A TRANSMISSION NUMBER SEQUENCE Reviewed

    K WATANABE, M SENGOKU, H TAMURA, Y YAMAGUCHI

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E77A ( 3 )   527 - 533   1994.3

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Problems of realizing a vertex-weighted tree with a given weighted transmission number sequence are discussed in this paper. First we consider properties of the weighted transmission number sequence of a vertex-weighted tree. Let S be a sequence whose terms are pairs of a non-negative integer and a positive integer. The problem determining whether S is the weighted transmission number sequence of a vertex-weighted tree or not, is called w-TNS. We prove that w-TNS is NP-complete. and we show an algorithm using backtracking. This algorithm always gives a correct solution. And, if each transmission number of S is different to the others. then the time complexity of this is only O( Absolute value of S 2). Next we consider the d2-transmission number sequence so that the distance function is defined by a special convex function.

    Web of Science

    researchmap

  • ON A SUFFICIENT CONDITION FOR A MATRIX TO BE THE SYNCHRONIC DISTANCE MATRIX OF A MARKED GRAPH Reviewed

    K MIKAMI, H TAMURA, M SENGOKU, Y YAMAGUCHI

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E76A ( 10 )   1607 - 1609   1993.10

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    The synchronic distance is a fundamental concept in a Petri net. Marked graphs form a subclass of Petri nets. Given a matrix D, we are interested in the problem of finding a marked graph whose synchronic distance matrix is D. It is well-known that the synchronic distance matrix of a marked graph is a distance matrix. In this letter, we give a matrix D such that D is a distance matrix and there does not exist a marked graph whose synchronic distance matrix is D.

    Web of Science

    researchmap

  • A Study of Covering Problems in Location Theory on Flow Networks

    Hiroshi Kawakami

    Proc. 1993 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   82 - 86   1993.7

     More details

    Language:English   Publisher:電子情報通信学会  

    researchmap

  • An Approach to a Fault Diagnosis of a Subclass of Marked Graphs

    Kiyoshi Mikami

    Proc. 1993 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   87 - 90   1993.7

     More details

    Language:English   Publisher:電子情報通信学会  

    researchmap

  • REALIZATION OF A NETWORK FROM THE UPPER AND LOWER BOUNDS OF THE DISTANCES (OR CAPACITIES) BETWEEN VERTICES Reviewed

    H TAMURA, M SENGOKU, S SHINODA, T ABE

    1993 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS : PROCEEDINGS, VOLS 1-4 ( ISCAS 93 )   ( 4 )   2545 - 2548   1993

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:I E E E  

    Web of Science

    researchmap

  • GRAPH AND NETWORK THEORY AND CELLULAR MOBILE COMMUNICATIONS Reviewed

    M SENGOKU, H TAMURA, S SHINODA, T ABE

    1993 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS : PROCEEDINGS, VOLS 1-4 ( ISCAS 93 )   ( 4 )   2208 - 2211   1993

     More details

    Language:English   Publishing type:Research paper (international conference proceedings)   Publisher:I E E E  

    Web of Science

    researchmap

  • SOME COVERING PROBLEMS IN LOCATION THEORY ON FLOW NETWORKS Reviewed

    H TAMURA, M SENGOKU, S SHINODA, T ABE

    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES   E75A ( 6 )   678 - 684   1992.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG  

    Location theory on networks is concerned with the problem of selecting the best location in a specified network for facilities. Many studies for the theory have been done. However, few studies treat location problems on networks from the standpoint of measuring the closeness between two vertices by the capacity (maximum flow value) between two vertices. This paper concerns location problems, called covering problems on flow networks. We define two types of covering problems on flow networks. We show that covering problems on undirected flow networks and a covering problem on directed flow networks are solved in polynomial times.

    Web of Science

    researchmap

  • CHANNEL ASSIGNMENT PROBLEM IN A CELLULAR MOBILE SYSTEM AND A NEW COLORING PROBLEM OF NETWORKS Reviewed

    H TAMURA, M SENGOKU, S SHINODA, T ABE

    IEICE TRANSACTIONS ON COMMUNICATIONS ELECTRONICS INFORMATION AND SYSTEMS   74 ( 10 )   2983 - 2989   1991.10

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEICE-INST ELECTRON INFO COMMUN ENG  

    In a cellular mobile system, assigning a channel for a call in a cell so as to achieve high spectral efficiency is an important problem. In usual channel assignment for a cellular mobile system, a channel can be simultaneously assigned to some cells with a constant separation distance. This usual model of a cellular mobile system has been formulated using a graph and it is known that the channel assignment problem is equivalent to the coloring problem of graph theory. Recently, a new channel assignment scheme has been proposed. This scheme takes the degree of interference into consideration. In the scheme, a channel is simultaneously assigned.if the CIR (carrier-to-interference ratio) is more than the desired value. In this paper, we formulate this new model using a network and a new coloring problem of networks. The new coloring problem of networks is a generalization of the usual coloring problem of graphs. One of the merits of this formulation is that the degree of cochannel interference between cells can be represented. In the usual formulation using a graph, the degree of cochannel interference between cells can not be represented. Therefore, spectral efficiency in the formulation using a network is higher than spectral efficiency in the formulation using a graph. In this paper, we show that the new coloring problem is an NP-hard problem. Subsequently, we rewrite the new coloring problem of networks to a coloring problem of graphs on some assumptions and consider the relation between the results on the new coloring and the results on the usual coloring.

    Web of Science

    researchmap

  • Some Covering Problems in Location Theory on Flow Networks

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    Proc. 1991Joint Tech. Conf. Circuits/Systems, Computers and Comm.   109 - 114   1991.7

     More details

    Language:English   Publisher:電子情報通信学会  

    researchmap

  • A New Coloring Problem of Networks Related to a Channel Assignment Problem in Cellular Mobile Systems Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    Proc. 1991 IEEE International Symposium on Circuits & Systems   946 - 949   1991.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE  

    researchmap

  • Location Problems and their Dual Problems on Undirected Flow Networks Reviewed

    Hiroshi Tamura

    Proc. 1991 Int. Symp. Mathematical Theory of Networks and Systems   486 - 500   1991.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:Mita Press  

    researchmap

  • GRAPH THEORETICAL CONSIDERATIONS OF CHANNEL OFFSET SYSTEMS IN A CELLULAR MOBILE SYSTEM Reviewed

    M SENGOKU, H TAMURA, S SHINODA, T ABE, Y KAJITANI

    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY   40 ( 2 )   405 - 411   1991.5

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC  

    Since the spectrum is a limited resource, spectral efficiency is an important consideration in a mobile radio system. In this paper, we formulate a channel offset system design using a graph theoretical concept in a cellular mobile system. From the graph theoretical considerations, we investigate an optimal channel offset scheme in a cellular mobile system and give an upper and a lower bound for overall spectral bandwidth.

    Web of Science

    researchmap

  • Channel Assignment Problem in a Cellular Mobile System and a New Coloring Problem of Networks

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    Proc. 1990 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   74 ( 10 )   162 - 167   1990.12

     More details

    Language:English   Publisher:IEEK  

    CiNii Books

    researchmap

  • Location Problems on Undirected Flow Networks Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    電子情報通信学会論文誌   E73 ( 12 )   1989 - 1993   1990.12

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

  • 一部の点間の距離からの有向ネットワークの実現 Reviewed

    田村裕他

    電子情報通信学会論文誌   J72-A ( 11 )   1866 - 1875   1989.11

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33641

  • 容量空間における最適勢力圏図 Reviewed

    田村裕, 仙石正和, 篠田庄司

    電子情報通信学会論文誌   J72-A ( 8 )   1327 - 1335   1989.8

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10191/22435

  • 一部の最大流量からの無向フローネットワークの実現 Reviewed

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    電子情報通信学会論文誌   J72-A ( 8 )   1316 - 1326   1989.8

     More details

    Language:Japanese   Publishing type:Research paper (scientific journal)   Publisher:電子情報通信学会  

    CiNii Books

    researchmap

    Other Link: http://hdl.handle.net/10623/33643

  • Realization of a Directed Network from a Subset of the Distance Set Between Vertex Pairs

    Hiroshi Tamura

    Proc. 1989 Joint Tech. Conf. Circuits/Systems, Computers and Comm.   516 - 521   1989.6

     More details

    Language:English   Publisher:電子情報通信学会  

    researchmap

  • On the Voronoi Diagram of a Nondirected Flow Network Reviewed

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda

    Proc. 1988 IEEE International Symposium on Circuits & Systems   ( 2 )   1321 - 1324   1988.6

     More details

    Language:English   Publishing type:Research paper (scientific journal)   Publisher:IEEE  

    researchmap

▼display all

Books

  • Network Engineering

    iroshi TAMURA, Keisuke NAKANO, Masakazu SENGOKU( Role: Joint author)

    CORONA PUBLISHING CO.,LTD.  2020.6 

     More details

    Total pages:144   Language:Japanese   Book type:Textbook, survey, introduction

    researchmap

  • シミュレーション辞典

    日本シミュレーション学会編集委員会( Role: Joint author1項目(2ページ)の解説)

    コロナ社  2012.2 

     More details

    Language:Japanese   Book type:Dictionary, encyclopedia

    researchmap

  • 改訂 電子情報通信用語辞典

    宇都宮敏( Role: Joint author2項目の解説)

    コロナ社  1997.7 

     More details

    Language:Japanese   Book type:Dictionary, encyclopedia

    researchmap

MISC

  • これからの無線通信におけるチャネル割当適応可能なグラフの彩色 Invited Reviewed

    田村裕

    電子情報通信学会 基礎・境界ソサイエティFundamentals Review   15 ( 4 )   291 - 299   2022.4

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)  

    researchmap

  • Consideration on Control of Transmittable Areas in Information Floating for Data Accumulation

    中野敬介, 宮北和之, 田村裕

    電子情報通信学会技術研究報告(Web)   121 ( 97(ICTSSL2021 8-17) )   2021

  • LOCATION OF TRANSMITTABLE AREAS IN INFORMATION FLOATING USING BETWEENNESS

    木村幸輔, 宮北和之, 柄沢直之, 田村裕, 中野敬介

    電子情報通信学会大会講演論文集(CD-ROM)   2021   2021

  • 信号機が情報フローティングに与える影響に関する考察

    宮北和之, 柄沢直之, 田村裕, 中野敬介

    電子情報通信学会大会講演論文集(CD-ROM)   2019   2019

  • 情報フローティングを用いた通行可能マップ生成における送信可能エリアの動的制御に関する一考察

    柄沢直之, 小林航大, 宮北和之, 田村裕, 中野敬介

    電子情報通信学会大会講演論文集(CD-ROM)   2019   2019

  • 情報フローティングを用いた災害時の通行可能マップ生成におけるマップの大きさに関する考察

    柄沢直之, 小林航大, 稲川優斗, 宮北和之, 田村裕, 中野敬介

    電子情報通信学会大会講演論文集(CD-ROM)   2019   2019

  • A consideration on storing of information by Information Floating

    中野敬介, 宮北和之, 柄沢直之, 田村裕

    電子情報通信学会技術研究報告   119 ( 60(ICTSSL2019 1-7) )   2019

  • Reformation of KENKYUKAI toward Next Century!!

    中野義昭, 西山伸彦, 田村裕, 安達雅春, 石原智宏, 粕川秋彦, 斎藤英雄, 井原雅行

    電子情報通信学会誌   101 ( 8 )   940 - 944   2018.9

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:電子情報通信学会  

    researchmap

  • 歩行者自身が障害物になる場合の情報フローティングに関する検討

    柄沢直之, 宮北和之, 中野敬介, 田村裕

    電子情報通信学会大会講演論文集(CD-ROM)   2018   ROMBUNNO.A‐19‐11   2018.3

     More details

    Language:Japanese  

    J-GLOBAL

    researchmap

  • Development and Experimental Evaluation of an Information Floating System

    柄沢 直之, 中谷内 健斗, 蒲生 基司, 宮北 和之, 中野 敬介, 田村 裕

    電子情報通信学会技術研究報告 = IEICE technical report : 信学技報   117 ( 124 )   55 - 60   2017.7

     More details

    Language:Japanese   Publisher:電子情報通信学会  

    J-GLOBAL

    researchmap

  • Invitation to the Technical Committees of the Japan Society for Simulation Technology

    Hiroshi Tamura

    Journal of the Japan Society for Simulation Technology   36 ( 2 )   2017.6

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:Japan Society for Simulation Technology  

    researchmap

  • On the number of channels in wireless networks from the standpoint of graph colorings

    116 ( 92 )   85 - 90   2016.6

     More details

    Language:Japanese  

    researchmap

  • 複数のUAVによるエピデミック情報共有に関する一考察

    柄沢直之, 中野敬介, 宮北和之, 岩崎正幸, 田村裕

    電子情報通信学会大会講演論文集(CD-ROM)   2016   ROMBUNNO.AS‐6‐3   2016.3

     More details

    Language:Japanese  

    J-GLOBAL

    researchmap

  • AS-6-2 On Information Floating in realistic networks

    Kashiwabara Atsushi, Tamura Hiroshi, Matsumoto Shun, Nakano Keisuke

    Proceedings of the IEICE Engineering Sciences Society/NOLTA Society Conference   2016   "S - 75"-"S-76"   2016.3

     More details

    Language:Japanese   Publisher:The Institute of Electronics, Information and Communication Engineers  

    CiNii Books

    researchmap

  • AS-2-11 The maximum number of colors on strong edge coloring for channel assignment in wireless network

    MATSUMOTO Shun, TAMURA Hiroshi

    Proceedings of the IEICE Engineering Sciences Society/NOLTA Society Conference   2015   "S - 31"-"S-32"   2015.8

     More details

    Language:English   Publisher:The Institute of Electronics, Information and Communication Engineers  

    CiNii Books

    researchmap

  • 情報滞留のための滞留場所配置の最適化に関する一考察

    柄沢直之, 中野敬介, 宮北和之, 田村裕

    電子情報通信学会大会講演論文集(CD-ROM)   2015   ROMBUNNO.AS-2-4   2015.8

     More details

    Language:Japanese  

    J-GLOBAL

    researchmap

  • AS-2-4 A Consideration on Optimization of Arrangement of Places where Information is Floated for Information Floating

    Karasawa Naoyuki, Nakano Keisuke, Miyakita Kazuyuki, Tamura Hiroshi

    Proceedings of the IEICE Engineering Sciences Society/NOLTA Society Conference   2015   "S - 17"-"S-18"   2015.8

     More details

    Language:Japanese   Publisher:一般社団法人電子情報通信学会  

    CiNii Books

    researchmap

  • Committees Thinking about the Future of IEICE

    Hiroshi Tamura

    IEICE,Fundamentals Review   8 ( 4 )   214 - 215   2015.4

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:IEICE  

    researchmap

  • AS-3-6 On Property of Information Floating for Guidance

    Karasawa Naoyuki, Kasagi Kyosuke, Nakano Keisuke, Tamura Hiroshi

    Proceedings of the IEICE General Conference   2015   "S - 26"-"S-27"   2015.2

     More details

    Language:Japanese   Publisher:The Institute of Electronics, Information and Communication Engineers  

    CiNii Books

    researchmap

  • 情報通信における理論とシミュレーション

    中野敬介, 宮北和之, 田村裕

    日本シミュレーション学会誌   33 ( 1 )   4 - 8   2014.3

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (scientific journal)   Publisher:日本シミュレーション学会  

    researchmap

  • これからを見据えた情報通信

    田村裕

    日本シミュレーション学会誌   33 ( 1 )   1 - 2   2014.3

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:日本シミュレーション学会  

    researchmap

  • 無線ネットワークとグラフ理論

    田村裕

    電子情報通信学会東京支部学生会報   ( 19 )   19 - 22   2014.3

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)  

    researchmap

  • 「安全・安心な生活のための情報通信システム時限研究専門委員会(ICSSSL)」発足

    Fundamentals Review   15 ( 3 )   253 - 255   2012.3

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:電子情報通信学会  

    researchmap

  • 多次元移動通信網研究委員会

    シミュレーション   30 ( 1 )   46 - 48   2011.3

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:日本シミュレーション学会  

    researchmap

  • 随筆:サブソサイエティの活動

    田村裕

    Fundamentals Review   3 ( 4 )   2 - 3   2010.4

     More details

    Language:Japanese   Publishing type:Article, review, commentary, editorial, etc. (other)   Publisher:電子情報通信学会  

    researchmap

  • Necessity of adjacent terminal-information in Ad-hoc networks

    SEKINE Gen-yuu, MATSUMOTO Noriyoshi, TAMURA Hiroshi, NAKANO Keisuke, SENGOKU Masakazu

    21   43 - 46   2002.6

     More details

    Language:Japanese  

    CiNii Books

    researchmap

  • The Issue of Locating Repeaters in a Mobile Communication Network with Mult-Hop Type

    Watanabe Kaoru, Nakano Keisuke, Tamura Hiroshi, Sengoku Masakazu

    Proceedings of the IEICE General Conference   618 - 618   1997

     More details

    Language:Japanese   Publisher:The Institute of Electronics, Information and Communication Engineers  

    CiNii Books

    researchmap

  • Communication Traffic in CDMA Cellular Mobile Communication Systems

    IWASAWA Shigeo, NAKANO Keisuke, TAMURA Hiroshi, SENGOKU Masakazu

    IEICE technical report. Circuits and systems   95 ( 555 )   67 - 72   1996.3

     More details

    Language:Japanese   Publisher:The Institute of Electronics, Information and Communication Engineers  

    This paper discusses the teletraffic performance of Code Division Multiple Access (CDMA) cellular system. We describe 3 kinds of restrictions on call acceptance. We propose analytical methods for evaluating teletraffic behavior under each of the restrictions. These methods are similar to the way of analyzing performance of Dynamic Channel Assignment in Frequency Division Multiple Access (FDMA) cellular system. It is shown that the numerical results of our methods agree well with computer simulation results.

    CiNii Books

    researchmap

▼display all

Presentations

  • 情報フローティングによる知識共有・検索システムに関する考察

    中野敬介, 宮北和之, 田村裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2023-29,2023年10月  2023.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 多次元ネットワークの近接と近隣による点の中心性

    仙石 正和, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2023-30  2023.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 無線通信におけるチャネル割当を念頭においたグラフ彩色の拡張

    田村裕

    第76回システムとアルゴリズム合同ゼミ  2023.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングによる進入禁止エリア情報の仮想蓄積につい

    中野敬介, 柳町奏太, 宮北和之, 田村裕

    2023年電子情報通信学会ソサイエティ大会,A-18-1  2023.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 異なる移動モデルにおける情報フローティングの自動再開法の評価

    宮北和之, 目黒大地, 田村裕, 中野敬介

    2023年電子情報通信学会ソサイエティ大会,A-18-2  2023.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • Estimating Regions of Japanese Folk Songs Using Machine Learning

    Tatsuki Ioka, Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.54-57  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Base Station Placement for 5th Generation Mobile Communication System Considering Obstacles

    So Katayama and Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.58-61  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Performance evaluation of Japanese traditional drum performance with machine learning

    Koki Kamiyama, Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.62-65  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Effective deployment method of Edge Computer in 5th generation mobile communication systems

    Shun Sasaki, Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.66-69  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • A delivery method using Drone in areas with high aging populations

    Kensuke Shiina, Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.70-73  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Channel assignment in wireless communication and graph distance edge coloring

    Keita Suzuki, Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.74-77  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • The probability of coloring with the maximum number of colors by greedy colorings

    Tatsuya Murayama, Hiroshi Tamura

    The 42nd JSST Annual Conf., Student Session pp.78-81  2023.8 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • グラフの拡張された距離彩色について

    田村裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2023-20  2023.7 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングにおける情報配信場所の制御に関する考察(第2報)

    中野敬介, 宮北和之, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2023-14  2023.7 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフにおける色数が最大となる彩色の出現確率について

    田村裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2023-12  2023.5 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングにおける情報配信場所の制御に関する考察

    中野敬介, 宮北和之, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2023-11  2023.5 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 過疎地域における無人航空機を利用した配達の可能性

    増子 裕斗, 田村 裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集, JSST-MDMC2022-2-03  2023.3 

     More details

  • 第5世代移動通信システムにおける 基地局併設型サーバの効果的な設置手順

    江原 亮太, 田村 裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集, JSST-MDMC2022-2-02  2023.3 

     More details

  • 畳み込みネットワークによる数独の学習の修正と比較

    石井 宏一郎, 田村 裕

    電子情報通信学会回路とシステム研究会,CAS2022-96  2023.3 

     More details

  • 情報フローティングを自動的に再開するための手法に関する考察(第3報)

    宮北和之, 田村 裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2022-31  2023.1 

     More details

  • 呼の終了を想定したチャネル割当とグラフのGrundy coloring

    田村裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2022-32  2023.1 

     More details

  • グラフのマッチング彩色における色数の上限について

    田村裕, 豊田佳奈子, 中野敬介

    日本シミュレーション学会多次元移動通信網研究会講演論文集, JSST-MDMC2022-1-02,  2022.12 

     More details

  • グラフのマッチング彩色における最大色数での彩色方法

    豊田佳奈子,田村 裕

    電子情報通信学会システム数理と応用研究会,MSS2022-30  2022.12 

     More details

  • 情報フローティングを自動的に再開するための手法に関する考察(第2報)

    中野敬介, 宮北和之, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2022-17  2022.10 

     More details

  • Base station placement problem in 5th generation mobile communication systems International conference

    Shoya Kurebayashi, Hiroshi Tamura

    The 41st JSST Annual Conf. Student Session, pp.25-28  2022.9  JSST

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • チャネル干渉を考慮したグラフ彩色とGrundy coloring

    田村 裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2022-15  2022.7  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングを自動的に再開するための手法に関する考察

    中野敬介, 宮北和之, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2022-1  2022.5  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフの距離彩色に関する色数の上限について

    田村裕, 中野敬介

    日本シミュレーション学会多次元移動通信網研究会講演論文集, JSST-MDMC2021-3-03  2022.3  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • グラフのk-距離点彩色とGrundy Number

    田村裕, 中野敬介

    2022年電子情報通信学会総合大会,A-18-14  2022.3 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • ベクトル量子化を利用したDNN(Deep Neural Network)による和太鼓音楽の生成

    岡本 和巳, 田村 裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2021-2-04  2021.12  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • Discrimination of Japanese drum player using machine learning International conference

    Kanako Toyoda, Hirosh Tamura

    The 40th JSST Annual Conf. Student Session, pp.9-12  2021.9  JSST

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Solving Sudoku with Graph Convolutional Networks International conference

    Koichiro Ishii, Hiroshi Tamura

    The 40th JSST Annual Conf. Student Session, pp.21-24  2021.9  JSST

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • On delivery methods using UAV in hilly and mountainous areas International conference

    Yuto Mashiko, Hiroshi Tamura

    he 40th JSST Annual Conf. Student Session, pp.25-28  2021.9  JSST

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • グラフのマッチング彩色の拡張と点彩色の関係

    田村 裕, 中野敬介

    2021年電子情報通信学会ソサイエティ大会,A-18-5  2021.9  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 媒介中心性を用いた情報フローティングの送信可能エリアの配置

    木村幸輔, 宮北和之, 柄沢直之, 田村 裕, 中野敬介

    2021年電子情報通信学会ソサイエティ大会,A-18-8  2021.9  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • データ蓄積のための情報フローティングにおける送信可能エリア制御に関する考察

    中野敬介, 宮北和之, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2021-14  2021.7  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 格子グラフへの色数最大となる点彩色について

    田村 裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2021-13  2021.7  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • A Method for setting up Servers for Edge Computing in Fifth-Generation Mobile Communication Systems International conference

    Ryota Ehara, Hiroshi Tamura

    The 40th JSST Annual Conf. Student Session, pp.17-20  2021.7  JSST

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • 平常時及び災害時におけるエピデミック通信による情報配信について

    柳澤爽太, 田村 裕, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2021-5  2021.5  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 歩行者自身が障害物になる影響を考慮した情報フローティングの理論解析

    柄沢直之, 宮北和之, 田村裕, 中野敬介

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2021-1-02  2021.4  日本シミュレーション学会多次元移動通信網研究会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフの部分彩色と無線通信におけるチャネル割当

    田村 裕, 中野敬介

    2021年電子情報通信学会総合大会,A-18-8  2021.3  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ディープニューラルネットワーク(DNN)による和太鼓のリズム再現

    岡本和巳, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2020-54  2021.1  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングによる通行可能マップ生成における端末の移動距離に関する考察

    里見大征, 宮北和之, 柄沢直之, 田村裕, 中野敬介

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2020-1-9  2020.12  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 和太鼓のリズムと自動演奏システムについて

    趙 涌, 田村 裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2020-1-2  2020.12  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 第五世代移動通信システムにおけるアンテナ配置

    王 暁飛, 田村 裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2020-1-3  2020.12  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 格子状のセンサネットワークにおけるチャネル割当問題

    田村 裕, 中野敬介, 仙石正和

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2020-15  2020.10  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフのリスト彩色と無線通信におけるチャネル割当

    田村 裕, 中野敬介

    2020年電子情報通信学会ソサイエティ大会,A-18-1  2020.9  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • The Number of Colors of Greedy Coloring and Graph Structure Invited

    Iori YUHARA, Hiroshi TAMURA

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2020-7  ( 東京 )   2020.7  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • Considerations on Grundy Coloring and the number of vertices or edges of graphs

    田村 裕, 中野 敬介

    2020年電子情報通信学会総合大会,A-19-14  ( 広島 )   2020.3  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • [Fellow Memorial Lecture] On information communication technology based on graph network theory Invited

    Hiroshi TAMURA

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2019-57  ( 東京 )   2020.1  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Oral presentation (invited, special)  

    researchmap

  • Feature value for Japanese drum rhythm and drum performance support

    Shunsuke Ebihara, Shintaro Sato, Hiroshi Tamura

    The 38th JSST Annual Conf.  ( 宮崎 )   2019.11  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Poster presentation  

    Student Session, pp.50-53

    researchmap

  • Investigation of System for Distribution of Regional-Information using Information Floating

    Mamoru Takano, Hiroshi Tamura

    The 38th JSST Annual Conf.  ( 宮崎 )   2019.11  日本シミュレーション学会

     More details

    Language:Japanese   Presentation type:Poster presentation  

    Student Session, pp.54-57

    researchmap

  • Graph coloring considering release of communication channels and the upper bounds of the number of channels

    Hiroshi TAMURA, Hiromu NARITA, Keisuke NAKANO

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2019-16  ( 大分 )   2019.10  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングを用いた通行可能マップ生成における送信可能エリアの動的制御に関する一考察

    柄沢直之, 小林航大, 宮北和之, 田村 裕, 中野敬介

    2019年電子情報通信学会ソサイエティ大会,A-19-5  ( 大阪 )   2019.9  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • On the realization of Grundy number on minimizing the number of vertices or edges of graphs (Second report)

    Hiroshi TAMURA, Shun MATSUMOTO, Keisuke NAKANO

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2019-13  2019.7  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングによる情報の蓄積に関する考察

    中野敬介, 宮北和之, 柄沢直之, 田村 裕

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2019-1  2019.5 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフの点数や辺数が最小となるGrundy Numberの実現

    田村裕, 松本峻, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会,ICTSSL2019-3  2019.5 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフ彩色におけるGrundy Numberと無線通信のチャネル数について

    冨田祥平, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2018-1-03  ( 新潟 )   2019.3  日本シミュレーション学会多次元移動通信網研究会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングによる作業支援における情報伝達に関する考察

    後藤拓人, 宮北和之, 柄沢直之, 田村裕, 中野敬介

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2018-1-02  ( 新潟 )   2019.3  日本シミュレーション学会多次元移動通信網研究会

     More details

    Language:Japanese   Presentation type:Symposium, workshop panel (public)  

    researchmap

  • 情報フローティングにおける信号の影響に関する考察

    相田遥菜, 宮北和之, 柄沢直之, 田村裕, 中野敬介

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2018-1-01  ( 新潟 )   2019.3  日本シミュレーション学会多次元移動通信網研究会

     More details

    Language:Japanese   Presentation type:Symposium, workshop panel (public)  

    researchmap

  • Grundy Coloring における点数や辺数を最小とするグラフについて

    田村裕, 松本峻, 中野敬介

    2019年電子情報通信学会総合大会,ANS-1-6  ( 東京 )   2019.3  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Symposium, workshop panel (public)  

    researchmap

  • 情報フローティングを用いた災害時の通行可能マップ生成におけるマップの大きさに関する考察

    柄沢直之, 小林航大, 稲川優斗, 宮北和之, 田村 裕, 中野敬介

    2019年電子情報通信学会総合大会,A-19-12  ( 東京 )   2019.3  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Symposium, workshop panel (public)  

    researchmap

  • 信号機が情報フローティングに与える影響に関する考察

    宮北和之, 柄沢直之, 田村 裕, 中野敬介

    2019年電子情報通信学会総合大会,A-19-11  ( 東京 )   2019.3  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Symposium, workshop panel (public)  

    researchmap

  • 和楽器における機械学習を用いた演奏支援システムの開発

    佐藤信太郎, 海老原俊輔, 田村裕

    日本シミュレーション学会AI研究会講演論文集,JSST-AI-2018-1-02  2018.12  日本シミュレーション学会AI研究会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • エピデミック通信における被覆問題を用いた情報源端末の巡回法

    高野守, 柏原篤志, 田村裕, 中野敬介, 仙石正和

    電子情報通信学会回路とシステム研究会, CAS2018-82  2018.12  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報フローティングのプロトタイプシステムの開発と実験的評価 Invited

    中谷内健斗, 柄沢直之, 宮北和之, 中野敬介, 田村裕

    第28回電気学会東京支部新潟支所研究発表会予稿集, NGT-18-312, p.37  2018.11  電気学会東京支部新潟支所

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフのGrundy Coloringに関するいくつかの結果について

    田村 裕, 松本 峻, 中野敬介

    電子情報通信学会安全・安心な生活とICT研究会, ICTSSL2018-29  ( 高松市 )   2018.10  電子情報通信学会

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • Graph Coloring assuming Release of Communication Channel

    田村 裕, 松本 峻, 中野敬介

    2018年電子情報通信学会ソサイエティ大会  2018.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • Machine learning and extraction of features in Japanese musical instruments International conference

    Shintaro Sato, Syunsuke Ebihara, Hiroshi Tamura

    The 37th JSST Annual Conf.  2018.9 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Feature value extraction for Japanese drum rhythm and evaluation using Machine learning International conference

    Shunsuke Ebihara, Shintaro Sato, Hiroshi Tamura

    The 37th JSST Annual Conf.  2018.9 

     More details

    Language:Japanese   Presentation type:Poster presentation  

    researchmap

  • Relationship between graph coloring and channel assignment in wireless communication

    田村 裕, 松本 峻, 中野 敬介

    電子情報通信学会安全・安心な生活とICT研究会  2018.7 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報源の移動に伴うエピデミック通信における情報の拡散

    高野守, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2017-2-02  2018.3 

     More details

    Language:Japanese  

    researchmap

  • UAVによる食品の配達とネットワーク理論における配置問題

    田村裕, 菅沼大介, 中野敬介

    電子情報通信学会総合大会,A-19-9  2018.3 

     More details

    Language:Japanese  

    researchmap

  • 歩行者自身が障害物になる場合の情報フローティングに関する検討

    柄沢直之, 宮北和之, 中野敬介, 田村 裕

    電子情報通信学会総合大会,A-19-11  2018.3 

     More details

    Language:Japanese  

    researchmap

  • 心理状況を考慮した都市部における避難シミュレーション

    楠橋 淳, 田村 裕

    電子情報通信学会安全・安心な生活のためのICT研究会,ICTSSL2017-50  2018.1 

     More details

    Language:Japanese  

    researchmap

  • 市街地のIoT化に向けたアドホックネットワークに関する基礎研究

    上倉央幹, 田村 裕

    電子情報通信学会安全・安心な生活のためのICT研究会,ICTSSL2017-51  2018.1 

     More details

    Language:Japanese  

    researchmap

  • Development and Experimental Evaluation of an Information Floating System

    柄沢直之, 中谷内健斗, 蒲生基司, 宮北和之, 中野敬介, 田村 裕

    電子情報通信学会安全・安心な生活のためのICT研究会, ICTSSL2017-27  2017.7 

     More details

    Language:Japanese  

    researchmap

  • On the number of channels in wireless networks and graph colorings

    田村 裕, 松本 峻, 佐藤, 郁弥, 中野 敬介

    日本シミュレーション学会合同研究会, JSST-MDMC2017-1-08  2017.6 

     More details

    Language:Japanese  

    researchmap

  • 充電時間を考慮した無人航空機による配達方法の検討

    原竜太郎, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2016-1-01  2017.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ネットワーク理論における被覆問題の情報滞留への適用に関する考察

    柏原篤志, 松本峻, 田村裕, 中野敬介, 仙石正和

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2016-1-02  2017.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • RPLにおけるホットスポット問題低減手法の考察

    河村祐志, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集,JSST-MDMC2016-1-05  2017.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 心理状況を考慮した避難行動の考察

    楠橋 淳, 田村 裕

    電子情報通信学会総合大会,A-19-18  2017.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • [依頼講演]グラフ理論によるモデル化とは

    田村 裕

    電子情報通信学会総合大会,AS-1-2  2017.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ウェアラブル端末を用いた地域見守りシステムの提案

    上倉 央幹, 田村 裕

    電子情報通信学会安全・安心な生活のためのICT研究会,ICTSSL2016-48  2017.1 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 情報滞留へのネットワーク理論における被覆問題の適用について

    柏原篤志, 田村 裕, 中野敬介

    2016年電子情報通信学会基礎・境界ソサイエティ大会,A-19-11  2016.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • On the number of channels in wireless networks from the standpoint of graph colorings

    Hiroshi TAMURA, Shun MATSUMOTO, Keisuke NAKANO

    ICTSSL2016-15, ICTSSL,IEICE  2016.6 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • スマートな情報通信へのネットワーク理論の応用

    Hiroshi Tamura

    ICT-SG, IEICE  2016.6 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • UAVを用いたエピデミック情報共有の評価に関する一考察

    柄沢直之, 中野敬介, 岩崎正幸, 宮北和之, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集  2016.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 定員情報を利用した避難誘導について

    楠橋淳, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集  2016.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • エネルギーハーベスティングを考慮したルーティングプロトコルの応用例

    上倉央幹, 田村裕

    日本シミュレーション学会多次元移動通信網研究会講演論文集  2016.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 被災者の往来を想定したアドホックネットワークを用いた災害地域の巡回

    新井宏典, 田村 裕

    2016年電子情報通信学会総合大会  2016.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 現実的ネットワークにおける情報滞留について

    柏原篤志, 田村 裕, 松本 峻, 中野敬介

    2016年電子情報通信学会総合大会  2016.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 複数のUAVによるエピデミック情報共有に関する一考察

    柄沢直之, 中野敬介, 宮北和之, 岩崎正幸, 田村 裕

    2016年電子情報通信学会総合大会  2016.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • パブリックスペースを考慮した情報滞留について

    柏原 篤志, 松本 峻, 田村 裕, 柄沢 直之, 中野 敬介

    電子情報通信学会安全・安心な生活のための情報通信システム研究会  2015.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • UAVを用いたエピデミック伝送による情報共有に関する考察

    岩崎正幸, 柄沢直之, 中野敬介, 宮北和之, 田村裕

    電子情報通信学会安全・安心な生活のための情報通信システム研究会  2015.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • A Consideration on Optimization of Arrangement of Places where Information is Floated for Information Floating

    Naoyuki Karasawa, Keisuke Nakano, Kazuyuki Miyakita, Hiroshi Tamura

    2015年電子情報通信学会基礎・境界ソサイエティ大会,AS-2-4  2015.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • The maximum number of colors on strong edge coloring for channel assignment in wireless network

    Shun MATSUMOTO, Hiroshi TAMURA

    2015年電子情報通信学会基礎・境界ソサイエティ大会  2015.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • プローブエピデミック伝送による情報滞留について

    柄沢直之, 中野敬介, 笠木響介, 田村裕

    日本シミュレーション学会多次元移動通信網研究会,pp.10-13  2015.3 

     More details

    Language:Japanese  

    researchmap

  • アドホックネットワークにおける端末位置情報を用いた限定的経路探索の考察

    柏原篤志, 田村裕

    日本シミュレーション学会多次元移動通信網研究会,pp.14-19  2015.3 

     More details

    Language:Japanese  

    researchmap

  • センサネットワークにおけるRPLの負荷分散手法

    紙透航志, 田村裕

    日本シミュレーション学会多次元移動通信網研究会,pp.20-25  2015.3 

     More details

    Language:Japanese  

    researchmap

  • アドホックネトワークを用いた効率的な災害地域の巡回方法

    新井宏典, 田村裕

    日本シミュレーション学会多次元移動通信網研究会,pp.26-29  2015.3 

     More details

    Language:Japanese  

    researchmap

  • 誘導を行うための情報滞留の性質に関する考察

    柄沢直之, 笠木響介, 中野敬介, 田村 裕

    電子情報通信学会総合大会,AS-3-6  2015.3 

     More details

    Language:Japanese  

    researchmap

  • グラフのマッチングに関連した辺彩色を用いたチャネル割当とその有効性

    野村 駿, 田村 裕, 篠田 庄司

    電子情報通信学会安全・安心な生活のための情報通信システム研究会, pp.42-45  2014.10 

     More details

    Language:Japanese  

    researchmap

  • DTNにおける情報滞留のためのプローブエピデミック伝送について

    笠木 響介, 柄沢 直之, 宮北 和之, 中野 敬介, 田村 裕

    電子情報通信学会安全・安心な生活のための情報通信システム研究会, pp.46-49  2014.10 

     More details

    Language:Japanese  

    researchmap

  • アドホックネットワークのルーティングにおける端末の位置情報の有効性

    荒幡 和則, 新井 宏典, 田村 裕

    電子情報通信学会安全・安心な生活のための情報通信システム研究会, pp.42-45  2014.6 

     More details

    Language:Japanese  

    researchmap

  • 共用可能な超小型パーソナルビークルの自動乗り継ぎによるエネルギマネジメント手法に関する基礎検討

    中村壮亮, 鈴木泰斗, 今西淳一, 新井雅海, 田村裕, 橋本秀紀

    ロボティクス・メカトロニクス講演会2014 in Toyama, 3P1-U01  2014.5 

     More details

    Language:Japanese  

    researchmap

  • On a modeling of the problem for micro personal vehicle by automatic replacement

    田村 裕, 中村壮亮, 橋本秀紀

    電子情報通信学会2014年総合大会  2014.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • On a consideration of the number of channels on multi-hop wireless network

    田村 裕, 仙石正和, 篠田庄司

    電子情報通信学会2014年総合大会  2014.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフの辺彩色を用いたアドホックネットワークにおける希望波対干渉波比の評価

    野村駿, 田村 裕, 篠田 庄司

    電子情報通信学会安全・安心な生活のための情報通信システム研究会  2013.12 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • アドホックネットワークにおけるネットワークコーディングを用いたルーティングプロトコルと端末の負荷分散

    名達明裕, 田村裕, 篠田庄司

    電子情報通信学会安全・安心な生活のための情報通信システム研究会  2013.6 

     More details

    Language:Japanese  

    researchmap

  • コグニティブ無線を適用したチャネル割当に応用される辺彩色の評価

    芦田雄祐, 野村駿, 田村裕, 篠田庄司

    日本シミュレーション学会多次元移動情報通信網研究会  2013.6 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 並列分散システムにおけるデータ配信アルゴリズムのステップ数について

    小嶋貴明, 田村裕, 仙石正和, 篠田庄司

    平成22年度信越支部大会講演論文集/電子情報通信学会  2010.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 並列分散システムにおけるデータ配信アルゴリズム

    小嶋貴明, 田村裕, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  2010.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 拡張された並列分散システムにおけるブロードキャストスケジューリング

    小嶋貴明, 田村裕, 仙石正和, 篠田庄司

    平成21年度信越支部大会講演論文集/電子情報通信学会  2009.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ネットワークコーディングを用いた通信の効率化に関する考察

    長谷川誠, 田村裕, 仙石正和, 篠田庄司

    平成21年度信越支部大会講演論文集/電子情報通信学会  2009.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 無線通信におけるネットワークコーディングを用いた情報転送の効率化について

    長谷川誠, 田村裕, 仙石正和, 篠田庄司

    第28回日本シミュレーション学会大会発表論文集/日本シミュレーション学会  2009.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マルチホップ無線ネットワークにおけるサービスエリアの形状と端末の関係について

    間嶋大介, 田村裕, 仙石正和, 篠田庄司

    第11回多次元移動通信網研究会/日本シミュレーション学会  2008.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マルチホップ無線ネットワークにおけるサービスエリアの形状の影響

    間嶋大介, 田村裕, 仙石正和, 篠田庄司

    平成20年度信越支部大会講演論文集/電子情報通信学会  2008.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マルチホップ無線ネットワークにおけるアクセスポイントに接続する端末数の制限について

    山口陽一郎, 田村裕, 仙石正和, 篠田庄司

    平成20年度信越支部大会講演論文集/電子情報通信学会  2008.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マルチホップ無線ネットワークのアクセスポイントへ接続する端末数について

    山口陽一郎, 田村裕, 仙石正和, 篠田庄司

    第27回日本シミュレーション学会大会発表論文集/日本シミュレーション学会  2008.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • ネットワークコーディングに関連したグラフの辺彩色問題

    田村裕, 仙石正和, 篠田庄司

    2008年総合大会講演論文集/電子情報通信学会  2008.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ネットワークコーディングとグラフの辺彩色問題について

    田村裕, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  2007.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • インターネットの性質を満たしたランダムグラフの構成法に関する考察

    大江好史

    平成19年度信越支部大会講演論文集/電子情報通信学会  2007.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • インターネットにおける次数列とその他の特性値を満たすグラフの生成手法に関する考察

    中村太郎

    平成18年度信越支部大会講演論文集/電子情報通信学会  2006.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 無線アドホックネットワークにおけるチャネル利用に関する一検討

    中村 高士, 田村 裕, 仙石 正和

    平成17年度信越支部大会講演論文集/電子情報通信学会  2005.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マルチホップ無線中継局配置とサービスエリアの拡大に関する考察

    谷崎良一, 田村 裕, 仙石正和, 篠田庄司

    多次元移動情報通信網自動設計技術ワークショップ講演論文集/日本シミュレーション学会  2005.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 駐車場の効率的な除雪に関する一考察

    田村裕, 富永禎秀

    日本雪工学会誌/日本雪工学会  2004.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マルチホップワイヤレスネットワークにおける最小木を用いた情報配信について

    谷崎良一, 田村裕, 仙石正和

    平成16年度信越支部大会講演論文集/電子情報通信学会  2004.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • Betweenness を用いたスケールフリーネットワークの解析

    本間規朗, 田村 裕, 中野敬介, 仙石正和

    平成16年度信越支部大会講演論文集/電子情報通信学会  2004.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ある種の並列分散システムにおけるブロードキャストスケジューリング

    田村裕, 田崎太, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  2004.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 広域クラスタにおけるブロードキャストスケジューリングについて

    田崎 太, 田村 裕, 仙石正和, 篠田庄司

    第16回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  2003.4 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • [招待論文]グラフ理論,確率幾何学の移動通信への応用

    田村 裕, 中野敬介, 仙石正和, 篠田庄司

    技術研究報告(モバイルマルチメディア通信)/電子情報通信学会  2003.1 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 異種クラスタシステムのブロードキャストスケジューリングに関する一考察

    田崎 太, 田村 裕, 仙石正和, 篠田庄司

    技術研究報告(モバイルマルチメディア通信)/電子情報通信学会  2003.1 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マルチホップ無線通信におけるチャネル割当に関する一考察

    田村裕, 谷崎良一, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  2002.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マルチホップワイヤレスネットワークにおける移動を考慮した情報配信の方法

    関根元裕, 田村 裕, 中野敬介, 仙石正和

    平成14年度信越支部大会講演論文集/電子情報通信学会  2002.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 干渉を考慮したマルチホップワイヤレスネットワークにおけるチャネル割当問題

    雅楽史人

    平成14年度信越支部大会講演論文集/電子情報通信学会  2002.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • アドホックネットワークにおける隣接端末情報の必要性

    関根元裕

    第21回日本シミュレーション学会大会発表論文集/日本シミュレーション学会  2002.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • チャネル数を考慮した無線アドホックネットワークの情報配信問題

    松本至由

    第20回日本シミュレーション学会大会発表論文集/日本シミュレーション学会  2001.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • タブーサーチを用いたセルラ移動通信系におけるチャネル割当

    池田学哲, 田村裕

    第10回電気学会東京支部新潟支所研究発表会予稿集/電気学会  2000.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • [招待論文]グラフ理論, 確率幾何学とモバイルコミュニケーション

    仙石 正和, 田村裕, 中野 敬介

    技術研究報告(アンテナ伝搬)/電子情報通信学会  2000.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 彩色ネットワークにおけるリソース数の最小化について

    星野 忠之

    第19回日本シミュレーション学会大会発表論文集/日本シミュレーション学会  2000.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • ユニバーサルアドホックネットワークにおける情報配信アルゴリズムのグラフ理論的考察

    森山俊行

    第19回日本シミュレーション学会大会発表論文集/日本シミュレーション学会  2000.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • アドホックネットワークにおける情報配信問題へのグラフ理論的アプローチ

    田村裕, 間瀬憲一, 仙石正和, 篠田庄司

    技術研究報告(情報ネットワーク)/電子情報通信学会  2000.4 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • [招待]移動体通信分野におけるグラフ・ネットワーク理論

    仙石正和, 田村 裕, 間瀬憲一, 篠田庄司

    第13回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  2000.4 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ユニバーサル・アドホックネットワークの検討 -木状ネットワークに対する情報配信アルゴリズム

    角田智之

    2000年総合大会講演論文集/電子情報通信学会  2000.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • NP-Completeness of the k-spanner problem in flow networks

    Kaoru Watanabe, Hiroshi Tamura, Masakazu Sengoku

    技術研究報告(回路とシステム)/電子情報通信学会  2000.1 

     More details

    Language:English   Presentation type:Oral presentation (general)  

    researchmap

  • 時間限界値をもつ最小コスト木問題の一考察

    篠宮紀彦, 田村 裕, 渡部 和

    技術研究報告(回路とシステム)/電子情報通信学会  2000.1 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 〔特別招待講演〕グラフ・ネットワーク理論の倉庫の片隅に積まれている問題

    篠田庄司, 田村裕, 仙石正和

    技術研究報告(回路とシステム)/電子情報通信学会  2000.1 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 無向フローネットワークのminimax実現問題の一般化について

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(回路とシステム)/電子情報通信学会  1999.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • フローネットワークの分割被覆問題

    増一之, 田村裕, 仙石正和

    平成11年度信越支部大会講演論文集/電子情報通信学会  1999.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 点数制限のついたメディアン問題について

    楊麗娟, 田村裕, 仙石正和

    平成11年度信越支部大会講演論文集/電子情報通信学会  1999.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • セルラ移動通信と割当問題

    田村裕, 渡辺郁, 仙石正和, 篠田庄司

    1999年ソサイエティ大会(基礎・境界)講演論文集/電子情報通信学会  1999.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • グラフ・ネットワーク理論とその応用の今後

    仙石正和, 田村裕, 篠田 庄司

    技術研究報告(回路とシステム)/電子情報通信学会  1999.1 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 最短時間配送問題の点集合分割を用いた解の改善法について

    並松孝浩

    平成10年度信越支部大会講演論文集/電子情報通信学会  1998.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • いくつかの要求を満足する無向フローネットワークの実現について

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(回路とシステム)/電子情報通信学会  1998.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 要求値との差の最大値を最小化するフローネットワークの実現について

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    1998年ソサイエティ大会(基礎・境界)講演論文集/電子情報通信学会  1998.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 有向グラフのカット被覆問題とその応用

    渡辺郁, 田村裕, 中野敬介, 仙石正和

    1998年ソサイエティ大会(基礎・境界)講演論文集/電子情報通信学会  1998.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ある種の配送問題の集合分割による解法の解析

    並松孝浩

    技術研究報告(回路とシステム)/電子情報通信学会  1997.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マークグラフ上へ実現可能な同期距離の性質について

    伊藤敦子

    技術研究報告(回路とシステム)/電子情報通信学会  1997.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • センタが複数ある場合の配送問題の解析について

    並松孝浩

    平成9年度信越支部大会講演論文集/電子情報通信学会  1997.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 同期距離が等しいマークグラフの構造について

    伊藤敦子

    平成9年度信越支部大会講演論文集/電子情報通信学会  1997.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マークグラフ上への同期距離の実現に関する一考察

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(回路とシステム)/電子情報通信学会  1997.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • The Covering Problem in the p-Collection Problem

    Kaoru Watanabe, Masakazu Sengoku, Hiroshi Tamura, Shoji Shinoda

    第10回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1997.4 

     More details

    Language:English   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ネットワークにおけるある種の配送問題について

    田村裕他

    1997年総合大会講演論文集/電子情報通信学会  1997.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マルチホップ型移動通信網の中継局配置問題

    渡辺 郁, 中野敬介, 田村裕, 仙石正和

    1997年総合大会講演論文集/電子情報通信学会  1997.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マルチホップ型移動通信網における1つのスケジューリング問題

    渡辺郁他

    第2回ユニバーサル・パーソナル通信基礎研究会論文集/電子情報通信学会  1997.3 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 移動通信系におけるいくつかの問題の計算幾何学とグラフ理論を用いた定式化

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    第1回ユニバーサル・パーソナル通信基礎研究会論文集/電子情報通信学会  1996.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • フローネットワークにおける拡張された被覆問題について

    田村 裕, 菅原秀仁, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  1996.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラ移動体通信における計算幾何学とグラフ理論の役割

    仙石正和, 田村裕, 篠田庄司

    研究報告(数理モデル化と問題解決)96-MPS-9-5/情報処理学会  1996.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラ移動通信系における遺伝的アルゴリズムを用いたセル構成

    石栗治郎

    平成8年度信越支部大会講演論文集/電子情報通信学会  1996.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ダイナミックチャネル割当てのクリークパッキングによる特徴付け

    中野敬介

    多次元移動情報ネットワーク研究会技術研究報告, MMIN96-14/電子情報通信学会  1996.4 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 各点で要求するフローの異なる場合の被覆問題

    菅原秀仁, 田村裕, 仙石正和, 篠田庄司

    第9回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1996.4 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • CDMAを用いた移動通信系における通信トラヒック

    岩沢薫夫, 中野敬介, 田村裕, 仙石正和

    技術研究報告(回路とシステム)/電子情報通信学会  1996.3 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • フローネットワークのロケーション問題の一考察

    渡辺 郁, 田村 裕, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  1996.1 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 移動通信系における位置登録に関するグラフ理論的考察

    堀川輝男, 田村裕, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  1995.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 端子容量行列を表現するフローネットワークの構造について

    田村裕他

    技術研究報告(回路とシステム)/電子情報通信学会  1995.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラCDMAシステムにおける通信トラヒックに関する考察

    岩澤薫夫, 中野敬介, 田村裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • セルラ移動通信系におけるクリークパッキングの呼損率解析

    川村一久, 中野敬介, 田村裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 移動通信における位置登録に関するグラフ理論的考察

    堀川輝男, 田村 裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 端子容量行列を実現するネットワークの構造

    佐藤良平, 田村裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • フローネットワークにおけるp-回収問題の近似アルゴリズムの考察

    渡辺郁, 田村 裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • フレキシブルハイブリッドチャネル割当法に関する一考察

    保崎次哉, 嶋田一彦, 田村裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • リユースパーティションにおける再配置接続法を用いたダイナミックチャネル割当法に関する一考察

    渡辺威, 嶋田一彦, 田村裕, 仙石正和

    平成7年度信越支部大会講演論文集/電子情報通信学会  1995.10 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 移動体の進行方向を考慮したチャネル割当法に関する一考察

    川村一久, 中野敬介, 田村裕, 仙石正和

    技術研究報告(回路とシステム)/電子情報通信学会  1995.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • The Problem of where to Locate p-Sinks in a Flow Network: Complexity Approach

    Kaoru Watanabe, Hiroshi Tamura, Masakazu Sengoku

    第8回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1995.4 

     More details

    Language:English   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 同期距離のマークグラフ上への実現について

    田村裕他

    1995年総合大会講演論文集/電子情報通信学会  1995.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 端子容量行列を表現するフローネットワークのもつ性質について

    田村裕他

    技術研究報告(回路とシステム)/電子情報通信学会  1994.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 初等端子容量行列で表現されるネットワークの構造

    佐藤良平, 田村裕, 仙石正和

    平成6年度信越支部大会予稿集/電子情報通信学会  1994.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 無向フローネットワークによる網の故障対策に関する考察

    堀川輝男, 田村裕, 仙石正和

    平成6年度信越支部大会予稿集/電子情報通信学会  1994.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラ移動通信系におけるハイブリッドチャネル割当法について

    石井勝, 中野敬介, 田村裕, 仙石正和

    平成6年度信越支部大会予稿集/電子情報通信学会  1994.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 遺伝的アルゴリズムを用いたチャネル割当に関する考察

    阿部智, 他

    平成6年度信越支部大会予稿集/電子情報通信学会  1994.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 遺伝的アルゴリズムを用いたセルラ移動通信系におけるダイナミックチャネル割当に関する一考察

    阿部智, 他

    技術研究報告(回路とシステム)/電子情報通信学会  1994.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 無向フローネットワークにおける被覆問題のマトロイド理論を用いた考察

    安斎伸一朗, 田村裕, 仙石正和

    技術研究報告(回路とシステム)/電子情報通信学会  1994.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 移動通信における周波数の有効利用に関連したグラフの彩色問題

    田村 裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(回路とシステム)/電子情報通信学会  1994.6 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マークグラフにおける故障診断についての一考察

    三神潔, 他

    技術研究報告(コンカレント工学)/電子情報通信学会  1994.4 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • フローネットワークの出口配置問題

    渡辺 郁, 田村 裕, 仙石正和

    第7回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1994.4 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • セル構造と電波干渉を考慮したダイナミックチャネル割当法

    石井勝, 他

    技術研究報告(交換システム)/電子情報通信学会  1994.4 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 無向フローネットワークにおけ2ルートフローに関する考察

    安斎伸一朗, 田村裕, 仙石正和

    平成5年度信越支部大会予稿集/電子情報通信学会  1993.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 新規サービスエリアにおけるセル構成に関する考察

    石井 勝, 田村 裕, 仙石正和

    平成5年度信越支部大会予稿集/電子情報通信学会  1993.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 木の重み付き伝送数列

    渡辺 郁, 仙石正和, 田村裕

    技術研究報告(回路とシステム)/電子情報通信学会  1993.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • ニューラルネットワークを用いた寸法の異なるVLSIモジュールの配置手法

    山口章他

    技術研究報告(回路とシステム)/電子情報通信学会  1993.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラー移動通信系におけるボロノイ図を用いたセル構成法に関する一考察

    石井 勝, 田村 裕, 仙石正和, 山口芳雄

    技術研究報告(回路とシステム)/電子情報通信学会  1993.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 端子容量行列から実現されるネットワーク構造について

    田村裕, 他

    1993年秋季大会講演論文集/電子情報通信学会  1993.9 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 距離又は容量の範囲を点間に与えた場合の無向フローネットワークの実現について

    田村裕, 仙石正和, 阿部武雄

    平成4年度信越支部大会予稿集/電子情報通信学会  1992.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 一部の最大流量フローネットワークにおける被覆問題に関する一研究

    川上博他

    技術研究報告(回路とシステム)/電子情報通信学会  1992.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 寸法に制約をもつVLSIモジュールのニューラルネットワークを用いた配置手法

    山口 章, 田村 裕, 山口芳雄, 仙石正和

    技術研究報告(非線形問題)/電子情報通信学会  1992.5 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 移動通信のダイナミックチャネル割当法に関する考察

    中野敬介

    平成3年度信越支部大会予稿集/電子情報通信学会  1991.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • ネットワークのロケーション問題に関する一考察

    田村 裕, 仙石正和, 阿部武雄

    平成3年度信越支部大会予稿集/電子情報通信学会  1991.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 枝にコストを持つ無向フローネットワークにおけるメディアン問題について

    山口章他

    平成3年度信越支部大会予稿集/電子情報通信学会  1991.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • フローネットワークのいくつかの被覆問題について

    田村 裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(フォールトトレラントシステム)/電子情報通信学会  1991.5 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • convexコスト関数を持つ木状ネットワークのp-メディアン問題について

    栃原謙, 他

    第4回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1991.4 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 非線形コスト関数をもつネットワークにおけるロケーション問題について

    栃原謙, 他

    技術研究報告(非線形問題)/電子情報通信学会  1990.11 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラー移動通信系におけるチャネル割当とグラフの次数彩色について

    田村 裕, 仙石正和, 阿部武雄

    平成2年度信越支部大会予稿集/電子情報通信学会  1990.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • Location Problems on Undirected Flow Networks

    Hiroshi Tamura, Masakazu Sengoku, Shoji Shinoda, Takeo Abe

    第3回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1990.5 

     More details

    Language:English   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • マークグラフの構造と同期距離について

    斎藤聡他

    1990年春季全国大会講演論文集/電子情報通信学会  1990.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • ネットワーク上の最適勢力圏図と最小コスト循環フロー問題

    田村 裕, 仙石正和, 篠田庄司, 阿部武雄

    1990年春季全国大会講演論文集/電子情報通信学会  1990.3 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 無向フローネットワークにおけるロケーション問題

    田村裕, 仙石正和, 阿部武雄

    平成元年度信越支部大会予稿集/電子情報通信学会  1989.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • マークグラフの構造と同期距離について

    斎藤 聡, 田村 裕, 仙石正和, 阿部武雄

    平成元年度信越支部大会予稿集/電子情報通信学会  1989.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • セルラー移動通信系の電波干渉を考慮したチャネル割当とグラフの彩色問題

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(回路とシステム)/電子情報通信学会  1989.7 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 容量空間における最適勢力圏図

    田村裕, 仙石正和, 篠田庄司, 阿部武雄

    第2回回路とシステム軽井沢ワークショップ講演論文集/電子情報通信学会  1989.5 

     More details

    Language:Japanese   Presentation type:Public lecture, seminar, tutorial, course, or other speech  

    researchmap

  • 一部の最大流量が与えられた場合の無向フローネットワークの実現

    田村 裕, 仙石正和, 篠田庄司, 阿部武雄

    技術研究報告(回路とシステム)/電子情報通信学会  1988.7 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 木状の無向フローネットワークのVoronoi図を求めるアルゴリズム

    田村裕, 仙石正和

    昭和62年度会信越支部大会予稿集/電子情報通信学会  1987.10 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

  • 無向フローネットワークにおけるVoronoi図に関する考察

    田村裕, 仙石正和, 篠田庄司

    技術研究報告(回路とシステム)/電子情報通信学会  1987.9 

     More details

    Language:Japanese   Presentation type:Oral presentation (general)  

    researchmap

▼display all

Awards

  • 電子情報通信学会フェロー称号

    2019.3   電子情報通信学会  

  • 電子情報通信学会通信ソサイエティ功労顕彰状

    2018.9   電子情報通信学会通信ソサイエティ  

  • JSST2014 International Conference on Simulation Technology Outstanding Presentation Award

    2015.3   Japan Society for Simulation Technology   Upper bounds of the number of channels on multi-hop wireless networks and the estimation with computer simulation

  • JSST2012 International Conference on Simulation Technology Outstanding Presentation Award

    2013.3   Japan Society for Simulation Technology   Generalization of an edge coloring of graphs and channel|rn|assignment problem on multi-hop wireless networks

  • "Best Paper Award, IEICE"

    1998.5   "Institute of Electronics, Information and Communication Engineers"   On a Generalization of a Covering Problem Called Single Cover on Undirected Flow Networks

  • "Best Paper Award, IEICE"

    1996.5   "Institute of Electronics, Information and Communication Engineers"   フローネットワークの出口配置問題

  • "Best Paper Award, IEICE"

    1992.5   "Institute of Electronics, Information and Communication Engineers"   Location Problems on Undirected Flow Networks

▼display all

Research Projects

  • Estimation of Human Sleepiness based on Intelligent Spaces and Machine Learning

    Grant number:20H04266  2020.4 - 2023.3

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)  Chuo University

      More details

    Grant amount: \18070000 ( Direct Cost: \13900000 、 Indirect Cost: \4170000 )

    researchmap

  • Modeling of multi-hop wireless networks with network coding and datatransfer algorithms

    Grant number:22560396  2010 - 2012

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (C) 

    TAMURA Hiroshi

      More details

    Grant amount: \2600000 ( Direct Cost: \2000000 、 Indirect Cost: \600000 )

    We expended the edge coloring problem on graph theory for modeling the data transfer problem of the multi-hop wireless networks. We obtained the some theorems of the new edge coloring problem. We proposed a data transfer algorithm in multi-hop wireless ne

    researchmap

  • Dynamic Network Control to Prevent System Failures in Multi-hop Wireless Networks

    Grant number:16206039  2004 - 2007

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (A)  Niigata University

    SENGOKU Masakazu, NAKANO Keisuke, TAMURA Hiroshi, MASE Kenichi, KARASAWA Naoyuki

      More details

    Grant amount: \46280000 ( Direct Cost: \35600000 、 Indirect Cost: \10680000 )

    In multi-hop wireless networks, the network is not guaranteed to be connected, and the topology of the network changes with time because positions of nodes often change and some nodes leave the network because of mobility of nodes. Due to such change of the topology, performance of the network is sometimes degraded. Furthermore, if the network consists of general terminals, malicious nodes may enter the network and attack the network intentionally. As a result, the network may fail to function properly. Because recent network systems have to provide sufficient reliability as well as broadband environments, we have to overcome such problems which cause system failures. With these things as background, the purpose of this project is to develop network control methods to overcome such problems and improve reliability of multi-hop wireless networks. The following are the results: We showed that effects of failure of terminals due to computer viruses on performance of wireless multi-hop networks, and proposed some methods to prevent spread of viruses in the network. Also, we proposed topology control methods with relaying stations to improve reliability, and evaluated the proposed methods. Also, we proposed charging rewarding methods for load balancing and evaluated the proposed methods. Furthermore, we developed and evaluated some optimization methods and protocols to improve reliability.

    researchmap

  • Research on Neural Network Based Dynamic Channel Assignment Systems in Cellular Mobfle Communication Systems

    Grant number:10555126  1998 - 2001

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (B)  NIIGATA UNIVERSITY

    SENGOKU Masakazu, NAKANO Keisuke, SATO Takuro, OKADA Kazunori, SHINODA Shoji, YAMADA Yoshihide

      More details

    Grant amount: \12400000 ( Direct Cost: \12400000 )

    Because demand for mobile communication services rapidly increases, the efficient use of frequency bands is an important issue. For the efficient use of the frequency bands, mobile communication networks should be highly optimized. Also, it is neciessary to apply intelligent control methods to mobile communication networks. To optimize the mobile networks, we must solve some NP complete problems quiclfly. For this purpose,neural networks and generic algorithms can be used, and it is very important to develop quick dynamic channel assignment systems using neural networks and genetic algorithms. The objective of this project is to develop dynamic channel assignment systems using neural networks and genetic algorithms, and to evaluate performance of the systems. It is considered that we can apply parallel computation systems consisting of some CPUs to dynamic channel assignment systems. Hence, this project develops dynamic channel assignment systems based on neural networks or genetic algorithms with parallel computation. This project has developed such systems for dynamic channel assignment. Through the evaluation process, we confirmed performance improvement by using the developed method. Also, we examined channel assignment methods to adapt to traffic fluctuation caused by vehicles' traffic fluctuation. Also, this project developed an approximate method to theoretically analyze communication traffic characteristics of dynamic channel assignment methods considering mobility. Other optimization problems and fundamental problems to improve mobile communication systems were also considered.

    researchmap

  • Fundamental Research on Mobile Information Systems with Dynamically Variable Structure

    Grant number:10650355  1998 - 1999

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (C)  Niigata University

    SENGOKU Masakazu, NAKANO Keisuke, TAMURA Hiroshi

      More details

    Grant amount: \2800000 ( Direct Cost: \2800000 )

    In cellular systems, many cells are deployed and the service area is covered with these cells. A base station is located at the center of each cell. Mobile stations in a cell always communicate with other stations via base stations. Today's mobile communication systems employ the cellular system. Because the location of base stations of cellular systems is fixed, structure of cellular systems does not change. On the other hand, if base stations can move and mobile stations can be relay terminals, a new communication style is realized.
    The purpose of this project is to do fundamental research on mobile information systems with dynamically variable structure. We have considered about (1) Network architecture, (2) Network control, and (3) Network structure. We have obtained the following results.
    (1) We have proposed a system which enables mobile terminals to relay information.
    (2) We have proposed new routing algorithms and scheduling algorithms.
    (3) We have analyzed clustering algorithms, and we have shown difference between these algorithms.
    These results are fundamental technology for realizing mobile information systems with dynamically variable structure. Our future problems are to consider new services and applications of mobile information systems with dynamically variable structure.

    researchmap

  • Dynamic Cell Location and Channel Assignment Adaptable to Fluctuation of Communication Traffic

    Grant number:08650425  1996 - 1997

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for Scientific Research (C)  Niigata University

    SENGOKU Masakazu, NAKANO Keisuke, TAMURA Hiroshi

      More details

    Grant amount: \2200000 ( Direct Cost: \2200000 )

    The objective of this research project is to investigate the base stations location problem and the dynamic channel assignment problem in cellular mobile communication systems. In this research, it is assunmed that each cell has different traffic intebsity, different shape and different area from each other. The research of this projct is summarized as follows ;
    (1) It is proved that the base stations location problem is intractable ;
    (2) An approximate algorithm, based on the genetic algorithm, for the base stations location problem is proposed ;
    (3) The solution obtained by the approximate algorithm for the base stations location prblem is good approximation to the opotimum solution for the base stations location problem ;
    (4)It is possible to model dynamic channel assignment algorthms by using Clique Packing in cellular systems where the traffic distribution is heterogeneous ;
    (5) It is possible to analyze the communication traffic characteristics of dynamic channel assignment algorithms on the Clique Packing model under the non uniform traffic distribution ;
    (6) A method for analyzing the communication traffic characteristics of cellular systems using Dynamic Channel Assignment is proposed. using this method, we can consider the effect of mobility of subscribers to mobile communication systems on the traffic characteristics. It is shown that this method is effective on the analysis.
    These results contribute to balancing the quality of service in cellular systems where the traffic intensity is not uniform and the efficient use of frequency bands. Also, the results are applicable to optimum design of cellular mobile communication systems.
    We consider that flexibility is important to adapt mobile communication systems to various kinds of service in the future and multi-hop connection is one way to add flexibility to the system.

    researchmap

  • Dynamic Cell Allocation in Micro Cellular Mobile Communication Systems

    Grant number:06650404  1994 - 1995

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for General Scientific Research (C)  Niigata University

    SENGOKU Masakazu, TAMURA Hiroshi

      More details

    Grant amount: \2100000 ( Direct Cost: \2100000 )

    The efficient use of frequency bands is one of the most important issues in mobile communication systems because the demand for mobile communications is increasing rapidly and the frequency bands for mobile communications are limited. For the efficient use, the cellular concept is usually applied to mobile communication systems. For using the frequency bands more efficiently, the size of a cell becomes smaller and the 2-dimensional cellular system is replaced by the 3-dimensional cellular system.
    The objective of this research is increasing system capacity of multi-dimensional mobile communication systems by applying Dynamic Cell Allocation and Dynamic Channel Assignment. We obtained the following research results :
    1.An algorithm for Dynamic Cell Allocation is obtained.
    2.It is shown that the Dynamic Cell Allocation increases the system capacity.
    3.Flexible Hybrid Channel Assignment strategy, which is based on neuroalgorithms, is developed.
    4.Flexible Hybrid Channel Assignment strategy increases the system capacity of multi-dimensional mobile communication systems.
    From these results, it is shown that new technology is required for developing multidi-mensional mobile communication systems. The future problemis developing the new technology.

    researchmap

  • Channel Assignment of Digital Cellular Systems with 2- or 3-dimensional Cell Structure

    Grant number:04650281  1992 - 1993

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for General Scientific Research (C)  Niigata University

    SENGOKU Masakazu, TAKAHASHI Toshihiko, TAMURA Hiroshi

      More details

    Grant amount: \2000000 ( Direct Cost: \2000000 )

    The demand for mobile communication services is rapidly increasing, because the mobile communication service is synonymy of an ideal communication style realizing communication in anytime, anywhere and with anyone. The development of economic and social activities is a primary factor of the increasing demand for mobile communication services. The demand stimulates the development of technology in mobile communication including personal communication services. Thus mobile communication has been one of the most active research in communications in the last several years.
    In cellular mobile communication systems, the service area is divided into many small cells and each channel is re-used in some cells, simultaneously. Channel assignment methods affect the system capacity and they are classified into fixed channel assignment and dynamic channel assignment. In general, dynamic channel assignment gives better performance than fixed channel assignment. However, it is difficult to obtain the soulution in a practical time when dynamic channel assignment is applied to the cellular system. Therefore, it is one of the most important problems to find the algorithms in a cellular system. We obtain following results in this year.
    1. We propose a dynamic channel assignment algorithm using neural networks. The channel assignment scheme in this algorithm takes the degree of interference into consideration.
    2. We propose a 3-dimensional cell structure model and apply some traditional channel assignment algorithms to this model.
    3. We analyze the lower bound of the blocking propagation dynamic channel assignment.

    researchmap

  • 偏波FM-CWレーダによる土壌中埋没物体の高精度検出

    Grant number:04214202  1992    

    日本学術振興会  科学研究費助成事業  重点領域研究  新潟大学

    山口 芳雄, 田村 裕, 仙石 正和

      More details

    Grant amount: \2500000 ( Direct Cost: \2500000 )

    この研究は地中に埋没されている物体(例えば道路下のパイプや遺跡など)を地表面から探査できるFM-CWレーダシステムを開発することを目的とした。土壌中に埋もれた物体を探査する場合、最の大きな問題となるのは土壌中における電波の減衰である。この減衰が少ないほど土壌中深くまで探査が可能となるが、そのためには低い周波数を用いなければならない。一方、レーダ分解能の観点からはできるだけ広い周波数帯域を使う必要がある、使用する周波数をどう設定するかが最も重要なポイントとなる。そのため、今年度は土壌中の電波減衰特性を実験的に調べ。最適と思われる周波数を決定した。大学周辺の砂地で電波の透過測定、及びレーダの検出深さによって砂地への電界の侵入の深さを計り、実現可能なアンテナサイズと仕様から、250-1000MHzを周波数帯として選定した。次に、この帯域で動作するリッジホーンアンテナを作成し、平均で10dBのリターンロス特性を得る事ができた。また、この周波数帯で動作するように従来からのFM-CWレーダを改良して地中埋没物体の検出実験を行ない、幅30cmの金属板および直径10cmの金属管では120cmの深さまで検出できることを確認した。続いてFM-CWレーダのイメージング性能について検討した。FM-CWレーダで得られるビートスペクトラムを配列すれば実画像のイメージが得られるが、そのイメージではアンテナ走査方向の分解能が悪い。そのため合成開口法を用いてイメージ精度の向上を計り、的確な精度で画像表示をできるように改善を行った。その結果、実現したFM-CWレーダシステムで深さ1m程度の深さの物体を数cmの誤差精度で検出できるようになった。

    researchmap

  • Dynamic Channel Assignment in a Mobile Communication system Using Neural Networks

    Grant number:02650237  1990 - 1991

    Japan Society for the Promotion of Science  Grants-in-Aid for Scientific Research  Grant-in-Aid for General Scientific Research (C)  Niigata University

    SENGOKU Masakazu, ABE Takeo, TAKAHASHI Toshihiko, TAMURA Hiroshi, YAMAGUCHI Yoshio

      More details

    Grant amount: \1900000 ( Direct Cost: \1900000 )

    In usual dynamic channel assignment algorithms for cellular systems, the same channels are assigned in cells with a constant separation. Recently, a new channel assignment scheme was proposed, in which the same channel can be assigned with less separation than usual if the CIR (carrier-interference ratio) is more than the desired value.
    The channel assignment problem mentioned above is known to be intractable (NP complete) problem in graph theory. We propose applying Hopfield's neural networks to the channel assignment problems in cellular systems. It is said that Hopfield's neural networks can solve optimization problems very quickly. The computer simulations show that the neural networks are useful for the effective utilization of channels.

    researchmap

▼display all

Committee Memberships

  • 2021.6 - Now

    電子情報通信学会安全・安心な生活とICT研究専門委員会   顧問  

  • 2016.6 - Now

    日本シミュレーション学会   理事  

  • 2016.6 - Now

    日本シミュレーション学会   和文論文誌編集委員長  

  • 2023.1 - 2023.11

    The 42nd JSST Annual International Conference on Simulation Technology   Committee Member  

  • 2022.1 - 2022.11

    日本シミュレーション学会,The 41st JSST Annual International Conference on Simulation Technology(JSST2022)   Program Chair  

  • 2021.11 - 2022.11

    日本シミュレーション学会和文論文誌JSST2021学生論文特集   編集委員長  

  • 2018.6 - 2022.6

    日本シミュレーション学会   副会長  

  • 2021.1 - 2021.11

    日本シミュレーション学会,The 40th JSST Annual International Conference on Simulation Technology(JSST2021)   Program Chair  

  • 2020.11 - 2021.11

    日本シミュレーション学会和文論文誌学生論文特集   編集委員長  

  • 2020.6 - 2021.6

    電子情報通信学会安全・安心な生活とICT研究専門委員会   委員長  

  • 2012.10 - 2019.8

    日本シミュレーション学会多次元移動情報綱研究委員会   委員長  

  • 2016.7 - 2019.5

    IEEE International Symposium on Circuits & Systems (ISCAS 2019)   Publicity Co-Chair  

  • 2016.6 - 2018.5

    電子情報通信学会ICTスマートグリッド技術時限研究専門委員会   委員長  

  • 2014.5 - 2016.5

    電子情報通信学会基礎・境界ソサイエティ   副会長(事業担当)  

  • 2013.10 - 2014.11

    2014 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS2014)   General CoChair  

  • 2013.1 - 2013.7

    The 28th International Technical Conference on Circuit/Systems Computers and Communications(ITC-CSCC2013)   General CoChair  

  • 2010.5 - 2012.5

    電子情報通信学会基礎・境界ソサイエティ   和文論文誌編集委員長  

  • 2010.1 - 2011.12

    IEEE Circuits & Systems Society, Japan Chapter   Chair  

  • 2009.5 - 2010.5

    電子情報通信学会基礎・境界ソサイエティ   副会長(システムと信号処理)  

  • 2008.5 - 2009.5

    電子情報通信学会回路とシステム研究専門委員会   委員長  

  • 2005.5 - 2007.5

    電子情報通信学会基礎・境界ソサイエティ   英文論文誌編集幹事  

  • 2002.5 - 2004.5

    電子情報通信学会基礎・境界ソサイエティ運営委員会   庶務幹事  

▼display all