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

20th International Conference on Parallel and Distributed computing, Applications and Technologies, PDCAT 2019

作者： Li, Kejian Liu, Gang Lu, Minhua Guangdong Province Key Laboratory of Popular High Performance Computers Guangdong Province Engineering Center of China-made High Performance Data Computing System College of Computer Science and Software Engineering Shenzhen University Shenzhen518060 China School of Biomedical Engineering Shenzhen University Shenzhen518060 China

ISBN: (纸本)9781728126166

The performances of modern distributed stream processing systems are critically affected by the distribution of the load across workers. Skewed data streams in real world are very common and pose a great challenge to these systems, especially for stateful applications. key splitting, which allows a single key to be routed to multiple workers, is a great idea to achieve good balance of load in the cluster. However, it comes with the cost of increased memory consumption and computation overhead as well as network communication. In this paper, we present a new definition of metric to model the cost of key splitting for intra-operator parallelism in stream processing systems and provide a novel perspective to reduce replication factor while keeping both overall load imbalance and processing latency low. Similar to previous work, our approach treats the head and the tail of the distribution differently in order to reduce memory requirements. For the head, it uses our proposed notion of regional load imbalance to decide dynamically whether to make one more worker responsible for the heavy hitter or not. For the tail, it simply uses hash partitioning to keep the size of the routing table for the head as small as possible. Extensive experimental evaluation demonstrates that our approach provides superior performance compared to the state-of-the-art partitioning algorithms in terms of load imbalance, replication factor and latency over different levels of skewed stream distributions. © 2019 IEEE.

关键词： Distributed parameter control systems

来源：评论

学校读者我要写书评

暂无评论

Rely-Guarantee Reasoning about Messaging System for Autonomous Vehicles

Rely-Guarantee Reasoning about Messaging System for Autonomo...

引用

Theoretical Aspects of Software engineering (TASE)

作者： Wenjing Xu Yongwang Zhao Dianfu Ma YuXin Zhang Qian Xiao State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang Univerisity Beijing China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing China State Key Laboratory of Automotive Simulation and Control College of Automotive Engineering Jilin University Jilin China School of Computer Science and Technology Guizhou University Guiyang China

Messaging system as a communicating infrastructure is a safety-critical component of autonomous vehicles. For the purpose of safety certification of Level 4 autonomous driving systems, its necessary to provide a formally verified specification of messaging systems. This paper presents a realistic case study using the PiCore rely-guarantee framework to formally verify the DGPS (Differential Global Positioning System) of UISEE autonomous driving systems. We first create an axiom model of messaging systems by extending PiCore, which is reusable for concrete applications. The model supports dynamic configuration of message buffers as well as the automatic generation of the rely and guarantee conditions for compositional reasoning. It is instantiated when developing the formal specification of DGPS. Then, we use the rely-guarantee proof system of PiCore to verify the functional correctness and invariant of DGPS. The specification and its proof provide a strong evidence for the ongoing safety certification of DGPS.

关键词： Cognition Safety Formal specifications Vehicle dynamics Autonomous vehicles Certification Global Positioning System

来源：评论

学校读者我要写书评

暂无评论

Optimal network slicing for service-oriented networks with flexible routing and guaranteed E2E latency

arXiv

引用

arXiv 2020年

作者： Chen, Wei-Kun Liu, Ya-Feng de Domenico, Antonio Luo, Zhi-Quan Dai, Yu-Hong The School of Mathematics and Statistics Beijing Key Laboratory on MCAACI Beijing Institute of Technology Beijing100081 China The State Key Laboratory of Scientific and Engineering Computing Institute of Computational Mathematics and Scientific/Engineering Computing Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China The Huawei Technologies Co. Ltd France Research Center Boulogne-Billancourt92100 France The Shenzhen Research Institute of Big Data The Chinese University of Hong Kong Shenzhen518172 China

Network function virtualization is a promising technology to simultaneously support multiple services with diverse characteristics and requirements in the 5G and beyond networks. In particular, each service consists of a predetermined sequence of functions, called service function chain (SFC), running on a cloud environment. To make different service slices work properly in harmony, it is crucial to appropriately select the cloud nodes to deploy the functions in the SFC and flexibly route the flow of the services such that these functions are processed in the order defined in the corresponding SFC, the end-to-end (E2E) latency constraints of all services are guaranteed, and all cloud and communication resource budget constraints are respected. In this paper, we first propose a new mixed binary linear program (MBLP) formulation of the above network slicing problem that optimizes the system energy efficiency while jointly considers the E2E latency requirement, resource budget, flow routing, and functional instantiation. Then, we develop another MBLP formulation and show that the two formulations are equivalent in the sense that they share the same optimal solution. However, since the numbers of variables and constraints in the second problem formulation are significantly smaller than those in the first one, solving the second problem formulation is more computationally efficient especially when the dimension of the corresponding network is large. Numerical results demonstrate the advantage of the proposed formulations compared with the existing ones. Copyright © 2020, The Authors. All rights reserved.

