EBARA,Hiroyuki - Faculty of Engineering Science Department of Electrical and Electronic Engineering

EBARA, Hiroyuki

Faculty, Department/Institute

Faculty of Engineering Science Department of Electrical and Electronic Engineering

Academic status (qualification)

Professor Apr. 1,2016

Undergraduate Degrees・University

Osaka University Faculty of EngineeringDepartment of Communication Engineering 1982 Graduated

Graduate Degrees・University

Osaka University Doctor's Degree Program Department of Communication Engineering 1987 Completed

Academic Degrees

Doctor of Engineering Mar. 1987 Osaka University

Homepage Address, E-mail Address

Homepage Address：http://www.al.kansai-u.ac.jp/

Research fields	keyword
Algorithm theory
Combinatorial optimization problems
Mathematical programming

research topic	Study on Large-Scale Combinatorial Optimization Problems
Study theme state	Joint research within Japan
research duration
Research Programs
keyword	Optimization,Parallel Processing
Research field
Research Topics Overview

research topic	Study on Distributed Information Networks
Study theme state	Joint Research within Institution
research duration
Research Programs
keyword	Network,Distributed Processing
Research field
Research Topics Overview

research topic	Study on Empirical Analysis of the Internet
Study theme state	Joint research within Japan
research duration
Research Programs
keyword	Internet,Empirical Analysis
Research field
Research Topics Overview

所属学会・団体名	役職名 (役職在任期間)
IEEE
ACM
IEICE	19990000()
IPSJ	20090400()
ORSJ
SIAM

Research Publications

