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

researchmap

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

researchmap

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

researchmap

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

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

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

researchmap

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

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

researchmap

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

researchmap

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

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

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

researchmap

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

researchmap

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

researchmap

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

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

researchmap

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

researchmap

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

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

CiNii Books

researchmap

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

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

researchmap

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

researchmap

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

CiNii Books

researchmap

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

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

researchmap

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

researchmap

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

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

researchmap

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

researchmap

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

researchmap

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

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

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

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

CiNii Books

researchmap

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

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

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

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

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

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

researchmap

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

CiNii Books

researchmap

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

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

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

researchmap

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

researchmap

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

CiNii Books

researchmap

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

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

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

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

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

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

researchmap

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

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

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

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

CiNii Books

researchmap

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

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

researchmap

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

researchmap

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

researchmap

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

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

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

researchmap

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

researchmap

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

researchmap

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

CiNii Books

researchmap

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

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

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

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

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

researchmap

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

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

Language：English   Publisher：TAO  

researchmap

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

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

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

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

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

researchmap

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

researchmap

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

researchmap

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

Web of Science

researchmap

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

Language：English   Publisher：IEEK  

researchmap

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

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

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

researchmap

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

researchmap

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

Web of Science

researchmap

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

Web of Science

researchmap

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

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

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

researchmap

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

researchmap

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

researchmap

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

Language：English   Publisher：IEEK  

CiNii Books

researchmap

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

CiNii Books

researchmap

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

CiNii Books

researchmap

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

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

CiNii Books

researchmap

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

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

CiNii Books

researchmap

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

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

researchmap

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

researchmap

J-GLOBAL

researchmap

J-GLOBAL

researchmap

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

researchmap

Language：Japanese  

J-GLOBAL

researchmap

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

J-GLOBAL

researchmap

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

researchmap

Language：Japanese  

researchmap

Language：Japanese  

J-GLOBAL

researchmap

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

CiNii Books

researchmap

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

CiNii Books

researchmap

Language：Japanese  

J-GLOBAL

researchmap

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

CiNii Books

researchmap

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

researchmap

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

CiNii Books

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese  

CiNii Books

researchmap

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

CiNii Books

researchmap

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

researchmap

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Poster presentation  

Student Session, pp.50-53

researchmap

Language：Japanese   Presentation type：Poster presentation  

Student Session, pp.54-57

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

Language：Japanese   Presentation type：Poster presentation  

researchmap

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

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

Language：Japanese  

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：English   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：English   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：English   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：English   Presentation type：Public lecture, seminar, tutorial, course, or other speech  

researchmap

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

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

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

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap

Language：Japanese   Presentation type：Oral presentation (general)  

researchmap