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

Budget-Aware Dynamic Incentive Mechanism in SpatialCrowdsourcing

Journal of computer science & technology 2017年第5期32卷 890-904页

作者： Jia-Xu Liu Yu-Dian Ji Wei-Feng Lv Ke Xu State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China School of Software Liaoning Technical University Huludao 125105 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong China State Key Laboratory of Software Development Environment Beihang University Beijing 100191 China

The ubiquitous deployment of GPS-equipped devices and mobile networks has spurred the popularity of spatial crowdsourcing. Many spatial crowdsourcing tasks require crowd workers to collect data from different locations. Since workers tend to select locations nearby or align to their routines, data collected by workers are usually unevenly distributed across the region. To encourage workers to choose remote locations so as to avoid imbalanced data collection, we investigate the incentive mechanisms in spatial crowdsourcing. We propose a price adjustment function and two algorithms, namely DFBA (Dynamic Fixed Budget Allocation) and DABA (Dynamic Adjusted Budget Allocation), which utilize price leverage to mitigate the imbalanced data collection problem. Extensive evaluations on both synthetic and real-world datasets demonstrate that the proposed incentive mechanisms are able to effectively balance the popularity of different locations.

关键词： incentive mechanism crowdsensing spatial crowdsourcing

来源：评论

学校读者我要写书评

暂无评论

Stochastic primal-dual algorithms with faster convergence than O(1/√t) for problems without bilinear structure

arXiv

引用

arXiv 2019年

作者： Yan, Yan Xu, Yi Lin, Qihang Zhang, Lijun Yang, Tianbao Department of Computer Science University of Iowa Iowa CityIA52242 United States Department of Management Sciences University of Iowa Iowa CityIA52242 United States National Key Laboratory for Novel Software Technology Nanjing University Nanjing210023 China

Previous studies on stochastic primal-dual algorithms for solving min-max problems with faster convergence heavily rely on the bilinear structure of the problem, which restricts their applicability to a narrowed range of problems. The main contribution of this paper is the design and analysis of new stochastic primal-dual algorithms that use a mixture of stochastic gradient updates and a logarithmic number of deterministic dual updates for solving a family of convex-concave problems with no bilinear structure assumed. Faster convergence rates than O(1/√T) with T being the number of stochastic gradient updates are established under some mild conditions of involved functions on the primal and the dual variable. For example, for a family of problems that enjoy a weak strong convexity in terms of the primal variable and has a strongly concave function of the dual variable, the convergence rate of the proposed algorithm is O(1/T). We also investigate the effectiveness of the proposed algorithms for learning robust models and empirical AUC maximization. Copyright © 2019, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Design and Characterization of Hydroxyapatite Scaffolds Fabricated by Stereolithography for Bone Tissue Engineering Application

引用

Procedia CIRP 2020年 89卷 170-175页

作者： Zhen Wang Chuanzhen Huang Jun Wang Bin Zou Ch Asad Abbas Xiaodan Wang Centre for Advanced Jet Engineering Technology (CaJET) Key Laboratory of High-efficiency and Clean Mechanical Manufacture (Ministry of Education) School of Mechanical Engineering Shandong University Jinan 250061 P.R. China National Demonstration Centre for Experimental Mechanical Engineering Education (Shandong University) School of Mechanical Engineering Shandong University Jinan 250061 P.R. China School of Mechanical and Manufacturing Engineering The University of New South Wales (UNSW) Sydney NSW 2052 Australia Department of Computer Science and Software Engineering Xi’an Jiaotong-Liverpool University Suzhou 215123 China

In this study, a novel method to design hydroxyapatite scaffold based on gradient porosity was proposed. Additionally, after a tailor-made ceramic suspension was cured by stereolithography (SLA), a minimal pore with a diameter size of 500μm can be fabricated, and it has a high dimension precision up to about 60μm. The compression test showed that the scaffolds had an effective elastic modulus ranging from 2.4GPa to 5.9GPa, which could match with the cancellous bone well. Moreover, in-vitro experiments demonstrated that this hydroxyapatite bioceramic scaffold was compatible with bone marrow mesenchymal stem cells (BMSCs) and showed good effect on cell proliferation.

关键词： Bone Scaffold Bioceramic Stereolithography Gradient Porosity

来源：评论

学校读者我要写书评

