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

arXiv 2021年

作者： Zhao, Yingying Dong, Mingzhi Wang, Yujiang Feng, Da Lv, Qin Dick, Robert P. Li, Dongsheng Lu, Tun Gu, Ning Shang, Li School of Computer Science Fudan University Shanghai China Shanghai Key Laboratory of Data Science Fudan University Shanghai China Shanghai Institute of Intelligent Electronics & Systems Shanghai China Department of Computing Imperial College London London United Kingdom Software Service Company Limited Beijing China University of Colorado Boulder BoulderCO United States Department of Electrical Engineering and Computer Science College of Engineering University of Michigan Ann ArborMI United States Microsoft Research Asia Shanghai China School of Computer Science Fudan University Shanghai China

Deep-learning-based video processing has yielded transformative results in recent years. However, the video analytics pipeline is energy-intensive due to high data rates and reliance on complex inference algorithms, which limits its adoption in energy-constrained applications. Motivated by the observation of high and variable spatial redundancy and temporal dynamics in video data streams, we design and evaluate an adaptive-resolution optimization framework to minimize the energy use of multitask video analytics pipelines. Instead of heuristically tuning the input data resolution of individual tasks, our framework utilizes deep reinforcement learning to dynamically govern the input resolution and computation of the entire video analytics pipeline. By monitoring the impact of varying resolution on the quality of high-dimensional video analytics features, hence the accuracy of video analytics results, the proposed end-to-end optimization framework learns the best non-myopic policy for dynamically controlling the resolution of input video streams to globally optimize energy efficiency. Governed by reinforcement learning, optical flow is incorporated into the framework to minimize unnecessary spatio-temporal redundancy that leads to re-computation, while preserving accuracy. The proposed framework is applied to video instance segmentation which is one of the most challenging computer vision tasks, and achieves better energy efficiency than all baseline methods of similar accuracy on the YouTube-VIS dataset. Copyright © 2021, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Not all fabrics are created equal: Exploring eFPGA parameters for IP redaction

arXiv

引用

arXiv 2021年

作者： Bhandari, Jitendra Khader Thalakkattu Moosa, Abdul Tan, Benjamin Pilato, Christian Gore, Ganesh Tang, Xifan Temple, Scott Gaillardon, Pierre-Emmanuel Karri, Ramesh Center for Cybersecurity New York University New York CityNY11201 United States Department of Electrical and Software Engineering University of Calgary CalgaryABT2N 1N4 Canada Dipartimento di Elettronica Informazione e Bioingegneria Politecnico di Milano Milano20133 Italy Laboratory for NanoIntegrated Systems Electrical and Computer Engineering Department University of Utah Salt Lake CityUT84112 United States

Semiconductor design houses rely on third-party foundries to manufacture their integrated circuits (IC). While this trend allows them to tackle fabrication costs, it introduces security concerns as external (and potentially malicious) parties can access critical parts of the designs and steal or modify the Intellectual Property (IP). Embedded FPGA (eFPGA) redaction is a promising technique to protect critical IPs of an ASIC by redacting (i.e., removing) critical parts and mapping them onto a custom reconfigurable fabric. Only trusted parties will receive the correct bitstream to restore the redacted functionality. While previous studies imply that using an eFPGA is a sufficient condition to provide security against IP threats like reverse-engineering, whether this truly holds for all eFPGA architectures is unclear, thus motivating the study in this paper. We examine the security of eFPGA fabrics generated by varying different FPGA design parameters. We characterize the power, performance, and area (PPA) characteristics and evaluate each fabric’s resistance to SAT-based bitstream recovery. Our results encourage designers to work with custom eFPGA fabrics rather than off-the-shelf commercial FPGAs and reveals that only considering a redaction fabric’s bitstream size is inadequate for gauging security. Copyright © 2021, The Authors. All rights reserved.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Context-aware In-process Crowdworker Recommendation

Context-aware In-process Crowdworker Recommendation

引用

International Conference on software engineering (ICSE)