No.	Type of publication	Date of publication (Date of presentation)	Title	Type of research result	Jointly authored or single authored	Publisher and journal name	Volume number
1	Papers1	2022/8/2～2022,08,02,,,	Indoor Fingerprinting Positioning System Using Deep Learning with Data Augmentation	Academic Journal	Co-authored	Sensors and Materials	vol.34, no.8(1), pp.3047-3061
2	Papers1	2022/3/1～2022/3/12022,03,01,2022,03,01	Proposal of Highly Reliable System by Inexpensive Self-Employed Radio Line for Inventory Management of Municipal Disaster Stockpile	Academic Journal	Co-authored	IEEJ Transactions on Electronics, Information and Systems	vol.142, no.3, pp.216-224
3	Papers1	2021/6/1～2021/6/12021,06,01,2021,06,01	Proposal of An Automatic Flight Time Measurement method for Small Aircraft using a Built-in Smartphone 3-Axis Accelerometer	Academic Journal	Co-authored	IEEJ Transactions on Electronics, Information and Systems	vol.141, no.6, pp.743-751
4	Papers1	2020/11～2020,11,00,,,	Synchronous and Asynchronous Combination Duty-Cycling Protocol in Wireless Sensor Network	Academic Journal	Co-authored	IEICE TRANSACTIONS	Vol.J103-B, No.11, pp.605-615
5	International academic conference8	2020/11～2020,11,00,,,	Using Blockchain And Smart-Contract To Improve Reliability Of Mobile Ad Hoc Networks	Other	Co-authored	Virtual 2020 INFORMS Annual Meeting
6	International academic conference8	2019/11～2019,11,00,,,	Solving Traveling Salesman Problem with Image-based Classification	Other	Co-authored	IEEE
7	International academic conference8	2019/8～2019,08,00,,,	Mixed synchronous and asynchronous duty-cycling protocol in sensor networks	Other	Co-authored	the 48th International Conference on Parallel Processing
8	Papers1	2019/2～2019,02,00,,,	Solving Combinatorial Optimization Problems Using Deep Learning	Academic Journal	Co-authored	IPSJ Transactions	Vol.60, No.2, pp.651-659
9	International academic conference8	2018/11～2018,11,00,,,	Branch and Bound Algorithm for Parallel Many-Core Architecture	Other	Co-authored	the Sixth International Symposium on Computing and Networking
10	International academic conference8	2018/8～2018,08,00,,,	Routing for Ad-hoc Networks with Densely Populated Nodes and Frequent Communication	Other	Co-authored	the 47th International Conference on Parallel Processing
11	International academic conference8	2018/8～2018,08,00,,,	Applying Deep Learning and Reinforcement Learning to Traveling Salesman Problem	Other	Co-authored	IEEE International Conference on Computing, Electronics & Communications Engineering 2018
12	Papers1	2017/12～2017,12,00,,,	Parallel Consultant-Guided Search with Crossover	Academic Journal	Co-authored	The Review of Socionetwork Strategies, Springer	vol.11, no.2, pp 185–200
13	Papers1	2017/12～2017,12,00,,,	Post-Disaster Road Traversability Mapping Based on GPS Track Sharing and Map-Matching	Academic Journal	International coauthorship	International Journal of Geoinformatics	vol.13, no.4, pp.13 - 23
14	Papers1	2017/10～2017,10,00,,,	Fast Hybrid Method with Particle Swarm Optimization Parameter Tuning	Academic Journal	Co-author		vol.58, no.10, pp.1724 - 1734
15	International academic conference8	2017/7～2017,07,00,,,	Real-time book collection location search system	Other	Co-authored	the 21st Conference of the International Federation of Operational Research Societies
16	International academic conference8	2017/7～2017,07,00,,,	Formulation of the traveling salesman problem with multiple drones and its solution	Other	Co-authored	the 21st Conference of the International Federation of Operational Research Societies
17	International academic conference8	2016/9～2016/92016,09,00,2016,09,00	A Fast Hybrid Parallel Method for the Traveling Salesman Problem	Other	Co-author	The 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games
18	International academic conference8	2016/6～2016/62016,06,00,2016,06,00	Tsunami Evacuation Support System Considering Impassable Roads	Other	Co-author	INFORMS International Conference 2016
19	Papers1	2016/22016,02,00,0000,00,00	Effects of adaptive parameter tuning by Particle Swarm Optimization	Academic Journal	Co-author	IPSJ TOM	vol.9, no.1, pp.1-12
20	Papers1	2016/12016,01,00,0000,00,00	Parallel Consultant-Guided Search Algorithm for Traveling Salesman Problem	Academic Journal	Co-author	IPSJ Journal	vol.57, no.1, pp.331-342
21	Papers1	2015/122015,12,00,0000,00,00	Near Real-time Mapping Using Shared GPS data from Stranded Commuters	Academic Journal	Co-author	The Review of Socionetwork Strategies	vol.9, no.2, pp.41-57
22	Academic presentation7	2015/9/30～2015,09,30,,,	Parallel Consultant Guided Search with Crossover	Other	Co-author
23	Papers1	2015/92015,09,00,0000,00,00	Rescue Support System with DTN for Earthquake Disasters	Academic Journal	Co-author	IEICE Transactions on Communications	Vol.E98-B, No.9, pp.1832-1847
24	Papers1	2015/4～2015,04,00,,,	Dynamic region division and binding algorithm for MMORPG	Academic Journal	Co-author		vol.J98-A, no.4, pp.337-356
25	International academic conference8	2014/12～2014,12,00,,,	EOMANET: A POST DISASTER LOCATION INFORMATION SERVICE USING MOBILE AD-HOC NETWORKS	Other	Co-author	FOSS4G-Asia 2014
26	International academic conference8	2014/11～2014,11,00,,,	Real-time Support System for Stranded Commuters Considering Traffic Conditions	Other	Co-author	INFORMS Annual Meeting 2014
27	International academic conference8	2014/11～2014,11,00,,,	File Classification Problem in Hybrid Cloud Storage Systems	Other	Co-author	INFORMS Annual Meeting 2014
28	International academic conference8	2014/11～2014,11,00,,,	A Novel Evacuation Route Search Algorithm for Route Distribution of Evacuees Groups in Fire Disasters	Other	Co-author	Australasian Telecommunication Networks and Applications Conference 2014
29	Papers1	2014/8～2014,08,00,,,	Hybrid Consultant-Guided Search for the Traveling Salesperson Problem	Academic Journal	Co-author	IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences	Vol.E97-A, No.8, pp.1728-1738
30	International academic conference8	2014/7～2014,07,00,,,	Parallel Consultant-Guided Search for the Traveling Salesperson Problem	Other	Co-author	the 20th Conference of the International Federation of Operational Research Societies
31	International academic conference8	2013/7～2013/72013,07,00,2013,07,00	Development of a user-friendly computational cloud system in computer rooms	Other	Co-author	26th European Conference on Operational Research
32	Papers1	2013/3～2013,03,00,,,	Ad-hoc Networks Using Smart Homes in an Earthquake Disaster -Delivery of Rescue Request MAP Data for Buried Victims	Academic Journal	Co-author	IPSJ TOM	vol.6, no.1, pp.64-78
33	Papers1	2012/8～2012,08,00,,,	Literature Management System Based on BibTEX for Laboratory	Academic Journal	Co-author	IPSJ Journal	vol.53, no.8, pp.2049-2060
34	International academic conference8	2012/7～2012,07,00,,,	Smart Home Delay Tolerant Network for an Earthquake Disaster	Academic Journal	Co-author	The 2012 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'12)	pp.730-736
35	International academic conference8	2012/5～2012,05,00,,,	A semi-fixed Branch and Bound method for the traveling salesman problem	Academic Journal	Co-author	3rd International Conference on Optimization Methods and Software 2012	pp.60
36	International academic conference8	2011/6～2011,06,00,,,	Development of Emergency Rescue Evacuation Support System (ERESS) in Panic-type Disaster: Dynamic Evacuation Route Search	Academic Journal	Co-author	26th ITC-CSCC 2011	pp.85-88
37	International academic conference8	2010/9～2010,09,00,,,	Improvement for vTPM access control on Xen	Academic Journal	Co-author	39th Annual International Conference on Parallel Processing, SCC Workshop	pp.268-274
38	Papers1	2010/8～2010,08,00,,,	Development and performance evaluation of PC Grid which applied Virtual Machine	Academic Journal	Co-author	IEICE Trans.	vol.J93-D, no.8, pp.1555-1566
39	Papers1	2008/9/30～2008,09,30,,,	Economic Losses Caused by Spam Mails in Japan	Academic Journal	Co-author	Journal of International Development	vol.8, no.1, pp.23-33
40	International academic conference8	2008/3～2008,03,00,,,	Spam Mail Reduces Economic Effects	Other	Co-author	Proc. of ICDS 2008
41	Papers1	2008～20082008,00,00,2008,00,00	Economic Loss Caused by Spam Mail in Each Japanese Industry	Academic Journal	Co-author	Selected Proceedings of the First International Conference on Social Sciences (Social Sciences Research Society)	Vol.3, pp29-42
42	International academic conference8	2007/3～2007,03,00,,,	Optimal Allocation of Cache Servers and Content Files in Content Distribution Networks	Other	Co-author	Proc. of IASTED EuroIMSA 2007
43	Papers1	2005/12～2005,12,00,,,	A Cost-Effective Dynamic Content Migration Method in CDNs	Academic Journal	Co-author	IEICE Trans. on Communications	vol.E88-B, no.12, pp.4598-4604
44	International academic conference8	2005/6～2005,06,00,,,	Content Oriented Communications for emergencies in wireless environments	Other	Co-author	Proc. of 2005 International Conference on Parallel Processing Workshops	pp.458-465
45	Papers1	2004/12～2004,12,00,,,	Evaluation of Technical Efficiencies for Internet Service Providers in Japan - Current Issues and Future Prospects for Local Providers -	Academic Journal	Co-author	Journal of Public Utility Economics	vol.56, no.3, pp.85-94
46	International academic conference8	2003/12～2003,12,00,,,	Server and Route Selection Method for QoS-Based Anycast Protocol	Other	Co-author	Proc. of IEEE GLOBECOM 2003
47	International academic conference8	2003/7～2003,07,00,,,	A dynamic file allocation model for serious load fluctuation in the internet	Other	Co-author	Proc. of CESA2003
48	Papers1	2003/4～2003,04,00,,,	Load Fluctuation-Based Dynamic File Allocation with Cost-Effective Mirror Function	Academic Journal	Co-author	IEICE Trans. on Communications	vol.E86-B, 4, 1317-1326
49	International academic conference8	2002/11～2002,11,00,,,	A QoS-Based Anycast Protocol in Defferentiated Service Networks	Other	Co-author	Proc. of IASTED CCN2002	pp.212-217
50	Papers1	2002/2～2002,02,00,,,	Reliability-Based Mirroring of Servers in Distributed Networks	Academic Journal	Co-author	IEICE Trans. on Communications	E85-B, 2, 540-549
51	Papers1	2001/9～2001,09,00,,,	Effect on the Selection of Branch Variables in Parallel Branch and Bound Method	Academic Journal	Co-author
52	Papers1	2001/6～2001,06,00,,,	Sensitivity Analysis in Optimal Design for Distributed File Allocation Systems	Academic Journal	Co-author	IEICE Trans. on Communication	E84-B, 6, 1655-1663
53	International academic conference8	2000/11～2000,11,00,,,	Reliability-Based Optimal Allocation of Mirror Servers for Internet	Other	Co-author	Proc. of IEEE GLOBECOM2000
54	International academic conference8	1999/6～1999,06,00,,,	Sensitivity Analysis of File Allocation for Distributed Information Netoworks	Other	Co-author	Proc.of ICC '99
55	International academic conference8	1998/11～1998,11,00,,,	File Allocation in Distributed Multimedia Information Networks	Other	Co-author	Proc.of IEEE GLOBECOM '98
56	Papers1	1998/8～1998,08,00,,,	File Allocation Designs for Distributed Multimedia Information Networks	Academic Journal	Co-author	IEICE Trans. on Communications
57	Papers1	1998/8～1998,08,00,,,	An Efficient Adaptive Routing Algorithm for the Faulty Star Graph	Academic Journal	Co-author	IEICE Trans. on Inf. & Sist.
58	Papers1	1998/7～1998,07,00,,,	Fault-Tolerant Broadcasting on the Arrangement Graph	Academic Journal	Co-author	The Computer Journal
59	Papers1	1998/5～1998,05,00,,,	A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs	Academic Journal	Co-author	Journal of Graph Algorithms and Applications
60	International academic conference8	1997/12～1997,12,00,,,	An Efficient Adaptive Routing Algorithm for the Faulty Star Graph	Other	Co-author	Proceedings of ICPADS '97
61	International academic conference8	1997/12～1997,12,00,,,	An Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star Graph	Other	Co-author	ISAAC '97 : Algorithms and Computation(Lecture Notes in Computer Science)
62	Papers1	1997/1～1997,01,00,,,	Automatically Graph Drawing Using Genetic Algorithm	Academic Journal	Co-author	The Transactions of the Institute of Electronics, Information and Communication Engineers A
63	Papers1	1996/7～1996,07,00,,,	A Visualization System for Parallel Branch-and-Bound Method	Academic Journal	Co-author	The Transactions of the Institute of Electronics, Information and Communication Engineers D-I
64	Papers1	1996/3～1996,03,00,,,	Performance Evaluations of Graph Drawing Algorithms	Academic Journal	Co-author	The Transactions of the Institute of Electronics,Information and Communication Engineers A
65	International academic conference8	1995/8～1995,08,00,,,	A Broadcasting Algorithm on the Arrangement Graph	Other	Co-author	COCOON'95:Computing and Combinatorics(Lecture Notes in Computer Scieuce)
66	Papers1	1995/7～1995,07,00,,,	A Routing Algorithm in Faulty n-Rotator Graph and Its Performance Evaluation	Academic Journal	Co-author	Transactions of Information Processing Society of Japan
67	International academic conference8	1995/4～1995,04,00,,,	A New Approach for Routing in Arrangement Graphs and Its Performance Evaluation	Other	Co-author	LATIN '95 : Theoretical Informatics (Lecture Notes in Computer Science)
68	International academic conference8	1994/12～1994,12,00,,,	Fault Tolerant Routing for Arrangement Graphs	Other	Co-author	ISPAN'94	pp.213-220
69	International academic conference8	1994/7～1994,07,00,,,	A Visualization System for Parallel Branch-and-bound Method	Other	Co-author	Abstracts of APORS'94	pp.221
70	Patents99	1993/11～1993,11,00,,,	Measuring Method of Roundness(Patent)	Other	Co-author
71	Papers1	1992/5～1992,05,00,,,	A Practical Algorithm for Computing the Roundness	Academic Journal	Co-author	IEICE Trans. Inf. &. Syst.
72	Commentary9	1992/2～1992,02,00,,,	The Roundness Problem	Academic Journal	Single-Author	Communications of the OR Society of Japan
73	International academic conference8	1991/8～1991,08,00,,,	Asynchronous Parallel Branch and Bound Method - Experimental Case for the Knapsack Problem	Other	Co-author	Abstracts of 14th ISMP
74	Commentary9	1990/3～1990,03,00,,,	Algorithm Animation	Academic Journal	Co-author	Journal of IEICE
75	International academic conference8	1989/8～1989,08,00,,,	Roundness Algorithms Using the Voronoi Diagrams	Other	Co-author	1st Canadian Conference on Computational Geometry
76	International academic conference8	1988/8～1988,08,00,,,	Scheduling Jobs with Release Times to Minimize Schedule Length	Other	Co-author	Abstracts of 13th ISMP	pp.31
77	International academic conference8	1988/8～1988,08,00,,,	A Parallel Algorithm for Constructing the Half-Plane Intersection and Its Applications	Other	Co-author	Abstracts of 13th ISMP	pp.218
78	International academic conference8	1987/9～1987,09,00,,,	A Roundness Algorithm Using the Voronoi Diagrams and Its Acceleration	Other	Co-author	1st International Workshop on Computational Geometry and Discrete Algorithms
79	Papers1	1987/4～1987,04,00,,,	A Roundness Algorithm Using the Voronoi Diagrams	Academic Journal	Co-author	IEICE Transactions
80	Papers1	1986/8～1986,08,00,,,	Approximation Algorithm for Constrained Two-Dimensional Bin Packing Problem	Academic Journal	Co-author	IEICE Transactions
81	Papers1	1986/3～1986,03,00,,,	Constrained Two-Dimensional Bin Packing Problem	Academic Journal	Co-author	IEICE Transactions
82	International academic conference8	1985/6～1985,06,00,,,	Constrained Two-Dimensional Bin Packing Problem	Other	Co-author	Proceedings of ISCAS'85	pp.965-966

