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

International Conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Yuxiang Liu Huichuwu Li Jiang Xiao Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9781728152127

ISBN: (纸本)9781728152134

Fingerprinting-based indoor localization via WiFi has achieved a great breakthrough in the past decade. However, it suffers from an inherent problem that the localization accuracy declines sharply over time due to the dynamic environment and unstable WiFi devices. Researchers have designed many methods to update the localization model, e.g., crowdsourcing-based model updating, in order to maintain the localization accuracy. Unfortunately, they have not taken the privacy into consideration during the updating process. This will lead to a threat that the eavesdroppers could guess the location providers' private information according to the updating model. For the goal of maintaining the localization accuracy without the risk of privacy breaching, we proposed FLoc, a fingerprinting-based indoor localization system which updates the localization model via a federated learning framework. In FLoc, every provider maintains a local localization model in their own device. They will regularly encrypt the updating parameters and share them to a common model server. At the model server, it aggregates the encrypted information of the local models to maintain a general model, which will be sent back to the local devices for next updating iteration. We evaluate FLoc in an APs unknown laboratory corridor. The experiment results show that FLoc has a comparable localization performance. Moreover, it can successfully protect the providers' privacy, since the information transferred is all encrypted.

关键词： Mobile handsets Privacy Fingerprint recognition Servers Wireless fidelity Databases Computational modeling

来源：评论

学校读者我要写书评

暂无评论

Minimizing Overheads of Checkpoints in Distributed Stream Processing Systems 7

Minimizing Overheads of Checkpoints in Distributed Stream Pr...

引用

7th IEEE International Conference on Cloud Networking, CloudNet 2018

作者： Muhammad Abrar Akber, Syed Chen, Hanhua Wang, Yonghui Jin, Hai School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab Services Computing Technology and System Lab Big Data Technology and System Lab Wuhan430074 China

ISBN: (纸本)9781538668313

Failure occurrence in large-scale systems is inevitable, which makes the resilience a key challenge for modern systems. Checkpoints with rollback recovery is a well-known approach to provide fault tolerance in distributed systems. The checkpoint based fault tolerance approach periodically persists the application state to reliable storage, which serves as a recovery point in case of failure. These periodic checkpoints are not inline with the failure rate of the systems as many studies conclude that failure occurrence is not periodic. The optimal size of checkpoint interval is a crucial decision, which directly determines the checkpoint overheads. To minimize the checkpoint overheads, we propose to reduce the number of checkpoints during the application execution. We suggest reducing the number of checkpoints by successively increasing the checkpoint intervals. We consider the failure probability of the underlying infrastructure and iteratively increase the checkpoint intervals. The proposed checkpoint approach tailors the checkpoint initializing based on the failure probability. If failure probability is low, it increases the checkpoint interval, and eventually reduces the total number of checkpoints triggered during application timespan. Reducing the total number of checkpoints during application execution results in decreasing the checkpoint overheads. The experiment results show that the proposed checkpoint policy considerably reduces the checkpoint overheads as compared to periodic checkpoints. © 2018 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

An accuracy-lossless perturbation method for defending privacy attacks in federated learning

arXiv

引用

arXiv 2020年

作者： Yang, Xue Feng, Yan Fang, Weijun Shao, Jun Tang, Xiaohu Xia, Shutao Lu, Rongxing Tsinghua Shenzhen International Graduate School Tsinghua University Pcl Research Center of Networks and Communications Peng Cheng Laboratory Shenzhen518055 China School of Computer and Information Engineering Zhejiang Gongshang University Zhejiang310018 China Information Security and National Computing Grid Laboratory Southwest Jiaotong University Chengdu610031 China Canadian Institute of Cybersecurity Faculty of Computer Science University of New Brunswick FrederictonE3B 5A3 Canada

Although federated learning improves privacy of training data by exchanging local gradients or parameters rather than raw data, the adversary still can leverage local gradients and parameters to obtain local training data by launching reconstruction and membership inference attacks. To defend such privacy attacks, many noises perturbation methods (like differential privacy or CountSketch matrix) have been widely designed. However, the strong defence ability and high learning accuracy of these schemes cannot be ensured at the same time, which will impede the wide application of FL in practice (especially for medical or financial institutions that require both high accuracy and strong privacy guarantee). To overcome this issue, in this paper, we propose an efficient model perturbation method for federated learning to defend reconstruction and membership inference attacks launched by curious clients. On the one hand, similar to the differential privacy, our method also selects random numbers as perturbed noises added to the global model parameters, and thus it is very efficient and easy to be integrated in practice. Meanwhile, the random selected noises are positive real numbers and the corresponding value can be arbitrarily large, and thus the strong defence ability can be ensured. On the other hand, unlike differential privacy or other perturbation methods that cannot eliminate the added noises, our method allows the server to recover the true gradients by eliminating the added noises. Therefore, our method does not hinder learning accuracy at all. Extensive experiments demonstrate that for both regression and classification tasks, our method achieves the same accuracy as non-private approaches and outperforms the state-ofthe- art related schemes. Besides, the defence ability of our method is significantly better than the state-of-the-art related defence schemes. Specifically, for the membership inference attack, our method achieves attack success rate (ASR) of aroun

