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.
{"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}
Obiora Sam Ezeora, J. Heckenbergerova, P. Musílek, P. Krömer
It has become evident that for low-power design concept to be realized, modules within the system need to be optimized. Consequently, the sensor node architecture also known as sensor station is required to operate in an optimized manner to help contribute in reduction of total power consumption of the system. Photosynthetically active radiation (PAR) data obtainedin a Brazilian field study were used to investigate the errors in measurements that would have been missed if sampling time of PAR variable was increased from 5 minutes upto 30 minutes. This is required, not only to help reduce of energy consumption of the sensor station but also to help facilitate the integration of lower frequency bands of industrial scientific and medical (ISM) into the system. Results obtained indicate that daytime PAR variable should be sampled and logged every 20 minutes while longer sampling time may be used during the night-time. Daytime sampling of 30 minutes interval is not recommended.
{"title":"Evaluation of Errors Caused by Lowering Frequency of Measurements of an Environmental Sensor Station","authors":"Obiora Sam Ezeora, J. Heckenbergerova, P. Musílek, P. Krömer","doi":"10.1109/INCoS.2015.44","DOIUrl":"https://doi.org/10.1109/INCoS.2015.44","url":null,"abstract":"It has become evident that for low-power design concept to be realized, modules within the system need to be optimized. Consequently, the sensor node architecture also known as sensor station is required to operate in an optimized manner to help contribute in reduction of total power consumption of the system. Photosynthetically active radiation (PAR) data obtainedin a Brazilian field study were used to investigate the errors in measurements that would have been missed if sampling time of PAR variable was increased from 5 minutes upto 30 minutes. This is required, not only to help reduce of energy consumption of the sensor station but also to help facilitate the integration of lower frequency bands of industrial scientific and medical (ISM) into the system. Results obtained indicate that daytime PAR variable should be sampled and logged every 20 minutes while longer sampling time may be used during the night-time. Daytime sampling of 30 minutes interval is not recommended.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"102 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":"115970519","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}
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.
{"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}
The monitoring process and evaluation of an official higher education degree or master is performed by an annual report based on a set of requirements defined by the quality agencies which are responsible to evaluate such quality. Taking into account that these reports are made up by a set of evidences that are gathered during the whole instructional process, we propose the use of a support tool. This tool will allow the improvement of the efficiency of the process and will facilitate the quality evaluation. This paper introduces the collaborative evaluation process applied in our faculty and how the supportive tool helps to enhance the evaluation process.
{"title":"Collaborative Tool to Enhance Quality Evaluation of Higher Education Programmes","authors":"David Bañeres, Montse Serra, M. E. Rodríguez","doi":"10.1109/INCoS.2015.33","DOIUrl":"https://doi.org/10.1109/INCoS.2015.33","url":null,"abstract":"The monitoring process and evaluation of an official higher education degree or master is performed by an annual report based on a set of requirements defined by the quality agencies which are responsible to evaluate such quality. Taking into account that these reports are made up by a set of evidences that are gathered during the whole instructional process, we propose the use of a support tool. This tool will allow the improvement of the efficiency of the process and will facilitate the quality evaluation. This paper introduces the collaborative evaluation process applied in our faculty and how the supportive tool helps to enhance the evaluation process.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"12 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":"127314939","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}
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.
{"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}
This paper proposed a new Modified Costas loop to achieve carrier wave synchronization for QPSK with equal prior probability, as the conventional PLL can't make it due to the absence of the carrier partition. Models about phase detector, loop filter, and voltage controlled oscillator are designed in Simulink, and System Generator is also used to generate code automatically and download it into FPGA. Hardware-In-the-Loop co-simulation is implemented to output the results in the Simulink simultaneously. The results shows that the demodulated signal generated by the Costas structure has nice eye pattern and constellation map, and the design can lock the carrier frequency very well. Also, the system can get high performance through real-time debug and dynamic display, and can be applied in real engineering analysis.
{"title":"Analysis and Implementation of Modified Costas Loop for QPSK","authors":"Xiao-ou Song","doi":"10.1109/INCoS.2015.26","DOIUrl":"https://doi.org/10.1109/INCoS.2015.26","url":null,"abstract":"This paper proposed a new Modified Costas loop to achieve carrier wave synchronization for QPSK with equal prior probability, as the conventional PLL can't make it due to the absence of the carrier partition. Models about phase detector, loop filter, and voltage controlled oscillator are designed in Simulink, and System Generator is also used to generate code automatically and download it into FPGA. Hardware-In-the-Loop co-simulation is implemented to output the results in the Simulink simultaneously. The results shows that the demodulated signal generated by the Costas structure has nice eye pattern and constellation map, and the design can lock the carrier frequency very well. Also, the system can get high performance through real-time debug and dynamic display, and can be applied in real engineering analysis.","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"52 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":"121561786","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}
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.
目前，e-Learning系统是最流行和最具影响力的教育工具之一，因此，不仅设计者，而且使用者都必须非常反复地、稳定地循环地评估和改进e-Learning系统。在“操作系统”的讲座中，我们介绍了一个基于adobe flash的CPU调度算法模拟器。我们的模拟器支持三种主要的CPU调度算法，如firstcome - firstserve、最短处理时间优先和轮循。当然，它可以在独立使用Flash Player的环境中提供服务，也可以在主要的Web浏览器(如Microsoft Internet Explorer、Mozilla FireFox和b谷歌Chrome)上提供服务。作为对我们系统的评估，我们对上述环境的执行时间进行了比较，并通过用户问卷收集的信息进行了定量/定性评估。通过对比和问卷调查，证实本系统取得了良好且显著的水平性能。本文报道了我们的系统配置及其在“操作系统”实际讲座中的应用。并通过实际应用说明了定量/定性评价。在此基础上，我们对CPU调度算法进行了卓有成效的研究，并取得了一些卓有成效的成果。
{"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}
Admir Barolli, Tetsuya Oda, Keita Matsuo, L. Barolli, F. Xhafa, V. Loia
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.
{"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}
In this paper, we will give a short overview about the complexity and the challenges of basic steps when building a Data Mining System. Such a work cannot be realized without empirical experience. For this reason the essence of many projects has found its way into this paper. After the introduction that explains premises of Data Mining that are often underrated or ignored, it is said, that one of the biggest challenges in Data Mining is identification of data inside data sources. The paper shows several kinds of data sources that may include internal or external data and that may be of very different types of data bases or data files. It also explains kinds of traps and difficult challenges of the first steps of Data Mining. Several constellations and situations will be discussed and a method, which is described in literature, will be identified as being out of date. Finally a method for identifying tables, attributes and constraints inside a relational data base is presented, that is effective and highly efficient: Sniffing!
{"title":"An Unusual Approach to Basic Challenges of Data Mining","authors":"Thomas H. Lenhard, M. Greguš","doi":"10.1109/INCoS.2015.40","DOIUrl":"https://doi.org/10.1109/INCoS.2015.40","url":null,"abstract":"In this paper, we will give a short overview about the complexity and the challenges of basic steps when building a Data Mining System. Such a work cannot be realized without empirical experience. For this reason the essence of many projects has found its way into this paper. After the introduction that explains premises of Data Mining that are often underrated or ignored, it is said, that one of the biggest challenges in Data Mining is identification of data inside data sources. The paper shows several kinds of data sources that may include internal or external data and that may be of very different types of data bases or data files. It also explains kinds of traps and difficult challenges of the first steps of Data Mining. Several constellations and situations will be discussed and a method, which is described in literature, will be identified as being out of date. Finally a method for identifying tables, attributes and constraints inside a relational data base is presented, that is effective and highly efficient: Sniffing!","PeriodicalId":345650,"journal":{"name":"2015 International Conference on Intelligent Networking and Collaborative Systems","volume":"32 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":"129728123","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 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.
{"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：