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

FCA-based -iceberg core decomposition in graphs

Journal of Ambient Intelligence and Humanized Computing 2017年第2期15卷 1423-1428页

作者： Hao, Fei Xinchang, Khamphaphone Park, Doo-Soon Key Laboratory of Modern Teaching Technology Ministry of Education Xi’an China School of Computer Science Shaanxi Normal University Xi’an China Department of Computer Science and Engineering Soonchunhyang University Asan South Korea Department of Computer Software Engineering Soonchunhyang University Asan South Korea

Complex networking analysis is a powerful technique for understanding both complex networks and big graphs in ubiquitous computing. Particularly, there are several novel metrics, such as k-clique and k-core are proposed in order to study the relative importance of nodes in complex networks. Among of those metrics, k-core analysis is an effective approach for simplifying graphical structure. However, the relation between k and the scale of networks is not explored in most existing literature. Toward this end, this paper formulate a new research problem, $$\theta$$ -Iceberg Core decomposition in graphs, which is able to incorporate a parameter $$\theta$$ ( $$0<\theta \le 1$$ ) used for relaxing the output of k-cores. Further, we propose a formal concept analysis based approach for $$\theta$$ -Iceberg Core decomposition. The proposed approach and its conclusions can provide theoretical basis and guidance for the potential applications of $$\theta$$ -Iceberg Core analysis in complex networks.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Robust visual tracking using multi-frame multi-feature joint modeling

arXiv

引用

arXiv 2018年

作者： Zhang, Peng Yu, Shujian Xu, Jiamiao You, Xinge Jiang, Xiubao Jing, Xiao-Yuan Tao, Dacheng School of Electronic Information and Communications Huazhong University of Science and Technology Wuhan Hubei China Department of Electrical and Computer Engineering University of Florida GainesvilleFL32611 United States State Key Laboratory of Software Engineering School of Computer Wuhan University Wuhan430072 China School of Automation Nanjing University of Posts and Telecommunications Nanjing210023 China UBTech Sydney Artificial Intelligence Institute and the School of Information Technologies Faculty of Engineering and Information Technologies at the University of Sydney DarlingtonNSW2008 Australia

It remains a huge challenge to design effective and efficient trackers under complex scenarios, including occlusions, illumination changes and pose variations. To cope with this problem, a promising solution is to integrate the temporal consistency across consecutive frames and multiple feature cues in a unified model. Motivated by this idea, we propose a novel correlation filter-based tracker in this work, in which the temporal relatedness is reconciled under a multi-Task learning framework and the multiple feature cues are modeled using a multi-view learning approach. We demonstrate the resulting regression model can be efficiently learned by exploiting the structure of blockwise diagonal matrix. A fast blockwise diagonal matrix inversion algorithm is developed thereafter for efficient online tracking. Meanwhile, we incorporate an adaptive scale estimation mechanism to strengthen the stability of scale variation tracking. We implement our tracker using two types of features and test it on two benchmark datasets. Experimental results demonstrate the superiority of our proposed approach when compared with other state-of-The-Art trackers. MATLAB code is available from our project homepage http://***/ project/***. Copyright © 2018, The Authors. All rights reserved.

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

High-confidence software evolution

引用

science China(Information sciences) 2016年第7期59卷 94-112页

作者： Qing GAO Jun LI Yingfei XIONG Dan HAO Xusheng XIAO Kunal TANEJA Lu ZHANG Tao XIE Key Laboratory of High Confidence Software Technologies Mo E Institute of Software School of Electronics Engineering and Computer Science Peking University NEC Laboratories America Inc. 3. Accenture Technology Labs 4. Department of Computer Science University of Illinois at Urbana-Champaign

software continues to evolve due to changing requirements, platforms and other environmental pressures. Modern software is dependent on frameworks, and if the frameworks evolve, the software has to evolve as well. On the other hand, the software may be changed due to changing requirements. Therefore, in high-confidence software evolution, we must consider both framework evolution and client evolution, each of which may incur faults and reduce software quality. In this article, we present a set of approaches to address some problems in high-confidence software evolution. In particular, to support framework evolution, we propose a history-based matching approach to identify a set of transformation rules between different APIs, and a transformation language to support automatic transformation. To support client evolution for high-confidence software, we propose a path-exploration-based approach to generate tests efficiently by pruning paths irrelevant to changes between versions, several coverage-based approaches to optimize test execution, and approaches to locate faults and fix memory leaks automatically. These approaches facilitate high-confidence software evolution from various aspects.

关键词： software evolution high confidence software quality software development program analysis

来源：评论

学校读者我要写书评

暂无评论

Bayesian multi-hypothesis Wyner-Ziv video coding

引用

Journal of Information Hiding and Multimedia Signal Processing 2017年第2期8卷 478-485页