作者： Junjie Wang Ye Yang Song Wang Yuanzhe Hu Dandan Wang Qing Wang Laboratory for Internet Software Technologies Institute of Software Chinese Academy of Sciences Beijing China State Key Laboratory of Computer Sciences Institute of Software Chinese Academy of Sciences Beijing China University of Chinese Academy of Sciences Beijing China School of Systems and Enterprises Stevens Institute of Technology USA Lassonde School of Engineering York University Canada

ISBN: (数字)9781450371216

ISBN: (纸本)9781728165196

Identifying and optimizing open participation is essential to the success of open software development. Existing studies highlighted the importance of worker recommendation for crowdtesting tasks in order to detect more bugs with fewer workers. However, these studies mainly focus on one-time recommendations with respect to the initial context at the beginning of a new task. This paper argues the need for in-process crowdtesting worker recommendation. We motivate this study through a pilot study, revealing the prevalence of long-sized non-yielding windows, i.e., no new bugs are revealed in consecutive test reports during the process of a crowdtesting task. This indicates the potential opportunity for accelerating crowdtesting by recommending appropriate workers in a dynamic manner, so that the non-yielding windows could be shortened. To that end, this paper proposes a context-aware in-process crowdworker recommendation approach, iRec, to detect more bugs earlier and potentially shorten the non-yielding windows. It consists of three main components: 1) the modeling of dynamic testing context, 2) the learning-based ranking component, and 3) the diversity-based re-ranking component. The evaluation is conducted on 636 crowdtesting tasks from one of the largest crowdtesting platforms, and results show the potential of iRec in improving the cost-effectiveness of crowdtesting by saving the cost and shortening the testing process.

关键词： Bridges computer bugs software Task analysis Testing Context modeling software engineering

来源：评论

学校读者我要写书评

暂无评论

A Model to Measure the Spread Power of Rumors

arXiv

引用

arXiv 2020年

作者： Jahanbakhsh-Nagadeh, Zoleikha Feizi-Derakhshi, Mohammad-Reza Ramezani, Majid Akan, Taymaz Asgari-Chenaghlu, Meysam Nikzad–Khasmakhi, Narjes Feizi-Derakhshi, Ali-Reza Ranjbar-Khadivi, Mehrdad Zafarani-Moattar, Elnaz Balafar, Mohammad-Ali Computerized Intelligence Systems Laboratory Department of Computer Engineering University of Tabriz Tabriz Iran Department of Computer Engineering Naghadeh Branch Islamic Azad University Naghadeh Iran Department of Computer Science and Research Branch Islamic Azad University Tehran Iran Department of Software Engineering Istanbul Topkapi University Istanbul Turkey Clinical Informatics Louisiana State University Health Sciences Center Shreveport Shreveport United States Department of Computer Engineering Shabestar Branch Islamic Azad University Shabestar Iran Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Department of Computer Engineering University of Tabriz Iran

With technologies that have democratized the production and reproduction of information, a significant portion of daily interacted posts in social media has been infected by rumors. Despite the extensive research on rumor detection and verification, so far, the problem of calculating the spread power of rumors has not been considered. To address this research gap, the present study seeks a model to calculate the Spread Power of Rumor (SPR) as the function of content-based features in two categories: False Rumor (FR) and True Rumor (TR). For this purpose, the theory of Allport and Postman will be adopted, which it claims that importance and ambiguity are the key variables in rumor-mongering and the power of rumor. Totally 42 content features in two categories"importance" (28 features) and"ambiguity" (14 features) are introduced to compute SPR. The proposed model is evaluated on two datasets, Twitter and Telegram. The results showed that (i) the spread power of False Rumor documents is rarely more than True Rumors. (ii) there is a significant difference between the SPR means of two groups False Rumor and True Rumor. (iii) SPR as a criterion can have a positive impact on distinguishing False Rumors and True Rumors. © 2020, CC BY.

关键词： Cell proliferation

来源：评论

学校读者我要写书评

暂无评论

A Multilevel Intelligent Assistant for Multilevel Social Network Analysis

A Multilevel Intelligent Assistant for Multilevel Social Net...

引用

International IEEE Conference on Intelligent systems, IS