关键词： Perturbation techniques

来源：评论

学校读者我要写书评

暂无评论

Hybrid loss guided densely connected convolutional neural network for Ischemic Stroke Lesion segmentation

Hybrid loss guided densely connected convolutional neural ne...

引用

International Conference for Convergence of Technology (I2CT)

作者： Saqib Qamar Hai Jin Ran Zheng Mohd Faizan Services Computing Technology and System Lab Cluster and Grid Computing Lab Big Data Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China Department of Electronics Aligarh Muslim University India

ISBN: (数字)9781538680759

ISBN: (纸本)9781538680766

The exact position of dead tissue in ischemic stroke lesions plays an important role to cure the life-threatening condition. However, this issue stays difficult caused by variation of ischemic strokes such as shape and location. Fully convolutional neural networks (FCN) have great potential for semantic image segmentation. Recently, UNet based CNN architectures have secured outstanding performance in the application of medical imaging. The primary problem is data imbalanced in the application of such networks which are very common in medical data application such as lesion applications where non-lesion voxels are higher than lesion voxels. Data imbalance generates low recall and high precision on the prediction of trained networks. Biases towards the particular class are not suitable for many medical works where false positives are less than false negatives. A lot of approaches are developed to tackle this issue including balanced sampling, sample re-weighting, and recently focal loss and similarity loss functions. In this paper, we proposed hyper densely connected network along with hybrid loss functions for ischemic stroke lesions segmentation. The densely connected network exploits the contextual information of multi-modalities, and hybrid loss function uses to overcome the data imbalance. We evaluate our performance on ISLES dataset. Our approach performs well as compared to other existing methods.

关键词： Lesions Image segmentation Magnetic resonance imaging Biomedical imaging Convolutional neural networks Training computer architecture

来源：评论

学校读者我要写书评

暂无评论

Precision monitoring of radial growth of trees and micro-climate at a Korean Fir (Abies koreana Wilson) forest at 10 minutes interval in 2016 on Mt. Hallasan National Park, Jeju Island, Korea

引用

Journal of Ecology and Environment 2019年第1期43卷 1页

作者： Kim, Eun-Shik Cho, Hong-Bum Heo, Daeyoung Kim, Nae-Soo Kim, Young-Sun Lee, Kyeseon Lee, Sung-Hoon Ryu, Jaehong Department of Forestry Environment and Systems Kookmin University Seoul 02707 South Korea Institute of Forest Science Kookmin University Seoul 02707 South Korea Grid and Cloud Computing Laboratory School of Computer Science Kookmin University Seoul 02707 South Korea Electronics and Telecommunications Research Institute 218 Gajeong Ro Yuseong Gu Daejeon 34129 South Korea

To understand the dynamics of radial growth of trees and micro-climate at a site of Korean fir (Abies koreana Wilson) forest on high-altitude area of Mt. Hallasan National Park, Jeju Island, Korea, high precision dendrometers were installed on the stems of Korean fir trees, and the sensors for measuring micro-climate of the forest at 10 minutes interval were also installed at the forest. Data from the sensors were sent to nodes, collected to a gateway wireless, and transmitted to a data server using mobile phone communication system. By analyzing the radial growth data for the trees during the growing season in 2016, we can estimate that the radial growth of Korean fir trees initiated in late April to early May and ceased in late August to early September, which indicates that period for the radial growth was about 4 months in 2016. It is interesting to observe that the daily ambient temperature and the daily soil temperature at the depth of 20 cm coincided with the values of about 10 °C when the radial growth of the trees initiated in 2016. When the radial growth ceased, the values of the ambient temperature went down below about 15 °C and 16 °C, respectively. While the ambient temperature and the soil temperature are evaluated to be the good indicators for the initiation and the cessation of radial growth, it becomes clear that radii of tree stems showed diurnal growth patterns affected by diurnal change of ambient temperature. In addition, the wetting and drying of the surface of the tree stems affected by precipitation became the additional factors that affect the expansion and shrinkage of the tree stems at the forest site. While it is interesting to note that the interrelationships among the micro-climatic factors at the forest site were well explained through this study, it should be recognized that the precision monitoring made possible with the application of high resolution sensors in the measurement of the radial increment combined with the observation of

