检索结果-内蒙古大学图书馆

arXiv 2018年

作者： Ahmed, Bestoun S. Gambardella, Luca M. Afzal, Wasif Zamli, Kamal Z. Manno-LuganoCH-6928 Switzerland Department of Computer Science Faculty of Electrical Engineering Czech Technical University Karlovo nam. 13 Praha 2121 35 Czech Republic School of Innovation Design and Engineering Mlardalen University Sweden Faculty of Computer Systems and Software Engineering University Malaysia Pahang Gambang Malaysia

Context: Combinatorial testing strategies have lately received a lot of attention as a result of their diverse applications. In its simple form, a combinatorial strategy can reduce several input parameters (configurations) of a system into a small set based on their interaction (or combination). In practice, the input configurations of software systems are subjected to constraints, especially in case of highly configurable systems. To implement this feature within a strategy, many difficulties arise for construction. While there are many combinatorial interaction testing strategies nowadays, few of them support constraints. Objective: This paper presents a new strategy, to construct combinatorial interaction test suites in the presence of constraints. Method: The design and algorithms are provided in detail. To overcome the multi-judgement criteria for an optimal solution, the multi-objective particle swarm optimisation and multithreading are used. The strategy and its associated algorithms are evaluated extensively using different benchmarks and comparisons. Results: Our results are promising as the evaluation results showed the efficiency and performance of each algorithm in the strategy. The benchmarking results also showed that the strategy can generate constrained test suites efficiently as compared to state-of-the-art strategies. Conclusion:The proposed strategy can form a new way for constructing of constrained combinatorial interaction test suites. The strategy can form a new and effective base for future implementations. Copyright © 2018, The Authors. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Guest Editorial Special Issue on Security and Privacy in Cyber-Physical systems

引用

IEEE Internet of Things Journal 2017年第6期4卷 1798-1800页

作者： Yu, Wei Fu, Xinwen Song, Houbing Economides, Anastasios A. Jo, Minho Zhao, Wei Department of Computer and Information Sciences Towson University TowsonMD21252 United States Department of Computer Science University of Central Florida OrlandoFL32816 United States Department of Electrical Computer Software and Systems Engineering Embry-Riddle Aeronautical University Daytona BeachFL32114 United States Computer Networks and Telematic Applications Laboratory University of Macedonia Thessaloniki546 36 Greece Department of Computer Convergence Software Korea University Seoul Korea Republic of University of Macau China

A typical cyber-physical system (CPS) refers to a system that features a tight integration of computation, networking, and physical elements for interactions between cyber and physical spaces. The Internet of Things (IoT) is considered to be the networking infrastructure of CPS. Applications of CPS cover numerous smart-world research areas that our daily life depends upon, including smart transportation, smart electrical power grid, smart cities, smart medical systems, smart manufacturing systems, and others. While major research on improving the efficiency and reliability of CPS by using advanced information and communication technologies has been conducted, the risks of cyberspace security and privacy breaches in CPS need to be seriously investigated before a massive deployment of CPS technologies can or should be realized.

关键词： Special issues and sections Cyber-physical systems Smart cities Smart grids Manufacturing processes

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Q-Learning Sine-Cosine-based Strategy for Addressing the Combinatorial Test Suite Minimization Problem

arXiv

引用

arXiv 2018年

作者： Zamli, Kamal Z. Din, Fakhrud Ahmed, Bestoun S. Bures, Miroslav IBM Centre of Excellence Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang Lebuhraya Tun Razak Kuantan Pahang Darul Makmur 26300 Malaysia Department of Computer Science Faculty of Electrical Engineering Czech Technical University Karlovo nam. 13 Praha 2121 35 Czech Republic