作者： Meng, Li Li Zong, Jing Xiu Sun, Gui Na Cheng, Jie Zhang, Jia Zhao, Meng Chen Department of Information Science and Engineering Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Shandong Normal University No.88 Wenhua East Road Jinan250014 China

The performance of distributed video coding (DVC) relies heavily on the quality of the side information (SI), and better performance can be expected if multiple SIs are employed. In this paper, we consider the scenario with two SIs, which are obtained by forward and backward predictions respectively. In this case, a couple of ad hoc approaches have been proposed to approximate the conditional probability density function (pdf) of a Wyner-Ziv-coded frame given the two SIs. However, the optimal conditional pdf and the relative performances of these ad hoc approaches with respect to the optimal solution have not been studied. In this paper, using Bayes’ formula, we derive the closed-form expression of the conditional pdf. Experimental results show that the Bayesian solution has similar performance to previous methods. Moreover, simulation results reveal that when better SIs are available, the Bayesian solution could outperform other methods. This analysis sheds some lights on developing future DVC schemes. © 2017 ISSN.

关键词： Probability density function

来源：评论

学校读者我要写书评

暂无评论

Users’ perceived control, trust and expectation on privacy settings of smartphone 9th

Users’ perceived control, trust and expectation on privacy ...

引用

9th International Symposium on Cyberspace Safety and Security, CSS 2017

作者： Zhou, Yun Raake, Alexander Xu, Tao Zhang, Xuyun School of Education Shaanxi Normal University Xi’anShaanxi710062 China Audiovisual Technology Group Institute for Media Technology University of Technology Ilmenau Ilmenau98693 Germany School of Software and Microelectronics Northwestern Polytechnical University Xi’anShaanxi710072 China State Key Laboratory for Manufacturing Systems Engineering Xi’an Jiaotong University Xi’anShaanxi710054 China Department of Electrical and Computer Engineering University of Auckland Auckland1010 New Zealand

ISBN: (纸本)9783319694702

A common issue is that a large number of authorized apps use important and sensitive personal information without arousing users’ full awareness. Existing schemes for privacy protection on smartphones try to provide users with privacy settings to control privacy leakage. Privacy settings on smartphone are intended to inform users about risks of privacy leakage and let users take over control of smartphone. Therefore, it is essential to understand and measure how much users perceive and trust these settings. To this end, we design and conduct a fine-grained online survey with 222 respondents. We collect the demographics as well as users’ smartphone usage, covering not only participants’ basic background information like age, gender, job, but also time of smartphone use per day, respective importance and sensitivity level of personal data, and their smartphone OSs. In this paper, we investigate users’ current privacy perception and protection on smartphone in different groups, discussing participants’ responses to (1) Rating the importance and sensitivity of personal information;(2) Trust on existing privacy protection;(3) Perceived control on smartphone;(4) Frequency of searching privacy knowledge;(5) Concerns about manufacturer and third-party company’s behaviors on personal data and decision. © 2017, Springer International Publishing AG.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Correction to: A whitelist and blacklist-based co-evolutionary strategy for defensing against multifarious trust attacks

引用

Applied Intelligence 2018年第7期48卷 1891-1891页

作者： Shujuan Ji Haiyan Ma Yongquan Liang Hofung Leung Chunjin Zhang Shandong Provincial Key Laboratory of Wisdom Mine Information Technology Shandong University of Science and Technology Qingdao China Shandong Provincial Key Laboratory of Novel Distributed Computer Software Technology Shandong Normal University Jinan China Department of Computer Science and Engineering The Chinese University of Hong Kong Hong Kong China Center of Network Shandong University of Science and Technology Qingdao China

The article A whitelist and blacklist-based co-evolutionary strategy for defensing against multifarious trust attacks, written by Shujuan Ji, Haiyan Ma, Yongquan Liang, Hofung Leung and Chunjin Zhang, was originally p...

关键词：

来源：评论

学校读者我要写书评

暂无评论

A new chaotic feature for EEG classification based seizure diagnosis

A new chaotic feature for EEG classification based seizure d...

引用

IEEE International Conference on Acoustics, Speech and Signal Processing

作者： Su Yang Anqin Zhang Jiulong Zhang Weishan Zhang Shanghai Key Laboratory of Intelligent Information Processing School of Computer Science Fudan University China School of Computer Science Xi'an University of Technology China Department of Software Engineering China University of Petroleum Qingdao China

ISBN: (纸本)9781509041183

