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

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

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

DOI： 10.1109/CANDAR53791.2021.00013

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

DOI： 10.1109/candarw53999.2021.00073

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

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

DOI： 10.1109/ISCSIC54682.2021.00054

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

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.

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

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

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

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.

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

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

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

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

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

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

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

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

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.

Language：English  

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.

DOI： 10.1007/978-3-319-01433-3_11

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

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.

DOI： 10.1002/cpe.1582

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

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.

DOI： 10.1109/ICPP-W.2008.16

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

DOI： 10.1093/ietisy/e90-1.1.1

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

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.

DOI： 10.1002/cpe.963

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

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.

DOI： 10.1002/cpe.963

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

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.

DOI： 10.1007/s11235-005-4320-5

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

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.

DOI： 10.1007/s11235-005-4320-5

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

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.

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

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.

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

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.

DOI： 10.1107/S0909049500017696

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

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.

DOI： 10.1107/S0909049500017696

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

Meta-scheduling for a Cluster of Supercomputers

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

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.

DOI： 10.1002/(SICI)1096-9128(199709)9:9<897::AID-CPE282>3.0.CO;2-9

Responsible for pages：総ページ数：vii, 118p   Language：Others  

Responsible for pages：総ページ数：122p   Language：Japanese  

Responsible for pages：総ページ数：vi, 129p   Language：Japanese  

Language：Japanese   Book type：Scholarly book

Responsible for pages：総ページ数：xv, 741p   Language：Japanese  

Event date： 2020.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2020.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2020.1

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2019.11

Language：English  

Venue：Nagasaki   Country：Japan  

In recent years, the number of cyber attacks has been increasing rapidly and network security has become an important issue. As a vital component of defense against network threats, intrusion detection system (IDS) was introduced and machine learning algorithms have been widely used in such systems for high detection performance. There are several evaluation indices such as false positive rate, false negative rate, and so on. A problem is that these indices are often related to each other. For example, while we try to decrease the false positive rate, the false negative rate often tends to increase, and vice versa. In this study, we proposed an ANN based sequential classifier method to mitigate this problem. Specifically, we try to train ANN to have a low false positive rate, despite which may lead to high false negative rate. Then, the reported negative instances are sent to the next ANN to make a further investigation, where the false negative instances reported at the previous ANN may be classified correctly. In this way, the final false negative rate can also be improved greatly. The results of the experiment shows that the proposed method can bring lower false negative rate and higher accuracy of detection while making the false positive rate at an acceptable level. Moreover, the optimum number of ANNs for our proposal is also investigated and discussed in this study.

Event date： 2019.10

Language：English  

Venue：Tacoma   Country：United States  

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.

Event date： 2019.9

Language：English  

Venue：Vienna   Country：Austria  

This paper analyses the problem of efficiently routing XML documents on a network whose nodes are capable of distributed XML processing. The goal of our study is to find network paths for which XML documents' transmission will result in high likelihood that a large portion of the documents be processed within the network, decreasing the amount of XML processing at documents arrival at the destination site. We propose several routing algorithms for single route and multipath routing and evaluate them on a distributed XML network simulation environment. We show the benefits of the proposed XML routing algorithms as compared with widespread minimum hop routing strategy of the Internet.

Event date： 2019.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2019.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2019.3

Language：Japanese   Presentation type：Oral presentation (general)  

Country：Japan  

Event date： 2018.11

Language：English  

Venue：Takayama   Country：Japan  

Moving Target Defense (MTD) concept has been a feasible idea for reducing the possibility of attack happening through alternation attack surfaces or diversification the attribute or parameters of a protected system. As a result of applying MTD techniques to the system, an attacker would have more difficulties in exploiting a vulnerabilities of the target system. This study proposes an evaluation method of MTD systems combined with several different MTD techniques. The proposed method is a primary step in designing an evaluation model for the effectiveness of MTD. The main goal is to estimate the attack success ratio on the MTD systems mitigating from threats of executable binary file or malware injection. With the proposed evaluation method, we expect to prove that the MTD technology can enhance the security of a web server, and can be applied in a real-world information system. As our preliminary work done, we set up a prototype framework to validate the proposed work in a pseudo-experimental environment.

Event date： 2018.11

Language：English  

Venue：Takayama   Country：Japan  

In 2021, it is anticipated that there will be approximately 30 billion Internet of Things (IoT) devices. The tremendous aggregate value of the IoT makes it a tempting and lucrative target for cyber criminals. The breakout of Mirai malware, which compromises poorly secured IoT devices with factory-default username and passphrase to launch Distributed Denial of Service (DDoS) attacks, has raised broad awareness towards the need for increased IoT security. To better defend against Mirai infection and spread, it is critical to know how the malware operates as the first step. In this paper, we give a combined static and dynamic analysis of Mirai, basing on the results of which, we introduce the application of Threat Tracer. Threat tracer is an information system simulator initially developed to help design a system robust against Advanced Persistent Attacks(APT). It offers an intuitive track on how a cyber threat behaves in a complicated networked system. The feedback simultaneously contributes to revealing vulnerabilities of a system. Our work focuses on the replication of Mirai Malware's operating processes in Threat Tracer simulation. By achieving doing so, we believe it could offer a comprehensible description of how Mirai acts. Also, considering the continuous emergence of Mirai variants, the simulation serves as a predictor on upcoming threats' behavior patterns.

