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

27th international Heterogeneity in computing Workshop in conjunction with 32nd IEEE international Parallel and distributed Processing symposium (IPDPS)

作者： Ahrens, Willow Xu, Helen Schiefer, Nicholas MIT Comp Sci & Artificial Intelligence Lab 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781538643686

Many sparse matrices and tensors from a variety of applications, such as finite element methods and computational chemistry, have a natural aligned rectangular nonzero block structure. Researchers have designed high-performance blocked sparse operations which can take advantage of this sparsity structure to reduce the complexity of storing the locations of nonzeros. The performance of a blocked sparse operation depends on how well the block size reflects the structure of nonzeros in the tensor. Sparse tensor structure is generally unknown until runtime, so block size selection must be efficient. The fill is a quantity which, for some block size, relates the number of nonzero blocks to the number of nonzeros. Many performance models use the fill to help choose a block size. However, the fill is expensive to compute exactly. We present a sampling-based algorithm called PHIL to estimate the fill of sparse matrices and tensors in any format. We provide theoretical guarantees for sparse matrices and tensors, and experimental results for matrices. The existing state-of-the-art fill estimation algorithm, which we will call OSKI, runs in time linear in the number of elements in the tensor. The number of samples PHIL needs to compute a fill estimate is unrelated to the number of nonzeros and depends only on the order (number of dimensions) of the tensor, desired accuracy of the estimate, desired probability of achieving this accuracy, and number of considered block sizes. We compare PHIL and OSKI on a suite of 42 matrices. On most inputs, PHIL estimates the fill at least 2 times faster and often more than 20 times faster than OSKI. PHIL consistently produced accurate estimates-in all cases that we tested PHIL was faster and/or more accurate than OSKI. Finally, we find that PHIL and OSKI produce comparable speedups in multicore blocked sparse matrix-vector multiplication (SpMV) when the block size was chosen using fill estimates in a model due to Vuduc et al.

关键词： Fill Estimation Sparse Matrix Sparse Tensor Block Sparse Block Size Selection Randomized Algorithm Sampling Algorithm Autotuning Performance engineering Performance Model Numerical Linear Algebra Phil

来源：评论

学校读者我要写书评

暂无评论

Analysis on the Location of Community Library Based on Nationwide Reading 16

Analysis on the Location of Community Library Based on Natio...

引用

16th international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Wan Bo Chen, Qin Zhang Jin-ru Jianghan Univ Business Coll Wuhan Hubei Peoples R China Jianghan Univ Coll Arts & Sci Wuhan Hubei Peoples R China

ISBN: (纸本)9781538621622

The scientific planning and reasonable layout of the community library has important practical significance for the realization of the nationwide reading. From the point of view of quantitative analysis, we propose community library location model based on the subsection utility function, which not only takes the traffic factors into account, but also considers the environmental factors. We obtain exact solution of the problem with LINGO software, and discuss the relationship between the number of constraints and the value of the objective function, as well as the coverage radius. The research results have reference value to the planning and layout of community library.

关键词： facility location community library nationwide reading utility function

来源：评论

学校读者我要写书评

暂无评论

Semi-Static ON/OFF Switching Schemes for Energy Efficient Phantom Cellular Networks

Semi-Static ON/OFF Switching Schemes for Energy Efficient Ph...

引用

IEEE international symposium on Parallel and distributed Processing with applications and IEEE international Conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Natasha Niaz Rizwan Ahmad Waqas Ahmed Shahryar Saleem Liang Zhao National University of Sciences and Technology (NUST) Islamabad Pakistan Pakistan Institute of Engineering and Applied Sciences Islamabad Pakistan Department of Electrical and Computer Engineering Air University Islamabad Pakistan School of Computer Science Shenyang Aerospace University China

ISBN: (纸本)9781728152103