暂无评论

MFPR: A Personalized Ranking Recommendation with Multiple Feedback

引用

ACM Transactions on Social Computing 2018年第2期1卷 1–22页

作者： Shi, Chuan Liu, Jian Zhang, Yiding Hu, Binbin Liu, Shenghua Yu, Philip S. Beijing Key Lab of Intelligent Telecommunication Software and Multimedia Beijing University of Posts and Telecommunications No. 10 Xi Tu Cheng Road Beijing China Cas Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences No.6 Kexueyuan South Road Zhongguancun Beijing China Department of Computer Science University of Illinois at Chicago 851 South Morgan Street Chicago United States

Recently, recommender systems have played an important role in improving web user experiences and increasing profits. Recommender systems exploit users' behavioral history (i.e., feedback on items) to build models. The feedback usually includes explicit feedback (e.g., ratings) and implicit feedback (e.g., browsing history, click logs), which are both useful for improving recommendations. However, as far as we are concerned, no existing works have integrated both explicit and multiple implicit feedback simultaneously. Therefore, we propose a unified and flexible model, named Multiple Feedback-based Personalized Ranking (MFPR), to make full use of multiple feedback, which uses a personalized ranking framework. To train model MFPR, we design an algorithm to generate ordered item pairs as labeled data, with consideration of both rating scores and multiple implicit feedback. Extensive experiments on two real-world datasets validate the effectiveness of the MFPR model. With the integration of multiple feedback, MFPR significantly improves recommendation performance. © 2018 ACM.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

Model Checking Quantum Systems-A Survey

arXiv

引用

arXiv 2018年

作者： Ying, Mingsheng Feng, Yuan Centre for Quantum Software and Information University of Technology Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Department of Computer Science and Technology Tsinghua University China

This article discusses the essential difficulties in developing model-checking techniques for quantum systems that are never present in model checking classical systems. It further reviews some early researches on checking quantum communication protocols as well as a new line of researches pursued by the authors and their collaborators on checking general quantum systems, applicable to both physical systems and quantum programs. Copyright © 2018, The Authors. All rights reserved.

关键词： Quantum optics

来源：评论

学校读者我要写书评

暂无评论

Preface

引用

Journal of computer science & technology 2020年第6期35卷 1231-1233页

作者： Xie, Tao Jin, Zhi Li, Xuan-Dong Huang, Gang Muller, Hausi A. Pang, Jun Zhang, Li-Jun Key Laboratory of High Confidence Software Technologies (Ministry of Education) Peking University Beijing China Department of Computer Science and Technology Nanjing University Nanjing China Department of Computer Science University of Victoria Victoria Canada Faculty of Science Technology and Medicine & Interdisciplinary Centre for Security Reliability and Trust University of Luxembourg Luxembourg Luxembourg Institute of Software Chinese Academy of Sciences Beijing China

As a continuation of the last five years’special section on software systems,this special section encourages and promotes research to address challenges from the perspective of software *** goal of this special section is to present state-of-the-art and high-quality original research in the area of software *** to the last year’s special section,this special section includes two different major themes:1)Internetware and Beyond;2)Dependable software Engineering.

关键词： systems. continuation section

来源：评论

学校读者我要写书评

暂无评论

Toward automatic verification of quantum programs

arXiv

引用

arXiv 2018年

作者： Ying, Mingsheng Centre for Quantum Software and Information University of Technology Sydney Australia State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Department of Computer Science and Technology Tsinghua University China

This paper summarises the results obtained by the author and his collaborators in a program logic approach to the verification of quantum programs, including quantum Hoare logic, invariant generation and termination analysis for quantum programs. It also introduces the notion of proof outline and several auxiliary rules for more conveniently reasoning about quantum programs. Some problems for future research are proposed at the end of the paper. Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Replacement Strategy for MOEA/D 13th

A Hybrid Replacement Strategy for MOEA/D

引用

13th International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2018

作者： Chen, Xiaoji Shi, Chuan Zhou, Aimin Xu, Siyong Wu, Bin Beijing Key Lab of Intelligent Telecommunications Software and Multimedia Beijing University of Posts and Telecommunications Beijing100876 China Shanghai Key Laboratory of Multidimensional Information Processing Department of Computer Science and Technology East China Normal University Shanghai200062 China

ISBN: (纸本)9789811328251