Event date： 2018.5

Language：English   Presentation type：Oral presentation (general)  

Venue：Kyushu University, Fukuoka, JAPAN   Country：Japan  

Event date： 2018.2 - 2018.3

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：東京工業大学 大岡山キャンパス   Country：Japan  

Event date： 2018.1

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：高知工科大学永国寺キャンパス   Country：Japan  

Event date： 2017.10

Language：Japanese   Presentation type：Oral presentation (general)  

Venue：山形国際ホテル   Country：Japan  

Event date： 2017.6

Language：English   Presentation type：Oral presentation (general)  

Venue：Kyushu University, Fukuoka, JAPAN   Country：Japan  

Event date： 2014.12

Language：English  

Venue：Kitakyushu   Country：Japan  

Actors model, a general model of concurrent computation, is often used for specified applications. The attacks tracer on advanced persistent threats, APTs, is one of such applications. It investigates the act of information system consists of several elements, like routers, servers, terminals and networked applications. The authors describe an implementation of the attacks tracer by using actors model. The authors also show the actors model is more suitable to implement this application than other previous models.

Event date： 2014.4

Language：English  

Venue：Barcelona   Country：Spain  

Nowadays, multicore CPU become popular technology to enhance services quality in Web services. This paper characterizes parallel distributed XML processing which can off-load the amount of processing at their servers to networking nodes with varying number of CPU cores. Our implemented distributed XML processing system sends XML documents from a sender node to a server node through relay nodes, which process the documents before arriving at the server. When the relay nodes are connected in tandem, the XML documents are processed in a pipelining manner. When the relay nodes are connected in parallel, the XML documents are processed in a parallel fashion. For well-formedness and grammar validation tasks, the parallel processing reveals inherent advantages compared with pipeline processing regardless of document type, number of CPU cores and processing environment. Moreover, the number of CPU cores impacts efficiency of distributed XML processing via buffer access contention.

Event date： 2012.9

Language：English  

Venue：Pittsburgh, PA   Country：United States  

This paper proposes and evaluates a SIMD parallelization method for an application for LSI logic simulation. The proposal method converts a net list into a parallel and distributed program code so as to make the code SIMD parallelized. As experiments to evaluate our proposal method, tasks in SIMD arithmetic logical units on Cell/B.E., and we measure that elapsed time. In the results of experiments, over 80% tasks are SIMD parallelized and the program with a shuffle instruction and a SIMD instruction reduces computation time by over 90%.

Event date： 2012.4

Language：English  

Venue：Porto   Country：Portugal  

This paper characterizes distributed XML processing on networking nodes. XML documents are sent from a client node to a server node through relay nodes, which process the documents before arriving at the server. According as the node topology, the XML documents are processed in a pipelining manner or a parallel fashion. We evaluate distributed XML processing with synthetic and realistic XML documents on real and virtual environments. Characterization of well-formedness and grammar validation processing via pipelining and parallel models reveals inherent advantages of the parallel processing model.

Event date： 2011.11 - 2011.12

Language：English  

Venue：Fukuoka   Country：Japan  

In this paper, we propose an extension to our previous MVA based methodology for estimating performance of transactions executed on multi-server systems for multicore servers. The extension is based on the characterization of message processing service times for each server core under zeroload conditions, and building an MVA model that accounts for each available core. Core utilization is characterized, as well as message routing probabilities within the multi-core machine. We illustrate the extended methodology on a prototype multi-server system.

Event date： 2011.5

Language：English  

Venue：Noordwijkerhout   Country：Netherlands  

This study characterizes distributed XML processing on networking nodes. XML documents are sent from a client node to a server node through relay nodes, which process the documents before arriving at the server. When the relay nodes are connected in tandem, the XML documents are processed in a pipelining manner. When the relay nodes are connected in parallel, the XML documents are processed in a parallel fashion. We evaluate distributed XML processing with synthetic and realistic XML documents. Well-formedness and grammar validation pipelining and parallel processing characterization reveals inherent advantages of the parallel processing model.

Event date： 2011.5

Language：English  

Venue：Noordwijkerhout   Country：Netherlands  

This study characterizes distributed XML processing on networking nodes. XML documents are sent from a client node to a server node through relay nodes, which process the documents before arriving at the server. When the relay nodes are connected tandem, the XML documents are processed in a pipelining manner. When the relay nodes are connected parallel, the XML documents are processed in a parallel fashion. Well-formedness and grammar validation pipelining and parallel processing characterization reveals inherent advantages of the parallel processing model.

