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

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： Yuren You Yun Zhou Hongwu Yang Hui Wang Lijia Chen College of Physics and Electronic Engineering Northwest Normal University Lanzhou China Northwest Normal University Lanzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

This paper proposes a speech synthesis method in Shanghai dialect based on deep learning. We firstly build a Shanghai dialect speech corpus for model training. At the same time, we realize a text analyzer for obtaining context-dependent information of Shanghai dialect from Chinese sentence. Finally, we adopt both deep neural networks (DNN)-based method and long short term memory networks-recurrent neural networks (LSTM-RNN) to realize the speech synthesis of Shanghai dialect. Subjective and objective experimental results show that the proposed method can synthesize the Shanghai dialect speech with better voice quality. The speeches synthesized by the LSTM-RNN-based method have better voice quality than that of the DNN-based method.

关键词： Handheld computers Physics Speech synthesis distributed processing Big Data Cloud computing Social computing

来源：评论

学校读者我要写书评

暂无评论

DDoS Flooding Attack Detection Based on Joint-entropy with Multiple Traffic Features 17

DDoS Flooding Attack Detection Based on Joint-entropy with M...

引用

17th IEEE international conference on Trust, Security and Privacy in computing and Communications (IEEE TrustCom) / 12th IEEE international conference on Big Data Science and Engineering (IEEE BigDataSE)

作者： Mao, Jiewen Deng, Weijun Shen, Fuke East China Normal Univ Dept Comp Sci & Technol Shanghai Peoples R China

ISBN: (纸本)9781538643877

distributed Denial of Service (DDoS) attacks are still considered as severe threats to the Internet. Previous works have used information entropy to detect DDoS flooding attacks. However, these methods usually only used source address as the feature of packets, and ignored other features. Besides, the entropy with single variable also has restricts in abnormal detection. In this paper, we propose a new joint-entropy-based DDoS detection solution with multiple features of packets. We choose flow duration, packet length, source address and destination port as the key features to detect different types of DDoS flooding attacks. We carry out the experiments with simulated campus network based on Software-defined networking (SDN) architecture. The results show that our proposed method can effectively detect attacks of both forged and non-forged source address, and outperforms the previous single-entropy methods in terms of accuracy and false positive rate.

关键词： DDoS Detection Joint-entropy Flow duration Software-defined networking

来源：评论

学校读者我要写书评

暂无评论

A distributed Control System for Software Defined Wireless Sensor Networks Through Containerisation

A Distributed Control System for Software Defined Wireless S...

引用

international Multidisciplinary Information Technology and Engineering conference (IMITEC)

作者： Hlabishi I. Kobo Adnan M. Abu-Mahfouz Council for Scientific and Industrial Research Next Generation Enterprises and Institutions Pretoria South Africa Tshwane University of Technology Pretoria South Africa

ISBN: (数字)9781728100401

ISBN: (纸本)9781728100418

Software-Defined networking and Network Function Virtualisation are gaining much prominence in the technological space. Major technologies are built on their principles. As their impact permeates, many architectural designs in networking, computing and storage have to be rethought because this affects the conventional way of running and deploying applications. The urge to save costs in this rapidly changing technological era, have operators continually searching for better methods. This paper extends the work previously conducted on Fragmentation-based distributed control system for Software-Defined Wireless Sensor Networks (SDWSN). The system entails a two-level architecture comprising local controllers and a global controller to overcome the geographical space between the infrastructure elements and the controller. This was in response for a better control system for SDWSNs, given their distinct nature. The paper explores different methods of infrastructure deployment for this model, contrasting virtual machines (VMs) and containers. The design of the Fragmentation model is such that the local controllers are lean and inexpensive. The evaluation shows that software containers are faster and more efficient as compared to the VMs and the infrastructure deployment method do contribute to the efficiency of the model.

关键词： Containers Sensors Decentralized control Software Wireless sensor networks Business Security

来源：评论

学校读者我要写书评

暂无评论

Perishable Digital Goods Trading Mechanism for Blockchain- Based Vehicular Network

Perishable Digital Goods Trading Mechanism for Blockchain- B...

引用

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： Rui Xi Kang Liu Shuo Liu Wuhui Chen Shenghui Li School of Data and Computer Science Sun Yat-sen University Guangzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Recently, Internet of Vehicles (IoV) equipped with autopilot technology show much concern in their quality of service (QoS), especially in how to ensure the quality of crowdsourcing data for QoS. It is an open issue to encourage high-quality data to be sold as digital goods. Although existing works manage to design incentive mechanisms in data trading for IoV, they fail to address the trust problem. The blockchain technology has been widely studied to establish trust among participants, however, little is currently known about the perishability in the data market, which leads to the failure in explaining the price difference of digital goods. In this paper, we propose a perishability-oriented pricing mechanism to support perishable digital goods trading among IoVs. We also introduce consortium blockchain that provides distributed hyper ledger to address the trust issue in the market. By employing Stackelberg game theory, we obtain the optimal response of selfish users and providers. And finally, we propose a distributed algorithm to simulate our mechanism. Our experiment results demonstrate the efficiency of our distributed algorithm and prove the correctness and consistency of our mechanism.

