2015 International Conference on Intelligent Networking and Collaborative Systems最新文献_第6页

Contents Delivery Method Using Route Prediction in Traffic Offloading by V2X V2X流量分流中基于路由预测的内容分发方法

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.34

Shunsuke Otsuki, H. Miwa

{"title":"Contents Delivery Method Using Route Prediction in Traffic Offloading by V2X","authors":"Shunsuke Otsuki, H. Miwa","doi":"10.1109/INCoS.2015.34","DOIUrl":"https://doi.org/10.1109/INCoS.2015.34","url":null,"abstract":"Currently, there are ongoing research and development efforts directed to data offloading. Data offloading allows load distribution by suitably allocating data communication traffic to other systems, such as wireless LANs or vehicle-to-vehicle communication systems. Especially, there is also ongoing research into traffic offloading using vehicle-to-vehicle communication. In traffic offloading using vehicle-to-vehicle communication, generally, while effectively utilizing mobile phone communication (V2I communication), vehicle-to-vehicle communication (V2V communication), in which content is shared among neighboring vehicles, is additionally used. In V2V communication, since the amount of data that can be transmitted at one time is not so large, and the opportunities for exchanging content are limited due to movement of vehicles, it is not easy to efficiently share relevant content within a certain period of time. Accordingly, we have designed an efficient content-delivery controlling algorithm for use in a situation where vehicles generate content in real time. The algorithm utilizes route prediction information in order to efficiently share content among the vehicles by way of V2X communication (i.e., V2I communication and V2V communication used in combination). This paper proposes the algorithm and reports its effectiveness demonstrated through simulated performance evaluation.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"219 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115684997","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}

引用次数: 12

Evaluation of Errors Caused by Lowering Frequency of Measurements of an Environmental Sensor Station 某环境传感器站测量频率降低误差评估

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.44

Obiora Sam Ezeora, J. Heckenbergerova, P. Musílek, P. Krömer

引用次数: 2

Composing and Solving General Differential Equations Using Extended Polynomial Networks 利用扩展多项式网络组成和求解一般微分方程

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.28

L. Zjavka, V. Snás̃el

