Kyushu University Academic Staff Educational and Research Activities Database
List of Papers
Koide Hiroshi Last modified date:2022.05.13

Professor / Advanced Software Engineering, Graduate School and Faculty of Information Science and Electrical Engineering / Section of Cyber Security for Information Systems / Research Institute for Information Technology


Papers
1. Yuya Tajima, Hiroshi Koide, Applying The Attacks Tracer on Advanced Persistent Threats to Real Networks, 2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW), 392-397, 2021.11.
2. Kohei Kubota, Wai Kyi Kyi Oo, Hiroshi Koide, A New Feature to Secure Web Applications, 8th International Symposium on Computing and Networking Workshops, CANDARW 2020, 334-340, 2020.11, Web application security is one of essential components of any web-based systems. As becoming popular of the Internet makes many web sites be attacked by many kinds of attacks. So, we have to propose a secure framework for web applications. For this reason, we have to propose a web application framework which not only analyzes the source code implemented by web developers, also it can detects the vulnerabilities in the source code dynamically. Although a lot of research works have already proposed detection methods of vulnerabilities in web application attacks, but those are not fully detected because their methods do not use the information of the web applications. Therefore, we propose a new method which analyzes the source code of a web application, and then modifies it if needed, in addition, our method has a detection method of an application's vulnerabilities that are difficult to detect by previous methods. According to our implementation and experiments, it is possible to detect actual attacks, which have been considered difficult to detect, against authentication leaks and SQL injection attacks using dynamic queries..
3. Zhao Hao, Yaokai Feng, Hiroshi Koide, Kouichi Sakurai, A Sequential Detection Method for Intrusion Detection System Based on Artificial Neural Network, International Journal of Networking and Computing, 10, 2, 213-226, 2020.07.
4. Longjian Ye, Hiroshi Koide, Dirceu Cavendish, Kouichi Sakurai, Efficient Shortest Path Routing Algorithms for Distributed XML Processing, Proceedings of the 15th International Conference on Web Information Systems and Technologies, WEBIST 2019, 265-272, 2019.09.
5. Katsumi Nagai, Hiroshi Koide, Kouichi Sakurai , Proposal and Evaluation of a Security Incident Response Training Method using Programming, SIGITE '19: Proceedings of the 20th Annual SIG Conference on Information Technology Education, 165, 2019.09, Nowadays, there are various cyber-attacks in the world. In terms of dealing with cyber incident, there are many non-technical factors. Table Top Exercises are available for improving it but need some fund, time and trainers who conduct it more smoothly. So, in this work, we propose a security incident response training method using programming. It aims to improve some non-technical skills. Our proposal is actually executed with questionnaires..
6. Kyi Kyi Oo, Hiroshi Koide, Kouichi Sakurai, Analyzing the Effect of Moving Target Defense for a Web System, International Journal of Networking and Computing, 2019.07.
7. Wai Kyi Kyi Oo, Hiroshi Koide, Danilo Vasconcellos Vargas, Kouichi Sakurai, A new design for evaluating moving target defense system, In Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, CANDARW 2018, 561-563, 2018.12.
8. Yao Xu, Hiroshi Koide, Danilo Vasconcellos Vargas, Kouichi Sakurai, Tracing MIRAI malware in networked system, In Proceedings - 2018 6th International Symposium on Computing and Networking Workshops, 534-538, 2018.12.
9. Murakami, T., Kumano, S. and Koide, H., An Implementation of Tracing Attacks on Advanced Persistent Threats by Using Actors Model, 2014.12.
10. Nobuo Saito, Hiroshi Koide, Hideki Kondo, Break away from button-UI to gesture operation on touch device, Computer Software, 30, 4, 36-44, 2013.11, A web browser application for iOS, Libing, proposes a solution to resolve the problems of complicated button-based user interface (UI). The authors implement a gesture-based UI in Libing to realize simple and plentiful operations. Libing also keeps available display area maximum. Users can memorize correspondence between gestures and operations easily because users can assign arbitrary gestures to any operations and/or URLs flexibly in Libing. Touch-input-devices as typified by smartphones and tablet PCs have become popular recently. The market of these application programs has grown continuously. The most application programs are operated by the button-based UI. We can understand it visually. And the button-based UI is popular because we do not have incorrect operations when buttons are sufficiently large. However if we want to assign a lot of functions to buttons, we have to prepare many small buttons and/or a large area on which we place many buttons. We might have to divide the area to several pages to place all buttons. At least the user experience will be compromised because users have a lot of incorrect operations, available display area is compromised and operations become to be complicated. This study gives a solution to these problems which compromise the user experience..
11. Masahiko Kato, Takumi Matsunami, Akira Kanaoka, Hiroshi Koide, Eiji Okamoto, Tracing advanced persistent threats in networked systems, Automated Security Management, 10.1007/978-3-319-01433-3_11, 179-187, 2013.01, We herein discuss the modeling of target information systems as well as various attacks, in order to clarify the impact of Advanced Persistent Threats (APTs) and to enable efficient planning of defense strategies to counter APTs..
12. D. Cavendish, Hiroshi Koide, Y. Oie, M. Gerla, A Mean Value Analysis approach to transaction performance evaluation of multi-server systems, Concurrency Computation Practice and Experience, 10.1002/cpe.1582, 22, 10, 1267-1285, 2010.07, In this paper, we introduce a Mean Value Analysis (MVA)-based methodology for the performance evaluation of transactions executed in a multi-server distributed system. We first present probabilistic arguments to investigate under which conditions MVA models provide worst-case response times, without large overshoots. Then, we show how to characterize the distributed server system so as to construct a model to predict response times as well as to estimate system capacity. Finally, we exemplify the methodology usage via transactions implemented in two distributed Linux systems..
13. Kazumi Yoshinaga, Yoshiyuki Uratani, Hiroshi Koide, Utilizing multi-networks task scheduler for streaming applications, 37th International Conference on Parallel Processing Workshops, ICPP 2008 Proceedings - 37th International Conference on Parallel Processing Workshops, ICPP 2008, 10.1109/ICPP-W.2008.16, 25-30, 2008, This paper proposes and evaluates a new task scheduling method for parallel and distributed applications in an environment consisting of multiple networks having different characteristics. The proposed method can schedule both streaming applications and non-streaming applications effectively at the same time, since it selects the most suitable networks for the communications of tasks and considers the changing loads of the networks. The experimental results show the proposed method reduced the total execution time of a practical streaming application. The dispersion of the execution time was also suppressed even if the network bandwidth was dynamically changing. This characteristic is very important when this method is applied to more complicated task scheduling methods..
14. Akihiro Fujiwara, Koji Nakano, Hong Chen, Jacir L. Bordim, Satoshi Fujita, Shuichi Ichikawa, Yasushi Inoguchi, Chuzo Iwamoto, Hiroshi Koide, Toshimitsu Masuzawa, Susumu Matsumae, Hiroshi Matsuo, Eiji Miyano, Jun Miyazaki, Masafumi Yamashita, Special section on parallel/distributed processing and systems, IEICE Transactions on Information and Systems, 10.1093/ietisy/e90-1.1.1, E90-D, 1, 2007.01.
15. Hiroshi Koide, Yuji Oie, A new task scheduling method for distributed programs that require memory management, Concurrency Computation Practice and Experience, 10.1002/cpe.963, 18, 9, 941-958, 2006.08, In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long..
16. Hiroshi Koide, Yuji Oie, A new task scheduling method for distributed programs that require memory management, CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 10.1002/cpe.963, 18, 9, 941-958, 2006.08, In parallel and distributed applications, it is very likely that object-oriented languages, such as Java and Ruby, and large-scale semistructured data written in XML will be employed. However, because of their inherent dynamic memory management, parallel and distributed applications must sometimes suspend the execution of all tasks running on the processors. This adversely affects their execution on the parallel and distributed platform. In this paper, we propose a new task scheduling method called CP/MM (Critical Path/Memory Management) which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready (executable) coarse-grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules, including CP/MM, for a task scheduling system which is implemented on a Java RMI (Remote Method Invocation) communication infrastructure. Our experimental results show that CP/MM can successfully prevent high-priority macro-tasks from being affected by the garbage collection arising from memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long. Copyright (c) 2005 John Wiley & Sons, Ltd..
17. Yoshinori Kitatsuji, Katsuyuki Yamazaki, Hiroshi Koide, Masato Tsuru, Yuji Oie, Influence of network characteristics on application performance in a grid environment, Telecommunication Systems, 10.1007/s11235-005-4320-5, 30, 1-3, 99-121, 2005.11, In grid computing, a key issue is how limited network resources can be shared by communications by various applications more effectively in order to improve application-level performance, e.g., by reducing the completion time for an individual application and/or set of applications. Communication by an application changes the condition of the network resources, which may, in turn, affect communications by other applications, and thus may degrade their performance. In this paper, we examine the characteristics of traffic generated by typical grid applications, and the effect of the round-trip time and bottleneck bandwidth on the application-level performance (i.e., completion time) of these applications. Our experiments showed that the impact of network conditions on the performance of various applications and the impact of application traffic on network conditions differed considerably depending on the application. These results suggest that effective allocation of network resources must take into account the network-related properties of individual applications..
18. Y Kitatsuji, K Yamazaki, H Koide, M Tsuru, Y Oie, Influence of network characteristics on application performance in a grid environment, TELECOMMUNICATION SYSTEMS, 10.1007/s11235-005-4320-5, 30, 1-3, 99-121, 2005.11, In grid computing, a key issue is how limited network resources can be shared by communications by various applications more effectively in order to improve application-level performance, e.g., by reducing the completion time for an individual application and/or set of applications. Communication by an application changes the condition of the network resources, which may, in turn, affect communications by other applications, and thus may degrade their performance. In this paper, we examine the characteristics of traffic generated by typical grid applications, and the effect of the round-trip time and bottleneck bandwidth on the application-level performance (i.e., completion time) of these applications. Our experiments showed that the impact of network conditions on the performance of various applications and the impact of application traffic on network conditions differed considerably depending on the application. These results suggest that effective allocation of network resources must take into account the network-related properties of individual applications..
19. Yoshinori Kitatsuji, Satoshi Katsuno, Katsuyuki Yamazaki, Hiroshi Koide, Masato Tsuru, Yuji Oie, On the influence of network characteristics on application performance in the grid environment, Lecture Notes in Computer Science, 3420, I, 9-18, 2005, In the Grid computing, it is a key issue how limited network resources are effectively shared by communications of various applications in order to improve the application-level performance, e.g., to reduce the completion time of each application and/or a set of applications. In fact, the communication of an application changes the condition of network resources, which may, in turn, affect the communications in other applications, and thus may deteriorate their performance. In this paper, we examine the characteristics of traffic generated by some typical grid applications, and how the round-trip time and the bottleneck bandwidth affect the application-level performance (i.e., completion time) of these applications. Our experiments show that the impact of network conditions on the application performance and the impact of application traffic on the network conditions are considerably different depending on the application. Those results suggest an effective network resource allocation should take network-related properties of individual applications into consideration..
20. Hiroshi Koide, Yuji Oie, A new task scheduling method for distributed programs which require memory management in grids, Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshop) Proceedings - 2004 International Symposium on Applications and the Internet Workshops (Saint 2004Workshops), 666-673, 2004.06, In the Grid applications, it is very likely that object oriented languages, like Java and Ruby, will be employed as well as large-scale semi-structured data like XML. However, their inherent dynamic memory management has to suspend the execution of all the tasks running on processors when it is invoked. This will adversely affect the Grid computing severely unless the task scheduling system can avoid it with some special mechanism. In this paper, we propose a new task scheduling method, referenced to as CP/MM, which can efficiently schedule tasks for applications requiring memory management. The underlying concept is to consider the cost due to memory management when the task scheduling system allocates ready coarse grain tasks, or macro-tasks, to processors. We have developed three task scheduling modules including an implementation of CP/MM into a task scheduling system is implemented on Java RMI (Remote Method Invocation) communication infrastructure. Moreover, we evaluate the fundamental performance of CP/MM in two ways. The first is the performance evaluation of CP/MM which is applied to a small but practical test application program on a PC cluster. The second is the performance evaluation for test programs which have many tasks with complicated dependency relations on the test bed system consisting of computers on our two campuses located at a distance of approximately 32 km. These experimental results show that CP/MM can successfully prevent high priority macro-tasks from being affected by the garbage collection arising from the memory management, so that CP/MM can efficiently schedule distributed programs whose critical paths are relatively long..
21. Yuji Mochizuki, Hiroshi Koide, Toshiyuki Imamura, Hiroshi Takemiya, HF-STEX and RASSCF calculations on nitrogen K-shell X-ray absorption of purine base and its derivative, Journal of Synchrotron Radiation, 10.1107/S0909049500017696, 8, 2, 1003-1005, 2001.03, The nitrogen K-shell X-ray absorption spectra of the purine bases present in nucleic acids, adenine and guanine, were analyzed by using ab initio Hartree-Fock static exchange and restricted-active-space self-consistent-field calculations. A variety of derivative molecules were calculated to investigate the energetic shifts due to environmental effects on the nitrogen atoms. Shake-up excitations were also addressed..
22. Y Mochizuki, H Koide, T Imamura, H Takemiya, HF-STEX and RASSCF calculations on nitrogen K-shell X-ray absorption of purine base and its derivative, JOURNAL OF SYNCHROTRON RADIATION, 10.1107/S0909049500017696, 8, 2, 1003-1005, 2001.03, The nitrogen K-shell X-ray absorption spectra of the purine bases present in nucleic acids, adenine and guanine, were analyzed by using ab initio Hartree-Fock static exchange and restricted-active-space self-consistent-field calculations. A variety of derivative molecules were calculated to investigate the energetic shifts due to environmental effects on the nitrogen atoms. Shake-up excitations were also addressed..
23. 小出 洋, 平山 俊雄, 村杉 明夫, 林 拓也, 笠原 博徳, Meta-scheduling for a Cluster of Supercomputers, Proc. ICS99 Workshop, 63-69, 1999.06.
24. H Koide, M Suzuki, Y Nakayama, A new memory allocation method for shared memory multiprocessors with large virtual address space, CONCURRENCY-PRACTICE AND EXPERIENCE, 10.1002/(SICI)1096-9128(199709)9:9<897::AID-CPE282>3.0.CO;2-9, 9, 9, 897-914, 1997.09, This paper proposes a new memory allocation method for shared memory multiprocessors with large virtual address spaces, An evaluation of its performance is also presented.
For effective use of shared memory multiprocessors, it is important that no processor's execution is blocked, if several processors simultaneously access a shared variable, their processes are blocked and access to the variable is serialized, Thus, frequent access to shared variables reduces the parallelism, In particular, the parallelism is significantly reduced when a special shared variable - the 'allocation pointer' - is frequently accessed in the dynamic object allocation by an application program, In this paper, we propose a new method for allocating physical memory pages where the allocation pointer is monotonically increased in the virtual address space in contrast to the conventional method, This allows the critical sections for access to the allocation pointer to be executed effectively and atomically by using the fetch-and-add primitive, Our method improves the application program's parallelism by access to the allocation pointer with considerably short blocking time to the process. (C)1997 by John Wiley & Sons, Ltd..