2017 9th International Conference on Information and Knowledge Technology (IKT)最新文献

筛选
英文 中文
Using models at run-time to measure quality of SAS in the large-scale software systems 在运行时使用模型来度量大型软件系统中SAS的质量
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258625
Rayehe Moeinfar, A. Barforoush
{"title":"Using models at run-time to measure quality of SAS in the large-scale software systems","authors":"Rayehe Moeinfar, A. Barforoush","doi":"10.1109/IKT.2017.8258625","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258625","url":null,"abstract":"[Context/ Motivation] The adaptation process in self-adaptive software systems modifies the system based on new monitored conditions to make the system able to deserve SLA (QoS). Some Researchers assume the environment as a closed-world. So, adaptation actions are predicted at design-time, to get applied at run-time. But uncertainty causes prediction about the all different conditions be impossible. [Objective] In this study we aim to handle the uncertainty consequences in the open-world by the use of two quality models presented in the process level and the product level. [Method] To reduce the cost of adaptation at run-time, an integrated approach for modeling and verifying the requirements of SAS is used as well as a measurement method to measure the level of satisficing quality factors using Model Driven Engineering (MDE). [Results] When the measurement (i.e. the deviation from desired behavior) is taken into account in early phases of development, not only the adaptation cost degrades, but also the undesired consequences do not propagate to the next phases. [Conclusion] To sum up, in this paper requirements are modeled based on GORE models. Then an SAS Quality model is augmented in the goal model. This embedded model is verified by OMEGA2/ IFX profile. The verified model is transformed to alternative architectural models by some defined transformation rules which is written in ATLAS language, implemented in Eclipse Modeling Framework (EMF).","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"339 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133953503","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}
引用次数: 1
CLDA: Vertex-cut partitioning for streaming power-law graphs 流式幂律图的顶点切割分区
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258626
Hadis Cheraghzade Rad, R. Azmi
{"title":"CLDA: Vertex-cut partitioning for streaming power-law graphs","authors":"Hadis Cheraghzade Rad, R. Azmi","doi":"10.1109/IKT.2017.8258626","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258626","url":null,"abstract":"Graph partitioning is considered to be a standard solution to process large graphs efficiently when processing them on a single machine becomes inefficient due to its limited computation power and storage space. Although numerous algorithms are proposed in this area, but most of them create high computation cost and are not designed to process real-world large scale graphs as they process the whole graph prior to partitioning. Therefore, Early-stage research focuses streaming graph partitioning to reduce the computation cost by assigning the edges or vertices on-the-fly to the computing nodes. In this work, we propose “ Consider Low-degree Edges Assignment” (CLDA), a novel vertex-cut graph partitioning algorithm that exploits skewed degree distributions by explicitly taking into account vertex degree in the placement decision. This method can create partitions which are more balanced, so it would be able to reduce the computation overhead. We experimentally evaluate CLDA on real-world graphs and show that it outperforms all existing algorithms in partitioning quality.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125073464","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
Designing a robust supply chain network using MADM and complex network theory 基于MADM和复杂网络理论的鲁棒供应链网络设计
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258614
Elnaz Bakhsharab, M. Ebrahimi
{"title":"Designing a robust supply chain network using MADM and complex network theory","authors":"Elnaz Bakhsharab, M. Ebrahimi","doi":"10.1109/IKT.2017.8258614","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258614","url":null,"abstract":"Typically, supply chain networks face numerous threats such as terrorist attacks, economic fluctuation, natural disasters and unexpected incidents. There is an increasing growth of demands among managers for designing a robust supply chain network against disruptions. Most of the existing approaches fail to design a general and robust one. In this paper, we explain a general approach for building robust supply chain networks. To explain further, the proposed method is designed in two main phases, generating the preliminary network using the local MADM method for each node in the first phase and rewiring it in order to enhance its robustness under disruptions in the second phase. Finally, performance of the proposed method is compared with other state-of-the-art algorithms, experimental results show that the proposed method outperforms other benchmark algorithms.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128974482","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}
引用次数: 1
A new approach for directory management in GlusterFS GlusterFS中目录管理的新方法
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258635
Tahereh Fattahi, R. Azmi
{"title":"A new approach for directory management in GlusterFS","authors":"Tahereh Fattahi, R. Azmi","doi":"10.1109/IKT.2017.8258635","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258635","url":null,"abstract":"Distributed filesystems provide possibility of storing and sharing large amount of data. They also provide an environment for users to store and maintain their data simply. Unlike most distributed filesystems, GlusterFS stores and manages data and metadata together. GlusterFS is a highly scalable filesystem that provides access to a large number of clients. One of the problems that GlusterFS faces is metadata operations that can be considered as a result of directory metadata distribution among all servers. The purpose of this distribution is to provide quick and easy access to data. In this study we proposed a new indexing method to improve directory management and operation. We used incremental directory distribution to avoid small directory distributing. Experiment results demonstrate improvement of locality and decreasing of sequential access to directory entries about 17%. GlusterFS Rebalance operation for adding one server to filesystem is very costly. Our method reduced this cost approximately 74% in average.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122843127","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
A new model for the analysis of Persian web traffic graphs 波斯语网络流量图分析的新模型
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258634
Maryam Tasviri, Hoda Ghavamipour, S. Golpayegani
{"title":"A new model for the analysis of Persian web traffic graphs","authors":"Maryam Tasviri, Hoda Ghavamipour, S. Golpayegani","doi":"10.1109/IKT.2017.8258634","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258634","url":null,"abstract":"This paper attempts to provide a new model for the analysis of a Persian-language web traffic graph. This graph was generated according to the relationship link between two websites, based on the inbound and outbound traffic of each website. The essential information for generating the graph was retrieved from Alexa.com. The graph was then analyzed using several social network analysis techniques. The results of this study indicated that influential websites can be identified using a combination of factors, such as betweenness centrality, In degree and Out degree of traffic in the network. Additionally, influential websites can make profitable modifications which would be in line with improving the quality of the content of Persian-language websites, including a greater number of overall visits.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129601513","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
Scheduling hybrid workflows using extended look-ahead approach in utility grid 基于扩展前瞻性方法的电网混合工作流调度
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258618
Shahab Nassiri, Mahmoud Naghibzadeh
{"title":"Scheduling hybrid workflows using extended look-ahead approach in utility grid","authors":"Shahab Nassiri, Mahmoud Naghibzadeh","doi":"10.1109/IKT.2017.8258618","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258618","url":null,"abstract":"A workflow represents a complex activity that is often modeled by a directed acyclic graph (DAG) in which each vertex is a task and each directed edge represents both precedence and communication. Recently, Hybrid DAG has emerged as a new model. In this model, unlike the traditional DAG model, tasks can also interact during their executions. Hybrid workflows that are composed of tasks and super-tasks can be modeled using hybrid DAGs. With respect to scheduling workflows to run on the Grid, Lookahead is an important list-based algorithm. To assign a processor to a task, it predicts the status of the system after the children of this task are scheduled and then makes the final decision on this task. One source of sometimes low performance of Lookahead is that unscheduled parents of these children are not given higher priority over the corresponding children's tasks. In this paper, we have proposed the Extended Lookahead algorithm in which this deficiency of Lookahead is removed. In next step, the Extended Lookahead, HEFT, and Lookahead approaches are modified such that they are able to schedule hybrid workflows that will be executed in the utility Grid. The experimental comparison results show that the performance of the new approach is improved compared to both HEFT and Lookahead.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114206957","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
Mechanism design for pricing and bandwidth allocation in heterogeneous wireless networks to maximize the social welfare 基于社会福利最大化的异构无线网络定价与带宽分配机制设计
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258630
Vahid Haghighatdoost, S. Khorsandi
{"title":"Mechanism design for pricing and bandwidth allocation in heterogeneous wireless networks to maximize the social welfare","authors":"Vahid Haghighatdoost, S. Khorsandi","doi":"10.1109/IKT.2017.8258630","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258630","url":null,"abstract":"In this paper, we present a mechanism for bandwidth allocation and pricing in heterogeneous wireless networks. A proposed three stage game involves three types of agents 1) Network providers 2) Regulatory agent and 3) The Clients play the game. The goal of our mechanism design is increasing the social welfare means that while the network providers are satisfied from preparing and releasing the bandwidth, the clients deliver their bandwidth with a suitable price. When the Purchasing power in a society increases, we can interfere that the client welfare is increased but the very-low price for the products is not profitable for the producers thus to increase the social welfare we should attend to the welfare of network providers as well as the clients. The proposed mechanism guarantees the maximum payoff for the network providers and offers the clients to weighting and ranking the available networks and then prepares the best request bundle to receive the service. The violation from the proposed mechanism is not profitable for network providers and clients and as it is proved in the paper the allocation result is Pareto efficient.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121593149","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}
引用次数: 7
Shape-based human action recognition using multi-input topology of deep belief networks 基于形状的深度信念网络多输入拓扑人体动作识别
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258612
A. Nickfarjam, H. Ebrahimpour-Komleh
{"title":"Shape-based human action recognition using multi-input topology of deep belief networks","authors":"A. Nickfarjam, H. Ebrahimpour-Komleh","doi":"10.1109/IKT.2017.8258612","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258612","url":null,"abstract":"This paper proposes a supervised approach for human action recognition by taking the power of simple features and advantages of multi-input topology of deep belief network (DBN) for accurate classification. This method is based on motion energy image (MEI) and difference energy array (DEA) in order to describe spatial and temporal domains, respectively. MEI can makes difference between actions which have much inter-class variations. About similar actions in inter-class variations, a simple time domain feature named DEA is used. After creating feature arrays, multi-input DBN is used for accurate action classification. We assume camera view-point and background clutters are fixed and this technique is robust on poor video quality, different scales in videos and human or action variations such as differences in manner, speed, body size and clothing. Also, simple implementation is advantage of the proposed method. Experimental results show the superiority of this approach over competing techniques on KTH dataset.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128124834","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
A new support vector finder method, based on triangular calculations and K-means clustering 一种新的基于三角计算和K-means聚类的支持向量查找方法
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258617
Seyed Muhammad Hossein Mousavi, S. Mirinezhad, Atiye Mirmoini
{"title":"A new support vector finder method, based on triangular calculations and K-means clustering","authors":"Seyed Muhammad Hossein Mousavi, S. Mirinezhad, Atiye Mirmoini","doi":"10.1109/IKT.2017.8258617","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258617","url":null,"abstract":"Finding and determining best Support vector samples, play and important role in the accuracy and efficiency of classification process. Many support vector methods have been proposed, which each one has its pros and cons. In this paper, a new support vector finder method, based on triangle, has been presented, which finds support vectors based on triangular calculations, like calculating triangle angles, area and defining threshold for them. According to those thresholds, Support vectors for each class will be defined. At the end of the whole process, K-means clustering method takes place on the remaining samples. Note that K-means could happen before the main process. After finding support vectors, the result will be classified by classification algorithms like SVM, Least Squares and Linear discriminant analysis algorithms, in the binary mode, and the acquired results will be compared with original data. The acquired results are satisfactory, precise and comparable with the best support vector finder methods.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127186646","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}
引用次数: 8
Improving cuckoo optimization algorithm for solving multimodal problems and non-cooperative games 改进布谷鸟优化算法求解多模态问题和非合作博弈
2017 9th International Conference on Information and Knowledge Technology (IKT) Pub Date : 2017-10-01 DOI: 10.1109/IKT.2017.8258615
Fatemeh Abedi Lomer, Rahebeh Mojtahedi Saffari
{"title":"Improving cuckoo optimization algorithm for solving multimodal problems and non-cooperative games","authors":"Fatemeh Abedi Lomer, Rahebeh Mojtahedi Saffari","doi":"10.1109/IKT.2017.8258615","DOIUrl":"https://doi.org/10.1109/IKT.2017.8258615","url":null,"abstract":"There are several optimal solutions for a multimodal optimization problem. In fact, a multimodal problem has several optimal points and all these points help to find the solution. In this paper, a new algorithm based on Cuckoo Optimization Algorithm is presented for solving the multimodal problems. In the proposed algorithm, the multimodal optima are searched in a separate group of cuckoos which have no coevolution relation. The performance of the proposed algorithm on the multimodal testing functions has shown the proper results in finding the optimal points and also reducing the number of function assessments. As a practical matter and closeness to the real world problems, finding the Nash equilibrium points in the noncooperative several-individual games is categorized under hard problems which the mathematical techniques cannot identify all the equilibrium points to solve. The results of proposed method indicate its performance compare to other methods in finding all parts of the Nash equilibrium points.","PeriodicalId":338914,"journal":{"name":"2017 9th International Conference on Information and Knowledge Technology (IKT)","volume":"103 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115749853","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信