作者： Man Tianxing Nataly Zhukova Georgi Tsochev ITMO University St. Petersburg Russia Laboratory of Computer-Information Systems and Software Engineering St. Petersburg Institute for Informatics and Automation of the Russian Academy of Sciences St. Petersburg Russia Laboratory of Telematics Bulgarian Academy of Sciences Sofia Bulgaria

ISBN: (数字)9781728154565

ISBN: (纸本)9781728154572

In recent years, social network data analysis is an emerging field. Multilevel social network analysis could help researchers to figure out comprehensive influencing factors. But the raw data extracted from life is complicated and inoperable so that the entire analysis process is multi-step and changeable. The characteristics of social network datasets at different levels are diverse. There is no general data analysis algorithms for each level. The characteristics of the data and the requirements of the task are important basis for choosing suitable analysis methods. But it is hard for non-expert researchers. This paper proposes an intelligent multilevel assistant for multilevel social network analysis and implements it based on ontology technology. Algorithms at different levels process the corresponding data forms until the appropriate output model is generated. The use of ontology technology makes this framework extensible and understandable. Such a framework is significant for non-experts.

关键词： Social network services Ontologies Machine learning algorithms Data mining Data analysis Task analysis

来源：评论

学校读者我要写书评

暂无评论

Hyperspectral Image Classification-Traditional to Deep Models: A Survey for Future Prospects

arXiv

引用

arXiv 2021年

作者： Ahmad, Muhammad Shabbir, Sidrah Roy, Swalpa Kumar Hong, Danfeng Wu, Xin Yao, Jing Khan, Adil Mehmood Mazzara, Manuel Distefano, Salvatore Chanussot, Jocelyn Department of Computer Science National University of Computer and Emerging Sciences Islamabad Chiniot-Faisalabad Campus Chiniot35400 Pakistan Dipartimento di Matematica e Informatica-MIFT University of Messina Messina98121 Italy Pakistan The Department of Computer Science and Engineering Jalpaiguri Government Engineering College West Bengal 735102 India The Key Laboratory of Digital Earth Science Aerospace Information Research Institute Chinese Academy of Sciences Beijing100094 China The School of Information and Electronics Beijing Institute of Technology Beijing100081 China Beijing Key Laboratory of Fractional Signals and Systems Beijing100081 China The Institute of Data Science and Artificial Intelligence Innopolis University Innopolis 420500 Russia Institute of Software Development and Engineering Innopolis University Innopolis420500 Russia The Univ. Grenoble Alpes CNRS Grenoble INP GIPSA-Lab Grenoble38000 France

Hyperspectral Imaging (HSI) has been extensively utilized in many real-life applications because it benefits from the detailed spectral information contained in each pixel. Notably, the complex characteristics i.e., the nonlinear relation among the captured spectral information and the corresponding object of HSI data make accurate classification challenging for traditional methods. In the last few years, Deep Learning (DL) has been substantiated as a powerful feature extractor that effectively addresses the nonlinear problems that appeared in a number of computer vision tasks. This prompts the deployment of DL for HSI classification (HSIC) which revealed good performance. This survey enlists a systematic overview of DL for HSIC and compared state-of-the-art strategies of the said topic. Primarily, we will encapsulate the main challenges of traditional machine learning for HSIC and then we will acquaint the superiority of DL to address these problems. This survey breakdown the state-of-the-art DL frameworks into spectral-features, spatial-features, and together spatial-spectral features to systematically analyze the achievements (future research directions as well) of these frameworks for HSIC. Moreover, we will consider the fact that DL requires a large number of labeled training examples whereas acquiring such a number for HSIC is challenging in terms of time and cost. Therefore, this survey discusses some strategies to improve the generalization performance of DL strategies which can provide some future guidelines. © 2021, CC BY.

关键词： Surveys

来源：评论

学校读者我要写书评

暂无评论

Secure and Privacy-Preserving Automated Machine Learning Operations into End-to-End Integrated IoT-Edge-Artificial Intelligence-Blockchain Monitoring System for Diabetes Mellitus Prediction

arXiv

引用

arXiv 2022年