关键词： Network function virtualization

来源：评论

学校读者我要写书评

暂无评论

Non-structured Pruning for Deep-learning based Steganalytic Frameworks

Non-structured Pruning for Deep-learning based Steganalytic ...

引用

Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)

作者： Qiushi Li Zilong Shao Shunquan Tan Jishen Zeng Bin Li Shenzhen Key Laboratory of Media Security Guangdong Key Laboratory of Intelligent Information Processing National Engineering Laboratory for Big Data System Computing Technology Shenzhen China

ISBN: (数字)9781728132488

ISBN: (纸本)9781728132495

Image steganalysis aims to discriminate innocent cover images and those suspected stego images embedded with secret message. Recently, increasing advanced deep neural networks have been proposed and used in image steganalysis. Though those deep learning models can gain superior performance, they also result in redundancy of computational resource and memory storage. In this paper, we apply a non-structured pruning method to prune XuNet2 and SRNet - the two state-of-the-art deep-learning framework in the field of JPEG image steganalysis. We obtain the priorities of the connections among neurons according to a certain criterion, then keep those significant weights and prune those nonsignificant ones in the meantime. We have conducted extensive experiments on BOSSBase and BOWS image dataset. The experimental results demonstrate that our proposed non-structured pruning method can significantly reduce the cost of computation and storage required by the original deep-learning frameworks without affecting their detection accuracy.

关键词： Transform coding Training Convolution Computer architecture Computational modeling Brain modeling Testing

来源：评论

学校读者我要写书评

暂无评论

Local averaging type a posteriori error estimates for the nonlinear steady-state Poisson-Nernst-Planck equations

arXiv

引用

arXiv 2020年

作者： Yang, Ying Shen, Ruigang Fang, Mingjuan Shu, Shi School of Mathematics and Computational Science Guangxi Colleges Universities Key Laboratory of Data Analysis and Computation Guilin University of Electronic Technology Guilin541004 China School of Mathematics and Computational Science Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan411105 China School of Mathematics and Computational Science Guilin University of Electronic Technology GuilinGuangxi541004 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan411105 China

The a posteriori error estimates are studied for a class of nonlinear stead-state Poisson-Nernst-Planck equations, which are a coupled system consisting of the Nernst-Planck equation and the Poisson equation. Both the global upper bounds and the local lower bounds of the error estimators are obtained by using a local averaging operator. Numerical experiments are given to confirm the reliability and efficiency of the error estimators. Copyright © 2020, The Authors. All rights reserved.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Collusion-Proof Result Inference in Crowdsourcing

引用

Journal of Computer Science & Technology 2018年第2期33卷 351-365页

作者： Peng-Peng Chen Hai-Long Sun Yi-Li Fang Jin-Peng Huai State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing 100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beijing 100191 China

In traditional crowdsourcing, workers are expected to provide independent answers to tasks so as to ensure the diversity of answers. However, recent studies show that the crowd is not a collection of independent workers, but instead that workers communicate and collaborate with each other. To pursue more rewards with little effort, some workers may collude to provide repeated answers, which will damage the quality of the aggregated results. Nonetheless, there are few efforts considering the negative impact of collusion on result inference in crowdsourcing. In this paper, we are specially concerned with the Collusion-Proof result inference problem for general crowdsourcing tasks in public platforms. To that end, we design a metric, the worker performance change rate, to identify the colluded answers by computing the difference of the mean worker performance before and after removing the repeated answers. Then we incorporate the collusion detection result into existing result inference methods to guarantee the quality of the aggregated results even with the occurrence of collusion behaviors. With real-world and synthetic datasets, we conducted an extensive set of evaluations of our approach. The experimental results demonstrate the superiority of our approach in comparison with the state-of-the-art methods.

关键词： crowdsourcing quality control collusion collaborative crowdsourcing result inference

来源：评论

学校读者我要写书评

暂无评论