The sine-cosine algorithm (SCA) is a new population-based meta-heuristic algorithm. In addition to exploiting sine and cosine functions to perform local and global searches (hence the name sine-cosine), the SCA introduces several random and adaptive parameters to facilitate the search process. Although it shows promising results, the search process of the SCA is vulnerable to local minima/maxima due to the adoption of a fixed switch probability and the bounded magnitude of the sine and cosine functions (from-1 to 1). In this paper, we propose a new hybrid Q-learning sine-cosine-based strategy, called the Q-learning sine-cosine algorithm (QLSCA). Within the QLSCA, we eliminate the switching probability. Instead, we rely on the Q-learning algorithm (based on the penalty and reward mechanism) to dynamically iden-tify the best operation during runtime. Additionally, we integrate two new operations (Lvy ight motion and crossover) into the QLSCA to facilitate jumping out of local minima/maxima and enhance the solution diversity. To assess its performance, we adopt the QLSCA for the combinatorial test suite minimization problem. Experimental results reveal that the QLSCA is sta-tistically superior with regard to test suite size reduction compared to recent state-of-the-art strategies, including the original SCA, the particle swarm test generator (PSTG), adaptive particle swarm optimization (APSO) and the cuckoo search strategy (CS) at the 95% confidence level. However, con-cerning the comparison with discrete particle swarm optimization (DPSO), there is no significant difference in performance at the 95% confidence level. On a positive note, the QLSCA statistically outperforms the DPSO in certain configurations at the 90% confidence level. Copyright © 2018, The Authors. All rights reserved.

关键词： Cosine transforms

来源：评论

学校读者我要写书评

暂无评论

Artificial Intelligence Powered MOOCs: A Brief Survey

Artificial Intelligence Powered MOOCs: A Brief Survey

引用

IEEE International Conference on Agents (ICA)

作者： Simon Fauvel Han Yu Chunyan Miao Lizhen Cui Hengjie Song Liang Zhang Xiaoming Li Cyril Leung Joint NTU-UBC Research Centre of Excellence in Active Living for the Elderly (LILY) Nanyang Technological University Singapore School of Computer Science and Engineering Nanyang Technological University Singapore School of Software Engineering Shandong University Jinan China School of Software Engineering South China University of Technology Guangzhou China Institute of Network Computing and Information Systems Peking University Beijing China Department of Electrical and Computer Engineering University of British Columbia Vancouver Canada

Massive Open Online Courses (MOOCs) have gained tremendous popularity in the last few years. Thanks to MOOCs, millions of learners from all over the world have taken thousands of high-quality courses for free. Artificial intelligence (AI) has played an important role in making MOOCs what they are today. By exploiting the vast amount of data generated by learners engaging in MOOCs, AI techniques have been proposed to improve our understanding of MOOC participants and enable MOOC practitioners to deliver better courses. These approaches have also greatly improved student experience and learning outcomes through constructing intelligent and personalized learning trajectories. In this paper, we first review the state-of-the-art AI research making an impact on MOOCs education, emphasizing on works which aim to enhance our understanding of student learning behaviours, improve student engagement, and improve learning outcomes. We then offer an overview of important future research to carry out in sub-fields of AI to enable MOOCs to reach their full potential.

关键词： Videos Artificial intelligence Tools Navigation Computational modeling Trajectory Education

来源：评论

学校读者我要写书评

暂无评论

Multi-view hybrid embedding: A divide-and-conquer approach

arXiv

引用

arXiv 2018年

作者： Xu, Jiamiao Yu, Shujian You, Xinge Leng, Mengjun Jing, Xiao-Yuan Chen, C. L. Philip School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States Department of Computer Science University of Houston HoustonTX77204 United States State Key Laboratory of Software Engineering School of Computer Wuhan University China Department of Computer and Information Science Faculty of Science and Technology University of Macau Macau99999 China Dalian Maritime University Dalian116026 China State Key Laboratory of Management and Control for Complex Systems Institute of Automation Chinese Academy of Sciences Beijing100080 China

We present a novel cross-view classification algorithm where the gallery and probe data come from different views. A popular approach to tackle this problem is the multiview subspace learning (MvSL) that aims to learn a latent subspace shared by multi-view data. Despite promising results obtained on some applications, the performance of existing methods deteriorates dramatically when the multi-view data is sampled from nonlinear manifolds or suffers from heavy outliers. To circumvent this drawback, motivated by the Divideand-Conquer strategy, we propose Multi-view Hybrid Embedding (MvHE), a unique method of dividing the problem of cross-view classification into three subproblems and building one model for each subproblem. Specifically, the first model is designed to remove view discrepancy, whereas the second and third models attempt to discover the intrinsic nonlinear structure and to increase discriminability in intra-view and interview samples respectively. The kernel extension is conducted to further boost the representation power of MvHE. Extensive experiments are conducted on four benchmark datasets. Our methods demonstrate overwhelming advantages against the stateof-the-art MvSL based cross-view classification approaches in terms of classification accuracy and robustness. Copyright © 2018, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Using measurement and simulation for understanding distributed development processes in the cloud 17