Event date： 2010.11

Language：English  

Venue：Thessaloniki   Country：Greece  

In this paper, we propose an extension to our previous MVA based methodology for estimating performance of transactions executed on multi-server systems to transactions involving variable data transfers. The extension is based on the characterization of data transfers between servers under zeroload conditions, and a curve fitting step to capture server message processing time dependency with the size of the data transferred. We illustrate the extended methodology on two prototype multiserver systems.

Event date： 2009.11

Language：English  

Venue：Barcelona   Country：Spain  

In this paper, we demonstrate how to characterize transactions executed on multi-server systems. The characterization is performed with the help of readily available open source components, and is used to build a Mean Value Analysis model in order to estimate transaction response times for arbitrary loads, as well as system capacity. Although an E-Commerce system is used, the characterization method described is applicable to any multi-server system.

Event date： 2009.7

Language：English  

Venue：Sousse   Country：Tunisia  

In this paper, we introduce a Mean Value Analysis based methodology for 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 estimate system capacity. Finally, we exemplify the methodology usage via transactions implemented in two distributed Linux systems.

Event date： 2000.9

Language：English  

Venue：Balatonfured   Country：Hungary  

In this paper, we present a communication library which extends an MPI application on a single parallel machine to a cluster of parallel machines. Stampi provides some functionality which are required for constructing distributed applications and environments based on the MPI2 standard with a focus on dynamic process management. Since the mechanism of communication bridge is transparent for users, it is very useful to assemble and link MPI applications on meta-computer systems. Furthermore Stampi supports novel functions; one is the communication between a Java applet to the backend parallel computer. Another is supporting remote file-IO. Both give us a framework of distributed resource management based on an MPI communication infrastructure. This paper covers the architecture of Stampi.

Event date： 1995.10

Language：English  

Venue：Tokyo, Jpn   Country：Other  

This paper proposes a new real-time garbage collection that always preserves the order of object creation. Some programming languages and application programs need to preserve the generated order of objects. The proposed method is the first type of the garbage collection that can be used to make them run in real-time. Since the generated order preserving scavenging garbage collection is partly employed, the complexity of the proposed method is not related to the heap size. The requirements for the real-time processing is also presented.

Event date： 1995.9

Language：English  

Venue：Kinross   Country：United Kingdom  

The design and analysis of a new GC scheme called MOA is presented with its implementation on PLisp (Portable Lisp). MOA is "stop-and-collect" type GC and is based on a Morris's sliding compaction scheme. MOA has the excellent features such as: (1) it can perform sliding compaction with a time proportional nearly to the size of all data objects in use, (2) it requires an additional space of a small size to achieve such a time cost saving, (3) it can skip a GC process for a special cluster called an "anchor", reducing the total GC processing time considerably. MOA has been successfully implemented on PLisp which provides a large amount of storage space. MOA is superior to other GC based on conventional sliding compaction and copying collection, as shown in several experiments.

Language：Japanese  

Language：Japanese  

A Proposal of Web Application Framework Which Has an Embedded Honeypot

Language：Japanese  

Proposal of Attack Detection Method on Hoppin, Attack Detection and Defense System for Web Applications

Language：Japanese  

Towards Efficient Detection of U2R and R2L Attacks using ANN

Language：Japanese  

Proposal and Evaluation of Multiple Routing Algorithm for Distributed XML Processing

Language：Japanese  

Collecting of Attack Methods for Web Applications

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

Language：Japanese  

Design and Implementation of Hoppin, a System Detecting Attacks to Web Applications and Defenses Them
情報システムに対する攻撃手法が近年変化してきており，特定の組織を対象とした標的型攻撃が増加している．その一方でWebアプリケーション等の情報システムはクラウド環境にも用いられており，より大規模かつ複雑になっている．そのため，運用中の情報システムすべてを把握することが難しくなっている．そこで既存のWebアプリケーションを変更しなくても，Webアプリケーションと密に連携したセキュリティ機能を持つことは有用である．筆者らは既存のWebアプリケーションにハニーポットの機能を持つようにすることで，Webアプリケーションそのものを攻撃から保護し，攻撃の検出と情報収集を可能にするシステムHoppinを提案している．本研究発表では，Hoppinの設計と実装について議論する．Recent cyber-attacks to information systems more sophisticated and more complex. And attacks to organizations are increasing becoming the mainstream Advanced Persistent Threat Attacks. On the other hand, it is difficult to understand all complicated systems, because information systems consisted on web applications use cloud computing and other information technologies so that they become larger scale and more complex. Therefore, it is required to web applications themselves have cyber security functions, because it is difficult to defend all complicated information systems from attacks. We propose Hoppin, a system of method which makes existing web applications honeypots. The system is able to protect for Web application from attacks, detect and collect attack information. In this research, we discuss the design and implementation of Hoppin.