PapersIndoor Fingerprinting Positioning System Using Deep Learning with Data AugmentationIn refereedAcademic JournalCo-authoredEBARA,Hiroyuki;Luomeng Liu;Qianyue Zhao;Shoma Miki;Jumpei Tokunagaindoor positioning;fingerprinting;residual network;data augmentation;deep learningSensors and Materialsvol.34, no.8(1), pp.3047-30612022/8/2～MYU K.K.https://doi.org/10.18494/SAM3912We propose an indoor positioning system based on deep learning and fingerprinting. On the mobile side, we designed an Android application with received signal strength information (RSSI) signal reading, database storage, and real-time online positioning module functions. In addition, we placed a trained neural network model on the built server to achieve real-time positioning using the developed Android application. The deep learning framework of this paper uses a residual network (ResNet) and a data augmentation technique called mean and uniform random numbers in the preparation of the dataset. By using this data augmentation method, we significantly reduced the collection time of the dataset and increased the test accuracy of the neural network from 20.4% before the augmentation to 97.5% after the augmentation.

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;2022/3/4～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;2022/3/3～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;;2022/3/3～愛媛大学

PapersProposal of Highly Reliable System by Inexpensive Self-Employed Radio Line for Inventory Management of Municipal Disaster StockpileIn refereedAcademic JournalCo-authoredEBARA,Hiroyuki;KAWAI,Susumu;WADA,Tomotakaself-employed radio;disaster and emergency;MCA;LPWAIEEJ Transactions on Electronics, Information and Systemsvol.142, no.3, pp.216-2242022/3/1～2022/3/1the Institute of Electrical Engineers of Japanhttps://doi.org/10.1541/ieejeiss.142.216Many people use the Internet which are connected by cables between terminals. For this reason, it may be crowded and not connected in the event of a disaster or emergency. It also has weaknesses that make it vulnerable to natural and human threats. This is a problem for the communication line of the local government office. Therefore, we propose a self-employed radio propagation path that can be constructed at low cost. An MCA line was set up for the outdoor trunk line, and an LPWA line was set up for communication inside the disaster stockpile storage building. An experiments were conducted in a university campus building. In order to obtain the effectiveness, we moved inside the building to find the optimum threshold. As a result, we were able to obtain feasible data. As a result of performance experiments with Wi-Fi and LPWA, it was found that LPWA is superior to Wi-Fi.

PapersProposal of An Automatic Flight Time Measurement method for Small Aircraft using a Built-in Smartphone 3-Axis AccelerometerIn refereedAcademic JournalCo-authoredEBARA,Hiroyuki;KAWAI,Susumu;WADA,TomotakaGNSS;small aircraft;acceleration;smartphone;flight timeIEEJ Transactions on Electronics, Information and Systemsvol.141, no.6, pp.743-7512021/6/1～2021/6/1the Institute of Electrical Engineers of Japanhttps://doi.org/10.1541/ieejeiss.141.743This paper proposes a method for obtaining the Flight Time of Small Aircraft from acceleration using a 3-axis acceleration sensor with a built-in Smartphone. In recent years, the use of GNSS(Global Navigation Satelite System) has been successful, and it was listed as a candidate this time, but there are some errors and there is a history of giving up. The conventional method had many individual errors because it is recollected by the Captain. The proposed method can be easily and inexpensively upgraded. In the experiment, an actual Small Aircraft was used and acceleration data was acquired assuming actual flight. We were able to fly 5 times because we could not fly freely due to control. Excel and total software R were used for data analysis. The number of flight was 5, but the number of samples was more than 30,000 in one flight. Since the phenomena in the natural world follow a normal distribution, we calculated the threshold with a 99% confidence interval. R was used for curve analysis of the normal distribution. As a result, it was found that false detection occurred at a rate of 0.5% in the proposed method.

PapersSynchronous and Asynchronous Combination Duty-Cycling Protocol in Wireless Sensor NetworkIn refereedAcademic JournalCo-authoredEBARA, Hiroyuki;;;IEICE TRANSACTIONSVol.J103-B, No.11, pp.605-6152020/11～IEICE

International academic conferenceUsing Blockchain And Smart-Contract To Improve Reliability Of Mobile Ad Hoc NetworksIn refereedOtherCo-authoredEBARA,Hiroyuki;TOKUNAGA,JunpeiVirtual 2020 INFORMS Annual Meeting2020/11～INFORMSOnline

International academic conferenceSolving Traveling Salesman Problem with Image-based ClassificationIn refereedOtherCo-authoredEBARA,Hiroyuki;MIKI,ShomaIEEE2019/11～31st International Conference on Tools with Artificial Intelligence (ICTAI)Portland, OR, USA

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;;2019/9～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;2019/9～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;;2019/9～

International academic conferenceMixed synchronous and asynchronous duty-cycling protocol in sensor networksIn refereedOtherCo-authoredEBARA,Hiroyuki;KAWABATA,Shunroku;MATSUZAKI,Raitothe 48th International Conference on Parallel Processing2019/8～the 48th International Conference on Parallel Processing, AWASN WorkshopKyoto, Japan

Research reportUnrefereedIn-house publicationCo-authoredEBARA,Hiroyuki;2019/4～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;2019/3～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;;2019/3～

PapersSolving Combinatorial Optimization Problems Using Deep LearningIn refereedAcademic JournalCo-authoredEBARA,Hiroyuki;MIKI,ShomaIPSJ TransactionsVol.60, No.2, pp.651-6592019/2～IPSJIn this paper, we focus on the traveling salesman problem (TSP) that is a typical combinatorial optimization problem, and propose a method for solving it with applying deep learning. This method features learning the image of the optimal tour by a convolutional neural network to acquire the Good-Edge Distribution whose edges could be included in the optimal solution. It also conducts neighborhood search by using Good-Edge Value that is an evaluation of each edge calculated from the distribution. We show experimentally that this method improves the quality of solutions.

International academic conferenceBranch and Bound Algorithm for Parallel Many-Core ArchitectureIn refereedOtherCo-authoredEBARA,Hiroyuki;HAZAMA,Kazukithe Sixth International Symposium on Computing and Networking2018/11～the Sixth International Symposium on Computing and Networking, PDAA WorkshopHida Takayama, Japan

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;2018/9～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;2018/9～

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;2018/9～

