H. Miyachi, K. Koyamada, D. Matsuoka, Isamu Kuroki
This is an introduction paper of a project named the same as the title which is supported by Japan Science and Technology Agency. We plan to develop an interactive visualization system with both volume and surface rendering and big data analysis functions. It is for two years project that started at April 1st in 2016. Integrating 1D, 2D and 3D visualization tools, we aim to provide a new post processing tool that assists to reveal a causal relationship between variables among big data. This paper introduces the basic concept and the fundamental visualization technologies implemented in the system.
{"title":"Fusion Visualization System as an Open Science Foundation","authors":"H. Miyachi, K. Koyamada, D. Matsuoka, Isamu Kuroki","doi":"10.1109/NBiS.2016.9","DOIUrl":"https://doi.org/10.1109/NBiS.2016.9","url":null,"abstract":"This is an introduction paper of a project named the same as the title which is supported by Japan Science and Technology Agency. We plan to develop an interactive visualization system with both volume and surface rendering and big data analysis functions. It is for two years project that started at April 1st in 2016. Integrating 1D, 2D and 3D visualization tools, we aim to provide a new post processing tool that assists to reveal a causal relationship between variables among big data. This paper introduces the basic concept and the fundamental visualization technologies implemented in the system.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116876521","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Toru Kobayashi, Kazushige Katsuragi, Taishi Miyazaki, Kenichi Arai, T. Sakai, M. Fujimura
We proposed the Social Media Mediation Systemwhich can be used for the interactive communication betweenelderly people and younger generation via existed social media. In this system, we found out the problem that was the difficultyof inputting a message destination address by elderly people. Therefore, we propose a message exchange learning typeswitching method that enables elderly people not to input amessage destination address explicitly. This method is based onthe machine learning algorithm which performs the messagedestination decision according to message contents of elderlypeople. We developed a machine learning algorithm inferenceplatform to find out the suitable machine learning algorithm forthis purpose. Through inference experiments using this platform, we confirmed three machine learning algorithm candidateswhich could be suitable for the message exchange learning typeswitching method.
{"title":"Social Media Mediation System for Elderly People: Message Exchange Learning Type Switching Method","authors":"Toru Kobayashi, Kazushige Katsuragi, Taishi Miyazaki, Kenichi Arai, T. Sakai, M. Fujimura","doi":"10.1109/NBiS.2016.63","DOIUrl":"https://doi.org/10.1109/NBiS.2016.63","url":null,"abstract":"We proposed the Social Media Mediation Systemwhich can be used for the interactive communication betweenelderly people and younger generation via existed social media. In this system, we found out the problem that was the difficultyof inputting a message destination address by elderly people. Therefore, we propose a message exchange learning typeswitching method that enables elderly people not to input amessage destination address explicitly. This method is based onthe machine learning algorithm which performs the messagedestination decision according to message contents of elderlypeople. We developed a machine learning algorithm inferenceplatform to find out the suitable machine learning algorithm forthis purpose. Through inference experiments using this platform, we confirmed three machine learning algorithm candidateswhich could be suitable for the message exchange learning typeswitching method.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"48 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129978567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Hina Nasir, N. Javaid, Shaharyar Mahmood, U. Qasim, Z. Khan, F. Ahmed
Impairments of the acoustic channel impose the requirement of improvement in throughput efficiency of the network. Therefore, efficient mechanisms must be proposed to increase throughput while conserving energy at the same time. In this paper, we propose two energy efficient geographic opportunistic routing protocols for underwater wireless sensor networks called improved Distributed Topology Control (iDTC) and Power Adjustment Distributed Topology Control (PADTC). These protocols guarantee the delivery of data by dealing with communication void problem of geographic opportunistic routing. The recovery from void region is performed via depth adjustment and power adjustment of a void node. The protocols are validated via simulations. We compare the protocols with Distributed Topology Control (DTC) and results show that iDTC and PADTC consume less energy and perform minimum displacement in case of void node while maintaining the same throughput.
{"title":"Distributed Topology Control Protocols for Underwater Sensor Networks","authors":"Hina Nasir, N. Javaid, Shaharyar Mahmood, U. Qasim, Z. Khan, F. Ahmed","doi":"10.1109/NBiS.2016.75","DOIUrl":"https://doi.org/10.1109/NBiS.2016.75","url":null,"abstract":"Impairments of the acoustic channel impose the requirement of improvement in throughput efficiency of the network. Therefore, efficient mechanisms must be proposed to increase throughput while conserving energy at the same time. In this paper, we propose two energy efficient geographic opportunistic routing protocols for underwater wireless sensor networks called improved Distributed Topology Control (iDTC) and Power Adjustment Distributed Topology Control (PADTC). These protocols guarantee the delivery of data by dealing with communication void problem of geographic opportunistic routing. The recovery from void region is performed via depth adjustment and power adjustment of a void node. The protocols are validated via simulations. We compare the protocols with Distributed Topology Control (DTC) and results show that iDTC and PADTC consume less energy and perform minimum displacement in case of void node while maintaining the same throughput.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128854694","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We make experiments of machine learning for our CAPTCHA proposed as an effective CAPTCHA with amodal completion and aftereffects by colors. CAPTCHA is a method that distinguishes human beings from artificial intelligence in order to prohibit malicious programs from acquiring accounts on Internet. The most popular CAPTCHA is text-based CAPTCHA with distorted alphabets and numbers. However, it is known that all of text-based CAPTCHA algorithms can be analyzed by computers. In addition, too much distortion or noise prevents human beings from recognizing alphabets or numbers. As a solution of the problems, an effective text-based CAPTCHA algorithm with amodal completion was proposed by our team. Our CAPTCHA causes computers a large amount of calculation costs while amodal completion helps human beings to recognize characters momentarily. Our CAPTCHA has evolved with aftereffects and combinations of complementary colors. In this paper, we evaluate our CAPTCHA by machine learning since machine learning is faster and more accurate than existing calculations by a computer. We confirm the limitations of machine learning. Especially, we focus on whether a computer can recognize characters without knowledge of amodal completion.
{"title":"Challenge of Deep Learning against CAPTCHA with Amodal Completion and Aftereffects by Colors","authors":"Tomoka Azakami, Chihiro Shibata, R. Uda","doi":"10.1109/NBiS.2016.59","DOIUrl":"https://doi.org/10.1109/NBiS.2016.59","url":null,"abstract":"We make experiments of machine learning for our CAPTCHA proposed as an effective CAPTCHA with amodal completion and aftereffects by colors. CAPTCHA is a method that distinguishes human beings from artificial intelligence in order to prohibit malicious programs from acquiring accounts on Internet. The most popular CAPTCHA is text-based CAPTCHA with distorted alphabets and numbers. However, it is known that all of text-based CAPTCHA algorithms can be analyzed by computers. In addition, too much distortion or noise prevents human beings from recognizing alphabets or numbers. As a solution of the problems, an effective text-based CAPTCHA algorithm with amodal completion was proposed by our team. Our CAPTCHA causes computers a large amount of calculation costs while amodal completion helps human beings to recognize characters momentarily. Our CAPTCHA has evolved with aftereffects and combinations of complementary colors. In this paper, we evaluate our CAPTCHA by machine learning since machine learning is faster and more accurate than existing calculations by a computer. We confirm the limitations of machine learning. Especially, we focus on whether a computer can recognize characters without knowledge of amodal completion.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123147330","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In the arrest situation of the cybercrime in Japan, over half of crime is related to minors who is using network device. Therefore the actual situation of the applications and the services on the Internet that connect high school student to the cybercrime was investigated. And the environment of the cybercrime by minors was discussed.
{"title":"An Intensive Analysis on the Usage Situation of the Mobile Services in Japanese High Schools: Why and How are They Used?","authors":"T. Okada, J. Iio, Yoshihiko Kubota, T. Yonekura","doi":"10.1109/NBiS.2016.8","DOIUrl":"https://doi.org/10.1109/NBiS.2016.8","url":null,"abstract":"In the arrest situation of the cybercrime in Japan, over half of crime is related to minors who is using network device. Therefore the actual situation of the applications and the services on the Internet that connect high school student to the cybercrime was investigated. And the environment of the cybercrime by minors was discussed.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"106 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122452047","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Takaaki Inaba, Donald Elmazi, Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli
Call Admission Control (CAC) is one of the resource management functions, which regulates network access to ensure QoS provisioning. However, the decision for CAC is very challenging issue due to user mobility, limited radio spectrum and multimedia traffic characteristics. In this paper, we implement a Fuzzy Call Admission Control Sysytem considering Security and Priority parameters. We call this system FCACS-SP. We present the quantitative simulation results and show that the implemented system has a good behavior.
{"title":"Performance Evaluation of a Fuzzy-Based Connection Admission Control System for Wireless Cellular Networks Considering Security and Priority Parameters","authors":"Takaaki Inaba, Donald Elmazi, Shinji Sakamoto, Tetsuya Oda, Makoto Ikeda, L. Barolli","doi":"10.1109/NBiS.2016.39","DOIUrl":"https://doi.org/10.1109/NBiS.2016.39","url":null,"abstract":"Call Admission Control (CAC) is one of the resource management functions, which regulates network access to ensure QoS provisioning. However, the decision for CAC is very challenging issue due to user mobility, limited radio spectrum and multimedia traffic characteristics. In this paper, we implement a Fuzzy Call Admission Control Sysytem considering Security and Priority parameters. We call this system FCACS-SP. We present the quantitative simulation results and show that the implemented system has a good behavior.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122583969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Data processing frameworks including Hadoop and Spark have been essential tools for processing massive data in recent BigData Era. In many analyzing scenarios, it is a natural choice to combine multiple data processing frameworks (i.e. stream and batch processings) to meet various data processing requirements. However, these scenarios require us to solve two major problems: (1) we need to choose an appropriate combination of frameworks for the performance requirements, and (2) we have to build and maintain codes written in different programming models that bind to the frameworks. In this paper, we address the problems of combining multiple data processing frameworks. We present a novel framework JsFlow that integrates stream and batch processings in a single system. JsFlow provides a uniformed programming model for stream and batch processings by using JSON-based dataflow algebra. JsFlow accepts processing dataflows and deploys them over appropriate processing frameworks (e.g. Spark and Spark Streaming) according to the performance requirements. We experimentally confirmed the effectiveness of JsFlow compared with the state-of-the-art frameworks for processing real-world BigData.
{"title":"JsFlow: Integration of Massive Streams and Batches via JSON-based Dataflow Algebra","authors":"Hirotoshi Cho, Hiroaki Shiokawa, H. Kitagawa","doi":"10.1109/NBiS.2016.1","DOIUrl":"https://doi.org/10.1109/NBiS.2016.1","url":null,"abstract":"Data processing frameworks including Hadoop and Spark have been essential tools for processing massive data in recent BigData Era. In many analyzing scenarios, it is a natural choice to combine multiple data processing frameworks (i.e. stream and batch processings) to meet various data processing requirements. However, these scenarios require us to solve two major problems: (1) we need to choose an appropriate combination of frameworks for the performance requirements, and (2) we have to build and maintain codes written in different programming models that bind to the frameworks. In this paper, we address the problems of combining multiple data processing frameworks. We present a novel framework JsFlow that integrates stream and batch processings in a single system. JsFlow provides a uniformed programming model for stream and batch processings by using JSON-based dataflow algebra. JsFlow accepts processing dataflows and deploys them over appropriate processing frameworks (e.g. Spark and Spark Streaming) according to the performance requirements. We experimentally confirmed the effectiveness of JsFlow compared with the state-of-the-art frameworks for processing real-world BigData.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"103 2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122600970","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
We propose a method for effectively supporting engineering education in computer science (CS) based on Augmented Reality (AR). We have an assumption that the proposed method can be used in an experimental exercise class for training CS students targeted at mastering embedded software development skills. We focus on some technical issues confusing the students in an initial stage of the experiment and present a way for efficiently advising them by showing support information in accordance with the progress of an experimental task. The proposed method also supports multiple students cooperating to solve a single task by spatially projecting appropriate information in a working environment (a visualization technique called projection-based AR). We describe a prototype system designed and implemented based on the proposed method and discuss how the system can guide the students in some specific experimental exercises.
{"title":"An Engineering Education Support System Using Projection-Based AR","authors":"Toshiyuki Haramaki, Hiroaki Nishino","doi":"10.1109/NBiS.2016.67","DOIUrl":"https://doi.org/10.1109/NBiS.2016.67","url":null,"abstract":"We propose a method for effectively supporting engineering education in computer science (CS) based on Augmented Reality (AR). We have an assumption that the proposed method can be used in an experimental exercise class for training CS students targeted at mastering embedded software development skills. We focus on some technical issues confusing the students in an initial stage of the experiment and present a way for efficiently advising them by showing support information in accordance with the progress of an experimental task. The proposed method also supports multiple students cooperating to solve a single task by spatially projecting appropriate information in a working environment (a visualization technique called projection-based AR). We describe a prototype system designed and implemented based on the proposed method and discuss how the system can guide the students in some specific experimental exercises.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134354040","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Rio Hosoi, Takamichi Saito, Takayuki Ishikawa, D. Miyata, Yongyan Chen
At present, using with HTML5 and new browser technologies, many information, such as a hostname or a server application name, can be collected by a Web server. Even if the visitors are protected by a firewall, their intranet information can be collected. Then, currently people should also focus on the intranet information where he or she belongs to. In this paper, we propose a network scanning tool that allows a Web browser to collect information about active hosts or the existence of a proxy over a channel to the Web server.
{"title":"A Browser Scanner: Collecting Intranet Information","authors":"Rio Hosoi, Takamichi Saito, Takayuki Ishikawa, D. Miyata, Yongyan Chen","doi":"10.1109/NBiS.2016.10","DOIUrl":"https://doi.org/10.1109/NBiS.2016.10","url":null,"abstract":"At present, using with HTML5 and new browser technologies, many information, such as a hostname or a server application name, can be collected by a Web server. Even if the visitors are protected by a firewall, their intranet information can be collected. Then, currently people should also focus on the intranet information where he or she belongs to. In this paper, we propose a network scanning tool that allows a Web browser to collect information about active hosts or the existence of a proxy over a channel to the Web server.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133155160","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
In a peer-to-peer (P2P) type of topic-based publish/subscribe (P2PPS) model, each peer (process) caP2P) typen be a publisher and subscriber. Here, a peer publishes an event message and then the event message is notified to a target peer which is interested in the event message. Publications and subscriptions are specified in terms of topics. In the topic-based access control (TBAC) model proposed in our previous studies, only a peer granted publication and subscription access rights is allowed to publish event messages with publication topics and subscribe events, respectively. In our previous studies, the illegal information flow relation among peers is defined and the subscription-based synchronization (SBS) protocol is proposed to prevent illegal information flow. Here, topics carried by event messages are just accumulated in the target peers and notification of event messages which may cause illegal information flow are banned in each target peer. The more number of event messages are published, the more number of event messages are not notified in the system. In this paper, we newly propose a subscription initialization (SI) protocol where topics accumulated in peers are removed to reduce the number of notifications banned. We show the number of notifications banned is reduced in the SI protocol compared with the SBS protocol in the evaluation.
{"title":"Subscription Initialization (SI) Protocol to Prevent Illegal Information Flow in Peer-to-Peer Publish/Subscribe Systems","authors":"Shigenari Nakamura, T. Enokido, M. Takizawa","doi":"10.1109/NBiS.2016.73","DOIUrl":"https://doi.org/10.1109/NBiS.2016.73","url":null,"abstract":"In a peer-to-peer (P2P) type of topic-based publish/subscribe (P2PPS) model, each peer (process) caP2P) typen be a publisher and subscriber. Here, a peer publishes an event message and then the event message is notified to a target peer which is interested in the event message. Publications and subscriptions are specified in terms of topics. In the topic-based access control (TBAC) model proposed in our previous studies, only a peer granted publication and subscription access rights is allowed to publish event messages with publication topics and subscribe events, respectively. In our previous studies, the illegal information flow relation among peers is defined and the subscription-based synchronization (SBS) protocol is proposed to prevent illegal information flow. Here, topics carried by event messages are just accumulated in the target peers and notification of event messages which may cause illegal information flow are banned in each target peer. The more number of event messages are published, the more number of event messages are not notified in the system. In this paper, we newly propose a subscription initialization (SI) protocol where topics accumulated in peers are removed to reduce the number of notifications banned. We show the number of notifications banned is reduced in the SI protocol compared with the SBS protocol in the evaluation.","PeriodicalId":390397,"journal":{"name":"2016 19th International Conference on Network-Based Information Systems (NBiS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133532954","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：