Seeking effective measures to characterize the chaotic patterns of EEG signals for seizure diagnosis is a long-term endeavor in the literature. We propose to count the number of zero-crossing (ZC) points on Poincare surface as a feature when the time series of interest is embedded into the reconstructed state space. The experiments show that Poincare surface can act as a platform to observe the chaotic patterns of EEG signals and the ZC feature on Poincare surface is a promising pattern descriptor to discriminate different categories of EEG signals. When used alone for EEG classification, the ZC feature achieves 100%, 99.27%, and 94.68% accuracy in 2-class, 3-class, and 5-class classification on a widely used benchmark.

关键词： Nonlinear time series analysis feature extraction pattern recognition EEG signal classification Electroencephalography Feature extraction Pattern recognition time series analysis Seizures signal classification signals Phyla state space

来源：评论

学校读者我要写书评

暂无评论

ROSF: Leveraging Information Retrieval and Supervised Learning for Recommending Code Snippets

arXiv

引用

arXiv 2017年

作者： Jiang, He Nie, Liming Sun, Zeyi Ren, Zhilei Kong, Weiqiang Zhang, Tao Luo, Xiapu School of Software Dalian University of Technology Dalian China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian China State Key Laboratory of Software Engineering Wuhan University Wuhan China Key Laboratory for Ubiquitous Network Service Software of Liaoning Province Dalian China School of Computer Science & Technology Nanjing University of Posts and Telecommunications Nanjing China Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong

—when implementing unfamiliar programming tasks, developers commonly search code examples and learn usage patterns of APIs from the code examples or reuse them by copy-pasting and modifying. For providing high-quality code examples, previous studies present several methods to recommend code snippets mainly based on information retrieval. In this paper, to provide better recommendation results, we propose ROSF, Recommending cOde Snippets with multi-aspect Features, a novel method combining both information retrieval and supervised learning. In our method, we recommend Top-K code snippets for a given free-form query based on two stages, i.e., coarse-grained searching and fine-grained re-ranking. First, we generate a code snippet candidate set by searching a code snippet corpus using an information retrieval method. Second, we predict probability values of the code snippets for different relevance scores in the candidate set by the learned prediction model from a training set, re-rank these candidate code snippets according to the probability values, and recommend the final results to developers. We conduct several experiments to evaluate our method in a large-scale corpus containing 921,713 real-world code snippets. The results show that ROSF is an effective method for code snippets recommendation and outperforms the-state-of-the-art methods by 20% - 41% in Precision and 13% - 33% in NDCG. Copyright © 2017, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Automatic GUI Test by Using SIFT Matching

引用

China Communications 2016年第9期13卷 227-236页

作者： Xiaoxin Fang Bin Sheng Ping Li Dan Wu Enhua Wu Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China The State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China Department of Mathematics and Information Technology The Education University of Hong KongHong KongChina China Southern Power Grid GuangzhouChina Faculty of Science and Technology University of MacaoMacaoChina

In software development process, the last step is usually the Graphic User In- terface（GUI） test, which is part of the final user experience （UE） test. Traditionally, there exist some GUI test tools in the market, such as Abbot Java GUI Test Framework and Pounder, in which testers pre-configure in the script all desired actions and instructions for the computer, nonetheless requiring too much of invariance of GUI environment; and they require reconfiguration in case of GUI changes, therefore still to be done mostly manually and hard for non-programmer testers to. Consequently, we proposed GUI tests by image recognition to automate the last process; we managed to innovate upon current algorithms such as SIFT and Random Fern, from which we develop the new algorithm scheme retrieving most efficient feature and dispelling inefficient part of each algorithm. computers then apply the algorithm, to search for target patterns themselves and take subsequent actions such as manual mouse, keyboard and screen I/O automatically to test the GUI without any manual instructions. Test results showed that the proposed approach can accelerate GU! test largely compared to current benchmarks.

关键词： GUI test image recognition SIFT random fern.

来源：评论

学校读者我要写书评

暂无评论

A utility-driven scheduling algorithms in cloud computing

引用

Revista Tecnica de la Facultad de Ingenieria Universidad del Zulia 2016年第2期39卷 282-287页

作者： Chen, Tao School of Management Science and Engineering Anhui University of Finance and Economics Bengbu Anhui233030 China Department of Computer Science and Technology Tongji University Shanghai201804 China State Key Laboratoryfor Novel Software Technology Nanjing University China

Cloud computing is a successful business model and utility paradigm which enables people to use computing power via Internet at anytime anywhere. How to schedule a task to cloud computing is an important issue. In cloud computing some users focus execution time the others maybe expense on tasks execution, so how to satisfy the users and achieve the balance between execution time and expense is very vital. Based on classic Min-Min algorithm, an efficient task scheduling algorithm was proposed where Cobb-Douglas utility function was employed to express user.s preference to time and cost, and maximized user.s utility. Multi-objective optimal solution has been obtained via the utility function. Experimental results evaluating such a mechanism show that the algorithm validate vividly.

关键词： Distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：