A microstrip-based sensor for glucose monitoring: towards non-invasive blood glucose detection

引用

Measurement 2025年

作者： Guodao Zhang Qiwen Zhang Chaochao Wang Xiaojun Ji Zhengqiu Weng Abdulilah Mohammad Mayet Xinjun Miao Institute of Intelligent Media Computing Hangzhou Dianzi University Hangzhou 310018 China Provincial Key Laboratory of Multimodal Perceiving and Intelligent Systems Jiaxing University Jiaxing 314000 China Department of Cardiology Wenzhou Central Hospital Wenzhou 325000 China School of Data Science and Artificial Intelligence Wenzhou University of Technology Wenzhou 325000 China Electrical Engineering Department College of Engineering King Khalid University Abha Kingdom of Saudi Arabia Department of Emergency Wenzhou Central Hospital Wenzhou 325000 China

In this study, a microstrip sensor with U-shaped resonators was designed and developed for non-invasive blood glucose measurement. The sensor comprises five U-shaped resonators forming a microstrip circuit, transmitting in the frequency ranges of 2–2.3 GHz and 3.9–4.2 GHz. Glucose solutions with concentrations from 50 mg/dL to 500 mg/dL were prepared and placed in a 3D-printed PLA container for testing. Samples were positioned non-contact on the sensor, and frequency response changes up to 6 GHz were recorded. The sensor exhibited high sensitivity, measuring 1.50 MHz per mg/dL. Due to environmental susceptibilities and the relatively low repeatability of microstrip sensors, each sample was tested five times, yielding a total of 50 measurements. These recorded responses were processed using a multilayer perceptron (MLP) neural network, which predicted glucose concentrations with a mean relative error (MRE%) of less than 2.48 %. This research highlights the development of a highly sensitive, non-invasive glucose sensor integrated with a neural network, offering precise and rapid blood glucose measurements. This system holds promise as a valuable tool for managing diabetes and other blood glucose-related conditions.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Pulmonary tuberculosis detection model of chest X-ray images using convolutional neural network

引用

The Journal of China Universities of Posts and Telecommunications 2018年第6期25卷 1-6页

作者： He Jin Wang Cong Chen Zhao School of Software Engineering Beijing University of Posts and Telecommunications Key Laboratory of Trustworthy Distributed Computing and Service(BUPT) Ministry of Education China Electronic Data Service CO. LTD

The primary screening for pulmonary tuberculosis mainly relies on X-ray imaging all over the world. In recent years, the incidence of pulmonary tuberculosis has rebounded. This paper proposes a convolutional neural networks(CNN) based model on the tuberculosis detection of chest X-ray images, which is used for the automatic screening of pulmonary tuberculosis. Compared with the conventional CNN, this model can be used to detect the details of images and the areas of the disease quickly and accurately. There is an improvement in the learning speed and accuracy rate of our method, so it can better complete the work of anomaly detection and it can provide more effective auxiliary decision information for the practitioners.

关键词： X-ray images pulmonary tuberculosis CNN automatic screening

来源：评论

学校读者我要写书评

暂无评论

GAMMA Challenge: Glaucoma grAding from Multi-Modality imAges

arXiv

引用

arXiv 2022年

作者： Wu, Junde Fang, Huihui Li, Fei Fu, Huazhu Lin, Fengbin Li, Jiongcheng Huang, Yue Yu, Qinji Song, Sifan Xu, Xinxing Xu, Yanyu Wang, Wensai Wang, Lingxiao Lu, Shuai Li, Huiqi Huang, Shihua Lu, Zhichao Ou, Chubin Wei, Xifei Liu, Bingyuan Kobbi, Riadh Tang, Xiaoying Lin, Li Zhou, Qiang Hu, Qiang Bogunović, Hrvoje Orlando, José Ignacio Zhang, Xiulan Xu, Yanwu State Key Laboratory of Ophthalmology Zhongshan Ophthalmic Center Sun Yat-sen University Guangdong Provincial Key Laboratory of Ophthalmology and Visual Science Guangzhou China Intelligent Healthcare Unit Baidu Inc. Beijing China Singapore School of Informatics Xiamen University Xiamen China Shanghai Jiao Tong University Shanghai China Xi'an Jiaotong-Liverpool University Suzhou China Institute of High Performance Computing A*STAR Singapore Institute of Biomedical Engineering Chinese Academy of Medical Sciences Peking Union Medical College Tianjin China School of Medical Technology Beijing Institute of Technology Beijing China Department of Computing Hong Kong Polytechnic University Hong Kong Department of Computer Science and Engineering Southern University of Science and Technology Shenzhen China Weizhi Medical Technology Company Suzhou China École de Technologie Supérieure Montreal Montreal Canada DIAGNOS Inc. Quebec Canada Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen China Department of Electrical and Electronic Engineering The University of Hong Kong Hong Kong Technology Co. Ltd. Shanghai China School of Information and Electronics Beijing Institute of Technology Beijing China Christian Doppler Lab for Artificial Intelligence in Retina Department of Ophthalmology Medical University of Vienna Austria Yatiris Group PLADEMA Institute CONICET UNICEN Tandil Argentina

