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

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

作者： Enfang, Zhong Li, Peng Zhang, Tao Huang, Weiyi Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

Mobile data offloading is a cost-effective and promising approach to alleviate the burden of the cellular network. In this paper, we focus on designing a truthful incentive mechanism that the auction cloud platform motivates mobile users with deadline constraints and capacity constraints to offload data. First, we formulate the mobile data offloading problem as a reverse auction. Then, we reduce this social welfare maximization reverse auction for data offloading as an integer linear programming (ILP) problem. To solve this problem, we propose a data offloading auction greedy algorithm to choose the most cost-effective bids. We decompose the data offload auction greedy algorithm into the winner determination problem (WDP) and the threshold payment scheme. Moreover, we propose a delay winner winning algorithm based on the data offloading auction greedy algorithm. Extensive simulation experiments demonstrate that the data offloading auction mechanism dramatically reduces the burden of the cellular network while meeting the offloading tasks deadline constraints and mobile user capacity constraints. © 2019 IEEE.

关键词： Cost effectiveness

来源：评论

学校读者我要写书评

暂无评论

Budget constraint roadside units placement for traffic flows monitoring system with reliability in vehicular networks 21

Budget constraint roadside units placement for traffic flows...

引用

作者： Jiang, Peng Li, Peng Zhang, Tao Huang, Weiyi He, Heng Nie, Lei Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

In Traffic Flows Monitoring System (TFMS), the key problem is how to install Roadside Units (RSUs) reliably to monitor traffic flows with the constrained budget. The reliability of Traffic Flows Monitoring System(TFMS) is determined by the number of RSUs each traffic flow pass through, and the RSUs placement number is determined by the budget and the placement strategy. In this paper, we investigate the budget constraint RSUs placement problem for traffic flows monitoring system with reliability in vehicular networks. Given a budget constraint, the problem is how to install RSUs to ensure the reliability of TFMS, that is each traffic flow pass through RSUs as many as possible with the limited budget. We prove that this problem is NP-hard. Then, we propose two greedy algorithms to solve the problem according to the pigeonhole principle. Moreover, approximation ratios of proposed algorithms are given. Finally, we verify the feasibility of proposed algorithms through extensive experiments, and the results show that the proposed algorithms are superior to the other algorithms. © 2019 IEEE.

关键词： Reliability

来源：评论

学校读者我要写书评

暂无评论

Minimum cost task assignment for vehicle-based crowdsensing with deterministic and nondeterministic trajectory 21

Minimum cost task assignment for vehicle-based crowdsensing ...

引用

作者： Tu, Meimei Li, Peng Zhang, Tao Zhou, Qiang Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

Vehicle-based crowdsensing (VCS) is a special case in crowdsourcing, and task assignment is a basic and important problem. In this paper, we investigate the minimum cost task assignment (MCTA) problem for vehicle-based crowdsensing. The VCS platform hopes to recruit some vehicles to complete given spatial-temporal tasks with the minimum cost. As vehicle trajectories are dynamic, we divide the MCTA problem into two sub-problems, the deterministic trajectory (D-MCTA) problem, and nondeterministic trajectory (N-MCTA) problem. For D-MCTA problem, we prove that the D-MCTA problem is NP-hard, and we propose a greedy algorithm to solve this problem. For N-MCTA problem, firstly, we determine the probability of each vehicle's trajectory through the logistic regression method. Then, we exploit the semi-Markov method to calculate the probability of each vehicle executing the task. Moreover, a greedy algorithm is proposed and the theoretical analysis is given. Finally, extensive simulations have been conducted to show the performance of our proposed algorithms is superior to the other algorithms. © 2019 IEEE.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

A budget constraint incentive mechanism in spatial-temporal mobile crowdsensing 21

A budget constraint incentive mechanism in spatial-temporal ...

引用

作者： Kong, Xujiao Li, Peng Zhang, Tao Tu, Meimei Liu, Qin College of Computer Science and Technology Wuhan University of Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System China Department of Computer Science New York Institute of Technology United States School of Cyber Science and Engineering Wuhan University China

ISBN: (纸本)9781728120584

Mobile crowdsensing is an effective way to collect sensing data about regions of interest. Effective incentive mechanisms are invaluable in mobile crowd sensing, for recruiting a number of mobile users to fulfill coverage requirement in the interested regions. In this paper, we exploit the potential of mobile users by designing a spatial-temporal crowd sensing incentive mechanism for smartphone users. We first use the logistic regression technique to mine user preferences from the user's historical data. Then, we propose a sub-module approximation algorithm to solve the participant recruitment problem, which is proved to be an NP-hard problem. Moreover, we design the winner auction algorithm (WAA) based on the reverse auction mechanism to solve the critical payment allocation problem. Finally, we demonstrate that our mechanism achieves truthfulness, individual rationality, and high computation efficiency through both theoretical analysis and experimental simulation. © 2019 IEEE.