Language：Japanese  

A Trial of Extracting Activity Pattern by Using Activities on PC on Auxiliary Environment for Practical Programming Education

Language：Japanese  

An Analysis to Attach Labels to Classify Behaviors of Leaners of Programming

Language：Japanese  

A Proposal for Routing Algorithms of Distributed XML Processing
本発表では分散XML処理を行うことができるノードで構築されたネットワーク上におけるXMLドキュメントのルーティング問題について述べる．本研究の目的は，ドキュメントがより多くネットワーク上で処理される経路を発見し，クライアントでのドキュメント処理を減少させることである．そのため，分散XML処理に適したルーティングアルゴリズムを提案し，ソースルーティングを用いたXMLネットワークシミュレーション環境上で評価を行った．本発表では，現在主流となっている最短経路ルーティングと比較した提案ルーティングアルゴリズムの利点を述べる．This presentation analyses the problem of XML document routing on a network which nodes are capable of distributed XML processing. The goal is to find network paths for which XML document transmission will result in high likelihood that a large portion of the document be processed within the network, decreasing the amount of XML processing at document arrival at the client side. We propose an appropriate routing algorithm, and evaluate it on a distributed XML network simulation environment which supports source routing. We show the benefits of such a scheme, as compared with widespread minimum hop routing strategy.

Language：Japanese  

A New Task Scheduling Method for Applications Which Produce and/or Delete Tasks Dynamically
近年，Webアプリケーションのように人の操作によって後からタスクが追加・分割されるような動的なアプリケーションが増加している．このようなアプリケーションを効率良く運用するためには，並列分散環境での運用が有効であり，並列分散環境を用いる場合，実行単位となる各タスクを依存関係に基づいてどのような順番で各計算機に割り当てるかというタスクスケジューリングが重要になる．このためタスク間の依存関係を考慮したスケジューリン手法が多く提案されている．しかしながら，様々なスケジューリング手法が提案されているが，動的なタスクに対して依存関係を表すタスクグラフを対応させてスケジューリングを行うような手法は提案されていない．そこで本発表では，スケジューリング手法の1つであるCP/ETF/MISF法を基に，後からノードが変化させるタスクグラフを用い，タスクグラフの動的な変更に対応できるスケジューリング手法を提案することで，動的なアプリケーションに対するタスクスケジューリングの効率化を目指す．標準タスクグラフを用いて，依存関係を保ったままスケジューリングを行えるようにAkkaのActorモデルで実装し，評価実験を行う．In these years, the dynamic applications which include web applications have been increasing. The applications will dynamically produce, divide and/or delete tasks by human operations. A new task scheduling method will be required to execute these applications in the parallel and distributed environments. Various task scheduling methods have been proposed. But task scheduling methods which permit us to append and delete tasks runtime have not been proposed. In this paper, we propose a new task scheduling method which permits it. And we make dynamic applications execute efficiently. The scheduling method is based on CP/ETF/MISF.

Language：Japanese  

An analysis of the programming learning process using exhaustive records

Language：Japanese  

Development of TicketNote to Support the Design of Learner Centered Class for a Flipped Classroom

Language：Japanese  

Application to telemedicine and proposed the Integrated Multi-VPN in the transport layer
The authors propose Integrated Multi-VPN which can connect to several VPNs at same time easily. The proposed method can realize to connect to several VPNs at same time, because it designs the routing dynamically in the transport layer. It is difficult to connect to several VPNs when we use ordinary network technologies, IPSecVPN and SSL-VPN. Our method can be applied to implement secure networks to link multiple hospitals for telemedicine. The authors also conduct demonstrations with virtual environments to evaluate the proposed method for availabilities of telemedicine.

Language：English  

YALMS : A Data Structure for Storage and Replay of Multimedia Content in Digital Classes
Content in digital classes - a loosely defined aggregation of audiovideo, screen capture, slides, notes and complimentary files - needs a standard format for storage and replay. The closest to this objective is SMIL - a language which can describe the timeline of complex multimedia sessions. The format presented in this paper is part of the larger YALMS educational software and goes one step further than SMIL. The proposed format supports realtime recording, partial updates of content, and finally replay of the entire class. Recording and updates require a server as backend but the class can be replayed directly from storage by a web application.

Language：Japanese  

A proposal of visualization system for security contests

Language：English  

YALMS : A Data Structure for Storage and Replay of Multimedia Content in Digital Classes
Content in digital classes - a loosely defined aggregation of audiovideo, screen capture, slides, notes and complimentary files - needs a standard format for storage and replay. The closest to this objective is SMIL - a language which can describe the timeline of complex multimedia sessions. The format presented in this paper is part of the larger YALMS educational software and goes one step further than SMIL. The proposed format supports realtime recording, partial updates of content, and finally replay of the entire class. Recording and updates require a server as backend but the class can be replayed directly from storage by a web application.

