2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)最新文献

Region Expansion Algorithm: A Well-Quality Region Proposal Generation 区域扩展算法:一种高质量的区域建议生成

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566274

M. Taghizadeh, A. Chalechale

{"title":"Region Expansion Algorithm: A Well-Quality Region Proposal Generation","authors":"M. Taghizadeh, A. Chalechale","doi":"10.1109/ICCKE.2018.8566274","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566274","url":null,"abstract":"This paper proposes an efficient algorithm to appropriately generate a limited number of regions, socalled a region proposal algorithm, for resolving computer vision problems. The most important challenge in region proposal technique is to accurately produce a limited number of regions. This literature introduces an algorithm to answer to the challenge through expanding region. The proposed algorithm comprises of two components and in a triple way. The first component divides an image into some non-overlapping regions. Afterwards, each region is developed in adjacent regions based on the 8-connectivity in the second component. In fact, the image is represented by overlapping expanded regions. This component can be executed to three different modes as fixed, all, and efficient-mode. Our proposed algorithm shows better results than existing state-of-the-art segmentation algorithms, including EGBS, Quick shift, and SLIC. The quality of the regions is measured according to the best overlap and recall metrics at MSRC dataset. The results show the good achievement of the overlap and recall as well. The best result is acquired by EGBS and efficient-mode around 24% and 13% improvement for recall and the best overlap, respectively.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"14 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121011237","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}

引用次数: 4

2020 10th International Conference on Computer and Knowledge Engineering (ICCKE) 2020第十届计算机与知识工程国际会议(ICCKE)

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/iccke.2018.8566338

Ieee Staff

引用次数: 1

Development of an Adaptive Multipath Routing Algorithm by Examining the Congestion and Channel Fault of One-Hop Nodes in Network-on-Chip 基于片上网络单跳节点拥塞和信道故障的自适应多径路由算法研究

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566504

Forough Shafiei, Vahid Sattari-Naeini