In MOEA/D, the replacement strategy plays a key role in balancing diversity and convergence. However, existing adaptive replacement strategies either focus on neighborhood or global replacement strategy, which may have no obvious effects on balance of diversity and convergence in tackling complicated MOPs. In order to overcome this shortcoming, we propose a hybrid mechanism balancing neighborhood and global replacement strategy. In this mechanism, a probability threshold is applied to determine whether to execute a neighborhood or global replacement strategy, which could balance diversity and convergence. Furthermore, we design an offspring generation method to generate the high-quality solution for each subproblem, which can ease mismatch between subproblems and solutions. Based on the classic MOEA/D, we design a new algorithm framework, called MOEA/D-HRS. Compared with other state-of-the-art MOEAs, experimental results show that the proposed algorithm obtains the best performance. © 2018, Springer Nature Singapore Pte Ltd.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

A Comparison of CPU and GPU Implementations for the LHCb Experiment Run 3 Trigger

引用

Computing and software for Big science 2022年第1期6卷 1-20页

作者： Aaij, R. Adinolfi, M. Aiola, S. Akar, S. Albrecht, J. Alexander, M. Amato, S. Amhis, Y. Archilli, F. Bala, M. Bassi, G. Bian, L. Blago, M.P. Boettcher, T. Boldyrev, A. Borghi, S. Rodriguez, A. Brea Calefice, L. Gomez, M. Calvo Pérez, D. H. Cámpora Cardini, A. Cattaneo, M. Chobanova, V. Ciezarek, G. Vidal, X. Cid Cobbledick, J.L. Coelho, J.A.B. Colombo, T. Contu, A. Couturier, B. Craik, D.C. Currie, R. d’Argent, P. De Cian, M. Derkach, D. Dordei, F. Dorigo, M. Dufour, L. Durante, P. Dziurda, A. Dzyuba, A. Easo, S. Esen, S. Declara, P. Fernandez Filippov, S. Fitzpatrick, C. Frank, M. Gandini, P. Gligorov, V.V. Golobardes, E. Graziani, G. Grillo, L. Günther, P.A. Hansmann-Menzemer, S. Hennequin, A.M. Henry, L. Hill, D. Hollitt, S.E. Hu, J. Hulsbergen, W. Hunter, R.J. Hushchyn, M. Jashal, B.K. Jones, C.R. Klaver, S. Klimaszewski, K. Kopecna, R. Krzemien, W. Kucharczyk, M. Lane, R. Lazzari, F. Gac, R. Le Li, P. Lopes, J.H. Martinez, M. Lucio Lupato, A. Lupton, O. Lyu, X. Machefert, F. Madejczyk, O. Malde, S. Marchand, J.F. Mariani, S. Benito, C. Marin Santos, D. Martinez Vidal, F. Martinez Matev, R. Mazurek, M. Mitreska, B. Mitzel, D.S. Morello, M.J. Mu, H. Muzzetto, P. Naik, P. Needham, M. Neri, N. Neufeld, N. Nolte, N.S. O’Hanlon, D. Oyanguren, A. Altarelli, M. Pepe Petrucci, S. Petruzzo, M. Pica, L. Pisani, F. Piucci, A. Polci, F. Poluektov, A. Polycarpo, E. Prouve, C. Punzi, G. Quagliani, R. Trejo, R. I. Rabadan Pernas, M. Ramos Rangel, M.S. Ratnikov, F. Raven, G. Reiss, F. Renaudin, V. Robbe, P. Ryzhikov, A. Santimaria, M. Saur, M. Schiller, M. Schwemmer, R. Sciascia, B. Solomin, A. Suljik, F. Skidmore, N. Sokoloff, M.D. Spradlin, P. Stahl, M. Stahl, S. Stevens, H. Sun, L. Szabelski, A. Szumlak, T. Szymanski, M. Tou, D.Y. Tuci, G. Usachov, A. Canudas, N. Valls Gomez, R. Vazquez Vecchi, S. Vesterinen, M. Vilasis-Cardona, X. Bruch, D. Vom Wang, Z. Wojton, T. Whitehead, M. Williams, M. Witek, M. Xie, Y. Xu, A. Yin, H. Zdybal, M. Zenaiev, O. Zhang, D. Zhang, L. Zhu, X. Universidade Federal do Rio de Janeiro (UFRJ) Rio de Janeiro Brazil Center for High Energy Physics Tsinghua University Beijing China School of Physics State Key Laboratory of Nuclear Physics and Technology Peking University Beijing China University of Chinese Academy of Sciences Beijing China Institute of Particle Physics Central China Normal University Hubei Wuhan China Univ. Grenoble Alpes Univ. Savoie Mont Blanc CNRS IN2P3-LAPP Annecy France Aix Marseille Univ CNRS/IN2P3 CPPM Marseille France Université Paris-Saclay CNRS/IN2P3 IJCLab Orsay France LPNHE Sorbonne Université Paris Diderot Sorbonne Paris Cité CNRS/IN2P3 Paris France Fakultät Physik Technische Universität Dortmund Dortmund Germany Physikalisches Institut Ruprecht-Karls-Universität Heidelberg Heidelberg Germany INFN Sezione di Ferrara Ferrara Italy INFN Sezione di Firenze Florence Italy INFN Laboratori Nazionali di Frascati Frascati Italy INFN Sezione di Milano Milan Italy INFN Sezione di Cagliari Monserrato Italy INFN Sezione di Pisa Pisa Italy Nikhef National Institute for Subatomic Physics Amsterdam Netherlands Nikhef National Institute for Subatomic Physics and VU University Amsterdam Amsterdam Netherlands Faculty of Physics and Applied Computer Science AGH University of Science and Technology Kraków Poland Henryk Niewodniczanski Institute of Nuclear Physics Polish Academy of Sciences Kraków Poland National Center for Nuclear Research (NCBJ) Warsaw Poland Petersburg Nuclear Physics Institute NRC Kurchatov Institute (PNPI NRC KI) Gatchina Russian Federation Institute for Nuclear Research of the Russian Academy of Sciences (INR RAS) Moscow Russian Federation ICCUB Universitat de Barcelona Barcelona Spain Instituto Galego de Física de Altas Enerxías (IGFAE) Universidade de Santiago de Compostela Santiago Spain Instituto de Fisica Corpuscular Centro Mixto Universidad de Valencia CSIC Valencia Spain European Organization for Nuclear Research (CERN) Geneva Switzerland Instit