Phantom cellular networks are the key enabling technology that can increase the capacity of cellular networks by adding a new data plane to an existing macro cell control plane. In this paper, performance of Energy Harvesting (EH) enabled phantom cells operating under a macro cell is analyzed in terms of sum capacity and energy efficiency (EE). The Phantom Base Stations (PBSs) provide capacity gains by offloading users from Macro Base Station (MBS). However, due to the reuse of the same resource blocks by all PBSs, co-channel interference exists between PBSs, which limits the capacity gains. Furthermore, an excessive amount of energy is consumed by the PBSs to overcome this co-channel interference. To minimize the above mentioned capacity limiting problem of co-channel interference and energy consumption, semi-static ON/OFF switching schemes are evaluated. Interference Aware (IA) and Traffic Aware (TA) ON/OFF switching schemes are compared with Random ON/OFF and macro cell only schemes. Simulation results show that when the numbers of offloaded users are high, the TA scheme performs better in terms of capacity, with energy savings up to 90%. For both the IA and TA switching schemes, the gains are dependent on user distribution within the network.

关键词： cellular radio channel capacity cochannel interference energy conservation energy harvesting phantoms resource allocation telecommunication power management telecommunication switching telecommunication traffic Cochannel interference Imaging Phantom telecommunication switching cellular radio energy harvesting telecommunication traffic Channel capacity Paranormal phenomena macrocells Scheme Energy conservation Cellular networks Resource utilization paper performance TEST AUTHORIZATIONS

来源：评论

学校读者我要写书评

暂无评论

The Busier We Are, the More We Buy: the Role of Time Pressure in Mobile Shopping 16

The Busier We Are, the More We Buy: the Role of Time Pressur...

引用

16th international symposium on distributed computing and applications to business, engineering and science (DCABES)

作者： Gong Feng Liu Mengwei Hubei Univ Econ & Management Dept Zhixing Coll Wuhan Hubei Peoples R China Zhongnan Univ Econ & Law Mkt Sch Business Adm Wuhan Hubei Peoples R China

ISBN: (纸本)9781538621622

Mobile shopping is defined as "the use of the wireless Internet service for shopping activities via a mobile device." Based on TAM (Technology Acceptance Model) and CRT (Cognitive Resource Theory), this study investigated how time pressure influenced consumers' mobile shopping intention. It was found that (1) time pressure positively affects mobile shopping intention, (2) access convenience, search convenience and transaction convenience mediates the influence of time pressure on mobile shopping intention, (3) the mediating effect of post-purchase convenience on the relationship between time pressure and mobile shopping intention is not significant. Several theoretical and managerial implications are derived from these findings.

关键词： time pressure perceived convenience mobile shopping

来源：评论

学校读者我要写书评

暂无评论

SELWasm: A Code Protection Mechanism for WebAssembly

SELWasm: A Code Protection Mechanism for WebAssembly

引用

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

作者： Jian Sun DingYuan Cao XiMing Liu ZiYi Zhao WenWen Wang XiaoLi Gong Jin Zhang College of Computer Science Nankai University Tianjin China College of Cyber Science Nankai University Tianjin China Department of Computer Science University of Georgia Athens GA USA Tianjin Key Laboratory of Network and Data Security Technology Tianjin China

ISBN: (数字)9781728143286

ISBN: (纸本)9781728143293

WebAssembly is a novel front-end programming technology that has been wildly supported by most web browsers. The high-level language can be compiled into WebAssembly binary code, and executed by the browser at almost native speed. With the help of WebAssembly, the complex business logic and algorithms can be integrated into the webpage and migrate the computation overhead to the browsers. However, due to the limit of browsers, it is very difficult for developers to ensure that the intellectual property embedded in the front-end code is well protected. Even though the WebAssembly code is a compiler-generated binary file, it is easy to obtain it from the website for reuse or reverse engineering. This paper proposed a new framework, SELWasm, to protect the WebAssembly code. In the framework, three major mechanisms are provided. The Environment Self-checking mechanism can protect the source code from illegally reusing by any unauthorized website. The Encryption&Decryption mechanism can protect the WebAssembly code from being distributed as plaintext. The Lazy-loading mechanism can improve the performance of page loading, mitigate the overhead introduced by the previous mechanisms. Comprehensive experiments are conducted to measure the effectiveness and efficiency of SELWasm. The results show that the behaviors considered from web attackers can be resisted and the overhead involved is negligible.

关键词： Browsers Encryption Servers Runtime Intellectual property Loading

来源：评论