{"title":"Development of an Adaptive Multipath Routing Algorithm by Examining the Congestion and Channel Fault of One-Hop Nodes in Network-on-Chip","authors":"Forough Shafiei, Vahid Sattari-Naeini","doi":"10.1109/ICCKE.2018.8566504","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566504","url":null,"abstract":"As the complexity of system-on-chips increased, new network-on-chips have been introduced in a multi-core system with new communication design. Increasing the capacity of network-on-chip will increase the faults and congestion in the network. To deal with these challenges, an efficient routing algorithm is required. Given that most routing algorithms only examine the position of the adjacent channel, they may send the packets to a congestive or defective region. In this case, the delay will increase, and as a result, the network performance decreases. In present study, an adaptive routing algorithm is proposed for a two-dimensional mesh. This algorithm examines the channels of neighboring nodes, in addition to the congestion and faults of adjacent channels. Finally, according to the information of the channels of neighboring nodes, it identifies those paths causing the packet loss, and selects an alternative route with the least congestion to send the packets; this increases the reliability of the network. The simulation results show that lower time delay and higher throughput can be obtained for different error rates.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121162337","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}

引用次数: 6

Proximity Mode Selection Method in Device to Device Communications 设备间通信中的接近模式选择方法

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566668

Marzieh Sheybani, M. Mehrjoo, M. Kazeminia

{"title":"Proximity Mode Selection Method in Device to Device Communications","authors":"Marzieh Sheybani, M. Mehrjoo, M. Kazeminia","doi":"10.1109/ICCKE.2018.8566668","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566668","url":null,"abstract":"Growing smart phones population and multimedia traffic in cellular networks have caused traffic congestion in base stations (BS) and increasing delay in responding users requests. Device-to-Device communication, shortly D2D, is a new feature of the emerging cellular network generation which can alleviate the traffic congestion in BS. One of the challenges of D2D is mode selection, i.e., deciding upon establishing a conventional cellular communication via BS or a direct D2D. In this paper, a mode selection method is proposed based on the use of the probability of users' proximity. Those users are nominated for D2D whose distance to their destination is higher than a range which creates proximity probability close to one. Moreover, the nominated one should not cause interference on other ongoing communications performing via BS or as D2D. The simulation of the proposed method in a cellular network shows that the required transmission power as well as the transmission latency decreases compared to the ones of a conventional cellular network where all calls are performed via the BS. In fact, the power and the delay reduction are caused by path loss deduction and frequency reusing gain, respectively, in D2D.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"77 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124557364","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}

引用次数: 4

Book2Vec: Representing Books in Vector Space Without Using the Contents Book2Vec:在矢量空间中表示图书而不使用内容

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566329

Soraya Anvari, Hossein Amirkhani

引用次数: 2

An Experimental Study on Robustness and Responsiveness Testing of Iranian Android Games 伊朗Android游戏鲁棒性和响应性测试实验研究

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566512

S. Paydar, Aidin Azamnouri

引用次数: 1

Semi-Federated Scheduling of Multiple Periodic Real-Time DAGs of Non-Preemptable Tasks 非抢占任务多周期实时dag的半联邦调度

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566678

Masoud Shariati, Mahmoud Naghibzadeh, Hamid Noori

{"title":"Semi-Federated Scheduling of Multiple Periodic Real-Time DAGs of Non-Preemptable Tasks","authors":"Masoud Shariati, Mahmoud Naghibzadeh, Hamid Noori","doi":"10.1109/ICCKE.2018.8566678","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566678","url":null,"abstract":"Research on real-time scheduling of tasks having different periods has a long history. Passing from uniprocessors to multiprocessors, and from independent sequential tasks to models like DAGs, each was an important turning point causing the need for a heavy mass of new research work. In this research, we consider the problem of scheduling multiple periodic realtime DAGs of non-preemptable tasks on multiprocessor platforms. The DAGs are independent and the deadline of each is until the arrival of the next request for the same DAG. In the context of multiple periodic real-time DAGs scheduling, federated scheduling has been a very successful approach and in this paper we try to extend this idea. The key feature of the federated approach is the dedication of cores to DAGs. An important disadvantage of federated scheduling is that for each DAG a significant portion of its dedicated processing capacity may be wasted. The novelty of the current paper is the proposing of a new method for semi-federated scheduling of multiple DAGs and we try to remedy the mentioned disadvantage to some extent. This is done by compacting the scheduling of each DAG and also relaxing the requirement for scheduling all tasks of a DAG on its dedicated cores. In the experiments section, we compared the proposed semi-federated method with a federated method and significant improvements in success ratio and the number of used cores is achieved, e.g. for a system with 64 cores and a workload of 80 percent, success ratio of the federated method was 0 percent and success ratio of the proposed method was 90 percent.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121302487","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

An Extensive Comparison of Feature Extraction Methods for Paraphrase Detection 意译检测中特征提取方法的广泛比较

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566303

Hassan Shahmohammadi, M. Dezfoulian, Muharram Mansoorizadeh

引用次数: 2

P4 to SDNet: Automatic Generation of an Efficient Protocol-Independent Packet Parser on Reconfigurable Hardware P4到SDNet:在可重构硬件上自动生成一个有效的独立于协议的包解析器

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566590

Abbas Yazdinejad, Ali Bohlooli, K. Jamshidi

{"title":"P4 to SDNet: Automatic Generation of an Efficient Protocol-Independent Packet Parser on Reconfigurable Hardware","authors":"Abbas Yazdinejad, Ali Bohlooli, K. Jamshidi","doi":"10.1109/ICCKE.2018.8566590","DOIUrl":"https://doi.org/10.1109/ICCKE.2018.8566590","url":null,"abstract":"Nowadays network managers look for ways to change the design and management of networks that can make decisions on the control plane. Future switches should be able to support the new features and flexibility required for parsing and processing packets. One of the critical components of switches is the packet parser that processes the headers of the packets to be able to decide on the incoming packets. Here the data plane, and particularly packet parser in OpenFlow switches, which should have the flexibility and programmability to support the new requirements and OpenFlow multiple versions, are focused. Designed here is an architecture that unlike the static network equipments, it has the flexibility and programmability in the data plane network, especially the SDN network, and supports the parsing and processing of specific packets. To describe this architecture, a high-level P4 language is used to implement it on a reconfigurable hardware (i.e., FPGA). After automatic generating the protocol-independent Packet parser architecture on the Virtex-7, it is compiled to firmware by Xilinx SDNet, and ultimately an FPGA Platform is implemented. It has fewer consumption resources and it is more efficient in terms of throughput and processing speed in comparison with other architectures.","PeriodicalId":283700,"journal":{"name":"2018 8th International Conference on Computer and Knowledge Engineering (ICCKE)","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121838745","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}

引用次数: 28

Feature Selection in Microarray Gene Expression Data Using Fisher Discriminant Ratio 基于Fisher判别比的微阵列基因表达数据特征选择

2018 8th International Conference on Computer and Knowledge Engineering (ICCKE) Pub Date : 2018-10-01 DOI: 10.1109/ICCKE.2018.8566649

Saeed Sarbazi-Azad, M. S. Abadeh, Mehdi Irannejad Najaf Abadi

引用次数: 3