关键词： Blockchain Servers Pricing distributed databases Sensors Roads Computer science

来源：评论

学校读者我要写书评

暂无评论

The Complexity of Leader Election: A Chasm at Diameter Two 18

The Complexity of Leader Election: A Chasm at Diameter Two

引用

19th international conference on distributed computing and networking (ICDCN)

作者： Chatterjee, Soumyottam Pandurangan, Gopal Robinson, Peter Univ Houston Dept Comp Sci Houston TX 77204 USA Royal Holloway Univ London Dept Comp Sci Egham Surrey England

ISBN: (纸本)9781450363723

Leader election is one of the fundamental problems in distributed computing. In its implicit version, only the leader must know who is the elected leader. This paper focuses on studying the message complexity of leader election in synchronous distributed networks, in particular, in networks of diameter two. Kutten et al. [JACM 2015] showed a fundamental lower bound of Omega (m) (m is the number of edges in the network) on the message complexity of (implicit) leader election that applied also to Monte Carlo randomized algorithms with constant success probability;this lower bound applies for graphs that have diameter at least three. On the other hand, for complete graphs (i.e., diameter 1), Kutten et al. [TCS 2015] established a tight bound of (Theta) over tilde(root n)(1) on the message complexity of randomized leader election (n is the number of nodes in the network). For graphs of diameter two, the complexity was not known. In this paper, we settle this complexity by showing a tight bound of (Theta) over tilde (n) on the message complexity of leader election in diameter two networks. We first give a simple randomized Monte-Carlo leader election algorithm that with high probability (i.e., probability at least 1 - n(-c), for some positive constant c) succeeds and uses O (n log(3) n) messages and runs in O(1) rounds;this algorithm works without knowledge of n (and hence needs no global knowledge). We then show that any algorithm (even Monte Carlo randomized algorithms with large enough constant success probability) needs Omega(n) messages (even when n is known), regardless of the number of rounds. We also present an O(n log n) messages deterministic algorithm that takes O(log n) rounds (but needs knowledge of n);we show that this message complexity is tight for deterministic algorithms. Our results show that leader election can be solved in diameter two graphs in (essentially) linear (in n) message complexity and thus the Omega(m) lower bound does not apply to diamete

关键词： distributed Algorithm Leader Election Randomized Algorithm Message Complexity Time Complexity Lower Bounds

来源：评论

学校读者我要写书评

暂无评论

Metropolis-Hastings Random Walk with a Reduced Number of Self-Loops

Metropolis-Hastings Random Walk with a Reduced Number of Sel...

引用

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： Toshiki Matsumura Kazuyuki Shudo Tokyo Institute of Technology

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

The random walk (RW) is one of the effective sampling methods for large-scale networks such as the Internet and social networks. While a simple RW method tends to visit nodes with high degrees, the Metropolis-Hastings random walk (MHRW) algorithm has ready-to-use characteristics, wherein the nodes visited by the algorithm distribute uniformly. However, because the MHRW algorithm conducts many self-looping operations and the spread of its crawler is slow, it requires many samples in order to secure sufficient accuracy. This study proposes a RW that requires less self-looping than MHRW did while maintaining the ready-to-use characteristics. The ready-to-use characteristics are achieved by appropriately changing the adaption probability of MHRW and choice probability of neighboring nodes. Our experiments demonstrated that the proposed RW required less self-loop operations than MHRW did. Moreover, the cost of the proposed algorithm is discussed keeping applications to real networks in mind.

关键词： Sampling methods Social networking (online) Estimation Approximation algorithms Security Privacy Markov processes

来源：评论

学校读者我要写书评

暂无评论

The Influence of Bandit-Based User Openness Feature on Recommendation Diversity and Accuracy

The Influence of Bandit-Based User Openness Feature on Recom...

