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

Realizability of BPMN 2.0 Choreography using CSP#

学校读者我要写书评

暂无评论

Realizability of BPMN 2.0 Choreography using CSP#

第一届计算机科学与教育信息化国际会议

作者： Wu RuiQiong Duan Qing Dai fei School of Software Yunnan university College of Big Data and Intelligent Engineering Southwest Forestry University

Service-oriented computing is a new computing paradigm that uses services to support the rapid development of distributed software systems. The paradigm of software development is built software systems by reusing and combining existing concurrent and distributed services. In order to accomplish a task together, these services must coordinate their execution through interacting with each other. Interactions among a set of services involved in a new system are described from a global point of view using choreography specification languages. The realizability indicates whether peers can be generated from a choreography so that they will behave exactly as formalized in its specification. This paper uses CSP# to analysis the realizability of BPMN2.0 choreography. The main research contents are as follows: 1) Encoding BMPN2.0 choreography in CSP#. 2) The mapping of CSP # choreography to peers. 3) The realizability under synchronous communication and bounded asynchronous communication with CSP#.

关键词： Service BPMN2.0 Choreography CSP# Realizability

System architecture for high-performance permissioned blockchains

学校读者我要写书评

暂无评论

Frontiers of Computer Science 2019年第6期13卷 1151-1165页

作者： Libo FENG Hui ZHANG Wei-Tek TSAI Simeng SUN State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China Digital Society&Blockchain Laboratory School of Computer ScienceBeihang UniversityBeijing 100191China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang UniversityBeijing 100191China School of Computing Informatics and Decision Systems EngineeringArizona State UniversityTempeUSA

Blockchain(BC),as an emerging distributed database technology with advanced security and reliability,has attracted much attention from experts who devoted to efinance,intellectual property protection,the internet of things(IoT)and so ***,the inefficient transaction processing speed,which hinders the BC’s widespread,has not been well tackled *** this paper,we propose a novel architecture,called Dual-Channel Parallel Broadcast model(DCPB),which could address such a problem to a greater extent by using three methods which are dual communication channels,parallel pipeline processing and block broadcast *** the dual-channel model,one channel processes transactions,and the other engages in the execution of *** parallel pipeline processing allows the system to operate *** block generation strategy improves the efficiency and speed of *** experiments have been applied to BeihangChain,a simplified prototype for BC system,illustrates that its transaction processing speed could be improved to 16K transaction per second which could well support many real-world scenarios such as BC-based energy trading system and Micro-film copyright trading system in CCTV.

关键词： blockchain concurrency performance dualchannel model parallel pipeline consensus algorithm

Consistent and Complementary Graph Regularized Multi-view Subspace Clustering

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Zheng, Qinghai Zhu, Jihua Li, Zhongyu Pang, Shanmin Wang, Jun Chen, Lei School of Software Engineering Xi’an Jiaotong University Xi’an710049 China Shanghai Institute for Advanced Communication and Data Science School of Communication and Information Engineering Shanghai University Shanghai200444 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China

This study investigates the problem of multi-view clustering, where multiple views contain consistent information and each view also includes complementary information. Exploration of all information is crucial for good multi-view clustering. However, most traditional methods blindly or crudely combine multiple views for clustering and are unable to fully exploit the valuable information. Therefore, we propose a method that involves consistent and complementary graph-regularized multi-view subspace clustering (GRMSC), which simultaneously integrates a consistent graph regularizer with a complementary graph regularizer into the objective function. In particular, the consistent graph regularizer learns the intrinsic affinity relationship of data points shared by all views. The complementary graph regularizer investigates the specific information of multiple views. It is noteworthy that the consistent and complementary regularizers are formulated by two different graphs constructed from the first-order proximity and second-order proximity of multiple views, respectively. The objective function is optimized by the augmented Lagrangian multiplier method in order to achieve multi-view clustering. Extensive experiments on six benchmark datasets serve to validate the effectiveness of the proposed method over other state-of-the-art multi-view clustering methods. Copyright © 2020, The Authors. All rights reserved.

关键词： Clustering algorithms

Boundary-Aware context neural network for medical image segmentation

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Wang, Ruxin Chen, Shuyuan Ji, Chaojie Fan, Jianping Li, Ye Joint Engineering Research Center for Health Big Data Intelligent Analysis Technology Shenzhen Institutes of Advanced Technology Chinese Academy of Sciences Shenzhen China School of Software Engineering University of Science and Technology of China Shenzhen Institutes of Advanced Technology Shenzhen China