Language：English  

YALMS : A Group Drive API for Cloud-Based Classrooms
Although there are many cloud drive APIs and applications (clients mostly) today, they are not optimized for group activities in cloud-based classrooms. Specifically, such APIs are weak in face of realtime interactivity and large data bulks. YALMS is a newly developed open source educational package which in this presentation is augmented with a group drive functionality. This paper poses the optimization problem involved in a group drive in clouds and presents implementations of both server and client sides of the respective API.

Language：Japanese  

Detection of Suspicious HTTP Communication Based on Cookie Insertion by HTTP Proxy

Language：Japanese  

A Malware Damage Analysis Based on Modeling Data of Local Network in an Organization and Malwares

Language：Japanese  

Break Away from Button-UI to Gesture Operation on Touch Device
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.

DOI： 10.11309/jssst.30.4_36

Language：Japanese  

Improving Shared Buffer Architecture for Streaming Data Processing to XML Data
本研究では,ネットワーク通信時に転送途中のデータに対して中継ノードが行うストリーミングデータ処理を提案し,その効率化を目指す.このために,XML文書の分散処理を例として取り上げ,例証アプリケーションを実装し,その性能評価を行う.この例証アプリケーションは,送信元の計算機から宛先の計算機へXML文書を転送する際,通信を中継するノードでXML文書に対して文法チェックを行うことにより,送信先の計算機では文法チェック済みのXML文書を得ることができる.このアプリケーションを用いた実験と考察の結果をもとに,中継ノードにおいて処理を行うためにデータの一時格納に用いるバッファの更なる改良を試みた.その結果,アプリケーションの性能が改善されたとともに,今後,複数のCPUコアを用いた並列処理に資する有益な結果を得ることができた.

Language：Japanese  

Language：Japanese  

Language：Japanese  

Language：Japanese  

A Proposal of Measure Support for APT and it Parallel Distributed Processing by Task Scheduling Method

Language：Japanese  

A Domain Specific Language to represent Information Systems and Malware for examining Advanced Persistent Threat

Language：Japanese  

Characteristics of Streaming Data Processing on Relay Nodes
A purpose of this study is an efficiency improvement of streaming data processing. For this purpose, we focused distributed XML processing as an example, and implemented an application which processes streaming data on networking nodes. XML documents are sent from a client node to a server node through relay nodes, which process the documents before arriving at the server. When the relay nodes are connected tandem, the documents are processed in a pipelining manner. When the relay nodes are connected parallel, the documents are processed in a parallel fashion. The authors evaluated the distributed XML processing, then characterized it.

Language：Japanese  

Demonstration of management and control of large scale resources : Toward the establishment of a future network platform
Towards further penetration of cloud computing services and establishment of future network architectures, a control framework for managing large scale ICT resources is required to provide ICT environments suited for user&#039;s objectives. A resource providing platform managing ICT resources deployed over multiple networks is developed to allocate suited resources for users. Advanced relay node adoptively providing suitable functions (e.g. data cache) is also developed and maintained communication quality under the traffic congestion.

Language：Japanese  

Implementation and Evaluation of a Parallel Application which Processes Streaming Data on Relay Nodes

Language：Japanese  

Implementation and Evaluation of a Parallel Application which Processes Streaming Data on Relay Nodes
The authors use XML documents as an example and implement and evaluate a parallel application which processes streaming data on relay nodes to promote the efficiency of streaming data processing. In the application source nodes send XML documents to a destination node through many relay nodes. The relay nodes process XML documents in streaming data in pipelined and/or data parallel. Finally, the destination node check all unchecked tags and can receive processed streaming data. The authors discuss characteristics and problems of our application in this paper.

Language：Japanese  

B-7-33 Experiment on ICT Services with Wireless Networks in Shopping Arcade of Kitakyushu-city

Language：Japanese  

北九州市街地における無線ネットワークを利用したICTサービス提供実験

Language：Japanese  

Sun SPOTを利用したPBLの実践報告

Language：Japanese  

Adaptive network services enabled by advanced relay node
Due to explosive growth of Internet usage with diversifying communication technologies and applications, the current Internet is facing serious problems and approaching a turning point. To achieve scalability, diversity and harmony with human society, more effective and flexible sharing schemes of network resource are required. Especially when a number of large-scale distributed applications share the resource, efficacy on comprehensive usage of network, computation, and storage resources is needed from the viewpoint of information processing and application as the ultimate goal. Therefore, reconsideration of coordination and partitioning of functions between networks (providers) and applications (users) becomes a recent research topic. In this paper, we discuss the feasibility and issues of flexible and adaptive network services by introducing advanced relay nodes inside the network.

Language：Japanese  