Using measurement and simulation for understanding distribut...

引用

27th International Workshop on software Measurement and 12th International Conference on software Process and Product Measurement, IWSM Mensura 2017

作者： Lunesu, Ilaria Marchesi, Michele Münch, Jürgen Kuhrmann, Marco University of Cagliari Department of Electrical and Electronic Engineering Italy University of Cagliari Department of Mathematics and Computer Science Italy Reutlingen University Business Informatics and Herman Hollerith Center Germany Clausthal University of Technology Institute for Applied Software Systems Engineering Germany

ISBN: (纸本)9781450348539

Organizations increasingly develop software in a distributed manner. The Cloud provides an environment to create and maintain software-based products and services. Currently, it is widely unknown which software processes are suited for Cloud-based development and what their effects in specific contexts are. This paper presents a process simulation to study distributed development in the Cloud. We contribute a simulation model, which helps analyzing different project parameters and their impact on projects carried out in the Cloud. The simulator helps reproducing activities, developers, issues and events in the project, and it generates statistics, e.g., on throughput, total time, and lead and cycle time. The aim of this simulation model is thus to analyze the tradeoffs regarding throughput, total time, project size, and team size. Furthermore, the modified simulation model aims to help project managers select the most suitable planning alternative. Based on observed projects in Finland and Spain, we simulated a distributed project using artificial and real data. Particularly, we studied the variables project size, team size, throughput, and total project duration. A comparison of the real project data with the results obtained from the simulation shows the simulation producing results close to the real data, and we could successfully replicate a distributed software project. By improving the understanding of distributed development processes, our simulation model thus supports project managers in their decision-making. © 2017 Association for Computing Machinery.

关键词： Throughput

来源：评论

学校读者我要写书评

暂无评论

Node verification to join the cloud environment using third party verification server

International Journal of Interactive Mobile Technologies

引用

International Journal of Interactive Mobile Technologies 2017年第4期11卷 55-65页

作者： Aljammal, Ashraf H. Bani-Salameh, Hani Alsarhan, Ayoub Kharabsheh, Mohammad Obiedat, Mamoon Department of Computer Science and its Applications Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology The Hashemite University Zarqa Jordan Department of Software Engineering Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology The Hashemite University Zarqa Jordan Department of Computer Information Systems Faculty of Prince Al-Hussein Bin Abdullah II for Information Technology The Hashemite University Zarqa Jordan

Currently, cloud computing is facing different types of threats whether from inside or outside its environment. This may cause cloud to be crashed or at least unable to provide services to the requests made by clients. In this paper, a new technique is proposed to make sure that the new node which asks to join the cloud is not composing a threat on the cloud environment. Our new technique checks the node before it will be guaranteed to join the cloud whether it runs malwares or software that could be used to launch an attack. In this way the cloud will allow only the clean node to join it, eliminating the risk of some types of threats that could be caused by infected nodes.

关键词： Network security

来源：评论

学校读者我要写书评

暂无评论

Fuzzy adaptive tuning of a particle swarm optimization algorithm for variable-strength combinatorial test suite generation

arXiv

引用

arXiv 2018年

作者： Zamli, Kamal Z. Ahmed, Bestoun S. Mahmoud, Thair Afzal, Wasif Faculty of Computer Systems and Software Engineering University Malaysia Pahang Gambang Malaysia Department of Computer Science Faculty of Electrical Engineering Czech Technical University Karlovo ńam. 13 Praha 2121 35 Czech Republic School of Engineering Edith Cowan University 270 Joondalup Dr JoondalupWA6027 Australia School of Innovation Design and Engineering Mälardalen University Sweden