Medical image segmentation can provide a reliable basis for further clinical analysis and disease diagnosis. The performance of medical image segmentation has been significantly advanced with the convolutional neural networks (CNNs). However, most existing CNNs-based methods often produce unsatisfactory segmentation mask without accurate object boundaries. This is caused by the limited context information and inadequate discriminative feature maps after consecutive pooling and convolution operations. In that the medical image is characterized by the high intra-class variation, inter-class indistinction and noise, extracting powerful context and aggregating discriminative features for fine-grained segmentation are still challenging today. In this paper, we formulate a boundary-Aware context neural network (BA-Net) for 2D medical image segmentation to capture richer context and preserve fine spatial information. BA-Net adopts encoder-decoder architecture. In each stage of encoder network, pyramid edge extraction module is proposed for obtaining edge information with multiple granularities firstly. Then we design a mini multi-Task learning module for jointly learning to segment object masks and detect lesion boundaries. In particular, a new interactive attention is proposed to bridge two tasks for achieving information complementarity between different tasks, which effectively leverages the boundary information for offering a strong cue to better segmentation prediction. At last, a cross feature fusion module aims to selectively aggregate multi-level features from the whole encoder network. By cascaded three modules, richer context and fine-grain features of each stage are encoded. Extensive experiments on five datasets show that the proposed BA-Net outperforms state-of-The-Art approaches. Copyright © 2020, The Authors. All rights reserved.

关键词： Convolutional neural networks

Feature Location Benchmark for Decomposing and Reusing Android Apps

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tang, Yutian Zhou, Hao Xu, Zhou Luo, Xiapu Cai, Yan Zhang, Tao Department of Computing Hong Kong Polytechnic University Hong Kong School of Big Data and Software Engineering Chongqing University China State Key Laboratory of Computer Science Institute of Software Chinese Academy of Sciences China Faculty of Information Technology Macau University of Science and Technology China

software reuse enables developers to reuse architecture, programs and other software artifacts. Realizing a systematical reuse in software brings a large amount of benefits for stakeholders, including lower maintenance efforts, lower development costs, and time to market. Unfortunately, currently implementing a framework for large-scale software reuse in Android apps is still a huge problem, regarding the complexity of the task and lacking of practical technical support from either tools or domain experts. Therefore, proposing a feature location benchmark for apps will help developers either optimize their feature location techniques or reuse the assets created in the benchmark for reusing. In this paper, we release a feature location benchmark, which can be used for those developers, who intend to compose software product lines (SPL) and release reuse in apps. The benchmark not only contributes to the research community for reuse research, but also helps participants in industry for optimizing their architecture and enhancing modularity. In addition, we also develop an Android Studio plugin named caIDE for developers to view and operate on the benchmark. Copyright © 2020, The Authors. All rights reserved.

关键词： Computer software reusability

Breaking the Curse of Space Explosion: Towards Efficient NAS with Curriculum Search

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Guo, Yong Chen, Yaofo Zheng, Yin Zhao, Peilin Chen, Jian Huang, Junzhou Tan, Mingkui School of Software Engineering South China University of Technology China Pazhou Laboratory China Weixin Group Tencent China Tencent AI Lab Tencent China Guangdong Key Laboratory of Big Data Analysis and Processing China

Neural architecture search (NAS) has become an important approach to automatically find effective architectures. To cover all possible good architectures, we need to search in an extremely large search space with billions of candidate architectures. More critically, given a large search space, we may face a very challenging issue of space explosion. However, due to the limitation of computational resources, we can only sample a very small proportion of the architectures, which provides insufficient information for the training. As a result, existing methods may often produce suboptimal architectures. To alleviate this issue, we propose a curriculum search method that starts from a small search space and gradually incorporates the learned knowledge to guide the search in a large space. With the proposed search strategy, our Curriculum Neural Architecture Search (CNAS) method significantly improves the search efficiency and finds better architectures than existing NAS methods. Extensive experiments on CIFAR-10 and ImageNet demonstrate the effectiveness of the proposed method. Copyright © 2020, The Authors. All rights reserved.

关键词： Curricula

A hybrid approach using human posture and contour for gait recognition under body occlusion

学校读者我要写书评