International academic conferenceRouting for Ad-hoc Networks with Densely Populated Nodes and Frequent CommunicationIn refereedOtherCo-authoredEBARA,Hiroyuki;TOKUNAGA,Junpei;KANEMITSU,Ryothe 47th International Conference on Parallel Processing2018/8～the 47th International Conference on Parallel Processing, AWASN WorkshopEugene, OR, USA

International academic conferenceApplying Deep Learning and Reinforcement Learning to Traveling Salesman ProblemIn refereedOtherCo-authoredEBARA,Hiroyuki;MIKI,Shoma;YAMAMOTO,DaisukeIEEE International Conference on Computing, Electronics & Communications Engineering 20182018/8～IEEE International Conference on Computing, Electronics & Communications Engineering 2018University of Essex, Southend, UK

Academic presentationUnrefereedOtherCo-authoredEBARA,Hiroyuki;;2018/6～

TextbookUnrefereedMonographCo-authorEBARA,Hiroyuki2018/3～

PapersParallel Consultant-Guided Search with CrossoverIn refereedAcademic JournalCo-authoredEBARA,Hiroyuki;UEDA,Yota;NAKAYAMA,Koki;IIDA,SyuheiConsultant-guided search;Crossover;Parallel processing;Metaheuristics;Combinatorial optimization problemThe Review of Socionetwork Strategies, Springervol.11, no.2, pp 185–2002017/12～Consultant-guided search (CGS) is a recent metaheuristic method. This approach is an algorithm in which a virtual person called a client creates a solution based on consultation with a virtual person called a consultant. In this study, we propose a parallel CGS algorithm with a genetic algorithm’s crossover and selection, and calculate an approximation solution for the traveling salesman problem. We execute a computer experiment using the benchmark problems (TSPLIB). Our algorithm provides a solution with less than 3.3% error rate for problem instances using less than 6000 cities.

PapersPost-Disaster Road Traversability Mapping Based on GPS Track Sharing and Map-MatchingIn refereedAcademic JournalInternational coauthorshipEBARA,Hiroyuki;W.Yu;X.Song;V.Raghavan;D.YoshidaInternational Journal of Geoinformaticsvol.13, no.4, pp.13 - 232017/12～

PapersFast Hybrid Method with Particle Swarm Optimization Parameter TuningIn refereedAcademic JournalCo-authorEBARA,Hiroyuki;NAGATSUJI,Ryouta;HAZAMA,Kazukivol.58, no.10, pp.1724 - 17342017/10～Meta-heuristics is available for the combinatorial optimization problem and its ability has been developed. Especially, the Consultant Guided Search-Particle Swarm Optimization (CGS-PSO) hybrid method has showed powerful performance. CGS-PSO hybrid method tunes parameters of CGS algorithm with PSO algorithm adaptively. In this study, in order to enhance the CGS-PSO hybrid method, we propose the new parallel parameter tuning method with sharing parameters between processes. We benchmark the proposed method in the convergence speed and the error rate for instances of TSPLIB. As a result, we show the proposed method is superior in terms of the convergence speed.

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;;;2017/9～

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;2017/9～

International academic conferenceReal-time book collection location search systemIn refereedOtherCo-authoredEBARA,Hiroyuki;HIRAI,Tomokithe 21st Conference of the International Federation of Operational Research Societies2017/7～the 21st Conference of the International Federation of Operational Research SocietiesQuebec City, Canada

International academic conferenceFormulation of the traveling salesman problem with multiple drones and its solutionIn refereedOtherCo-authoredEBARA,Hiroyuki;UEDA,Youtathe 21st Conference of the International Federation of Operational Research Societies2017/7～the 21st Conference of the International Federation of Operational Research SocietiesQuebec City, Canada

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;2017/3/23～2017/3/23

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;2017/3/22～2017/3/22

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;;;2016/10～2016/10

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;2016/9/22～2016/9/22

International academic conferenceA Fast Hybrid Parallel Method for the Traveling Salesman ProblemIn refereedOtherCo-authorEBARA,Hiroyuki;Ryouta NAGATSUJI;Youta UEDAThe 19th Japan Conference on Discrete and Computational Geometry, Graphs, and Games2016/9～2016/9The 19th Japan Conference on Discrete and Computational Geometry, Graphs, and GamesTokyo

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;;;2016/9～2016/9

International academic conferenceTsunami Evacuation Support System Considering Impassable RoadsIn refereedOtherCo-authorEBARA,Hiroyuki;Raito MATSUZAKI;Ryo YOSHIMOTO;Fumiki HAGIHARAINFORMS International Conference 20162016/6～2016/6INFORMS International Conference 2016Hawaii, USA

Academic presentationUnrefereedOtherCo-authorEBARA,Hiroyuki;;;;2016/6～2016/6

Survey reportUnrefereedIn-house publicationCo-authorEBARA,Hiroyuki;;;;2016/4～2016/4

Academic presentationUnrefereedOtherCo-author2016/3/18～2016/3/18

Academic presentationUnrefereedOtherCo-author2016/3/16～2016/3/16

Academic presentationUnrefereedOtherCo-author2016/3/15～2016/3/15

PapersEffects of adaptive parameter tuning by Particle Swarm OptimizationIn refereedAcademic JournalCo-authorRyota Nagatsuji;Shuhei Iida;Hiroyuki EbaraConsultant-Guided Search;Traveling Salesman Problem:TSP;Particle Swarm Optimization:PSO;Ant Colony Optimization:ACO;Parameter TuningIPSJ TOMvol.9, no.1, pp.1-122016/2Meta-heuristics is available for the combinatorial optimization problem and its ability has been developed. The Swarm Intelligence (SI) with the adaptive parameter tuning by the Particle Swarm Optimization algorithm shows powerfull results. In this study, some SI algorithms apply the adaptive parameter tuning by the PSO algorithm. We perform simlulation experiments, and evaluate the ability of SI enhanced by the PSO. In addition, we consider the important parameters for some instances, and analyze its effectiveness, comparing the enhanced SI with the SI algorithm set the static parameters.

PapersParallel Consultant-Guided Search Algorithm for Traveling Salesman ProblemIn refereedAcademic JournalCo-authorHiroyuki Ebara;Koki Nakayama;Shuhei Iida;Ryota NagatsujiConsultant-Guided Search;PC Cluster;Parallel Processing;Metaheuristics;Combinatorial Optimization ProblemIPSJ Journalvol.57, no.1, pp.331-3422016/1Metaheuristic algorithms have been studied as a method for sloving combinatorial optimization problems. Recently, the Consultant-Guided Search(CGS) for solving the Traveling Salesman Problem(TSP) has been proposed. In this paper, we propose a parallel method which assigns virtual consultants and virtual clients of the CGS to processes of computers, and calculates an approximation solution effectively for the TSP. In addition, we introduce the island model to increase the diversity of the solution. We execute computer experiments with the benchmark instances(TSPLIB) by 10 quad-core computers. Our algorithm provides a solution with less than 5% error rate for problem instances of 5000 cities.

PapersNear Real-time Mapping Using Shared GPS data from Stranded CommutersIn refereedAcademic JournalCo-authorWenlong YU;Hiroyuki EBARA;Raito MATSUZAKI;Daisuke YOSHIDA;Venkatesh RAGHAVANGPS;Mobile device;DTN;Stranded Commuter;NS-2The Review of Socionetwork Strategiesvol.9, no.2, pp.41-572015/1210.1007/s12626-015-0055-21867-3236Japan is known as one of the world's most quake-prone countries. Many commuters are stranded when major earthquake occurs in Japan. Most of the stranded commuters cannot use mobile devices to connect to the Internet because of failure of other communication channels. In this paper, we propose sharing GPS data over DTN (Delay Tolerant Network) to facilitate the generation near real-time maps and support for stranded commuters in the event of earthquake disasters. In order to evaluate the network performance, we have carried out simulations using map data for Asahi Ward, Osaka City in Japan. The results of the simulation indicate that the proposed method could achieve desired accuracy considering reasonable time constraints for near real-time mapping.

Academic presentationParallel Consultant Guided Search with CrossoverUnrefereedOtherCo-author2015/9/30～

Academic presentationUnrefereedOtherCo-author2015/9/30～