Combinatorial interaction testing is an important software testing technique that has seen lots of recent interest. It can reduce the number of test cases needed by considering interactions between combinations of input parameters. Empirical evidence shows that it effectively detects faults, in particular, for highly configurable software systems. In real-world software testing, the input variables may vary in how strongly they interact;variable strength combinatorial interaction testing (VS-CIT) can exploit this for higher effectiveness. The generation of variable strength test suites is a non-deterministic polynomial-time (NP) hard computational problem [1]. Research has shown that stochastic population-based algorithms such as particle swarm optimization (PSO) can be efficient compared to alternatives for VS-CIT problems. Nevertheless, they require detailed control for the exploitation and exploration trade-off to avoid premature convergence (i.e. being trapped in local optima) as well as to enhance the solution diversity. Here, we present a new variant of PSO based on Mamdani fuzzy inference system [2, 3, 4], to permit adaptive selection of its global and local search operations. We detail the design of this combined algorithm and evaluate it through experiments on multiple synthetic and benchmark problems. We conclude that fuzzy adaptive selection of global and local search operations is, at least, feasible as it performs only second-best to a discrete variant of PSO, called DPSO. Concerning obtaining the best mean test suite size, the fuzzy adaptation even outperforms DPSO occasionally. We discuss the reasons behind this performance and outline relevant areas of future work. Copyright © 2018, The Authors. All rights reserved.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

Content-centric event-insensitive big data reduction in internet of things

Content-centric event-insensitive big data reduction in inte...

引用

2017 IEEE Global Communications Conference, GLOBECOM 2017

作者： Bhuiyan, Zakirul Alam Wang, Guojun Wang, Tian Rahman, Arafatur Wu, Jie Department of Computer and Information Sciences Fordham University New YorkNY10458 United States School of Computer Science and Educational Software Guangzhou University Guangzhou510006 China College of Computer Science and Technology Huaqiao University Xiamen361021 China Faculty of Computer Systems and Software Engineering University Malaysia Pahang26300 Malaysia Center for Networked Computing Temple University PhiladelphiaPA19122 United States

ISBN: (纸本)9781509050208;9781509050192

As more knowledge discovery functions or sensing units for event detection are added to sensor devices in the Internet of Things (IoT), devices acquire big data that is bigger than they are able to deliver using their radios in a given time window. As a result, energy consumption for big data acquisition and transmission and real-time data processing are great challenges. In this paper, we introduce BigReduce, a low- cost IoT framework for event detection that reduces a big amount of data at the time of data acquisition and before the data transmission across the network. BigReduce works on the analysis of the frequency content of signals as they are acquired and efficiently adapts the frequency rate based on the sensitivity to a respective event, such as fire event. Instead of transmitting the entire set of acquired data, BigReduce transmits only the signals that have a high event-sensitivity. We provide a detailed algorithm for fire event sensitivity indication based on the frequency consents. Results achieved through a lab testbed show that BigReduce is able to reduce energy consumption by at least 78% and data volume by 82% in comparison to other frameworks. © 2017 IEEE.

关键词： Data mining

来源：评论

学校读者我要写书评

暂无评论

Brain morphometry analysis with surface foliation theory

arXiv

引用

arXiv 2018年

作者： Wen, Chengfeng Lei, Na Ma, Ming Qi, Xin Zhang, Wen Wang, Yalin Gu, David Xianfeng Department of Computer Science Stony Brook University Stony BrookNY11794 United States School of Software and Technology Dalian University of Technology Dalian116620 China School of Computing Informatics and Decision Systems Engineering Arizona State University TempeAZ85281 United States

Brain morphometry study plays a fundamental role in neuroimaging research. In this work, we propose a novel method for brain surface morphometry analysis based on surface foliation theory. Given brain cortical surfaces with automatically extracted landmark curves, we first construct finite foliations on surfaces. A set of admissible curves and a height parameter for each loop are provided by users. The admissible curves cut the surface into a set of pairs of pants. A pants decomposition graph is then constructed. Strebel differential is obtained by computing a unique harmonic map from surface to pants decomposition graph. The critical trajectories of Strebel differential decompose the surface into topological cylinders. After conformally mapping those topological cylinders to standard cylinders, parameters of standard cylinders (height, circumference) are intrinsic geometric features of the original cortical surfaces and thus can be used for morphometry analysis purpose. In this work, we propose a set of novel surface features rooted in surface foliation theory. To the best of our knowledge, this is the first work to make use of surface foliation theory for brain morphometry analysis. The features we computed are intrinsic and informative. The proposed method is rigorous, geometric, and automatic. Experimental results on classifying brain cortical surfaces between patients with Alzheimer's disease and healthy control subjects demonstrate the efficiency and efficacy of our method. Copyright © 2018, The Authors. All rights reserved.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：