引用

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： YuXiang Lin Shaozhen Ye College of Mathematics and Computer Science Fuzhou University Fuzhou China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Collaborative filtering algorithms have obvious advantages in recommendation accuracy, and Bandit's algorithm is a strategy to address diversity needs. The COFIBA algorithm combines the collaborative filtering algorithm with the Bandit algorithm to provide a solution for recommending the balance of diversity and accuracy. However, COFIBA does not consider the influence of time characteristics, and COFIBA is a cumulative regret. It is relatively slow to solve the problem of diversity. Therefore, this paper proposes a learning-based model. On the one hand, it introduces the openness characteristics of users to achieve diversity recommendation, and relies on the "exploration-feedback-update" strategy to adjust the user's openness. At the same time, the time factor is incorporated into the COFIBA algorithm as a feature, and the change of user interest with time is analyzed to ensure the accuracy of recommendation. The experimental results show that the combination algorithm with time and open features has a significant improvement in the diversity and accuracy of the results compared with the COFIBA algorithm.

关键词： Diversity reception Cultural differences Clustering algorithms Mathematical model Social networking (online) Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

Rumor Spreading with Cross Propagation in Multilayer Social Networks

Rumor Spreading with Cross Propagation in Multilayer Social ...

引用

IEEE international conference on Big Data and Cloud computing (BdCloud)

作者： Qiyi Han Musong Gu Lei You Fang Miao School of Information Science and Engineering Chengdu University No. 2025 Avenue been Chengdu Sichuan People’s Republic of China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

Social networks have achieved great success by making social interaction online. Malicious users, whereas, make use of social networks to spread rumors. Recent researches manifest that the union of social applications can reach better efficiency. Unfortunately, novel security threats are emerging when malicious users take advantage of this opportunity to spread rumors from a single social network to multilayer networks. In this paper, concerning the cross propagation in the multilayer social networks, the S2IR2 model is therefore proposed to analyze the rumor spreading. The rumor spreading process is molded by mean-field equations. With the simulations of various parameters, the numerical results give the performances of propagation speed and range. For restraining the rumor spreading, the security strategies are concluded.

关键词： Social networking (online) Nonhomogeneous media Numerical models Mathematical model Security Analytical models Computational modeling

来源：评论

学校读者我要写书评

暂无评论

On High Availability distributed Control Plane for Software-Defined Networks

On High Availability Distributed Control Plane for Software-...

引用

international Scientific and Technical conference on Modern Computer Network Technologies (MoNeTeC)

作者： Pashkov, V. Smeliansky, R. Lomonosov Moscow State Univ Appl Res Ctr Comp Networks Moscow Russia

ISBN: (纸本)9781538694565

The architecture and organization of the high availability distributed control plane for SDN/OpenFlow networks are considered. High availability is achieved by redundancy of controller instances, active switch-controller communications, computing resources and tools for a controller instance failure and overloading detection and recovery. The proactive backup controller allocation algorithm which allows to minimize the time to repair in the case of a single controller instance failure is discussed. The algorithm for controllers' load-balancing allows dynamically reconfigure the control plane with a minimum number of switch control transfer operations to avoid controller instance overloading. The initial experimental results of the proposed algorithms for the HA distributed SDN control plane are described.

关键词： Software-Defined networking (SDN) distributed Control Plane (DCP) High Availability (HA) Load-Balancing OpenFlow Data Plane (DP) Network Architecture

来源：评论

学校读者我要写书评

暂无评论

Randomized k-set agreement in crash-prone and Byzantine asynchronous systems

引用

THEORETICAL COMPUTER SCIENCE 2018年 709卷 80-97页

作者： Mostefaoui, Achour Moumen, Hamouma Raynal, Michel Univ Nantes LINA F-44322 Nantes France Univ Batna Batna Algeria Inst Univ France Paris France Univ Rennes IRISA F-35042 Rennes France

k-Set agreement is a central problem of fault-tolerant distributed computing. Considering a set of n processes, where up to t may commit failures, let us assume that each process proposes a value. The problem consists in defining an algorithm such that each non-faulty process decides a value, at most k different values are decided, and the decided values satisfy some context-depending validity condition. Algorithms solving k-set agreement in synchronous message-passing systems have been proposed for different failure models (mainly process crashes, and process Byzantine failures). Differently, k-set agreement cannot be solved in failure-prone asynchronous message-passing systems when t > k. To circumvent this impossibility an asynchronous system must be enriched with additional computational power. Assuming t > k, this paper presents two distributed algorithms that solve k-set agreement in asynchronous message-passing systems where up to t processes may commit crash failures (first algorithm) or more severe Byzantine failures (second algorithm). To circumvent k-set agreement impossibility, this article considers that the underlying system is enriched with the computability power provided by randomization. Interestingly, the algorithm that copes with Byzantine failures is signature-free, and ensures that no value proposed only by Byzantine processes can be decided by a non-faulty process. Both algorithms share basic design principles. (C) 2017 Elsevier B.V. All rights reserved.

关键词： Asynchronous system Broadcast abstraction Byzantine process Coin Crash failure distributed algorithm k-Set agreement Message-passing system Randomized algorithm Signature-free algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：