Academic presentationUnrefereedOtherCo-author2015/9/29～

PapersRescue Support System with DTN for Earthquake DisastersIn refereedAcademic JournalCo-authorMATSUZAKI, Raito;EBARA, Hiroyuki;MURANAKA, Noriakiad-hoc network;delay tolerant network;smart home;emergency rescue;earthquakeIEICE Transactions on CommunicationsVol.E98-B, No.9, pp.1832-18472015/9IEICEIn a previous paper, we proposed a rescue support system for victims buried in an earthquake disaster by constructing an ad-hoc network using home-server based smart homes. However, this system has the following two problems: i) it cannot ensure sufficient density of home servers to realize adequate WLAN coverage, ii) the system does not consider areas in which home servers cannot be used such as parks and factories, for example. In this paper, we propose a new method using a delay tolerant network (DTN) technique. In this method, rescuers (such as rescue teams) with mobile devices relay information between disconnected networks by walking around during rescue activities. For a performance evaluation, we performed simulation experiments using a map of Abenoku, Osaka. From our results, we show that the proposed method increases the information acquisition rate, and that the network can be maintained. We also quantitatively show the penetration rate of smart homes needed for our system. In addition, we show that the rescue request system is more effective than other systems, and the method with the mobile device relay is better than without this method.

PapersDynamic region division and binding algorithm for MMORPGIn refereedAcademic JournalCo-authorHiroyuki EBARA;Hiraku YOSHIOKA;Raito MATSUZAKIMMORPG;Load Balancing;P2P;Dynamic Algorithmvol.J98-A, no.4, pp.337-3562015/4～IEICEIn this paper, we propose a dynamic region division and binding algorithm of a P2P MMORPG(MMORPG:Massively Multiplayer Online Role Playing Game). The P2P MMORPG divides a virtual space into regions and sets a peer to manage the region as a management node. If a peer takes over load, delay or interruption of the game occurs. So, it is necessary to divide regions in order to distribute the load. We dynamically decompose regions by detecting the movement of players and providing thresholds that is upper and lower limits of the number of players in each region. By our algorithm, it is possible to perform load balancing that corresponds to issues of P2P communication type. We show the proposed algorithm reduces the total load than the conventional algorithms by simulation experiments.

Academic presentationUnrefereedOtherCo-author2015/3～

International academic conferenceEOMANET: A POST DISASTER LOCATION INFORMATION SERVICE USING MOBILE AD-HOC NETWORKSIn refereedOtherCo-authorWenlong Yu;Daisuke Yoshida;Venkatesh Raghavan;Hiroyuki Ebara;Raito MatsuzakiFOSS4G-Asia 20142014/12～FOSS4G-AsiaBangkok, Thailand

International academic conferenceReal-time Support System for Stranded Commuters Considering Traffic ConditionsIn refereedOtherCo-authorWenlong Yu;Hiroyuki Ebara;Raito Matsuzaki;Venkatesh Raghavan;Daisuke YoshidaINFORMS Annual Meeting 20142014/11～INFORMSSan Francisco

International academic conferenceFile Classification Problem in Hybrid Cloud Storage SystemsIn refereedOtherCo-authorFan Liu;Hiroyuki EbaraINFORMS Annual Meeting 20142014/11～INFORMSSan Francisco

International academic conferenceA Novel Evacuation Route Search Algorithm for Route Distribution of Evacuees Groups in Fire DisastersIn refereedOtherCo-authorHiroki Murotsu;Manato Fujimoto;Tatsuya Suzuki;Hiroyuki Ebara;Tomotaka Wada;Hiromi OkadaAustralasian Telecommunication Networks and Applications Conference 20142014/11～Melbourne, Australia

Academic presentationUnrefereedOtherCo-author2014/9～

PapersHybrid Consultant-Guided Search for the Traveling Salesperson ProblemIn refereedAcademic JournalCo-authorEBARA,Hiroyuki;HIRANUMA,Yudai;NAKAYAMA,KokiConsultant-Guided Search;Traveling Salesperson Problem;Combinatorial Optimization Problem;Parallel Algorithm;Ant Colony OptimizationIEICE Transactions on Fundamentals of Electronics, Communications and Computer SciencesVol.E97-A, No.8, pp.1728-17382014/8～IEICEMetaheauristic methods have been studied for combinational optimization problems for some time. Recently, Consultant-Guided Search(CGS) has been proposed as a metaheuristic method for the Traveling Salesperson Problem(TSP). This approach is an algorithm in which a virtual person called a client creates a solution based on consultation with a virtual person called a consultant. In this research, we propose a parallel algorithm which uses the Ant Colony System(ACS) to create a solution with a consultant in a Consultant-Guided Search, and calculates an approximation solution for the TSP. Finally, we execute a computer experiment using the benchmark problems(TSPLIB), Our algorithm provides a solution with less than 2% error rate for problem instances using less than 2000 cities.

International academic conferenceParallel Consultant-Guided Search for the Traveling Salesperson ProblemIn refereedOtherCo-authorKoki Nakayama;Hiroyuki Ebarathe 20th Conference of the International Federation of Operational Research Societies2014/7～the International Federation of Operational Research SocietiesBarcelona

Academic presentationUnrefereedOtherCo-author2014/6～

Academic presentationUnrefereedOtherCo-author2014/3～2014/3

Academic presentationUnrefereedOtherCo-author2013/12～2013/12

Academic presentationUnrefereedOtherCo-author2013/9～2013/9

International academic conferenceDevelopment of a user-friendly computational cloud system in computer roomsIn refereedOtherCo-authorRyuichiro Yamada;Hiroyuki Ebara26th European Conference on Operational Research2013/7～2013/7Roma, Italy

Academic presentationUnrefereedAcademic JournalCo-author2013/3～

PapersAd-hoc Networks Using Smart Homes in an Earthquake Disaster -Delivery of Rescue Request MAP Data for Buried VictimsIn refereedAcademic JournalCo-authorMatsuzaki Raito;Ebara Hiroyukiad-hoc network;rescue support system;smart homeIPSJ TOMvol.6, no.1, pp.64-782013/3～IPSJWe propose a rescue support system for victims in an earthquake disaster, using home servers of smart homes that realize a comfortable home environment by sensing, and aim to achieve this system. In this paper, we consider the method of data delivery to achieve our system. Our proposed system is starting communication between neighboring home servers, and set up ad-hoc networks, when it detects the Earthquake Early Warning. By sharing information with each other through communication, each home server identies buried victims etc. by information such as being at home after the earthquake, and generates a Rescue Request MAP. As we can get the Rescue Request MAP by mobile devices from home servers, this system can eciently help rescue operations by rescuers and local residents. To achieve our proposal, we must consider a disconnected communication problem, because the home server can't be put in park area, factory area, and so on. Therefore, we propose to set repeaters to aid communication between home servers. In order to evaluate performance, we measure actual experiments for wireless LAN communication as preliminary experiments, and perform simulations with modeling systems based on actual experiment results. From our simulations, we quantitatively show the penetration of smart home that needed to achieve this proposal, and find that this system can maintain in the low penetration rate by setting repeaters. We also show amount of information a user with a mobile device gets, when the user walk around freely for collecting a Rescue Request MAP. As a result, we found that our proposed system can be maintained in the penetration rate of 50%.

Academic presentationUnrefereedAcademic JournalCo-author2013/1～

Academic presentationUnrefereedAcademic JournalCo-author2012/12～

PapersLiterature Management System Based on BibTEX for LaboratoryIn refereedAcademic JournalCo-authorHiroyuki Ebara;Takahiro Ohtsuka;Yuki YamakamiIPSJ Journalvol.53, no.8, pp.2049-20602012/8～Information Processing Society of JapanThe important things about managing literatures in laboratories are “Sharing literatures between members” and “Easy to search literatures and to cite them in papers”. Currently, many literature management tools have developed, but not enough to satisfy the above conditions. In this paper, we develop the literature management system “bole” that specializes in the use of laboratories. The proposed system is developed as the web application, and when literature information is registered in the system, research area, comment, evaluation, and so on about literatures are registered as additional information in order to facilitate sharing of literature information in laboratories. BibTEX is used in our laboratory to write a paper, therefore we develop functions convenient to use BibTEX, for example citation key can be copied with one click. We show the utility of the proposed system to share literature information easily in the laboratory, and efficiently to write the papers.