关键词： Abies koreana Ecological platform Environmental factors Korean fir trees Micro-climate Precision dendrometer Radial growth Real-time monitoring

来源：评论

学校读者我要写书评

暂无评论

A survey on graph processing accelerators: Challenges and opportunities

arXiv

引用

arXiv 2019年

作者： Gui, Chuang-Yi Zheng, Long He, Bing-Sheng Liu, Cheng Chen, Xin-Yu Liao, Xiao-Fei Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China School of Computing National University of Singapore 117418 Singapore

Graph is a well known data structure to represent the associated relationships in a variety of applications, e.g., data science and machine learning. Despite a wealth of existing efforts on developing graph processing systems for improving the performance and/or energy efficiency on traditional architectures, dedicated hardware solutions, also referred to as graph processing accelerators, are essential and emerging to provide the benefits significantly beyond those pure software solutions can offer. In this paper, we conduct a systematical survey regarding the design and implementation of graph processing accelerator. Specifically, we review the relevant techniques in three core components toward a graph processing accelerator: preprocessing, parallel graph computation and runtime scheduling. We also examine the benchmarks and results in existing studies for evaluating a graph processing accelerator. Interestingly, we find that there is not an absolute winner for all three aspects in graph acceleration due to the diverse characteristics of graph processing and complexity of hardware configurations. We finially present to discuss several challenges in details, and to further explore the opportunities for the future research. Copyright © 2019, The Authors. All rights reserved.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

Modeling Distributed Stream Processing Systems Under Heavy Workload

Modeling Distributed Stream Processing Systems Under Heavy W...

引用

International Conference on Cyberworlds

作者： Muhammad Mudassar Qureshi Hanhua Chen Hai Jin Huazhong University of Science and Technology Wuhan China National Engineering Research Center for Big Data Technology and System Cluster and Grid Computing Lab Services Computing Technology and System Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Big data applications play a significant role in diverse fields. Distributed Stream Processing Engines (DSPEs) are widely used to support real time applications efficiently. Partitioning algorithms are used to partition data streams into multiple nodes to process in parallel to gain efficient performance. Aggregation cost is an important factor when process stateful streaming applications using such partitioning algorithms because it plays an important role on performance when final result is being produced in stateful streaming applications. However, impact of aggregation cost in stream processing is not discussed comprehensively in existing literature. We use performance modeling to identify the importance of aggregation cost when workload is high. We implement performance model on a multi-node cluster to predict the same behavior as on single resource performance model. We demonstrate that stateful streaming applications need more resources as compare to stateless applications when workload is high and both stateful and stateless applications are running in the same DSPE. Experiments results show that a stateful streaming application needs more resources compared to a stateless streaming application when both applications are running on the same DSPE when the workload is high. Further experiment results show that the performance modeling may be helpful to predict maximum workload that can be process on a DSPE and increase in parallelism level is not guaranteed to increase the performance of streaming applications.

关键词： Partitioning algorithms Data models Predictive models Heuristic algorithms Big Data applications Throughput

来源：评论

学校读者我要写书评

暂无评论

Provably Secure APK Redevelopment Authorization Scheme in the Standard Model

引用

computers, Materials & Continua 2018年第9期56卷 447-465页

作者： Daofeng Li Mingxing Luo Bowen Zhao Xiangdong Che School of Computer Electrical and informationGuang Xi UniversityNanning530004China Information Security and National Computing Grid Laboratory Southwest Jiaotong UniversityChengdu610031China Guangxi Colleges and Universities Key Laboratory of Multimedia Communications and Information Processing Guangxi UniversityNanning530004China School of Information Security&Applied Computing College of TechnologyEastern Michigan UniversityMichigan48197USA

The secure issues of APK are very important in Android *** order to solve potential secure problems and copyrights issues in redevelopment of APK files,in this paper we propose a new APK redevelopment mechanism(APK-SAN).By exploring sanitizable signature technology,APK-SAN allows the original developer to authorize specified modifier who can redevelop the designated source code of APK *** scheme does not require interactions between the developer and *** can reduce the communication overhead and computational overhead for ***,the signature of redeveloped APK files is valid and maintains the *** proposed APK-SAN signature can effectively protect the security of the redeveloped APK files and copyrights of the developer and modifier.

关键词： Sanitizable signature APK signature mechanism redevelopment ID-based signature scheme

来源：评论

学校读者我要写书评

暂无评论