暂无评论

A hybrid approach using human posture and contour for gait r...

International Conference on Information Science and Control engineering (ICISCE)

作者： Yue Ma Chenghao Wei Hao Long Ministry of Public Security Key Laboratory of Impression Evidence Examination and Identification Technology (National Police University of China) people’s republic of China Big Data Institute College of Computer Science and Software Engineering Shenzhen University

This paper presents a hybrid method using a Gaitset network for gait recognition. We firstly use Alphpose model to obtain key points of human posture to improve the extraction of human contour under body occlusion. The human contour map is obtained by pose2Seg model with the key points of human posture. Both human posture and body contour are used as input of the network. By using the hybrid method, it can effectively improve the accuracy and robustness of gait recognition with the upper body information under occlusion. In scenes of human walking under body occlusion, our experimental results show that the accuracy of the proposed method in self-built database can reach 84.6% accuracy.

关键词： Legged locomotion Information science Control engineering databases Feature extraction Robustness Gait recognition

Matrix Classifier On Dynamic Functional Connectivity For Mci Identification

学校读者我要写书评

暂无评论

Matrix Classifier On Dynamic Functional Connectivity For Mci...

IEEE International Conference on Image Processing

作者： Lei Zhou Liang Zhang Xiao Bai Jun Zhou School of Computer Science and Engineering Beijing Advanced Innovation Center for Big Data and Brain Computing State Key Laboratory of Software Development Environment Beihang University Beijing School of Information and Communication Technology Griffith University Nathan

ISBN: (数字)9781728163956

ISBN: (纸本)9781728163963

One of the most popular method for Alzheimer's disease (AD) diagnosis is exploring the Brain functional connectivity (FC) from resting-state functional magnetic resonance imaging (RS-fMRI). To early prevent AD, it is crucial to distinguish AD and and its preclinical stage, mild cognitive impairment (MCI) and early MCI (eMCI). In many existing works, dynamic functional connectivity (dFC) which contains rich spatiotemporal information has been exploited for the MCI and eMCI identification. However, most of these dFC based methods only consider the correlation between discrete brain status while ignore the valuable spatiotemporal information contained in dFC. To overcome this limitation, we propose a matrix classifier based method on the dFC signal for MCI and eMCI identification. Specifically, we first represent the dFC correlations by matrix features which contain rich spatiotemporal information and then learn the support matrix machines (SMM) to classify AD and its preclinical stage. Experiments on 600 real people data provide by the Alzheimer's Disease Neuroimaging Initiative (ADNI) demonstrate that our proposed matrix classifier based method outperforms other FC and dFC based methods for both normal controls (NC)/MCI identification and NC/eMCI identification.

关键词： Feature extraction Correlation Dementia Microsoft Windows Spatiotemporal phenomena Training

A Distributed Privacy-Preserving Learning Dynamics in General Social Networks

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Tao, Youming Chen, Shuzhen Li, Feng Yu, Dongxiao Yu, Jiguo Sheng, Hao School of Computer Science and Technology Shandong University Qingdao266237 China Big Data Institute Qilu University of Technology Jinan250353 China State Key Laboratory of Software Development Environment School of Computer Science and Engineering Beihang University Beijing100191 China Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University Beijing100191 China

In this paper, we study a distributed privacy-preserving learning problem in social networks with general topology. The agents can communicate with each other over the network, which may result in privacy disclosure, since the trustworthiness of the agents cannot be guaranteed. Given a set of options which yield unknown stochastic rewards, each agent is required to learn the best one, aiming at maximizing the resulting expected average cumulative reward. To serve the above goal, we propose a four-staged distributed algorithm which efficiently exploits the collaboration among the agents while preserving the local privacy for each of them. In particular, our algorithm proceeds iteratively, and in every round, each agent i) randomly perturbs its adoption for the privacy-preserving purpose, ii) disseminates the perturbed adoption over the social network in a nearly uniform manner through random walking, iii) selects an option by referring to the perturbed suggestions received from its peers, and iv) decides whether or not to adopt the selected option as preference according to its latest reward feedback. Through solid theoretical analysis, we quantify the trade-off among the number of agents (or communication overhead), privacy preserving and learning utility. We also perform extensive simulations to verify the efficacy of our proposed social learning algorithm. Copyright © 2020, The Authors. All rights reserved.

关键词： Iterative methods