International academic conferenceSmart Home Delay Tolerant Network for an Earthquake DisasterIn refereedAcademic JournalCo-authorRaito Matsuzaki;Hiroyuki EbaraThe 2012 International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'12)pp.730-7362012/7～Las Vegas, USAIn a previous paper, we proposed a rescue support system for victims buried in an earthquake disaster by constructing an ad-hoc network using home-server smart homes. However, this system has the following two problems: i) it cannot ensure sufficient density of home servers for a WLAN communication range, ii) the system does not consider areas in which home servers cannot be used such as in parks and factories, for example. In this research, we propose a new method using a delay tolerant network (DTN) technique. In this method, rescuers with mobile devices relay information between disconnected networks by walking around during rescue activities. For a performance evaluation, we performed simulation experiments using a map of Abeno-ku, Osaka. From our results, we show that the proposed method increases the information acquisition rate, and the network can be maintained. In addition, we quantitatively show the penetration of the smart home needed for our system.

International academic conferenceA semi-fixed Branch and Bound method for the traveling salesman problemIn refereedAcademic JournalCo-authorYudai Hiranuma;Hiroyuki Ebara3rd International Conference on Optimization Methods and Software 2012pp.602012/5～Crete, GreeceIn this paper, we present a heuristic algorithm based on the Branch and Bound (BB) method for the Traveling Salesman Problem (TSP), that is one of the combinatorial optimization problems. We call the proposed method the Semi-Fixed Branch and Bound (SFBB) method. The BB method is a method to find the optimal solution by searching the whole solution space, and consists of branching and bounding. The SFBB method is composed of three phases. In the first phase, it solves the plural approximate solutions in parallel by executing metaheuristics algorithms such as Tabu Search (TS), Ant Colony Optimization (ACO), and so on. After obtaining dozens of the approximate solutions from each algorithm, go to the next phase. In the second phase, it checks the solutions obtained in the first phase, and fixes several edges. It divides into a set of candidate edges (Ec) and a set of bounding edges (Eb). Ec is a set of edges emerging in many solutions. Eb is a set of edges rarely emerging in solutions. In the third phase, it executes the BB method in parallel for the subproblem with edges fixed by Ec and Eb. We perform computational experiments using the TSPLIB to evaluate the performance of the SFBB method. In the experiments, we use the PC cluster in our laboratory. In the parallel algorithm, we adopt Message Passing Interface (MPI) and Pthreads. It communicates between PCs with MPI, and assigns one thread to each core with Pthreads.

Academic presentationUnrefereedAcademic JournalCo-author2012/5～

Academic presentationUnrefereedAcademic JournalCo-author2012/3～

PapersUnrefereedIn-house publicationCo-author2012/3～

Academic presentationUnrefereedAcademic JournalCo-author2012/1～

Academic presentationUnrefereedAcademic JournalCo-author2011/10～

Academic presentationUnrefereedAcademic JournalCo-author2011/9～

International academic conferenceDevelopment of Emergency Rescue Evacuation Support System (ERESS) in Panic-type Disaster: Dynamic Evacuation Route SearchIn refereedAcademic JournalCo-authorTatsuya Murakami;Shizuka Okada;Haruka Majima;Tomotaka Wada;Hiroyuki Ebara;Hiromi Okada26th ITC-CSCC 2011pp.85-882011/6～

Academic presentationUnrefereedAcademic JournalCo-author2011/5～

Academic presentationUnrefereedAcademic JournalCo-author2011/3～

Academic presentationUnrefereedAcademic JournalCo-authorProc. of FIT2010L-0402010/9～

Academic presentationUnrefereedAcademic JournalCo-author2010/9～

International academic conferenceImprovement for vTPM access control on XenIn refereedAcademic JournalCo-authorH.Morikawa;H.Ebara;K.Onishi;H.Nakano39th Annual International Conference on Parallel Processing, SCC Workshoppp.268-2742010/9～

Academic presentationUnrefereedAcademic JournalCo-author2010/9～

PapersDevelopment and performance evaluation of PC Grid which applied Virtual MachineIn refereedAcademic JournalCo-authorHiroaki MORIKAWA;Hiroyuki EBARA;Katsumi ONISHI;Hideo NAKANOIEICE Trans.vol.J93-D, no.8, pp.1555-15662010/8～IEICE

TextbookUnrefereedMonographCo-editor2009/3/25～

PapersEconomic Losses Caused by Spam Mails in JapanIn refereedAcademic JournalCo-authorT.Takemura;H.EbaraJournal of International Developmentvol.8, no.1, pp.23-332008/9/30～

International academic conferenceSpam Mail Reduces Economic EffectsIn refereedOtherCo-authorEBARA Hiroyuki;Toshihiko TakemuraProc. of ICDS 20082008/3～IARIAFrom the view of economics, the authors analyze the disadvantages of Spam mail. For this purpose, we introduce a production function model and estimate the effect of Spam mail. As a result, we find that the existence of Spam mail decreases not only the level of the GDP (Gross Domestic Product), which is about 464 billion yen (0.1% of the Japanese GDP), but also reduces labor productivity. This implies that the existence of Spam mail directly and indirectly damages the entire economy. Therefore, we suggest a full-fledged introduction of ”Outbound Port 25 Blocking” to all ISPs (Internet Service Providers) and ”Sendmail Authentication” to all firms as effective Spam mail countermeasures.

PapersEconomic Loss Caused by Spam Mail in Each Japanese IndustryIn refereedAcademic JournalCo-authorT.Takemura;H.EbaraSpam mail;Production Function Model;Economic LossSelected Proceedings of the First International Conference on Social Sciences (Social Sciences Research Society)Vol.3, pp29-422008～2008Spam mail is a nuisance for most Internet users. Recently, spam mail has been shown to cause large economic losses in industries. The purpose of this paper is to quantitatively analyze the negative economic effects caused by spam mail. Concretely, we calculate the loss of GDP in Japanese industries through a production function. In addition, we examine whether or not a difference exists in economic loss by spam mail across industries. Finally, we discuss the effectiveness of spam mail countermeasures.

BookUnrefereedMonographCo-author2007/3/30～

International academic conferenceOptimal Allocation of Cache Servers and Content Files in Content Distribution NetworksIn refereedOtherCo-authorEBARA Hiroyuki;A.NakaniwaProc. of IASTED EuroIMSA 20072007/3～IASTEDContent Distribution Networks (CDNs) have proliferated rapidly with the growth in network bandwidth and the variety of content files. The CDN service is one of the most popularWeb services from Internet Service Providers (ISPs), since most ISPs are currently striving to provide additional services besides their original Internet access service. The Internet has seen an explosive increase in the number of users, which causes network servers to become overloaded, and we are currently facing several serious issues, such as declining reliability, increased response time, and so on. The replicated allocation of content files on cache servers for load-balancing is known as an effective solution to overcome these issues. In CDNs, one of the most important problems is how we allocate cache servers and content files while considering trade-offs between the cost, reliability, and delay. In this paper, we examine an example of the CDN service in an ISP ”BBit-Japan”, which is one of the biggest CDN service providers in Japan. We apply this example to the cache server and content allocation model which we have proposed. This optimization model introduces 0-1 integer programming to determine the optimal allocation of cache servers and content files. In this optimization model, we aim to maximize the reliability of the whole system subject to restrictions of cost and delay, and in considering trade-offs between reliability, cost, and delay. The use of this optimization model makes it possible to show precisely how they can properly allocate cache servers and content files at limited cost and within permissible delays to the CDN service providers.

TextbookUnrefereedMonographCo-author2006/3/22～

BookUnrefereedMonographCo-author2006/2/28～