关键词： Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

A Four-Bank Memory Design of Optimized Semi-Parallel Polar Decoder 9

A Four-Bank Memory Design of Optimized Semi-Parallel Polar D...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Shiwen Xing Yun-Nan Chang Liang Chen Beijing Key Laboratory of Embedded Real-time Information Processing Technology Beijing Institute of Technology Department of Computer Science and Engineering Sun Yat-sen University

ISBN: (纸本)9781509038237;9781509038220

Polar code, which is capable of achieving channel capacity, is known as a promising forward error correction（FEC） code in coding theory. In this paper, a four-bank memory architecture is proposed for polar decoder to store the initial and the intermediate processing data. Based on the proposed load-balance data allocation scheme, each memory bank is able to be equipped with only two access ports, while providing enough data bandwidth demand. Besides, the proposed semi-parallel successive cancellation（SC） polar decoder is optimized by employing the efficient p node and the merged computation of f and g nodes to reduce the decoding latency, which can at most get 62.5% speed improvement with enough processing elements（PEs）. In addition, the proposed four-bank memory design can reduce the overall size of memory especially with higher level of parallelism.

关键词： ploar code successive cancellation decoding fourbank memory design optimized semi-parallel design

来源：评论

学校读者我要写书评

暂无评论

Dense dilated network with probability regularized walk for vessel detection

arXiv

引用

arXiv 2019年

作者： Mou, Lei Chen, Li Cheng, Jun Gu, Zaiwang Zhao, Yitian Liu, Jiang School of Computer Science and Technology Wuhan University of Science and Technology Wuhan430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial System Wuhan University of Science and Technology Wuhan430081 China Cixi Institute of Biomedical Engineering Chinese Academy of Sciences Zhejiang315201 China UBTech Research UBTech Robotics Corp Ltd Guangdong518055 China Department of Computer Science and Engineering Southern University of Science and Technology Guangdong518055 China Cixi Institute of Biomedical Engineering Ningbo Institute of Industrial Technology Chinese Academy of Sciences Zhejiang315201 China

The detection of retinal vessel is of great importance in the diagnosis and treatment of many ocular diseases. Many methods have been proposed for vessel detection. However, most of the algorithms neglect the connectivity of the vessels, which plays an important role in the diagnosis. In this paper, we propose a novel method for retinal vessel detection. The proposed method includes a dense dilated network to get an initial detection of the vessels and a probability regularized walk algorithm to address the fracture issue in the initial detection. The dense dilated network integrates newly proposed dense dilated feature extraction blocks into an encoder-decoder structure to extract and accumulate features at different scales. A multi-scale Dice loss function is adopted to train the network. To improve the connectivity of the segmented vessels, we also introduce a probability regularized walk algorithm to connect the broken vessels. The proposed method has been applied on three public data sets: DRIVE, STARE and CHASE_DB1. The results show that the proposed method outperforms the state-of-the-art methods in accuracy, sensitivity, specificity and also area under receiver operating characteristic curve. Copyright © 2019, The Authors. All rights reserved.

关键词： Diagnosis

来源：评论

学校读者我要写书评

暂无评论

Stadam:A New SLA Trust Model Based on Anomaly Detection and Multi-cloud

Stadam:A New SLA Trust Model Based on Anomaly Detection and ...

引用

2016 First IEEE International Conference on computer Communication and the Internet

作者： Yu Jin Shaoying Min Department of Computer Science and Technology Wuhan University of Science and Technology Hubei Province Key Laboratory of Intelligent Information Processing and Real-time Industrial

ISBN: (纸本)9781467385169

Cloud computing is a new commercial *** brings opportunities as well as challenges for cloud users,especially for small and medium size IT *** is one of the important *** order to receive the high quality services,cloud users must build trust in the cloud *** model is one of the effective ***,the existed trust models have defects:(1)most of the models cannot evaluate the trust in the cloud provider when service is running;(2)Although very few of models can do this,they have a common disadvantage:service is provided by single *** other words,it is incapable of seamless shifting from the running service against Service level Agreement(SLA for short)to the other *** there is a short time when the service is *** to this,Stadam is proposed in this paper which is a new SLA trust model based on the anomaly detection and *** Stadam,cloud consumer synchronously uses multiple services that are real-time monitored if SLA is fulfilled by using anomaly detection *** the SLA trust is *** to the current trust the number of requests that are sent to service is dynamically *** Stadam not only detect abnormal ongoing service,but also seamlessly switch between multiple services.

关键词： cloud computing SLA trust anomaly detection multi-cloud cloud service

来源：评论

学校读者我要写书评

暂无评论