作者： Hennebelle, Alain Ismail, Leila Materwala, Huned Kaabi, Juma Al Ranjan, Priya Janardhanan, Rajiv School of Computing and Information Systems The University of Melbourne Australia Research Laboratory Department of Computer Science and Software Engineering College of Information Technology United Arab Emirates University United Arab Emirates National Water and Energy Center United Arab Emirates University United Arab Emirates College of Health Sciences Department of Internal Medicine United Arab Emirates University United Arab Emirates Mediclinic Al Ain Abu Dhabi United Arab Emirates Bhubaneswar Institute of Technology India Faculty of Medical & Health Sciences SRM Institute of Science & Technology India

Diabetes Mellitus, one of the leading causes of death worldwide, has no cure to date and can lead to severe health complications, such as retinopathy, limb amputation, cardiovascular diseases, and neuronal disease, if left untreated. Consequently, it becomes crucial to take precautionary measures to avoid/predict the occurrence of diabetes. Machine learning approaches have been proposed and evaluated in the literature for diabetes prediction. This paper proposes an IoT-edge-Artificial Intelligence (AI)-blockchain system for diabetes prediction based on risk factors. The proposed system is underpinned by the blockchain to obtain a cohesive view of the risk factors data from patients across different hospitals and to ensure security and privacy of the user’s data. Furthermore, we provide a comparative analysis of different medical sensors, devices, and methods to measure and collect the risk factors values in the system. Numerical experiments and comparative analysis were carried out between our proposed system, using the most accurate random forest (RF) model, and the two most used state-of-the-art machine learning approaches, Logistic Regression (LR) and Support Vector Machine (SVM), using three real-life diabetes datasets. The results show that the proposed system using RF predicts diabetes with 4.57% more accuracy on average compared to LR and SVM, with 2.87 times more execution time. Data balancing without feature selection does not show significant improvement. The performance is improved by 1.14% and 0.02% after feature selection for PIMA Indian and Sylhet datasets respectively, while it reduces by 0.89% for MIMIC III. © 2022, CC BY.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

Harmonia: A high throughput B+tree for GPUs 19

Harmonia: A high throughput B+tree for GPUs

引用

24th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP 2019

作者： Yan, Zhaofeng Lin, Yuzhe Peng, Lu Zhang, Weihua Software School Fudan University China Shanghai Key Laboratory of Data Science Fudan University China Shanghai Institute of Intelligent Electronics and Systems Shanghai China Division of Electrical and Computer Engineering Louisiana State University United States

ISBN: (纸本)9781450362252

B+tree is one of the most important data structures and has been widely used in different fields. With the increase of concurrent queries and data-scale in storage, designing an eficient B+tree structure has become critical. Due to abundant computation resources, GPUs provide potential opportunities to achieve high query throughput for B+tree. However, prior methods cannot achieve satisfactory performance results due to low resource utilization and poor memory performance. In this paper, we first identify the gaps between B+tree and GPUs. Concurrent B+tree queries involve many global memory accesses and different divergences, which mismatch with GPU features. Based on this observation, we propose Harmonia, a novel B+tree structure to bridge the gap. In Harmonia, a B+tree structure is divided into a key region and a child region. The key region stores the nodes with its keys in a breadth-first order. The child region is organized as a prefix-sum array, which only stores each node's first child index in the key region. Since the prefix-sum child region is small and the children's index can be retrieved through index computations, most of it can be stored in on-chip caches, which can achieve good cache locality. To make it more eficient, Harmonia also includes two optimizations: partially-sorted aggregation and narrowed thread-group traversal, which can mitigate memory and warp divergence and improve resource utilization. Evaluations on a TITAN V GPU show that Harmonia can achieve up to 3.6 billion queries per second, which is about 3.4X faster than that of HB+Tree [39], a recent state-of-the-art GPU solution. © 2019 Association for Computing Machinery.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Parallel computing for large-scale author name disambiguation in medline 21

Parallel computing for large-scale author name disambiguatio...

引用

21st IEEE International Conference on High Performance Computing and Communications, 17th IEEE International Conference on Smart City and 5th IEEE International Conference on Data Science and systems, HPCC/SmartCity/DSS 2019