CNLoc: Channel state information assisted indoor WLAN localization using nomadic access points 1

引用

15th IFIP International Conference on Network and Parallel computing, NPC 2018

作者： Xiao, Jiang Li, Huichuwu Li, He Jin, Hai Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Information and Electronic Engineering Muroran Institute of Technology MuroranHokkaido Japan

ISBN: (数字)9783030056773

ISBN: (纸本)9783030056766

Wireless local area network (WLAN) based indoor localization is expanding its fast-paced adoption to facilitate a variety of indoor location-based services (ILBS). Unfortunately, the performance of current WLAN localization systems relying on fixed access points (APs) deployment is constrained by the spatial localizability variance (SLV) problem that different locations may exhibit significantly distinct localization resolution. Prior approaches tackle this problem through nomadic APs with favorable mobility to dynamically adjust the network topology. However, the lack of prior knowledge of nomadic AP’s position has been a challenge for location distinction and will lead to prohibitive performance degradation. In this paper, we propose and develop CNLoc, a novel CSI-based (Channel State Information) indoor WLAN localization framework to overcome the location uncertainty of nomadic APs. Our implementation and evaluation show that CNLoc can improve the accuracy with unknown location information of nomadic APs. We also discuss some open issues and new possibilities in future nomadic AP based indoor localization. © IFIP International Federation for Information Processing 2018.

关键词： Channel state information

来源：评论

学校读者我要写书评

暂无评论

Foundational Competencies and Responsibilities of a Research Software Engineer

arXiv

引用

arXiv 2023年

作者： Goth, Florian Alves, Renato Braun, Matthias Castro, Leyla Jael Chourdakis, Gerasimos Christ, Simon Cohen, Jeremy Druskat, Stephan Erxleben, Fredo Grad, Jean-Noël Hagdorn, Magnus Hodges, Toby Juckeland, Guido Kempf, Dominic Lamprecht, Anna-Lena Linxweiler, Jan Löffler, Frank Martone, Michele Schwarzmeier, Moritz Seibold, Heidi Thiele, Jan Philipp Waldow, Harald von Wittke, Samantha Institute for Theoretical Physics and Astrophysics University of Würzburg Germany European Molecular Biology Laboratory Heidelberg Germany Cluster of Excellence IntCDC University of Stuttgart Germany ZB MED Information Centre for Life Sciences Cologne Germany School of Computation Information and Technology Technical University of Munich Garching Germany Institute for Parallel and Distributed Systems University of Stuttgart Stuttgart Germany Leibniz University Hannover Department of Cell Biology and Biophysics Computational Biology Germany Imperial College London London United Kingdom Institute for Software Technology Berlin Germany Humboldt-Universität zu Berlin Department of Computer Science Berlin Germany Helmholtz-Zentrum Dresden-Rossendorf Germany Institute for Computational Physics University of Stuttgart Germany Geschäftsbereich IT Charité Universitätsmedizin Berlin Germany The Carpentries United States Heidelberg University Scientific Software Center Germany Institute of Computer Science University of Potsdam Germany Technische Universität Braunschweig Germany Michael Stifel Center Jena Friedrich Schiller University Jena Germany Leibniz Supercomputing Centre Garching Germany Mathematical Modeling and Analysis TU Darmstadt Germany IGDORE Munich Germany Weierstrass Institute Berlin Germany Leibniz University Hannover Institute of Applied Mathematics Scientific Computing Hannover Germany Johann Heinrich von Thünen Institute Centre for Information Management Germany

The term Research Software Engineer, or RSE, emerged a little over 10 years ago as a way to represent individuals working in the research community but focusing on software development. The term has been widely adopted and there are a number of high-level definitions of what an RSE is. However, the roles of RSEs vary depending on the institutional context they work in. At one end of the spectrum, RSE roles may look similar to a traditional research role. At the other extreme, they resemble that of a software engineer in industry. Most RSE roles inhabit the space between these two extremes. Therefore, providing a straightforward, comprehensive definition of what an RSE does and what experience, skills and competencies are required to become one is challenging. In this community paper we define the broad notion of what an RSE is, explore the different types of work they undertake, and define a list of foundational competencies as well as values that outline the general profile of an RSE. Further research and training can build upon this foundation of skills and focus on various aspects in greater detail. We expect that graduates and practitioners will have a larger and more diverse set of skills than outlined here. On this basis, we elaborate on the progression of these skills along different dimensions. We look at specific types of RSE roles, propose recommendations for organisations, and give examples of future specialisations. An appendix details how existing curricula fit into this framework. © 2023, CC BY.

关键词： computer aided software engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：