User-Network Interaction based Ubiquitous Network management system
Ubiquitous networks enables us to access any information from anywhere involuntarily. In such environment, the networks should infer the users&#039; unclear request. However, the conventional networks could not treat users&#039; subjective demand. On the other hand, we have developed the multi-class QoS router which can control the class based routing depend on the user&#039;s profile. Therefore, we have proposed the unified system among multi-class QoS routing module, task scheduling module and subjective request inferring module, which can provide the best quality network service to each users. In this paper, we explain the video streaming system which is developed in the Ubila project based on the proposed system, and show the results.

Language：Japanese  

The Basic Design for a System to Utilize the History of Activity and Findings to Develop it Progressively

Language：Japanese  

A New Task Scheduling Method for Processing of Streaming Data in an Environment Including Several Networks Having Different Characteristics
This paper proposed and evaluated a new task scheduling method for parallel and distributed applications in an environment including several networks having different characteristics. The proposed method can schedule both streaming applications and non-streaming applications well at a same time, since it selects the most suitable networks for the communications of tasks and considers the changing loads of the networks. In the experimental results, the proposed method reduces the total execution time of a practical streaming application. The dispersion of the execution time is also suppressed even if the network bandwidth is dynamically changing. This characteristic is very useful when this method combines more complicated task scheduling methods.

Language：Japanese  

A New Task Scheduling Method for Processing of Streaming Data in an Environment Including Several Networks Having Different Characteristics

Language：Japanese  

The Basic Design for a System to Utilize the History of Activity and Findings to Develop it Progressively
We have developed NecoLogger, a recording-retriving system that records the entire activity of personal computer use. Using NecoLogger, users can retrieve useful information and utilize it for their current problem solving. In this paper we report the overall design of the system and the details of its implementation. We also report the operational findings to show the usefulness of this system. In order to retrieve user activities efficently, we record the textual information of the creen regardless of the applications software by utilizing API hooks in OS. We also record screen images intermittently to restore the entire activity of a user. Logging the user's entire activity requires large amount of data area and it is necessary to reduce the amount to a practical level. We reduce the amount by taking screen shots at the optimal interval. Since our system should be developed extensively in the course of the development, we had to modify data structures quite often to store logging data. We adopted the XML format to meet the requirement. By adopting these methods mentioned above, we have been able to accumulate logging data continuously and have developed the system progressively to meet the newly found requirements based on the actual uses of the system.

Language：Japanese  

Development of the three dimension GUI based information environment for advanced use for history.

Language：Japanese  

The Influence on Application Performance by Network Characteristics in Grids
In the Grid computing, it is a key issue how limited Grid resources are effectively shared by various applications executed in parallel 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 terms of network resources, the communication of an application changes the condition of network resources, which may, in turn, affect the communications in other applications sharing the identical network resources, 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.

Language：Japanese  

Evaluation and reform of procedure of prediction in the Resource Information Server
For the purpose optimum resource assignment in the distributed computing enviornment, we have depeloped the Resource Infomation Server(RIS). RIS gathers resource infomation, CPU and network loads, on a computer on distributed computing, and predicts the future resource. Today RIS system has two kinds of prediction procedure, they are the similary procedure and the average procedure. The first procedure predict by searching the most similar sequence of resource information to a recent trend of resource information. The second procedure predict by calculation average of a recent trend of resource information, we reformed the similar procedure the purpose of improvement it, and search optimized parameter for it. In this paper, a summary of RIS system, reform point for the similary procedure, evaluation and result are described.

Language：Japanese  

Hiding remote page access latency with multithreading in Software Distributed Shared Memory system

Language：Japanese  

Evalution of new procedure of prediction in the Resource Information Server
For the purpose optimum resource assignment in the distributed computing enviornment, we have depeloped the Resource Infomation Server(RIS). RIS gathers resource infomation, CPU and network loads, on a computer on distributed computing, and predicts the future resource. Old RIS system was implemented C language and STAMPI library. Now RIS system is implemented JAVA and JAVA RMI. Because it isn&#039;t depend the platforms. Procedures to predict future resource information were changed. The similary procedure is based that module predicts it with much smaller error. The average procedure is based that module predicts it with recent trend. In this paper, the implementation of new RIS system, measuring and procedure to predict future the resource infomation, and evalutions of accuracy of prediction of future resource infomation are described.

Language：Japanese  

Hiding remote page access latency with multithreading in Software Distributed Shared Memory system
We have designed and implemented a software distributed shared memory system, hiding remote page access latency with multithreading. This system consists of two types of thread, computational thread and scheduler thread, which are connected with local TCP socket each other. When the page fault occur by a computational thread, page fault notice is sent to scheduler thread via local socket from page fault handler. After receiving the page fault notice, scheduler thread send a remote page request to home node of requested page, and invoke a computational thread which is not executing currently. The experiment on 16 processors shows that NPB CG benchmark with 4 computational thread runs 17% faster than that with 1 computational thread.

Language：Japanese  

Study for the Influences of Network Characteristics to Application Performance in the Grid Environment

Language：Japanese  