作者： Tang, Anyao Wu, Chengkun Liu, Jie Wang, Wei Yang, Xi Xing, Yuting Science and Technology on Parallel and Distributed Processing Laboratory Laboratory of Software Engineering for Complex Systems National University of Defense Technology Changsha410073 China State Key Laboratory of High Performance Computing College of Computer National University of Defense Technology Changsha410073 China College of Computer National University of Defense Technology Changsha 410073 China

ISBN: (纸本)9781728120584

Author name disambiguation (AND) is an important task in the field of scientific data mining. It has become a great challenge with the rapid growth of academic digital libraries. The task of AND for a large number of authors is computationally intensive. In particular, an author's name in MEDLINE is represented by full last name and initials, like 'Zhang S', which leads to a lot of identical strings that actually represent different names. In this paper, we proposed an efficient algorithm for parallel AND computation. The proposed algorithm mainly addresses the load balancing issue across many computing nodes. It involves the following strategies:(1) Author-based load balancing, which splits the computation load for each core by author name labels. (2) Matrix-based strategy, which calculates the pairwise similarity between publications and saves them in a matrix globally shared by all processes. Then group them by width-first search. We combine the above two strategies, the second of which is used to calculate authors with a large number of documents, and the other authors apply the first. We constructed a publications database written by Chinese authors from MEDLINE, the biggest public database for biomedical literature (abstracts). For benchmark testing, we experimented our algorithm with a dataset of 1 million publications on the Tianhe-2A supercomputer. Firstly, we trained an AND classifier that can achieve 98.1% of F1. The serial computation time is estimated to be approximately 246 hours, while the parallel execution time is approximately 66 hours in the case of four cores on a single node (with a speedup of 3.7x). Finally, we reduced the total parallel computing time of 1 million documents to about 2 hours and achieved 65.8% of parallelism efficiency using 200 cores on 90 nodes. © 2019 IEEE.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Knowledge-routed visual question reasoning: Challenges for deep representation embedding

arXiv

引用

arXiv 2020年

作者： Cao, Qingxing Li, Bailin Liang, Xiaodan Wang, Keze Lin, Liang School of Intelligent Systems Engineering Sun Yat-sen University China DarkMatter AI Research China Department of statistics University of California Los AngelesCA90095 United States School of Computer Science and Engineering Sun Yat-sen University Key Laboratory of Machine Intelligence and Advanced Computing Ministry of Education Engineering Research Center for Advanced Computing Engineering Software of Ministry of Education China

Though beneficial for encouraging the Visual Question Answering (VQA) models to discover the underlying knowledge by exploiting the input-output correlation beyond image and text contexts, the existing knowledge VQA datasets are mostly annotated in a crowdsource way, e.g., collecting questions and external reasons from different users via the internet. In addition to the challenge of knowledge reasoning, how to deal with the annotator bias also remains unsolved, which often leads to superficial over-fitted correlations between questions and answers. To address this issue, we propose a novel dataset named Knowledge-Routed Visual Question Reasoning for VQA model evaluation. Considering that a desirable VQA model should correctly perceive the image context, understand the question, and incorporate its learned knowledge, our proposed dataset aims to cutoff the shortcut learning exploited by the current deep embedding models and push the research boundary of the knowledge-based visual question reasoning. Specifically, we generate the question-answer pair based on both the Visual Genome scene graph and an external knowledge base with controlled programs to disentangle the knowledge from other biases. The programs can select one or two triplets from the scene graph or knowledge base to push multi-step reasoning, avoid answer ambiguity, and balanced the answer distribution. In contrast to the existing VQA datasets, we further imply the following two major constraints on the programs to incorporate knowledge reasoning: i) multiple knowledge triplets can be related to the question, but only one knowledge relates to the image object. This can enforce the VQA model to correctly perceive the image instead of guessing the knowledge based on the given question solely;ii) all questions are based on different knowledge, but the candidate answers are the same for both the training and test sets. We make the testing knowledge unused during training to evaluate whether a model can unde

关键词： Knowledge based systems

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：