Studying bioluminescence flashes with the ANTARES deep Sea neutrino telescope

arXiv

引用

arXiv 2021年

作者： Reeb, Nico Hutschenreuter, S. Zehetner, P. Ensslin, T. Albert, A. Alves, S. André, M. Anghinolfi, M. Anton, G. Ardid, M. Aubert, J.-J. Aublin, J. Baret, B. Basa, S. Belhorma, B. Bendahman, M. Bertin, V. Biagi, S. Bissinger, M. Boumaaza, J. Bouta, M. Bouwhuis, M.C. Brânzaş, H. Bruijn, R. Brunner, J. Busto, J. Caiffi, B. Capone, A. Caramete, L. Carr, J. Carretero, V. Celli, S. Chabab, M. Chau, T.N. Chiarusi, T. Circella, M. Coleiro, A. Colomer-Molla, M. Coniglione, R. Coyle, P. Creusot, A. Díaz, A.F. de Wasseige, G. Deschamps, A. Distefano, C. Di Palma, I. Domi, A. Donzaud, C. Dornic, D. Drouhin, D. van Eeden, T. Enzenhöfer, A. Fermani, P. Ferrara, G. Filippini, F. Fusco, L. Gatelet, Y. Gay, P. Glotin, H. Gozzini, R. Ruiz, R. Gracia Graf, K. Guidi, C. Hallmann, S. van Haren, H. Heijboer, A.J. Hello, Y. Hernández-Rey, J.J. Hößl, J. Hofestädt, J. Huang, F. Illuminati, G. James, C.W. Jisse-Jung, B. de Jong, M. de Jong, P. Jongen, M. Kadler, M. Kalekin, O. Katz, U. Khan-Chowdhury, N.R. Kouchner, A. Kreykenbohm, I. Kulikovskiy, V. Lahmann, R. Le Breton, R. Lefèvre, D. Leonora, E. Levi, G. Lincetto, M. Lopez-Coto, D. Loucatos, S. Maderer, L. Manczak, J. Marcelin, M. Margiotta, A. Marinelli, A. Martínez-Mora, J.A. Melis, K. Migliozzi, P. Moussa, A. Muller, R. Nauta, L. Navas, S. Nezri, E. Fearraigh, B.Ó. Organokov, M. Pavalaş, G.E. Pellegrino, C. Perrin-Terrin, M. Piattelli, P. Pieterse, C. Poirè, C. Popa, V. Pradier, T. Randazzo, N. Reck, S. Riccobene, G. Romanov, A. Sánchez-Losa, A. Greus, F. Salesa Samtleben, D.F.E. Sanguineti, M. Sapienza, P. Schnabel, J. Schumann, J. Schüssler, F. Spurio, M. Stolarczyk, Th. Taiuti, M. Tingay, S.J. Vallage, B. van Elewyck, V. Versari, F. Viola, S. Vivolo, D. Wilms, J. Zavatarelli, S. Zegarelli, A. Zornoza, J.D. Zúñiga, J. Information Field Theory Group Max Planck Institute for Astrophysics Garching Germany Informatics 6 Chair of Robotics Artificial Intelligence and Real time Systems Technical University of Munich Garching Germany Department of Astrophysics IMAPP Radboud University Nijmegen Nijmegen Netherlands Department of Physics Ludwig-Maximilians University Munich Germany CERN Geneva Switzerland Université de Strasbourg CNRS IPHC UMR 7178 StrasbourgF-67000 France Université de Haute Alsace MulhouseF-68200 France IFIC - Instituto de Física Corpuscular CSIC Universitat de València c/ Catedrático José Beltrán 2 Paterna ValenciaE-46980 Spain Technical University of Catalonia Laboratory of Applied Bioacoustics Rambla Exposició Vilanova i la Geltrú Barcelona08800 Spain INFN - Sezione di Genova Via Dodecaneso 33 Genova16146 Italy Friedrich-Alexander-Universität Erlangen-Nürnberg Erlangen Centre for Astroparticle Physics Erwin-Rommel-Str. 1 Erlangen91058 Germany Universitat Politècnica de València C/ Paranimf 1 Gandia46730 Spain Aix Marseille Univ CNRS IN2P3 CPPM Marseille France Université de Paris CNRS Astroparticule et Cosmologie ParisF-75013 France Aix Marseille Univ CNRS CNES LAM Marseille France National Center for Energy Sciences and Nuclear Techniques B.P.1382 RabatR. P. 10001 Morocco University Mohammed V in Rabat Faculty of Sciences 4 av. Ibn Battouta B.P. 1014 R.P. Rabat10000 Morocco Via S. Sofia 62 Catania95123 Italy University Mohammed I Laboratory of Physics of Matter and Radiations B.P.717 Oujda6000 Morocco Nikhef Science Park Amsterdam Netherlands Institute of Space Science Bucharest MagureleRO-077125 Romania Universiteit van Amsterdam Instituut voor Hoge-Energie Fysica Science Park 105 Amsterdam1098 XG Netherlands INFN - Sezione di Roma P.le Aldo Moro 2 Roma00185 Italy Dipartimento di Fisica Università La Sapienza P.le Aldo Moro 2 Roma00185 Italy LPHEA Faculty of Science - Semlali Cadi Ayyad University P.O