PapersA Cost-Effective Dynamic Content Migration Method in CDNsIn refereedAcademic JournalCo-authorEBARA Hiroyuki;Y.ABE;D.IKEDA;T.TSUTSUI;K.SAKAI;A.NAKANIWA;H.OKADAIEICE Trans. on Communicationsvol.E88-B, no.12, pp.4598-46042005/12～IEICEContent Distribution Networks (CDNs) are highly advanced architectures for networks on the Internet, providing low latency, scalability, fault tolerance, and load balancing. One of the most important issues to realize these advantages of CDNs is dynamic content allocation to deal with temporal load fluctuation, which provides mirroring of content files in order to distribute user accesses. Since user accesses for content files change over time, the content files need to be reallocated appropriately. In this paper, we propose a cost-effective content migration method called the Step-by-Step (SxS) Migration Algorithm for CDNs, which can dynamically relocate content files while reducing transmission cost. We show that our method maintains sufficient performance while reducing cost in comparison to the conventional shortest-path migration method. Furthermore, we present six life cycle models of content to consider realistic traffic patterns in our simulation experiments. Finally, we evaluate the effectiveness of our SxS Migration Algorithm for dynamic content reconfiguration across time.

International academic conferenceContent Oriented Communications for emergencies in wireless environmentsIn refereedOtherCo-authorEBARA Hiroyuki;K.SAKAI;H.NAKANO;A.NAKANIWA;H.OKADAProc. of 2005 International Conference on Parallel Processing Workshopspp.458-4652005/6～International Conference on Parallel ProcessingIn the conventional WWW search or P2P file sharing systems, users search for some information by using the Explicit Information such as keywords, addresses or content names. However, it is very difficult to obtain real-time information immediately just after serious accident (i.e. Fires, Earthquake, Explosion by terrorism, Traffic accidents and so on) happens suddenly. The conventional information systems, whether it is centralized nor distributed, cannot support user accesses, since they cannot provide any contents with the Explicit Information, in such short time. In this paper, we propose a new communication scheme named COC, Content Oriented Communications. In COC, distributed information systems don't observe the Explicit Information (keywords, addresses, content names, etc.) but the Implicit Information (locations, time, speed, etc.). This is why we call our system Content Oriented. In this paper, we introduce COC, which enables us to decrease the personal damage of a disaster in a local area where the disaster occurs by searching and getting some information for the evacuation.Grant-in-Aid for Scientific Research

PapersEvaluation of Technical Efficiencies for Internet Service Providers in Japan - Current Issues and Future Prospects for Local Providers -In refereedAcademic JournalCo-authorEBARA Hiroyuki;MUNEKI YOKOMI;AKIKO NAKANIWA;TOSHIHIKO TAKEMURAJournal of Public Utility Economicsvol.56, no.3, pp.85-942004/12～JSPUInternet service providers operated in local area have made advanced information systems and promoted local community in their area. However recently, while providers operated in nationwide expand their service area, local providers are facing operational difficulty. In this paper, we measure technical efficiencies for internet service providers using data envelopment analysis. We obtain the data by our questionnaire survey. Then we test the difference of the level of calculated efficiency scores between nationwide providers plus providers served in three metropolitan areas (Tokyo, Aichi, and Osaka) and local providers, using Mann-Whitney's rank sum test. The result says there is a statistical difference at 5% significance level between the two groups. We can obtain the fact that local providers should use IT assets more efficiently than nationwide or three metropolitan providers. Following this result, we suggest some implications from the viewpoints of a scheme of subsidy, M&A and price of backbone usage.Grant-in-Aid for Scientific Research

International academic conferenceServer and Route Selection Method for QoS-Based Anycast ProtocolIn refereedOtherCo-authorEBARA Hiroyuki;A.NAKANIWA;H.NIIMI;K.INUI;H.OKADAProc. of IEEE GLOBECOM 20032003/12～IEEEThe anycast communication protocol is to select the best server and the best route for a particular client from a groupof replicated servers with the same contents. As users have come to demand contents with high QoS, the necessity to support the anycast communications in QoS networks has grown. In this paper, we propose a server and route selection method with application-level QoS-based anycast protocol. The protocol we propose has the following advantages. 1) The latest server and route information can be constantly acquired through distributed resource management by E-BB. 2) The server and route selection algorithm enable us to consider both the server load and network load simultaneously. 3) High reliability can be guaranteed by decentralized control.Grant-in-Aid for Scientific Research

International academic conferenceA dynamic file allocation model for serious load fluctuation in the internetIn refereedOtherCo-authorEBARA Hiroyuki;A.NAKANIWA;J.TAKAHASHI;Y.ABE;H.OKADAProc. of CESA20032003/7～Grant-in-Aid for Scientific Research

PapersLoad Fluctuation-Based Dynamic File Allocation with Cost-Effective Mirror FunctionIn refereedAcademic JournalCo-authorEBARA Hiroyuki;J.TAKAHASHI;A.NAKANIWA;Y.ABE;H.OKADAIEICE Trans. on Communicationsvol.E86-B, 4, 1317-13262003/4～IEICEMirroring of network servers has been considered to be effective for load balancing. However, the cost of setting up new mirror servers is enormously high. In this paper, we propose a dynamic file allocation model with a simple mirroring function for handling significant changes of network traffic in the Internet. According to the load fluctuation, we can dynamically reallocate files using this model. We show that our model accomplishes satisfactory performance and reduces cost by adding a simple mirroring function to all existent servers instead of setting up mirror servers afresh.

International academic conferenceA QoS-Based Anycast Protocol in Defferentiated Service NetworksIn refereedOtherCo-authorEBARA Hiroyuki;H.NIIMI;A.NAKANIWA;H.OKADAProc. of IASTED CCN2002pp.212-2172002/11～

PapersReliability-Based Mirroring of Servers in Distributed NetworksIn refereedAcademic JournalCo-authorEBARA Hiroyuki;A.NAKANIWA;J.TAKAHASHI;H.OKADAIEICE Trans. on CommunicationsE85-B, 2, 540-5492002/2～IEICE

PapersEffect on the Selection of Branch Variables in Parallel Branch and Bound MethodIn refereedAcademic JournalCo-author2001/9～IEICEParallel branch-and-bound method is one of the algorithms that are applied to combinatorial optimization problems. We consider a distributed computing environment and evaluate the strategy available for such meta-computing architecture. Firstly, we solve partial problem with plural strategies. Further, to find the most promising strategy, we solve the whole problem in the hope to shorten the average processing time. We have developed a parallel branch-and-bound method to solve Traveling Salesman Problem. We consider the relationship between the evaluation to decide one optimum solution and all optimum solutions in the point of processing time and acceleration by changing the selection of branch variables.

PapersSensitivity Analysis in Optimal Design for Distributed File Allocation SystemsIn refereedAcademic JournalCo-authorEBARA Hiroyuki;A.NAKANIWA;M.OHNISHI;H.OKADAIEICE Trans. on CommunicationE84-B, 6, 1655-16632001/6～IEICE

International academic conferenceReliability-Based Optimal Allocation of Mirror Servers for InternetIn refereedOtherCo-authorEBARA Hiroyuki;A.NAKANIWA;H.NISHIYAMA;H.OKADAProc. of IEEE GLOBECOM20002000/11～IEEEGrant-in-Aid for International Scientific Research 199904-200103

International academic conferenceSensitivity Analysis of File Allocation for Distributed Information NetoworksIn refereedOtherCo-authorEBARA Hiroyuki;A.Nakaniwa;M.Ohnishi;H.OkadaProc.of ICC '991999/6～IEEE

International academic conferenceFile Allocation in Distributed Multimedia Information NetworksIn refereedOtherCo-authorEBARA Hiroyuki;A.Nakaniwa;M.Ohnishi;H.OkadaProc.of IEEE GLOBECOM '981998/11～IEEE

PapersFile Allocation Designs for Distributed Multimedia Information NetworksIn refereedAcademic JournalCo-authorEBARA Hiroyuki;A.Nakaniwa;H.OkadaIEICE Trans. on Communications1998/8～IEICEIn this paper, we study the optimal allocation of multimedia files in distributed network systems. In these systems, the files are shared by users connected with different servers geographically separated, and each file must be stored in at least one of servers. Users can access any files stored in any servers connected with high-speed communication networks. Copies of the files accessed frequently are to be stored in several servers that have detabeses. So, it is one of the most important problems how to assign the files to servers in view of costs and delays. Considering these problems in hetreogeneous network environments, we present a new system model that covers wide range of multimedia network applications like VOD, CALS and so on. In these systems, it is obvious that there is trading-off relationship between costs and delays. Our objective is to find the optimal file allocation such that the total cost is minimized subject to the total delay. We introduce a O-1 integer programming formulation for the optimization problem, and find the optimal file allocation by solving these formulae.