学校读者我要写书评

暂无评论

Fog computing for Industrial applications

引用

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS 2018年第10期14卷 4481-4486页

作者： Shu, Lei Hancke, Gerhard P. Deng, Der-Jiunn Zhu, Chunsheng Mukherjee, Mithun Nanjing Agr Univ Nanjing 210095 Jiangsu Peoples R China Univ Lincoln Lincoln LN6 7TS England Univ Pretoria ZA-0084 Pretoria South Africa Natl Changhua Univ Educ Changhua 50007 Taiwan Univ British Columbia Vancouver BC V6T 1Z4 Canada Guangdong Univ Petrochem Technol Maoming Guangdong Prov Key Lab Petrochem Equipment Fault Maoming 525000 Peoples R China

The papers in this special section examine the use of fog computing applications in industrial electronics. Due to the increased number of connected things in industrial applications, the growing volume and velocity of Internet of Things (IoTs) data exchange urge for more and more communication resources, leading to the bottleneck in terms of data processing, data latency, and traffic overhead. Fog computing emerges as an alternative for traditional cloud computing to support geographically distributed, latency-sensitive, and QoS-aware IoT applications while reducing the burden of data centers in traditional cloud computing. In particular, fog computing with the features (e.g., low latency, location awareness, and capacity of processing large number of nodes with wireless access) to support heterogeneity and real-time applications is an attractive solution to delay- and resource-constraint large-scale industrial applications. However, with the benefits of fog computing, the research challenges arise regarding fog computing for industrial applications.

关键词： Special issues and sections Edge computing Cloud computing Resource management Task analysis Job shop scheduling

来源：评论

学校读者我要写书评

暂无评论

Detecting cliques in congest networks 32

Detecting cliques in congest networks

引用

32nd international symposium on distributed computing, DISC 2018

作者： Czumaj, Artur Konrad, Christian University of Warwick United Kingdom Department of Computer Science University of Bristol United Kingdom

ISBN: (纸本)9783959770927

