| 1. |
Detection and isolation malware by dynamic routing Moving Target Defense with proxies. |
| 2. |
A Proposal of Web Application Framework Which Has an Embedded Honeypot. |
| 3. |
Proposal of Attack Detection Method on Hoppin, Attack Detection and Defense System for Web Applications. |
| 4. |
Towards Efficient Detection of U2R and R2L Attacks using ANN. |
| 5. |
Collecting of Attack Methods for Web Applications. |
| 6. |
Proposal and Evaluation of Multiple Routing Algorithm for Distributed XML Processing. |
| 7. |
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.. |
| 8. |
A Trial of Extracting Activity Pattern by Using Activities on PC on Auxiliary Environment for Practical Programming Education. |
| 9. |
An Analysis to Attach Labels to Classify Behaviors of Leaners of Programming. |
| 10. |
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.. |
| 11. |
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.. |
| 12. |
An analysis of the programming learning process using exhaustive records. |
| 13. |
Development of TicketNote to Support the Design of Learner Centered Class for a Flipped Classroom. |
| 14. |
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.. |
| 15. |
ZHANIKEEV Marat, KOIDE Hiroshi, YALMS : A Data Structure for Storage and Replay of Multimedia Content in Digital Classes (情報通信マネジメント), 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, Vol.113, No.380, pp.25-28, 2014.01, 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.. |
| 16. |
ZHANIKEEV Marat, KOIDE Hiroshi, YALMS : A Data Structure for Storage and Replay of Multimedia Content in Digital Classes (ライフインテリジェンスとオフィス情報システム), 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, Vol.113, No.381, pp.25-28, 2014.01, 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.. |
| 17. |
A proposal of visualization system for security contests. |
| 18. |
ZHANIKEEV Marat, KOIDE Hiroshi, YALMS : A Group Drive API for Cloud-Based Classrooms (情報ネットワーク), 電子情報通信学会技術研究報告 = IEICE technical report : 信学技報, Vol.113, No.303, pp.19-22, 2013.11, 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.. |
| 19. |
Detection of Suspicious HTTP Communication Based on Cookie Insertion by HTTP Proxy. |
| 20. |
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.. |
| 21. |
A Malware Damage Analysis Based on Modeling Data of Local Network in an Organization and Malwares. |
| 22. |
Improving Shared Buffer Architecture for Streaming Data Processing to XML Data
本研究では,ネットワーク通信時に転送途中のデータに対して中継ノードが行うストリーミングデータ処理を提案し,その効率化を目指す.このために,XML文書の分散処理を例として取り上げ,例証アプリケーションを実装し,その性能評価を行う.この例証アプリケーションは,送信元の計算機から宛先の計算機へXML文書を転送する際,通信を中継するノードでXML文書に対して文法チェックを行うことにより,送信先の計算機では文法チェック済みのXML文書を得ることができる.このアプリケーションを用いた実験と考察の結果をもとに,中継ノードにおいて処理を行うためにデータの一時格納に用いるバッファの更なる改良を試みた.その結果,アプリケーションの性能が改善されたとともに,今後,複数のCPUコアを用いた並列処理に資する有益な結果を得ることができた.. |
| 23. |
A Domain Specific Language to represent Information Systems and Malware for examining Advanced Persistent Threat. |
| 24. |
A Proposal of Measure Support for APT and it Parallel Distributed Processing by Task Scheduling Method. |
| 25. |
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.. |
| 26. |
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'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.. |
| 27. |
Implementation and Evaluation of a Parallel Application which Processes Streaming Data on Relay Nodes. |
| 28. |
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.. |
| 29. |
B-7-33 Experiment on ICT Services with Wireless Networks in Shopping Arcade of Kitakyushu-city. |
| 30. |
北九州市街地における無線ネットワークを利用したICTサービス提供実験. |
| 31. |
Sun SPOTを利用したPBLの実践報告. |
| 32. |
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.. |
| 33. |
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' unclear request. However, the conventional networks could not treat users' 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'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.. |
| 34. |
The Basic Design for a System to Utilize the History of Activity and Findings to Develop it Progressively. |
| 35. |
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.. |
| 36. |
A New Task Scheduling Method for Processing of Streaming Data in an Environment Including Several Networks Having Different Characteristics. |
| 37. |
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.. |
| 38. |
Development of the three dimension GUI based information environment for advanced use for history.. |
| 39. |
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.. |
| 40. |
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.. |
| 41. |
Hiding remote page access latency with multithreading in Software Distributed Shared Memory system. |
| 42. |
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.. |
| 43. |
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'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.. |
| 44. |
Study for the Influences of Network Characteristics to Application Performance in the Grid Environment. |
| 45. |
Design and Implementation of Software Distributed Shared Memory system that Realize the Communication Optimization by Task Moving. |
| 46. |
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.. |
| 47. |
Improvement of the Mail Format in the Distributed Multimedia Mail System and Implementation of a Mail User Agent Using Java. |
| 48. |
Improvement of the Mail Format in the Distributed Multimedia mail System and Implementation of a Mail User Agent Using Java. |
| 49. |
Reserch for global computing-Globus Toolkit introduction-. |
| 50. |
Research for global computing - Globus Toolkit introduction -. |
| 51. |
Reserch for global computing : Globus Toolkit introduction. |
| 52. |
Design and Development of a Distributed Multimedia Mail System and its Evaluation. |
| 53. |
Design and Development of a Distributed Multimedia Mail System and its Evaluation. |
| 54. |
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 'T-SDSM'. 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'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.. |
| 55. |
メタスケジューリングのための資源情報サーバの構築. |
| 56. |
IMPLEMENTATION OF RESOURCE INFORMATION SERVER FOR META-SCHEDULING. |
| 57. |
Development of a Software System (STA: Seamless Thiking Aid) for Distributed Parallel Scientific Computing. |
| 58. |
Development of a Software System (STA: Seamless Thinking Aid) for Distributed Parallel Scientific Computing. |
| 59. |
トカマクプラズマ計算(NEXT)における異機種並列計算機を結合したハイブリッドコンピューティング. |
| 60. |
並列分散科学技術計算の支援環境 SSP. |
| 61. |
DISTRIBUTED PARALLEL SCIENTIFIC COMPUTING ENVIRONMENT STA(1) : OVERVIEW. |
| 62. |
DISTRIBUTED PARALLEL SCIENTIFIC COMPUTING ENVIRONMENT STA(2) : DEVELOPMENT OF THE EDITOR-CENTRIC PARALLEL PROGRAM DEVELOPMENT ENVIRONMENT PPDE. |
| 63. |
DISTRIBUTED PARALLEL SCIENTIFIC COMPUTING ENVIRONMENT STA (3) : DEVELOPMENT OF A MESSAGE PASSING LIBRARY FOR HETEROGENEOUS PARALLEL COMPUTER CLUSTER. |
| 64. |
DEVELOPMENT OF AN INTEGRATED ENVIRONMENT FOR HETEROGENEOUS PARALLEL COMPUTERS ON STA. |
| 65. |
OSCARマルチグレイン並列化コンパイラを用いたスーパーコンピュータクラスタのためのメタ・スケジューリング手法. |
| 66. |
Meta-scheduling for a Super computer Cluster using OSCAR Fortran Multigrain Parallelizing Compiler. |
| 67. |
Stampi : A Message Passing Library for Distributed Parallel Computing. |
| 68. |
Development of an integrated environment for heterogeneous parallel computers on STA.. |
| 69. |
Distributed parallel scientific computing environment STA. (3). Development of a message passing library for heterogeneous parallel computer cluster.. |
| 70. |
Distributed parallel scientific computing environment STA. (2). Development of the editor-centric parallel program development environment PPDE.. |
| 71. |
Distributed parallel scientific computing environment STA. (1). Overview.. |
| 72. |
Hybrid Simulation in Tokamak Plasma.. |
| 73. |
Conception of meta-scheduling for different machine parallel distributed computing.. |
| 74. |
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.. |
| 75. |
DEVELOPMENT OF STA(SEAMLESS THINKING AID)PROGRAMMING ENVIRONMENT. |
| 76. |
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'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.. |
| 77. |
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.. |
| 78. |
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.. |