PapersAn Efficient Adaptive Routing Algorithm for the Faulty Star GraphIn refereedAcademic JournalCo-authorEBARA Hiroyuki;L.Bai;H.Nakano;H.MaedaIEICE Trans. on Inf. & Sist.1998/8～IEICE

PapersFault-Tolerant Broadcasting on the Arrangement GraphIn refereedAcademic JournalCo-authorEBARA Hiroyuki;L.Bai;H.Maeda;H.NakanoThe Computer Journal1998/7～This paper proposes a distributed fault-tolerant algorithm for one-to-all broadcasting in the one-port communication model on the arrangement graph. Exploiting the hierarchical properties of the arrangement graph to constitute different-sized broadcasting trees for different-sized subgraphs, we propose a distributed algorithm with optimal time complexity and without message redundancy for one-to-all broadcasting in the one-port communication model for the fault-free arrangement graph. According to the property that there is a family of k(n-k)node-disjoint paths between any two nodes, we develop a fast fault-tolerant procedure capable of sending a message from a node to its adjacent nodes on the(n,k)-arrangement graph with less than k(n-k)faulty edges. Combining the fault-tolerant procedure and the optimal broadcasting algorithm, a fault-tolerant broadcasting is achieved on the arrangement graph. It is shown that a message can be broadcast to all the other(n!(n-k)!)-1 processors in O(klgn)steps if no faults exist on the(n,k)-arrangement graph, and in O(k2lgn+klg2n))steps if the number of faulty edges is less than k(n-k).

PapersA Broadcasting Algorithm with Time and Message Optimum on Arrangement GraphsIn refereedAcademic JournalCo-authorEBARA Hiroyuki;L.Bai;H.Maeda;H.NakanoJournal of Graph Algorithms and Applications1998/5～

International academic conferenceAn Efficient Adaptive Routing Algorithm for the Faulty Star GraphIn refereedOtherCo-authorEBARA Hiroyuki;L.Bai;H.Nakano;H.MaedaProceedings of ICPADS '971997/12～IEEE

International academic conferenceAn Adaptive Distributed Fault-Tolerant Routing Algorithm for the Star GraphIn refereedOtherCo-authorEBARA Hiroyuki;L.Bai;H.Nakano;H.MaedaISAAC '97 : Algorithms and Computation(Lecture Notes in Computer Science)1997/12～

PapersAutomatically Graph Drawing Using Genetic AlgorithmIn refereedAcademic JournalCo-authorThe Transactions of the Institute of Electronics, Information and Communication Engineers A1997/1～IEICE

PapersA Visualization System for Parallel Branch-and-Bound MethodIn refereedAcademic JournalCo-authorThe Transactions of the Institute of Electronics, Information and Communication Engineers D-I1996/7～IEICE

PapersPerformance Evaluations of Graph Drawing AlgorithmsIn refereedAcademic JournalCo-authorThe Transactions of the Institute of Electronics,Information and Communication Engineers A1996/3～IEICE

International academic conferenceA Broadcasting Algorithm on the Arrangement GraphIn refereedOtherCo-authorEBARA Hiroyuki;L.Bai;P.Yamanaka;H.NakanoCOCOON'95:Computing and Combinatorics(Lecture Notes in Computer Scieuce)1995/8～

PapersA Routing Algorithm in Faulty n-Rotator Graph and Its Performance EvaluationIn refereedAcademic JournalCo-authorEBARA Hiroyuki;P.Yamakawa;H.NakanoTransactions of Information Processing Society of Japan1995/7～IPSJ

International academic conferenceA New Approach for Routing in Arrangement Graphs and Its Performance EvaluationIn refereedOtherCo-authorEBARA Hiroyuki;P.Yamakawa;H.NakanoLATIN '95 : Theoretical Informatics (Lecture Notes in Computer Science)1995/4～

International academic conferenceFault Tolerant Routing for Arrangement GraphsIn refereedOtherCo-authorPeter YAMAKAWA;Hiroyuki EBARA;Hideo NAKANO;Hajime MAEDAFault Tolerant Routing;Arrangement GraphISPAN'94pp.213-2201994/12～Ishikawa, Japan

International academic conferenceA Visualization System for Parallel Branch-and-bound MethodIn refereedOtherCo-authorKatsumi ONISHI;Hiroyuki EBARA;Hideo NAKANO;Hajime MAEDABranch-and-bound MethodAbstracts of APORS'94pp.2211994/7～Fukuoka, Japan

PatentsMeasuring Method of Roundness(Patent)OtherCo-author1993/11～

PapersA Practical Algorithm for Computing the RoundnessIn refereedAcademic JournalCo-authorEBARA Hiroyuki;N.Fukuyama;H.Nakano;Y.NakanishiIEICE Trans. Inf. &. Syst.1992/5～Roundness is one of the most important geometric measures for circular objects in the process of machanical assembly. It is the amount of variation in a circular size which can be premitted. To compute roundness, the authors have already propoed an exact polynomial-time algorithm whose time complexity is O(n2). In this paper, we show that this roundness alborithm can be improved more efficiently, by introducing the deletion of the unnecessary points, in practical applications. In addition, the computational experience of this revised algorithm is also presented.IEICE

CommentaryThe Roundness ProblemUnrefereedAcademic JournalSingle-AuthorEBARA HiroyukiCommunications of the OR Society of Japan1992/2～ORSJ

International academic conferenceAsynchronous Parallel Branch and Bound Method - Experimental Case for the Knapsack ProblemIn refereedOtherCo-authorHiroyuki EBARA;Hideo NAKANOKnapsack Problem;Branch and Bound MethodAbstracts of 14th ISMP1991/8～Amsterdam, The Netherlands

CommentaryAlgorithm AnimationUnrefereedAcademic JournalCo-authorJournal of IEICE1990/3～IEICE

International academic conferenceRoundness Algorithms Using the Voronoi DiagramsIn refereedOtherCo-authorHiroyuki EBARA;Noriyuki FUKUYAMA;Hideo NAKANO;Yoshiro NAKANISHIRoundness;Voronoi Diagram1st Canadian Conference on Computational Geometry1989/8～Montréal, Canada

International academic conferenceScheduling Jobs with Release Times to Minimize Schedule LengthIn refereedOtherCo-authorTuyoshi KAWAGUCHI;Seiki KYAN;Hiroyuki EBARA;Hideo NAKANO;Yoshiro NAKANISHISchedulingAbstracts of 13th ISMPpp.311988/8～Tokyo, Japan

International academic conferenceA Parallel Algorithm for Constructing the Half-Plane Intersection and Its ApplicationsIn refereedOtherCo-authorHiroyuki EBARA;Hideo NAKANO;Yoshiro NAKANISHIcomputational geometryAbstracts of 13th ISMPpp.2181988/8～Tokyo, Japan

International academic conferenceA Roundness Algorithm Using the Voronoi Diagrams and Its AccelerationIn refereedOtherCo-authorHiroyuki EBARA;Hideo NAKANO;Yoshiro NAKANISHIRoundness;Voronoi Diagram1st International Workshop on Computational Geometry and Discrete Algorithms1987/9～Osaka, Japan

PapersA Roundness Algorithm Using the Voronoi DiagramsIn refereedAcademic JournalCo-authorIEICE Transactions1987/4～IEICE

PapersApproximation Algorithm for Constrained Two-Dimensional Bin Packing ProblemIn refereedAcademic JournalCo-authorIEICE Transactions1986/8～IEICE

PapersConstrained Two-Dimensional Bin Packing ProblemIn refereedAcademic JournalCo-authorIEICE Transactions1986/3～IEICE

International academic conferenceConstrained Two-Dimensional Bin Packing ProblemIn refereedOtherCo-authorHiroyuki EBARA;Hideo NAKANO;Yoshiro NAKANISHIBin Packing ProblemProceedings of ISCAS'85pp.965-9661985/6～Kyoto, Japan

EBARA, Hiroyuki

Faculty, Department/Institute

Academic status (qualification)

Undergraduate Degrees・University

Graduate Degrees・University

Academic Degrees

Homepage Address, E-mail Address

Research fields

Research topics

Research Activities

Research Career

Academic Associations

Intellectual Property Rights

Research Publications

Research Activities Overseas

Participation in International Conferences

Courses Taught