Glaucoma is a chronic neuro-degenerative condition that is one of the world's leading causes of irreversible but preventable blindness. The blindness is generally caused by the lack of timely detection and treatment. Early screening is thus essential for early treatment to preserve vision and maintain life quality. Color fundus photography and Optical Coherence Tomography (OCT) are the two most cost-effective tools for glaucoma screening. Both imaging modalities have prominent biomarkers to indicate glaucoma suspects, such as the vertical cup-to-disc ratio (vCDR) on fundus images and retinal nerve fiber layer (RNFL) thickness on OCT volume. In clinical practice, it is often recommended to take both of the screenings for a more accurate and reliable diagnosis. However, although numerous algorithms are proposed based on fundus images or OCT volumes for the automated glaucoma detection, there are few methods that leverage both of the modalities to achieve the target. To fulfill the research gap, we set up the Glaucoma grAding from Multi-Modality imAges (GAMMA) Challenge to encourage the development of fundus & OCT-based glaucoma grading. The primary task of the challenge is to grade glaucoma from both the 2D fundus images and 3D OCT scanning volumes. As part of GAMMA, we have publicly released a glaucoma annotated dataset with both 2D fundus color photography and 3D OCT volumes, which is the first multi-modality dataset for machine learning based glaucoma grading. In addition, an evaluation framework is also established to evaluate the performance of the submitted methods. During the challenge, 1272 results were submitted, and finally, ten best performing teams were selected for the final stage. We analyze their results and summarize their methods in the paper. Since all the teams submitted their source code in the challenge, we conducted a detailed ablation study to verify the effectiveness of the particular modules proposed. Finally, we identify the proposed techniqu

关键词： Grading

来源：评论

学校读者我要写书评

暂无评论

Budgeted Persuasion on User Opinions via Varying Susceptibility

Budgeted Persuasion on User Opinions via Varying Susceptibil...

引用

IEEE International Conference on Performance, computing and Communications (IPCCC)

作者： Wenyi Tang Xinrui Xu Guangchun Luo Zaobo He Kaiming Zhan School of Computer Science and Engineering University of Electronic Science and Technology of China School of Information and Software Engineering University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Miami University Sichuan Jiuyuan Yinhai Software Co. Ltd

ISBN: (数字)9781728198293

ISBN: (纸本)9781728198309

Nowadays, the social network becomes an indispensable part of people's daily life, meanwhile offers an unprecedentedly convenient access for purposive individuals to influence the opinions of network users. Current studies present a subtle persuasion approach that finds a number of key users meanwhile varies their susceptibility extent to impact the public opinion. Such persuasion is significantly critical for public security, as it could facilitate both the spreading and dispelling of malicious rumors. However, the major body of these studies enclose impractical assumptions, such that persuaders have an unlimited budget, or the costs of varying different users' susceptibilities are the same, thus rendering these works unsuitable for realistic scenarios. Therefore, this work originally proposes a more practical and generalized problem of persuasion, where varying the susceptibilities of different users holds different costs. The analysis of its non-convexity, non-submodularity and complexity shows that solving the proposed problem is nontrivial, thus inspiring us to provide an intuitive greedy algorithm. Furthermore, we design an accelerated algorithm based on the community property, which reduces the time consumption more than one order of magnitude. The acceleration is based on the intuition that the impact of a user within a proper community could be a good estimation of the impact in the whole network, while the computation of the former one is much more efficient. The relationship between two algorithms is fully analyzed, which shows the community-based algorithm can degenerate to the intuitive greedy algorithm under a specific setting. Finally, comprehensive evaluations on real-world datasets show the superiority of proposed algorithms on both effectiveness and efficiency.

关键词： Greedy algorithms Social networking (online) Heuristic algorithms Search problems Rendering (computer graphics) Acceleration Security

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：