The Large Hadron Collider beauty (LHCb) experiment at CERN is undergoing an upgrade in preparation for the Run 3 data collection period at the Large Hadron Collider (LHC). As part of this upgrade, the trigger is moving to a full software implementation operating at the LHC bunch crossing rate. We present an evaluation of a CPU-based and a GPU-based implementation of the first stage of the high-level trigger. After a detailed comparison, both options are found to be viable. This document summarizes the performance and implementation details of these options, the outcome of which has led to the choice of the GPU-based implementation as the baseline. © 2021, The Author(s).

关键词： Heterogeneous High-level trigger High-throughput Parallel computing Real-time software

来源：评论

学校读者我要写书评

暂无评论

MobiCrowd: Mobile Crowdsourcing on Location-based Social Networks

MobiCrowd: Mobile Crowdsourcing on Location-based Social Net...

引用

IEEE Annual Joint Conference: INFOCOM, IEEE computer and Communications Societies

作者： Yulong Tian Wei Wei Qun Li Fengyuan Xu Sheng Zhong State Key Laboratory for Novel Software Technology Nanjing University China Department of Computer Science College of William and Mary USA

ISBN: (纸本)9781538641293

The great potential of mobile crowdsourcing has started to attract attention of both industries and the research community. However, current commercial mobile crowdsourcing marketplaces are unsatisfactory because of the limited worker base and functionality. In this paper, we first revisit the foundation of performing mobile crowdsourcing on location-based social networks (LBSNs) through specially designed survey studies and comparison experiments involving hundreds of users. Our results reveal that active check-ins are good indicators of picking a right user to perform tasks, and LBSN could be an ideal platform for mobile crowdsourcing given proper services provided. We then propose both the centralized and decentralized design of MobiCrowd, a mobile crowdsourcing service built on LBSNs. Our evaluation, through trace-driven simulation and real-world experiments, demonstrates that the proposed schemes can effectively find workers for mobile crowdsourcing tasks associated with different venues by analyzing their location check-in histories.

关键词： Task analysis Crowdsourcing Facebook Conferences Sensors History

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：