XML Schema matching plays a significant role in the integration of different XML Schemas by finding similar corresponding elements. XML Schema elements' properties and their relation to surrounding elements play significant role in improving the quality of matching process. Investigating all measures for each element in two schemas can result in a long execution time, which reduces the performance of the matching process. The feasibility of performance is becoming significant in particular in large scale XML Schema with all that features and surroundings. Since internal features of an element represents between 40-60% of the total similarity value, it should be utilised to filter elements that yield lower internal similarity value based on a predefined threshold. Thus, we propose to use element's internal features as a filter to exclude any element that is lower to certain predefined threshold. We also present an optimum threshold that can be used in the filtering approach. The idea is to detect using the internal features the elements that are highly likely to be dissimilar and excluded them from the next phase of element's context (element's surroundings) investigations. The outcome of imposing this approach is promising not only for improving the matching efficiency per see, but also for maintaining an acceptable quality results that are very close to non-filter approach.
{"title":"Internal Filtering Approach toward Efficiency Optimization of Matching Large Scale XML Schemas","authors":"Ahmad Abdullah Alqarni, E. Pardede","doi":"10.1109/NBiS.2013.77","DOIUrl":"https://doi.org/10.1109/NBiS.2013.77","url":null,"abstract":"XML Schema matching plays a significant role in the integration of different XML Schemas by finding similar corresponding elements. XML Schema elements' properties and their relation to surrounding elements play significant role in improving the quality of matching process. Investigating all measures for each element in two schemas can result in a long execution time, which reduces the performance of the matching process. The feasibility of performance is becoming significant in particular in large scale XML Schema with all that features and surroundings. Since internal features of an element represents between 40-60% of the total similarity value, it should be utilised to filter elements that yield lower internal similarity value based on a predefined threshold. Thus, we propose to use element's internal features as a filter to exclude any element that is lower to certain predefined threshold. We also present an optimum threshold that can be used in the filtering approach. The idea is to detect using the internal features the elements that are highly likely to be dissimilar and excluded them from the next phase of element's context (element's surroundings) investigations. The outcome of imposing this approach is promising not only for improving the matching efficiency per see, but also for maintaining an acceptable quality results that are very close to non-filter approach.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129230607","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}
Yuta Watanabe, S. Okamoto, Masaki Kohana, M. Kamada, T. Yonekura
Our interactive animation software is written in JavaScript, and is serial execution. However, it has a problem, which is related to drawing intervals. In case the software has to process a number of animation objects, it takes a long time. The longer drawing intervals are, the slower speed of animation playing is. So, we parallelize interactive animation software with Web Workers that is one part of HTML5. We partition drawing animation with some approaches, and parallelize their process. This time, we report the parallelization approach that takes into consideration the property of Web Workers and the interactive animation software.
{"title":"A Parallelization of Interactive Animation Software with Web Workers","authors":"Yuta Watanabe, S. Okamoto, Masaki Kohana, M. Kamada, T. Yonekura","doi":"10.1109/NBiS.2013.74","DOIUrl":"https://doi.org/10.1109/NBiS.2013.74","url":null,"abstract":"Our interactive animation software is written in JavaScript, and is serial execution. However, it has a problem, which is related to drawing intervals. In case the software has to process a number of animation objects, it takes a long time. The longer drawing intervals are, the slower speed of animation playing is. So, we parallelize interactive animation software with Web Workers that is one part of HTML5. We partition drawing animation with some approaches, and parallelize their process. This time, we report the parallelization approach that takes into consideration the property of Web Workers and the interactive animation software.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123811478","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}
Social media, such as Twitter and Facebook, has been popularized. In the social media times, many people become more active between online and offline. Personal branding is very important strategy in order to use individual strong points, and contributes to self-actualization. Existence of mentors supports to find own strong points for self-actualization. In this paper, we propose a personal branding support service named "Mentors". The concept of Mentors is "Everyone has face of both mentor and mentee", surely it is friendly and rivalry. The most featuring function is to share components of self-analysis in human life design, that is, value, mission, and strategy. Mentors aims at promotion of human life by understanding their strong points and using social media effectively. Future works are to launch Mentors, and evaluation of Mentors.
{"title":"System Design of Self-Actualization Support Service through Friendly Rivalry","authors":"Yoshihiro Kawano, Yuka Obu","doi":"10.1109/NBiS.2013.69","DOIUrl":"https://doi.org/10.1109/NBiS.2013.69","url":null,"abstract":"Social media, such as Twitter and Facebook, has been popularized. In the social media times, many people become more active between online and offline. Personal branding is very important strategy in order to use individual strong points, and contributes to self-actualization. Existence of mentors supports to find own strong points for self-actualization. In this paper, we propose a personal branding support service named \"Mentors\". The concept of Mentors is \"Everyone has face of both mentor and mentee\", surely it is friendly and rivalry. The most featuring function is to share components of self-analysis in human life design, that is, value, mission, and strategy. Mentors aims at promotion of human life by understanding their strong points and using social media effectively. Future works are to launch Mentors, and evaluation of Mentors.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"269 2","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120907154","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}
C. Shih, Kuang-Yi Chou, H. Keh, Yuan-Cheng Cheng, Po-Yuan Yu, Nan-Ching Huang
The accelerated aging population around the world will be more obvious. In the USA, there will be about 72 million people aged 65 by 2030, There will have nearly 36.98% of the elderly population in Taiwan until 2050. Those people will need health care too. Nowadays, the current health care focus on the passive home care in Taiwan, however, the devices which can provide elder to carrying in outdoor will be huge and heavy, and also the devices will hard to actively send the alert message for the medical units when the patient have problem in their health. Therefore, the proposed of this study is to miniaturized vital sign detection and active alert system. The system will give elder the privacy, convenience, and security as well. Hoping this study can not only reduce the medical unit's work but lower the medical resources cost, moreover, it will also enhance the quality of life for the patients.
{"title":"Building Long-Distance Health Care Network Using Minimized Portable Sensors and Active Alert System","authors":"C. Shih, Kuang-Yi Chou, H. Keh, Yuan-Cheng Cheng, Po-Yuan Yu, Nan-Ching Huang","doi":"10.1109/NBiS.2013.64","DOIUrl":"https://doi.org/10.1109/NBiS.2013.64","url":null,"abstract":"The accelerated aging population around the world will be more obvious. In the USA, there will be about 72 million people aged 65 by 2030, There will have nearly 36.98% of the elderly population in Taiwan until 2050. Those people will need health care too. Nowadays, the current health care focus on the passive home care in Taiwan, however, the devices which can provide elder to carrying in outdoor will be huge and heavy, and also the devices will hard to actively send the alert message for the medical units when the patient have problem in their health. Therefore, the proposed of this study is to miniaturized vital sign detection and active alert system. The system will give elder the privacy, convenience, and security as well. Hoping this study can not only reduce the medical unit's work but lower the medical resources cost, moreover, it will also enhance the quality of life for the patients.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121177144","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}
Considering the differences between the Internet and the Internet of Things in security problems, we propose an identity authentication scheme based on elliptic curve algorithm for public and private key pair in order to meet the security requirements of the Internet of Things in heterogeneous networking environments. After being simulated with OPNET, the plan proves to be both safe and effective.
{"title":"An Improved Identity Authentication Scheme for Internet of Things in Heterogeneous Networking Environments","authors":"F. Chu, Runtong Zhang, R. Ni, W. Dai","doi":"10.1109/NBiS.2013.98","DOIUrl":"https://doi.org/10.1109/NBiS.2013.98","url":null,"abstract":"Considering the differences between the Internet and the Internet of Things in security problems, we propose an identity authentication scheme based on elliptic curve algorithm for public and private key pair in order to meet the security requirements of the Internet of Things in heterogeneous networking environments. After being simulated with OPNET, the plan proves to be both safe and effective.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114872157","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}
A service system addresses the interactions and balances between the supplier communities and consumer communities with the help of appropriate infrastructure such as Service Oriented Architecture (SOA). This paper extends an existing service system prototype for e-business with the focus on in-memory processing of XML-based large volumes of data, information and knowledge without the I/O operations with the traditional RDBMS. An Open Source Gateway Interface (OSGi) environment was used which offers the fundamental support of SOA applications to carry out preliminary design and implementation of a high performance services management framework.
{"title":"Dynamic High Performance Service Resources Management","authors":"Jonathan J. Liu, W. Dai","doi":"10.1109/NBiS.2013.95","DOIUrl":"https://doi.org/10.1109/NBiS.2013.95","url":null,"abstract":"A service system addresses the interactions and balances between the supplier communities and consumer communities with the help of appropriate infrastructure such as Service Oriented Architecture (SOA). This paper extends an existing service system prototype for e-business with the focus on in-memory processing of XML-based large volumes of data, information and knowledge without the I/O operations with the traditional RDBMS. An Open Source Gateway Interface (OSGi) environment was used which offers the fundamental support of SOA applications to carry out preliminary design and implementation of a high performance services management framework.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126341343","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}
Takuya Kaneko, T. Nagaya, K. Takemori, Yutaka Miyake, M. Nishigaki
In recent years, the leakage of confidential files through the P2P (peer-to-peer) file sharing software has become a problem. Once sensitive files have been leaked to a P2P network, they are distributed rapidly and at random to a great many computers, bringing the danger of far-reaching damage. To deal with this, we propose a method to control the diffusion of sensitive file leakage on P2P networks by deleting the leaked sensitive files in the destination PC of the P2P user. In this method, we focus on the characteristic of anti-virus software that reacts to the unique patterns of a virus, automatically isolating and deleting a file concerned. By using the unique pattern of a virus to make the leaked sensitive file appear as a viral infection file, the anti-virus software installed on the destination PC will automatically delete the file. This is the concept of our method.
{"title":"A Proposal for the Deterrence of Information Leakage Using Anti-virus Software","authors":"Takuya Kaneko, T. Nagaya, K. Takemori, Yutaka Miyake, M. Nishigaki","doi":"10.1109/NBiS.2013.17","DOIUrl":"https://doi.org/10.1109/NBiS.2013.17","url":null,"abstract":"In recent years, the leakage of confidential files through the P2P (peer-to-peer) file sharing software has become a problem. Once sensitive files have been leaked to a P2P network, they are distributed rapidly and at random to a great many computers, bringing the danger of far-reaching damage. To deal with this, we propose a method to control the diffusion of sensitive file leakage on P2P networks by deleting the leaked sensitive files in the destination PC of the P2P user. In this method, we focus on the characteristic of anti-virus software that reacts to the unique patterns of a virus, automatically isolating and deleting a file concerned. By using the unique pattern of a virus to make the leaked sensitive file appear as a viral infection file, the anti-virus software installed on the destination PC will automatically delete the file. This is the concept of our method.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134137498","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}
Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmissions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the "LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation" (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using "naive" jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues - with the performance hereof, when compared to "naive" jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for "naive" jitter.
{"title":"Jitter Considerations in On-Demand Route Discovery for Mobile Ad Hoc Networks","authors":"Jiazi Yi, Juan Antonio Cordero, T. Clausen","doi":"10.1109/NBiS.2013.28","DOIUrl":"https://doi.org/10.1109/NBiS.2013.28","url":null,"abstract":"Jittering (a small, random variation in timing of control message emission) is widely used in protocols for wireless communication, in order to avoid simultaneous packet transmissions over the same channel by adjacent nodes in the network. Used for both regularly scheduled packets, for event-triggered packets, and for scheduled resets in the network, jittering is a particularly important mechanism when a network event may cause multiple adjacent nodes to react concurrently. Introduced in the proactive MANET routing protocol OLSR, the \"LLN On-demand Ad hoc Distance-vector Routing Protocol - Next Generation\" (LOADng), a derivative of AODV, is specified so as to also use jitter for flooding Route Request (RREQ) messages during route discovery. This use of jitter in RREQ flooding is, however, not without drawbacks, which are identified and addressed in this paper within the framework of a more general study of jitter mechanisms used for route discovery in reactive routing protocols. The paper studies the behavior of route discovery when using \"naive\" jitter (simply, delaying RREQ retransmission by a small uniformly distributed random delay), in order to identify and analyze the problems hereof, mostly related to route sub-optimality and excessive control traffic overhead. A Window Jitter mechanism is then proposed to address these issues - with the performance hereof, when compared to \"naive\" jitter being evaluated by way of modeling, theoretical analysis and experiments. The paper shows that the use of Window Jitter improves indeed the efficiency of route discovery in AODV and overcome the drawbacks identified for \"naive\" jitter.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127801208","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}
Jiro Iwashige, L. Barolli, Motohiko Iwaida, Saki Kameyama
Estimation of the scattering of electromagnetic waves by buildings and other obstacles is very important for wireless communications. In our previous work, we have examined the diffracted fields by two edges with an arbitrary angle which change in both horizontal and vertical directions. In this paper, we compare the diffracted fields between parallel and arbitrary angle of edges. The numerical calculation results show that when the angle between two edges increases, relatively strong orthogonal polarized wave components appear, but the principal components are almost the same as the incident wave.
{"title":"Investigation of Diffracted Waves between Parallel and Arbitrary Angle of Edges: A Comparison Study","authors":"Jiro Iwashige, L. Barolli, Motohiko Iwaida, Saki Kameyama","doi":"10.1109/NBiS.2013.83","DOIUrl":"https://doi.org/10.1109/NBiS.2013.83","url":null,"abstract":"Estimation of the scattering of electromagnetic waves by buildings and other obstacles is very important for wireless communications. In our previous work, we have examined the diffracted fields by two edges with an arbitrary angle which change in both horizontal and vertical directions. In this paper, we compare the diffracted fields between parallel and arbitrary angle of edges. The numerical calculation results show that when the angle between two edges increases, relatively strong orthogonal polarized wave components appear, but the principal components are almost the same as the incident wave.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133795715","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}
Extractive document summarization is a fundamental technique for document summarization. Most well-known approaches to extractive document summarization utilize supervised learning where algorithms are trained on collections of "ground truth" summaries built for a relatively large number of documents. In this paper, we propose a novel algorithm, called Triangle Sum for key sentence extraction from single document based on graph theory. The algorithm builds a dependency graph for the underlying document based on co-occurrence relation as well as syntactic dependency relations. In such a dependency graph, nodes represent words or phrases of high frequency, and edges represent dependency-co-occurrence relations between them. The clustering coefficient is computed from each node to measure the strength of connection between a node and its neighbors in a dependency graph. By identifying triangles of nodes in the graph, a part of the dependency graph can be extracted as marks of key sentences. At last, a set of key sentences that represent the main document information can be extracted.
{"title":"Single Document Summarization Based on Triangle Analysis of Dependency Graphs","authors":"K. Cheng, Yanting Li, Xin Wang","doi":"10.1109/NBiS.2013.9","DOIUrl":"https://doi.org/10.1109/NBiS.2013.9","url":null,"abstract":"Extractive document summarization is a fundamental technique for document summarization. Most well-known approaches to extractive document summarization utilize supervised learning where algorithms are trained on collections of \"ground truth\" summaries built for a relatively large number of documents. In this paper, we propose a novel algorithm, called Triangle Sum for key sentence extraction from single document based on graph theory. The algorithm builds a dependency graph for the underlying document based on co-occurrence relation as well as syntactic dependency relations. In such a dependency graph, nodes represent words or phrases of high frequency, and edges represent dependency-co-occurrence relations between them. The clustering coefficient is computed from each node to measure the strength of connection between a node and its neighbors in a dependency graph. By identifying triangles of nodes in the graph, a part of the dependency graph can be extracted as marks of key sentences. At last, a set of key sentences that represent the main document information can be extracted.","PeriodicalId":261268,"journal":{"name":"2013 16th International Conference on Network-Based Information Systems","volume":"136 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116329307","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
扫码关注我们
求助内容：
应助结果提醒方式：