We develop a novel technique to exploit the extensive data sets provided by underwater neutrino telescopes to gain information on bioluminescence in the deep sea. The passive nature of the telescopes gives us the unique opportunity to infer information on bioluminescent organisms without actively interfering with them. We propose a statistical method that allows us to reconstruct the light emission of individual organisms, as well as their location and movement. A mathematical model is built to describe the measurement process of underwater neutrino telescopes and the signal generation of the biological organisms. The Metric Gaussian Variational Inference algorithm is used to reconstruct the model parameters using photon counts recorded by the neutrino detectors. We apply this method to synthetic data sets and data collected by the ANTARES neutrino telescope. The telescope is located 40 km off the French coast and fixed to the sea floor at a depth of 2475 m. The runs with synthetic data reveal that we can reliably model the emitted bioluminescent flashes of the organisms. Furthermore, we find that the spatial resolution of the localization of light sources highly depends on the configuration of the telescope. Precise measurements of the efficiencies of the detectors and the attenuation length of the water are crucial to reconstruct the light emission. Finally, the application to ANTARES data reveals the first precise localizations of bioluminescent organisms using neutrino telescope data. © 2021, CC BY.

关键词： Bioluminescence

来源：评论

学校读者我要写书评

暂无评论

A MPPT algorithm based on membrane system for photovoltaic systems under partially shaded conditions

引用

Journal of Computational and Theoretical Nanoscience 2016年第6期13卷 3878-3886页

作者： He, Juanjuan Fu, Jiao Liu, Jun Xiao, Jianhua School of Computer Science Wuhan University of Science and Technology Wuhan430081 China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System Wuhan430081 China Department of Computer Science Xiamen University Xiamen Fujian361005 China

The algorithm based on membrane system, also called membrane-inspired algorithm, has been shown to be powerful for solving combinatorial optimization problems, and it is increasingly used in practical engineering. With integrating membrane structures, evolution rules and computational mechanisms of membrane systems, membrane-inspired algorithms perform well in searching the global optimum. However, this technique can be computationally expensive because of complicated rules and communication mechanism, so that most of membrane-inspired algorithms solved problems off-line. In this work, we propose a novel membrane-inspired algorithm for tracking the global point (GP) online. The ring structure with memory mechanism is adopted to maintain diversity and the convergence that is speeded up by the fast making rules. We verify our method by solving four benchmark functions, and a numerical example of tracking the GP of photovoltaic (PV) system. The experimental results show that our methodology performs well on these four benchmark functions compared with the genetic algorithm and quantum-inspired algorithm. In practice, our method quickly tracks the GP of a PV system. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： Membranes

来源：评论

学校读者我要写书评

暂无评论

A stochastic approach for attack resilient UAV motion planning

A stochastic approach for attack resilient UAV motion planni...

引用

American Control Conference

作者： Nicola Bezzo James Weimer Yanwei Du Oleg Sokolsky Sang H. Son Insup Lee Department of Systems and Information Engineering University of Virginia Charlottesville 22902 USA PRECISE Center Department of Computer and Information Science University of Pennsylvania Philadelphia 19104 USA Real-Time Cyber-Physical Systems Research Laboratory DGIST Korea

ISBN: (纸本)9781467386838

In this paper we propose a stochastic strategy for motion planning of unmanned aerial vehicles (UAVs) subject to malicious cyber attacks. By injecting erroneous information and compromising sensor data, an attacker can hijack a system driving it to unsafe states. In this work we bear on the problem of choosing optimal actions while one or more sensors are not reliable. We assume that the system is fully observable and one or more measurements (however unknown) return incorrect estimates of a state. We build an algorithm that leverages the theory of Markov decision processes (MDPs) to determine the optimal policy to plan the motion of a UAV and avoid unsafe regions of a state space. We name Redundant Observable MDPs (ROMDPs) this class of markovian processes that deal with redundant attacked measurements. A quadrotor case study is introduced and simulation and experimental results are presented to validate the proposed strategy.

关键词： Robot sensing systems Unmanned aerial vehicles Markov processes Noise measurement Planning Cyber-physical systems Unmanned Aerial Vehicle Manipulator sensing systems drone honey bees Noise measurement Markov chain stochastic approach motion planning Cyber-physical systems vehicle state space Redundant Planning optimal strategy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：