{"title":"Composing and Solving General Differential Equations Using Extended Polynomial Networks","authors":"L. Zjavka, V. Snás̃el","doi":"10.1109/INCoS.2015.28","DOIUrl":"https://doi.org/10.1109/INCoS.2015.28","url":null,"abstract":"Multi-variable data relations can define a partial differential equation, which describes an unknown complex function on a basis of discrete observations, using the similarity model analysis methods. Time-series can form an ordinary differential equation, which is analogously possible to replace by partial derivatives of the same type time-dependent observations. Polynomial neural networks can compose and solve an unknown general partial differential equation of a searched function or pattern model by means of low order composite multi-variable derivative fractions. Convergent sum series of relative terms, produced by polynomial networks, describe partial dependent derivative changes of some polynomial combinations of input variables and can substitute for the general differential equation. This non-linear regression type is based on learned generalized partial elementary data relations, decomposed into a polynomial network derivative structure, which is able to define and create more complex and varied indirect model forms than standard soft computing techniques allow. The sigmoidal function, commonly used as an activation function in artificial neurons, may improve the polynomials and substituting derivative term series abilities to approximate complicated periodic multi-variable or time-series functions and model a system behaviour.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123231656","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}

引用次数: 0

Collaborative Tool to Enhance Quality Evaluation of Higher Education Programmes 加强高等教育课程质素评估的合作工具

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.33

David Bañeres, Montse Serra, M. E. Rodríguez

引用次数: 1

Polynomial-time Algorithm for Server Location Method for Keeping Small Distance from Clients to Servers During Failures 基于多项式时间算法的服务器定位方法在故障时保持客户端与服务器之间的小距离

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.43

S. Kurimoto, Nao Maeda, H. Miwa

{"title":"Polynomial-time Algorithm for Server Location Method for Keeping Small Distance from Clients to Servers During Failures","authors":"S. Kurimoto, Nao Maeda, H. Miwa","doi":"10.1109/INCoS.2015.43","DOIUrl":"https://doi.org/10.1109/INCoS.2015.43","url":null,"abstract":"Large amount of contents in the Internet have increased loads of contents servers, networks and data centers, which may degrade quality of service. To solve this problem, there is a method that some mirror servers providing the same contents are located on a network and a request is navigated to one of the mirror servers. As the location of the mirror servers affects the quality of service, it is important to locate the mirror servers in the network so that a network should connect a user and one of mirror servers with small hop length after links fail. In this paper, we address the server location problem that determines the location of the servers satisfying the following constraint: any users can access servers within a small hop count even if some links fail. In the previous research, we proved that this problem is NP-hard and proposed some heuristic algorithms. In this paper, we present a polynomial-time algorithm when the number of simultaneously failed links is restricted to one and the increase of hop length is restricted, in other words, we can get the optimum solution of the optimization version to minimize the number of servers in polynomial time. Furthermore, we evaluate the performance of actual ISP network topologies by the algorithm from the viewpoint of the number of servers.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127539762","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}

引用次数: 0

Analysis and Implementation of Modified Costas Loop for QPSK QPSK改进Costas环的分析与实现

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.26

Xiao-ou Song

引用次数: 0

Development and Evaluation of Adobe Flash Based CPU Scheduling Simulator Executable on Major Multiple Web Browsers 基于Adobe Flash的CPU调度模拟器的开发与评价

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.92

Y. Imai, Kei Takeichi

{"title":"Development and Evaluation of Adobe Flash Based CPU Scheduling Simulator Executable on Major Multiple Web Browsers","authors":"Y. Imai, Kei Takeichi","doi":"10.1109/INCoS.2015.92","DOIUrl":"https://doi.org/10.1109/INCoS.2015.92","url":null,"abstract":"Currently, e-Learning system is one of the most popular and influential education tools and therefore not only designers but also their users must be requested to evaluate and improve such system very repeatedly and in a steady cyclic manner.We introduce an Adobe-Flash-based simulator for CPU scheduling algorithm in the lecture of \"Operating System\". Our simulator supports three major CPU scheduling algorithms such as FirstCome-FirstServed, Shortest Processing Time First, and Round Robin. It can provide its services in the environments of stand alone utilization with Flash Player, of course, as well as major Web browsers such as Microsoft Internet Explorer, Mozilla FireFox and Google Chrome. As evaluation of our system, we have performed comparison of execution times for the above environment and quantitative/qualitative evaluation through information gleaned from users' questionnaire. It is confirmed that our system have obtained good and significant level performance through comparison and questionnaire.This paper reports our system configuration and its application to real lecture of \"Operating System\". It also illustrates quantitative/qualitative evaluation through its practical utilization. With our system, we can provide fruitful lecture about CPU scheduling algorithm and some kinds of fruitful results.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"728 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126932206","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}

引用次数: 3

Performance Analysis of WMN-GA Simulation System for Different WMN Architectures and Routing Protocols Considering Exponential Distribution 考虑指数分布的不同WMN架构和路由协议下WMN- ga仿真系统性能分析

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.19

Admir Barolli, Tetsuya Oda, Keita Matsuo, L. Barolli, F. Xhafa, V. Loia

{"title":"Performance Analysis of WMN-GA Simulation System for Different WMN Architectures and Routing Protocols Considering Exponential Distribution","authors":"Admir Barolli, Tetsuya Oda, Keita Matsuo, L. Barolli, F. Xhafa, V. Loia","doi":"10.1109/INCoS.2015.19","DOIUrl":"https://doi.org/10.1109/INCoS.2015.19","url":null,"abstract":"Wireless Mesh Networks (WMNs) are attracting a lot of attention from wireless network researchers. Node placement problems have been investigated for a long time in the optimization field due to numerous applications in location science. In our previous work, we evaluated WMN-GA system which is based on Genetic Algorithms (GAs) to find an optimal location assignment for mesh routers. In this paper, we evaluate the performance of exponential distribution of mesh clients for two WMN architectures considering throughput, delay, jitter and energy metrics. For simulations, we used ns-3, Optimized Link State Routing (OLSR) and Hybrid Wireless Mesh Protocols (HWMP). We evaluate the performance for exponential distribution of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for HWMP, the throughput of I/B WMN is higher than Hybrid architecture. However, for OLSR the throughput of Hybrid WMN is higher than I/B architecture. For HWMP, the delay and jitter of I/B WMN is a lower compared with Hybrid WMN. But for OLSR, the delay and jitter of Hybrid WMN is a lower than I/B WMN. For both protocols, the remaining energy of Hybrid WMN is higher than I/B WMN.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132265765","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}

引用次数: 0

An Unusual Approach to Basic Challenges of Data Mining 解决数据挖掘基本挑战的一种不同寻常的方法

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCoS.2015.40

Thomas H. Lenhard, M. Greguš

引用次数: 4

On Evaluation of Evolutionary Networks Using New Temporal Centralities Algorithm 基于新时间中心性算法的进化网络评价

2015 International Conference on Intelligent Networking and Collaborative Systems Pub Date : 2015-09-02 DOI: 10.1109/INCOS.2015.95

I. Zelinka, Lukas Tomaszek, V. Snás̃el

{"title":"On Evaluation of Evolutionary Networks Using New Temporal Centralities Algorithm","authors":"I. Zelinka, Lukas Tomaszek, V. Snás̃el","doi":"10.1109/INCOS.2015.95","DOIUrl":"https://doi.org/10.1109/INCOS.2015.95","url":null,"abstract":"In this paper, we are continuing to show mutual intersection of two different areas of research: complex networks and evolutionary computation. We demonstrate that dynamics of evolutionary algorithms, that are based on Darwin theory of evolution and Mendel theory of genetic heritage, can be also visualized as complex networks. Such network can be then analyzed by means of classical tools of complex networks science. Results presented in our previous papers were currently numerical demonstration rather than theoretical mathematical proofs. We opened question whether evolutionary algorithms really create complex network structures and whether this knowledge can be successfully used like feedback for control of evolutionary dynamics and its improvement in order to increase the performance of evolutionary algorithms. This research paper is focused on the dynamics of complex networks from windows time point of view with proposition of a new windows time algorithm to evaluated evolution dynamics. There are described by temporal centralities and change centrality. These centralities are implemented as Gephi plugin and an own tool. At the end are examples of analysis of some networks using implemented algorithms.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132400232","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}

引用次数: 2