Design and Implementation of Software Distributed Shared Memory system that Realize the Communication Optimization by Task Moving

Language：Japanese  

T - SDSM : Task - based Software Distributed Shared Memory based on Task - Parallel processing Framework
In heterogeneous eomputing environments such as PC-Cluster and Grid, it is difficult to execute parallel programs with a high average resource utilzation rate. And also, it is necessary to conceal the heterogeneity from the programmers. Therefore, we propose a new method for the parallel programs based on the shared memory model such as OpenMP. In our method, at the compile time, a parallel source program is translated to a set of tasks and is scanned to generate the function for calculating the memory address accessed by these tasks. The system, T-SDSM, which we propose in this paper realize a shared memory space by calling the function described above. And T-SDSM provides task allocation with a high average resource utilization rate. This paper describes the mechanism of T-SDSM, and reports our ideas about communication optimization technique by T-SDSM.

Language：Japanese  

Improvement of the Mail Format in the Distributed Multimedia Mail System and Implementation of a Mail User Agent Using Java

Language：Others  

Language：Japanese  

Design and Development of a Distributed Multimedia Mail System and its Evaluation

Language：Japanese  

Design and Development of a Distributed Multimedia Mail System and its Evaluation

Language：Japanese  

Reserch for global computing : Globus Toolkit introduction

Language：Japanese  

Research for global computing - Globus Toolkit introduction -

Language：Japanese  

Reserch for global computing-Globus Toolkit introduction-

Language：Others  

Language：Japanese  

Improvement of the Mail Format in the Distributed Multimedia mail System and Implementation of a Mail User Agent Using Java

Language：Japanese  

Design and Implementation of Software Distributed Shared Memory system that Realize the Communication Optimization by Task Moving
This paper describes that the design and implementation detail of runtime system for OpenMP &#039;T-SDSM&#039;. T-SDSM is the software DSM system for hetrogeneous computing environments such as PC-Cluster and Grid, and for distributed computing systems that have synamic load change. T-SDSM has two functions. One is the data caching, and the other is the task moving. The data caching function loads the memory block accessed by the task from remote node, and many other SDSM system has this function. The task moving function move the task to home node that is owner of the memory block accessed by the task. The evaluation result of T-SDSM with laplace program don&#039;t show the effectiveness of communication optimization by the task moving function, because T-SDSM has a large overhead on task execution. However, the evaluation result with critical section show that the effectiveness by task moving.

Language：Japanese  

メタスケジューリングのための資源情報サーバの構築

Language：Japanese  

IMPLEMENTATION OF RESOURCE INFORMATION SERVER FOR META-SCHEDULING

Language：Japanese  

Development of a Software System (STA: Seamless Thiking Aid) for Distributed Parallel Scientific Computing

Language：Japanese  

Development of a Software System (STA: Seamless Thinking Aid) for Distributed Parallel Scientific Computing

Language：Japanese  

トカマクプラズマ計算(NEXT)における異機種並列計算機を結合したハイブリッドコンピューティング

Language：Japanese  

DEVELOPMENT OF AN INTEGRATED ENVIRONMENT FOR HETEROGENEOUS PARALLEL COMPUTERS ON STA

Language：Japanese  

DISTRIBUTED PARALLEL SCIENTIFIC COMPUTING ENVIRONMENT STA (3) : DEVELOPMENT OF A MESSAGE PASSING LIBRARY FOR HETEROGENEOUS PARALLEL COMPUTER CLUSTER

Language：Japanese  

DISTRIBUTED PARALLEL SCIENTIFIC COMPUTING ENVIRONMENT STA(2) : DEVELOPMENT OF THE EDITOR-CENTRIC PARALLEL PROGRAM DEVELOPMENT ENVIRONMENT PPDE

Language：Japanese  

DISTRIBUTED PARALLEL SCIENTIFIC COMPUTING ENVIRONMENT STA(1) : OVERVIEW

Language：Japanese  

並列分散科学技術計算の支援環境 SSP

Language：Japanese  

Language：Japanese  

OSCARマルチグレイン並列化コンパイラを用いたスーパーコンピュータクラスタのためのメタ・スケジューリング手法

Language：Japanese  

Meta-scheduling for a Super computer Cluster using OSCAR Fortran Multigrain Parallelizing Compiler

Language：Japanese  

Stampi : A Message Passing Library for Distributed Parallel Computing

Language：Japanese  

Development of an integrated environment for heterogeneous parallel computers on STA.

Language：Japanese  

Distributed parallel scientific computing environment STA. (1). Overview.

Language：Japanese  

Distributed parallel scientific computing environment STA. (2). Development of the editor-centric parallel program development environment PPDE.

Language：Japanese  

Distributed parallel scientific computing environment STA. (3). Development of a message passing library for heterogeneous parallel computer cluster.

Language：Japanese  

Hybrid Simulation in Tokamak Plasma.

Language：Japanese  

Conception of meta-scheduling for different machine parallel distributed computing.