The problem of detecting network structures plays a central role in distributed computing. One of the fundamental problems studied in this area is to determine whether for a given graph H, the input network contains a subgraph isomorphic to H or not. We investigate this problem for H being a clique K` in the classical distributed CONGEST model, where the communication topology is the same as the topology of the underlying network, and with limited communication bandwidth on the links. Our first and main result is a lower bound, showing that detecting K` requires Ω(n/b) communication rounds, for every 4 ≤ ` ≤ n, and Ω(n/(`b)) rounds for every ` ≥ n, where b is the bandwidth of the communication links. This result is obtained by using a reduction to the set disjointness problem in the framework of two-party communication complexity. We complement our lower bound with a two-party communication protocol for listing all cliques in the input graph, which up to constant factors communicates the same number of bits as our lower bound for K4 detection. This demonstrates that our lower bound cannot be improved using the two-party communication framework. © Artur Czumaj and Christian Konrad.

关键词： distributed computer systems

来源：评论

学校读者我要写书评

暂无评论

Efficient CQI Estimation for Synchronized ABS Configuration in HetNet

Efficient CQI Estimation for Synchronized ABS Configuration ...

引用

IEEE international symposium on Parallel and distributed Processing with applications and IEEE international Conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Yupeng Wang Junyan Kang Lening Wang College of Electronic and Information Engineering Shenyang Aerospace University Shenyang China FLIGHT INSPECTION CENTER OF CAAC Beijing China

ISBN: (纸本)9781728152103

In Heterogeneous Networks (HetNets), User Equipments(UEs) in pico cells may suffer from significant co-channel interference from macro stations. The 3rd Generation Partnership Project (3GPP) organization has proposed the concept of Almost Blank Subframe (ABS) so as to reduce the interference of macro stations to pico UEs. Addressing the problem that the introduction of ABS makes it impossible for pico UEs to correctly obtain channel conditions on different subframes, this paper proposes an efficient scheme based on a variable parameter Lambda report and Lambda estimation to derive Channel Quality Indicator (CQI). The method is applicable to the ABS and non-Almost Blank Subframe (non-ABS). It compensates the non-restricted measured CQI with different offsets, based on ABS density and ratio of interference levels from macro cells and pico cells to obtain CQI on different subframes. Simulation and analytical results show that our proposed scheme can achieve approximately 59% gain over the 3GPP system and reduce report overhead significantly without inducing penalties on throughput.

关键词： 3G mobile communication cochannel interference picocellular radio wireless channels Cochannel interference wireless channels DDX41 gene Antilock Braking Systems ABS resins door bucks 3G mobile communication picocell macro commands order of interference 3GPP

来源：评论

学校读者我要写书评

暂无评论

Dynamic Beam Hopping for DVB-S2X Satellite: A Multi-Objective Deep Reinforcement Learning Approach

Dynamic Beam Hopping for DVB-S2X Satellite: A Multi-Objectiv...

引用

IEEE international symposium on Parallel and distributed Processing with applications and IEEE international Conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Yuchen Zhang Xin Hu Rong Chen Zhili Zhang Liquan Wang Weidong Wang School of Electronic Engineering Beijing University of Posts and Telecommunications Beijing China Group Corporation 54th Research Institute China Electronics Technology Beijing China

ISBN: (纸本)9781728152103

Dynamic Beam Hopping (DBH) is a crucial technology for adapting to the flexibility of different service configurations in the multi-beam satellite communications market. The conventional beam hopping method, which ignores the intrinsic correlation between decisions, only obtains the optimal solution at the current time, while deep reinforcement learning (DRL) is a typical algorithm for solving sequential decision problems. Therefore, to deal with the DBH problem in the scenario of Differentiated Services (DIFFSERV), this paper designs a multiobjective deep reinforcement learning (MO-DRL) algorithm. Besides, as the demand for the number of beams increases, the complexity of system implementation increase significantly. This paper innovatively proposes a time division multi-action selectionmethod(TD-MASM) tosolvethecurseofdimensionality problem. Under the real condition, the MO-DRL algorithm with the low complexity can ensure the fairness of each cell, improve the throughput to about 5540Mbps, and reduce the delay to about 0.367ms. The simulation results show that when the GA is used to achieve similar effects, the complexity of GA is about 110 times that of the MO-DRL algorithm.

关键词： DiffServ networks digital video broadcasting learning (artificial intelligence) optimisation satellite communication telecommunication computing differentiated network service Satellite communication digital video broadcasting telecommunication computing learning (artificial intelligence) Beams and girders Learning Gallium system implementation Time division

来源：评论

学校读者我要写书评

暂无评论

LSTM Based Network Flow Forecasting in High-Speed Railway Data Network

LSTM Based Network Flow Forecasting in High-Speed Railway Da...

引用

IEEE international symposium on Parallel and distributed Processing with applications and IEEE international Conference on Ubiquitous computing and Communications (ISPA/IUCC)

作者： Yang Zhou Qiang Sun Xiaodong Chen School of Electronic and Information Engineering Beijing Jiaotong University Beijing China

ISBN: (纸本)9781728152103

Network flow forecasting is the basis of network performance analysis and bandwidth allocation. It is of great significance for routing path selection in network service establishment process. The accurate flow forecasting can effectively reduce the service blocking probability. Different forecasting models based on recurrent neural network (RNN) have got extensive attention recently. However, there is relatively less research focusing on network flow forecasting, which is an essential part of future network management. In this paper, we utilize long short term memory (LSTM) model to forecast network flow tendency. To avoid overfitting issue, dropout method is introduced into LSTM. The flow information is collected from High-Speed Railway data network and preprocessed to obtain time-flow series. Two time-flow series are used to verify the network flow forecasting accuracy. Experiments show that the LSTM model can provide accurate forecasting results. The median MAPE of two series forecasting are 0.014 and 0.043, respectively. A shuffled data is used to train the LSTM model too, and corresponding forecasting results indicate that the model has a good generalization ability and it can be applied in different networks.

关键词： bandwidth allocation probability railway communication recurrent neural nets telecommunication computing telecommunication network management telecommunication network routing time series recurrent neural nets bandwidth allocation telecommunication computing Telecommunication network management network flow telecommunication network routing railway communication Probability DADANET Time series high-speed railway

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：