Language：Japanese  

Language：Japanese  

Design and Implementation for a New Integrated User Environment for Scientific Computing on a Parallel Computer Cluster
For the propose of efficient processing of scientific computation which requires enormous computational resources, distributed parallel computing becomes a major interest in the recent years. To develop codes and to execute them on the distributed parallel environment require new infrastructure such as common communication layer between parallel computers. The authors propose a new integrated environment, STA environment version 2, which has the common communication layer and includes required services for the distributed parallel computation. The authors also apply the proposed environment to instances of scientific computation.

Language：Japanese  

DEVELOPMENT OF STA(SEAMLESS THINKING AID)PROGRAMMING ENVIRONMENT

Language：Japanese  

A Distributed Garbage Collection based on Large Virtual Address Space
In distributed environments, dynamic object allocation is strongly expected. At this time, garbage collection as an automatic memory management system is indispensable. Under the condition that every processor has a large virtual address space as its own local space, a new distributed garbage collector DC1 proposed in this paper does not spoil the scalability of distributed memory multiprocessors, has an ability to collect all types of data structures of garbage including cycle among several processors, and does not have any run-time overheads. Basically, the proposed collector employs Hughes&#039;s method, but does not propagate time-stamps over reachable objects. Therefore, the proposed collector does not require a space to restore a time-space in every object, and can employ an efficient copying collector as a local collector.

Language：Japanese  

An Algorithm of Generational Copying Garbage Collection Based on the Generated -Order- Preserving Property
We present a new method for generational copying garbage collection. The copying scheme has been widely used for implementing generational garbage collectors. All the previous methods require certain kinds of special tables for handling pointers from old objects to new objects at runtime. Our method requires none of those tables. The basic idea is to compute the boundary between the new region and the old region in order to remove all reverse pointers. By using the generate-order-preserving property, older objects can always be promoted to the old region earlier than younger objects.

Language：Japanese  

On the Copying Garbage Collector which Preserves the Generated Order
A new algorithm for the copying garbage collection is presented, in which generated order of objects in the heap space is always preserved. The basic idea is to sort the set of all pointers to active objects in the destination semispace. The amount of time of this sorting is relatively small if we use a fast sorting algorithm for the set of fixed-sized integers. The basic algorithm is further improved to eliminate the explicit marking bits. A simple bit-table suffices for this purpose, but it requires the cost proportional to the size of the heap space. Another method is presented, which replaces the marking bit with a pair of mutual pointers for each object. The cost of this method depends only on the number of active objects. Some applications of our algorithm are briefly discussed.

Type：Competition, symposium, etc. 

Number of participants：800

Type：Competition, symposium, etc. 

Type：Academic society, research group, etc. 

Type：Peer review 

Number of peer-reviewed articles in Japanese journals：2

Proceedings of International Conference Number of peer-reviewed papers：6

ProSec-IT/SECKUN　の主体的な実施

厚生労働省教育訓練プログラム開発事業　SECKUN の開発を受託

平成29年度「成長分野を支える情報技術人材の育成拠点の形成（enPiT）」enPiT-Proに７つの連携校とともに共同申請した取り組みが採択された．

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Other

ProSec-IT(enPiT-Pro)における連携大学のひとつとして120時間超のサイバーセキュリティに関連する演習中心の履修証明プログラムを社会人に対して提供した．22名が受講し，最終的に25名全員が修了した．代表校も含めて７つある連携大学の中でももっとも受講生を集めており，受講生からも好評を受けることができた．

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Other

ProSec-IT(enPiT-Pro)における連携大学のひとつとして120時間超のサイバーセキュリティに関連する演習中心の履修証明プログラムを社会人に対して提供した．22名が受講し，最終的に25名全員が修了した．代表校も含めて７つある連携大学の中でももっとも受講生を集めており，受講生からも好評を受けることができた．

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Other

ProSec-IT(enPiT-Pro)における連携大学のひとつとして120時間超のサイバーセキュリティに関連する演習中心の履修証明プログラムを社会人に対して提供した．22名が受講し，最終的に22名全員が修了した．代表校も含めて７つある連携大学の中でももっとも受講生を集めており，受講生からも好評を受けることができた．

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Seminar, workshop

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Seminar, workshop

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Other

ProSec-IT(enPiT-Pro)における連携大学のひとつとして120時間超のサイバーセキュリティに関連する演習中心の履修証明プログラムを社会人に対して提供した．１８名が受講し，最終的に18名全員が修了した．代表校も含めて７つある連携大学の中でももっとも受講生を集めており，受講生からも好評を受けることができた．

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

インターネットサービスの犯罪対策として，詐欺ショッピングサイト、カード不正利用、オークション詐欺対策などの紹介を行った．

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Seminar, workshop

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Seminar, workshop

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture

Audience：General,　Scientific,　Company,　Civic organization,　Governmental agency

Type：Lecture